Annotation of src/usr.bin/top/machine.c, Revision 1.100
1.100 ! kn 1: /* $OpenBSD: machine.c,v 1.99 2019/10/06 15:08:54 kn Exp $ */
1.28 tholo 2:
3: /*-
4: * Copyright (c) 1994 Thorsten Lockert <tholo@sigmasoft.com>
5: * All rights reserved.
6: *
7: * Redistribution and use in source and binary forms, with or without
8: * modification, are permitted provided that the following conditions
9: * are met:
10: * 1. Redistributions of source code must retain the above copyright
11: * notice, this list of conditions and the following disclaimer.
12: * 2. Redistributions in binary form must reproduce the above copyright
13: * notice, this list of conditions and the following disclaimer in the
14: * documentation and/or other materials provided with the distribution.
15: * 3. The name of the author may not be used to endorse or promote products
16: * derived from this software without specific prior written permission.
17: *
18: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
19: * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
20: * AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
21: * THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
22: * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
23: * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
24: * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
25: * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
26: * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
27: * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1.1 downsj 28: *
29: * AUTHOR: Thorsten Lockert <tholo@sigmasoft.com>
30: * Adapted from BSD4.4 by Christos Zoulas <christos@ee.cornell.edu>
31: * Patch for process wait display by Jarl F. Greipsland <jarle@idt.unit.no>
1.11 kstailey 32: * Patch for -DORDER by Kenneth Stailey <kstailey@disclosure.com>
1.15 weingart 33: * Patch for new swapctl(2) by Tobias Weingartner <weingart@openbsd.org>
1.1 downsj 34: */
35:
1.81 deraadt 36: #include <sys/param.h> /* DEV_BSIZE MAXCOMLEN PZERO */
1.1 downsj 37: #include <sys/types.h>
1.81 deraadt 38: #include <sys/signal.h>
1.75 millert 39: #include <sys/mount.h>
40: #include <sys/proc.h>
1.79 miod 41: #include <sys/sched.h>
1.75 millert 42: #include <sys/swap.h>
43: #include <sys/sysctl.h>
44:
1.1 downsj 45: #include <stdio.h>
46: #include <stdlib.h>
1.3 downsj 47: #include <string.h>
1.1 downsj 48: #include <unistd.h>
49: #include <err.h>
1.51 millert 50: #include <errno.h>
1.1 downsj 51:
52: #include "top.h"
1.3 downsj 53: #include "display.h"
1.1 downsj 54: #include "machine.h"
55: #include "utils.h"
1.31 deraadt 56:
1.38 deraadt 57: static int swapmode(int *, int *);
1.68 guenther 58: static char *state_abbr(struct kinfo_proc *);
59: static char *format_comm(struct kinfo_proc *);
1.86 edd 60: static int cmd_matches(struct kinfo_proc *, char *);
61: static char **get_proc_args(struct kinfo_proc *);
1.1 downsj 62:
63: /* get_process_info passes back a handle. This is what it looks like: */
64:
1.20 deraadt 65: struct handle {
1.68 guenther 66: struct kinfo_proc **next_proc; /* points to next valid proc pointer */
1.38 deraadt 67: int remaining; /* number of pointers remaining */
1.1 downsj 68: };
69:
70: /* what we consider to be process size: */
1.37 millert 71: #define PROCSIZE(pp) ((pp)->p_vm_tsize + (pp)->p_vm_dsize + (pp)->p_vm_ssize)
1.1 downsj 72:
73: /*
74: * These definitions control the format of the per-process area
75: */
1.38 deraadt 76: static char header[] =
1.64 deraadt 77: " PID X PRI NICE SIZE RES STATE WAIT TIME CPU COMMAND";
1.31 deraadt 78:
1.1 downsj 79: /* 0123456 -- field to fill in starts at header+6 */
80: #define UNAME_START 6
81:
82: #define Proc_format \
1.64 deraadt 83: "%5d %-8.8s %3d %4d %5s %5s %-9s %-7.7s %6s %5.2f%% %s"
1.1 downsj 84:
85: /* process state names for the "STATE" column of the display */
1.30 deraadt 86: /*
87: * the extra nulls in the string "run" are for adding a slash and the
88: * processor number when needed
89: */
1.1 downsj 90:
1.30 deraadt 91: char *state_abbrev[] = {
1.40 deraadt 92: "", "start", "run", "sleep", "stop", "zomb", "dead", "onproc"
1.1 downsj 93: };
94:
95: /* these are for calculating cpu state percentages */
1.95 cheloha 96: static struct cpustats *cp_time;
97: static struct cpustats *cp_old;
98: static struct cpustats *cp_diff;
1.1 downsj 99:
100: /* these are for detailing the process states */
1.45 markus 101: int process_states[8];
1.30 deraadt 102: char *procstatenames[] = {
103: "", " starting, ", " running, ", " idle, ",
1.47 markus 104: " stopped, ", " zombie, ", " dead, ", " on processor, ",
1.20 deraadt 105: NULL
1.1 downsj 106: };
107:
108: /* these are for detailing the cpu states */
1.48 millert 109: int64_t *cpu_states;
1.30 deraadt 110: char *cpustatenames[] = {
1.90 mpi 111: "user", "nice", "sys", "spin", "intr", "idle", NULL
1.1 downsj 112: };
113:
1.95 cheloha 114: /* this is for tracking which cpus are online */
115: int *cpu_online;
116:
1.1 downsj 117: /* these are for detailing the memory statistics */
1.69 tedu 118: int memory_stats[10];
1.30 deraadt 119: char *memorynames[] = {
1.69 tedu 120: "Real: ", "K/", "K act/tot ", "Free: ", "K ",
121: "Cache: ", "K ",
122: "Swap: ", "K/", "K",
1.20 deraadt 123: NULL
1.1 downsj 124: };
125:
1.11 kstailey 126: /* these are names given to allowed sorting orders -- first is default */
1.31 deraadt 127: char *ordernames[] = {
1.65 tedu 128: "cpu", "size", "res", "time", "pri", "pid", "command", NULL
1.31 deraadt 129: };
1.11 kstailey 130:
1.1 downsj 131: /* these are for keeping track of the proc array */
1.88 deraadt 132: static int nproc;
133: static int onproc = -1;
134: static int pref_len;
1.68 guenther 135: static struct kinfo_proc *pbase;
136: static struct kinfo_proc **pref;
1.1 downsj 137:
138: /* these are for getting the memory statistics */
1.88 deraadt 139: static int pageshift; /* log base 2 of the pagesize */
1.1 downsj 140:
141: /* define pagetok in terms of pageshift */
142: #define pagetok(size) ((size) << pageshift)
143:
1.41 deraadt 144: int ncpu;
1.95 cheloha 145: int ncpuonline;
1.82 deraadt 146: int fscale;
1.41 deraadt 147:
1.33 millert 148: unsigned int maxslp;
1.26 art 149:
1.18 deraadt 150: int
1.82 deraadt 151: getfscale(void)
152: {
153: int mib[] = { CTL_KERN, KERN_FSCALE };
154: size_t size = sizeof(fscale);
155:
156: if (sysctl(mib, sizeof(mib) / sizeof(mib[0]),
1.97 deraadt 157: &fscale, &size, NULL, 0) == -1)
1.82 deraadt 158: return (-1);
159: return fscale;
160: }
161:
162: int
1.80 dlg 163: getncpu(void)
164: {
165: int mib[] = { CTL_HW, HW_NCPU };
1.89 tedu 166: int numcpu;
167: size_t size = sizeof(numcpu);
1.80 dlg 168:
169: if (sysctl(mib, sizeof(mib) / sizeof(mib[0]),
1.89 tedu 170: &numcpu, &size, NULL, 0) == -1)
1.80 dlg 171: return (-1);
172:
1.89 tedu 173: return (numcpu);
1.80 dlg 174: }
175:
176: int
1.95 cheloha 177: getncpuonline(void)
178: {
179: int mib[] = { CTL_HW, HW_NCPUONLINE };
180: int numcpu;
181: size_t size = sizeof(numcpu);
182:
183: if (sysctl(mib, sizeof(mib) / sizeof(mib[0]),
184: &numcpu, &size, NULL, 0) == -1)
185: return (-1);
186:
187: return (numcpu);
188: }
189:
190: int
1.29 pvalchev 191: machine_init(struct statics *statics)
1.1 downsj 192: {
1.95 cheloha 193: int pagesize;
1.41 deraadt 194:
1.80 dlg 195: ncpu = getncpu();
196: if (ncpu == -1)
1.82 deraadt 197: return (-1);
198: if (getfscale() == -1)
1.41 deraadt 199: return (-1);
1.62 deraadt 200: cpu_states = calloc(ncpu, CPUSTATES * sizeof(int64_t));
1.48 millert 201: if (cpu_states == NULL)
202: err(1, NULL);
1.95 cheloha 203: cp_time = calloc(ncpu, sizeof(*cp_time));
204: cp_old = calloc(ncpu, sizeof(*cp_old));
205: cp_diff = calloc(ncpu, sizeof(*cp_diff));
1.48 millert 206: if (cp_time == NULL || cp_old == NULL || cp_diff == NULL)
207: err(1, NULL);
1.95 cheloha 208: cpu_online = calloc(ncpu, sizeof(*cpu_online));
209: if (cpu_online == NULL)
210: err(1, NULL);
1.20 deraadt 211:
212: pbase = NULL;
213: pref = NULL;
214: onproc = -1;
215: nproc = 0;
216:
1.30 deraadt 217: /*
218: * get the page size with "getpagesize" and calculate pageshift from
219: * it
220: */
1.20 deraadt 221: pagesize = getpagesize();
222: pageshift = 0;
223: while (pagesize > 1) {
224: pageshift++;
225: pagesize >>= 1;
226: }
227:
228: /* we only need the amount of log(2)1024 for our conversion */
229: pageshift -= LOG1024;
230:
231: /* fill in the statics information */
232: statics->procstate_names = procstatenames;
233: statics->cpustate_names = cpustatenames;
234: statics->memory_names = memorynames;
235: statics->order_names = ordernames;
236: return (0);
1.1 downsj 237: }
238:
1.20 deraadt 239: char *
1.100 ! kn 240: format_header(char *second_field)
1.1 downsj 241: {
1.84 mpi 242: char *field_name, *thread_field = " TID";
1.20 deraadt 243: char *ptr;
1.1 downsj 244:
1.100 ! kn 245: field_name = second_field ? second_field : thread_field;
1.84 mpi 246:
1.20 deraadt 247: ptr = header + UNAME_START;
1.84 mpi 248: while (*field_name != '\0')
249: *ptr++ = *field_name++;
1.20 deraadt 250: return (header);
1.1 downsj 251: }
252:
253: void
1.31 deraadt 254: get_system_info(struct system_info *si)
1.1 downsj 255: {
1.95 cheloha 256: static int cpustats_mib[] = {CTL_KERN, KERN_CPUSTATS, /*fillme*/0};
1.20 deraadt 257: static int sysload_mib[] = {CTL_VM, VM_LOADAVG};
1.77 mpi 258: static int uvmexp_mib[] = {CTL_VM, VM_UVMEXP};
1.69 tedu 259: static int bcstats_mib[] = {CTL_VFS, VFS_GENERIC, VFS_BCACHESTAT};
1.1 downsj 260: struct loadavg sysload;
1.77 mpi 261: struct uvmexp uvmexp;
1.69 tedu 262: struct bcachestats bcstats;
1.20 deraadt 263: double *infoloadp;
1.30 deraadt 264: size_t size;
1.35 deraadt 265: int i;
1.48 millert 266: int64_t *tmpstate;
1.30 deraadt 267:
1.95 cheloha 268: size = sizeof(*cp_time);
269: for (i = 0; i < ncpu; i++) {
270: cpustats_mib[2] = i;
271: tmpstate = cpu_states + (CPUSTATES * i);
1.97 deraadt 272: if (sysctl(cpustats_mib, 3, &cp_time[i], &size, NULL, 0) == -1)
1.95 cheloha 273: warn("sysctl kern.cpustats failed");
274: /* convert cpustats counts to percentages */
275: (void) percentages(CPUSTATES, tmpstate, cp_time[i].cs_time,
276: cp_old[i].cs_time, cp_diff[i].cs_time);
277: /* note whether the cpu is online */
278: cpu_online[i] = (cp_time[i].cs_flags & CPUSTATS_ONLINE) != 0;
1.48 millert 279: }
1.35 deraadt 280:
1.20 deraadt 281: size = sizeof(sysload);
1.97 deraadt 282: if (sysctl(sysload_mib, 2, &sysload, &size, NULL, 0) == -1)
1.20 deraadt 283: warn("sysctl failed");
1.1 downsj 284: infoloadp = si->load_avg;
285: for (i = 0; i < 3; i++)
1.20 deraadt 286: *infoloadp++ = ((double) sysload.ldavg[i]) / sysload.fscale;
1.1 downsj 287:
288:
289: /* get total -- systemwide main memory usage structure */
1.77 mpi 290: size = sizeof(uvmexp);
1.97 deraadt 291: if (sysctl(uvmexp_mib, 2, &uvmexp, &size, NULL, 0) == -1) {
1.20 deraadt 292: warn("sysctl failed");
1.77 mpi 293: bzero(&uvmexp, sizeof(uvmexp));
1.1 downsj 294: }
1.69 tedu 295: size = sizeof(bcstats);
1.97 deraadt 296: if (sysctl(bcstats_mib, 3, &bcstats, &size, NULL, 0) == -1) {
1.69 tedu 297: warn("sysctl failed");
298: bzero(&bcstats, sizeof(bcstats));
299: }
1.1 downsj 300: /* convert memory stats to Kbytes */
301: memory_stats[0] = -1;
1.77 mpi 302: memory_stats[1] = pagetok(uvmexp.active);
303: memory_stats[2] = pagetok(uvmexp.npages - uvmexp.free);
1.1 downsj 304: memory_stats[3] = -1;
1.77 mpi 305: memory_stats[4] = pagetok(uvmexp.free);
1.1 downsj 306: memory_stats[5] = -1;
1.69 tedu 307: memory_stats[6] = pagetok(bcstats.numbufpages);
308: memory_stats[7] = -1;
1.31 deraadt 309:
1.69 tedu 310: if (!swapmode(&memory_stats[8], &memory_stats[9])) {
311: memory_stats[8] = 0;
312: memory_stats[9] = 0;
1.1 downsj 313: }
314:
1.20 deraadt 315: /* set arrays and strings */
316: si->cpustates = cpu_states;
1.95 cheloha 317: si->cpuonline = cpu_online;
1.20 deraadt 318: si->memory = memory_stats;
319: si->last_pid = -1;
1.1 downsj 320: }
321:
322: static struct handle handle;
323:
1.68 guenther 324: struct kinfo_proc *
1.29 pvalchev 325: getprocs(int op, int arg, int *cnt)
1.22 deraadt 326: {
1.37 millert 327: size_t size;
1.68 guenther 328: int mib[6] = {CTL_KERN, KERN_PROC, 0, 0, sizeof(struct kinfo_proc), 0};
1.26 art 329: static int maxslp_mib[] = {CTL_VM, VM_MAXSLP};
1.68 guenther 330: static struct kinfo_proc *procbase;
1.24 angelos 331: int st;
1.22 deraadt 332:
1.31 deraadt 333: mib[2] = op;
334: mib[3] = arg;
335:
1.26 art 336: size = sizeof(maxslp);
1.97 deraadt 337: if (sysctl(maxslp_mib, 2, &maxslp, &size, NULL, 0) == -1) {
1.26 art 338: warn("sysctl vm.maxslp failed");
339: return (0);
340: }
1.37 millert 341: retry:
342: free(procbase);
343: st = sysctl(mib, 6, NULL, &size, NULL, 0);
1.22 deraadt 344: if (st == -1) {
1.68 guenther 345: /* _kvm_syserr(kd, kd->program, "kvm_getprocs"); */
1.22 deraadt 346: return (0);
347: }
1.37 millert 348: size = 5 * size / 4; /* extra slop */
349: if ((procbase = malloc(size)) == NULL)
1.22 deraadt 350: return (0);
1.68 guenther 351: mib[5] = (int)(size / sizeof(struct kinfo_proc));
1.37 millert 352: st = sysctl(mib, 6, procbase, &size, NULL, 0);
1.22 deraadt 353: if (st == -1) {
1.37 millert 354: if (errno == ENOMEM)
355: goto retry;
1.68 guenther 356: /* _kvm_syserr(kd, kd->program, "kvm_getprocs"); */
1.22 deraadt 357: return (0);
358: }
1.68 guenther 359: *cnt = (int)(size / sizeof(struct kinfo_proc));
1.22 deraadt 360: return (procbase);
361: }
362:
1.86 edd 363: static char **
364: get_proc_args(struct kinfo_proc *kp)
365: {
366: static char **s;
1.87 tedu 367: static size_t siz = 1023;
1.86 edd 368: int mib[4];
369:
1.87 tedu 370: if (!s && !(s = malloc(siz)))
371: err(1, NULL);
372:
373: mib[0] = CTL_KERN;
374: mib[1] = KERN_PROC_ARGS;
375: mib[2] = kp->p_pid;
376: mib[3] = KERN_PROC_ARGV;
377: for (;;) {
378: size_t space = siz;
379: if (sysctl(mib, 4, s, &space, NULL, 0) == 0)
1.86 edd 380: break;
381: if (errno != ENOMEM)
382: return NULL;
1.87 tedu 383: siz *= 2;
384: if ((s = realloc(s, siz)) == NULL)
385: err(1, NULL);
1.86 edd 386: }
387: return s;
388: }
389:
390: static int
391: cmd_matches(struct kinfo_proc *proc, char *term)
392: {
393: extern int show_args;
394: char **args = NULL;
395:
396: if (!term) {
397: /* No command filter set */
398: return 1;
399: } else {
400: /* Filter set, process name needs to contain term */
401: if (strstr(proc->p_comm, term))
402: return 1;
403: /* If showing arguments, search those as well */
404: if (show_args) {
405: args = get_proc_args(proc);
406:
407: if (args == NULL) {
408: /* Failed to get args, so can't search them */
409: return 0;
410: }
411:
412: while (*args != NULL) {
413: if (strstr(*args, term))
414: return 1;
415: args++;
416: }
417: }
418: }
419: return 0;
420: }
421:
1.99 kn 422: struct handle *
1.29 pvalchev 423: get_process_info(struct system_info *si, struct process_select *sel,
1.30 deraadt 424: int (*compare) (const void *, const void *))
1.20 deraadt 425: {
1.56 otto 426: int show_idle, show_system, show_threads, show_uid, show_pid, show_cmd;
1.73 brynet 427: int hide_uid;
1.46 pat 428: int total_procs, active_procs;
1.68 guenther 429: struct kinfo_proc **prefp, *pp;
1.71 pirofti 430: int what = KERN_PROC_KTHREAD;
1.20 deraadt 431:
1.71 pirofti 432: if (sel->threads)
433: what |= KERN_PROC_SHOW_THREADS;
434:
435: if ((pbase = getprocs(what, 0, &nproc)) == NULL) {
1.22 deraadt 436: /* warnx("%s", kvm_geterr(kd)); */
1.20 deraadt 437: quit(23);
438: }
439: if (nproc > onproc)
1.85 deraadt 440: pref = reallocarray(pref, (onproc = nproc),
441: sizeof(struct kinfo_proc *));
1.20 deraadt 442: if (pref == NULL) {
443: warnx("Out of memory.");
444: quit(23);
445: }
446: /* get a pointer to the states summary array */
447: si->procstates = process_states;
1.1 downsj 448:
1.20 deraadt 449: /* set up flags which define what we are going to select */
450: show_idle = sel->idle;
451: show_system = sel->system;
1.50 tedu 452: show_threads = sel->threads;
1.33 millert 453: show_uid = sel->uid != (uid_t)-1;
1.73 brynet 454: hide_uid = sel->huid != (uid_t)-1;
1.44 otto 455: show_pid = sel->pid != (pid_t)-1;
1.56 otto 456: show_cmd = sel->command != NULL;
1.20 deraadt 457:
458: /* count up process states and get pointers to interesting procs */
459: total_procs = 0;
460: active_procs = 0;
461: memset((char *) process_states, 0, sizeof(process_states));
462: prefp = pref;
1.46 pat 463: for (pp = pbase; pp < &pbase[nproc]; pp++) {
1.20 deraadt 464: /*
465: * Place pointers to each valid proc structure in pref[].
466: * Process slots that are actually in use have a non-zero
1.59 otto 467: * status field. Processes with P_SYSTEM set are system
468: * processes---these get ignored unless show_system is set.
1.20 deraadt 469: */
1.70 pirofti 470: if (show_threads && pp->p_tid == -1)
471: continue;
1.37 millert 472: if (pp->p_stat != 0 &&
1.50 tedu 473: (show_system || (pp->p_flag & P_SYSTEM) == 0) &&
474: (show_threads || (pp->p_flag & P_THREAD) == 0)) {
1.20 deraadt 475: total_procs++;
1.37 millert 476: process_states[(unsigned char) pp->p_stat]++;
1.78 guenther 477: if ((pp->p_psflags & PS_ZOMBIE) == 0 &&
1.37 millert 478: (show_idle || pp->p_pctcpu != 0 ||
479: pp->p_stat == SRUN) &&
1.73 brynet 480: (!hide_uid || pp->p_ruid != sel->huid) &&
1.44 otto 481: (!show_uid || pp->p_ruid == sel->uid) &&
1.56 otto 482: (!show_pid || pp->p_pid == sel->pid) &&
1.86 edd 483: (!show_cmd || cmd_matches(pp, sel->command))) {
1.20 deraadt 484: *prefp++ = pp;
485: active_procs++;
486: }
487: }
488: }
489:
490: /* if requested, sort the "interesting" processes */
1.30 deraadt 491: if (compare != NULL)
492: qsort((char *) pref, active_procs,
1.68 guenther 493: sizeof(struct kinfo_proc *), compare);
1.20 deraadt 494: /* remember active and total counts */
495: si->p_total = total_procs;
496: si->p_active = pref_len = active_procs;
497:
498: /* pass back a handle */
499: handle.next_proc = pref;
500: handle.remaining = active_procs;
1.99 kn 501: return &handle;
1.20 deraadt 502: }
503:
1.30 deraadt 504: char fmt[MAX_COLS]; /* static area where result is built */
1.20 deraadt 505:
1.58 otto 506: static char *
1.68 guenther 507: state_abbr(struct kinfo_proc *pp)
1.40 deraadt 508: {
509: static char buf[10];
510:
1.42 deraadt 511: if (ncpu > 1 && pp->p_cpuid != KI_NOCPU)
1.48 millert 512: snprintf(buf, sizeof buf, "%s/%llu",
1.41 deraadt 513: state_abbrev[(unsigned char)pp->p_stat], pp->p_cpuid);
514: else
515: snprintf(buf, sizeof buf, "%s",
516: state_abbrev[(unsigned char)pp->p_stat]);
1.40 deraadt 517: return buf;
518: }
519:
1.58 otto 520: static char *
1.68 guenther 521: format_comm(struct kinfo_proc *kp)
1.49 markus 522: {
1.86 edd 523: static char buf[MAX_COLS];
524: char **p, **s;
525: extern int show_args;
1.49 markus 526:
527: if (!show_args)
528: return (kp->p_comm);
529:
1.86 edd 530: s = get_proc_args(kp);
531: if (s == NULL)
532: return kp->p_comm;
533:
1.49 markus 534: buf[0] = '\0';
535: for (p = s; *p != NULL; p++) {
536: if (p != s)
537: strlcat(buf, " ", sizeof(buf));
538: strlcat(buf, *p, sizeof(buf));
539: }
540: if (buf[0] == '\0')
541: return (kp->p_comm);
542: return (buf);
543: }
544:
545: char *
1.99 kn 546: format_next_process(struct handle *hndl, const char *(*get_userid)(uid_t, int),
1.100 ! kn 547: pid_t *pid)
1.20 deraadt 548: {
1.76 tedu 549: char *p_wait;
1.68 guenther 550: struct kinfo_proc *pp;
1.20 deraadt 551: int cputime;
552: double pct;
1.84 mpi 553: char buf[16];
1.20 deraadt 554:
555: /* find and remember the next proc structure */
1.99 kn 556: pp = *(hndl->next_proc++);
557: hndl->remaining--;
1.20 deraadt 558:
1.66 lum 559: cputime = pp->p_rtime_sec + ((pp->p_rtime_usec + 500000) / 1000000);
1.20 deraadt 560:
561: /* calculate the base for cpu percentages */
1.83 millert 562: pct = (double)pp->p_pctcpu / fscale;
1.20 deraadt 563:
1.76 tedu 564: if (pp->p_wmesg[0])
565: p_wait = pp->p_wmesg;
566: else
1.20 deraadt 567: p_wait = "-";
568:
1.100 ! kn 569: if (get_userid == NULL)
1.84 mpi 570: snprintf(buf, sizeof(buf), "%8d", pp->p_tid);
571: else
1.92 millert 572: snprintf(buf, sizeof(buf), "%s", (*get_userid)(pp->p_ruid, 0));
1.84 mpi 573:
1.20 deraadt 574: /* format this entry */
1.84 mpi 575: snprintf(fmt, sizeof(fmt), Proc_format, pp->p_pid, buf,
1.37 millert 576: pp->p_priority - PZERO, pp->p_nice - NZERO,
1.1 downsj 577: format_k(pagetok(PROCSIZE(pp))),
1.37 millert 578: format_k(pagetok(pp->p_vm_rssize)),
579: (pp->p_stat == SSLEEP && pp->p_slptime > maxslp) ?
1.40 deraadt 580: "idle" : state_abbr(pp),
1.30 deraadt 581: p_wait, format_time(cputime), 100.0 * pct,
1.49 markus 582: printable(format_comm(pp)));
1.1 downsj 583:
1.61 otto 584: *pid = pp->p_pid;
1.20 deraadt 585: /* return the result */
586: return (fmt);
1.1 downsj 587: }
588:
589: /* comparison routine for qsort */
1.11 kstailey 590: static unsigned char sorted_state[] =
591: {
1.20 deraadt 592: 0, /* not used */
593: 4, /* start */
594: 5, /* run */
595: 2, /* sleep */
596: 3, /* stop */
597: 1 /* zombie */
1.11 kstailey 598: };
599:
1.96 kn 600: extern int rev_order;
601:
1.11 kstailey 602: /*
603: * proc_compares - comparison functions for "qsort"
604: */
605:
606: /*
607: * First, the possible comparison keys. These are defined in such a way
608: * that they can be merely listed in the source code to define the actual
609: * desired ordering.
610: */
611:
612: #define ORDERKEY_PCTCPU \
1.83 millert 613: if ((result = (int)(p2->p_pctcpu - p1->p_pctcpu)) == 0)
1.11 kstailey 614: #define ORDERKEY_CPUTIME \
1.37 millert 615: if ((result = p2->p_rtime_sec - p1->p_rtime_sec) == 0) \
616: if ((result = p2->p_rtime_usec - p1->p_rtime_usec) == 0)
1.11 kstailey 617: #define ORDERKEY_STATE \
1.37 millert 618: if ((result = sorted_state[(unsigned char)p2->p_stat] - \
619: sorted_state[(unsigned char)p1->p_stat]) == 0)
1.11 kstailey 620: #define ORDERKEY_PRIO \
1.37 millert 621: if ((result = p2->p_priority - p1->p_priority) == 0)
1.11 kstailey 622: #define ORDERKEY_RSSIZE \
1.37 millert 623: if ((result = p2->p_vm_rssize - p1->p_vm_rssize) == 0)
1.11 kstailey 624: #define ORDERKEY_MEM \
625: if ((result = PROCSIZE(p2) - PROCSIZE(p1)) == 0)
1.65 tedu 626: #define ORDERKEY_PID \
627: if ((result = p1->p_pid - p2->p_pid) == 0)
628: #define ORDERKEY_CMD \
629: if ((result = strcmp(p1->p_comm, p2->p_comm)) == 0)
1.11 kstailey 630:
1.96 kn 631: /* remove one level of indirection and set sort order */
632: #define SETORDER do { \
633: if (rev_order) { \
1.98 kn 634: p1 = *(struct kinfo_proc **) v2; \
635: p2 = *(struct kinfo_proc **) v1; \
1.96 kn 636: } else { \
1.98 kn 637: p1 = *(struct kinfo_proc **) v1; \
638: p2 = *(struct kinfo_proc **) v2; \
1.96 kn 639: } \
640: } while (0)
641:
1.11 kstailey 642: /* compare_cpu - the comparison function for sorting by cpu percentage */
1.36 deraadt 643: static int
1.29 pvalchev 644: compare_cpu(const void *v1, const void *v2)
1.11 kstailey 645: {
1.68 guenther 646: struct kinfo_proc *p1, *p2;
1.20 deraadt 647: int result;
648:
1.96 kn 649: SETORDER;
1.20 deraadt 650:
651: ORDERKEY_PCTCPU
1.30 deraadt 652: ORDERKEY_CPUTIME
653: ORDERKEY_STATE
654: ORDERKEY_PRIO
655: ORDERKEY_RSSIZE
656: ORDERKEY_MEM
657: ;
1.20 deraadt 658: return (result);
1.11 kstailey 659: }
660:
661: /* compare_size - the comparison function for sorting by total memory usage */
1.36 deraadt 662: static int
1.29 pvalchev 663: compare_size(const void *v1, const void *v2)
1.11 kstailey 664: {
1.68 guenther 665: struct kinfo_proc *p1, *p2;
1.20 deraadt 666: int result;
667:
1.96 kn 668: SETORDER;
1.20 deraadt 669:
670: ORDERKEY_MEM
1.30 deraadt 671: ORDERKEY_RSSIZE
672: ORDERKEY_PCTCPU
673: ORDERKEY_CPUTIME
674: ORDERKEY_STATE
675: ORDERKEY_PRIO
676: ;
1.20 deraadt 677: return (result);
1.11 kstailey 678: }
679:
680: /* compare_res - the comparison function for sorting by resident set size */
1.36 deraadt 681: static int
1.29 pvalchev 682: compare_res(const void *v1, const void *v2)
1.11 kstailey 683: {
1.68 guenther 684: struct kinfo_proc *p1, *p2;
1.20 deraadt 685: int result;
686:
1.96 kn 687: SETORDER;
1.20 deraadt 688:
689: ORDERKEY_RSSIZE
1.30 deraadt 690: ORDERKEY_MEM
691: ORDERKEY_PCTCPU
692: ORDERKEY_CPUTIME
693: ORDERKEY_STATE
694: ORDERKEY_PRIO
695: ;
1.20 deraadt 696: return (result);
1.11 kstailey 697: }
698:
699: /* compare_time - the comparison function for sorting by CPU time */
1.36 deraadt 700: static int
1.29 pvalchev 701: compare_time(const void *v1, const void *v2)
1.11 kstailey 702: {
1.68 guenther 703: struct kinfo_proc *p1, *p2;
1.20 deraadt 704: int result;
705:
1.96 kn 706: SETORDER;
1.20 deraadt 707:
708: ORDERKEY_CPUTIME
1.30 deraadt 709: ORDERKEY_PCTCPU
710: ORDERKEY_STATE
711: ORDERKEY_PRIO
712: ORDERKEY_MEM
713: ORDERKEY_RSSIZE
714: ;
1.20 deraadt 715: return (result);
1.11 kstailey 716: }
717:
718: /* compare_prio - the comparison function for sorting by CPU time */
1.36 deraadt 719: static int
1.29 pvalchev 720: compare_prio(const void *v1, const void *v2)
1.11 kstailey 721: {
1.68 guenther 722: struct kinfo_proc *p1, *p2;
1.20 deraadt 723: int result;
724:
1.96 kn 725: SETORDER;
1.20 deraadt 726:
727: ORDERKEY_PRIO
1.30 deraadt 728: ORDERKEY_PCTCPU
729: ORDERKEY_CPUTIME
730: ORDERKEY_STATE
731: ORDERKEY_RSSIZE
732: ORDERKEY_MEM
733: ;
1.20 deraadt 734: return (result);
735: }
736:
1.65 tedu 737: static int
738: compare_pid(const void *v1, const void *v2)
739: {
1.68 guenther 740: struct kinfo_proc *p1, *p2;
1.65 tedu 741: int result;
742:
1.96 kn 743: SETORDER;
1.65 tedu 744:
745: ORDERKEY_PID
746: ORDERKEY_PCTCPU
747: ORDERKEY_CPUTIME
748: ORDERKEY_STATE
749: ORDERKEY_PRIO
750: ORDERKEY_RSSIZE
751: ORDERKEY_MEM
752: ;
753: return (result);
754: }
755:
756: static int
757: compare_cmd(const void *v1, const void *v2)
758: {
1.68 guenther 759: struct kinfo_proc *p1, *p2;
1.65 tedu 760: int result;
761:
1.96 kn 762: SETORDER;
1.65 tedu 763:
764: ORDERKEY_CMD
765: ORDERKEY_PCTCPU
766: ORDERKEY_CPUTIME
767: ORDERKEY_STATE
768: ORDERKEY_PRIO
769: ORDERKEY_RSSIZE
770: ORDERKEY_MEM
771: ;
772: return (result);
773: }
774:
775:
1.31 deraadt 776: int (*proc_compares[])(const void *, const void *) = {
1.20 deraadt 777: compare_cpu,
778: compare_size,
779: compare_res,
780: compare_time,
781: compare_prio,
1.65 tedu 782: compare_pid,
783: compare_cmd,
1.20 deraadt 784: NULL
1.11 kstailey 785: };
1.30 deraadt 786:
1.1 downsj 787: /*
788: * proc_owner(pid) - returns the uid that owns process "pid", or -1 if
789: * the process does not exist.
1.43 otto 790: * It is EXTREMELY IMPORTANT that this function work correctly.
1.1 downsj 791: * If top runs setuid root (as in SVR4), then this function
792: * is the only thing that stands in the way of a serious
793: * security problem. It validates requests for the "kill"
794: * and "renice" commands.
795: */
1.33 millert 796: uid_t
1.29 pvalchev 797: proc_owner(pid_t pid)
1.20 deraadt 798: {
1.68 guenther 799: struct kinfo_proc **prefp, *pp;
1.20 deraadt 800: int cnt;
801:
802: prefp = pref;
803: cnt = pref_len;
804: while (--cnt >= 0) {
805: pp = *prefp++;
1.37 millert 806: if (pp->p_pid == pid)
807: return ((uid_t)pp->p_ruid);
1.1 downsj 808: }
1.34 jfb 809: return (uid_t)(-1);
1.1 downsj 810: }
1.30 deraadt 811:
1.1 downsj 812: /*
1.17 todd 813: * swapmode is rewritten by Tobias Weingartner <weingart@openbsd.org>
1.15 weingart 814: * to be based on the new swapctl(2) system call.
1.1 downsj 815: */
816: static int
1.29 pvalchev 817: swapmode(int *used, int *total)
1.1 downsj 818: {
1.15 weingart 819: struct swapent *swdev;
1.30 deraadt 820: int nswap, rnswap, i;
1.1 downsj 821:
1.15 weingart 822: nswap = swapctl(SWAP_NSWAP, 0, 0);
1.20 deraadt 823: if (nswap == 0)
1.15 weingart 824: return 0;
825:
1.62 deraadt 826: swdev = calloc(nswap, sizeof(*swdev));
1.20 deraadt 827: if (swdev == NULL)
1.15 weingart 828: return 0;
829:
830: rnswap = swapctl(SWAP_STATS, swdev, nswap);
1.53 ray 831: if (rnswap == -1) {
832: free(swdev);
1.15 weingart 833: return 0;
1.53 ray 834: }
1.15 weingart 835:
836: /* if rnswap != nswap, then what? */
837:
838: /* Total things up */
839: *total = *used = 0;
840: for (i = 0; i < nswap; i++) {
841: if (swdev[i].se_flags & SWF_ENABLE) {
1.20 deraadt 842: *used += (swdev[i].se_inuse / (1024 / DEV_BSIZE));
843: *total += (swdev[i].se_nblks / (1024 / DEV_BSIZE));
1.1 downsj 844: }
845: }
1.20 deraadt 846: free(swdev);
1.1 downsj 847: return 1;
848: }
![[BACK]](/icons/back.gif){kind=icon}
Return to machine.c CVS log ![[TXT]](/icons/text.gif){kind=icon}
![[DIR]](/icons/dir.gif){kind=icon}
Up to [local] / src / usr.bin / top