2 * top - a top users display for Unix
4 * SYNOPSIS: For DragonFly 2.x and later
7 * Originally written for BSD4.4 system by Christos Zoulas.
8 * Ported to FreeBSD 2.x by Steven Wallace && Wolfram Schneider
9 * Order support hacked in from top-3.5beta6/machine/m_aix41.c
10 * by Monte Mitzelfelt (for latest top see http://www.groupsys.com/topinfo/)
12 * This is the machine-dependent module for DragonFly 2.5.1
14 * DragonFly 2.x and above
18 * AUTHOR: Jan Lentfer <Jan.Lentfer@web.de>
19 * This module has been put together from different sources and is based on the
20 * work of many other people, e.g. Matthew Dillon, Simon Schubert, Jordan Gordeev.
22 * $FreeBSD: src/usr.bin/top/machine.c,v 1.29.2.2 2001/07/31 20:27:05 tmm Exp $
26 #include <sys/types.h>
28 #include <sys/signal.h>
29 #include <sys/param.h>
38 #include <sys/errno.h>
39 #include <sys/sysctl.h>
41 #include <sys/vmmeter.h>
42 #include <sys/resource.h>
43 #include <sys/rtprio.h>
49 #include <osreldate.h> /* for changes in kernel structures */
51 #include <sys/kinfo.h>
59 int swapmode(int *retavail
, int *retfree
);
60 static int namelength
;
62 static int show_fullcmd
;
66 /* get_process_info passes back a handle. This is what it looks like: */
69 struct kinfo_proc
**next_proc
; /* points to next valid proc pointer */
70 int remaining
; /* number of pointers remaining */
73 /* declarations for load_avg */
76 #define PP(pp, field) ((pp)->kp_ ## field)
77 #define LP(pp, field) ((pp)->kp_lwp.kl_ ## field)
78 #define VP(pp, field) ((pp)->kp_vm_ ## field)
80 /* what we consider to be process size: */
81 #define PROCSIZE(pp) (VP((pp), map_size) / 1024)
84 * These definitions control the format of the per-process area
87 static char smp_header
[] =
88 " PID %-*.*s NICE SIZE RES STATE CPU TIME CTIME CPU COMMAND";
90 #define smp_Proc_format \
91 "%6d %-*.*s %3d%7s %6s %8.8s %2d %6s %7s %5.2f%% %.*s"
93 /* process state names for the "STATE" column of the display */
95 * the extra nulls in the string "run" are for adding a slash and the
96 * processor number when needed
99 const char *state_abbrev
[] = {
100 "", "RUN\0\0\0", "STOP", "SLEEP",
106 /* values that we stash away in _init and use in later routines */
110 /* these are for calculating cpu state percentages */
112 static struct kinfo_cputime
*cp_time
, *cp_old
;
114 /* these are for detailing the process states */
118 int process_states
[MAXPSTATES
];
120 char *procstatenames
[] = {
121 " running, ", " idle, ", " active, ", " stopped, ", " zombie, ",
125 /* these are for detailing the cpu states */
129 char *cpustatenames
[CPU_STATES
+ 1] = {
130 "user", "nice", "system", "interrupt", "idle", NULL
133 /* these are for detailing the memory statistics */
135 long memory_stats
[7];
136 char *memorynames
[] = {
137 "K Active, ", "K Inact, ", "K Wired, ", "K Cache, ", "K Buf, ", "K Free",
142 char *swapnames
[] = {
144 "K Total, ", "K Used, ", "K Free, ", "% Inuse, ", "K In, ", "K Out",
149 /* these are for keeping track of the proc array */
152 static int onproc
= -1;
154 static struct kinfo_proc
*pbase
;
155 static struct kinfo_proc
**pref
;
157 /* these are for getting the memory statistics */
159 static int pageshift
; /* log base 2 of the pagesize */
161 /* define pagetok in terms of pageshift */
163 #define pagetok(size) ((size) << pageshift)
165 /* sorting orders. first is default */
166 char *ordernames
[] = {
167 "cpu", "size", "res", "time", "pri", "thr", "pid", "ctime", "pres", NULL
170 /* compare routines */
171 int proc_compare (struct kinfo_proc
**, struct kinfo_proc
**);
172 int compare_size (struct kinfo_proc
**, struct kinfo_proc
**);
173 int compare_res (struct kinfo_proc
**, struct kinfo_proc
**);
174 int compare_time (struct kinfo_proc
**, struct kinfo_proc
**);
175 int compare_ctime (struct kinfo_proc
**, struct kinfo_proc
**);
176 int compare_prio(struct kinfo_proc
**, struct kinfo_proc
**);
177 int compare_thr (struct kinfo_proc
**, struct kinfo_proc
**);
178 int compare_pid (struct kinfo_proc
**, struct kinfo_proc
**);
179 int compare_pres(struct kinfo_proc
**, struct kinfo_proc
**);
181 int (*proc_compares
[]) (struct kinfo_proc
**,struct kinfo_proc
**) = {
195 cputime_percentages(int out
[CPU_STATES
], struct kinfo_cputime
*new,
196 struct kinfo_cputime
*old
)
198 struct kinfo_cputime diffs
;
199 uint64_t total_change
, half_total
;
204 diffs
.cp_user
= new->cp_user
- old
->cp_user
;
205 diffs
.cp_nice
= new->cp_nice
- old
->cp_nice
;
206 diffs
.cp_sys
= new->cp_sys
- old
->cp_sys
;
207 diffs
.cp_intr
= new->cp_intr
- old
->cp_intr
;
208 diffs
.cp_idle
= new->cp_idle
- old
->cp_idle
;
209 total_change
= diffs
.cp_user
+ diffs
.cp_nice
+ diffs
.cp_sys
+
210 diffs
.cp_intr
+ diffs
.cp_idle
;
211 old
->cp_user
= new->cp_user
;
212 old
->cp_nice
= new->cp_nice
;
213 old
->cp_sys
= new->cp_sys
;
214 old
->cp_intr
= new->cp_intr
;
215 old
->cp_idle
= new->cp_idle
;
217 /* avoid divide by zero potential */
218 if (total_change
== 0)
221 /* calculate percentages based on overall change, rounding up */
222 half_total
= total_change
>> 1;
224 out
[0] = ((diffs
.cp_user
* 1000LL + half_total
) / total_change
);
225 out
[1] = ((diffs
.cp_nice
* 1000LL + half_total
) / total_change
);
226 out
[2] = ((diffs
.cp_sys
* 1000LL + half_total
) / total_change
);
227 out
[3] = ((diffs
.cp_intr
* 1000LL + half_total
) / total_change
);
228 out
[4] = ((diffs
.cp_idle
* 1000LL + half_total
) / total_change
);
232 machine_init(struct statics
*statics
)
237 struct timeval boottime
;
240 if (kinfo_get_cpus(&n_cpus
))
241 err(1, "kinfo_get_cpus failed");
244 modelen
= sizeof(boottime
);
245 if (sysctlbyname("kern.boottime", &boottime
, &modelen
, NULL
, 0) == -1) {
246 /* we have no boottime to report */
247 boottime
.tv_sec
= -1;
250 while ((pw
= getpwent()) != NULL
) {
251 if ((int)strlen(pw
->pw_name
) > namelength
)
252 namelength
= strlen(pw
->pw_name
);
259 if ((kd
= kvm_open(NULL
, NULL
, NULL
, O_RDONLY
, NULL
)) == NULL
)
267 * get the page size with "getpagesize" and calculate pageshift from
270 pagesize
= getpagesize();
272 while (pagesize
> 1) {
277 /* we only need the amount of log(2)1024 for our conversion */
278 pageshift
-= LOG1024
;
280 /* fill in the statics information */
281 statics
->procstate_names
= procstatenames
;
282 statics
->cpustate_names
= cpustatenames
;
283 statics
->memory_names
= memorynames
;
284 statics
->boottime
= boottime
.tv_sec
;
285 statics
->swap_names
= swapnames
;
286 statics
->order_names
= ordernames
;
287 /* we need kvm descriptor in order to show full commands */
288 statics
->flags
.fullcmds
= kd
!= NULL
;
289 statics
->flags
.threads
= 1;
296 format_header(char *uname_field
)
298 static char Header
[128];
300 snprintf(Header
, sizeof(Header
), smp_header
,
301 namelength
, namelength
, uname_field
);
303 if (screen_width
<= 79)
306 cmdlength
= screen_width
;
308 cmdlength
= cmdlength
- strlen(Header
) + 6;
313 static int swappgsin
= -1;
314 static int swappgsout
= -1;
315 extern struct timeval timeout
;
318 get_system_info(struct system_info
*si
)
323 if (cpu_states
== NULL
) {
324 cpu_states
= malloc(sizeof(*cpu_states
) * CPU_STATES
* n_cpus
);
325 if (cpu_states
== NULL
)
327 bzero(cpu_states
, sizeof(*cpu_states
) * CPU_STATES
* n_cpus
);
329 if (cp_time
== NULL
) {
330 cp_time
= malloc(2 * n_cpus
* sizeof(cp_time
[0]));
333 cp_old
= cp_time
+ n_cpus
;
334 len
= n_cpus
* sizeof(cp_old
[0]);
336 if (sysctlbyname("kern.cputime", cp_old
, &len
, NULL
, 0))
337 err(1, "kern.cputime");
339 len
= n_cpus
* sizeof(cp_time
[0]);
341 if (sysctlbyname("kern.cputime", cp_time
, &len
, NULL
, 0))
342 err(1, "kern.cputime");
344 getloadavg(si
->load_avg
, 3);
348 /* convert cp_time counts to percentages */
349 int combine_cpus
= (enable_ncpus
== 0 && n_cpus
> 1);
350 for (cpu
= 0; cpu
< n_cpus
; ++cpu
) {
351 cputime_percentages(cpu_states
+ cpu
* CPU_STATES
,
352 &cp_time
[cpu
], &cp_old
[cpu
]);
355 if (cpu_averages
== NULL
) {
356 cpu_averages
= malloc(sizeof(*cpu_averages
) * CPU_STATES
);
357 if (cpu_averages
== NULL
)
358 err(1, "cpu_averages");
360 bzero(cpu_averages
, sizeof(*cpu_averages
) * CPU_STATES
);
361 for (cpu
= 0; cpu
< n_cpus
; ++cpu
) {
363 cpu_averages
[0] += *(cpu_states
+ ((cpu
* CPU_STATES
) + j
++) );
364 cpu_averages
[1] += *(cpu_states
+ ((cpu
* CPU_STATES
) + j
++) );
365 cpu_averages
[2] += *(cpu_states
+ ((cpu
* CPU_STATES
) + j
++) );
366 cpu_averages
[3] += *(cpu_states
+ ((cpu
* CPU_STATES
) + j
++) );
367 cpu_averages
[4] += *(cpu_states
+ ((cpu
* CPU_STATES
) + j
++) );
369 for (int i
= 0; i
< CPU_STATES
; ++i
)
370 cpu_averages
[i
] /= n_cpus
;
373 /* sum memory & swap statistics */
377 size_t vms_size
= sizeof(vms
);
378 size_t vmm_size
= sizeof(vmm
);
379 static unsigned int swap_delay
= 0;
380 static int swapavail
= 0;
381 static int swapfree
= 0;
382 static long bufspace
= 0;
384 if (sysctlbyname("vm.vmstats", &vms
, &vms_size
, NULL
, 0))
385 err(1, "sysctlbyname: vm.vmstats");
387 if (sysctlbyname("vm.vmmeter", &vmm
, &vmm_size
, NULL
, 0))
388 err(1, "sysctlbyname: vm.vmmeter");
390 if (kinfo_get_vfs_bufspace(&bufspace
))
391 err(1, "kinfo_get_vfs_bufspace");
393 /* convert memory stats to Kbytes */
394 memory_stats
[0] = pagetok(vms
.v_active_count
);
395 memory_stats
[1] = pagetok(vms
.v_inactive_count
);
396 memory_stats
[2] = pagetok(vms
.v_wire_count
);
397 memory_stats
[3] = pagetok(vms
.v_cache_count
);
398 memory_stats
[4] = bufspace
/ 1024;
399 memory_stats
[5] = pagetok(vms
.v_free_count
);
400 memory_stats
[6] = -1;
407 /* compute differences between old and new swap statistic */
409 swap_stats
[4] = pagetok(((vmm
.v_swappgsin
- swappgsin
)));
410 swap_stats
[5] = pagetok(((vmm
.v_swappgsout
- swappgsout
)));
413 swappgsin
= vmm
.v_swappgsin
;
414 swappgsout
= vmm
.v_swappgsout
;
416 /* call CPU heavy swapmode() only for changes */
417 if (swap_stats
[4] > 0 || swap_stats
[5] > 0 || swap_delay
== 0) {
418 swap_stats
[3] = swapmode(&swapavail
, &swapfree
);
419 swap_stats
[0] = swapavail
;
420 swap_stats
[1] = swapavail
- swapfree
;
421 swap_stats
[2] = swapfree
;
427 /* set arrays and strings */
428 si
->cpustates
= combine_cpus
== 1 ?
429 cpu_averages
: cpu_states
;
430 si
->memory
= memory_stats
;
431 si
->swap
= swap_stats
;
435 si
->last_pid
= lastpid
;
442 static struct handle handle
;
445 get_process_info(struct system_info
*si
, struct process_select
*sel
,
451 struct kinfo_proc
**prefp
;
452 struct kinfo_proc
*pp
;
454 /* these are copied out of sel for speed */
460 show_threads
= sel
->threads
;
463 pbase
= kvm_getprocs(kd
,
464 KERN_PROC_ALL
| (show_threads
? KERN_PROC_FLAG_LWP
: 0), 0, &nproc
);
466 pref
= (struct kinfo_proc
**)realloc(pref
, sizeof(struct kinfo_proc
*)
468 if (pref
== NULL
|| pbase
== NULL
) {
469 (void)fprintf(stderr
, "top: Out of memory.\n");
472 /* get a pointer to the states summary array */
473 si
->procstates
= process_states
;
475 /* set up flags which define what we are going to select */
476 show_idle
= sel
->idle
;
477 show_system
= sel
->system
;
478 show_uid
= sel
->uid
!= -1;
479 show_fullcmd
= sel
->fullcmd
;
481 /* count up process states and get pointers to interesting procs */
484 memset((char *)process_states
, 0, sizeof(process_states
));
486 for (pp
= pbase
, i
= 0; i
< nproc
; pp
++, i
++) {
488 * Place pointers to each valid proc structure in pref[].
489 * Process slots that are actually in use have a non-zero
490 * status field. Processes with P_SYSTEM set are system
491 * processes---these get ignored unless show_sysprocs is set.
493 if ((show_system
&& (LP(pp
, pid
) == -1)) ||
494 (show_system
|| ((PP(pp
, flags
) & P_SYSTEM
) == 0))) {
495 int lpstate
= LP(pp
, stat
);
496 int pstate
= PP(pp
, stat
);
499 if (lpstate
== LSRUN
)
501 if (pstate
>= 0 && pstate
< MAXPSTATES
- 1)
502 process_states
[pstate
]++;
503 if ((show_system
&& (LP(pp
, pid
) == -1)) ||
504 (show_idle
|| (LP(pp
, pctcpu
) != 0) ||
505 (lpstate
== LSRUN
)) &&
506 (!show_uid
|| PP(pp
, ruid
) == (uid_t
) sel
->uid
)) {
513 qsort((char *)pref
, active_procs
, sizeof(struct kinfo_proc
*),
514 (int (*)(const void *, const void *))proc_compares
[compare_index
]);
516 /* remember active and total counts */
517 si
->p_total
= total_procs
;
518 si
->p_active
= pref_len
= active_procs
;
520 /* pass back a handle */
521 handle
.next_proc
= pref
;
522 handle
.remaining
= active_procs
;
523 return ((caddr_t
) & handle
);
526 char fmt
[MAX_COLS
]; /* static area where result is built */
529 format_next_process(caddr_t xhandle
, char *(*get_userid
) (int))
531 struct kinfo_proc
*pp
;
540 char cputime_fmt
[10], ccputime_fmt
[10];
542 /* find and remember the next proc structure */
543 hp
= (struct handle
*)xhandle
;
544 pp
= *(hp
->next_proc
++);
547 /* get the process's command name */
549 char **comm_full
= kvm_getargv(kd
, pp
, 0);
559 /* the actual field to display */
560 char cmdfield
[MAX_COLS
];
562 if (PP(pp
, flags
) & P_SYSTEM
) {
564 snprintf(cmdfield
, sizeof cmdfield
, "[%s]", comm
);
565 } else if (LP(pp
, tid
) > 0) {
566 /* display it as a thread */
567 snprintf(cmdfield
, sizeof cmdfield
, "%s{%d}", comm
, LP(pp
, tid
));
569 snprintf(cmdfield
, sizeof cmdfield
, "%s", comm
);
573 * Convert the process's runtime from microseconds to seconds. This
574 * time includes the interrupt time to be in compliance with ps output.
576 cputime
= (LP(pp
, uticks
) + LP(pp
, sticks
) + LP(pp
, iticks
)) / 1000000;
577 ccputime
= cputime
+ PP(pp
, cru
).ru_stime
.tv_sec
+ PP(pp
, cru
).ru_utime
.tv_sec
;
578 format_time(cputime
, cputime_fmt
, sizeof(cputime_fmt
));
579 format_time(ccputime
, ccputime_fmt
, sizeof(ccputime_fmt
));
581 /* calculate the base for cpu percentages */
582 pct
= pctdouble(LP(pp
, pctcpu
));
584 /* generate "STATE" field */
585 switch (state
= LP(pp
, stat
)) {
587 if (LP(pp
, tdflags
) & TDF_RUNNING
)
588 sprintf(status
, "CPU%d", LP(pp
, cpuid
));
590 strcpy(status
, "RUN");
593 if (LP(pp
, wmesg
) != NULL
) {
594 sprintf(status
, "%.8s", LP(pp
, wmesg
)); /* WMESGLEN */
601 (unsigned)state
< sizeof(state_abbrev
) / sizeof(*state_abbrev
))
602 sprintf(status
, "%.6s", state_abbrev
[(unsigned char)state
]);
604 sprintf(status
, "?%5d", state
);
608 if (PP(pp
, stat
) == SZOMB
)
609 strcpy(status
, "ZOMB");
612 * idle time 0 - 31 -> nice value +21 - +52 normal time -> nice
613 * value -20 - +20 real time 0 - 31 -> nice value -52 - -21 thread
614 * 0 - 31 -> nice value -53 -
616 switch (LP(pp
, rtprio
.type
)) {
617 case RTP_PRIO_REALTIME
:
618 xnice
= PRIO_MIN
- 1 - RTP_PRIO_MAX
+ LP(pp
, rtprio
.prio
);
621 xnice
= PRIO_MAX
+ 1 + LP(pp
, rtprio
.prio
);
623 case RTP_PRIO_THREAD
:
624 xnice
= PRIO_MIN
- 1 - RTP_PRIO_MAX
- LP(pp
, rtprio
.prio
);
627 xnice
= PP(pp
, nice
);
631 /* format this entry */
632 snprintf(fmt
, sizeof(fmt
),
635 namelength
, namelength
,
636 get_userid(PP(pp
, ruid
)),
638 format_k(PROCSIZE(pp
)),
639 format_k(pagetok(VP(pp
, rssize
))),
648 /* return the result */
652 /* comparison routines for qsort */
655 * proc_compare - comparison function for "qsort"
656 * Compares the resource consumption of two processes using five
657 * distinct keys. The keys (in descending order of importance) are:
658 * percent cpu, cpu ticks, state, resident set size, total virtual
659 * memory usage. The process states are ordered as follows (from least
660 * to most important): WAIT, zombie, sleep, stop, start, run. The
661 * array declaration below maps a process state index into a number
662 * that reflects this ordering.
665 static unsigned char sorted_state
[] =
669 1, /* ABANDONED (WAIT) */
677 #define ORDERKEY_PCTCPU \
678 if (lresult = (long) LP(p2, pctcpu) - (long) LP(p1, pctcpu), \
679 (result = lresult > 0 ? 1 : lresult < 0 ? -1 : 0) == 0)
681 #define CPTICKS(p) (LP(p, uticks) + LP(p, sticks) + LP(p, iticks))
683 #define ORDERKEY_CPTICKS \
684 if ((result = CPTICKS(p2) > CPTICKS(p1) ? 1 : \
685 CPTICKS(p2) < CPTICKS(p1) ? -1 : 0) == 0)
687 #define CTIME(p) (((LP(p, uticks) + LP(p, sticks) + LP(p, iticks))/1000000) + \
688 PP(p, cru).ru_stime.tv_sec + PP(p, cru).ru_utime.tv_sec)
690 #define ORDERKEY_CTIME \
691 if ((result = CTIME(p2) > CTIME(p1) ? 1 : \
692 CTIME(p2) < CTIME(p1) ? -1 : 0) == 0)
694 #define ORDERKEY_STATE \
695 if ((result = sorted_state[(unsigned char) PP(p2, stat)] - \
696 sorted_state[(unsigned char) PP(p1, stat)]) == 0)
698 #define ORDERKEY_PRIO \
699 if ((result = LP(p2, prio) - LP(p1, prio)) == 0)
701 #define ORDERKEY_KTHREADS \
702 if ((result = (LP(p1, pid) == 0) - (LP(p2, pid) == 0)) == 0)
704 #define ORDERKEY_KTHREADS_PRIO \
705 if ((result = LP(p2, tdprio) - LP(p1, tdprio)) == 0)
707 #define ORDERKEY_RSSIZE \
708 if ((result = VP(p2, rssize) - VP(p1, rssize)) == 0)
710 #define ORDERKEY_MEM \
711 if ( (result = PROCSIZE(p2) - PROCSIZE(p1)) == 0 )
713 #define ORDERKEY_PID \
714 if ( (result = PP(p1, pid) - PP(p2, pid)) == 0)
716 #define ORDERKEY_PRSSIZE \
717 if((result = VP(p2, prssize) - VP(p1, prssize)) == 0)
719 /* compare_cpu - the comparison function for sorting by cpu percentage */
722 proc_compare(struct kinfo_proc
**pp1
, struct kinfo_proc
**pp2
)
724 struct kinfo_proc
*p1
;
725 struct kinfo_proc
*p2
;
729 /* remove one level of indirection */
730 p1
= *(struct kinfo_proc
**) pp1
;
731 p2
= *(struct kinfo_proc
**) pp2
;
744 /* compare_size - the comparison function for sorting by total memory usage */
747 compare_size(struct kinfo_proc
**pp1
, struct kinfo_proc
**pp2
)
749 struct kinfo_proc
*p1
;
750 struct kinfo_proc
*p2
;
754 /* remove one level of indirection */
755 p1
= *(struct kinfo_proc
**) pp1
;
756 p2
= *(struct kinfo_proc
**) pp2
;
769 /* compare_res - the comparison function for sorting by resident set size */
772 compare_res(struct kinfo_proc
**pp1
, struct kinfo_proc
**pp2
)
774 struct kinfo_proc
*p1
;
775 struct kinfo_proc
*p2
;
779 /* remove one level of indirection */
780 p1
= *(struct kinfo_proc
**) pp1
;
781 p2
= *(struct kinfo_proc
**) pp2
;
794 /* compare_pres - the comparison function for sorting by proportional resident set size */
797 compare_pres(struct kinfo_proc
**pp1
, struct kinfo_proc
**pp2
)
799 struct kinfo_proc
*p1
;
800 struct kinfo_proc
*p2
;
804 /* remove one level of indirection */
805 p1
= *(struct kinfo_proc
**) pp1
;
806 p2
= *(struct kinfo_proc
**) pp2
;
820 /* compare_time - the comparison function for sorting by total cpu time */
823 compare_time(struct kinfo_proc
**pp1
, struct kinfo_proc
**pp2
)
825 struct kinfo_proc
*p1
;
826 struct kinfo_proc
*p2
;
830 /* remove one level of indirection */
831 p1
= *(struct kinfo_proc
**) pp1
;
832 p2
= *(struct kinfo_proc
**) pp2
;
837 ORDERKEY_KTHREADS_PRIO
848 compare_ctime(struct kinfo_proc
**pp1
, struct kinfo_proc
**pp2
)
850 struct kinfo_proc
*p1
;
851 struct kinfo_proc
*p2
;
855 /* remove one level of indirection */
856 p1
= *(struct kinfo_proc
**) pp1
;
857 p2
= *(struct kinfo_proc
**) pp2
;
862 ORDERKEY_KTHREADS_PRIO
872 /* compare_prio - the comparison function for sorting by cpu percentage */
875 compare_prio(struct kinfo_proc
**pp1
, struct kinfo_proc
**pp2
)
877 struct kinfo_proc
*p1
;
878 struct kinfo_proc
*p2
;
882 /* remove one level of indirection */
883 p1
= *(struct kinfo_proc
**) pp1
;
884 p2
= *(struct kinfo_proc
**) pp2
;
887 ORDERKEY_KTHREADS_PRIO
900 compare_thr(struct kinfo_proc
**pp1
, struct kinfo_proc
**pp2
)
902 struct kinfo_proc
*p1
;
903 struct kinfo_proc
*p2
;
907 /* remove one level of indirection */
908 p1
= *(struct kinfo_proc
**)pp1
;
909 p2
= *(struct kinfo_proc
**)pp2
;
912 ORDERKEY_KTHREADS_PRIO
923 /* compare_pid - the comparison function for sorting by process id */
926 compare_pid(struct kinfo_proc
**pp1
, struct kinfo_proc
**pp2
)
928 struct kinfo_proc
*p1
;
929 struct kinfo_proc
*p2
;
932 /* remove one level of indirection */
933 p1
= *(struct kinfo_proc
**) pp1
;
934 p2
= *(struct kinfo_proc
**) pp2
;
943 * proc_owner(pid) - returns the uid that owns process "pid", or -1 if
944 * the process does not exist.
945 * It is EXTREMLY IMPORTANT that this function work correctly.
946 * If top runs setuid root (as in SVR4), then this function
947 * is the only thing that stands in the way of a serious
948 * security problem. It validates requests for the "kill"
949 * and "renice" commands.
956 struct kinfo_proc
**prefp
;
957 struct kinfo_proc
*pp
;
961 while (--xcnt
>= 0) {
963 if (PP(pp
, pid
) == (pid_t
) pid
) {
964 return ((int)PP(pp
, ruid
));
972 * swapmode is based on a program called swapinfo written
973 * by Kevin Lahey <kml@rokkaku.atl.ga.us>.
976 swapmode(int *retavail
, int *retfree
)
979 int pagesize
= getpagesize();
980 struct kvm_swap swapary
[1];
985 #define CONVERT(v) ((quad_t)(v) * pagesize / 1024)
987 n
= kvm_getswapinfo(kd
, swapary
, 1, 0);
988 if (n
< 0 || swapary
[0].ksw_total
== 0)
991 *retavail
= CONVERT(swapary
[0].ksw_total
);
992 *retfree
= CONVERT(swapary
[0].ksw_total
- swapary
[0].ksw_used
);
994 n
= (int)((double)swapary
[0].ksw_used
* 100.0 /
995 (double)swapary
[0].ksw_total
);