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 * @(#)pigs.c 8.2 (Berkeley) 9/23/93 34 */ 35 36 /* 37 * Pigs display from Bill Reeves at Lucasfilm 38 */ 39 40 #include <sys/param.h> 41 #include <sys/dkstat.h> 42 #include <sys/time.h> 43 #include <sys/proc.h> 44 #include <sys/user.h> 45 #include <sys/sysctl.h> 46 47 #include <curses.h> 48 #include <math.h> 49 #include <nlist.h> 50 #include <pwd.h> 51 #include <stdlib.h> 52 53 #include "extern.h" 54 #include "systat.h" 55 56 int compar __P((const void *, const void *)); 57 58 static int nproc; 59 static struct p_times { 60 float pt_pctcpu; 61 struct kinfo_proc *pt_kp; 62 } *pt; 63 64 static long stime[CPUSTATES]; 65 static long fscale; 66 static double lccpu; 67 68 WINDOW * 69 openpigs() 70 { 71 return (subwin(stdscr, LINES-5-1, 0, 5, 0)); 72 } 73 74 void 75 closepigs(w) 76 WINDOW *w; 77 { 78 if (w == NULL) 79 return; 80 wclear(w); 81 wrefresh(w); 82 delwin(w); 83 } 84 85 86 void 87 showpigs() 88 { 89 register int i, j, y, k; 90 struct eproc *ep; 91 float total; 92 int factor; 93 char *uname, *pname, pidname[30]; 94 95 if (pt == NULL) 96 return; 97 /* Accumulate the percent of cpu per user. */ 98 total = 0.0; 99 for (i = 0; i <= nproc; i++) { 100 /* Accumulate the percentage. */ 101 total += pt[i].pt_pctcpu; 102 } 103 104 if (total < 1.0) 105 total = 1.0; 106 factor = 50.0/total; 107 108 qsort(pt, nproc + 1, sizeof (struct p_times), compar); 109 y = 1; 110 i = nproc + 1; 111 if (i > wnd->_maxy-1) 112 i = wnd->_maxy-1; 113 for (k = 0; i > 0 && pt[k].pt_pctcpu > 0.01; i--, y++, k++) { 114 if (pt[k].pt_kp == NULL) { 115 uname = ""; 116 pname = "<idle>"; 117 } 118 else { 119 ep = &pt[k].pt_kp->kp_eproc; 120 uname = (char *)user_from_uid(ep->e_ucred.cr_uid, 0); 121 pname = pt[k].pt_kp->kp_proc.p_comm; 122 } 123 wmove(wnd, y, 0); 124 wclrtoeol(wnd); 125 mvwaddstr(wnd, y, 0, uname); 126 snprintf(pidname, sizeof(pidname), "%10.10s", pname); 127 mvwaddstr(wnd, y, 9, pidname); 128 wmove(wnd, y, 20); 129 for (j = pt[k].pt_pctcpu*factor + 0.5; j > 0; j--) 130 waddch(wnd, 'X'); 131 } 132 wmove(wnd, y, 0); wclrtobot(wnd); 133 } 134 135 static struct nlist namelist[] = { 136 #define X_FIRST 0 137 #define X_CPTIME 0 138 { "_cp_time" }, 139 #define X_CCPU 1 140 { "_ccpu" }, 141 #define X_FSCALE 2 142 { "_fscale" }, 143 144 { "" } 145 }; 146 147 int 148 initpigs() 149 { 150 fixpt_t ccpu; 151 152 if (namelist[X_FIRST].n_type == 0) { 153 if (kvm_nlist(kd, namelist)) { 154 nlisterr(namelist); 155 return(0); 156 } 157 if (namelist[X_FIRST].n_type == 0) { 158 error("namelist failed"); 159 return(0); 160 } 161 } 162 KREAD(NPTR(X_CPTIME), stime, sizeof (stime)); 163 NREAD(X_CCPU, &ccpu, sizeof(ccpu)); 164 NREAD(X_FSCALE, &fscale, LONG); 165 lccpu = log((double) ccpu / fscale); 166 167 return(1); 168 } 169 170 void 171 fetchpigs() 172 { 173 register int i; 174 register float time; 175 register struct proc *pp; 176 register float *pctp; 177 struct kinfo_proc *kpp; 178 long ctime[CPUSTATES]; 179 double t; 180 static int lastnproc = 0; 181 182 if (namelist[X_FIRST].n_type == 0) 183 return; 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 pp = &kpp[i].kp_proc; 205 pctp = &pt[i].pt_pctcpu; 206 time = pp->p_swtime; 207 if (time == 0 || (pp->p_flag & P_INMEM) == 0) 208 *pctp = 0; 209 else 210 *pctp = ((double) pp->p_pctcpu / 211 fscale) / (1.0 - exp(time * lccpu)); 212 } 213 /* 214 * and for the imaginary "idle" process 215 */ 216 KREAD(NPTR(X_CPTIME), ctime, sizeof (ctime)); 217 t = 0; 218 for (i = 0; i < CPUSTATES; i++) 219 t += ctime[i] - stime[i]; 220 if (t == 0.0) 221 t = 1.0; 222 pt[nproc].pt_kp = NULL; 223 pt[nproc].pt_pctcpu = (ctime[CP_IDLE] - stime[CP_IDLE]) / t; 224 for (i = 0; i < CPUSTATES; i++) 225 stime[i] = ctime[i]; 226 } 227 228 void 229 labelpigs() 230 { 231 wmove(wnd, 0, 0); 232 wclrtoeol(wnd); 233 mvwaddstr(wnd, 0, 20, 234 "/0 /10 /20 /30 /40 /50 /60 /70 /80 /90 /100"); 235 } 236 237 int 238 compar(a, b) 239 const void *a, *b; 240 { 241 return (((struct p_times *) a)->pt_pctcpu > 242 ((struct p_times *) b)->pt_pctcpu)? -1: 1; 243 } 244