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 * 4. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 static char sccsid[] = "@(#)pigs.c 8.2 (Berkeley) 9/23/93";
36 #include <sys/cdefs.h>
37 __FBSDID("$FreeBSD$");
40 * Pigs display from Bill Reeves at Lucasfilm
43 #include <sys/param.h>
45 #include <sys/sysctl.h>
57 int compar(const void *, const void *);
60 static struct p_times {
62 struct kinfo_proc *pt_kp;
71 return (subwin(stdscr, LINES-3-1, 0, MAINWIN_ROW, 0));
89 const char *uname, *pname;
95 qsort(pt, nproc, sizeof (struct p_times), compar);
100 for (k = 0; i > 0 && pt[k].pt_pctcpu > 0.01; i--, y++, k++) {
101 uname = user_from_uid(pt[k].pt_kp->ki_uid, 0);
102 pname = pt[k].pt_kp->ki_comm;
105 mvwaddstr(wnd, y, 0, uname);
106 snprintf(pidname, sizeof(pidname), "%10.10s", pname);
107 mvwaddstr(wnd, y, 9, pidname);
109 for (j = pt[k].pt_pctcpu * 50 + 0.5; j > 0; j--)
112 wmove(wnd, y, 0); wclrtobot(wnd);
123 err = sysctlbyname("kern.ccpu", &ccpu, &len, NULL, 0);
124 if (err || len != sizeof(ccpu)) {
129 len = sizeof(fscale);
130 err = sysctlbyname("kern.fscale", &fscale, &len, NULL, 0);
131 if (err || len != sizeof(fscale)) {
132 perror("kern.fscale");
136 lccpu = log((double) ccpu / fscale);
147 struct kinfo_proc *kpp;
148 static int lastnproc = 0;
150 if ((kpp = kvm_getprocs(kd, KERN_PROC_ALL, 0, &nproc)) == NULL) {
151 error("%s", kvm_geterr(kd));
156 if (nproc > lastnproc) {
159 malloc(nproc * sizeof(struct p_times))) == NULL) {
160 error("Out of memory");
166 * calculate %cpu for each proc
168 for (i = 0; i < nproc; i++) {
169 pt[i].pt_kp = &kpp[i];
170 pctp = &pt[i].pt_pctcpu;
171 ftime = kpp[i].ki_swtime;
172 if (ftime == 0 || (kpp[i].ki_flag & P_INMEM) == 0)
175 *pctp = ((double) kpp[i].ki_pctcpu /
176 fscale) / (1.0 - exp(ftime * lccpu));
185 mvwaddstr(wnd, 0, 20,
186 "/0% /10 /20 /30 /40 /50 /60 /70 /80 /90 /100");
190 compar(const void *a, const void *b)
192 return (((const struct p_times *) a)->pt_pctcpu >
193 ((const struct p_times *) b)->pt_pctcpu)? -1: 1;