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)];
155 /* these are for keeping track of the proc array */
158 static int onproc = -1;
160 static struct kinfo_proc *pbase;
161 static struct kinfo_proc **pref;
162 static struct kinfo_proc *previous_procs;
163 static struct kinfo_proc **previous_pref;
164 static int previous_proc_count = 0;
165 static int previous_proc_count_max = 0;
166 static int previous_thread;
168 /* data used for recalculating pctcpu */
170 static struct timespec proc_uptime;
171 static struct timeval proc_wall_time;
172 static struct timeval previous_wall_time;
173 static uint64_t previous_interval = 0;
175 /* total number of io operations */
176 static long total_inblock;
177 static long total_oublock;
178 static long total_majflt;
180 /* these are for getting the memory statistics */
182 static int arc_enabled;
183 static int carc_enabled;
184 static int pageshift; /* log base 2 of the pagesize */
186 /* define pagetok in terms of pageshift */
188 #define pagetok(size) ((size) << pageshift)
191 #define ki_swap(kip) \
192 ((kip)->ki_swrss > (kip)->ki_rssize ? (kip)->ki_swrss - (kip)->ki_rssize : 0)
195 * Sorting orders. The first element is the default.
197 static const char *ordernames[] = {
198 "cpu", "size", "res", "time", "pri", "threads",
199 "total", "read", "write", "fault", "vcsw", "ivcsw",
200 "jid", "swap", "pid", NULL
203 /* Per-cpu time states */
207 static unsigned long cpumask;
209 static long *pcpu_cp_time;
210 static long *pcpu_cp_old;
211 static long *pcpu_cp_diff;
212 static int *pcpu_cpu_states;
214 static int compare_swap(const void *a, const void *b);
215 static int compare_jid(const void *a, const void *b);
216 static int compare_pid(const void *a, const void *b);
217 static int compare_tid(const void *a, const void *b);
218 static const char *format_nice(const struct kinfo_proc *pp);
219 static void getsysctl(const char *name, void *ptr, size_t len);
220 static int swapmode(int *retavail, int *retfree);
221 static void update_layout(void);
222 static int find_uid(uid_t needle, int *haystack);
225 find_uid(uid_t needle, int *haystack)
229 for (; i < TOP_MAX_UIDS; ++i)
230 if ((uid_t)haystack[i] == needle)
236 toggle_pcpustats(void)
244 /* Adjust display based on ncpus and the ARC state. */
252 y_swap = 3 + arc_enabled + carc_enabled + has_swap;
253 y_idlecursor = 4 + arc_enabled + carc_enabled + has_swap;
254 y_message = 4 + arc_enabled + carc_enabled + has_swap;
255 y_header = 5 + arc_enabled + carc_enabled + has_swap;
256 y_procs = 6 + arc_enabled + carc_enabled + has_swap;
257 Header_lines = 6 + arc_enabled + carc_enabled + has_swap;
264 y_idlecursor += ncpus - 1;
265 y_message += ncpus - 1;
266 y_header += ncpus - 1;
267 y_procs += ncpus - 1;
268 Header_lines += ncpus - 1;
273 machine_init(struct statics *statics)
275 int i, j, empty, pagesize;
277 int carc_en, nswapdev;
280 size = sizeof(smpmode);
281 if ((sysctlbyname("machdep.smp_active", &smpmode, &size,
283 sysctlbyname("kern.smp.active", &smpmode, &size,
285 size != sizeof(smpmode))
288 size = sizeof(arc_size);
289 if (sysctlbyname("kstat.zfs.misc.arcstats.size", &arc_size, &size,
290 NULL, 0) == 0 && arc_size != 0)
292 size = sizeof(carc_en);
294 sysctlbyname("vfs.zfs.compressed_arc_enabled", &carc_en, &size,
295 NULL, 0) == 0 && carc_en == 1)
298 kd = kvm_open(NULL, _PATH_DEVNULL, NULL, O_RDONLY, "kvm_open");
302 size = sizeof(nswapdev);
303 if (sysctlbyname("vm.nswapdev", &nswapdev, &size, NULL,
304 0) == 0 && nswapdev != 0)
307 GETSYSCTL("kern.ccpu", ccpu);
309 /* this is used in calculating WCPU -- calculate it ahead of time */
310 logcpu = log(loaddouble(ccpu));
318 /* get the page size and calculate pageshift from it */
319 pagesize = getpagesize();
321 while (pagesize > 1) {
326 /* we only need the amount of log(2)1024 for our conversion */
327 pageshift -= LOG1024;
329 /* fill in the statics information */
330 statics->procstate_names = procstatenames;
331 statics->cpustate_names = cpustatenames;
332 statics->memory_names = memorynames;
334 statics->arc_names = arcnames;
336 statics->arc_names = NULL;
338 statics->carc_names = carcnames;
340 statics->carc_names = NULL;
342 statics->swap_names = swapnames;
344 statics->swap_names = NULL;
345 statics->order_names = ordernames;
347 /* Allocate state for per-CPU stats. */
350 GETSYSCTL("kern.smp.maxcpus", maxcpu);
351 times = calloc(maxcpu * CPUSTATES, sizeof(long));
353 err(1, "calloc for kern.smp.maxcpus");
354 size = sizeof(long) * maxcpu * CPUSTATES;
355 if (sysctlbyname("kern.cp_times", times, &size, NULL, 0) == -1)
356 err(1, "sysctlbyname kern.cp_times");
357 pcpu_cp_time = calloc(1, size);
358 maxid = (size / CPUSTATES / sizeof(long)) - 1;
359 for (i = 0; i <= maxid; i++) {
361 for (j = 0; empty && j < CPUSTATES; j++) {
362 if (times[i * CPUSTATES + j] != 0)
366 cpumask |= (1ul << i);
371 pcpu_cp_old = calloc(ncpus * CPUSTATES, sizeof(long));
372 pcpu_cp_diff = calloc(ncpus * CPUSTATES, sizeof(long));
373 pcpu_cpu_states = calloc(ncpus * CPUSTATES, sizeof(int));
374 statics->ncpus = ncpus;
383 format_header(const char *uname_field)
385 static struct sbuf* header = NULL;
387 /* clean up from last time. */
388 if (header != NULL) {
391 header = sbuf_new_auto();
394 switch (displaymode) {
396 sbuf_printf(header, " %s", ps.thread_id ? " THR" : "PID");
397 sbuf_printf(header, "%*s", ps.jail ? TOP_JID_LEN : 0,
398 ps.jail ? " JID" : "");
399 sbuf_printf(header, " %-*.*s ", namelength, namelength, uname_field);
401 sbuf_cat(header, "THR ");
403 sbuf_cat(header, "PRI NICE SIZE RES ");
405 sbuf_printf(header, "%*s ", TOP_SWAP_LEN - 1, "SWAP");
407 sbuf_cat(header, "STATE ");
409 sbuf_cat(header, "C ");
411 sbuf_cat(header, "TIME ");
412 sbuf_printf(header, " %6s ", ps.wcpu ? "WCPU" : "CPU");
413 sbuf_cat(header, "COMMAND");
418 sbuf_printf(header, " %s%*s %-*.*s",
419 ps.thread_id ? " THR" : "PID",
420 ps.jail ? TOP_JID_LEN : 0, ps.jail ? " JID" : "",
421 namelength, namelength, uname_field);
422 sbuf_cat(header, " VCSW IVCSW READ WRITE FAULT TOTAL PERCENT COMMAND");
427 assert("displaymode must not be set to DISP_MAX");
430 return sbuf_data(header);
433 static int swappgsin = -1;
434 static int swappgsout = -1;
438 get_system_info(struct system_info *si)
440 struct loadavg sysload;
442 struct timeval boottime;
443 uint64_t arc_stat, arc_stat2;
447 /* get the CPU stats */
448 size = (maxid + 1) * CPUSTATES * sizeof(long);
449 if (sysctlbyname("kern.cp_times", pcpu_cp_time, &size, NULL, 0) == -1)
450 err(1, "sysctlbyname kern.cp_times");
451 GETSYSCTL("kern.cp_time", cp_time);
452 GETSYSCTL("vm.loadavg", sysload);
453 GETSYSCTL("kern.lastpid", lastpid);
455 /* convert load averages to doubles */
456 for (i = 0; i < 3; i++)
457 si->load_avg[i] = (double)sysload.ldavg[i] / sysload.fscale;
459 /* convert cp_time counts to percentages */
460 for (i = j = 0; i <= maxid; i++) {
461 if ((cpumask & (1ul << i)) == 0)
463 percentages(CPUSTATES, &pcpu_cpu_states[j * CPUSTATES],
464 &pcpu_cp_time[j * CPUSTATES],
465 &pcpu_cp_old[j * CPUSTATES],
466 &pcpu_cp_diff[j * CPUSTATES]);
469 percentages(CPUSTATES, cpu_states, cp_time, cp_old, cp_diff);
471 /* sum memory & swap statistics */
473 static unsigned int swap_delay = 0;
474 static int swapavail = 0;
475 static int swapfree = 0;
476 static long bufspace = 0;
477 static uint64_t nspgsin, nspgsout;
479 GETSYSCTL("vfs.bufspace", bufspace);
480 GETSYSCTL("vm.stats.vm.v_active_count", memory_stats[0]);
481 GETSYSCTL("vm.stats.vm.v_inactive_count", memory_stats[1]);
482 GETSYSCTL("vm.stats.vm.v_laundry_count", memory_stats[2]);
483 GETSYSCTL("vm.stats.vm.v_wire_count", memory_stats[3]);
484 GETSYSCTL("vm.stats.vm.v_free_count", memory_stats[5]);
485 GETSYSCTL("vm.stats.vm.v_swappgsin", nspgsin);
486 GETSYSCTL("vm.stats.vm.v_swappgsout", nspgsout);
487 /* convert memory stats to Kbytes */
488 memory_stats[0] = pagetok(memory_stats[0]);
489 memory_stats[1] = pagetok(memory_stats[1]);
490 memory_stats[2] = pagetok(memory_stats[2]);
491 memory_stats[3] = pagetok(memory_stats[3]);
492 memory_stats[4] = bufspace / 1024;
493 memory_stats[5] = pagetok(memory_stats[5]);
494 memory_stats[6] = -1;
502 /* compute differences between old and new swap statistic */
504 swap_stats[4] = pagetok(((nspgsin - swappgsin)));
505 swap_stats[5] = pagetok(((nspgsout - swappgsout)));
509 swappgsout = nspgsout;
511 /* call CPU heavy swapmode() only for changes */
512 if (swap_stats[4] > 0 || swap_stats[5] > 0 || swap_delay == 0) {
513 swap_stats[3] = swapmode(&swapavail, &swapfree);
514 swap_stats[0] = swapavail;
515 swap_stats[1] = swapavail - swapfree;
516 swap_stats[2] = swapfree;
523 GETSYSCTL("kstat.zfs.misc.arcstats.size", arc_stat);
524 arc_stats[0] = arc_stat >> 10;
525 GETSYSCTL("vfs.zfs.mfu_size", arc_stat);
526 arc_stats[1] = arc_stat >> 10;
527 GETSYSCTL("vfs.zfs.mru_size", arc_stat);
528 arc_stats[2] = arc_stat >> 10;
529 GETSYSCTL("vfs.zfs.anon_size", arc_stat);
530 arc_stats[3] = arc_stat >> 10;
531 GETSYSCTL("kstat.zfs.misc.arcstats.hdr_size", arc_stat);
532 GETSYSCTL("kstat.zfs.misc.arcstats.l2_hdr_size", arc_stat2);
533 arc_stats[4] = (arc_stat + arc_stat2) >> 10;
534 GETSYSCTL("kstat.zfs.misc.arcstats.bonus_size", arc_stat);
535 arc_stats[5] = arc_stat >> 10;
536 GETSYSCTL("kstat.zfs.misc.arcstats.dnode_size", arc_stat);
537 arc_stats[5] += arc_stat >> 10;
538 GETSYSCTL("kstat.zfs.misc.arcstats.dbuf_size", arc_stat);
539 arc_stats[5] += arc_stat >> 10;
543 GETSYSCTL("kstat.zfs.misc.arcstats.compressed_size", arc_stat);
544 carc_stats[0] = arc_stat >> 10;
545 carc_stats[2] = arc_stat >> 10; /* For ratio */
546 GETSYSCTL("kstat.zfs.misc.arcstats.uncompressed_size", arc_stat);
547 carc_stats[1] = arc_stat >> 10;
548 si->carc = carc_stats;
551 /* set arrays and strings */
553 si->cpustates = pcpu_cpu_states;
556 si->cpustates = cpu_states;
559 si->memory = memory_stats;
560 si->swap = swap_stats;
564 si->last_pid = lastpid;
570 * Print how long system has been up.
571 * (Found by looking getting "boottime" from the kernel)
574 mib[1] = KERN_BOOTTIME;
575 size = sizeof(boottime);
576 if (sysctl(mib, nitems(mib), &boottime, &size, NULL, 0) != -1 &&
577 boottime.tv_sec != 0) {
578 si->boottime = boottime;
580 si->boottime.tv_sec = -1;
584 #define NOPROC ((void *)-1)
587 * We need to compare data from the old process entry with the new
589 * To facilitate doing this quickly we stash a pointer in the kinfo_proc
590 * structure to cache the mapping. We also use a negative cache pointer
591 * of NOPROC to avoid duplicate lookups.
592 * XXX: this could be done when the actual processes are fetched, we do
593 * it here out of laziness.
595 static const struct kinfo_proc *
596 get_old_proc(struct kinfo_proc *pp)
598 const struct kinfo_proc * const *oldpp, *oldp;
601 * If this is the first fetch of the kinfo_procs then we don't have
602 * any previous entries.
604 if (previous_proc_count == 0)
606 /* negative cache? */
607 if (pp->ki_udata == NOPROC)
610 if (pp->ki_udata != NULL)
611 return (pp->ki_udata);
614 * 1) look up based on pid.
615 * 2) compare process start.
616 * If we fail here, then setup a negative cache entry, otherwise
619 oldpp = bsearch(&pp, previous_pref, previous_proc_count,
620 sizeof(*previous_pref), ps.thread ? compare_tid : compare_pid);
622 pp->ki_udata = NOPROC;
626 if (memcmp(&oldp->ki_start, &pp->ki_start, sizeof(pp->ki_start)) != 0) {
627 pp->ki_udata = NOPROC;
630 pp->ki_udata = __DECONST(void *, oldp);
635 * Return the total amount of IO done in blocks in/out and faults.
636 * store the values individually in the pointers passed in.
639 get_io_stats(const struct kinfo_proc *pp, long *inp, long *oup, long *flp,
640 long *vcsw, long *ivcsw)
642 const struct kinfo_proc *oldp;
643 static struct kinfo_proc dummy;
646 oldp = get_old_proc(__DECONST(struct kinfo_proc *, pp));
648 memset(&dummy, 0, sizeof(dummy));
651 *inp = RU(pp)->ru_inblock - RU(oldp)->ru_inblock;
652 *oup = RU(pp)->ru_oublock - RU(oldp)->ru_oublock;
653 *flp = RU(pp)->ru_majflt - RU(oldp)->ru_majflt;
654 *vcsw = RU(pp)->ru_nvcsw - RU(oldp)->ru_nvcsw;
655 *ivcsw = RU(pp)->ru_nivcsw - RU(oldp)->ru_nivcsw;
657 (RU(pp)->ru_inblock - RU(oldp)->ru_inblock) +
658 (RU(pp)->ru_oublock - RU(oldp)->ru_oublock) +
659 (RU(pp)->ru_majflt - RU(oldp)->ru_majflt);
664 * If there was a previous update, use the delta in ki_runtime over
665 * the previous interval to calculate pctcpu. Otherwise, fall back
666 * to using the kernel's ki_pctcpu.
669 proc_calc_pctcpu(struct kinfo_proc *pp)
671 const struct kinfo_proc *oldp;
673 if (previous_interval != 0) {
674 oldp = get_old_proc(pp);
676 return ((double)(pp->ki_runtime - oldp->ki_runtime)
677 / previous_interval);
680 * If this process/thread was created during the previous
681 * interval, charge it's total runtime to the previous
684 else if (pp->ki_start.tv_sec > previous_wall_time.tv_sec ||
685 (pp->ki_start.tv_sec == previous_wall_time.tv_sec &&
686 pp->ki_start.tv_usec >= previous_wall_time.tv_usec))
687 return ((double)pp->ki_runtime / previous_interval);
689 return (pctdouble(pp->ki_pctcpu));
693 * Return true if this process has used any CPU time since the
697 proc_used_cpu(struct kinfo_proc *pp)
699 const struct kinfo_proc *oldp;
701 oldp = get_old_proc(pp);
703 return (PCTCPU(pp) != 0);
704 return (pp->ki_runtime != oldp->ki_runtime ||
705 RU(pp)->ru_nvcsw != RU(oldp)->ru_nvcsw ||
706 RU(pp)->ru_nivcsw != RU(oldp)->ru_nivcsw);
710 * Return the total number of block in/out and faults by a process.
713 get_io_total(const struct kinfo_proc *pp)
717 return (get_io_stats(pp, &dummy, &dummy, &dummy, &dummy, &dummy));
720 static struct handle handle;
723 get_process_info(struct system_info *si, struct process_select *sel,
724 int (*compare)(const void *, const void *))
729 long p_inblock, p_oublock, p_majflt, p_vcsw, p_ivcsw;
732 struct kinfo_proc **prefp;
733 struct kinfo_proc *pp;
734 struct timespec previous_proc_uptime;
737 * If thread state was toggled, don't cache the previous processes.
739 if (previous_thread != sel->thread)
741 previous_thread = sel->thread;
744 * Save the previous process info.
746 if (previous_proc_count_max < nproc) {
747 free(previous_procs);
748 previous_procs = calloc(nproc, sizeof(*previous_procs));
750 previous_pref = calloc(nproc, sizeof(*previous_pref));
751 if (previous_procs == NULL || previous_pref == NULL) {
752 fprintf(stderr, "top: Out of memory.\n");
753 quit(TOP_EX_SYS_ERROR);
755 previous_proc_count_max = nproc;
758 for (i = 0; i < nproc; i++)
759 previous_pref[i] = &previous_procs[i];
760 memcpy(previous_procs, pbase, nproc * sizeof(*previous_procs));
761 qsort(previous_pref, nproc, sizeof(*previous_pref),
762 ps.thread ? compare_tid : compare_pid);
764 previous_proc_count = nproc;
765 previous_proc_uptime = proc_uptime;
766 previous_wall_time = proc_wall_time;
767 previous_interval = 0;
769 pbase = kvm_getprocs(kd, sel->thread ? KERN_PROC_ALL : KERN_PROC_PROC,
771 gettimeofday(&proc_wall_time, NULL);
772 if (clock_gettime(CLOCK_UPTIME, &proc_uptime) != 0)
773 memset(&proc_uptime, 0, sizeof(proc_uptime));
774 else if (previous_proc_uptime.tv_sec != 0 &&
775 previous_proc_uptime.tv_nsec != 0) {
776 previous_interval = (proc_uptime.tv_sec -
777 previous_proc_uptime.tv_sec) * 1000000;
778 nsec = proc_uptime.tv_nsec - previous_proc_uptime.tv_nsec;
780 previous_interval -= 1000000;
783 previous_interval += nsec / 1000;
785 if (nproc > onproc) {
786 pref = realloc(pref, sizeof(*pref) * nproc);
787 pcpu = realloc(pcpu, sizeof(*pcpu) * nproc);
790 if (pref == NULL || pbase == NULL || pcpu == NULL) {
791 fprintf(stderr, "top: Out of memory.\n");
792 quit(TOP_EX_SYS_ERROR);
794 /* get a pointer to the states summary array */
795 si->procstates = process_states;
797 /* count up process states and get pointers to interesting procs */
803 memset(process_states, 0, sizeof(process_states));
805 for (pp = pbase, i = 0; i < nproc; pp++, i++) {
807 if (pp->ki_stat == 0)
811 if (!sel->self && pp->ki_pid == mypid && sel->pid == -1)
815 if (!sel->system && (pp->ki_flag & P_SYSTEM) && sel->pid == -1)
816 /* skip system process */
819 p_io = get_io_stats(pp, &p_inblock, &p_oublock, &p_majflt,
821 total_inblock += p_inblock;
822 total_oublock += p_oublock;
823 total_majflt += p_majflt;
825 process_states[(unsigned char)pp->ki_stat]++;
827 if (pp->ki_stat == SZOMB)
831 if (!sel->kidle && pp->ki_tdflags & TDF_IDLETD && sel->pid == -1)
832 /* skip kernel idle process */
835 PCTCPU(pp) = proc_calc_pctcpu(pp);
836 if (sel->thread && PCTCPU(pp) > 1.0)
838 if (displaymode == DISP_CPU && !sel->idle &&
839 (!proc_used_cpu(pp) ||
840 pp->ki_stat == SSTOP || pp->ki_stat == SIDL))
841 /* skip idle or non-running processes */
844 if (displaymode == DISP_IO && !sel->idle && p_io == 0)
845 /* skip processes that aren't doing I/O */
848 if (sel->jid != -1 && pp->ki_jid != sel->jid)
849 /* skip proc. that don't belong to the selected JID */
852 if (sel->uid[0] != -1 && !find_uid(pp->ki_ruid, sel->uid))
853 /* skip proc. that don't belong to the selected UID */
856 if (sel->pid != -1 && pp->ki_pid != sel->pid)
863 /* if requested, sort the "interesting" processes */
865 qsort(pref, active_procs, sizeof(*pref), compare);
867 /* remember active and total counts */
868 si->p_total = total_procs;
869 si->p_pactive = pref_len = active_procs;
871 /* pass back a handle */
872 handle.next_proc = pref;
873 handle.remaining = active_procs;
878 format_next_process(struct handle * xhandle, char *(*get_userid)(int), int flags)
880 struct kinfo_proc *pp;
881 const struct kinfo_proc *oldp;
885 struct rusage ru, *rup;
889 static struct sbuf* procbuf = NULL;
891 /* clean up from last time. */
892 if (procbuf != NULL) {
895 procbuf = sbuf_new_auto();
899 /* find and remember the next proc structure */
900 pp = *(xhandle->next_proc++);
901 xhandle->remaining--;
903 /* get the process's command name */
904 if ((pp->ki_flag & P_INMEM) == 0) {
906 * Print swapped processes as <pname>
910 len = strlen(pp->ki_comm);
911 if (len > sizeof(pp->ki_comm) - 3)
912 len = sizeof(pp->ki_comm) - 3;
913 memmove(pp->ki_comm + 1, pp->ki_comm, len);
914 pp->ki_comm[0] = '<';
915 pp->ki_comm[len + 1] = '>';
916 pp->ki_comm[len + 2] = '\0';
920 * Convert the process's runtime from microseconds to seconds. This
921 * time includes the interrupt time although that is not wanted here.
922 * ps(1) is similarly sloppy.
924 cputime = (pp->ki_runtime + 500000) / 1000000;
926 /* generate "STATE" field */
927 switch (state = pp->ki_stat) {
929 if (smpmode && pp->ki_oncpu != NOCPU)
930 sprintf(status, "CPU%d", pp->ki_oncpu);
932 strcpy(status, "RUN");
935 if (pp->ki_kiflag & KI_LOCKBLOCK) {
936 sprintf(status, "*%.6s", pp->ki_lockname);
941 sprintf(status, "%.6s", pp->ki_wmesg);
945 if (state < nitems(state_abbrev)) {
946 sprintf(status, "%.6s", state_abbrev[state]);
948 sprintf(status, "?%5zu", state);
953 cmdbuf = calloc(screen_width + 1, 1);
954 if (cmdbuf == NULL) {
955 warn("calloc(%d)", screen_width + 1);
959 if (!(flags & FMT_SHOWARGS)) {
960 if (ps.thread && pp->ki_flag & P_HADTHREADS &&
962 snprintf(cmdbuf, screen_width, "%s{%s%s}", pp->ki_comm,
963 pp->ki_tdname, pp->ki_moretdname);
965 snprintf(cmdbuf, screen_width, "%s", pp->ki_comm);
968 if (pp->ki_flag & P_SYSTEM ||
969 (args = kvm_getargv(kd, pp, screen_width)) == NULL ||
971 if (ps.thread && pp->ki_flag & P_HADTHREADS &&
973 snprintf(cmdbuf, screen_width,
974 "[%s{%s%s}]", pp->ki_comm, pp->ki_tdname,
977 snprintf(cmdbuf, screen_width,
978 "[%s]", pp->ki_comm);
987 argbuflen = screen_width * 4;
988 argbuf = calloc(argbuflen + 1, 1);
989 if (argbuf == NULL) {
990 warn("calloc(%zu)", argbuflen + 1);
997 /* Extract cmd name from argv */
998 cmd = basename(*args);
1000 for (; (src = *args++) != NULL; ) {
1003 len = (argbuflen - (dst - argbuf) - 1) / 4;
1005 MIN(strlen(src), len),
1006 VIS_NL | VIS_CSTYLE);
1007 while (*dst != '\0')
1009 if ((argbuflen - (dst - argbuf) - 1) / 4 > 0)
1010 *dst++ = ' '; /* add delimiting space */
1012 if (dst != argbuf && dst[-1] == ' ')
1016 if (strcmp(cmd, pp->ki_comm) != 0) {
1017 if (ps.thread && pp->ki_flag & P_HADTHREADS &&
1019 snprintf(cmdbuf, screen_width,
1020 "%s (%s){%s%s}", argbuf,
1021 pp->ki_comm, pp->ki_tdname,
1024 snprintf(cmdbuf, screen_width,
1025 "%s (%s)", argbuf, pp->ki_comm);
1027 if (ps.thread && pp->ki_flag & P_HADTHREADS &&
1029 snprintf(cmdbuf, screen_width,
1030 "%s{%s%s}", argbuf, pp->ki_tdname,
1033 strlcpy(cmdbuf, argbuf, screen_width);
1039 if (displaymode == DISP_IO) {
1040 oldp = get_old_proc(pp);
1042 ru.ru_inblock = RU(pp)->ru_inblock -
1043 RU(oldp)->ru_inblock;
1044 ru.ru_oublock = RU(pp)->ru_oublock -
1045 RU(oldp)->ru_oublock;
1046 ru.ru_majflt = RU(pp)->ru_majflt - RU(oldp)->ru_majflt;
1047 ru.ru_nvcsw = RU(pp)->ru_nvcsw - RU(oldp)->ru_nvcsw;
1048 ru.ru_nivcsw = RU(pp)->ru_nivcsw - RU(oldp)->ru_nivcsw;
1053 p_tot = rup->ru_inblock + rup->ru_oublock + rup->ru_majflt;
1054 s_tot = total_inblock + total_oublock + total_majflt;
1056 sbuf_printf(procbuf, "%5d ", (ps.thread_id) ? pp->ki_tid : pp->ki_pid);
1059 sbuf_printf(procbuf, "%*d ", TOP_JID_LEN - 1, pp->ki_jid);
1061 sbuf_printf(procbuf, "%-*.*s", namelength, namelength, (*get_userid)(pp->ki_ruid));
1062 sbuf_printf(procbuf, "%6ld ", rup->ru_nvcsw);
1063 sbuf_printf(procbuf, "%6ld ", rup->ru_nivcsw);
1064 sbuf_printf(procbuf, "%6ld ", rup->ru_inblock);
1065 sbuf_printf(procbuf, "%6ld ", rup->ru_oublock);
1066 sbuf_printf(procbuf, "%6ld ", rup->ru_majflt);
1067 sbuf_printf(procbuf, "%6ld ", p_tot);
1068 sbuf_printf(procbuf, "%6.2f%% ", s_tot == 0 ? 0.0 : (p_tot * 100.0 / s_tot));
1071 sbuf_printf(procbuf, "%5d ", (ps.thread_id) ? pp->ki_tid : pp->ki_pid);
1073 sbuf_printf(procbuf, "%*d ", TOP_JID_LEN - 1, pp->ki_jid);
1075 sbuf_printf(procbuf, "%-*.*s ", namelength, namelength, (*get_userid)(pp->ki_ruid));
1078 sbuf_printf(procbuf, "%4d ", pp->ki_numthreads);
1080 sbuf_printf(procbuf, " ");
1083 sbuf_printf(procbuf, "%3d ", pp->ki_pri.pri_level - PZERO);
1084 sbuf_printf(procbuf, "%4s", format_nice(pp));
1085 sbuf_printf(procbuf, "%7s ", format_k(PROCSIZE(pp)));
1086 sbuf_printf(procbuf, "%6s ", format_k(pagetok(pp->ki_rssize)));
1088 sbuf_printf(procbuf, "%*s ",
1090 format_k(pagetok(ki_swap(pp))));
1092 sbuf_printf(procbuf, "%-6.6s ", status);
1095 if (state == SRUN && pp->ki_oncpu != NOCPU) {
1098 cpu = pp->ki_lastcpu;
1100 sbuf_printf(procbuf, "%3d ", cpu);
1102 sbuf_printf(procbuf, "%6s ", format_time(cputime));
1103 sbuf_printf(procbuf, "%6.2f%% ", ps.wcpu ? 100.0 * weighted_cpu(PCTCPU(pp), pp) : 100.0 * PCTCPU(pp));
1105 sbuf_printf(procbuf, "%s", printable(cmdbuf));
1107 return (sbuf_data(procbuf));
1111 getsysctl(const char *name, void *ptr, size_t len)
1115 if (sysctlbyname(name, ptr, &nlen, NULL, 0) == -1) {
1116 fprintf(stderr, "top: sysctl(%s...) failed: %s\n", name,
1118 quit(TOP_EX_SYS_ERROR);
1121 fprintf(stderr, "top: sysctl(%s...) expected %lu, got %lu\n",
1122 name, (unsigned long)len, (unsigned long)nlen);
1123 quit(TOP_EX_SYS_ERROR);
1128 format_nice(const struct kinfo_proc *pp)
1130 const char *fifo, *kproc;
1132 static char nicebuf[4 + 1];
1134 fifo = PRI_NEED_RR(pp->ki_pri.pri_class) ? "" : "F";
1135 kproc = (pp->ki_flag & P_KPROC) ? "k" : "";
1136 switch (PRI_BASE(pp->ki_pri.pri_class)) {
1141 * XXX: the kernel doesn't tell us the original rtprio and
1142 * doesn't really know what it was, so to recover it we
1143 * must be more chummy with the implementation than the
1144 * implementation is with itself. pri_user gives a
1145 * constant "base" priority, but is only initialized
1146 * properly for user threads. pri_native gives what the
1147 * kernel calls the "base" priority, but it isn't constant
1148 * since it is changed by priority propagation. pri_native
1149 * also isn't properly initialized for all threads, but it
1150 * is properly initialized for kernel realtime and idletime
1151 * threads. Thus we use pri_user for the base priority of
1152 * user threads (it is always correct) and pri_native for
1153 * the base priority of kernel realtime and idletime threads
1154 * (there is nothing better, and it is usually correct).
1156 * The field width and thus the buffer are too small for
1157 * values like "kr31F", but such values shouldn't occur,
1158 * and if they do then the tailing "F" is not displayed.
1160 rtpri = ((pp->ki_flag & P_KPROC) ? pp->ki_pri.pri_native :
1161 pp->ki_pri.pri_user) - PRI_MIN_REALTIME;
1162 snprintf(nicebuf, sizeof(nicebuf), "%sr%d%s",
1163 kproc, rtpri, fifo);
1166 if (pp->ki_flag & P_KPROC)
1168 snprintf(nicebuf, sizeof(nicebuf), "%d", pp->ki_nice - NZERO);
1171 /* XXX: as above. */
1172 rtpri = ((pp->ki_flag & P_KPROC) ? pp->ki_pri.pri_native :
1173 pp->ki_pri.pri_user) - PRI_MIN_IDLE;
1174 snprintf(nicebuf, sizeof(nicebuf), "%si%d%s",
1175 kproc, rtpri, fifo);
1183 /* comparison routines for qsort */
1186 compare_pid(const void *p1, const void *p2)
1188 const struct kinfo_proc * const *pp1 = p1;
1189 const struct kinfo_proc * const *pp2 = p2;
1191 assert((*pp2)->ki_pid >= 0 && (*pp1)->ki_pid >= 0);
1193 return ((*pp1)->ki_pid - (*pp2)->ki_pid);
1197 compare_tid(const void *p1, const void *p2)
1199 const struct kinfo_proc * const *pp1 = p1;
1200 const struct kinfo_proc * const *pp2 = p2;
1202 assert((*pp2)->ki_tid >= 0 && (*pp1)->ki_tid >= 0);
1204 return ((*pp1)->ki_tid - (*pp2)->ki_tid);
1208 * proc_compare - comparison function for "qsort"
1209 * Compares the resource consumption of two processes using five
1210 * distinct keys. The keys (in descending order of importance) are:
1211 * percent cpu, cpu ticks, state, resident set size, total virtual
1212 * memory usage. The process states are ordered as follows (from least
1213 * to most important): WAIT, zombie, sleep, stop, start, run. The
1214 * array declaration below maps a process state index into a number
1215 * that reflects this ordering.
1218 static int sorted_state[] = {
1221 1, /* ABANDONED (WAIT) */
1229 #define ORDERKEY_PCTCPU(a, b) do { \
1232 diff = weighted_cpu(PCTCPU((b)), (b)) - \
1233 weighted_cpu(PCTCPU((a)), (a)); \
1235 diff = PCTCPU((b)) - PCTCPU((a)); \
1237 return (diff > 0 ? 1 : -1); \
1240 #define ORDERKEY_CPTICKS(a, b) do { \
1241 int64_t diff = (int64_t)(b)->ki_runtime - (int64_t)(a)->ki_runtime; \
1243 return (diff > 0 ? 1 : -1); \
1246 #define ORDERKEY_STATE(a, b) do { \
1247 int diff = sorted_state[(unsigned char)(b)->ki_stat] - sorted_state[(unsigned char)(a)->ki_stat]; \
1249 return (diff > 0 ? 1 : -1); \
1252 #define ORDERKEY_PRIO(a, b) do { \
1253 int diff = (int)(b)->ki_pri.pri_level - (int)(a)->ki_pri.pri_level; \
1255 return (diff > 0 ? 1 : -1); \
1258 #define ORDERKEY_THREADS(a, b) do { \
1259 int diff = (int)(b)->ki_numthreads - (int)(a)->ki_numthreads; \
1261 return (diff > 0 ? 1 : -1); \
1264 #define ORDERKEY_RSSIZE(a, b) do { \
1265 long diff = (long)(b)->ki_rssize - (long)(a)->ki_rssize; \
1267 return (diff > 0 ? 1 : -1); \
1270 #define ORDERKEY_MEM(a, b) do { \
1271 long diff = (long)PROCSIZE((b)) - (long)PROCSIZE((a)); \
1273 return (diff > 0 ? 1 : -1); \
1276 #define ORDERKEY_JID(a, b) do { \
1277 int diff = (int)(b)->ki_jid - (int)(a)->ki_jid; \
1279 return (diff > 0 ? 1 : -1); \
1282 #define ORDERKEY_SWAP(a, b) do { \
1283 int diff = (int)ki_swap(b) - (int)ki_swap(a); \
1285 return (diff > 0 ? 1 : -1); \
1288 /* compare_cpu - the comparison function for sorting by cpu percentage */
1291 compare_cpu(const void *arg1, const void *arg2)
1293 const struct kinfo_proc *p1 = *(const struct kinfo_proc * const *)arg1;
1294 const struct kinfo_proc *p2 = *(const struct kinfo_proc * const *)arg2;
1296 ORDERKEY_PCTCPU(p1, p2);
1297 ORDERKEY_CPTICKS(p1, p2);
1298 ORDERKEY_STATE(p1, p2);
1299 ORDERKEY_PRIO(p1, p2);
1300 ORDERKEY_RSSIZE(p1, p2);
1301 ORDERKEY_MEM(p1, p2);
1306 /* compare_size - the comparison function for sorting by total memory usage */
1309 compare_size(const void *arg1, const void *arg2)
1311 const struct kinfo_proc *p1 = *(const struct kinfo_proc * const *)arg1;
1312 const struct kinfo_proc *p2 = *(const struct kinfo_proc * const *)arg2;
1314 ORDERKEY_MEM(p1, p2);
1315 ORDERKEY_RSSIZE(p1, p2);
1316 ORDERKEY_PCTCPU(p1, p2);
1317 ORDERKEY_CPTICKS(p1, p2);
1318 ORDERKEY_STATE(p1, p2);
1319 ORDERKEY_PRIO(p1, p2);
1324 /* compare_res - the comparison function for sorting by resident set size */
1327 compare_res(const void *arg1, const void *arg2)
1329 const struct kinfo_proc *p1 = *(const struct kinfo_proc * const *)arg1;
1330 const struct kinfo_proc *p2 = *(const struct kinfo_proc * const *)arg2;
1332 ORDERKEY_RSSIZE(p1, p2);
1333 ORDERKEY_MEM(p1, p2);
1334 ORDERKEY_PCTCPU(p1, p2);
1335 ORDERKEY_CPTICKS(p1, p2);
1336 ORDERKEY_STATE(p1, p2);
1337 ORDERKEY_PRIO(p1, p2);
1342 /* compare_time - the comparison function for sorting by total cpu time */
1345 compare_time(const void *arg1, const void *arg2)
1347 const struct kinfo_proc *p1 = *(const struct kinfo_proc * const *)arg1;
1348 const struct kinfo_proc *p2 = *(const struct kinfo_proc * const *) arg2;
1350 ORDERKEY_CPTICKS(p1, p2);
1351 ORDERKEY_PCTCPU(p1, p2);
1352 ORDERKEY_STATE(p1, p2);
1353 ORDERKEY_PRIO(p1, p2);
1354 ORDERKEY_RSSIZE(p1, p2);
1355 ORDERKEY_MEM(p1, p2);
1360 /* compare_prio - the comparison function for sorting by priority */
1363 compare_prio(const void *arg1, const void *arg2)
1365 const struct kinfo_proc *p1 = *(const struct kinfo_proc * const *)arg1;
1366 const struct kinfo_proc *p2 = *(const struct kinfo_proc * const *)arg2;
1368 ORDERKEY_PRIO(p1, p2);
1369 ORDERKEY_CPTICKS(p1, p2);
1370 ORDERKEY_PCTCPU(p1, p2);
1371 ORDERKEY_STATE(p1, p2);
1372 ORDERKEY_RSSIZE(p1, p2);
1373 ORDERKEY_MEM(p1, p2);
1378 /* compare_threads - the comparison function for sorting by threads */
1380 compare_threads(const void *arg1, const void *arg2)
1382 const struct kinfo_proc *p1 = *(const struct kinfo_proc * const *)arg1;
1383 const struct kinfo_proc *p2 = *(const struct kinfo_proc * const *)arg2;
1385 ORDERKEY_THREADS(p1, p2);
1386 ORDERKEY_PCTCPU(p1, p2);
1387 ORDERKEY_CPTICKS(p1, p2);
1388 ORDERKEY_STATE(p1, p2);
1389 ORDERKEY_PRIO(p1, p2);
1390 ORDERKEY_RSSIZE(p1, p2);
1391 ORDERKEY_MEM(p1, p2);
1396 /* compare_jid - the comparison function for sorting by jid */
1398 compare_jid(const void *arg1, const void *arg2)
1400 const struct kinfo_proc *p1 = *(const struct kinfo_proc * const *)arg1;
1401 const struct kinfo_proc *p2 = *(const struct kinfo_proc * const *)arg2;
1403 ORDERKEY_JID(p1, p2);
1404 ORDERKEY_PCTCPU(p1, p2);
1405 ORDERKEY_CPTICKS(p1, p2);
1406 ORDERKEY_STATE(p1, p2);
1407 ORDERKEY_PRIO(p1, p2);
1408 ORDERKEY_RSSIZE(p1, p2);
1409 ORDERKEY_MEM(p1, p2);
1414 /* compare_swap - the comparison function for sorting by swap */
1416 compare_swap(const void *arg1, const void *arg2)
1418 const struct kinfo_proc *p1 = *(const struct kinfo_proc * const *)arg1;
1419 const struct kinfo_proc *p2 = *(const struct kinfo_proc * const *)arg2;
1421 ORDERKEY_SWAP(p1, p2);
1422 ORDERKEY_PCTCPU(p1, p2);
1423 ORDERKEY_CPTICKS(p1, p2);
1424 ORDERKEY_STATE(p1, p2);
1425 ORDERKEY_PRIO(p1, p2);
1426 ORDERKEY_RSSIZE(p1, p2);
1427 ORDERKEY_MEM(p1, p2);
1432 /* assorted comparison functions for sorting by i/o */
1435 compare_iototal(const void *arg1, const void *arg2)
1437 const struct kinfo_proc * const p1 = *(const struct kinfo_proc * const *)arg1;
1438 const struct kinfo_proc * const p2 = *(const struct kinfo_proc * const *)arg2;
1440 return (get_io_total(p2) - get_io_total(p1));
1444 compare_ioread(const void *arg1, const void *arg2)
1446 const struct kinfo_proc *p1 = *(const struct kinfo_proc * const *)arg1;
1447 const struct kinfo_proc *p2 = *(const struct kinfo_proc * const *)arg2;
1448 long dummy, inp1, inp2;
1450 (void) get_io_stats(p1, &inp1, &dummy, &dummy, &dummy, &dummy);
1451 (void) get_io_stats(p2, &inp2, &dummy, &dummy, &dummy, &dummy);
1453 return (inp2 - inp1);
1457 compare_iowrite(const void *arg1, const void *arg2)
1459 const struct kinfo_proc *p1 = *(const struct kinfo_proc * const *)arg1;
1460 const struct kinfo_proc *p2 = *(const struct kinfo_proc * const *)arg2;
1461 long dummy, oup1, oup2;
1463 (void) get_io_stats(p1, &dummy, &oup1, &dummy, &dummy, &dummy);
1464 (void) get_io_stats(p2, &dummy, &oup2, &dummy, &dummy, &dummy);
1466 return (oup2 - oup1);
1470 compare_iofault(const void *arg1, const void *arg2)
1472 const struct kinfo_proc *p1 = *(const struct kinfo_proc * const *)arg1;
1473 const struct kinfo_proc *p2 = *(const struct kinfo_proc * const *)arg2;
1474 long dummy, flp1, flp2;
1476 (void) get_io_stats(p1, &dummy, &dummy, &flp1, &dummy, &dummy);
1477 (void) get_io_stats(p2, &dummy, &dummy, &flp2, &dummy, &dummy);
1479 return (flp2 - flp1);
1483 compare_vcsw(const void *arg1, const void *arg2)
1485 const struct kinfo_proc *p1 = *(const struct kinfo_proc * const *)arg1;
1486 const struct kinfo_proc *p2 = *(const struct kinfo_proc * const *)arg2;
1487 long dummy, flp1, flp2;
1489 (void) get_io_stats(p1, &dummy, &dummy, &dummy, &flp1, &dummy);
1490 (void) get_io_stats(p2, &dummy, &dummy, &dummy, &flp2, &dummy);
1492 return (flp2 - flp1);
1496 compare_ivcsw(const void *arg1, const void *arg2)
1498 const struct kinfo_proc *p1 = *(const struct kinfo_proc * const *)arg1;
1499 const struct kinfo_proc *p2 = *(const struct kinfo_proc * const *)arg2;
1500 long dummy, flp1, flp2;
1502 (void) get_io_stats(p1, &dummy, &dummy, &dummy, &dummy, &flp1);
1503 (void) get_io_stats(p2, &dummy, &dummy, &dummy, &dummy, &flp2);
1505 return (flp2 - flp1);
1508 int (*compares[])(const void *arg1, const void *arg2) = {
1528 swapmode(int *retavail, int *retfree)
1531 struct kvm_swap swapary[1];
1532 static int pagesize = 0;
1533 static unsigned long swap_maxpages = 0;
1538 #define CONVERT(v) ((quad_t)(v) * pagesize / 1024)
1540 n = kvm_getswapinfo(kd, swapary, 1, 0);
1541 if (n < 0 || swapary[0].ksw_total == 0)
1545 pagesize = getpagesize();
1546 if (swap_maxpages == 0)
1547 GETSYSCTL("vm.swap_maxpages", swap_maxpages);
1549 /* ksw_total contains the total size of swap all devices which may
1550 exceed the maximum swap size allocatable in the system */
1551 if ( swapary[0].ksw_total > swap_maxpages )
1552 swapary[0].ksw_total = swap_maxpages;
1554 *retavail = CONVERT(swapary[0].ksw_total);
1555 *retfree = CONVERT(swapary[0].ksw_total - swapary[0].ksw_used);
1559 n = (int)(swapary[0].ksw_used * 100.0 / swapary[0].ksw_total);