Annotation of src/usr.bin/systat/swap.c, Revision 1.2
1.1 deraadt 1: /* $NetBSD: swap.c,v 1.4 1995/08/31 22:20:19 jtc Exp $ */
2:
3: /*-
4: * Copyright (c) 1980, 1992, 1993
5: * The Regents of the University of California. All rights reserved.
6: *
7: * Redistribution and use in source and binary forms, with or without
8: * modification, are permitted provided that the following conditions
9: * are met:
10: * 1. Redistributions of source code must retain the above copyright
11: * notice, this list of conditions and the following disclaimer.
12: * 2. Redistributions in binary form must reproduce the above copyright
13: * notice, this list of conditions and the following disclaimer in the
14: * documentation and/or other materials provided with the distribution.
15: * 3. All advertising materials mentioning features or use of this software
16: * must display the following acknowledgement:
17: * This product includes software developed by the University of
18: * California, Berkeley and its contributors.
19: * 4. Neither the name of the University nor the names of its contributors
20: * may be used to endorse or promote products derived from this software
21: * without specific prior written permission.
22: *
23: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33: * SUCH DAMAGE.
34: */
35:
36: #ifndef lint
37: #if 0
38: static char sccsid[] = "@(#)swap.c 8.3 (Berkeley) 4/29/95";
39: #endif
40: static char rcsid[] = "$NetBSD: swap.c,v 1.4 1995/08/31 22:20:19 jtc Exp $";
41: #endif /* not lint */
42:
43: /*
44: * swapinfo - based on a program of the same name by Kevin Lahey
45: */
46:
47: #include <sys/param.h>
48: #include <sys/buf.h>
49: #include <sys/conf.h>
50: #include <sys/ioctl.h>
51: #include <sys/map.h>
52: #include <sys/stat.h>
53:
54: #include <kvm.h>
55: #include <nlist.h>
56: #include <stdio.h>
57: #include <stdlib.h>
58: #include <string.h>
59: #include <unistd.h>
60:
61: #include "systat.h"
62: #include "extern.h"
63:
64: extern char *getbsize __P((int *headerlenp, long *blocksizep));
65: void showspace __P((char *header, int hlen, long blocksize));
66:
1.2 ! mickey 67: extern kvm_t *kd;
1.1 deraadt 68:
69: struct nlist syms[] = {
70: { "_swapmap" }, /* list of free swap areas */
71: #define VM_SWAPMAP 0
72: { "_nswapmap" },/* size of the swap map */
73: #define VM_NSWAPMAP 1
74: { "_swdevt" }, /* list of swap devices and sizes */
75: #define VM_SWDEVT 2
76: { "_nswap" }, /* size of largest swap device */
77: #define VM_NSWAP 3
78: { "_nswdev" }, /* number of swap devices */
79: #define VM_NSWDEV 4
80: { "_dmmax" }, /* maximum size of a swap block */
81: #define VM_DMMAX 5
82: 0
83: };
84:
85: static int nswap, nswdev, dmmax, nswapmap;
86: static struct swdevt *sw;
87: static long *perdev, blocksize;
88: static struct map *swapmap, *kswapmap;
89: static struct mapent *mp;
90: static int nfree, hlen;
91:
92: #define SVAR(var) __STRING(var) /* to force expansion */
93: #define KGET(idx, var) \
94: KGET1(idx, &var, sizeof(var), SVAR(var))
95: #define KGET1(idx, p, s, msg) \
96: KGET2(syms[idx].n_value, p, s, msg)
97: #define KGET2(addr, p, s, msg) \
98: if (kvm_read(kd, addr, p, s) != s) { \
99: error("cannot read %s: %s", msg, kvm_geterr(kd)); \
100: return (0); \
101: }
102:
103: WINDOW *
104: openswap()
105: {
106: return (subwin(stdscr, LINES-5-1, 0, 5, 0));
107: }
108:
109: void
110: closeswap(w)
111: WINDOW *w;
112: {
113: if (w == NULL)
114: return;
115: wclear(w);
116: wrefresh(w);
117: delwin(w);
118: }
119:
120: initswap()
121: {
122: int i;
123: char msgbuf[BUFSIZ];
124: static int once = 0;
125:
126: if (once)
127: return (1);
128: if (kvm_nlist(kd, syms)) {
129: strcpy(msgbuf, "systat: swap: cannot find");
130: for (i = 0; syms[i].n_name != NULL; i++) {
131: if (syms[i].n_value == 0) {
132: strcat(msgbuf, " ");
133: strcat(msgbuf, syms[i].n_name);
134: }
135: }
136: error(msgbuf);
137: return (0);
138: }
139: KGET(VM_NSWAP, nswap);
140: KGET(VM_NSWDEV, nswdev);
141: KGET(VM_DMMAX, dmmax);
142: KGET(VM_NSWAPMAP, nswapmap);
143: KGET(VM_SWAPMAP, kswapmap); /* kernel `swapmap' is a pointer */
144: if ((sw = malloc(nswdev * sizeof(*sw))) == NULL ||
145: (perdev = malloc(nswdev * sizeof(*perdev))) == NULL ||
146: (mp = malloc(nswapmap * sizeof(*mp))) == NULL) {
147: error("swap malloc");
148: return (0);
149: }
150: KGET1(VM_SWDEVT, sw, nswdev * sizeof(*sw), "swdevt");
151: once = 1;
152: return (1);
153: }
154:
155: void
156: fetchswap()
157: {
158: int s, e, i;
159:
160: s = nswapmap * sizeof(*mp);
161: if (kvm_read(kd, (long)kswapmap, mp, s) != s)
162: error("cannot read swapmap: %s", kvm_geterr(kd));
163:
164: /* first entry in map is `struct map'; rest are mapent's */
165: swapmap = (struct map *)mp;
166: if (nswapmap != swapmap->m_limit - (struct mapent *)kswapmap)
167: error("panic: swap: nswapmap goof");
168:
169: /*
170: * Count up swap space.
171: */
172: nfree = 0;
173: bzero(perdev, nswdev * sizeof(*perdev));
174: for (mp++; mp->m_addr != 0; mp++) {
175: s = mp->m_addr; /* start of swap region */
176: e = mp->m_addr + mp->m_size; /* end of region */
177: nfree += mp->m_size;
178:
179: /*
180: * Swap space is split up among the configured disks.
181: * The first dmmax blocks of swap space some from the
182: * first disk, the next dmmax blocks from the next,
183: * and so on. The list of free space joins adjacent
184: * free blocks, ignoring device boundries. If we want
185: * to keep track of this information per device, we'll
186: * just have to extract it ourselves.
187: */
188:
189: /* calculate first device on which this falls */
190: i = (s / dmmax) % nswdev;
191: while (s < e) { /* XXX this is inefficient */
192: int bound = roundup(s + 1, dmmax);
193:
194: if (bound > e)
195: bound = e;
196: perdev[i] += bound - s;
197: if (++i >= nswdev)
198: i = 0;
199: s = bound;
200: }
201: }
202: }
203:
204: void
205: labelswap()
206: {
207: char *header, *p;
208: int row, i;
209:
210: row = 0;
211: wmove(wnd, row, 0); wclrtobot(wnd);
212: header = getbsize(&hlen, &blocksize);
213: mvwprintw(wnd, row++, 0, "%-5s%*s%9s %55s",
214: "Disk", hlen, header, "Used",
215: "/0% /10% /20% /30% /40% /50% /60% /70% /80% /90% /100%");
216: for (i = 0; i < nswdev; i++) {
217: p = devname(sw[i].sw_dev, S_IFBLK);
218: mvwprintw(wnd, i + 1, 0, "%-5s", p == NULL ? "??" : p);
219: }
220: }
221:
222: void
223: showswap()
224: {
225: int col, row, div, i, j, avail, npfree, used, xsize, xfree;
226:
227: div = blocksize / 512;
228: avail = npfree = 0;
229: for (i = 0; i < nswdev; i++) {
230: col = 5;
231: mvwprintw(wnd, i + 1, col, "%*d", hlen, sw[i].sw_nblks / div);
232: col += hlen;
233: /*
234: * Don't report statistics for partitions which have not
235: * yet been activated via swapon(8).
236: */
237: if (!sw[i].sw_freed) {
238: mvwprintw(wnd, i + 1, col + 8,
239: "0 *** not available for swapping ***");
240: continue;
241: }
242: xsize = sw[i].sw_nblks;
243: xfree = perdev[i];
244: used = xsize - xfree;
245: mvwprintw(wnd, i + 1, col, "%9d ", used / div);
246: for (j = (100 * used / xsize + 1) / 2; j > 0; j--)
247: waddch(wnd, 'X');
248: npfree++;
249: avail += xsize;
250: }
251: /*
252: * If only one partition has been set up via swapon(8), we don't
253: * need to bother with totals.
254: */
255: if (npfree > 1) {
256: used = avail - nfree;
257: mvwprintw(wnd, i + 1, 0, "%-5s%*d%9d ",
258: "Total", hlen, avail / div, used / div);
259: for (j = (100 * used / avail + 1) / 2; j > 0; j--)
260: waddch(wnd, 'X');
261: }
262: }