1/* $NetBSD: pigs.c,v 1.30 2006/10/22 16:43:24 christos Exp $ */ 2 3/*- 4 * Copyright (c) 1980, 1992, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. Neither the name of the University nor the names of its contributors 16 * may be used to endorse or promote products derived from this software 17 * without specific prior written permission. 18 * 19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29 * SUCH DAMAGE. 30 */ 31 32#include <sys/cdefs.h> 33#ifndef lint 34#if 0 35static char sccsid[] = "@(#)pigs.c 8.2 (Berkeley) 9/23/93"; 36#endif 37__RCSID("$NetBSD: pigs.c,v 1.30 2006/10/22 16:43:24 christos Exp $"); 38#endif /* not lint */ 39 40/* 41 * Pigs display from Bill Reeves at Lucasfilm 42 */ 43 44#include <sys/param.h> 45#include <sys/sched.h> 46#include <sys/sysctl.h> 47 48#include <curses.h> 49#include <math.h> 50#include <pwd.h> 51#include <stdlib.h> 52#include <string.h> 53 54#include "systat.h" 55#include "extern.h" 56#include "ps.h" 57 58int compare_pctcpu(const void *, const void *); 59 60int nproc; 61struct p_times *pt; 62 63u_int64_t stime[CPUSTATES]; 64long mempages; 65int fscale; 66double lccpu; 67 68#ifndef P_ZOMBIE 69#define P_ZOMBIE(p) ((p)->p_stat == SZOMB) 70#endif 71 72WINDOW * 73openpigs(void) 74{ 75 76 return (subwin(stdscr, -1, 0, 5, 0)); 77} 78 79void 80closepigs(WINDOW *w) 81{ 82 83 if (w == NULL) 84 return; 85 wclear(w); 86 wrefresh(w); 87 delwin(w); 88} 89 90 91void 92showpigs(void) 93{ 94 int i, y, k; 95 struct kinfo_proc2 *kp; 96 float total; 97 int factor; 98 const char *pname; 99 char pidname[30], pidstr[7], usrstr[9]; 100 101 if (pt == NULL) 102 return; 103 /* Accumulate the percent of CPU per user. */ 104 total = 0.0; 105 for (i = 0; i <= nproc; i++) { 106 /* Accumulate the percentage. */ 107 total += pt[i].pt_pctcpu; 108 } 109 110 if (total < 1.0) 111 total = 1.0; 112 factor = 50.0/total; 113 114 qsort(pt, nproc + 1, sizeof (struct p_times), compare_pctcpu); 115 y = 1; 116 i = nproc + 1; 117 if (i > getmaxy(wnd)-1) 118 i = getmaxy(wnd)-1; 119 for (k = 0; i > 0 && pt[k].pt_pctcpu > 0.01; i--, y++, k++) { 120 if (pt[k].pt_kp == NULL) { 121 pname = "<idle>"; 122 pidstr[0] = '\0'; 123 usrstr[0] = '\0'; 124 } 125 else { 126 kp = pt[k].pt_kp; 127 pname = kp->p_comm; 128 snprintf(pidstr, sizeof(pidstr), "%5d", kp->p_pid); 129 snprintf(usrstr, sizeof(usrstr), "%8s", 130 user_from_uid(kp->p_uid, 0)); 131 } 132 wmove(wnd, y, 0); 133 wclrtoeol(wnd); 134 mvwaddstr(wnd, y, 0, usrstr); 135 mvwaddstr(wnd, y, 9, pidstr); 136 (void)snprintf(pidname, sizeof(pidname), "%9.9s", pname); 137 mvwaddstr(wnd, y, 15, pidname); 138 mvwhline(wnd, y, 25, 'X', pt[k].pt_pctcpu*factor + 0.5); 139 } 140 wmove(wnd, y, 0); wclrtobot(wnd); 141} 142 143static struct nlist namelist[] = { 144#define X_FIRST 0 145#define X_CCPU 0 146 { .n_name = "_ccpu" }, 147#define X_FSCALE 1 148 { .n_name = "_fscale" }, 149#define X_PHYSMEM 2 150 { .n_name = "_physmem" }, 151 { .n_name = NULL } 152}; 153 154int 155initpigs(void) 156{ 157 fixpt_t ccpu; 158 159 if (namelist[X_FIRST].n_type == 0) { 160 if (kvm_nlist(kd, namelist)) { 161 nlisterr(namelist); 162 return(0); 163 } 164 if (namelist[X_FIRST].n_type == 0) { 165 error("namelist failed"); 166 return(0); 167 } 168 } 169 (void) fetch_cptime(stime); 170 KREAD(NPTR(X_PHYSMEM), &mempages, sizeof (mempages)); 171 NREAD(X_CCPU, &ccpu, sizeof ccpu); 172 NREAD(X_FSCALE, &fscale, sizeof fscale); 173 lccpu = log((double) ccpu / fscale); 174 175 return(1); 176} 177 178void 179fetchpigs(void) 180{ 181 int i; 182 float *pctp; 183 struct kinfo_proc2 *kpp, *k; 184 u_int64_t cputime[CPUSTATES]; 185 double t; 186 static int lastnproc = 0; 187 188 if (namelist[X_FIRST].n_type == 0) 189 return; 190 if ((kpp = kvm_getproc2(kd, KERN_PROC_ALL, 0, sizeof(*kpp), 191 &nproc)) == NULL) { 192 error("%s", kvm_geterr(kd)); 193 if (pt) 194 free(pt); 195 return; 196 } 197 if (nproc > lastnproc) { 198 free(pt); 199 if ((pt = 200 malloc((nproc + 1) * sizeof(struct p_times))) == NULL) { 201 error("Out of memory"); 202 die(0); 203 } 204 } 205 lastnproc = nproc; 206 /* 207 * calculate %cpu for each proc 208 */ 209 for (i = 0; i < nproc; i++) { 210 pt[i].pt_kp = k = &kpp[i]; 211 pctp = &pt[i].pt_pctcpu; 212 213 if (k->p_swtime == 0 || k->p_stat == SZOMB) 214 *pctp = 0; 215 else 216 *pctp = ((double) k->p_pctcpu / 217 fscale) / (1.0 - exp(k->p_swtime * lccpu)); 218 } 219 /* 220 * and for the imaginary "idle" process 221 */ 222 (void) fetch_cptime(cputime); 223 t = 0; 224 for (i = 0; i < CPUSTATES; i++) 225 t += cputime[i] - stime[i]; 226 if (t == 0.0) 227 t = 1.0; 228 pt[nproc].pt_kp = NULL; 229 pt[nproc].pt_pctcpu = (cputime[CP_IDLE] - stime[CP_IDLE]) / t; 230 for (i = 0; i < CPUSTATES; i++) 231 stime[i] = cputime[i]; 232} 233 234void 235labelpigs(void) 236{ 237 wmove(wnd, 0, 0); 238 wclrtoeol(wnd); 239 mvwaddstr(wnd, 0, 25, "/0 /10 /20 /30 /40 /50 /60 /70 /80 /90 /100"); 240} 241 242int 243compare_pctcpu(const void *a, const void *b) 244{ 245 return (((const struct p_times *) a)->pt_pctcpu > 246 ((const struct p_times *) b)->pt_pctcpu)? -1: 1; 247} 248