b09014a7b6
Since the decision was made to also add that Linux-4.5 support (was only in this newlib branch) to our master branch, a tweak to newlib's top is necessary. In order to share the rcfile between them, any fields unique to a branch must appear last in it's list of enumerators. And the troublesome field in question above is CGNAME. It doesn't matter if a unique field is on or off, only that it, as a higher enum/char, appear after all other shared fields. Otherwise one risks the 'corrupt' error message from the top without that field or the display of the wrong column in the top with that unique field. [ and strictly speaking, the changes under top_nls.c ] [ were technically not really necessary. however, we ] [ choose to maintain strict ordering via enum value. ] Signed-off-by: Jim Warner <james.warner@comcast.net>
5240 lines
187 KiB
C
5240 lines
187 KiB
C
/* top.c - Source file: show Linux processes */
|
||
/*
|
||
* Copyright (c) 2002-2015, by: James C. Warner
|
||
* All rights reserved. 8921 Hilloway Road
|
||
* Eden Prairie, Minnesota 55347 USA
|
||
*
|
||
* This file may be used subject to the terms and conditions of the
|
||
* GNU Library General Public License Version 2, or any later version
|
||
* at your option, as published by the Free Software Foundation.
|
||
* This program is distributed in the hope that it will be useful,
|
||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
* GNU Library General Public License for more details.
|
||
*/
|
||
/* For contributions to this program, the author wishes to thank:
|
||
* Craig Small, <csmall@small.dropbear.id.au>
|
||
* Albert D. Cahalan, <albert@users.sf.net>
|
||
* Sami Kerola, <kerolasa@iki.fi>
|
||
*/
|
||
|
||
#include <ctype.h>
|
||
#include <curses.h>
|
||
#include <errno.h>
|
||
#include <fcntl.h>
|
||
#include <float.h>
|
||
#include <limits.h>
|
||
#include <pwd.h>
|
||
#include <signal.h>
|
||
#include <stdarg.h>
|
||
#include <stdio.h>
|
||
#include <stdlib.h>
|
||
#include <string.h>
|
||
#include <term.h> // foul sob, defines all sorts of stuff...
|
||
#undef tab
|
||
#undef TTY
|
||
#include <termios.h>
|
||
#include <time.h>
|
||
#include <unistd.h>
|
||
|
||
#include <sys/ioctl.h>
|
||
#include <sys/resource.h>
|
||
#include <sys/select.h> // also available via <sys/types.h>
|
||
#include <sys/time.h>
|
||
#include <sys/types.h> // also available via <stdlib.h>
|
||
|
||
#include "../include/fileutils.h"
|
||
#include "../include/signals.h"
|
||
#include "../include/nls.h"
|
||
|
||
#include <proc/procps.h>
|
||
|
||
#include "top.h"
|
||
#include "top_nls.h"
|
||
|
||
|
||
/*###### Miscellaneous global stuff ####################################*/
|
||
|
||
/* The original and new terminal definitions
|
||
(only set when not in 'Batch' mode) */
|
||
static struct termios Tty_original, // our inherited terminal definition
|
||
#ifdef TERMIOS_ONLY
|
||
Tty_tweaked, // for interactive 'line' input
|
||
#endif
|
||
Tty_raw; // for unsolicited input
|
||
static int Ttychanged = 0;
|
||
|
||
/* Last established cursor state/shape */
|
||
static const char *Cursor_state = "";
|
||
|
||
/* Program name used in error messages and local 'rc' file name */
|
||
static char *Myname;
|
||
|
||
/* Our constant sigset, so we need initialize it but once */
|
||
static sigset_t Sigwinch_set;
|
||
|
||
/* The 'local' config file support */
|
||
static char Rc_name [OURPATHSZ];
|
||
static RCF_t Rc = DEF_RCFILE;
|
||
static int Rc_questions;
|
||
|
||
/* SMP, Irix/Solaris mode, Linux 2.5.xx support (and beyond) */
|
||
static long Hertz;
|
||
static int Cpu_cnt;
|
||
static float Cpu_pmax;
|
||
static const char *Cpu_States_fmts;
|
||
|
||
/* Specific process id monitoring support */
|
||
static unsigned Monpids [MONPIDMAX] = { 0 };
|
||
static int Monpidsidx = 0;
|
||
|
||
/* Current screen dimensions.
|
||
note: the number of processes displayed is tracked on a per window
|
||
basis (see the WIN_t). Max_lines is the total number of
|
||
screen rows after deducting summary information overhead. */
|
||
/* Current terminal screen size. */
|
||
static int Screen_cols, Screen_rows, Max_lines;
|
||
|
||
/* This is really the number of lines needed to display the summary
|
||
information (0 - nn), but is used as the relative row where we
|
||
stick the cursor between frames. */
|
||
static int Msg_row;
|
||
|
||
/* The nearly complete scroll coordinates message for the current
|
||
window, built at the time column headers are constructed */
|
||
static char Scroll_fmts [SMLBUFSIZ];
|
||
|
||
/* Global/Non-windows mode stuff that is NOT persistent */
|
||
static int Batch = 0, // batch mode, collect no input, dumb output
|
||
Loops = -1, // number of iterations, -1 loops forever
|
||
Secure_mode = 0, // set if some functionality restricted
|
||
Width_mode = 0, // set w/ 'w' - potential output override
|
||
Thread_mode = 0; // set w/ 'H' - show threads vs. tasks
|
||
|
||
/* Unchangeable cap's stuff built just once (if at all) and
|
||
thus NOT saved in a WIN_t's RCW_t. To accommodate 'Batch'
|
||
mode, they begin life as empty strings so the overlying
|
||
logic need not change ! */
|
||
static char Cap_clr_eol [CAPBUFSIZ] = "", // global and/or static vars
|
||
Cap_nl_clreos [CAPBUFSIZ] = "", // are initialized to zeros!
|
||
Cap_clr_scr [CAPBUFSIZ] = "", // the assignments used here
|
||
Cap_curs_norm [CAPBUFSIZ] = "", // cost nothing but DO serve
|
||
Cap_curs_huge [CAPBUFSIZ] = "", // to remind people of those
|
||
Cap_curs_hide [CAPBUFSIZ] = "", // batch requirements!
|
||
Cap_clr_eos [CAPBUFSIZ] = "",
|
||
Cap_home [CAPBUFSIZ] = "",
|
||
Cap_norm [CAPBUFSIZ] = "",
|
||
Cap_reverse [CAPBUFSIZ] = "",
|
||
Caps_off [CAPBUFSIZ] = "",
|
||
Caps_endline [CAPBUFSIZ] = "";
|
||
#ifndef RMAN_IGNORED
|
||
static char Cap_rmam [CAPBUFSIZ] = "",
|
||
Cap_smam [CAPBUFSIZ] = "";
|
||
/* set to 1 if writing to the last column would be troublesome
|
||
(we don't distinguish the lowermost row from the other rows) */
|
||
static int Cap_avoid_eol = 0;
|
||
#endif
|
||
static int Cap_can_goto = 0;
|
||
|
||
/* Some optimization stuff, to reduce output demands...
|
||
The Pseudo_ guys are managed by adj_geometry and frame_make. They
|
||
are exploited in a macro and represent 90% of our optimization.
|
||
The Stdout_buf is transparent to our code and regardless of whose
|
||
buffer is used, stdout is flushed at frame end or if interactive. */
|
||
static char *Pseudo_screen;
|
||
static int Pseudo_row = PROC_XTRA;
|
||
static size_t Pseudo_size;
|
||
#ifndef OFF_STDIOLBF
|
||
// less than stdout's normal buffer but with luck mostly '\n' anyway
|
||
static char Stdout_buf[2048];
|
||
#endif
|
||
|
||
/* Our four WIN_t's, and which of those is considered the 'current'
|
||
window (ie. which window is associated with any summ info displayed
|
||
and to which window commands are directed) */
|
||
static WIN_t Winstk [GROUPSMAX];
|
||
static WIN_t *Curwin;
|
||
|
||
/* Frame oriented stuff that can't remain local to any 1 function
|
||
and/or that would be too cumbersome managed as parms,
|
||
and/or that are simply more efficiently handled as globals
|
||
[ 'Frames_...' (plural) stuff persists beyond 1 frame ]
|
||
[ or are used in response to async signals received ! ] */
|
||
static volatile int Frames_signal; // time to rebuild all column headers
|
||
static float Frame_etscale; // so we can '*' vs. '/' WHEN 'pcpu'
|
||
|
||
/* Support for automatically sized fixed-width column expansions.
|
||
* (hopefully, the macros help clarify/document our new 'feature') */
|
||
static int Autox_array [EU_MAXPFLGS],
|
||
Autox_found;
|
||
#define AUTOX_NO EU_MAXPFLGS
|
||
#define AUTOX_COL(f) if (EU_MAXPFLGS > f) Autox_array[f] = Autox_found = 1
|
||
#define AUTOX_MODE (0 > Rc.fixed_widest)
|
||
|
||
/* Support for scale_mem and scale_num (to avoid duplication. */
|
||
#ifdef CASEUP_SUFIX // nls_maybe
|
||
static char Scaled_sfxtab[] = { 'K', 'M', 'G', 'T', 'P', 'E', 0 };
|
||
#else // nls_maybe
|
||
static char Scaled_sfxtab[] = { 'k', 'm', 'g', 't', 'p', 'e', 0 };
|
||
#endif
|
||
|
||
/* Support for NUMA Node display plus node expansion and targeting */
|
||
#ifndef OFF_STDERROR
|
||
static int Stderr_save = -1;
|
||
#endif
|
||
static int Numa_node_tot;
|
||
static int Numa_node_sel = -1;
|
||
|
||
/* Support for Graphing of the View_STATES ('t') and View_MEMORY ('m')
|
||
commands -- which are now both 4-way toggles */
|
||
#define GRAPH_prefix 25 // beginning text + opening '['
|
||
#define GRAPH_actual 100 // the actual bars or blocks
|
||
#define GRAPH_suffix 2 // ending ']' + trailing space
|
||
static float Graph_adj; // bars/blocks scaling factor
|
||
static int Graph_len; // scaled length (<= GRAPH_actual)
|
||
static const char Graph_blks[] = " ";
|
||
static const char Graph_bars[] = "||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||";
|
||
|
||
/* Support for the new library API -- acquired (if necessary)
|
||
at program startup and referenced throughout our lifetime. */
|
||
// --- <proc/meminfo.h> -----------------------------------------------
|
||
static struct procps_meminfo *Mem_ctx;
|
||
static struct meminfo_stack *Mem_stack;
|
||
static enum meminfo_item Mem_items[] = {
|
||
PROCPS_MEMINFO_MEM_FREE, PROCPS_MEMINFO_MEM_USED, PROCPS_MEMINFO_MEM_TOTAL,
|
||
PROCPS_MEMINFO_MEM_CACHED, PROCPS_MEMINFO_MEM_BUFFERS, PROCPS_MEMINFO_MEM_AVAILABLE,
|
||
PROCPS_MEMINFO_SWAP_TOTAL, PROCPS_MEMINFO_SWAP_FREE, PROCPS_MEMINFO_SWAP_USED };
|
||
enum Rel_memitems {
|
||
mem_FRE, mem_USE, mem_TOT, mem_QUE, mem_BUF, mem_AVL,
|
||
swp_TOT, swp_FRE, swp_USE };
|
||
// mem stack results extractor macro, where e=rel enum
|
||
#define MEM_VAL(e) PROCPS_MEMINFO_VAL(e, ul_int, Mem_stack)
|
||
// --- <proc/pids.h> --------------------------------------------------
|
||
static struct procps_pidsinfo *Pids_ctx;
|
||
static int Pids_itms_cur; // 'current' max (<= Fieldstab)
|
||
static enum pids_item *Pids_itms; // allocated as MAXTBL(Fieldstab)
|
||
static struct pids_fetch *Pids_read; // for reap or select
|
||
#define PIDSmaxt Pids_read->counts.total // just a little less wordy
|
||
// pid stack results extractor macro, where e=our EU enum, t=type, s=stack
|
||
// ( we'll exploit that <proc/pids.h> provided macro as much as possible )
|
||
// ( but many functions use their own unique tailored version for access )
|
||
#define PID_VAL(e,t,s) PROCPS_PIDS_VAL(Fieldstab[ e ].erel, t, s)
|
||
// --- <proc/stat.h> --------------------------------------------------
|
||
static struct procps_statinfo *Stat_ctx;
|
||
static struct stat_reaped *Stat_reap;
|
||
static enum stat_item Stat_items[] = {
|
||
PROCPS_STAT_TIC_ID, PROCPS_STAT_TIC_NUMA_NODE,
|
||
PROCPS_STAT_TIC_DELTA_USER, PROCPS_STAT_TIC_DELTA_SYSTEM,
|
||
PROCPS_STAT_TIC_DELTA_NICE, PROCPS_STAT_TIC_DELTA_IDLE,
|
||
PROCPS_STAT_TIC_DELTA_IOWAIT, PROCPS_STAT_TIC_DELTA_IRQ,
|
||
PROCPS_STAT_TIC_DELTA_SOFTIRQ, PROCPS_STAT_TIC_DELTA_STOLEN };
|
||
enum Rel_statitems {
|
||
stat_ID, stat_NU, stat_US, stat_SY, stat_NI,
|
||
stat_IL, stat_IO, stat_IR, stat_SI, stat_ST };
|
||
// cpu/node stack results extractor macro, where e=rel enum, t=type, x=index
|
||
#define SUM_VAL(e,t) PROCPS_STAT_VAL(e, t, Stat_reap->summary)
|
||
#define CPU_VAL(e,t,x) PROCPS_STAT_VAL(e, t, Stat_reap->cpus->stacks[x])
|
||
#define NOD_VAL(e,t,x) PROCPS_STAT_VAL(e, t, Stat_reap->nodes->stacks[x])
|
||
|
||
/*###### Tiny useful routine(s) ########################################*/
|
||
|
||
/*
|
||
* This routine simply formats whatever the caller wants and
|
||
* returns a pointer to the resulting 'const char' string... */
|
||
static const char *fmtmk (const char *fmts, ...) __attribute__((format(printf,1,2)));
|
||
static const char *fmtmk (const char *fmts, ...) {
|
||
static char buf[BIGBUFSIZ]; // with help stuff, our buffer
|
||
va_list va; // requirements now exceed 1k
|
||
|
||
va_start(va, fmts);
|
||
vsnprintf(buf, sizeof(buf), fmts, va);
|
||
va_end(va);
|
||
return (const char *)buf;
|
||
} // end: fmtmk
|
||
|
||
|
||
/*
|
||
* This guy is just our way of avoiding the overhead of the standard
|
||
* strcat function (should the caller choose to participate) */
|
||
static inline char *scat (char *dst, const char *src) {
|
||
while (*dst) dst++;
|
||
while ((*(dst++) = *(src++)));
|
||
return --dst;
|
||
} // end: scat
|
||
|
||
|
||
/*
|
||
* This guy just facilitates Batch and protects against dumb ttys
|
||
* -- we'd 'inline' him but he's only called twice per frame,
|
||
* yet used in many other locations. */
|
||
static const char *tg2 (int x, int y) {
|
||
// it's entirely possible we're trying for an invalid row...
|
||
return Cap_can_goto ? tgoto(cursor_address, x, y) : "";
|
||
} // end: tg2
|
||
|
||
/*###### Exit/Interrput routines #######################################*/
|
||
|
||
/*
|
||
* Reset the tty, if necessary */
|
||
static void at_eoj (void) {
|
||
if (Ttychanged) {
|
||
tcsetattr(STDIN_FILENO, TCSAFLUSH, &Tty_original);
|
||
if (keypad_local) putp(keypad_local);
|
||
putp(tg2(0, Screen_rows));
|
||
putp("\n");
|
||
#ifdef OFF_SCROLLBK
|
||
if (exit_ca_mode) {
|
||
// this next will also replace top's most recent screen with the
|
||
// original display contents that were visible at our invocation
|
||
putp(exit_ca_mode);
|
||
}
|
||
#endif
|
||
putp(Cap_curs_norm);
|
||
putp(Cap_clr_eol);
|
||
#ifndef RMAN_IGNORED
|
||
putp(Cap_smam);
|
||
#endif
|
||
}
|
||
fflush(stdout);
|
||
#ifndef OFF_STDERROR
|
||
/* we gotta reverse the stderr redirect which was employed during start up
|
||
and needed because the two libnuma 'weak' functions were useless to us! */
|
||
if (-1 < Stderr_save) {
|
||
dup2(Stderr_save, fileno(stderr));
|
||
close(Stderr_save);
|
||
Stderr_save = -1; // we'll be ending soon anyway but what the heck
|
||
}
|
||
#endif
|
||
} // end: at_eoj
|
||
|
||
|
||
/*
|
||
* The real program end */
|
||
static void bye_bye (const char *str) __attribute__((__noreturn__));
|
||
static void bye_bye (const char *str) {
|
||
at_eoj(); // restore tty in preparation for exit
|
||
#ifdef ATEOJ_RPTSTD
|
||
{ struct pids_stack *p;
|
||
if (!str && !Frames_signal && Ttychanged) { fprintf(stderr,
|
||
"\n%s's Summary report:"
|
||
"\n\tProgram"
|
||
"\n\t %s"
|
||
"\n\t Hertz = %u (%u bytes, %u-bit time)"
|
||
"\n\t Stat_reap->cpus->total = %d, Stat_reap->nodes->total = %d"
|
||
"\n\t sizeof(struct pids_result) = %u, sizeof(struct pids_stack) = %u"
|
||
"\n\t SCREENMAX = %u, ROWMINSIZ = %u, ROWMAXSIZ = %u"
|
||
"\n\t PACKAGE = '%s', LOCALEDIR = '%s'"
|
||
"\n\tTerminal: %s"
|
||
"\n\t device = %s, ncurses = v%s"
|
||
"\n\t max_colors = %d, max_pairs = %d"
|
||
"\n\t Cap_can_goto = %s"
|
||
"\n\t Screen_cols = %d, Screen_rows = %d"
|
||
"\n\t Max_lines = %d, most recent Pseudo_size = %u"
|
||
#ifndef OFF_STDIOLBF
|
||
"\n\t Stdout_buf = %u, BUFSIZ = %u"
|
||
#endif
|
||
"\n\tWindows and Curwin->"
|
||
"\n\t sizeof(WIN_t) = %u, GROUPSMAX = %d"
|
||
"\n\t winname = %s, grpname = %s"
|
||
#ifdef CASEUP_HEXES
|
||
"\n\t winflags = %08X, maxpflgs = %d"
|
||
#else
|
||
"\n\t winflags = x%08x, maxpflgs = %d"
|
||
#endif
|
||
"\n\t sortindx = %d, maxtasks = %d"
|
||
"\n\t varcolsz = %d, winlines = %d"
|
||
"\n\t strlen(columnhdr) = %d"
|
||
"\n"
|
||
, __func__
|
||
, PACKAGE_STRING
|
||
, (unsigned)Hertz, (unsigned)sizeof(Hertz), (unsigned)sizeof(Hertz) * 8
|
||
, Stat_reap->cpus->total, Stat_reap->nodes->total
|
||
, (unsigned)sizeof(struct pids_result), (unsigned)sizeof(*p)
|
||
, (unsigned)SCREENMAX, (unsigned)ROWMINSIZ, (unsigned)ROWMAXSIZ
|
||
, PACKAGE, LOCALEDIR
|
||
#ifdef PRETENDNOCAP
|
||
, "dumb"
|
||
#else
|
||
, termname()
|
||
#endif
|
||
, ttyname(STDOUT_FILENO), NCURSES_VERSION
|
||
, max_colors, max_pairs
|
||
, Cap_can_goto ? "yes" : "No!"
|
||
, Screen_cols, Screen_rows
|
||
, Max_lines, (unsigned)Pseudo_size
|
||
#ifndef OFF_STDIOLBF
|
||
, (unsigned)sizeof(Stdout_buf), (unsigned)BUFSIZ
|
||
#endif
|
||
, (unsigned)sizeof(WIN_t), GROUPSMAX
|
||
, Curwin->rc.winname, Curwin->grpname
|
||
, Curwin->rc.winflags, Curwin->maxpflgs
|
||
, Curwin->rc.sortindx, Curwin->rc.maxtasks
|
||
, Curwin->varcolsz, Curwin->winlines
|
||
, (int)strlen(Curwin->columnhdr)
|
||
);
|
||
}
|
||
}
|
||
#endif // end: ATEOJ_RPTSTD
|
||
|
||
procps_meminfo_unref(&Mem_ctx);
|
||
procps_pids_unref(&Pids_ctx);
|
||
procps_stat_unref(&Stat_ctx);
|
||
|
||
if (str) {
|
||
fputs(str, stderr);
|
||
exit(EXIT_FAILURE);
|
||
}
|
||
if (Batch) putp("\n");
|
||
exit(EXIT_SUCCESS);
|
||
} // end: bye_bye
|
||
|
||
|
||
/*
|
||
* Standard error handler to normalize the look of all err output */
|
||
static void error_exit (const char *str) __attribute__((__noreturn__));
|
||
static void error_exit (const char *str) {
|
||
static char buf[MEDBUFSIZ];
|
||
|
||
/* we'll use our own buffer so callers can still use fmtmk() and, after
|
||
twelve long years, 2013 was the year we finally eliminated the leading
|
||
tab character -- now our message can get lost in screen clutter too! */
|
||
snprintf(buf, sizeof(buf), "%s: %s\n", Myname, str);
|
||
bye_bye(buf);
|
||
} // end: error_exit
|
||
|
||
|
||
/*
|
||
* Catches all remaining signals not otherwise handled */
|
||
static void sig_abexit (int sig) {
|
||
sigset_t ss;
|
||
|
||
// POSIX.1-2004 async-signal-safe: sigfillset, sigprocmask, signal, raise
|
||
sigfillset(&ss);
|
||
sigprocmask(SIG_BLOCK, &ss, NULL);
|
||
at_eoj(); // restore tty in preparation for exit
|
||
fprintf(stderr, N_fmt(EXIT_signals_fmt)
|
||
, sig, signal_number_to_name(sig), Myname);
|
||
signal(sig, SIG_DFL); // allow core dumps, if applicable
|
||
raise(sig); // ( plus set proper return code )
|
||
} // end: sig_abexit
|
||
|
||
|
||
/*
|
||
* Catches:
|
||
* SIGALRM, SIGHUP, SIGINT, SIGPIPE, SIGQUIT, SIGTERM,
|
||
* SIGUSR1 and SIGUSR2 */
|
||
static void sig_endpgm (int dont_care_sig) __attribute__((__noreturn__));
|
||
static void sig_endpgm (int dont_care_sig) {
|
||
sigset_t ss;
|
||
|
||
// POSIX.1-2004 async-signal-safe: sigfillset, sigprocmask
|
||
sigfillset(&ss);
|
||
sigprocmask(SIG_BLOCK, &ss, NULL);
|
||
Frames_signal = BREAK_sig;
|
||
bye_bye(NULL);
|
||
(void)dont_care_sig;
|
||
} // end: sig_endpgm
|
||
|
||
|
||
/*
|
||
* Catches:
|
||
* SIGTSTP, SIGTTIN and SIGTTOU */
|
||
static void sig_paused (int dont_care_sig) {
|
||
// POSIX.1-2004 async-signal-safe: tcsetattr, tcdrain, raise
|
||
if (-1 == tcsetattr(STDIN_FILENO, TCSAFLUSH, &Tty_original))
|
||
error_exit(fmtmk(N_fmt(FAIL_tty_set_fmt), strerror(errno)));
|
||
if (keypad_local) putp(keypad_local);
|
||
putp(tg2(0, Screen_rows));
|
||
putp(Cap_curs_norm);
|
||
#ifndef RMAN_IGNORED
|
||
putp(Cap_smam);
|
||
#endif
|
||
// tcdrain(STDOUT_FILENO) was not reliable prior to ncurses-5.9.20121017,
|
||
// so we'll risk POSIX's wrath with good ol' fflush, lest 'Stopped' gets
|
||
// co-mingled with our most recent output...
|
||
fflush(stdout);
|
||
raise(SIGSTOP);
|
||
// later, after SIGCONT...
|
||
if (-1 == tcsetattr(STDIN_FILENO, TCSAFLUSH, &Tty_raw))
|
||
error_exit(fmtmk(N_fmt(FAIL_tty_set_fmt), strerror(errno)));
|
||
#ifndef RMAN_IGNORED
|
||
putp(Cap_rmam);
|
||
#endif
|
||
if (keypad_xmit) putp(keypad_xmit);
|
||
putp(Cursor_state);
|
||
Frames_signal = BREAK_sig;
|
||
(void)dont_care_sig;
|
||
} // end: sig_paused
|
||
|
||
|
||
/*
|
||
* Catches:
|
||
* SIGCONT and SIGWINCH */
|
||
static void sig_resize (int dont_care_sig) {
|
||
// POSIX.1-2004 async-signal-safe: tcdrain
|
||
tcdrain(STDOUT_FILENO);
|
||
Frames_signal = BREAK_sig;
|
||
(void)dont_care_sig;
|
||
} // end: sig_resize
|
||
|
||
/*###### Misc Color/Display support ####################################*/
|
||
|
||
/*
|
||
* Make the appropriate caps/color strings for a window/field group.
|
||
* note: we avoid the use of background color so as to maximize
|
||
* compatibility with the user's xterm settings */
|
||
static void capsmk (WIN_t *q) {
|
||
/* macro to test if a basic (non-color) capability is valid
|
||
thanks: Floyd Davidson <floyd@ptialaska.net> */
|
||
#define tIF(s) s ? s : ""
|
||
static int capsdone = 0;
|
||
|
||
// we must NOT disturb our 'empty' terminfo strings!
|
||
if (Batch) return;
|
||
|
||
// these are the unchangeable puppies, so we only do 'em once
|
||
if (!capsdone) {
|
||
STRLCPY(Cap_clr_eol, tIF(clr_eol))
|
||
STRLCPY(Cap_clr_eos, tIF(clr_eos))
|
||
STRLCPY(Cap_clr_scr, tIF(clear_screen))
|
||
// due to the leading newline, the following must be used with care
|
||
snprintf(Cap_nl_clreos, sizeof(Cap_nl_clreos), "\n%s", tIF(clr_eos));
|
||
STRLCPY(Cap_curs_huge, tIF(cursor_visible))
|
||
STRLCPY(Cap_curs_norm, tIF(cursor_normal))
|
||
STRLCPY(Cap_curs_hide, tIF(cursor_invisible))
|
||
STRLCPY(Cap_home, tIF(cursor_home))
|
||
STRLCPY(Cap_norm, tIF(exit_attribute_mode))
|
||
STRLCPY(Cap_reverse, tIF(enter_reverse_mode))
|
||
#ifndef RMAN_IGNORED
|
||
if (!eat_newline_glitch) {
|
||
STRLCPY(Cap_rmam, tIF(exit_am_mode))
|
||
STRLCPY(Cap_smam, tIF(enter_am_mode))
|
||
if (!*Cap_rmam || !*Cap_smam) {
|
||
*Cap_rmam = '\0';
|
||
*Cap_smam = '\0';
|
||
if (auto_right_margin)
|
||
Cap_avoid_eol = 1;
|
||
}
|
||
putp(Cap_rmam);
|
||
}
|
||
#endif
|
||
snprintf(Caps_off, sizeof(Caps_off), "%s%s", Cap_norm, tIF(orig_pair));
|
||
snprintf(Caps_endline, sizeof(Caps_endline), "%s%s", Caps_off, Cap_clr_eol);
|
||
if (tgoto(cursor_address, 1, 1)) Cap_can_goto = 1;
|
||
capsdone = 1;
|
||
}
|
||
|
||
/* the key to NO run-time costs for configurable colors -- we spend a
|
||
little time with the user now setting up our terminfo strings, and
|
||
the job's done until he/she/it has a change-of-heart */
|
||
STRLCPY(q->cap_bold, CHKw(q, View_NOBOLD) ? Cap_norm : tIF(enter_bold_mode))
|
||
if (CHKw(q, Show_COLORS) && max_colors > 0) {
|
||
STRLCPY(q->capclr_sum, tparm(set_a_foreground, q->rc.summclr))
|
||
snprintf(q->capclr_msg, sizeof(q->capclr_msg), "%s%s"
|
||
, tparm(set_a_foreground, q->rc.msgsclr), Cap_reverse);
|
||
snprintf(q->capclr_pmt, sizeof(q->capclr_pmt), "%s%s"
|
||
, tparm(set_a_foreground, q->rc.msgsclr), q->cap_bold);
|
||
snprintf(q->capclr_hdr, sizeof(q->capclr_hdr), "%s%s"
|
||
, tparm(set_a_foreground, q->rc.headclr), Cap_reverse);
|
||
snprintf(q->capclr_rownorm, sizeof(q->capclr_rownorm), "%s%s"
|
||
, Caps_off, tparm(set_a_foreground, q->rc.taskclr));
|
||
} else {
|
||
q->capclr_sum[0] = '\0';
|
||
#ifdef USE_X_COLHDR
|
||
snprintf(q->capclr_msg, sizeof(q->capclr_pmt), "%s%s"
|
||
, Cap_reverse, q->cap_bold);
|
||
#else
|
||
STRLCPY(q->capclr_msg, Cap_reverse)
|
||
#endif
|
||
STRLCPY(q->capclr_pmt, q->cap_bold)
|
||
STRLCPY(q->capclr_hdr, Cap_reverse)
|
||
STRLCPY(q->capclr_rownorm, Cap_norm)
|
||
}
|
||
|
||
// composite(s), so we do 'em outside and after the if
|
||
snprintf(q->capclr_rowhigh, sizeof(q->capclr_rowhigh), "%s%s"
|
||
, q->capclr_rownorm, CHKw(q, Show_HIBOLD) ? q->cap_bold : Cap_reverse);
|
||
#undef tIF
|
||
} // end: capsmk
|
||
|
||
|
||
/*
|
||
* Show an error message (caller may include '\a' for sound) */
|
||
static void show_msg (const char *str) {
|
||
PUTT("%s%s %.*s %s%s%s"
|
||
, tg2(0, Msg_row)
|
||
, Curwin->capclr_msg
|
||
, Screen_cols - 2
|
||
, str
|
||
, Cap_curs_hide
|
||
, Caps_off
|
||
, Cap_clr_eol);
|
||
fflush(stdout);
|
||
usleep(MSG_USLEEP);
|
||
} // end: show_msg
|
||
|
||
|
||
/*
|
||
* Show an input prompt + larger cursor (if possible) */
|
||
static int show_pmt (const char *str) {
|
||
int rc;
|
||
|
||
PUTT("%s%s%.*s %s%s%s"
|
||
, tg2(0, Msg_row)
|
||
, Curwin->capclr_pmt
|
||
, Screen_cols - 2
|
||
, str
|
||
, Cap_curs_huge
|
||
, Caps_off
|
||
, Cap_clr_eol);
|
||
fflush(stdout);
|
||
// +1 for the space we added or -1 for the cursor...
|
||
return ((rc = (int)strlen(str)+1) < Screen_cols) ? rc : Screen_cols-1;
|
||
} // end: show_pmt
|
||
|
||
|
||
/*
|
||
* Show lines with specially formatted elements, but only output
|
||
* what will fit within the current screen width.
|
||
* Our special formatting consists of:
|
||
* "some text <_delimiter_> some more text <_delimiter_>...\n"
|
||
* Where <_delimiter_> is a two byte combination consisting of a
|
||
* tilde followed by an ascii digit in the range of 1 - 8.
|
||
* examples: ~1, ~5, ~8, etc.
|
||
* The tilde is effectively stripped and the next digit
|
||
* converted to an index which is then used to select an
|
||
* 'attribute' from a capabilities table. That attribute
|
||
* is then applied to the *preceding* substring.
|
||
* Once recognized, the delimiter is replaced with a null character
|
||
* and viola, we've got a substring ready to output! Strings or
|
||
* substrings without delimiters will receive the Cap_norm attribute.
|
||
*
|
||
* Caution:
|
||
* This routine treats all non-delimiter bytes as displayable
|
||
* data subject to our screen width marching orders. If callers
|
||
* embed non-display data like tabs or terminfo strings in our
|
||
* glob, a line will truncate incorrectly at best. Worse case
|
||
* would be truncation of an embedded tty escape sequence.
|
||
*
|
||
* Tabs must always be avoided or our efforts are wasted and
|
||
* lines will wrap. To lessen but not eliminate the risk of
|
||
* terminfo string truncation, such non-display stuff should
|
||
* be placed at the beginning of a "short" line. */
|
||
static void show_special (int interact, const char *glob) {
|
||
/* note: the following is for documentation only,
|
||
the real captab is now found in a group's WIN_t !
|
||
+------------------------------------------------------+
|
||
| char *captab[] = { : Cap's/Delim's |
|
||
| Cap_norm, Cap_norm, = \000, \001, |
|
||
| cap_bold, capclr_sum, = \002, \003, |
|
||
| capclr_msg, capclr_pmt, = \004, \005, |
|
||
| capclr_hdr, = \006, |
|
||
| capclr_rowhigh, = \007, |
|
||
| capclr_rownorm }; = \010 [octal!] |
|
||
+------------------------------------------------------+ */
|
||
/* ( Pssst, after adding the termcap transitions, row may )
|
||
( exceed 300+ bytes, even in an 80x24 terminal window! )
|
||
( And if we're no longer guaranteed lines created only )
|
||
( by top, we'll need larger buffs plus some protection )
|
||
( against overrunning them with this 'lin_end - glob'. ) */
|
||
char tmp[LRGBUFSIZ], lin[LRGBUFSIZ], row[ROWMAXSIZ];
|
||
char *rp, *lin_end, *sub_beg, *sub_end;
|
||
int room;
|
||
|
||
// handle multiple lines passed in a bunch
|
||
while ((lin_end = strchr(glob, '\n'))) {
|
||
#define myMIN(a,b) (((a) < (b)) ? (a) : (b))
|
||
size_t lessor = myMIN((size_t)(lin_end - glob), sizeof(lin) -1);
|
||
|
||
// create a local copy we can extend and otherwise abuse
|
||
memcpy(lin, glob, lessor);
|
||
// zero terminate this part and prepare to parse substrings
|
||
lin[lessor] = '\0';
|
||
room = Screen_cols;
|
||
sub_beg = sub_end = lin;
|
||
*(rp = row) = '\0';
|
||
|
||
while (*sub_beg) {
|
||
int ch = *sub_end;
|
||
if ('~' == ch) ch = *(sub_end + 1) - '0';
|
||
switch (ch) {
|
||
case 0: // no end delim, captab makes normal
|
||
*(sub_end + 1) = '\0'; // extend str end, then fall through
|
||
*(sub_end + 2) = '\0'; // ( +1 optimization for usual path )
|
||
case 1: case 2: case 3: case 4:
|
||
case 5: case 6: case 7: case 8:
|
||
*sub_end = '\0';
|
||
snprintf(tmp, sizeof(tmp), "%s%.*s%s"
|
||
, Curwin->captab[ch], room, sub_beg, Caps_off);
|
||
rp = scat(rp, tmp);
|
||
room -= (sub_end - sub_beg);
|
||
sub_beg = (sub_end += 2);
|
||
break;
|
||
default: // nothin' special, just text
|
||
++sub_end;
|
||
}
|
||
if (0 >= room) break; // skip substrings that won't fit
|
||
}
|
||
|
||
if (interact) PUTT("%s%s\n", row, Cap_clr_eol);
|
||
else PUFF("%s%s\n", row, Caps_endline);
|
||
glob = ++lin_end; // point to next line (maybe)
|
||
|
||
#undef myMIN
|
||
} // end: while 'lines'
|
||
|
||
/* If there's anything left in the glob (by virtue of no trailing '\n'),
|
||
it probably means caller wants to retain cursor position on this final
|
||
line. That, in turn, means we're interactive and so we'll just do our
|
||
'fit-to-screen' thingy while also leaving room for the cursor... */
|
||
if (*glob) PUTT("%.*s", Screen_cols -1, glob);
|
||
} // end: show_special
|
||
|
||
|
||
/*
|
||
* Create a nearly complete scroll coordinates message, but still
|
||
* a format string since we'll be missing the current total tasks. */
|
||
static void updt_scroll_msg (void) {
|
||
char tmp1[SMLBUFSIZ], tmp2[SMLBUFSIZ];
|
||
int totpflgs = Curwin->totpflgs;
|
||
int begpflgs = Curwin->begpflg + 1;
|
||
|
||
#ifndef USE_X_COLHDR
|
||
if (CHKw(Curwin, Show_HICOLS)) {
|
||
totpflgs -= 2;
|
||
if (ENUpos(Curwin, Curwin->rc.sortindx) < Curwin->begpflg) begpflgs -= 2;
|
||
}
|
||
#endif
|
||
if (1 > totpflgs) totpflgs = 1;
|
||
if (1 > begpflgs) begpflgs = 1;
|
||
snprintf(tmp1, sizeof(tmp1)
|
||
, N_fmt(SCROLL_coord_fmt), Curwin->begtask + 1, begpflgs, totpflgs);
|
||
strcpy(tmp2, tmp1);
|
||
#ifndef SCROLLVAR_NO
|
||
if (Curwin->varcolbeg)
|
||
snprintf(tmp2, sizeof(tmp2), "%s + %d", tmp1, Curwin->varcolbeg);
|
||
#endif
|
||
// this Scroll_fmts string no longer provides for termcap tgoto so that
|
||
// the usage timing is critical -- see frame_make() for additional info
|
||
snprintf(Scroll_fmts, sizeof(Scroll_fmts)
|
||
, "%s %.*s%s", Caps_off, Screen_cols - 3, tmp2, Cap_clr_eol);
|
||
} // end: updt_scroll_msg
|
||
|
||
/*###### Low Level Memory/Keyboard/File I/O support ####################*/
|
||
|
||
/*
|
||
* Handle our own memory stuff without the risk of leaving the
|
||
* user's terminal in an ugly state should things go sour. */
|
||
|
||
static void *alloc_c (size_t num) {
|
||
void *pv;
|
||
|
||
if (!num) ++num;
|
||
if (!(pv = calloc(1, num)))
|
||
error_exit(N_txt(FAIL_alloc_c_txt));
|
||
return pv;
|
||
} // end: alloc_c
|
||
|
||
|
||
static void *alloc_r (void *ptr, size_t num) {
|
||
void *pv;
|
||
|
||
if (!num) ++num;
|
||
if (!(pv = realloc(ptr, num)))
|
||
error_exit(N_txt(FAIL_alloc_r_txt));
|
||
return pv;
|
||
} // end: alloc_r
|
||
|
||
|
||
static char *alloc_s (const char *str) {
|
||
return strcpy(alloc_c(strlen(str) +1), str);
|
||
} // end: alloc_s
|
||
|
||
|
||
/*
|
||
* This function is used in connection with raw single byte
|
||
* unsolicited keyboard input that's susceptible to SIGWINCH
|
||
* interrupts (or any other signal). He also supports timout
|
||
* in the absence of user keystrokes or some signal interrupt. */
|
||
static inline int ioa (struct timespec *ts) {
|
||
fd_set fs;
|
||
int rc;
|
||
|
||
FD_ZERO(&fs);
|
||
FD_SET(STDIN_FILENO, &fs);
|
||
|
||
#ifdef SIGNALS_LESS // conditional comments are silly, but help in documenting
|
||
// hold here until we've got keyboard input, any signal except SIGWINCH
|
||
// or (optionally) we timeout with nanosecond granularity
|
||
#else
|
||
// hold here until we've got keyboard input, any signal (including SIGWINCH)
|
||
// or (optionally) we timeout with nanosecond granularity
|
||
#endif
|
||
rc = pselect(STDIN_FILENO + 1, &fs, NULL, NULL, ts, &Sigwinch_set);
|
||
|
||
if (rc < 0) rc = 0;
|
||
return rc;
|
||
} // end: ioa
|
||
|
||
|
||
/*
|
||
* This routine isolates ALL user INPUT and ensures that we
|
||
* wont be mixing I/O from stdio and low-level read() requests */
|
||
static int ioch (int ech, char *buf, unsigned cnt) {
|
||
int rc = -1;
|
||
|
||
#ifdef TERMIOS_ONLY
|
||
if (ech) {
|
||
tcsetattr(STDIN_FILENO, TCSAFLUSH, &Tty_tweaked);
|
||
rc = read(STDIN_FILENO, buf, cnt);
|
||
tcsetattr(STDIN_FILENO, TCSAFLUSH, &Tty_raw);
|
||
} else {
|
||
if (ioa(NULL))
|
||
rc = read(STDIN_FILENO, buf, cnt);
|
||
}
|
||
#else
|
||
(void)ech;
|
||
if (ioa(NULL))
|
||
rc = read(STDIN_FILENO, buf, cnt);
|
||
#endif
|
||
|
||
// zero means EOF, might happen if we erroneously get detached from terminal
|
||
if (0 == rc) bye_bye(NULL);
|
||
|
||
// it may have been the beginning of a lengthy escape sequence
|
||
tcflush(STDIN_FILENO, TCIFLUSH);
|
||
|
||
// note: we do NOT produce a valid 'string'
|
||
return rc;
|
||
} // end: ioch
|
||
|
||
|
||
/*
|
||
* Support for single or multiple keystroke input AND
|
||
* escaped cursor motion keys.
|
||
* note: we support more keys than we currently need, in case
|
||
* we attract new consumers in the future */
|
||
static int iokey (int action) {
|
||
static char buf12[CAPBUFSIZ], buf13[CAPBUFSIZ]
|
||
, buf14[CAPBUFSIZ], buf15[CAPBUFSIZ];
|
||
static struct {
|
||
const char *str;
|
||
int key;
|
||
} tinfo_tab[] = {
|
||
{ "\033\n",kbd_ENTER }, { NULL, kbd_UP }, { NULL, kbd_DOWN },
|
||
{ NULL, kbd_LEFT }, { NULL, kbd_RIGHT }, { NULL, kbd_PGUP },
|
||
{ NULL, kbd_PGDN }, { NULL, kbd_HOME }, { NULL, kbd_END },
|
||
{ NULL, kbd_BKSP }, { NULL, kbd_INS }, { NULL, kbd_DEL },
|
||
// next 4 destined to be meta + arrow keys...
|
||
{ buf12, kbd_PGUP }, { buf13, kbd_PGDN },
|
||
{ buf14, kbd_HOME }, { buf15, kbd_END },
|
||
// remainder are alternatives for above, just in case...
|
||
// ( the k,j,l,h entries are the vim cursor motion keys )
|
||
{ "\033\\", kbd_UP }, { "\033/", kbd_DOWN }, /* meta+ \,/ */
|
||
{ "\033<", kbd_LEFT }, { "\033>", kbd_RIGHT }, /* meta+ <,> */
|
||
{ "\033k", kbd_UP }, { "\033j", kbd_DOWN }, /* meta+ k,j */
|
||
{ "\033h", kbd_LEFT }, { "\033l", kbd_RIGHT }, /* meta+ h,l */
|
||
{ "\033\013", kbd_PGUP }, { "\033\012", kbd_PGDN }, /* ctrl+meta+ k,j */
|
||
{ "\033\010", kbd_HOME }, { "\033\014", kbd_END } /* ctrl+meta+ h,l */
|
||
};
|
||
#ifdef TERMIOS_ONLY
|
||
char buf[SMLBUFSIZ], *pb;
|
||
#else
|
||
static char buf[SMLBUFSIZ];
|
||
static int pos, len;
|
||
char *pb;
|
||
#endif
|
||
int i;
|
||
|
||
if (action == 0) {
|
||
#define tOk(s) s ? s : ""
|
||
tinfo_tab[1].str = tOk(key_up);
|
||
tinfo_tab[2].str = tOk(key_down);
|
||
tinfo_tab[3].str = tOk(key_left);
|
||
tinfo_tab[4].str = tOk(key_right);
|
||
tinfo_tab[5].str = tOk(key_ppage);
|
||
tinfo_tab[6].str = tOk(key_npage);
|
||
tinfo_tab[7].str = tOk(key_home);
|
||
tinfo_tab[8].str = tOk(key_end);
|
||
tinfo_tab[9].str = tOk(key_backspace);
|
||
tinfo_tab[10].str = tOk(key_ic);
|
||
tinfo_tab[11].str = tOk(key_dc);
|
||
STRLCPY(buf12, fmtmk("\033%s", tOk(key_up)));
|
||
STRLCPY(buf13, fmtmk("\033%s", tOk(key_down)));
|
||
STRLCPY(buf14, fmtmk("\033%s", tOk(key_left)));
|
||
STRLCPY(buf15, fmtmk("\033%s", tOk(key_right)));
|
||
// next is critical so returned results match bound terminfo keys
|
||
putp(tOk(keypad_xmit));
|
||
// ( converse keypad_local issued at pause/pgm end, just in case )
|
||
return 0;
|
||
#undef tOk
|
||
}
|
||
|
||
if (action == 1) {
|
||
memset(buf, '\0', sizeof(buf));
|
||
if (1 > ioch(0, buf, sizeof(buf)-1)) return 0;
|
||
}
|
||
|
||
#ifndef TERMIOS_ONLY
|
||
if (action == 2) {
|
||
if (pos < len)
|
||
return buf[pos++]; // exhaust prior keystrokes
|
||
pos = len = 0;
|
||
memset(buf, '\0', sizeof(buf));
|
||
if (1 > ioch(0, buf, sizeof(buf)-1)) return 0;
|
||
if (isprint(buf[0])) { // no need for translation
|
||
len = strlen(buf);
|
||
pos = 1;
|
||
return buf[0];
|
||
}
|
||
}
|
||
#endif
|
||
|
||
/* some emulators implement 'key repeat' too well and we get duplicate
|
||
key sequences -- so we'll focus on the last escaped sequence, while
|
||
also allowing use of the meta key... */
|
||
if (!(pb = strrchr(buf, '\033'))) pb = buf;
|
||
else if (pb > buf && '\033' == *(pb - 1)) --pb;
|
||
|
||
for (i = 0; i < MAXTBL(tinfo_tab); i++)
|
||
if (!strcmp(tinfo_tab[i].str, pb))
|
||
return tinfo_tab[i].key;
|
||
|
||
// no match, so we'll return single non-escaped keystrokes only
|
||
if (buf[0] == '\033' && buf[1]) return 0;
|
||
return buf[0];
|
||
} // end: iokey
|
||
|
||
|
||
#ifdef TERMIOS_ONLY
|
||
/*
|
||
* Get line oriented interactive input from the user,
|
||
* using native tty support */
|
||
static char *ioline (const char *prompt) {
|
||
static const char ws[] = "\b\f\n\r\t\v\x1b\x9b"; // 0x1b + 0x9b are escape
|
||
static char buf[MEDBUFSIZ];
|
||
char *p;
|
||
|
||
show_pmt(prompt);
|
||
memset(buf, '\0', sizeof(buf));
|
||
ioch(1, buf, sizeof(buf)-1);
|
||
|
||
if ((p = strpbrk(buf, ws))) *p = '\0';
|
||
// note: we DO produce a vaid 'string'
|
||
return buf;
|
||
} // end: ioline
|
||
|
||
#else
|
||
/*
|
||
* Get line oriented interactive input from the user,
|
||
* going way beyond native tty support by providing:
|
||
* . true line editing, not just destructive backspace
|
||
* . an input limit sensitive to current screen dimensions
|
||
* . ability to recall prior strings for re-input/re-editing */
|
||
static char *ioline (const char *prompt) {
|
||
#define savMAX 50
|
||
// thank goodness memmove allows the two strings to overlap
|
||
#define sqzSTR { memmove(&buf[pos], &buf[pos+1], bufMAX-pos); \
|
||
buf[sizeof(buf)-1] = '\0'; }
|
||
#define expSTR if (len+1 < bufMAX && len+beg+1 < Screen_cols) { \
|
||
memmove(&buf[pos+1], &buf[pos], bufMAX-pos); buf[pos] = ' '; }
|
||
#define logCOL (pos+1)
|
||
#define phyCOL (beg+pos+1)
|
||
#define bufMAX ((int)sizeof(buf)-2) // -1 for '\0' string delimeter
|
||
static char buf[MEDBUFSIZ+1]; // +1 for '\0' string delimeter
|
||
static int ovt;
|
||
int beg, pos, len, key, i;
|
||
struct lin_s {
|
||
struct lin_s *bkw; // ptr to older saved strs
|
||
struct lin_s *fwd; // ptr to newer saved strs
|
||
char *str; // the saved string
|
||
};
|
||
static struct lin_s *anchor, *plin;
|
||
|
||
if (!anchor) {
|
||
anchor = alloc_c(sizeof(struct lin_s));
|
||
anchor->str = alloc_s(""); // top-of-stack == empty str
|
||
}
|
||
plin = anchor;
|
||
pos = 0;
|
||
beg = show_pmt(prompt);
|
||
memset(buf, '\0', sizeof(buf));
|
||
putp(ovt ? Cap_curs_huge : Cap_curs_norm);
|
||
|
||
do {
|
||
fflush(stdout);
|
||
len = strlen(buf);
|
||
key = iokey(2);
|
||
switch (key) {
|
||
case 0:
|
||
buf[0] = '\0';
|
||
return buf;
|
||
case kbd_ESC:
|
||
buf[0] = kbd_ESC;
|
||
return buf;
|
||
case kbd_ENTER:
|
||
continue;
|
||
case kbd_INS:
|
||
ovt = !ovt;
|
||
putp(ovt ? Cap_curs_huge : Cap_curs_norm);
|
||
break;
|
||
case kbd_DEL:
|
||
sqzSTR
|
||
break;
|
||
case kbd_BKSP :
|
||
if (0 < pos) { --pos; sqzSTR }
|
||
break;
|
||
case kbd_LEFT:
|
||
if (0 < pos) --pos;
|
||
break;
|
||
case kbd_RIGHT:
|
||
if (pos < len) ++pos;
|
||
break;
|
||
case kbd_HOME:
|
||
pos = 0;
|
||
break;
|
||
case kbd_END:
|
||
pos = len;
|
||
break;
|
||
case kbd_UP:
|
||
if (plin->bkw) {
|
||
plin = plin->bkw;
|
||
memset(buf, '\0', sizeof(buf));
|
||
pos = snprintf(buf, sizeof(buf), "%.*s", Screen_cols - beg - 1, plin->str);
|
||
}
|
||
break;
|
||
case kbd_DOWN:
|
||
memset(buf, '\0', sizeof(buf));
|
||
if (plin->fwd) plin = plin->fwd;
|
||
pos = snprintf(buf, sizeof(buf), "%.*s", Screen_cols - beg - 1, plin->str);
|
||
break;
|
||
default: // what we REALLY wanted (maybe)
|
||
if (isprint(key) && logCOL < bufMAX && phyCOL < Screen_cols) {
|
||
if (!ovt) expSTR
|
||
buf[pos++] = key;
|
||
}
|
||
break;
|
||
}
|
||
putp(fmtmk("%s%s%s", tg2(beg, Msg_row), Cap_clr_eol, buf));
|
||
putp(tg2(beg+pos, Msg_row));
|
||
} while (key != kbd_ENTER);
|
||
|
||
// weed out duplicates, including empty strings (top-of-stack)...
|
||
for (i = 0, plin = anchor; ; i++) {
|
||
#ifdef RECALL_FIXED
|
||
if (!STRCMP(plin->str, buf)) // if matched, retain original order
|
||
return buf;
|
||
#else
|
||
if (!STRCMP(plin->str, buf)) { // if matched, rearrange stack order
|
||
if (i > 1) { // but not null str or if already #2
|
||
if (plin->bkw) // splice around this matched string
|
||
plin->bkw->fwd = plin->fwd; // if older exists link to newer
|
||
plin->fwd->bkw = plin->bkw; // newer linked to older or NULL
|
||
anchor->bkw->fwd = plin; // stick matched on top of former #2
|
||
plin->bkw = anchor->bkw; // keep empty string at top-of-stack
|
||
plin->fwd = anchor; // then prepare to be the 2nd banana
|
||
anchor->bkw = plin; // by sliding us in below the anchor
|
||
}
|
||
return buf;
|
||
}
|
||
#endif
|
||
if (!plin->bkw) break; // let i equal total stacked strings
|
||
plin = plin->bkw; // ( with plin representing bottom )
|
||
}
|
||
if (i < savMAX)
|
||
plin = alloc_c(sizeof(struct lin_s));
|
||
else { // when a new string causes overflow
|
||
plin->fwd->bkw = NULL; // make next-to-last string new last
|
||
free(plin->str); // and toss copy but keep the struct
|
||
}
|
||
plin->str = alloc_s(buf); // copy user's new unique input line
|
||
plin->bkw = anchor->bkw; // keep empty string as top-of-stack
|
||
if (plin->bkw) // did we have some already stacked?
|
||
plin->bkw->fwd = plin; // yep, so point prior to new string
|
||
plin->fwd = anchor; // and prepare to be a second banana
|
||
anchor->bkw = plin; // by sliding it in as new number 2!
|
||
|
||
return buf; // protect our copy, return original
|
||
#undef savMAX
|
||
#undef sqzSTR
|
||
#undef expSTR
|
||
#undef logCOL
|
||
#undef phyCOL
|
||
#undef bufMAX
|
||
} // end: ioline
|
||
#endif
|
||
|
||
|
||
/*
|
||
* Make locale aware float (but maybe restrict to whole numbers). */
|
||
static int mkfloat (const char *str, float *num, int whole) {
|
||
char *ep;
|
||
|
||
if (whole)
|
||
*num = (float)strtol(str, &ep, 0);
|
||
else
|
||
*num = strtof(str, &ep);
|
||
if (ep != str && *ep == '\0' && *num < INT_MAX)
|
||
return 1;
|
||
return 0;
|
||
} // end: mkfloat
|
||
|
||
|
||
/*
|
||
* This routine provides the i/o in support of files whose size
|
||
* cannot be determined in advance. Given a stream pointer, he'll
|
||
* try to slurp in the whole thing and return a dynamically acquired
|
||
* buffer supporting that single string glob.
|
||
*
|
||
* He always creates a buffer at least READMINSZ big, possibly
|
||
* all zeros (an empty string), even if the file wasn't read. */
|
||
static int readfile (FILE *fp, char **baddr, size_t *bsize, size_t *bread) {
|
||
char chunk[4096*16];
|
||
size_t num;
|
||
|
||
*bread = 0;
|
||
*bsize = READMINSZ;
|
||
*baddr = alloc_c(READMINSZ);
|
||
if (fp) {
|
||
while (0 < (num = fread(chunk, 1, sizeof(chunk), fp))) {
|
||
*baddr = alloc_r(*baddr, num + *bsize);
|
||
memcpy(*baddr + *bread, chunk, num);
|
||
*bread += num;
|
||
*bsize += num;
|
||
};
|
||
*(*baddr + *bread) = '\0';
|
||
return ferror(fp);
|
||
}
|
||
return ENOENT;
|
||
} // end: readfile
|
||
|
||
/*###### Small Utility routines ########################################*/
|
||
|
||
#define GET_NUM_BAD INT_MIN
|
||
#define GET_NUM_ESC (INT_MIN + 1)
|
||
#define GET_NUM_NOT (INT_MIN + 2)
|
||
|
||
/*
|
||
* Get a float from the user */
|
||
static float get_float (const char *prompt) {
|
||
char *line;
|
||
float f;
|
||
|
||
line = ioline(prompt);
|
||
if (line[0] == kbd_ESC || Frames_signal) return GET_NUM_ESC;
|
||
if (!line[0]) return GET_NUM_NOT;
|
||
// note: we're not allowing negative floats
|
||
if (!mkfloat(line, &f, 0) || f < 0) {
|
||
show_msg(N_txt(BAD_numfloat_txt));
|
||
return GET_NUM_BAD;
|
||
}
|
||
return f;
|
||
} // end: get_float
|
||
|
||
|
||
/*
|
||
* Get an integer from the user, returning INT_MIN for error */
|
||
static int get_int (const char *prompt) {
|
||
char *line;
|
||
float f;
|
||
|
||
line = ioline(prompt);
|
||
if (line[0] == kbd_ESC || Frames_signal) return GET_NUM_ESC;
|
||
if (!line[0]) return GET_NUM_NOT;
|
||
// note: we've got to allow negative ints (renice)
|
||
if (!mkfloat(line, &f, 1)) {
|
||
show_msg(N_txt(BAD_integers_txt));
|
||
return GET_NUM_BAD;
|
||
}
|
||
return (int)f;
|
||
} // end: get_int
|
||
|
||
|
||
/*
|
||
* Make a hex value, and maybe suppress zeroes. */
|
||
static inline const char *hex_make (long num, int noz) {
|
||
static char buf[SMLBUFSIZ];
|
||
int i;
|
||
|
||
#ifdef CASEUP_HEXES
|
||
snprintf(buf, sizeof(buf), "%08lX", num);
|
||
#else
|
||
snprintf(buf, sizeof(buf), "%08lx", num);
|
||
#endif
|
||
if (noz)
|
||
for (i = 0; buf[i]; i++)
|
||
if ('0' == buf[i])
|
||
buf[i] = '.';
|
||
return buf;
|
||
} // end: hex_make
|
||
|
||
|
||
/*
|
||
* This sructure is hung from a WIN_t when other filtering is active */
|
||
struct osel_s {
|
||
struct osel_s *nxt; // the next criteria or NULL.
|
||
int (*rel)(const char *, const char *); // relational strings compare
|
||
char *(*sel)(const char *, const char *); // for selection str compares
|
||
char *raw; // raw user input (dup check)
|
||
char *val; // value included or excluded
|
||
int ops; // filter delimiter/operation
|
||
int inc; // include == 1, exclude == 0
|
||
int enu; // field (procflag) to filter
|
||
};
|
||
|
||
|
||
/*
|
||
* A function to turn off entire other filtering in the given window */
|
||
static void osel_clear (WIN_t *q) {
|
||
struct osel_s *osel = q->osel_1st;
|
||
|
||
while (osel) {
|
||
struct osel_s *nxt = osel->nxt;
|
||
free(osel->val);
|
||
free(osel->raw);
|
||
free(osel);
|
||
osel = nxt;
|
||
}
|
||
q->osel_tot = 0;
|
||
q->osel_1st = NULL;
|
||
free (q->osel_prt);
|
||
q->osel_prt = NULL;
|
||
#ifndef USE_X_COLHDR
|
||
OFFw(Curwin, NOHISEL_xxx);
|
||
#endif
|
||
} // end: osel_clear
|
||
|
||
|
||
/*
|
||
* Determine if there are matching values or relationships among the
|
||
* other criteria in this passed window -- it's called from only one
|
||
* place, and likely inlined even without the directive */
|
||
static inline int osel_matched (const WIN_t *q, FLG_t enu, const char *str) {
|
||
struct osel_s *osel = q->osel_1st;
|
||
|
||
while (osel) {
|
||
if (osel->enu == enu) {
|
||
int r;
|
||
switch (osel->ops) {
|
||
case '<': // '<' needs the r < 0 unless
|
||
r = osel->rel(str, osel->val); // '!' which needs an inverse
|
||
if ((r >= 0 && osel->inc) || (r < 0 && !osel->inc)) return 0;
|
||
break;
|
||
case '>': // '>' needs the r > 0 unless
|
||
r = osel->rel(str, osel->val); // '!' which needs an inverse
|
||
if ((r <= 0 && osel->inc) || (r > 0 && !osel->inc)) return 0;
|
||
break;
|
||
default:
|
||
{ char *p = osel->sel(str, osel->val);
|
||
if ((!p && osel->inc) || (p && !osel->inc)) return 0;
|
||
}
|
||
break;
|
||
}
|
||
}
|
||
osel = osel->nxt;
|
||
}
|
||
return 1;
|
||
} // end: osel_matched
|
||
|
||
|
||
/*
|
||
* Validate the passed string as a user name or number,
|
||
* and/or update the window's 'u/U' selection stuff. */
|
||
static const char *user_certify (WIN_t *q, const char *str, char typ) {
|
||
struct passwd *pwd;
|
||
char *endp;
|
||
uid_t num;
|
||
|
||
Monpidsidx = 0;
|
||
q->usrseltyp = 0;
|
||
q->usrselflg = 1;
|
||
if (*str) {
|
||
if ('!' == *str) { ++str; q->usrselflg = 0; }
|
||
num = (uid_t)strtoul(str, &endp, 0);
|
||
if ('\0' == *endp) {
|
||
pwd = getpwuid(num);
|
||
if (!pwd) {
|
||
/* allow foreign users, from e.g within chroot
|
||
( thanks Dr. Werner Fink <werner@suse.de> ) */
|
||
q->usrseluid = num;
|
||
q->usrseltyp = typ;
|
||
return NULL;
|
||
}
|
||
} else
|
||
pwd = getpwnam(str);
|
||
if (!pwd) return N_txt(BAD_username_txt);
|
||
q->usrseluid = pwd->pw_uid;
|
||
q->usrseltyp = typ;
|
||
}
|
||
return NULL;
|
||
} // end: user_certify
|
||
|
||
/*###### Basic Formatting support ######################################*/
|
||
|
||
/*
|
||
* Just do some justify stuff, then add post column padding. */
|
||
static inline const char *justify_pad (const char *str, int width, int justr) {
|
||
static char l_fmt[] = "%-*.*s%s", r_fmt[] = "%*.*s%s";
|
||
static char buf[SCREENMAX];
|
||
|
||
snprintf(buf, sizeof(buf), justr ? r_fmt : l_fmt, width, width, str, COLPADSTR);
|
||
return buf;
|
||
} // end: justify_pad
|
||
|
||
|
||
/*
|
||
* Make and then justify a single character. */
|
||
static inline const char *make_chr (const char ch, int width, int justr) {
|
||
static char buf[SMLBUFSIZ];
|
||
|
||
snprintf(buf, sizeof(buf), "%c", ch);
|
||
return justify_pad(buf, width, justr);
|
||
} // end: make_chr
|
||
|
||
|
||
/*
|
||
* Make and then justify an integer NOT subject to scaling,
|
||
* and include a visual clue should tuncation be necessary. */
|
||
static inline const char *make_num (long num, int width, int justr, int col, int noz) {
|
||
static char buf[SMLBUFSIZ];
|
||
|
||
buf[0] = '\0';
|
||
if (noz && Rc.zero_suppress && 0 == num)
|
||
goto end_justifies;
|
||
|
||
if (width < snprintf(buf, sizeof(buf), "%ld", num)) {
|
||
buf[width-1] = COLPLUSCH;
|
||
AUTOX_COL(col);
|
||
}
|
||
end_justifies:
|
||
return justify_pad(buf, width, justr);
|
||
} // end: make_num
|
||
|
||
|
||
/*
|
||
* Make and then justify a character string,
|
||
* and include a visual clue should tuncation be necessary. */
|
||
static inline const char *make_str (const char *str, int width, int justr, int col) {
|
||
static char buf[SCREENMAX];
|
||
|
||
if (width < snprintf(buf, sizeof(buf), "%s", str)) {
|
||
buf[width-1] = COLPLUSCH;
|
||
AUTOX_COL(col);
|
||
}
|
||
return justify_pad(buf, width, justr);
|
||
} // end: make_str
|
||
|
||
|
||
/*
|
||
* Do some scaling then justify stuff.
|
||
* We'll interpret 'num' as a kibibytes quantity and try to
|
||
* format it to reach 'target' while also fitting 'width'. */
|
||
static const char *scale_mem (int target, long num, int width, int justr) {
|
||
#ifndef NOBOOST_MEMS
|
||
// SK_Kb SK_Mb SK_Gb SK_Tb SK_Pb SK_Eb
|
||
static const char *fmttab[] = { "%.0f", "%#.1f%c", "%#.3f%c", "%#.3f%c", "%#.3f%c", NULL };
|
||
#else
|
||
static const char *fmttab[] = { "%.0f", "%.0f%c", "%.0f%c", "%.0f%c", "%.0f%c", NULL };
|
||
#endif
|
||
static char buf[SMLBUFSIZ];
|
||
float scaled_num;
|
||
char *psfx;
|
||
int i;
|
||
|
||
buf[0] = '\0';
|
||
if (Rc.zero_suppress && 0 >= num)
|
||
goto end_justifies;
|
||
|
||
scaled_num = num;
|
||
for (i = SK_Kb, psfx = Scaled_sfxtab; i < SK_Eb; psfx++, i++) {
|
||
if (i >= target
|
||
&& (width >= snprintf(buf, sizeof(buf), fmttab[i], scaled_num, *psfx)))
|
||
goto end_justifies;
|
||
scaled_num /= 1024.0;
|
||
}
|
||
|
||
// well shoot, this outta' fit...
|
||
snprintf(buf, sizeof(buf), "?");
|
||
end_justifies:
|
||
return justify_pad(buf, width, justr);
|
||
} // end: scale_mem
|
||
|
||
|
||
/*
|
||
* Do some scaling then justify stuff. */
|
||
static const char *scale_num (unsigned long num, int width, int justr) {
|
||
static char buf[SMLBUFSIZ];
|
||
float scaled_num;
|
||
char *psfx;
|
||
|
||
buf[0] = '\0';
|
||
if (Rc.zero_suppress && 0 >= num)
|
||
goto end_justifies;
|
||
if (width >= snprintf(buf, sizeof(buf), "%lu", num))
|
||
goto end_justifies;
|
||
|
||
scaled_num = num;
|
||
for (psfx = Scaled_sfxtab; 0 < *psfx; psfx++) {
|
||
scaled_num /= 1024.0;
|
||
if (width >= snprintf(buf, sizeof(buf), "%.1f%c", scaled_num, *psfx))
|
||
goto end_justifies;
|
||
if (width >= snprintf(buf, sizeof(buf), "%.0f%c", scaled_num, *psfx))
|
||
goto end_justifies;
|
||
}
|
||
|
||
// well shoot, this outta' fit...
|
||
snprintf(buf, sizeof(buf), "?");
|
||
end_justifies:
|
||
return justify_pad(buf, width, justr);
|
||
} // end: scale_num
|
||
|
||
|
||
/*
|
||
* Make and then justify a percentage, with decreasing precision. */
|
||
static const char *scale_pcnt (float num, int width, int justr) {
|
||
static char buf[SMLBUFSIZ];
|
||
|
||
buf[0] = '\0';
|
||
if (Rc.zero_suppress && 0 >= num)
|
||
goto end_justifies;
|
||
#ifdef BOOST_PERCNT
|
||
if (width >= snprintf(buf, sizeof(buf), "%#.3f", num))
|
||
goto end_justifies;
|
||
if (width >= snprintf(buf, sizeof(buf), "%#.2f", num))
|
||
goto end_justifies;
|
||
#endif
|
||
if (width >= snprintf(buf, sizeof(buf), "%#.1f", num))
|
||
goto end_justifies;
|
||
if (width >= snprintf(buf, sizeof(buf), "%*.0f", width, num))
|
||
goto end_justifies;
|
||
|
||
// well shoot, this outta' fit...
|
||
snprintf(buf, sizeof(buf), "?");
|
||
end_justifies:
|
||
return justify_pad(buf, width, justr);
|
||
} // end: scale_pcnt
|
||
|
||
|
||
/*
|
||
* Do some scaling stuff.
|
||
* Format 'tics' to fit 'width', then justify it. */
|
||
static const char *scale_tics (TIC_t tics, int width, int justr) {
|
||
#ifdef CASEUP_SUFIX
|
||
#define HH "%uH" // nls_maybe
|
||
#define DD "%uD"
|
||
#define WW "%uW"
|
||
#else
|
||
#define HH "%uh" // nls_maybe
|
||
#define DD "%ud"
|
||
#define WW "%uw"
|
||
#endif
|
||
static char buf[SMLBUFSIZ];
|
||
unsigned long nt; // narrow time, for speed on 32-bit
|
||
unsigned cc; // centiseconds
|
||
unsigned nn; // multi-purpose whatever
|
||
|
||
buf[0] = '\0';
|
||
nt = (tics * 100ull) / Hertz; // up to 68 weeks of cpu time
|
||
if (Rc.zero_suppress && 0 >= nt)
|
||
goto end_justifies;
|
||
cc = nt % 100; // centiseconds past second
|
||
nt /= 100; // total seconds
|
||
nn = nt % 60; // seconds past the minute
|
||
nt /= 60; // total minutes
|
||
if (width >= snprintf(buf, sizeof(buf), "%lu:%02u.%02u", nt, nn, cc))
|
||
goto end_justifies;
|
||
if (width >= snprintf(buf, sizeof(buf), "%lu:%02u", nt, nn))
|
||
goto end_justifies;
|
||
nn = nt % 60; // minutes past the hour
|
||
nt /= 60; // total hours
|
||
if (width >= snprintf(buf, sizeof(buf), "%lu,%02u", nt, nn))
|
||
goto end_justifies;
|
||
nn = nt; // now also hours
|
||
if (width >= snprintf(buf, sizeof(buf), HH, nn))
|
||
goto end_justifies;
|
||
nn /= 24; // now days
|
||
if (width >= snprintf(buf, sizeof(buf), DD, nn))
|
||
goto end_justifies;
|
||
nn /= 7; // now weeks
|
||
if (width >= snprintf(buf, sizeof(buf), WW, nn))
|
||
goto end_justifies;
|
||
|
||
// well shoot, this outta' fit...
|
||
snprintf(buf, sizeof(buf), "?");
|
||
end_justifies:
|
||
return justify_pad(buf, width, justr);
|
||
#undef HH
|
||
#undef DD
|
||
#undef WW
|
||
} // end: scale_tics
|
||
|
||
/*###### Fields Management support #####################################*/
|
||
|
||
/* These are our gosh darn 'Fields' !
|
||
They MUST be kept in sync with pflags !! */
|
||
static struct {
|
||
int width; // field width, if applicable
|
||
int scale; // scaled target, if applicable
|
||
const int align; // the default column alignment flag
|
||
int erel; // relative position in dynamic Pids_itms
|
||
const enum pids_item item; // the new libproc item enum identifier
|
||
} Fieldstab[] = {
|
||
// these identifiers reflect the default column alignment but they really
|
||
// contain the WIN_t flag used to check/change justification at run-time!
|
||
#define A_right Show_JRNUMS /* toggled with upper case 'J' */
|
||
#define A_left Show_JRSTRS /* toggled with lower case 'j' */
|
||
|
||
/* .width anomalies:
|
||
a -1 width represents variable width columns
|
||
a 0 width represents columns set once at startup (see zap_fieldstab)
|
||
|
||
.width .scale .align .erel .item
|
||
------ ------ -------- ----- ------------------------- */
|
||
{ 0, -1, A_right, -1, PROCPS_PIDS_ID_PID }, // s_int EU_PID
|
||
{ 0, -1, A_right, -1, PROCPS_PIDS_ID_PPID }, // s_int EU_PPD
|
||
{ 5, -1, A_right, -1, PROCPS_PIDS_ID_EUID }, // u_int EU_UED
|
||
{ 8, -1, A_left, -1, PROCPS_PIDS_ID_EUSER }, // str EU_UEN
|
||
{ 5, -1, A_right, -1, PROCPS_PIDS_ID_RUID }, // u_int EU_URD
|
||
{ 8, -1, A_left, -1, PROCPS_PIDS_ID_RUSER }, // str EU_URN
|
||
{ 5, -1, A_right, -1, PROCPS_PIDS_ID_SUID }, // u_int EU_USD
|
||
{ 8, -1, A_left, -1, PROCPS_PIDS_ID_SUSER }, // str EU_USN
|
||
{ 5, -1, A_right, -1, PROCPS_PIDS_ID_EGID }, // u_int EU_GID
|
||
{ 8, -1, A_left, -1, PROCPS_PIDS_ID_EGROUP }, // str EU_GRP
|
||
{ 0, -1, A_right, -1, PROCPS_PIDS_ID_PGRP }, // s_int EU_PGD
|
||
{ 8, -1, A_left, -1, PROCPS_PIDS_TTY_NAME }, // str EU_TTY
|
||
{ 0, -1, A_right, -1, PROCPS_PIDS_ID_TPGID }, // s_int EU_TPG
|
||
{ 0, -1, A_right, -1, PROCPS_PIDS_ID_SESSION }, // s_int EU_SID
|
||
{ 3, -1, A_right, -1, PROCPS_PIDS_PRIORITY }, // s_int EU_PRI
|
||
{ 3, -1, A_right, -1, PROCPS_PIDS_NICE }, // sl_int EU_NCE
|
||
{ 3, -1, A_right, -1, PROCPS_PIDS_NLWP }, // s_int EU_THD
|
||
{ 0, -1, A_right, -1, PROCPS_PIDS_PROCESSOR }, // u_int EU_CPN
|
||
{ 0, -1, A_right, -1, PROCPS_PIDS_TICS_DELTA }, // sl_int EU_CPU
|
||
{ 6, -1, A_right, -1, PROCPS_PIDS_TICS_ALL }, // ull_int EU_TME
|
||
{ 9, -1, A_right, -1, PROCPS_PIDS_TICS_ALL }, // ull_int EU_TM2
|
||
#ifdef BOOST_PERCNT
|
||
{ 5, -1, A_right, -1, PROCPS_PIDS_VM_RSS }, // sl_int EU_MEM
|
||
#else
|
||
{ 4, -1, A_right, -1, PROCPS_PIDS_VM_RSS }, // sl_int EU_MEM,
|
||
#endif
|
||
#ifndef NOBOOST_MEMS
|
||
{ 7, SK_Kb, A_right, -1, PROCPS_PIDS_MEM_VIRT_KIB }, // sl_int EU_VRT
|
||
{ 6, SK_Kb, A_right, -1, PROCPS_PIDS_VM_SWAP }, // sl_int EU_SWP
|
||
{ 6, SK_Kb, A_right, -1, PROCPS_PIDS_VM_RSS }, // sl_int EU_RES
|
||
{ 6, SK_Kb, A_right, -1, PROCPS_PIDS_MEM_CODE_KIB }, // sl_int EU_COD
|
||
{ 7, SK_Kb, A_right, -1, PROCPS_PIDS_MEM_DATA_KIB }, // sl_int EU_DAT
|
||
{ 6, SK_Kb, A_right, -1, PROCPS_PIDS_MEM_SHR_KIB }, // sl_int EU_SHR
|
||
#else
|
||
{ 5, SK_Kb, A_right, -1, PROCPS_PIDS_MEM_VIRT_KIB }, // sl_int EU_VRT
|
||
{ 4, SK_Kb, A_right, -1, PROCPS_PIDS_VM_SWAP }, // sl_int EU_SWP
|
||
{ 4, SK_Kb, A_right, -1, PROCPS_PIDS_VM_RSS }, // sl_int EU_RES
|
||
{ 4, SK_Kb, A_right, -1, PROCPS_PIDS_MEM_CODE_KIB }, // sl_int EU_COD
|
||
{ 5, SK_Kb, A_right, -1, PROCPS_PIDS_MEM_DATA_KIB }, // sl_int EU_DAT
|
||
{ 4, SK_Kb, A_right, -1, PROCPS_PIDS_MEM_SHR_KIB }, // sl_int EU_SHR
|
||
#endif
|
||
{ 4, -1, A_right, -1, PROCPS_PIDS_FLT_MAJ }, // sl_int EU_FL1
|
||
{ 4, -1, A_right, -1, PROCPS_PIDS_FLT_MIN }, // sl_int EU_FL2
|
||
{ 4, -1, A_right, -1, PROCPS_PIDS_MEM_DT }, // sl_int EU_DRT ( always 0 w/ since 2.6 )
|
||
{ 1, -1, A_right, -1, PROCPS_PIDS_STATE }, // s_ch EU_STA
|
||
{ -1, -1, A_left, -1, PROCPS_PIDS_CMD }, // str EU_CMD
|
||
{ 10, -1, A_left, -1, PROCPS_PIDS_WCHAN_NAME }, // str EU_WCH
|
||
{ 8, -1, A_left, -1, PROCPS_PIDS_FLAGS }, // ul_int EU_FLG
|
||
{ -1, -1, A_left, -1, PROCPS_PIDS_CGROUP }, // str EU_CGR
|
||
{ -1, -1, A_left, -1, PROCPS_PIDS_SUPGIDS }, // str EU_SGD
|
||
{ -1, -1, A_left, -1, PROCPS_PIDS_SUPGROUPS }, // str EU_SGN
|
||
{ 0, -1, A_right, -1, PROCPS_PIDS_ID_TGID }, // s_int EU_TGD
|
||
{ 5, -1, A_right, -1, PROCPS_PIDS_OOM_ADJ }, // s_int EU_OOA
|
||
{ 4, -1, A_right, -1, PROCPS_PIDS_OOM_SCORE }, // s_int EU_OOM
|
||
{ -1, -1, A_left, -1, PROCPS_PIDS_ENVIRON }, // str EU_ENV
|
||
{ 3, -1, A_right, -1, PROCPS_PIDS_FLT_MAJ_DELTA }, // sl_int EU_FV1
|
||
{ 3, -1, A_right, -1, PROCPS_PIDS_FLT_MIN_DELTA }, // sl_int EU_FV2
|
||
#ifndef NOBOOST_MEMS
|
||
{ 6, SK_Kb, A_right, -1, PROCPS_PIDS_VM_USED }, // sl_int EU_USE
|
||
#else
|
||
{ 4, SK_Kb, A_right, -1, PROCPS_PIDS_VM_USED }, // sl_int EU_USE
|
||
#endif
|
||
{ 10, -1, A_right, -1, PROCPS_PIDS_NS_IPC }, // ul_int EU_NS1
|
||
{ 10, -1, A_right, -1, PROCPS_PIDS_NS_MNT }, // ul_int EU_NS2
|
||
{ 10, -1, A_right, -1, PROCPS_PIDS_NS_NET }, // ul_int EU_NS3
|
||
{ 10, -1, A_right, -1, PROCPS_PIDS_NS_PID }, // ul_int EU_NS4
|
||
{ 10, -1, A_right, -1, PROCPS_PIDS_NS_USER }, // ul_int EU_NS5
|
||
{ 10, -1, A_right, -1, PROCPS_PIDS_NS_UTS }, // ul_int EU_NS6
|
||
{ 8, -1, A_left, -1, PROCPS_PIDS_LXCNAME }, // str EU_LXC
|
||
#ifndef NOBOOST_MEMS
|
||
{ 6, SK_Kb, A_right, -1, PROCPS_PIDS_VM_RSS_ANON }, // sl_int EU_RZA
|
||
{ 6, SK_Kb, A_right, -1, PROCPS_PIDS_VM_RSS_FILE }, // sl_int EU_RZF
|
||
{ 6, SK_Kb, A_right, -1, PROCPS_PIDS_VM_RSS_LOCKED }, // sl_int EU_RZL
|
||
{ 6, SK_Kb, A_right, -1, PROCPS_PIDS_VM_RSS_SHARED }, // sl_int EU_RZS
|
||
#else
|
||
{ 4, SK_Kb, A_right, -1, PROCPS_PIDS_VM_RSS_ANON }, // sl_int EU_RZA
|
||
{ 4, SK_Kb, A_right, -1, PROCPS_PIDS_VM_RSS_FILE }, // sl_int EU_RZF
|
||
{ 4, SK_Kb, A_right, -1, PROCPS_PIDS_VM_RSS_LOCKED }, // sl_int EU_RZL
|
||
{ 4, SK_Kb, A_right, -1, PROCPS_PIDS_VM_RSS_SHARED }, // sl_int EU_RZS
|
||
#endif
|
||
{ -1, -1, A_left, -1, PROCPS_PIDS_CGNAME }, // str EU_CGN
|
||
#define eu_LAST EU_CGN // ( the last real pflag, currently )
|
||
// xtra Fieldstab 'pseudo pflag' entries for the newlib interface . . . ----------------------------------
|
||
#define eu_CMDLINE eu_LAST +1
|
||
#define eu_TICS_ALL_C eu_LAST +2
|
||
#define eu_TIME_START eu_LAST +3
|
||
#define eu_ID_FUID eu_LAST +4
|
||
#define eu_XTRA eu_LAST +5
|
||
{ -1, -1, -1, -1, PROCPS_PIDS_CMDLINE }, // str ( if Show_CMDLIN )
|
||
{ -1, -1, -1, -1, PROCPS_PIDS_TICS_ALL_C }, // ull_int ( if Show_CTIMES )
|
||
{ -1, -1, -1, -1, PROCPS_PIDS_TIME_START }, // ull_int ( if Show_FOREST )
|
||
{ -1, -1, -1, -1, PROCPS_PIDS_ID_FUID }, // u_int ( if a usrseltyp )
|
||
{ -1, -1, -1, -1, PROCPS_PIDS_extra } // u_int ( if Show_FOREST )
|
||
#undef A_left
|
||
#undef A_right
|
||
};
|
||
|
||
|
||
/*
|
||
* A calibrate_fields() *Helper* function to refresh the
|
||
* cached screen geometry and related variables */
|
||
static void adj_geometry (void) {
|
||
static size_t pseudo_max = 0;
|
||
static int w_set = 0, w_cols = 0, w_rows = 0;
|
||
struct winsize wz;
|
||
|
||
Screen_cols = columns; // <term.h>
|
||
Screen_rows = lines; // <term.h>
|
||
|
||
if (-1 != ioctl(STDOUT_FILENO, TIOCGWINSZ, &wz)
|
||
&& 0 < wz.ws_col && 0 < wz.ws_row) {
|
||
Screen_cols = wz.ws_col;
|
||
Screen_rows = wz.ws_row;
|
||
}
|
||
|
||
#ifndef RMAN_IGNORED
|
||
// be crudely tolerant of crude tty emulators
|
||
if (Cap_avoid_eol) Screen_cols--;
|
||
#endif
|
||
|
||
// we might disappoint some folks (but they'll deserve it)
|
||
if (SCREENMAX < Screen_cols) Screen_cols = SCREENMAX;
|
||
|
||
if (!w_set) {
|
||
if (Width_mode > 0) // -w with arg, we'll try to honor
|
||
w_cols = Width_mode;
|
||
else
|
||
if (Width_mode < 0) { // -w without arg, try environment
|
||
char *env_columns = getenv("COLUMNS"),
|
||
*env_lines = getenv("LINES"),
|
||
*ep;
|
||
if (env_columns && *env_columns) {
|
||
long t, tc = 0;
|
||
t = strtol(env_columns, &ep, 0);
|
||
if (!*ep && (t > 0) && (t <= 0x7fffffffL)) tc = t;
|
||
if (0 < tc) w_cols = (int)tc;
|
||
}
|
||
if (env_lines && *env_lines) {
|
||
long t, tr = 0;
|
||
t = strtol(env_lines, &ep, 0);
|
||
if (!*ep && (t > 0) && (t <= 0x7fffffffL)) tr = t;
|
||
if (0 < tr) w_rows = (int)tr;
|
||
}
|
||
if (!w_cols) w_cols = SCREENMAX;
|
||
if (w_cols && w_cols < W_MIN_COL) w_cols = W_MIN_COL;
|
||
if (w_rows && w_rows < W_MIN_ROW) w_rows = W_MIN_ROW;
|
||
}
|
||
if (w_cols > SCREENMAX) w_cols = SCREENMAX;
|
||
w_set = 1;
|
||
}
|
||
|
||
/* keep our support for output optimization in sync with current reality
|
||
note: when we're in Batch mode, we don't really need a Pseudo_screen
|
||
and when not Batch, our buffer will contain 1 extra 'line' since
|
||
Msg_row is never represented -- but it's nice to have some space
|
||
between us and the great-beyond... */
|
||
if (Batch) {
|
||
if (w_cols) Screen_cols = w_cols;
|
||
Screen_rows = w_rows ? w_rows : INT_MAX;
|
||
Pseudo_size = (sizeof(*Pseudo_screen) * ROWMAXSIZ);
|
||
} else {
|
||
if (w_cols && w_cols < Screen_cols) Screen_cols = w_cols;
|
||
if (w_rows && w_rows < Screen_rows) Screen_rows = w_rows;
|
||
Pseudo_size = (sizeof(*Pseudo_screen) * ROWMAXSIZ) * Screen_rows;
|
||
}
|
||
// we'll only grow our Pseudo_screen, never shrink it
|
||
if (pseudo_max < Pseudo_size) {
|
||
pseudo_max = Pseudo_size;
|
||
Pseudo_screen = alloc_r(Pseudo_screen, pseudo_max);
|
||
}
|
||
// ensure each row is repainted (just in case)
|
||
PSU_CLREOS(0);
|
||
|
||
// prepare to customize potential cpu/memory graphs
|
||
Graph_len = Screen_cols - GRAPH_prefix - GRAPH_actual - GRAPH_suffix;
|
||
if (Graph_len >= 0) Graph_len = GRAPH_actual;
|
||
else if (Screen_cols > 80) Graph_len = Screen_cols - GRAPH_prefix - GRAPH_suffix;
|
||
else Graph_len = 80 - GRAPH_prefix - GRAPH_suffix;
|
||
Graph_adj = (float)Graph_len / 100.0;
|
||
|
||
fflush(stdout);
|
||
Frames_signal = BREAK_off;
|
||
} // end: adj_geometry
|
||
|
||
|
||
/*
|
||
* A calibrate_fields() *Helper* function to build the
|
||
* actual column headers and required library flags */
|
||
static void build_headers (void) {
|
||
#define ckITEM(f) do { if (Fieldstab[f].erel < 0) { Fieldstab[f].erel = Pids_itms_cur; \
|
||
Pids_itms[Pids_itms_cur++] = Fieldstab[f].item; } } while (0)
|
||
#define ckCMDS(w) do { if (CHKw(w, Show_CMDLIN)) ckITEM(eu_CMDLINE); \
|
||
else ckITEM(EU_CMD); } while (0)
|
||
FLG_t f;
|
||
char *s;
|
||
WIN_t *w = Curwin;
|
||
#ifdef EQUCOLHDRYES
|
||
int x, hdrmax = 0;
|
||
#endif
|
||
int i;
|
||
|
||
// reset the newlib enum selected indicator
|
||
Pids_itms_cur = 0;
|
||
for (i = 0; i < MAXTBL(Fieldstab); i++)
|
||
Fieldstab[i].erel = -1;
|
||
ckITEM(EU_PID); // these 5 fields may not display,
|
||
ckITEM(EU_STA); // yet we'll always need the 1st 2
|
||
ckITEM(EU_CMD);
|
||
ckITEM(EU_UED); // plus the last 3 would have been
|
||
ckITEM(EU_GID); // guaranteed under old lib scheme
|
||
|
||
do {
|
||
if (VIZISw(w)) {
|
||
memset((s = w->columnhdr), 0, sizeof(w->columnhdr));
|
||
if (Rc.mode_altscr) s = scat(s, fmtmk("%d", w->winnum));
|
||
|
||
for (i = 0; i < w->maxpflgs; i++) {
|
||
f = w->procflgs[i];
|
||
#ifdef USE_X_COLHDR
|
||
if (CHKw(w, Show_HICOLS) && f == w->rc.sortindx) {
|
||
s = scat(s, fmtmk("%s%s", Caps_off, w->capclr_msg));
|
||
w->hdrcaplen += strlen(Caps_off) + strlen(w->capclr_msg);
|
||
}
|
||
#else
|
||
if (EU_MAXPFLGS <= f) continue;
|
||
#endif
|
||
if (EU_CMD == f) ckCMDS(w);
|
||
else ckITEM(f);
|
||
|
||
s = scat(s, justify_pad(N_col(f)
|
||
, VARcol(f) ? w->varcolsz : Fieldstab[f].width
|
||
, CHKw(w, Fieldstab[f].align)));
|
||
#ifdef USE_X_COLHDR
|
||
if (CHKw(w, Show_HICOLS) && f == w->rc.sortindx) {
|
||
s = scat(s, fmtmk("%s%s", Caps_off, w->capclr_hdr));
|
||
w->hdrcaplen += strlen(Caps_off) + strlen(w->capclr_hdr);
|
||
}
|
||
#endif
|
||
}
|
||
#ifdef EQUCOLHDRYES
|
||
// prepare to even out column header lengths...
|
||
if (hdrmax + w->hdrcaplen < (x = strlen(w->columnhdr))) hdrmax = x - w->hdrcaplen;
|
||
#endif
|
||
// cpu calculations depend on number of threads
|
||
if (Fieldstab[EU_CPU].erel > -1) ckITEM(EU_THD);
|
||
// for 'busy' only processes, we'll need elapsed tics
|
||
if (!CHKw(w, Show_IDLEPS)) ckITEM(EU_CPU);
|
||
// with forest view mode, we'll need pid, tgid, ppid & start_time...
|
||
if (CHKw(w, Show_FOREST)) { ckITEM(EU_PPD); ckITEM(EU_TGD); ckITEM(eu_TIME_START); ckITEM(eu_XTRA); }
|
||
// for 'cumulative' times, we'll need equivalent of cutime & cstime
|
||
if (Fieldstab[EU_TME].erel > -1 && CHKw(w, Show_CTIMES)) ckITEM(eu_TICS_ALL_C);
|
||
if (Fieldstab[EU_TM2].erel > -1 && CHKw(w, Show_CTIMES)) ckITEM(eu_TICS_ALL_C);
|
||
// for 'u/U' filtering we need these too (old top forgot that, oops)
|
||
if (w->usrseltyp) { ckITEM(EU_URD); ckITEM(EU_USD); ckITEM(eu_ID_FUID); }
|
||
|
||
// we must also accommodate an out of view sort field...
|
||
f = w->rc.sortindx;
|
||
if (EU_CMD == f) ckCMDS(w);
|
||
else ckITEM(f);
|
||
} // end: VIZISw(w)
|
||
|
||
if (Rc.mode_altscr) w = w->next;
|
||
} while (w != Curwin);
|
||
|
||
#ifdef EQUCOLHDRYES
|
||
/* now we can finally even out column header lengths
|
||
(we're assuming entire columnhdr was memset to '\0') */
|
||
if (Rc.mode_altscr && SCREENMAX > Screen_cols)
|
||
for (i = 0; i < GROUPSMAX; i++) {
|
||
w = &Winstk[i];
|
||
if (CHKw(w, Show_TASKON))
|
||
if (hdrmax + w->hdrcaplen > (x = strlen(w->columnhdr)))
|
||
memset(&w->columnhdr[x], ' ', hdrmax + w->hdrcaplen - x);
|
||
}
|
||
#endif
|
||
|
||
#undef ckITEM
|
||
#undef ckCMDS
|
||
} // end: build_headers
|
||
|
||
|
||
/*
|
||
* This guy coordinates the activities surrounding the maintenance
|
||
* of each visible window's columns headers and the library flags
|
||
* required for the openproc interface. */
|
||
static void calibrate_fields (void) {
|
||
FLG_t f;
|
||
char *s;
|
||
const char *h;
|
||
WIN_t *w = Curwin;
|
||
int i, varcolcnt, len;
|
||
|
||
adj_geometry();
|
||
|
||
do {
|
||
if (VIZISw(w)) {
|
||
w->hdrcaplen = 0; // really only used with USE_X_COLHDR
|
||
// build window's pflgsall array, establish upper bounds for maxpflgs
|
||
for (i = 0, w->totpflgs = 0; i < EU_MAXPFLGS; i++) {
|
||
if (FLDviz(w, i)) {
|
||
f = FLDget(w, i);
|
||
#ifdef USE_X_COLHDR
|
||
w->pflgsall[w->totpflgs++] = f;
|
||
#else
|
||
if (CHKw(w, Show_HICOLS) && f == w->rc.sortindx) {
|
||
w->pflgsall[w->totpflgs++] = EU_XON;
|
||
w->pflgsall[w->totpflgs++] = f;
|
||
w->pflgsall[w->totpflgs++] = EU_XOF;
|
||
} else
|
||
w->pflgsall[w->totpflgs++] = f;
|
||
#endif
|
||
}
|
||
}
|
||
if (!w->totpflgs) w->pflgsall[w->totpflgs++] = EU_PID;
|
||
|
||
/* build a preliminary columns header not to exceed screen width
|
||
while accounting for a possible leading window number */
|
||
w->varcolsz = varcolcnt = 0;
|
||
*(s = w->columnhdr) = '\0';
|
||
if (Rc.mode_altscr) s = scat(s, " ");
|
||
for (i = 0; i + w->begpflg < w->totpflgs; i++) {
|
||
f = w->pflgsall[i + w->begpflg];
|
||
w->procflgs[i] = f;
|
||
#ifndef USE_X_COLHDR
|
||
if (EU_MAXPFLGS <= f) continue;
|
||
#endif
|
||
h = N_col(f);
|
||
len = (VARcol(f) ? (int)strlen(h) : Fieldstab[f].width) + COLPADSIZ;
|
||
// oops, won't fit -- we're outta here...
|
||
if (Screen_cols < ((int)(s - w->columnhdr) + len)) break;
|
||
if (VARcol(f)) { ++varcolcnt; w->varcolsz += strlen(h); }
|
||
s = scat(s, fmtmk("%*.*s", len, len, h));
|
||
}
|
||
#ifndef USE_X_COLHDR
|
||
if (EU_XON == w->procflgs[i - 1]) --i;
|
||
#endif
|
||
|
||
/* establish the final maxpflgs and prepare to grow the variable column
|
||
heading(s) via varcolsz - it may be a fib if their pflags weren't
|
||
encountered, but that's ok because they won't be displayed anyway */
|
||
w->maxpflgs = i;
|
||
w->varcolsz += Screen_cols - strlen(w->columnhdr);
|
||
if (varcolcnt) w->varcolsz /= varcolcnt;
|
||
|
||
/* establish the field where all remaining fields would still
|
||
fit within screen width, including a leading window number */
|
||
*(s = w->columnhdr) = '\0';
|
||
if (Rc.mode_altscr) s = scat(s, " ");
|
||
for (i = w->totpflgs - 1; -1 < i; i--) {
|
||
f = w->pflgsall[i];
|
||
#ifndef USE_X_COLHDR
|
||
if (EU_MAXPFLGS <= f) { w->endpflg = i; continue; }
|
||
#endif
|
||
h = N_col(f);
|
||
len = (VARcol(f) ? (int)strlen(h) : Fieldstab[f].width) + COLPADSIZ;
|
||
if (Screen_cols < ((int)(s - w->columnhdr) + len)) break;
|
||
s = scat(s, fmtmk("%*.*s", len, len, h));
|
||
w->endpflg = i;
|
||
}
|
||
#ifndef USE_X_COLHDR
|
||
if (EU_XOF == w->pflgsall[w->endpflg]) ++w->endpflg;
|
||
#endif
|
||
} // end: if (VIZISw(w))
|
||
|
||
if (Rc.mode_altscr) w = w->next;
|
||
} while (w != Curwin);
|
||
|
||
build_headers();
|
||
|
||
if (procps_pids_reset(Pids_ctx, Pids_itms, Pids_itms_cur))
|
||
error_exit(fmtmk(N_fmt(LIB_errorpid_fmt),__LINE__));
|
||
|
||
if (CHKw(Curwin, View_SCROLL))
|
||
updt_scroll_msg();
|
||
} // end: calibrate_fields
|
||
|
||
|
||
/*
|
||
* Display each field represented in the current window's fieldscur
|
||
* array along with its description. Mark with bold and a leading
|
||
* asterisk those fields associated with the "on" or "active" state.
|
||
*
|
||
* Special highlighting will be accorded the "focus" field with such
|
||
* highlighting potentially extended to include the description.
|
||
*
|
||
* Below is the current Fieldstab space requirement and how
|
||
* we apportion it. The xSUFX is considered sacrificial,
|
||
* something we can reduce or do without.
|
||
* 0 1 2 3
|
||
* 12345678901234567890123456789012
|
||
* * HEADING = Longest Description!
|
||
* xPRFX ----------______________________ xSUFX
|
||
* ( xPRFX has pos 2 & 10 for 'extending' when at minimums )
|
||
*
|
||
* The first 4 screen rows are reserved for explanatory text, and
|
||
* the maximum number of columns is Screen_cols / xPRFX + 1 space
|
||
* between columns. Thus, for example, with 42 fields a tty will
|
||
* still remain useable under these extremes:
|
||
* rows columns what's
|
||
* tty top tty top displayed
|
||
* --- --- --- --- ------------------
|
||
* 46 42 10 1 xPRFX only
|
||
* 46 42 32 1 full xPRFX + xSUFX
|
||
* 6 2 231 21 xPRFX only
|
||
* 10 6 231 7 full xPRFX + xSUFX
|
||
*/
|
||
static void display_fields (int focus, int extend) {
|
||
#define mkERR { putp("\n"); putp(N_txt(XTRA_winsize_txt)); return; }
|
||
#define mxCOL ( (Screen_cols / 11) > 0 ? (Screen_cols / 11) : 1 )
|
||
#define yRSVD 4
|
||
#define xSUFX 22
|
||
#define xPRFX (10 + xadd)
|
||
#define xTOTL (xPRFX + xSUFX)
|
||
WIN_t *w = Curwin; // avoid gcc bloat with a local copy
|
||
int i; // utility int (a row, tot cols, ix)
|
||
int smax; // printable width of xSUFX
|
||
int xadd = 0; // spacing between data columns
|
||
int cmax = Screen_cols; // total data column width
|
||
int rmax = Screen_rows - yRSVD; // total useable rows
|
||
static int col_sav, row_sav;
|
||
|
||
i = (EU_MAXPFLGS % mxCOL) ? 1 : 0;
|
||
if (rmax < i + (EU_MAXPFLGS / mxCOL)) mkERR;
|
||
i = EU_MAXPFLGS / rmax;
|
||
if (EU_MAXPFLGS % rmax) ++i;
|
||
if (i > 1) { cmax /= i; xadd = 1; }
|
||
if (cmax > xTOTL) cmax = xTOTL;
|
||
smax = cmax - xPRFX;
|
||
if (smax < 0) mkERR;
|
||
|
||
/* we'll go the extra distance to avoid any potential screen flicker
|
||
which occurs under some terminal emulators (but it was our fault) */
|
||
if (col_sav != Screen_cols || row_sav != Screen_rows) {
|
||
col_sav = Screen_cols;
|
||
row_sav = Screen_rows;
|
||
putp(Cap_clr_eos);
|
||
}
|
||
fflush(stdout);
|
||
|
||
for (i = 0; i < EU_MAXPFLGS; ++i) {
|
||
int b = FLDviz(w, i), x = (i / rmax) * cmax, y = (i % rmax) + yRSVD;
|
||
const char *e = (i == focus && extend) ? w->capclr_hdr : "";
|
||
FLG_t f = FLDget(w, i);
|
||
char sbuf[xSUFX+1];
|
||
|
||
// prep sacrificial suffix
|
||
snprintf(sbuf, sizeof(sbuf), "= %s", N_fld(f));
|
||
|
||
PUTT("%s%c%s%s %s%-7.7s%s%s%s %-*.*s%s"
|
||
, tg2(x, y)
|
||
, b ? '*' : ' '
|
||
, b ? w->cap_bold : Cap_norm
|
||
, e
|
||
, i == focus ? w->capclr_hdr : ""
|
||
, N_col(f)
|
||
, Cap_norm
|
||
, b ? w->cap_bold : ""
|
||
, e
|
||
, smax, smax
|
||
, sbuf
|
||
, Cap_norm);
|
||
}
|
||
|
||
putp(Caps_off);
|
||
#undef mkERR
|
||
#undef mxCOL
|
||
#undef yRSVD
|
||
#undef xSUFX
|
||
#undef xPRFX
|
||
#undef xTOTL
|
||
} // end: display_fields
|
||
|
||
|
||
/*
|
||
* Manage all fields aspects (order/toggle/sort), for all windows. */
|
||
static void fields_utility (void) {
|
||
#ifndef SCROLLVAR_NO
|
||
#define unSCRL { w->begpflg = w->varcolbeg = 0; OFFw(w, Show_HICOLS); }
|
||
#else
|
||
#define unSCRL { w->begpflg = 0; OFFw(w, Show_HICOLS); }
|
||
#endif
|
||
#define swapEM { char c; unSCRL; c = w->rc.fieldscur[i]; \
|
||
w->rc.fieldscur[i] = *p; *p = c; p = &w->rc.fieldscur[i]; }
|
||
#define spewFI { char *t; f = w->rc.sortindx; t = strchr(w->rc.fieldscur, f + FLD_OFFSET); \
|
||
if (!t) t = strchr(w->rc.fieldscur, (f + FLD_OFFSET) | 0x80); \
|
||
i = (t) ? (int)(t - w->rc.fieldscur) : 0; }
|
||
WIN_t *w = Curwin; // avoid gcc bloat with a local copy
|
||
const char *h = NULL;
|
||
char *p = NULL;
|
||
int i, key;
|
||
FLG_t f;
|
||
|
||
spewFI
|
||
signify_that:
|
||
putp(Cap_clr_scr);
|
||
adj_geometry();
|
||
|
||
do {
|
||
if (!h) h = N_col(f);
|
||
putp(Cap_home);
|
||
show_special(1, fmtmk(N_unq(FIELD_header_fmt)
|
||
, w->grpname, CHKw(w, Show_FOREST) ? N_txt(FOREST_views_txt) : h));
|
||
display_fields(i, (p != NULL));
|
||
fflush(stdout);
|
||
|
||
if (Frames_signal) goto signify_that;
|
||
key = iokey(1);
|
||
if (key < 1) goto signify_that;
|
||
|
||
switch (key) {
|
||
case kbd_UP:
|
||
if (i > 0) { --i; if (p) swapEM }
|
||
break;
|
||
case kbd_DOWN:
|
||
if (i + 1 < EU_MAXPFLGS) { ++i; if (p) swapEM }
|
||
break;
|
||
case kbd_LEFT:
|
||
case kbd_ENTER:
|
||
p = NULL;
|
||
break;
|
||
case kbd_RIGHT:
|
||
p = &w->rc.fieldscur[i];
|
||
break;
|
||
case kbd_HOME:
|
||
case kbd_PGUP:
|
||
if (!p) i = 0;
|
||
break;
|
||
case kbd_END:
|
||
case kbd_PGDN:
|
||
if (!p) i = EU_MAXPFLGS - 1;
|
||
break;
|
||
case kbd_SPACE:
|
||
case 'd':
|
||
if (!p) { FLDtog(w, i); unSCRL }
|
||
break;
|
||
case 's':
|
||
#ifdef TREE_NORESET
|
||
if (!p && !CHKw(w, Show_FOREST)) { w->rc.sortindx = f = FLDget(w, i); h = NULL; unSCRL }
|
||
#else
|
||
if (!p) { w->rc.sortindx = f = FLDget(w, i); h = NULL; unSCRL; OFFw(w, Show_FOREST); }
|
||
#endif
|
||
break;
|
||
case 'a':
|
||
case 'w':
|
||
Curwin = w = ('a' == key) ? w->next : w->prev;
|
||
spewFI
|
||
h = p = NULL;
|
||
break;
|
||
default: // keep gcc happy
|
||
break;
|
||
}
|
||
} while (key != 'q' && key != kbd_ESC);
|
||
#undef unSCRL
|
||
#undef swapEM
|
||
#undef spewFI
|
||
} // end: fields_utility
|
||
|
||
|
||
/*
|
||
* This routine takes care of auto sizing field widths
|
||
* if/when the user sets Rc.fixed_widest to -1. Along the
|
||
* way he reinitializes some things for the next frame. */
|
||
static inline void widths_resize (void) {
|
||
int i;
|
||
|
||
// next var may also be set by the guys that actually truncate stuff
|
||
Autox_found = 0;
|
||
for (i = 0; i < EU_MAXPFLGS; i++) {
|
||
if (Autox_array[i]) {
|
||
Fieldstab[i].width++;
|
||
Autox_array[i] = 0;
|
||
Autox_found = 1;
|
||
}
|
||
}
|
||
if (Autox_found) calibrate_fields();
|
||
} // end: widths_resize
|
||
|
||
|
||
/*
|
||
* This routine exists just to consolidate most of the messin'
|
||
* around with the Fieldstab array and some related stuff. */
|
||
static void zap_fieldstab (void) {
|
||
static int once;
|
||
unsigned digits;
|
||
char buf[8];
|
||
|
||
if (!once) {
|
||
Fieldstab[EU_PID].width = Fieldstab[EU_PPD].width
|
||
= Fieldstab[EU_PGD].width = Fieldstab[EU_SID].width
|
||
= Fieldstab[EU_TGD].width = Fieldstab[EU_TPG].width = 5;
|
||
if (5 < (digits = procps_pid_length())) {
|
||
if (10 < digits) error_exit(N_txt(FAIL_widepid_txt));
|
||
Fieldstab[EU_PID].width = Fieldstab[EU_PPD].width
|
||
= Fieldstab[EU_PGD].width = Fieldstab[EU_SID].width
|
||
= Fieldstab[EU_TGD].width = Fieldstab[EU_TPG].width = digits;
|
||
}
|
||
once = 1;
|
||
}
|
||
|
||
/*** hotplug_acclimated ***/
|
||
|
||
Fieldstab[EU_CPN].width = 1;
|
||
if (1 < (digits = (unsigned)snprintf(buf, sizeof(buf), "%u", (unsigned)Cpu_cnt))) {
|
||
if (5 < digits) error_exit(N_txt(FAIL_widecpu_txt));
|
||
Fieldstab[EU_CPN].width = digits;
|
||
}
|
||
|
||
#ifdef BOOST_PERCNT
|
||
Cpu_pmax = 99.9;
|
||
Fieldstab[EU_CPU].width = 5;
|
||
if (Rc.mode_irixps && Cpu_cnt > 1 && !Thread_mode) {
|
||
Cpu_pmax = 100.0 * Cpu_cnt;
|
||
if (Cpu_cnt > 10) {
|
||
if (Cpu_pmax > 99999.0) Cpu_pmax = 99999.0;
|
||
} else {
|
||
if (Cpu_pmax > 999.9) Cpu_pmax = 999.9;
|
||
}
|
||
}
|
||
#else
|
||
Cpu_pmax = 99.9;
|
||
Fieldstab[EU_CPU].width = 4;
|
||
if (Rc.mode_irixps && Cpu_cnt > 1 && !Thread_mode) {
|
||
Cpu_pmax = 100.0 * Cpu_cnt;
|
||
if (Cpu_cnt > 10) {
|
||
if (Cpu_pmax > 99999.0) Cpu_pmax = 99999.0;
|
||
} else {
|
||
if (Cpu_pmax > 999.9) Cpu_pmax = 999.9;
|
||
}
|
||
Fieldstab[EU_CPU].width = 5;
|
||
}
|
||
#endif
|
||
|
||
/* and accommodate optional wider non-scalable columns (maybe) */
|
||
if (!AUTOX_MODE) {
|
||
int i;
|
||
Fieldstab[EU_UED].width = Fieldstab[EU_URD].width
|
||
= Fieldstab[EU_USD].width = Fieldstab[EU_GID].width
|
||
= Rc.fixed_widest ? 5 + Rc.fixed_widest : 5;
|
||
Fieldstab[EU_UEN].width = Fieldstab[EU_URN].width
|
||
= Fieldstab[EU_USN].width = Fieldstab[EU_GRP].width
|
||
= Rc.fixed_widest ? 8 + Rc.fixed_widest : 8;
|
||
Fieldstab[EU_TTY].width = Fieldstab[EU_LXC].width
|
||
= Rc.fixed_widest ? 8 + Rc.fixed_widest : 8;
|
||
Fieldstab[EU_WCH].width
|
||
= Rc.fixed_widest ? 10 + Rc.fixed_widest : 10;
|
||
for (i = EU_NS1; i <= EU_NS6; i++)
|
||
Fieldstab[i].width
|
||
= Rc.fixed_widest ? 10 + Rc.fixed_widest : 10;
|
||
}
|
||
|
||
/* plus user selectable scaling */
|
||
Fieldstab[EU_VRT].scale = Fieldstab[EU_SWP].scale
|
||
= Fieldstab[EU_RES].scale = Fieldstab[EU_COD].scale
|
||
= Fieldstab[EU_DAT].scale = Fieldstab[EU_SHR].scale
|
||
= Fieldstab[EU_USE].scale = Fieldstab[EU_RZA].scale
|
||
= Fieldstab[EU_RZF].scale = Fieldstab[EU_RZL].scale
|
||
= Fieldstab[EU_RZS].scale = Rc.task_mscale;
|
||
|
||
// lastly, ensure we've got proper column headers...
|
||
calibrate_fields();
|
||
} // end: zap_fieldstab
|
||
|
||
/*###### Library Interface #############################################*/
|
||
|
||
/*
|
||
* This guy's responsible for interfacing with the library <stat> API
|
||
* and reaping all cpu or numa node tics.
|
||
* ( his task is now embarassingly small under the new api ) */
|
||
static void cpus_refresh (void) {
|
||
enum stat_reap_type which;
|
||
|
||
which = STAT_REAP_CPUS_ONLY;
|
||
#ifndef NUMA_DISABLE
|
||
if (CHKw(Curwin, View_CPUNOD))
|
||
which = STAT_REAP_CPUS_AND_NODES;
|
||
#endif
|
||
Stat_reap = procps_stat_reap(Stat_ctx, which, Stat_items, MAXTBL(Stat_items));
|
||
if (!Stat_reap)
|
||
error_exit(fmtmk(N_fmt(LIB_errorcpu_fmt),__LINE__));
|
||
// adapt to changes in total numa nodes (assuming it's even possible)
|
||
if (Stat_reap->nodes->total && Stat_reap->nodes->total != Numa_node_tot) {
|
||
Numa_node_tot = Stat_reap->nodes->total;
|
||
Numa_node_sel = -1;
|
||
}
|
||
if (Stat_reap->cpus->total && Stat_reap->cpus->total != Cpu_cnt)
|
||
Cpu_cnt = Stat_reap->cpus->total;
|
||
return;
|
||
} // end: cpus_refresh
|
||
|
||
|
||
/*
|
||
* This guy's responsible for interfacing with the library 'reap' pids
|
||
* and 'fill' stacks capabilities and refreshing the individual WIN_t
|
||
* head-of-stacks arrays, growing them as appropirate. */
|
||
static void procs_refresh (void) {
|
||
#define nALIGN(n,m) (((n + m - 1) / m) * m) // unconditionally align
|
||
#define nALGN2(n,m) ((n + m - 1) & ~(m - 1)) // with power of 2 align
|
||
#define n_reap Pids_read->counts.total
|
||
static double uptime_sav;
|
||
static int n_alloc = -1; // size of windows stacks arrays
|
||
double uptime_cur;
|
||
float et;
|
||
int i;
|
||
|
||
procps_uptime(&uptime_cur, NULL);
|
||
et = uptime_cur - uptime_sav;
|
||
if (et < 0.01) et = 0.005;
|
||
uptime_sav = uptime_cur;
|
||
// if in Solaris mode, adjust our scaling for all cpus
|
||
Frame_etscale = 100.0f / ((float)Hertz * (float)et * (Rc.mode_irixps ? 1 : Cpu_cnt));
|
||
|
||
if (Monpidsidx) Pids_read = procps_pids_select(Pids_ctx, Monpids, Monpidsidx, PROCPS_SELECT_PID);
|
||
else Pids_read = procps_pids_reap(Pids_ctx, Thread_mode ? PROCPS_FETCH_THREADS_TOO : PROCPS_FETCH_TASKS_ONLY);
|
||
if (!Pids_read)
|
||
error_exit(fmtmk(N_fmt(LIB_errorpid_fmt),__LINE__));
|
||
|
||
// now refresh each window's stack heads pointers table...
|
||
if (n_alloc < n_reap) {
|
||
// n_alloc = nALIGN(n_reap, 100);
|
||
n_alloc = nALGN2(n_reap, 128);
|
||
for (i = 0; i < GROUPSMAX; i++) {
|
||
Winstk[i].ppt = alloc_r(Winstk[i].ppt, sizeof(void*) * n_alloc);
|
||
memcpy(Winstk[i].ppt, Pids_read->stacks, sizeof(void*) * PIDSmaxt);
|
||
}
|
||
} else {
|
||
for (i = 0; i < GROUPSMAX; i++)
|
||
memcpy(Winstk[i].ppt, Pids_read->stacks, sizeof(void*) * PIDSmaxt);
|
||
}
|
||
#undef n_reap
|
||
#undef nALGN2
|
||
#undef nALIGN
|
||
} // end: procs_refresh
|
||
|
||
|
||
/*
|
||
* This serves as our interface to the memory & cpu count (sysinfo)
|
||
* portion of libproc. In support of those hotpluggable resources,
|
||
* the sampling frequencies are reduced so as to minimize overhead. */
|
||
static void sysinfo_refresh (int forced) {
|
||
static time_t mem_secs, cpu_secs;
|
||
time_t cur_secs;
|
||
|
||
if (forced)
|
||
mem_secs = cpu_secs = 0;
|
||
cur_secs = time(NULL);
|
||
|
||
/*** hotplug_acclimated ***/
|
||
if (3 <= cur_secs - mem_secs) {
|
||
if (!(Mem_stack = procps_meminfo_select(Mem_ctx, Mem_items, MAXTBL(Mem_items))))
|
||
error_exit(fmtmk(N_fmt(LIB_errormem_fmt),__LINE__));
|
||
mem_secs = cur_secs;
|
||
}
|
||
} // end: sysinfo_refresh
|
||
|
||
/*###### Inspect Other Output ##########################################*/
|
||
|
||
/*
|
||
* HOWTO Extend the top 'inspect' functionality:
|
||
*
|
||
* To exploit the 'Y' interactive command, one must add entries to
|
||
* the top personal configuration file. Such entries simply reflect
|
||
* a file to be read or command/pipeline to be executed whose results
|
||
* will then be displayed in a separate scrollable window.
|
||
*
|
||
* Entries beginning with a '#' character are ignored, regardless of
|
||
* content. Otherwise they consist of the following 3 elements, each
|
||
* of which must be separated by a tab character (thus 2 '\t' total):
|
||
* type: literal 'file' or 'pipe'
|
||
* name: selection shown on the Inspect screen
|
||
* fmts: string representing a path or command
|
||
*
|
||
* The two types of Inspect entries are not interchangeable.
|
||
* Those designated 'file' will be accessed using fopen/fread and must
|
||
* reference a single file in the 'fmts' element. Entries specifying
|
||
* 'pipe' will employ popen/fread, their 'fmts' element could contain
|
||
* many pipelined commands and, none can be interactive.
|
||
*
|
||
* Here are some examples of both types of inspection entries.
|
||
* The first entry will be ignored due to the initial '#' character.
|
||
* For clarity, the pseudo tab depictions (^I) are surrounded by an
|
||
* extra space but the actual tabs would not be.
|
||
*
|
||
* # pipe ^I Sockets ^I lsof -n -P -i 2>&1
|
||
* pipe ^I Open Files ^I lsof -P -p %d 2>&1
|
||
* file ^I NUMA Info ^I /proc/%d/numa_maps
|
||
* pipe ^I Log ^I tail -n100 /var/log/syslog | sort -Mr
|
||
*
|
||
* Caution: If the output contains unprintable characters they will
|
||
* be displayed in either the ^I notation or hexidecimal <FF> form.
|
||
* This applies to tab characters as well. So if one wants a more
|
||
* accurate display, any tabs should be expanded within the 'fmts'.
|
||
*
|
||
* The following example takes what could have been a 'file' entry
|
||
* but employs a 'pipe' instead so as to expand the tabs.
|
||
*
|
||
* # next would have contained '\t' ...
|
||
* # file ^I <your_name> ^I /proc/%d/status
|
||
* # but this will eliminate embedded '\t' ...
|
||
* pipe ^I <your_name> ^I cat /proc/%d/status | expand -
|
||
*/
|
||
|
||
/*
|
||
* Our driving table support, the basis for generalized inspection,
|
||
* built at startup (if at all) from rcfile or demo entries. */
|
||
struct I_ent {
|
||
void (*func)(char *, int); // a pointer to file/pipe/demo function
|
||
char *type; // the type of entry ('file' or 'pipe')
|
||
char *name; // the selection label for display
|
||
char *fmts; // format string to build path or command
|
||
int farg; // 1 = '%d' in fmts, 0 = not (future use)
|
||
const char *caps; // not really caps, show_special() delim's
|
||
char *fstr; // entry's current/active search string
|
||
int flen; // above's strlen, without call overhead
|
||
};
|
||
struct I_struc {
|
||
int demo; // do NOT save table entries in rcfile
|
||
int total; // total I_ent table entries
|
||
char *raw; // all entries for 'W', incl '#' & blank
|
||
struct I_ent *tab;
|
||
};
|
||
static struct I_struc Inspect;
|
||
|
||
static char **Insp_p; // pointers to each line start
|
||
static int Insp_nl; // total lines, total Insp_p entries
|
||
static char *Insp_buf; // the results from insp_do_file/pipe
|
||
static size_t Insp_bufsz; // allocated size of Insp_buf
|
||
static size_t Insp_bufrd; // bytes actually in Insp_buf
|
||
static struct I_ent *Insp_sel; // currently selected Inspect entry
|
||
|
||
// Our 'make status line' macro
|
||
#define INSP_MKSL(big,txt) { int _sz = big ? Screen_cols : 80; \
|
||
putp(tg2(0, (Msg_row = 3))); \
|
||
PUTT("%s%.*s", Curwin->capclr_hdr, Screen_cols -1 \
|
||
, fmtmk("%-*.*s%s", _sz, _sz, txt, Cap_clr_eol)); \
|
||
putp(Caps_off); fflush(stdout); }
|
||
|
||
// Our 'row length' macro, equivalent to a strlen() call
|
||
#define INSP_RLEN(idx) (int)(Insp_p[idx +1] - Insp_p[idx] -1)
|
||
|
||
// Our 'busy' (wait please) macro
|
||
#define INSP_BUSY { INSP_MKSL(0, N_txt(YINSP_workin_txt)); }
|
||
|
||
|
||
/*
|
||
* Establish the number of lines present in the Insp_buf glob plus
|
||
* build the all important row start array. It is that array that
|
||
* others will rely on since we dare not try to use strlen() on what
|
||
* is potentially raw binary data. Who knows what some user might
|
||
* name as a file or include in a pipeline (scary, ain't it?). */
|
||
static void insp_cnt_nl (void) {
|
||
char *beg = Insp_buf;
|
||
char *cur = Insp_buf;
|
||
char *end = Insp_buf + Insp_bufrd + 1;
|
||
|
||
#ifdef INSP_SAVEBUF
|
||
{
|
||
static int n = 1;
|
||
char fn[SMLBUFSIZ];
|
||
FILE *fd;
|
||
snprintf(fn, sizeof(fn), "%s.Insp_buf.%02d.txt", Myname, n++);
|
||
fd = fopen(fn, "w");
|
||
if (fd) {
|
||
fwrite(Insp_buf, 1, Insp_bufrd, fd);
|
||
fclose(fd);
|
||
}
|
||
}
|
||
#endif
|
||
Insp_p = alloc_c(sizeof(char*) * 2);
|
||
|
||
for (Insp_nl = 0; beg < end; beg++) {
|
||
if (*beg == '\n') {
|
||
Insp_p[Insp_nl++] = cur;
|
||
// keep our array ahead of next potential need (plus the 2 above)
|
||
Insp_p = alloc_r(Insp_p, (sizeof(char*) * (Insp_nl +3)));
|
||
cur = beg +1;
|
||
}
|
||
}
|
||
Insp_p[0] = Insp_buf;
|
||
Insp_p[Insp_nl++] = cur;
|
||
Insp_p[Insp_nl] = end;
|
||
if ((end - cur) == 1) // if there's an eof null delimiter,
|
||
--Insp_nl; // don't count it as a new line
|
||
} // end: insp_cnt_nl
|
||
|
||
|
||
#ifndef INSP_OFFDEMO
|
||
/*
|
||
* The pseudo output DEMO utility. */
|
||
static void insp_do_demo (char *fmts, int pid) {
|
||
(void)fmts; (void)pid;
|
||
/* next will put us on a par with the real file/pipe read buffers
|
||
( and also avoid a harmless, but evil sounding, valgrind warning ) */
|
||
Insp_bufsz = READMINSZ + strlen(N_txt(YINSP_dstory_txt));
|
||
Insp_buf = alloc_c(Insp_bufsz);
|
||
Insp_bufrd = snprintf(Insp_buf, Insp_bufsz, "%s", N_txt(YINSP_dstory_txt));
|
||
insp_cnt_nl();
|
||
} // end: insp_do_demo
|
||
#endif
|
||
|
||
|
||
/*
|
||
* The generalized FILE utility. */
|
||
static void insp_do_file (char *fmts, int pid) {
|
||
char buf[LRGBUFSIZ];
|
||
FILE *fp;
|
||
int rc;
|
||
|
||
snprintf(buf, sizeof(buf), fmts, pid);
|
||
fp = fopen(buf, "r");
|
||
rc = readfile(fp, &Insp_buf, &Insp_bufsz, &Insp_bufrd);
|
||
if (fp) fclose(fp);
|
||
if (rc) Insp_bufrd = snprintf(Insp_buf, Insp_bufsz, "%s"
|
||
, fmtmk(N_fmt(YINSP_failed_fmt), strerror(errno)));
|
||
insp_cnt_nl();
|
||
} // end: insp_do_file
|
||
|
||
|
||
/*
|
||
* The generalized PIPE utility. */
|
||
static void insp_do_pipe (char *fmts, int pid) {
|
||
char buf[LRGBUFSIZ];
|
||
FILE *fp;
|
||
int rc;
|
||
|
||
snprintf(buf, sizeof(buf), fmts, pid);
|
||
fp = popen(buf, "r");
|
||
rc = readfile(fp, &Insp_buf, &Insp_bufsz, &Insp_bufrd);
|
||
if (fp) pclose(fp);
|
||
if (rc) Insp_bufrd = snprintf(Insp_buf, Insp_bufsz, "%s"
|
||
, fmtmk(N_fmt(YINSP_failed_fmt), strerror(errno)));
|
||
insp_cnt_nl();
|
||
} // end: insp_do_pipe
|
||
|
||
|
||
/*
|
||
* This guy is a *Helper* function serving the following two masters:
|
||
* insp_find_str() - find the next Insp_sel->fstr match
|
||
* insp_make_row() - highlight any Insp_sel->fstr matches in-view
|
||
* If Insp_sel->fstr is found in the designated row, he returns the
|
||
* offset from the start of the row, otherwise he returns a huge
|
||
* integer so traditional fencepost usage can be employed. */
|
||
static inline int insp_find_ofs (int col, int row) {
|
||
#define begFS (int)(fnd - Insp_p[row])
|
||
char *p, *fnd = NULL;
|
||
|
||
if (Insp_sel->fstr[0]) {
|
||
// skip this row, if there's no chance of a match
|
||
if (memchr(Insp_p[row], Insp_sel->fstr[0], INSP_RLEN(row))) {
|
||
for ( ; col < INSP_RLEN(row); col++) {
|
||
if (!*(p = Insp_p[row] + col)) // skip any empty strings
|
||
continue;
|
||
fnd = STRSTR(p, Insp_sel->fstr); // with binary data, each
|
||
if (fnd) // row may have '\0'. so
|
||
break; // our scans must be done
|
||
col += strlen(p); // as individual strings.
|
||
}
|
||
if (fnd && fnd < Insp_p[row + 1]) // and, we must watch out
|
||
return begFS; // for potential overrun!
|
||
}
|
||
}
|
||
return INT_MAX;
|
||
#undef begFS
|
||
} // end: insp_find_ofs
|
||
|
||
|
||
/*
|
||
* This guy supports the inspect 'L' and '&' search provisions
|
||
* and returns the row and *optimal* column for viewing any match
|
||
* ( we'll always opt for left column justification since any )
|
||
* ( preceding ctrl chars appropriate an unpredictable amount ) */
|
||
static void insp_find_str (int ch, int *col, int *row) {
|
||
#define reDUX (found) ? N_txt(WORD_another_txt) : ""
|
||
static int found;
|
||
|
||
if ((ch == '&' || ch == 'n') && !Insp_sel->fstr[0]) {
|
||
show_msg(N_txt(FIND_no_next_txt));
|
||
return;
|
||
}
|
||
if (ch == 'L' || ch == '/') {
|
||
char *str = ioline(N_txt(GET_find_str_txt));
|
||
if (*str == kbd_ESC) return;
|
||
snprintf(Insp_sel->fstr, FNDBUFSIZ, "%s", str);
|
||
Insp_sel->flen = strlen(Insp_sel->fstr);
|
||
found = 0;
|
||
}
|
||
if (Insp_sel->fstr[0]) {
|
||
int xx, yy;
|
||
|
||
INSP_BUSY;
|
||
for (xx = *col, yy = *row; yy < Insp_nl; ) {
|
||
xx = insp_find_ofs(xx, yy);
|
||
if (xx < INSP_RLEN(yy)) {
|
||
found = 1;
|
||
if (xx == *col && yy == *row) { // matched where we were!
|
||
++xx; // ( was the user maybe )
|
||
continue; // ( trying to fool us? )
|
||
}
|
||
*col = xx;
|
||
*row = yy;
|
||
return;
|
||
}
|
||
xx = 0;
|
||
++yy;
|
||
}
|
||
show_msg(fmtmk(N_fmt(FIND_no_find_fmt), reDUX, Insp_sel->fstr));
|
||
}
|
||
#undef reDUX
|
||
} // end: insp_find_str
|
||
|
||
|
||
/*
|
||
* This guy is a *Helper* function responsible for positioning a
|
||
* single row in the current 'X axis', then displaying the results.
|
||
* Along the way, he makes sure control characters and/or unprintable
|
||
* characters display in a less-like fashion:
|
||
* '^A' for control chars
|
||
* '<BC>' for other unprintable stuff
|
||
* Those will be highlighted with the current windows's capclr_msg,
|
||
* while visible search matches display with capclr_hdr for emphasis.
|
||
* ( we hide ugly plumbing in macros to concentrate on the algorithm ) */
|
||
static inline void insp_make_row (int col, int row) {
|
||
#define maxSZ ( Screen_cols - (to + 1) )
|
||
#define capNO { if (hicap) { putp(Caps_off); hicap = 0; } }
|
||
#define mkFND { PUTT("%s%.*s%s", Curwin->capclr_hdr, maxSZ, Insp_sel->fstr, Caps_off); \
|
||
fr += Insp_sel->flen -1; to += Insp_sel->flen; hicap = 0; }
|
||
#ifndef INSP_JUSTNOT
|
||
#define mkCTL { int x = maxSZ; const char *p = fmtmk("^%c", uch + '@'); \
|
||
PUTT("%s%.*s", (!hicap) ? Curwin->capclr_msg : "", x, p); to += 2; hicap = 1; }
|
||
#define mkUNP { int x = maxSZ; const char *p = fmtmk("<%02X>", uch); \
|
||
PUTT("%s%.*s", (!hicap) ? Curwin->capclr_msg : "", x, p); to += 4; hicap = 1; }
|
||
#else
|
||
#define mkCTL { if ((to += 2) <= Screen_cols) \
|
||
PUTT("%s^%c", (!hicap) ? Curwin->capclr_msg : "", uch + '@'); hicap = 1; }
|
||
#define mkUNP { if ((to += 4) <= Screen_cols) \
|
||
PUTT("%s<%02X>", (!hicap) ? Curwin->capclr_msg : "", uch); hicap = 1; }
|
||
#endif
|
||
#define mkSTD { capNO; if (++to <= Screen_cols) { static char _str[2]; \
|
||
_str[0] = uch; putp(_str); } }
|
||
char tline[SCREENMAX];
|
||
int fr, to, ofs;
|
||
int hicap = 0;
|
||
|
||
if (col < INSP_RLEN(row))
|
||
memcpy(tline, Insp_p[row] + col, sizeof(tline));
|
||
else tline[0] = '\n';
|
||
|
||
for (fr = 0, to = 0, ofs = 0; to < Screen_cols -1; fr++) {
|
||
if (!ofs)
|
||
ofs = insp_find_ofs(col + fr, row);
|
||
if (col + fr < ofs) {
|
||
unsigned char uch = tline[fr];
|
||
if (uch == '\n') break; // a no show (he,he)
|
||
if (uch > 126) mkUNP // show as: '<AB>'
|
||
else if (uch < 32) mkCTL // show as: '^C'
|
||
else mkSTD // a show off (he,he)
|
||
} else { mkFND // a big show (he,he)
|
||
ofs = 0;
|
||
}
|
||
if (col + fr >= INSP_RLEN(row)) break;
|
||
}
|
||
capNO;
|
||
putp(Cap_clr_eol);
|
||
|
||
#undef maxSZ
|
||
#undef capNO
|
||
#undef mkFND
|
||
#undef mkCTL
|
||
#undef mkUNP
|
||
#undef mkSTD
|
||
} // end: insp_make_row
|
||
|
||
|
||
/*
|
||
* This guy is an insp_view_choice() *Helper* function who displays
|
||
* a page worth of of the user's damages. He also creates a status
|
||
* line based on maximum digits for the current selection's lines and
|
||
* hozizontal position (so it serves to inform, not distract, by
|
||
* otherwise being jumpy). */
|
||
static inline void insp_show_pgs (int col, int row, int max) {
|
||
char buf[SMLBUFSIZ];
|
||
int r = snprintf(buf, sizeof(buf), "%d", Insp_nl);
|
||
int c = snprintf(buf, sizeof(buf), "%d", col +Screen_cols);
|
||
int l = row +1, ls = Insp_nl;;
|
||
|
||
if (!Insp_bufrd)
|
||
l = ls = 0;
|
||
snprintf(buf, sizeof(buf), N_fmt(YINSP_status_fmt)
|
||
, Insp_sel->name
|
||
, r, l, r, ls
|
||
, c, col + 1, c, col + Screen_cols
|
||
, (unsigned long)Insp_bufrd);
|
||
INSP_MKSL(0, buf);
|
||
|
||
for ( ; max && row < Insp_nl; row++) {
|
||
putp("\n");
|
||
insp_make_row(col, row);
|
||
--max;
|
||
}
|
||
|
||
if (max)
|
||
putp(Cap_nl_clreos);
|
||
} // end: insp_show_pgs
|
||
|
||
|
||
/*
|
||
* This guy is responsible for displaying the Insp_buf contents and
|
||
* managing all scrolling/locate requests until the user gives up. */
|
||
static int insp_view_choice (struct pids_stack *obj) {
|
||
#ifdef INSP_SLIDE_1
|
||
#define hzAMT 1
|
||
#else
|
||
#define hzAMT 8
|
||
#endif
|
||
#define maxLN (Screen_rows - (Msg_row +1))
|
||
#define makHD(b1,b2) { \
|
||
snprintf(b1, sizeof(b1), "%d", PID_VAL(EU_PID, s_int, obj)); \
|
||
snprintf(b2, sizeof(b2), "%s", PID_VAL(EU_CMD, str, obj)); }
|
||
#define makFS(dst) { if (Insp_sel->flen < 22) \
|
||
snprintf(dst, sizeof(dst), "%s", Insp_sel->fstr); \
|
||
else snprintf(dst, sizeof(dst), "%.19s...", Insp_sel->fstr); }
|
||
char buf[SMLBUFSIZ];
|
||
int key, curlin = 0, curcol = 0;
|
||
|
||
signify_that:
|
||
putp(Cap_clr_scr);
|
||
adj_geometry();
|
||
|
||
for (;;) {
|
||
char pid[6], cmd[16];
|
||
|
||
if (curcol < 0) curcol = 0;
|
||
if (curlin >= Insp_nl) curlin = Insp_nl -1;
|
||
if (curlin < 0) curlin = 0;
|
||
|
||
makFS(buf)
|
||
makHD(pid,cmd)
|
||
putp(Cap_home);
|
||
show_special(1, fmtmk(N_unq(YINSP_hdview_fmt)
|
||
, pid, cmd, (Insp_sel->fstr[0]) ? buf : " N/A ")); // nls_maybe
|
||
insp_show_pgs(curcol, curlin, maxLN);
|
||
fflush(stdout);
|
||
/* fflush(stdin) didn't do the trick, so we'll just dip a little deeper
|
||
lest repeated <Enter> keys produce immediate re-selection in caller */
|
||
tcflush(STDIN_FILENO, TCIFLUSH);
|
||
|
||
if (Frames_signal) goto signify_that;
|
||
key = iokey(1);
|
||
if (key < 1) goto signify_that;
|
||
|
||
switch (key) {
|
||
case kbd_ENTER: // must force new iokey()
|
||
key = INT_MAX; // fall through !
|
||
case kbd_ESC:
|
||
case 'q':
|
||
putp(Cap_clr_scr);
|
||
return key;
|
||
case kbd_LEFT:
|
||
curcol -= hzAMT;
|
||
break;
|
||
case kbd_RIGHT:
|
||
curcol += hzAMT;
|
||
break;
|
||
case kbd_UP:
|
||
--curlin;
|
||
break;
|
||
case kbd_DOWN:
|
||
++curlin;
|
||
break;
|
||
case kbd_PGUP:
|
||
case 'b':
|
||
curlin -= maxLN -1; // keep 1 line for reference
|
||
break;
|
||
case kbd_PGDN:
|
||
case kbd_SPACE:
|
||
curlin += maxLN -1; // ditto
|
||
break;
|
||
case kbd_HOME:
|
||
case 'g':
|
||
curcol = curlin = 0;
|
||
break;
|
||
case kbd_END:
|
||
case 'G':
|
||
curcol = 0;
|
||
curlin = Insp_nl - maxLN;
|
||
break;
|
||
case 'L':
|
||
case '&':
|
||
case '/':
|
||
case 'n':
|
||
insp_find_str(key, &curcol, &curlin);
|
||
// must re-hide cursor in case a prompt for a string makes it huge
|
||
putp((Cursor_state = Cap_curs_hide));
|
||
break;
|
||
case '=':
|
||
snprintf(buf, sizeof(buf), "%s: %s", Insp_sel->type, Insp_sel->fmts);
|
||
INSP_MKSL(1, buf); // show an extended SL
|
||
if (iokey(1) < 1)
|
||
goto signify_that;
|
||
break;
|
||
default: // keep gcc happy
|
||
break;
|
||
}
|
||
}
|
||
#undef hzAMT
|
||
#undef maxLN
|
||
#undef makHD
|
||
#undef makFS
|
||
} // end: insp_view_choice
|
||
|
||
|
||
/*
|
||
* This is the main Inspect routine, responsible for:
|
||
* 1) validating the passed pid (required, but not always used)
|
||
* 2) presenting/establishing the target selection
|
||
* 3) arranging to fill Insp_buf (via the Inspect.tab[?].func)
|
||
* 4) invoking insp_view_choice for viewing/scrolling/searching
|
||
* 5) cleaning up the dynamically acquired memory afterwards */
|
||
static void inspection_utility (int pid) {
|
||
#define mkSEL(dst) { for (i = 0; i < Inspect.total; i++) Inspect.tab[i].caps = "~1"; \
|
||
Inspect.tab[sel].caps = "~4"; dst[0] = '\0'; \
|
||
for (i = 0; i < Inspect.total; i++) { char _s[SMLBUFSIZ]; \
|
||
snprintf(_s, sizeof(_s), " %s %s", Inspect.tab[i].name, Inspect.tab[i].caps); \
|
||
strcat(dst, _s); } }
|
||
char sels[MEDBUFSIZ];
|
||
static int sel;
|
||
int i, key;
|
||
struct pids_stack *p;
|
||
|
||
for (i = 0, p = NULL; i < PIDSmaxt; i++)
|
||
if (pid == PID_VAL(EU_PID, s_int, Curwin->ppt[i])) {
|
||
p = Curwin->ppt[i];
|
||
break;
|
||
}
|
||
if (!p) {
|
||
show_msg(fmtmk(N_fmt(YINSP_pidbad_fmt), pid));
|
||
return;
|
||
}
|
||
// must re-hide cursor since the prompt for a pid made it huge
|
||
putp((Cursor_state = Cap_curs_hide));
|
||
signify_that:
|
||
putp(Cap_clr_scr);
|
||
adj_geometry();
|
||
|
||
key = INT_MAX;
|
||
do {
|
||
mkSEL(sels);
|
||
putp(Cap_home);
|
||
show_special(1, fmtmk(N_unq(YINSP_hdsels_fmt)
|
||
, pid, PID_VAL(EU_CMD, str, Curwin->ppt[i]), sels));
|
||
INSP_MKSL(0, " ");
|
||
|
||
if (Frames_signal) goto signify_that;
|
||
if (key == INT_MAX) key = iokey(1);
|
||
if (key < 1) goto signify_that;
|
||
|
||
switch (key) {
|
||
case 'q':
|
||
case kbd_ESC:
|
||
break;
|
||
case kbd_END:
|
||
sel = 0; // fall through !
|
||
case kbd_LEFT:
|
||
if (--sel < 0) sel = Inspect.total -1;
|
||
key = INT_MAX;
|
||
break;
|
||
case kbd_HOME:
|
||
sel = Inspect.total; // fall through !
|
||
case kbd_RIGHT:
|
||
if (++sel >= Inspect.total) sel = 0;
|
||
key = INT_MAX;
|
||
break;
|
||
case kbd_ENTER:
|
||
INSP_BUSY;
|
||
Insp_sel = &Inspect.tab[sel];
|
||
Inspect.tab[sel].func(Inspect.tab[sel].fmts, pid);
|
||
key = insp_view_choice(p);
|
||
free(Insp_buf);
|
||
free(Insp_p);
|
||
break;
|
||
default:
|
||
goto signify_that;
|
||
}
|
||
} while (key != 'q' && key != kbd_ESC);
|
||
|
||
#undef mkSEL
|
||
} // end: inspection_utility
|
||
|
||
#undef INSP_MKSL
|
||
#undef INSP_RLEN
|
||
#undef INSP_BUSY
|
||
|
||
/*###### Startup routines ##############################################*/
|
||
|
||
/*
|
||
* No matter what *they* say, we handle the really really BIG and
|
||
* IMPORTANT stuff upon which all those lessor functions depend! */
|
||
static void before (char *me) {
|
||
enum stat_reap_type which;
|
||
struct sigaction sa;
|
||
int i;
|
||
int linux_version_code = procps_linux_version();
|
||
|
||
atexit(close_stdout);
|
||
|
||
// is /proc mounted?
|
||
fatal_proc_unmounted(NULL, 0);
|
||
|
||
// setup our program name
|
||
Myname = strrchr(me, '/');
|
||
if (Myname) ++Myname; else Myname = me;
|
||
|
||
// accommodate nls/gettext potential translations
|
||
initialize_nls();
|
||
|
||
// establish some cpu particulars
|
||
Hertz = procps_hertz_get();
|
||
Cpu_States_fmts = N_unq(STATE_lin2x6_fmt);
|
||
if (linux_version_code >= LINUX_VERSION(2, 6, 11))
|
||
Cpu_States_fmts = N_unq(STATE_lin2x7_fmt);
|
||
|
||
// get the total cpus (and, if possible, max numa node number)
|
||
which = STAT_REAP_CPUS_ONLY;
|
||
#ifndef NUMA_DISABLE
|
||
which = STAT_REAP_CPUS_AND_NODES;
|
||
#endif
|
||
if (procps_stat_new(&Stat_ctx) < 0
|
||
|| !(Stat_reap = procps_stat_reap(Stat_ctx, which, Stat_items, MAXTBL(Stat_items))))
|
||
error_exit(fmtmk(N_fmt(LIB_errorcpu_fmt),__LINE__));
|
||
Numa_node_tot = Stat_reap->nodes->total;
|
||
Cpu_cnt = Stat_reap->cpus->total;
|
||
|
||
// prepare for memory stats from new library API ...
|
||
if (procps_meminfo_new(&Mem_ctx) < 0)
|
||
error_exit(fmtmk(N_fmt(LIB_errormem_fmt),__LINE__));
|
||
|
||
// establish max depth for newlib pids stack (# of result structs)
|
||
Pids_itms = alloc_c(sizeof(enum pids_item) * MAXTBL(Fieldstab));
|
||
for (i = 0; i < MAXTBL(Fieldstab); i++)
|
||
Pids_itms[i] = PROCPS_PIDS_noop;
|
||
Pids_itms_cur = i;
|
||
// we will identify specific items in the build_headers() function
|
||
if (procps_pids_new(&Pids_ctx, Pids_itms, Pids_itms_cur))
|
||
error_exit(fmtmk(N_fmt(LIB_errorpid_fmt),__LINE__));
|
||
|
||
#ifndef SIGRTMAX // not available on hurd, maybe others too
|
||
#define SIGRTMAX 32
|
||
#endif
|
||
// lastly, establish a robust signals environment
|
||
sigemptyset(&sa.sa_mask);
|
||
// with user position preserved through SIGWINCH, we must avoid SA_RESTART
|
||
sa.sa_flags = 0;
|
||
for (i = SIGRTMAX; i; i--) {
|
||
switch (i) {
|
||
case SIGALRM: case SIGHUP: case SIGINT:
|
||
case SIGPIPE: case SIGQUIT: case SIGTERM:
|
||
case SIGUSR1: case SIGUSR2:
|
||
sa.sa_handler = sig_endpgm;
|
||
break;
|
||
case SIGTSTP: case SIGTTIN: case SIGTTOU:
|
||
sa.sa_handler = sig_paused;
|
||
break;
|
||
case SIGCONT: case SIGWINCH:
|
||
sa.sa_handler = sig_resize;
|
||
break;
|
||
default:
|
||
sa.sa_handler = sig_abexit;
|
||
break;
|
||
case SIGKILL: case SIGSTOP:
|
||
// because uncatchable, fall through
|
||
case SIGCHLD: // we can't catch this
|
||
continue; // when opening a pipe
|
||
}
|
||
sigaction(i, &sa, NULL);
|
||
}
|
||
} // end: before
|
||
|
||
|
||
/*
|
||
* A configs_read *Helper* function responsible for converting
|
||
* a single window's old rc stuff into a new style rcfile entry */
|
||
static int config_cvt (WIN_t *q) {
|
||
static struct {
|
||
int old, new;
|
||
} flags_tab[] = {
|
||
#define old_View_NOBOLD 0x000001
|
||
#define old_VISIBLE_tsk 0x000008
|
||
#define old_Qsrt_NORMAL 0x000010
|
||
#define old_Show_HICOLS 0x000200
|
||
#define old_Show_THREAD 0x010000
|
||
{ old_View_NOBOLD, View_NOBOLD },
|
||
{ old_VISIBLE_tsk, Show_TASKON },
|
||
{ old_Qsrt_NORMAL, Qsrt_NORMAL },
|
||
{ old_Show_HICOLS, Show_HICOLS },
|
||
{ old_Show_THREAD, 0 }
|
||
#undef old_View_NOBOLD
|
||
#undef old_VISIBLE_tsk
|
||
#undef old_Qsrt_NORMAL
|
||
#undef old_Show_HICOLS
|
||
#undef old_Show_THREAD
|
||
};
|
||
static const char fields_src[] = CVT_FIELDS;
|
||
char fields_dst[PFLAGSSIZ], *p1, *p2;
|
||
int i, j, x;
|
||
|
||
// first we'll touch up this window's winflags...
|
||
x = q->rc.winflags;
|
||
q->rc.winflags = 0;
|
||
for (i = 0; i < MAXTBL(flags_tab); i++) {
|
||
if (x & flags_tab[i].old) {
|
||
x &= ~flags_tab[i].old;
|
||
q->rc.winflags |= flags_tab[i].new;
|
||
}
|
||
}
|
||
q->rc.winflags |= x;
|
||
|
||
// now let's convert old top's more limited fields...
|
||
j = strlen(q->rc.fieldscur);
|
||
if (j > CVT_FLDMAX)
|
||
return 1;
|
||
strcpy(fields_dst, fields_src);
|
||
/* all other fields represent the 'on' state with a capitalized version
|
||
of a particular qwerty key. for the 2 additional suse out-of-memory
|
||
fields it makes perfect sense to do the exact opposite, doesn't it?
|
||
in any case, we must turn them 'off' temporarily... */
|
||
if ((p1 = strchr(q->rc.fieldscur, '['))) *p1 = '{';
|
||
if ((p2 = strchr(q->rc.fieldscur, '\\'))) *p2 = '|';
|
||
for (i = 0; i < j; i++) {
|
||
int c = q->rc.fieldscur[i];
|
||
x = tolower(c) - 'a';
|
||
if (x < 0 || x >= CVT_FLDMAX)
|
||
return 1;
|
||
fields_dst[i] = fields_src[x];
|
||
if (isupper(c))
|
||
FLDon(fields_dst[i]);
|
||
}
|
||
// if we turned any suse only fields off, turn 'em back on OUR way...
|
||
if (p1) FLDon(fields_dst[p1 - q->rc.fieldscur]);
|
||
if (p2) FLDon(fields_dst[p2 - q->rc.fieldscur]);
|
||
strcpy(q->rc.fieldscur, fields_dst);
|
||
|
||
// lastly, we must adjust the old sort field enum...
|
||
x = q->rc.sortindx;
|
||
q->rc.sortindx = fields_src[x] - FLD_OFFSET;
|
||
|
||
Rc_questions = 1;
|
||
return 0;
|
||
} // end: config_cvt
|
||
|
||
|
||
/*
|
||
* Build the local RC file name then try to read both of 'em.
|
||
* 'SYS_RCFILESPEC' contains two lines consisting of the secure
|
||
* mode switch and an update interval. It's presence limits what
|
||
* ordinary users are allowed to do.
|
||
* 'Rc_name' contains multiple lines - 3 global + 3 per window.
|
||
* line 1 : an eyecatcher and creating program/alias name
|
||
* line 2 : an id, Mode_altcsr, Mode_irixps, Delay_time, Curwin.
|
||
* For each of the 4 windows:
|
||
* line a: contains w->winname, fieldscur
|
||
* line b: contains w->winflags, sortindx, maxtasks, graph modes
|
||
* line c: contains w->summclr, msgsclr, headclr, taskclr
|
||
* line 15 : miscellaneous additional global settings
|
||
* Any remaining lines are devoted to the 'Inspect Other' feature */
|
||
static void configs_read (void) {
|
||
float tmp_delay = DEF_DELAY;
|
||
char fbuf[LRGBUFSIZ];
|
||
const char *p;
|
||
FILE *fp;
|
||
int i;
|
||
|
||
p = getenv("HOME");
|
||
snprintf(Rc_name, sizeof(Rc_name), "%s/.%src", (p && *p) ? p : ".", Myname);
|
||
|
||
fp = fopen(SYS_RCFILESPEC, "r");
|
||
if (fp) {
|
||
if (fgets(fbuf, sizeof(fbuf), fp)) { // sys rc file, line 1
|
||
Secure_mode = 1;
|
||
if (fgets(fbuf, sizeof(fbuf), fp)) // sys rc file, line 2
|
||
sscanf(fbuf, "%f", &Rc.delay_time);
|
||
}
|
||
fclose(fp);
|
||
}
|
||
|
||
fp = fopen(Rc_name, "r");
|
||
if (fp) {
|
||
int tmp_whole, tmp_fract;
|
||
if (fgets(fbuf, sizeof(fbuf), fp)) // ignore eyecatcher
|
||
; // avoid -Wunused-result
|
||
if (6 != fscanf(fp
|
||
, "Id:%c, Mode_altscr=%d, Mode_irixps=%d, Delay_time=%d.%d, Curwin=%d\n"
|
||
, &Rc.id, &Rc.mode_altscr, &Rc.mode_irixps, &tmp_whole, &tmp_fract, &i)) {
|
||
p = fmtmk(N_fmt(RC_bad_files_fmt), Rc_name);
|
||
Rc_questions = -1;
|
||
goto try_inspect_entries; // maybe a faulty 'inspect' echo
|
||
}
|
||
// you saw that, right? (fscanf stickin' it to 'i')
|
||
Curwin = &Winstk[i];
|
||
// this may be ugly, but it keeps us locale independent...
|
||
tmp_delay = (float)tmp_whole + (float)tmp_fract / 1000;
|
||
|
||
for (i = 0 ; i < GROUPSMAX; i++) {
|
||
int x;
|
||
WIN_t *w = &Winstk[i];
|
||
p = fmtmk(N_fmt(RC_bad_entry_fmt), i+1, Rc_name);
|
||
|
||
// note: "fieldscur=%__s" on next line should equal (PFLAGSSIZ -1) !
|
||
if (2 != fscanf(fp, "%3s\tfieldscur=%79s\n"
|
||
, w->rc.winname, w->rc.fieldscur))
|
||
goto default_or_error;
|
||
#if PFLAGSSIZ != 80
|
||
// too bad fscanf is not as flexible with his format string as snprintf
|
||
# error Hey, fix the above fscanf 'PFLAGSSIZ' dependency !
|
||
#endif
|
||
// be tolerant of missing release 3.3.10 graph modes additions
|
||
if (3 > fscanf(fp, "\twinflags=%d, sortindx=%d, maxtasks=%d, graph_cpus=%d, graph_mems=%d\n"
|
||
, &w->rc.winflags, &w->rc.sortindx, &w->rc.maxtasks, &w->rc.graph_cpus, &w->rc.graph_mems))
|
||
goto default_or_error;
|
||
if (4 != fscanf(fp, "\tsummclr=%d, msgsclr=%d, headclr=%d, taskclr=%d\n"
|
||
, &w->rc.summclr, &w->rc.msgsclr
|
||
, &w->rc.headclr, &w->rc.taskclr))
|
||
goto default_or_error;
|
||
|
||
switch (Rc.id) {
|
||
case 'a': // 3.2.8 (former procps)
|
||
if (config_cvt(w))
|
||
goto default_or_error;
|
||
case 'f': // 3.3.0 thru 3.3.3 (ng)
|
||
SETw(w, Show_JRNUMS);
|
||
case 'g': // from 3.3.4 thru 3.3.8
|
||
scat(w->rc.fieldscur, RCF_PLUS_H);
|
||
case 'h': // this is release 3.3.9
|
||
w->rc.graph_cpus = w->rc.graph_mems = 0;
|
||
// these next 2 are really global, but best documented here
|
||
Rc.summ_mscale = Rc.task_mscale = SK_Kb;
|
||
case 'i': // actual RCF_VERSION_ID
|
||
default: // and a future version?
|
||
if (strlen(w->rc.fieldscur) != sizeof(DEF_FIELDS) - 1)
|
||
goto default_or_error;
|
||
for (x = 0; x < EU_MAXPFLGS; ++x)
|
||
if (EU_MAXPFLGS <= FLDget(w, x))
|
||
goto default_or_error;
|
||
break;
|
||
}
|
||
#ifndef USE_X_COLHDR
|
||
OFFw(w, NOHIFND_xxx | NOHISEL_xxx);
|
||
#endif
|
||
} // end: for (GROUPSMAX)
|
||
|
||
// any new addition(s) last, for older rcfiles compatibility...
|
||
if (fscanf(fp, "Fixed_widest=%d, Summ_mscale=%d, Task_mscale=%d, Zero_suppress=%d\n"
|
||
, &Rc.fixed_widest, &Rc.summ_mscale, &Rc.task_mscale, &Rc.zero_suppress))
|
||
; // avoid -Wunused-result
|
||
|
||
try_inspect_entries:
|
||
// we'll start off Inspect stuff with 1 'potential' blank line
|
||
// ( only realized if we end up with Inspect.total > 0 )
|
||
for (i = 0, Inspect.raw = alloc_s("\n");;) {
|
||
#define iT(element) Inspect.tab[i].element
|
||
size_t lraw = strlen(Inspect.raw) +1;
|
||
char *s;
|
||
|
||
if (!fgets(fbuf, sizeof(fbuf), fp)) break;
|
||
lraw += strlen(fbuf) +1;
|
||
Inspect.raw = alloc_r(Inspect.raw, lraw);
|
||
strcat(Inspect.raw, fbuf);
|
||
|
||
if (fbuf[0] == '#' || fbuf[0] == '\n') continue;
|
||
Inspect.tab = alloc_r(Inspect.tab, sizeof(struct I_ent) * (i + 1));
|
||
|
||
if (!(s = strtok(fbuf, "\t\n"))) { Rc_questions = 1; continue; }
|
||
iT(type) = alloc_s(s);
|
||
if (!(s = strtok(NULL, "\t\n"))) { Rc_questions = 1; continue; }
|
||
iT(name) = alloc_s(s);
|
||
if (!(s = strtok(NULL, "\t\n"))) { Rc_questions = 1; continue; }
|
||
iT(fmts) = alloc_s(s);
|
||
|
||
switch (toupper(fbuf[0])) {
|
||
case 'F':
|
||
iT(func) = insp_do_file;
|
||
break;
|
||
case 'P':
|
||
iT(func) = insp_do_pipe;
|
||
break;
|
||
default:
|
||
Rc_questions = 1;
|
||
continue;
|
||
}
|
||
|
||
iT(farg) = (strstr(iT(fmts), "%d")) ? 1 : 0;
|
||
iT(fstr) = alloc_c(FNDBUFSIZ);
|
||
iT(flen) = 0;
|
||
|
||
if (Rc_questions < 0) Rc_questions = 1;
|
||
++i;
|
||
#undef iT
|
||
} // end: for ('inspect' entries)
|
||
|
||
Inspect.total = i;
|
||
#ifndef INSP_OFFDEMO
|
||
if (!Inspect.total) {
|
||
#define mkS(n) N_txt(YINSP_demo ## n ## _txt)
|
||
const char *sels[] = { mkS(01), mkS(02), mkS(03) };
|
||
Inspect.total = Inspect.demo = MAXTBL(sels);
|
||
Inspect.tab = alloc_c(sizeof(struct I_ent) * Inspect.total);
|
||
for (i = 0; i < Inspect.total; i++) {
|
||
Inspect.tab[i].type = alloc_s(N_txt(YINSP_deqtyp_txt));
|
||
Inspect.tab[i].name = alloc_s(sels[i]);
|
||
Inspect.tab[i].func = insp_do_demo;
|
||
Inspect.tab[i].fmts = alloc_s(N_txt(YINSP_deqfmt_txt));
|
||
Inspect.tab[i].fstr = alloc_c(FNDBUFSIZ);
|
||
}
|
||
#undef mkS
|
||
}
|
||
#endif
|
||
if (Rc_questions < 0) {
|
||
p = fmtmk(N_fmt(RC_bad_files_fmt), Rc_name);
|
||
goto default_or_error;
|
||
}
|
||
fclose(fp);
|
||
} // end: if (fp)
|
||
|
||
// lastly, establish the true runtime secure mode and delay time
|
||
if (!getuid()) Secure_mode = 0;
|
||
if (!Secure_mode) Rc.delay_time = tmp_delay;
|
||
return;
|
||
|
||
default_or_error:
|
||
#ifdef RCFILE_NOERR
|
||
{ RCF_t rcdef = DEF_RCFILE;
|
||
fclose(fp);
|
||
Rc = rcdef;
|
||
for (i = 0 ; i < GROUPSMAX; i++)
|
||
Winstk[i].rc = Rc.win[i];
|
||
Rc_questions = 1;
|
||
}
|
||
#else
|
||
error_exit(p);
|
||
#endif
|
||
} // end: configs_read
|
||
|
||
|
||
/*
|
||
* Parse command line arguments.
|
||
* Note: it's assumed that the rc file(s) have already been read
|
||
* and our job is to see if any of those options are to be
|
||
* overridden -- we'll force some on and negate others in our
|
||
* best effort to honor the loser's (oops, user's) wishes... */
|
||
static void parse_args (char **args) {
|
||
/* differences between us and the former top:
|
||
-C (separate CPU states for SMP) is left to an rcfile
|
||
-u (user monitoring) added to compliment interactive 'u'
|
||
-p (pid monitoring) allows a comma delimited list
|
||
-q (zero delay) eliminated as redundant, incomplete and inappropriate
|
||
use: "nice -n-10 top -d0" to achieve what was only claimed
|
||
. most switches act as toggles (not 'on' sw) for more user flexibility
|
||
. no deprecated/illegal use of 'breakargv:' with goto
|
||
. bunched args are actually handled properly and none are ignored
|
||
. we tolerate NO whitespace and NO switches -- maybe too tolerant? */
|
||
static const char numbs_str[] = "+,-.0123456789";
|
||
float tmp_delay = FLT_MAX;
|
||
int i;
|
||
|
||
while (*args) {
|
||
const char *cp = *(args++);
|
||
|
||
while (*cp) {
|
||
char ch;
|
||
float tmp;
|
||
|
||
switch ((ch = *cp)) {
|
||
case '\0':
|
||
break;
|
||
case '-':
|
||
if (cp[1]) ++cp;
|
||
else if (*args) cp = *args++;
|
||
if (strspn(cp, numbs_str))
|
||
error_exit(fmtmk(N_fmt(WRONG_switch_fmt)
|
||
, cp, Myname, N_txt(USAGE_abbrev_txt)));
|
||
continue;
|
||
case 'b':
|
||
Batch = 1;
|
||
break;
|
||
case 'c':
|
||
TOGw(Curwin, Show_CMDLIN);
|
||
break;
|
||
case 'd':
|
||
if (cp[1]) ++cp;
|
||
else if (*args) cp = *args++;
|
||
else error_exit(fmtmk(N_fmt(MISSING_args_fmt), ch));
|
||
if (!mkfloat(cp, &tmp_delay, 0))
|
||
error_exit(fmtmk(N_fmt(BAD_delayint_fmt), cp));
|
||
if (0 > tmp_delay)
|
||
error_exit(N_txt(DELAY_badarg_txt));
|
||
break;
|
||
case 'H':
|
||
Thread_mode = 1;
|
||
break;
|
||
case 'h':
|
||
case 'v':
|
||
puts(fmtmk(N_fmt(HELP_cmdline_fmt)
|
||
, PACKAGE_STRING, Myname, N_txt(USAGE_abbrev_txt)));
|
||
bye_bye(NULL);
|
||
case 'i':
|
||
TOGw(Curwin, Show_IDLEPS);
|
||
Curwin->rc.maxtasks = 0;
|
||
break;
|
||
case 'n':
|
||
if (cp[1]) cp++;
|
||
else if (*args) cp = *args++;
|
||
else error_exit(fmtmk(N_fmt(MISSING_args_fmt), ch));
|
||
if (!mkfloat(cp, &tmp, 1) || 1.0 > tmp)
|
||
error_exit(fmtmk(N_fmt(BAD_niterate_fmt), cp));
|
||
Loops = (int)tmp;
|
||
break;
|
||
case 'o':
|
||
if (cp[1]) cp++;
|
||
else if (*args) cp = *args++;
|
||
else error_exit(fmtmk(N_fmt(MISSING_args_fmt), ch));
|
||
if (*cp == '+') { SETw(Curwin, Qsrt_NORMAL); ++cp; }
|
||
else if (*cp == '-') { OFFw(Curwin, Qsrt_NORMAL); ++cp; }
|
||
for (i = 0; i < EU_MAXPFLGS; i++)
|
||
if (!STRCMP(cp, N_col(i))) break;
|
||
if (i == EU_MAXPFLGS)
|
||
error_exit(fmtmk(N_fmt(XTRA_badflds_fmt), cp));
|
||
OFFw(Curwin, Show_FOREST);
|
||
Curwin->rc.sortindx = i;
|
||
cp += strlen(cp);
|
||
break;
|
||
case 'O':
|
||
for (i = 0; i < EU_MAXPFLGS; i++)
|
||
puts(N_col(i));
|
||
bye_bye(NULL);
|
||
case 'p':
|
||
{ unsigned pid; char *p;
|
||
if (Curwin->usrseltyp) error_exit(N_txt(SELECT_clash_txt));
|
||
do {
|
||
if (cp[1]) cp++;
|
||
else if (*args) cp = *args++;
|
||
else error_exit(fmtmk(N_fmt(MISSING_args_fmt), ch));
|
||
if (Monpidsidx >= MONPIDMAX)
|
||
error_exit(fmtmk(N_fmt(LIMIT_exceed_fmt), MONPIDMAX));
|
||
if (1 != sscanf(cp, "%d", &pid)
|
||
|| strpbrk(cp, "+-."))
|
||
error_exit(fmtmk(N_fmt(BAD_mon_pids_fmt), cp));
|
||
if (!pid) pid = getpid();
|
||
for (i = 0; i < Monpidsidx; i++)
|
||
if (Monpids[i] == pid) goto next_pid;
|
||
Monpids[Monpidsidx++] = pid;
|
||
next_pid:
|
||
if (!(p = strchr(cp, ','))) break;
|
||
cp = p;
|
||
} while (*cp);
|
||
}
|
||
break;
|
||
case 's':
|
||
Secure_mode = 1;
|
||
break;
|
||
case 'S':
|
||
TOGw(Curwin, Show_CTIMES);
|
||
break;
|
||
case 'u':
|
||
case 'U':
|
||
{ const char *errmsg;
|
||
if (Monpidsidx || Curwin->usrseltyp) error_exit(N_txt(SELECT_clash_txt));
|
||
if (cp[1]) cp++;
|
||
else if (*args) cp = *args++;
|
||
else error_exit(fmtmk(N_fmt(MISSING_args_fmt), ch));
|
||
if ((errmsg = user_certify(Curwin, cp, ch))) error_exit(errmsg);
|
||
cp += strlen(cp);
|
||
}
|
||
break;
|
||
case 'w':
|
||
{ const char *pn = NULL;
|
||
int ai = 0, ci = 0;
|
||
tmp = -1;
|
||
if (cp[1]) pn = &cp[1];
|
||
else if (*args) { pn = *args; ai = 1; }
|
||
if (pn && !(ci = strspn(pn, numbs_str))) { ai = 0; pn = NULL; }
|
||
if (pn && (!mkfloat(pn, &tmp, 1) || tmp < W_MIN_COL))
|
||
error_exit(fmtmk(N_fmt(BAD_widtharg_fmt), pn));
|
||
Width_mode = (int)tmp;
|
||
cp++;
|
||
args += ai;
|
||
if (pn) cp = pn + ci;
|
||
}
|
||
continue;
|
||
default :
|
||
error_exit(fmtmk(N_fmt(UNKNOWN_opts_fmt)
|
||
, *cp, Myname, N_txt(USAGE_abbrev_txt)));
|
||
|
||
} // end: switch (*cp)
|
||
|
||
// advance cp and jump over any numerical args used above
|
||
if (*cp) cp += strspn(&cp[1], numbs_str) + 1;
|
||
|
||
} // end: while (*cp)
|
||
} // end: while (*args)
|
||
|
||
// fixup delay time, maybe...
|
||
if (FLT_MAX > tmp_delay) {
|
||
if (Secure_mode)
|
||
error_exit(N_txt(DELAY_secure_txt));
|
||
Rc.delay_time = tmp_delay;
|
||
}
|
||
} // end: parse_args
|
||
|
||
|
||
/*
|
||
* Set up the terminal attributes */
|
||
static void whack_terminal (void) {
|
||
static char dummy[] = "dumb";
|
||
struct termios tmptty;
|
||
|
||
// the curses part...
|
||
if (Batch) {
|
||
setupterm(dummy, STDOUT_FILENO, NULL);
|
||
return;
|
||
}
|
||
#ifdef PRETENDNOCAP
|
||
setupterm(dummy, STDOUT_FILENO, NULL);
|
||
#else
|
||
setupterm(NULL, STDOUT_FILENO, NULL);
|
||
#endif
|
||
// our part...
|
||
if (-1 == tcgetattr(STDIN_FILENO, &Tty_original))
|
||
error_exit(N_txt(FAIL_tty_get_txt));
|
||
// ok, haven't really changed anything but we do have our snapshot
|
||
Ttychanged = 1;
|
||
|
||
// first, a consistent canonical mode for interactive line input
|
||
tmptty = Tty_original;
|
||
tmptty.c_lflag |= (ECHO | ECHOCTL | ECHOE | ICANON | ISIG);
|
||
tmptty.c_lflag &= ~NOFLSH;
|
||
tmptty.c_oflag &= ~TAB3;
|
||
tmptty.c_iflag |= BRKINT;
|
||
tmptty.c_iflag &= ~IGNBRK;
|
||
if (key_backspace && 1 == strlen(key_backspace))
|
||
tmptty.c_cc[VERASE] = *key_backspace;
|
||
#ifdef TERMIOS_ONLY
|
||
if (-1 == tcsetattr(STDIN_FILENO, TCSAFLUSH, &tmptty))
|
||
error_exit(fmtmk(N_fmt(FAIL_tty_set_fmt), strerror(errno)));
|
||
tcgetattr(STDIN_FILENO, &Tty_tweaked);
|
||
#endif
|
||
// lastly, a nearly raw mode for unsolicited single keystrokes
|
||
tmptty.c_lflag &= ~(ECHO | ECHOCTL | ECHOE | ICANON);
|
||
tmptty.c_cc[VMIN] = 1;
|
||
tmptty.c_cc[VTIME] = 0;
|
||
if (-1 == tcsetattr(STDIN_FILENO, TCSAFLUSH, &tmptty))
|
||
error_exit(fmtmk(N_fmt(FAIL_tty_set_fmt), strerror(errno)));
|
||
tcgetattr(STDIN_FILENO, &Tty_raw);
|
||
|
||
#ifndef OFF_STDIOLBF
|
||
// thanks anyway stdio, but we'll manage buffering at the frame level...
|
||
setbuffer(stdout, Stdout_buf, sizeof(Stdout_buf));
|
||
#endif
|
||
#ifdef OFF_SCROLLBK
|
||
// this has the effect of disabling any troublesome scrollback buffer...
|
||
if (enter_ca_mode) putp(enter_ca_mode);
|
||
#endif
|
||
// and don't forget to ask iokey to initialize his tinfo_tab
|
||
iokey(0);
|
||
} // end: whack_terminal
|
||
|
||
/*###### Windows/Field Groups support #################################*/
|
||
|
||
/*
|
||
* Value a window's name and make the associated group name. */
|
||
static void win_names (WIN_t *q, const char *name) {
|
||
/* note: sprintf/snprintf results are "undefined" when src==dst,
|
||
according to C99 & POSIX.1-2001 (thanks adc) */
|
||
if (q->rc.winname != name)
|
||
snprintf(q->rc.winname, sizeof(q->rc.winname), "%s", name);
|
||
snprintf(q->grpname, sizeof(q->grpname), "%d:%s", q->winnum, name);
|
||
} // end: win_names
|
||
|
||
|
||
/*
|
||
* This guy just resets (normalizes) a single window
|
||
* and he ensures pid monitoring is no longer active. */
|
||
static void win_reset (WIN_t *q) {
|
||
SETw(q, Show_IDLEPS | Show_TASKON);
|
||
#ifndef SCROLLVAR_NO
|
||
q->rc.maxtasks = q->usrseltyp = q->begpflg = q->begtask = q->varcolbeg = 0;
|
||
#else
|
||
q->rc.maxtasks = q->usrseltyp = q->begpflg = q->begtask = 0;
|
||
#endif
|
||
Monpidsidx = 0;
|
||
osel_clear(q);
|
||
q->findstr[0] = '\0';
|
||
#ifndef USE_X_COLHDR
|
||
// NOHISEL_xxx is redundant (already turned off by osel_clear)
|
||
OFFw(q, NOHIFND_xxx | NOHISEL_xxx);
|
||
#endif
|
||
} // end: win_reset
|
||
|
||
|
||
/*
|
||
* Display a window/field group (ie. make it "current"). */
|
||
static WIN_t *win_select (int ch) {
|
||
WIN_t *w = Curwin; // avoid gcc bloat with a local copy
|
||
|
||
/* if there's no ch, it means we're supporting the external interface,
|
||
so we must try to get our own darn ch by begging the user... */
|
||
if (!ch) {
|
||
show_pmt(N_txt(CHOOSE_group_txt));
|
||
if (1 > (ch = iokey(1))) return w;
|
||
}
|
||
switch (ch) {
|
||
case 'a': // we don't carry 'a' / 'w' in our
|
||
w = w->next; // pmt - they're here for a good
|
||
break; // friend of ours -- wins_colors.
|
||
case 'w': // (however those letters work via
|
||
w = w->prev; // the pmt too but gee, end-loser
|
||
break; // should just press the darn key)
|
||
case '1': case '2' : case '3': case '4':
|
||
w = &Winstk[ch - '1'];
|
||
break;
|
||
default: // keep gcc happy
|
||
break;
|
||
}
|
||
return Curwin = w;
|
||
} // end: win_select
|
||
|
||
|
||
/*
|
||
* Just warn the user when a command can't be honored. */
|
||
static int win_warn (int what) {
|
||
switch (what) {
|
||
case Warn_ALT:
|
||
show_msg(N_txt(DISABLED_cmd_txt));
|
||
break;
|
||
case Warn_VIZ:
|
||
show_msg(fmtmk(N_fmt(DISABLED_win_fmt), Curwin->grpname));
|
||
break;
|
||
default: // keep gcc happy
|
||
break;
|
||
}
|
||
/* we gotta' return false 'cause we're somewhat well known within
|
||
macro society, by way of that sassy little tertiary operator... */
|
||
return 0;
|
||
} // end: win_warn
|
||
|
||
|
||
/*
|
||
* Change colors *Helper* function to save/restore settings;
|
||
* ensure colors will show; and rebuild the terminfo strings. */
|
||
static void wins_clrhlp (WIN_t *q, int save) {
|
||
static int flgssav, summsav, msgssav, headsav, tasksav;
|
||
|
||
if (save) {
|
||
flgssav = q->rc.winflags; summsav = q->rc.summclr;
|
||
msgssav = q->rc.msgsclr; headsav = q->rc.headclr; tasksav = q->rc.taskclr;
|
||
SETw(q, Show_COLORS);
|
||
} else {
|
||
q->rc.winflags = flgssav; q->rc.summclr = summsav;
|
||
q->rc.msgsclr = msgssav; q->rc.headclr = headsav; q->rc.taskclr = tasksav;
|
||
}
|
||
capsmk(q);
|
||
} // end: wins_clrhlp
|
||
|
||
|
||
/*
|
||
* Change colors used in display */
|
||
static void wins_colors (void) {
|
||
#define kbdABORT 'q'
|
||
#define kbdAPPLY kbd_ENTER
|
||
WIN_t *w = Curwin; // avoid gcc bloat with a local copy
|
||
int clr = w->rc.taskclr, *pclr = &w->rc.taskclr;
|
||
char tgt = 'T';
|
||
int key;
|
||
|
||
if (0 >= max_colors) {
|
||
show_msg(N_txt(COLORS_nomap_txt));
|
||
return;
|
||
}
|
||
wins_clrhlp(w, 1);
|
||
putp((Cursor_state = Cap_curs_huge));
|
||
signify_that:
|
||
putp(Cap_clr_scr);
|
||
adj_geometry();
|
||
|
||
do {
|
||
putp(Cap_home);
|
||
// this string is well above ISO C89's minimum requirements!
|
||
show_special(1, fmtmk(N_unq(COLOR_custom_fmt)
|
||
, PACKAGE_STRING, w->grpname
|
||
, CHKw(w, View_NOBOLD) ? N_txt(ON_word_only_txt) : N_txt(OFF_one_word_txt)
|
||
, CHKw(w, Show_COLORS) ? N_txt(ON_word_only_txt) : N_txt(OFF_one_word_txt)
|
||
, CHKw(w, Show_HIBOLD) ? N_txt(ON_word_only_txt) : N_txt(OFF_one_word_txt)
|
||
, tgt, clr, w->grpname));
|
||
putp(Cap_clr_eos);
|
||
fflush(stdout);
|
||
|
||
if (Frames_signal) goto signify_that;
|
||
key = iokey(1);
|
||
if (key < 1) goto signify_that;
|
||
|
||
switch (key) {
|
||
case 'S':
|
||
pclr = &w->rc.summclr;
|
||
clr = *pclr;
|
||
tgt = key;
|
||
break;
|
||
case 'M':
|
||
pclr = &w->rc.msgsclr;
|
||
clr = *pclr;
|
||
tgt = key;
|
||
break;
|
||
case 'H':
|
||
pclr = &w->rc.headclr;
|
||
clr = *pclr;
|
||
tgt = key;
|
||
break;
|
||
case 'T':
|
||
pclr = &w->rc.taskclr;
|
||
clr = *pclr;
|
||
tgt = key;
|
||
break;
|
||
case '0': case '1': case '2': case '3':
|
||
case '4': case '5': case '6': case '7':
|
||
clr = key - '0';
|
||
*pclr = clr;
|
||
break;
|
||
case 'B':
|
||
TOGw(w, View_NOBOLD);
|
||
break;
|
||
case 'b':
|
||
TOGw(w, Show_HIBOLD);
|
||
break;
|
||
case 'z':
|
||
TOGw(w, Show_COLORS);
|
||
break;
|
||
case 'a':
|
||
case 'w':
|
||
wins_clrhlp((w = win_select(key)), 1);
|
||
clr = w->rc.taskclr, pclr = &w->rc.taskclr;
|
||
tgt = 'T';
|
||
break;
|
||
default:
|
||
break; // keep gcc happy
|
||
}
|
||
capsmk(w);
|
||
} while (key != kbdAPPLY && key != kbdABORT);
|
||
|
||
if (key == kbdABORT) wins_clrhlp(w, 0);
|
||
|
||
#undef kbdABORT
|
||
#undef kbdAPPLY
|
||
} // end: wins_colors
|
||
|
||
|
||
/*
|
||
* Manipulate flag(s) for all our windows. */
|
||
static void wins_reflag (int what, int flg) {
|
||
WIN_t *w = Curwin; // avoid gcc bloat with a local copy
|
||
|
||
do {
|
||
switch (what) {
|
||
case Flags_TOG:
|
||
TOGw(w, flg);
|
||
break;
|
||
case Flags_SET: // Ummmm, i can't find anybody
|
||
SETw(w, flg); // who uses Flags_set ...
|
||
break;
|
||
case Flags_OFF:
|
||
OFFw(w, flg);
|
||
break;
|
||
default: // keep gcc happy
|
||
break;
|
||
}
|
||
/* a flag with special significance -- user wants to rebalance
|
||
display so we gotta' off some stuff then force on two flags... */
|
||
if (EQUWINS_xxx == flg)
|
||
win_reset(w);
|
||
|
||
w = w->next;
|
||
} while (w != Curwin);
|
||
} // end: wins_reflag
|
||
|
||
|
||
/*
|
||
* Set up the raw/incomplete field group windows --
|
||
* they'll be finished off after startup completes.
|
||
* [ and very likely that will override most/all of our efforts ]
|
||
* [ --- life-is-NOT-fair --- ] */
|
||
static void wins_stage_1 (void) {
|
||
WIN_t *w;
|
||
int i;
|
||
|
||
for (i = 0; i < GROUPSMAX; i++) {
|
||
w = &Winstk[i];
|
||
w->winnum = i + 1;
|
||
w->rc = Rc.win[i];
|
||
w->captab[0] = Cap_norm;
|
||
w->captab[1] = Cap_norm;
|
||
w->captab[2] = w->cap_bold;
|
||
w->captab[3] = w->capclr_sum;
|
||
w->captab[4] = w->capclr_msg;
|
||
w->captab[5] = w->capclr_pmt;
|
||
w->captab[6] = w->capclr_hdr;
|
||
w->captab[7] = w->capclr_rowhigh;
|
||
w->captab[8] = w->capclr_rownorm;
|
||
w->next = w + 1;
|
||
w->prev = w - 1;
|
||
}
|
||
|
||
// fixup the circular chains...
|
||
Winstk[GROUPSMAX - 1].next = &Winstk[0];
|
||
Winstk[0].prev = &Winstk[GROUPSMAX - 1];
|
||
Curwin = Winstk;
|
||
} // end: wins_stage_1
|
||
|
||
|
||
/*
|
||
* This guy just completes the field group windows after the
|
||
* rcfiles have been read and command line arguments parsed.
|
||
* And since he's the cabose of startup, he'll also tidy up
|
||
* a few final things... */
|
||
static void wins_stage_2 (void) {
|
||
int i;
|
||
|
||
for (i = 0; i < GROUPSMAX; i++) {
|
||
win_names(&Winstk[i], Winstk[i].rc.winname);
|
||
capsmk(&Winstk[i]);
|
||
Winstk[i].findstr = alloc_c(FNDBUFSIZ);
|
||
Winstk[i].findlen = 0;
|
||
}
|
||
if (!Batch)
|
||
putp((Cursor_state = Cap_curs_hide));
|
||
else {
|
||
OFFw(Curwin, View_SCROLL);
|
||
signal(SIGHUP, SIG_IGN); // allow running under nohup
|
||
}
|
||
// fill in missing Fieldstab members and build each window's columnhdr
|
||
zap_fieldstab();
|
||
|
||
#ifndef OFF_STDERROR
|
||
/* there's a chance that damn libnuma may spew to stderr so we gotta
|
||
make sure he does not corrupt poor ol' top's first output screen!
|
||
Yes, he provides some overridable 'weak' functions to change such
|
||
behavior but we can't exploit that since we don't follow a normal
|
||
ld route to symbol resolution (we use that dlopen() guy instead)! */
|
||
Stderr_save = dup(fileno(stderr));
|
||
if (-1 < Stderr_save && freopen("/dev/null", "w", stderr))
|
||
; // avoid -Wunused-result
|
||
#endif
|
||
|
||
// lastly, initialize a signal set used to throttle one troublesome signal
|
||
sigemptyset(&Sigwinch_set);
|
||
#ifdef SIGNALS_LESS
|
||
sigaddset(&Sigwinch_set, SIGWINCH);
|
||
#endif
|
||
} // end: wins_stage_2
|
||
|
||
|
||
/*
|
||
* Determine if this task matches the 'u/U' selection criteria
|
||
* for a given window -- it is called from only one place, and
|
||
* will likely be inlined even without the following directive */
|
||
static inline int wins_usrselect (const WIN_t *q, struct pids_stack *p) {
|
||
// a tailored 'results stack value' extractor macro
|
||
#define rSv(E) PID_VAL(E, u_int, p)
|
||
switch(q->usrseltyp) {
|
||
case 0: // uid selection inactive
|
||
return 1;
|
||
case 'U': // match any uid
|
||
if (rSv(EU_URD) == q->usrseluid) return q->usrselflg;
|
||
if (rSv(EU_USD) == q->usrseluid) return q->usrselflg;
|
||
if (rSv(eu_ID_FUID) == q->usrseluid) return q->usrselflg;
|
||
// fall through...
|
||
case 'u': // match effective uid
|
||
if (rSv(EU_UED) == q->usrseluid) return q->usrselflg;
|
||
// fall through...
|
||
default: // no match...
|
||
;
|
||
}
|
||
return !q->usrselflg;
|
||
#undef rSv
|
||
} // end: wins_usrselect
|
||
|
||
/*###### Interactive Input Tertiary support ############################*/
|
||
|
||
/*
|
||
* This section exists so as to offer some function naming freedom
|
||
* while also maintaining the strict alphabetical order protocol
|
||
* within each section. */
|
||
|
||
/*
|
||
* This guy is a *Helper* function serving the following two masters:
|
||
* find_string() - find the next match in a given window
|
||
* task_show() - highlight all matches currently in-view
|
||
* If q->findstr is found in the designated buffer, he returns the
|
||
* offset from the start of the buffer, otherwise he returns -1. */
|
||
static inline int find_ofs (const WIN_t *q, const char *buf) {
|
||
char *fnd;
|
||
|
||
if (q->findstr[0] && (fnd = STRSTR(buf, q->findstr)))
|
||
return (int)(fnd - buf);
|
||
return -1;
|
||
} // end: find_ofs
|
||
|
||
|
||
|
||
/* This is currently the one true prototype require by top.
|
||
It is placed here, instead of top.h, so as to avoid a compiler
|
||
warning when top_nls.c is compiled. */
|
||
static const char *task_show (const WIN_t *q, struct pids_stack *p);
|
||
|
||
static void find_string (int ch) {
|
||
#define reDUX (found) ? N_txt(WORD_another_txt) : ""
|
||
static int found;
|
||
int i;
|
||
|
||
if ('&' == ch && !Curwin->findstr[0]) {
|
||
show_msg(N_txt(FIND_no_next_txt));
|
||
return;
|
||
}
|
||
if ('L' == ch) {
|
||
char *str = ioline(N_txt(GET_find_str_txt));
|
||
if (*str == kbd_ESC) return;
|
||
snprintf(Curwin->findstr, FNDBUFSIZ, "%s", str);
|
||
Curwin->findlen = strlen(Curwin->findstr);
|
||
found = 0;
|
||
#ifndef USE_X_COLHDR
|
||
if (Curwin->findstr[0]) SETw(Curwin, NOHIFND_xxx);
|
||
else OFFw(Curwin, NOHIFND_xxx);
|
||
#endif
|
||
}
|
||
if (Curwin->findstr[0]) {
|
||
SETw(Curwin, INFINDS_xxx);
|
||
for (i = Curwin->begtask; i < PIDSmaxt; i++) {
|
||
const char *row = task_show(Curwin, Curwin->ppt[i]);
|
||
if (*row && -1 < find_ofs(Curwin, row)) {
|
||
found = 1;
|
||
if (i == Curwin->begtask) continue;
|
||
Curwin->begtask = i;
|
||
return;
|
||
}
|
||
}
|
||
show_msg(fmtmk(N_fmt(FIND_no_find_fmt), reDUX, Curwin->findstr));
|
||
}
|
||
#undef reDUX
|
||
} // end: find_string
|
||
|
||
|
||
static void help_view (void) {
|
||
WIN_t *w = Curwin; // avoid gcc bloat with a local copy
|
||
char key = 1;
|
||
|
||
putp((Cursor_state = Cap_curs_huge));
|
||
signify_that:
|
||
putp(Cap_clr_scr);
|
||
adj_geometry();
|
||
|
||
show_special(1, fmtmk(N_unq(KEYS_helpbas_fmt)
|
||
, PACKAGE_STRING
|
||
, w->grpname
|
||
, CHKw(w, Show_CTIMES) ? N_txt(ON_word_only_txt) : N_txt(OFF_one_word_txt)
|
||
, Rc.delay_time
|
||
, Secure_mode ? N_txt(ON_word_only_txt) : N_txt(OFF_one_word_txt)
|
||
, Secure_mode ? "" : N_unq(KEYS_helpext_fmt)));
|
||
putp(Cap_clr_eos);
|
||
fflush(stdout);
|
||
|
||
if (Frames_signal) goto signify_that;
|
||
key = iokey(1);
|
||
if (key < 1) goto signify_that;
|
||
|
||
switch (key) {
|
||
case kbd_ESC: case 'q':
|
||
break;
|
||
case '?': case 'h': case 'H':
|
||
do {
|
||
putp(Cap_home);
|
||
show_special(1, fmtmk(N_unq(WINDOWS_help_fmt)
|
||
, w->grpname
|
||
, Winstk[0].rc.winname, Winstk[1].rc.winname
|
||
, Winstk[2].rc.winname, Winstk[3].rc.winname));
|
||
putp(Cap_clr_eos);
|
||
fflush(stdout);
|
||
if (Frames_signal || (key = iokey(1)) < 1) {
|
||
adj_geometry();
|
||
putp(Cap_clr_scr);
|
||
} else w = win_select(key);
|
||
} while (key != kbd_ENTER && key != kbd_ESC);
|
||
break;
|
||
default:
|
||
goto signify_that;
|
||
}
|
||
} // end: help_view
|
||
|
||
|
||
static void other_selection (int ch) {
|
||
int (*rel)(const char *, const char *);
|
||
char *(*sel)(const char *, const char *);
|
||
char raw[MEDBUFSIZ], ops, *glob, *pval;
|
||
struct osel_s *osel;
|
||
const char *typ;
|
||
int inc, enu;
|
||
|
||
if (ch == 'o') {
|
||
typ = N_txt(OSEL_casenot_txt);
|
||
rel = strcasecmp;
|
||
sel = strcasestr;
|
||
} else {
|
||
typ = N_txt(OSEL_caseyes_txt);
|
||
rel = strcmp;
|
||
sel = strstr;
|
||
}
|
||
glob = ioline(fmtmk(N_fmt(OSEL_prompts_fmt), Curwin->osel_tot + 1, typ));
|
||
if (*glob == kbd_ESC
|
||
|| !snprintf(raw, sizeof(raw), "%s", glob))
|
||
return;
|
||
for (osel = Curwin->osel_1st; osel; ) {
|
||
if (!strcmp(osel->raw, glob)) { // #1: is criteria duplicate?
|
||
show_msg(N_txt(OSEL_errdups_txt));
|
||
return;
|
||
}
|
||
osel = osel->nxt;
|
||
}
|
||
if (*glob != '!') inc = 1; // #2: is it include/exclude?
|
||
else { ++glob; inc = 0; }
|
||
if (!(pval = strpbrk(glob, "<=>"))) { // #3: do we see a delimiter?
|
||
show_msg(fmtmk(N_fmt(OSEL_errdelm_fmt)
|
||
, inc ? N_txt(WORD_include_txt) : N_txt(WORD_exclude_txt)));
|
||
return;
|
||
}
|
||
ops = *(pval);
|
||
*(pval++) = '\0';
|
||
for (enu = 0; enu < EU_MAXPFLGS; enu++) // #4: is this a valid field?
|
||
if (!STRCMP(N_col(enu), glob)) break;
|
||
if (enu == EU_MAXPFLGS) {
|
||
show_msg(fmtmk(N_fmt(XTRA_badflds_fmt), glob));
|
||
return;
|
||
}
|
||
if (!(*pval)) { // #5: did we get some value?
|
||
show_msg(fmtmk(N_fmt(OSEL_errvalu_fmt)
|
||
, inc ? N_txt(WORD_include_txt) : N_txt(WORD_exclude_txt)));
|
||
return;
|
||
}
|
||
osel = alloc_c(sizeof(struct osel_s));
|
||
osel->inc = inc;
|
||
osel->enu = enu;
|
||
osel->ops = ops;
|
||
if (ops == '=') osel->val = alloc_s(pval);
|
||
else osel->val = alloc_s(justify_pad(pval, Fieldstab[enu].width, Fieldstab[enu].align));
|
||
osel->rel = rel;
|
||
osel->sel = sel;
|
||
osel->raw = alloc_s(raw);
|
||
osel->nxt = Curwin->osel_1st;
|
||
Curwin->osel_1st = osel;
|
||
Curwin->osel_tot += 1;
|
||
if (!Curwin->osel_prt) Curwin->osel_prt = alloc_c(strlen(raw) + 3);
|
||
else Curwin->osel_prt = alloc_r(Curwin->osel_prt, strlen(Curwin->osel_prt) + strlen(raw) + 6);
|
||
strcat(Curwin->osel_prt, fmtmk("%s'%s'", (Curwin->osel_tot > 1) ? " + " : "", raw));
|
||
#ifndef USE_X_COLHDR
|
||
SETw(Curwin, NOHISEL_xxx);
|
||
#endif
|
||
} // end: other_selection
|
||
|
||
|
||
static void write_rcfile (void) {
|
||
FILE *fp;
|
||
int i;
|
||
|
||
if (Rc_questions) {
|
||
show_pmt(N_txt(XTRA_warncfg_txt));
|
||
if ('y' != tolower(iokey(1)))
|
||
return;
|
||
Rc_questions = 0;
|
||
}
|
||
if (!(fp = fopen(Rc_name, "w"))) {
|
||
show_msg(fmtmk(N_fmt(FAIL_rc_open_fmt), Rc_name, strerror(errno)));
|
||
return;
|
||
}
|
||
fprintf(fp, "%s's " RCF_EYECATCHER, Myname);
|
||
fprintf(fp, "Id:%c, Mode_altscr=%d, Mode_irixps=%d, Delay_time=%d.%d, Curwin=%d\n"
|
||
, RCF_VERSION_ID
|
||
, Rc.mode_altscr, Rc.mode_irixps
|
||
// this may be ugly, but it keeps us locale independent...
|
||
, (int)Rc.delay_time, (int)((Rc.delay_time - (int)Rc.delay_time) * 1000)
|
||
, (int)(Curwin - Winstk));
|
||
|
||
for (i = 0 ; i < GROUPSMAX; i++) {
|
||
fprintf(fp, "%s\tfieldscur=%s\n"
|
||
, Winstk[i].rc.winname, Winstk[i].rc.fieldscur);
|
||
fprintf(fp, "\twinflags=%d, sortindx=%d, maxtasks=%d, graph_cpus=%d, graph_mems=%d\n"
|
||
, Winstk[i].rc.winflags, Winstk[i].rc.sortindx, Winstk[i].rc.maxtasks
|
||
, Winstk[i].rc.graph_cpus, Winstk[i].rc.graph_mems);
|
||
fprintf(fp, "\tsummclr=%d, msgsclr=%d, headclr=%d, taskclr=%d\n"
|
||
, Winstk[i].rc.summclr, Winstk[i].rc.msgsclr
|
||
, Winstk[i].rc.headclr, Winstk[i].rc.taskclr);
|
||
}
|
||
|
||
// any new addition(s) last, for older rcfiles compatibility...
|
||
fprintf(fp, "Fixed_widest=%d, Summ_mscale=%d, Task_mscale=%d, Zero_suppress=%d\n"
|
||
, Rc.fixed_widest, Rc.summ_mscale, Rc.task_mscale, Rc.zero_suppress);
|
||
|
||
if (Inspect.raw)
|
||
fputs(Inspect.raw, fp);
|
||
|
||
fclose(fp);
|
||
show_msg(fmtmk(N_fmt(WRITE_rcfile_fmt), Rc_name));
|
||
} // end: write_rcfile
|
||
|
||
/*###### Interactive Input Secondary support (do_key helpers) ##########*/
|
||
|
||
/*
|
||
* These routines exist just to keep the do_key() function
|
||
* a reasonably modest size. */
|
||
|
||
static void keys_global (int ch) {
|
||
WIN_t *w = Curwin; // avoid gcc bloat with a local copy
|
||
|
||
switch (ch) {
|
||
case '?':
|
||
case 'h':
|
||
help_view();
|
||
break;
|
||
case 'B':
|
||
TOGw(w, View_NOBOLD);
|
||
capsmk(w);
|
||
break;
|
||
case 'd':
|
||
case 's':
|
||
if (Secure_mode)
|
||
show_msg(N_txt(NOT_onsecure_txt));
|
||
else {
|
||
float tmp =
|
||
get_float(fmtmk(N_fmt(DELAY_change_fmt), Rc.delay_time));
|
||
if (tmp > -1) Rc.delay_time = tmp;
|
||
}
|
||
break;
|
||
case 'E':
|
||
if (++Rc.summ_mscale > SK_Eb) Rc.summ_mscale = SK_Kb;
|
||
break;
|
||
case 'e':
|
||
if (++Rc.task_mscale > SK_Pb) Rc.task_mscale = SK_Kb;
|
||
break;
|
||
case 'F':
|
||
case 'f':
|
||
fields_utility();
|
||
break;
|
||
case 'g':
|
||
win_select(0);
|
||
break;
|
||
case 'H':
|
||
Thread_mode = !Thread_mode;
|
||
if (!CHKw(w, View_STATES))
|
||
show_msg(fmtmk(N_fmt(THREADS_show_fmt)
|
||
, Thread_mode ? N_txt(ON_word_only_txt) : N_txt(OFF_one_word_txt)));
|
||
// force an extra procs refresh to avoid %cpu distortions...
|
||
Pseudo_row = PROC_XTRA;
|
||
break;
|
||
case 'I':
|
||
if (Cpu_cnt > 1) {
|
||
Rc.mode_irixps = !Rc.mode_irixps;
|
||
show_msg(fmtmk(N_fmt(IRIX_curmode_fmt)
|
||
, Rc.mode_irixps ? N_txt(ON_word_only_txt) : N_txt(OFF_one_word_txt)));
|
||
} else
|
||
show_msg(N_txt(NOT_smp_cpus_txt));
|
||
break;
|
||
case 'k':
|
||
if (Secure_mode) {
|
||
show_msg(N_txt(NOT_onsecure_txt));
|
||
} else {
|
||
int sig = SIGTERM,
|
||
def = PID_VAL(EU_PID, s_int, w->ppt[w->begtask]),
|
||
pid = get_int(fmtmk(N_txt(GET_pid2kill_fmt), def));
|
||
if (pid > GET_NUM_ESC) {
|
||
char *str;
|
||
if (pid == GET_NUM_NOT) pid = def;
|
||
str = ioline(fmtmk(N_fmt(GET_sigs_num_fmt), pid, SIGTERM));
|
||
if (*str != kbd_ESC) {
|
||
if (*str) sig = signal_name_to_number(str);
|
||
if (Frames_signal) break;
|
||
if (0 < sig && kill(pid, sig))
|
||
show_msg(fmtmk(N_fmt(FAIL_signals_fmt)
|
||
, pid, sig, strerror(errno)));
|
||
else if (0 > sig) show_msg(N_txt(BAD_signalid_txt));
|
||
}
|
||
}
|
||
}
|
||
break;
|
||
case 'r':
|
||
if (Secure_mode)
|
||
show_msg(N_txt(NOT_onsecure_txt));
|
||
else {
|
||
int val,
|
||
def = PID_VAL(EU_PID, s_int, w->ppt[w->begtask]),
|
||
pid = get_int(fmtmk(N_txt(GET_pid2nice_fmt), def));
|
||
if (pid > GET_NUM_ESC) {
|
||
if (pid == GET_NUM_NOT) pid = def;
|
||
val = get_int(fmtmk(N_fmt(GET_nice_num_fmt), pid));
|
||
if (val > GET_NUM_NOT
|
||
&& setpriority(PRIO_PROCESS, (unsigned)pid, val))
|
||
show_msg(fmtmk(N_fmt(FAIL_re_nice_fmt)
|
||
, pid, val, strerror(errno)));
|
||
}
|
||
}
|
||
break;
|
||
case 'X':
|
||
{ int wide = get_int(fmtmk(N_fmt(XTRA_fixwide_fmt), Rc.fixed_widest));
|
||
if (wide > GET_NUM_NOT) {
|
||
if (wide > -1) Rc.fixed_widest = wide;
|
||
else Rc.fixed_widest = -1;
|
||
}
|
||
}
|
||
break;
|
||
case 'Y':
|
||
if (!Inspect.total)
|
||
ioline(N_txt(YINSP_noents_txt));
|
||
else {
|
||
int def = PID_VAL(EU_PID, s_int, w->ppt[w->begtask]),
|
||
pid = get_int(fmtmk(N_fmt(YINSP_pidsee_fmt), def));
|
||
if (pid > GET_NUM_ESC) {
|
||
if (pid == GET_NUM_NOT) pid = def;
|
||
if (pid) inspection_utility(pid);
|
||
}
|
||
}
|
||
break;
|
||
case 'Z':
|
||
wins_colors();
|
||
break;
|
||
case '0':
|
||
Rc.zero_suppress = !Rc.zero_suppress;
|
||
break;
|
||
case kbd_ENTER: // these two have the effect of waking us
|
||
case kbd_SPACE: // from 'pselect', refreshing the display
|
||
break; // and updating any hot-plugged resources
|
||
default: // keep gcc happy
|
||
break;
|
||
}
|
||
} // end: keys_global
|
||
|
||
|
||
static void keys_summary (int ch) {
|
||
WIN_t *w = Curwin; // avoid gcc bloat with a local copy
|
||
|
||
switch (ch) {
|
||
case '1':
|
||
if (CHKw(w, View_CPUNOD)) OFFw(w, View_CPUSUM);
|
||
else TOGw(w, View_CPUSUM);
|
||
OFFw(w, View_CPUNOD);
|
||
SETw(w, View_STATES);
|
||
break;
|
||
case '2':
|
||
if (!Numa_node_tot)
|
||
show_msg(N_txt(NUMA_nodenot_txt));
|
||
else {
|
||
if (Numa_node_sel < 0) TOGw(w, View_CPUNOD);
|
||
if (!CHKw(w, View_CPUNOD)) SETw(w, View_CPUSUM);
|
||
SETw(w, View_STATES);
|
||
Numa_node_sel = -1;
|
||
}
|
||
break;
|
||
case '3':
|
||
if (!Numa_node_tot)
|
||
show_msg(N_txt(NUMA_nodenot_txt));
|
||
else {
|
||
int num = get_int(fmtmk(N_fmt(NUMA_nodeget_fmt), Numa_node_tot -1));
|
||
if (num > GET_NUM_NOT) {
|
||
if (num >= 0 && num < Numa_node_tot) {
|
||
Numa_node_sel = num;
|
||
SETw(w, View_CPUNOD | View_STATES);
|
||
OFFw(w, View_CPUSUM);
|
||
} else
|
||
show_msg(N_txt(NUMA_nodebad_txt));
|
||
}
|
||
}
|
||
break;
|
||
case 'C':
|
||
VIZTOGw(w, View_SCROLL);
|
||
break;
|
||
case 'l':
|
||
TOGw(w, View_LOADAV);
|
||
break;
|
||
case 'm':
|
||
if (!CHKw(w, View_MEMORY))
|
||
SETw(w, View_MEMORY);
|
||
else if (++w->rc.graph_mems > 2) {
|
||
w->rc.graph_mems = 0;;
|
||
OFFw(w, View_MEMORY);
|
||
}
|
||
break;
|
||
case 't':
|
||
if (!CHKw(w, View_STATES))
|
||
SETw(w, View_STATES);
|
||
else if (++w->rc.graph_cpus > 2) {
|
||
w->rc.graph_cpus = 0;;
|
||
OFFw(w, View_STATES);
|
||
}
|
||
break;
|
||
default: // keep gcc happy
|
||
break;
|
||
}
|
||
} // end: keys_summary
|
||
|
||
|
||
static void keys_task (int ch) {
|
||
WIN_t *w = Curwin; // avoid gcc bloat with a local copy
|
||
|
||
switch (ch) {
|
||
case '#':
|
||
case 'n':
|
||
if (VIZCHKw(w)) {
|
||
int num = get_int(fmtmk(N_fmt(GET_max_task_fmt), w->rc.maxtasks));
|
||
if (num > GET_NUM_NOT) {
|
||
if (-1 < num ) w->rc.maxtasks = num;
|
||
else show_msg(N_txt(BAD_max_task_txt));
|
||
}
|
||
}
|
||
break;
|
||
case '<':
|
||
#ifdef TREE_NORESET
|
||
if (CHKw(w, Show_FOREST)) break;
|
||
#endif
|
||
if (VIZCHKw(w)) {
|
||
FLG_t *p = w->procflgs + w->maxpflgs - 1;
|
||
while (p > w->procflgs && *p != w->rc.sortindx) --p;
|
||
if (*p == w->rc.sortindx) {
|
||
--p;
|
||
#ifndef USE_X_COLHDR
|
||
if (EU_MAXPFLGS < *p) --p;
|
||
#endif
|
||
if (p >= w->procflgs) {
|
||
w->rc.sortindx = *p;
|
||
#ifndef TREE_NORESET
|
||
OFFw(w, Show_FOREST);
|
||
#endif
|
||
}
|
||
}
|
||
}
|
||
break;
|
||
case '>':
|
||
#ifdef TREE_NORESET
|
||
if (CHKw(w, Show_FOREST)) break;
|
||
#endif
|
||
if (VIZCHKw(w)) {
|
||
FLG_t *p = w->procflgs + w->maxpflgs - 1;
|
||
while (p > w->procflgs && *p != w->rc.sortindx) --p;
|
||
if (*p == w->rc.sortindx) {
|
||
++p;
|
||
#ifndef USE_X_COLHDR
|
||
if (EU_MAXPFLGS < *p) ++p;
|
||
#endif
|
||
if (p < w->procflgs + w->maxpflgs) {
|
||
w->rc.sortindx = *p;
|
||
#ifndef TREE_NORESET
|
||
OFFw(w, Show_FOREST);
|
||
#endif
|
||
}
|
||
}
|
||
}
|
||
break;
|
||
case 'b':
|
||
TOGw(w, Show_HIBOLD);
|
||
capsmk(w);
|
||
break;
|
||
case 'c':
|
||
VIZTOGw(w, Show_CMDLIN);
|
||
break;
|
||
case 'i':
|
||
{ static WIN_t *w_sav;
|
||
static int beg_sav;
|
||
if (w_sav != w) { beg_sav = 0; w_sav = w; }
|
||
if (CHKw(w, Show_IDLEPS)) { beg_sav = w->begtask; w->begtask = 0; }
|
||
else { w->begtask = beg_sav; beg_sav = 0; }
|
||
}
|
||
VIZTOGw(w, Show_IDLEPS);
|
||
break;
|
||
case 'J':
|
||
VIZTOGw(w, Show_JRNUMS);
|
||
break;
|
||
case 'j':
|
||
VIZTOGw(w, Show_JRSTRS);
|
||
break;
|
||
case 'R':
|
||
#ifdef TREE_NORESET
|
||
if (!CHKw(w, Show_FOREST)) VIZTOGw(w, Qsrt_NORMAL);
|
||
#else
|
||
if (VIZCHKw(w)) {
|
||
TOGw(w, Qsrt_NORMAL);
|
||
OFFw(w, Show_FOREST);
|
||
}
|
||
#endif
|
||
break;
|
||
case 'S':
|
||
if (VIZCHKw(w)) {
|
||
TOGw(w, Show_CTIMES);
|
||
show_msg(fmtmk(N_fmt(TIME_accumed_fmt) , CHKw(w, Show_CTIMES)
|
||
? N_txt(ON_word_only_txt) : N_txt(OFF_one_word_txt)));
|
||
}
|
||
break;
|
||
case 'O':
|
||
case 'o':
|
||
if (VIZCHKw(w)) other_selection(ch);
|
||
break;
|
||
case 'U':
|
||
case 'u':
|
||
if (VIZCHKw(w)) {
|
||
const char *errmsg, *str = ioline(N_txt(GET_user_ids_txt));
|
||
if (*str != kbd_ESC
|
||
&& (errmsg = user_certify(w, str, ch)))
|
||
show_msg(errmsg);
|
||
}
|
||
break;
|
||
case 'V':
|
||
if (VIZCHKw(w)) {
|
||
TOGw(w, Show_FOREST);
|
||
if (!ENUviz(w, EU_CMD))
|
||
show_msg(fmtmk(N_fmt(FOREST_modes_fmt) , CHKw(w, Show_FOREST)
|
||
? N_txt(ON_word_only_txt) : N_txt(OFF_one_word_txt)));
|
||
}
|
||
break;
|
||
case 'x':
|
||
if (VIZCHKw(w)) {
|
||
#ifdef USE_X_COLHDR
|
||
TOGw(w, Show_HICOLS);
|
||
capsmk(w);
|
||
#else
|
||
if (ENUviz(w, w->rc.sortindx)
|
||
&& !CHKw(w, NOHIFND_xxx | NOHISEL_xxx)) {
|
||
TOGw(w, Show_HICOLS);
|
||
if (ENUpos(w, w->rc.sortindx) < w->begpflg) {
|
||
if (CHKw(w, Show_HICOLS)) w->begpflg += 2;
|
||
else w->begpflg -= 2;
|
||
if (0 > w->begpflg) w->begpflg = 0;
|
||
}
|
||
capsmk(w);
|
||
}
|
||
#endif
|
||
}
|
||
break;
|
||
case 'y':
|
||
if (VIZCHKw(w)) {
|
||
TOGw(w, Show_HIROWS);
|
||
capsmk(w);
|
||
}
|
||
break;
|
||
case 'z':
|
||
if (VIZCHKw(w)) {
|
||
TOGw(w, Show_COLORS);
|
||
capsmk(w);
|
||
}
|
||
break;
|
||
case kbd_CtrlO:
|
||
if (VIZCHKw(w))
|
||
ioline(fmtmk(N_fmt(OSEL_statlin_fmt)
|
||
, w->osel_prt ? w->osel_prt : N_txt(WORD_noneone_txt)));
|
||
break;
|
||
default: // keep gcc happy
|
||
break;
|
||
}
|
||
} // end: keys_task
|
||
|
||
|
||
static void keys_window (int ch) {
|
||
WIN_t *w = Curwin; // avoid gcc bloat with a local copy
|
||
|
||
switch (ch) {
|
||
case '+':
|
||
if (ALTCHKw) wins_reflag(Flags_OFF, EQUWINS_xxx);
|
||
break;
|
||
case '-':
|
||
if (ALTCHKw) TOGw(w, Show_TASKON);
|
||
break;
|
||
case '=':
|
||
win_reset(w);
|
||
break;
|
||
case '_':
|
||
if (ALTCHKw) wins_reflag(Flags_TOG, Show_TASKON);
|
||
break;
|
||
case '&':
|
||
case 'L':
|
||
if (VIZCHKw(w)) find_string(ch);
|
||
break;
|
||
case 'A':
|
||
Rc.mode_altscr = !Rc.mode_altscr;
|
||
break;
|
||
case 'a':
|
||
case 'w':
|
||
if (ALTCHKw) win_select(ch);
|
||
break;
|
||
case 'G':
|
||
if (ALTCHKw) {
|
||
char tmp[SMLBUFSIZ];
|
||
STRLCPY(tmp, ioline(fmtmk(N_fmt(NAME_windows_fmt), w->rc.winname)));
|
||
if (tmp[0] && tmp[0] != kbd_ESC) win_names(w, tmp);
|
||
}
|
||
break;
|
||
case kbd_UP:
|
||
if (VIZCHKw(w)) if (CHKw(w, Show_IDLEPS) && 0 < w->begtask) w->begtask -= 1;
|
||
break;
|
||
case kbd_DOWN:
|
||
if (VIZCHKw(w)) if (CHKw(w, Show_IDLEPS) && (w->begtask < PIDSmaxt -1)) w->begtask += 1;
|
||
break;
|
||
#ifdef USE_X_COLHDR // ------------------------------------
|
||
case kbd_LEFT:
|
||
#ifndef SCROLLVAR_NO
|
||
if (VIZCHKw(w)) {
|
||
if (VARleft(w))
|
||
w->varcolbeg -= SCROLLAMT;
|
||
else if (0 < w->begpflg)
|
||
w->begpflg -= 1;
|
||
}
|
||
#else
|
||
if (VIZCHKw(w)) if (0 < w->begpflg) w->begpflg -= 1;
|
||
#endif
|
||
break;
|
||
case kbd_RIGHT:
|
||
#ifndef SCROLLVAR_NO
|
||
if (VIZCHKw(w)) {
|
||
if (VARright(w)) {
|
||
w->varcolbeg += SCROLLAMT;
|
||
if (0 > w->varcolbeg) w->varcolbeg = 0;
|
||
} else if (w->begpflg + 1 < w->totpflgs)
|
||
w->begpflg += 1;
|
||
}
|
||
#else
|
||
if (VIZCHKw(w)) if (w->begpflg + 1 < w->totpflgs) w->begpflg += 1;
|
||
#endif
|
||
break;
|
||
#else // USE_X_COLHDR ------------------------------------
|
||
case kbd_LEFT:
|
||
#ifndef SCROLLVAR_NO
|
||
if (VIZCHKw(w)) {
|
||
if (VARleft(w))
|
||
w->varcolbeg -= SCROLLAMT;
|
||
else if (0 < w->begpflg) {
|
||
w->begpflg -= 1;
|
||
if (EU_MAXPFLGS < w->pflgsall[w->begpflg]) w->begpflg -= 2;
|
||
}
|
||
}
|
||
#else
|
||
if (VIZCHKw(w)) if (0 < w->begpflg) {
|
||
w->begpflg -= 1;
|
||
if (EU_MAXPFLGS < w->pflgsall[w->begpflg]) w->begpflg -= 2;
|
||
}
|
||
#endif
|
||
break;
|
||
case kbd_RIGHT:
|
||
#ifndef SCROLLVAR_NO
|
||
if (VIZCHKw(w)) {
|
||
if (VARright(w)) {
|
||
w->varcolbeg += SCROLLAMT;
|
||
if (0 > w->varcolbeg) w->varcolbeg = 0;
|
||
} else if (w->begpflg + 1 < w->totpflgs) {
|
||
if (EU_MAXPFLGS < w->pflgsall[w->begpflg])
|
||
w->begpflg += (w->begpflg + 3 < w->totpflgs) ? 3 : 0;
|
||
else w->begpflg += 1;
|
||
}
|
||
}
|
||
#else
|
||
if (VIZCHKw(w)) if (w->begpflg + 1 < w->totpflgs) {
|
||
if (EU_MAXPFLGS < w->pflgsall[w->begpflg])
|
||
w->begpflg += (w->begpflg + 3 < w->totpflgs) ? 3 : 0;
|
||
else w->begpflg += 1;
|
||
}
|
||
#endif
|
||
break;
|
||
#endif // USE_X_COLHDR ------------------------------------
|
||
case kbd_PGUP:
|
||
if (VIZCHKw(w)) if (0 < w->begtask) {
|
||
w->begtask -= (w->winlines - 1);
|
||
if (0 > w->begtask) w->begtask = 0;
|
||
}
|
||
break;
|
||
case kbd_PGDN:
|
||
if (VIZCHKw(w)) if (w->begtask < PIDSmaxt -1) {
|
||
w->begtask += (w->winlines - 1);
|
||
if (w->begtask > PIDSmaxt -1) w->begtask = PIDSmaxt -1;
|
||
if (0 > w->begtask) w->begtask = 0;
|
||
}
|
||
break;
|
||
case kbd_HOME:
|
||
#ifndef SCROLLVAR_NO
|
||
if (VIZCHKw(w)) w->begtask = w->begpflg = w->varcolbeg = 0;
|
||
#else
|
||
if (VIZCHKw(w)) w->begtask = w->begpflg = 0;
|
||
#endif
|
||
break;
|
||
case kbd_END:
|
||
if (VIZCHKw(w)) {
|
||
w->begtask = (PIDSmaxt - w->winlines) +1;
|
||
if (0 > w->begtask) w->begtask = 0;
|
||
w->begpflg = w->endpflg;
|
||
#ifndef SCROLLVAR_NO
|
||
w->varcolbeg = 0;
|
||
#endif
|
||
}
|
||
break;
|
||
default: // keep gcc happy
|
||
break;
|
||
}
|
||
} // end: keys_window
|
||
|
||
|
||
static void keys_xtra (int ch) {
|
||
// const char *xmsg;
|
||
WIN_t *w = Curwin; // avoid gcc bloat with a local copy
|
||
|
||
#ifdef TREE_NORESET
|
||
if (CHKw(w, Show_FOREST)) return;
|
||
#else
|
||
OFFw(w, Show_FOREST);
|
||
#endif
|
||
/* these keys represent old-top compatibility --
|
||
they're grouped here so that if users could ever be weaned,
|
||
we would just whack do_key's key_tab entry and this function... */
|
||
switch (ch) {
|
||
case 'M':
|
||
w->rc.sortindx = EU_MEM;
|
||
// xmsg = "Memory";
|
||
break;
|
||
case 'N':
|
||
w->rc.sortindx = EU_PID;
|
||
// xmsg = "Numerical";
|
||
break;
|
||
case 'P':
|
||
w->rc.sortindx = EU_CPU;
|
||
// xmsg = "CPU";
|
||
break;
|
||
case 'T':
|
||
w->rc.sortindx = EU_TM2;
|
||
// xmsg = "Time";
|
||
break;
|
||
default: // keep gcc happy
|
||
break;
|
||
}
|
||
// some have objected to this message, so we'll just keep silent...
|
||
// show_msg(fmtmk("%s sort compatibility key honored", xmsg));
|
||
} // end: keys_xtra
|
||
|
||
/*###### Forest View support ###########################################*/
|
||
|
||
/*
|
||
* We try to keep most existing code unaware of our activities
|
||
* ( plus, maintain alphabetical order with carefully chosen )
|
||
* ( function names like such: forest_a, forest_b & forest_c )
|
||
* ( each with exactly one letter more than its predecessor! ) */
|
||
static struct pids_stack **Seed_ppt; // temporary win ppt pointer
|
||
static struct pids_stack **Tree_ppt; // forest_begin resizes this
|
||
static int Tree_idx; // frame_make resets to zero
|
||
|
||
/*
|
||
* This little recursive guy is the real forest view workhorse.
|
||
* He fills in the Tree_ppt array and also sets the child indent
|
||
* level which is stored in an 'extra' result struct as a u_int. */
|
||
static void forest_adds (const int self, int level) {
|
||
// tailored 'results stack value' extractor macros
|
||
#define rSv(E,X) PID_VAL(E, s_int, Seed_ppt[X])
|
||
#define rLevel PID_VAL(eu_XTRA, u_int, Tree_ppt[Tree_idx])
|
||
int i;
|
||
|
||
if (Tree_idx < PIDSmaxt) { // immunize against insanity
|
||
if (level > 100) level = 101; // our arbitrary nests limit
|
||
Tree_ppt[Tree_idx] = Seed_ppt[self]; // add this as root or child
|
||
rLevel = level; // while recording its level
|
||
++Tree_idx;
|
||
#ifdef TREE_SCANALL
|
||
for (i = 0; i < PIDSmaxt; i++) {
|
||
if (i == self) continue;
|
||
#else
|
||
for (i = self + 1; i < PIDSmaxt; i++) {
|
||
#endif
|
||
if (rSv(EU_PID, self) == rSv(EU_TGD, i)
|
||
|| (rSv(EU_PID, self) == rSv(EU_PPD, i) && rSv(EU_PID, i) == rSv(EU_TGD, i)))
|
||
forest_adds(i, level + 1); // got one child any others?
|
||
}
|
||
}
|
||
#undef rSv
|
||
#undef rLevel
|
||
} // end: forest_adds
|
||
|
||
|
||
/*
|
||
* This routine is responsible for preparing the stacks array for
|
||
* a forest display in the designated window. Upon completion,
|
||
* he'll replace the original window ppt with our specially
|
||
* ordered forest version. */
|
||
static void forest_begin (WIN_t *q) {
|
||
// tailored 'results stack value' extractor macro
|
||
#define rLevel PID_VAL(eu_XTRA, u_int, Seed_ppt[i])
|
||
static int hwmsav;
|
||
int i;
|
||
|
||
Seed_ppt = q->ppt; // avoid passing pointers
|
||
if (!Tree_idx) { // do just once per frame
|
||
if (hwmsav < PIDSmaxt) { // grow, but never shrink
|
||
hwmsav = PIDSmaxt;
|
||
Tree_ppt = alloc_r(Tree_ppt, sizeof(void*) * hwmsav);
|
||
}
|
||
#ifndef TREE_SCANALL
|
||
if (!(procps_pids_sort(Pids_ctx, Seed_ppt, PIDSmaxt
|
||
, PROCPS_PIDS_TIME_START, PROCPS_PIDS_ASCEND)))
|
||
error_exit(fmtmk(N_fmt(LIB_errorpid_fmt),__LINE__));
|
||
#endif
|
||
for (i = 0; i < PIDSmaxt; i++) // avoid any hidepid distortions
|
||
if (!rLevel) // identify real or pretend trees
|
||
forest_adds(i, 1); // add as parent plus its children
|
||
}
|
||
memcpy(Seed_ppt, Tree_ppt, sizeof(void*) * PIDSmaxt);
|
||
#undef rLevel
|
||
} // end: forest_begin
|
||
|
||
|
||
/*
|
||
* This guy adds the artwork to either a 'cmd' or 'cmdline'
|
||
* when in forest view mode, otherwise he just returns 'em. */
|
||
static inline const char *forest_colour (const WIN_t *q, struct pids_stack *p) {
|
||
// tailored 'results stack value' extractor macros
|
||
#define rSv(E) PID_VAL(E, str, p)
|
||
#define rLevel PID_VAL(eu_XTRA, u_int, p)
|
||
#ifndef SCROLLVAR_NO
|
||
static char buf[1024*64*2]; // the same as libray's max buffer size
|
||
#else
|
||
static char buf[ROWMINSIZ];
|
||
#endif
|
||
const char *which = (CHKw(q, Show_CMDLIN)) ? rSv(eu_CMDLINE) : rSv(EU_CMD);
|
||
|
||
if (!CHKw(q, Show_FOREST) || 1 == rLevel) return which;
|
||
if (rLevel > 100) snprintf(buf, sizeof(buf), "%400s%s", " + ", which);
|
||
else snprintf(buf, sizeof(buf), "%*s%s", 4 * (rLevel - 1), " `- ", which);
|
||
return buf;
|
||
#undef rSv
|
||
#undef rLevel
|
||
} // end: forest_colour
|
||
|
||
/*###### Main Screen routines ##########################################*/
|
||
|
||
/*
|
||
* Process keyboard input during the main loop */
|
||
static void do_key (int ch) {
|
||
static struct {
|
||
void (*func)(int ch);
|
||
char keys[SMLBUFSIZ];
|
||
} key_tab[] = {
|
||
{ keys_global,
|
||
{ '?', 'B', 'd', 'E', 'e', 'F', 'f', 'g', 'H', 'h'
|
||
, 'I', 'k', 'r', 's', 'X', 'Y', 'Z', '0'
|
||
, kbd_ENTER, kbd_SPACE, '\0' } },
|
||
{ keys_summary,
|
||
{ '1', '2', '3', 'C', 'l', 'm', 't', '\0' } },
|
||
{ keys_task,
|
||
{ '#', '<', '>', 'b', 'c', 'i', 'J', 'j', 'n', 'O', 'o'
|
||
, 'R', 'S', 'U', 'u', 'V', 'x', 'y', 'z'
|
||
, kbd_CtrlO, '\0' } },
|
||
{ keys_window,
|
||
{ '+', '-', '=', '_', '&', 'A', 'a', 'G', 'L', 'w'
|
||
, kbd_UP, kbd_DOWN, kbd_LEFT, kbd_RIGHT, kbd_PGUP, kbd_PGDN
|
||
, kbd_HOME, kbd_END, '\0' } },
|
||
{ keys_xtra,
|
||
{ 'M', 'N', 'P', 'T', '\0'} }
|
||
};
|
||
int i;
|
||
|
||
switch (ch) {
|
||
case 0: // ignored (always)
|
||
case kbd_ESC: // ignored (sometimes)
|
||
goto all_done;
|
||
case 'q': // no return from this guy
|
||
bye_bye(NULL);
|
||
case 'W': // no need for rebuilds
|
||
write_rcfile();
|
||
goto all_done;
|
||
default: // and now, the real work...
|
||
for (i = 0; i < MAXTBL(key_tab); ++i)
|
||
if (strchr(key_tab[i].keys, ch)) {
|
||
key_tab[i].func(ch);
|
||
Frames_signal = BREAK_kbd;
|
||
goto all_done;
|
||
}
|
||
};
|
||
/* Frames_signal above will force a rebuild of all column headers and
|
||
the PROC_FILLxxx flags. It's NOT simply lazy programming. Here are
|
||
some keys that COULD require new column headers and/or libproc flags:
|
||
'A' - likely
|
||
'c' - likely when !Mode_altscr, maybe when Mode_altscr
|
||
'F' - likely
|
||
'f' - likely
|
||
'g' - likely
|
||
'H' - likely
|
||
'I' - likely
|
||
'J' - always
|
||
'j' - always
|
||
'Z' - likely, if 'Curwin' changed when !Mode_altscr
|
||
'-' - likely (restricted to Mode_altscr)
|
||
'_' - likely (restricted to Mode_altscr)
|
||
'=' - maybe, but only when Mode_altscr
|
||
'+' - likely (restricted to Mode_altscr)
|
||
PLUS, likely for FOUR of the EIGHT cursor motion keys (scrolled)
|
||
( At this point we have a human being involved and so have all the time )
|
||
( in the world. We can afford a few extra cpu cycles every now & then! )
|
||
*/
|
||
|
||
show_msg(N_txt(UNKNOWN_cmds_txt));
|
||
all_done:
|
||
sysinfo_refresh(1); // let's be more responsive to hot-pluggin'
|
||
putp((Cursor_state = Cap_curs_hide));
|
||
} // end: do_key
|
||
|
||
|
||
/*
|
||
* State display *Helper* function to calc and display the state
|
||
* percentages for a single cpu. In this way, we can support
|
||
* the following environments without the usual code bloat.
|
||
* 1) single cpu machines
|
||
* 2) modest smp boxes with room for each cpu's percentages
|
||
* 3) massive smp guys leaving little or no room for process
|
||
* display and thus requiring the cpu summary toggle */
|
||
static void summary_hlp (struct stat_stack *this, const char *pfx) {
|
||
// a tailored 'results stack value' extractor macro
|
||
#define rSv(E) PROCPS_STAT_VAL(E, sl_int, this)
|
||
SIC_t u_frme, s_frme, n_frme, i_frme, w_frme, x_frme, y_frme, z_frme, tot_frme;
|
||
float scale;
|
||
|
||
u_frme = rSv(stat_US); s_frme = rSv(stat_SY); n_frme = rSv(stat_NI);
|
||
i_frme = rSv(stat_IL); w_frme = rSv(stat_IO); x_frme = rSv(stat_IR);
|
||
y_frme = rSv(stat_SI); z_frme = rSv(stat_ST);
|
||
|
||
tot_frme = u_frme + s_frme + n_frme + i_frme + w_frme + x_frme + y_frme + z_frme;
|
||
if (1 > tot_frme) i_frme = tot_frme = 1;
|
||
scale = 100.0 / (float)tot_frme;
|
||
|
||
/* display some kinda' cpu state percentages
|
||
(who or what is explained by the passed prefix) */
|
||
if (Curwin->rc.graph_cpus) {
|
||
static struct {
|
||
const char *user, *syst, *type;
|
||
} gtab[] = {
|
||
{ "%-.*s~7", "%-.*s~8", Graph_bars },
|
||
{ "%-.*s~4", "%-.*s~6", Graph_blks }
|
||
};
|
||
char user[SMLBUFSIZ], syst[SMLBUFSIZ], dual[MEDBUFSIZ];
|
||
int ix = Curwin->rc.graph_cpus - 1;
|
||
float pct_user = (float)(u_frme + n_frme) * scale,
|
||
pct_syst = (float)s_frme * scale;
|
||
#ifndef QUICK_GRAPHS
|
||
int num_user = (int)((pct_user * Graph_adj) + .5),
|
||
num_syst = (int)((pct_syst * Graph_adj) + .5);
|
||
if (num_user + num_syst > Graph_len) --num_syst;
|
||
snprintf(user, sizeof(user), gtab[ix].user, num_user, gtab[ix].type);
|
||
snprintf(syst, sizeof(syst), gtab[ix].syst, num_syst, gtab[ix].type);
|
||
#else
|
||
snprintf(user, sizeof(user), gtab[ix].user, (int)((pct_user * Graph_adj) + .5), gtab[ix].type);
|
||
snprintf(syst, sizeof(syst), gtab[ix].syst, (int)((pct_syst * Graph_adj) + .4), gtab[ix].type);
|
||
#endif
|
||
snprintf(dual, sizeof(dual), "%s%s", user, syst);
|
||
show_special(0, fmtmk("%%%s ~3%#5.1f~2/%-#5.1f~3 %3.0f[~1%-*s]~1\n"
|
||
, pfx, pct_user, pct_syst, pct_user + pct_syst, Graph_len +4, dual));
|
||
} else {
|
||
show_special(0, fmtmk(Cpu_States_fmts, pfx
|
||
, (float)u_frme * scale, (float)s_frme * scale
|
||
, (float)n_frme * scale, (float)i_frme * scale
|
||
, (float)w_frme * scale, (float)x_frme * scale
|
||
, (float)y_frme * scale, (float)z_frme * scale));
|
||
}
|
||
#undef rSv
|
||
} // end: summary_hlp
|
||
|
||
|
||
/*
|
||
* In support of a new frame:
|
||
* 1) Display uptime and load average (maybe)
|
||
* 2) Display task/cpu states (maybe)
|
||
* 3) Display memory & swap usage (maybe) */
|
||
static void summary_show (void) {
|
||
#define isROOM(f,n) (CHKw(w, f) && Msg_row + (n) < Screen_rows - 1)
|
||
#define anyFLG 0xffffff
|
||
WIN_t *w = Curwin; // avoid gcc bloat with a local copy
|
||
char tmp[MEDBUFSIZ];
|
||
int i;
|
||
|
||
// Display Uptime and Loadavg
|
||
if (isROOM(View_LOADAV, 1)) {
|
||
if (!Rc.mode_altscr)
|
||
show_special(0, fmtmk(LOADAV_line, Myname, procps_uptime_sprint()));
|
||
else
|
||
show_special(0, fmtmk(CHKw(w, Show_TASKON)? LOADAV_line_alt : LOADAV_line
|
||
, w->grpname, procps_uptime_sprint()));
|
||
Msg_row += 1;
|
||
} // end: View_LOADAV
|
||
|
||
// Display Task and Cpu(s) States
|
||
if (isROOM(View_STATES, 2)) {
|
||
show_special(0, fmtmk(N_unq(STATE_line_1_fmt)
|
||
, Thread_mode ? N_txt(WORD_threads_txt) : N_txt(WORD_process_txt)
|
||
, PIDSmaxt, Pids_read->counts.running, Pids_read->counts.sleeping
|
||
, Pids_read->counts.stopped, Pids_read->counts.zombied));
|
||
Msg_row += 1;
|
||
|
||
cpus_refresh();
|
||
|
||
#ifndef NUMA_DISABLE
|
||
if (!Numa_node_tot) goto numa_nope;
|
||
|
||
if (CHKw(w, View_CPUNOD)) {
|
||
if (Numa_node_sel < 0) {
|
||
numa_oops:
|
||
// display the 1st /proc/stat line, then the nodes (if room)
|
||
summary_hlp(Stat_reap->summary, N_txt(WORD_allcpus_txt));
|
||
Msg_row += 1;
|
||
// display each cpu node's states
|
||
for (i = 0; i < Numa_node_tot; i++) {
|
||
struct stat_stack *nod_ptr = Stat_reap->nodes->stacks[i];
|
||
if (NOD_VAL(stat_ID, s_int, i) == PROCPS_STAT_NODE_INVALID) continue;
|
||
if (!isROOM(anyFLG, 1)) break;
|
||
snprintf(tmp, sizeof(tmp), N_fmt(NUMA_nodenam_fmt), NOD_VAL(stat_ID, s_int, i));
|
||
summary_hlp(nod_ptr, tmp);
|
||
Msg_row += 1;
|
||
}
|
||
} else {
|
||
// display the node summary, then the associated cpus (if room)
|
||
for (i = 0; i < Numa_node_tot; i++)
|
||
if (Numa_node_sel == NOD_VAL(stat_ID, s_int, i)) break;
|
||
if (i == Numa_node_tot) goto numa_oops;
|
||
snprintf(tmp, sizeof(tmp), N_fmt(NUMA_nodenam_fmt), Numa_node_sel);
|
||
summary_hlp(Stat_reap->nodes->stacks[Numa_node_sel], tmp);
|
||
Msg_row += 1;
|
||
for (i = 0; i < Cpu_cnt; i++) {
|
||
if (Numa_node_sel == CPU_VAL(stat_NU, s_int, i)) {
|
||
if (!isROOM(anyFLG, 1)) break;
|
||
snprintf(tmp, sizeof(tmp), N_fmt(WORD_eachcpu_fmt), CPU_VAL(stat_ID, s_int, i));
|
||
summary_hlp(Stat_reap->nodes->stacks[i], tmp);
|
||
Msg_row += 1;
|
||
}
|
||
}
|
||
}
|
||
} else
|
||
numa_nope:
|
||
#endif
|
||
if (CHKw(w, View_CPUSUM)) {
|
||
// display just the 1st /proc/stat line
|
||
summary_hlp(Stat_reap->summary, N_txt(WORD_allcpus_txt));
|
||
Msg_row += 1;
|
||
|
||
} else {
|
||
// display each cpu's states separately, screen height permitting...
|
||
for (i = 0; i < Cpu_cnt; i++) {
|
||
snprintf(tmp, sizeof(tmp), N_fmt(WORD_eachcpu_fmt), CPU_VAL(stat_ID, s_int, i));
|
||
summary_hlp(Stat_reap->cpus->stacks[i], tmp);
|
||
Msg_row += 1;
|
||
if (!isROOM(anyFLG, 1)) break;
|
||
}
|
||
}
|
||
} // end: View_STATES
|
||
|
||
// Display Memory and Swap stats
|
||
if (isROOM(View_MEMORY, 2)) {
|
||
#define bfT(n) buftab[n].buf
|
||
#define scT(e) scaletab[Rc.summ_mscale]. e
|
||
#define mkM(x) (float) x / scT(div)
|
||
#define prT(b,z) { if (9 < snprintf(b, 10, scT(fmts), z)) b[8] = '+'; }
|
||
static struct {
|
||
float div;
|
||
const char *fmts;
|
||
const char *label;
|
||
} scaletab[] = {
|
||
{ 1, "%1.0f ", NULL }, // kibibytes
|
||
{ 1024.0, "%#4.3f ", NULL }, // mebibytes
|
||
{ 1024.0*1024, "%#4.3f ", NULL }, // gibibytes
|
||
{ 1024.0*1024*1024, "%#4.3f ", NULL }, // tebibytes
|
||
{ 1024.0*1024*1024*1024, "%#4.3f ", NULL }, // pebibytes
|
||
{ 1024.0*1024*1024*1024*1024, "%#4.3f ", NULL } // exbibytes
|
||
};
|
||
struct { // 0123456789
|
||
// snprintf contents of each buf (after SK_Kb): 'nnnn.nnn 0'
|
||
// and prT macro might replace space at buf[8] with: ------> +
|
||
char buf[10]; // MEMORY_lines_fmt provides for 8+1 bytes
|
||
} buftab[8];
|
||
|
||
if (!scaletab[0].label) {
|
||
scaletab[0].label = N_txt(AMT_kilobyte_txt);
|
||
scaletab[1].label = N_txt(AMT_megabyte_txt);
|
||
scaletab[2].label = N_txt(AMT_gigabyte_txt);
|
||
scaletab[3].label = N_txt(AMT_terabyte_txt);
|
||
scaletab[4].label = N_txt(AMT_petabyte_txt);
|
||
scaletab[5].label = N_txt(AMT_exxabyte_txt);
|
||
}
|
||
|
||
if (w->rc.graph_mems) {
|
||
static struct {
|
||
const char *used, *misc, *swap, *type;
|
||
} gtab[] = {
|
||
{ "%-.*s~7", "%-.*s~8", "%-.*s~8", Graph_bars },
|
||
{ "%-.*s~4", "%-.*s~6", "%-.*s~6", Graph_blks }
|
||
};
|
||
char used[SMLBUFSIZ], util[SMLBUFSIZ], dual[MEDBUFSIZ];
|
||
int ix = w->rc.graph_mems - 1;
|
||
float pct_used = (float)MEM_VAL(mem_USE) * (100.0 / (float)MEM_VAL(mem_TOT)),
|
||
#ifdef MEMGRAPH_OLD
|
||
pct_misc = (float)(MEM_VAL(mem_BUF) + MEM_VAL(mem_QUE)) * (100.0 / (float)MEM_VAL(mem_TOT)),
|
||
#else
|
||
pct_misc = (float)(MEM_VAL(mem_TOT) - MEM_VAL(mem_AVL) - MEM_VAL(mem_USE)) * (100.0 / (float)MEM_VAL(mem_TOT)),
|
||
#endif
|
||
pct_swap = MEM_VAL(swp_TOT) ? (float)MEM_VAL(swp_USE) * (100.0 / (float)MEM_VAL(swp_TOT)) : 0;
|
||
#ifndef QUICK_GRAPHS
|
||
int num_used = (int)((pct_used * Graph_adj) + .5),
|
||
num_misc = (int)((pct_misc * Graph_adj) + .5);
|
||
if (num_used + num_misc > Graph_len) --num_misc;
|
||
snprintf(used, sizeof(used), gtab[ix].used, num_used, gtab[ix].type);
|
||
snprintf(util, sizeof(util), gtab[ix].misc, num_misc, gtab[ix].type);
|
||
#else
|
||
snprintf(used, sizeof(used), gtab[ix].used, (int)((pct_used * Graph_adj) + .5), gtab[ix].type);
|
||
snprintf(util, sizeof(util), gtab[ix].misc, (int)((pct_misc * Graph_adj) + .4), gtab[ix].type);
|
||
#endif
|
||
snprintf(dual, sizeof(dual), "%s%s", used, util);
|
||
snprintf(util, sizeof(util), gtab[ix].swap, (int)((pct_swap * Graph_adj) + .5), gtab[ix].type);
|
||
prT(bfT(0), mkM(MEM_VAL(mem_TOT))); prT(bfT(1), mkM(MEM_VAL(swp_TOT)));
|
||
show_special(0, fmtmk( "%s %s:~3%#5.1f~2/%-9.9s~3[~1%-*s]~1\n%s %s:~3%#5.1f~2/%-9.9s~3[~1%-*s]~1\n"
|
||
, scT(label), N_txt(WORD_abv_mem_txt), pct_used + pct_misc, bfT(0), Graph_len +4, dual
|
||
, scT(label), N_txt(WORD_abv_swp_txt), pct_swap, bfT(1), Graph_len +2, util));
|
||
} else {
|
||
unsigned long my_misc = MEM_VAL(mem_BUF) + MEM_VAL(mem_QUE);
|
||
prT(bfT(0), mkM(MEM_VAL(mem_TOT))); prT(bfT(1), mkM(MEM_VAL(mem_FRE)));
|
||
prT(bfT(2), mkM(MEM_VAL(mem_USE))); prT(bfT(3), mkM(my_misc));
|
||
prT(bfT(4), mkM(MEM_VAL(swp_TOT))); prT(bfT(5), mkM(MEM_VAL(swp_FRE)));
|
||
prT(bfT(6), mkM(MEM_VAL(swp_USE))); prT(bfT(7), mkM(MEM_VAL(mem_AVL)));
|
||
show_special(0, fmtmk(N_unq(MEMORY_lines_fmt)
|
||
, scT(label), N_txt(WORD_abv_mem_txt), bfT(0), bfT(1), bfT(2), bfT(3)
|
||
, scT(label), N_txt(WORD_abv_swp_txt), bfT(4), bfT(5), bfT(6), bfT(7)
|
||
, N_txt(WORD_abv_mem_txt)));
|
||
}
|
||
Msg_row += 2;
|
||
#undef bfT
|
||
#undef scT
|
||
#undef mkM
|
||
#undef prT
|
||
} // end: View_MEMORY
|
||
|
||
#undef isROOM
|
||
#undef anyFLG
|
||
} // end: summary_show
|
||
|
||
|
||
/*
|
||
* Build the information for a single task row and
|
||
* display the results or return them to the caller. */
|
||
static const char *task_show (const WIN_t *q, struct pids_stack *p) {
|
||
// a tailored 'results stack value' extractor macro
|
||
#define rSv(E,T) PID_VAL(E, T, p)
|
||
#ifndef SCROLLVAR_NO
|
||
#define makeVAR(S) { if (!q->varcolbeg) cp = make_str(S, q->varcolsz, Js, AUTOX_NO); \
|
||
else cp = make_str(q->varcolbeg < (int)strlen(S) ? S + q->varcolbeg : "", q->varcolsz, Js, AUTOX_NO); }
|
||
#else
|
||
#define makeVAR(S) cp = make_str(S, q->varcolsz, Js, AUTOX_NO)
|
||
#endif
|
||
static char rbuf[ROWMINSIZ];
|
||
char *rp;
|
||
int x;
|
||
|
||
// we must begin a row with a possible window number in mind...
|
||
*(rp = rbuf) = '\0';
|
||
if (Rc.mode_altscr) rp = scat(rp, " ");
|
||
|
||
for (x = 0; x < q->maxpflgs; x++) {
|
||
const char *cp;
|
||
FLG_t i = q->procflgs[x];
|
||
#define S Fieldstab[i].scale // these used to be variables
|
||
#define W Fieldstab[i].width // but it's much better if we
|
||
#define Js CHKw(q, Show_JRSTRS) // represent them as #defines
|
||
#define Jn CHKw(q, Show_JRNUMS) // and only exec code if used
|
||
|
||
/* except for the XOF/XON pseudo flags, the following case labels are gouped
|
||
by result type according to capacity (small -> large) and then ordered by
|
||
additional processing requirements (as in plain, scaled, decorated, etc.) */
|
||
|
||
switch (i) {
|
||
#ifndef USE_X_COLHDR
|
||
// these 2 aren't real procflgs, they're used in column highlighting!
|
||
case EU_XOF:
|
||
case EU_XON:
|
||
cp = NULL;
|
||
if (!CHKw(q, INFINDS_xxx | NOHIFND_xxx | NOHISEL_xxx)) {
|
||
/* treat running tasks specially - entire row may get highlighted
|
||
so we needn't turn it on and we MUST NOT turn it off */
|
||
if (!('R' == rSv(EU_STA, s_ch) && CHKw(q, Show_HIROWS)))
|
||
cp = (EU_XON == i ? q->capclr_rowhigh : q->capclr_rownorm);
|
||
}
|
||
break;
|
||
#endif
|
||
/* s_ch, make_chr */
|
||
case EU_STA:
|
||
cp = make_chr(rSv(EU_STA, s_ch), W, Js);
|
||
break;
|
||
/* s_int, make_num without auto width */
|
||
case EU_PGD:
|
||
case EU_PID:
|
||
case EU_PPD:
|
||
case EU_SID:
|
||
case EU_TGD:
|
||
case EU_THD:
|
||
case EU_TPG:
|
||
cp = make_num(rSv(i, s_int), W, Jn, AUTOX_NO, 0);
|
||
break;
|
||
/* s_int, make_num without auto width, but with zero supression */
|
||
case EU_OOA:
|
||
case EU_OOM:
|
||
cp = make_num(rSv(i, s_int), W, Jn, AUTOX_NO, 1);
|
||
break;
|
||
/* s_int, make_num or make_str */
|
||
case EU_PRI:
|
||
if (-99 > rSv(EU_PRI, s_int) || 999 < rSv(EU_PRI, s_int)) {
|
||
cp = make_str("rt", W, Jn, AUTOX_NO);
|
||
} else
|
||
cp = make_num(rSv(EU_PRI, s_int), W, Jn, AUTOX_NO, 0);
|
||
break;
|
||
/* u_int, make_num without auto width */
|
||
case EU_CPN:
|
||
cp = make_num(rSv(i, u_int), W, Jn, AUTOX_NO, 0);
|
||
break;
|
||
/* u_int, make_num with auto width */
|
||
case EU_GID:
|
||
case EU_UED:
|
||
case EU_URD:
|
||
case EU_USD:
|
||
cp = make_num(rSv(i, u_int), W, Jn, i, 0);
|
||
break;
|
||
/* u_int, scale_pcnt with special handling */
|
||
case EU_CPU:
|
||
{ float u = (float)rSv(EU_CPU, sl_int) * Frame_etscale;
|
||
int n = rSv(EU_THD, s_int);
|
||
/* process can't use more %cpu than number of threads it has
|
||
( thanks Jaromir Capik <jcapik@redhat.com> ) */
|
||
if (u > 100.0 * n) u = 100.0 * n;
|
||
if (u > Cpu_pmax) u = Cpu_pmax;
|
||
cp = scale_pcnt(u, W, Jn);
|
||
}
|
||
break;
|
||
/* sl_int, make_num without auto width, but with zero supression */
|
||
case EU_NCE:
|
||
cp = make_num(rSv(EU_NCE, sl_int), W, Jn, AUTOX_NO, 1);
|
||
break;
|
||
/* ul_int, make_num with auto width and zero supression */
|
||
case EU_NS1:
|
||
case EU_NS2:
|
||
case EU_NS3:
|
||
case EU_NS4:
|
||
case EU_NS5:
|
||
case EU_NS6:
|
||
cp = make_num(rSv(i, ul_int), W, Jn, i, 1);
|
||
break;
|
||
/* ul_int, scale_mem */
|
||
case EU_COD:
|
||
case EU_DAT:
|
||
case EU_DRT: // really # pgs & sl_int, but always zero since 2.6
|
||
case EU_RES:
|
||
case EU_RZA:
|
||
case EU_RZF:
|
||
case EU_RZL:
|
||
case EU_RZS:
|
||
case EU_SHR:
|
||
case EU_SWP:
|
||
case EU_USE:
|
||
case EU_VRT:
|
||
cp = scale_mem(S, rSv(i, sl_int), W, Jn);
|
||
break;
|
||
/* ul_int, scale_num */
|
||
case EU_FL1:
|
||
case EU_FL2:
|
||
case EU_FV1:
|
||
case EU_FV2:
|
||
cp = scale_num(rSv(i, sl_int), W, Jn);
|
||
break;
|
||
/* ul_int, scale_pcnt */
|
||
case EU_MEM:
|
||
cp = scale_pcnt((float)rSv(EU_RES, sl_int) * 100 / MEM_VAL(mem_TOT), W, Jn);
|
||
break;
|
||
/* ul_int, make_str with special handling */
|
||
case EU_FLG:
|
||
cp = make_str(hex_make(rSv(EU_FLG, ul_int), 1), W, Js, AUTOX_NO);
|
||
break;
|
||
/* ull_int, scale_tics */
|
||
case EU_TM2:
|
||
case EU_TME:
|
||
{ TIC_t t;
|
||
if (CHKw(q, Show_CTIMES)) t = rSv(eu_TICS_ALL_C, ull_int);
|
||
else t = rSv(i, ull_int);
|
||
cp = scale_tics(t, W, Jn);
|
||
}
|
||
break;
|
||
/* str, make_str (all AUTOX yes) */
|
||
case EU_GRP:
|
||
case EU_LXC:
|
||
case EU_TTY:
|
||
case EU_UEN:
|
||
case EU_URN:
|
||
case EU_USN:
|
||
case EU_WCH:
|
||
cp = make_str(rSv(i, str), W, Js, i);
|
||
break;
|
||
/* str, make_str with varialbe width */
|
||
case EU_CGN:
|
||
case EU_CGR:
|
||
case EU_ENV:
|
||
case EU_SGD:
|
||
case EU_SGN:
|
||
makeVAR(rSv(i, str));
|
||
break;
|
||
/* str, make_str with varialbe width + additional decoration */
|
||
case EU_CMD:
|
||
makeVAR(forest_colour(q, p));
|
||
break;
|
||
default: // keep gcc happy
|
||
continue;
|
||
} // end: switch 'procflag'
|
||
|
||
if (cp) {
|
||
if (q->osel_tot && !osel_matched(q, i, cp)) return "";
|
||
rp = scat(rp, cp);
|
||
}
|
||
#undef S
|
||
#undef W
|
||
#undef Js
|
||
#undef Jn
|
||
} // end: for 'maxpflgs'
|
||
|
||
if (!CHKw(q, INFINDS_xxx)) {
|
||
const char *cap = ((CHKw(q, Show_HIROWS) && 'R' == rSv(EU_STA, s_ch)))
|
||
? q->capclr_rowhigh : q->capclr_rownorm;
|
||
char *row = rbuf;
|
||
int ofs;
|
||
/* since we can't predict what the search string will be and,
|
||
considering what a single space search request would do to
|
||
potential buffer needs, when any matches are found we skip
|
||
normal output routing and send all of the results directly
|
||
to the terminal (and we sound asthmatic: poof, putt, puff) */
|
||
if (-1 < (ofs = find_ofs(q, row))) {
|
||
POOF("\n", cap);
|
||
do {
|
||
row[ofs] = '\0';
|
||
PUTT("%s%s%s%s", row, q->capclr_hdr, q->findstr, cap);
|
||
row += (ofs + q->findlen);
|
||
ofs = find_ofs(q, row);
|
||
} while (-1 < ofs);
|
||
PUTT("%s%s", row, Caps_endline);
|
||
// with a corrupted rbuf, ensure row is 'counted' by window_show
|
||
rbuf[0] = '!';
|
||
} else
|
||
PUFF("\n%s%s%s", cap, row, Caps_endline);
|
||
}
|
||
return rbuf;
|
||
#undef rSv
|
||
#undef makeVAR
|
||
} // end: task_show
|
||
|
||
|
||
static int window_show (WIN_t *q, int wmax) {
|
||
#define sORDER CHKw(q, Qsrt_NORMAL) ? PROCPS_PIDS_DESCEND : PROCPS_PIDS_ASCEND
|
||
/* the isBUSY macro determines if a task is 'active' --
|
||
it returns true if some cpu was used since the last sample.
|
||
( actual 'running' tasks will be a subset of those selected ) */
|
||
#define isBUSY(x) (0 < PID_VAL(EU_CPU, u_int, x))
|
||
#define winMIN(a,b) ((a < b) ? a : b)
|
||
int i, lwin;
|
||
|
||
// Display Column Headings -- and distract 'em while we sort (maybe)
|
||
PUFF("\n%s%s%s", q->capclr_hdr, q->columnhdr, Caps_endline);
|
||
|
||
if (CHKw(q, Show_FOREST))
|
||
forest_begin(q);
|
||
else {
|
||
enum pids_item item = Fieldstab[q->rc.sortindx].item;
|
||
if (item == PROCPS_PIDS_CMD && CHKw(q, Show_CMDLIN))
|
||
item = PROCPS_PIDS_CMDLINE;
|
||
else if (item == PROCPS_PIDS_TICS_ALL && CHKw(q, Show_CTIMES))
|
||
item = PROCPS_PIDS_TICS_ALL_C;
|
||
if (!(procps_pids_sort(Pids_ctx, q->ppt , PIDSmaxt, item, sORDER)))
|
||
error_exit(fmtmk(N_fmt(LIB_errorpid_fmt),__LINE__));
|
||
}
|
||
|
||
i = q->begtask;
|
||
lwin = 1; // 1 for the column header
|
||
wmax = winMIN(wmax, q->winlines + 1); // ditto for winlines, too
|
||
|
||
/* the least likely scenario is also the most costly, so we'll try to avoid
|
||
checking some stuff with each iteration and check it just once... */
|
||
if (CHKw(q, Show_IDLEPS) && !q->usrseltyp)
|
||
while (i < PIDSmaxt && lwin < wmax) {
|
||
if (*task_show(q, q->ppt[i++]))
|
||
++lwin;
|
||
}
|
||
else
|
||
while (i < PIDSmaxt && lwin < wmax) {
|
||
if ((CHKw(q, Show_IDLEPS) || isBUSY(q->ppt[i]))
|
||
&& wins_usrselect(q, q->ppt[i])
|
||
&& *task_show(q, q->ppt[i]))
|
||
++lwin;
|
||
++i;
|
||
}
|
||
|
||
return lwin;
|
||
#undef sORDER
|
||
#undef sFIELD
|
||
#undef winMIN
|
||
#undef isBUSY
|
||
} // end: window_show
|
||
|
||
/*###### Entry point plus two ##########################################*/
|
||
|
||
/*
|
||
* This guy's just a *Helper* function who apportions the
|
||
* remaining amount of screen real estate under multiple windows */
|
||
static void frame_hlp (int wix, int max) {
|
||
int i, size, wins;
|
||
|
||
// calc remaining number of visible windows
|
||
for (i = wix, wins = 0; i < GROUPSMAX; i++)
|
||
if (CHKw(&Winstk[i], Show_TASKON))
|
||
++wins;
|
||
|
||
if (!wins) wins = 1;
|
||
// deduct 1 line/window for the columns heading
|
||
size = (max - wins) / wins;
|
||
|
||
/* for subject window, set WIN_t winlines to either the user's
|
||
maxtask (1st choice) or our 'foxized' size calculation
|
||
(foxized adj. - 'fair and balanced') */
|
||
Winstk[wix].winlines =
|
||
Winstk[wix].rc.maxtasks ? Winstk[wix].rc.maxtasks : size;
|
||
} // end: frame_hlp
|
||
|
||
|
||
/*
|
||
* Initiate the Frame Display Update cycle at someone's whim!
|
||
* This routine doesn't do much, mostly he just calls others.
|
||
*
|
||
* (Whoa, wait a minute, we DO caretake those row guys, plus)
|
||
* (we CALCULATE that IMPORTANT Max_lines thingy so that the)
|
||
* (*subordinate* functions invoked know WHEN the user's had)
|
||
* (ENOUGH already. And at Frame End, it SHOULD be apparent)
|
||
* (WE am d'MAN -- clearing UNUSED screen LINES and ensuring)
|
||
* (that those auto-sized columns are addressed, know what I)
|
||
* (mean? Huh, "doesn't DO MUCH"! Never, EVER think or say)
|
||
* (THAT about THIS function again, Ok? Good that's better.)
|
||
*
|
||
* (ps. we ARE the UNEQUALED justification KING of COMMENTS!)
|
||
* (No, I don't mean significance/relevance, only alignment.)
|
||
*/
|
||
static void frame_make (void) {
|
||
WIN_t *w = Curwin; // avoid gcc bloat with a local copy
|
||
int i, scrlins;
|
||
|
||
// deal with potential signal(s) since the last time around...
|
||
if (Frames_signal)
|
||
zap_fieldstab();
|
||
|
||
// whoa either first time or thread/task mode change, (re)prime the pump...
|
||
if (Pseudo_row == PROC_XTRA) {
|
||
procs_refresh();
|
||
usleep(LIB_USLEEP);
|
||
putp(Cap_clr_scr);
|
||
} else
|
||
putp(Batch ? "\n\n" : Cap_home);
|
||
|
||
sysinfo_refresh(0);
|
||
procs_refresh();
|
||
|
||
Tree_idx = Pseudo_row = Msg_row = scrlins = 0;
|
||
summary_show();
|
||
Max_lines = (Screen_rows - Msg_row) - 1;
|
||
OFFw(w, INFINDS_xxx);
|
||
|
||
/* one way or another, rid us of any prior frame's msg
|
||
[ now that this is positioned after the call to summary_show(), ]
|
||
[ we no longer need or employ tg2(0, Msg_row) since all summary ]
|
||
[ lines end with a newline, and header lines begin with newline ] */
|
||
if (VIZISw(w) && CHKw(w, View_SCROLL)) PUTT(Scroll_fmts, PIDSmaxt);
|
||
else putp(Cap_clr_eol);
|
||
|
||
if (!Rc.mode_altscr) {
|
||
// only 1 window to show so, piece o' cake
|
||
w->winlines = w->rc.maxtasks ? w->rc.maxtasks : Max_lines;
|
||
scrlins = window_show(w, Max_lines);
|
||
} else {
|
||
// maybe NO window is visible but assume, pieces o' cakes
|
||
for (i = 0 ; i < GROUPSMAX; i++) {
|
||
if (CHKw(&Winstk[i], Show_TASKON)) {
|
||
frame_hlp(i, Max_lines - scrlins);
|
||
scrlins += window_show(&Winstk[i], Max_lines - scrlins);
|
||
}
|
||
if (Max_lines <= scrlins) break;
|
||
}
|
||
}
|
||
|
||
/* clear to end-of-screen - critical if last window is 'idleps off'
|
||
(main loop must iterate such that we're always called before sleep) */
|
||
if (scrlins < Max_lines) {
|
||
putp(Cap_nl_clreos);
|
||
PSU_CLREOS(Pseudo_row);
|
||
}
|
||
fflush(stdout);
|
||
|
||
/* we'll deem any terminal not supporting tgoto as dumb and disable
|
||
the normal non-interactive output optimization... */
|
||
if (!Cap_can_goto) PSU_CLREOS(0);
|
||
|
||
/* lastly, check auto-sized width needs for the next iteration */
|
||
if (AUTOX_MODE && Autox_found)
|
||
widths_resize();
|
||
} // end: frame_make
|
||
|
||
|
||
/*
|
||
* duh... */
|
||
int main (int dont_care_argc, char **argv) {
|
||
(void)dont_care_argc;
|
||
before(*argv);
|
||
// +-------------+
|
||
wins_stage_1(); // top (sic) slice
|
||
configs_read(); // > spread etc, <
|
||
parse_args(&argv[1]); // > lean stuff, <
|
||
whack_terminal(); // > onions etc. <
|
||
wins_stage_2(); // as bottom slice
|
||
// +-------------+
|
||
|
||
for (;;) {
|
||
struct timespec ts;
|
||
|
||
frame_make();
|
||
|
||
if (0 < Loops) --Loops;
|
||
if (!Loops) bye_bye(NULL);
|
||
|
||
ts.tv_sec = Rc.delay_time;
|
||
ts.tv_nsec = (Rc.delay_time - (int)Rc.delay_time) * 1000000000;
|
||
|
||
if (Batch)
|
||
pselect(0, NULL, NULL, NULL, &ts, NULL);
|
||
else {
|
||
if (ioa(&ts))
|
||
do_key(iokey(1));
|
||
}
|
||
/* note: that above ioa routine exists to consolidate all logic
|
||
which is susceptible to signal interrupt and must then
|
||
produce a screen refresh. in this main loop frame_make
|
||
assumes responsibility for such refreshes. other logic
|
||
in contact with users must deal more obliquely with an
|
||
interrupt/refresh (hint: Frames_signal + return code)!
|
||
|
||
(everything is perfectly justified plus right margins)
|
||
(are completely filled, but of course it must be luck)
|
||
*/
|
||
}
|
||
return 0;
|
||
} // end: main
|