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 * 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.
16 *
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
27 * SUCH DAMAGE.
28 */
29
30#if 0
31#ifndef lint
32static char sccsid[] = "@(#)pigs.c	8.2 (Berkeley) 9/23/93";
33#endif /* not lint */
34#endif
35
36#include <sys/cdefs.h>
37__FBSDID("$FreeBSD$");
38
39/*
40 * Pigs display from Bill Reeves at Lucasfilm
41 */
42
43#include <sys/param.h>
44#include <sys/proc.h>
45#include <sys/sysctl.h>
46#include <sys/time.h>
47#include <sys/user.h>
48
49#include <curses.h>
50#include <math.h>
51#include <pwd.h>
52#include <stdlib.h>
53
54#include "systat.h"
55#include "extern.h"
56
57int compar(const void *, const void *);
58
59static int nproc;
60static struct p_times {
61	float pt_pctcpu;
62	struct kinfo_proc *pt_kp;
63} *pt;
64
65static int    fscale;
66static double  lccpu;
67
68WINDOW *
69openpigs(void)
70{
71	return (subwin(stdscr, LINES-3-1, 0, MAINWIN_ROW, 0));
72}
73
74void
75closepigs(WINDOW *w)
76{
77	if (w == NULL)
78		return;
79	wclear(w);
80	wrefresh(w);
81	delwin(w);
82}
83
84void
85showpigs(void)
86{
87	int i, j, y, k;
88	const char *uname, *pname;
89	char pidname[30];
90
91	if (pt == NULL)
92		return;
93
94	qsort(pt, nproc, sizeof (struct p_times), compar);
95	y = 1;
96	i = nproc;
97	if (i > wnd->_maxy-1)
98		i = wnd->_maxy-1;
99	for (k = 0; i > 0 && pt[k].pt_pctcpu > 0.01; i--, y++, k++) {
100		uname = user_from_uid(pt[k].pt_kp->ki_uid, 0);
101		pname = pt[k].pt_kp->ki_comm;
102		wmove(wnd, y, 0);
103		wclrtoeol(wnd);
104		mvwaddstr(wnd, y, 0, uname);
105		snprintf(pidname, sizeof(pidname), "%10.10s", pname);
106		mvwaddstr(wnd, y, 9, pidname);
107		wmove(wnd, y, 20);
108		for (j = pt[k].pt_pctcpu * 50 + 0.5; j > 0; j--)
109			waddch(wnd, 'X');
110	}
111	wmove(wnd, y, 0); wclrtobot(wnd);
112}
113
114int
115initpigs(void)
116{
117	fixpt_t ccpu;
118	size_t len;
119	int err;
120
121	len = sizeof(ccpu);
122	err = sysctlbyname("kern.ccpu", &ccpu, &len, NULL, 0);
123	if (err || len != sizeof(ccpu)) {
124		perror("kern.ccpu");
125		return (0);
126	}
127
128	len = sizeof(fscale);
129	err = sysctlbyname("kern.fscale", &fscale, &len, NULL, 0);
130	if (err || len != sizeof(fscale)) {
131		perror("kern.fscale");
132		return (0);
133	}
134
135	lccpu = log((double) ccpu / fscale);
136
137	return(1);
138}
139
140void
141fetchpigs(void)
142{
143	int i;
144	float ftime;
145	float *pctp;
146	struct kinfo_proc *kpp;
147	static int lastnproc = 0;
148
149	if ((kpp = kvm_getprocs(kd, KERN_PROC_ALL, 0, &nproc)) == NULL) {
150		error("%s", kvm_geterr(kd));
151		if (pt)
152			free(pt);
153		return;
154	}
155	if (nproc > lastnproc) {
156		free(pt);
157		if ((pt =
158		    malloc(nproc * sizeof(struct p_times))) == NULL) {
159			error("Out of memory");
160			die(0);
161		}
162	}
163	lastnproc = nproc;
164	/*
165	 * calculate %cpu for each proc
166	 */
167	for (i = 0; i < nproc; i++) {
168		pt[i].pt_kp = &kpp[i];
169		pctp = &pt[i].pt_pctcpu;
170		ftime = kpp[i].ki_swtime;
171		if (ftime == 0 || (kpp[i].ki_flag & P_INMEM) == 0)
172			*pctp = 0;
173		else
174			*pctp = ((double) kpp[i].ki_pctcpu /
175					fscale) / (1.0 - exp(ftime * lccpu));
176	}
177}
178
179void
180labelpigs(void)
181{
182	wmove(wnd, 0, 0);
183	wclrtoeol(wnd);
184	mvwaddstr(wnd, 0, 20,
185	    "/0%  /10  /20  /30  /40  /50  /60  /70  /80  /90  /100");
186}
187
188int
189compar(const void *a, const void *b)
190{
191	return (((const struct p_times *) a)->pt_pctcpu >
192		((const struct p_times *) b)->pt_pctcpu)? -1: 1;
193}
194