2 * Copyright (c) 1980, 1992, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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.
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
35 static char sccsid[] = "@(#)pigs.c 8.2 (Berkeley) 9/23/93";
39 * Pigs display from Bill Reeves at Lucasfilm
42 #include <sys/param.h>
43 #include <sys/dkstat.h>
47 #include <sys/sysctl.h>
58 int compar __P((const void *, const void *));
61 static struct p_times {
63 struct kinfo_proc *pt_kp;
66 static long stime[CPUSTATES];
73 return (subwin(stdscr, LINES-5-1, 0, 5, 0));
91 register int i, j, y, k;
95 char *uname, *pname, pidname[30];
99 /* Accumulate the percent of cpu per user. */
101 for (i = 0; i <= nproc; i++) {
102 /* Accumulate the percentage. */
103 total += pt[i].pt_pctcpu;
110 qsort(pt, nproc + 1, sizeof (struct p_times), compar);
113 if (i > wnd->_maxy-1)
115 for (k = 0; i > 0 && pt[k].pt_pctcpu > 0.01; i--, y++, k++) {
116 if (pt[k].pt_kp == NULL) {
121 ep = &pt[k].pt_kp->kp_eproc;
122 uname = (char *)user_from_uid(ep->e_ucred.cr_uid, 0);
123 pname = pt[k].pt_kp->kp_proc.p_comm;
127 mvwaddstr(wnd, y, 0, uname);
128 snprintf(pidname, sizeof(pidname), "%10.10s", pname);
129 mvwaddstr(wnd, y, 9, pidname);
131 for (j = pt[k].pt_pctcpu*factor + 0.5; j > 0; j--)
134 wmove(wnd, y, 0); wclrtobot(wnd);
137 static struct nlist namelist[] = {
154 if (namelist[X_FIRST].n_type == 0) {
155 if (kvm_nlist(kd, namelist)) {
159 if (namelist[X_FIRST].n_type == 0) {
160 error("namelist failed");
164 KREAD(NPTR(X_CPTIME), stime, sizeof (stime));
165 NREAD(X_CCPU, &ccpu, sizeof(ccpu));
166 NREAD(X_FSCALE, &fscale, LONG);
167 lccpu = log((double) ccpu / fscale);
177 register struct proc *pp;
178 register float *pctp;
179 struct kinfo_proc *kpp;
180 long ctime[CPUSTATES];
182 static int lastnproc = 0;
184 if (namelist[X_FIRST].n_type == 0)
186 if ((kpp = kvm_getprocs(kd, KERN_PROC_ALL, 0, &nproc)) == NULL) {
187 error("%s", kvm_geterr(kd));
192 if (nproc > lastnproc) {
195 malloc((nproc + 1) * sizeof(struct p_times))) == NULL) {
196 error("Out of memory");
202 * calculate %cpu for each proc
204 for (i = 0; i < nproc; i++) {
205 pt[i].pt_kp = &kpp[i];
206 pp = &kpp[i].kp_proc;
207 pctp = &pt[i].pt_pctcpu;
209 if (time == 0 || (pp->p_flag & P_INMEM) == 0)
212 *pctp = ((double) pp->p_pctcpu /
213 fscale) / (1.0 - exp(time * lccpu));
216 * and for the imaginary "idle" process
218 KREAD(NPTR(X_CPTIME), ctime, sizeof (ctime));
220 for (i = 0; i < CPUSTATES; i++)
221 t += ctime[i] - stime[i];
224 pt[nproc].pt_kp = NULL;
225 pt[nproc].pt_pctcpu = (ctime[CP_IDLE] - stime[CP_IDLE]) / t;
226 for (i = 0; i < CPUSTATES; i++)
235 mvwaddstr(wnd, 0, 20,
236 "/0 /10 /20 /30 /40 /50 /60 /70 /80 /90 /100");
243 return (((struct p_times *) a)->pt_pctcpu >
244 ((struct p_times *) b)->pt_pctcpu)? -1: 1;