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 * $FreeBSD$ 34 */ 35 36 #ifndef lint 37 static char sccsid[] = "@(#)pigs.c 8.2 (Berkeley) 9/23/93"; 38 #endif /* not lint */ 39 40 /* 41 * Pigs display from Bill Reeves at Lucasfilm 42 */ 43 44 #include <sys/param.h> 45 #include <sys/dkstat.h> 46 #include <sys/lock.h> 47 #include <sys/time.h> 48 #include <sys/user.h> 49 #include <sys/sysctl.h> 50 51 #include <curses.h> 52 #include <math.h> 53 #include <nlist.h> 54 #include <pwd.h> 55 #include <stdlib.h> 56 57 #include "extern.h" 58 #include "systat.h" 59 60 int compar __P((const void *, const void *)); 61 62 static int nproc; 63 static struct p_times { 64 float pt_pctcpu; 65 struct kinfo_proc *pt_kp; 66 } *pt; 67 68 static long stime[CPUSTATES]; 69 static int fscale; 70 static double lccpu; 71 72 WINDOW * 73 openpigs() 74 { 75 return (subwin(stdscr, LINES-5-1, 0, 5, 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 float total; 95 int factor; 96 char *uname, *pname, pidname[30]; 97 98 if (pt == NULL) 99 return; 100 /* Accumulate the percent of cpu per user. */ 101 total = 0.0; 102 for (i = 0; i <= nproc; i++) { 103 /* Accumulate the percentage. */ 104 total += pt[i].pt_pctcpu; 105 } 106 107 if (total < 1.0) 108 total = 1.0; 109 factor = 50.0/total; 110 111 qsort(pt, nproc + 1, sizeof (struct p_times), compar); 112 y = 1; 113 i = nproc + 1; 114 if (i > wnd->_maxy-1) 115 i = wnd->_maxy-1; 116 for (k = 0; i > 0 && pt[k].pt_pctcpu > 0.01; i--, y++, k++) { 117 if (pt[k].pt_kp == NULL) { 118 uname = ""; 119 pname = "<idle>"; 120 } 121 else { 122 uname = (char *) 123 user_from_uid(pt[k].pt_kp->ki_uid, 0); 124 pname = pt[k].pt_kp->ki_comm; 125 } 126 wmove(wnd, y, 0); 127 wclrtoeol(wnd); 128 mvwaddstr(wnd, y, 0, uname); 129 snprintf(pidname, sizeof(pidname), "%10.10s", pname); 130 mvwaddstr(wnd, y, 9, pidname); 131 wmove(wnd, y, 20); 132 for (j = pt[k].pt_pctcpu*factor + 0.5; j > 0; j--) 133 waddch(wnd, 'X'); 134 } 135 wmove(wnd, y, 0); wclrtobot(wnd); 136 } 137 138 int 139 initpigs() 140 { 141 fixpt_t ccpu; 142 size_t len; 143 int err; 144 145 len = sizeof(stime); 146 err = sysctlbyname("kern.cp_time", &stime, &len, NULL, 0); 147 if (err || len != sizeof(stime)) { 148 perror("kern.cp_time"); 149 return (0); 150 } 151 152 len = sizeof(ccpu); 153 err = sysctlbyname("kern.ccpu", &ccpu, &len, NULL, 0); 154 if (err || len != sizeof(ccpu)) { 155 perror("kern.ccpu"); 156 return (0); 157 } 158 159 len = sizeof(fscale); 160 err = sysctlbyname("kern.fscale", &fscale, &len, NULL, 0); 161 if (err || len != sizeof(fscale)) { 162 perror("kern.fscale"); 163 return (0); 164 } 165 166 lccpu = log((double) ccpu / fscale); 167 168 return(1); 169 } 170 171 void 172 fetchpigs() 173 { 174 register int i; 175 register float time; 176 register float *pctp; 177 struct kinfo_proc *kpp; 178 long ctime[CPUSTATES]; 179 double t; 180 static int lastnproc = 0; 181 size_t len; 182 int err; 183 184 if ((kpp = kvm_getprocs(kd, KERN_PROC_ALL, 0, &nproc)) == NULL) { 185 error("%s", kvm_geterr(kd)); 186 if (pt) 187 free(pt); 188 return; 189 } 190 if (nproc > lastnproc) { 191 free(pt); 192 if ((pt = 193 malloc((nproc + 1) * sizeof(struct p_times))) == NULL) { 194 error("Out of memory"); 195 die(0); 196 } 197 } 198 lastnproc = nproc; 199 /* 200 * calculate %cpu for each proc 201 */ 202 for (i = 0; i < nproc; i++) { 203 pt[i].pt_kp = &kpp[i]; 204 pctp = &pt[i].pt_pctcpu; 205 time = kpp[i].ki_swtime; 206 if (time == 0 || (kpp[i].ki_sflag & PS_INMEM) == 0) 207 *pctp = 0; 208 else 209 *pctp = ((double) kpp[i].ki_pctcpu / 210 fscale) / (1.0 - exp(time * lccpu)); 211 } 212 /* 213 * and for the imaginary "idle" process 214 */ 215 len = sizeof(ctime); 216 err = sysctlbyname("kern.cp_time", &ctime, &len, NULL, 0); 217 if (err || len != sizeof(ctime)) { 218 perror("kern.cp_time"); 219 return; 220 } 221 t = 0; 222 for (i = 0; i < CPUSTATES; i++) 223 t += ctime[i] - stime[i]; 224 if (t == 0.0) 225 t = 1.0; 226 pt[nproc].pt_kp = NULL; 227 pt[nproc].pt_pctcpu = (ctime[CP_IDLE] - stime[CP_IDLE]) / t; 228 for (i = 0; i < CPUSTATES; i++) 229 stime[i] = ctime[i]; 230 } 231 232 void 233 labelpigs() 234 { 235 wmove(wnd, 0, 0); 236 wclrtoeol(wnd); 237 mvwaddstr(wnd, 0, 20, 238 "/0 /10 /20 /30 /40 /50 /60 /70 /80 /90 /100"); 239 } 240 241 int 242 compar(a, b) 243 const void *a, *b; 244 { 245 return (((struct p_times *) a)->pt_pctcpu > 246 ((struct p_times *) b)->pt_pctcpu)? -1: 1; 247 } 248