From 9ba65bad8ef1bb994f3edd45063878daa1beb78c Mon Sep 17 00:00:00 2001 From: Jim Warner Date: Mon, 27 Jul 2015 00:00:00 -0500 Subject: [PATCH] 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 --- top/top.c | 2 +- top/top.h | 10 +++++----- 2 files changed, 6 insertions(+), 6 deletions(-) diff --git a/top/top.c b/top/top.c index f7a65932..3c4f3f2c 100644 --- a/top/top.c +++ b/top/top.c @@ -1915,7 +1915,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))); diff --git a/top/top.h b/top/top.h index 28a1a240..ddf34f13 100644 --- a/top/top.h +++ b/top/top.h @@ -255,11 +255,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