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