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>
57 #define GETSYSCTL(name, var) getsysctl(name, &(var), sizeof(var))
58 #define SMPUNAMELEN 13
61 extern struct process_select ps;
62 extern char* printable(char *);
64 enum displaymodes displaymode;
65 #ifdef TOP_USERNAME_LEN
66 static int namelength = TOP_USERNAME_LEN;
68 static int namelength = 8;
70 static int cmdlengthdelta;
72 /* Prototypes for top internals */
75 /* get_process_info passes back a handle. This is what it looks like: */
78 struct kinfo_proc **next_proc; /* points to next valid proc pointer */
79 int remaining; /* number of pointers remaining */
82 /* declarations for load_avg */
85 /* define what weighted cpu is. */
86 #define weighted_cpu(pct, pp) ((pp)->ki_swtime == 0 ? 0.0 : \
87 ((pct) / (1.0 - exp((pp)->ki_swtime * logcpu))))
89 /* what we consider to be process size: */
90 #define PROCSIZE(pp) ((pp)->ki_size / 1024)
92 #define RU(pp) (&(pp)->ki_rusage)
94 (RU(pp)->ru_inblock + RU(pp)->ru_oublock + RU(pp)->ru_majflt)
97 /* definitions for indices in the nlist array */
100 * These definitions control the format of the per-process area
103 static char io_header[] =
104 " PID%s %-*.*s VCSW IVCSW READ WRITE FAULT TOTAL PERCENT COMMAND";
106 #define io_Proc_format \
107 "%5d%s %-*.*s %6ld %6ld %6ld %6ld %6ld %6ld %6.2f%% %.*s"
109 static char smp_header_thr[] =
110 " PID%s %-*.*s THR PRI NICE SIZE RES STATE C TIME %6s COMMAND";
111 static char smp_header[] =
112 " PID%s %-*.*s " "PRI NICE SIZE RES STATE C TIME %6s COMMAND";
114 #define smp_Proc_format \
115 "%5d%s %-*.*s %s%3d %4s%7s %6s %-6.6s %2d%7s %5.2f%% %.*s"
117 static char up_header_thr[] =
118 " PID%s %-*.*s THR PRI NICE SIZE RES STATE TIME %6s COMMAND";
119 static char up_header[] =
120 " PID%s %-*.*s " "PRI NICE SIZE RES STATE TIME %6s COMMAND";
122 #define up_Proc_format \
123 "%5d%s %-*.*s %s%3d %4s%7s %6s %-6.6s%.0d%7s %5.2f%% %.*s"
126 /* process state names for the "STATE" column of the display */
127 /* the extra nulls in the string "run" are for adding a slash and
128 the processor number when needed */
130 char *state_abbrev[] = {
131 "", "START", "RUN\0\0\0", "SLEEP", "STOP", "ZOMB", "WAIT", "LOCK"
137 /* values that we stash away in _init and use in later routines */
139 static double logcpu;
141 /* these are retrieved from the kernel in _init */
143 static load_avg ccpu;
145 /* these are used in the get_ functions */
149 /* these are for calculating cpu state percentages */
151 static long cp_time[CPUSTATES];
152 static long cp_old[CPUSTATES];
153 static long cp_diff[CPUSTATES];
155 /* these are for detailing the process states */
157 int process_states[8];
158 char *procstatenames[] = {
159 "", " starting, ", " running, ", " sleeping, ", " stopped, ",
160 " zombie, ", " waiting, ", " lock, ",
164 /* these are for detailing the cpu states */
166 int cpu_states[CPUSTATES];
167 char *cpustatenames[] = {
168 "user", "nice", "system", "interrupt", "idle", NULL
171 /* these are for detailing the memory statistics */
174 char *memorynames[] = {
175 "K Active, ", "K Inact, ", "K Wired, ", "K Cache, ", "K Buf, ",
180 char *swapnames[] = {
181 "K Total, ", "K Used, ", "K Free, ", "% Inuse, ", "K In, ", "K Out",
186 /* these are for keeping track of the proc array */
189 static int onproc = -1;
191 static struct kinfo_proc *pbase;
192 static struct kinfo_proc **pref;
193 static struct kinfo_proc *previous_procs;
194 static struct kinfo_proc **previous_pref;
195 static int previous_proc_count = 0;
196 static int previous_proc_count_max = 0;
198 /* total number of io operations */
199 static long total_inblock;
200 static long total_oublock;
201 static long total_majflt;
203 /* these are for getting the memory statistics */
205 static int pageshift; /* log base 2 of the pagesize */
207 /* define pagetok in terms of pageshift */
209 #define pagetok(size) ((size) << pageshift)
211 /* useful externals */
216 * Sorting orders. The first element is the default.
218 char *ordernames[] = {
219 "cpu", "size", "res", "time", "pri", "threads",
220 "total", "read", "write", "fault", "vcsw", "ivcsw",
225 /* Per-cpu time states */
229 static u_long cpumask;
231 static long *pcpu_cp_time;
232 static long *pcpu_cp_old;
233 static long *pcpu_cp_diff;
234 static int *pcpu_cpu_states;
236 static int compare_jid(const void *a, const void *b);
237 static int compare_pid(const void *a, const void *b);
238 static int compare_tid(const void *a, const void *b);
239 static const char *format_nice(const struct kinfo_proc *pp);
240 static void getsysctl(const char *name, void *ptr, size_t len);
241 static int swapmode(int *retavail, int *retfree);
244 toggle_pcpustats(void)
250 /* Adjust display based on ncpus */
252 y_mem += ncpus - 1; /* 3 */
253 y_swap += ncpus - 1; /* 4 */
254 y_idlecursor += ncpus - 1; /* 5 */
255 y_message += ncpus - 1; /* 5 */
256 y_header += ncpus - 1; /* 6 */
257 y_procs += ncpus - 1; /* 7 */
258 Header_lines += ncpus - 1; /* 7 */
271 machine_init(struct statics *statics, char do_unames)
273 int i, j, empty, pagesize;
277 size = sizeof(smpmode);
278 if ((sysctlbyname("machdep.smp_active", &smpmode, &size,
280 sysctlbyname("kern.smp.active", &smpmode, &size,
282 size != sizeof(smpmode))
286 while ((pw = getpwent()) != NULL) {
287 if (strlen(pw->pw_name) > namelength)
288 namelength = strlen(pw->pw_name);
291 if (smpmode && namelength > SMPUNAMELEN)
292 namelength = SMPUNAMELEN;
293 else if (namelength > UPUNAMELEN)
294 namelength = UPUNAMELEN;
296 kd = kvm_open(NULL, _PATH_DEVNULL, NULL, O_RDONLY, "kvm_open");
300 GETSYSCTL("kern.ccpu", ccpu);
302 /* this is used in calculating WCPU -- calculate it ahead of time */
303 logcpu = log(loaddouble(ccpu));
310 /* get the page size and calculate pageshift from it */
311 pagesize = getpagesize();
313 while (pagesize > 1) {
318 /* we only need the amount of log(2)1024 for our conversion */
319 pageshift -= LOG1024;
321 /* fill in the statics information */
322 statics->procstate_names = procstatenames;
323 statics->cpustate_names = cpustatenames;
324 statics->memory_names = memorynames;
325 statics->swap_names = swapnames;
327 statics->order_names = ordernames;
330 /* Allocate state for per-CPU stats. */
333 GETSYSCTL("kern.smp.maxcpus", maxcpu);
334 size = sizeof(long) * maxcpu * CPUSTATES;
335 times = malloc(size);
337 err(1, "malloc %zd bytes", size);
338 if (sysctlbyname("kern.cp_times", times, &size, NULL, 0) == -1)
339 err(1, "sysctlbyname kern.cp_times");
340 pcpu_cp_time = calloc(1, size);
341 maxid = (size / CPUSTATES / sizeof(long)) - 1;
342 for (i = 0; i <= maxid; i++) {
344 for (j = 0; empty && j < CPUSTATES; j++) {
345 if (times[i * CPUSTATES + j] != 0)
349 cpumask |= (1ul << i);
353 size = sizeof(long) * ncpus * CPUSTATES;
354 pcpu_cp_old = calloc(1, size);
355 pcpu_cp_diff = calloc(1, size);
356 pcpu_cpu_states = calloc(1, size);
357 statics->ncpus = ncpus;
367 format_header(char *uname_field)
369 static char Header[128];
372 switch (displaymode) {
375 * The logic of picking the right header format seems reverse
376 * here because we only want to display a THR column when
377 * "thread mode" is off (and threads are not listed as
381 (ps.thread ? smp_header : smp_header_thr) :
382 (ps.thread ? up_header : up_header_thr);
383 snprintf(Header, sizeof(Header), prehead,
384 ps.jail ? " JID" : "",
385 namelength, namelength, uname_field,
386 ps.wcpu ? "WCPU" : "CPU");
390 snprintf(Header, sizeof(Header), prehead,
391 ps.jail ? " JID" : "",
392 namelength, namelength, uname_field);
395 cmdlengthdelta = strlen(Header) - 7;
399 static int swappgsin = -1;
400 static int swappgsout = -1;
401 extern struct timeval timeout;
405 get_system_info(struct system_info *si)
408 struct loadavg sysload;
410 struct timeval boottime;
415 /* get the CPU stats */
416 size = (maxid + 1) * CPUSTATES * sizeof(long);
417 if (sysctlbyname("kern.cp_times", pcpu_cp_time, &size, NULL, 0) == -1)
418 err(1, "sysctlbyname kern.cp_times");
419 GETSYSCTL("kern.cp_time", cp_time);
420 GETSYSCTL("vm.loadavg", sysload);
421 GETSYSCTL("kern.lastpid", lastpid);
423 /* convert load averages to doubles */
424 for (i = 0; i < 3; i++)
425 si->load_avg[i] = (double)sysload.ldavg[i] / sysload.fscale;
427 /* convert cp_time counts to percentages */
428 for (i = j = 0; i <= maxid; i++) {
429 if ((cpumask & (1ul << i)) == 0)
431 percentages(CPUSTATES, &pcpu_cpu_states[j * CPUSTATES],
432 &pcpu_cp_time[j * CPUSTATES],
433 &pcpu_cp_old[j * CPUSTATES],
434 &pcpu_cp_diff[j * CPUSTATES]);
437 percentages(CPUSTATES, cpu_states, cp_time, cp_old, cp_diff);
439 /* sum memory & swap statistics */
441 static unsigned int swap_delay = 0;
442 static int swapavail = 0;
443 static int swapfree = 0;
444 static long bufspace = 0;
445 static int nspgsin, nspgsout;
447 GETSYSCTL("vfs.bufspace", bufspace);
448 GETSYSCTL("vm.stats.vm.v_active_count", memory_stats[0]);
449 GETSYSCTL("vm.stats.vm.v_inactive_count", memory_stats[1]);
450 GETSYSCTL("vm.stats.vm.v_wire_count", memory_stats[2]);
451 GETSYSCTL("vm.stats.vm.v_cache_count", memory_stats[3]);
452 GETSYSCTL("vm.stats.vm.v_free_count", memory_stats[5]);
453 GETSYSCTL("vm.stats.vm.v_swappgsin", nspgsin);
454 GETSYSCTL("vm.stats.vm.v_swappgsout", nspgsout);
455 /* convert memory stats to Kbytes */
456 memory_stats[0] = pagetok(memory_stats[0]);
457 memory_stats[1] = pagetok(memory_stats[1]);
458 memory_stats[2] = pagetok(memory_stats[2]);
459 memory_stats[3] = pagetok(memory_stats[3]);
460 memory_stats[4] = bufspace / 1024;
461 memory_stats[5] = pagetok(memory_stats[5]);
462 memory_stats[6] = -1;
470 /* compute differences between old and new swap statistic */
472 swap_stats[4] = pagetok(((nspgsin - swappgsin)));
473 swap_stats[5] = pagetok(((nspgsout - swappgsout)));
477 swappgsout = nspgsout;
479 /* call CPU heavy swapmode() only for changes */
480 if (swap_stats[4] > 0 || swap_stats[5] > 0 || swap_delay == 0) {
481 swap_stats[3] = swapmode(&swapavail, &swapfree);
482 swap_stats[0] = swapavail;
483 swap_stats[1] = swapavail - swapfree;
484 swap_stats[2] = swapfree;
490 /* set arrays and strings */
492 si->cpustates = pcpu_cpu_states;
495 si->cpustates = cpu_states;
498 si->memory = memory_stats;
499 si->swap = swap_stats;
503 si->last_pid = lastpid;
509 * Print how long system has been up.
510 * (Found by looking getting "boottime" from the kernel)
513 mib[1] = KERN_BOOTTIME;
514 bt_size = sizeof(boottime);
515 if (sysctl(mib, 2, &boottime, &bt_size, NULL, 0) != -1 &&
516 boottime.tv_sec != 0) {
517 si->boottime = boottime;
519 si->boottime.tv_sec = -1;
523 #define NOPROC ((void *)-1)
526 * We need to compare data from the old process entry with the new
528 * To facilitate doing this quickly we stash a pointer in the kinfo_proc
529 * structure to cache the mapping. We also use a negative cache pointer
530 * of NOPROC to avoid duplicate lookups.
531 * XXX: this could be done when the actual processes are fetched, we do
532 * it here out of laziness.
534 const struct kinfo_proc *
535 get_old_proc(struct kinfo_proc *pp)
537 struct kinfo_proc **oldpp, *oldp;
540 * If this is the first fetch of the kinfo_procs then we don't have
541 * any previous entries.
543 if (previous_proc_count == 0)
545 /* negative cache? */
546 if (pp->ki_udata == NOPROC)
549 if (pp->ki_udata != NULL)
550 return (pp->ki_udata);
553 * 1) look up based on pid.
554 * 2) compare process start.
555 * If we fail here, then setup a negative cache entry, otherwise
558 oldpp = bsearch(&pp, previous_pref, previous_proc_count,
559 sizeof(*previous_pref), ps.thread ? compare_tid : compare_pid);
561 pp->ki_udata = NOPROC;
565 if (bcmp(&oldp->ki_start, &pp->ki_start, sizeof(pp->ki_start)) != 0) {
566 pp->ki_udata = NOPROC;
574 * Return the total amount of IO done in blocks in/out and faults.
575 * store the values individually in the pointers passed in.
578 get_io_stats(struct kinfo_proc *pp, long *inp, long *oup, long *flp,
579 long *vcsw, long *ivcsw)
581 const struct kinfo_proc *oldp;
582 static struct kinfo_proc dummy;
585 oldp = get_old_proc(pp);
587 bzero(&dummy, sizeof(dummy));
590 *inp = RU(pp)->ru_inblock - RU(oldp)->ru_inblock;
591 *oup = RU(pp)->ru_oublock - RU(oldp)->ru_oublock;
592 *flp = RU(pp)->ru_majflt - RU(oldp)->ru_majflt;
593 *vcsw = RU(pp)->ru_nvcsw - RU(oldp)->ru_nvcsw;
594 *ivcsw = RU(pp)->ru_nivcsw - RU(oldp)->ru_nivcsw;
596 (RU(pp)->ru_inblock - RU(oldp)->ru_inblock) +
597 (RU(pp)->ru_oublock - RU(oldp)->ru_oublock) +
598 (RU(pp)->ru_majflt - RU(oldp)->ru_majflt);
603 * Return the total number of block in/out and faults by a process.
606 get_io_total(struct kinfo_proc *pp)
610 return (get_io_stats(pp, &dummy, &dummy, &dummy, &dummy, &dummy));
613 static struct handle handle;
616 get_process_info(struct system_info *si, struct process_select *sel,
617 int (*compare)(const void *, const void *))
622 long p_inblock, p_oublock, p_majflt, p_vcsw, p_ivcsw;
624 struct kinfo_proc **prefp;
625 struct kinfo_proc *pp;
627 /* these are copied out of sel for speed */
636 * Save the previous process info.
638 if (previous_proc_count_max < nproc) {
639 free(previous_procs);
640 previous_procs = malloc(nproc * sizeof(*previous_procs));
642 previous_pref = malloc(nproc * sizeof(*previous_pref));
643 if (previous_procs == NULL || previous_pref == NULL) {
644 (void) fprintf(stderr, "top: Out of memory.\n");
647 previous_proc_count_max = nproc;
650 for (i = 0; i < nproc; i++)
651 previous_pref[i] = &previous_procs[i];
652 bcopy(pbase, previous_procs, nproc * sizeof(*previous_procs));
653 qsort(previous_pref, nproc, sizeof(*previous_pref),
654 ps.thread ? compare_tid : compare_pid);
656 previous_proc_count = nproc;
658 pbase = kvm_getprocs(kd, sel->thread ? KERN_PROC_ALL : KERN_PROC_PROC,
661 pref = realloc(pref, sizeof(*pref) * (onproc = nproc));
662 if (pref == NULL || pbase == NULL) {
663 (void) fprintf(stderr, "top: Out of memory.\n");
666 /* get a pointer to the states summary array */
667 si->procstates = process_states;
669 /* set up flags which define what we are going to select */
670 show_idle = sel->idle;
671 show_self = sel->self == -1;
672 show_system = sel->system;
673 show_uid = sel->uid != -1;
674 show_command = sel->command != NULL;
675 show_kidle = sel->kidle;
677 /* count up process states and get pointers to interesting procs */
683 memset((char *)process_states, 0, sizeof(process_states));
685 for (pp = pbase, i = 0; i < nproc; pp++, i++) {
687 if (pp->ki_stat == 0)
691 if (!show_self && pp->ki_pid == sel->self)
695 if (!show_system && (pp->ki_flag & P_SYSTEM))
696 /* skip system process */
699 p_io = get_io_stats(pp, &p_inblock, &p_oublock, &p_majflt,
701 total_inblock += p_inblock;
702 total_oublock += p_oublock;
703 total_majflt += p_majflt;
705 process_states[pp->ki_stat]++;
707 if (pp->ki_stat == SZOMB)
711 if (!show_kidle && pp->ki_tdflags & TDF_IDLETD)
712 /* skip kernel idle process */
715 if (displaymode == DISP_CPU && !show_idle &&
716 (pp->ki_pctcpu == 0 ||
717 pp->ki_stat == SSTOP || pp->ki_stat == SIDL))
718 /* skip idle or non-running processes */
721 if (displaymode == DISP_IO && !show_idle && p_io == 0)
722 /* skip processes that aren't doing I/O */
725 if (show_uid && pp->ki_ruid != (uid_t)sel->uid)
726 /* skip proc. that don't belong to the selected UID */
733 /* if requested, sort the "interesting" processes */
735 qsort(pref, active_procs, sizeof(*pref), compare);
737 /* remember active and total counts */
738 si->p_total = total_procs;
739 si->p_active = pref_len = active_procs;
741 /* pass back a handle */
742 handle.next_proc = pref;
743 handle.remaining = active_procs;
744 return ((caddr_t)&handle);
747 static char fmt[128]; /* static area where result is built */
750 format_next_process(caddr_t handle, char *(*get_userid)(int), int flags)
752 struct kinfo_proc *pp;
753 const struct kinfo_proc *oldp;
759 struct rusage ru, *rup;
761 char *proc_fmt, thr_buf[6], jid_buf[6];
765 /* find and remember the next proc structure */
766 hp = (struct handle *)handle;
767 pp = *(hp->next_proc++);
770 /* get the process's command name */
771 if ((pp->ki_flag & P_INMEM) == 0) {
773 * Print swapped processes as <pname>
777 len = strlen(pp->ki_comm);
778 if (len > sizeof(pp->ki_comm) - 3)
779 len = sizeof(pp->ki_comm) - 3;
780 memmove(pp->ki_comm + 1, pp->ki_comm, len);
781 pp->ki_comm[0] = '<';
782 pp->ki_comm[len + 1] = '>';
783 pp->ki_comm[len + 2] = '\0';
787 * Convert the process's runtime from microseconds to seconds. This
788 * time includes the interrupt time although that is not wanted here.
789 * ps(1) is similarly sloppy.
791 cputime = (pp->ki_runtime + 500000) / 1000000;
793 /* calculate the base for cpu percentages */
794 pct = pctdouble(pp->ki_pctcpu);
796 /* generate "STATE" field */
797 switch (state = pp->ki_stat) {
799 if (smpmode && pp->ki_oncpu != 0xff)
800 sprintf(status, "CPU%d", pp->ki_oncpu);
802 strcpy(status, "RUN");
805 if (pp->ki_kiflag & KI_LOCKBLOCK) {
806 sprintf(status, "*%.6s", pp->ki_lockname);
811 if (pp->ki_wmesg != NULL) {
812 sprintf(status, "%.6s", pp->ki_wmesg);
819 state < sizeof(state_abbrev) / sizeof(*state_abbrev))
820 sprintf(status, "%.6s", state_abbrev[state]);
822 sprintf(status, "?%5d", state);
826 cmdbuf = (char *)malloc(cmdlengthdelta + 1);
827 if (cmdbuf == NULL) {
828 warn("malloc(%d)", cmdlengthdelta + 1);
832 if (!(flags & FMT_SHOWARGS)) {
833 if (ps.thread && pp->ki_flag & P_HADTHREADS &&
835 snprintf(cmdbuf, cmdlengthdelta, "%s{%s}", pp->ki_comm,
838 snprintf(cmdbuf, cmdlengthdelta, "%s", pp->ki_comm);
841 if (pp->ki_flag & P_SYSTEM ||
842 pp->ki_args == NULL ||
843 (args = kvm_getargv(kd, pp, cmdlengthdelta)) == NULL ||
845 if (ps.thread && pp->ki_flag & P_HADTHREADS &&
847 snprintf(cmdbuf, cmdlengthdelta,
848 "[%s{%s}]", pp->ki_comm, pp->ki_tdname);
850 snprintf(cmdbuf, cmdlengthdelta,
851 "[%s]", pp->ki_comm);
854 char *src, *dst, *argbuf;
859 argbuflen = cmdlengthdelta * 4;
860 argbuf = (char *)malloc(argbuflen + 1);
861 if (argbuf == NULL) {
862 warn("malloc(%d)", argbuflen + 1);
869 /* Extract cmd name from argv */
870 cmd = strrchr(*args, '/');
876 for (; (src = *args++) != NULL; ) {
879 len = (argbuflen - (dst - argbuf) - 1) / 4;
881 strlen(src) < len ? strlen(src) : len,
882 VIS_NL | VIS_CSTYLE);
885 if ((argbuflen - (dst - argbuf) - 1) / 4 > 0)
886 *dst++ = ' '; /* add delimiting space */
888 if (dst != argbuf && dst[-1] == ' ')
892 if (strcmp(cmd, pp->ki_comm) != 0 ) {
893 if (ps.thread && pp->ki_flag & P_HADTHREADS &&
895 snprintf(cmdbuf, cmdlengthdelta,
896 "%s (%s){%s}", argbuf, pp->ki_comm,
899 snprintf(cmdbuf, cmdlengthdelta,
900 "%s (%s)", argbuf, pp->ki_comm);
902 if (ps.thread && pp->ki_flag & P_HADTHREADS &&
904 snprintf(cmdbuf, cmdlengthdelta,
905 "%s{%s}", argbuf, pp->ki_tdname);
907 strlcpy(cmdbuf, argbuf, cmdlengthdelta);
916 snprintf(jid_buf, sizeof(jid_buf), " %*d",
917 sizeof(jid_buf) - 3, pp->ki_jid);
919 if (displaymode == DISP_IO) {
920 oldp = get_old_proc(pp);
922 ru.ru_inblock = RU(pp)->ru_inblock -
923 RU(oldp)->ru_inblock;
924 ru.ru_oublock = RU(pp)->ru_oublock -
925 RU(oldp)->ru_oublock;
926 ru.ru_majflt = RU(pp)->ru_majflt - RU(oldp)->ru_majflt;
927 ru.ru_nvcsw = RU(pp)->ru_nvcsw - RU(oldp)->ru_nvcsw;
928 ru.ru_nivcsw = RU(pp)->ru_nivcsw - RU(oldp)->ru_nivcsw;
933 p_tot = rup->ru_inblock + rup->ru_oublock + rup->ru_majflt;
934 s_tot = total_inblock + total_oublock + total_majflt;
936 sprintf(fmt, io_Proc_format,
939 namelength, namelength, (*get_userid)(pp->ki_ruid),
946 s_tot == 0 ? 0.0 : (p_tot * 100.0 / s_tot),
947 screen_width > cmdlengthdelta ?
948 screen_width - cmdlengthdelta : 0,
956 /* format this entry */
957 proc_fmt = smpmode ? smp_Proc_format : up_Proc_format;
961 snprintf(thr_buf, sizeof(thr_buf), "%*d ",
962 sizeof(thr_buf) - 2, pp->ki_numthreads);
964 sprintf(fmt, proc_fmt,
967 namelength, namelength, (*get_userid)(pp->ki_ruid),
969 pp->ki_pri.pri_level - PZERO,
971 format_k2(PROCSIZE(pp)),
972 format_k2(pagetok(pp->ki_rssize)),
974 smpmode ? pp->ki_lastcpu : 0,
975 format_time(cputime),
976 ps.wcpu ? 100.0 * weighted_cpu(pct, pp) : 100.0 * pct,
977 screen_width > cmdlengthdelta ? screen_width - cmdlengthdelta : 0,
982 /* return the result */
987 getsysctl(const char *name, void *ptr, size_t len)
991 if (sysctlbyname(name, ptr, &nlen, NULL, 0) == -1) {
992 fprintf(stderr, "top: sysctl(%s...) failed: %s\n", name,
997 fprintf(stderr, "top: sysctl(%s...) expected %lu, got %lu\n",
998 name, (unsigned long)len, (unsigned long)nlen);
1004 format_nice(const struct kinfo_proc *pp)
1006 const char *fifo, *kthread;
1008 static char nicebuf[4 + 1];
1010 fifo = PRI_NEED_RR(pp->ki_pri.pri_class) ? "" : "F";
1011 kthread = (pp->ki_flag & P_KTHREAD) ? "k" : "";
1012 switch (PRI_BASE(pp->ki_pri.pri_class)) {
1017 * XXX: the kernel doesn't tell us the original rtprio and
1018 * doesn't really know what it was, so to recover it we
1019 * must be more chummy with the implementation than the
1020 * implementation is with itself. pri_user gives a
1021 * constant "base" priority, but is only initialized
1022 * properly for user threads. pri_native gives what the
1023 * kernel calls the "base" priority, but it isn't constant
1024 * since it is changed by priority propagation. pri_native
1025 * also isn't properly initialized for all threads, but it
1026 * is properly initialized for kernel realtime and idletime
1027 * threads. Thus we use pri_user for the base priority of
1028 * user threads (it is always correct) and pri_native for
1029 * the base priority of kernel realtime and idletime threads
1030 * (there is nothing better, and it is usually correct).
1032 * The field width and thus the buffer are too small for
1033 * values like "kr31F", but such values shouldn't occur,
1034 * and if they do then the tailing "F" is not displayed.
1036 rtpri = ((pp->ki_flag & P_KTHREAD) ? pp->ki_pri.pri_native :
1037 pp->ki_pri.pri_user) - PRI_MIN_REALTIME;
1038 snprintf(nicebuf, sizeof(nicebuf), "%sr%d%s",
1039 kthread, rtpri, fifo);
1042 if (pp->ki_flag & P_KTHREAD)
1044 snprintf(nicebuf, sizeof(nicebuf), "%d", pp->ki_nice - NZERO);
1047 /* XXX: as above. */
1048 rtpri = ((pp->ki_flag & P_KTHREAD) ? pp->ki_pri.pri_native :
1049 pp->ki_pri.pri_user) - PRI_MIN_IDLE;
1050 snprintf(nicebuf, sizeof(nicebuf), "%si%d%s",
1051 kthread, rtpri, fifo);
1059 /* comparison routines for qsort */
1062 compare_pid(const void *p1, const void *p2)
1064 const struct kinfo_proc * const *pp1 = p1;
1065 const struct kinfo_proc * const *pp2 = p2;
1067 if ((*pp2)->ki_pid < 0 || (*pp1)->ki_pid < 0)
1070 return ((*pp1)->ki_pid - (*pp2)->ki_pid);
1074 compare_tid(const void *p1, const void *p2)
1076 const struct kinfo_proc * const *pp1 = p1;
1077 const struct kinfo_proc * const *pp2 = p2;
1079 if ((*pp2)->ki_tid < 0 || (*pp1)->ki_tid < 0)
1082 return ((*pp1)->ki_tid - (*pp2)->ki_tid);
1086 * proc_compare - comparison function for "qsort"
1087 * Compares the resource consumption of two processes using five
1088 * distinct keys. The keys (in descending order of importance) are:
1089 * percent cpu, cpu ticks, state, resident set size, total virtual
1090 * memory usage. The process states are ordered as follows (from least
1091 * to most important): WAIT, zombie, sleep, stop, start, run. The
1092 * array declaration below maps a process state index into a number
1093 * that reflects this ordering.
1096 static int sorted_state[] = {
1099 1, /* ABANDONED (WAIT) */
1107 #define ORDERKEY_PCTCPU(a, b) do { \
1110 diff = floor(1.0E6 * weighted_cpu(pctdouble((b)->ki_pctcpu), \
1112 floor(1.0E6 * weighted_cpu(pctdouble((a)->ki_pctcpu), \
1115 diff = (long)(b)->ki_pctcpu - (long)(a)->ki_pctcpu; \
1117 return (diff > 0 ? 1 : -1); \
1120 #define ORDERKEY_CPTICKS(a, b) do { \
1121 int64_t diff = (int64_t)(b)->ki_runtime - (int64_t)(a)->ki_runtime; \
1123 return (diff > 0 ? 1 : -1); \
1126 #define ORDERKEY_STATE(a, b) do { \
1127 int diff = sorted_state[(b)->ki_stat] - sorted_state[(a)->ki_stat]; \
1129 return (diff > 0 ? 1 : -1); \
1132 #define ORDERKEY_PRIO(a, b) do { \
1133 int diff = (int)(b)->ki_pri.pri_level - (int)(a)->ki_pri.pri_level; \
1135 return (diff > 0 ? 1 : -1); \
1138 #define ORDERKEY_THREADS(a, b) do { \
1139 int diff = (int)(b)->ki_numthreads - (int)(a)->ki_numthreads; \
1141 return (diff > 0 ? 1 : -1); \
1144 #define ORDERKEY_RSSIZE(a, b) do { \
1145 long diff = (long)(b)->ki_rssize - (long)(a)->ki_rssize; \
1147 return (diff > 0 ? 1 : -1); \
1150 #define ORDERKEY_MEM(a, b) do { \
1151 long diff = (long)PROCSIZE((b)) - (long)PROCSIZE((a)); \
1153 return (diff > 0 ? 1 : -1); \
1156 #define ORDERKEY_JID(a, b) do { \
1157 int diff = (int)(b)->ki_jid - (int)(a)->ki_jid; \
1159 return (diff > 0 ? 1 : -1); \
1162 /* compare_cpu - the comparison function for sorting by cpu percentage */
1166 compare_cpu(void *arg1, void *arg2)
1168 proc_compare(void *arg1, void *arg2)
1171 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1172 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1174 ORDERKEY_PCTCPU(p1, p2);
1175 ORDERKEY_CPTICKS(p1, p2);
1176 ORDERKEY_STATE(p1, p2);
1177 ORDERKEY_PRIO(p1, p2);
1178 ORDERKEY_RSSIZE(p1, p2);
1179 ORDERKEY_MEM(p1, p2);
1185 /* "cpu" compare routines */
1186 int compare_size(), compare_res(), compare_time(), compare_prio(),
1190 * "io" compare routines. Context switches aren't i/o, but are displayed
1191 * on the "io" display.
1193 int compare_iototal(), compare_ioread(), compare_iowrite(), compare_iofault(),
1194 compare_vcsw(), compare_ivcsw();
1196 int (*compares[])() = {
1213 /* compare_size - the comparison function for sorting by total memory usage */
1216 compare_size(void *arg1, void *arg2)
1218 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1219 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1221 ORDERKEY_MEM(p1, p2);
1222 ORDERKEY_RSSIZE(p1, p2);
1223 ORDERKEY_PCTCPU(p1, p2);
1224 ORDERKEY_CPTICKS(p1, p2);
1225 ORDERKEY_STATE(p1, p2);
1226 ORDERKEY_PRIO(p1, p2);
1231 /* compare_res - the comparison function for sorting by resident set size */
1234 compare_res(void *arg1, void *arg2)
1236 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1237 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1239 ORDERKEY_RSSIZE(p1, p2);
1240 ORDERKEY_MEM(p1, p2);
1241 ORDERKEY_PCTCPU(p1, p2);
1242 ORDERKEY_CPTICKS(p1, p2);
1243 ORDERKEY_STATE(p1, p2);
1244 ORDERKEY_PRIO(p1, p2);
1249 /* compare_time - the comparison function for sorting by total cpu time */
1252 compare_time(void *arg1, void *arg2)
1254 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1255 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1257 ORDERKEY_CPTICKS(p1, p2);
1258 ORDERKEY_PCTCPU(p1, p2);
1259 ORDERKEY_STATE(p1, p2);
1260 ORDERKEY_PRIO(p1, p2);
1261 ORDERKEY_RSSIZE(p1, p2);
1262 ORDERKEY_MEM(p1, p2);
1267 /* compare_prio - the comparison function for sorting by priority */
1270 compare_prio(void *arg1, void *arg2)
1272 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1273 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1275 ORDERKEY_PRIO(p1, p2);
1276 ORDERKEY_CPTICKS(p1, p2);
1277 ORDERKEY_PCTCPU(p1, p2);
1278 ORDERKEY_STATE(p1, p2);
1279 ORDERKEY_RSSIZE(p1, p2);
1280 ORDERKEY_MEM(p1, p2);
1285 /* compare_threads - the comparison function for sorting by threads */
1287 compare_threads(void *arg1, void *arg2)
1289 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1290 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1292 ORDERKEY_THREADS(p1, p2);
1293 ORDERKEY_PCTCPU(p1, p2);
1294 ORDERKEY_CPTICKS(p1, p2);
1295 ORDERKEY_STATE(p1, p2);
1296 ORDERKEY_PRIO(p1, p2);
1297 ORDERKEY_RSSIZE(p1, p2);
1298 ORDERKEY_MEM(p1, p2);
1303 /* compare_jid - the comparison function for sorting by jid */
1305 compare_jid(const void *arg1, const void *arg2)
1307 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1308 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1310 ORDERKEY_JID(p1, p2);
1311 ORDERKEY_PCTCPU(p1, p2);
1312 ORDERKEY_CPTICKS(p1, p2);
1313 ORDERKEY_STATE(p1, p2);
1314 ORDERKEY_PRIO(p1, p2);
1315 ORDERKEY_RSSIZE(p1, p2);
1316 ORDERKEY_MEM(p1, p2);
1322 /* assorted comparison functions for sorting by i/o */
1326 compare_iototal(void *arg1, void *arg2)
1328 io_compare(void *arg1, void *arg2)
1331 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1332 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1334 return (get_io_total(p2) - get_io_total(p1));
1339 compare_ioread(void *arg1, void *arg2)
1341 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1342 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1343 long dummy, inp1, inp2;
1345 (void) get_io_stats(p1, &inp1, &dummy, &dummy, &dummy, &dummy);
1346 (void) get_io_stats(p2, &inp2, &dummy, &dummy, &dummy, &dummy);
1348 return (inp2 - inp1);
1352 compare_iowrite(void *arg1, void *arg2)
1354 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1355 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1356 long dummy, oup1, oup2;
1358 (void) get_io_stats(p1, &dummy, &oup1, &dummy, &dummy, &dummy);
1359 (void) get_io_stats(p2, &dummy, &oup2, &dummy, &dummy, &dummy);
1361 return (oup2 - oup1);
1365 compare_iofault(void *arg1, void *arg2)
1367 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1368 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1369 long dummy, flp1, flp2;
1371 (void) get_io_stats(p1, &dummy, &dummy, &flp1, &dummy, &dummy);
1372 (void) get_io_stats(p2, &dummy, &dummy, &flp2, &dummy, &dummy);
1374 return (flp2 - flp1);
1378 compare_vcsw(void *arg1, void *arg2)
1380 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1381 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1382 long dummy, flp1, flp2;
1384 (void) get_io_stats(p1, &dummy, &dummy, &dummy, &flp1, &dummy);
1385 (void) get_io_stats(p2, &dummy, &dummy, &dummy, &flp2, &dummy);
1387 return (flp2 - flp1);
1391 compare_ivcsw(void *arg1, void *arg2)
1393 struct kinfo_proc *p1 = *(struct kinfo_proc **)arg1;
1394 struct kinfo_proc *p2 = *(struct kinfo_proc **)arg2;
1395 long dummy, flp1, flp2;
1397 (void) get_io_stats(p1, &dummy, &dummy, &dummy, &dummy, &flp1);
1398 (void) get_io_stats(p2, &dummy, &dummy, &dummy, &dummy, &flp2);
1400 return (flp2 - flp1);
1405 * proc_owner(pid) - returns the uid that owns process "pid", or -1 if
1406 * the process does not exist.
1407 * It is EXTREMLY IMPORTANT that this function work correctly.
1408 * If top runs setuid root (as in SVR4), then this function
1409 * is the only thing that stands in the way of a serious
1410 * security problem. It validates requests for the "kill"
1411 * and "renice" commands.
1418 struct kinfo_proc **prefp;
1419 struct kinfo_proc *pp;
1423 while (--cnt >= 0) {
1425 if (pp->ki_pid == (pid_t)pid)
1426 return ((int)pp->ki_ruid);
1432 swapmode(int *retavail, int *retfree)
1435 int pagesize = getpagesize();
1436 struct kvm_swap swapary[1];
1441 #define CONVERT(v) ((quad_t)(v) * pagesize / 1024)
1443 n = kvm_getswapinfo(kd, swapary, 1, 0);
1444 if (n < 0 || swapary[0].ksw_total == 0)
1447 *retavail = CONVERT(swapary[0].ksw_total);
1448 *retfree = CONVERT(swapary[0].ksw_total - swapary[0].ksw_used);
1450 n = (int)(swapary[0].ksw_used * 100.0 / swapary[0].ksw_total);