xref: /original-bsd/usr.bin/vmstat/vmstat.c (revision fa921481)
1 /*
2  * Copyright (c) 1980 The Regents of the University of California.
3  * All rights reserved.
4  *
5  * %sccs.include.redist.c%
6  */
7 
8 #ifndef lint
9 char copyright[] =
10 "@(#) Copyright (c) 1980 The Regents of the University of California.\n\
11  All rights reserved.\n";
12 #endif /* not lint */
13 
14 #ifndef lint
15 static char sccsid[] = "@(#)vmstat.c	5.21 (Berkeley) 06/06/90";
16 #endif /* not lint */
17 
18 #include <sys/param.h>
19 #include <sys/file.h>
20 #include <sys/vm.h>
21 #include <sys/dkstat.h>
22 #include <sys/buf.h>
23 #include <sys/namei.h>
24 #include <sys/text.h>
25 #include <sys/malloc.h>
26 #include <stdio.h>
27 #include <ctype.h>
28 #include <nlist.h>
29 #include <paths.h>
30 
31 struct nlist nl[] = {
32 #define	X_CPTIME	0
33 	{ "_cp_time" },
34 #define	X_RATE		1
35 	{ "_rate" },
36 #define X_TOTAL		2
37 	{ "_total" },
38 #define	X_DEFICIT	3
39 	{ "_deficit" },
40 #define	X_FORKSTAT	4
41 	{ "_forkstat" },
42 #define X_SUM		5
43 	{ "_sum" },
44 #define	X_FIRSTFREE	6
45 	{ "_firstfree" },
46 #define	X_MAXFREE	7
47 	{ "_maxfree" },
48 #define	X_BOOTTIME	8
49 	{ "_boottime" },
50 #define	X_DKXFER	9
51 	{ "_dk_xfer" },
52 #define X_REC		10
53 	{ "_rectime" },
54 #define X_PGIN		11
55 	{ "_pgintime" },
56 #define X_HZ		12
57 	{ "_hz" },
58 #define X_PHZ		13
59 	{ "_phz" },
60 #define X_NCHSTATS	14
61 	{ "_nchstats" },
62 #define	X_INTRNAMES	15
63 	{ "_intrnames" },
64 #define	X_EINTRNAMES	16
65 	{ "_eintrnames" },
66 #define	X_INTRCNT	17
67 	{ "_intrcnt" },
68 #define	X_EINTRCNT	18
69 	{ "_eintrcnt" },
70 #define	X_DK_NDRIVE	19
71 	{ "_dk_ndrive" },
72 #define	X_XSTATS	20
73 	{ "_xstats" },
74 #define	X_KMEMSTAT	21
75 	{ "_kmemstats" },
76 #define	X_KMEMBUCKETS	22
77 	{ "_bucket" },
78 #define X_END		22
79 #ifdef vax
80 #define X_MBDINIT	(X_END+1)
81 	{ "_mbdinit" },
82 #define X_UBDINIT	(X_END+2)
83 	{ "_ubdinit" },
84 #endif
85 #ifdef tahoe
86 #define	X_VBDINIT	(X_END+1)
87 	{ "_vbdinit" },
88 #define	X_CKEYSTATS	(X_END+2)
89 	{ "_ckeystats" },
90 #define	X_DKEYSTATS	(X_END+3)
91 	{ "_dkeystats" },
92 #endif
93 #ifdef hp300
94 #define	X_HPDINIT	(X_END+1)
95 	{ "_hp_dinit" },
96 #endif
97 	{ "" },
98 };
99 
100 char	**dr_name;
101 int	*dr_select;
102 int	dk_ndrive;
103 int	ndrives = 0;
104 #ifdef vax
105 char	*defdrives[] = { "hp0", "hp1", "hp2",  0 };
106 #else
107 #ifdef hp300
108 char	*defdrives[] = { "rd0", "rd1", "rd2",  0 };
109 #else
110 char	*defdrives[] = { 0 };
111 #endif
112 #endif
113 double	stat1();
114 int	firstfree, maxfree;
115 int	hz;
116 int	phz;
117 int	HZ;
118 
119 struct {
120 	int	busy;
121 	long	time[CPUSTATES];
122 	long	*xfer;
123 	struct	vmmeter Rate;
124 	struct	vmtotal	Total;
125 	struct	vmmeter Sum;
126 	struct	forkstat Forkstat;
127 	unsigned rectime;
128 	unsigned pgintime;
129 } s, s1, z;
130 #define	rate		s.Rate
131 #define	total		s.Total
132 #define	sum		s.Sum
133 #define	forkstat	s.Forkstat
134 
135 struct	vmmeter osum;
136 int	deficit;
137 double	etime;
138 int 	mf;
139 time_t	now, boottime;
140 int	printhdr();
141 int	lines = 1;
142 
143 #define	INTS(x)	((x) - (hz + phz))
144 
145 main(argc, argv)
146 	int argc;
147 	char **argv;
148 {
149 	extern char *ctime();
150 	register i;
151 	int iter, nintv, iflag = 0;
152 	long t;
153 	char *arg, **cp, buf[BUFSIZ];
154 
155 	nlist(_PATH_UNIX, nl);
156 	if(nl[0].n_type == 0) {
157 		fprintf(stderr, "vmstat: no %s namelist\n", _PATH_UNIX);
158 		exit(1);
159 	}
160 	mf = open(_PATH_KMEM, 0);
161 	if(mf < 0) {
162 		fprintf(stderr, "vmstat: cannot open %s\n", _PATH_KMEM);
163 		exit(1);
164 	}
165 	iter = 0;
166 	argc--, argv++;
167 	while (argc>0 && argv[0][0]=='-') {
168 		char *cp = *argv++;
169 		argc--;
170 		while (*++cp) switch (*cp) {
171 
172 		case 't':
173 			dotimes();
174 			exit(0);
175 
176 		case 'z':
177 			close(mf);
178 			mf = open(_PATH_KMEM, 2);
179 			lseek(mf, (long)nl[X_SUM].n_value, L_SET);
180 			write(mf, &z.Sum, sizeof z.Sum);
181 			exit(0);
182 
183 		case 'f':
184 			doforkst();
185 			exit(0);
186 
187 		case 'm':
188 			domem();
189 			exit(0);
190 
191 		case 's':
192 			dosum();
193 			exit(0);
194 
195 		case 'i':
196 			iflag++;
197 			break;
198 
199 		default:
200 			fprintf(stderr,
201 			    "usage: vmstat [ -fsim ] [ interval ] [ count]\n");
202 			exit(1);
203 		}
204 	}
205 	lseek(mf, (long)nl[X_FIRSTFREE].n_value, L_SET);
206 	read(mf, &firstfree, sizeof firstfree);
207 	lseek(mf, (long)nl[X_MAXFREE].n_value, L_SET);
208 	read(mf, &maxfree, sizeof maxfree);
209 	lseek(mf, (long)nl[X_BOOTTIME].n_value, L_SET);
210 	read(mf, &boottime, sizeof boottime);
211 	lseek(mf, (long)nl[X_HZ].n_value, L_SET);
212 	read(mf, &hz, sizeof hz);
213 	if (nl[X_PHZ].n_value != 0) {
214 		lseek(mf, (long)nl[X_PHZ].n_value, L_SET);
215 		read(mf, &phz, sizeof phz);
216 	}
217 	HZ = phz ? phz : hz;
218 	if (nl[X_DK_NDRIVE].n_value == 0) {
219 		fprintf(stderr, "dk_ndrive undefined in system\n");
220 		exit(1);
221 	}
222 	lseek(mf, nl[X_DK_NDRIVE].n_value, L_SET);
223 	read(mf, &dk_ndrive, sizeof (dk_ndrive));
224 	if (dk_ndrive <= 0) {
225 		fprintf(stderr, "dk_ndrive %d\n", dk_ndrive);
226 		exit(1);
227 	}
228 	dr_select = (int *)calloc(dk_ndrive, sizeof (int));
229 	dr_name = (char **)calloc(dk_ndrive, sizeof (char *));
230 #define	allocate(e, t) \
231     s./**/e = (t *)calloc(dk_ndrive, sizeof (t)); \
232     s1./**/e = (t *)calloc(dk_ndrive, sizeof (t));
233 	allocate(xfer, long);
234 	for (arg = buf, i = 0; i < dk_ndrive; i++) {
235 		dr_name[i] = arg;
236 		sprintf(dr_name[i], "dk%d", i);
237 		arg += strlen(dr_name[i]) + 1;
238 	}
239 	read_names();
240 	time(&now);
241 	nintv = now - boottime;
242 	if (nintv <= 0 || nintv > 60*60*24*365*10) {
243 		fprintf(stderr,
244 		    "Time makes no sense... namelist must be wrong.\n");
245 		exit(1);
246 	}
247 	if (iflag) {
248 		dointr(nintv);
249 		exit(0);
250 	}
251 	/*
252 	 * Choose drives to be displayed.  Priority
253 	 * goes to (in order) drives supplied as arguments,
254 	 * default drives.  If everything isn't filled
255 	 * in and there are drives not taken care of,
256 	 * display the first few that fit.
257 	 */
258 	ndrives = 0;
259 	while (argc > 0 && !isdigit(argv[0][0])) {
260 		for (i = 0; i < dk_ndrive; i++) {
261 			if (strcmp(dr_name[i], argv[0]))
262 				continue;
263 			dr_select[i] = 1;
264 			ndrives++;
265 		}
266 		argc--, argv++;
267 	}
268 	for (i = 0; i < dk_ndrive && ndrives < 4; i++) {
269 		if (dr_select[i])
270 			continue;
271 		for (cp = defdrives; *cp; cp++)
272 			if (strcmp(dr_name[i], *cp) == 0) {
273 				dr_select[i] = 1;
274 				ndrives++;
275 				break;
276 			}
277 	}
278 	for (i = 0; i < dk_ndrive && ndrives < 4; i++) {
279 		if (dr_select[i])
280 			continue;
281 		dr_select[i] = 1;
282 		ndrives++;
283 	}
284 	if (argc > 1)
285 		iter = atoi(argv[1]);
286 	signal(SIGCONT, printhdr);
287 loop:
288 	if (--lines == 0)
289 		printhdr();
290 	lseek(mf, (long)nl[X_CPTIME].n_value, L_SET);
291  	read(mf, s.time, sizeof s.time);
292 	lseek(mf, (long)nl[X_DKXFER].n_value, L_SET);
293 	read(mf, s.xfer, dk_ndrive * sizeof (long));
294 	if (nintv != 1)
295 		lseek(mf, (long)nl[X_SUM].n_value, L_SET);
296 	else
297 		lseek(mf, (long)nl[X_RATE].n_value, L_SET);
298 	read(mf, &rate, sizeof rate);
299 	lseek(mf, (long)nl[X_TOTAL].n_value, L_SET);
300 	read(mf, &total, sizeof total);
301 	osum = sum;
302 	lseek(mf, (long)nl[X_SUM].n_value, L_SET);
303 	read(mf, &sum, sizeof sum);
304 	lseek(mf, (long)nl[X_DEFICIT].n_value, L_SET);
305 	read(mf, &deficit, sizeof deficit);
306 	etime = 0;
307 	for (i=0; i < dk_ndrive; i++) {
308 		t = s.xfer[i];
309 		s.xfer[i] -= s1.xfer[i];
310 		s1.xfer[i] = t;
311 	}
312 	for (i=0; i < CPUSTATES; i++) {
313 		t = s.time[i];
314 		s.time[i] -= s1.time[i];
315 		s1.time[i] = t;
316 		etime += s.time[i];
317 	}
318 	if(etime == 0.)
319 		etime = 1.;
320 	printf("%2d%2d%2d", total.t_rq, total.t_dw+total.t_pw, total.t_sw);
321 #define pgtok(a) ((a)*NBPG/1024)
322 	printf("%6d%6d", pgtok(total.t_avm), pgtok(total.t_free));
323 	printf("%4d%3d", (rate.v_pgrec - (rate.v_xsfrec+rate.v_xifrec))/nintv,
324 	    (rate.v_xsfrec+rate.v_xifrec)/nintv);
325 	printf("%4d", pgtok(rate.v_pgpgin)/nintv);
326 	printf("%4d%4d%4d%4d", pgtok(rate.v_pgpgout)/nintv,
327 	    pgtok(rate.v_dfree)/nintv, pgtok(deficit), rate.v_scan/nintv);
328 	etime /= (float)HZ;
329 	for (i = 0; i < dk_ndrive; i++)
330 		if (dr_select[i])
331 			stats(i);
332 	printf("%4d%4d%4d", INTS(rate.v_intr/nintv), rate.v_syscall/nintv,
333 	    rate.v_swtch/nintv);
334 	for(i=0; i<CPUSTATES; i++) {
335 		float f = stat1(i);
336 		if (i == 0) {		/* US+NI */
337 			i++;
338 			f += stat1(i);
339 		}
340 		printf("%3.0f", f);
341 	}
342 	printf("\n");
343 	fflush(stdout);
344 	nintv = 1;
345 	if (--iter &&argc > 0) {
346 		sleep(atoi(argv[0]));
347 		goto loop;
348 	}
349 }
350 
351 printhdr()
352 {
353 	register int i, j;
354 
355 	printf(" procs     memory              page           ");
356 	i = (ndrives * 3 - 6) / 2;
357 	if (i < 0)
358 		i = 0;
359 	for (j = 0; j < i; j++)
360 		putchar(' ');
361 	printf("faults");
362 	i = ndrives * 3 - 6 - i;
363 	for (j = 0; j < i; j++)
364 		putchar(' ');
365 	printf("               cpu\n");
366 	printf(" r b w   avm   fre  re at  pi  po  fr  de  sr ");
367 	for (i = 0; i < dk_ndrive; i++)
368 		if (dr_select[i])
369 			printf("%c%c ", dr_name[i][0], dr_name[i][2]);
370 	printf(" in  sy  cs us sy id\n");
371 	lines = 19;
372 }
373 
374 dotimes()
375 {
376 
377 	lseek(mf, (long)nl[X_REC].n_value, L_SET);
378 	read(mf, &s.rectime, sizeof s.rectime);
379 	lseek(mf, (long)nl[X_PGIN].n_value, L_SET);
380 	read(mf, &s.pgintime, sizeof s.pgintime);
381 	lseek(mf, (long)nl[X_SUM].n_value, L_SET);
382 	read(mf, &sum, sizeof sum);
383 	printf("%d reclaims, %d total time (usec)\n", sum.v_pgrec, s.rectime);
384 	printf("average: %d usec / reclaim\n", s.rectime/sum.v_pgrec);
385 	printf("\n");
386 	printf("%d page ins, %d total time (msec)\n",sum.v_pgin, s.pgintime/10);
387 	printf("average: %8.1f msec / page in\n", s.pgintime/(sum.v_pgin*10.0));
388 }
389 
390 #if defined(tahoe)
391 #include <tahoe/cpu.h>
392 #endif
393 
394 dosum()
395 {
396 	struct nchstats nchstats;
397 	struct xstats xstats;
398 	long nchtotal;
399 #if defined(tahoe)
400 	struct keystats keystats;
401 #endif
402 
403 	lseek(mf, (long)nl[X_SUM].n_value, L_SET);
404 	read(mf, &sum, sizeof sum);
405 	printf("%9d swap ins\n", sum.v_swpin);
406 	printf("%9d swap outs\n", sum.v_swpout);
407 	printf("%9d pages swapped in\n", sum.v_pswpin / CLSIZE);
408 	printf("%9d pages swapped out\n", sum.v_pswpout / CLSIZE);
409 	printf("%9d total address trans. faults taken\n", sum.v_faults);
410 	printf("%9d page ins\n", sum.v_pgin);
411 	printf("%9d page outs\n", sum.v_pgout);
412 	printf("%9d pages paged in\n", sum.v_pgpgin);
413 	printf("%9d pages paged out\n", sum.v_pgpgout);
414 	printf("%9d sequential process pages freed\n", sum.v_seqfree);
415 	printf("%9d total reclaims (%d%% fast)\n", sum.v_pgrec,
416 	    pct(sum.v_fastpgrec, sum.v_pgrec));
417 	printf("%9d reclaims from free list\n", sum.v_pgfrec);
418 	printf("%9d intransit blocking page faults\n", sum.v_intrans);
419 	printf("%9d zero fill pages created\n", sum.v_nzfod / CLSIZE);
420 	printf("%9d zero fill page faults\n", sum.v_zfod / CLSIZE);
421 	printf("%9d executable fill pages created\n", sum.v_nexfod / CLSIZE);
422 	printf("%9d executable fill page faults\n", sum.v_exfod / CLSIZE);
423 	printf("%9d swap text pages found in free list\n", sum.v_xsfrec);
424 	printf("%9d inode text pages found in free list\n", sum.v_xifrec);
425 	printf("%9d file fill pages created\n", sum.v_nvrfod / CLSIZE);
426 	printf("%9d file fill page faults\n", sum.v_vrfod / CLSIZE);
427 	printf("%9d pages examined by the clock daemon\n", sum.v_scan);
428 	printf("%9d revolutions of the clock hand\n", sum.v_rev);
429 	printf("%9d pages freed by the clock daemon\n", sum.v_dfree / CLSIZE);
430 	printf("%9d cpu context switches\n", sum.v_swtch);
431 	printf("%9d device interrupts\n", sum.v_intr);
432 	printf("%9d software interrupts\n", sum.v_soft);
433 #ifdef vax
434 	printf("%9d pseudo-dma dz interrupts\n", sum.v_pdma);
435 #endif
436 	printf("%9d traps\n", sum.v_trap);
437 	printf("%9d system calls\n", sum.v_syscall);
438 	lseek(mf, (long)nl[X_NCHSTATS].n_value, 0);
439 	read(mf, &nchstats, sizeof nchstats);
440 	nchtotal = nchstats.ncs_goodhits + nchstats.ncs_neghits +
441 	    nchstats.ncs_badhits + nchstats.ncs_falsehits +
442 	    nchstats.ncs_miss + nchstats.ncs_long;
443 	printf("%9d total name lookups\n", nchtotal);
444 	printf("%9s cache hits (%d%% pos + %d%% neg) system %d%% per-process\n",
445 	    "", pct(nchstats.ncs_goodhits, nchtotal),
446 	    pct(nchstats.ncs_neghits, nchtotal),
447 	    pct(nchstats.ncs_pass2, nchtotal));
448 	printf("%9s deletions %d%%, falsehits %d%%, toolong %d%%\n", "",
449 	    pct(nchstats.ncs_badhits, nchtotal),
450 	    pct(nchstats.ncs_falsehits, nchtotal),
451 	    pct(nchstats.ncs_long, nchtotal));
452 	lseek(mf, (long)nl[X_XSTATS].n_value, 0);
453 	read(mf, &xstats, sizeof xstats);
454 	printf("%9d total calls to xalloc (cache hits %d%%)\n",
455 	    xstats.alloc, pct(xstats.alloc_cachehit, xstats.alloc));
456 	printf("%9s sticky %d flushed %d unused %d\n", "",
457 	    xstats.alloc_inuse, xstats.alloc_cacheflush, xstats.alloc_unused);
458 	printf("%9d total calls to xfree", xstats.free);
459 	printf(" (sticky %d cached %d swapped %d)\n",
460 	    xstats.free_inuse, xstats.free_cache, xstats.free_cacheswap);
461 #if defined(tahoe)
462 	lseek(mf, (long)nl[X_CKEYSTATS].n_value, 0);
463 	read(mf, &keystats, sizeof keystats);
464 	printf("%9d %s (free %d%% norefs %d%% taken %d%% shared %d%%)\n",
465 	    keystats.ks_allocs, "code cache keys allocated",
466 	    pct(keystats.ks_allocfree, keystats.ks_allocs),
467 	    pct(keystats.ks_norefs, keystats.ks_allocs),
468 	    pct(keystats.ks_taken, keystats.ks_allocs),
469 	    pct(keystats.ks_shared, keystats.ks_allocs));
470 	lseek(mf, (long)nl[X_DKEYSTATS].n_value, 0);
471 	read(mf, &keystats, sizeof keystats);
472 	printf("%9d %s (free %d%% norefs %d%% taken %d%% shared %d%%)\n",
473 	    keystats.ks_allocs, "data cache keys allocated",
474 	    pct(keystats.ks_allocfree, keystats.ks_allocs),
475 	    pct(keystats.ks_norefs, keystats.ks_allocs),
476 	    pct(keystats.ks_taken, keystats.ks_allocs),
477 	    pct(keystats.ks_shared, keystats.ks_allocs));
478 #endif
479 }
480 
481 doforkst()
482 {
483 
484 	lseek(mf, (long)nl[X_FORKSTAT].n_value, L_SET);
485 	read(mf, &forkstat, sizeof forkstat);
486 	printf("%d forks, %d pages, average=%.2f\n",
487 		forkstat.cntfork, forkstat.sizfork,
488 		(float) forkstat.sizfork / forkstat.cntfork);
489 	printf("%d vforks, %d pages, average=%.2f\n",
490 		forkstat.cntvfork, forkstat.sizvfork,
491 		(float)forkstat.sizvfork / forkstat.cntvfork);
492 }
493 
494 stats(dn)
495 {
496 
497 	if (dn >= dk_ndrive) {
498 		printf("  0");
499 		return;
500 	}
501 	printf("%3.0f", s.xfer[dn]/etime);
502 }
503 
504 double
505 stat1(row)
506 {
507 	double t;
508 	register i;
509 
510 	t = 0;
511 	for(i=0; i<CPUSTATES; i++)
512 		t += s.time[i];
513 	if(t == 0.)
514 		t = 1.;
515 	return(s.time[row]*100./t);
516 }
517 
518 pct(top, bot)
519 {
520 
521 	if (bot == 0)
522 		return (0);
523 	return ((top * 100) / bot);
524 }
525 
526 dointr(nintv)
527 {
528 	int nintr, inttotal;
529 	long *intrcnt;
530 	char *intrname, *malloc();
531 
532 	nintr = (nl[X_EINTRCNT].n_value - nl[X_INTRCNT].n_value) / sizeof(long);
533 	intrcnt = (long *) malloc(nl[X_EINTRCNT].n_value -
534 		nl[X_INTRCNT].n_value);
535 	intrname = malloc(nl[X_EINTRNAMES].n_value - nl[X_INTRNAMES].n_value);
536 	if (intrcnt == NULL || intrname == NULL) {
537 		fprintf(stderr, "vmstat: out of memory\n");
538 		exit(9);
539 	}
540 	lseek(mf, (long)nl[X_INTRCNT].n_value, L_SET);
541 	read(mf, intrcnt, nintr * sizeof (long));
542 	lseek(mf, (long)nl[X_INTRNAMES].n_value, L_SET);
543 	read(mf, intrname, nl[X_EINTRNAMES].n_value - nl[X_INTRNAMES].n_value);
544 	printf("interrupt      total      rate\n");
545 	inttotal = 0;
546 	while (nintr--) {
547 		if (*intrcnt)
548 			printf("%-12s %8ld %8ld\n", intrname,
549 			    *intrcnt, *intrcnt / nintv);
550 		intrname += strlen(intrname) + 1;
551 		inttotal += *intrcnt++;
552 	}
553 	printf("Total        %8ld %8ld\n", inttotal, inttotal / nintv);
554 }
555 
556 /*
557  * These names must be kept in sync with
558  * the types defined in <sys/malloc.h>.
559  */
560 char *kmemnames[] = {
561 	"free",		/* 0 M_FREE */
562 	"mbuf",		/* 1 M_MBUF */
563 	"devbuf",	/* 2 M_DEVBUF */
564 	"socket",	/* 3 M_SOCKET */
565 	"pcb",		/* 4 M_PCB */
566 	"routetbl",	/* 5 M_RTABLE */
567 	"hosttbl",	/* 6 M_HTABLE */
568 	"fragtbl",	/* 7 M_FTABLE */
569 	"zombie",	/* 8 M_ZOMBIE */
570 	"ifaddr",	/* 9 M_IFADDR */
571 	"soopts",	/* 10 M_SOOPTS */
572 	"soname",	/* 11 M_SONAME */
573 	"namei",	/* 12 M_NAMEI */
574 	"gprof",	/* 13 M_GPROF */
575 	"ioctlops",	/* 14 M_IOCTLOPS */
576 	"superblk",	/* 15 M_SUPERBLK */
577 	"cred",		/* 16 M_CRED */
578 	"pgrp",		/* 17 M_PGRP */
579 	"session",	/* 18 M_SESSION */
580 	"iov",		/* 19 M_IOV */
581 	"mount",	/* 20 M_MOUNT */
582 	"fhandle",	/* 21 M_FHANDLE */
583 	"NFS req",	/* 22 M_NFSREQ */
584 	"NFS mount",	/* 23 M_NFSMNT */
585 	"vnodes",	/* 24 M_VNODE */
586 	"namecache",	/* 25 M_CACHE */
587 	"UFS quota",	/* 26 M_DQUOT */
588 	"UFS mount",	/* 27 M_UFSMNT */
589 	"mapmem",	/* 28 M_MAPMEM */
590 	"shm",		/* 29 M_SHM */
591 	0, 0, 0, 0,
592 	0, 0, 0, 0, 0,
593 	0, 0, 0, 0, 0,
594 	0, 0, 0, 0, 0,
595 	"temp",		/* 49 M_TEMP */
596 };
597 
598 domem()
599 {
600 	struct kmemstats kmemstats[M_LAST];
601 	struct kmembuckets buckets[MINBUCKET + 16];
602 	register struct kmembuckets *kp;
603 	register struct kmemstats *ks;
604 	int i;
605 
606 	lseek(mf, (long)nl[X_KMEMBUCKETS].n_value, L_SET);
607 	read(mf, buckets, sizeof buckets);
608 	printf("Memory statistics by bucket size\n");
609 	printf("    Size   In Use   Free   Requests  HighWater  Couldfree\n");
610 	for (i = MINBUCKET, kp = &buckets[i]; i < MINBUCKET + 16; i++, kp++) {
611 		if (kp->kb_calls == 0)
612 			continue;
613 		printf("%8d%9d%7d%11d%8d%11d\n", 1 << i,
614 			kp->kb_total - kp->kb_totalfree,
615 			kp->kb_totalfree, kp->kb_calls,
616 			kp->kb_highwat, kp->kb_couldfree);
617 
618 	}
619 	lseek(mf, (long)nl[X_KMEMSTAT].n_value, L_SET);
620 	read(mf, kmemstats, sizeof kmemstats);
621 	printf("Memory statistics by type\n");
622 	printf("     Type   In Use  MemUse   HighUse  Limit  Requests %s\n",
623 		"TypeLimit KernLimit");
624 	for (i = 0, ks = &kmemstats[0]; i < M_LAST; i++, ks++) {
625 		if (ks->ks_calls == 0)
626 			continue;
627 		printf("%10s%7d%8dK%9dK%6dK%9d%7d%10d\n",
628 			kmemnames[i] ? kmemnames[i] : "undefined",
629 			ks->ks_inuse, (ks->ks_memuse + 1023) / 1024,
630 			(ks->ks_maxused + 1023) / 1024,
631 			(ks->ks_limit + 1023) / 1024, ks->ks_calls,
632 			ks->ks_limblocks, ks->ks_mapblocks);
633 	}
634 }
635 
636 #define steal(where, var) \
637 	lseek(mf, where, L_SET); read(mf, &var, sizeof var);
638 /*
639  * Read the drive names out of kmem.
640  */
641 #ifdef vax
642 #include <vaxuba/ubavar.h>
643 #include <vaxmba/mbavar.h>
644 
645 read_names()
646 {
647 	struct mba_device mdev;
648 	register struct mba_device *mp;
649 	struct mba_driver mdrv;
650 	short two_char;
651 	char *cp = (char *) &two_char;
652 	struct uba_device udev, *up;
653 	struct uba_driver udrv;
654 
655 	mp = (struct mba_device *) nl[X_MBDINIT].n_value;
656 	up = (struct uba_device *) nl[X_UBDINIT].n_value;
657 	if (up == 0) {
658 		fprintf(stderr, "vmstat: Disk init info not in namelist\n");
659 		exit(1);
660 	}
661 	if (mp) for (;;) {
662 		steal(mp++, mdev);
663 		if (mdev.mi_driver == 0)
664 			break;
665 		if (mdev.mi_dk < 0 || mdev.mi_alive == 0)
666 			continue;
667 		steal(mdev.mi_driver, mdrv);
668 		steal(mdrv.md_dname, two_char);
669 		sprintf(dr_name[mdev.mi_dk], "%c%c%d",
670 		    cp[0], cp[1], mdev.mi_unit);
671 	}
672 	for (;;) {
673 		steal(up++, udev);
674 		if (udev.ui_driver == 0)
675 			break;
676 		if (udev.ui_dk < 0 || udev.ui_alive == 0)
677 			continue;
678 		steal(udev.ui_driver, udrv);
679 		steal(udrv.ud_dname, two_char);
680 		sprintf(dr_name[udev.ui_dk], "%c%c%d",
681 		    cp[0], cp[1], udev.ui_unit);
682 	}
683 }
684 #endif
685 
686 #ifdef tahoe
687 #include <tahoevba/vbavar.h>
688 
689 /*
690  * Read the drive names out of kmem.
691  */
692 read_names()
693 {
694 	struct vba_device udev, *up;
695 	struct vba_driver udrv;
696 	short two_char;
697 	char *cp = (char *)&two_char;
698 
699 	up = (struct vba_device *) nl[X_VBDINIT].n_value;
700 	if (up == 0) {
701 		fprintf(stderr, "vmstat: Disk init info not in namelist\n");
702 		exit(1);
703 	}
704 	for (;;) {
705 		steal(up++, udev);
706 		if (udev.ui_driver == 0)
707 			break;
708 		if (udev.ui_dk < 0 || udev.ui_alive == 0)
709 			continue;
710 		steal(udev.ui_driver, udrv);
711 		steal(udrv.ud_dname, two_char);
712 		sprintf(dr_name[udev.ui_dk], "%c%c%d",
713 		     cp[0], cp[1], udev.ui_unit);
714 	}
715 }
716 #endif
717 
718 #ifdef hp300
719 #include <hpdev/device.h>
720 
721 #define validdisk(cp)	((cp)[1] == 'd' && ((cp)[0] == 'r' || (cp)[0] == 's'))
722 
723 read_names()
724 {
725 	struct hp_device hdev;
726 	register struct hp_device *hp;
727 	struct driver hdrv;
728 	short two_char;
729 	char *cp = (char *) &two_char;
730 	register char *dp;
731 
732 	hp = (struct hp_device *) nl[X_HPDINIT].n_value;
733 	if (hp == 0) {
734 		fprintf(stderr, "vmstat: Disk init info not in namelist\n");
735 		exit(1);
736 	}
737 	for (;;) {
738 		steal(hp++, hdev);
739 		if (hdev.hp_driver == 0)
740 			break;
741 		steal(hdev.hp_driver, hdrv);
742 		steal(hdrv.d_name, two_char);
743 		/*
744 		 * hp_dk is meaningless if the device isn't a disk
745 		 * (d_name not valid) or the disk was not found when
746 		 * booting (hp_alive == 0).
747 		 */
748 		if (!validdisk(cp) || hdev.hp_alive == 0)
749 			continue;
750 		dp = dr_name[hdev.hp_dk];
751 		sprintf(dp, "%c%c%d", cp[0], cp[1], hdev.hp_unit);
752 	}
753 }
754 #endif
755