top: miscellaneous accumulated tweaks to code/comments
Jeeze, to correct spelling on one single word (incure) you had to go and align the entire comments paragraph? [ well, at least there's one other minor code change ] Signed-off-by: Jim Warner <james.warner@comcast.net>
This commit is contained in:
parent
cca63f2f66
commit
479845d4f0
@ -1942,7 +1942,7 @@ static void build_headers (void) {
|
||||
if (EU_MAXPFLGS <= f) continue;
|
||||
#endif
|
||||
if (EU_CMD == f && CHKw(w, Show_CMDLIN)) Frames_libflags |= L_CMDLINE;
|
||||
Frames_libflags |= Fieldstab[w->procflgs[i]].lflg;
|
||||
Frames_libflags |= Fieldstab[f].lflg;
|
||||
s = scat(s, justify_pad(N_col(f)
|
||||
, VARcol(f) ? w->varcolsz : Fieldstab[f].width
|
||||
, CHKw(w, Fieldstab[f].align)));
|
||||
|
10
top/top.h
10
top/top.h
@ -243,11 +243,11 @@ typedef struct HST_t {
|
||||
int pid; // record 'key'
|
||||
} HST_t;
|
||||
#else
|
||||
/* This structure supports 'history' processing and records the
|
||||
bare minimum of needed information from one frame to the next --
|
||||
we don't calc and save data that goes unused like the old top nor
|
||||
do we incure the overhead of sorting to support a binary search
|
||||
(or worse, a friggin' for loop) when retrieval is necessary! */
|
||||
/* This structure supports 'history' processing and records the bare
|
||||
minimum of needed information from one frame to the next -- we do
|
||||
not calc and save data that goes unused like the old top nor will
|
||||
we incur the additional overhead of sort to support binary search
|
||||
(or worse, a friggin' for loop) when retrievals become necessary! */
|
||||
typedef struct HST_t {
|
||||
TIC_t tics; // last frame's tics count
|
||||
unsigned long maj, min; // last frame's maj/min_flt counts
|
||||
|
Loading…
Reference in New Issue
Block a user