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