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