2 * top - a top users display for Unix
5 * Originally written for BSD4.4 system by Christos Zoulas.
6 * Ported to FreeBSD 2.x by Steven Wallace && Wolfram Schneider
7 * Order support hacked in from top-3.5beta6/machine/m_aix41.c
8 * by Monte Mitzelfelt (for latest top see http://www.groupsys.com/topinfo/)
10 * AUTHOR: Christos Zoulas <christos@ee.cornell.edu>
11 * Steven Wallace <swallace@FreeBSD.org>
12 * Wolfram Schneider <wosch@FreeBSD.org>
13 * Thomas Moestl <tmoestl@gmx.net>
14 * Eitan Adler <eadler@FreeBSD.org>
19 #include <sys/errno.h>
20 #include <sys/fcntl.h>
21 #include <sys/param.h>
22 #include <sys/priority.h>
24 #include <sys/resource.h>
26 #include <sys/sysctl.h>
53 #define GETSYSCTL(name, var) getsysctl(name, &(var), sizeof(var))
55 extern struct timeval timeout;
57 enum displaymodes displaymode;
58 static const int namelength = 10;
59 /* TOP_JID_LEN based on max of 999999 */
61 #define TOP_SWAP_LEN 5
63 /* get_process_info passes back a handle. This is what it looks like: */
66 struct kinfo_proc **next_proc; /* points to next valid proc pointer */
67 int remaining; /* number of pointers remaining */
71 /* define what weighted cpu is. */
72 #define weighted_cpu(pct, pp) ((pp)->ki_swtime == 0 ? 0.0 : \
73 ((pct) / (1.0 - exp((pp)->ki_swtime * logcpu))))
75 /* what we consider to be process size: */
76 #define PROCSIZE(pp) ((pp)->ki_size / 1024)
78 #define RU(pp) (&(pp)->ki_rusage)
80 #define PCTCPU(pp) (pcpu[pp - pbase])
82 /* process state names for the "STATE" column of the display */
83 /* the extra nulls in the string "run" are for adding a slash and
84 the processor number when needed */
86 static const char *state_abbrev[] = {
87 "", "START", "RUN\0\0\0", "SLEEP", "STOP", "ZOMB", "WAIT", "LOCK"
93 /* values that we stash away in _init and use in later routines */
97 /* these are retrieved from the kernel in _init */
101 /* these are used in the get_ functions */
105 /* these are for calculating cpu state percentages */
107 static long cp_time[CPUSTATES];
108 static long cp_old[CPUSTATES];
109 static long cp_diff[CPUSTATES];
111 /* these are for detailing the process states */
113 static const char *procstatenames[] = {
114 "", " starting, ", " running, ", " sleeping, ", " stopped, ",
115 " zombie, ", " waiting, ", " lock, ",
118 static int process_states[nitems(procstatenames)];
120 /* these are for detailing the cpu states */
122 static int cpu_states[CPUSTATES];
123 static const char *cpustatenames[] = {
124 "user", "nice", "system", "interrupt", "idle", NULL
127 /* these are for detailing the memory statistics */
129 static const char *memorynames[] = {
130 "K Active, ", "K Inact, ", "K Laundry, ", "K Wired, ", "K Buf, ",
133 static int memory_stats[nitems(memorynames)];
135 static const char *arcnames[] = {
136 "K Total, ", "K MFU, ", "K MRU, ", "K Anon, ", "K Header, ", "K Other",
139 static int arc_stats[nitems(arcnames)];
141 static const char *carcnames[] = {
142 "K Compressed, ", "K Uncompressed, ", ":1 Ratio, ",
145 static int carc_stats[nitems(carcnames)];
147 static const char *swapnames[] = {
148 "K Total, ", "K Used, ", "K Free, ", "% Inuse, ", "K In, ", "K Out",
151 static int swap_stats[nitems(swapnames)];
154 /* these are for keeping track of the proc array */
157 static int onproc = -1;
159 static struct kinfo_proc *pbase;
160 static struct kinfo_proc **pref;
161 static struct kinfo_proc *previous_procs;
162 static struct kinfo_proc **previous_pref;
163 static int previous_proc_count = 0;
164 static int previous_proc_count_max = 0;
165 static int previous_thread;
167 /* data used for recalculating pctcpu */
169 static struct timespec proc_uptime;
170 static struct timeval proc_wall_time;
171 static struct timeval previous_wall_time;
172 static uint64_t previous_interval = 0;
174 /* total number of io operations */
175 static long total_inblock;
176 static long total_oublock;
177 static long total_majflt;
179 /* these are for getting the memory statistics */
181 static int arc_enabled;
182 static int carc_enabled;
183 static int pageshift; /* log base 2 of the pagesize */
185 /* define pagetok in terms of pageshift */
187 #define pagetok(size) ((size) << pageshift)
190 #define ki_swap(kip) \
191 ((kip)->ki_swrss > (kip)->ki_rssize ? (kip)->ki_swrss - (kip)->ki_rssize : 0)
194 * Sorting orders. The first element is the default.
196 static const char *ordernames[] = {
197 "cpu", "size", "res", "time", "pri", "threads",
198 "total", "read", "write", "fault", "vcsw", "ivcsw",
199 "jid", "swap", "pid", NULL
202 /* Per-cpu time states */
206 static unsigned long cpumask;
208 static long *pcpu_cp_time;
209 static long *pcpu_cp_old;
210 static long *pcpu_cp_diff;
211 static int *pcpu_cpu_states;
213 static int compare_swap(const void *a, const void *b);
214 static int compare_jid(const void *a, const void *b);
215 static int compare_pid(const void *a, const void *b);
216 static int compare_tid(const void *a, const void *b);
217 static const char *format_nice(const struct kinfo_proc *pp);
218 static void getsysctl(const char *name, void *ptr, size_t len);
219 static int swapmode(int *retavail, int *retfree);
220 static void update_layout(void);
221 static int find_uid(uid_t needle, int *haystack);
224 find_uid(uid_t needle, int *haystack)
228 for (; i < TOP_MAX_UIDS; ++i)
229 if ((uid_t)haystack[i] == needle)
235 toggle_pcpustats(void)
243 /* Adjust display based on ncpus and the ARC state. */
251 y_swap = 4 + arc_enabled + carc_enabled;
252 y_idlecursor = 5 + arc_enabled + carc_enabled;
253 y_message = 5 + arc_enabled + carc_enabled;
254 y_header = 6 + arc_enabled + carc_enabled;
255 y_procs = 7 + arc_enabled + carc_enabled;
256 Header_lines = 7 + arc_enabled + carc_enabled;
263 y_idlecursor += ncpus - 1;
264 y_message += ncpus - 1;
265 y_header += ncpus - 1;
266 y_procs += ncpus - 1;
267 Header_lines += ncpus - 1;
272 machine_init(struct statics *statics)
274 int i, j, empty, pagesize;
279 size = sizeof(smpmode);
280 if ((sysctlbyname("machdep.smp_active", &smpmode, &size,
282 sysctlbyname("kern.smp.active", &smpmode, &size,
284 size != sizeof(smpmode))
287 size = sizeof(arc_size);
288 if (sysctlbyname("kstat.zfs.misc.arcstats.size", &arc_size, &size,
289 NULL, 0) == 0 && arc_size != 0)
291 size = sizeof(carc_en);
293 sysctlbyname("vfs.zfs.compressed_arc_enabled", &carc_en, &size,
294 NULL, 0) == 0 && carc_en == 1)
297 kd = kvm_open(NULL, _PATH_DEVNULL, NULL, O_RDONLY, "kvm_open");
301 GETSYSCTL("kern.ccpu", ccpu);
303 /* this is used in calculating WCPU -- calculate it ahead of time */
304 logcpu = log(loaddouble(ccpu));
312 /* get the page size and calculate pageshift from it */
313 pagesize = getpagesize();
315 while (pagesize > 1) {
320 /* we only need the amount of log(2)1024 for our conversion */
321 pageshift -= LOG1024;
323 /* fill in the statics information */
324 statics->procstate_names = procstatenames;
325 statics->cpustate_names = cpustatenames;
326 statics->memory_names = memorynames;
328 statics->arc_names = arcnames;
330 statics->arc_names = NULL;
332 statics->carc_names = carcnames;
334 statics->carc_names = NULL;
335 statics->swap_names = swapnames;
336 statics->order_names = ordernames;
338 /* Allocate state for per-CPU stats. */
341 GETSYSCTL("kern.smp.maxcpus", maxcpu);
342 times = calloc(maxcpu * CPUSTATES, sizeof(long));
344 err(1, "calloc for kern.smp.maxcpus");
345 size = sizeof(long) * maxcpu * CPUSTATES;
346 if (sysctlbyname("kern.cp_times", times, &size, NULL, 0) == -1)
347 err(1, "sysctlbyname kern.cp_times");
348 pcpu_cp_time = calloc(1, size);
349 maxid = (size / CPUSTATES / sizeof(long)) - 1;
350 for (i = 0; i <= maxid; i++) {
352 for (j = 0; empty && j < CPUSTATES; j++) {
353 if (times[i * CPUSTATES + j] != 0)
357 cpumask |= (1ul << i);
362 pcpu_cp_old = calloc(ncpus * CPUSTATES, sizeof(long));
363 pcpu_cp_diff = calloc(ncpus * CPUSTATES, sizeof(long));
364 pcpu_cpu_states = calloc(ncpus * CPUSTATES, sizeof(int));
365 statics->ncpus = ncpus;
374 format_header(const char *uname_field)
376 static struct sbuf* header = NULL;
378 /* clean up from last time. */
379 if (header != NULL) {
382 header = sbuf_new_auto();
385 switch (displaymode) {
387 sbuf_printf(header, " %s", ps.thread_id ? " THR" : "PID");
388 sbuf_printf(header, "%*s", ps.jail ? TOP_JID_LEN : 0,
389 ps.jail ? " JID" : "");
390 sbuf_printf(header, " %-*.*s ", namelength, namelength, uname_field);
391 sbuf_cat(header, "THR PRI NICE SIZE RES ");
393 sbuf_printf(header, "%*s ", TOP_SWAP_LEN - 1, "SWAP");
395 sbuf_cat(header, "STATE ");
397 sbuf_cat(header, "C ");
399 sbuf_cat(header, "TIME ");
400 sbuf_printf(header, " %6s ", ps.wcpu ? "WCPU" : "CPU");
401 sbuf_cat(header, "COMMAND");
406 sbuf_printf(header, " %s%*s %-*.*s",
407 ps.thread_id ? " THR" : "PID",
408 ps.jail ? TOP_JID_LEN : 0, ps.jail ? " JID" : "",
409 namelength, namelength, uname_field);
410 sbuf_cat(header, " VCSW IVCSW READ WRITE FAULT TOTAL PERCENT COMMAND");
415 assert("displaymode must not be set to DISP_MAX");
418 return sbuf_data(header);
421 static int swappgsin = -1;
422 static int swappgsout = -1;
426 get_system_info(struct system_info *si)
428 struct loadavg sysload;
430 struct timeval boottime;
431 uint64_t arc_stat, arc_stat2;
435 /* get the CPU stats */
436 size = (maxid + 1) * CPUSTATES * sizeof(long);
437 if (sysctlbyname("kern.cp_times", pcpu_cp_time, &size, NULL, 0) == -1)
438 err(1, "sysctlbyname kern.cp_times");
439 GETSYSCTL("kern.cp_time", cp_time);
440 GETSYSCTL("vm.loadavg", sysload);
441 GETSYSCTL("kern.lastpid", lastpid);
443 /* convert load averages to doubles */
444 for (i = 0; i < 3; i++)
445 si->load_avg[i] = (double)sysload.ldavg[i] / sysload.fscale;
447 /* convert cp_time counts to percentages */
448 for (i = j = 0; i <= maxid; i++) {
449 if ((cpumask & (1ul << i)) == 0)
451 percentages(CPUSTATES, &pcpu_cpu_states[j * CPUSTATES],
452 &pcpu_cp_time[j * CPUSTATES],
453 &pcpu_cp_old[j * CPUSTATES],
454 &pcpu_cp_diff[j * CPUSTATES]);
457 percentages(CPUSTATES, cpu_states, cp_time, cp_old, cp_diff);
459 /* sum memory & swap statistics */
461 static unsigned int swap_delay = 0;
462 static int swapavail = 0;
463 static int swapfree = 0;
464 static long bufspace = 0;
465 static uint64_t nspgsin, nspgsout;
467 GETSYSCTL("vfs.bufspace", bufspace);
468 GETSYSCTL("vm.stats.vm.v_active_count", memory_stats[0]);
469 GETSYSCTL("vm.stats.vm.v_inactive_count", memory_stats[1]);
470 GETSYSCTL("vm.stats.vm.v_laundry_count", memory_stats[2]);
471 GETSYSCTL("vm.stats.vm.v_wire_count", memory_stats[3]);
472 GETSYSCTL("vm.stats.vm.v_free_count", memory_stats[5]);
473 GETSYSCTL("vm.stats.vm.v_swappgsin", nspgsin);
474 GETSYSCTL("vm.stats.vm.v_swappgsout", nspgsout);
475 /* convert memory stats to Kbytes */
476 memory_stats[0] = pagetok(memory_stats[0]);
477 memory_stats[1] = pagetok(memory_stats[1]);
478 memory_stats[2] = pagetok(memory_stats[2]);
479 memory_stats[3] = pagetok(memory_stats[3]);
480 memory_stats[4] = bufspace / 1024;
481 memory_stats[5] = pagetok(memory_stats[5]);
482 memory_stats[6] = -1;
490 /* compute differences between old and new swap statistic */
492 swap_stats[4] = pagetok(((nspgsin - swappgsin)));
493 swap_stats[5] = pagetok(((nspgsout - swappgsout)));
497 swappgsout = nspgsout;
499 /* call CPU heavy swapmode() only for changes */
500 if (swap_stats[4] > 0 || swap_stats[5] > 0 || swap_delay == 0) {
501 swap_stats[3] = swapmode(&swapavail, &swapfree);
502 swap_stats[0] = swapavail;
503 swap_stats[1] = swapavail - swapfree;
504 swap_stats[2] = swapfree;
511 GETSYSCTL("kstat.zfs.misc.arcstats.size", arc_stat);
512 arc_stats[0] = arc_stat >> 10;
513 GETSYSCTL("vfs.zfs.mfu_size", arc_stat);
514 arc_stats[1] = arc_stat >> 10;
515 GETSYSCTL("vfs.zfs.mru_size", arc_stat);
516 arc_stats[2] = arc_stat >> 10;
517 GETSYSCTL("vfs.zfs.anon_size", arc_stat);
518 arc_stats[3] = arc_stat >> 10;
519 GETSYSCTL("kstat.zfs.misc.arcstats.hdr_size", arc_stat);
520 GETSYSCTL("kstat.zfs.misc.arcstats.l2_hdr_size", arc_stat2);
521 arc_stats[4] = (arc_stat + arc_stat2) >> 10;
522 GETSYSCTL("kstat.zfs.misc.arcstats.other_size", arc_stat);
523 arc_stats[5] = arc_stat >> 10;
527 GETSYSCTL("kstat.zfs.misc.arcstats.compressed_size", arc_stat);
528 carc_stats[0] = arc_stat >> 10;
529 carc_stats[2] = arc_stat >> 10; /* For ratio */
530 GETSYSCTL("kstat.zfs.misc.arcstats.uncompressed_size", arc_stat);
531 carc_stats[1] = arc_stat >> 10;
532 si->carc = carc_stats;
535 /* set arrays and strings */
537 si->cpustates = pcpu_cpu_states;
540 si->cpustates = cpu_states;
543 si->memory = memory_stats;
544 si->swap = swap_stats;
548 si->last_pid = lastpid;
554 * Print how long system has been up.
555 * (Found by looking getting "boottime" from the kernel)
558 mib[1] = KERN_BOOTTIME;
559 size = sizeof(boottime);
560 if (sysctl(mib, nitems(mib), &boottime, &size, NULL, 0) != -1 &&
561 boottime.tv_sec != 0) {
562 si->boottime = boottime;
564 si->boottime.tv_sec = -1;
568 #define NOPROC ((void *)-1)
571 * We need to compare data from the old process entry with the new
573 * To facilitate doing this quickly we stash a pointer in the kinfo_proc
574 * structure to cache the mapping. We also use a negative cache pointer
575 * of NOPROC to avoid duplicate lookups.
576 * XXX: this could be done when the actual processes are fetched, we do
577 * it here out of laziness.
579 static const struct kinfo_proc *
580 get_old_proc(struct kinfo_proc *pp)
582 const struct kinfo_proc * const *oldpp, *oldp;
585 * If this is the first fetch of the kinfo_procs then we don't have
586 * any previous entries.
588 if (previous_proc_count == 0)
590 /* negative cache? */
591 if (pp->ki_udata == NOPROC)
594 if (pp->ki_udata != NULL)
595 return (pp->ki_udata);
598 * 1) look up based on pid.
599 * 2) compare process start.
600 * If we fail here, then setup a negative cache entry, otherwise
603 oldpp = bsearch(&pp, previous_pref, previous_proc_count,
604 sizeof(*previous_pref), ps.thread ? compare_tid : compare_pid);
606 pp->ki_udata = NOPROC;
610 if (memcmp(&oldp->ki_start, &pp->ki_start, sizeof(pp->ki_start)) != 0) {
611 pp->ki_udata = NOPROC;
619 * Return the total amount of IO done in blocks in/out and faults.
620 * store the values individually in the pointers passed in.
623 get_io_stats(const struct kinfo_proc *pp, long *inp, long *oup, long *flp,
624 long *vcsw, long *ivcsw)
626 const struct kinfo_proc *oldp;
627 static struct kinfo_proc dummy;
630 oldp = get_old_proc(pp);
632 memset(&dummy, 0, sizeof(dummy));
635 *inp = RU(pp)->ru_inblock - RU(oldp)->ru_inblock;
636 *oup = RU(pp)->ru_oublock - RU(oldp)->ru_oublock;
637 *flp = RU(pp)->ru_majflt - RU(oldp)->ru_majflt;
638 *vcsw = RU(pp)->ru_nvcsw - RU(oldp)->ru_nvcsw;
639 *ivcsw = RU(pp)->ru_nivcsw - RU(oldp)->ru_nivcsw;
641 (RU(pp)->ru_inblock - RU(oldp)->ru_inblock) +
642 (RU(pp)->ru_oublock - RU(oldp)->ru_oublock) +
643 (RU(pp)->ru_majflt - RU(oldp)->ru_majflt);
648 * If there was a previous update, use the delta in ki_runtime over
649 * the previous interval to calculate pctcpu. Otherwise, fall back
650 * to using the kernel's ki_pctcpu.
653 proc_calc_pctcpu(struct kinfo_proc *pp)
655 const struct kinfo_proc *oldp;
657 if (previous_interval != 0) {
658 oldp = get_old_proc(pp);
660 return ((double)(pp->ki_runtime - oldp->ki_runtime)
661 / previous_interval);
664 * If this process/thread was created during the previous
665 * interval, charge it's total runtime to the previous
668 else if (pp->ki_start.tv_sec > previous_wall_time.tv_sec ||
669 (pp->ki_start.tv_sec == previous_wall_time.tv_sec &&
670 pp->ki_start.tv_usec >= previous_wall_time.tv_usec))
671 return ((double)pp->ki_runtime / previous_interval);
673 return (pctdouble(pp->ki_pctcpu));
677 * Return true if this process has used any CPU time since the
681 proc_used_cpu(struct kinfo_proc *pp)
683 const struct kinfo_proc *oldp;
685 oldp = get_old_proc(pp);
687 return (PCTCPU(pp) != 0);
688 return (pp->ki_runtime != oldp->ki_runtime ||
689 RU(pp)->ru_nvcsw != RU(oldp)->ru_nvcsw ||
690 RU(pp)->ru_nivcsw != RU(oldp)->ru_nivcsw);
694 * Return the total number of block in/out and faults by a process.
697 get_io_total(const struct kinfo_proc *pp)
701 return (get_io_stats(pp, &dummy, &dummy, &dummy, &dummy, &dummy));
704 static struct handle handle;
707 get_process_info(struct system_info *si, struct process_select *sel,
708 int (*compare)(const void *, const void *))
713 long p_inblock, p_oublock, p_majflt, p_vcsw, p_ivcsw;
716 struct kinfo_proc **prefp;
717 struct kinfo_proc *pp;
718 struct timespec previous_proc_uptime;
721 * If thread state was toggled, don't cache the previous processes.
723 if (previous_thread != sel->thread)
725 previous_thread = sel->thread;
728 * Save the previous process info.
730 if (previous_proc_count_max < nproc) {
731 free(previous_procs);
732 previous_procs = calloc(nproc, sizeof(*previous_procs));
734 previous_pref = calloc(nproc, sizeof(*previous_pref));
735 if (previous_procs == NULL || previous_pref == NULL) {
736 fprintf(stderr, "top: Out of memory.\n");
737 quit(TOP_EX_SYS_ERROR);
739 previous_proc_count_max = nproc;
742 for (i = 0; i < nproc; i++)
743 previous_pref[i] = &previous_procs[i];
744 memcpy(previous_procs, pbase, nproc * sizeof(*previous_procs));
745 qsort(previous_pref, nproc, sizeof(*previous_pref),
746 ps.thread ? compare_tid : compare_pid);
748 previous_proc_count = nproc;
749 previous_proc_uptime = proc_uptime;
750 previous_wall_time = proc_wall_time;
751 previous_interval = 0;
753 pbase = kvm_getprocs(kd, sel->thread ? KERN_PROC_ALL : KERN_PROC_PROC,
755 gettimeofday(&proc_wall_time, NULL);
756 if (clock_gettime(CLOCK_UPTIME, &proc_uptime) != 0)
757 memset(&proc_uptime, 0, sizeof(proc_uptime));
758 else if (previous_proc_uptime.tv_sec != 0 &&
759 previous_proc_uptime.tv_nsec != 0) {
760 previous_interval = (proc_uptime.tv_sec -
761 previous_proc_uptime.tv_sec) * 1000000;
762 nsec = proc_uptime.tv_nsec - previous_proc_uptime.tv_nsec;
764 previous_interval -= 1000000;
767 previous_interval += nsec / 1000;
769 if (nproc > onproc) {
770 pref = realloc(pref, sizeof(*pref) * nproc);
771 pcpu = realloc(pcpu, sizeof(*pcpu) * nproc);
774 if (pref == NULL || pbase == NULL || pcpu == NULL) {
775 fprintf(stderr, "top: Out of memory.\n");
776 quit(TOP_EX_SYS_ERROR);
778 /* get a pointer to the states summary array */
779 si->procstates = process_states;
781 /* count up process states and get pointers to interesting procs */
787 memset(process_states, 0, sizeof(process_states));
789 for (pp = pbase, i = 0; i < nproc; pp++, i++) {
791 if (pp->ki_stat == 0)
795 if (!sel->self && pp->ki_pid == mypid && sel->pid == -1)
799 if (!sel->system && (pp->ki_flag & P_SYSTEM) && sel->pid == -1)
800 /* skip system process */
803 p_io = get_io_stats(pp, &p_inblock, &p_oublock, &p_majflt,
805 total_inblock += p_inblock;
806 total_oublock += p_oublock;
807 total_majflt += p_majflt;
809 process_states[(unsigned char)pp->ki_stat]++;
811 if (pp->ki_stat == SZOMB)
815 if (!sel->kidle && pp->ki_tdflags & TDF_IDLETD && sel->pid == -1)
816 /* skip kernel idle process */
819 PCTCPU(pp) = proc_calc_pctcpu(pp);
820 if (sel->thread && PCTCPU(pp) > 1.0)
822 if (displaymode == DISP_CPU && !sel->idle &&
823 (!proc_used_cpu(pp) ||
824 pp->ki_stat == SSTOP || pp->ki_stat == SIDL))
825 /* skip idle or non-running processes */
828 if (displaymode == DISP_IO && !sel->idle && p_io == 0)
829 /* skip processes that aren't doing I/O */
832 if (sel->jid != -1 && pp->ki_jid != sel->jid)
833 /* skip proc. that don't belong to the selected JID */
836 if (sel->uid[0] != -1 && !find_uid(pp->ki_ruid, sel->uid))
837 /* skip proc. that don't belong to the selected UID */
840 if (sel->pid != -1 && pp->ki_pid != sel->pid)
847 /* if requested, sort the "interesting" processes */
849 qsort(pref, active_procs, sizeof(*pref), compare);
851 /* remember active and total counts */
852 si->p_total = total_procs;
853 si->p_pactive = pref_len = active_procs;
855 /* pass back a handle */
856 handle.next_proc = pref;
857 handle.remaining = active_procs;
862 format_next_process(struct handle * xhandle, char *(*get_userid)(int), int flags)
864 struct kinfo_proc *pp;
865 const struct kinfo_proc *oldp;
869 struct rusage ru, *rup;
873 const int cmdlen = 256;
874 static struct sbuf* procbuf = NULL;
876 /* clean up from last time. */
877 if (procbuf != NULL) {
880 procbuf = sbuf_new_auto();
884 /* find and remember the next proc structure */
885 pp = *(xhandle->next_proc++);
886 xhandle->remaining--;
888 /* get the process's command name */
889 if ((pp->ki_flag & P_INMEM) == 0) {
891 * Print swapped processes as <pname>
895 len = strlen(pp->ki_comm);
896 if (len > sizeof(pp->ki_comm) - 3)
897 len = sizeof(pp->ki_comm) - 3;
898 memmove(pp->ki_comm + 1, pp->ki_comm, len);
899 pp->ki_comm[0] = '<';
900 pp->ki_comm[len + 1] = '>';
901 pp->ki_comm[len + 2] = '\0';
905 * Convert the process's runtime from microseconds to seconds. This
906 * time includes the interrupt time although that is not wanted here.
907 * ps(1) is similarly sloppy.
909 cputime = (pp->ki_runtime + 500000) / 1000000;
911 /* generate "STATE" field */
912 switch (state = pp->ki_stat) {
914 if (smpmode && pp->ki_oncpu != NOCPU)
915 sprintf(status, "CPU%d", pp->ki_oncpu);
917 strcpy(status, "RUN");
920 if (pp->ki_kiflag & KI_LOCKBLOCK) {
921 sprintf(status, "*%.6s", pp->ki_lockname);
926 sprintf(status, "%.6s", pp->ki_wmesg);
930 if (state < nitems(state_abbrev)) {
931 sprintf(status, "%.6s", state_abbrev[state]);
933 sprintf(status, "?%5zu", state);
938 cmdbuf = calloc(cmdlen + 1, 1);
939 if (cmdbuf == NULL) {
940 warn("calloc(%d)", cmdlen + 1);
944 if (!(flags & FMT_SHOWARGS)) {
945 if (ps.thread && pp->ki_flag & P_HADTHREADS &&
947 snprintf(cmdbuf, cmdlen, "%s{%s%s}", pp->ki_comm,
948 pp->ki_tdname, pp->ki_moretdname);
950 snprintf(cmdbuf, cmdlen, "%s", pp->ki_comm);
953 if (pp->ki_flag & P_SYSTEM ||
954 pp->ki_args == NULL ||
955 (args = kvm_getargv(kd, pp, cmdlen)) == NULL ||
957 if (ps.thread && pp->ki_flag & P_HADTHREADS &&
959 snprintf(cmdbuf, cmdlen,
960 "[%s{%s%s}]", pp->ki_comm, pp->ki_tdname,
963 snprintf(cmdbuf, cmdlen,
964 "[%s]", pp->ki_comm);
973 argbuflen = cmdlen * 4;
974 argbuf = calloc(argbuflen + 1, 1);
975 if (argbuf == NULL) {
976 warn("calloc(%zu)", argbuflen + 1);
983 /* Extract cmd name from argv */
984 cmd = basename(*args);
986 for (; (src = *args++) != NULL; ) {
989 len = (argbuflen - (dst - argbuf) - 1) / 4;
991 utf8strvisx(dst, src, MIN(strlen(src), len));
994 MIN(strlen(src), len),
995 VIS_NL | VIS_CSTYLE);
999 if ((argbuflen - (dst - argbuf) - 1) / 4 > 0)
1000 *dst++ = ' '; /* add delimiting space */
1002 if (dst != argbuf && dst[-1] == ' ')
1006 if (strcmp(cmd, pp->ki_comm) != 0) {
1007 if (ps.thread && pp->ki_flag & P_HADTHREADS &&
1009 snprintf(cmdbuf, cmdlen,
1010 "%s (%s){%s%s}", argbuf,
1011 pp->ki_comm, pp->ki_tdname,
1014 snprintf(cmdbuf, cmdlen,
1015 "%s (%s)", argbuf, pp->ki_comm);
1017 if (ps.thread && pp->ki_flag & P_HADTHREADS &&
1019 snprintf(cmdbuf, cmdlen,
1020 "%s{%s%s}", argbuf, pp->ki_tdname,
1023 strlcpy(cmdbuf, argbuf, cmdlen);
1029 if (displaymode == DISP_IO) {
1030 oldp = get_old_proc(pp);
1032 ru.ru_inblock = RU(pp)->ru_inblock -
1033 RU(oldp)->ru_inblock;
1034 ru.ru_oublock = RU(pp)->ru_oublock -
1035 RU(oldp)->ru_oublock;
1036 ru.ru_majflt = RU(pp)->ru_majflt - RU(oldp)->ru_majflt;
1037 ru.ru_nvcsw = RU(pp)->ru_nvcsw - RU(oldp)->ru_nvcsw;
1038 ru.ru_nivcsw = RU(pp)->ru_nivcsw - RU(oldp)->ru_nivcsw;
1043 p_tot = rup->ru_inblock + rup->ru_oublock + rup->ru_majflt;
1044 s_tot = total_inblock + total_oublock + total_majflt;
1046 sbuf_printf(procbuf, "%5d ", (ps.thread_id) ? pp->ki_tid : pp->ki_pid);
1049 sbuf_printf(procbuf, "%*d ", TOP_JID_LEN - 1, pp->ki_jid);
1051 sbuf_printf(procbuf, "%-*.*s", namelength, namelength, (*get_userid)(pp->ki_ruid));
1052 sbuf_printf(procbuf, "%6ld ", rup->ru_nvcsw);
1053 sbuf_printf(procbuf, "%6ld ", rup->ru_nivcsw);
1054 sbuf_printf(procbuf, "%6ld ", rup->ru_inblock);
1055 sbuf_printf(procbuf, "%6ld ", rup->ru_oublock);
1056 sbuf_printf(procbuf, "%6ld ", rup->ru_majflt);
1057 sbuf_printf(procbuf, "%6ld ", p_tot);
1058 sbuf_printf(procbuf, "%6.2f%% ", s_tot == 0 ? 0.0 : (p_tot * 100.0 / s_tot));
1061 sbuf_printf(procbuf, "%5d ", (ps.thread_id) ? pp->ki_tid : pp->ki_pid);
1063 sbuf_printf(procbuf, "%*d ", TOP_JID_LEN - 1, pp->ki_jid);
1065 sbuf_printf(procbuf, "%-*.*s ", namelength, namelength, (*get_userid)(pp->ki_ruid));
1068 sbuf_printf(procbuf, "%4d ", pp->ki_numthreads);
1071 sbuf_printf(procbuf, "%3d ", pp->ki_pri.pri_level - PZERO);
1072 sbuf_printf(procbuf, "%4s", format_nice(pp));
1073 sbuf_printf(procbuf, "%6s ", format_k(PROCSIZE(pp)));
1074 sbuf_printf(procbuf, "%5s ", format_k(pagetok(pp->ki_rssize)));
1076 sbuf_printf(procbuf, "%*s ",
1078 format_k(pagetok(ki_swap(pp))));
1080 sbuf_printf(procbuf, "%-6.6s ", status);
1083 if (state == SRUN && pp->ki_oncpu != NOCPU) {
1086 cpu = pp->ki_lastcpu;
1088 sbuf_printf(procbuf, "%3d ", cpu);
1090 sbuf_printf(procbuf, "%6s ", format_time(cputime));
1091 sbuf_printf(procbuf, "%6.2f%% ", ps.wcpu ? 100.0 * weighted_cpu(PCTCPU(pp), pp) : 100.0 * PCTCPU(pp));
1093 sbuf_printf(procbuf, "%s", printable(cmdbuf));
1095 return (sbuf_data(procbuf));
1099 getsysctl(const char *name, void *ptr, size_t len)
1103 if (sysctlbyname(name, ptr, &nlen, NULL, 0) == -1) {
1104 fprintf(stderr, "top: sysctl(%s...) failed: %s\n", name,
1106 quit(TOP_EX_SYS_ERROR);
1109 fprintf(stderr, "top: sysctl(%s...) expected %lu, got %lu\n",
1110 name, (unsigned long)len, (unsigned long)nlen);
1111 quit(TOP_EX_SYS_ERROR);
1116 format_nice(const struct kinfo_proc *pp)
1118 const char *fifo, *kproc;
1120 static char nicebuf[4 + 1];
1122 fifo = PRI_NEED_RR(pp->ki_pri.pri_class) ? "" : "F";
1123 kproc = (pp->ki_flag & P_KPROC) ? "k" : "";
1124 switch (PRI_BASE(pp->ki_pri.pri_class)) {
1129 * XXX: the kernel doesn't tell us the original rtprio and
1130 * doesn't really know what it was, so to recover it we
1131 * must be more chummy with the implementation than the
1132 * implementation is with itself. pri_user gives a
1133 * constant "base" priority, but is only initialized
1134 * properly for user threads. pri_native gives what the
1135 * kernel calls the "base" priority, but it isn't constant
1136 * since it is changed by priority propagation. pri_native
1137 * also isn't properly initialized for all threads, but it
1138 * is properly initialized for kernel realtime and idletime
1139 * threads. Thus we use pri_user for the base priority of
1140 * user threads (it is always correct) and pri_native for
1141 * the base priority of kernel realtime and idletime threads
1142 * (there is nothing better, and it is usually correct).
1144 * The field width and thus the buffer are too small for
1145 * values like "kr31F", but such values shouldn't occur,
1146 * and if they do then the tailing "F" is not displayed.
1148 rtpri = ((pp->ki_flag & P_KPROC) ? pp->ki_pri.pri_native :
1149 pp->ki_pri.pri_user) - PRI_MIN_REALTIME;
1150 snprintf(nicebuf, sizeof(nicebuf), "%sr%d%s",
1151 kproc, rtpri, fifo);
1154 if (pp->ki_flag & P_KPROC)
1156 snprintf(nicebuf, sizeof(nicebuf), "%d", pp->ki_nice - NZERO);
1159 /* XXX: as above. */
1160 rtpri = ((pp->ki_flag & P_KPROC) ? pp->ki_pri.pri_native :
1161 pp->ki_pri.pri_user) - PRI_MIN_IDLE;
1162 snprintf(nicebuf, sizeof(nicebuf), "%si%d%s",
1163 kproc, rtpri, fifo);
1171 /* comparison routines for qsort */
1174 compare_pid(const void *p1, const void *p2)
1176 const struct kinfo_proc * const *pp1 = p1;
1177 const struct kinfo_proc * const *pp2 = p2;
1179 assert((*pp2)->ki_pid >= 0 && (*pp1)->ki_pid >= 0);
1181 return ((*pp1)->ki_pid - (*pp2)->ki_pid);
1185 compare_tid(const void *p1, const void *p2)
1187 const struct kinfo_proc * const *pp1 = p1;
1188 const struct kinfo_proc * const *pp2 = p2;
1190 assert((*pp2)->ki_tid >= 0 && (*pp1)->ki_tid >= 0);
1192 return ((*pp1)->ki_tid - (*pp2)->ki_tid);
1196 * proc_compare - comparison function for "qsort"
1197 * Compares the resource consumption of two processes using five
1198 * distinct keys. The keys (in descending order of importance) are:
1199 * percent cpu, cpu ticks, state, resident set size, total virtual
1200 * memory usage. The process states are ordered as follows (from least
1201 * to most important): WAIT, zombie, sleep, stop, start, run. The
1202 * array declaration below maps a process state index into a number
1203 * that reflects this ordering.
1206 static int sorted_state[] = {
1209 1, /* ABANDONED (WAIT) */
1217 #define ORDERKEY_PCTCPU(a, b) do { \
1220 diff = weighted_cpu(PCTCPU((b)), (b)) - \
1221 weighted_cpu(PCTCPU((a)), (a)); \
1223 diff = PCTCPU((b)) - PCTCPU((a)); \
1225 return (diff > 0 ? 1 : -1); \
1228 #define ORDERKEY_CPTICKS(a, b) do { \
1229 int64_t diff = (int64_t)(b)->ki_runtime - (int64_t)(a)->ki_runtime; \
1231 return (diff > 0 ? 1 : -1); \
1234 #define ORDERKEY_STATE(a, b) do { \
1235 int diff = sorted_state[(unsigned char)(b)->ki_stat] - sorted_state[(unsigned char)(a)->ki_stat]; \
1237 return (diff > 0 ? 1 : -1); \
1240 #define ORDERKEY_PRIO(a, b) do { \
1241 int diff = (int)(b)->ki_pri.pri_level - (int)(a)->ki_pri.pri_level; \
1243 return (diff > 0 ? 1 : -1); \
1246 #define ORDERKEY_THREADS(a, b) do { \
1247 int diff = (int)(b)->ki_numthreads - (int)(a)->ki_numthreads; \
1249 return (diff > 0 ? 1 : -1); \
1252 #define ORDERKEY_RSSIZE(a, b) do { \
1253 long diff = (long)(b)->ki_rssize - (long)(a)->ki_rssize; \
1255 return (diff > 0 ? 1 : -1); \
1258 #define ORDERKEY_MEM(a, b) do { \
1259 long diff = (long)PROCSIZE((b)) - (long)PROCSIZE((a)); \
1261 return (diff > 0 ? 1 : -1); \
1264 #define ORDERKEY_JID(a, b) do { \
1265 int diff = (int)(b)->ki_jid - (int)(a)->ki_jid; \
1267 return (diff > 0 ? 1 : -1); \
1270 #define ORDERKEY_SWAP(a, b) do { \
1271 int diff = (int)ki_swap(b) - (int)ki_swap(a); \
1273 return (diff > 0 ? 1 : -1); \
1276 /* compare_cpu - the comparison function for sorting by cpu percentage */
1279 compare_cpu(const void *arg1, const void *arg2)
1281 const struct kinfo_proc *p1 = *(const struct kinfo_proc * const *)arg1;
1282 const struct kinfo_proc *p2 = *(const struct kinfo_proc * const *)arg2;
1284 ORDERKEY_PCTCPU(p1, p2);
1285 ORDERKEY_CPTICKS(p1, p2);
1286 ORDERKEY_STATE(p1, p2);
1287 ORDERKEY_PRIO(p1, p2);
1288 ORDERKEY_RSSIZE(p1, p2);
1289 ORDERKEY_MEM(p1, p2);
1294 /* compare_size - the comparison function for sorting by total memory usage */
1297 compare_size(const void *arg1, const void *arg2)
1299 const struct kinfo_proc *p1 = *(const struct kinfo_proc * const *)arg1;
1300 const struct kinfo_proc *p2 = *(const struct kinfo_proc * const *)arg2;
1302 ORDERKEY_MEM(p1, p2);
1303 ORDERKEY_RSSIZE(p1, p2);
1304 ORDERKEY_PCTCPU(p1, p2);
1305 ORDERKEY_CPTICKS(p1, p2);
1306 ORDERKEY_STATE(p1, p2);
1307 ORDERKEY_PRIO(p1, p2);
1312 /* compare_res - the comparison function for sorting by resident set size */
1315 compare_res(const void *arg1, const void *arg2)
1317 const struct kinfo_proc *p1 = *(const struct kinfo_proc * const *)arg1;
1318 const struct kinfo_proc *p2 = *(const struct kinfo_proc * const *)arg2;
1320 ORDERKEY_RSSIZE(p1, p2);
1321 ORDERKEY_MEM(p1, p2);
1322 ORDERKEY_PCTCPU(p1, p2);
1323 ORDERKEY_CPTICKS(p1, p2);
1324 ORDERKEY_STATE(p1, p2);
1325 ORDERKEY_PRIO(p1, p2);
1330 /* compare_time - the comparison function for sorting by total cpu time */
1333 compare_time(const void *arg1, const void *arg2)
1335 const struct kinfo_proc *p1 = *(const struct kinfo_proc * const *)arg1;
1336 const struct kinfo_proc *p2 = *(const struct kinfo_proc * const *) arg2;
1338 ORDERKEY_CPTICKS(p1, p2);
1339 ORDERKEY_PCTCPU(p1, p2);
1340 ORDERKEY_STATE(p1, p2);
1341 ORDERKEY_PRIO(p1, p2);
1342 ORDERKEY_RSSIZE(p1, p2);
1343 ORDERKEY_MEM(p1, p2);
1348 /* compare_prio - the comparison function for sorting by priority */
1351 compare_prio(const void *arg1, const void *arg2)
1353 const struct kinfo_proc *p1 = *(const struct kinfo_proc * const *)arg1;
1354 const struct kinfo_proc *p2 = *(const struct kinfo_proc * const *)arg2;
1356 ORDERKEY_PRIO(p1, p2);
1357 ORDERKEY_CPTICKS(p1, p2);
1358 ORDERKEY_PCTCPU(p1, p2);
1359 ORDERKEY_STATE(p1, p2);
1360 ORDERKEY_RSSIZE(p1, p2);
1361 ORDERKEY_MEM(p1, p2);
1366 /* compare_threads - the comparison function for sorting by threads */
1368 compare_threads(const void *arg1, const void *arg2)
1370 const struct kinfo_proc *p1 = *(const struct kinfo_proc * const *)arg1;
1371 const struct kinfo_proc *p2 = *(const struct kinfo_proc * const *)arg2;
1373 ORDERKEY_THREADS(p1, p2);
1374 ORDERKEY_PCTCPU(p1, p2);
1375 ORDERKEY_CPTICKS(p1, p2);
1376 ORDERKEY_STATE(p1, p2);
1377 ORDERKEY_PRIO(p1, p2);
1378 ORDERKEY_RSSIZE(p1, p2);
1379 ORDERKEY_MEM(p1, p2);
1384 /* compare_jid - the comparison function for sorting by jid */
1386 compare_jid(const void *arg1, const void *arg2)
1388 const struct kinfo_proc *p1 = *(const struct kinfo_proc * const *)arg1;
1389 const struct kinfo_proc *p2 = *(const struct kinfo_proc * const *)arg2;
1391 ORDERKEY_JID(p1, p2);
1392 ORDERKEY_PCTCPU(p1, p2);
1393 ORDERKEY_CPTICKS(p1, p2);
1394 ORDERKEY_STATE(p1, p2);
1395 ORDERKEY_PRIO(p1, p2);
1396 ORDERKEY_RSSIZE(p1, p2);
1397 ORDERKEY_MEM(p1, p2);
1402 /* compare_swap - the comparison function for sorting by swap */
1404 compare_swap(const void *arg1, const void *arg2)
1406 const struct kinfo_proc *p1 = *(const struct kinfo_proc * const *)arg1;
1407 const struct kinfo_proc *p2 = *(const struct kinfo_proc * const *)arg2;
1409 ORDERKEY_SWAP(p1, p2);
1410 ORDERKEY_PCTCPU(p1, p2);
1411 ORDERKEY_CPTICKS(p1, p2);
1412 ORDERKEY_STATE(p1, p2);
1413 ORDERKEY_PRIO(p1, p2);
1414 ORDERKEY_RSSIZE(p1, p2);
1415 ORDERKEY_MEM(p1, p2);
1420 /* assorted comparison functions for sorting by i/o */
1423 compare_iototal(const void *arg1, const void *arg2)
1425 const struct kinfo_proc * const p1 = *(const struct kinfo_proc * const *)arg1;
1426 const struct kinfo_proc * const p2 = *(const struct kinfo_proc * const *)arg2;
1428 return (get_io_total(p2) - get_io_total(p1));
1432 compare_ioread(const void *arg1, const void *arg2)
1434 const struct kinfo_proc *p1 = *(const struct kinfo_proc * const *)arg1;
1435 const struct kinfo_proc *p2 = *(const struct kinfo_proc * const *)arg2;
1436 long dummy, inp1, inp2;
1438 (void) get_io_stats(p1, &inp1, &dummy, &dummy, &dummy, &dummy);
1439 (void) get_io_stats(p2, &inp2, &dummy, &dummy, &dummy, &dummy);
1441 return (inp2 - inp1);
1445 compare_iowrite(const void *arg1, const void *arg2)
1447 const struct kinfo_proc *p1 = *(const struct kinfo_proc * const *)arg1;
1448 const struct kinfo_proc *p2 = *(const struct kinfo_proc * const *)arg2;
1449 long dummy, oup1, oup2;
1451 (void) get_io_stats(p1, &dummy, &oup1, &dummy, &dummy, &dummy);
1452 (void) get_io_stats(p2, &dummy, &oup2, &dummy, &dummy, &dummy);
1454 return (oup2 - oup1);
1458 compare_iofault(const void *arg1, const void *arg2)
1460 const struct kinfo_proc *p1 = *(const struct kinfo_proc * const *)arg1;
1461 const struct kinfo_proc *p2 = *(const struct kinfo_proc * const *)arg2;
1462 long dummy, flp1, flp2;
1464 (void) get_io_stats(p1, &dummy, &dummy, &flp1, &dummy, &dummy);
1465 (void) get_io_stats(p2, &dummy, &dummy, &flp2, &dummy, &dummy);
1467 return (flp2 - flp1);
1471 compare_vcsw(const void *arg1, const void *arg2)
1473 const struct kinfo_proc *p1 = *(const struct kinfo_proc * const *)arg1;
1474 const struct kinfo_proc *p2 = *(const struct kinfo_proc * const *)arg2;
1475 long dummy, flp1, flp2;
1477 (void) get_io_stats(p1, &dummy, &dummy, &dummy, &flp1, &dummy);
1478 (void) get_io_stats(p2, &dummy, &dummy, &dummy, &flp2, &dummy);
1480 return (flp2 - flp1);
1484 compare_ivcsw(const void *arg1, const void *arg2)
1486 const struct kinfo_proc *p1 = *(const struct kinfo_proc * const *)arg1;
1487 const struct kinfo_proc *p2 = *(const struct kinfo_proc * const *)arg2;
1488 long dummy, flp1, flp2;
1490 (void) get_io_stats(p1, &dummy, &dummy, &dummy, &dummy, &flp1);
1491 (void) get_io_stats(p2, &dummy, &dummy, &dummy, &dummy, &flp2);
1493 return (flp2 - flp1);
1496 int (*compares[])(const void *arg1, const void *arg2) = {
1516 swapmode(int *retavail, int *retfree)
1519 struct kvm_swap swapary[1];
1520 static int pagesize = 0;
1521 static unsigned long swap_maxpages = 0;
1526 #define CONVERT(v) ((quad_t)(v) * pagesize / 1024)
1528 n = kvm_getswapinfo(kd, swapary, 1, 0);
1529 if (n < 0 || swapary[0].ksw_total == 0)
1533 pagesize = getpagesize();
1534 if (swap_maxpages == 0)
1535 GETSYSCTL("vm.swap_maxpages", swap_maxpages);
1537 /* ksw_total contains the total size of swap all devices which may
1538 exceed the maximum swap size allocatable in the system */
1539 if ( swapary[0].ksw_total > swap_maxpages )
1540 swapary[0].ksw_total = swap_maxpages;
1542 *retavail = CONVERT(swapary[0].ksw_total);
1543 *retfree = CONVERT(swapary[0].ksw_total - swapary[0].ksw_used);
1547 n = (int)(swapary[0].ksw_used * 100.0 / swapary[0].ksw_total);