2 * top - a top users display for Unix
4 * SYNOPSIS: For FreeBSD-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 FreeBSD 2.2
14 * FreeBSD 2.2.x, 3.x, 4.x, and probably FreeBSD 2.1.x
18 * AUTHOR: Christos Zoulas <christos@ee.cornell.edu>
19 * Steven Wallace <swallace@freebsd.org>
20 * Wolfram Schneider <wosch@FreeBSD.org>
21 * Thomas Moestl <tmoestl@gmx.net>
26 #include <sys/param.h>
27 #include <sys/errno.h>
30 #include <sys/resource.h>
31 #include <sys/rtprio.h>
32 #include <sys/signal.h>
33 #include <sys/sysctl.h>
36 #include <sys/vmmeter.h>
54 static void getsysctl(char *, void *, size_t);
56 #define GETSYSCTL(name, var) getsysctl(name, &(var), sizeof(var))
57 #define SMPUNAMELEN 13
60 extern struct process_select ps;
61 extern char* printable(char *);
62 int swapmode(int *retavail, int *retfree);
64 enum displaymodes displaymode;
65 static int namelength = 8;
66 static int cmdlengthdelta;
68 /* Prototypes for top internals */
70 int compare_pid(const void *a, const void *b);
72 /* get_process_info passes back a handle. This is what it looks like: */
76 struct kinfo_proc **next_proc; /* points to next valid proc pointer */
77 int remaining; /* number of pointers remaining */
80 /* declarations for load_avg */
83 /* define what weighted cpu is. */
84 #define weighted_cpu(pct, pp) ((pp)->ki_swtime == 0 ? 0.0 : \
85 ((pct) / (1.0 - exp((pp)->ki_swtime * logcpu))))
87 /* what we consider to be process size: */
88 #define PROCSIZE(pp) ((pp)->ki_size / 1024)
90 #define RU(pp) (&(pp)->ki_rusage)
92 (RU(pp)->ru_inblock + RU(pp)->ru_oublock + RU(pp)->ru_majflt)
95 /* definitions for indices in the nlist array */
98 * These definitions control the format of the per-process area
101 static char io_header[] =
102 " PID %-*.*s VCSW IVCSW READ WRITE FAULT TOTAL PERCENT COMMAND";
104 #define io_Proc_format \
105 "%5d %-*.*s %6ld %6ld %6ld %6ld %6ld %6ld %6.2f%% %.*s"
107 static char smp_header_thr[] =
108 " PID %-*.*s THR PRI NICE SIZE RES STATE C TIME %6s COMMAND";
109 static char smp_header[] =
110 " PID %-*.*s " "PRI NICE SIZE RES STATE C TIME %6s COMMAND";
112 #define smp_Proc_format \
113 "%5d %-*.*s %s%3d %4d%7s %6s %-6.6s %1x%7s %5.2f%% %.*s"
115 static char up_header_thr[] =
116 " PID %-*.*s THR PRI NICE SIZE RES STATE TIME %6s COMMAND";
117 static char up_header[] =
118 " PID %-*.*s " "PRI NICE SIZE RES STATE TIME %6s COMMAND";
120 #define up_Proc_format \
121 "%5d %-*.*s %s%3d %4d%7s %6s %-6.6s%.0d%7s %5.2f%% %.*s"
124 /* process state names for the "STATE" column of the display */
125 /* the extra nulls in the string "run" are for adding a slash and
126 the processor number when needed */
128 char *state_abbrev[] =
130 "", "START", "RUN\0\0\0", "SLEEP", "STOP", "ZOMB", "WAIT", "LOCK"
136 /* values that we stash away in _init and use in later routines */
138 static double logcpu;
140 /* these are retrieved from the kernel in _init */
142 static load_avg ccpu;
144 /* these are used in the get_ functions */
148 /* these are for calculating cpu state percentages */
150 static long cp_time[CPUSTATES];
151 static long cp_old[CPUSTATES];
152 static long cp_diff[CPUSTATES];
154 /* these are for detailing the process states */
156 int process_states[8];
157 char *procstatenames[] = {
158 "", " starting, ", " running, ", " sleeping, ", " stopped, ",
159 " zombie, ", " waiting, ", " lock, ",
163 /* these are for detailing the cpu states */
165 int cpu_states[CPUSTATES];
166 char *cpustatenames[] = {
167 "user", "nice", "system", "interrupt", "idle", NULL
170 /* these are for detailing the memory statistics */
173 char *memorynames[] = {
175 "K Active, ", "K Inact, ", "K Wired, ", "K Cache, ", "K Buf, ", "K Free",
180 char *swapnames[] = {
182 "K Total, ", "K Used, ", "K Free, ", "% Inuse, ", "K In, ", "K Out",
187 /* these are for keeping track of the proc array */
190 static int onproc = -1;
192 static struct kinfo_proc *pbase;
193 static struct kinfo_proc **pref;
194 static struct kinfo_proc *previous_procs;
195 static struct kinfo_proc **previous_pref;
196 static int previous_proc_count = 0;
197 static int previous_proc_count_max = 0;
199 /* total number of io operations */
200 static long total_inblock;
201 static long total_oublock;
202 static long total_majflt;
204 /* these are for getting the memory statistics */
206 static int pageshift; /* log base 2 of the pagesize */
208 /* define pagetok in terms of pageshift */
210 #define pagetok(size) ((size) << pageshift)
212 /* useful externals */
217 * Sorting orders. The first element is the default.
219 char *ordernames[] = {
220 "cpu", "size", "res", "time", "pri", "threads",
221 "total", "read", "write", "fault", "vcsw", "ivcsw", NULL
226 machine_init(struct statics *statics)
232 modelen = sizeof(smpmode);
233 if ((sysctlbyname("machdep.smp_active", &smpmode, &modelen, NULL, 0) < 0 &&
234 sysctlbyname("kern.smp.active", &smpmode, &modelen, NULL, 0) < 0) ||
235 modelen != sizeof(smpmode))
238 while ((pw = getpwent()) != NULL) {
239 if (strlen(pw->pw_name) > namelength)
240 namelength = strlen(pw->pw_name);
242 if (smpmode && namelength > SMPUNAMELEN)
243 namelength = SMPUNAMELEN;
244 else if (namelength > UPUNAMELEN)
245 namelength = UPUNAMELEN;
247 kd = kvm_open(NULL, _PATH_DEVNULL, NULL, O_RDONLY, "kvm_open");
251 GETSYSCTL("kern.ccpu", ccpu);
253 /* this is used in calculating WCPU -- calculate it ahead of time */
254 logcpu = log(loaddouble(ccpu));
260 /* get the page size with "getpagesize" and calculate pageshift from it */
261 pagesize = getpagesize();
263 while (pagesize > 1) {
268 /* we only need the amount of log(2)1024 for our conversion */
269 pageshift -= LOG1024;
271 /* fill in the statics information */
272 statics->procstate_names = procstatenames;
273 statics->cpustate_names = cpustatenames;
274 statics->memory_names = memorynames;
275 statics->swap_names = swapnames;
277 statics->order_names = ordernames;
285 format_header(char *uname_field)
287 static char Header[128];
290 switch (displaymode) {
293 * The logic of picking the right header format seems reverse
294 * here because we only want to display a THR column when
295 * "thread mode" is off (and threads are not listed as
299 (ps.thread ? smp_header : smp_header_thr) :
300 (ps.thread ? up_header : up_header_thr);
301 snprintf(Header, sizeof(Header), prehead,
302 namelength, namelength, uname_field,
303 ps.wcpu ? "WCPU" : "CPU");
307 snprintf(Header, sizeof(Header), prehead,
308 namelength, namelength, uname_field);
311 cmdlengthdelta = strlen(Header) - 7;
315 static int swappgsin = -1;
316 static int swappgsout = -1;
317 extern struct timeval timeout;
320 get_system_info(struct system_info *si)
323 struct loadavg sysload;
325 struct timeval boottime;
329 /* get the cp_time array */
330 GETSYSCTL("kern.cp_time", cp_time);
331 GETSYSCTL("vm.loadavg", sysload);
332 GETSYSCTL("kern.lastpid", lastpid);
334 /* convert load averages to doubles */
335 for (i = 0; i < 3; i++)
336 si->load_avg[i] = (double)sysload.ldavg[i] / sysload.fscale;
338 /* convert cp_time counts to percentages */
339 total = percentages(CPUSTATES, cpu_states, cp_time, cp_old, cp_diff);
341 /* sum memory & swap statistics */
343 static unsigned int swap_delay = 0;
344 static int swapavail = 0;
345 static int swapfree = 0;
346 static int bufspace = 0;
347 static int nspgsin, nspgsout;
349 GETSYSCTL("vfs.bufspace", bufspace);
350 GETSYSCTL("vm.stats.vm.v_active_count", memory_stats[0]);
351 GETSYSCTL("vm.stats.vm.v_inactive_count", memory_stats[1]);
352 GETSYSCTL("vm.stats.vm.v_wire_count", memory_stats[2]);
353 GETSYSCTL("vm.stats.vm.v_cache_count", memory_stats[3]);
354 GETSYSCTL("vm.stats.vm.v_free_count", memory_stats[5]);
355 GETSYSCTL("vm.stats.vm.v_swappgsin", nspgsin);
356 GETSYSCTL("vm.stats.vm.v_swappgsout", nspgsout);
357 /* convert memory stats to Kbytes */
358 memory_stats[0] = pagetok(memory_stats[0]);
359 memory_stats[1] = pagetok(memory_stats[1]);
360 memory_stats[2] = pagetok(memory_stats[2]);
361 memory_stats[3] = pagetok(memory_stats[3]);
362 memory_stats[4] = bufspace / 1024;
363 memory_stats[5] = pagetok(memory_stats[5]);
364 memory_stats[6] = -1;
372 /* compute differences between old and new swap statistic */
374 swap_stats[4] = pagetok(((nspgsin - swappgsin)));
375 swap_stats[5] = pagetok(((nspgsout - swappgsout)));
379 swappgsout = nspgsout;
381 /* call CPU heavy swapmode() only for changes */
382 if (swap_stats[4] > 0 || swap_stats[5] > 0 || swap_delay == 0) {
383 swap_stats[3] = swapmode(&swapavail, &swapfree);
384 swap_stats[0] = swapavail;
385 swap_stats[1] = swapavail - swapfree;
386 swap_stats[2] = swapfree;
392 /* set arrays and strings */
393 si->cpustates = cpu_states;
394 si->memory = memory_stats;
395 si->swap = swap_stats;
399 si->last_pid = lastpid;
405 * Print how long system has been up.
406 * (Found by looking getting "boottime" from the kernel)
409 mib[1] = KERN_BOOTTIME;
410 bt_size = sizeof(boottime);
411 if (sysctl(mib, 2, &boottime, &bt_size, NULL, 0) != -1 &&
412 boottime.tv_sec != 0) {
413 si->boottime = boottime;
415 si->boottime.tv_sec = -1;
419 #define NOPROC ((void *)-1)
422 * We need to compare data from the old process entry with the new
424 * To facilitate doing this quickly we stash a pointer in the kinfo_proc
425 * structure to cache the mapping. We also use a negative cache pointer
426 * of NOPROC to avoid duplicate lookups.
427 * XXX: this could be done when the actual processes are fetched, we do
428 * it here out of laziness.
430 const struct kinfo_proc *
431 get_old_proc(struct kinfo_proc *pp)
433 struct kinfo_proc **oldpp, *oldp;
436 * If this is the first fetch of the kinfo_procs then we don't have
437 * any previous entries.
439 if (previous_proc_count == 0)
441 /* negative cache? */
442 if (pp->ki_udata == NOPROC)
445 if (pp->ki_udata != NULL)
446 return (pp->ki_udata);
449 * 1) look up based on pid.
450 * 2) compare process start.
451 * If we fail here, then setup a negative cache entry, otherwise
454 oldpp = bsearch(&pp, previous_pref, previous_proc_count,
455 sizeof(*previous_pref), compare_pid);
457 pp->ki_udata = NOPROC;
461 if (bcmp(&oldp->ki_start, &pp->ki_start, sizeof(pp->ki_start)) != 0) {
462 pp->ki_udata = NOPROC;
470 * Return the total amount of IO done in blocks in/out and faults.
471 * store the values individually in the pointers passed in.
474 get_io_stats(struct kinfo_proc *pp, long *inp, long *oup, long *flp, long *vcsw, long *ivcsw)
476 const struct kinfo_proc *oldp;
477 static struct kinfo_proc dummy;
480 oldp = get_old_proc(pp);
482 bzero(&dummy, sizeof(dummy));
486 *inp = RU(pp)->ru_inblock - RU(oldp)->ru_inblock;
487 *oup = RU(pp)->ru_oublock - RU(oldp)->ru_oublock;
488 *flp = RU(pp)->ru_majflt - RU(oldp)->ru_majflt;
489 *vcsw = RU(pp)->ru_nvcsw - RU(oldp)->ru_nvcsw;
490 *ivcsw = RU(pp)->ru_nivcsw - RU(oldp)->ru_nivcsw;
492 (RU(pp)->ru_inblock - RU(oldp)->ru_inblock) +
493 (RU(pp)->ru_oublock - RU(oldp)->ru_oublock) +
494 (RU(pp)->ru_majflt - RU(oldp)->ru_majflt);
499 * Return the total number of block in/out and faults by a process.
502 get_io_total(struct kinfo_proc *pp)
506 return (get_io_stats(pp, &dummy, &dummy, &dummy, &dummy, &dummy));
509 static struct handle handle;
512 get_process_info(struct system_info *si, struct process_select *sel,
513 int (*compare)(const void *, const void *))
518 long p_inblock, p_oublock, p_majflt, p_vcsw, p_ivcsw;
520 struct kinfo_proc **prefp;
521 struct kinfo_proc *pp;
522 struct kinfo_proc *prev_pp = NULL;
524 /* these are copied out of sel for speed */
532 * Save the previous process info.
534 if (previous_proc_count_max < nproc) {
535 free(previous_procs);
536 previous_procs = malloc(nproc * sizeof(*previous_procs));
538 previous_pref = malloc(nproc * sizeof(*previous_pref));
539 if (previous_procs == NULL || previous_pref == NULL) {
540 (void) fprintf(stderr, "top: Out of memory.\n");
543 previous_proc_count_max = nproc;
546 for (i = 0; i < nproc; i++)
547 previous_pref[i] = &previous_procs[i];
548 bcopy(pbase, previous_procs, nproc * sizeof(*previous_procs));
549 qsort(previous_pref, nproc, sizeof(*previous_pref), compare_pid);
551 previous_proc_count = nproc;
553 pbase = kvm_getprocs(kd, KERN_PROC_ALL, 0, &nproc);
555 pref = realloc(pref, sizeof(*pref) * (onproc = nproc));
556 if (pref == NULL || pbase == NULL) {
557 (void) fprintf(stderr, "top: Out of memory.\n");
560 /* get a pointer to the states summary array */
561 si->procstates = process_states;
563 /* set up flags which define what we are going to select */
564 show_idle = sel->idle;
565 show_self = sel->self == -1;
566 show_system = sel->system;
567 show_uid = sel->uid != -1;
568 show_command = sel->command != NULL;
570 /* count up process states and get pointers to interesting procs */
576 memset((char *)process_states, 0, sizeof(process_states));
578 for (pp = pbase, i = 0; i < nproc; pp++, i++) {
580 if (pp->ki_stat == 0)
584 if (!show_self && pp->ki_pid == sel->self)
588 if (!show_system && (pp->ki_flag & P_SYSTEM))
589 /* skip system process */
592 p_io = get_io_stats(pp, &p_inblock, &p_oublock, &p_majflt, &p_vcsw, &p_ivcsw);
593 total_inblock += p_inblock;
594 total_oublock += p_oublock;
595 total_majflt += p_majflt;
597 process_states[pp->ki_stat]++;
599 if (pp->ki_stat == SZOMB)
603 if (displaymode == DISP_CPU && !show_idle &&
604 (pp->ki_pctcpu == 0 || pp->ki_stat != SRUN))
605 /* skip idle or non-running processes */
608 if (displaymode == DISP_IO && !show_idle && p_io == 0)
609 /* skip processes that aren't doing I/O */
612 if (show_uid && pp->ki_ruid != (uid_t)sel->uid)
613 /* skip processes which don't belong to the selected UID */
617 * When not showing threads, take the first thread
618 * for output and add the fields that we can from
619 * the rest of the process's threads rather than
620 * using the system's mostly-broken KERN_PROC_PROC.
622 if (sel->thread || prev_pp == NULL ||
623 prev_pp->ki_pid != pp->ki_pid) {
628 prev_pp->ki_pctcpu += pp->ki_pctcpu;
632 /* if requested, sort the "interesting" processes */
634 qsort(pref, active_procs, sizeof(*pref), compare);
636 /* remember active and total counts */
637 si->p_total = total_procs;
638 si->p_active = pref_len = active_procs;
640 /* pass back a handle */
641 handle.next_proc = pref;
642 handle.remaining = active_procs;
643 return ((caddr_t)&handle);
646 static char fmt[128]; /* static area where result is built */
649 format_next_process(caddr_t handle, char *(*get_userid)(int))
651 struct kinfo_proc *pp;
652 const struct kinfo_proc *oldp;
658 struct rusage ru, *rup;
660 char *proc_fmt, thr_buf[6];
662 /* find and remember the next proc structure */
663 hp = (struct handle *)handle;
664 pp = *(hp->next_proc++);
667 /* get the process's command name */
668 if ((pp->ki_sflag & PS_INMEM) == 0) {
670 * Print swapped processes as <pname>
672 size_t len = strlen(pp->ki_comm);
673 if (len > sizeof(pp->ki_comm) - 3)
674 len = sizeof(pp->ki_comm) - 3;
675 memmove(pp->ki_comm + 1, pp->ki_comm, len);
676 pp->ki_comm[0] = '<';
677 pp->ki_comm[len + 1] = '>';
678 pp->ki_comm[len + 2] = '\0';
682 * Convert the process's runtime from microseconds to seconds. This
683 * time includes the interrupt time although that is not wanted here.
684 * ps(1) is similarly sloppy.
686 cputime = (pp->ki_runtime + 500000) / 1000000;
688 /* calculate the base for cpu percentages */
689 pct = pctdouble(pp->ki_pctcpu);
691 /* generate "STATE" field */
692 switch (state = pp->ki_stat) {
694 if (smpmode && pp->ki_oncpu != 0xff)
695 sprintf(status, "CPU%d", pp->ki_oncpu);
697 strcpy(status, "RUN");
700 if (pp->ki_kiflag & KI_LOCKBLOCK) {
701 sprintf(status, "*%.6s", pp->ki_lockname);
706 if (pp->ki_wmesg != NULL) {
707 sprintf(status, "%.6s", pp->ki_wmesg);
714 state < sizeof(state_abbrev) / sizeof(*state_abbrev))
715 sprintf(status, "%.6s", state_abbrev[state]);
717 sprintf(status, "?%5d", state);
721 if (displaymode == DISP_IO) {
722 oldp = get_old_proc(pp);
724 ru.ru_inblock = RU(pp)->ru_inblock - RU(oldp)->ru_inblock;
725 ru.ru_oublock = RU(pp)->ru_oublock - RU(oldp)->ru_oublock;
726 ru.ru_majflt = RU(pp)->ru_majflt - RU(oldp)->ru_majflt;
727 ru.ru_nvcsw = RU(pp)->ru_nvcsw - RU(oldp)->ru_nvcsw;
728 ru.ru_nivcsw = RU(pp)->ru_nivcsw - RU(oldp)->ru_nivcsw;
733 p_tot = rup->ru_inblock + rup->ru_oublock + rup->ru_majflt;
734 s_tot = total_inblock + total_oublock + total_majflt;
736 sprintf(fmt, io_Proc_format,
738 namelength, namelength,
739 (*get_userid)(pp->ki_ruid),
746 s_tot == 0 ? 0.0 : (p_tot * 100.0 / s_tot),
747 screen_width > cmdlengthdelta ?
748 screen_width - cmdlengthdelta : 0,
749 printable(pp->ki_comm));
753 /* format this entry */
754 proc_fmt = smpmode ? smp_Proc_format : up_Proc_format;
758 snprintf(thr_buf, sizeof(thr_buf), "%*d ",
759 sizeof(thr_buf) - 2, pp->ki_numthreads);
761 sprintf(fmt, proc_fmt,
763 namelength, namelength,
764 (*get_userid)(pp->ki_ruid),
766 pp->ki_pri.pri_level - PZERO,
769 * normal time -> nice value -20 - +20
770 * real time 0 - 31 -> nice value -52 - -21
771 * idle time 0 - 31 -> nice value +21 - +52
773 (pp->ki_pri.pri_class == PRI_TIMESHARE ?
774 pp->ki_nice - NZERO :
775 (PRI_IS_REALTIME(pp->ki_pri.pri_class) ?
776 (PRIO_MIN - 1 - (PRI_MAX_REALTIME - pp->ki_pri.pri_level)) :
777 (PRIO_MAX + 1 + pp->ki_pri.pri_level - PRI_MIN_IDLE))),
778 format_k2(PROCSIZE(pp)),
779 format_k2(pagetok(pp->ki_rssize)),
781 smpmode ? pp->ki_lastcpu : 0,
782 format_time(cputime),
783 ps.wcpu ? 100.0 * weighted_cpu(pct, pp) : 100.0 * pct,
784 screen_width > cmdlengthdelta ?
785 screen_width - cmdlengthdelta :
787 printable(pp->ki_comm));
789 /* return the result */
794 getsysctl(char *name, void *ptr, size_t len)
798 if (sysctlbyname(name, ptr, &nlen, NULL, 0) == -1) {
799 fprintf(stderr, "top: sysctl(%s...) failed: %s\n", name,
804 fprintf(stderr, "top: sysctl(%s...) expected %lu, got %lu\n", name,
805 (unsigned long)len, (unsigned long)nlen);
810 /* comparison routines for qsort */
813 compare_pid(const void *p1, const void *p2)
815 const struct kinfo_proc * const *pp1 = p1;
816 const struct kinfo_proc * const *pp2 = p2;
818 if ((*pp2)->ki_pid < 0 || (*pp1)->ki_pid < 0)
821 return ((*pp1)->ki_pid - (*pp2)->ki_pid);
825 * proc_compare - comparison function for "qsort"
826 * Compares the resource consumption of two processes using five
827 * distinct keys. The keys (in descending order of importance) are:
828 * percent cpu, cpu ticks, state, resident set size, total virtual
829 * memory usage. The process states are ordered as follows (from least
830 * to most important): WAIT, zombie, sleep, stop, start, run. The
831 * array declaration below maps a process state index into a number
832 * that reflects this ordering.
835 static int sorted_state[] =
839 1, /* ABANDONED (WAIT) */
847 #define ORDERKEY_PCTCPU(a, b) do { \
850 diff = floor(1.0E6 * weighted_cpu(pctdouble((b)->ki_pctcpu), (b))) - \
851 floor(1.0E6 * weighted_cpu(pctdouble((a)->ki_pctcpu), (a))); \
853 diff = (long)(b)->ki_pctcpu - (long)(a)->ki_pctcpu; \
855 return (diff > 0 ? 1 : -1); \
858 #define ORDERKEY_CPTICKS(a, b) do { \
859 int64_t diff = (int64_t)(b)->ki_runtime - (int64_t)(a)->ki_runtime; \
861 return (diff > 0 ? 1 : -1); \
864 #define ORDERKEY_STATE(a, b) do { \
865 int diff = sorted_state[(b)->ki_stat] - sorted_state[(a)->ki_stat]; \
867 return (diff > 0 ? 1 : -1); \
870 #define ORDERKEY_PRIO(a, b) do { \
871 int diff = (int)(b)->ki_pri.pri_level - (int)(a)->ki_pri.pri_level; \
873 return (diff > 0 ? 1 : -1); \
876 #define ORDERKEY_THREADS(a, b) do { \
877 int diff = (int)(b)->ki_numthreads - (int)(a)->ki_numthreads; \
879 return (diff > 0 ? 1 : -1); \
882 #define ORDERKEY_RSSIZE(a, b) do { \
883 long diff = (long)(b)->ki_rssize - (long)(a)->ki_rssize; \
885 return (diff > 0 ? 1 : -1); \
888 #define ORDERKEY_MEM(a, b) do { \
889 long diff = (long)PROCSIZE((b)) - (long)PROCSIZE((a)); \
891 return (diff > 0 ? 1 : -1); \
894 /* compare_cpu - the comparison function for sorting by cpu percentage */
898 compare_cpu(void *arg1, void *arg2)
900 proc_compare(void *arg1, void *arg2)
903 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
904 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
906 ORDERKEY_PCTCPU(p1, p2);
907 ORDERKEY_CPTICKS(p1, p2);
908 ORDERKEY_STATE(p1, p2);
909 ORDERKEY_PRIO(p1, p2);
910 ORDERKEY_RSSIZE(p1, p2);
911 ORDERKEY_MEM(p1, p2);
917 /* compare routines */
918 int compare_size(), compare_res(), compare_time(), compare_prio(), compare_threads();
919 /* io compare routines */
920 int compare_iototal(), compare_ioread(), compare_iowrite(), compare_iofault(), compare_vcsw(), compare_ivcsw();
922 int (*compares[])() = {
938 /* compare_size - the comparison function for sorting by total memory usage */
941 compare_size(void *arg1, void *arg2)
943 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
944 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
946 ORDERKEY_MEM(p1, p2);
947 ORDERKEY_RSSIZE(p1, p2);
948 ORDERKEY_PCTCPU(p1, p2);
949 ORDERKEY_CPTICKS(p1, p2);
950 ORDERKEY_STATE(p1, p2);
951 ORDERKEY_PRIO(p1, p2);
956 /* compare_res - the comparison function for sorting by resident set size */
959 compare_res(void *arg1, void *arg2)
961 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
962 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
964 ORDERKEY_RSSIZE(p1, p2);
965 ORDERKEY_MEM(p1, p2);
966 ORDERKEY_PCTCPU(p1, p2);
967 ORDERKEY_CPTICKS(p1, p2);
968 ORDERKEY_STATE(p1, p2);
969 ORDERKEY_PRIO(p1, p2);
974 /* compare_time - the comparison function for sorting by total cpu time */
977 compare_time(void *arg1, void *arg2)
979 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
980 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
982 ORDERKEY_CPTICKS(p1, p2);
983 ORDERKEY_PCTCPU(p1, p2);
984 ORDERKEY_STATE(p1, p2);
985 ORDERKEY_PRIO(p1, p2);
986 ORDERKEY_RSSIZE(p1, p2);
987 ORDERKEY_MEM(p1, p2);
992 /* compare_prio - the comparison function for sorting by priority */
995 compare_prio(void *arg1, void *arg2)
997 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
998 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1000 ORDERKEY_PRIO(p1, p2);
1001 ORDERKEY_CPTICKS(p1, p2);
1002 ORDERKEY_PCTCPU(p1, p2);
1003 ORDERKEY_STATE(p1, p2);
1004 ORDERKEY_RSSIZE(p1, p2);
1005 ORDERKEY_MEM(p1, p2);
1010 /* compare_threads - the comparison function for sorting by threads */
1012 compare_threads(void *arg1, void *arg2)
1014 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1015 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1017 ORDERKEY_THREADS(p1, p2);
1018 ORDERKEY_PCTCPU(p1, p2);
1019 ORDERKEY_CPTICKS(p1, p2);
1020 ORDERKEY_STATE(p1, p2);
1021 ORDERKEY_PRIO(p1, p2);
1022 ORDERKEY_RSSIZE(p1, p2);
1023 ORDERKEY_MEM(p1, p2);
1029 /* compare_io - the comparison function for sorting by total io */
1033 compare_iototal(void *arg1, void *arg2)
1035 io_compare(void *arg1, void *arg2)
1038 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1039 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1041 return (get_io_total(p2) - get_io_total(p1));
1047 compare_ioread(void *arg1, void *arg2)
1049 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1050 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1051 long dummy, inp1, inp2;
1053 (void) get_io_stats(p1, &inp1, &dummy, &dummy, &dummy, &dummy);
1054 (void) get_io_stats(p2, &inp2, &dummy, &dummy, &dummy, &dummy);
1056 return (inp2 - inp1);
1060 compare_iowrite(void *arg1, void *arg2)
1062 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1063 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1064 long dummy, oup1, oup2;
1066 (void) get_io_stats(p1, &dummy, &oup1, &dummy, &dummy, &dummy);
1067 (void) get_io_stats(p2, &dummy, &oup2, &dummy, &dummy, &dummy);
1069 return (oup2 - oup1);
1073 compare_iofault(void *arg1, void *arg2)
1075 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1076 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1077 long dummy, flp1, flp2;
1079 (void) get_io_stats(p1, &dummy, &dummy, &flp1, &dummy, &dummy);
1080 (void) get_io_stats(p2, &dummy, &dummy, &flp2, &dummy, &dummy);
1082 return (flp2 - flp1);
1086 compare_vcsw(void *arg1, void *arg2)
1088 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1089 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1090 long dummy, flp1, flp2;
1092 (void) get_io_stats(p1, &dummy, &dummy, &dummy, &flp1, &dummy);
1093 (void) get_io_stats(p2, &dummy, &dummy, &dummy, &flp2, &dummy);
1095 return (flp2 - flp1);
1099 compare_ivcsw(void *arg1, void *arg2)
1101 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1102 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1103 long dummy, flp1, flp2;
1105 (void) get_io_stats(p1, &dummy, &dummy, &dummy, &dummy, &flp1);
1106 (void) get_io_stats(p2, &dummy, &dummy, &dummy, &dummy, &flp2);
1108 return (flp2 - flp1);
1114 * proc_owner(pid) - returns the uid that owns process "pid", or -1 if
1115 * the process does not exist.
1116 * It is EXTREMLY IMPORTANT that this function work correctly.
1117 * If top runs setuid root (as in SVR4), then this function
1118 * is the only thing that stands in the way of a serious
1119 * security problem. It validates requests for the "kill"
1120 * and "renice" commands.
1127 struct kinfo_proc **prefp;
1128 struct kinfo_proc *pp;
1132 while (--cnt >= 0) {
1134 if (pp->ki_pid == (pid_t)pid)
1135 return ((int)pp->ki_ruid);
1141 swapmode(int *retavail, int *retfree)
1144 int pagesize = getpagesize();
1145 struct kvm_swap swapary[1];
1150 #define CONVERT(v) ((quad_t)(v) * pagesize / 1024)
1152 n = kvm_getswapinfo(kd, swapary, 1, 0);
1153 if (n < 0 || swapary[0].ksw_total == 0)
1156 *retavail = CONVERT(swapary[0].ksw_total);
1157 *retfree = CONVERT(swapary[0].ksw_total - swapary[0].ksw_used);
1159 n = (int)(swapary[0].ksw_used * 100.0 / swapary[0].ksw_total);