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