1 /* $OpenBSD: machine.c,v 1.102 2020/01/06 20:05:10 zhuk Exp $ */ 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. 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> 32 * Patch for -DORDER by Kenneth Stailey <kstailey@disclosure.com> 33 * Patch for new swapctl(2) by Tobias Weingartner <weingart@openbsd.org> 34 */ 35 36 #include <sys/param.h> /* DEV_BSIZE MAXCOMLEN PZERO */ 37 #include <sys/types.h> 38 #include <sys/signal.h> 39 #include <sys/mount.h> 40 #include <sys/proc.h> 41 #include <sys/sched.h> 42 #include <sys/swap.h> 43 #include <sys/sysctl.h> 44 45 #include <stdio.h> 46 #include <stdlib.h> 47 #include <string.h> 48 #include <unistd.h> 49 #include <err.h> 50 #include <errno.h> 51 52 #include "top.h" 53 #include "display.h" 54 #include "machine.h" 55 #include "utils.h" 56 57 static int swapmode(int *, int *); 58 static char *state_abbr(struct kinfo_proc *); 59 static char *format_comm(struct kinfo_proc *); 60 static int cmd_matches(struct kinfo_proc *, char *); 61 static char **get_proc_args(struct kinfo_proc *); 62 63 /* get_process_info passes back a handle. This is what it looks like: */ 64 65 struct handle { 66 struct kinfo_proc **next_proc; /* points to next valid proc pointer */ 67 int remaining; /* number of pointers remaining */ 68 }; 69 70 /* what we consider to be process size: */ 71 #define PROCSIZE(pp) ((pp)->p_vm_tsize + (pp)->p_vm_dsize + (pp)->p_vm_ssize) 72 73 /* 74 * These definitions control the format of the per-process area 75 */ 76 static char header[] = 77 " PID X PRI NICE SIZE RES STATE WAIT TIME CPU COMMAND"; 78 79 /* 0123456 -- field to fill in starts at header+6 */ 80 #define UNAME_START 6 81 82 #define Proc_format \ 83 "%5d %-8.8s %3d %4d %5s %5s %-9s %-7.7s %6s %5.2f%% %s" 84 85 /* process state names for the "STATE" column of the display */ 86 /* 87 * the extra nulls in the string "run" are for adding a slash and the 88 * processor number when needed 89 */ 90 91 char *state_abbrev[] = { 92 "", "start", "run", "sleep", "stop", "zomb", "dead", "onproc" 93 }; 94 95 /* these are for calculating cpu state percentages */ 96 static struct cpustats *cp_time; 97 static struct cpustats *cp_old; 98 static struct cpustats *cp_diff; 99 100 /* these are for detailing the process states */ 101 int process_states[8]; 102 char *procstatenames[] = { 103 "", " starting, ", " running, ", " idle, ", 104 " stopped, ", " zombie, ", " dead, ", " on processor, ", 105 NULL 106 }; 107 108 /* these are for detailing the cpu states */ 109 int64_t *cpu_states; 110 char *cpustatenames[] = { 111 "user", "nice", "sys", "spin", "intr", "idle", NULL 112 }; 113 114 /* this is for tracking which cpus are online */ 115 int *cpu_online; 116 117 /* these are for detailing the memory statistics */ 118 int memory_stats[10]; 119 char *memorynames[] = { 120 "Real: ", "K/", "K act/tot ", "Free: ", "K ", 121 "Cache: ", "K ", 122 "Swap: ", "K/", "K", 123 NULL 124 }; 125 126 /* these are names given to allowed sorting orders -- first is default */ 127 char *ordernames[] = { 128 "cpu", "size", "res", "time", "pri", "pid", "command", NULL 129 }; 130 131 /* these are for keeping track of the proc array */ 132 static int nproc; 133 static int onproc = -1; 134 static int pref_len; 135 static struct kinfo_proc *pbase; 136 static struct kinfo_proc **pref; 137 138 /* these are for getting the memory statistics */ 139 static int pageshift; /* log base 2 of the pagesize */ 140 141 /* define pagetok in terms of pageshift */ 142 #define pagetok(size) ((size) << pageshift) 143 144 int ncpu; 145 int ncpuonline; 146 int fscale; 147 148 unsigned int maxslp; 149 150 int 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]), 157 &fscale, &size, NULL, 0) == -1) 158 return (-1); 159 return fscale; 160 } 161 162 int 163 getncpu(void) 164 { 165 int mib[] = { CTL_HW, HW_NCPU }; 166 int numcpu; 167 size_t size = sizeof(numcpu); 168 169 if (sysctl(mib, sizeof(mib) / sizeof(mib[0]), 170 &numcpu, &size, NULL, 0) == -1) 171 return (-1); 172 173 return (numcpu); 174 } 175 176 int 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 191 machine_init(struct statics *statics) 192 { 193 int pagesize; 194 195 ncpu = getncpu(); 196 if (ncpu == -1) 197 return (-1); 198 if (getfscale() == -1) 199 return (-1); 200 cpu_states = calloc(ncpu, CPUSTATES * sizeof(int64_t)); 201 if (cpu_states == NULL) 202 err(1, NULL); 203 cp_time = calloc(ncpu, sizeof(*cp_time)); 204 cp_old = calloc(ncpu, sizeof(*cp_old)); 205 cp_diff = calloc(ncpu, sizeof(*cp_diff)); 206 if (cp_time == NULL || cp_old == NULL || cp_diff == NULL) 207 err(1, NULL); 208 cpu_online = calloc(ncpu, sizeof(*cpu_online)); 209 if (cpu_online == NULL) 210 err(1, NULL); 211 212 pbase = NULL; 213 pref = NULL; 214 onproc = -1; 215 nproc = 0; 216 217 /* 218 * get the page size with "getpagesize" and calculate pageshift from 219 * it 220 */ 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); 237 } 238 239 char * 240 format_header(char *second_field) 241 { 242 char *field_name, *thread_field = " TID"; 243 char *ptr; 244 245 field_name = second_field ? second_field : thread_field; 246 247 ptr = header + UNAME_START; 248 while (*field_name != '\0') 249 *ptr++ = *field_name++; 250 return (header); 251 } 252 253 void 254 get_system_info(struct system_info *si) 255 { 256 static int cpustats_mib[] = {CTL_KERN, KERN_CPUSTATS, /*fillme*/0}; 257 static int sysload_mib[] = {CTL_VM, VM_LOADAVG}; 258 static int uvmexp_mib[] = {CTL_VM, VM_UVMEXP}; 259 static int bcstats_mib[] = {CTL_VFS, VFS_GENERIC, VFS_BCACHESTAT}; 260 struct loadavg sysload; 261 struct uvmexp uvmexp; 262 struct bcachestats bcstats; 263 double *infoloadp; 264 size_t size; 265 int i; 266 int64_t *tmpstate; 267 268 size = sizeof(*cp_time); 269 for (i = 0; i < ncpu; i++) { 270 cpustats_mib[2] = i; 271 tmpstate = cpu_states + (CPUSTATES * i); 272 if (sysctl(cpustats_mib, 3, &cp_time[i], &size, NULL, 0) == -1) 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; 279 } 280 281 size = sizeof(sysload); 282 if (sysctl(sysload_mib, 2, &sysload, &size, NULL, 0) == -1) 283 warn("sysctl failed"); 284 infoloadp = si->load_avg; 285 for (i = 0; i < 3; i++) 286 *infoloadp++ = ((double) sysload.ldavg[i]) / sysload.fscale; 287 288 289 /* get total -- systemwide main memory usage structure */ 290 size = sizeof(uvmexp); 291 if (sysctl(uvmexp_mib, 2, &uvmexp, &size, NULL, 0) == -1) { 292 warn("sysctl failed"); 293 bzero(&uvmexp, sizeof(uvmexp)); 294 } 295 size = sizeof(bcstats); 296 if (sysctl(bcstats_mib, 3, &bcstats, &size, NULL, 0) == -1) { 297 warn("sysctl failed"); 298 bzero(&bcstats, sizeof(bcstats)); 299 } 300 /* convert memory stats to Kbytes */ 301 memory_stats[0] = -1; 302 memory_stats[1] = pagetok(uvmexp.active); 303 memory_stats[2] = pagetok(uvmexp.npages - uvmexp.free); 304 memory_stats[3] = -1; 305 memory_stats[4] = pagetok(uvmexp.free); 306 memory_stats[5] = -1; 307 memory_stats[6] = pagetok(bcstats.numbufpages); 308 memory_stats[7] = -1; 309 310 if (!swapmode(&memory_stats[8], &memory_stats[9])) { 311 memory_stats[8] = 0; 312 memory_stats[9] = 0; 313 } 314 315 /* set arrays and strings */ 316 si->cpustates = cpu_states; 317 si->cpuonline = cpu_online; 318 si->memory = memory_stats; 319 si->last_pid = -1; 320 } 321 322 static struct handle handle; 323 324 struct kinfo_proc * 325 getprocs(int op, int arg, int *cnt) 326 { 327 size_t size; 328 int mib[6] = {CTL_KERN, KERN_PROC, 0, 0, sizeof(struct kinfo_proc), 0}; 329 static int maxslp_mib[] = {CTL_VM, VM_MAXSLP}; 330 static struct kinfo_proc *procbase; 331 int st; 332 333 mib[2] = op; 334 mib[3] = arg; 335 336 size = sizeof(maxslp); 337 if (sysctl(maxslp_mib, 2, &maxslp, &size, NULL, 0) == -1) { 338 warn("sysctl vm.maxslp failed"); 339 return (0); 340 } 341 retry: 342 free(procbase); 343 st = sysctl(mib, 6, NULL, &size, NULL, 0); 344 if (st == -1) { 345 /* _kvm_syserr(kd, kd->program, "kvm_getprocs"); */ 346 return (0); 347 } 348 size = 5 * size / 4; /* extra slop */ 349 if ((procbase = malloc(size)) == NULL) 350 return (0); 351 mib[5] = (int)(size / sizeof(struct kinfo_proc)); 352 st = sysctl(mib, 6, procbase, &size, NULL, 0); 353 if (st == -1) { 354 if (errno == ENOMEM) 355 goto retry; 356 /* _kvm_syserr(kd, kd->program, "kvm_getprocs"); */ 357 return (0); 358 } 359 *cnt = (int)(size / sizeof(struct kinfo_proc)); 360 return (procbase); 361 } 362 363 static char ** 364 get_proc_args(struct kinfo_proc *kp) 365 { 366 static char **s; 367 static size_t siz = 1023; 368 int mib[4]; 369 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) 380 break; 381 if (errno != ENOMEM) 382 return NULL; 383 siz *= 2; 384 if ((s = realloc(s, siz)) == NULL) 385 err(1, NULL); 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 422 struct handle * 423 get_process_info(struct system_info *si, struct process_select *sel, 424 int (*compare) (const void *, const void *)) 425 { 426 int show_idle, show_system, show_threads, show_uid, show_pid, show_cmd; 427 int hide_uid; 428 int total_procs, active_procs; 429 struct kinfo_proc **prefp, *pp; 430 int what = KERN_PROC_ALL; 431 432 show_system = sel->system; 433 show_threads = sel->threads; 434 435 if (show_system) 436 what = KERN_PROC_KTHREAD; 437 if (show_threads) 438 what |= KERN_PROC_SHOW_THREADS; 439 440 if ((pbase = getprocs(what, 0, &nproc)) == NULL) { 441 /* warnx("%s", kvm_geterr(kd)); */ 442 quit(23); 443 } 444 if (nproc > onproc) 445 pref = reallocarray(pref, (onproc = nproc), 446 sizeof(struct kinfo_proc *)); 447 if (pref == NULL) { 448 warnx("Out of memory."); 449 quit(23); 450 } 451 /* get a pointer to the states summary array */ 452 si->procstates = process_states; 453 454 /* set up flags which define what we are going to select */ 455 show_idle = sel->idle; 456 show_uid = sel->uid != (uid_t)-1; 457 hide_uid = sel->huid != (uid_t)-1; 458 show_pid = sel->pid != (pid_t)-1; 459 show_cmd = sel->command != NULL; 460 461 /* count up process states and get pointers to interesting procs */ 462 total_procs = 0; 463 active_procs = 0; 464 memset((char *) process_states, 0, sizeof(process_states)); 465 prefp = pref; 466 for (pp = pbase; pp < &pbase[nproc]; pp++) { 467 /* 468 * When showing threads, we want to ignore the structure 469 * that represents the entire process, which has TID == -1 470 */ 471 if (show_threads && pp->p_tid == -1) 472 continue; 473 /* 474 * Place pointers to each valid proc structure in pref[]. 475 * Process slots that are actually in use have a non-zero 476 * status field. 477 */ 478 if (pp->p_stat != 0) { 479 total_procs++; 480 process_states[(unsigned char) pp->p_stat]++; 481 if ((pp->p_psflags & PS_ZOMBIE) == 0 && 482 (show_idle || pp->p_pctcpu != 0 || 483 pp->p_stat == SRUN) && 484 (!hide_uid || pp->p_ruid != sel->huid) && 485 (!show_uid || pp->p_ruid == sel->uid) && 486 (!show_pid || pp->p_pid == sel->pid) && 487 (!show_cmd || cmd_matches(pp, sel->command))) { 488 *prefp++ = pp; 489 active_procs++; 490 } 491 } 492 } 493 494 /* if requested, sort the "interesting" processes */ 495 if (compare != NULL) 496 qsort((char *) pref, active_procs, 497 sizeof(struct kinfo_proc *), compare); 498 /* remember active and total counts */ 499 si->p_total = total_procs; 500 si->p_active = pref_len = active_procs; 501 502 /* pass back a handle */ 503 handle.next_proc = pref; 504 handle.remaining = active_procs; 505 return &handle; 506 } 507 508 char fmt[MAX_COLS]; /* static area where result is built */ 509 510 static char * 511 state_abbr(struct kinfo_proc *pp) 512 { 513 static char buf[10]; 514 515 if (ncpu > 1 && pp->p_cpuid != KI_NOCPU) 516 snprintf(buf, sizeof buf, "%s/%llu", 517 state_abbrev[(unsigned char)pp->p_stat], pp->p_cpuid); 518 else 519 snprintf(buf, sizeof buf, "%s", 520 state_abbrev[(unsigned char)pp->p_stat]); 521 return buf; 522 } 523 524 static char * 525 format_comm(struct kinfo_proc *kp) 526 { 527 static char buf[MAX_COLS]; 528 char **p, **s; 529 extern int show_args; 530 531 if (!show_args) 532 return (kp->p_comm); 533 534 s = get_proc_args(kp); 535 if (s == NULL) 536 return kp->p_comm; 537 538 buf[0] = '\0'; 539 for (p = s; *p != NULL; p++) { 540 if (p != s) 541 strlcat(buf, " ", sizeof(buf)); 542 strlcat(buf, *p, sizeof(buf)); 543 } 544 if (buf[0] == '\0') 545 return (kp->p_comm); 546 return (buf); 547 } 548 549 void 550 skip_next_process(struct handle *hndl) 551 { 552 /* find and remember the next proc structure */ 553 hndl->next_proc++; 554 hndl->remaining--; 555 } 556 557 char * 558 format_next_process(struct handle *hndl, const char *(*get_userid)(uid_t, int), 559 pid_t *pid) 560 { 561 char *p_wait; 562 struct kinfo_proc *pp; 563 int cputime; 564 double pct; 565 char buf[16]; 566 567 /* find and remember the next proc structure */ 568 pp = *(hndl->next_proc++); 569 hndl->remaining--; 570 571 cputime = pp->p_rtime_sec + ((pp->p_rtime_usec + 500000) / 1000000); 572 573 /* calculate the base for cpu percentages */ 574 pct = (double)pp->p_pctcpu / fscale; 575 576 if (pp->p_wmesg[0]) 577 p_wait = pp->p_wmesg; 578 else 579 p_wait = "-"; 580 581 if (get_userid == NULL) 582 snprintf(buf, sizeof(buf), "%8d", pp->p_tid); 583 else 584 snprintf(buf, sizeof(buf), "%s", (*get_userid)(pp->p_ruid, 0)); 585 586 /* format this entry */ 587 snprintf(fmt, sizeof(fmt), Proc_format, pp->p_pid, buf, 588 pp->p_priority - PZERO, pp->p_nice - NZERO, 589 format_k(pagetok(PROCSIZE(pp))), 590 format_k(pagetok(pp->p_vm_rssize)), 591 (pp->p_stat == SSLEEP && pp->p_slptime > maxslp) ? 592 "idle" : state_abbr(pp), 593 p_wait, format_time(cputime), 100.0 * pct, 594 printable(format_comm(pp))); 595 596 *pid = pp->p_pid; 597 /* return the result */ 598 return (fmt); 599 } 600 601 /* comparison routine for qsort */ 602 static unsigned char sorted_state[] = 603 { 604 0, /* not used */ 605 4, /* start */ 606 5, /* run */ 607 2, /* sleep */ 608 3, /* stop */ 609 1 /* zombie */ 610 }; 611 612 extern int rev_order; 613 614 /* 615 * proc_compares - comparison functions for "qsort" 616 */ 617 618 /* 619 * First, the possible comparison keys. These are defined in such a way 620 * that they can be merely listed in the source code to define the actual 621 * desired ordering. 622 */ 623 624 #define ORDERKEY_PCTCPU \ 625 if ((result = (int)(p2->p_pctcpu - p1->p_pctcpu)) == 0) 626 #define ORDERKEY_CPUTIME \ 627 if ((result = p2->p_rtime_sec - p1->p_rtime_sec) == 0) \ 628 if ((result = p2->p_rtime_usec - p1->p_rtime_usec) == 0) 629 #define ORDERKEY_STATE \ 630 if ((result = sorted_state[(unsigned char)p2->p_stat] - \ 631 sorted_state[(unsigned char)p1->p_stat]) == 0) 632 #define ORDERKEY_PRIO \ 633 if ((result = p2->p_priority - p1->p_priority) == 0) 634 #define ORDERKEY_RSSIZE \ 635 if ((result = p2->p_vm_rssize - p1->p_vm_rssize) == 0) 636 #define ORDERKEY_MEM \ 637 if ((result = PROCSIZE(p2) - PROCSIZE(p1)) == 0) 638 #define ORDERKEY_PID \ 639 if ((result = p1->p_pid - p2->p_pid) == 0) 640 #define ORDERKEY_CMD \ 641 if ((result = strcmp(p1->p_comm, p2->p_comm)) == 0) 642 643 /* remove one level of indirection and set sort order */ 644 #define SETORDER do { \ 645 if (rev_order) { \ 646 p1 = *(struct kinfo_proc **) v2; \ 647 p2 = *(struct kinfo_proc **) v1; \ 648 } else { \ 649 p1 = *(struct kinfo_proc **) v1; \ 650 p2 = *(struct kinfo_proc **) v2; \ 651 } \ 652 } while (0) 653 654 /* compare_cpu - the comparison function for sorting by cpu percentage */ 655 static int 656 compare_cpu(const void *v1, const void *v2) 657 { 658 struct kinfo_proc *p1, *p2; 659 int result; 660 661 SETORDER; 662 663 ORDERKEY_PCTCPU 664 ORDERKEY_CPUTIME 665 ORDERKEY_STATE 666 ORDERKEY_PRIO 667 ORDERKEY_RSSIZE 668 ORDERKEY_MEM 669 ; 670 return (result); 671 } 672 673 /* compare_size - the comparison function for sorting by total memory usage */ 674 static int 675 compare_size(const void *v1, const void *v2) 676 { 677 struct kinfo_proc *p1, *p2; 678 int result; 679 680 SETORDER; 681 682 ORDERKEY_MEM 683 ORDERKEY_RSSIZE 684 ORDERKEY_PCTCPU 685 ORDERKEY_CPUTIME 686 ORDERKEY_STATE 687 ORDERKEY_PRIO 688 ; 689 return (result); 690 } 691 692 /* compare_res - the comparison function for sorting by resident set size */ 693 static int 694 compare_res(const void *v1, const void *v2) 695 { 696 struct kinfo_proc *p1, *p2; 697 int result; 698 699 SETORDER; 700 701 ORDERKEY_RSSIZE 702 ORDERKEY_MEM 703 ORDERKEY_PCTCPU 704 ORDERKEY_CPUTIME 705 ORDERKEY_STATE 706 ORDERKEY_PRIO 707 ; 708 return (result); 709 } 710 711 /* compare_time - the comparison function for sorting by CPU time */ 712 static int 713 compare_time(const void *v1, const void *v2) 714 { 715 struct kinfo_proc *p1, *p2; 716 int result; 717 718 SETORDER; 719 720 ORDERKEY_CPUTIME 721 ORDERKEY_PCTCPU 722 ORDERKEY_STATE 723 ORDERKEY_PRIO 724 ORDERKEY_MEM 725 ORDERKEY_RSSIZE 726 ; 727 return (result); 728 } 729 730 /* compare_prio - the comparison function for sorting by CPU time */ 731 static int 732 compare_prio(const void *v1, const void *v2) 733 { 734 struct kinfo_proc *p1, *p2; 735 int result; 736 737 SETORDER; 738 739 ORDERKEY_PRIO 740 ORDERKEY_PCTCPU 741 ORDERKEY_CPUTIME 742 ORDERKEY_STATE 743 ORDERKEY_RSSIZE 744 ORDERKEY_MEM 745 ; 746 return (result); 747 } 748 749 static int 750 compare_pid(const void *v1, const void *v2) 751 { 752 struct kinfo_proc *p1, *p2; 753 int result; 754 755 SETORDER; 756 757 ORDERKEY_PID 758 ORDERKEY_PCTCPU 759 ORDERKEY_CPUTIME 760 ORDERKEY_STATE 761 ORDERKEY_PRIO 762 ORDERKEY_RSSIZE 763 ORDERKEY_MEM 764 ; 765 return (result); 766 } 767 768 static int 769 compare_cmd(const void *v1, const void *v2) 770 { 771 struct kinfo_proc *p1, *p2; 772 int result; 773 774 SETORDER; 775 776 ORDERKEY_CMD 777 ORDERKEY_PCTCPU 778 ORDERKEY_CPUTIME 779 ORDERKEY_STATE 780 ORDERKEY_PRIO 781 ORDERKEY_RSSIZE 782 ORDERKEY_MEM 783 ; 784 return (result); 785 } 786 787 788 int (*proc_compares[])(const void *, const void *) = { 789 compare_cpu, 790 compare_size, 791 compare_res, 792 compare_time, 793 compare_prio, 794 compare_pid, 795 compare_cmd, 796 NULL 797 }; 798 799 /* 800 * proc_owner(pid) - returns the uid that owns process "pid", or -1 if 801 * the process does not exist. 802 * It is EXTREMELY IMPORTANT that this function work correctly. 803 * If top runs setuid root (as in SVR4), then this function 804 * is the only thing that stands in the way of a serious 805 * security problem. It validates requests for the "kill" 806 * and "renice" commands. 807 */ 808 uid_t 809 proc_owner(pid_t pid) 810 { 811 struct kinfo_proc **prefp, *pp; 812 int cnt; 813 814 prefp = pref; 815 cnt = pref_len; 816 while (--cnt >= 0) { 817 pp = *prefp++; 818 if (pp->p_pid == pid) 819 return ((uid_t)pp->p_ruid); 820 } 821 return (uid_t)(-1); 822 } 823 824 /* 825 * swapmode is rewritten by Tobias Weingartner <weingart@openbsd.org> 826 * to be based on the new swapctl(2) system call. 827 */ 828 static int 829 swapmode(int *used, int *total) 830 { 831 struct swapent *swdev; 832 int nswap, rnswap, i; 833 834 nswap = swapctl(SWAP_NSWAP, 0, 0); 835 if (nswap == 0) 836 return 0; 837 838 swdev = calloc(nswap, sizeof(*swdev)); 839 if (swdev == NULL) 840 return 0; 841 842 rnswap = swapctl(SWAP_STATS, swdev, nswap); 843 if (rnswap == -1) { 844 free(swdev); 845 return 0; 846 } 847 848 /* if rnswap != nswap, then what? */ 849 850 /* Total things up */ 851 *total = *used = 0; 852 for (i = 0; i < nswap; i++) { 853 if (swdev[i].se_flags & SWF_ENABLE) { 854 *used += (swdev[i].se_inuse / (1024 / DEV_BSIZE)); 855 *total += (swdev[i].se_nblks / (1024 / DEV_BSIZE)); 856 } 857 } 858 free(swdev); 859 return 1; 860 } 861