1994-05-26 06:18:55 +00:00
|
|
|
/*-
|
|
|
|
* Copyright (c) 1990, 1993, 1994
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
|
|
* must display the following acknowledgement:
|
|
|
|
* This product includes software developed by the University of
|
|
|
|
* California, Berkeley and its contributors.
|
|
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef lint
|
1998-05-15 06:30:58 +00:00
|
|
|
#if 0
|
|
|
|
static char sccsid[] = "@(#)print.c 8.6 (Berkeley) 4/16/94";
|
|
|
|
#endif
|
|
|
|
static const char rcsid[] =
|
1999-08-27 23:15:48 +00:00
|
|
|
"$FreeBSD$";
|
1994-05-26 06:18:55 +00:00
|
|
|
#endif /* not lint */
|
|
|
|
|
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/time.h>
|
|
|
|
#include <sys/resource.h>
|
|
|
|
#include <sys/proc.h>
|
|
|
|
#include <sys/stat.h>
|
|
|
|
|
|
|
|
#include <sys/ucred.h>
|
1995-10-28 20:11:18 +00:00
|
|
|
#include <sys/user.h>
|
1994-05-26 06:18:55 +00:00
|
|
|
#include <sys/sysctl.h>
|
|
|
|
#include <vm/vm.h>
|
|
|
|
|
|
|
|
#include <err.h>
|
|
|
|
#include <math.h>
|
|
|
|
#include <nlist.h>
|
|
|
|
#include <stddef.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
1996-06-29 10:25:31 +00:00
|
|
|
#include <unistd.h>
|
1994-05-26 06:18:55 +00:00
|
|
|
#include <string.h>
|
|
|
|
#include <vis.h>
|
|
|
|
|
|
|
|
#include "ps.h"
|
|
|
|
|
|
|
|
void
|
|
|
|
printheader()
|
|
|
|
{
|
|
|
|
VAR *v;
|
|
|
|
struct varent *vent;
|
|
|
|
|
|
|
|
for (vent = vhead; vent; vent = vent->next) {
|
|
|
|
v = vent->var;
|
|
|
|
if (v->flag & LJUST) {
|
|
|
|
if (vent->next == NULL) /* last one */
|
|
|
|
(void)printf("%s", v->header);
|
|
|
|
else
|
|
|
|
(void)printf("%-*s", v->width, v->header);
|
|
|
|
} else
|
|
|
|
(void)printf("%*s", v->width, v->header);
|
|
|
|
if (vent->next != NULL)
|
|
|
|
(void)putchar(' ');
|
|
|
|
}
|
|
|
|
(void)putchar('\n');
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
command(k, ve)
|
|
|
|
KINFO *k;
|
|
|
|
VARENT *ve;
|
|
|
|
{
|
|
|
|
VAR *v;
|
|
|
|
int left;
|
|
|
|
char *cp, *vis_env, *vis_args;
|
|
|
|
|
1996-10-21 07:30:26 +00:00
|
|
|
v = ve->var;
|
|
|
|
|
|
|
|
if (cflag) {
|
1997-04-16 16:08:11 +00:00
|
|
|
if (ve->next == NULL) /* last field, don't pad */
|
|
|
|
(void)printf("%s", KI_PROC(k)->p_comm);
|
|
|
|
else
|
|
|
|
(void)printf("%-*s", v->width, KI_PROC(k)->p_comm);
|
1996-10-21 07:30:26 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
1994-05-26 06:18:55 +00:00
|
|
|
if ((vis_args = malloc(strlen(k->ki_args) * 4 + 1)) == NULL)
|
|
|
|
err(1, NULL);
|
|
|
|
strvis(vis_args, k->ki_args, VIS_TAB | VIS_NL | VIS_NOSLASH);
|
|
|
|
if (k->ki_env) {
|
|
|
|
if ((vis_env = malloc(strlen(k->ki_env) * 4 + 1)) == NULL)
|
|
|
|
err(1, NULL);
|
|
|
|
strvis(vis_env, k->ki_env, VIS_TAB | VIS_NL | VIS_NOSLASH);
|
|
|
|
} else
|
|
|
|
vis_env = NULL;
|
|
|
|
|
|
|
|
if (ve->next == NULL) {
|
|
|
|
/* last field */
|
|
|
|
if (termwidth == UNLIMITED) {
|
|
|
|
if (vis_env)
|
|
|
|
(void)printf("%s ", vis_env);
|
|
|
|
(void)printf("%s", vis_args);
|
|
|
|
} else {
|
|
|
|
left = termwidth - (totwidth - v->width);
|
|
|
|
if (left < 1) /* already wrapped, just use std width */
|
|
|
|
left = v->width;
|
|
|
|
if ((cp = vis_env) != NULL) {
|
|
|
|
while (--left >= 0 && *cp)
|
|
|
|
(void)putchar(*cp++);
|
|
|
|
if (--left >= 0)
|
|
|
|
putchar(' ');
|
|
|
|
}
|
|
|
|
for (cp = vis_args; --left >= 0 && *cp != '\0';)
|
|
|
|
(void)putchar(*cp++);
|
|
|
|
}
|
|
|
|
} else
|
|
|
|
/* XXX env? */
|
|
|
|
(void)printf("%-*.*s", v->width, v->width, vis_args);
|
|
|
|
free(vis_args);
|
|
|
|
if (vis_env != NULL)
|
|
|
|
free(vis_env);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
ucomm(k, ve)
|
|
|
|
KINFO *k;
|
|
|
|
VARENT *ve;
|
|
|
|
{
|
|
|
|
VAR *v;
|
|
|
|
|
|
|
|
v = ve->var;
|
|
|
|
(void)printf("%-*s", v->width, KI_PROC(k)->p_comm);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
logname(k, ve)
|
|
|
|
KINFO *k;
|
|
|
|
VARENT *ve;
|
|
|
|
{
|
|
|
|
VAR *v;
|
1998-05-25 05:07:18 +00:00
|
|
|
char *s;
|
1994-05-26 06:18:55 +00:00
|
|
|
|
|
|
|
v = ve->var;
|
1998-05-25 05:07:18 +00:00
|
|
|
(void)printf("%-*s", v->width, (s = KI_EPROC(k)->e_login, *s) ? s : "-");
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
state(k, ve)
|
|
|
|
KINFO *k;
|
|
|
|
VARENT *ve;
|
|
|
|
{
|
|
|
|
struct proc *p;
|
|
|
|
int flag;
|
|
|
|
char *cp;
|
|
|
|
VAR *v;
|
|
|
|
char buf[16];
|
|
|
|
|
|
|
|
v = ve->var;
|
|
|
|
p = KI_PROC(k);
|
|
|
|
flag = p->p_flag;
|
|
|
|
cp = buf;
|
|
|
|
|
|
|
|
switch (p->p_stat) {
|
|
|
|
|
|
|
|
case SSTOP:
|
|
|
|
*cp = 'T';
|
|
|
|
break;
|
|
|
|
|
|
|
|
case SSLEEP:
|
2000-09-07 01:33:02 +00:00
|
|
|
if (flag & P_SINTR) /* interruptable (long) */
|
1994-05-26 06:18:55 +00:00
|
|
|
*cp = p->p_slptime >= MAXSLP ? 'I' : 'S';
|
|
|
|
else
|
|
|
|
*cp = 'D';
|
|
|
|
break;
|
|
|
|
|
|
|
|
case SRUN:
|
|
|
|
case SIDL:
|
|
|
|
*cp = 'R';
|
|
|
|
break;
|
|
|
|
|
2000-09-07 01:33:02 +00:00
|
|
|
case SWAIT:
|
|
|
|
*cp = 'W';
|
|
|
|
break;
|
|
|
|
|
|
|
|
case SMTX:
|
|
|
|
*cp = 'M';
|
|
|
|
break;
|
|
|
|
|
1994-05-26 06:18:55 +00:00
|
|
|
case SZOMB:
|
|
|
|
*cp = 'Z';
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
*cp = '?';
|
|
|
|
}
|
|
|
|
cp++;
|
1997-08-03 08:25:01 +00:00
|
|
|
if (!(flag & P_INMEM))
|
1994-05-26 06:18:55 +00:00
|
|
|
*cp++ = 'W';
|
|
|
|
if (p->p_nice < NZERO)
|
|
|
|
*cp++ = '<';
|
|
|
|
else if (p->p_nice > NZERO)
|
|
|
|
*cp++ = 'N';
|
|
|
|
if (flag & P_TRACED)
|
|
|
|
*cp++ = 'X';
|
|
|
|
if (flag & P_WEXIT && p->p_stat != SZOMB)
|
|
|
|
*cp++ = 'E';
|
|
|
|
if (flag & P_PPWAIT)
|
|
|
|
*cp++ = 'V';
|
1999-04-06 03:17:57 +00:00
|
|
|
if ((flag & P_SYSTEM) || p->p_lock > 0)
|
1994-05-26 06:18:55 +00:00
|
|
|
*cp++ = 'L';
|
|
|
|
if (KI_EPROC(k)->e_flag & EPROC_SLEADER)
|
|
|
|
*cp++ = 's';
|
|
|
|
if ((flag & P_CONTROLT) && KI_EPROC(k)->e_pgid == KI_EPROC(k)->e_tpgid)
|
|
|
|
*cp++ = '+';
|
This Implements the mumbled about "Jail" feature.
This is a seriously beefed up chroot kind of thing. The process
is jailed along the same lines as a chroot does it, but with
additional tough restrictions imposed on what the superuser can do.
For all I know, it is safe to hand over the root bit inside a
prison to the customer living in that prison, this is what
it was developed for in fact: "real virtual servers".
Each prison has an ip number associated with it, which all IP
communications will be coerced to use and each prison has its own
hostname.
Needless to say, you need more RAM this way, but the advantage is
that each customer can run their own particular version of apache
and not stomp on the toes of their neighbors.
It generally does what one would expect, but setting up a jail
still takes a little knowledge.
A few notes:
I have no scripts for setting up a jail, don't ask me for them.
The IP number should be an alias on one of the interfaces.
mount a /proc in each jail, it will make ps more useable.
/proc/<pid>/status tells the hostname of the prison for
jailed processes.
Quotas are only sensible if you have a mountpoint per prison.
There are no privisions for stopping resource-hogging.
Some "#ifdef INET" and similar may be missing (send patches!)
If somebody wants to take it from here and develop it into
more of a "virtual machine" they should be most welcome!
Tools, comments, patches & documentation most welcome.
Have fun...
Sponsored by: http://www.rndassociates.com/
Run for almost a year by: http://www.servetheweb.com/
1999-04-28 11:38:52 +00:00
|
|
|
if (flag & P_JAILED)
|
|
|
|
*cp++ = 'J';
|
1994-05-26 06:18:55 +00:00
|
|
|
*cp = '\0';
|
|
|
|
(void)printf("%-*s", v->width, buf);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
pri(k, ve)
|
|
|
|
KINFO *k;
|
|
|
|
VARENT *ve;
|
|
|
|
{
|
|
|
|
VAR *v;
|
|
|
|
|
|
|
|
v = ve->var;
|
|
|
|
(void)printf("%*d", v->width, KI_PROC(k)->p_priority - PZERO);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
uname(k, ve)
|
|
|
|
KINFO *k;
|
|
|
|
VARENT *ve;
|
|
|
|
{
|
|
|
|
VAR *v;
|
|
|
|
|
|
|
|
v = ve->var;
|
|
|
|
(void)printf("%-*s",
|
|
|
|
(int)v->width, user_from_uid(KI_EPROC(k)->e_ucred.cr_uid, 0));
|
|
|
|
}
|
|
|
|
|
1997-04-29 05:26:05 +00:00
|
|
|
int
|
|
|
|
s_uname(k)
|
|
|
|
KINFO *k;
|
|
|
|
{
|
|
|
|
return (strlen(user_from_uid(KI_EPROC(k)->e_ucred.cr_uid, 0)));
|
|
|
|
}
|
|
|
|
|
1994-05-26 06:18:55 +00:00
|
|
|
void
|
|
|
|
runame(k, ve)
|
|
|
|
KINFO *k;
|
|
|
|
VARENT *ve;
|
|
|
|
{
|
|
|
|
VAR *v;
|
|
|
|
|
|
|
|
v = ve->var;
|
|
|
|
(void)printf("%-*s",
|
|
|
|
(int)v->width, user_from_uid(KI_EPROC(k)->e_pcred.p_ruid, 0));
|
|
|
|
}
|
|
|
|
|
1997-04-29 05:26:05 +00:00
|
|
|
int
|
|
|
|
s_runame(k)
|
|
|
|
KINFO *k;
|
|
|
|
{
|
|
|
|
return (strlen(user_from_uid(KI_EPROC(k)->e_pcred.p_ruid, 0)));
|
|
|
|
}
|
|
|
|
|
1994-05-26 06:18:55 +00:00
|
|
|
void
|
|
|
|
tdev(k, ve)
|
|
|
|
KINFO *k;
|
|
|
|
VARENT *ve;
|
|
|
|
{
|
|
|
|
VAR *v;
|
|
|
|
dev_t dev;
|
|
|
|
char buff[16];
|
|
|
|
|
|
|
|
v = ve->var;
|
|
|
|
dev = KI_EPROC(k)->e_tdev;
|
|
|
|
if (dev == NODEV)
|
|
|
|
(void)printf("%*s", v->width, "??");
|
|
|
|
else {
|
|
|
|
(void)snprintf(buff, sizeof(buff),
|
|
|
|
"%d/%d", major(dev), minor(dev));
|
|
|
|
(void)printf("%*s", v->width, buff);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
tname(k, ve)
|
|
|
|
KINFO *k;
|
|
|
|
VARENT *ve;
|
|
|
|
{
|
|
|
|
VAR *v;
|
|
|
|
dev_t dev;
|
|
|
|
char *ttname;
|
|
|
|
|
|
|
|
v = ve->var;
|
|
|
|
dev = KI_EPROC(k)->e_tdev;
|
|
|
|
if (dev == NODEV || (ttname = devname(dev, S_IFCHR)) == NULL)
|
1995-09-26 17:48:59 +00:00
|
|
|
(void)printf("%*s ", v->width-1, "??");
|
1994-05-26 06:18:55 +00:00
|
|
|
else {
|
1994-10-02 14:11:32 +00:00
|
|
|
if (strncmp(ttname, "tty", 3) == 0 ||
|
|
|
|
strncmp(ttname, "cua", 3) == 0)
|
1994-05-26 06:18:55 +00:00
|
|
|
ttname += 3;
|
1995-09-26 17:48:59 +00:00
|
|
|
(void)printf("%*.*s%c", v->width-1, v->width-1, ttname,
|
1994-05-26 06:18:55 +00:00
|
|
|
KI_EPROC(k)->e_flag & EPROC_CTTY ? ' ' : '-');
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
longtname(k, ve)
|
|
|
|
KINFO *k;
|
|
|
|
VARENT *ve;
|
|
|
|
{
|
|
|
|
VAR *v;
|
|
|
|
dev_t dev;
|
|
|
|
char *ttname;
|
|
|
|
|
|
|
|
v = ve->var;
|
|
|
|
dev = KI_EPROC(k)->e_tdev;
|
|
|
|
if (dev == NODEV || (ttname = devname(dev, S_IFCHR)) == NULL)
|
|
|
|
(void)printf("%-*s", v->width, "??");
|
|
|
|
else
|
|
|
|
(void)printf("%-*s", v->width, ttname);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
started(k, ve)
|
|
|
|
KINFO *k;
|
|
|
|
VARENT *ve;
|
|
|
|
{
|
|
|
|
VAR *v;
|
|
|
|
static time_t now;
|
1998-06-28 18:19:13 +00:00
|
|
|
time_t then;
|
1994-05-26 06:18:55 +00:00
|
|
|
struct tm *tp;
|
|
|
|
char buf[100];
|
|
|
|
|
|
|
|
v = ve->var;
|
|
|
|
if (!k->ki_u.u_valid) {
|
|
|
|
(void)printf("%-*s", v->width, "-");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
1998-06-28 18:19:13 +00:00
|
|
|
then = k->ki_u.u_start.tv_sec;
|
|
|
|
tp = localtime(&then);
|
1994-05-26 06:18:55 +00:00
|
|
|
if (!now)
|
|
|
|
(void)time(&now);
|
1995-08-07 19:17:46 +00:00
|
|
|
if (now - k->ki_u.u_start.tv_sec < 24 * 3600) {
|
2000-09-28 02:54:44 +00:00
|
|
|
(void)strftime(buf, sizeof(buf) - 1, "%l:%M%p", tp);
|
1995-08-07 19:17:46 +00:00
|
|
|
} else if (now - k->ki_u.u_start.tv_sec < 7 * 86400) {
|
2000-09-28 02:54:44 +00:00
|
|
|
(void)strftime(buf, sizeof(buf) - 1, "%a%I%p", tp);
|
1994-05-26 06:18:55 +00:00
|
|
|
} else
|
|
|
|
(void)strftime(buf, sizeof(buf) - 1, "%e%b%y", tp);
|
|
|
|
(void)printf("%-*s", v->width, buf);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
lstarted(k, ve)
|
|
|
|
KINFO *k;
|
|
|
|
VARENT *ve;
|
|
|
|
{
|
|
|
|
VAR *v;
|
1998-06-28 18:19:13 +00:00
|
|
|
time_t then;
|
1994-05-26 06:18:55 +00:00
|
|
|
char buf[100];
|
|
|
|
|
|
|
|
v = ve->var;
|
|
|
|
if (!k->ki_u.u_valid) {
|
|
|
|
(void)printf("%-*s", v->width, "-");
|
|
|
|
return;
|
|
|
|
}
|
1998-06-28 18:19:13 +00:00
|
|
|
then = k->ki_u.u_start.tv_sec;
|
|
|
|
(void)strftime(buf, sizeof(buf) -1, "%c", localtime(&then));
|
1994-05-26 06:18:55 +00:00
|
|
|
(void)printf("%-*s", v->width, buf);
|
|
|
|
}
|
|
|
|
|
2000-11-29 21:09:21 +00:00
|
|
|
void
|
|
|
|
mtxname(k, ve)
|
|
|
|
KINFO *k;
|
|
|
|
VARENT *ve;
|
|
|
|
{
|
|
|
|
VAR *v;
|
|
|
|
|
|
|
|
v = ve->var;
|
|
|
|
if (KI_PROC(k)->p_blocked) {
|
|
|
|
if (KI_PROC(k)->p_mtxname)
|
|
|
|
(void)printf("%-*.*s", v->width, v->width,
|
|
|
|
KI_EPROC(k)->e_mtxname);
|
|
|
|
else
|
|
|
|
(void)printf("%-*s", v->width, "???");
|
|
|
|
} else
|
|
|
|
(void)printf("%-*s", v->width, "-");
|
|
|
|
}
|
|
|
|
|
1994-05-26 06:18:55 +00:00
|
|
|
void
|
|
|
|
wchan(k, ve)
|
|
|
|
KINFO *k;
|
|
|
|
VARENT *ve;
|
|
|
|
{
|
|
|
|
VAR *v;
|
|
|
|
|
|
|
|
v = ve->var;
|
|
|
|
if (KI_PROC(k)->p_wchan) {
|
|
|
|
if (KI_PROC(k)->p_wmesg)
|
1995-05-30 00:07:29 +00:00
|
|
|
(void)printf("%-*.*s", v->width, v->width,
|
1994-05-26 06:18:55 +00:00
|
|
|
KI_EPROC(k)->e_wmesg);
|
|
|
|
else
|
1998-09-14 08:32:20 +00:00
|
|
|
(void)printf("%-*lx", v->width,
|
|
|
|
(long)KI_PROC(k)->p_wchan &~ KERNBASE);
|
1994-05-26 06:18:55 +00:00
|
|
|
} else
|
|
|
|
(void)printf("%-*s", v->width, "-");
|
|
|
|
}
|
|
|
|
|
1999-04-06 03:17:57 +00:00
|
|
|
#ifndef pgtok
|
1996-05-02 08:37:16 +00:00
|
|
|
#define pgtok(a) (((a)*getpagesize())/1024)
|
1999-04-06 03:17:57 +00:00
|
|
|
#endif
|
1994-05-26 06:18:55 +00:00
|
|
|
|
|
|
|
void
|
|
|
|
vsize(k, ve)
|
|
|
|
KINFO *k;
|
|
|
|
VARENT *ve;
|
|
|
|
{
|
|
|
|
VAR *v;
|
|
|
|
|
|
|
|
v = ve->var;
|
|
|
|
(void)printf("%*d", v->width,
|
1998-02-02 05:16:42 +00:00
|
|
|
(KI_EPROC(k)->e_vm.vm_map.size/1024));
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
rssize(k, ve)
|
|
|
|
KINFO *k;
|
|
|
|
VARENT *ve;
|
|
|
|
{
|
|
|
|
VAR *v;
|
|
|
|
|
|
|
|
v = ve->var;
|
|
|
|
/* XXX don't have info about shared */
|
1998-06-28 21:05:48 +00:00
|
|
|
(void)printf("%*lu", v->width,
|
|
|
|
(u_long)pgtok(KI_EPROC(k)->e_vm.vm_rssize));
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
p_rssize(k, ve) /* doesn't account for text */
|
|
|
|
KINFO *k;
|
|
|
|
VARENT *ve;
|
|
|
|
{
|
|
|
|
VAR *v;
|
|
|
|
|
|
|
|
v = ve->var;
|
1996-12-14 06:08:03 +00:00
|
|
|
(void)printf("%*ld", v->width, (long)pgtok(KI_EPROC(k)->e_vm.vm_rssize));
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
cputime(k, ve)
|
|
|
|
KINFO *k;
|
|
|
|
VARENT *ve;
|
|
|
|
{
|
|
|
|
VAR *v;
|
|
|
|
long secs;
|
|
|
|
long psecs; /* "parts" of a second. first micro, then centi */
|
|
|
|
char obuff[128];
|
|
|
|
|
|
|
|
v = ve->var;
|
|
|
|
if (KI_PROC(k)->p_stat == SZOMB || !k->ki_u.u_valid) {
|
1998-05-31 12:09:50 +00:00
|
|
|
secs = 0;
|
|
|
|
psecs = 0;
|
1994-05-26 06:18:55 +00:00
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* This counts time spent handling interrupts. We could
|
|
|
|
* fix this, but it is not 100% trivial (and interrupt
|
|
|
|
* time fractions only work on the sparc anyway). XXX
|
|
|
|
*/
|
1998-05-31 12:09:50 +00:00
|
|
|
secs = KI_PROC(k)->p_runtime / 1000000;
|
|
|
|
psecs = KI_PROC(k)->p_runtime % 1000000;
|
1994-05-26 06:18:55 +00:00
|
|
|
if (sumrusage) {
|
1998-05-31 12:09:50 +00:00
|
|
|
secs += k->ki_u.u_cru.ru_utime.tv_sec +
|
|
|
|
k->ki_u.u_cru.ru_stime.tv_sec;
|
|
|
|
psecs += k->ki_u.u_cru.ru_utime.tv_usec +
|
1994-05-26 06:18:55 +00:00
|
|
|
k->ki_u.u_cru.ru_stime.tv_usec;
|
|
|
|
}
|
1998-05-31 12:09:50 +00:00
|
|
|
/*
|
|
|
|
* round and scale to 100's
|
|
|
|
*/
|
|
|
|
psecs = (psecs + 5000) / 10000;
|
|
|
|
secs += psecs / 100;
|
|
|
|
psecs = psecs % 100;
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
|
|
|
(void)snprintf(obuff, sizeof(obuff),
|
|
|
|
"%3ld:%02ld.%02ld", secs/60, secs%60, psecs);
|
|
|
|
(void)printf("%*s", v->width, obuff);
|
|
|
|
}
|
|
|
|
|
|
|
|
double
|
|
|
|
getpcpu(k)
|
|
|
|
KINFO *k;
|
|
|
|
{
|
|
|
|
struct proc *p;
|
|
|
|
static int failure;
|
|
|
|
|
|
|
|
if (!nlistread)
|
|
|
|
failure = donlist();
|
|
|
|
if (failure)
|
|
|
|
return (0.0);
|
|
|
|
|
|
|
|
p = KI_PROC(k);
|
|
|
|
#define fxtofl(fixpt) ((double)(fixpt) / fscale)
|
|
|
|
|
|
|
|
/* XXX - I don't like this */
|
|
|
|
if (p->p_swtime == 0 || (p->p_flag & P_INMEM) == 0)
|
|
|
|
return (0.0);
|
|
|
|
if (rawcpu)
|
1998-11-25 09:34:00 +00:00
|
|
|
return (100.0 * fxtofl(p->p_pctcpu));
|
|
|
|
return (100.0 * fxtofl(p->p_pctcpu) /
|
1994-05-26 06:18:55 +00:00
|
|
|
(1.0 - exp(p->p_swtime * log(fxtofl(ccpu)))));
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
pcpu(k, ve)
|
|
|
|
KINFO *k;
|
|
|
|
VARENT *ve;
|
|
|
|
{
|
|
|
|
VAR *v;
|
|
|
|
|
|
|
|
v = ve->var;
|
|
|
|
(void)printf("%*.1f", v->width, getpcpu(k));
|
|
|
|
}
|
|
|
|
|
|
|
|
double
|
|
|
|
getpmem(k)
|
|
|
|
KINFO *k;
|
|
|
|
{
|
|
|
|
static int failure;
|
|
|
|
struct proc *p;
|
|
|
|
struct eproc *e;
|
|
|
|
double fracmem;
|
|
|
|
int szptudot;
|
|
|
|
|
|
|
|
if (!nlistread)
|
|
|
|
failure = donlist();
|
|
|
|
if (failure)
|
|
|
|
return (0.0);
|
|
|
|
|
|
|
|
p = KI_PROC(k);
|
|
|
|
e = KI_EPROC(k);
|
|
|
|
if ((p->p_flag & P_INMEM) == 0)
|
|
|
|
return (0.0);
|
|
|
|
/* XXX want pmap ptpages, segtab, etc. (per architecture) */
|
|
|
|
szptudot = UPAGES;
|
|
|
|
/* XXX don't have info about shared */
|
1996-06-29 08:04:05 +00:00
|
|
|
fracmem = ((float)e->e_vm.vm_rssize + szptudot)/mempages;
|
1994-05-26 06:18:55 +00:00
|
|
|
return (100.0 * fracmem);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
pmem(k, ve)
|
|
|
|
KINFO *k;
|
|
|
|
VARENT *ve;
|
|
|
|
{
|
|
|
|
VAR *v;
|
|
|
|
|
|
|
|
v = ve->var;
|
|
|
|
(void)printf("%*.1f", v->width, getpmem(k));
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
pagein(k, ve)
|
|
|
|
KINFO *k;
|
|
|
|
VARENT *ve;
|
|
|
|
{
|
|
|
|
VAR *v;
|
|
|
|
|
|
|
|
v = ve->var;
|
1995-05-30 00:07:29 +00:00
|
|
|
(void)printf("%*ld", v->width,
|
1994-05-26 06:18:55 +00:00
|
|
|
k->ki_u.u_valid ? k->ki_u.u_ru.ru_majflt : 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
maxrss(k, ve)
|
|
|
|
KINFO *k;
|
|
|
|
VARENT *ve;
|
|
|
|
{
|
|
|
|
VAR *v;
|
|
|
|
|
|
|
|
v = ve->var;
|
1997-08-03 08:25:01 +00:00
|
|
|
/* XXX not yet */
|
|
|
|
(void)printf("%*s", v->width, "-");
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
tsize(k, ve)
|
|
|
|
KINFO *k;
|
|
|
|
VARENT *ve;
|
|
|
|
{
|
|
|
|
VAR *v;
|
|
|
|
|
|
|
|
v = ve->var;
|
1996-12-14 06:08:03 +00:00
|
|
|
(void)printf("%*ld", v->width, (long)pgtok(KI_EPROC(k)->e_vm.vm_tsize));
|
1994-05-26 06:18:55 +00:00
|
|
|
}
|
|
|
|
|
1998-05-25 05:07:18 +00:00
|
|
|
void
|
|
|
|
rtprior(k, ve)
|
|
|
|
KINFO *k;
|
|
|
|
VARENT *ve;
|
|
|
|
{
|
|
|
|
VAR *v;
|
|
|
|
struct rtprio *prtp;
|
|
|
|
char str[8];
|
|
|
|
unsigned prio, type;
|
|
|
|
|
|
|
|
v = ve->var;
|
|
|
|
prtp = (struct rtprio *) ((char *)KI_PROC(k) + v->off);
|
|
|
|
prio = prtp->prio;
|
|
|
|
type = prtp->type;
|
|
|
|
switch (type) {
|
|
|
|
case RTP_PRIO_REALTIME:
|
|
|
|
snprintf(str, sizeof(str), "real:%u", prio);
|
|
|
|
break;
|
|
|
|
case RTP_PRIO_NORMAL:
|
|
|
|
strncpy(str, "normal", sizeof(str));
|
|
|
|
break;
|
|
|
|
case RTP_PRIO_IDLE:
|
|
|
|
snprintf(str, sizeof(str), "idle:%u", prio);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
snprintf(str, sizeof(str), "%u:%u", type, prio);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
str[sizeof(str) - 1] = '\0';
|
|
|
|
(void)printf("%*s", v->width, str);
|
|
|
|
}
|
|
|
|
|
1994-05-26 06:18:55 +00:00
|
|
|
/*
|
|
|
|
* Generic output routines. Print fields from various prototype
|
|
|
|
* structures.
|
|
|
|
*/
|
|
|
|
static void
|
|
|
|
printval(bp, v)
|
|
|
|
char *bp;
|
|
|
|
VAR *v;
|
|
|
|
{
|
|
|
|
static char ofmt[32] = "%";
|
|
|
|
char *fcp, *cp;
|
|
|
|
|
|
|
|
cp = ofmt + 1;
|
|
|
|
fcp = v->fmt;
|
|
|
|
if (v->flag & LJUST)
|
|
|
|
*cp++ = '-';
|
|
|
|
*cp++ = '*';
|
1995-03-19 13:29:28 +00:00
|
|
|
while ((*cp++ = *fcp++));
|
1994-05-26 06:18:55 +00:00
|
|
|
|
|
|
|
switch (v->type) {
|
|
|
|
case CHAR:
|
|
|
|
(void)printf(ofmt, v->width, *(char *)bp);
|
|
|
|
break;
|
|
|
|
case UCHAR:
|
|
|
|
(void)printf(ofmt, v->width, *(u_char *)bp);
|
|
|
|
break;
|
|
|
|
case SHORT:
|
|
|
|
(void)printf(ofmt, v->width, *(short *)bp);
|
|
|
|
break;
|
|
|
|
case USHORT:
|
|
|
|
(void)printf(ofmt, v->width, *(u_short *)bp);
|
|
|
|
break;
|
1998-09-14 08:32:20 +00:00
|
|
|
case INT:
|
|
|
|
(void)printf(ofmt, v->width, *(int *)bp);
|
|
|
|
break;
|
|
|
|
case UINT:
|
|
|
|
(void)printf(ofmt, v->width, *(u_int *)bp);
|
|
|
|
break;
|
1994-05-26 06:18:55 +00:00
|
|
|
case LONG:
|
|
|
|
(void)printf(ofmt, v->width, *(long *)bp);
|
|
|
|
break;
|
|
|
|
case ULONG:
|
|
|
|
(void)printf(ofmt, v->width, *(u_long *)bp);
|
|
|
|
break;
|
|
|
|
case KPTR:
|
|
|
|
(void)printf(ofmt, v->width, *(u_long *)bp &~ KERNBASE);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
errx(1, "unknown type %d", v->type);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
pvar(k, ve)
|
|
|
|
KINFO *k;
|
|
|
|
VARENT *ve;
|
|
|
|
{
|
|
|
|
VAR *v;
|
|
|
|
|
|
|
|
v = ve->var;
|
|
|
|
printval((char *)((char *)KI_PROC(k) + v->off), v);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
evar(k, ve)
|
|
|
|
KINFO *k;
|
|
|
|
VARENT *ve;
|
|
|
|
{
|
|
|
|
VAR *v;
|
|
|
|
|
|
|
|
v = ve->var;
|
|
|
|
printval((char *)((char *)KI_EPROC(k) + v->off), v);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
uvar(k, ve)
|
|
|
|
KINFO *k;
|
|
|
|
VARENT *ve;
|
|
|
|
{
|
|
|
|
VAR *v;
|
|
|
|
|
|
|
|
v = ve->var;
|
|
|
|
if (k->ki_u.u_valid)
|
|
|
|
printval((char *)((char *)&k->ki_u + v->off), v);
|
|
|
|
else
|
|
|
|
(void)printf("%*s", v->width, "-");
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
rvar(k, ve)
|
|
|
|
KINFO *k;
|
|
|
|
VARENT *ve;
|
|
|
|
{
|
|
|
|
VAR *v;
|
|
|
|
|
|
|
|
v = ve->var;
|
|
|
|
if (k->ki_u.u_valid)
|
|
|
|
printval((char *)((char *)(&k->ki_u.u_ru) + v->off), v);
|
|
|
|
else
|
|
|
|
(void)printf("%*s", v->width, "-");
|
|
|
|
}
|