pigs.c revision 94610 
1/*-
2 * Copyright (c) 1980, 1992, 1993
3 *	The Regents of the University of California.  All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
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.
20 *
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
31 * SUCH DAMAGE.
32 */
33
34#if 0
35#ifndef lint
36static char sccsid[] = "@(#)pigs.c	8.2 (Berkeley) 9/23/93";
37#endif /* not lint */
38#endif
39
40#include <sys/cdefs.h>
41__FBSDID("$FreeBSD: head/usr.bin/systat/pigs.c 94610 2002-04-13 21:09:55Z dwmalone $");
42
43/*
44 * Pigs display from Bill Reeves at Lucasfilm
45 */
46
47#include <sys/param.h>
48#include <sys/dkstat.h>
49#include <sys/time.h>
50#include <sys/user.h>
51#include <sys/sysctl.h>
52
53#include <curses.h>
54#include <math.h>
55#include <nlist.h>
56#include <pwd.h>
57#include <stdlib.h>
58
59#include "extern.h"
60#include "systat.h"
61
62int compar(const void *, const void *);
63
64static int nproc;
65static struct p_times {
66	float pt_pctcpu;
67	struct kinfo_proc *pt_kp;
68} *pt;
69
70static long stime[CPUSTATES];
71static int    fscale;
72static double  lccpu;
73
74WINDOW *
75openpigs()
76{
77	return (subwin(stdscr, LINES-5-1, 0, 5, 0));
78}
79
80void
81closepigs(w)
82	WINDOW *w;
83{
84	if (w == NULL)
85		return;
86	wclear(w);
87	wrefresh(w);
88	delwin(w);
89}
90
91
92void
93showpigs()
94{
95	register int i, j, y, k;
96	float total;
97	int factor;
98	const char *uname, *pname;
99	char pidname[30];
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), compar);
115	y = 1;
116	i = nproc + 1;
117	if (i > wnd->_maxy-1)
118		i = wnd->_maxy-1;
119	for (k = 0; i > 0 && pt[k].pt_pctcpu > 0.01; i--, y++, k++) {
120		if (pt[k].pt_kp == NULL) {
121			uname = "";
122			pname = "<idle>";
123		}
124		else {
125			uname = user_from_uid(pt[k].pt_kp->ki_uid, 0);
126			pname = pt[k].pt_kp->ki_comm;
127		}
128		wmove(wnd, y, 0);
129		wclrtoeol(wnd);
130		mvwaddstr(wnd, y, 0, uname);
131		snprintf(pidname, sizeof(pidname), "%10.10s", pname);
132		mvwaddstr(wnd, y, 9, pidname);
133		wmove(wnd, y, 20);
134		for (j = pt[k].pt_pctcpu*factor + 0.5; j > 0; j--)
135			waddch(wnd, 'X');
136	}
137	wmove(wnd, y, 0); wclrtobot(wnd);
138}
139
140int
141initpigs()
142{
143	fixpt_t ccpu;
144	size_t len;
145	int err;
146
147	len = sizeof(stime);
148	err = sysctlbyname("kern.cp_time", &stime, &len, NULL, 0);
149	if (err || len != sizeof(stime)) {
150		perror("kern.cp_time");
151		return (0);
152	}
153
154	len = sizeof(ccpu);
155	err = sysctlbyname("kern.ccpu", &ccpu, &len, NULL, 0);
156	if (err || len != sizeof(ccpu)) {
157		perror("kern.ccpu");
158		return (0);
159	}
160
161	len = sizeof(fscale);
162	err = sysctlbyname("kern.fscale", &fscale, &len, NULL, 0);
163	if (err || len != sizeof(fscale)) {
164		perror("kern.fscale");
165		return (0);
166	}
167
168	lccpu = log((double) ccpu / fscale);
169
170	return(1);
171}
172
173void
174fetchpigs()
175{
176	int i;
177	float ftime;
178	float *pctp;
179	struct kinfo_proc *kpp;
180	long c_time[CPUSTATES];
181	double t;
182	static int lastnproc = 0;
183	size_t len;
184	int err;
185
186	if ((kpp = kvm_getprocs(kd, KERN_PROC_ALL, 0, &nproc)) == NULL) {
187		error("%s", kvm_geterr(kd));
188		if (pt)
189			free(pt);
190		return;
191	}
192	if (nproc > lastnproc) {
193		free(pt);
194		if ((pt =
195		    malloc((nproc + 1) * sizeof(struct p_times))) == NULL) {
196			error("Out of memory");
197			die(0);
198		}
199	}
200	lastnproc = nproc;
201	/*
202	 * calculate %cpu for each proc
203	 */
204	for (i = 0; i < nproc; i++) {
205		pt[i].pt_kp = &kpp[i];
206		pctp = &pt[i].pt_pctcpu;
207		ftime = kpp[i].ki_swtime;
208		if (ftime == 0 || (kpp[i].ki_sflag & PS_INMEM) == 0)
209			*pctp = 0;
210		else
211			*pctp = ((double) kpp[i].ki_pctcpu /
212					fscale) / (1.0 - exp(ftime * lccpu));
213	}
214	/*
215	 * and for the imaginary "idle" process
216	 */
217	len = sizeof(c_time);
218	err = sysctlbyname("kern.cp_time", &c_time, &len, NULL, 0);
219	if (err || len != sizeof(c_time)) {
220		perror("kern.cp_time");
221		return;
222	}
223	t = 0;
224	for (i = 0; i < CPUSTATES; i++)
225		t += c_time[i] - stime[i];
226	if (t == 0.0)
227		t = 1.0;
228	pt[nproc].pt_kp = NULL;
229	pt[nproc].pt_pctcpu = (c_time[CP_IDLE] - stime[CP_IDLE]) / t;
230	for (i = 0; i < CPUSTATES; i++)
231		stime[i] = c_time[i];
232}
233
234void
235labelpigs()
236{
237	wmove(wnd, 0, 0);
238	wclrtoeol(wnd);
239	mvwaddstr(wnd, 0, 20,
240	    "/0   /10  /20  /30  /40  /50  /60  /70  /80  /90  /100");
241}
242
243int
244compar(a, b)
245	const void *a, *b;
246{
247	return (((const struct p_times *) a)->pt_pctcpu >
248		((const struct p_times *) b)->pt_pctcpu)? -1: 1;
249}
250