top: additional tweaks for two abreast summary display
This patch just supplements the previous series with a few minor tweaks representing some diverse objectives: . a recent date for man page (which i always overlook) . improved length calculations to maximize graph width . a proper response to platforms with less than 8 cpus . more consistency and readability with one blank line Signed-off-by: Jim Warner <james.warner@comcast.net>
This commit is contained in:
parent
fd529e9679
commit
3543172d4b
@ -59,7 +59,7 @@ memory statistics and data for other users requires root privileges
|
|||||||
.
|
.
|
||||||
.\" Document /////////////////////////////////////////////////////////////
|
.\" Document /////////////////////////////////////////////////////////////
|
||||||
.\" ----------------------------------------------------------------------
|
.\" ----------------------------------------------------------------------
|
||||||
.TH TOP 1 "June 2022" "procps-ng" "User Commands"
|
.TH TOP 1 "September 2022" "procps-ng" "User Commands"
|
||||||
.\" ----------------------------------------------------------------------
|
.\" ----------------------------------------------------------------------
|
||||||
.nh
|
.nh
|
||||||
|
|
||||||
|
@ -247,7 +247,7 @@ static const char Osel_filterI_fmt[] = "\ttype=%d,\t" OSEL_FILTER "%*s\n";
|
|||||||
static char Adjoin_sp[] = " ";
|
static char Adjoin_sp[] = " ";
|
||||||
#define ADJOIN_space (sizeof(Adjoin_sp) - 1) // 1 for null
|
#define ADJOIN_space (sizeof(Adjoin_sp) - 1) // 1 for null
|
||||||
#else
|
#else
|
||||||
static char Adjoin_sp[] = " ~1 ~6 ";
|
static char Adjoin_sp[] = " ~6 ~1";
|
||||||
#define ADJOIN_space (sizeof(Adjoin_sp) - 5) // 1 for null + 4 unprintable
|
#define ADJOIN_space (sizeof(Adjoin_sp) - 5) // 1 for null + 4 unprintable
|
||||||
#endif
|
#endif
|
||||||
#define ADJOIN_limit 8
|
#define ADJOIN_limit 8
|
||||||
@ -2074,7 +2074,6 @@ static void adj_geometry (void) {
|
|||||||
int num = (Curwin->rc.double_up + 1);
|
int num = (Curwin->rc.double_up + 1);
|
||||||
int pfx = (Curwin->rc.double_up < 2) ? GRAPH_prefix_std : GRAPH_prefix_abv;
|
int pfx = (Curwin->rc.double_up < 2) ? GRAPH_prefix_std : GRAPH_prefix_abv;
|
||||||
Graph_len = (Screen_cols - (ADJOIN_space * Curwin->rc.double_up) - (num * (pfx + GRAPH_suffix))) / num;
|
Graph_len = (Screen_cols - (ADJOIN_space * Curwin->rc.double_up) - (num * (pfx + GRAPH_suffix))) / num;
|
||||||
Graph_len += (Screen_cols % num) ? 0 : 1;
|
|
||||||
} else {
|
} else {
|
||||||
Graph_len = Screen_cols - (GRAPH_prefix_std + GRAPH_length_max + GRAPH_suffix);
|
Graph_len = Screen_cols - (GRAPH_prefix_std + GRAPH_length_max + GRAPH_suffix);
|
||||||
if (Graph_len >= 0) Graph_len = GRAPH_length_max;
|
if (Graph_len >= 0) Graph_len = GRAPH_length_max;
|
||||||
@ -5708,7 +5707,9 @@ static void keys_summary (int ch) {
|
|||||||
break;
|
break;
|
||||||
case '4':
|
case '4':
|
||||||
w->rc.double_up += 1;
|
w->rc.double_up += 1;
|
||||||
if (w->rc.double_up >= ADJOIN_limit) w->rc.double_up = 0;
|
if ((w->rc.double_up >= ADJOIN_limit)
|
||||||
|
|| ((w->rc.double_up >= Cpu_cnt)))
|
||||||
|
w->rc.double_up = 0;
|
||||||
OFFw(w, (View_CPUSUM | View_CPUNOD));
|
OFFw(w, (View_CPUSUM | View_CPUNOD));
|
||||||
break;
|
break;
|
||||||
case 'C':
|
case 'C':
|
||||||
@ -6444,6 +6445,7 @@ static void do_memory (void) {
|
|||||||
, rx->graph);
|
, rx->graph);
|
||||||
}
|
}
|
||||||
Msg_row += sum_see(row, mem2UP);
|
Msg_row += sum_see(row, mem2UP);
|
||||||
|
|
||||||
rx = sum_rx(MEM_VAL(swp_TOT), 0, MEM_VAL(swp_USE), Curwin->rc.graph_mems);
|
rx = sum_rx(MEM_VAL(swp_TOT), 0, MEM_VAL(swp_USE), Curwin->rc.graph_mems);
|
||||||
if (Curwin->rc.double_up > 1)
|
if (Curwin->rc.double_up > 1)
|
||||||
snprintf(row, sizeof(row), "%s %s~3%3.0f%s"
|
snprintf(row, sizeof(row), "%s %s~3%3.0f%s"
|
||||||
|
Loading…
Reference in New Issue
Block a user