pigs.c revision 158160
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 158160 2006-04-30 04:26:46Z bde $");
42
43/*
44 * Pigs display from Bill Reeves at Lucasfilm
45 */
46
47#include <sys/param.h>
48#include <sys/proc.h>
49#include <sys/sysctl.h>
50#include <sys/time.h>
51#include <sys/user.h>
52
53#include <curses.h>
54#include <math.h>
55#include <pwd.h>
56#include <stdlib.h>
57
58#include "systat.h"
59#include "extern.h"
60
61int compar(const void *, const void *);
62
63static int nproc;
64static struct p_times {
65	float pt_pctcpu;
66	struct kinfo_proc *pt_kp;
67} *pt;
68
69static long stime[CPUSTATES];
70static int    fscale;
71static double  lccpu;
72
73WINDOW *
74openpigs()
75{
76	return (subwin(stdscr, LINES-3-1, 0, MAINWIN_ROW, 0));
77}
78
79void
80closepigs(w)
81	WINDOW *w;
82{
83	if (w == NULL)
84		return;
85	wclear(w);
86	wrefresh(w);
87	delwin(w);
88}
89
90
91void
92showpigs()
93{
94	register int i, j, y, k;
95	float total;
96	int factor;
97	const char *uname, *pname;
98	char pidname[30];
99
100	if (pt == NULL)
101		return;
102	/* Accumulate the percent of cpu per user. */
103	total = 0.0;
104	for (i = 0; i <= nproc; i++) {
105		/* Accumulate the percentage. */
106		total += pt[i].pt_pctcpu;
107	}
108
109	if (total < 1.0)
110 		total = 1.0;
111	factor = 50.0/total;
112
113        qsort(pt, nproc + 1, sizeof (struct p_times), compar);
114	y = 1;
115	i = nproc + 1;
116	if (i > wnd->_maxy-1)
117		i = wnd->_maxy-1;
118	for (k = 0; i > 0 && pt[k].pt_pctcpu > 0.01; i--, y++, k++) {
119		if (pt[k].pt_kp == NULL) {
120			uname = "";
121			pname = "<idle>";
122		}
123		else {
124			uname = user_from_uid(pt[k].pt_kp->ki_uid, 0);
125			pname = pt[k].pt_kp->ki_comm;
126		}
127		wmove(wnd, y, 0);
128		wclrtoeol(wnd);
129		mvwaddstr(wnd, y, 0, uname);
130		snprintf(pidname, sizeof(pidname), "%10.10s", pname);
131		mvwaddstr(wnd, y, 9, pidname);
132		wmove(wnd, y, 20);
133		for (j = pt[k].pt_pctcpu*factor + 0.5; j > 0; j--)
134			waddch(wnd, 'X');
135	}
136	wmove(wnd, y, 0); wclrtobot(wnd);
137}
138
139int
140initpigs()
141{
142	fixpt_t ccpu;
143	size_t len;
144	int err;
145
146	len = sizeof(stime);
147	err = sysctlbyname("kern.cp_time", &stime, &len, NULL, 0);
148	if (err || len != sizeof(stime)) {
149		perror("kern.cp_time");
150		return (0);
151	}
152
153	len = sizeof(ccpu);
154	err = sysctlbyname("kern.ccpu", &ccpu, &len, NULL, 0);
155	if (err || len != sizeof(ccpu)) {
156		perror("kern.ccpu");
157		return (0);
158	}
159
160	len = sizeof(fscale);
161	err = sysctlbyname("kern.fscale", &fscale, &len, NULL, 0);
162	if (err || len != sizeof(fscale)) {
163		perror("kern.fscale");
164		return (0);
165	}
166
167	lccpu = log((double) ccpu / fscale);
168
169	return(1);
170}
171
172void
173fetchpigs()
174{
175	int i;
176	float ftime;
177	float *pctp;
178	struct kinfo_proc *kpp;
179	long c_time[CPUSTATES];
180	double t;
181	static int lastnproc = 0;
182	size_t len;
183	int err;
184
185	if ((kpp = kvm_getprocs(kd, KERN_PROC_ALL, 0, &nproc)) == NULL) {
186		error("%s", kvm_geterr(kd));
187		if (pt)
188			free(pt);
189		return;
190	}
191	if (nproc > lastnproc) {
192		free(pt);
193		if ((pt =
194		    malloc((nproc + 1) * sizeof(struct p_times))) == NULL) {
195			error("Out of memory");
196			die(0);
197		}
198	}
199	lastnproc = nproc;
200	/*
201	 * calculate %cpu for each proc
202	 */
203	for (i = 0; i < nproc; i++) {
204		pt[i].pt_kp = &kpp[i];
205		pctp = &pt[i].pt_pctcpu;
206		ftime = kpp[i].ki_swtime;
207		if (ftime == 0 || (kpp[i].ki_sflag & PS_INMEM) == 0)
208			*pctp = 0;
209		else
210			*pctp = ((double) kpp[i].ki_pctcpu /
211					fscale) / (1.0 - exp(ftime * lccpu));
212	}
213	/*
214	 * and for the imaginary "idle" process
215	 */
216	len = sizeof(c_time);
217	err = sysctlbyname("kern.cp_time", &c_time, &len, NULL, 0);
218	if (err || len != sizeof(c_time)) {
219		perror("kern.cp_time");
220		return;
221	}
222	t = 0;
223	for (i = 0; i < CPUSTATES; i++)
224		t += c_time[i] - stime[i];
225	if (t == 0.0)
226		t = 1.0;
227	pt[nproc].pt_kp = NULL;
228	pt[nproc].pt_pctcpu = (c_time[CP_IDLE] - stime[CP_IDLE]) / t;
229	for (i = 0; i < CPUSTATES; i++)
230		stime[i] = c_time[i];
231}
232
233void
234labelpigs()
235{
236	wmove(wnd, 0, 0);
237	wclrtoeol(wnd);
238	mvwaddstr(wnd, 0, 20,
239	    "/0   /10  /20  /30  /40  /50  /60  /70  /80  /90  /100");
240}
241
242int
243compar(a, b)
244	const void *a, *b;
245{
246	return (((const struct p_times *) a)->pt_pctcpu >
247		((const struct p_times *) b)->pt_pctcpu)? -1: 1;
248}
249