vmstat.c revision 1.100.2.3
1 /* $NetBSD: vmstat.c,v 1.100.2.3 2003/10/02 09:37:52 tron 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.100.2.3 2003/10/02 09:37:52 tron 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_TIME 13 172 { "_time" }, 173 #define X_END 14 174 #if defined(pc532) 175 #define X_IVT (X_END) 176 { "_ivt" }, 177 #endif 178 { NULL }, 179 }; 180 181 /* 182 * Namelist for hash statistics 183 */ 184 struct nlist hashnl[] = 185 { 186 #define X_NFSNODE 0 187 { "_nfsnodehash" }, 188 #define X_NFSNODETBL 1 189 { "_nfsnodehashtbl" }, 190 #define X_IHASH 2 191 { "_ihash" }, 192 #define X_IHASHTBL 3 193 { "_ihashtbl" }, 194 #define X_BUFHASH 4 195 { "_bufhash" }, 196 #define X_BUFHASHTBL 5 197 { "_bufhashtbl" }, 198 #define X_PIDHASH 6 199 { "_pidhash" }, 200 #define X_PIDHASHTBL 7 201 { "_pidhashtbl" }, 202 #define X_PGRPHASH 8 203 { "_pgrphash" }, 204 #define X_PGRPHASHTBL 9 205 { "_pgrphashtbl" }, 206 #define X_UIHASH 10 207 { "_uihash" }, 208 #define X_UIHASHTBL 11 209 { "_uihashtbl" }, 210 #define X_IFADDRHASH 12 211 { "_in_ifaddrhash" }, 212 #define X_IFADDRHASHTBL 13 213 { "_in_ifaddrhashtbl" }, 214 #define X_NCHASH 14 215 { "_nchash" }, 216 #define X_NCHASHTBL 15 217 { "_nchashtbl" }, 218 #define X_NCVHASH 16 219 { "_ncvhash" }, 220 #define X_NCVHASHTBL 17 221 { "_ncvhashtbl" }, 222 #define X_HASHNL_SIZE 18 /* must be last */ 223 { NULL }, 224 225 }; 226 227 /* 228 * Namelist for UVM histories 229 */ 230 struct nlist histnl[] = 231 { 232 { "_uvm_histories" }, 233 #define X_UVM_HISTORIES 0 234 { NULL }, 235 }; 236 237 238 239 struct uvmexp uvmexp, ouvmexp; 240 int ndrives; 241 242 int winlines = 20; 243 244 kvm_t *kd; 245 246 #define FORKSTAT 1<<0 247 #define INTRSTAT 1<<1 248 #define MEMSTAT 1<<2 249 #define SUMSTAT 1<<3 250 #define EVCNTSTAT 1<<4 251 #define VMSTAT 1<<5 252 #define HISTLIST 1<<6 253 #define HISTDUMP 1<<7 254 #define HASHSTAT 1<<8 255 #define HASHLIST 1<<9 256 257 void cpustats(void); 258 void deref_kptr(const void *, void *, size_t, const char *); 259 void dkstats(void); 260 void doevcnt(int verbose); 261 void dohashstat(int, int, const char *); 262 void dointr(int verbose); 263 void domem(void); 264 void dopool(int); 265 void dopoolcache(struct pool *, int); 266 void dosum(void); 267 void dovmstat(u_int, int); 268 void kread(int, void *, size_t); 269 void needhdr(int); 270 long getuptime(void); 271 void printhdr(void); 272 long pct(long, long); 273 void usage(void); 274 void doforkst(void); 275 276 void hist_traverse(int, const char *); 277 void hist_dodump(struct uvm_history *); 278 279 int main(int, char **); 280 char **choosedrives(char **); 281 282 /* Namelist and memory file names. */ 283 char *nlistf, *memf; 284 285 /* allow old usage [vmstat 1] */ 286 #define BACKWARD_COMPATIBILITY 287 288 int 289 main(int argc, char *argv[]) 290 { 291 int c, todo, verbose; 292 u_int interval; 293 int reps; 294 char errbuf[_POSIX2_LINE_MAX]; 295 gid_t egid = getegid(); 296 const char *histname, *hashname; 297 298 histname = hashname = NULL; 299 (void)setegid(getgid()); 300 memf = nlistf = NULL; 301 interval = reps = todo = verbose = 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 = atoi(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 = atoi(*argv); 414 if (*++argv) 415 reps = atoi(*argv); 416 } 417 #endif 418 419 if (interval) { 420 if (!reps) 421 reps = -1; 422 } else if (reps) 423 interval = 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 sleep(interval); 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 struct timeval boottime; 518 struct timeval now, diff; 519 time_t uptime; 520 521 if (boottime.tv_sec == 0) 522 kread(X_BOOTTIME, &boottime, sizeof(boottime)); 523 kread(X_TIME, &now, sizeof(now)); 524 timersub(&now, &boottime, &diff); 525 uptime = diff.tv_sec; 526 if (uptime <= 0 || uptime > 60*60*24*365*10) 527 errx(1, "time makes no sense; namelist must be wrong."); 528 return (uptime); 529 } 530 531 int hz, hdrcnt; 532 533 void 534 dovmstat(u_int interval, int reps) 535 { 536 struct vmtotal total; 537 time_t uptime, halfuptime; 538 int mib[2]; 539 size_t size; 540 int pagesize = getpagesize(); 541 542 uptime = getuptime(); 543 halfuptime = uptime / 2; 544 (void)signal(SIGCONT, needhdr); 545 546 if (namelist[X_STATHZ].n_type != 0 && namelist[X_STATHZ].n_value != 0) 547 kread(X_STATHZ, &hz, sizeof(hz)); 548 if (!hz) 549 kread(X_HZ, &hz, sizeof(hz)); 550 551 for (hdrcnt = 1;;) { 552 if (!--hdrcnt) 553 printhdr(); 554 /* Read new disk statistics */ 555 dkreadstats(); 556 kread(X_UVMEXP, &uvmexp, sizeof(uvmexp)); 557 if (memf != NULL) { 558 /* 559 * XXX Can't do this if we're reading a crash 560 * XXX dump because they're lazily-calculated. 561 */ 562 printf("Unable to get vmtotals from crash dump.\n"); 563 memset(&total, 0, sizeof(total)); 564 } else { 565 size = sizeof(total); 566 mib[0] = CTL_VM; 567 mib[1] = VM_METER; 568 if (sysctl(mib, 2, &total, &size, NULL, 0) < 0) { 569 printf("Can't get vmtotals: %s\n", 570 strerror(errno)); 571 memset(&total, 0, sizeof(total)); 572 } 573 } 574 (void)printf("%2d%2d%2d", 575 total.t_rq - 1, total.t_dw + total.t_pw, total.t_sw); 576 #define pgtok(a) (long)((a) * (pagesize >> 10)) 577 #define rate(x) (u_long)(((x) + halfuptime) / uptime) /* round */ 578 (void)printf(" %5ld %5ld ", 579 pgtok(total.t_avm), pgtok(total.t_free)); 580 (void)printf("%4lu ", rate(uvmexp.faults - ouvmexp.faults)); 581 (void)printf("%3lu ", rate(uvmexp.pdreact - ouvmexp.pdreact)); 582 (void)printf("%3lu ", rate(uvmexp.pageins - ouvmexp.pageins)); 583 (void)printf("%4lu ", 584 rate(uvmexp.pgswapout - ouvmexp.pgswapout)); 585 (void)printf("%4lu ", rate(uvmexp.pdfreed - ouvmexp.pdfreed)); 586 (void)printf("%4lu ", rate(uvmexp.pdscans - ouvmexp.pdscans)); 587 dkstats(); 588 (void)printf("%4lu %4lu %3lu ", 589 rate(uvmexp.intrs - ouvmexp.intrs), 590 rate(uvmexp.syscalls - ouvmexp.syscalls), 591 rate(uvmexp.swtch - ouvmexp.swtch)); 592 cpustats(); 593 putchar('\n'); 594 (void)fflush(stdout); 595 if (reps >= 0 && --reps <= 0) 596 break; 597 ouvmexp = uvmexp; 598 uptime = interval; 599 /* 600 * We round upward to avoid losing low-frequency events 601 * (i.e., >= 1 per interval but < 1 per second). 602 */ 603 halfuptime = uptime == 1 ? 0 : (uptime + 1) / 2; 604 (void)sleep(interval); 605 } 606 } 607 608 void 609 printhdr(void) 610 { 611 int i; 612 613 (void)printf(" procs memory page%*s", 23, ""); 614 if (ndrives > 0) 615 (void)printf("%s %*sfaults cpu\n", 616 ((ndrives > 1) ? "disks" : "disk"), 617 ((ndrives > 1) ? ndrives * 3 - 4 : 0), ""); 618 else 619 (void)printf("%*s faults cpu\n", 620 ndrives * 3, ""); 621 622 (void)printf(" r b w avm fre flt re pi po fr sr "); 623 for (i = 0; i < dk_ndrive; i++) 624 if (dk_select[i]) 625 (void)printf("%c%c ", dr_name[i][0], 626 dr_name[i][strlen(dr_name[i]) - 1]); 627 (void)printf(" in sy cs us sy id\n"); 628 hdrcnt = winlines - 2; 629 } 630 631 /* 632 * Force a header to be prepended to the next output. 633 */ 634 void 635 needhdr(int dummy) 636 { 637 638 hdrcnt = 1; 639 } 640 641 long 642 pct(long top, long bot) 643 { 644 long ans; 645 646 if (bot == 0) 647 return (0); 648 ans = (quad_t)top * 100 / bot; 649 return (ans); 650 } 651 652 #define PCT(top, bot) (int)pct((long)(top), (long)(bot)) 653 654 void 655 dosum(void) 656 { 657 struct nchstats nchstats; 658 long nchtotal; 659 660 kread(X_UVMEXP, &uvmexp, sizeof(uvmexp)); 661 662 (void)printf("%9u bytes per page\n", uvmexp.pagesize); 663 664 (void)printf("%9u page color%s\n", 665 uvmexp.ncolors, uvmexp.ncolors == 1 ? "" : "s"); 666 667 (void)printf("%9u pages managed\n", uvmexp.npages); 668 (void)printf("%9u pages free\n", uvmexp.free); 669 (void)printf("%9u pages active\n", uvmexp.active); 670 (void)printf("%9u pages inactive\n", uvmexp.inactive); 671 (void)printf("%9u pages paging\n", uvmexp.paging); 672 (void)printf("%9u pages wired\n", uvmexp.wired); 673 (void)printf("%9u zero pages\n", uvmexp.zeropages); 674 (void)printf("%9u reserve pagedaemon pages\n", 675 uvmexp.reserve_pagedaemon); 676 (void)printf("%9u reserve kernel pages\n", uvmexp.reserve_kernel); 677 (void)printf("%9u anonymous pages\n", uvmexp.anonpages); 678 (void)printf("%9u cached file pages\n", uvmexp.filepages); 679 (void)printf("%9u cached executable pages\n", uvmexp.execpages); 680 681 (void)printf("%9u minimum free pages\n", uvmexp.freemin); 682 (void)printf("%9u target free pages\n", uvmexp.freetarg); 683 (void)printf("%9u target inactive pages\n", uvmexp.inactarg); 684 (void)printf("%9u maximum wired pages\n", uvmexp.wiredmax); 685 686 (void)printf("%9u swap devices\n", uvmexp.nswapdev); 687 (void)printf("%9u swap pages\n", uvmexp.swpages); 688 (void)printf("%9u swap pages in use\n", uvmexp.swpginuse); 689 (void)printf("%9u swap allocations\n", uvmexp.nswget); 690 (void)printf("%9u anons\n", uvmexp.nanon); 691 (void)printf("%9u free anons\n", uvmexp.nfreeanon); 692 693 (void)printf("%9u total faults taken\n", uvmexp.faults); 694 (void)printf("%9u traps\n", uvmexp.traps); 695 (void)printf("%9u device interrupts\n", uvmexp.intrs); 696 (void)printf("%9u cpu context switches\n", uvmexp.swtch); 697 (void)printf("%9u software interrupts\n", uvmexp.softs); 698 (void)printf("%9u system calls\n", uvmexp.syscalls); 699 (void)printf("%9u pagein requests\n", uvmexp.pageins); 700 (void)printf("%9u pageout requests\n", uvmexp.pdpageouts); 701 (void)printf("%9u swap ins\n", uvmexp.swapins); 702 (void)printf("%9u swap outs\n", uvmexp.swapouts); 703 (void)printf("%9u pages swapped in\n", uvmexp.pgswapin); 704 (void)printf("%9u pages swapped out\n", uvmexp.pgswapout); 705 (void)printf("%9u forks total\n", uvmexp.forks); 706 (void)printf("%9u forks blocked parent\n", uvmexp.forks_ppwait); 707 (void)printf("%9u forks shared address space with parent\n", 708 uvmexp.forks_sharevm); 709 (void)printf("%9u pagealloc zero wanted and avail\n", 710 uvmexp.pga_zerohit); 711 (void)printf("%9u pagealloc zero wanted and not avail\n", 712 uvmexp.pga_zeromiss); 713 (void)printf("%9u aborts of idle page zeroing\n", 714 uvmexp.zeroaborts); 715 (void)printf("%9u pagealloc desired color avail\n", 716 uvmexp.colorhit); 717 (void)printf("%9u pagealloc desired color not avail\n", 718 uvmexp.colormiss); 719 720 (void)printf("%9u faults with no memory\n", uvmexp.fltnoram); 721 (void)printf("%9u faults with no anons\n", uvmexp.fltnoanon); 722 (void)printf("%9u faults had to wait on pages\n", uvmexp.fltpgwait); 723 (void)printf("%9u faults found released page\n", uvmexp.fltpgrele); 724 (void)printf("%9u faults relock (%u ok)\n", uvmexp.fltrelck, 725 uvmexp.fltrelckok); 726 (void)printf("%9u anon page faults\n", uvmexp.fltanget); 727 (void)printf("%9u anon retry faults\n", uvmexp.fltanretry); 728 (void)printf("%9u amap copy faults\n", uvmexp.fltamcopy); 729 (void)printf("%9u neighbour anon page faults\n", uvmexp.fltnamap); 730 (void)printf("%9u neighbour object page faults\n", uvmexp.fltnomap); 731 (void)printf("%9u locked pager get faults\n", uvmexp.fltlget); 732 (void)printf("%9u unlocked pager get faults\n", uvmexp.fltget); 733 (void)printf("%9u anon faults\n", uvmexp.flt_anon); 734 (void)printf("%9u anon copy on write faults\n", uvmexp.flt_acow); 735 (void)printf("%9u object faults\n", uvmexp.flt_obj); 736 (void)printf("%9u promote copy faults\n", uvmexp.flt_prcopy); 737 (void)printf("%9u promote zero fill faults\n", uvmexp.flt_przero); 738 739 (void)printf("%9u times daemon wokeup\n",uvmexp.pdwoke); 740 (void)printf("%9u revolutions of the clock hand\n", uvmexp.pdrevs); 741 (void)printf("%9u times daemon attempted swapout\n", uvmexp.pdswout); 742 (void)printf("%9u pages freed by daemon\n", uvmexp.pdfreed); 743 (void)printf("%9u pages scanned by daemon\n", uvmexp.pdscans); 744 (void)printf("%9u anonymous pages scanned by daemon\n", 745 uvmexp.pdanscan); 746 (void)printf("%9u object pages scanned by daemon\n", uvmexp.pdobscan); 747 (void)printf("%9u pages reactivated\n", uvmexp.pdreact); 748 (void)printf("%9u pages found busy by daemon\n", uvmexp.pdbusy); 749 (void)printf("%9u total pending pageouts\n", uvmexp.pdpending); 750 (void)printf("%9u pages deactivated\n", uvmexp.pddeact); 751 kread(X_NCHSTATS, &nchstats, sizeof(nchstats)); 752 nchtotal = nchstats.ncs_goodhits + nchstats.ncs_neghits + 753 nchstats.ncs_badhits + nchstats.ncs_falsehits + 754 nchstats.ncs_miss + nchstats.ncs_long; 755 (void)printf("%9ld total name lookups\n", nchtotal); 756 (void)printf( 757 "%9s cache hits (%d%% pos + %d%% neg) system %d%% per-process\n", 758 "", PCT(nchstats.ncs_goodhits, nchtotal), 759 PCT(nchstats.ncs_neghits, nchtotal), 760 PCT(nchstats.ncs_pass2, nchtotal)); 761 (void)printf("%9s deletions %d%%, falsehits %d%%, toolong %d%%\n", "", 762 PCT(nchstats.ncs_badhits, nchtotal), 763 PCT(nchstats.ncs_falsehits, nchtotal), 764 PCT(nchstats.ncs_long, nchtotal)); 765 } 766 767 void 768 doforkst(void) 769 { 770 771 kread(X_UVMEXP, &uvmexp, sizeof(uvmexp)); 772 773 (void)printf("%u forks total\n", uvmexp.forks); 774 (void)printf("%u forks blocked parent\n", uvmexp.forks_ppwait); 775 (void)printf("%u forks shared address space with parent\n", 776 uvmexp.forks_sharevm); 777 } 778 779 void 780 dkstats(void) 781 { 782 int dn; 783 double etime; 784 785 /* Calculate disk stat deltas. */ 786 dkswap(); 787 etime = cur.cp_etime; 788 789 for (dn = 0; dn < dk_ndrive; ++dn) { 790 if (!dk_select[dn]) 791 continue; 792 (void)printf("%2.0f ", cur.dk_xfer[dn] / etime); 793 } 794 } 795 796 void 797 cpustats(void) 798 { 799 int state; 800 double pct, total; 801 802 total = 0; 803 for (state = 0; state < CPUSTATES; ++state) 804 total += cur.cp_time[state]; 805 if (total) 806 pct = 100 / total; 807 else 808 pct = 0; 809 (void)printf("%2.0f ", 810 (cur.cp_time[CP_USER] + cur.cp_time[CP_NICE]) * pct); 811 (void)printf("%2.0f ", 812 (cur.cp_time[CP_SYS] + cur.cp_time[CP_INTR]) * pct); 813 (void)printf("%2.0f", cur.cp_time[CP_IDLE] * pct); 814 } 815 816 #if defined(pc532) 817 /* To get struct iv ...*/ 818 #define _KERNEL 819 #include <machine/psl.h> 820 #undef _KERNEL 821 void 822 dointr(int verbose) 823 { 824 long i, j, inttotal, uptime; 825 static char iname[64]; 826 struct iv ivt[32], *ivp = ivt; 827 828 iname[sizeof(iname)-1] = '\0'; 829 uptime = getuptime(); 830 kread(X_IVT, ivp, sizeof(ivt)); 831 832 for (i = 0; i < 2; i++) { 833 (void)printf("%sware interrupts:\n", i ? "\nsoft" : "hard"); 834 (void)printf("interrupt total rate\n"); 835 inttotal = 0; 836 for (j = 0; j < 16; j++, ivp++) { 837 if (ivp->iv_vec && ivp->iv_use && 838 (ivp->iv_cnt || verbose)) { 839 deref_kptr(ivp->iv_use, iname, sizeof(iname)-1, 840 "iv_use"); 841 (void)printf("%-12s %8ld %8ld\n", iname, 842 ivp->iv_cnt, ivp->iv_cnt / uptime); 843 inttotal += ivp->iv_cnt; 844 } 845 } 846 (void)printf("Total %8ld %8ld\n", 847 inttotal, inttotal / uptime); 848 } 849 } 850 #else 851 void 852 dointr(int verbose) 853 { 854 unsigned long *intrcnt; 855 unsigned long long inttotal, uptime; 856 int nintr, inamlen; 857 char *intrname; 858 struct evcntlist allevents; 859 struct evcnt evcnt, *evptr; 860 char evgroup[EVCNT_STRING_MAX], evname[EVCNT_STRING_MAX]; 861 862 uptime = getuptime(); 863 nintr = namelist[X_EINTRCNT].n_value - namelist[X_INTRCNT].n_value; 864 inamlen = 865 namelist[X_EINTRNAMES].n_value - namelist[X_INTRNAMES].n_value; 866 intrcnt = malloc((size_t)nintr); 867 intrname = malloc((size_t)inamlen); 868 if (intrcnt == NULL || intrname == NULL) 869 errx(1, "%s", ""); 870 kread(X_INTRCNT, intrcnt, (size_t)nintr); 871 kread(X_INTRNAMES, intrname, (size_t)inamlen); 872 (void)printf("%-34s %16s %8s\n", "interrupt", "total", "rate"); 873 inttotal = 0; 874 nintr /= sizeof(long); 875 while (--nintr >= 0) { 876 if (*intrcnt || verbose) 877 (void)printf("%-34s %16llu %8llu\n", intrname, 878 (unsigned long long)*intrcnt, 879 (unsigned long long)(*intrcnt / uptime)); 880 intrname += strlen(intrname) + 1; 881 inttotal += *intrcnt++; 882 } 883 kread(X_ALLEVENTS, &allevents, sizeof allevents); 884 evptr = allevents.tqh_first; 885 while (evptr) { 886 deref_kptr(evptr, &evcnt, sizeof(evcnt), "event chain trashed"); 887 evptr = evcnt.ev_list.tqe_next; 888 if (evcnt.ev_type != EVCNT_TYPE_INTR) 889 continue; 890 891 if (evcnt.ev_count == 0 && !verbose) 892 continue; 893 894 deref_kptr(evcnt.ev_group, evgroup, evcnt.ev_grouplen + 1, 895 "event chain trashed"); 896 deref_kptr(evcnt.ev_name, evname, evcnt.ev_namelen + 1, 897 "event chain trashed"); 898 899 (void)printf("%s %s%*s %16llu %8llu\n", evgroup, evname, 900 34 - (evcnt.ev_grouplen + 1 + evcnt.ev_namelen), "", 901 (unsigned long long)evcnt.ev_count, 902 (unsigned long long)(evcnt.ev_count / uptime)); 903 904 inttotal += evcnt.ev_count++; 905 } 906 (void)printf("%-34s %16llu %8llu\n", "Total", inttotal, 907 (unsigned long long)(inttotal / uptime)); 908 } 909 #endif 910 911 void 912 doevcnt(int verbose) 913 { 914 static const char * evtypes [] = { "misc", "intr", "trap" }; 915 unsigned long long uptime; 916 struct evcntlist allevents; 917 struct evcnt evcnt, *evptr; 918 char evgroup[EVCNT_STRING_MAX], evname[EVCNT_STRING_MAX]; 919 920 /* XXX should print type! */ 921 922 uptime = getuptime(); 923 (void)printf("%-34s %16s %8s %s\n", "event", "total", "rate", "type"); 924 kread(X_ALLEVENTS, &allevents, sizeof allevents); 925 evptr = allevents.tqh_first; 926 while (evptr) { 927 deref_kptr(evptr, &evcnt, sizeof(evcnt), "event chain trashed"); 928 929 evptr = evcnt.ev_list.tqe_next; 930 if (evcnt.ev_count == 0 && !verbose) 931 continue; 932 933 deref_kptr(evcnt.ev_group, evgroup, evcnt.ev_grouplen + 1, 934 "event chain trashed"); 935 deref_kptr(evcnt.ev_name, evname, evcnt.ev_namelen + 1, 936 "event chain trashed"); 937 938 (void)printf("%s %s%*s %16llu %8llu %s\n", evgroup, evname, 939 34 - (evcnt.ev_grouplen + 1 + evcnt.ev_namelen), "", 940 (unsigned long long)evcnt.ev_count, 941 (unsigned long long)(evcnt.ev_count / uptime), 942 (evcnt.ev_type < sizeof(evtypes)/sizeof(evtypes[0]) ? 943 evtypes[evcnt.ev_type] : "?")); 944 } 945 } 946 947 /* 948 * These names are defined in <sys/malloc.h>. 949 */ 950 char *kmemnames[] = INITKMEMNAMES; 951 952 void 953 domem(void) 954 { 955 struct kmembuckets *kp; 956 struct kmemstats *ks; 957 int i, j; 958 int len, size, first; 959 long totuse = 0, totfree = 0, totreq = 0; 960 char *name; 961 struct kmemstats kmemstats[M_LAST]; 962 struct kmembuckets buckets[MINBUCKET + 16]; 963 964 kread(X_KMEMBUCKETS, buckets, sizeof(buckets)); 965 for (first = 1, i = MINBUCKET, kp = &buckets[i]; i < MINBUCKET + 16; 966 i++, kp++) { 967 if (kp->kb_calls == 0) 968 continue; 969 if (first) { 970 (void)printf("Memory statistics by bucket size\n"); 971 (void)printf( 972 " Size In Use Free Requests HighWater Couldfree\n"); 973 first = 0; 974 } 975 size = 1 << i; 976 (void)printf("%8d %8ld %6ld %10ld %7ld %10ld\n", size, 977 kp->kb_total - kp->kb_totalfree, 978 kp->kb_totalfree, kp->kb_calls, 979 kp->kb_highwat, kp->kb_couldfree); 980 totfree += size * kp->kb_totalfree; 981 } 982 983 /* 984 * If kmem statistics are not being gathered by the kernel, 985 * first will still be 1. 986 */ 987 if (first) { 988 warnx("Kmem statistics are not being gathered by the kernel."); 989 return; 990 } 991 992 kread(X_KMEMSTAT, kmemstats, sizeof(kmemstats)); 993 (void)printf("\nMemory usage type by bucket size\n"); 994 (void)printf(" Size Type(s)\n"); 995 kp = &buckets[MINBUCKET]; 996 for (j = 1 << MINBUCKET; j < 1 << (MINBUCKET + 16); j <<= 1, kp++) { 997 if (kp->kb_calls == 0) 998 continue; 999 first = 1; 1000 len = 8; 1001 for (i = 0, ks = &kmemstats[0]; i < M_LAST; i++, ks++) { 1002 if (ks->ks_calls == 0) 1003 continue; 1004 if ((ks->ks_size & j) == 0) 1005 continue; 1006 if (kmemnames[i] == 0) { 1007 kmemnames[i] = malloc(10); 1008 /* strlen("undef/")+3+1);*/ 1009 snprintf(kmemnames[i], 10, "undef/%d", i); 1010 /* same 10 as above!!! */ 1011 } 1012 name = kmemnames[i]; 1013 len += 2 + strlen(name); 1014 if (first) 1015 printf("%8d %s", j, name); 1016 else 1017 printf(","); 1018 if (len >= 80) { 1019 printf("\n\t "); 1020 len = 10 + strlen(name); 1021 } 1022 if (!first) 1023 printf(" %s", name); 1024 first = 0; 1025 } 1026 putchar('\n'); 1027 } 1028 1029 (void)printf( 1030 "\nMemory statistics by type Type Kern\n"); 1031 (void)printf( 1032 " Type InUse MemUse HighUse Limit Requests Limit Limit Size(s)\n"); 1033 for (i = 0, ks = &kmemstats[0]; i < M_LAST; i++, ks++) { 1034 if (ks->ks_calls == 0) 1035 continue; 1036 (void)printf("%14s%6ld%6ldK%7ldK%6ldK%9ld%5u%6u", 1037 kmemnames[i] ? kmemnames[i] : "undefined", 1038 ks->ks_inuse, (ks->ks_memuse + 1023) / 1024, 1039 (ks->ks_maxused + 1023) / 1024, 1040 (ks->ks_limit + 1023) / 1024, ks->ks_calls, 1041 ks->ks_limblocks, ks->ks_mapblocks); 1042 first = 1; 1043 for (j = 1 << MINBUCKET; j < 1 << (MINBUCKET + 16); j <<= 1) { 1044 if ((ks->ks_size & j) == 0) 1045 continue; 1046 if (first) 1047 printf(" %d", j); 1048 else 1049 printf(",%d", j); 1050 first = 0; 1051 } 1052 printf("\n"); 1053 totuse += ks->ks_memuse; 1054 totreq += ks->ks_calls; 1055 } 1056 (void)printf("\nMemory Totals: In Use Free Requests\n"); 1057 (void)printf(" %7ldK %6ldK %8ld\n", 1058 (totuse + 1023) / 1024, (totfree + 1023) / 1024, totreq); 1059 } 1060 1061 void 1062 dopool(int verbose) 1063 { 1064 int first, ovflw; 1065 void *addr; 1066 long total = 0, inuse = 0; 1067 TAILQ_HEAD(,pool) pool_head; 1068 struct pool pool, *pp = &pool; 1069 struct pool_allocator pa; 1070 char name[32], maxp[32]; 1071 1072 kread(X_POOLHEAD, &pool_head, sizeof(pool_head)); 1073 addr = TAILQ_FIRST(&pool_head); 1074 1075 for (first = 1; addr != NULL; ) { 1076 deref_kptr(addr, pp, sizeof(*pp), "pool chain trashed"); 1077 deref_kptr(pp->pr_alloc, &pa, sizeof(pa), 1078 "pool allocatior trashed"); 1079 deref_kptr(pp->pr_wchan, name, sizeof(name), 1080 "pool wait channel trashed"); 1081 name[sizeof(name)-1] = '\0'; 1082 1083 if (first) { 1084 (void)printf("Memory resource pool statistics\n"); 1085 (void)printf( 1086 "%-11s%5s%9s%5s%9s%6s%6s%6s%6s%6s%6s%5s\n", 1087 "Name", 1088 "Size", 1089 "Requests", 1090 "Fail", 1091 "Releases", 1092 "Pgreq", 1093 "Pgrel", 1094 "Npage", 1095 "Hiwat", 1096 "Minpg", 1097 "Maxpg", 1098 "Idle"); 1099 first = 0; 1100 } 1101 if (pp->pr_maxpages == UINT_MAX) 1102 sprintf(maxp, "inf"); 1103 else 1104 sprintf(maxp, "%u", pp->pr_maxpages); 1105 /* 1106 * Print single word. `ovflow' is number of characters didn't fit 1107 * on the last word. `fmt' is a format string to print this word. 1108 * It must contain asterisk for field width. `width' is a width 1109 * occupied by this word. `fixed' is a number of constant chars in 1110 * `fmt'. `val' is a value to be printed using format string `fmt'. 1111 */ 1112 #define PRWORD(ovflw, fmt, width, fixed, val) do { \ 1113 (ovflw) += printf((fmt), \ 1114 (width) - (fixed) - (ovflw) > 0 ? \ 1115 (width) - (fixed) - (ovflw) : 0, \ 1116 (val)) - (width); \ 1117 if ((ovflw) < 0) \ 1118 (ovflw) = 0; \ 1119 } while (/* CONSTCOND */0) 1120 ovflw = 0; 1121 PRWORD(ovflw, "%-*s", 11, 0, name); 1122 PRWORD(ovflw, " %*u", 5, 1, pp->pr_size); 1123 PRWORD(ovflw, " %*lu", 9, 1, pp->pr_nget); 1124 PRWORD(ovflw, " %*lu", 5, 1, pp->pr_nfail); 1125 PRWORD(ovflw, " %*lu", 9, 1, pp->pr_nput); 1126 PRWORD(ovflw, " %*lu", 6, 1, pp->pr_npagealloc); 1127 PRWORD(ovflw, " %*lu", 6, 1, pp->pr_npagefree); 1128 PRWORD(ovflw, " %*d", 6, 1, pp->pr_npages); 1129 PRWORD(ovflw, " %*d", 6, 1, pp->pr_hiwat); 1130 PRWORD(ovflw, " %*d", 6, 1, pp->pr_minpages); 1131 PRWORD(ovflw, " %*s", 6, 1, maxp); 1132 PRWORD(ovflw, " %*lu\n", 5, 1, pp->pr_nidle); 1133 1134 if (pp->pr_roflags & PR_RECURSIVE) { 1135 /* 1136 * Don't count in-use memory, since it's part 1137 * of another pool and will be accounted for 1138 * there. 1139 */ 1140 total += pp->pr_npages * pa.pa_pagesz - 1141 (pp->pr_nget - pp->pr_nput) * pp->pr_size; 1142 } else { 1143 inuse += (pp->pr_nget - pp->pr_nput) * pp->pr_size; 1144 total += pp->pr_npages * pa.pa_pagesz; 1145 } 1146 dopoolcache(pp, verbose); 1147 addr = TAILQ_NEXT(pp, pr_poollist); 1148 } 1149 1150 inuse /= 1024; 1151 total /= 1024; 1152 printf("\nIn use %ldK, total allocated %ldK; utilization %.1f%%\n", 1153 inuse, total, (double)(100 * inuse) / total); 1154 } 1155 1156 void 1157 dopoolcache(struct pool *pp, int verbose) 1158 { 1159 struct pool_cache pool_cache, *pc = &pool_cache; 1160 struct pool_cache_group pool_cache_group, *pcg = &pool_cache_group; 1161 void *addr, *pcg_addr; 1162 int i; 1163 1164 if (verbose < 1) 1165 return; 1166 1167 for (addr = TAILQ_FIRST(&pp->pr_cachelist); addr != NULL; 1168 addr = TAILQ_NEXT(pc, pc_poollist)) { 1169 deref_kptr(addr, pc, sizeof(*pc), "pool cache trashed"); 1170 printf("\tcache %p: allocfrom %p freeto %p\n", addr, 1171 pc->pc_allocfrom, pc->pc_freeto); 1172 printf("\t hits %lu misses %lu ngroups %lu nitems %lu\n", 1173 pc->pc_hits, pc->pc_misses, pc->pc_ngroups, pc->pc_nitems); 1174 if (verbose < 2) 1175 continue; 1176 for (pcg_addr = TAILQ_FIRST(&pc->pc_grouplist); 1177 pcg_addr != NULL; pcg_addr = TAILQ_NEXT(pcg, pcg_list)) { 1178 deref_kptr(pcg_addr, pcg, sizeof(*pcg), 1179 "pool cache group trashed"); 1180 printf("\t\tgroup %p: avail %d\n", pcg_addr, 1181 pcg->pcg_avail); 1182 for (i = 0; i < PCG_NOBJECTS; i++) 1183 printf("\t\t\t%p\n", pcg->pcg_objects[i]); 1184 } 1185 } 1186 1187 } 1188 1189 enum hashtype { /* from <sys/systm.h> */ 1190 HASH_LIST, 1191 HASH_TAILQ 1192 }; 1193 1194 struct uidinfo { /* XXX: no kernel header file */ 1195 LIST_ENTRY(uidinfo) ui_hash; 1196 uid_t ui_uid; 1197 long ui_proccnt; 1198 }; 1199 1200 struct kernel_hash { 1201 const char * description; /* description */ 1202 int hashsize; /* nlist index for hash size */ 1203 int hashtbl; /* nlist index for hash table */ 1204 enum hashtype type; /* type of hash table */ 1205 size_t offset; /* offset of {LIST,TAILQ}_NEXT */ 1206 } khashes[] = 1207 { 1208 { 1209 "buffer hash", 1210 X_BUFHASH, X_BUFHASHTBL, 1211 HASH_LIST, offsetof(struct buf, b_hash) 1212 }, { 1213 "inode cache (ihash)", 1214 X_IHASH, X_IHASHTBL, 1215 HASH_LIST, offsetof(struct inode, i_hash) 1216 }, { 1217 "ipv4 address -> interface hash", 1218 X_IFADDRHASH, X_IFADDRHASHTBL, 1219 HASH_LIST, offsetof(struct in_ifaddr, ia_hash), 1220 }, { 1221 "name cache hash", 1222 X_NCHASH, X_NCHASHTBL, 1223 HASH_LIST, offsetof(struct namecache, nc_hash), 1224 }, { 1225 "name cache directory hash", 1226 X_NCVHASH, X_NCVHASHTBL, 1227 HASH_LIST, offsetof(struct namecache, nc_vhash), 1228 }, { 1229 "nfs client node cache", 1230 X_NFSNODE, X_NFSNODETBL, 1231 HASH_LIST, offsetof(struct nfsnode, n_hash) 1232 }, { 1233 "process group (pgrp) hash", 1234 X_PGRPHASH, X_PGRPHASHTBL, 1235 HASH_LIST, offsetof(struct pgrp, pg_hash), 1236 }, { 1237 "process id (pid) hash", 1238 X_PIDHASH, X_PIDHASHTBL, 1239 HASH_LIST, offsetof(struct proc, p_hash) 1240 }, { 1241 "user info (uid -> used processes) hash", 1242 X_UIHASH, X_UIHASHTBL, 1243 HASH_LIST, offsetof(struct uidinfo, ui_hash), 1244 }, { 1245 NULL, -1, -1, 0, 0, 1246 } 1247 }; 1248 1249 void 1250 dohashstat(int verbose, int todo, const char *hashname) 1251 { 1252 LIST_HEAD(, generic) *hashtbl_list; 1253 TAILQ_HEAD(, generic) *hashtbl_tailq; 1254 struct kernel_hash *curhash; 1255 void *hashaddr, *hashbuf, *nextaddr; 1256 size_t elemsize, hashbufsize, thissize; 1257 u_long hashsize; 1258 int i, used, items, chain, maxchain; 1259 1260 hashbuf = NULL; 1261 hashbufsize = 0; 1262 1263 if (todo & HASHLIST) { 1264 printf("Supported hashes:\n"); 1265 for (curhash = khashes; curhash->description; curhash++) { 1266 if (hashnl[curhash->hashsize].n_value == 0 || 1267 hashnl[curhash->hashtbl].n_value == 0) 1268 continue; 1269 printf("\t%-16s%s\n", 1270 hashnl[curhash->hashsize].n_name + 1, 1271 curhash->description); 1272 } 1273 return; 1274 } 1275 1276 if (hashname != NULL) { 1277 for (curhash = khashes; curhash->description; curhash++) { 1278 if (strcmp(hashnl[curhash->hashsize].n_name + 1, 1279 hashname) == 0 && 1280 hashnl[curhash->hashsize].n_value != 0 && 1281 hashnl[curhash->hashtbl].n_value != 0) 1282 break; 1283 } 1284 if (curhash->description == NULL) { 1285 warnx("%s: no such hash", hashname); 1286 return; 1287 } 1288 } 1289 1290 printf( 1291 "%-16s %8s %8s %8s %8s %8s %8s\n" 1292 "%-16s %8s %8s %8s %8s %8s %8s\n", 1293 "", "total", "used", "util", "num", "average", "maximum", 1294 "hash table", "buckets", "buckets", "%", "items", "chain", 1295 "chain"); 1296 1297 for (curhash = khashes; curhash->description; curhash++) { 1298 if (hashnl[curhash->hashsize].n_value == 0 || 1299 hashnl[curhash->hashtbl].n_value == 0) 1300 continue; 1301 if (hashname != NULL && 1302 strcmp(hashnl[curhash->hashsize].n_name + 1, hashname)) 1303 continue; 1304 elemsize = curhash->type == HASH_LIST ? 1305 sizeof(*hashtbl_list) : sizeof(*hashtbl_tailq); 1306 deref_kptr((void *)hashnl[curhash->hashsize].n_value, 1307 &hashsize, sizeof(hashsize), 1308 hashnl[curhash->hashsize].n_name); 1309 hashsize++; 1310 deref_kptr((void *)hashnl[curhash->hashtbl].n_value, 1311 &hashaddr, sizeof(hashaddr), 1312 hashnl[curhash->hashtbl].n_name); 1313 if (verbose) 1314 printf("%s %lu, %s %p, offset %ld, elemsize %llu\n", 1315 hashnl[curhash->hashsize].n_name + 1, hashsize, 1316 hashnl[curhash->hashtbl].n_name + 1, hashaddr, 1317 (long)curhash->offset, 1318 (unsigned long long)elemsize); 1319 thissize = hashsize * elemsize; 1320 if (thissize > hashbufsize) { 1321 hashbufsize = thissize; 1322 if ((hashbuf = realloc(hashbuf, hashbufsize)) == NULL) 1323 errx(1, "malloc hashbuf %llu", 1324 (unsigned long long)hashbufsize); 1325 } 1326 deref_kptr(hashaddr, hashbuf, thissize, 1327 hashnl[curhash->hashtbl].n_name); 1328 used = 0; 1329 items = maxchain = 0; 1330 if (curhash->type == HASH_LIST) 1331 hashtbl_list = hashbuf; 1332 else 1333 hashtbl_tailq = hashbuf; 1334 for (i = 0; i < hashsize; i++) { 1335 if (curhash->type == HASH_LIST) 1336 nextaddr = LIST_FIRST(&hashtbl_list[i]); 1337 else 1338 nextaddr = TAILQ_FIRST(&hashtbl_tailq[i]); 1339 if (nextaddr == NULL) 1340 continue; 1341 if (verbose) 1342 printf("%5d: %p\n", i, nextaddr); 1343 used++; 1344 chain = 0; 1345 do { 1346 chain++; 1347 deref_kptr((char *)nextaddr + curhash->offset, 1348 &nextaddr, sizeof(void *), 1349 "hash chain corrupted"); 1350 if (verbose > 1) 1351 printf("got nextaddr as %p\n", 1352 nextaddr); 1353 } while (nextaddr != NULL); 1354 items += chain; 1355 if (verbose && chain > 1) 1356 printf("\tchain = %d\n", chain); 1357 if (chain > maxchain) 1358 maxchain = chain; 1359 } 1360 printf("%-16s %8ld %8d %8.2f %8d %8.2f %8d\n", 1361 hashnl[curhash->hashsize].n_name + 1, 1362 hashsize, used, used * 100.0 / hashsize, 1363 items, used ? (double)items / used : 0.0, maxchain); 1364 } 1365 } 1366 1367 /* 1368 * kread reads something from the kernel, given its nlist index in namelist[]. 1369 */ 1370 void 1371 kread(int nlx, void *addr, size_t size) 1372 { 1373 const char *sym; 1374 1375 sym = namelist[nlx].n_name; 1376 if (*sym == '_') 1377 ++sym; 1378 if (namelist[nlx].n_type == 0 || namelist[nlx].n_value == 0) 1379 errx(1, "symbol %s not defined", sym); 1380 deref_kptr((void *)namelist[nlx].n_value, addr, size, sym); 1381 } 1382 1383 /* 1384 * Dereference the kernel pointer `kptr' and fill in the local copy 1385 * pointed to by `ptr'. The storage space must be pre-allocated, 1386 * and the size of the copy passed in `len'. 1387 */ 1388 void 1389 deref_kptr(const void *kptr, void *ptr, size_t len, const char *msg) 1390 { 1391 1392 if (*msg == '_') 1393 msg++; 1394 if (kvm_read(kd, (u_long)kptr, (char *)ptr, len) != len) 1395 errx(1, "kptr %lx: %s: %s", (u_long)kptr, msg, kvm_geterr(kd)); 1396 } 1397 1398 /* 1399 * Traverse the UVM history buffers, performing the requested action. 1400 * 1401 * Note, we assume that if we're not listing, we're dumping. 1402 */ 1403 void 1404 hist_traverse(int todo, const char *histname) 1405 { 1406 struct uvm_history_head histhead; 1407 struct uvm_history hist, *histkva; 1408 char *name = NULL; 1409 size_t namelen = 0; 1410 1411 if (histnl[0].n_value == 0) { 1412 warnx("UVM history is not compiled into the kernel."); 1413 return; 1414 } 1415 1416 deref_kptr((void *)histnl[X_UVM_HISTORIES].n_value, &histhead, 1417 sizeof(histhead), histnl[X_UVM_HISTORIES].n_name); 1418 1419 if (histhead.lh_first == NULL) { 1420 warnx("No active UVM history logs."); 1421 return; 1422 } 1423 1424 if (todo & HISTLIST) 1425 printf("Active UVM histories:"); 1426 1427 for (histkva = LIST_FIRST(&histhead); histkva != NULL; 1428 histkva = LIST_NEXT(&hist, list)) { 1429 deref_kptr(histkva, &hist, sizeof(hist), "histkva"); 1430 if (hist.namelen > namelen) { 1431 if (name != NULL) 1432 free(name); 1433 namelen = hist.namelen; 1434 if ((name = malloc(namelen + 1)) == NULL) 1435 err(1, "malloc history name"); 1436 } 1437 1438 deref_kptr(hist.name, name, namelen, "history name"); 1439 name[namelen] = '\0'; 1440 if (todo & HISTLIST) 1441 printf(" %s", name); 1442 else { 1443 /* 1444 * If we're dumping all histories, do it, else 1445 * check to see if this is the one we want. 1446 */ 1447 if (histname == NULL || strcmp(histname, name) == 0) { 1448 if (histname == NULL) 1449 printf("\nUVM history `%s':\n", name); 1450 hist_dodump(&hist); 1451 } 1452 } 1453 } 1454 1455 if (todo & HISTLIST) 1456 putchar('\n'); 1457 1458 if (name != NULL) 1459 free(name); 1460 } 1461 1462 /* 1463 * Actually dump the history buffer at the specified KVA. 1464 */ 1465 void 1466 hist_dodump(struct uvm_history *histp) 1467 { 1468 struct uvm_history_ent *histents, *e; 1469 size_t histsize; 1470 char *fmt = NULL, *fn = NULL; 1471 size_t fmtlen = 0, fnlen = 0; 1472 int i; 1473 1474 histsize = sizeof(struct uvm_history_ent) * histp->n; 1475 1476 if ((histents = malloc(histsize)) == NULL) 1477 err(1, "malloc history entries"); 1478 1479 memset(histents, 0, histsize); 1480 1481 deref_kptr(histp->e, histents, histsize, "history entries"); 1482 i = histp->f; 1483 do { 1484 e = &histents[i]; 1485 if (e->fmt != NULL) { 1486 if (e->fmtlen > fmtlen) { 1487 if (fmt != NULL) 1488 free(fmt); 1489 fmtlen = e->fmtlen; 1490 if ((fmt = malloc(fmtlen + 1)) == NULL) 1491 err(1, "malloc printf format"); 1492 } 1493 if (e->fnlen > fnlen) { 1494 if (fn != NULL) 1495 free(fn); 1496 fnlen = e->fnlen; 1497 if ((fn = malloc(fnlen + 1)) == NULL) 1498 err(1, "malloc function name"); 1499 } 1500 1501 deref_kptr(e->fmt, fmt, fmtlen, "printf format"); 1502 fmt[fmtlen] = '\0'; 1503 1504 deref_kptr(e->fn, fn, fnlen, "function name"); 1505 fn[fnlen] = '\0'; 1506 1507 printf("%06ld.%06ld ", (long int)e->tv.tv_sec, 1508 (long int)e->tv.tv_usec); 1509 printf("%s#%ld: ", fn, e->call); 1510 printf(fmt, e->v[0], e->v[1], e->v[2], e->v[3]); 1511 putchar('\n'); 1512 } 1513 i = (i + 1) % histp->n; 1514 } while (i != histp->f); 1515 1516 free(histents); 1517 if (fmt != NULL) 1518 free(fmt); 1519 if (fn != NULL) 1520 free(fn); 1521 } 1522 1523 void 1524 usage(void) 1525 { 1526 1527 (void)fprintf(stderr, 1528 "usage: %s [-efHilmsUv] [-h hashname] [-u histname] [-c count]\n" 1529 "\t\t[-M core] [-N system] [-w wait] [disks]\n", getprogname()); 1530 exit(1); 1531 } 1532
Indexes created Wed Oct 22 06:10:02 GMT 2025