freebsd-dev/bin/ps/print.c

909 lines
17 KiB
C
Raw Normal View History

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.
* 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.
*/
1998-05-15 06:30:58 +00:00
#if 0
#ifndef lint
1998-05-15 06:30:58 +00:00
static char sccsid[] = "@(#)print.c 8.6 (Berkeley) 4/16/94";
1994-05-26 06:18:55 +00:00
#endif /* not lint */
#endif
2002-06-30 05:15:05 +00:00
#include <sys/cdefs.h>
__FBSDID("$FreeBSD$");
1994-05-26 06:18:55 +00:00
#include <sys/param.h>
#include <sys/time.h>
#include <sys/resource.h>
#include <sys/proc.h>
#include <sys/stat.h>
#include <sys/mac.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 <sys/vmmeter.h>
1994-05-26 06:18:55 +00:00
#include <err.h>
#include <grp.h>
#include <langinfo.h>
2001-02-11 02:25:56 +00:00
#include <locale.h>
1994-05-26 06:18:55 +00:00
#include <math.h>
#include <nlist.h>
#include <pwd.h>
1994-05-26 06:18:55 +00:00
#include <stddef.h>
#include <stdint.h>
1994-05-26 06:18:55 +00:00
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
1994-05-26 06:18:55 +00:00
#include <vis.h>
#include "ps.h"
#define COMMAND_WIDTH 16
#define ARGUMENTS_WIDTH 16
#define ps_pgtok(a) (((a) * getpagesize()) / 1024)
1994-05-26 06:18:55 +00:00
void
printheader(void)
1994-05-26 06:18:55 +00:00
{
VAR *v;
struct varent *vent;
STAILQ_FOREACH(vent, &varlist, next_ve)
if (*vent->header != '\0')
break;
if (!vent)
return;
STAILQ_FOREACH(vent, &varlist, next_ve) {
1994-05-26 06:18:55 +00:00
v = vent->var;
if (v->flag & LJUST) {
if (STAILQ_NEXT(vent, next_ve) == NULL) /* last one */
(void)printf("%s", vent->header);
1994-05-26 06:18:55 +00:00
else
(void)printf("%-*s", v->width, vent->header);
1994-05-26 06:18:55 +00:00
} else
(void)printf("%*s", v->width, vent->header);
if (STAILQ_NEXT(vent, next_ve) != NULL)
1994-05-26 06:18:55 +00:00
(void)putchar(' ');
}
(void)putchar('\n');
}
char *
arguments(KINFO *k, VARENT *ve)
{
VAR *v;
char *vis_args;
v = ve->var;
if ((vis_args = malloc(strlen(k->ki_args) * 4 + 1)) == NULL)
errx(1, "malloc failed");
strvis(vis_args, k->ki_args, VIS_TAB | VIS_NL | VIS_NOSLASH);
if (STAILQ_NEXT(ve, next_ve) != NULL && strlen(vis_args) > ARGUMENTS_WIDTH)
vis_args[ARGUMENTS_WIDTH] = '\0';
return (vis_args);
}
char *
command(KINFO *k, VARENT *ve)
1994-05-26 06:18:55 +00:00
{
VAR *v;
char *vis_args, *vis_env, *str;
1994-05-26 06:18:55 +00:00
v = ve->var;
if (cflag) {
/* If it is the last field, then don't pad */
if (STAILQ_NEXT(ve, next_ve) == NULL) {
asprintf(&str, "%s%s%s%s",
k->ki_d.prefix ? k->ki_d.prefix : "",
k->ki_p->ki_comm,
(showthreads && k->ki_p->ki_numthreads > 1) ? "/" : "",
(showthreads && k->ki_p->ki_numthreads > 1) ? k->ki_p->ki_tdname : "");
} else
str = strdup(k->ki_p->ki_comm);
return (str);
}
1994-05-26 06:18:55 +00:00
if ((vis_args = malloc(strlen(k->ki_args) * 4 + 1)) == NULL)
errx(1, "malloc failed");
1994-05-26 06:18:55 +00:00
strvis(vis_args, k->ki_args, VIS_TAB | VIS_NL | VIS_NOSLASH);
if (STAILQ_NEXT(ve, next_ve) == NULL) {
1994-05-26 06:18:55 +00:00
/* last field */
if (k->ki_env) {
if ((vis_env = malloc(strlen(k->ki_env) * 4 + 1))
== NULL)
errx(1, "malloc failed");
strvis(vis_env, k->ki_env,
VIS_TAB | VIS_NL | VIS_NOSLASH);
} else
vis_env = NULL;
asprintf(&str, "%s%s%s%s",
k->ki_d.prefix ? k->ki_d.prefix : "",
vis_env ? vis_env : "",
vis_env ? " " : "",
vis_args);
if (vis_env != NULL)
free(vis_env);
free(vis_args);
} else {
/* ki_d.prefix & ki_env aren't shown for interim fields */
str = vis_args;
if (strlen(str) > COMMAND_WIDTH)
str[COMMAND_WIDTH] = '\0';
}
return (str);
1994-05-26 06:18:55 +00:00
}
char *
ucomm(KINFO *k, VARENT *ve)
1994-05-26 06:18:55 +00:00
{
VAR *v;
char *str;
1994-05-26 06:18:55 +00:00
v = ve->var;
if (STAILQ_NEXT(ve, next_ve) == NULL) { /* last field, don't pad */
asprintf(&str, "%s%s%s%s",
k->ki_d.prefix ? k->ki_d.prefix : "",
k->ki_p->ki_comm,
(showthreads && k->ki_p->ki_numthreads > 1) ? "/" : "",
(showthreads && k->ki_p->ki_numthreads > 1) ? k->ki_p->ki_tdname : "");
} else {
if (showthreads && k->ki_p->ki_numthreads > 1)
asprintf(&str, "%s/%s", k->ki_p->ki_comm, k->ki_p->ki_tdname);
else
str = strdup(k->ki_p->ki_comm);
}
return (str);
1994-05-26 06:18:55 +00:00
}
char *
tdnam(KINFO *k, VARENT *ve)
{
VAR *v;
char *str;
v = ve->var;
if (showthreads && k->ki_p->ki_numthreads > 1)
str = strdup(k->ki_p->ki_tdname);
2008-11-13 15:06:34 +00:00
else
str = strdup(" ");
return (str);
}
char *
logname(KINFO *k, VARENT *ve)
1994-05-26 06:18:55 +00:00
{
VAR *v;
v = ve->var;
if (*k->ki_p->ki_login == '\0')
return (NULL);
return (strdup(k->ki_p->ki_login));
1994-05-26 06:18:55 +00:00
}
char *
state(KINFO *k, VARENT *ve)
1994-05-26 06:18:55 +00:00
{
int flag, tdflags;
char *cp, *buf;
1994-05-26 06:18:55 +00:00
VAR *v;
buf = malloc(16);
if (buf == NULL)
errx(1, "malloc failed");
1994-05-26 06:18:55 +00:00
v = ve->var;
flag = k->ki_p->ki_flag;
tdflags = k->ki_p->ki_tdflags; /* XXXKSE */
1994-05-26 06:18:55 +00:00
cp = buf;
switch (k->ki_p->ki_stat) {
1994-05-26 06:18:55 +00:00
case SSTOP:
*cp = 'T';
break;
case SSLEEP:
if (tdflags & TDF_SINTR) /* interruptable (long) */
*cp = k->ki_p->ki_slptime >= MAXSLP ? 'I' : 'S';
1994-05-26 06:18:55 +00:00
else
*cp = 'D';
break;
case SRUN:
case SIDL:
*cp = 'R';
break;
case SWAIT:
*cp = 'W';
break;
2002-10-02 20:33:52 +00:00
case SLOCK:
*cp = 'L';
break;
1994-05-26 06:18:55 +00:00
case SZOMB:
*cp = 'Z';
break;
default:
*cp = '?';
}
cp++;
if (!(flag & P_INMEM))
1994-05-26 06:18:55 +00:00
*cp++ = 'W';
if (k->ki_p->ki_nice < NZERO)
1994-05-26 06:18:55 +00:00
*cp++ = '<';
else if (k->ki_p->ki_nice > NZERO)
1994-05-26 06:18:55 +00:00
*cp++ = 'N';
if (flag & P_TRACED)
*cp++ = 'X';
if (flag & P_WEXIT && k->ki_p->ki_stat != SZOMB)
1994-05-26 06:18:55 +00:00
*cp++ = 'E';
if (flag & P_PPWAIT)
*cp++ = 'V';
if ((flag & P_SYSTEM) || k->ki_p->ki_lock > 0)
1994-05-26 06:18:55 +00:00
*cp++ = 'L';
if (k->ki_p->ki_kiflag & KI_SLEADER)
1994-05-26 06:18:55 +00:00
*cp++ = 's';
if ((flag & P_CONTROLT) && k->ki_p->ki_pgid == k->ki_p->ki_tpgid)
1994-05-26 06:18:55 +00:00
*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';
return (buf);
1994-05-26 06:18:55 +00:00
}
#define scalepri(x) ((x) - PZERO)
char *
pri(KINFO *k, VARENT *ve)
1994-05-26 06:18:55 +00:00
{
VAR *v;
char *str;
1994-05-26 06:18:55 +00:00
v = ve->var;
asprintf(&str, "%d", scalepri(k->ki_p->ki_pri.pri_level));
return (str);
}
char *
upr(KINFO *k, VARENT *ve)
{
VAR *v;
char *str;
v = ve->var;
asprintf(&str, "%d", scalepri(k->ki_p->ki_pri.pri_user));
return (str);
1994-05-26 06:18:55 +00:00
}
#undef scalepri
1994-05-26 06:18:55 +00:00
char *
uname(KINFO *k, VARENT *ve)
1994-05-26 06:18:55 +00:00
{
VAR *v;
v = ve->var;
return (strdup(user_from_uid(k->ki_p->ki_uid, 0)));
1994-05-26 06:18:55 +00:00
}
char *
egroupname(KINFO *k, VARENT *ve)
{
VAR *v;
v = ve->var;
return (strdup(group_from_gid(k->ki_p->ki_groups[0], 0)));
}
char *
rgroupname(KINFO *k, VARENT *ve)
{
VAR *v;
v = ve->var;
return (strdup(group_from_gid(k->ki_p->ki_rgid, 0)));
}
char *
runame(KINFO *k, VARENT *ve)
1994-05-26 06:18:55 +00:00
{
VAR *v;
v = ve->var;
return (strdup(user_from_uid(k->ki_p->ki_ruid, 0)));
}
char *
tdev(KINFO *k, VARENT *ve)
1994-05-26 06:18:55 +00:00
{
VAR *v;
dev_t dev;
char *str;
1994-05-26 06:18:55 +00:00
v = ve->var;
dev = k->ki_p->ki_tdev;
1994-05-26 06:18:55 +00:00
if (dev == NODEV)
str = strdup("-");
else
asprintf(&str, "%#jx", (uintmax_t)dev);
return (str);
1994-05-26 06:18:55 +00:00
}
char *
tname(KINFO *k, VARENT *ve)
1994-05-26 06:18:55 +00:00
{
VAR *v;
dev_t dev;
char *ttname, *str;
1994-05-26 06:18:55 +00:00
v = ve->var;
dev = k->ki_p->ki_tdev;
1994-05-26 06:18:55 +00:00
if (dev == NODEV || (ttname = devname(dev, S_IFCHR)) == NULL)
str = strdup("- ");
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;
if (strncmp(ttname, "pts/", 4) == 0)
ttname += 4;
asprintf(&str, "%s%c", ttname,
k->ki_p->ki_kiflag & KI_CTTY ? ' ' : '-');
1994-05-26 06:18:55 +00:00
}
return (str);
1994-05-26 06:18:55 +00:00
}
char *
longtname(KINFO *k, VARENT *ve)
1994-05-26 06:18:55 +00:00
{
VAR *v;
dev_t dev;
const char *ttname;
1994-05-26 06:18:55 +00:00
v = ve->var;
dev = k->ki_p->ki_tdev;
1994-05-26 06:18:55 +00:00
if (dev == NODEV || (ttname = devname(dev, S_IFCHR)) == NULL)
ttname = "-";
return (strdup(ttname));
1994-05-26 06:18:55 +00:00
}
char *
started(KINFO *k, VARENT *ve)
1994-05-26 06:18:55 +00:00
{
VAR *v;
1998-06-28 18:19:13 +00:00
time_t then;
1994-05-26 06:18:55 +00:00
struct tm *tp;
static int use_ampm = -1;
size_t buflen = 100;
char *buf;
buf = malloc(buflen);
if (buf == NULL)
errx(1, "malloc failed");
1994-05-26 06:18:55 +00:00
v = ve->var;
if (!k->ki_valid)
return (NULL);
if (use_ampm < 0)
use_ampm = (*nl_langinfo(T_FMT_AMPM) != '\0');
then = k->ki_p->ki_start.tv_sec;
1998-06-28 18:19:13 +00:00
tp = localtime(&then);
if (now - k->ki_p->ki_start.tv_sec < 24 * 3600) {
(void)strftime(buf, buflen,
use_ampm ? "%l:%M%p" : "%k:%M ", tp);
} else if (now - k->ki_p->ki_start.tv_sec < 7 * 86400) {
(void)strftime(buf, buflen,
use_ampm ? "%a%I%p" : "%a%H ", tp);
1994-05-26 06:18:55 +00:00
} else
(void)strftime(buf, buflen, "%e%b%y", tp);
return (buf);
1994-05-26 06:18:55 +00:00
}
char *
lstarted(KINFO *k, VARENT *ve)
1994-05-26 06:18:55 +00:00
{
VAR *v;
1998-06-28 18:19:13 +00:00
time_t then;
char *buf;
size_t buflen = 100;
buf = malloc(buflen);
if (buf == NULL)
errx(1, "malloc failed");
1994-05-26 06:18:55 +00:00
v = ve->var;
if (!k->ki_valid)
return (NULL);
then = k->ki_p->ki_start.tv_sec;
(void)strftime(buf, buflen, "%c", localtime(&then));
return (buf);
1994-05-26 06:18:55 +00:00
}
char *
2002-10-02 20:33:52 +00:00
lockname(KINFO *k, VARENT *ve)
{
VAR *v;
char *str;
v = ve->var;
2002-10-02 20:33:52 +00:00
if (k->ki_p->ki_kiflag & KI_LOCKBLOCK) {
if (k->ki_p->ki_lockname[0] != 0)
str = strdup(k->ki_p->ki_lockname);
else
str = strdup("???");
} else
str = NULL;
return (str);
}
char *
wchan(KINFO *k, VARENT *ve)
1994-05-26 06:18:55 +00:00
{
VAR *v;
char *str;
1994-05-26 06:18:55 +00:00
v = ve->var;
if (k->ki_p->ki_wchan) {
if (k->ki_p->ki_wmesg[0] != 0)
str = strdup(k->ki_p->ki_wmesg);
else
asprintf(&str, "%lx", (long)k->ki_p->ki_wchan);
} else
str = NULL;
return (str);
}
char *
nwchan(KINFO *k, VARENT *ve)
{
VAR *v;
char *str;
v = ve->var;
if (k->ki_p->ki_wchan)
asprintf(&str, "%0lx", (long)k->ki_p->ki_wchan);
else
str = NULL;
return (str);
}
char *
mwchan(KINFO *k, VARENT *ve)
{
VAR *v;
char *str;
1994-05-26 06:18:55 +00:00
v = ve->var;
if (k->ki_p->ki_wchan) {
if (k->ki_p->ki_wmesg[0] != 0)
str = strdup(k->ki_p->ki_wmesg);
1994-05-26 06:18:55 +00:00
else
asprintf(&str, "%lx", (long)k->ki_p->ki_wchan);
2002-10-02 20:33:52 +00:00
} else if (k->ki_p->ki_kiflag & KI_LOCKBLOCK) {
if (k->ki_p->ki_lockname[0]) {
str = strdup(k->ki_p->ki_lockname);
} else
str = strdup("???");
} else
str = NULL;
return (str);
1994-05-26 06:18:55 +00:00
}
char *
vsize(KINFO *k, VARENT *ve)
1994-05-26 06:18:55 +00:00
{
VAR *v;
char *str;
1994-05-26 06:18:55 +00:00
v = ve->var;
asprintf(&str, "%lu", (u_long)(k->ki_p->ki_size / 1024));
return (str);
1994-05-26 06:18:55 +00:00
}
static char *
printtime(KINFO *k, VARENT *ve, long secs, long psecs)
/* psecs is "parts" of a second. first micro, then centi */
1994-05-26 06:18:55 +00:00
{
VAR *v;
static char decimal_point;
char *str;
1994-05-26 06:18:55 +00:00
if (decimal_point == '\0')
2001-02-11 02:25:56 +00:00
decimal_point = localeconv()->decimal_point[0];
1994-05-26 06:18:55 +00:00
v = ve->var;
if (!k->ki_valid) {
secs = 0;
psecs = 0;
1994-05-26 06:18:55 +00:00
} else {
/* round and scale to 100's */
psecs = (psecs + 5000) / 10000;
secs += psecs / 100;
psecs = psecs % 100;
1994-05-26 06:18:55 +00:00
}
asprintf(&str, "%ld:%02ld%c%02ld",
secs / 60, secs % 60, decimal_point, psecs);
return (str);
}
char *
cputime(KINFO *k, VARENT *ve)
{
long secs, psecs;
/*
* 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
*/
secs = k->ki_p->ki_runtime / 1000000;
psecs = k->ki_p->ki_runtime % 1000000;
if (sumrusage) {
secs += k->ki_p->ki_childtime.tv_sec;
psecs += k->ki_p->ki_childtime.tv_usec;
}
return (printtime(k, ve, secs, psecs));
}
char *
systime(KINFO *k, VARENT *ve)
{
long secs, psecs;
secs = k->ki_p->ki_rusage.ru_stime.tv_sec;
psecs = k->ki_p->ki_rusage.ru_stime.tv_usec;
if (sumrusage) {
secs += k->ki_p->ki_childstime.tv_sec;
psecs += k->ki_p->ki_childstime.tv_usec;
}
return (printtime(k, ve, secs, psecs));
}
char *
usertime(KINFO *k, VARENT *ve)
{
long secs, psecs;
secs = k->ki_p->ki_rusage.ru_utime.tv_sec;
psecs = k->ki_p->ki_rusage.ru_utime.tv_usec;
if (sumrusage) {
secs += k->ki_p->ki_childutime.tv_sec;
psecs += k->ki_p->ki_childutime.tv_usec;
}
return (printtime(k, ve, secs, psecs));
}
char *
elapsed(KINFO *k, VARENT *ve)
{
VAR *v;
time_t val;
int days, hours, mins, secs;
char *str;
v = ve->var;
if (!k->ki_valid)
return (NULL);
val = now - k->ki_p->ki_start.tv_sec;
days = val / (24 * 60 * 60);
val %= 24 * 60 * 60;
hours = val / (60 * 60);
val %= 60 * 60;
mins = val / 60;
secs = val % 60;
if (days != 0)
asprintf(&str, "%3d-%02d:%02d:%02d", days, hours, mins, secs);
else if (hours != 0)
asprintf(&str, "%02d:%02d:%02d", hours, mins, secs);
else
asprintf(&str, "%02d:%02d", mins, secs);
return (str);
}
char *
elapseds(KINFO *k, VARENT *ve)
{
VAR *v;
time_t val;
char *str;
v = ve->var;
if (!k->ki_valid)
return (NULL);
val = now - k->ki_p->ki_start.tv_sec;
asprintf(&str, "%jd", (intmax_t)val);
return (str);
}
1994-05-26 06:18:55 +00:00
double
getpcpu(const KINFO *k)
1994-05-26 06:18:55 +00:00
{
static int failure;
if (!nlistread)
failure = donlist();
if (failure)
return (0.0);
#define fxtofl(fixpt) ((double)(fixpt) / fscale)
/* XXX - I don't like this */
if (k->ki_p->ki_swtime == 0 || (k->ki_p->ki_flag & P_INMEM) == 0)
1994-05-26 06:18:55 +00:00
return (0.0);
if (rawcpu)
return (100.0 * fxtofl(k->ki_p->ki_pctcpu));
return (100.0 * fxtofl(k->ki_p->ki_pctcpu) /
(1.0 - exp(k->ki_p->ki_swtime * log(fxtofl(ccpu)))));
1994-05-26 06:18:55 +00:00
}
char *
pcpu(KINFO *k, VARENT *ve)
1994-05-26 06:18:55 +00:00
{
VAR *v;
char *str;
1994-05-26 06:18:55 +00:00
v = ve->var;
asprintf(&str, "%.1f", getpcpu(k));
return (str);
1994-05-26 06:18:55 +00:00
}
static double
getpmem(KINFO *k)
1994-05-26 06:18:55 +00:00
{
static int failure;
double fracmem;
if (!nlistread)
failure = donlist();
if (failure)
return (0.0);
if ((k->ki_p->ki_flag & P_INMEM) == 0)
1994-05-26 06:18:55 +00:00
return (0.0);
/* XXX want pmap ptpages, segtab, etc. (per architecture) */
/* XXX don't have info about shared */
fracmem = ((float)k->ki_p->ki_rssize) / mempages;
1994-05-26 06:18:55 +00:00
return (100.0 * fracmem);
}
char *
pmem(KINFO *k, VARENT *ve)
1994-05-26 06:18:55 +00:00
{
VAR *v;
char *str;
1994-05-26 06:18:55 +00:00
v = ve->var;
asprintf(&str, "%.1f", getpmem(k));
return (str);
1994-05-26 06:18:55 +00:00
}
char *
pagein(KINFO *k, VARENT *ve)
1994-05-26 06:18:55 +00:00
{
VAR *v;
char *str;
1994-05-26 06:18:55 +00:00
v = ve->var;
asprintf(&str, "%ld", k->ki_valid ? k->ki_p->ki_rusage.ru_majflt : 0);
return (str);
1994-05-26 06:18:55 +00:00
}
/* ARGSUSED */
char *
maxrss(KINFO *k __unused, VARENT *ve)
1994-05-26 06:18:55 +00:00
{
VAR *v;
v = ve->var;
/* XXX not yet */
return (NULL);
1994-05-26 06:18:55 +00:00
}
char *
priorityr(KINFO *k, VARENT *ve)
{
VAR *v;
struct priority *lpri;
char *str;
2001-02-12 00:21:38 +00:00
unsigned class, level;
v = ve->var;
lpri = &k->ki_p->ki_pri;
class = lpri->pri_class;
level = lpri->pri_level;
2001-02-12 00:21:38 +00:00
switch (class) {
case PRI_ITHD:
asprintf(&str, "intr:%u", level);
break;
2001-02-12 00:21:38 +00:00
case PRI_REALTIME:
asprintf(&str, "real:%u", level);
break;
2001-02-12 00:21:38 +00:00
case PRI_TIMESHARE:
asprintf(&str, "normal");
break;
2001-02-12 00:21:38 +00:00
case PRI_IDLE:
asprintf(&str, "idle:%u", level);
break;
default:
asprintf(&str, "%u:%u", class, level);
break;
}
return (str);
}
1994-05-26 06:18:55 +00:00
/*
* Generic output routines. Print fields from various prototype
* structures.
*/
static char *
printval(void *bp, VAR *v)
1994-05-26 06:18:55 +00:00
{
static char ofmt[32] = "%";
const char *fcp;
char *cp, *str;
1994-05-26 06:18:55 +00:00
cp = ofmt + 1;
fcp = v->fmt;
while ((*cp++ = *fcp++));
1994-05-26 06:18:55 +00:00
#define CHKINF127(n) (((n) > 127) && (v->flag & INF127) ? 127 : (n))
1994-05-26 06:18:55 +00:00
switch (v->type) {
case CHAR:
(void)asprintf(&str, ofmt, *(char *)bp);
1994-05-26 06:18:55 +00:00
break;
case UCHAR:
(void)asprintf(&str, ofmt, *(u_char *)bp);
1994-05-26 06:18:55 +00:00
break;
case SHORT:
(void)asprintf(&str, ofmt, *(short *)bp);
1994-05-26 06:18:55 +00:00
break;
case USHORT:
(void)asprintf(&str, ofmt, *(u_short *)bp);
1994-05-26 06:18:55 +00:00
break;
case INT:
(void)asprintf(&str, ofmt, *(int *)bp);
break;
case UINT:
(void)asprintf(&str, ofmt, CHKINF127(*(u_int *)bp));
break;
1994-05-26 06:18:55 +00:00
case LONG:
(void)asprintf(&str, ofmt, *(long *)bp);
1994-05-26 06:18:55 +00:00
break;
case ULONG:
(void)asprintf(&str, ofmt, *(u_long *)bp);
1994-05-26 06:18:55 +00:00
break;
case KPTR:
(void)asprintf(&str, ofmt, *(u_long *)bp);
1994-05-26 06:18:55 +00:00
break;
case PGTOK:
(void)asprintf(&str, ofmt, ps_pgtok(*(u_long *)bp));
break;
1994-05-26 06:18:55 +00:00
default:
errx(1, "unknown type %d", v->type);
}
return (str);
1994-05-26 06:18:55 +00:00
}
char *
kvar(KINFO *k, VARENT *ve)
1994-05-26 06:18:55 +00:00
{
VAR *v;
v = ve->var;
return (printval((char *)((char *)k->ki_p + v->off), v));
1994-05-26 06:18:55 +00:00
}
char *
rvar(KINFO *k, VARENT *ve)
1994-05-26 06:18:55 +00:00
{
VAR *v;
v = ve->var;
if (!k->ki_valid)
return (NULL);
return (printval((char *)((char *)(&k->ki_p->ki_rusage) + v->off), v));
1994-05-26 06:18:55 +00:00
}
char *
emulname(KINFO *k, VARENT *ve)
{
VAR *v;
v = ve->var;
if (k->ki_p->ki_emul == NULL)
return (NULL);
return (strdup(k->ki_p->ki_emul));
}
char *
label(KINFO *k, VARENT *ve)
{
char *string;
VAR *v;
mac_t proclabel;
int error;
v = ve->var;
string = NULL;
if (mac_prepare_process_label(&proclabel) == -1) {
2004-07-20 05:52:00 +00:00
warn("mac_prepare_process_label");
goto out;
}
error = mac_get_pid(k->ki_p->ki_pid, proclabel);
if (error == 0) {
if (mac_to_text(proclabel, &string) == -1)
string = NULL;
}
mac_free(proclabel);
out:
return (string);
}
char *
loginclass(KINFO *k, VARENT *ve)
{
VAR *v;
char *s;
v = ve->var;
/*
* Don't display login class for system processes;
* login classes are used for resource limits,
* and limits don't apply to system processes.
*/
if (k->ki_p->ki_flag & P_SYSTEM) {
return (strdup("-"));
}
s = k->ki_p->ki_loginclass;
if (s == NULL)
return (NULL);
return (strdup(s));
}