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
35 * $DragonFly: src/usr.bin/systat/pigs.c,v 1.14 2007/02/16 23:11:40 corecode Exp $
39 * Pigs display from Bill Reeves at Lucasfilm
42 #define _KERNEL_STRUCTURES
43 #include <sys/param.h>
46 #include <sys/sysctl.h>
58 int compar(const void *, const void *);
61 static struct p_times {
63 struct kinfo_proc *pt_kp;
66 struct kinfo_cputime old_cp_time;
73 return (subwin(stdscr, LINES-5-1, 0, 5, 0));
90 register int i, j, y, k;
93 char *uname, *pname, pidname[30];
97 /* Accumulate the percent of cpu per user. */
99 for (i = 0; i <= nproc; i++) {
100 /* Accumulate the percentage. */
101 total += pt[i].pt_pctcpu;
108 qsort(pt, nproc + 1, sizeof (struct p_times), compar);
111 if (i > wnd->_maxy-1)
113 for (k = 0; i > 0; i--, y++, k++) {
115 if (pt[k].pt_pctcpu <= 0.01 &&
116 (pt[k].pt_kp == NULL ||
117 pt[k].pt_kp->kp_lwp.kl_slptime > 1)
122 if (pt[k].pt_kp == NULL) {
126 uname = (char *)user_from_uid(pt[k].pt_kp->kp_uid, 0);
127 pname = pt[k].pt_kp->kp_comm;
131 mvwaddstr(wnd, y, 0, uname);
132 snprintf(pidname, sizeof(pidname), "%10.10s", pname);
133 mvwaddstr(wnd, y, 9, pidname);
135 for (j = pt[k].pt_pctcpu*factor + 0.5; j > 0; j--)
138 wmove(wnd, y, 0); wclrtobot(wnd);
141 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 if (kinfo_get_sched_cputime(&old_cp_time))
165 err(1, "kinfo_get_sched_cputime");
166 if (kinfo_get_sched_ccpu(&ccpu))
167 err(1, "kinfo_get_sched_ccpu");
169 NREAD(X_FSCALE, &fscale, LONG);
170 lccpu = log((double) ccpu / fscale);
181 struct kinfo_proc *kpp, *pp;
182 struct kinfo_cputime cp_time, diff_cp_time;
184 static int lastnproc = 0;
186 if (namelist[X_FIRST].n_type == 0)
188 if ((kpp = kvm_getprocs(kd, KERN_PROC_ALL, 0, &nproc)) == NULL) {
189 error("%s", kvm_geterr(kd));
194 if (nproc > lastnproc) {
197 malloc((nproc + 1) * sizeof(struct p_times))) == NULL) {
198 error("Out of memory");
204 * calculate %cpu for each proc
206 for (i = 0; i < nproc; i++) {
207 pt[i].pt_kp = &kpp[i];
209 pctp = &pt[i].pt_pctcpu;
210 time = pp->kp_swtime;
211 if (time == 0 || (pp->kp_flags & P_SWAPPEDOUT))
214 *pctp = ((double) pp->kp_lwp.kl_pctcpu /
215 fscale) / (1.0 - exp(time * lccpu));
218 * and for the imaginary "idle" process
220 if (kinfo_get_sched_cputime(&cp_time))
221 err(1, "kinfo_get_sched_cputime");
222 diff_cp_time.cp_user = cp_time.cp_user - old_cp_time.cp_user;
223 diff_cp_time.cp_nice = cp_time.cp_nice - old_cp_time.cp_nice;
224 diff_cp_time.cp_sys = cp_time.cp_sys - old_cp_time.cp_sys;
225 diff_cp_time.cp_intr = cp_time.cp_intr - old_cp_time.cp_intr;
226 diff_cp_time.cp_idle = cp_time.cp_idle - old_cp_time.cp_idle;
227 old_cp_time = cp_time;
228 t = diff_cp_time.cp_user + diff_cp_time.cp_nice +
229 diff_cp_time.cp_sys + diff_cp_time.cp_intr +
230 diff_cp_time.cp_idle;
233 pt[nproc].pt_kp = NULL;
234 pt[nproc].pt_pctcpu = diff_cp_time.cp_idle / t;
242 mvwaddstr(wnd, 0, 20,
243 "/0 /10 /20 /30 /40 /50 /60 /70 /80 /90 /100");
247 compar(const void *a, const void *b)
249 struct p_times *pta = (struct p_times *)a;
250 struct p_times *ptb = (struct p_times *)b;
254 * Check overall cpu percentage first.
256 d = pta->pt_pctcpu - ptb->pt_pctcpu;
258 return(-1); /* a is better */
260 return(1); /* b is better */
262 if (pta->pt_kp == NULL && ptb->pt_kp == NULL)
264 if (ptb->pt_kp == NULL)
265 return(-1); /* a is better */
266 if (pta->pt_kp == NULL)
267 return(1); /* b is better */
269 * Then check sleep times and run status.
271 if (pta->pt_kp->kp_lwp.kl_slptime < ptb->pt_kp->kp_lwp.kl_slptime)
273 if (pta->pt_kp->kp_lwp.kl_slptime > ptb->pt_kp->kp_lwp.kl_slptime)
279 if (pta->pt_kp->kp_lwp.kl_stat != ptb->pt_kp->kp_lwp.kl_stat) {
280 if (pta->pt_kp->kp_lwp.kl_stat == LSRUN)
282 if (ptb->pt_kp->kp_lwp.kl_stat == LSRUN)