sort doc, and compile w/ gcc 2.95.x
This commit is contained in:
parent
f165d14c56
commit
ae87df8158
22
top.1
22
top.1
@ -821,7 +821,17 @@ simply decrease the size of the \*(TD(s) above it.
|
|||||||
.B SORTING\fR of \*(TW
|
.B SORTING\fR of \*(TW
|
||||||
.br
|
.br
|
||||||
.in +2
|
.in +2
|
||||||
Before using any of these sort provisions, \*(Me suggests that you
|
For compatibility, this \*(Me supports most of the former \*(Me sort keys.
|
||||||
|
Since this is primarily a service to former \*(Me users, these commands do
|
||||||
|
not appear on any help screen.
|
||||||
|
command sorted field supported
|
||||||
|
A start time (non-display) No
|
||||||
|
M %MEM Yes
|
||||||
|
N PID Yes
|
||||||
|
P %CPU Yes
|
||||||
|
T TIME+ Yes
|
||||||
|
|
||||||
|
Before using any of the following sort provisions, \*(Me suggests that you
|
||||||
temporarily turn on column highlighting using the 'x' \*(CI.
|
temporarily turn on column highlighting using the 'x' \*(CI.
|
||||||
That will help ensure that the actual sort environment matches your intent.
|
That will help ensure that the actual sort environment matches your intent.
|
||||||
|
|
||||||
@ -1085,6 +1095,16 @@ Then set the delay interval to around .3 seconds.
|
|||||||
After bringing the most active processes into view, what you'll see are
|
After bringing the most active processes into view, what you'll see are
|
||||||
the ghostly images of just the currently running tasks.
|
the ghostly images of just the currently running tasks.
|
||||||
|
|
||||||
|
.New
|
||||||
|
Delete the existing rcfile, or create a new symlink.
|
||||||
|
Start this new version then type 'T' (a secret key, \*(Xt 3c. TASK Area
|
||||||
|
Commands, Sorting) followed by 'W' and 'Q'.
|
||||||
|
|
||||||
|
Restart the program with -d0 (zero delay) and watch while \*(Me climbs the
|
||||||
|
TIME ladder.
|
||||||
|
Be as patient as you can, while speculating whether or not \*(Me will ever
|
||||||
|
reach the \*(Me.
|
||||||
|
|
||||||
.\" ......................................................................
|
.\" ......................................................................
|
||||||
.SS 6b. Bouncing Windows
|
.SS 6b. Bouncing Windows
|
||||||
For these stupid tricks, \*(Me needs \*(AM.
|
For these stupid tricks, \*(Me needs \*(AM.
|
||||||
|
4
top.c
4
top.c
@ -2380,7 +2380,7 @@ static void task_show (const WIN_t *q, const proc_t *p)
|
|||||||
snprintf(tmp, sizeof(tmp), f, (long)p->flags);
|
snprintf(tmp, sizeof(tmp), f, (long)p->flags);
|
||||||
for (j = 0; tmp[j]; j++) if ('0' == tmp[j]) tmp[j] = '.';
|
for (j = 0; tmp[j]; j++) if ('0' == tmp[j]) tmp[j] = '.';
|
||||||
f = tmp;
|
f = tmp;
|
||||||
MKCOL();
|
MKCOL("");
|
||||||
}
|
}
|
||||||
break;
|
break;
|
||||||
case P_FLT:
|
case P_FLT:
|
||||||
@ -2407,7 +2407,7 @@ static void task_show (const WIN_t *q, const proc_t *p)
|
|||||||
case P_PRI:
|
case P_PRI:
|
||||||
if (-99 > p->priority || 999 < p->priority) {
|
if (-99 > p->priority || 999 < p->priority) {
|
||||||
f = " RT ";
|
f = " RT ";
|
||||||
MKCOL();
|
MKCOL("");
|
||||||
} else
|
} else
|
||||||
MKCOL((int)p->priority);
|
MKCOL((int)p->priority);
|
||||||
break;
|
break;
|
||||||
|
Loading…
Reference in New Issue
Block a user