Annotation of src/usr.bin/vmstat/vmstat.c, Revision 1.145
1.11 deraadt 1: /* $NetBSD: vmstat.c,v 1.29.4.1 1996/06/05 00:21:05 cgd Exp $ */
1.145 ! krw 2: /* $OpenBSD: vmstat.c,v 1.144 2018/04/26 15:55:14 guenther Exp $ */
1.1 deraadt 3:
4: /*
5: * Copyright (c) 1980, 1986, 1991, 1993
6: * The Regents of the University of California. All rights reserved.
7: *
8: * Redistribution and use in source and binary forms, with or without
9: * modification, are permitted provided that the following conditions
10: * are met:
11: * 1. Redistributions of source code must retain the above copyright
12: * notice, this list of conditions and the following disclaimer.
13: * 2. Redistributions in binary form must reproduce the above copyright
14: * notice, this list of conditions and the following disclaimer in the
15: * documentation and/or other materials provided with the distribution.
1.77 millert 16: * 3. Neither the name of the University nor the names of its contributors
1.1 deraadt 17: * may be used to endorse or promote products derived from this software
18: * without specific prior written permission.
19: *
20: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30: * SUCH DAMAGE.
31: */
1.48 art 32:
1.136 deraadt 33: #include <sys/param.h> /* MAXCOMLEN */
1.1 deraadt 34: #include <sys/time.h>
35: #include <sys/proc.h>
36: #include <sys/namei.h>
37: #include <sys/malloc.h>
38: #include <sys/ioctl.h>
39: #include <sys/sysctl.h>
40: #include <sys/device.h>
1.48 art 41: #include <sys/pool.h>
1.133 miod 42: #include <sys/sched.h>
1.128 mpi 43: #include <sys/vmmeter.h>
44:
1.144 guenther 45: #include <ctype.h>
1.21 millert 46: #include <err.h>
1.1 deraadt 47: #include <errno.h>
1.144 guenther 48: #include <fcntl.h>
49: #include <kvm.h>
50: #include <limits.h>
51: #include <nlist.h>
52: #include <paths.h>
1.1 deraadt 53: #include <signal.h>
54: #include <stdio.h>
55: #include <stdlib.h>
56: #include <string.h>
1.144 guenther 57: #include <time.h>
58: #include <unistd.h>
59:
1.6 tholo 60: #include "dkstats.h"
1.29 art 61:
1.1 deraadt 62: struct nlist namelist[] = {
1.70 deraadt 63: #define X_UVMEXP 0 /* sysctl */
1.29 art 64: { "_uvmexp" },
1.124 guenther 65: #define X_TIME_UPTIME 1
66: { "_time_uptime" },
1.70 deraadt 67: #define X_NCHSTATS 2 /* sysctl */
1.1 deraadt 68: { "_nchstats" },
1.70 deraadt 69: #define X_KMEMSTAT 3 /* sysctl */
70: { "_kmemstats" },
71: #define X_KMEMBUCKETS 4 /* sysctl */
72: { "_bucket" },
73: #define X_FORKSTAT 5 /* sysctl */
74: { "_forkstat" },
75: #define X_NSELCOLL 6 /* sysctl */
76: { "_nselcoll" },
77: #define X_POOLHEAD 7 /* sysctl */
78: { "_pool_head" },
1.124 guenther 79: #define X_NAPTIME 8
80: { "_naptime" },
1.1 deraadt 81: { "" },
82: };
83:
1.6 tholo 84: /* Objects defined in dkstats.c */
1.73 tdeval 85: extern struct _disk cur, last;
1.10 deraadt 86: extern char **dr_name;
87: extern int *dk_select, dk_ndrive;
1.1 deraadt 88:
1.29 art 89: struct uvmexp uvmexp, ouvmexp;
1.6 tholo 90: int ndrives;
1.1 deraadt 91:
92: int winlines = 20;
93:
94: kvm_t *kd;
95:
96: #define FORKSTAT 0x01
97: #define INTRSTAT 0x02
98: #define MEMSTAT 0x04
99: #define SUMSTAT 0x08
100: #define TIMESTAT 0x10
101: #define VMSTAT 0x20
102:
1.66 millert 103: void cpustats(void);
1.101 otto 104: time_t getuptime(void);
1.66 millert 105: void dkstats(void);
106: void dointr(void);
107: void domem(void);
108: void dopool(void);
109: void dosum(void);
110: void dovmstat(u_int, int);
111: void kread(int, void *, size_t);
112: void usage(void);
113: void dotimes(void);
114: void doforkst(void);
1.101 otto 115: void needhdr(int);
1.112 naddy 116: int pct(int64_t, int64_t);
1.66 millert 117: void printhdr(void);
1.1 deraadt 118:
1.66 millert 119: char **choosedrives(char **);
1.10 deraadt 120:
121: /* Namelist and memory file names. */
122: char *nlistf, *memf;
1.6 tholo 123:
1.50 art 124: extern char *__progname;
125:
1.65 art 126: int verbose = 0;
1.87 aaron 127: int zflag = 0;
1.65 art 128:
1.21 millert 129: int
1.72 deraadt 130: main(int argc, char *argv[])
1.1 deraadt 131: {
1.102 deraadt 132: char errbuf[_POSIX2_LINE_MAX];
1.126 chl 133: int c, todo = 0, reps = 0;
1.102 deraadt 134: const char *errstr;
135: u_int interval = 0;
1.1 deraadt 136:
1.87 aaron 137: while ((c = getopt(argc, argv, "c:fiM:mN:stw:vz")) != -1) {
1.1 deraadt 138: switch (c) {
139: case 'c':
1.137 tedu 140: reps = strtonum(optarg, 0, INT_MAX, &errstr);
141: if (errstr)
142: errx(1, "-c %s: %s", optarg, errstr);
1.1 deraadt 143: break;
144: case 'f':
145: todo |= FORKSTAT;
146: break;
147: case 'i':
148: todo |= INTRSTAT;
149: break;
150: case 'M':
151: memf = optarg;
152: break;
153: case 'm':
154: todo |= MEMSTAT;
155: break;
156: case 'N':
157: nlistf = optarg;
158: break;
159: case 's':
160: todo |= SUMSTAT;
161: break;
162: case 't':
163: todo |= TIMESTAT;
164: break;
165: case 'w':
1.102 deraadt 166: interval = (u_int)strtonum(optarg, 0, 1000, &errstr);
167: if (errstr)
1.104 pedro 168: errx(1, "-w %s: %s", optarg, errstr);
1.1 deraadt 169: break;
1.65 art 170: case 'v':
171: verbose = 1;
172: break;
1.87 aaron 173: case 'z':
174: zflag = 1;
175: break;
1.1 deraadt 176: case '?':
177: default:
178: usage();
179: }
180: }
181: argc -= optind;
182: argv += optind;
183:
184: if (todo == 0)
185: todo = VMSTAT;
186:
1.56 angelos 187: if (nlistf != NULL || memf != NULL) {
188:
189: kd = kvm_openfiles(nlistf, memf, NULL, O_RDONLY, errbuf);
190: if (kd == 0)
191: errx(1, "kvm_openfiles: %s", errbuf);
192:
193: if ((c = kvm_nlist(kd, namelist)) != 0) {
194:
195: if (c > 0) {
196: (void)fprintf(stderr,
197: "%s: undefined symbols:", __progname);
198: for (c = 0;
199: c < sizeof(namelist)/sizeof(namelist[0]);
200: c++)
201: if (namelist[c].n_type == 0)
202: fprintf(stderr, " %s",
203: namelist[c].n_name);
204: (void)fputc('\n', stderr);
205: exit(1);
206: } else
207: errx(1, "kvm_nlist: %s", kvm_geterr(kd));
208: }
1.115 lum 209: }
1.1 deraadt 210:
211: if (todo & VMSTAT) {
212: struct winsize winsize;
213:
1.6 tholo 214: dkinit(0); /* Initialize disk stats, no disks selected. */
215: argv = choosedrives(argv); /* Select disks. */
1.1 deraadt 216: winsize.ws_row = 0;
1.102 deraadt 217: (void) ioctl(STDOUT_FILENO, TIOCGWINSZ, &winsize);
1.1 deraadt 218: if (winsize.ws_row > 0)
219: winlines = winsize.ws_row;
220:
221: }
1.25 deraadt 222:
1.1 deraadt 223: #define BACKWARD_COMPATIBILITY
224: #ifdef BACKWARD_COMPATIBILITY
225: if (*argv) {
1.102 deraadt 226: interval = (u_int)strtonum(*argv, 0, 1000, &errstr);
227: if (errstr)
1.137 tedu 228: errx(1, "interval %s: %s", *argv, errstr);
1.103 deraadt 229:
1.137 tedu 230: if (*++argv) {
231: reps = strtonum(*argv, 0, INT_MAX, &errstr);
232: if (errstr)
233: errx(1, "reps %s: %s", *argv, errstr);
234: }
1.1 deraadt 235: }
236: #endif
237:
238: if (interval) {
239: if (!reps)
240: reps = -1;
241: } else if (reps)
242: interval = 1;
243:
244: if (todo & FORKSTAT)
245: doforkst();
1.48 art 246: if (todo & MEMSTAT) {
1.1 deraadt 247: domem();
1.48 art 248: dopool();
249: }
1.1 deraadt 250: if (todo & SUMSTAT)
251: dosum();
252: if (todo & TIMESTAT)
253: dotimes();
254: if (todo & INTRSTAT)
255: dointr();
256: if (todo & VMSTAT)
257: dovmstat(interval, reps);
258: exit(0);
259: }
260:
261: char **
1.72 deraadt 262: choosedrives(char **argv)
1.1 deraadt 263: {
1.62 mpech 264: int i;
1.1 deraadt 265:
266: /*
267: * Choose drives to be displayed. Priority goes to (in order) drives
268: * supplied as arguments, default drives. If everything isn't filled
269: * in and there are drives not taken care of, display the first few
270: * that fit.
271: */
272: #define BACKWARD_COMPATIBILITY
273: for (ndrives = 0; *argv; ++argv) {
274: #ifdef BACKWARD_COMPATIBILITY
1.127 deraadt 275: if (isdigit((unsigned char)**argv))
1.1 deraadt 276: break;
277: #endif
278: for (i = 0; i < dk_ndrive; i++) {
279: if (strcmp(dr_name[i], *argv))
280: continue;
1.6 tholo 281: dk_select[i] = 1;
1.1 deraadt 282: ++ndrives;
283: break;
284: }
1.137 tedu 285: if (i == dk_ndrive)
286: errx(1, "invalid interval or drive name: %s", *argv);
1.1 deraadt 287: }
1.64 deraadt 288: for (i = 0; i < dk_ndrive && ndrives < 2; i++) {
1.6 tholo 289: if (dk_select[i])
1.1 deraadt 290: continue;
1.6 tholo 291: dk_select[i] = 1;
1.1 deraadt 292: ++ndrives;
293: }
294: return(argv);
295: }
296:
1.19 deraadt 297: time_t
1.72 deraadt 298: getuptime(void)
1.1 deraadt 299: {
1.124 guenther 300: struct timespec uptime;
301: time_t time_uptime, naptime;
1.1 deraadt 302:
1.124 guenther 303: if (nlistf == NULL && memf == NULL) {
304: if (clock_gettime(CLOCK_UPTIME, &uptime) == -1)
305: err(1, "clock_gettime");
306: return (uptime.tv_sec);
1.50 art 307: }
308:
1.124 guenther 309: kread(X_NAPTIME, &naptime, sizeof(naptime));
310: kread(X_TIME_UPTIME, &time_uptime, sizeof(time_uptime));
311: return (time_uptime - naptime);
1.1 deraadt 312: }
313:
1.105 cloder 314: int hz;
315: volatile sig_atomic_t hdrcnt;
1.1 deraadt 316:
317: void
1.72 deraadt 318: dovmstat(u_int interval, int reps)
1.1 deraadt 319: {
320: time_t uptime, halfuptime;
1.50 art 321: struct clockinfo clkinfo;
1.102 deraadt 322: struct vmtotal total;
1.1 deraadt 323: size_t size;
1.102 deraadt 324: int mib[2];
1.1 deraadt 325:
326: uptime = getuptime();
327: halfuptime = uptime / 2;
328: (void)signal(SIGCONT, needhdr);
329:
1.50 art 330: mib[0] = CTL_KERN;
331: mib[1] = KERN_CLOCKRATE;
332: size = sizeof(clkinfo);
333: if (sysctl(mib, 2, &clkinfo, &size, NULL, 0) < 0) {
1.56 angelos 334: warn("could not read kern.clockrate");
1.50 art 335: return;
336: }
337: hz = clkinfo.stathz;
1.1 deraadt 338:
339: for (hdrcnt = 1;;) {
1.6 tholo 340: /* Read new disk statistics */
341: dkreadstats();
1.73 tdeval 342: if (!--hdrcnt || last.dk_ndrive != cur.dk_ndrive)
343: printhdr();
1.56 angelos 344: if (nlistf == NULL && memf == NULL) {
345: size = sizeof(struct uvmexp);
1.52 angelos 346: mib[0] = CTL_VM;
347: mib[1] = VM_UVMEXP;
348: if (sysctl(mib, 2, &uvmexp, &size, NULL, 0) < 0) {
1.56 angelos 349: warn("could not get vm.uvmexp");
1.139 mmcc 350: memset(&uvmexp, 0, sizeof(struct uvmexp));
1.52 angelos 351: }
1.56 angelos 352: } else {
353: kread(X_UVMEXP, &uvmexp, sizeof(struct uvmexp));
1.52 angelos 354: }
1.1 deraadt 355: size = sizeof(total);
356: mib[0] = CTL_VM;
357: mib[1] = VM_METER;
358: if (sysctl(mib, 2, &total, &size, NULL, 0) < 0) {
1.56 angelos 359: warn("could not read vm.vmmeter");
1.139 mmcc 360: memset(&total, 0, sizeof(total));
1.1 deraadt 361: }
1.142 mpi 362: (void)printf("%2u %3u", total.t_rq - 1, total.t_sl);
1.123 guenther 363: #define rate(x) ((unsigned)((((unsigned)x) + halfuptime) / uptime)) /* round */
1.102 deraadt 364: #define pgtok(a) ((a) * ((unsigned int)uvmexp.pagesize >> 10))
1.142 mpi 365: (void)printf("%5uM %6uM ",
366: pgtok(uvmexp.active + uvmexp.swpginuse) / 1024,
367: pgtok(uvmexp.free) / 1024);
1.106 sobrado 368: (void)printf("%4u ", rate(uvmexp.faults - ouvmexp.faults));
1.29 art 369: (void)printf("%3u ", rate(uvmexp.pdreact - ouvmexp.pdreact));
370: (void)printf("%3u ", rate(uvmexp.pageins - ouvmexp.pageins));
371: (void)printf("%3u %3u ",
372: rate(uvmexp.pdpageouts - ouvmexp.pdpageouts), 0);
373: (void)printf("%3u ", rate(uvmexp.pdscans - ouvmexp.pdscans));
374: dkstats();
1.64 deraadt 375: (void)printf("%4u %5u %4u ",
1.29 art 376: rate(uvmexp.intrs - ouvmexp.intrs),
377: rate(uvmexp.syscalls - ouvmexp.syscalls),
378: rate(uvmexp.swtch - ouvmexp.swtch));
1.1 deraadt 379: cpustats();
380: (void)printf("\n");
381: (void)fflush(stdout);
382: if (reps >= 0 && --reps <= 0)
383: break;
1.29 art 384: ouvmexp = uvmexp;
1.1 deraadt 385: uptime = interval;
386: /*
387: * We round upward to avoid losing low-frequency events
388: * (i.e., >= 1 per interval but < 1 per second).
389: */
1.14 deraadt 390: halfuptime = uptime == 1 ? 0 : (uptime + 1) / 2;
1.1 deraadt 391: (void)sleep(interval);
392: }
393: }
394:
1.21 millert 395: void
1.72 deraadt 396: printhdr(void)
1.1 deraadt 397: {
1.62 mpech 398: int i;
1.114 tedu 399: static int printedhdr;
400:
401: if (printedhdr && !isatty(STDOUT_FILENO))
402: return;
1.1 deraadt 403:
1.108 sobrado 404: (void)printf(" procs memory page%*s", 20, "");
1.6 tholo 405: if (ndrives > 0)
1.106 sobrado 406: (void)printf("%s %*straps cpu\n",
1.6 tholo 407: ((ndrives > 1) ? "disks" : "disk"),
1.106 sobrado 408: ((ndrives > 1) ? ndrives * 4 - 5 : 0), "");
1.1 deraadt 409: else
1.106 sobrado 410: (void)printf("%*s traps cpu\n",
1.6 tholo 411: ndrives * 3, "");
412:
1.142 mpi 413: (void)printf(" r s avm fre flt re pi po fr sr ");
1.1 deraadt 414: for (i = 0; i < dk_ndrive; i++)
1.6 tholo 415: if (dk_select[i])
1.67 ho 416: (void)printf("%c%c%c ", dr_name[i][0],
1.64 deraadt 417: dr_name[i][1],
1.1 deraadt 418: dr_name[i][strlen(dr_name[i]) - 1]);
1.79 tedu 419: (void)printf(" int sys cs us sy id\n");
1.1 deraadt 420: hdrcnt = winlines - 2;
1.114 tedu 421: printedhdr = 1;
1.1 deraadt 422: }
423:
424: /*
425: * Force a header to be prepended to the next output.
426: */
427: void
1.141 guenther 428: needhdr(__unused int signo)
1.1 deraadt 429: {
430:
431: hdrcnt = 1;
432: }
433:
434: void
1.72 deraadt 435: dotimes(void)
1.1 deraadt 436: {
437: u_int pgintime, rectime;
1.102 deraadt 438: size_t size;
1.52 angelos 439: int mib[2];
1.1 deraadt 440:
1.56 angelos 441: /* XXX Why are these set to 0 ? This doesn't look right. */
1.12 tholo 442: pgintime = 0;
443: rectime = 0;
1.56 angelos 444:
445: if (nlistf == NULL && memf == NULL) {
446: size = sizeof(struct uvmexp);
1.52 angelos 447: mib[0] = CTL_VM;
448: mib[1] = VM_UVMEXP;
449: if (sysctl(mib, 2, &uvmexp, &size, NULL, 0) < 0) {
1.56 angelos 450: warn("could not read vm.uvmexp");
1.139 mmcc 451: memset(&uvmexp, 0, sizeof(struct uvmexp));
1.52 angelos 452: }
1.56 angelos 453: } else {
454: kread(X_UVMEXP, &uvmexp, sizeof(struct uvmexp));
1.52 angelos 455: }
456:
1.29 art 457: (void)printf("%u reactivates, %u total time (usec)\n",
458: uvmexp.pdreact, rectime);
1.89 miod 459: if (uvmexp.pdreact != 0)
460: (void)printf("average: %u usec / reclaim\n",
461: rectime / uvmexp.pdreact);
1.29 art 462: (void)printf("\n");
463: (void)printf("%u page ins, %u total time (msec)\n",
464: uvmexp.pageins, pgintime / 10);
1.89 miod 465: if (uvmexp.pageins != 0)
466: (void)printf("average: %8.1f msec / page in\n",
1.103 deraadt 467: pgintime / (uvmexp.pageins * 10.0));
1.1 deraadt 468: }
469:
1.21 millert 470: int
1.112 naddy 471: pct(int64_t top, int64_t bot)
1.1 deraadt 472: {
1.102 deraadt 473: int ans;
1.1 deraadt 474:
475: if (bot == 0)
476: return(0);
1.112 naddy 477: ans = top * 100 / bot;
1.1 deraadt 478: return (ans);
479: }
480:
481: void
1.72 deraadt 482: dosum(void)
1.1 deraadt 483: {
484: struct nchstats nchstats;
1.102 deraadt 485: int mib[2], nselcoll;
1.112 naddy 486: long long nchtotal;
1.52 angelos 487: size_t size;
1.1 deraadt 488:
1.56 angelos 489: if (nlistf == NULL && memf == NULL) {
490: size = sizeof(struct uvmexp);
1.52 angelos 491: mib[0] = CTL_VM;
492: mib[1] = VM_UVMEXP;
493: if (sysctl(mib, 2, &uvmexp, &size, NULL, 0) < 0) {
1.56 angelos 494: warn("could not read vm.uvmexp");
1.139 mmcc 495: memset(&uvmexp, 0, sizeof(struct uvmexp));
1.52 angelos 496: }
1.56 angelos 497: } else {
498: kread(X_UVMEXP, &uvmexp, sizeof(struct uvmexp));
1.52 angelos 499: }
500:
1.32 art 501: /* vm_page constants */
1.35 hugh 502: (void)printf("%11u bytes per page\n", uvmexp.pagesize);
1.32 art 503:
504: /* vm_page counters */
1.35 hugh 505: (void)printf("%11u pages managed\n", uvmexp.npages);
506: (void)printf("%11u pages free\n", uvmexp.free);
507: (void)printf("%11u pages active\n", uvmexp.active);
508: (void)printf("%11u pages inactive\n", uvmexp.inactive);
509: (void)printf("%11u pages being paged out\n", uvmexp.paging);
510: (void)printf("%11u pages wired\n", uvmexp.wired);
1.71 art 511: (void)printf("%11u pages zeroed\n", uvmexp.zeropages);
1.35 hugh 512: (void)printf("%11u pages reserved for pagedaemon\n",
1.48 art 513: uvmexp.reserve_pagedaemon);
1.35 hugh 514: (void)printf("%11u pages reserved for kernel\n",
1.48 art 515: uvmexp.reserve_kernel);
1.32 art 516:
517: /* swap */
1.35 hugh 518: (void)printf("%11u swap pages\n", uvmexp.swpages);
519: (void)printf("%11u swap pages in use\n", uvmexp.swpginuse);
1.32 art 520:
521: /* stat counters */
1.35 hugh 522: (void)printf("%11u page faults\n", uvmexp.faults);
523: (void)printf("%11u traps\n", uvmexp.traps);
524: (void)printf("%11u interrupts\n", uvmexp.intrs);
525: (void)printf("%11u cpu context switches\n", uvmexp.swtch);
1.95 mickey 526: (void)printf("%11u fpu context switches\n", uvmexp.fpswtch);
1.35 hugh 527: (void)printf("%11u software interrupts\n", uvmexp.softs);
528: (void)printf("%11u syscalls\n", uvmexp.syscalls);
529: (void)printf("%11u pagein operations\n", uvmexp.pageins);
530: (void)printf("%11u forks\n", uvmexp.forks);
531: (void)printf("%11u forks where vmspace is shared\n",
1.48 art 532: uvmexp.forks_sharevm);
1.97 pedro 533: (void)printf("%11u kernel map entries\n", uvmexp.kmapent);
1.132 kettenis 534: (void)printf("%11u zeroed page hits\n", uvmexp.pga_zerohit);
535: (void)printf("%11u zeroed page misses\n", uvmexp.pga_zeromiss);
1.32 art 536:
537: /* daemon counters */
1.64 deraadt 538: (void)printf("%11u number of times the pagedaemon woke up\n",
1.48 art 539: uvmexp.pdwoke);
1.35 hugh 540: (void)printf("%11u revolutions of the clock hand\n", uvmexp.pdrevs);
541: (void)printf("%11u pages freed by pagedaemon\n", uvmexp.pdfreed);
542: (void)printf("%11u pages scanned by pagedaemon\n", uvmexp.pdscans);
543: (void)printf("%11u pages reactivated by pagedaemon\n", uvmexp.pdreact);
544: (void)printf("%11u busy pages found by pagedaemon\n", uvmexp.pdbusy);
1.29 art 545:
1.56 angelos 546: if (nlistf == NULL && memf == NULL) {
1.52 angelos 547: size = sizeof(nchstats);
548: mib[0] = CTL_KERN;
549: mib[1] = KERN_NCHSTATS;
550: if (sysctl(mib, 2, &nchstats, &size, NULL, 0) < 0) {
1.56 angelos 551: warn("could not read kern.nchstats");
1.139 mmcc 552: memset(&nchstats, 0, sizeof(nchstats));
1.52 angelos 553: }
1.56 angelos 554: } else {
555: kread(X_NCHSTATS, &nchstats, sizeof(nchstats));
1.52 angelos 556: }
557:
1.1 deraadt 558: nchtotal = nchstats.ncs_goodhits + nchstats.ncs_neghits +
559: nchstats.ncs_badhits + nchstats.ncs_falsehits +
560: nchstats.ncs_miss + nchstats.ncs_long;
1.112 naddy 561: (void)printf("%11lld total name lookups\n", nchtotal);
1.52 angelos 562: (void)printf("%11s cache hits (%d%% pos + %d%% neg) system %d%% "
563: "per-directory\n",
1.112 naddy 564: "", pct(nchstats.ncs_goodhits, nchtotal),
565: pct(nchstats.ncs_neghits, nchtotal),
566: pct(nchstats.ncs_pass2, nchtotal));
1.35 hugh 567: (void)printf("%11s deletions %d%%, falsehits %d%%, toolong %d%%\n", "",
1.112 naddy 568: pct(nchstats.ncs_badhits, nchtotal),
569: pct(nchstats.ncs_falsehits, nchtotal),
570: pct(nchstats.ncs_long, nchtotal));
1.52 angelos 571:
1.56 angelos 572: if (nlistf == NULL && memf == NULL) {
1.52 angelos 573: size = sizeof(nselcoll);
574: mib[0] = CTL_KERN;
575: mib[1] = KERN_NSELCOLL;
576: if (sysctl(mib, 2, &nselcoll, &size, NULL, 0) < 0) {
1.56 angelos 577: warn("could not read kern.nselcoll");
1.52 angelos 578: nselcoll = 0;
579: }
1.56 angelos 580: } else {
581: kread(X_NSELCOLL, &nselcoll, sizeof(nselcoll));
1.52 angelos 582: }
1.50 art 583: (void)printf("%11d select collisions\n", nselcoll);
1.1 deraadt 584: }
585:
586: void
1.72 deraadt 587: doforkst(void)
1.1 deraadt 588: {
589: struct forkstat fks;
1.52 angelos 590: size_t size;
591: int mib[2];
592:
1.56 angelos 593: if (nlistf == NULL && memf == NULL) {
1.52 angelos 594: size = sizeof(struct forkstat);
595: mib[0] = CTL_KERN;
596: mib[1] = KERN_FORKSTAT;
597: if (sysctl(mib, 2, &fks, &size, NULL, 0) < 0) {
1.56 angelos 598: warn("could not read kern.forkstat");
1.139 mmcc 599: memset(&fks, 0, sizeof(struct forkstat));
1.52 angelos 600: }
1.56 angelos 601: } else {
602: kread(X_FORKSTAT, &fks, sizeof(struct forkstat));
1.52 angelos 603: }
1.1 deraadt 604:
1.140 tedu 605: (void)printf("%u forks, %llu pages, average %.2f\n",
1.1 deraadt 606: fks.cntfork, fks.sizfork, (double)fks.sizfork / fks.cntfork);
1.140 tedu 607: (void)printf("%u vforks, %llu pages, average %.2f\n",
1.72 deraadt 608: fks.cntvfork, fks.sizvfork,
609: (double)fks.sizvfork / (fks.cntvfork ? fks.cntvfork : 1));
1.140 tedu 610: (void)printf("%u __tforks, %llu pages, average %.2f\n",
1.119 deraadt 611: fks.cnttfork, fks.siztfork,
612: (double)fks.siztfork / (fks.cnttfork ? fks.cnttfork : 1));
1.140 tedu 613: (void)printf("%u kthread creations, %llu pages, average %.2f\n",
1.72 deraadt 614: fks.cntkthread, fks.sizkthread,
615: (double)fks.sizkthread / (fks.cntkthread ? fks.cntkthread : 1));
1.1 deraadt 616: }
617:
618: void
1.72 deraadt 619: dkstats(void)
1.1 deraadt 620: {
1.62 mpech 621: int dn, state;
1.1 deraadt 622: double etime;
623:
1.6 tholo 624: /* Calculate disk stat deltas. */
625: dkswap();
1.1 deraadt 626: etime = 0;
627: for (state = 0; state < CPUSTATES; ++state) {
1.6 tholo 628: etime += cur.cp_time[state];
1.1 deraadt 629: }
630: if (etime == 0)
631: etime = 1;
632: etime /= hz;
633: for (dn = 0; dn < dk_ndrive; ++dn) {
1.6 tholo 634: if (!dk_select[dn])
1.1 deraadt 635: continue;
1.82 tedu 636: (void)printf("%3.0f ",
637: (cur.dk_rxfer[dn] + cur.dk_rxfer[dn]) / etime);
1.1 deraadt 638: }
639: }
640:
641: void
1.72 deraadt 642: cpustats(void)
1.1 deraadt 643: {
1.102 deraadt 644: double percent, total;
1.62 mpech 645: int state;
1.1 deraadt 646:
647: total = 0;
648: for (state = 0; state < CPUSTATES; ++state)
1.6 tholo 649: total += cur.cp_time[state];
1.1 deraadt 650: if (total)
1.101 otto 651: percent = 100 / total;
1.1 deraadt 652: else
1.101 otto 653: percent = 0;
654: (void)printf("%2.0f ", (cur.cp_time[CP_USER] + cur.cp_time[CP_NICE]) * percent);
655: (void)printf("%2.0f ", (cur.cp_time[CP_SYS] + cur.cp_time[CP_INTR]) * percent);
656: (void)printf("%2.0f", cur.cp_time[CP_IDLE] * percent);
1.1 deraadt 657: }
658:
659: void
1.72 deraadt 660: dointr(void)
1.74 art 661: {
1.102 deraadt 662: int nintr, mib[4], i;
663: char intrname[128];
664: u_int64_t inttotal;
1.74 art 665: time_t uptime;
666: size_t siz;
667:
1.93 miod 668: if (nlistf != NULL || memf != NULL) {
669: errx(1,
670: "interrupt statistics are only available on live kernels");
671: }
672:
1.74 art 673: uptime = getuptime();
674:
675: mib[0] = CTL_KERN;
676: mib[1] = KERN_INTRCNT;
677: mib[2] = KERN_INTRCNT_NUM;
678: siz = sizeof(nintr);
679: if (sysctl(mib, 3, &nintr, &siz, NULL, 0) < 0) {
680: warnx("could not read kern.intrcnt.nintrcnt");
681: return;
682: }
683:
1.91 deraadt 684: (void)printf("%-16s %20s %8s\n", "interrupt", "total", "rate");
1.87 aaron 685:
1.74 art 686: inttotal = 0;
687: for (i = 0; i < nintr; i++) {
1.87 aaron 688: char name[128];
1.141 guenther 689: uint64_t cnt;
1.87 aaron 690: int vector;
1.74 art 691:
692: mib[0] = CTL_KERN;
693: mib[1] = KERN_INTRCNT;
694: mib[2] = KERN_INTRCNT_NAME;
695: mib[3] = i;
1.87 aaron 696: siz = sizeof(name);
697: if (sysctl(mib, 4, name, &siz, NULL, 0) < 0) {
1.74 art 698: warnx("could not read kern.intrcnt.name.%d", i);
1.87 aaron 699: return;
700: }
701:
702: mib[0] = CTL_KERN;
703: mib[1] = KERN_INTRCNT;
704: mib[2] = KERN_INTRCNT_VECTOR;
705: mib[3] = i;
706: siz = sizeof(vector);
707: if (sysctl(mib, 4, &vector, &siz, NULL, 0) < 0) {
708: strlcpy(intrname, name, sizeof(intrname));
709: } else {
710: snprintf(intrname, sizeof(intrname), "irq%d/%s",
711: vector, name);
1.74 art 712: }
713:
714: mib[0] = CTL_KERN;
715: mib[1] = KERN_INTRCNT;
716: mib[2] = KERN_INTRCNT_CNT;
717: mib[3] = i;
718: siz = sizeof(cnt);
719: if (sysctl(mib, 4, &cnt, &siz, NULL, 0) < 0) {
1.75 grange 720: warnx("could not read kern.intrcnt.cnt.%d", i);
1.90 deraadt 721: return;
1.74 art 722: }
1.90 deraadt 723:
1.87 aaron 724: if (cnt || zflag)
1.91 deraadt 725: (void)printf("%-16.16s %20llu %8llu\n", intrname,
1.90 deraadt 726: cnt, cnt / uptime);
1.74 art 727: inttotal += cnt;
728: }
729:
1.91 deraadt 730: (void)printf("%-16s %20llu %8llu\n", "Total", inttotal,
1.90 deraadt 731: inttotal / uptime);
1.1 deraadt 732: }
733:
734: /*
735: * These names are defined in <sys/malloc.h>.
736: */
1.101 otto 737: const char *kmemnames[] = INITKMEMNAMES;
1.1 deraadt 738:
739: void
1.72 deraadt 740: domem(void)
1.1 deraadt 741: {
1.102 deraadt 742: struct kmembuckets buckets[MINBUCKET + 16], *kp;
743: struct kmemstats kmemstats[M_LAST], *ks;
744: int i, j, len, size, first, mib[4];
1.50 art 745: u_long totuse = 0, totfree = 0;
1.102 deraadt 746: char buf[BUFSIZ], *bufp, *ap;
1.141 guenther 747: unsigned long long totreq = 0;
1.101 otto 748: const char *name;
1.50 art 749: size_t siz;
750:
751: if (memf == NULL && nlistf == NULL) {
1.53 deraadt 752: mib[0] = CTL_KERN;
1.50 art 753: mib[1] = KERN_MALLOCSTATS;
754: mib[2] = KERN_MALLOC_BUCKETS;
755: siz = sizeof(buf);
756: if (sysctl(mib, 3, buf, &siz, NULL, 0) < 0) {
1.56 angelos 757: warnx("could not read kern.malloc.buckets");
1.50 art 758: return;
759: }
760:
761: bufp = buf;
762: mib[2] = KERN_MALLOC_BUCKET;
763: siz = sizeof(struct kmembuckets);
764: i = 0;
765: while ((ap = strsep(&bufp, ",")) != NULL) {
1.138 deraadt 766: const char *errstr;
767:
768: mib[3] = strtonum(ap, 0, INT_MAX, &errstr);
769: if (errstr) {
770: warnx("kernel lied about %d being a number", mib[3]);
771: return;
772: }
1.50 art 773:
774: if (sysctl(mib, 4, &buckets[MINBUCKET + i], &siz,
1.53 deraadt 775: NULL, 0) < 0) {
1.56 angelos 776: warn("could not read kern.malloc.bucket.%d", mib[3]);
1.50 art 777: return;
778: }
779: i++;
780: }
781: } else {
1.53 deraadt 782: kread(X_KMEMBUCKETS, buckets, sizeof(buckets));
1.50 art 783: }
1.1 deraadt 784:
1.18 kstailey 785: for (first = 1, i = MINBUCKET, kp = &buckets[i]; i < MINBUCKET + 16;
786: i++, kp++) {
1.65 art 787: if (kp->kb_calls == 0 && !verbose)
1.1 deraadt 788: continue;
1.18 kstailey 789: if (first) {
790: (void)printf("Memory statistics by bucket size\n");
791: (void)printf(
1.50 art 792: " Size In Use Free Requests HighWater Couldfree\n");
1.18 kstailey 793: first = 0;
794: }
1.1 deraadt 795: size = 1 << i;
1.60 art 796: (void)printf("%8d %8llu %6llu %18llu %7llu %10llu\n", size,
797: (unsigned long long)(kp->kb_total - kp->kb_totalfree),
798: (unsigned long long)kp->kb_totalfree,
799: (unsigned long long)kp->kb_calls,
800: (unsigned long long)kp->kb_highwat,
801: (unsigned long long)kp->kb_couldfree);
1.1 deraadt 802: totfree += size * kp->kb_totalfree;
1.18 kstailey 803: }
804:
805: /*
806: * If kmem statistics are not being gathered by the kernel,
807: * first will still be 1.
808: */
809: if (first) {
810: printf(
811: "Kmem statistics are not being gathered by the kernel.\n");
812: return;
1.1 deraadt 813: }
814:
1.52 angelos 815: if (memf == NULL && nlistf == NULL) {
1.139 mmcc 816: memset(kmemstats, 0, sizeof(kmemstats));
1.52 angelos 817: for (i = 0; i < M_LAST; i++) {
1.53 deraadt 818: mib[0] = CTL_KERN;
1.52 angelos 819: mib[1] = KERN_MALLOCSTATS;
820: mib[2] = KERN_MALLOC_KMEMSTATS;
821: mib[3] = i;
822: siz = sizeof(struct kmemstats);
823:
1.103 deraadt 824: /*
1.52 angelos 825: * Skip errors -- these are presumed to be unallocated
826: * entries.
827: */
828: if (sysctl(mib, 4, &kmemstats[i], &siz, NULL, 0) < 0)
829: continue;
830: }
831: } else {
832: kread(X_KMEMSTAT, kmemstats, sizeof(kmemstats));
833: }
834:
1.1 deraadt 835: (void)printf("\nMemory usage type by bucket size\n");
836: (void)printf(" Size Type(s)\n");
837: kp = &buckets[MINBUCKET];
838: for (j = 1 << MINBUCKET; j < 1 << (MINBUCKET + 16); j <<= 1, kp++) {
839: if (kp->kb_calls == 0)
840: continue;
841: first = 1;
842: len = 8;
843: for (i = 0, ks = &kmemstats[0]; i < M_LAST; i++, ks++) {
844: if (ks->ks_calls == 0)
845: continue;
846: if ((ks->ks_size & j) == 0)
847: continue;
848: name = kmemnames[i] ? kmemnames[i] : "undefined";
849: len += 2 + strlen(name);
850: if (first)
851: printf("%8d %s", j, name);
852: else
853: printf(",");
854: if (len >= 80) {
855: printf("\n\t ");
856: len = 10 + strlen(name);
857: }
858: if (!first)
859: printf(" %s", name);
860: first = 0;
861: }
862: printf("\n");
863: }
864:
865: (void)printf(
1.26 deraadt 866: "\nMemory statistics by type Type Kern\n");
1.1 deraadt 867: (void)printf(
1.26 deraadt 868: " Type InUse MemUse HighUse Limit Requests Limit Limit Size(s)\n");
1.1 deraadt 869: for (i = 0, ks = &kmemstats[0]; i < M_LAST; i++, ks++) {
870: if (ks->ks_calls == 0)
871: continue;
1.24 mickey 872: (void)printf("%14s%6ld%6ldK%7ldK%6ldK%9ld%5u%6u",
1.1 deraadt 873: kmemnames[i] ? kmemnames[i] : "undefined",
874: ks->ks_inuse, (ks->ks_memuse + 1023) / 1024,
875: (ks->ks_maxused + 1023) / 1024,
876: (ks->ks_limit + 1023) / 1024, ks->ks_calls,
877: ks->ks_limblocks, ks->ks_mapblocks);
878: first = 1;
879: for (j = 1 << MINBUCKET; j < 1 << (MINBUCKET + 16); j <<= 1) {
880: if ((ks->ks_size & j) == 0)
881: continue;
882: if (first)
883: printf(" %d", j);
884: else
885: printf(",%d", j);
886: first = 0;
887: }
888: printf("\n");
889: totuse += ks->ks_memuse;
890: totreq += ks->ks_calls;
891: }
892: (void)printf("\nMemory Totals: In Use Free Requests\n");
1.141 guenther 893: (void)printf(" %7luK %6luK %8llu\n",
1.1 deraadt 894: (totuse + 1023) / 1024, (totfree + 1023) / 1024, totreq);
895: }
896:
1.54 art 897: static void
1.129 dlg 898: print_pool(struct kinfo_pool *pp, char *name)
1.54 art 899: {
900: static int first = 1;
1.102 deraadt 901: char maxp[32];
1.54 art 902: int ovflw;
903:
904: if (first) {
905: (void)printf("Memory resource pool statistics\n");
906: (void)printf(
907: "%-11s%5s%9s%5s%9s%6s%6s%6s%6s%6s%6s%5s\n",
908: "Name",
909: "Size",
910: "Requests",
911: "Fail",
1.110 otto 912: "InUse",
1.54 art 913: "Pgreq",
914: "Pgrel",
915: "Npage",
916: "Hiwat",
917: "Minpg",
918: "Maxpg",
919: "Idle");
920: first = 0;
921: }
1.65 art 922:
923: /* Skip unused pools unless verbose output. */
924: if (pp->pr_nget == 0 && !verbose)
925: return;
926:
1.54 art 927: if (pp->pr_maxpages == UINT_MAX)
1.69 deraadt 928: snprintf(maxp, sizeof maxp, "inf");
1.54 art 929: else
1.69 deraadt 930: snprintf(maxp, sizeof maxp, "%u", pp->pr_maxpages);
1.54 art 931: /*
932: * Print single word. `ovflow' is number of characters didn't fit
933: * on the last word. `fmt' is a format string to print this word.
934: * It must contain asterisk for field width. `width' is a width
935: * occupied by this word. `fixed' is a number of constant chars in
936: * `fmt'. `val' is a value to be printed using format string `fmt'.
937: */
938: #define PRWORD(ovflw, fmt, width, fixed, val) do { \
939: (ovflw) += printf((fmt), \
940: (width) - (fixed) - (ovflw) > 0 ? \
941: (width) - (fixed) - (ovflw) : 0, \
942: (val)) - (width); \
943: if ((ovflw) < 0) \
944: (ovflw) = 0; \
945: } while (/* CONSTCOND */0)
946:
947: ovflw = 0;
948: PRWORD(ovflw, "%-*s", 11, 0, name);
949: PRWORD(ovflw, " %*u", 5, 1, pp->pr_size);
950: PRWORD(ovflw, " %*lu", 9, 1, pp->pr_nget);
951: PRWORD(ovflw, " %*lu", 5, 1, pp->pr_nfail);
1.110 otto 952: PRWORD(ovflw, " %*lu", 9, 1, pp->pr_nget - pp->pr_nput);
1.54 art 953: PRWORD(ovflw, " %*lu", 6, 1, pp->pr_npagealloc);
954: PRWORD(ovflw, " %*lu", 6, 1, pp->pr_npagefree);
955: PRWORD(ovflw, " %*d", 6, 1, pp->pr_npages);
956: PRWORD(ovflw, " %*d", 6, 1, pp->pr_hiwat);
957: PRWORD(ovflw, " %*d", 6, 1, pp->pr_minpages);
958: PRWORD(ovflw, " %*s", 6, 1, maxp);
1.103 deraadt 959: PRWORD(ovflw, " %*lu\n", 5, 1, pp->pr_nidle);
1.54 art 960: }
961:
1.55 art 962: static void dopool_kvm(void);
963: static void dopool_sysctl(void);
964:
1.48 art 965: void
966: dopool(void)
967: {
1.55 art 968: if (nlistf == NULL && memf == NULL)
969: dopool_sysctl();
970: else
971: dopool_kvm();
972: }
973:
974: void
975: dopool_sysctl(void)
976: {
1.117 chl 977: int mib[4], npools, i;
1.63 art 978: long total = 0, inuse = 0;
1.129 dlg 979: struct kinfo_pool pool;
1.55 art 980: size_t size;
981:
982: mib[0] = CTL_KERN;
983: mib[1] = KERN_POOL;
984: mib[2] = KERN_POOL_NPOOLS;
985: size = sizeof(npools);
986: if (sysctl(mib, 3, &npools, &size, NULL, 0) < 0) {
1.92 pedro 987: warn("can't figure out number of pools in kernel");
1.55 art 988: return;
989: }
990:
991: for (i = 1; npools; i++) {
992: char name[32];
993:
994: mib[0] = CTL_KERN;
995: mib[1] = KERN_POOL;
996: mib[2] = KERN_POOL_POOL;
997: mib[3] = i;
1.129 dlg 998: size = sizeof(pool);
1.55 art 999: if (sysctl(mib, 4, &pool, &size, NULL, 0) < 0) {
1000: if (errno == ENOENT)
1001: continue;
1.92 pedro 1002: warn("error getting pool");
1.55 art 1003: return;
1004: }
1005: npools--;
1006: mib[2] = KERN_POOL_NAME;
1007: size = sizeof(name);
1008: if (sysctl(mib, 4, &name, &size, NULL, 0) < 0) {
1.92 pedro 1009: warn("error getting pool name");
1.55 art 1010: return;
1011: }
1012: print_pool(&pool, name);
1.63 art 1013:
1014: inuse += (pool.pr_nget - pool.pr_nput) * pool.pr_size;
1.129 dlg 1015: total += pool.pr_npages * pool.pr_pgsize;
1.55 art 1016: }
1.63 art 1017:
1018: inuse /= 1024;
1019: total /= 1024;
1020: printf("\nIn use %ldK, total allocated %ldK; utilization %.1f%%\n",
1021: inuse, total, (double)(100 * inuse) / total);
1.55 art 1022: }
1023:
1024: void
1025: dopool_kvm(void)
1026: {
1.120 tedu 1027: SIMPLEQ_HEAD(,pool) pool_head;
1.48 art 1028: struct pool pool, *pp = &pool;
1.129 dlg 1029: struct kinfo_pool pi;
1.102 deraadt 1030: long total = 0, inuse = 0;
1031: u_long addr;
1.48 art 1032:
1033: kread(X_POOLHEAD, &pool_head, sizeof(pool_head));
1.120 tedu 1034: addr = (u_long)SIMPLEQ_FIRST(&pool_head);
1.48 art 1035:
1.55 art 1036: while (addr != 0) {
1.54 art 1037: char name[32];
1.56 angelos 1038:
1.48 art 1039: if (kvm_read(kd, addr, (void *)pp, sizeof *pp) != sizeof *pp) {
1040: (void)fprintf(stderr,
1041: "vmstat: pool chain trashed: %s\n",
1042: kvm_geterr(kd));
1043: exit(1);
1044: }
1.102 deraadt 1045: if (kvm_read(kd, (u_long)pp->pr_wchan, name, sizeof name) < 0) {
1.48 art 1046: (void)fprintf(stderr,
1047: "vmstat: pool name trashed: %s\n",
1048: kvm_geterr(kd));
1049: exit(1);
1050: }
1051: name[31] = '\0';
1052:
1.129 dlg 1053: memset(&pi, 0, sizeof(pi));
1054: pi.pr_size = pp->pr_size;
1.135 tedu 1055: pi.pr_pgsize = pp->pr_pgsize;
1.129 dlg 1056: pi.pr_itemsperpage = pp->pr_itemsperpage;
1.130 dlg 1057: pi.pr_npages = pp->pr_npages;
1.129 dlg 1058: pi.pr_minpages = pp->pr_minpages;
1059: pi.pr_maxpages = pp->pr_maxpages;
1060: pi.pr_hardlimit = pp->pr_hardlimit;
1061: pi.pr_nout = pp->pr_nout;
1062: pi.pr_nitems = pp->pr_nitems;
1063: pi.pr_nget = pp->pr_nget;
1064: pi.pr_nput = pp->pr_nput;
1065: pi.pr_nfail = pp->pr_nfail;
1066: pi.pr_npagealloc = pp->pr_npagealloc;
1067: pi.pr_npagefree = pp->pr_npagefree;
1068: pi.pr_hiwat = pp->pr_hiwat;
1069: pi.pr_nidle = pp->pr_nidle;
1070:
1071: print_pool(&pi, name);
1.48 art 1072:
1.129 dlg 1073: inuse += (pi.pr_nget - pi.pr_nput) * pi.pr_size;
1074: total += pi.pr_npages * pi.pr_pgsize;
1.56 angelos 1075:
1.120 tedu 1076: addr = (u_long)SIMPLEQ_NEXT(pp, pr_poollist);
1.48 art 1077: }
1078:
1079: inuse /= 1024;
1080: total /= 1024;
1081: printf("\nIn use %ldK, total allocated %ldK; utilization %.1f%%\n",
1082: inuse, total, (double)(100 * inuse) / total);
1083: }
1084:
1.1 deraadt 1085: /*
1086: * kread reads something from the kernel, given its nlist index.
1087: */
1088: void
1.72 deraadt 1089: kread(int nlx, void *addr, size_t size)
1.1 deraadt 1090: {
1091: char *sym;
1092:
1093: if (namelist[nlx].n_type == 0 || namelist[nlx].n_value == 0) {
1094: sym = namelist[nlx].n_name;
1095: if (*sym == '_')
1096: ++sym;
1.50 art 1097: errx(1, "symbol %s not defined", sym);
1.1 deraadt 1098: }
1099: if (kvm_read(kd, namelist[nlx].n_value, addr, size) != size) {
1100: sym = namelist[nlx].n_name;
1101: if (*sym == '_')
1102: ++sym;
1.50 art 1103: errx(1, "%s: %s", sym, kvm_geterr(kd));
1.1 deraadt 1104: }
1105: }
1106:
1107: void
1.72 deraadt 1108: usage(void)
1.1 deraadt 1109: {
1.88 jmc 1110: (void)fprintf(stderr, "usage: %s [-fimstvz] [-c count] [-M core] "
1.109 sobrado 1111: "[-N system] [-w wait] [disk ...]\n", __progname);
1.1 deraadt 1112: exit(1);
1113: }