This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* top.c - Source file: show Linux processes */ | |
/* | |
* Copyright (c) 2002-2014, 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> | |
#ifndef NUMA_DISABLE | |
#include <dlfcn.h> | |
#endif | |
#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/nls.h" | |
#include "../proc/devname.h" | |
#include "../proc/procps.h" | |
#include "../proc/readproc.h" | |
#include "../proc/sig.h" | |
#include "../proc/sysinfo.h" | |
#include "../proc/version.h" | |
#include "../proc/wchan.h" | |
#include "../proc/whattime.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; | |
/* The run-time acquired page stuff */ | |
static unsigned Pg2K_shft = 0; | |
/* SMP, Irix/Solaris mode, Linux 2.5.xx support */ | |
static int Cpu_faux_tot; | |
static float Cpu_pmax; | |
static const char *Cpu_States_fmts; | |
/* Specific process id monitoring support */ | |
static pid_t 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 No_ksyms = -1, // set to '0' if ksym avail, '1' otherwise | |
PSDBopen = 0, // set to '1' if psdb opened (now postponed) | |
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 | |
Thread_mode = 0, // set w/ 'H' - show threads via readeither() | |
Width_mode = 0; // set w/ 'w' - potential output override | |
/* 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 int Frames_libflags; // PROC_FILLxxx flags | |
static int Frame_maxtask; // last known number of active tasks | |
// ie. current 'size' of proc table | |
static float Frame_etscale; // so we can '*' vs. '/' WHEN 'pcpu' | |
static unsigned Frame_running, // state categories for this frame | |
Frame_sleepin, | |
Frame_stopped, | |
Frame_zombied; | |
static int Frame_srtflg, // the subject window's sort direction | |
Frame_ctimes, // the subject window's ctimes flag | |
Frame_cmdlin; // the subject window's cmdlin flag | |
/* Support for 'history' processing so we can calculate %cpu */ | |
static int HHist_siz; // max number of HST_t structs | |
static HST_t *PHist_sav, // alternating 'old/new' HST_t anchors | |
*PHist_new; | |
#ifndef OFF_HST_HASH | |
#define HHASH_SIZ 1024 | |
static int HHash_one [HHASH_SIZ], // actual hash tables ( hereafter known | |
HHash_two [HHASH_SIZ], // as PHash_sav/PHash_new ) | |
HHash_nul [HHASH_SIZ]; // 'empty' hash table image | |
static int *PHash_sav = HHash_one, // alternating 'old/new' hash tables | |
*PHash_new = HHash_two; | |
#endif | |
/* 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, node expansion/targeting and | |
run-time dynamic linking with libnuma.so treated as a plugin */ | |
#ifndef OFF_STDERROR | |
static int Stderr_save = -1; | |
#endif | |
static int Numa_node_tot; | |
static int Numa_node_sel = -1; | |
#ifndef NUMA_DISABLE | |
static void *Libnuma_handle; | |
#if defined(PRETEND_NUMA) || defined(PRETEND8CPUS) | |
static int Numa_max_node(void) { return 3; } | |
#ifndef OFF_NUMASKIP | |
static int Numa_node_of_cpu(int num) { return (1 == (num % 4)) ? 0 : (num % 4); } | |
#else | |
static int Numa_node_of_cpu(int num) { return (num % 4); } | |
#endif | |
#else | |
static int (*Numa_max_node)(void); | |
static int (*Numa_node_of_cpu)(int num); | |
#endif | |
#endif | |
/* 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[] = "||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||"; | |
/*###### Sort callbacks ################################################*/ | |
/* | |
* These happen to be coded in the enum identifier alphabetic order, | |
* not the order of the enum 'pflgs' value. Also note that a callback | |
* routine may serve more than one column. | |
*/ | |
SCB_STRS(CGR, cgroup[0]) | |
SCB_STRV(CMD, Frame_cmdlin, cmdline, cmd) | |
SCB_NUM1(COD, trs) | |
SCB_NUMx(CPN, processor) | |
SCB_NUM1(CPU, pcpu) | |
SCB_NUM1(DAT, drs) | |
SCB_NUM1(DRT, dt) | |
SCB_STRS(ENV, environ[0]) | |
SCB_NUM1(FL1, maj_flt) | |
SCB_NUM1(FL2, min_flt) | |
SCB_NUM1(FLG, flags) | |
SCB_NUM1(FV1, maj_delta) | |
SCB_NUM1(FV2, min_delta) | |
SCB_NUMx(GID, egid) | |
SCB_STRS(GRP, egroup) | |
SCB_NUMx(NCE, nice) | |
SCB_NUM1(NS1, ns[IPCNS]) | |
SCB_NUM1(NS2, ns[MNTNS]) | |
SCB_NUM1(NS3, ns[NETNS]) | |
SCB_NUM1(NS4, ns[PIDNS]) | |
SCB_NUM1(NS5, ns[USERNS]) | |
SCB_NUM1(NS6, ns[UTSNS]) | |
#ifdef OOMEM_ENABLE | |
SCB_NUM1(OOA, oom_adj) | |
SCB_NUM1(OOM, oom_score) | |
#endif | |
SCB_NUMx(PGD, pgrp) | |
SCB_NUMx(PID, tid) | |
SCB_NUMx(PPD, ppid) | |
SCB_NUMx(PRI, priority) | |
SCB_NUM1(RES, resident) // also serves MEM ! | |
SCB_STRX(SGD, supgid) | |
SCB_STRS(SGN, supgrp) | |
SCB_NUM1(SHR, share) | |
SCB_NUM1(SID, session) | |
SCB_NUMx(STA, state) | |
SCB_NUM1(SWP, vm_swap) | |
SCB_NUMx(TGD, tgid) | |
SCB_NUMx(THD, nlwp) | |
// also serves TM2 ! | |
static int SCB_NAME(TME) (const proc_t **P, const proc_t **Q) { | |
if (Frame_ctimes) { | |
if (((*P)->cutime + (*P)->cstime + (*P)->utime + (*P)->stime) | |
< ((*Q)->cutime + (*Q)->cstime + (*Q)->utime + (*Q)->stime)) | |
return SORT_lt; | |
if (((*P)->cutime + (*P)->cstime + (*P)->utime + (*P)->stime) | |
> ((*Q)->cutime + (*Q)->cstime + (*Q)->utime + (*Q)->stime)) | |
return SORT_gt; | |
} else { | |
if (((*P)->utime + (*P)->stime) < ((*Q)->utime + (*Q)->stime)) | |
return SORT_lt; | |
if (((*P)->utime + (*P)->stime) > ((*Q)->utime + (*Q)->stime)) | |
return SORT_gt; | |
} | |
return SORT_eq; | |
} | |
SCB_NUM1(TPG, tpgid) | |
SCB_NUMx(TTY, tty) | |
SCB_NUMx(UED, euid) | |
SCB_STRS(UEN, euser) | |
SCB_NUMx(URD, ruid) | |
SCB_STRS(URN, ruser) | |
SCB_NUMx(USD, suid) | |
SCB_NUM2(USE, resident, vm_swap) | |
SCB_STRS(USN, suser) | |
SCB_NUM1(VRT, size) | |
SCB_NUM1(WCH, wchan) | |
#ifdef OFF_HST_HASH | |
/* special sort for procs_hlp() ! ------------------------ */ | |
static int sort_HST_t (const HST_t *P, const HST_t *Q) { | |
return P->pid - Q->pid; | |
} | |
#endif | |
/*###### 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) NORETURN; | |
static void bye_bye (const char *str) { | |
at_eoj(); // restore tty in preparation for exit | |
#ifdef ATEOJ_RPTSTD | |
{ proc_t *p; | |
if (!str && !Frames_signal && Ttychanged) { fprintf(stderr, | |
"\n%s's Summary report:" | |
"\n\tProgram" | |
"\n\t Linux version = %u.%u.%u, %s" | |
"\n\t Hertz = %u (%u bytes, %u-bit time)" | |
"\n\t page_bytes = %d, Cpu_faux_tot = %d, smp_num_cpus = %d" | |
"\n\t sizeof(CPU_t) = %u, sizeof(HST_t) = %u (%d HST_t's/Page), HHist_siz = %u" | |
"\n\t sizeof(proc_t) = %u, sizeof(proc_t.cmd) = %u, sizeof(proc_t*) = %u" | |
"\n\t Frames_libflags = %08lX" | |
"\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 = %08x, maxpflgs = %d" | |
#endif | |
"\n\t sortindx = %d, fieldscur = %s" | |
"\n\t maxtasks = %d, varcolsz = %d, winlines = %d" | |
"\n\t strlen(columnhdr) = %d" | |
"\n" | |
, __func__ | |
, LINUX_VERSION_MAJOR(linux_version_code) | |
, LINUX_VERSION_MINOR(linux_version_code) | |
, LINUX_VERSION_PATCH(linux_version_code) | |
, procps_version | |
, (unsigned)Hertz, (unsigned)sizeof(Hertz), (unsigned)sizeof(Hertz) * 8 | |
, (int)page_bytes, Cpu_faux_tot, (int)smp_num_cpus, (unsigned)sizeof(CPU_t) | |
, (unsigned)sizeof(HST_t), ((int)page_bytes / (int)sizeof(HST_t)), HHist_siz | |
, (unsigned)sizeof(proc_t), (unsigned)sizeof(p->cmd), (unsigned)sizeof(proc_t*) | |
, (long)Frames_libflags | |
, (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.fieldscur | |
, Curwin->rc.maxtasks, Curwin->varcolsz, Curwin->winlines | |
, (int)strlen(Curwin->columnhdr) | |
); | |
} | |
} | |
#endif // end: ATEOJ_RPTSTD | |
#ifndef OFF_HST_HASH | |
#ifdef ATEOJ_RPTHSH | |
if (!str && !Frames_signal && Ttychanged) { | |
int i, j, pop, total_occupied, maxdepth, maxdepth_sav, numdepth | |
, cross_foot, sz = HHASH_SIZ * (unsigned)sizeof(int); | |
int depths[HHASH_SIZ]; | |
for (i = 0, total_occupied = 0, maxdepth = 0; i < HHASH_SIZ; i++) { | |
int V = PHash_new[i]; | |
j = 0; | |
if (-1 < V) { | |
++total_occupied; | |
while (-1 < V) { | |
V = PHist_new[V].lnk; | |
if (-1 < V) j++; | |
} | |
} | |
depths[i] = j; | |
if (maxdepth < j) maxdepth = j; | |
} | |
maxdepth_sav = maxdepth; | |
fprintf(stderr, | |
"\n%s's Supplementary HASH report:" | |
"\n\tTwo Tables providing for %d entries each + 1 extra for 'empty' image" | |
"\n\t%dk (%d bytes) per table, %d total bytes (including 'empty' image)" | |
"\n\tResults from latest hash (PHash_new + PHist_new)..." | |
"\n" | |
"\n\tTotal hashed = %d" | |
"\n\tLevel-0 hash entries = %d (%d%% occupied)" | |
"\n\tMax Depth = %d" | |
"\n\n" | |
, __func__ | |
, HHASH_SIZ, sz / 1024, sz, sz * 3 | |
, Frame_maxtask | |
, total_occupied, (total_occupied * 100) / HHASH_SIZ | |
, maxdepth + 1); | |
if (total_occupied) { | |
for (pop = total_occupied, cross_foot = 0; maxdepth; maxdepth--) { | |
for (i = 0, numdepth = 0; i < HHASH_SIZ; i++) | |
if (depths[i] == maxdepth) ++numdepth; | |
fprintf(stderr, | |
"\t %5d (%3d%%) hash table entries at depth %d\n" | |
, numdepth, (numdepth * 100) / total_occupied, maxdepth + 1); | |
pop -= numdepth; | |
cross_foot += numdepth; | |
if (0 == pop && cross_foot == total_occupied) break; | |
} | |
if (pop) { | |
fprintf(stderr, "\t %5d (%3d%%) unchained hash table entries\n" | |
, pop, (pop * 100) / total_occupied); | |
cross_foot += pop; | |
} | |
fprintf(stderr, | |
"\t -----\n" | |
"\t %5d total entries occupied\n", cross_foot); | |
if (maxdepth_sav) { | |
fprintf(stderr, "\nPIDs at max depth: "); | |
for (i = 0; i < HHASH_SIZ; i++) | |
if (depths[i] == maxdepth_sav) { | |
j = PHash_new[i]; | |
fprintf(stderr, "\n\tpos %4d: %05d", i, PHist_new[j].pid); | |
while (-1 < j) { | |
j = PHist_new[j].lnk; | |
if (-1 < j) fprintf(stderr, ", %05d", PHist_new[j].pid); | |
} | |
} | |
fprintf(stderr, "\n"); | |
} | |
} | |
} | |
#endif // end: ATEOJ_RPTHSH | |
#endif // end: OFF_HST_HASH | |
#ifndef NUMA_DISABLE | |
if (Libnuma_handle) dlclose(Libnuma_handle); | |
#endif | |
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) 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 | |
/* | |
* Handle library errors ourselves rather than accept a default | |
* fprintf to stderr (since we've mucked with the termios struct) */ | |
static void library_err (const char *fmts, ...) NORETURN; | |
static void library_err (const char *fmts, ...) { | |
static char tmp[MEDBUFSIZ]; | |
va_list va; | |
va_start(va, fmts); | |
vsnprintf(tmp, sizeof(tmp), fmts, va); | |
va_end(va); | |
error_exit(tmp); | |
} // end: library_err | |
/* | |
* 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) 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) MALLOC; | |
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) MALLOC; | |
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) MALLOC; | |
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 vaid '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 (KLONG num, int noz) { | |
static char buf[SMLBUFSIZ]; | |
int i; | |
#ifdef CASEUP_HEXES | |
snprintf(buf, sizeof(buf), "%08" KLF "X", num); | |
#else | |
snprintf(buf, sizeof(buf), "%08" KLF "x", 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 is a matching value or releationship 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; | |
q->usrseltyp = 0; | |
q->usrselflg = 1; | |
Monpidsidx = 0; | |
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 | |
/* | |
* Determine if this proc_t matches the 'u/U' selection criteria | |
* for a given window -- it's called from only one place, and | |
* likely inlined even without the directive */ | |
static inline int user_matched (const WIN_t *q, const proc_t *p) { | |
switch(q->usrseltyp) { | |
case 0: // uid selection inactive | |
return 1; | |
case 'U': // match any uid | |
if (p->ruid == q->usrseluid) return q->usrselflg; | |
if (p->suid == q->usrseluid) return q->usrselflg; | |
if (p->fuid == q->usrseluid) return q->usrselflg; | |
// fall through... | |
case 'u': // match effective uid | |
if (p->euid == q->usrseluid) return q->usrselflg; | |
// fall through... | |
default: // no match... | |
; | |
} | |
return !q->usrselflg; | |
} // end: user_matched | |
/*###### 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) { | |
static char buf[SMLBUFSIZ]; | |
if (width < snprintf(buf, sizeof(buf), "%ld", num)) { | |
buf[width-1] = COLPLUSCH; | |
AUTOX_COL(col); | |
} | |
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, unsigned 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 the Fieldstab.lflg values used here and in calibrate_fields. | |
(own identifiers as documentation and protection against changes) */ | |
#define L_stat PROC_FILLSTAT | |
#define L_statm PROC_FILLMEM | |
#define L_status PROC_FILLSTATUS | |
#define L_CGROUP PROC_EDITCGRPCVT | PROC_FILLCGROUP | |
#define L_CMDLINE PROC_EDITCMDLCVT | PROC_FILLARG | |
#define L_ENVIRON PROC_EDITENVRCVT | PROC_FILLENV | |
#define L_EUSER PROC_FILLUSR | |
#define L_OUSER PROC_FILLSTATUS | PROC_FILLUSR | |
#define L_EGROUP PROC_FILLSTATUS | PROC_FILLGRP | |
#define L_SUPGRP PROC_FILLSTATUS | PROC_FILLSUPGRP | |
#define L_USED PROC_FILLSTATUS | PROC_FILLMEM | |
#define L_NS PROC_FILLNS | |
// make 'none' non-zero (used to be important to Frames_libflags) | |
#define L_NONE PROC_SPARE_1 | |
// from either 'stat' or 'status' (preferred), via bits not otherwise used | |
#define L_EITHER PROC_SPARE_2 | |
// for calibrate_fields and summary_show 1st pass | |
#define L_DEFAULT PROC_FILLSTAT | |
/* These are our gosh darn 'Fields' ! | |
They MUST be kept in sync with pflags !! */ | |
static FLD_t Fieldstab[] = { | |
// a temporary macro, soon to be undef'd... | |
#define SF(f) (QFP_t)SCB_NAME(f) | |
// 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) | |
.lflg anomalies: | |
EU_UED, L_NONE - natural outgrowth of 'stat()' in readproc (euid) | |
EU_CPU, L_stat - never filled by libproc, but requires times (pcpu) | |
EU_CMD, L_stat - may yet require L_CMDLINE in calibrate_fields (cmd/cmdline) | |
L_EITHER - must L_status, else L_stat == 64-bit math (__udivdi3) on 32-bit ! | |
.width .scale .align .sort .lflg | |
------ ------ -------- -------- -------- */ | |
{ 0, -1, A_right, SF(PID), L_NONE }, | |
{ 0, -1, A_right, SF(PPD), L_EITHER }, | |
{ 5, -1, A_right, SF(UED), L_NONE }, | |
{ 8, -1, A_left, SF(UEN), L_EUSER }, | |
{ 5, -1, A_right, SF(URD), L_status }, | |
{ 8, -1, A_left, SF(URN), L_OUSER }, | |
{ 5, -1, A_right, SF(USD), L_status }, | |
{ 8, -1, A_left, SF(USN), L_OUSER }, | |
{ 5, -1, A_right, SF(GID), L_NONE }, | |
{ 8, -1, A_left, SF(GRP), L_EGROUP }, | |
{ 0, -1, A_right, SF(PGD), L_stat }, | |
{ 8, -1, A_left, SF(TTY), L_stat }, | |
{ 0, -1, A_right, SF(TPG), L_stat }, | |
{ 0, -1, A_right, SF(SID), L_stat }, | |
{ 3, -1, A_right, SF(PRI), L_stat }, | |
{ 3, -1, A_right, SF(NCE), L_stat }, | |
{ 3, -1, A_right, SF(THD), L_EITHER }, | |
{ 0, -1, A_right, SF(CPN), L_stat }, | |
{ 0, -1, A_right, SF(CPU), L_stat }, | |
{ 6, -1, A_right, SF(TME), L_stat }, | |
{ 9, -1, A_right, SF(TME), L_stat }, // EU_TM2 slot | |
#ifdef BOOST_PERCNT | |
{ 5, -1, A_right, SF(RES), L_statm }, // EU_MEM slot | |
#else | |
{ 4, -1, A_right, SF(RES), L_statm }, // EU_MEM slot | |
#endif | |
#ifndef NOBOOST_MEMS | |
{ 7, SK_Kb, A_right, SF(VRT), L_statm }, | |
{ 6, SK_Kb, A_right, SF(SWP), L_status }, | |
{ 6, SK_Kb, A_right, SF(RES), L_statm }, | |
{ 6, SK_Kb, A_right, SF(COD), L_statm }, | |
{ 7, SK_Kb, A_right, SF(DAT), L_statm }, | |
{ 6, SK_Kb, A_right, SF(SHR), L_statm }, | |
#else | |
{ 5, SK_Kb, A_right, SF(VRT), L_statm }, | |
{ 4, SK_Kb, A_right, SF(SWP), L_status }, | |
{ 4, SK_Kb, A_right, SF(RES), L_statm }, | |
{ 4, SK_Kb, A_right, SF(COD), L_statm }, | |
{ 5, SK_Kb, A_right, SF(DAT), L_statm }, | |
{ 4, SK_Kb, A_right, SF(SHR), L_statm }, | |
#endif | |
{ 4, -1, A_right, SF(FL1), L_stat }, | |
{ 4, -1, A_right, SF(FL2), L_stat }, | |
{ 4, -1, A_right, SF(DRT), L_statm }, | |
{ 1, -1, A_right, SF(STA), L_EITHER }, | |
{ -1, -1, A_left, SF(CMD), L_EITHER }, | |
{ 10, -1, A_left, SF(WCH), L_stat }, | |
{ 8, -1, A_left, SF(FLG), L_stat }, | |
{ -1, -1, A_left, SF(CGR), L_CGROUP }, | |
{ -1, -1, A_left, SF(SGD), L_status }, | |
{ -1, -1, A_left, SF(SGN), L_SUPGRP }, | |
{ 0, -1, A_right, SF(TGD), L_status }, | |
#ifdef OOMEM_ENABLE | |
#define L_oom PROC_FILLOOM | |
{ 3, -1, A_right, SF(OOA), L_oom }, | |
{ 8, -1, A_right, SF(OOM), L_oom }, | |
#undef L_oom | |
#endif | |
{ -1, -1, A_left, SF(ENV), L_ENVIRON }, | |
{ 3, -1, A_right, SF(FV1), L_stat }, | |
{ 3, -1, A_right, SF(FV2), L_stat }, | |
#ifndef NOBOOST_MEMS | |
{ 6, SK_Kb, A_right, SF(USE), L_USED }, | |
#else | |
{ 4, SK_Kb, A_right, SF(USE), L_USED }, | |
#endif | |
{ 10, -1, A_right, SF(NS1), L_NS }, // IPCNS | |
{ 10, -1, A_right, SF(NS2), L_NS }, // MNTNS | |
{ 10, -1, A_right, SF(NS3), L_NS }, // NETNS | |
{ 10, -1, A_right, SF(NS4), L_NS }, // PIDNS | |
{ 10, -1, A_right, SF(NS5), L_NS }, // USERNS | |
{ 10, -1, A_right, SF(NS6), L_NS } // UTSNS | |
#undef SF | |
#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) { | |
FLG_t f; | |
char *s; | |
WIN_t *w = Curwin; | |
#ifdef EQUCOLHDRYES | |
int x, hdrmax = 0; | |
#endif | |
int i, needpsdb = 0; | |
Frames_libflags = 0; | |
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_WCH == f) needpsdb = 1; | |
if (EU_CMD == f && CHKw(w, Show_CMDLIN)) Frames_libflags |= L_CMDLINE; | |
Frames_libflags |= Fieldstab[w->procflgs[i]].lflg; | |
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 | |
// with forest view mode, we'll need tgid, ppid & start_time... | |
if (CHKw(w, Show_FOREST)) Frames_libflags |= (L_status | L_stat); | |
// for 'busy' only processes, we'll need pcpu (utime & stime)... | |
if (!CHKw(w, Show_IDLEPS)) Frames_libflags |= L_stat; | |
// we must also accommodate an out of view sort field... | |
f = w->rc.sortindx; | |
Frames_libflags |= Fieldstab[f].lflg; | |
if (EU_CMD == f && CHKw(w, Show_CMDLIN)) Frames_libflags |= L_CMDLINE; | |
} // 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 | |
// do we need the kernel symbol table (and is it already open?) | |
if (needpsdb) { | |
if (-1 == No_ksyms) { | |
No_ksyms = 0; | |
if (open_psdb_message(NULL, library_err)) | |
No_ksyms = 1; | |
else | |
PSDBopen = 1; | |
} | |
} | |
// finalize/touchup the libproc PROC_FILLxxx flags for current config... | |
if ((Frames_libflags & L_EITHER) && !(Frames_libflags & L_stat)) | |
Frames_libflags |= L_status; | |
if (!Frames_libflags) Frames_libflags = L_DEFAULT; | |
if (Monpidsidx) Frames_libflags |= PROC_PID; | |
} // 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 | |
} | |
} | |
/* 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 (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 = get_pid_digits())) { | |
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)smp_num_cpus))) { | |
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 && smp_num_cpus > 1 && !Thread_mode) { | |
Cpu_pmax = 100.0 * smp_num_cpus; | |
if (smp_num_cpus > 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 && smp_num_cpus > 1 && !Thread_mode) { | |
Cpu_pmax = 100.0 * smp_num_cpus; | |
if (smp_num_cpus > 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 | |
= 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_NS1 + NUM_NS; 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 = Rc.task_mscale; | |
// lastly, ensure we've got proper column headers... | |
calibrate_fields(); | |
} // end: zap_fieldstab | |
/*###### Library Interface #############################################*/ | |
/* | |
* This guy's modeled on libproc's 'eight_cpu_numbers' function except | |
* we preserve all cpu data in our CPU_t array which is organized | |
* as follows: | |
* cpus[0] thru cpus[n] == tics for each separate cpu | |
* cpus[sumSLOT] == tics from the 1st /proc/stat line | |
* [ and beyond sumSLOT == tics for each cpu NUMA node ] */ | |
static CPU_t *cpus_refresh (CPU_t *cpus) { | |
#define sumSLOT ( smp_num_cpus ) | |
#define totSLOT ( 1 + smp_num_cpus + Numa_node_tot) | |
static FILE *fp = NULL; | |
static int siz, sav_slot = -1; | |
static char *buf; | |
CPU_t *sum_ptr; // avoid gcc subscript bloat | |
int i, num, tot_read; | |
#ifndef NUMA_DISABLE | |
int node; | |
#endif | |
char *bp; | |
/*** hotplug_acclimated ***/ | |
if (sav_slot != sumSLOT) { | |
sav_slot = sumSLOT; | |
zap_fieldstab(); | |
if (fp) { fclose(fp); fp = NULL; } | |
if (cpus) { free(cpus); cpus = NULL; } | |
} | |
/* by opening this file once, we'll avoid the hit on minor page faults | |
(sorry Linux, but you'll have to close it for us) */ | |
if (!fp) { | |
if (!(fp = fopen("/proc/stat", "r"))) | |
error_exit(fmtmk(N_fmt(FAIL_statopn_fmt), strerror(errno))); | |
/* note: we allocate one more CPU_t via totSLOT than 'cpus' so that a | |
slot can hold tics representing the /proc/stat cpu summary */ | |
cpus = alloc_c(totSLOT * sizeof(CPU_t)); | |
} | |
rewind(fp); | |
fflush(fp); | |
#define buffGRW 1024 | |
/* we slurp in the entire directory thus avoiding repeated calls to fgets, | |
especially in a massively parallel environment. additionally, each cpu | |
line is then frozen in time rather than changing until we get around to | |
accessing it. this helps to minimize (not eliminate) most distortions. */ | |
tot_read = 0; | |
if (buf) buf[0] = '\0'; | |
else buf = alloc_c((siz = buffGRW)); | |
while (0 < (num = fread(buf + tot_read, 1, (siz - tot_read), fp))) { | |
tot_read += num; | |
if (tot_read < siz) break; | |
buf = alloc_r(buf, (siz += buffGRW)); | |
}; | |
buf[tot_read] = '\0'; | |
bp = buf; | |
#undef buffGRW | |
// remember from last time around | |
sum_ptr = &cpus[sumSLOT]; | |
memcpy(&sum_ptr->sav, &sum_ptr->cur, sizeof(CT_t)); | |
// then value the last slot with the cpu summary line | |
if (4 > sscanf(bp, "cpu %Lu %Lu %Lu %Lu %Lu %Lu %Lu %Lu" | |
, &sum_ptr->cur.u, &sum_ptr->cur.n, &sum_ptr->cur.s | |
, &sum_ptr->cur.i, &sum_ptr->cur.w, &sum_ptr->cur.x | |
, &sum_ptr->cur.y, &sum_ptr->cur.z)) | |
error_exit(N_txt(FAIL_statget_txt)); | |
#ifndef CPU_ZEROTICS | |
sum_ptr->cur.tot = sum_ptr->cur.u + sum_ptr->cur.s | |
+ sum_ptr->cur.n + sum_ptr->cur.i + sum_ptr->cur.w | |
+ sum_ptr->cur.x + sum_ptr->cur.y + sum_ptr->cur.z; | |
/* if a cpu has registered substantially fewer tics than those expected, | |
we'll force it to be treated as 'idle' so as not to present misleading | |
percentages. */ | |
sum_ptr->edge = | |
((sum_ptr->cur.tot - sum_ptr->sav.tot) / smp_num_cpus) / (100 / TICS_EDGE); | |
#endif | |
#ifndef NUMA_DISABLE | |
// forget all of the prior node statistics (maybe) | |
if (CHKw(Curwin, View_CPUNOD)) | |
memset(sum_ptr + 1, 0, Numa_node_tot * sizeof(CPU_t)); | |
#endif | |
// now value each separate cpu's tics... | |
for (i = 0; i < sumSLOT; i++) { | |
CPU_t *cpu_ptr = &cpus[i]; // avoid gcc subscript bloat | |
#ifdef PRETEND8CPUS | |
bp = buf; | |
#endif | |
bp = 1 + strchr(bp, '\n'); | |
// remember from last time around | |
memcpy(&cpu_ptr->sav, &cpu_ptr->cur, sizeof(CT_t)); | |
if (4 > sscanf(bp, "cpu%d %Lu %Lu %Lu %Lu %Lu %Lu %Lu %Lu", &cpu_ptr->id | |
, &cpu_ptr->cur.u, &cpu_ptr->cur.n, &cpu_ptr->cur.s | |
, &cpu_ptr->cur.i, &cpu_ptr->cur.w, &cpu_ptr->cur.x | |
, &cpu_ptr->cur.y, &cpu_ptr->cur.z)) { | |
memmove(cpu_ptr, sum_ptr, sizeof(CPU_t)); | |
break; // tolerate cpus taken offline | |
} | |
#ifndef CPU_ZEROTICS | |
cpu_ptr->edge = sum_ptr->edge; | |
#endif | |
#ifdef PRETEND8CPUS | |
cpu_ptr->id = i; | |
#endif | |
#ifndef NUMA_DISABLE | |
/* henceforth, with just a little more arithmetic we can avoid | |
maintaining *any* node stats unless they're actually needed */ | |
if (CHKw(Curwin, View_CPUNOD) | |
&& Numa_node_tot | |
&& -1 < (node = Numa_node_of_cpu(cpu_ptr->id))) { | |
// use our own pointer to avoid gcc subscript bloat | |
CPU_t *nod_ptr = sum_ptr + 1 + node; | |
nod_ptr->cur.u += cpu_ptr->cur.u; nod_ptr->sav.u += cpu_ptr->sav.u; | |
nod_ptr->cur.n += cpu_ptr->cur.n; nod_ptr->sav.n += cpu_ptr->sav.n; | |
nod_ptr->cur.s += cpu_ptr->cur.s; nod_ptr->sav.s += cpu_ptr->sav.s; | |
nod_ptr->cur.i += cpu_ptr->cur.i; nod_ptr->sav.i += cpu_ptr->sav.i; | |
nod_ptr->cur.w += cpu_ptr->cur.w; nod_ptr->sav.w += cpu_ptr->sav.w; | |
nod_ptr->cur.x += cpu_ptr->cur.x; nod_ptr->sav.x += cpu_ptr->sav.x; | |
nod_ptr->cur.y += cpu_ptr->cur.y; nod_ptr->sav.y += cpu_ptr->sav.y; | |
nod_ptr->cur.z += cpu_ptr->cur.z; nod_ptr->sav.z += cpu_ptr->sav.z; | |
#ifndef CPU_ZEROTICS | |
/* yep, we re-value this repeatedly for each cpu encountered, but we | |
can then avoid a prior loop to selectively initialize each node */ | |
nod_ptr->edge = sum_ptr->edge; | |
#endif | |
cpu_ptr->node = node; | |
#ifndef OFF_NUMASKIP | |
nod_ptr->id = -1; | |
#endif | |
} | |
#endif | |
} // end: for each cpu | |
Cpu_faux_tot = i; // tolerate cpus taken offline | |
return cpus; | |
#undef sumSLOT | |
#undef totSLOT | |
} // end: cpus_refresh | |
#ifdef OFF_HST_HASH | |
/* | |
* Binary Search for HST_t's put/get support */ | |
static inline HST_t *hstbsrch (HST_t *hst, int max, int pid) { | |
int mid, min = 0; | |
while (min <= max) { | |
mid = (min + max) / 2; | |
if (pid < hst[mid].pid) max = mid - 1; | |
else if (pid > hst[mid].pid) min = mid + 1; | |
else return &hst[mid]; | |
} | |
return NULL; | |
} // end: hstbsrch | |
#else | |
/* | |
* Hashing functions for HST_t's put/get support | |
* (not your normal 'chaining', those damn HST_t's might move!) */ | |
#define _HASH_(K) (K & (HHASH_SIZ - 1)) | |
static inline HST_t *hstget (int pid) { | |
int V = PHash_sav[_HASH_(pid)]; | |
while (-1 < V) { | |
if (PHist_sav[V].pid == pid) return &PHist_sav[V]; | |
V = PHist_sav[V].lnk; } | |
return NULL; | |
} // end: hstget | |
static inline void hstput (unsigned idx) { | |
int V = _HASH_(PHist_new[idx].pid); | |
PHist_new[idx].lnk = PHash_new[V]; | |
PHash_new[V] = idx; | |
} // end: hstput | |
#undef _HASH_ | |
#endif | |
/* | |
* Refresh procs *Helper* function to eliminate yet one more need | |
* to loop through our darn proc_t table. He's responsible for: | |
* 1) calculating the elapsed time since the previous frame | |
* 2) counting the number of tasks in each state (run, sleep, etc) | |
* 3) maintaining the HST_t's and priming the proc_t pcpu field | |
* 4) establishing the total number tasks for this frame */ | |
static void procs_hlp (proc_t *this) { | |
#ifdef OFF_HST_HASH | |
static unsigned maxt_sav = 0; // prior frame's max tasks | |
#endif | |
TIC_t tics; | |
HST_t *h; | |
if (!this) { | |
static double uptime_sav; | |
double uptime_cur; | |
float et; | |
void *v; | |
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 : smp_num_cpus)); | |
#ifdef OFF_HST_HASH | |
maxt_sav = Frame_maxtask; | |
#endif | |
Frame_maxtask = Frame_running = Frame_sleepin = Frame_stopped = Frame_zombied = 0; | |
// prep for saving this frame's HST_t's (and reuse mem each time around) | |
v = PHist_sav; | |
PHist_sav = PHist_new; | |
PHist_new = v; | |
#ifdef OFF_HST_HASH | |
// prep for binary search by sorting the last frame's HST_t's | |
qsort(PHist_sav, maxt_sav, sizeof(HST_t), (QFP_t)sort_HST_t); | |
#else | |
v = PHash_sav; | |
PHash_sav = PHash_new; | |
PHash_new = v; | |
memcpy(PHash_new, HHash_nul, sizeof(HHash_nul)); | |
#endif | |
return; | |
} | |
switch (this->state) { | |
case 'R': | |
Frame_running++; | |
break; | |
case 'S': | |
case 'D': | |
Frame_sleepin++; | |
break; | |
case 'T': | |
Frame_stopped++; | |
break; | |
case 'Z': | |
Frame_zombied++; | |
break; | |
default: // keep gcc happy | |
break; | |
} | |
if (Frame_maxtask+1 >= HHist_siz) { | |
HHist_siz = HHist_siz * 5 / 4 + 100; | |
PHist_sav = alloc_r(PHist_sav, sizeof(HST_t) * HHist_siz); | |
PHist_new = alloc_r(PHist_new, sizeof(HST_t) * HHist_siz); | |
} | |
/* calculate time in this process; the sum of user time (utime) and | |
system time (stime) -- but PLEASE dont waste time and effort on | |
calcs and saves that go unused, like the old top! */ | |
PHist_new[Frame_maxtask].pid = this->tid; | |
PHist_new[Frame_maxtask].tics = tics = (this->utime + this->stime); | |
// finally, save major/minor fault counts in case the deltas are displayable | |
PHist_new[Frame_maxtask].maj = this->maj_flt; | |
PHist_new[Frame_maxtask].min = this->min_flt; | |
#ifdef OFF_HST_HASH | |
// find matching entry from previous frame and make stuff elapsed | |
if ((h = hstbsrch(PHist_sav, maxt_sav - 1, this->tid))) { | |
tics -= h->tics; | |
this->maj_delta = this->maj_flt - h->maj; | |
this->min_delta = this->min_flt - h->min; | |
} | |
#else | |
// hash & save for the next frame | |
hstput(Frame_maxtask); | |
// find matching entry from previous frame and make stuff elapsed | |
if ((h = hstget(this->tid))) { | |
tics -= h->tics; | |
this->maj_delta = this->maj_flt - h->maj; | |
this->min_delta = this->min_flt - h->min; | |
} | |
#endif | |
/* we're just saving elapsed tics, to be converted into %cpu if | |
this task wins it's displayable screen row lottery... */ | |
this->pcpu = tics; | |
// shout this to the world with the final call (or us the next time in) | |
Frame_maxtask++; | |
} // end: procs_hlp | |
/* | |
* This guy's modeled on libproc's 'readproctab' function except | |
* we reuse and extend any prior proc_t's. He's been customized | |
* for our specific needs and to avoid the use of <stdarg.h> */ | |
static void procs_refresh (void) { | |
#define n_used Frame_maxtask // maintained by procs_hlp() | |
static proc_t **private_ppt; // our base proc_t ptr table | |
static int n_alloc = 0; // size of our private_ppt | |
static int n_saved = 0; // last window ppt size | |
proc_t *ptask; | |
PROCTAB* PT; | |
int i; | |
proc_t*(*read_something)(PROCTAB*, proc_t*); | |
procs_hlp(NULL); // prep for a new frame | |
if (NULL == (PT = openproc(Frames_libflags, Monpids))) | |
error_exit(fmtmk(N_fmt(FAIL_openlib_fmt), strerror(errno))); | |
read_something = Thread_mode ? readeither : readproc; | |
for (;;) { | |
if (n_used == n_alloc) { | |
n_alloc = 10 + ((n_alloc * 5) / 4); // grow by over 25% | |
private_ppt = alloc_r(private_ppt, sizeof(proc_t*) * n_alloc); | |
// ensure NULL pointers for the additional memory just acquired | |
memset(private_ppt + n_used, 0, sizeof(proc_t*) * (n_alloc - n_used)); | |
} | |
// on the way to n_alloc, the library will allocate the underlying | |
// proc_t storage whenever our private_ppt[] pointer is NULL... | |
if (!(ptask = read_something(PT, private_ppt[n_used]))) break; | |
procs_hlp((private_ppt[n_used] = ptask)); // tally this proc_t | |
} | |
closeproc(PT); | |
// lastly, refresh each window's proc pointers table... | |
if (n_saved == n_alloc) | |
for (i = 0; i < GROUPSMAX; i++) | |
memcpy(Winstk[i].ppt, private_ppt, sizeof(proc_t*) * n_used); | |
else { | |
n_saved = n_alloc; | |
for (i = 0; i < GROUPSMAX; i++) { | |
Winstk[i].ppt = alloc_r(Winstk[i].ppt, sizeof(proc_t*) * n_alloc); | |
memcpy(Winstk[i].ppt, private_ppt, sizeof(proc_t*) * n_used); | |
} | |
} | |
#undef n_used | |
} // 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; | |
time(&cur_secs); | |
/*** hotplug_acclimated ***/ | |
if (3 <= cur_secs - mem_secs) { | |
meminfo(); | |
mem_secs = cur_secs; | |
} | |
#ifndef PRETEND8CPUS | |
/*** hotplug_acclimated ***/ | |
if (60 <= cur_secs - cpu_secs) { | |
cpuinfo(); | |
Cpu_faux_tot = smp_num_cpus; | |
cpu_secs = cur_secs; | |
#ifndef NUMA_DISABLE | |
if (Libnuma_handle) | |
Numa_node_tot = Numa_max_node() + 1; | |
#endif | |
} | |
#endif | |
} // 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; | |
capNO; | |
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 (proc_t *obj) { | |
#ifdef INSP_SLIDE_1 | |
#define hzAMT 1 | |
#else | |
#define hzAMT 8 | |
#endif | |
#define maxLN (Screen_rows - (Msg_row +1)) | |
#define makHD(b1,b2,b3) { \ | |
snprintf(b1, sizeof(b1), "%s", make_num(obj->tid, 5, 1, AUTOX_NO)); \ | |
snprintf(b2, sizeof(b2), "%s", make_str(obj->cmd, 8, 1, AUTOX_NO)); \ | |
snprintf(b3, sizeof(b3), "%s", make_str(obj->euser, 8, 1, AUTOX_NO)); } | |
#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[9], usr[9]; | |
if (curcol < 0) curcol = 0; | |
if (curlin >= Insp_nl) curlin = Insp_nl -1; | |
if (curlin < 0) curlin = 0; | |
makFS(buf) | |
makHD(pid,cmd,usr) | |
putp(Cap_home); | |
show_special(1, fmtmk(N_unq(INSP_hdrview_fmt) | |
, pid, cmd, usr, (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; | |
proc_t *p; | |
for (i = 0, p = NULL; i < Frame_maxtask; i++) | |
if (pid == Curwin->ppt[i]->tid) { | |
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(INSP_hdrsels_fmt) | |
, pid, p->cmd, p->euser, 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) { | |
struct sigaction sa; | |
proc_t p; | |
int i; | |
atexit(close_stdout); | |
// is /proc mounted? | |
look_up_our_self(&p); | |
// setup our program name | |
Myname = strrchr(me, '/'); | |
if (Myname) ++Myname; else Myname = me; | |
// accommodate nls/gettext potential translations | |
initialize_nls(); | |
// establish cpu particulars | |
#ifdef PRETEND8CPUS | |
smp_num_cpus = 8; | |
#endif | |
Cpu_faux_tot = smp_num_cpus; | |
Cpu_States_fmts = N_unq(STATE_lin2x4_fmt); | |
if (linux_version_code > LINUX_VERSION(2, 5, 41)) | |
Cpu_States_fmts = N_unq(STATE_lin2x5_fmt); | |
if (linux_version_code >= LINUX_VERSION(2, 6, 0)) | |
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 virtual page stuff | |
i = page_bytes; // from sysinfo.c, at lib init | |
while(i > 1024) { i >>= 1; Pg2K_shft++; } | |
#ifndef OFF_HST_HASH | |
// prep for HST_t's put/get hashing optimizations | |
for (i = 0; i < HHASH_SIZ; i++) HHash_nul[i] = -1; | |
memcpy(HHash_one, HHash_nul, sizeof(HHash_nul)); | |
memcpy(HHash_two, HHash_nul, sizeof(HHash_nul)); | |
#endif | |
#ifndef NUMA_DISABLE | |
#if defined(PRETEND_NUMA) || defined(PRETEND8CPUS) | |
Numa_node_tot = Numa_max_node() + 1; | |
#else | |
// we'll try for the most recent version, then a version we know works... | |
if ((Libnuma_handle = dlopen("libnuma.so", RTLD_LAZY)) | |
|| (Libnuma_handle = dlopen("libnuma.so.1", RTLD_LAZY))) { | |
Numa_max_node = dlsym(Libnuma_handle, "numa_max_node"); | |
Numa_node_of_cpu = dlsym(Libnuma_handle, "numa_node_of_cpu"); | |
if (Numa_max_node && Numa_node_of_cpu) | |
Numa_node_tot = Numa_max_node() + 1; | |
else { | |
dlclose(Libnuma_handle); | |
Libnuma_handle = NULL; | |
} | |
} | |
#endif | |
#endif | |
#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; | |
#ifdef OOMEM_ENABLE | |
char fields_dst[PFLAGSSIZ], *p1, *p2; | |
#else | |
char fields_dst[PFLAGSSIZ]; | |
#endif | |
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); | |
#ifdef OOMEM_ENABLE | |
/* 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 = '|'; | |
#endif | |
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]); | |
} | |
#ifdef OOMEM_ENABLE | |
// 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]); | |