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>
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 *);
63 enum displaymodes displaymode;
64 #ifdef TOP_USERNAME_LEN
65 static int namelength = TOP_USERNAME_LEN;
67 static int namelength = 8;
69 static int cmdlengthdelta;
71 /* Prototypes for top internals */
74 /* get_process_info passes back a handle. This is what it looks like: */
77 struct kinfo_proc **next_proc; /* points to next valid proc pointer */
78 int remaining; /* number of pointers remaining */
81 /* declarations for load_avg */
84 /* define what weighted cpu is. */
85 #define weighted_cpu(pct, pp) ((pp)->ki_swtime == 0 ? 0.0 : \
86 ((pct) / (1.0 - exp((pp)->ki_swtime * logcpu))))
88 /* what we consider to be process size: */
89 #define PROCSIZE(pp) ((pp)->ki_size / 1024)
91 #define RU(pp) (&(pp)->ki_rusage)
93 (RU(pp)->ru_inblock + RU(pp)->ru_oublock + RU(pp)->ru_majflt)
96 /* definitions for indices in the nlist array */
99 * These definitions control the format of the per-process area
102 static char io_header[] =
103 " PID%s %-*.*s VCSW IVCSW READ WRITE FAULT TOTAL PERCENT COMMAND";
105 #define io_Proc_format \
106 "%5d%s %-*.*s %6ld %6ld %6ld %6ld %6ld %6ld %6.2f%% %.*s"
108 static char smp_header_thr[] =
109 " PID%s %-*.*s THR PRI NICE SIZE RES STATE C TIME %6s COMMAND";
110 static char smp_header[] =
111 " PID%s %-*.*s " "PRI NICE SIZE RES STATE C TIME %6s COMMAND";
113 #define smp_Proc_format \
114 "%5d%s %-*.*s %s%3d %4s%7s %6s %-6.6s %1x%7s %5.2f%% %.*s"
116 static char up_header_thr[] =
117 " PID%s %-*.*s THR PRI NICE SIZE RES STATE TIME %6s COMMAND";
118 static char up_header[] =
119 " PID%s %-*.*s " "PRI NICE SIZE RES STATE TIME %6s COMMAND";
121 #define up_Proc_format \
122 "%5d%s %-*.*s %s%3d %4s%7s %6s %-6.6s%.0d%7s %5.2f%% %.*s"
125 /* process state names for the "STATE" column of the display */
126 /* the extra nulls in the string "run" are for adding a slash and
127 the processor number when needed */
129 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[] = {
174 "K Active, ", "K Inact, ", "K Wired, ", "K Cache, ", "K Buf, ",
179 char *swapnames[] = {
180 "K Total, ", "K Used, ", "K Free, ", "% Inuse, ", "K In, ", "K Out",
185 /* these are for keeping track of the proc array */
188 static int onproc = -1;
190 static struct kinfo_proc *pbase;
191 static struct kinfo_proc **pref;
192 static struct kinfo_proc *previous_procs;
193 static struct kinfo_proc **previous_pref;
194 static int previous_proc_count = 0;
195 static int previous_proc_count_max = 0;
197 /* total number of io operations */
198 static long total_inblock;
199 static long total_oublock;
200 static long total_majflt;
202 /* these are for getting the memory statistics */
204 static int pageshift; /* log base 2 of the pagesize */
206 /* define pagetok in terms of pageshift */
208 #define pagetok(size) ((size) << pageshift)
210 /* useful externals */
215 * Sorting orders. The first element is the default.
217 char *ordernames[] = {
218 "cpu", "size", "res", "time", "pri", "threads",
219 "total", "read", "write", "fault", "vcsw", "ivcsw",
224 /* Per-cpu time states */
228 static u_long cpumask;
230 static long *pcpu_cp_time;
231 static long *pcpu_cp_old;
232 static long *pcpu_cp_diff;
233 static int *pcpu_cpu_states;
235 static int compare_jid(const void *a, const void *b);
236 static int compare_pid(const void *a, const void *b);
237 static const char *format_nice(const struct kinfo_proc *pp);
238 static void getsysctl(const char *name, void *ptr, size_t len);
239 static int swapmode(int *retavail, int *retfree);
242 machine_init(struct statics *statics, char do_unames)
248 modelen = sizeof(smpmode);
249 if ((sysctlbyname("machdep.smp_active", &smpmode, &modelen,
251 sysctlbyname("kern.smp.active", &smpmode, &modelen,
253 modelen != sizeof(smpmode))
257 while ((pw = getpwent()) != NULL) {
258 if (strlen(pw->pw_name) > namelength)
259 namelength = strlen(pw->pw_name);
262 if (smpmode && namelength > SMPUNAMELEN)
263 namelength = SMPUNAMELEN;
264 else if (namelength > UPUNAMELEN)
265 namelength = UPUNAMELEN;
267 kd = kvm_open(NULL, _PATH_DEVNULL, NULL, O_RDONLY, "kvm_open");
271 GETSYSCTL("kern.ccpu", ccpu);
273 /* this is used in calculating WCPU -- calculate it ahead of time */
274 logcpu = log(loaddouble(ccpu));
281 /* get the page size and calculate pageshift from it */
282 pagesize = getpagesize();
284 while (pagesize > 1) {
289 /* we only need the amount of log(2)1024 for our conversion */
290 pageshift -= LOG1024;
292 /* fill in the statics information */
293 statics->procstate_names = procstatenames;
294 statics->cpustate_names = cpustatenames;
295 statics->memory_names = memorynames;
296 statics->swap_names = swapnames;
298 statics->order_names = ordernames;
301 /* Adjust display based on ncpus */
308 GETSYSCTL("kern.smp.maxcpus", maxcpu);
309 size = sizeof(long) * maxcpu * CPUSTATES;
310 times = malloc(size);
312 err(1, "malloc %zd bytes", size);
313 if (sysctlbyname("kern.cp_times", times, &size, NULL, 0) == -1)
314 err(1, "sysctlbyname kern.cp_times");
315 pcpu_cp_time = calloc(1, size);
316 maxid = (size / CPUSTATES / sizeof(long)) - 1;
317 for (i = 0; i <= maxid; i++) {
319 for (j = 0; empty && j < CPUSTATES; j++) {
320 if (times[i * CPUSTATES + j] != 0)
324 cpumask |= (1ul << i);
330 y_mem += ncpus - 1; /* 3 */
331 y_swap += ncpus - 1; /* 4 */
332 y_idlecursor += ncpus - 1; /* 5 */
333 y_message += ncpus - 1; /* 5 */
334 y_header += ncpus - 1; /* 6 */
335 y_procs += ncpus - 1; /* 7 */
336 Header_lines += ncpus - 1; /* 7 */
338 size = sizeof(long) * ncpus * CPUSTATES;
339 pcpu_cp_old = calloc(1, size);
340 pcpu_cp_diff = calloc(1, size);
341 pcpu_cpu_states = calloc(1, size);
342 statics->ncpus = ncpus;
352 format_header(char *uname_field)
354 static char Header[128];
357 switch (displaymode) {
360 * The logic of picking the right header format seems reverse
361 * here because we only want to display a THR column when
362 * "thread mode" is off (and threads are not listed as
366 (ps.thread ? smp_header : smp_header_thr) :
367 (ps.thread ? up_header : up_header_thr);
368 snprintf(Header, sizeof(Header), prehead,
369 ps.jail ? " JID" : "",
370 namelength, namelength, uname_field,
371 ps.wcpu ? "WCPU" : "CPU");
375 snprintf(Header, sizeof(Header), prehead,
376 ps.jail ? " JID" : "",
377 namelength, namelength, uname_field);
380 cmdlengthdelta = strlen(Header) - 7;
384 static int swappgsin = -1;
385 static int swappgsout = -1;
386 extern struct timeval timeout;
390 get_system_info(struct system_info *si)
393 struct loadavg sysload;
395 struct timeval boottime;
400 /* get the cp_time array */
402 size = (maxid + 1) * CPUSTATES * sizeof(long);
403 if (sysctlbyname("kern.cp_times", pcpu_cp_time, &size, NULL, 0) == -1)
404 err(1, "sysctlbyname kern.cp_times");
406 GETSYSCTL("kern.cp_time", cp_time);
408 GETSYSCTL("vm.loadavg", sysload);
409 GETSYSCTL("kern.lastpid", lastpid);
411 /* convert load averages to doubles */
412 for (i = 0; i < 3; i++)
413 si->load_avg[i] = (double)sysload.ldavg[i] / sysload.fscale;
416 for (i = j = 0; i <= maxid; i++) {
417 if ((cpumask & (1ul << i)) == 0)
419 /* convert cp_time counts to percentages */
420 percentages(CPUSTATES, &pcpu_cpu_states[j * CPUSTATES],
421 &pcpu_cp_time[j * CPUSTATES],
422 &pcpu_cp_old[j * CPUSTATES],
423 &pcpu_cp_diff[j * CPUSTATES]);
427 /* convert cp_time counts to percentages */
428 percentages(CPUSTATES, cpu_states, cp_time, cp_old, cp_diff);
431 /* sum memory & swap statistics */
433 static unsigned int swap_delay = 0;
434 static int swapavail = 0;
435 static int swapfree = 0;
436 static int bufspace = 0;
437 static int nspgsin, nspgsout;
439 GETSYSCTL("vfs.bufspace", bufspace);
440 GETSYSCTL("vm.stats.vm.v_active_count", memory_stats[0]);
441 GETSYSCTL("vm.stats.vm.v_inactive_count", memory_stats[1]);
442 GETSYSCTL("vm.stats.vm.v_wire_count", memory_stats[2]);
443 GETSYSCTL("vm.stats.vm.v_cache_count", memory_stats[3]);
444 GETSYSCTL("vm.stats.vm.v_free_count", memory_stats[5]);
445 GETSYSCTL("vm.stats.vm.v_swappgsin", nspgsin);
446 GETSYSCTL("vm.stats.vm.v_swappgsout", nspgsout);
447 /* convert memory stats to Kbytes */
448 memory_stats[0] = pagetok(memory_stats[0]);
449 memory_stats[1] = pagetok(memory_stats[1]);
450 memory_stats[2] = pagetok(memory_stats[2]);
451 memory_stats[3] = pagetok(memory_stats[3]);
452 memory_stats[4] = bufspace / 1024;
453 memory_stats[5] = pagetok(memory_stats[5]);
454 memory_stats[6] = -1;
462 /* compute differences between old and new swap statistic */
464 swap_stats[4] = pagetok(((nspgsin - swappgsin)));
465 swap_stats[5] = pagetok(((nspgsout - swappgsout)));
469 swappgsout = nspgsout;
471 /* call CPU heavy swapmode() only for changes */
472 if (swap_stats[4] > 0 || swap_stats[5] > 0 || swap_delay == 0) {
473 swap_stats[3] = swapmode(&swapavail, &swapfree);
474 swap_stats[0] = swapavail;
475 swap_stats[1] = swapavail - swapfree;
476 swap_stats[2] = swapfree;
482 /* set arrays and strings */
484 si->cpustates = pcpu_cpu_states;
487 si->cpustates = cpu_states;
490 si->memory = memory_stats;
491 si->swap = swap_stats;
495 si->last_pid = lastpid;
501 * Print how long system has been up.
502 * (Found by looking getting "boottime" from the kernel)
505 mib[1] = KERN_BOOTTIME;
506 bt_size = sizeof(boottime);
507 if (sysctl(mib, 2, &boottime, &bt_size, NULL, 0) != -1 &&
508 boottime.tv_sec != 0) {
509 si->boottime = boottime;
511 si->boottime.tv_sec = -1;
515 #define NOPROC ((void *)-1)
518 * We need to compare data from the old process entry with the new
520 * To facilitate doing this quickly we stash a pointer in the kinfo_proc
521 * structure to cache the mapping. We also use a negative cache pointer
522 * of NOPROC to avoid duplicate lookups.
523 * XXX: this could be done when the actual processes are fetched, we do
524 * it here out of laziness.
526 const struct kinfo_proc *
527 get_old_proc(struct kinfo_proc *pp)
529 struct kinfo_proc **oldpp, *oldp;
532 * If this is the first fetch of the kinfo_procs then we don't have
533 * any previous entries.
535 if (previous_proc_count == 0)
537 /* negative cache? */
538 if (pp->ki_udata == NOPROC)
541 if (pp->ki_udata != NULL)
542 return (pp->ki_udata);
545 * 1) look up based on pid.
546 * 2) compare process start.
547 * If we fail here, then setup a negative cache entry, otherwise
550 oldpp = bsearch(&pp, previous_pref, previous_proc_count,
551 sizeof(*previous_pref), compare_pid);
553 pp->ki_udata = NOPROC;
557 if (bcmp(&oldp->ki_start, &pp->ki_start, sizeof(pp->ki_start)) != 0) {
558 pp->ki_udata = NOPROC;
566 * Return the total amount of IO done in blocks in/out and faults.
567 * store the values individually in the pointers passed in.
570 get_io_stats(struct kinfo_proc *pp, long *inp, long *oup, long *flp,
571 long *vcsw, long *ivcsw)
573 const struct kinfo_proc *oldp;
574 static struct kinfo_proc dummy;
577 oldp = get_old_proc(pp);
579 bzero(&dummy, sizeof(dummy));
582 *inp = RU(pp)->ru_inblock - RU(oldp)->ru_inblock;
583 *oup = RU(pp)->ru_oublock - RU(oldp)->ru_oublock;
584 *flp = RU(pp)->ru_majflt - RU(oldp)->ru_majflt;
585 *vcsw = RU(pp)->ru_nvcsw - RU(oldp)->ru_nvcsw;
586 *ivcsw = RU(pp)->ru_nivcsw - RU(oldp)->ru_nivcsw;
588 (RU(pp)->ru_inblock - RU(oldp)->ru_inblock) +
589 (RU(pp)->ru_oublock - RU(oldp)->ru_oublock) +
590 (RU(pp)->ru_majflt - RU(oldp)->ru_majflt);
595 * Return the total number of block in/out and faults by a process.
598 get_io_total(struct kinfo_proc *pp)
602 return (get_io_stats(pp, &dummy, &dummy, &dummy, &dummy, &dummy));
605 static struct handle handle;
608 get_process_info(struct system_info *si, struct process_select *sel,
609 int (*compare)(const void *, const void *))
614 long p_inblock, p_oublock, p_majflt, p_vcsw, p_ivcsw;
616 struct kinfo_proc **prefp;
617 struct kinfo_proc *pp;
618 struct kinfo_proc *prev_pp = NULL;
620 /* these are copied out of sel for speed */
628 * Save the previous process info.
630 if (previous_proc_count_max < nproc) {
631 free(previous_procs);
632 previous_procs = malloc(nproc * sizeof(*previous_procs));
634 previous_pref = malloc(nproc * sizeof(*previous_pref));
635 if (previous_procs == NULL || previous_pref == NULL) {
636 (void) fprintf(stderr, "top: Out of memory.\n");
639 previous_proc_count_max = nproc;
642 for (i = 0; i < nproc; i++)
643 previous_pref[i] = &previous_procs[i];
644 bcopy(pbase, previous_procs, nproc * sizeof(*previous_procs));
645 qsort(previous_pref, nproc, sizeof(*previous_pref),
648 previous_proc_count = nproc;
650 pbase = kvm_getprocs(kd, KERN_PROC_ALL, 0, &nproc);
652 pref = realloc(pref, sizeof(*pref) * (onproc = nproc));
653 if (pref == NULL || pbase == NULL) {
654 (void) fprintf(stderr, "top: Out of memory.\n");
657 /* get a pointer to the states summary array */
658 si->procstates = process_states;
660 /* set up flags which define what we are going to select */
661 show_idle = sel->idle;
662 show_self = sel->self == -1;
663 show_system = sel->system;
664 show_uid = sel->uid != -1;
665 show_command = sel->command != NULL;
667 /* count up process states and get pointers to interesting procs */
673 memset((char *)process_states, 0, sizeof(process_states));
675 for (pp = pbase, i = 0; i < nproc; pp++, i++) {
677 if (pp->ki_stat == 0)
681 if (!show_self && pp->ki_pid == sel->self)
685 if (!show_system && (pp->ki_flag & P_SYSTEM))
686 /* skip system process */
689 p_io = get_io_stats(pp, &p_inblock, &p_oublock, &p_majflt,
691 total_inblock += p_inblock;
692 total_oublock += p_oublock;
693 total_majflt += p_majflt;
695 process_states[pp->ki_stat]++;
697 if (pp->ki_stat == SZOMB)
701 if (displaymode == DISP_CPU && !show_idle &&
702 (pp->ki_pctcpu == 0 ||
703 pp->ki_stat == SSTOP || pp->ki_stat == SIDL))
704 /* skip idle or non-running processes */
707 if (displaymode == DISP_IO && !show_idle && p_io == 0)
708 /* skip processes that aren't doing I/O */
711 if (show_uid && pp->ki_ruid != (uid_t)sel->uid)
712 /* skip proc. that don't belong to the selected UID */
716 * When not showing threads, take the first thread
717 * for output and add the fields that we can from
718 * the rest of the process's threads rather than
719 * using the system's mostly-broken KERN_PROC_PROC.
721 if (sel->thread || prev_pp == NULL ||
722 prev_pp->ki_pid != pp->ki_pid) {
727 prev_pp->ki_pctcpu += pp->ki_pctcpu;
731 /* if requested, sort the "interesting" processes */
733 qsort(pref, active_procs, sizeof(*pref), compare);
735 /* remember active and total counts */
736 si->p_total = total_procs;
737 si->p_active = pref_len = active_procs;
739 /* pass back a handle */
740 handle.next_proc = pref;
741 handle.remaining = active_procs;
742 return ((caddr_t)&handle);
745 static char fmt[128]; /* static area where result is built */
748 format_next_process(caddr_t handle, char *(*get_userid)(int), int flags)
750 struct kinfo_proc *pp;
751 const struct kinfo_proc *oldp;
757 struct rusage ru, *rup;
759 char *proc_fmt, thr_buf[6], jid_buf[6];
763 /* find and remember the next proc structure */
764 hp = (struct handle *)handle;
765 pp = *(hp->next_proc++);
768 /* get the process's command name */
769 if ((pp->ki_flag & P_INMEM) == 0) {
771 * Print swapped processes as <pname>
775 len = strlen(pp->ki_comm);
776 if (len > sizeof(pp->ki_comm) - 3)
777 len = sizeof(pp->ki_comm) - 3;
778 memmove(pp->ki_comm + 1, pp->ki_comm, len);
779 pp->ki_comm[0] = '<';
780 pp->ki_comm[len + 1] = '>';
781 pp->ki_comm[len + 2] = '\0';
785 * Convert the process's runtime from microseconds to seconds. This
786 * time includes the interrupt time although that is not wanted here.
787 * ps(1) is similarly sloppy.
789 cputime = (pp->ki_runtime + 500000) / 1000000;
791 /* calculate the base for cpu percentages */
792 pct = pctdouble(pp->ki_pctcpu);
794 /* generate "STATE" field */
795 switch (state = pp->ki_stat) {
797 if (smpmode && pp->ki_oncpu != 0xff)
798 sprintf(status, "CPU%d", pp->ki_oncpu);
800 strcpy(status, "RUN");
803 if (pp->ki_kiflag & KI_LOCKBLOCK) {
804 sprintf(status, "*%.6s", pp->ki_lockname);
809 if (pp->ki_wmesg != NULL) {
810 sprintf(status, "%.6s", pp->ki_wmesg);
817 state < sizeof(state_abbrev) / sizeof(*state_abbrev))
818 sprintf(status, "%.6s", state_abbrev[state]);
820 sprintf(status, "?%5d", state);
824 cmdbuf = (char *)malloc(cmdlengthdelta + 1);
825 if (cmdbuf == NULL) {
826 warn("malloc(%d)", cmdlengthdelta + 1);
830 if (!(flags & FMT_SHOWARGS)) {
831 snprintf(cmdbuf, cmdlengthdelta, "%s", pp->ki_comm);
833 else if (pp->ki_args == NULL ||
834 (args = kvm_getargv(kd, pp, cmdlengthdelta)) == NULL || !(*args))
835 snprintf(cmdbuf, cmdlengthdelta, "[%s]", pp->ki_comm);
837 char *src, *dst, *argbuf;
842 argbuflen = cmdlengthdelta * 4;
843 argbuf = (char *)malloc(argbuflen + 1);
844 if (argbuf == NULL) {
845 warn("malloc(%d)", argbuflen + 1);
852 /* Extract cmd name from argv */
853 cmd = strrchr(*args, '/');
859 for (; (src = *args++) != NULL; ) {
862 len = (argbuflen - (dst - argbuf) - 1) / 4;
863 strvisx(dst, src, strlen(src) < len ? strlen(src) : len,
864 VIS_NL | VIS_CSTYLE);
867 if ((argbuflen - (dst - argbuf) - 1) / 4 > 0)
868 *dst++ = ' '; /* add delimiting space */
870 if (dst != argbuf && dst[-1] == ' ')
874 if (strcmp(cmd, pp->ki_comm) != 0 )
875 snprintf(cmdbuf, cmdlengthdelta, "%s (%s)",argbuf, \
878 strlcpy(cmdbuf, argbuf, cmdlengthdelta);
886 snprintf(jid_buf, sizeof(jid_buf), " %*d",
887 sizeof(jid_buf) - 3, pp->ki_jid);
889 if (displaymode == DISP_IO) {
890 oldp = get_old_proc(pp);
892 ru.ru_inblock = RU(pp)->ru_inblock -
893 RU(oldp)->ru_inblock;
894 ru.ru_oublock = RU(pp)->ru_oublock -
895 RU(oldp)->ru_oublock;
896 ru.ru_majflt = RU(pp)->ru_majflt - RU(oldp)->ru_majflt;
897 ru.ru_nvcsw = RU(pp)->ru_nvcsw - RU(oldp)->ru_nvcsw;
898 ru.ru_nivcsw = RU(pp)->ru_nivcsw - RU(oldp)->ru_nivcsw;
903 p_tot = rup->ru_inblock + rup->ru_oublock + rup->ru_majflt;
904 s_tot = total_inblock + total_oublock + total_majflt;
906 sprintf(fmt, io_Proc_format,
909 namelength, namelength, (*get_userid)(pp->ki_ruid),
916 s_tot == 0 ? 0.0 : (p_tot * 100.0 / s_tot),
917 screen_width > cmdlengthdelta ?
918 screen_width - cmdlengthdelta : 0,
926 /* format this entry */
927 proc_fmt = smpmode ? smp_Proc_format : up_Proc_format;
931 snprintf(thr_buf, sizeof(thr_buf), "%*d ",
932 sizeof(thr_buf) - 2, pp->ki_numthreads);
934 sprintf(fmt, proc_fmt,
937 namelength, namelength, (*get_userid)(pp->ki_ruid),
939 pp->ki_pri.pri_level - PZERO,
941 format_k2(PROCSIZE(pp)),
942 format_k2(pagetok(pp->ki_rssize)),
944 smpmode ? pp->ki_lastcpu : 0,
945 format_time(cputime),
946 ps.wcpu ? 100.0 * weighted_cpu(pct, pp) : 100.0 * pct,
947 screen_width > cmdlengthdelta ? screen_width - cmdlengthdelta : 0,
952 /* return the result */
957 getsysctl(const char *name, void *ptr, size_t len)
961 if (sysctlbyname(name, ptr, &nlen, NULL, 0) == -1) {
962 fprintf(stderr, "top: sysctl(%s...) failed: %s\n", name,
967 fprintf(stderr, "top: sysctl(%s...) expected %lu, got %lu\n",
968 name, (unsigned long)len, (unsigned long)nlen);
974 format_nice(const struct kinfo_proc *pp)
976 const char *fifo, *kthread;
978 static char nicebuf[4 + 1];
980 fifo = PRI_NEED_RR(pp->ki_pri.pri_class) ? "" : "F";
981 kthread = (pp->ki_flag & P_KTHREAD) ? "k" : "";
982 switch (PRI_BASE(pp->ki_pri.pri_class)) {
987 * XXX: the kernel doesn't tell us the original rtprio and
988 * doesn't really know what it was, so to recover it we
989 * must be more chummy with the implementation than the
990 * implementation is with itself. pri_user gives a
991 * constant "base" priority, but is only initialized
992 * properly for user threads. pri_native gives what the
993 * kernel calls the "base" priority, but it isn't constant
994 * since it is changed by priority propagation. pri_native
995 * also isn't properly initialized for all threads, but it
996 * is properly initialized for kernel realtime and idletime
997 * threads. Thus we use pri_user for the base priority of
998 * user threads (it is always correct) and pri_native for
999 * the base priority of kernel realtime and idletime threads
1000 * (there is nothing better, and it is usually correct).
1002 * The field width and thus the buffer are too small for
1003 * values like "kr31F", but such values shouldn't occur,
1004 * and if they do then the tailing "F" is not displayed.
1006 rtpri = ((pp->ki_flag & P_KTHREAD) ? pp->ki_pri.pri_native :
1007 pp->ki_pri.pri_user) - PRI_MIN_REALTIME;
1008 snprintf(nicebuf, sizeof(nicebuf), "%sr%d%s",
1009 kthread, rtpri, fifo);
1012 if (pp->ki_flag & P_KTHREAD)
1014 snprintf(nicebuf, sizeof(nicebuf), "%d", pp->ki_nice - NZERO);
1017 /* XXX: as above. */
1018 rtpri = ((pp->ki_flag & P_KTHREAD) ? pp->ki_pri.pri_native :
1019 pp->ki_pri.pri_user) - PRI_MIN_IDLE;
1020 snprintf(nicebuf, sizeof(nicebuf), "%si%d%s",
1021 kthread, rtpri, fifo);
1029 /* comparison routines for qsort */
1032 compare_pid(const void *p1, const void *p2)
1034 const struct kinfo_proc * const *pp1 = p1;
1035 const struct kinfo_proc * const *pp2 = p2;
1037 if ((*pp2)->ki_pid < 0 || (*pp1)->ki_pid < 0)
1040 return ((*pp1)->ki_pid - (*pp2)->ki_pid);
1044 * proc_compare - comparison function for "qsort"
1045 * Compares the resource consumption of two processes using five
1046 * distinct keys. The keys (in descending order of importance) are:
1047 * percent cpu, cpu ticks, state, resident set size, total virtual
1048 * memory usage. The process states are ordered as follows (from least
1049 * to most important): WAIT, zombie, sleep, stop, start, run. The
1050 * array declaration below maps a process state index into a number
1051 * that reflects this ordering.
1054 static int sorted_state[] = {
1057 1, /* ABANDONED (WAIT) */
1065 #define ORDERKEY_PCTCPU(a, b) do { \
1068 diff = floor(1.0E6 * weighted_cpu(pctdouble((b)->ki_pctcpu), \
1070 floor(1.0E6 * weighted_cpu(pctdouble((a)->ki_pctcpu), \
1073 diff = (long)(b)->ki_pctcpu - (long)(a)->ki_pctcpu; \
1075 return (diff > 0 ? 1 : -1); \
1078 #define ORDERKEY_CPTICKS(a, b) do { \
1079 int64_t diff = (int64_t)(b)->ki_runtime - (int64_t)(a)->ki_runtime; \
1081 return (diff > 0 ? 1 : -1); \
1084 #define ORDERKEY_STATE(a, b) do { \
1085 int diff = sorted_state[(b)->ki_stat] - sorted_state[(a)->ki_stat]; \
1087 return (diff > 0 ? 1 : -1); \
1090 #define ORDERKEY_PRIO(a, b) do { \
1091 int diff = (int)(b)->ki_pri.pri_level - (int)(a)->ki_pri.pri_level; \
1093 return (diff > 0 ? 1 : -1); \
1096 #define ORDERKEY_THREADS(a, b) do { \
1097 int diff = (int)(b)->ki_numthreads - (int)(a)->ki_numthreads; \
1099 return (diff > 0 ? 1 : -1); \
1102 #define ORDERKEY_RSSIZE(a, b) do { \
1103 long diff = (long)(b)->ki_rssize - (long)(a)->ki_rssize; \
1105 return (diff > 0 ? 1 : -1); \
1108 #define ORDERKEY_MEM(a, b) do { \
1109 long diff = (long)PROCSIZE((b)) - (long)PROCSIZE((a)); \
1111 return (diff > 0 ? 1 : -1); \
1114 #define ORDERKEY_JID(a, b) do { \
1115 int diff = (int)(b)->ki_jid - (int)(a)->ki_jid; \
1117 return (diff > 0 ? 1 : -1); \
1120 /* compare_cpu - the comparison function for sorting by cpu percentage */
1124 compare_cpu(void *arg1, void *arg2)
1126 proc_compare(void *arg1, void *arg2)
1129 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1130 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1132 ORDERKEY_PCTCPU(p1, p2);
1133 ORDERKEY_CPTICKS(p1, p2);
1134 ORDERKEY_STATE(p1, p2);
1135 ORDERKEY_PRIO(p1, p2);
1136 ORDERKEY_RSSIZE(p1, p2);
1137 ORDERKEY_MEM(p1, p2);
1143 /* "cpu" compare routines */
1144 int compare_size(), compare_res(), compare_time(), compare_prio(),
1148 * "io" compare routines. Context switches aren't i/o, but are displayed
1149 * on the "io" display.
1151 int compare_iototal(), compare_ioread(), compare_iowrite(), compare_iofault(),
1152 compare_vcsw(), compare_ivcsw();
1154 int (*compares[])() = {
1171 /* compare_size - the comparison function for sorting by total memory usage */
1174 compare_size(void *arg1, void *arg2)
1176 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1177 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1179 ORDERKEY_MEM(p1, p2);
1180 ORDERKEY_RSSIZE(p1, p2);
1181 ORDERKEY_PCTCPU(p1, p2);
1182 ORDERKEY_CPTICKS(p1, p2);
1183 ORDERKEY_STATE(p1, p2);
1184 ORDERKEY_PRIO(p1, p2);
1189 /* compare_res - the comparison function for sorting by resident set size */
1192 compare_res(void *arg1, void *arg2)
1194 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1195 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1197 ORDERKEY_RSSIZE(p1, p2);
1198 ORDERKEY_MEM(p1, p2);
1199 ORDERKEY_PCTCPU(p1, p2);
1200 ORDERKEY_CPTICKS(p1, p2);
1201 ORDERKEY_STATE(p1, p2);
1202 ORDERKEY_PRIO(p1, p2);
1207 /* compare_time - the comparison function for sorting by total cpu time */
1210 compare_time(void *arg1, void *arg2)
1212 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1213 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1215 ORDERKEY_CPTICKS(p1, p2);
1216 ORDERKEY_PCTCPU(p1, p2);
1217 ORDERKEY_STATE(p1, p2);
1218 ORDERKEY_PRIO(p1, p2);
1219 ORDERKEY_RSSIZE(p1, p2);
1220 ORDERKEY_MEM(p1, p2);
1225 /* compare_prio - the comparison function for sorting by priority */
1228 compare_prio(void *arg1, void *arg2)
1230 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1231 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1233 ORDERKEY_PRIO(p1, p2);
1234 ORDERKEY_CPTICKS(p1, p2);
1235 ORDERKEY_PCTCPU(p1, p2);
1236 ORDERKEY_STATE(p1, p2);
1237 ORDERKEY_RSSIZE(p1, p2);
1238 ORDERKEY_MEM(p1, p2);
1243 /* compare_threads - the comparison function for sorting by threads */
1245 compare_threads(void *arg1, void *arg2)
1247 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1248 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1250 ORDERKEY_THREADS(p1, p2);
1251 ORDERKEY_PCTCPU(p1, p2);
1252 ORDERKEY_CPTICKS(p1, p2);
1253 ORDERKEY_STATE(p1, p2);
1254 ORDERKEY_PRIO(p1, p2);
1255 ORDERKEY_RSSIZE(p1, p2);
1256 ORDERKEY_MEM(p1, p2);
1261 /* compare_jid - the comparison function for sorting by jid */
1263 compare_jid(const void *arg1, const void *arg2)
1265 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1266 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1268 ORDERKEY_JID(p1, p2);
1269 ORDERKEY_PCTCPU(p1, p2);
1270 ORDERKEY_CPTICKS(p1, p2);
1271 ORDERKEY_STATE(p1, p2);
1272 ORDERKEY_PRIO(p1, p2);
1273 ORDERKEY_RSSIZE(p1, p2);
1274 ORDERKEY_MEM(p1, p2);
1280 /* assorted comparison functions for sorting by i/o */
1284 compare_iototal(void *arg1, void *arg2)
1286 io_compare(void *arg1, void *arg2)
1289 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1290 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1292 return (get_io_total(p2) - get_io_total(p1));
1297 compare_ioread(void *arg1, void *arg2)
1299 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1300 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1301 long dummy, inp1, inp2;
1303 (void) get_io_stats(p1, &inp1, &dummy, &dummy, &dummy, &dummy);
1304 (void) get_io_stats(p2, &inp2, &dummy, &dummy, &dummy, &dummy);
1306 return (inp2 - inp1);
1310 compare_iowrite(void *arg1, void *arg2)
1312 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1313 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1314 long dummy, oup1, oup2;
1316 (void) get_io_stats(p1, &dummy, &oup1, &dummy, &dummy, &dummy);
1317 (void) get_io_stats(p2, &dummy, &oup2, &dummy, &dummy, &dummy);
1319 return (oup2 - oup1);
1323 compare_iofault(void *arg1, void *arg2)
1325 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1326 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1327 long dummy, flp1, flp2;
1329 (void) get_io_stats(p1, &dummy, &dummy, &flp1, &dummy, &dummy);
1330 (void) get_io_stats(p2, &dummy, &dummy, &flp2, &dummy, &dummy);
1332 return (flp2 - flp1);
1336 compare_vcsw(void *arg1, void *arg2)
1338 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1339 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1340 long dummy, flp1, flp2;
1342 (void) get_io_stats(p1, &dummy, &dummy, &dummy, &flp1, &dummy);
1343 (void) get_io_stats(p2, &dummy, &dummy, &dummy, &flp2, &dummy);
1345 return (flp2 - flp1);
1349 compare_ivcsw(void *arg1, void *arg2)
1351 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1352 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1353 long dummy, flp1, flp2;
1355 (void) get_io_stats(p1, &dummy, &dummy, &dummy, &dummy, &flp1);
1356 (void) get_io_stats(p2, &dummy, &dummy, &dummy, &dummy, &flp2);
1358 return (flp2 - flp1);
1363 * proc_owner(pid) - returns the uid that owns process "pid", or -1 if
1364 * the process does not exist.
1365 * It is EXTREMLY IMPORTANT that this function work correctly.
1366 * If top runs setuid root (as in SVR4), then this function
1367 * is the only thing that stands in the way of a serious
1368 * security problem. It validates requests for the "kill"
1369 * and "renice" commands.
1376 struct kinfo_proc **prefp;
1377 struct kinfo_proc *pp;
1381 while (--cnt >= 0) {
1383 if (pp->ki_pid == (pid_t)pid)
1384 return ((int)pp->ki_ruid);
1390 swapmode(int *retavail, int *retfree)
1393 int pagesize = getpagesize();
1394 struct kvm_swap swapary[1];
1399 #define CONVERT(v) ((quad_t)(v) * pagesize / 1024)
1401 n = kvm_getswapinfo(kd, swapary, 1, 0);
1402 if (n < 0 || swapary[0].ksw_total == 0)
1405 *retavail = CONVERT(swapary[0].ksw_total);
1406 *retfree = CONVERT(swapary[0].ksw_total - swapary[0].ksw_used);
1408 n = (int)(swapary[0].ksw_used * 100.0 / swapary[0].ksw_total);