[unix-history] / usr / src / usr.bin / systat / pigs.c

/*
 * Copyright (c) 1980 Regents of the University of California.
 * All rights reserved.  The Berkeley software License Agreement
 * specifies the terms and conditions for redistribution.
 */

#ifndef lint
static char sccsid[] = "@(#)pigs.c	5.1 (Berkeley) %G%";
#endif not lint

/*
 * Pigs display from Bill Reeves at Lucasfilm
 */

#include "systat.h"
#include <sys/dir.h>
#include <sys/time.h>
#include <sys/proc.h>
#include <pwd.h>

WINDOW *
openpigs()
{

	return (subwin(stdscr, LINES-5-1, 0, 5, 0));
}

closepigs(w)
	WINDOW *w;
{

	if (w == NULL)
		return;
	wclear(w);
	wrefresh(w);
	delwin(w);
}

int	maxind;
int     factor;
float   total;
struct  passwd *getpwuid();
char    pidname[30];

showpigs()
{
        register short auid;
        register int i, j, y;
        register float max;
        register struct p_times *ptptr;
        struct p_times temppt;
        register struct users *knptr;
        char *getpname(), *pnamp;

	if (pt == NULL)
		return;
        /* Accumulate the percent of cpu per user. */
        ptptr = pt;
        numprocs = 0;
        total = 0.0;
        for (i = 0; i < nproc; i++) {
                /* discard inactive processes */
                if (ptptr->pt_uid == -1) {
                        ptptr++;
                        continue;
                }
                /* Accumulate the percentage. */
                total += ptptr->pt_pctcpu;
                numprocs++;
                ptptr++;
        }

        pt[numprocs].pt_pctcpu = 1.0 - total;
        pt[numprocs].pt_uid = -1;
        pt[numprocs].pt_pid = -1;
        pt[numprocs].pt_pp = NULL;

        if (total < 1.0)
                total = 1.0;
        factor = 50.0/total;

        /* Find the top few by executing a "bubble pass" ten times. */
	y = numprocs + 1;
	if (y > wnd->_maxy-1)
		y = wnd->_maxy-1;
        for (i = 0; i < y; i++) {
                ptptr = &pt[i];
                max = -10000.0;
                maxind = i;
                for (j = i; j < numprocs + 1; j++) {
                        if (ptptr->pt_pctcpu > max) {
                                max = ptptr->pt_pctcpu;
                                maxind = j;
                        }
                        ptptr++;
                }
                if (maxind != i) {
                        temppt = pt[i];
                        pt[i] = pt[maxind];
                        pt[maxind] = temppt;
                }
        }
        y = 1;
        ptptr = pt;
	i = numprocs + 1;
	if (i > wnd->_maxy-1)
		i = wnd->_maxy-1;
        for (; i > 0 && ptptr->pt_pctcpu > 0.01; i--) {
                /* Find the user's name. */
                knptr = known;
                auid = ptptr->pt_uid;
                for (j = numknown - 1; j >= 0; j--) {
                        if (knptr->k_uid == auid) {
                                namp = knptr->k_name;
                                break;
                        }
                        knptr++;
                }
                if (j < 0) {
                        if (numknown < 30) {
                                knptr = &known[numknown];
                                namp = strncpy(knptr->k_name,
                                    getpwuid(auid)->pw_name, 15);
                                knptr->k_name[15] = '\0';
                                knptr->k_uid = auid;
                                numknown++;
                        } else
                                namp = getpwuid(auid)-> pw_name;
                }
                pnamp = getpname(ptptr->pt_pid, ptptr->pt_pp);
                wmove(wnd, y, 0);
                wclrtoeol(wnd);
                mvwaddstr(wnd, y, 0, namp);
                sprintf(pidname, "%10.10s", pnamp);
                mvwaddstr(wnd, y, 9, pidname);
                wmove(wnd, y++, 20);
                for (j = ptptr->pt_pctcpu*factor + 0.5; j > 0; j--)
                        waddch(wnd, 'X');
                ptptr++;
        }
	wmove(wnd, y, 0); wclrtobot(wnd);
}

static struct nlist nlst[] = {
#define X_PROC          0
        { "_proc" },
#define X_NPROC         1
        { "_nproc" },
#define X_USRPTMAP      2
        { "_Usrptmap" },
#define X_USRPT         3
        { "_usrpt" },
        { "" }
};

initpigs()
{

	if (nlst[X_PROC].n_type == 0) {
		nlist("/vmunix", nlst);
		if (nlst[X_PROC].n_type == 0) {
			error("namelist on /vmunix failed");
			return;
		}
	}
        if (procp == NULL) {
                procp = getw(nlst[X_PROC].n_value);
                nproc = getw(nlst[X_NPROC].n_value);
        }
	if (kprocp == NULL)
                kprocp = (struct proc *)calloc(nproc, sizeof (struct proc));
        if (usrpt != NULL)
		return;
	usrpt = (struct pte *)nlst[X_USRPT].n_value;
	Usrptma = (struct pte *)nlst[X_USRPTMAP].n_value;
	if (pt == NULL)
		pt = (struct p_times *)calloc(nproc, sizeof (struct p_times));
}

fetchpigs()
{
        register int i;
        register struct p_times *prt;
        register float time;
        register struct proc *pp;

	if (nlst[X_PROC].n_type == 0)
		return;
	if (kprocp == NULL) {
		kprocp = (struct proc *)calloc(nproc, sizeof (struct proc));
		if (kprocp == NULL)
			return;
	}
	if (pt == NULL) {
		pt = (struct p_times *)calloc(nproc, sizeof (struct p_times));
		if (pt == NULL)
			return;
	}
        prt = pt;
        lseek(kmem, procp, L_SET);
        read(kmem, kprocp, sizeof (struct proc) * nproc);
        for (i = 0, pp = kprocp; i < nproc; i++, pp++) {
                time = pp->p_time;
                if (time == 0 || (pp->p_flag & SLOAD) == 0)
                        continue;
                prt->pt_pid = pp->p_pid;
                prt->pt_pp = pp;
                prt->pt_pctcpu = pp->p_pctcpu / (1.0 - exp(time * lccpu));
                prt->pt_uid = pp->p_uid;
                prt++;
        }
        for (; prt < &pt[nproc]; prt++)
                prt->pt_uid = -1;
}

labelpigs()
{

	wmove(wnd, 0, 0); wclrtoeol(wnd);
        mvwaddstr(wnd, 0, 20,
                "/0   /10  /20  /30  /40  /50  /60  /70  /80  /90  /100");
}
Commit	Line	Data
07ed1e09 KM	1	/*
	2	* Copyright (c) 1980 Regents of the University of California.
	3	* All rights reserved. The Berkeley software License Agreement
	4	* specifies the terms and conditions for redistribution.
	5	*/
	6
1cd14d1e	7	#ifndef lint
07ed1e09 KM	8	static char sccsid[] = "@(#)pigs.c 5.1 (Berkeley) %G%";
	9	#endif not lint
	10
	11	/*
	12	* Pigs display from Bill Reeves at Lucasfilm
	13	*/
1cd14d1e SL	14
1cd14d1e SL	15	#include "systat.h"
855ff304 KM	16	#include <sys/dir.h>
	17	#include <sys/time.h>
	18	#include <sys/proc.h>
855ff304	19	#include <pwd.h>
1cd14d1e	20
d830bff6 SL	21	WINDOW *
	22	openpigs()
	23	{
d830bff6	24
b5eefd1e	25	return (subwin(stdscr, LINES-5-1, 0, 5, 0));
d830bff6 SL	26	}
	27
	28	closepigs(w)
	29	WINDOW *w;
	30	{
	31
	32	if (w == NULL)
	33	return;
d830bff6 SL	34	wclear(w);
d830bff6 SL	35	wrefresh(w);
b5eefd1e	36	delwin(w);
d830bff6 SL	37	}
d830bff6 SL	38
855ff304 KM	39	int maxind;
	40	int factor;
	41	float total;
	42	struct passwd *getpwuid();
	43	char pidname[30];
	44
1cd14d1e SL	45	showpigs()
	46	{
	47	register short auid;
	48	register int i, j, y;
	49	register float max;
	50	register struct p_times *ptptr;
	51	struct p_times temppt;
	52	register struct users *knptr;
	53	char getpname(), pnamp;
	54
d830bff6 SL	55	if (pt == NULL)
d830bff6 SL	56	return;
1cd14d1e SL	57	/* Accumulate the percent of cpu per user. */
	58	ptptr = pt;
	59	numprocs = 0;
	60	total = 0.0;
	61	for (i = 0; i < nproc; i++) {
	62	/* discard inactive processes */
	63	if (ptptr->pt_uid == -1) {
	64	ptptr++;
	65	continue;
	66	}
	67	/* Accumulate the percentage. */
	68	total += ptptr->pt_pctcpu;
	69	numprocs++;
	70	ptptr++;
	71	}
	72
	73	pt[numprocs].pt_pctcpu = 1.0 - total;
	74	pt[numprocs].pt_uid = -1;
	75	pt[numprocs].pt_pid = -1;
	76	pt[numprocs].pt_pp = NULL;
	77
	78	if (total < 1.0)
	79	total = 1.0;
	80	factor = 50.0/total;
	81
b5eefd1e SL	82	/* Find the top few by executing a "bubble pass" ten times. */
	83	y = numprocs + 1;
	84	if (y > wnd->_maxy-1)
	85	y = wnd->_maxy-1;
1cd14d1e SL	86	for (i = 0; i < y; i++) {
	87	ptptr = &pt[i];
	88	max = -10000.0;
	89	maxind = i;
	90	for (j = i; j < numprocs + 1; j++) {
	91	if (ptptr->pt_pctcpu > max) {
	92	max = ptptr->pt_pctcpu;
	93	maxind = j;
	94	}
	95	ptptr++;
	96	}
	97	if (maxind != i) {
	98	temppt = pt[i];
	99	pt[i] = pt[maxind];
	100	pt[maxind] = temppt;
	101	}
	102	}
b5eefd1e	103	y = 1;
1cd14d1e	104	ptptr = pt;
b5eefd1e SL	105	i = numprocs + 1;
	106	if (i > wnd->_maxy-1)
	107	i = wnd->_maxy-1;
1cd14d1e SL	108	for (; i > 0 && ptptr->pt_pctcpu > 0.01; i--) {
	109	/* Find the user's name. */
	110	knptr = known;
	111	auid = ptptr->pt_uid;
	112	for (j = numknown - 1; j >= 0; j--) {
	113	if (knptr->k_uid == auid) {
	114	namp = knptr->k_name;
	115	break;
	116	}
	117	knptr++;
	118	}
	119	if (j < 0) {
	120	if (numknown < 30) {
	121	knptr = &known[numknown];
	122	namp = strncpy(knptr->k_name,
	123	getpwuid(auid)->pw_name, 15);
	124	knptr->k_name[15] = '\0';
	125	knptr->k_uid = auid;
	126	numknown++;
	127	} else
	128	namp = getpwuid(auid)-> pw_name;
	129	}
	130	pnamp = getpname(ptptr->pt_pid, ptptr->pt_pp);
	131	wmove(wnd, y, 0);
	132	wclrtoeol(wnd);
	133	mvwaddstr(wnd, y, 0, namp);
83e2d91b SL	134	sprintf(pidname, "%10.10s", pnamp);
	135	mvwaddstr(wnd, y, 9, pidname);
	136	wmove(wnd, y++, 20);
1cd14d1e SL	137	for (j = ptptr->pt_pctcpu*factor + 0.5; j > 0; j--)
	138	waddch(wnd, 'X');
	139	ptptr++;
	140	}
b5eefd1e	141	wmove(wnd, y, 0); wclrtobot(wnd);
1cd14d1e SL	142	}
1cd14d1e SL	143
d830bff6	144	static struct nlist nlst[] = {
1cd14d1e	145	#define X_PROC 0
d830bff6	146	{ "_proc" },
1cd14d1e	147	#define X_NPROC 1
d830bff6 SL	148	{ "_nproc" },
	149	#define X_USRPTMAP 2
	150	{ "_Usrptmap" },
	151	#define X_USRPT 3
	152	{ "_usrpt" },
	153	{ "" }
	154	};
1cd14d1e	155
852c7064	156	initpigs()
1cd14d1e	157	{
1cd14d1e	158
d830bff6 SL	159	if (nlst[X_PROC].n_type == 0) {
	160	nlist("/vmunix", nlst);
	161	if (nlst[X_PROC].n_type == 0) {
	162	error("namelist on /vmunix failed");
	163	return;
	164	}
	165	}
1cd14d1e SL	166	if (procp == NULL) {
	167	procp = getw(nlst[X_PROC].n_value);
	168	nproc = getw(nlst[X_NPROC].n_value);
1cd14d1e	169	}
c6265927 SL	170	if (kprocp == NULL)
c6265927 SL	171	kprocp = (struct proc *)calloc(nproc, sizeof (struct proc));
852c7064 SL	172	if (usrpt != NULL)
	173	return;
	174	usrpt = (struct pte *)nlst[X_USRPT].n_value;
	175	Usrptma = (struct pte *)nlst[X_USRPTMAP].n_value;
c6265927 SL	176	if (pt == NULL)
c6265927 SL	177	pt = (struct p_times *)calloc(nproc, sizeof (struct p_times));
852c7064 SL	178	}
	179
	180	fetchpigs()
	181	{
	182	register int i;
	183	register struct p_times *prt;
	184	register float time;
	185	register struct proc *pp;
	186
d830bff6 SL	187	if (nlst[X_PROC].n_type == 0)
d830bff6 SL	188	return;
c6265927 SL	189	if (kprocp == NULL) {
	190	kprocp = (struct proc *)calloc(nproc, sizeof (struct proc));
	191	if (kprocp == NULL)
	192	return;
	193	}
	194	if (pt == NULL) {
	195	pt = (struct p_times *)calloc(nproc, sizeof (struct p_times));
	196	if (pt == NULL)
	197	return;
	198	}
1cd14d1e SL	199	prt = pt;
	200	lseek(kmem, procp, L_SET);
	201	read(kmem, kprocp, sizeof (struct proc) * nproc);
	202	for (i = 0, pp = kprocp; i < nproc; i++, pp++) {
	203	time = pp->p_time;
	204	if (time == 0 \|\| (pp->p_flag & SLOAD) == 0)
	205	continue;
	206	prt->pt_pid = pp->p_pid;
	207	prt->pt_pp = pp;
	208	prt->pt_pctcpu = pp->p_pctcpu / (1.0 - exp(time * lccpu));
	209	prt->pt_uid = pp->p_uid;
	210	prt++;
	211	}
	212	for (; prt < &pt[nproc]; prt++)
	213	prt->pt_uid = -1;
	214	}
	215
	216	labelpigs()
	217	{
	218
b5eefd1e SL	219	wmove(wnd, 0, 0); wclrtoeol(wnd);
b5eefd1e SL	220	mvwaddstr(wnd, 0, 20,
1cd14d1e SL	221	"/0 /10 /20 /30 /40 /50 /60 /70 /80 /90 /100");
1cd14d1e SL	222	}