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
33 * @(#)pigs.c 8.2 (Berkeley) 9/23/93
37 * Pigs display from Bill Reeves at Lucasfilm
41 #include <sys/param.h>
43 #include <sys/sysctl.h>
56 int compar(const void *, const void *);
59 static struct p_times {
61 struct kinfo_proc *pt_kp;
64 struct kinfo_cputime old_cp_time;
70 return (subwin(stdscr, LINES-5-1, 0, 5, 0));
90 const char *uname, *pname;
95 /* Accumulate the percent of cpu per user. */
97 for (i = 0; i <= nproc; i++) {
98 /* Accumulate the percentage. */
99 total += pt[i].pt_pctcpu;
106 qsort(pt, nproc + 1, sizeof (struct p_times), compar);
109 if (i > wnd->_maxy-1)
111 for (k = 0; i > 0; i--, y++, k++) {
112 if (pt[k].pt_pctcpu <= 0.01 &&
113 (pt[k].pt_kp == NULL ||
114 pt[k].pt_kp->kp_lwp.kl_slptime > 1)
119 if (pt[k].pt_kp == NULL) {
123 uname = user_from_uid(pt[k].pt_kp->kp_uid, 0);
124 pname = pt[k].pt_kp->kp_comm;
128 mvwaddstr(wnd, y, 0, uname);
129 snprintf(pidname, sizeof(pidname), "%10.10s", pname);
130 mvwaddstr(wnd, y, 9, pidname);
132 for (j = pt[k].pt_pctcpu*factor + 0.5; j > 0; j--)
135 wmove(wnd, y, 0); wclrtobot(wnd);
143 if (kinfo_get_sched_cputime(&old_cp_time))
144 err(1, "kinfo_get_sched_cputime");
146 oldlen = sizeof(fscale);
147 if (sysctlbyname("kern.fscale", &fscale, &oldlen, NULL, 0) < 0)
148 err(1, "sysctlbyname");
159 struct kinfo_proc *kpp, *pp;
160 struct kinfo_cputime cp_time, diff_cp_time;
162 static int lastnproc = 0;
164 if ((kpp = kvm_getprocs(kd, KERN_PROC_ALL, 0, &nproc)) == NULL) {
165 error("%s", kvm_geterr(kd));
170 if (nproc > lastnproc) {
173 malloc((nproc + 1) * sizeof(struct p_times))) == NULL) {
174 error("Out of memory");
180 * calculate %cpu for each proc
182 for (i = 0; i < nproc; i++) {
183 pt[i].pt_kp = &kpp[i];
185 pctp = &pt[i].pt_pctcpu;
186 ftime = pp->kp_swtime;
187 if (ftime == 0 || (pp->kp_flags & P_SWAPPEDOUT))
190 *pctp = ((double) pp->kp_lwp.kl_pctcpu / fscale);
193 * and for the imaginary "idle" process
195 if (kinfo_get_sched_cputime(&cp_time))
196 err(1, "kinfo_get_sched_cputime");
197 diff_cp_time.cp_user = cp_time.cp_user - old_cp_time.cp_user;
198 diff_cp_time.cp_nice = cp_time.cp_nice - old_cp_time.cp_nice;
199 diff_cp_time.cp_sys = cp_time.cp_sys - old_cp_time.cp_sys;
200 diff_cp_time.cp_intr = cp_time.cp_intr - old_cp_time.cp_intr;
201 diff_cp_time.cp_idle = cp_time.cp_idle - old_cp_time.cp_idle;
202 old_cp_time = cp_time;
203 t = diff_cp_time.cp_user + diff_cp_time.cp_nice +
204 diff_cp_time.cp_sys + diff_cp_time.cp_intr +
205 diff_cp_time.cp_idle;
208 pt[nproc].pt_kp = NULL;
209 pt[nproc].pt_pctcpu = diff_cp_time.cp_idle / t;
217 mvwaddstr(wnd, 0, 20,
218 "/0 /10 /20 /30 /40 /50 /60 /70 /80 /90 /100");
222 compar(const void *a, const void *b)
224 const struct p_times *pta = (const struct p_times *)a;
225 const struct p_times *ptb = (const struct p_times *)b;
228 * Check overall cpu percentage first.
230 if (pta->pt_pctcpu > ptb->pt_pctcpu)
231 return (-1); /* a is better */
232 else if (pta->pt_pctcpu < ptb->pt_pctcpu)
233 return (1); /* b is better */
237 if (pta->pt_kp == NULL && ptb->pt_kp == NULL)
239 if (ptb->pt_kp == NULL)
240 return(-1); /* a is better */
241 if (pta->pt_kp == NULL)
242 return(1); /* b is better */
244 * Then check sleep times and run status.
246 if (pta->pt_kp->kp_lwp.kl_slptime < ptb->pt_kp->kp_lwp.kl_slptime)
248 if (pta->pt_kp->kp_lwp.kl_slptime > ptb->pt_kp->kp_lwp.kl_slptime)
254 if (pta->pt_kp->kp_lwp.kl_stat != ptb->pt_kp->kp_lwp.kl_stat) {
255 if (pta->pt_kp->kp_lwp.kl_stat == LSRUN)
257 if (ptb->pt_kp->kp_lwp.kl_stat == LSRUN)