1 /* 2 * Copyright (c) 1998 Kenneth D. Merry. 3 * 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. The name of the author may not be used to endorse or promote products 14 * derived from this software without specific prior written permission. 15 * 16 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 17 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 19 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 20 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 21 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 22 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 23 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 24 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 25 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 26 * SUCH DAMAGE. 27 */ 28 /* 29 * Copyright (c) 1980, 1992, 1993 30 * The Regents of the University of California. All rights reserved. 31 * 32 * Redistribution and use in source and binary forms, with or without 33 * modification, are permitted provided that the following conditions 34 * are met: 35 * 1. Redistributions of source code must retain the above copyright 36 * notice, this list of conditions and the following disclaimer. 37 * 2. Redistributions in binary form must reproduce the above copyright 38 * notice, this list of conditions and the following disclaimer in the 39 * documentation and/or other materials provided with the distribution. 40 * 3. All advertising materials mentioning features or use of this software 41 * must display the following acknowledgement: 42 * This product includes software developed by the University of 43 * California, Berkeley and its contributors. 44 * 4. Neither the name of the University nor the names of its contributors 45 * may be used to endorse or promote products derived from this software 46 * without specific prior written permission. 47 * 48 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 49 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 50 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 51 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 52 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 53 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 54 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 55 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 56 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 57 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 58 * SUCH DAMAGE. 59 */ 60 61 #include <sys/cdefs.h> 62 63 __FBSDID("$FreeBSD$"); 64 65 #ifdef lint 66 static const char sccsid[] = "@(#)iostat.c 8.1 (Berkeley) 6/6/93"; 67 #endif 68 69 #include <sys/param.h> 70 #include <sys/sysctl.h> 71 #include <sys/resource.h> 72 73 #include <devstat.h> 74 #include <err.h> 75 #include <nlist.h> 76 #include <paths.h> 77 #include <stdlib.h> 78 #include <string.h> 79 80 #include "systat.h" 81 #include "extern.h" 82 #include "devs.h" 83 84 struct statinfo cur, last; 85 86 static int linesperregion; 87 static double etime; 88 static int numbers = 0; /* default display bar graphs */ 89 static int kbpt = 0; /* default ms/seek shown */ 90 91 static int barlabels(int); 92 static void histogram(long double, int, double); 93 static int numlabels(int); 94 static int devstats(int, int, int); 95 static void stat1(int, int); 96 97 WINDOW * 98 openiostat() 99 { 100 return (subwin(stdscr, LINES-1-5, 0, 5, 0)); 101 } 102 103 void 104 closeiostat(w) 105 WINDOW *w; 106 { 107 if (w == NULL) 108 return; 109 wclear(w); 110 wrefresh(w); 111 delwin(w); 112 } 113 114 int 115 initiostat() 116 { 117 if ((num_devices = devstat_getnumdevs(NULL)) < 0) 118 return(0); 119 120 cur.dinfo = (struct devinfo *)malloc(sizeof(struct devinfo)); 121 last.dinfo = (struct devinfo *)malloc(sizeof(struct devinfo)); 122 bzero(cur.dinfo, sizeof(struct devinfo)); 123 bzero(last.dinfo, sizeof(struct devinfo)); 124 125 /* 126 * This value for maxshowdevs (100) is bogus. I'm not sure exactly 127 * how to calculate it, though. 128 */ 129 if (dsinit(100, &cur, &last, NULL) != 1) 130 return(0); 131 132 return(1); 133 } 134 135 void 136 fetchiostat() 137 { 138 struct devinfo *tmp_dinfo; 139 size_t len; 140 141 len = sizeof(cur.cp_time); 142 if (sysctlbyname("kern.cp_time", &cur.cp_time, &len, NULL, 0) 143 || len != sizeof(cur.cp_time)) { 144 perror("kern.cp_time"); 145 exit (1); 146 } 147 tmp_dinfo = last.dinfo; 148 last.dinfo = cur.dinfo; 149 cur.dinfo = tmp_dinfo; 150 151 /* 152 * Here what we want to do is refresh our device stats. 153 * getdevs() returns 1 when the device list has changed. 154 * If the device list has changed, we want to go through 155 * the selection process again, in case a device that we 156 * were previously displaying has gone away. 157 */ 158 switch (devstat_getdevs(NULL, &cur)) { 159 case -1: 160 errx(1, "%s", devstat_errbuf); 161 break; 162 case 1: 163 cmdiostat("refresh", NULL); 164 break; 165 default: 166 break; 167 } 168 num_devices = cur.dinfo->numdevs; 169 generation = cur.dinfo->generation; 170 171 } 172 173 #define INSET 10 174 175 void 176 labeliostat() 177 { 178 int row; 179 180 row = 0; 181 wmove(wnd, row, 0); wclrtobot(wnd); 182 mvwaddstr(wnd, row++, INSET, 183 "/0 /10 /20 /30 /40 /50 /60 /70 /80 /90 /100"); 184 mvwaddstr(wnd, row++, 0, "cpu user|"); 185 mvwaddstr(wnd, row++, 0, " nice|"); 186 mvwaddstr(wnd, row++, 0, " system|"); 187 mvwaddstr(wnd, row++, 0, "interrupt|"); 188 mvwaddstr(wnd, row++, 0, " idle|"); 189 if (numbers) 190 row = numlabels(row + 1); 191 else 192 row = barlabels(row + 1); 193 } 194 195 static int 196 numlabels(row) 197 int row; 198 { 199 int i, _col, regions, ndrives; 200 char tmpstr[10]; 201 202 #define COLWIDTH 17 203 #define DRIVESPERLINE ((wnd->_maxx - INSET) / COLWIDTH) 204 for (ndrives = 0, i = 0; i < num_devices; i++) 205 if (dev_select[i].selected) 206 ndrives++; 207 regions = howmany(ndrives, DRIVESPERLINE); 208 /* 209 * Deduct -regions for blank line after each scrolling region. 210 */ 211 linesperregion = (wnd->_maxy - row - regions) / regions; 212 /* 213 * Minimum region contains space for two 214 * label lines and one line of statistics. 215 */ 216 if (linesperregion < 3) 217 linesperregion = 3; 218 _col = INSET; 219 for (i = 0; i < num_devices; i++) 220 if (dev_select[i].selected) { 221 if (_col + COLWIDTH >= wnd->_maxx - INSET) { 222 _col = INSET, row += linesperregion + 1; 223 if (row > wnd->_maxy - (linesperregion + 1)) 224 break; 225 } 226 sprintf(tmpstr, "%s%d", dev_select[i].device_name, 227 dev_select[i].unit_number); 228 mvwaddstr(wnd, row, _col + 4, tmpstr); 229 mvwaddstr(wnd, row + 1, _col, " KB/t tps MB/s "); 230 _col += COLWIDTH; 231 } 232 if (_col) 233 row += linesperregion + 1; 234 return (row); 235 } 236 237 static int 238 barlabels(row) 239 int row; 240 { 241 int i; 242 char tmpstr[10]; 243 244 mvwaddstr(wnd, row++, INSET, 245 "/0 /10 /20 /30 /40 /50 /60 /70 /80 /90 /100"); 246 linesperregion = 2 + kbpt; 247 for (i = 0; i < num_devices; i++) 248 if (dev_select[i].selected) { 249 if (row > wnd->_maxy - linesperregion) 250 break; 251 sprintf(tmpstr, "%s%d", dev_select[i].device_name, 252 dev_select[i].unit_number); 253 mvwprintw(wnd, row++, 0, "%-5.5s MB/s|", 254 tmpstr); 255 mvwaddstr(wnd, row++, 0, " tps|"); 256 if (kbpt) 257 mvwaddstr(wnd, row++, 0, " KB/t|"); 258 } 259 return (row); 260 } 261 262 263 void 264 showiostat() 265 { 266 long t; 267 int i, row, _col; 268 269 #define X(fld) t = cur.fld[i]; cur.fld[i] -= last.fld[i]; last.fld[i] = t 270 etime = 0; 271 for(i = 0; i < CPUSTATES; i++) { 272 X(cp_time); 273 etime += cur.cp_time[i]; 274 } 275 if (etime == 0.0) 276 etime = 1.0; 277 etime /= hertz; 278 row = 1; 279 for (i = 0; i < CPUSTATES; i++) 280 stat1(row++, i); 281 if (!numbers) { 282 row += 2; 283 for (i = 0; i < num_devices; i++) 284 if (dev_select[i].selected) { 285 if (row > wnd->_maxy - linesperregion) 286 break; 287 row = devstats(row, INSET, i); 288 } 289 return; 290 } 291 _col = INSET; 292 wmove(wnd, row + linesperregion, 0); 293 wdeleteln(wnd); 294 wmove(wnd, row + 3, 0); 295 winsertln(wnd); 296 for (i = 0; i < num_devices; i++) 297 if (dev_select[i].selected) { 298 if (_col + COLWIDTH >= wnd->_maxx - INSET) { 299 _col = INSET, row += linesperregion + 1; 300 if (row > wnd->_maxy - (linesperregion + 1)) 301 break; 302 wmove(wnd, row + linesperregion, 0); 303 wdeleteln(wnd); 304 wmove(wnd, row + 3, 0); 305 winsertln(wnd); 306 } 307 (void) devstats(row + 3, _col, i); 308 _col += COLWIDTH; 309 } 310 } 311 312 static int 313 devstats(row, _col, dn) 314 int row, _col, dn; 315 { 316 long double transfers_per_second; 317 long double kb_per_transfer, mb_per_second; 318 long double busy_seconds; 319 int di; 320 321 di = dev_select[dn].position; 322 323 busy_seconds = cur.snap_time - last.snap_time; 324 325 if (devstat_compute_statistics(&cur.dinfo->devices[di], 326 &last.dinfo->devices[di], busy_seconds, 327 DSM_KB_PER_TRANSFER, &kb_per_transfer, 328 DSM_TRANSFERS_PER_SECOND, &transfers_per_second, 329 DSM_MB_PER_SECOND, &mb_per_second, DSM_NONE) != 0) 330 errx(1, "%s", devstat_errbuf); 331 332 if (numbers) { 333 mvwprintw(wnd, row, _col, " %5.2Lf %3.0Lf %5.2Lf ", 334 kb_per_transfer, transfers_per_second, 335 mb_per_second); 336 return(row); 337 } 338 wmove(wnd, row++, _col); 339 histogram(mb_per_second, 50, .5); 340 wmove(wnd, row++, _col); 341 histogram(transfers_per_second, 50, .5); 342 if (kbpt) { 343 wmove(wnd, row++, _col); 344 histogram(kb_per_transfer, 50, .5); 345 } 346 347 return(row); 348 349 } 350 351 static void 352 stat1(row, o) 353 int row, o; 354 { 355 int i; 356 double dtime; 357 358 dtime = 0.0; 359 for (i = 0; i < CPUSTATES; i++) 360 dtime += cur.cp_time[i]; 361 if (dtime == 0.0) 362 dtime = 1.0; 363 wmove(wnd, row, INSET); 364 #define CPUSCALE 0.5 365 histogram(100.0 * cur.cp_time[o] / dtime, 50, CPUSCALE); 366 } 367 368 static void 369 histogram(val, colwidth, scale) 370 long double val; 371 int colwidth; 372 double scale; 373 { 374 char buf[10]; 375 int k; 376 int v = (int)(val * scale) + 0.5; 377 378 k = MIN(v, colwidth); 379 if (v > colwidth) { 380 snprintf(buf, sizeof(buf), "%5.2Lf", val); 381 k -= strlen(buf); 382 while (k--) 383 waddch(wnd, 'X'); 384 waddstr(wnd, buf); 385 return; 386 } 387 while (k--) 388 waddch(wnd, 'X'); 389 wclrtoeol(wnd); 390 } 391 392 int 393 cmdiostat(cmd, args) 394 const char *cmd, *args; 395 { 396 397 if (prefix(cmd, "kbpt")) 398 kbpt = !kbpt; 399 else if (prefix(cmd, "numbers")) 400 numbers = 1; 401 else if (prefix(cmd, "bars")) 402 numbers = 0; 403 else if (!dscmd(cmd, args, 100, &cur)) 404 return (0); 405 wclear(wnd); 406 labeliostat(); 407 refresh(); 408 return (1); 409 } 410