1 /* $NetBSD: vmstat.c,v 1.103 2002/09/18 23:24:13 mycroft Exp $ */ 2 3 /*- 4 * Copyright (c) 1998, 2000, 2001 The NetBSD Foundation, Inc. 5 * All rights reserved. 6 * 7 * This code is derived from software contributed to The NetBSD Foundation by: 8 * - Jason R. Thorpe of the Numerical Aerospace Simulation Facility, 9 * NASA Ames Research Center. 10 * - Simon Burge and Luke Mewburn of Wasabi Systems, Inc. 11 * 12 * Redistribution and use in source and binary forms, with or without 13 * modification, are permitted provided that the following conditions 14 * are met: 15 * 1. Redistributions of source code must retain the above copyright 16 * notice, this list of conditions and the following disclaimer. 17 * 2. Redistributions in binary form must reproduce the above copyright 18 * notice, this list of conditions and the following disclaimer in the 19 * documentation and/or other materials provided with the distribution. 20 * 3. All advertising materials mentioning features or use of this software 21 * must display the following acknowledgement: 22 * This product includes software developed by the NetBSD 23 * Foundation, Inc. and its contributors. 24 * 4. Neither the name of The NetBSD Foundation nor the names of its 25 * contributors may be used to endorse or promote products derived 26 * from this software without specific prior written permission. 27 * 28 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 29 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 30 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 31 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 32 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 33 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 34 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 35 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 36 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 37 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 38 * POSSIBILITY OF SUCH DAMAGE. 39 */ 40 41 /* 42 * Copyright (c) 1980, 1986, 1991, 1993 43 * The Regents of the University of California. All rights reserved. 44 * 45 * Redistribution and use in source and binary forms, with or without 46 * modification, are permitted provided that the following conditions 47 * are met: 48 * 1. Redistributions of source code must retain the above copyright 49 * notice, this list of conditions and the following disclaimer. 50 * 2. Redistributions in binary form must reproduce the above copyright 51 * notice, this list of conditions and the following disclaimer in the 52 * documentation and/or other materials provided with the distribution. 53 * 3. All advertising materials mentioning features or use of this software 54 * must display the following acknowledgement: 55 * This product includes software developed by the University of 56 * California, Berkeley and its contributors. 57 * 4. Neither the name of the University nor the names of its contributors 58 * may be used to endorse or promote products derived from this software 59 * without specific prior written permission. 60 * 61 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 62 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 63 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 64 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 65 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 66 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 67 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 68 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 69 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 70 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 71 * SUCH DAMAGE. 72 */ 73 74 #include <sys/cdefs.h> 75 #ifndef lint 76 __COPYRIGHT("@(#) Copyright (c) 1980, 1986, 1991, 1993\n\ 77 The Regents of the University of California. All rights reserved.\n"); 78 #endif /* not lint */ 79 80 #ifndef lint 81 #if 0 82 static char sccsid[] = "@(#)vmstat.c 8.2 (Berkeley) 3/1/95"; 83 #else 84 __RCSID("$NetBSD: vmstat.c,v 1.103 2002/09/18 23:24:13 mycroft Exp $"); 85 #endif 86 #endif /* not lint */ 87 88 #define __POOL_EXPOSE 89 90 #include <sys/param.h> 91 #include <sys/mount.h> 92 #include <sys/uio.h> 93 94 #include <sys/buf.h> 95 #include <sys/device.h> 96 #include <sys/dkstat.h> 97 #include <sys/ioctl.h> 98 #include <sys/malloc.h> 99 #include <sys/namei.h> 100 #include <sys/pool.h> 101 #include <sys/proc.h> 102 #include <sys/sched.h> 103 #include <sys/socket.h> 104 #include <sys/sysctl.h> 105 #include <sys/time.h> 106 #include <sys/user.h> 107 108 #include <uvm/uvm_extern.h> 109 #include <uvm/uvm_stat.h> 110 111 #include <net/if.h> 112 #include <netinet/in.h> 113 #include <netinet/in_var.h> 114 115 #include <ufs/ufs/inode.h> 116 117 #include <nfs/rpcv2.h> 118 #include <nfs/nfsproto.h> 119 #include <nfs/nfsnode.h> 120 121 #include <ctype.h> 122 #include <err.h> 123 #include <errno.h> 124 #include <fcntl.h> 125 #include <kvm.h> 126 #include <limits.h> 127 #include <nlist.h> 128 #undef n_hash 129 #include <paths.h> 130 #include <signal.h> 131 #include <stdio.h> 132 #include <stddef.h> 133 #include <stdlib.h> 134 #include <string.h> 135 #include <time.h> 136 #include <unistd.h> 137 138 #include "dkstats.h" 139 140 /* 141 * General namelist 142 */ 143 struct nlist namelist[] = 144 { 145 #define X_BOOTTIME 0 146 { "_boottime" }, 147 #define X_HZ 1 148 { "_hz" }, 149 #define X_STATHZ 2 150 { "_stathz" }, 151 #define X_NCHSTATS 3 152 { "_nchstats" }, 153 #define X_INTRNAMES 4 154 { "_intrnames" }, 155 #define X_EINTRNAMES 5 156 { "_eintrnames" }, 157 #define X_INTRCNT 6 158 { "_intrcnt" }, 159 #define X_EINTRCNT 7 160 { "_eintrcnt" }, 161 #define X_KMEMSTAT 8 162 { "_kmemstats" }, 163 #define X_KMEMBUCKETS 9 164 { "_bucket" }, 165 #define X_ALLEVENTS 10 166 { "_allevents" }, 167 #define X_POOLHEAD 11 168 { "_pool_head" }, 169 #define X_UVMEXP 12 170 { "_uvmexp" }, 171 #define X_END 13 172 #if defined(pc532) 173 #define X_IVT (X_END) 174 { "_ivt" }, 175 #endif 176 { NULL }, 177 }; 178 179 /* 180 * Namelist for hash statistics 181 */ 182 struct nlist hashnl[] = 183 { 184 #define X_NFSNODE 0 185 { "_nfsnodehash" }, 186 #define X_NFSNODETBL 1 187 { "_nfsnodehashtbl" }, 188 #define X_IHASH 2 189 { "_ihash" }, 190 #define X_IHASHTBL 3 191 { "_ihashtbl" }, 192 #define X_BUFHASH 4 193 { "_bufhash" }, 194 #define X_BUFHASHTBL 5 195 { "_bufhashtbl" }, 196 #define X_PIDHASH 6 197 { "_pidhash" }, 198 #define X_PIDHASHTBL 7 199 { "_pidhashtbl" }, 200 #define X_PGRPHASH 8 201 { "_pgrphash" }, 202 #define X_PGRPHASHTBL 9 203 { "_pgrphashtbl" }, 204 #define X_UIHASH 10 205 { "_uihash" }, 206 #define X_UIHASHTBL 11 207 { "_uihashtbl" }, 208 #define X_IFADDRHASH 12 209 { "_in_ifaddrhash" }, 210 #define X_IFADDRHASHTBL 13 211 { "_in_ifaddrhashtbl" }, 212 #define X_NCHASH 14 213 { "_nchash" }, 214 #define X_NCHASHTBL 15 215 { "_nchashtbl" }, 216 #define X_NCVHASH 16 217 { "_ncvhash" }, 218 #define X_NCVHASHTBL 17 219 { "_ncvhashtbl" }, 220 #define X_HASHNL_SIZE 18 /* must be last */ 221 { NULL }, 222 223 }; 224 225 /* 226 * Namelist for UVM histories 227 */ 228 struct nlist histnl[] = 229 { 230 { "_uvm_histories" }, 231 #define X_UVM_HISTORIES 0 232 { NULL }, 233 }; 234 235 236 237 struct uvmexp uvmexp, ouvmexp; 238 int ndrives; 239 240 int winlines = 20; 241 242 kvm_t *kd; 243 244 #define FORKSTAT 1<<0 245 #define INTRSTAT 1<<1 246 #define MEMSTAT 1<<2 247 #define SUMSTAT 1<<3 248 #define EVCNTSTAT 1<<4 249 #define VMSTAT 1<<5 250 #define HISTLIST 1<<6 251 #define HISTDUMP 1<<7 252 #define HASHSTAT 1<<8 253 #define HASHLIST 1<<9 254 255 void cpustats(void); 256 void deref_kptr(const void *, void *, size_t, const char *); 257 void dkstats(void); 258 void doevcnt(int verbose); 259 void dohashstat(int, int, const char *); 260 void dointr(int verbose); 261 void domem(void); 262 void dopool(int); 263 void dopoolcache(struct pool *, int); 264 void dosum(void); 265 void dovmstat(struct timespec *, int); 266 void kread(int, void *, size_t); 267 void needhdr(int); 268 long getuptime(void); 269 void printhdr(void); 270 long pct(long, long); 271 void usage(void); 272 void doforkst(void); 273 274 void hist_traverse(int, const char *); 275 void hist_dodump(struct uvm_history *); 276 277 int main(int, char **); 278 char **choosedrives(char **); 279 280 /* Namelist and memory file names. */ 281 char *nlistf, *memf; 282 283 /* allow old usage [vmstat 1] */ 284 #define BACKWARD_COMPATIBILITY 285 286 int 287 main(int argc, char *argv[]) 288 { 289 int c, todo, verbose; 290 struct timespec interval; 291 int reps; 292 char errbuf[_POSIX2_LINE_MAX]; 293 gid_t egid = getegid(); 294 const char *histname, *hashname; 295 296 histname = hashname = NULL; 297 (void)setegid(getgid()); 298 memf = nlistf = NULL; 299 reps = todo = verbose = 0; 300 interval.tv_sec = 0; 301 interval.tv_nsec = 0; 302 while ((c = getopt(argc, argv, "c:efh:HilLM:mN:suUvw:")) != -1) { 303 switch (c) { 304 case 'c': 305 reps = atoi(optarg); 306 break; 307 case 'e': 308 todo |= EVCNTSTAT; 309 break; 310 case 'f': 311 todo |= FORKSTAT; 312 break; 313 case 'h': 314 hashname = optarg; 315 /* FALLTHROUGH */ 316 case 'H': 317 todo |= HASHSTAT; 318 break; 319 case 'i': 320 todo |= INTRSTAT; 321 break; 322 case 'l': 323 todo |= HISTLIST; 324 break; 325 case 'L': 326 todo |= HASHLIST; 327 break; 328 case 'M': 329 memf = optarg; 330 break; 331 case 'm': 332 todo |= MEMSTAT; 333 break; 334 case 'N': 335 nlistf = optarg; 336 break; 337 case 's': 338 todo |= SUMSTAT; 339 break; 340 case 'u': 341 histname = optarg; 342 /* FALLTHROUGH */ 343 case 'U': 344 todo |= HISTDUMP; 345 break; 346 case 'v': 347 verbose++; 348 break; 349 case 'w': 350 interval.tv_sec = atol(optarg); 351 break; 352 case '?': 353 default: 354 usage(); 355 } 356 } 357 argc -= optind; 358 argv += optind; 359 360 if (todo == 0) 361 todo = VMSTAT; 362 363 /* 364 * Discard setgid privileges. If not the running kernel, we toss 365 * them away totally so that bad guys can't print interesting stuff 366 * from kernel memory, otherwise switch back to kmem for the 367 * duration of the kvm_openfiles() call. 368 */ 369 if (nlistf != NULL || memf != NULL) 370 (void)setgid(getgid()); 371 else 372 (void)setegid(egid); 373 374 kd = kvm_openfiles(nlistf, memf, NULL, O_RDONLY, errbuf); 375 if (kd == NULL) 376 errx(1, "kvm_openfiles: %s", errbuf); 377 378 if (nlistf == NULL && memf == NULL) 379 (void)setgid(getgid()); 380 381 if ((c = kvm_nlist(kd, namelist)) != 0) { 382 if (c == -1) 383 errx(1, "kvm_nlist: %s %s", "namelist", kvm_geterr(kd)); 384 (void)fprintf(stderr, "vmstat: undefined symbols:"); 385 for (c = 0; c < sizeof(namelist) / sizeof(namelist[0]); c++) 386 if (namelist[c].n_type == 0) 387 fprintf(stderr, " %s", namelist[c].n_name); 388 (void)fputc('\n', stderr); 389 exit(1); 390 } 391 if ((c = kvm_nlist(kd, hashnl)) == -1 || c == X_HASHNL_SIZE) 392 errx(1, "kvm_nlist: %s %s", "hashnl", kvm_geterr(kd)); 393 if (kvm_nlist(kd, histnl) == -1) 394 errx(1, "kvm_nlist: %s %s", "histnl", kvm_geterr(kd)); 395 396 if (todo & VMSTAT) { 397 struct winsize winsize; 398 399 dkinit(0); /* Initialize disk stats, no disks selected. */ 400 401 (void)setgid(getgid()); /* don't need privs anymore */ 402 403 argv = choosedrives(argv); /* Select disks. */ 404 winsize.ws_row = 0; 405 (void)ioctl(STDOUT_FILENO, TIOCGWINSZ, (char *)&winsize); 406 if (winsize.ws_row > 0) 407 winlines = winsize.ws_row; 408 409 } 410 411 #ifdef BACKWARD_COMPATIBILITY 412 if (*argv) { 413 interval.tv_sec = atol(*argv); 414 if (*++argv) 415 reps = atoi(*argv); 416 } 417 #endif 418 419 if (interval.tv_sec) { 420 if (!reps) 421 reps = -1; 422 } else if (reps) 423 interval.tv_sec = 1; 424 425 426 /* 427 * Statistics dumping is incompatible with the default 428 * VMSTAT/dovmstat() output. So perform the interval/reps handling 429 * for it here. 430 */ 431 if ((todo & VMSTAT) == 0) { 432 for (;;) { 433 if (todo & (HISTLIST|HISTDUMP)) { 434 if ((todo & (HISTLIST|HISTDUMP)) == 435 (HISTLIST|HISTDUMP)) 436 errx(1, "you may list or dump," 437 " but not both!"); 438 hist_traverse(todo, histname); 439 putchar('\n'); 440 } 441 if (todo & FORKSTAT) { 442 doforkst(); 443 putchar('\n'); 444 } 445 if (todo & MEMSTAT) { 446 domem(); 447 dopool(verbose); 448 putchar('\n'); 449 } 450 if (todo & SUMSTAT) { 451 dosum(); 452 putchar('\n'); 453 } 454 if (todo & INTRSTAT) { 455 dointr(verbose); 456 putchar('\n'); 457 } 458 if (todo & EVCNTSTAT) { 459 doevcnt(verbose); 460 putchar('\n'); 461 } 462 if (todo & (HASHLIST|HASHSTAT)) { 463 if ((todo & (HASHLIST|HASHSTAT)) == 464 (HASHLIST|HASHSTAT)) 465 errx(1, "you may list or display," 466 " but not both!"); 467 dohashstat(verbose, todo, hashname); 468 putchar('\n'); 469 } 470 471 if (reps >= 0 && --reps <=0) 472 break; 473 nanosleep(&interval, NULL); 474 } 475 } else 476 dovmstat(&interval, reps); 477 exit(0); 478 } 479 480 char ** 481 choosedrives(char **argv) 482 { 483 int i; 484 485 /* 486 * Choose drives to be displayed. Priority goes to (in order) drives 487 * supplied as arguments, default drives. If everything isn't filled 488 * in and there are drives not taken care of, display the first few 489 * that fit. 490 */ 491 #define BACKWARD_COMPATIBILITY 492 for (ndrives = 0; *argv; ++argv) { 493 #ifdef BACKWARD_COMPATIBILITY 494 if (isdigit(**argv)) 495 break; 496 #endif 497 for (i = 0; i < dk_ndrive; i++) { 498 if (strcmp(dr_name[i], *argv)) 499 continue; 500 dk_select[i] = 1; 501 ++ndrives; 502 break; 503 } 504 } 505 for (i = 0; i < dk_ndrive && ndrives < 4; i++) { 506 if (dk_select[i]) 507 continue; 508 dk_select[i] = 1; 509 ++ndrives; 510 } 511 return (argv); 512 } 513 514 long 515 getuptime(void) 516 { 517 static time_t now; 518 static struct timeval boottime; 519 time_t uptime; 520 521 if (boottime.tv_sec == 0) 522 kread(X_BOOTTIME, &boottime, sizeof(boottime)); 523 (void)time(&now); 524 uptime = now - boottime.tv_sec; 525 if (uptime <= 0 || uptime > 60*60*24*365*10) 526 errx(1, "time makes no sense; namelist must be wrong."); 527 return (uptime); 528 } 529 530 int hz, hdrcnt; 531 532 void 533 dovmstat(struct timespec *interval, int reps) 534 { 535 struct vmtotal total; 536 time_t uptime, halfuptime; 537 int mib[2]; 538 size_t size; 539 int pagesize = getpagesize(); 540 541 uptime = getuptime(); 542 halfuptime = uptime / 2; 543 (void)signal(SIGCONT, needhdr); 544 545 if (namelist[X_STATHZ].n_type != 0 && namelist[X_STATHZ].n_value != 0) 546 kread(X_STATHZ, &hz, sizeof(hz)); 547 if (!hz) 548 kread(X_HZ, &hz, sizeof(hz)); 549 550 for (hdrcnt = 1;;) { 551 if (!--hdrcnt) 552 printhdr(); 553 /* Read new disk statistics */ 554 dkreadstats(); 555 kread(X_UVMEXP, &uvmexp, sizeof(uvmexp)); 556 if (memf != NULL) { 557 /* 558 * XXX Can't do this if we're reading a crash 559 * XXX dump because they're lazily-calculated. 560 */ 561 printf("Unable to get vmtotals from crash dump.\n"); 562 memset(&total, 0, sizeof(total)); 563 } else { 564 size = sizeof(total); 565 mib[0] = CTL_VM; 566 mib[1] = VM_METER; 567 if (sysctl(mib, 2, &total, &size, NULL, 0) < 0) { 568 printf("Can't get vmtotals: %s\n", 569 strerror(errno)); 570 memset(&total, 0, sizeof(total)); 571 } 572 } 573 (void)printf("%2d%2d%2d", 574 total.t_rq - 1, total.t_dw + total.t_pw, total.t_sw); 575 #define pgtok(a) (long)((a) * (pagesize >> 10)) 576 #define rate(x) (u_long)(((x) + halfuptime) / uptime) /* round */ 577 (void)printf(" %5ld %5ld ", 578 pgtok(total.t_avm), pgtok(total.t_free)); 579 (void)printf("%4lu ", rate(uvmexp.faults - ouvmexp.faults)); 580 (void)printf("%3lu ", rate(uvmexp.pdreact - ouvmexp.pdreact)); 581 (void)printf("%3lu ", rate(uvmexp.pageins - ouvmexp.pageins)); 582 (void)printf("%4lu ", 583 rate(uvmexp.pgswapout - ouvmexp.pgswapout)); 584 (void)printf("%4lu ", rate(uvmexp.pdfreed - ouvmexp.pdfreed)); 585 (void)printf("%4lu ", rate(uvmexp.pdscans - ouvmexp.pdscans)); 586 dkstats(); 587 (void)printf("%4lu %4lu %3lu ", 588 rate(uvmexp.intrs - ouvmexp.intrs), 589 rate(uvmexp.syscalls - ouvmexp.syscalls), 590 rate(uvmexp.swtch - ouvmexp.swtch)); 591 cpustats(); 592 putchar('\n'); 593 (void)fflush(stdout); 594 if (reps >= 0 && --reps <= 0) 595 break; 596 ouvmexp = uvmexp; 597 uptime = interval->tv_sec; 598 /* 599 * We round upward to avoid losing low-frequency events 600 * (i.e., >= 1 per interval but < 1 per second). 601 */ 602 halfuptime = uptime == 1 ? 0 : (uptime + 1) / 2; 603 nanosleep(interval, NULL); 604 } 605 } 606 607 void 608 printhdr(void) 609 { 610 int i; 611 612 (void)printf(" procs memory page%*s", 23, ""); 613 if (ndrives > 0) 614 (void)printf("%s %*sfaults cpu\n", 615 ((ndrives > 1) ? "disks" : "disk"), 616 ((ndrives > 1) ? ndrives * 3 - 4 : 0), ""); 617 else 618 (void)printf("%*s faults cpu\n", 619 ndrives * 3, ""); 620 621 (void)printf(" r b w avm fre flt re pi po fr sr "); 622 for (i = 0; i < dk_ndrive; i++) 623 if (dk_select[i]) 624 (void)printf("%c%c ", dr_name[i][0], 625 dr_name[i][strlen(dr_name[i]) - 1]); 626 (void)printf(" in sy cs us sy id\n"); 627 hdrcnt = winlines - 2; 628 } 629 630 /* 631 * Force a header to be prepended to the next output. 632 */ 633 void 634 needhdr(int dummy) 635 { 636 637 hdrcnt = 1; 638 } 639 640 long 641 pct(long top, long bot) 642 { 643 long ans; 644 645 if (bot == 0) 646 return (0); 647 ans = (quad_t)top * 100 / bot; 648 return (ans); 649 } 650 651 #define PCT(top, bot) (int)pct((long)(top), (long)(bot)) 652 653 void 654 dosum(void) 655 { 656 struct nchstats nchstats; 657 long nchtotal; 658 659 kread(X_UVMEXP, &uvmexp, sizeof(uvmexp)); 660 661 (void)printf("%9u bytes per page\n", uvmexp.pagesize); 662 663 (void)printf("%9u page color%s\n", 664 uvmexp.ncolors, uvmexp.ncolors == 1 ? "" : "s"); 665 666 (void)printf("%9u pages managed\n", uvmexp.npages); 667 (void)printf("%9u pages free\n", uvmexp.free); 668 (void)printf("%9u pages active\n", uvmexp.active); 669 (void)printf("%9u pages inactive\n", uvmexp.inactive); 670 (void)printf("%9u pages paging\n", uvmexp.paging); 671 (void)printf("%9u pages wired\n", uvmexp.wired); 672 (void)printf("%9u zero pages\n", uvmexp.zeropages); 673 (void)printf("%9u reserve pagedaemon pages\n", 674 uvmexp.reserve_pagedaemon); 675 (void)printf("%9u reserve kernel pages\n", uvmexp.reserve_kernel); 676 (void)printf("%9u anonymous pages\n", uvmexp.anonpages); 677 (void)printf("%9u cached file pages\n", uvmexp.filepages); 678 (void)printf("%9u cached executable pages\n", uvmexp.execpages); 679 680 (void)printf("%9u minimum free pages\n", uvmexp.freemin); 681 (void)printf("%9u target free pages\n", uvmexp.freetarg); 682 (void)printf("%9u target inactive pages\n", uvmexp.inactarg); 683 (void)printf("%9u maximum wired pages\n", uvmexp.wiredmax); 684 685 (void)printf("%9u swap devices\n", uvmexp.nswapdev); 686 (void)printf("%9u swap pages\n", uvmexp.swpages); 687 (void)printf("%9u swap pages in use\n", uvmexp.swpginuse); 688 (void)printf("%9u swap allocations\n", uvmexp.nswget); 689 (void)printf("%9u anons\n", uvmexp.nanon); 690 (void)printf("%9u free anons\n", uvmexp.nfreeanon); 691 692 (void)printf("%9u total faults taken\n", uvmexp.faults); 693 (void)printf("%9u traps\n", uvmexp.traps); 694 (void)printf("%9u device interrupts\n", uvmexp.intrs); 695 (void)printf("%9u cpu context switches\n", uvmexp.swtch); 696 (void)printf("%9u software interrupts\n", uvmexp.softs); 697 (void)printf("%9u system calls\n", uvmexp.syscalls); 698 (void)printf("%9u pagein requests\n", uvmexp.pageins); 699 (void)printf("%9u pageout requests\n", uvmexp.pdpageouts); 700 (void)printf("%9u swap ins\n", uvmexp.swapins); 701 (void)printf("%9u swap outs\n", uvmexp.swapouts); 702 (void)printf("%9u pages swapped in\n", uvmexp.pgswapin); 703 (void)printf("%9u pages swapped out\n", uvmexp.pgswapout); 704 (void)printf("%9u forks total\n", uvmexp.forks); 705 (void)printf("%9u forks blocked parent\n", uvmexp.forks_ppwait); 706 (void)printf("%9u forks shared address space with parent\n", 707 uvmexp.forks_sharevm); 708 (void)printf("%9u pagealloc zero wanted and avail\n", 709 uvmexp.pga_zerohit); 710 (void)printf("%9u pagealloc zero wanted and not avail\n", 711 uvmexp.pga_zeromiss); 712 (void)printf("%9u aborts of idle page zeroing\n", 713 uvmexp.zeroaborts); 714 (void)printf("%9u pagealloc desired color avail\n", 715 uvmexp.colorhit); 716 (void)printf("%9u pagealloc desired color not avail\n", 717 uvmexp.colormiss); 718 719 (void)printf("%9u faults with no memory\n", uvmexp.fltnoram); 720 (void)printf("%9u faults with no anons\n", uvmexp.fltnoanon); 721 (void)printf("%9u faults had to wait on pages\n", uvmexp.fltpgwait); 722 (void)printf("%9u faults found released page\n", uvmexp.fltpgrele); 723 (void)printf("%9u faults relock (%u ok)\n", uvmexp.fltrelck, 724 uvmexp.fltrelckok); 725 (void)printf("%9u anon page faults\n", uvmexp.fltanget); 726 (void)printf("%9u anon retry faults\n", uvmexp.fltanretry); 727 (void)printf("%9u amap copy faults\n", uvmexp.fltamcopy); 728 (void)printf("%9u neighbour anon page faults\n", uvmexp.fltnamap); 729 (void)printf("%9u neighbour object page faults\n", uvmexp.fltnomap); 730 (void)printf("%9u locked pager get faults\n", uvmexp.fltlget); 731 (void)printf("%9u unlocked pager get faults\n", uvmexp.fltget); 732 (void)printf("%9u anon faults\n", uvmexp.flt_anon); 733 (void)printf("%9u anon copy on write faults\n", uvmexp.flt_acow); 734 (void)printf("%9u object faults\n", uvmexp.flt_obj); 735 (void)printf("%9u promote copy faults\n", uvmexp.flt_prcopy); 736 (void)printf("%9u promote zero fill faults\n", uvmexp.flt_przero); 737 738 (void)printf("%9u times daemon wokeup\n",uvmexp.pdwoke); 739 (void)printf("%9u revolutions of the clock hand\n", uvmexp.pdrevs); 740 (void)printf("%9u times daemon attempted swapout\n", uvmexp.pdswout); 741 (void)printf("%9u pages freed by daemon\n", uvmexp.pdfreed); 742 (void)printf("%9u pages scanned by daemon\n", uvmexp.pdscans); 743 (void)printf("%9u anonymous pages scanned by daemon\n", 744 uvmexp.pdanscan); 745 (void)printf("%9u object pages scanned by daemon\n", uvmexp.pdobscan); 746 (void)printf("%9u pages reactivated\n", uvmexp.pdreact); 747 (void)printf("%9u pages found busy by daemon\n", uvmexp.pdbusy); 748 (void)printf("%9u total pending pageouts\n", uvmexp.pdpending); 749 (void)printf("%9u pages deactivated\n", uvmexp.pddeact); 750 kread(X_NCHSTATS, &nchstats, sizeof(nchstats)); 751 nchtotal = nchstats.ncs_goodhits + nchstats.ncs_neghits + 752 nchstats.ncs_badhits + nchstats.ncs_falsehits + 753 nchstats.ncs_miss + nchstats.ncs_long; 754 (void)printf("%9ld total name lookups\n", nchtotal); 755 (void)printf( 756 "%9s cache hits (%d%% pos + %d%% neg) system %d%% per-process\n", 757 "", PCT(nchstats.ncs_goodhits, nchtotal), 758 PCT(nchstats.ncs_neghits, nchtotal), 759 PCT(nchstats.ncs_pass2, nchtotal)); 760 (void)printf("%9s deletions %d%%, falsehits %d%%, toolong %d%%\n", "", 761 PCT(nchstats.ncs_badhits, nchtotal), 762 PCT(nchstats.ncs_falsehits, nchtotal), 763 PCT(nchstats.ncs_long, nchtotal)); 764 } 765 766 void 767 doforkst(void) 768 { 769 770 kread(X_UVMEXP, &uvmexp, sizeof(uvmexp)); 771 772 (void)printf("%u forks total\n", uvmexp.forks); 773 (void)printf("%u forks blocked parent\n", uvmexp.forks_ppwait); 774 (void)printf("%u forks shared address space with parent\n", 775 uvmexp.forks_sharevm); 776 } 777 778 void 779 dkstats(void) 780 { 781 int dn; 782 double etime; 783 784 /* Calculate disk stat deltas. */ 785 dkswap(); 786 etime = cur.cp_etime; 787 788 for (dn = 0; dn < dk_ndrive; ++dn) { 789 if (!dk_select[dn]) 790 continue; 791 (void)printf("%2.0f ", cur.dk_xfer[dn] / etime); 792 } 793 } 794 795 void 796 cpustats(void) 797 { 798 int state; 799 double pct, total; 800 801 total = 0; 802 for (state = 0; state < CPUSTATES; ++state) 803 total += cur.cp_time[state]; 804 if (total) 805 pct = 100 / total; 806 else 807 pct = 0; 808 (void)printf("%2.0f ", 809 (cur.cp_time[CP_USER] + cur.cp_time[CP_NICE]) * pct); 810 (void)printf("%2.0f ", 811 (cur.cp_time[CP_SYS] + cur.cp_time[CP_INTR]) * pct); 812 (void)printf("%2.0f", cur.cp_time[CP_IDLE] * pct); 813 } 814 815 #if defined(pc532) 816 /* To get struct iv ...*/ 817 #define _KERNEL 818 #include <machine/psl.h> 819 #undef _KERNEL 820 void 821 dointr(int verbose) 822 { 823 long i, j, inttotal, uptime; 824 static char iname[64]; 825 struct iv ivt[32], *ivp = ivt; 826 827 iname[sizeof(iname)-1] = '\0'; 828 uptime = getuptime(); 829 kread(X_IVT, ivp, sizeof(ivt)); 830 831 for (i = 0; i < 2; i++) { 832 (void)printf("%sware interrupts:\n", i ? "\nsoft" : "hard"); 833 (void)printf("interrupt total rate\n"); 834 inttotal = 0; 835 for (j = 0; j < 16; j++, ivp++) { 836 if (ivp->iv_vec && ivp->iv_use && 837 (ivp->iv_cnt || verbose)) { 838 deref_kptr(ivp->iv_use, iname, sizeof(iname)-1, 839 "iv_use"); 840 (void)printf("%-12s %8ld %8ld\n", iname, 841 ivp->iv_cnt, ivp->iv_cnt / uptime); 842 inttotal += ivp->iv_cnt; 843 } 844 } 845 (void)printf("Total %8ld %8ld\n", 846 inttotal, inttotal / uptime); 847 } 848 } 849 #else 850 void 851 dointr(int verbose) 852 { 853 unsigned long *intrcnt; 854 unsigned long long inttotal, uptime; 855 int nintr, inamlen; 856 char *intrname; 857 struct evcntlist allevents; 858 struct evcnt evcnt, *evptr; 859 char evgroup[EVCNT_STRING_MAX], evname[EVCNT_STRING_MAX]; 860 861 uptime = getuptime(); 862 nintr = namelist[X_EINTRCNT].n_value - namelist[X_INTRCNT].n_value; 863 inamlen = 864 namelist[X_EINTRNAMES].n_value - namelist[X_INTRNAMES].n_value; 865 intrcnt = malloc((size_t)nintr); 866 intrname = malloc((size_t)inamlen); 867 if (intrcnt == NULL || intrname == NULL) 868 errx(1, "%s", ""); 869 kread(X_INTRCNT, intrcnt, (size_t)nintr); 870 kread(X_INTRNAMES, intrname, (size_t)inamlen); 871 (void)printf("%-34s %16s %8s\n", "interrupt", "total", "rate"); 872 inttotal = 0; 873 nintr /= sizeof(long); 874 while (--nintr >= 0) { 875 if (*intrcnt || verbose) 876 (void)printf("%-34s %16llu %8llu\n", intrname, 877 (unsigned long long)*intrcnt, 878 (unsigned long long)(*intrcnt / uptime)); 879 intrname += strlen(intrname) + 1; 880 inttotal += *intrcnt++; 881 } 882 kread(X_ALLEVENTS, &allevents, sizeof allevents); 883 evptr = allevents.tqh_first; 884 while (evptr) { 885 deref_kptr(evptr, &evcnt, sizeof(evcnt), "event chain trashed"); 886 evptr = evcnt.ev_list.tqe_next; 887 if (evcnt.ev_type != EVCNT_TYPE_INTR) 888 continue; 889 890 if (evcnt.ev_count == 0 && !verbose) 891 continue; 892 893 deref_kptr(evcnt.ev_group, evgroup, evcnt.ev_grouplen + 1, 894 "event chain trashed"); 895 deref_kptr(evcnt.ev_name, evname, evcnt.ev_namelen + 1, 896 "event chain trashed"); 897 898 (void)printf("%s %s%*s %16llu %8llu\n", evgroup, evname, 899 34 - (evcnt.ev_grouplen + 1 + evcnt.ev_namelen), "", 900 (unsigned long long)evcnt.ev_count, 901 (unsigned long long)(evcnt.ev_count / uptime)); 902 903 inttotal += evcnt.ev_count++; 904 } 905 (void)printf("%-34s %16llu %8llu\n", "Total", inttotal, 906 (unsigned long long)(inttotal / uptime)); 907 } 908 #endif 909 910 void 911 doevcnt(int verbose) 912 { 913 static const char * evtypes [] = { "misc", "intr", "trap" }; 914 unsigned long long uptime; 915 struct evcntlist allevents; 916 struct evcnt evcnt, *evptr; 917 char evgroup[EVCNT_STRING_MAX], evname[EVCNT_STRING_MAX]; 918 919 /* XXX should print type! */ 920 921 uptime = getuptime(); 922 (void)printf("%-34s %16s %8s %s\n", "event", "total", "rate", "type"); 923 kread(X_ALLEVENTS, &allevents, sizeof allevents); 924 evptr = allevents.tqh_first; 925 while (evptr) { 926 deref_kptr(evptr, &evcnt, sizeof(evcnt), "event chain trashed"); 927 928 evptr = evcnt.ev_list.tqe_next; 929 if (evcnt.ev_count == 0 && !verbose) 930 continue; 931 932 deref_kptr(evcnt.ev_group, evgroup, evcnt.ev_grouplen + 1, 933 "event chain trashed"); 934 deref_kptr(evcnt.ev_name, evname, evcnt.ev_namelen + 1, 935 "event chain trashed"); 936 937 (void)printf("%s %s%*s %16llu %8llu %s\n", evgroup, evname, 938 34 - (evcnt.ev_grouplen + 1 + evcnt.ev_namelen), "", 939 (unsigned long long)evcnt.ev_count, 940 (unsigned long long)(evcnt.ev_count / uptime), 941 (evcnt.ev_type < sizeof(evtypes)/sizeof(evtypes[0]) ? 942 evtypes[evcnt.ev_type] : "?")); 943 } 944 } 945 946 /* 947 * These names are defined in <sys/malloc.h>. 948 */ 949 char *kmemnames[] = INITKMEMNAMES; 950 951 void 952 domem(void) 953 { 954 struct kmembuckets *kp; 955 struct kmemstats *ks; 956 int i, j; 957 int len, size, first; 958 long totuse = 0, totfree = 0, totreq = 0; 959 char *name; 960 struct kmemstats kmemstats[M_LAST]; 961 struct kmembuckets buckets[MINBUCKET + 16]; 962 963 kread(X_KMEMBUCKETS, buckets, sizeof(buckets)); 964 for (first = 1, i = MINBUCKET, kp = &buckets[i]; i < MINBUCKET + 16; 965 i++, kp++) { 966 if (kp->kb_calls == 0) 967 continue; 968 if (first) { 969 (void)printf("Memory statistics by bucket size\n"); 970 (void)printf( 971 " Size In Use Free Requests HighWater Couldfree\n"); 972 first = 0; 973 } 974 size = 1 << i; 975 (void)printf("%8d %8ld %6ld %10ld %7ld %10ld\n", size, 976 kp->kb_total - kp->kb_totalfree, 977 kp->kb_totalfree, kp->kb_calls, 978 kp->kb_highwat, kp->kb_couldfree); 979 totfree += size * kp->kb_totalfree; 980 } 981 982 /* 983 * If kmem statistics are not being gathered by the kernel, 984 * first will still be 1. 985 */ 986 if (first) { 987 warnx("Kmem statistics are not being gathered by the kernel."); 988 return; 989 } 990 991 kread(X_KMEMSTAT, kmemstats, sizeof(kmemstats)); 992 (void)printf("\nMemory usage type by bucket size\n"); 993 (void)printf(" Size Type(s)\n"); 994 kp = &buckets[MINBUCKET]; 995 for (j = 1 << MINBUCKET; j < 1 << (MINBUCKET + 16); j <<= 1, kp++) { 996 if (kp->kb_calls == 0) 997 continue; 998 first = 1; 999 len = 8; 1000 for (i = 0, ks = &kmemstats[0]; i < M_LAST; i++, ks++) { 1001 if (ks->ks_calls == 0) 1002 continue; 1003 if ((ks->ks_size & j) == 0) 1004 continue; 1005 if (kmemnames[i] == 0) { 1006 kmemnames[i] = malloc(10); 1007 /* strlen("undef/")+3+1);*/ 1008 snprintf(kmemnames[i], 10, "undef/%d", i); 1009 /* same 10 as above!!! */ 1010 } 1011 name = kmemnames[i]; 1012 len += 2 + strlen(name); 1013 if (first) 1014 printf("%8d %s", j, name); 1015 else 1016 printf(","); 1017 if (len >= 80) { 1018 printf("\n\t "); 1019 len = 10 + strlen(name); 1020 } 1021 if (!first) 1022 printf(" %s", name); 1023 first = 0; 1024 } 1025 putchar('\n'); 1026 } 1027 1028 (void)printf( 1029 "\nMemory statistics by type Type Kern\n"); 1030 (void)printf( 1031 " Type InUse MemUse HighUse Limit Requests Limit Limit Size(s)\n"); 1032 for (i = 0, ks = &kmemstats[0]; i < M_LAST; i++, ks++) { 1033 if (ks->ks_calls == 0) 1034 continue; 1035 (void)printf("%14s%6ld%6ldK%7ldK%6ldK%9ld%5u%6u", 1036 kmemnames[i] ? kmemnames[i] : "undefined", 1037 ks->ks_inuse, (ks->ks_memuse + 1023) / 1024, 1038 (ks->ks_maxused + 1023) / 1024, 1039 (ks->ks_limit + 1023) / 1024, ks->ks_calls, 1040 ks->ks_limblocks, ks->ks_mapblocks); 1041 first = 1; 1042 for (j = 1 << MINBUCKET; j < 1 << (MINBUCKET + 16); j <<= 1) { 1043 if ((ks->ks_size & j) == 0) 1044 continue; 1045 if (first) 1046 printf(" %d", j); 1047 else 1048 printf(",%d", j); 1049 first = 0; 1050 } 1051 printf("\n"); 1052 totuse += ks->ks_memuse; 1053 totreq += ks->ks_calls; 1054 } 1055 (void)printf("\nMemory totals: In Use Free Requests\n"); 1056 (void)printf(" %7ldK %6ldK %8ld\n\n", 1057 (totuse + 1023) / 1024, (totfree + 1023) / 1024, totreq); 1058 } 1059 1060 void 1061 dopool(int verbose) 1062 { 1063 int first, ovflw; 1064 void *addr; 1065 long total = 0, inuse = 0; 1066 TAILQ_HEAD(,pool) pool_head; 1067 struct pool pool, *pp = &pool; 1068 struct pool_allocator pa; 1069 char name[32], maxp[32]; 1070 1071 kread(X_POOLHEAD, &pool_head, sizeof(pool_head)); 1072 addr = TAILQ_FIRST(&pool_head); 1073 1074 for (first = 1; addr != NULL; ) { 1075 deref_kptr(addr, pp, sizeof(*pp), "pool chain trashed"); 1076 deref_kptr(pp->pr_alloc, &pa, sizeof(pa), 1077 "pool allocatior trashed"); 1078 deref_kptr(pp->pr_wchan, name, sizeof(name), 1079 "pool wait channel trashed"); 1080 name[sizeof(name)-1] = '\0'; 1081 1082 if (first) { 1083 (void)printf("Memory resource pool statistics\n"); 1084 (void)printf( 1085 "%-11s%5s%9s%5s%9s%6s%6s%6s%6s%6s%6s%5s\n", 1086 "Name", 1087 "Size", 1088 "Requests", 1089 "Fail", 1090 "Releases", 1091 "Pgreq", 1092 "Pgrel", 1093 "Npage", 1094 "Hiwat", 1095 "Minpg", 1096 "Maxpg", 1097 "Idle"); 1098 first = 0; 1099 } 1100 if (pp->pr_maxpages == UINT_MAX) 1101 sprintf(maxp, "inf"); 1102 else 1103 sprintf(maxp, "%u", pp->pr_maxpages); 1104 /* 1105 * Print single word. `ovflow' is number of characters didn't fit 1106 * on the last word. `fmt' is a format string to print this word. 1107 * It must contain asterisk for field width. `width' is a width 1108 * occupied by this word. `fixed' is a number of constant chars in 1109 * `fmt'. `val' is a value to be printed using format string `fmt'. 1110 */ 1111 #define PRWORD(ovflw, fmt, width, fixed, val) do { \ 1112 (ovflw) += printf((fmt), \ 1113 (width) - (fixed) - (ovflw) > 0 ? \ 1114 (width) - (fixed) - (ovflw) : 0, \ 1115 (val)) - (width); \ 1116 if ((ovflw) < 0) \ 1117 (ovflw) = 0; \ 1118 } while (/* CONSTCOND */0) 1119 ovflw = 0; 1120 PRWORD(ovflw, "%-*s", 11, 0, name); 1121 PRWORD(ovflw, " %*u", 5, 1, pp->pr_size); 1122 PRWORD(ovflw, " %*lu", 9, 1, pp->pr_nget); 1123 PRWORD(ovflw, " %*lu", 5, 1, pp->pr_nfail); 1124 PRWORD(ovflw, " %*lu", 9, 1, pp->pr_nput); 1125 PRWORD(ovflw, " %*lu", 6, 1, pp->pr_npagealloc); 1126 PRWORD(ovflw, " %*lu", 6, 1, pp->pr_npagefree); 1127 PRWORD(ovflw, " %*d", 6, 1, pp->pr_npages); 1128 PRWORD(ovflw, " %*d", 6, 1, pp->pr_hiwat); 1129 PRWORD(ovflw, " %*d", 6, 1, pp->pr_minpages); 1130 PRWORD(ovflw, " %*s", 6, 1, maxp); 1131 PRWORD(ovflw, " %*lu\n", 5, 1, pp->pr_nidle); 1132 1133 if (pp->pr_roflags & PR_RECURSIVE) { 1134 /* 1135 * Don't count in-use memory, since it's part 1136 * of another pool and will be accounted for 1137 * there. 1138 */ 1139 total += pp->pr_npages * pa.pa_pagesz - 1140 (pp->pr_nget - pp->pr_nput) * pp->pr_size; 1141 } else { 1142 inuse += (pp->pr_nget - pp->pr_nput) * pp->pr_size; 1143 total += pp->pr_npages * pa.pa_pagesz; 1144 } 1145 dopoolcache(pp, verbose); 1146 addr = TAILQ_NEXT(pp, pr_poollist); 1147 } 1148 1149 inuse /= 1024; 1150 total /= 1024; 1151 printf("\nIn use %ldK, total allocated %ldK; utilization %.1f%%\n", 1152 inuse, total, (double)(100 * inuse) / total); 1153 } 1154 1155 void 1156 dopoolcache(struct pool *pp, int verbose) 1157 { 1158 struct pool_cache pool_cache, *pc = &pool_cache; 1159 struct pool_cache_group pool_cache_group, *pcg = &pool_cache_group; 1160 void *addr, *pcg_addr; 1161 int i; 1162 1163 if (verbose < 1) 1164 return; 1165 1166 for (addr = TAILQ_FIRST(&pp->pr_cachelist); addr != NULL; 1167 addr = TAILQ_NEXT(pc, pc_poollist)) { 1168 deref_kptr(addr, pc, sizeof(*pc), "pool cache trashed"); 1169 printf("\tcache %p: allocfrom %p freeto %p\n", addr, 1170 pc->pc_allocfrom, pc->pc_freeto); 1171 printf("\t hits %lu misses %lu ngroups %lu nitems %lu\n", 1172 pc->pc_hits, pc->pc_misses, pc->pc_ngroups, pc->pc_nitems); 1173 if (verbose < 2) 1174 continue; 1175 for (pcg_addr = TAILQ_FIRST(&pc->pc_grouplist); 1176 pcg_addr != NULL; pcg_addr = TAILQ_NEXT(pcg, pcg_list)) { 1177 deref_kptr(pcg_addr, pcg, sizeof(*pcg), 1178 "pool cache group trashed"); 1179 printf("\t\tgroup %p: avail %d\n", pcg_addr, 1180 pcg->pcg_avail); 1181 for (i = 0; i < PCG_NOBJECTS; i++) 1182 printf("\t\t\t%p\n", pcg->pcg_objects[i]); 1183 } 1184 } 1185 1186 } 1187 1188 enum hashtype { /* from <sys/systm.h> */ 1189 HASH_LIST, 1190 HASH_TAILQ 1191 }; 1192 1193 struct uidinfo { /* XXX: no kernel header file */ 1194 LIST_ENTRY(uidinfo) ui_hash; 1195 uid_t ui_uid; 1196 long ui_proccnt; 1197 }; 1198 1199 struct kernel_hash { 1200 const char * description; /* description */ 1201 int hashsize; /* nlist index for hash size */ 1202 int hashtbl; /* nlist index for hash table */ 1203 enum hashtype type; /* type of hash table */ 1204 size_t offset; /* offset of {LIST,TAILQ}_NEXT */ 1205 } khashes[] = 1206 { 1207 { 1208 "buffer hash", 1209 X_BUFHASH, X_BUFHASHTBL, 1210 HASH_LIST, offsetof(struct buf, b_hash) 1211 }, { 1212 "inode cache (ihash)", 1213 X_IHASH, X_IHASHTBL, 1214 HASH_LIST, offsetof(struct inode, i_hash) 1215 }, { 1216 "ipv4 address -> interface hash", 1217 X_IFADDRHASH, X_IFADDRHASHTBL, 1218 HASH_LIST, offsetof(struct in_ifaddr, ia_hash), 1219 }, { 1220 "name cache hash", 1221 X_NCHASH, X_NCHASHTBL, 1222 HASH_LIST, offsetof(struct namecache, nc_hash), 1223 }, { 1224 "name cache directory hash", 1225 X_NCVHASH, X_NCVHASHTBL, 1226 HASH_LIST, offsetof(struct namecache, nc_vhash), 1227 }, { 1228 "nfs client node cache", 1229 X_NFSNODE, X_NFSNODETBL, 1230 HASH_LIST, offsetof(struct nfsnode, n_hash) 1231 }, { 1232 "process group (pgrp) hash", 1233 X_PGRPHASH, X_PGRPHASHTBL, 1234 HASH_LIST, offsetof(struct pgrp, pg_hash), 1235 }, { 1236 "process id (pid) hash", 1237 X_PIDHASH, X_PIDHASHTBL, 1238 HASH_LIST, offsetof(struct proc, p_hash) 1239 }, { 1240 "user info (uid -> used processes) hash", 1241 X_UIHASH, X_UIHASHTBL, 1242 HASH_LIST, offsetof(struct uidinfo, ui_hash), 1243 }, { 1244 NULL, -1, -1, 0, 0, 1245 } 1246 }; 1247 1248 void 1249 dohashstat(int verbose, int todo, const char *hashname) 1250 { 1251 LIST_HEAD(, generic) *hashtbl_list; 1252 TAILQ_HEAD(, generic) *hashtbl_tailq; 1253 struct kernel_hash *curhash; 1254 void *hashaddr, *hashbuf, *nextaddr; 1255 size_t elemsize, hashbufsize, thissize; 1256 u_long hashsize; 1257 int i, used, items, chain, maxchain; 1258 1259 hashbuf = NULL; 1260 hashbufsize = 0; 1261 1262 if (todo & HASHLIST) { 1263 printf("Supported hashes:\n"); 1264 for (curhash = khashes; curhash->description; curhash++) { 1265 if (hashnl[curhash->hashsize].n_value == 0 || 1266 hashnl[curhash->hashtbl].n_value == 0) 1267 continue; 1268 printf("\t%-16s%s\n", 1269 hashnl[curhash->hashsize].n_name + 1, 1270 curhash->description); 1271 } 1272 return; 1273 } 1274 1275 if (hashname != NULL) { 1276 for (curhash = khashes; curhash->description; curhash++) { 1277 if (strcmp(hashnl[curhash->hashsize].n_name + 1, 1278 hashname) == 0 && 1279 hashnl[curhash->hashsize].n_value != 0 && 1280 hashnl[curhash->hashtbl].n_value != 0) 1281 break; 1282 } 1283 if (curhash->description == NULL) { 1284 warnx("%s: no such hash", hashname); 1285 return; 1286 } 1287 } 1288 1289 printf( 1290 "%-16s %8s %8s %8s %8s %8s %8s\n" 1291 "%-16s %8s %8s %8s %8s %8s %8s\n", 1292 "", "total", "used", "util", "num", "average", "maximum", 1293 "hash table", "buckets", "buckets", "%", "items", "chain", 1294 "chain"); 1295 1296 for (curhash = khashes; curhash->description; curhash++) { 1297 if (hashnl[curhash->hashsize].n_value == 0 || 1298 hashnl[curhash->hashtbl].n_value == 0) 1299 continue; 1300 if (hashname != NULL && 1301 strcmp(hashnl[curhash->hashsize].n_name + 1, hashname)) 1302 continue; 1303 elemsize = curhash->type == HASH_LIST ? 1304 sizeof(*hashtbl_list) : sizeof(*hashtbl_tailq); 1305 deref_kptr((void *)hashnl[curhash->hashsize].n_value, 1306 &hashsize, sizeof(hashsize), 1307 hashnl[curhash->hashsize].n_name); 1308 hashsize++; 1309 deref_kptr((void *)hashnl[curhash->hashtbl].n_value, 1310 &hashaddr, sizeof(hashaddr), 1311 hashnl[curhash->hashtbl].n_name); 1312 if (verbose) 1313 printf("%s %lu, %s %p, offset %ld, elemsize %llu\n", 1314 hashnl[curhash->hashsize].n_name + 1, hashsize, 1315 hashnl[curhash->hashtbl].n_name + 1, hashaddr, 1316 (long)curhash->offset, 1317 (unsigned long long)elemsize); 1318 thissize = hashsize * elemsize; 1319 if (thissize > hashbufsize) { 1320 hashbufsize = thissize; 1321 if ((hashbuf = realloc(hashbuf, hashbufsize)) == NULL) 1322 errx(1, "malloc hashbuf %llu", 1323 (unsigned long long)hashbufsize); 1324 } 1325 deref_kptr(hashaddr, hashbuf, thissize, 1326 hashnl[curhash->hashtbl].n_name); 1327 used = 0; 1328 items = maxchain = 0; 1329 if (curhash->type == HASH_LIST) 1330 hashtbl_list = hashbuf; 1331 else 1332 hashtbl_tailq = hashbuf; 1333 for (i = 0; i < hashsize; i++) { 1334 if (curhash->type == HASH_LIST) 1335 nextaddr = LIST_FIRST(&hashtbl_list[i]); 1336 else 1337 nextaddr = TAILQ_FIRST(&hashtbl_tailq[i]); 1338 if (nextaddr == NULL) 1339 continue; 1340 if (verbose) 1341 printf("%5d: %p\n", i, nextaddr); 1342 used++; 1343 chain = 0; 1344 do { 1345 chain++; 1346 deref_kptr((char *)nextaddr + curhash->offset, 1347 &nextaddr, sizeof(void *), 1348 "hash chain corrupted"); 1349 if (verbose > 1) 1350 printf("got nextaddr as %p\n", 1351 nextaddr); 1352 } while (nextaddr != NULL); 1353 items += chain; 1354 if (verbose && chain > 1) 1355 printf("\tchain = %d\n", chain); 1356 if (chain > maxchain) 1357 maxchain = chain; 1358 } 1359 printf("%-16s %8ld %8d %8.2f %8d %8.2f %8d\n", 1360 hashnl[curhash->hashsize].n_name + 1, 1361 hashsize, used, used * 100.0 / hashsize, 1362 items, used ? (double)items / used : 0.0, maxchain); 1363 } 1364 } 1365 1366 /* 1367 * kread reads something from the kernel, given its nlist index in namelist[]. 1368 */ 1369 void 1370 kread(int nlx, void *addr, size_t size) 1371 { 1372 const char *sym; 1373 1374 sym = namelist[nlx].n_name; 1375 if (*sym == '_') 1376 ++sym; 1377 if (namelist[nlx].n_type == 0 || namelist[nlx].n_value == 0) 1378 errx(1, "symbol %s not defined", sym); 1379 deref_kptr((void *)namelist[nlx].n_value, addr, size, sym); 1380 } 1381 1382 /* 1383 * Dereference the kernel pointer `kptr' and fill in the local copy 1384 * pointed to by `ptr'. The storage space must be pre-allocated, 1385 * and the size of the copy passed in `len'. 1386 */ 1387 void 1388 deref_kptr(const void *kptr, void *ptr, size_t len, const char *msg) 1389 { 1390 1391 if (*msg == '_') 1392 msg++; 1393 if (kvm_read(kd, (u_long)kptr, (char *)ptr, len) != len) 1394 errx(1, "kptr %lx: %s: %s", (u_long)kptr, msg, kvm_geterr(kd)); 1395 } 1396 1397 /* 1398 * Traverse the UVM history buffers, performing the requested action. 1399 * 1400 * Note, we assume that if we're not listing, we're dumping. 1401 */ 1402 void 1403 hist_traverse(int todo, const char *histname) 1404 { 1405 struct uvm_history_head histhead; 1406 struct uvm_history hist, *histkva; 1407 char *name = NULL; 1408 size_t namelen = 0; 1409 1410 if (histnl[0].n_value == 0) { 1411 warnx("UVM history is not compiled into the kernel."); 1412 return; 1413 } 1414 1415 deref_kptr((void *)histnl[X_UVM_HISTORIES].n_value, &histhead, 1416 sizeof(histhead), histnl[X_UVM_HISTORIES].n_name); 1417 1418 if (histhead.lh_first == NULL) { 1419 warnx("No active UVM history logs."); 1420 return; 1421 } 1422 1423 if (todo & HISTLIST) 1424 printf("Active UVM histories:"); 1425 1426 for (histkva = LIST_FIRST(&histhead); histkva != NULL; 1427 histkva = LIST_NEXT(&hist, list)) { 1428 deref_kptr(histkva, &hist, sizeof(hist), "histkva"); 1429 if (hist.namelen > namelen) { 1430 if (name != NULL) 1431 free(name); 1432 namelen = hist.namelen; 1433 if ((name = malloc(namelen + 1)) == NULL) 1434 err(1, "malloc history name"); 1435 } 1436 1437 deref_kptr(hist.name, name, namelen, "history name"); 1438 name[namelen] = '\0'; 1439 if (todo & HISTLIST) 1440 printf(" %s", name); 1441 else { 1442 /* 1443 * If we're dumping all histories, do it, else 1444 * check to see if this is the one we want. 1445 */ 1446 if (histname == NULL || strcmp(histname, name) == 0) { 1447 if (histname == NULL) 1448 printf("\nUVM history `%s':\n", name); 1449 hist_dodump(&hist); 1450 } 1451 } 1452 } 1453 1454 if (todo & HISTLIST) 1455 putchar('\n'); 1456 1457 if (name != NULL) 1458 free(name); 1459 } 1460 1461 /* 1462 * Actually dump the history buffer at the specified KVA. 1463 */ 1464 void 1465 hist_dodump(struct uvm_history *histp) 1466 { 1467 struct uvm_history_ent *histents, *e; 1468 size_t histsize; 1469 char *fmt = NULL, *fn = NULL; 1470 size_t fmtlen = 0, fnlen = 0; 1471 int i; 1472 1473 histsize = sizeof(struct uvm_history_ent) * histp->n; 1474 1475 if ((histents = malloc(histsize)) == NULL) 1476 err(1, "malloc history entries"); 1477 1478 memset(histents, 0, histsize); 1479 1480 deref_kptr(histp->e, histents, histsize, "history entries"); 1481 i = histp->f; 1482 do { 1483 e = &histents[i]; 1484 if (e->fmt != NULL) { 1485 if (e->fmtlen > fmtlen) { 1486 if (fmt != NULL) 1487 free(fmt); 1488 fmtlen = e->fmtlen; 1489 if ((fmt = malloc(fmtlen + 1)) == NULL) 1490 err(1, "malloc printf format"); 1491 } 1492 if (e->fnlen > fnlen) { 1493 if (fn != NULL) 1494 free(fn); 1495 fnlen = e->fnlen; 1496 if ((fn = malloc(fnlen + 1)) == NULL) 1497 err(1, "malloc function name"); 1498 } 1499 1500 deref_kptr(e->fmt, fmt, fmtlen, "printf format"); 1501 fmt[fmtlen] = '\0'; 1502 1503 deref_kptr(e->fn, fn, fnlen, "function name"); 1504 fn[fnlen] = '\0'; 1505 1506 printf("%06ld.%06ld ", (long int)e->tv.tv_sec, 1507 (long int)e->tv.tv_usec); 1508 printf("%s#%ld: ", fn, e->call); 1509 printf(fmt, e->v[0], e->v[1], e->v[2], e->v[3]); 1510 putchar('\n'); 1511 } 1512 i = (i + 1) % histp->n; 1513 } while (i != histp->f); 1514 1515 free(histents); 1516 if (fmt != NULL) 1517 free(fmt); 1518 if (fn != NULL) 1519 free(fn); 1520 } 1521 1522 void 1523 usage(void) 1524 { 1525 1526 (void)fprintf(stderr, 1527 "usage: %s [-efHilmsUv] [-h hashname] [-u histname] [-c count]\n" 1528 "\t\t[-M core] [-N system] [-w wait] [disks]\n", getprogname()); 1529 exit(1); 1530 } 1531