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 #if 0 35 #ifndef lint 36 static char sccsid[] = "@(#)pigs.c 8.2 (Berkeley) 9/23/93"; 37 #endif /* not lint */ 38 #endif 39 40 #include <sys/cdefs.h> 41 __FBSDID("$FreeBSD$"); 42 43 /* 44 * Pigs display from Bill Reeves at Lucasfilm 45 */ 46 47 #include <sys/param.h> 48 #include <sys/proc.h> 49 #include <sys/sysctl.h> 50 #include <sys/time.h> 51 #include <sys/user.h> 52 53 #include <curses.h> 54 #include <math.h> 55 #include <pwd.h> 56 #include <stdlib.h> 57 58 #include "systat.h" 59 #include "extern.h" 60 61 int compar(const void *, const void *); 62 63 static int nproc; 64 static struct p_times { 65 float pt_pctcpu; 66 struct kinfo_proc *pt_kp; 67 } *pt; 68 69 static int fscale; 70 static double lccpu; 71 72 WINDOW * 73 openpigs() 74 { 75 return (subwin(stdscr, LINES-3-1, 0, MAINWIN_ROW, 0)); 76 } 77 78 void 79 closepigs(w) 80 WINDOW *w; 81 { 82 if (w == NULL) 83 return; 84 wclear(w); 85 wrefresh(w); 86 delwin(w); 87 } 88 89 90 void 91 showpigs() 92 { 93 register int i, j, y, k; 94 const char *uname, *pname; 95 char pidname[30]; 96 97 if (pt == NULL) 98 return; 99 100 qsort(pt, nproc, sizeof (struct p_times), compar); 101 y = 1; 102 i = nproc; 103 if (i > wnd->_maxy-1) 104 i = wnd->_maxy-1; 105 for (k = 0; i > 0 && pt[k].pt_pctcpu > 0.01; i--, y++, k++) { 106 uname = user_from_uid(pt[k].pt_kp->ki_uid, 0); 107 pname = pt[k].pt_kp->ki_comm; 108 wmove(wnd, y, 0); 109 wclrtoeol(wnd); 110 mvwaddstr(wnd, y, 0, uname); 111 snprintf(pidname, sizeof(pidname), "%10.10s", pname); 112 mvwaddstr(wnd, y, 9, pidname); 113 wmove(wnd, y, 20); 114 for (j = pt[k].pt_pctcpu * 50 + 0.5; j > 0; j--) 115 waddch(wnd, 'X'); 116 } 117 wmove(wnd, y, 0); wclrtobot(wnd); 118 } 119 120 int 121 initpigs() 122 { 123 fixpt_t ccpu; 124 size_t len; 125 int err; 126 127 len = sizeof(ccpu); 128 err = sysctlbyname("kern.ccpu", &ccpu, &len, NULL, 0); 129 if (err || len != sizeof(ccpu)) { 130 perror("kern.ccpu"); 131 return (0); 132 } 133 134 len = sizeof(fscale); 135 err = sysctlbyname("kern.fscale", &fscale, &len, NULL, 0); 136 if (err || len != sizeof(fscale)) { 137 perror("kern.fscale"); 138 return (0); 139 } 140 141 lccpu = log((double) ccpu / fscale); 142 143 return(1); 144 } 145 146 void 147 fetchpigs() 148 { 149 int i; 150 float ftime; 151 float *pctp; 152 struct kinfo_proc *kpp; 153 static int lastnproc = 0; 154 155 if ((kpp = kvm_getprocs(kd, KERN_PROC_ALL, 0, &nproc)) == NULL) { 156 error("%s", kvm_geterr(kd)); 157 if (pt) 158 free(pt); 159 return; 160 } 161 if (nproc > lastnproc) { 162 free(pt); 163 if ((pt = 164 malloc(nproc * sizeof(struct p_times))) == NULL) { 165 error("Out of memory"); 166 die(0); 167 } 168 } 169 lastnproc = nproc; 170 /* 171 * calculate %cpu for each proc 172 */ 173 for (i = 0; i < nproc; i++) { 174 pt[i].pt_kp = &kpp[i]; 175 pctp = &pt[i].pt_pctcpu; 176 ftime = kpp[i].ki_swtime; 177 if (ftime == 0 || (kpp[i].ki_flag & P_INMEM) == 0) 178 *pctp = 0; 179 else 180 *pctp = ((double) kpp[i].ki_pctcpu / 181 fscale) / (1.0 - exp(ftime * lccpu)); 182 } 183 } 184 185 void 186 labelpigs() 187 { 188 wmove(wnd, 0, 0); 189 wclrtoeol(wnd); 190 mvwaddstr(wnd, 0, 20, 191 "/0% /10 /20 /30 /40 /50 /60 /70 /80 /90 /100"); 192 } 193 194 int 195 compar(a, b) 196 const void *a, *b; 197 { 198 return (((const struct p_times *) a)->pt_pctcpu > 199 ((const struct p_times *) b)->pt_pctcpu)? -1: 1; 200 } 201