1997-03-23 18:55:20 +00:00
|
|
|
/*
|
|
|
|
* top - a top users display for Unix
|
|
|
|
*
|
1999-06-14 12:06:11 +00:00
|
|
|
* SYNOPSIS: For FreeBSD-2.x and later
|
1997-03-23 18:55:20 +00:00
|
|
|
*
|
|
|
|
* DESCRIPTION:
|
|
|
|
* Originally written for BSD4.4 system by Christos Zoulas.
|
|
|
|
* Ported to FreeBSD 2.x by Steven Wallace && Wolfram Schneider
|
1998-08-12 09:58:15 +00:00
|
|
|
* Order support hacked in from top-3.5beta6/machine/m_aix41.c
|
|
|
|
* by Monte Mitzelfelt (for latest top see http://www.groupsys.com/topinfo/)
|
1997-03-23 18:55:20 +00:00
|
|
|
*
|
|
|
|
* This is the machine-dependent module for FreeBSD 2.2
|
|
|
|
* Works for:
|
1999-06-14 12:06:11 +00:00
|
|
|
* FreeBSD 2.2.x, 3.x, 4.x, and probably FreeBSD 2.1.x
|
1997-03-23 18:55:20 +00:00
|
|
|
*
|
|
|
|
* LIBS: -lkvm
|
|
|
|
*
|
|
|
|
* AUTHOR: Christos Zoulas <christos@ee.cornell.edu>
|
|
|
|
* Steven Wallace <swallace@freebsd.org>
|
|
|
|
* Wolfram Schneider <wosch@FreeBSD.org>
|
2001-02-23 18:52:37 +00:00
|
|
|
* Thomas Moestl <tmoestl@gmx.net>
|
1997-03-23 18:55:20 +00:00
|
|
|
*
|
1999-08-28 01:08:13 +00:00
|
|
|
* $FreeBSD$
|
1997-03-23 18:55:20 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
|
1999-01-09 20:25:02 +00:00
|
|
|
#include <sys/time.h>
|
1997-03-23 18:55:20 +00:00
|
|
|
#include <sys/types.h>
|
|
|
|
#include <sys/signal.h>
|
|
|
|
#include <sys/param.h>
|
|
|
|
|
|
|
|
#include "os.h"
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <nlist.h>
|
|
|
|
#include <math.h>
|
|
|
|
#include <kvm.h>
|
1997-07-14 09:06:46 +00:00
|
|
|
#include <pwd.h>
|
1997-03-23 18:55:20 +00:00
|
|
|
#include <sys/errno.h>
|
|
|
|
#include <sys/sysctl.h>
|
|
|
|
#include <sys/dkstat.h>
|
|
|
|
#include <sys/file.h>
|
|
|
|
#include <sys/time.h>
|
|
|
|
#include <sys/proc.h>
|
|
|
|
#include <sys/user.h>
|
|
|
|
#include <sys/vmmeter.h>
|
1997-09-28 00:59:04 +00:00
|
|
|
#include <sys/resource.h>
|
|
|
|
#include <sys/rtprio.h>
|
1997-03-23 18:55:20 +00:00
|
|
|
|
|
|
|
/* Swap */
|
|
|
|
#include <stdlib.h>
|
|
|
|
|
2001-02-23 18:52:37 +00:00
|
|
|
#include <unistd.h>
|
1997-03-23 18:55:20 +00:00
|
|
|
#include <osreldate.h> /* for changes in kernel structures */
|
|
|
|
|
|
|
|
#include "top.h"
|
|
|
|
#include "machine.h"
|
2000-11-29 23:03:02 +00:00
|
|
|
#include "screen.h"
|
2001-02-23 18:52:37 +00:00
|
|
|
#include "utils.h"
|
|
|
|
|
2002-03-22 01:42:45 +00:00
|
|
|
static void getsysctl(char *, void *, size_t);
|
2001-02-23 18:52:37 +00:00
|
|
|
|
|
|
|
#define GETSYSCTL(name, var) getsysctl(name, &(var), sizeof(var))
|
1997-03-23 18:55:20 +00:00
|
|
|
|
2002-03-22 01:42:45 +00:00
|
|
|
extern char* printable(char *);
|
|
|
|
int swapmode(int *retavail, int *retfree);
|
1997-07-12 10:51:54 +00:00
|
|
|
static int smpmode;
|
1997-07-14 09:06:46 +00:00
|
|
|
static int namelength;
|
2000-11-29 23:03:02 +00:00
|
|
|
static int cmdlengthdelta;
|
1997-03-23 18:55:20 +00:00
|
|
|
|
2001-02-23 18:52:37 +00:00
|
|
|
/* Prototypes for top internals */
|
2002-03-22 01:42:45 +00:00
|
|
|
void quit(int);
|
1997-03-23 18:55:20 +00:00
|
|
|
|
|
|
|
/* get_process_info passes back a handle. This is what it looks like: */
|
|
|
|
|
|
|
|
struct handle
|
|
|
|
{
|
|
|
|
struct kinfo_proc **next_proc; /* points to next valid proc pointer */
|
|
|
|
int remaining; /* number of pointers remaining */
|
|
|
|
};
|
|
|
|
|
|
|
|
/* declarations for load_avg */
|
|
|
|
#include "loadavg.h"
|
|
|
|
|
|
|
|
/* define what weighted cpu is. */
|
Change the proc information returned from the kernel so that it
no longer contains kernel specific data structures, but rather
only scalar values and structures that are already part of the
kernel/user interface, specifically rusage and rtprio. It no
longer contains proc, session, pcred, ucred, procsig, vmspace,
pstats, mtx, sigiolst, klist, callout, pasleep, or mdproc. If
any of these changed in size, ps, w, fstat, gcore, systat, and
top would all stop working. The new structure has over 200 bytes
of unassigned space for future values to be added, yet is nearly
100 bytes smaller per entry than the structure that it replaced.
2000-12-12 07:25:57 +00:00
|
|
|
#define weighted_cpu(pct, pp) ((pp)->ki_swtime == 0 ? 0.0 : \
|
|
|
|
((pct) / (1.0 - exp((pp)->ki_swtime * logcpu))))
|
1997-03-23 18:55:20 +00:00
|
|
|
|
|
|
|
/* what we consider to be process size: */
|
Change the proc information returned from the kernel so that it
no longer contains kernel specific data structures, but rather
only scalar values and structures that are already part of the
kernel/user interface, specifically rusage and rtprio. It no
longer contains proc, session, pcred, ucred, procsig, vmspace,
pstats, mtx, sigiolst, klist, callout, pasleep, or mdproc. If
any of these changed in size, ps, w, fstat, gcore, systat, and
top would all stop working. The new structure has over 200 bytes
of unassigned space for future values to be added, yet is nearly
100 bytes smaller per entry than the structure that it replaced.
2000-12-12 07:25:57 +00:00
|
|
|
#define PROCSIZE(pp) ((pp)->ki_size / 1024)
|
1997-03-23 18:55:20 +00:00
|
|
|
|
|
|
|
/* definitions for indices in the nlist array */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* These definitions control the format of the per-process area
|
|
|
|
*/
|
|
|
|
|
1997-07-12 10:51:54 +00:00
|
|
|
static char smp_header[] =
|
2001-02-18 11:08:47 +00:00
|
|
|
" PID %-*.*s PRI NICE SIZE RES STATE C TIME WCPU CPU COMMAND";
|
1997-03-23 18:55:20 +00:00
|
|
|
|
1997-07-12 10:51:54 +00:00
|
|
|
#define smp_Proc_format \
|
2001-02-18 11:08:47 +00:00
|
|
|
"%5d %-*.*s %3d %4d%7s %6s %-6.6s %1x%7s %5.2f%% %5.2f%% %.*s"
|
1997-03-23 18:55:20 +00:00
|
|
|
|
1997-07-12 10:51:54 +00:00
|
|
|
static char up_header[] =
|
2001-02-18 11:08:47 +00:00
|
|
|
" PID %-*.*s PRI NICE SIZE RES STATE TIME WCPU CPU COMMAND";
|
1997-03-23 18:55:20 +00:00
|
|
|
|
1997-07-12 10:51:54 +00:00
|
|
|
#define up_Proc_format \
|
2001-02-18 11:08:47 +00:00
|
|
|
"%5d %-*.*s %3d %4d%7s %6s %-6.6s%.0d%7s %5.2f%% %5.2f%% %.*s"
|
1997-03-23 18:55:20 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* process state names for the "STATE" column of the display */
|
|
|
|
/* the extra nulls in the string "run" are for adding a slash and
|
|
|
|
the processor number when needed */
|
|
|
|
|
|
|
|
char *state_abbrev[] =
|
|
|
|
{
|
2000-09-07 01:33:02 +00:00
|
|
|
"", "START", "RUN\0\0\0", "SLEEP", "STOP", "ZOMB", "WAIT", "MUTEX"
|
1997-03-23 18:55:20 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
static kvm_t *kd;
|
|
|
|
|
|
|
|
/* values that we stash away in _init and use in later routines */
|
|
|
|
|
|
|
|
static double logcpu;
|
|
|
|
|
|
|
|
/* these are retrieved from the kernel in _init */
|
|
|
|
|
|
|
|
static load_avg ccpu;
|
|
|
|
|
2001-02-23 18:52:37 +00:00
|
|
|
/* these are used in the get_ functions */
|
1997-03-23 18:55:20 +00:00
|
|
|
|
2001-02-23 18:52:37 +00:00
|
|
|
static int lastpid;
|
1997-03-23 18:55:20 +00:00
|
|
|
|
|
|
|
/* these are for calculating cpu state percentages */
|
|
|
|
|
|
|
|
static long cp_time[CPUSTATES];
|
|
|
|
static long cp_old[CPUSTATES];
|
|
|
|
static long cp_diff[CPUSTATES];
|
|
|
|
|
|
|
|
/* these are for detailing the process states */
|
|
|
|
|
2000-09-07 01:33:02 +00:00
|
|
|
int process_states[8];
|
1997-03-23 18:55:20 +00:00
|
|
|
char *procstatenames[] = {
|
|
|
|
"", " starting, ", " running, ", " sleeping, ", " stopped, ",
|
2000-09-07 01:33:02 +00:00
|
|
|
" zombie, ", " waiting, ", " mutex, ",
|
1997-03-23 18:55:20 +00:00
|
|
|
NULL
|
|
|
|
};
|
|
|
|
|
|
|
|
/* these are for detailing the cpu states */
|
|
|
|
|
|
|
|
int cpu_states[CPUSTATES];
|
|
|
|
char *cpustatenames[] = {
|
|
|
|
"user", "nice", "system", "interrupt", "idle", NULL
|
|
|
|
};
|
|
|
|
|
|
|
|
/* these are for detailing the memory statistics */
|
|
|
|
|
|
|
|
int memory_stats[7];
|
|
|
|
char *memorynames[] = {
|
|
|
|
"K Active, ", "K Inact, ", "K Wired, ", "K Cache, ", "K Buf, ", "K Free",
|
|
|
|
NULL
|
|
|
|
};
|
|
|
|
|
|
|
|
int swap_stats[7];
|
|
|
|
char *swapnames[] = {
|
|
|
|
/* 0 1 2 3 4 5 */
|
|
|
|
"K Total, ", "K Used, ", "K Free, ", "% Inuse, ", "K In, ", "K Out",
|
|
|
|
NULL
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
/* these are for keeping track of the proc array */
|
|
|
|
|
|
|
|
static int nproc;
|
|
|
|
static int onproc = -1;
|
|
|
|
static int pref_len;
|
|
|
|
static struct kinfo_proc *pbase;
|
|
|
|
static struct kinfo_proc **pref;
|
|
|
|
|
|
|
|
/* these are for getting the memory statistics */
|
|
|
|
|
|
|
|
static int pageshift; /* log base 2 of the pagesize */
|
|
|
|
|
|
|
|
/* define pagetok in terms of pageshift */
|
|
|
|
|
|
|
|
#define pagetok(size) ((size) << pageshift)
|
|
|
|
|
|
|
|
/* useful externals */
|
|
|
|
long percentages();
|
|
|
|
|
1998-08-12 09:58:15 +00:00
|
|
|
#ifdef ORDER
|
|
|
|
/* sorting orders. first is default */
|
|
|
|
char *ordernames[] = {
|
|
|
|
"cpu", "size", "res", "time", "pri", NULL
|
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
1997-03-23 18:55:20 +00:00
|
|
|
int
|
|
|
|
machine_init(statics)
|
|
|
|
|
|
|
|
struct statics *statics;
|
|
|
|
|
|
|
|
{
|
|
|
|
register int pagesize;
|
2001-02-27 17:11:19 +00:00
|
|
|
size_t modelen;
|
1997-07-14 09:06:46 +00:00
|
|
|
struct passwd *pw;
|
1997-07-12 10:51:54 +00:00
|
|
|
|
|
|
|
modelen = sizeof(smpmode);
|
1997-08-27 03:48:25 +00:00
|
|
|
if ((sysctlbyname("machdep.smp_active", &smpmode, &modelen, NULL, 0) < 0 &&
|
2001-04-27 19:33:50 +00:00
|
|
|
sysctlbyname("kern.smp.active", &smpmode, &modelen, NULL, 0) < 0) ||
|
1997-07-12 10:51:54 +00:00
|
|
|
modelen != sizeof(smpmode))
|
|
|
|
smpmode = 0;
|
1997-03-23 18:55:20 +00:00
|
|
|
|
1997-07-14 09:06:46 +00:00
|
|
|
while ((pw = getpwent()) != NULL) {
|
|
|
|
if (strlen(pw->pw_name) > namelength)
|
|
|
|
namelength = strlen(pw->pw_name);
|
|
|
|
}
|
|
|
|
if (namelength < 8)
|
|
|
|
namelength = 8;
|
2001-03-12 05:53:54 +00:00
|
|
|
if (smpmode && namelength > 13)
|
|
|
|
namelength = 13;
|
|
|
|
else if (namelength > 15)
|
1999-11-17 16:31:51 +00:00
|
|
|
namelength = 15;
|
1997-07-14 09:06:46 +00:00
|
|
|
|
2001-02-23 18:52:37 +00:00
|
|
|
if ((kd = kvm_open("/dev/null", "/dev/null", "/dev/null", O_RDONLY, "kvm_open")) == NULL)
|
1997-03-23 18:55:20 +00:00
|
|
|
return -1;
|
|
|
|
|
2001-02-23 18:52:37 +00:00
|
|
|
GETSYSCTL("kern.ccpu", ccpu);
|
1997-03-23 18:55:20 +00:00
|
|
|
|
|
|
|
/* this is used in calculating WCPU -- calculate it ahead of time */
|
|
|
|
logcpu = log(loaddouble(ccpu));
|
|
|
|
|
|
|
|
pbase = NULL;
|
|
|
|
pref = NULL;
|
|
|
|
nproc = 0;
|
|
|
|
onproc = -1;
|
|
|
|
/* get the page size with "getpagesize" and calculate pageshift from it */
|
|
|
|
pagesize = getpagesize();
|
|
|
|
pageshift = 0;
|
|
|
|
while (pagesize > 1)
|
|
|
|
{
|
|
|
|
pageshift++;
|
|
|
|
pagesize >>= 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* we only need the amount of log(2)1024 for our conversion */
|
|
|
|
pageshift -= LOG1024;
|
|
|
|
|
|
|
|
/* fill in the statics information */
|
|
|
|
statics->procstate_names = procstatenames;
|
|
|
|
statics->cpustate_names = cpustatenames;
|
|
|
|
statics->memory_names = memorynames;
|
|
|
|
statics->swap_names = swapnames;
|
1998-08-12 09:58:15 +00:00
|
|
|
#ifdef ORDER
|
|
|
|
statics->order_names = ordernames;
|
|
|
|
#endif
|
1997-03-23 18:55:20 +00:00
|
|
|
|
|
|
|
/* all done! */
|
|
|
|
return(0);
|
|
|
|
}
|
|
|
|
|
|
|
|
char *format_header(uname_field)
|
|
|
|
|
|
|
|
register char *uname_field;
|
|
|
|
|
|
|
|
{
|
1997-07-14 09:06:46 +00:00
|
|
|
static char Header[128];
|
1997-03-23 18:55:20 +00:00
|
|
|
|
1997-07-14 09:06:46 +00:00
|
|
|
snprintf(Header, sizeof(Header), smpmode ? smp_header : up_header,
|
|
|
|
namelength, namelength, uname_field);
|
1997-07-12 10:51:54 +00:00
|
|
|
|
2000-11-29 23:03:02 +00:00
|
|
|
cmdlengthdelta = strlen(Header) - 7;
|
1997-03-23 18:55:20 +00:00
|
|
|
|
1997-07-14 09:06:46 +00:00
|
|
|
return Header;
|
1997-03-23 18:55:20 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int swappgsin = -1;
|
|
|
|
static int swappgsout = -1;
|
|
|
|
extern struct timeval timeout;
|
|
|
|
|
|
|
|
void
|
|
|
|
get_system_info(si)
|
|
|
|
|
|
|
|
struct system_info *si;
|
|
|
|
|
|
|
|
{
|
|
|
|
long total;
|
2001-02-27 17:11:19 +00:00
|
|
|
struct loadavg sysload;
|
1999-01-09 20:25:02 +00:00
|
|
|
int mib[2];
|
|
|
|
struct timeval boottime;
|
|
|
|
size_t bt_size;
|
1997-03-23 18:55:20 +00:00
|
|
|
|
|
|
|
/* get the cp_time array */
|
2001-02-23 18:52:37 +00:00
|
|
|
GETSYSCTL("kern.cp_time", cp_time);
|
2001-02-27 17:11:19 +00:00
|
|
|
GETSYSCTL("vm.loadavg", sysload);
|
2001-02-23 18:52:37 +00:00
|
|
|
GETSYSCTL("kern.lastpid", lastpid);
|
1997-03-23 18:55:20 +00:00
|
|
|
|
|
|
|
/* convert load averages to doubles */
|
|
|
|
{
|
|
|
|
register int i;
|
|
|
|
register double *infoloadp;
|
|
|
|
|
|
|
|
infoloadp = si->load_avg;
|
|
|
|
for (i = 0; i < 3; i++)
|
|
|
|
{
|
|
|
|
#ifdef notyet
|
|
|
|
*infoloadp++ = ((double) sysload.ldavg[i]) / sysload.fscale;
|
|
|
|
#endif
|
2001-02-27 17:11:19 +00:00
|
|
|
*infoloadp++ = loaddouble(sysload.ldavg[i]);
|
1997-03-23 18:55:20 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* convert cp_time counts to percentages */
|
|
|
|
total = percentages(CPUSTATES, cpu_states, cp_time, cp_old, cp_diff);
|
|
|
|
|
|
|
|
/* sum memory & swap statistics */
|
|
|
|
{
|
|
|
|
static unsigned int swap_delay = 0;
|
|
|
|
static int swapavail = 0;
|
|
|
|
static int swapfree = 0;
|
|
|
|
static int bufspace = 0;
|
2001-02-23 18:52:37 +00:00
|
|
|
static int nspgsin, nspgsout;
|
|
|
|
|
|
|
|
GETSYSCTL("vfs.bufspace", bufspace);
|
|
|
|
GETSYSCTL("vm.stats.vm.v_active_count", memory_stats[0]);
|
|
|
|
GETSYSCTL("vm.stats.vm.v_inactive_count", memory_stats[1]);
|
|
|
|
GETSYSCTL("vm.stats.vm.v_wire_count", memory_stats[2]);
|
|
|
|
GETSYSCTL("vm.stats.vm.v_cache_count", memory_stats[3]);
|
|
|
|
GETSYSCTL("vm.stats.vm.v_free_count", memory_stats[5]);
|
|
|
|
GETSYSCTL("vm.stats.vm.v_swappgsin", nspgsin);
|
|
|
|
GETSYSCTL("vm.stats.vm.v_swappgsout", nspgsout);
|
1997-03-23 18:55:20 +00:00
|
|
|
/* convert memory stats to Kbytes */
|
2001-03-20 16:02:16 +00:00
|
|
|
memory_stats[0] = pagetok(memory_stats[0]);
|
|
|
|
memory_stats[1] = pagetok(memory_stats[1]);
|
|
|
|
memory_stats[2] = pagetok(memory_stats[2]);
|
|
|
|
memory_stats[3] = pagetok(memory_stats[3]);
|
1997-03-23 18:55:20 +00:00
|
|
|
memory_stats[4] = bufspace / 1024;
|
2001-03-20 16:02:16 +00:00
|
|
|
memory_stats[5] = pagetok(memory_stats[5]);
|
1997-03-23 18:55:20 +00:00
|
|
|
memory_stats[6] = -1;
|
|
|
|
|
|
|
|
/* first interval */
|
|
|
|
if (swappgsin < 0) {
|
|
|
|
swap_stats[4] = 0;
|
|
|
|
swap_stats[5] = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* compute differences between old and new swap statistic */
|
|
|
|
else {
|
2001-02-23 18:52:37 +00:00
|
|
|
swap_stats[4] = pagetok(((nspgsin - swappgsin)));
|
|
|
|
swap_stats[5] = pagetok(((nspgsout - swappgsout)));
|
1997-03-23 18:55:20 +00:00
|
|
|
}
|
|
|
|
|
2001-02-23 18:52:37 +00:00
|
|
|
swappgsin = nspgsin;
|
|
|
|
swappgsout = nspgsout;
|
1997-03-23 18:55:20 +00:00
|
|
|
|
|
|
|
/* call CPU heavy swapmode() only for changes */
|
|
|
|
if (swap_stats[4] > 0 || swap_stats[5] > 0 || swap_delay == 0) {
|
|
|
|
swap_stats[3] = swapmode(&swapavail, &swapfree);
|
|
|
|
swap_stats[0] = swapavail;
|
|
|
|
swap_stats[1] = swapavail - swapfree;
|
|
|
|
swap_stats[2] = swapfree;
|
|
|
|
}
|
|
|
|
swap_delay = 1;
|
|
|
|
swap_stats[6] = -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* set arrays and strings */
|
|
|
|
si->cpustates = cpu_states;
|
|
|
|
si->memory = memory_stats;
|
|
|
|
si->swap = swap_stats;
|
|
|
|
|
|
|
|
|
|
|
|
if(lastpid > 0) {
|
|
|
|
si->last_pid = lastpid;
|
|
|
|
} else {
|
|
|
|
si->last_pid = -1;
|
|
|
|
}
|
1999-01-09 20:25:02 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Print how long system has been up.
|
|
|
|
* (Found by looking getting "boottime" from the kernel)
|
|
|
|
*/
|
|
|
|
mib[0] = CTL_KERN;
|
|
|
|
mib[1] = KERN_BOOTTIME;
|
|
|
|
bt_size = sizeof(boottime);
|
|
|
|
if (sysctl(mib, 2, &boottime, &bt_size, NULL, 0) != -1 &&
|
|
|
|
boottime.tv_sec != 0) {
|
|
|
|
si->boottime = boottime;
|
|
|
|
} else {
|
|
|
|
si->boottime.tv_sec = -1;
|
|
|
|
}
|
1997-03-23 18:55:20 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static struct handle handle;
|
|
|
|
|
|
|
|
caddr_t get_process_info(si, sel, compare)
|
|
|
|
|
|
|
|
struct system_info *si;
|
|
|
|
struct process_select *sel;
|
|
|
|
int (*compare)();
|
|
|
|
|
|
|
|
{
|
|
|
|
register int i;
|
|
|
|
register int total_procs;
|
|
|
|
register int active_procs;
|
|
|
|
register struct kinfo_proc **prefp;
|
|
|
|
register struct kinfo_proc *pp;
|
|
|
|
|
|
|
|
/* these are copied out of sel for speed */
|
|
|
|
int show_idle;
|
1998-08-04 14:10:48 +00:00
|
|
|
int show_self;
|
1997-03-23 18:55:20 +00:00
|
|
|
int show_system;
|
|
|
|
int show_uid;
|
|
|
|
int show_command;
|
|
|
|
|
|
|
|
|
|
|
|
pbase = kvm_getprocs(kd, KERN_PROC_ALL, 0, &nproc);
|
|
|
|
if (nproc > onproc)
|
|
|
|
pref = (struct kinfo_proc **) realloc(pref, sizeof(struct kinfo_proc *)
|
|
|
|
* (onproc = nproc));
|
|
|
|
if (pref == NULL || pbase == NULL) {
|
|
|
|
(void) fprintf(stderr, "top: Out of memory.\n");
|
|
|
|
quit(23);
|
|
|
|
}
|
|
|
|
/* get a pointer to the states summary array */
|
|
|
|
si->procstates = process_states;
|
|
|
|
|
|
|
|
/* set up flags which define what we are going to select */
|
|
|
|
show_idle = sel->idle;
|
1998-08-04 14:10:48 +00:00
|
|
|
show_self = sel->self;
|
1997-03-23 18:55:20 +00:00
|
|
|
show_system = sel->system;
|
|
|
|
show_uid = sel->uid != -1;
|
|
|
|
show_command = sel->command != NULL;
|
|
|
|
|
|
|
|
/* count up process states and get pointers to interesting procs */
|
|
|
|
total_procs = 0;
|
|
|
|
active_procs = 0;
|
|
|
|
memset((char *)process_states, 0, sizeof(process_states));
|
|
|
|
prefp = pref;
|
|
|
|
for (pp = pbase, i = 0; i < nproc; pp++, i++)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* Place pointers to each valid proc structure in pref[].
|
|
|
|
* Process slots that are actually in use have a non-zero
|
|
|
|
* status field. Processes with P_SYSTEM set are system
|
|
|
|
* processes---these get ignored unless show_sysprocs is set.
|
|
|
|
*/
|
Change the proc information returned from the kernel so that it
no longer contains kernel specific data structures, but rather
only scalar values and structures that are already part of the
kernel/user interface, specifically rusage and rtprio. It no
longer contains proc, session, pcred, ucred, procsig, vmspace,
pstats, mtx, sigiolst, klist, callout, pasleep, or mdproc. If
any of these changed in size, ps, w, fstat, gcore, systat, and
top would all stop working. The new structure has over 200 bytes
of unassigned space for future values to be added, yet is nearly
100 bytes smaller per entry than the structure that it replaced.
2000-12-12 07:25:57 +00:00
|
|
|
if (pp->ki_stat != 0 &&
|
|
|
|
(show_self != pp->ki_pid) &&
|
|
|
|
(show_system || ((pp->ki_flag & P_SYSTEM) == 0)))
|
1997-03-23 18:55:20 +00:00
|
|
|
{
|
|
|
|
total_procs++;
|
Change the proc information returned from the kernel so that it
no longer contains kernel specific data structures, but rather
only scalar values and structures that are already part of the
kernel/user interface, specifically rusage and rtprio. It no
longer contains proc, session, pcred, ucred, procsig, vmspace,
pstats, mtx, sigiolst, klist, callout, pasleep, or mdproc. If
any of these changed in size, ps, w, fstat, gcore, systat, and
top would all stop working. The new structure has over 200 bytes
of unassigned space for future values to be added, yet is nearly
100 bytes smaller per entry than the structure that it replaced.
2000-12-12 07:25:57 +00:00
|
|
|
process_states[(unsigned char) pp->ki_stat]++;
|
|
|
|
if ((pp->ki_stat != SZOMB) &&
|
|
|
|
(show_idle || (pp->ki_pctcpu != 0) ||
|
|
|
|
(pp->ki_stat == SRUN)) &&
|
|
|
|
(!show_uid || pp->ki_ruid == (uid_t)sel->uid))
|
1997-03-23 18:55:20 +00:00
|
|
|
{
|
|
|
|
*prefp++ = pp;
|
|
|
|
active_procs++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* if requested, sort the "interesting" processes */
|
|
|
|
if (compare != NULL)
|
|
|
|
{
|
|
|
|
qsort((char *)pref, active_procs, sizeof(struct kinfo_proc *), compare);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* remember active and total counts */
|
|
|
|
si->p_total = total_procs;
|
|
|
|
si->p_active = pref_len = active_procs;
|
|
|
|
|
|
|
|
/* pass back a handle */
|
|
|
|
handle.next_proc = pref;
|
|
|
|
handle.remaining = active_procs;
|
|
|
|
return((caddr_t)&handle);
|
|
|
|
}
|
|
|
|
|
|
|
|
char fmt[128]; /* static area where result is built */
|
|
|
|
|
|
|
|
char *format_next_process(handle, get_userid)
|
|
|
|
|
|
|
|
caddr_t handle;
|
|
|
|
char *(*get_userid)();
|
|
|
|
|
|
|
|
{
|
|
|
|
register struct kinfo_proc *pp;
|
|
|
|
register long cputime;
|
|
|
|
register double pct;
|
|
|
|
struct handle *hp;
|
|
|
|
char status[16];
|
1999-02-06 16:58:50 +00:00
|
|
|
int state;
|
1997-03-23 18:55:20 +00:00
|
|
|
|
|
|
|
/* find and remember the next proc structure */
|
|
|
|
hp = (struct handle *)handle;
|
|
|
|
pp = *(hp->next_proc++);
|
|
|
|
hp->remaining--;
|
|
|
|
|
1999-11-17 03:25:54 +00:00
|
|
|
/* get the process's command name */
|
2001-01-24 14:17:23 +00:00
|
|
|
if ((pp->ki_sflag & PS_INMEM) == 0) {
|
1997-03-23 18:55:20 +00:00
|
|
|
/*
|
|
|
|
* Print swapped processes as <pname>
|
|
|
|
*/
|
Change the proc information returned from the kernel so that it
no longer contains kernel specific data structures, but rather
only scalar values and structures that are already part of the
kernel/user interface, specifically rusage and rtprio. It no
longer contains proc, session, pcred, ucred, procsig, vmspace,
pstats, mtx, sigiolst, klist, callout, pasleep, or mdproc. If
any of these changed in size, ps, w, fstat, gcore, systat, and
top would all stop working. The new structure has over 200 bytes
of unassigned space for future values to be added, yet is nearly
100 bytes smaller per entry than the structure that it replaced.
2000-12-12 07:25:57 +00:00
|
|
|
char *comm = pp->ki_comm;
|
|
|
|
#define COMSIZ sizeof(pp->ki_comm)
|
1997-03-23 18:55:20 +00:00
|
|
|
char buf[COMSIZ];
|
|
|
|
(void) strncpy(buf, comm, COMSIZ);
|
|
|
|
comm[0] = '<';
|
|
|
|
(void) strncpy(&comm[1], buf, COMSIZ - 2);
|
|
|
|
comm[COMSIZ - 2] = '\0';
|
|
|
|
(void) strncat(comm, ">", COMSIZ - 1);
|
|
|
|
comm[COMSIZ - 1] = '\0';
|
|
|
|
}
|
|
|
|
|
1999-11-17 03:25:54 +00:00
|
|
|
/*
|
|
|
|
* Convert the process's runtime from microseconds to seconds. This
|
|
|
|
* time includes the interrupt time although that is not wanted here.
|
|
|
|
* ps(1) is similarly sloppy.
|
|
|
|
*/
|
Change the proc information returned from the kernel so that it
no longer contains kernel specific data structures, but rather
only scalar values and structures that are already part of the
kernel/user interface, specifically rusage and rtprio. It no
longer contains proc, session, pcred, ucred, procsig, vmspace,
pstats, mtx, sigiolst, klist, callout, pasleep, or mdproc. If
any of these changed in size, ps, w, fstat, gcore, systat, and
top would all stop working. The new structure has over 200 bytes
of unassigned space for future values to be added, yet is nearly
100 bytes smaller per entry than the structure that it replaced.
2000-12-12 07:25:57 +00:00
|
|
|
cputime = (pp->ki_runtime + 500000) / 1000000;
|
1997-03-23 18:55:20 +00:00
|
|
|
|
|
|
|
/* calculate the base for cpu percentages */
|
Change the proc information returned from the kernel so that it
no longer contains kernel specific data structures, but rather
only scalar values and structures that are already part of the
kernel/user interface, specifically rusage and rtprio. It no
longer contains proc, session, pcred, ucred, procsig, vmspace,
pstats, mtx, sigiolst, klist, callout, pasleep, or mdproc. If
any of these changed in size, ps, w, fstat, gcore, systat, and
top would all stop working. The new structure has over 200 bytes
of unassigned space for future values to be added, yet is nearly
100 bytes smaller per entry than the structure that it replaced.
2000-12-12 07:25:57 +00:00
|
|
|
pct = pctdouble(pp->ki_pctcpu);
|
1997-03-23 18:55:20 +00:00
|
|
|
|
|
|
|
/* generate "STATE" field */
|
Change the proc information returned from the kernel so that it
no longer contains kernel specific data structures, but rather
only scalar values and structures that are already part of the
kernel/user interface, specifically rusage and rtprio. It no
longer contains proc, session, pcred, ucred, procsig, vmspace,
pstats, mtx, sigiolst, klist, callout, pasleep, or mdproc. If
any of these changed in size, ps, w, fstat, gcore, systat, and
top would all stop working. The new structure has over 200 bytes
of unassigned space for future values to be added, yet is nearly
100 bytes smaller per entry than the structure that it replaced.
2000-12-12 07:25:57 +00:00
|
|
|
switch (state = pp->ki_stat) {
|
1997-03-23 18:55:20 +00:00
|
|
|
case SRUN:
|
Change the proc information returned from the kernel so that it
no longer contains kernel specific data structures, but rather
only scalar values and structures that are already part of the
kernel/user interface, specifically rusage and rtprio. It no
longer contains proc, session, pcred, ucred, procsig, vmspace,
pstats, mtx, sigiolst, klist, callout, pasleep, or mdproc. If
any of these changed in size, ps, w, fstat, gcore, systat, and
top would all stop working. The new structure has over 200 bytes
of unassigned space for future values to be added, yet is nearly
100 bytes smaller per entry than the structure that it replaced.
2000-12-12 07:25:57 +00:00
|
|
|
if (smpmode && pp->ki_oncpu != 0xff)
|
|
|
|
sprintf(status, "CPU%d", pp->ki_oncpu);
|
1997-03-23 18:55:20 +00:00
|
|
|
else
|
|
|
|
strcpy(status, "RUN");
|
|
|
|
break;
|
2000-11-29 20:22:34 +00:00
|
|
|
case SMTX:
|
Change the proc information returned from the kernel so that it
no longer contains kernel specific data structures, but rather
only scalar values and structures that are already part of the
kernel/user interface, specifically rusage and rtprio. It no
longer contains proc, session, pcred, ucred, procsig, vmspace,
pstats, mtx, sigiolst, klist, callout, pasleep, or mdproc. If
any of these changed in size, ps, w, fstat, gcore, systat, and
top would all stop working. The new structure has over 200 bytes
of unassigned space for future values to be added, yet is nearly
100 bytes smaller per entry than the structure that it replaced.
2000-12-12 07:25:57 +00:00
|
|
|
if (pp->ki_kiflag & KI_MTXBLOCK) {
|
|
|
|
sprintf(status, "*%.6s", pp->ki_mtxname);
|
2000-11-29 20:22:34 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
/* fall through */
|
1997-03-23 18:55:20 +00:00
|
|
|
case SSLEEP:
|
Change the proc information returned from the kernel so that it
no longer contains kernel specific data structures, but rather
only scalar values and structures that are already part of the
kernel/user interface, specifically rusage and rtprio. It no
longer contains proc, session, pcred, ucred, procsig, vmspace,
pstats, mtx, sigiolst, klist, callout, pasleep, or mdproc. If
any of these changed in size, ps, w, fstat, gcore, systat, and
top would all stop working. The new structure has over 200 bytes
of unassigned space for future values to be added, yet is nearly
100 bytes smaller per entry than the structure that it replaced.
2000-12-12 07:25:57 +00:00
|
|
|
if (pp->ki_wmesg != NULL) {
|
|
|
|
sprintf(status, "%.6s", pp->ki_wmesg);
|
1997-03-23 18:55:20 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
/* fall through */
|
|
|
|
default:
|
1999-02-06 16:58:50 +00:00
|
|
|
|
|
|
|
if (state >= 0 &&
|
|
|
|
state < sizeof(state_abbrev) / sizeof(*state_abbrev))
|
|
|
|
sprintf(status, "%.6s", state_abbrev[(unsigned char) state]);
|
|
|
|
else
|
|
|
|
sprintf(status, "?%5d", state);
|
1997-03-23 18:55:20 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* format this entry */
|
|
|
|
sprintf(fmt,
|
1997-07-12 10:51:54 +00:00
|
|
|
smpmode ? smp_Proc_format : up_Proc_format,
|
Change the proc information returned from the kernel so that it
no longer contains kernel specific data structures, but rather
only scalar values and structures that are already part of the
kernel/user interface, specifically rusage and rtprio. It no
longer contains proc, session, pcred, ucred, procsig, vmspace,
pstats, mtx, sigiolst, klist, callout, pasleep, or mdproc. If
any of these changed in size, ps, w, fstat, gcore, systat, and
top would all stop working. The new structure has over 200 bytes
of unassigned space for future values to be added, yet is nearly
100 bytes smaller per entry than the structure that it replaced.
2000-12-12 07:25:57 +00:00
|
|
|
pp->ki_pid,
|
1997-07-14 09:06:46 +00:00
|
|
|
namelength, namelength,
|
Change the proc information returned from the kernel so that it
no longer contains kernel specific data structures, but rather
only scalar values and structures that are already part of the
kernel/user interface, specifically rusage and rtprio. It no
longer contains proc, session, pcred, ucred, procsig, vmspace,
pstats, mtx, sigiolst, klist, callout, pasleep, or mdproc. If
any of these changed in size, ps, w, fstat, gcore, systat, and
top would all stop working. The new structure has over 200 bytes
of unassigned space for future values to be added, yet is nearly
100 bytes smaller per entry than the structure that it replaced.
2000-12-12 07:25:57 +00:00
|
|
|
(*get_userid)(pp->ki_ruid),
|
2001-02-12 00:21:38 +00:00
|
|
|
pp->ki_pri.pri_level - PZERO,
|
1997-09-28 00:59:04 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* normal time -> nice value -20 - +20
|
|
|
|
* real time 0 - 31 -> nice value -52 - -21
|
|
|
|
* idle time 0 - 31 -> nice value +21 - +52
|
|
|
|
*/
|
2001-02-12 00:21:38 +00:00
|
|
|
(pp->ki_pri.pri_class == PRI_TIMESHARE ?
|
Change the proc information returned from the kernel so that it
no longer contains kernel specific data structures, but rather
only scalar values and structures that are already part of the
kernel/user interface, specifically rusage and rtprio. It no
longer contains proc, session, pcred, ucred, procsig, vmspace,
pstats, mtx, sigiolst, klist, callout, pasleep, or mdproc. If
any of these changed in size, ps, w, fstat, gcore, systat, and
top would all stop working. The new structure has over 200 bytes
of unassigned space for future values to be added, yet is nearly
100 bytes smaller per entry than the structure that it replaced.
2000-12-12 07:25:57 +00:00
|
|
|
pp->ki_nice - NZERO :
|
2001-02-12 00:21:38 +00:00
|
|
|
(PRI_IS_REALTIME(pp->ki_pri.pri_class) ?
|
|
|
|
(PRIO_MIN - 1 - (PRI_MAX_REALTIME - pp->ki_pri.pri_level)) :
|
|
|
|
(PRIO_MAX + 1 + pp->ki_pri.pri_level - PRI_MIN_IDLE))),
|
1998-06-21 18:00:34 +00:00
|
|
|
format_k2(PROCSIZE(pp)),
|
Change the proc information returned from the kernel so that it
no longer contains kernel specific data structures, but rather
only scalar values and structures that are already part of the
kernel/user interface, specifically rusage and rtprio. It no
longer contains proc, session, pcred, ucred, procsig, vmspace,
pstats, mtx, sigiolst, klist, callout, pasleep, or mdproc. If
any of these changed in size, ps, w, fstat, gcore, systat, and
top would all stop working. The new structure has over 200 bytes
of unassigned space for future values to be added, yet is nearly
100 bytes smaller per entry than the structure that it replaced.
2000-12-12 07:25:57 +00:00
|
|
|
format_k2(pagetok(pp->ki_rssize)),
|
1997-03-23 18:55:20 +00:00
|
|
|
status,
|
Change the proc information returned from the kernel so that it
no longer contains kernel specific data structures, but rather
only scalar values and structures that are already part of the
kernel/user interface, specifically rusage and rtprio. It no
longer contains proc, session, pcred, ucred, procsig, vmspace,
pstats, mtx, sigiolst, klist, callout, pasleep, or mdproc. If
any of these changed in size, ps, w, fstat, gcore, systat, and
top would all stop working. The new structure has over 200 bytes
of unassigned space for future values to be added, yet is nearly
100 bytes smaller per entry than the structure that it replaced.
2000-12-12 07:25:57 +00:00
|
|
|
smpmode ? pp->ki_lastcpu : 0,
|
1997-03-23 18:55:20 +00:00
|
|
|
format_time(cputime),
|
1998-11-25 09:45:28 +00:00
|
|
|
100.0 * weighted_cpu(pct, pp),
|
|
|
|
100.0 * pct,
|
2000-11-29 23:03:02 +00:00
|
|
|
screen_width > cmdlengthdelta ?
|
|
|
|
screen_width - cmdlengthdelta :
|
|
|
|
0,
|
Change the proc information returned from the kernel so that it
no longer contains kernel specific data structures, but rather
only scalar values and structures that are already part of the
kernel/user interface, specifically rusage and rtprio. It no
longer contains proc, session, pcred, ucred, procsig, vmspace,
pstats, mtx, sigiolst, klist, callout, pasleep, or mdproc. If
any of these changed in size, ps, w, fstat, gcore, systat, and
top would all stop working. The new structure has over 200 bytes
of unassigned space for future values to be added, yet is nearly
100 bytes smaller per entry than the structure that it replaced.
2000-12-12 07:25:57 +00:00
|
|
|
printable(pp->ki_comm));
|
1997-03-23 18:55:20 +00:00
|
|
|
|
|
|
|
/* return the result */
|
|
|
|
return(fmt);
|
|
|
|
}
|
|
|
|
|
2001-02-23 18:52:37 +00:00
|
|
|
static void getsysctl (name, ptr, len)
|
1997-03-23 18:55:20 +00:00
|
|
|
|
2001-02-23 18:52:37 +00:00
|
|
|
char *name;
|
|
|
|
void *ptr;
|
2001-02-27 17:11:19 +00:00
|
|
|
size_t len;
|
1997-03-23 18:55:20 +00:00
|
|
|
|
|
|
|
{
|
2001-02-27 17:11:19 +00:00
|
|
|
size_t nlen = len;
|
2001-02-23 18:52:37 +00:00
|
|
|
if (sysctlbyname(name, ptr, &nlen, NULL, 0) == -1) {
|
|
|
|
fprintf(stderr, "top: sysctl(%s...) failed: %s\n", name,
|
|
|
|
strerror(errno));
|
|
|
|
quit(23);
|
1997-03-23 18:55:20 +00:00
|
|
|
}
|
2001-02-23 18:52:37 +00:00
|
|
|
if (nlen != len) {
|
2001-05-31 22:36:51 +00:00
|
|
|
fprintf(stderr, "top: sysctl(%s...) expected %lu, got %lu\n", name,
|
|
|
|
(unsigned long)len, (unsigned long)nlen);
|
1997-03-23 18:55:20 +00:00
|
|
|
quit(23);
|
|
|
|
}
|
|
|
|
}
|
2001-02-23 18:52:37 +00:00
|
|
|
|
1998-08-12 09:58:15 +00:00
|
|
|
/* comparison routines for qsort */
|
1997-03-23 18:55:20 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* proc_compare - comparison function for "qsort"
|
|
|
|
* Compares the resource consumption of two processes using five
|
|
|
|
* distinct keys. The keys (in descending order of importance) are:
|
|
|
|
* percent cpu, cpu ticks, state, resident set size, total virtual
|
|
|
|
* memory usage. The process states are ordered as follows (from least
|
|
|
|
* to most important): WAIT, zombie, sleep, stop, start, run. The
|
|
|
|
* array declaration below maps a process state index into a number
|
|
|
|
* that reflects this ordering.
|
|
|
|
*/
|
|
|
|
|
|
|
|
static unsigned char sorted_state[] =
|
|
|
|
{
|
|
|
|
0, /* not used */
|
|
|
|
3, /* sleep */
|
|
|
|
1, /* ABANDONED (WAIT) */
|
|
|
|
6, /* run */
|
|
|
|
5, /* start */
|
|
|
|
2, /* zombie */
|
|
|
|
4 /* stop */
|
|
|
|
};
|
|
|
|
|
1998-08-12 09:58:15 +00:00
|
|
|
|
|
|
|
#define ORDERKEY_PCTCPU \
|
Change the proc information returned from the kernel so that it
no longer contains kernel specific data structures, but rather
only scalar values and structures that are already part of the
kernel/user interface, specifically rusage and rtprio. It no
longer contains proc, session, pcred, ucred, procsig, vmspace,
pstats, mtx, sigiolst, klist, callout, pasleep, or mdproc. If
any of these changed in size, ps, w, fstat, gcore, systat, and
top would all stop working. The new structure has over 200 bytes
of unassigned space for future values to be added, yet is nearly
100 bytes smaller per entry than the structure that it replaced.
2000-12-12 07:25:57 +00:00
|
|
|
if (lresult = (long) p2->ki_pctcpu - (long) p1->ki_pctcpu, \
|
1998-08-12 09:58:15 +00:00
|
|
|
(result = lresult > 0 ? 1 : lresult < 0 ? -1 : 0) == 0)
|
|
|
|
|
|
|
|
#define ORDERKEY_CPTICKS \
|
Change the proc information returned from the kernel so that it
no longer contains kernel specific data structures, but rather
only scalar values and structures that are already part of the
kernel/user interface, specifically rusage and rtprio. It no
longer contains proc, session, pcred, ucred, procsig, vmspace,
pstats, mtx, sigiolst, klist, callout, pasleep, or mdproc. If
any of these changed in size, ps, w, fstat, gcore, systat, and
top would all stop working. The new structure has over 200 bytes
of unassigned space for future values to be added, yet is nearly
100 bytes smaller per entry than the structure that it replaced.
2000-12-12 07:25:57 +00:00
|
|
|
if ((result = p2->ki_runtime > p1->ki_runtime ? 1 : \
|
|
|
|
p2->ki_runtime < p1->ki_runtime ? -1 : 0) == 0)
|
1998-08-12 09:58:15 +00:00
|
|
|
|
|
|
|
#define ORDERKEY_STATE \
|
Change the proc information returned from the kernel so that it
no longer contains kernel specific data structures, but rather
only scalar values and structures that are already part of the
kernel/user interface, specifically rusage and rtprio. It no
longer contains proc, session, pcred, ucred, procsig, vmspace,
pstats, mtx, sigiolst, klist, callout, pasleep, or mdproc. If
any of these changed in size, ps, w, fstat, gcore, systat, and
top would all stop working. The new structure has over 200 bytes
of unassigned space for future values to be added, yet is nearly
100 bytes smaller per entry than the structure that it replaced.
2000-12-12 07:25:57 +00:00
|
|
|
if ((result = sorted_state[(unsigned char) p2->ki_stat] - \
|
|
|
|
sorted_state[(unsigned char) p1->ki_stat]) == 0)
|
1998-08-12 09:58:15 +00:00
|
|
|
|
|
|
|
#define ORDERKEY_PRIO \
|
2001-02-12 00:21:38 +00:00
|
|
|
if ((result = p2->ki_pri.pri_level - p1->ki_pri.pri_level) == 0)
|
1998-08-12 09:58:15 +00:00
|
|
|
|
|
|
|
#define ORDERKEY_RSSIZE \
|
Change the proc information returned from the kernel so that it
no longer contains kernel specific data structures, but rather
only scalar values and structures that are already part of the
kernel/user interface, specifically rusage and rtprio. It no
longer contains proc, session, pcred, ucred, procsig, vmspace,
pstats, mtx, sigiolst, klist, callout, pasleep, or mdproc. If
any of these changed in size, ps, w, fstat, gcore, systat, and
top would all stop working. The new structure has over 200 bytes
of unassigned space for future values to be added, yet is nearly
100 bytes smaller per entry than the structure that it replaced.
2000-12-12 07:25:57 +00:00
|
|
|
if ((result = p2->ki_rssize - p1->ki_rssize) == 0)
|
1998-08-12 09:58:15 +00:00
|
|
|
|
|
|
|
#define ORDERKEY_MEM \
|
|
|
|
if ( (result = PROCSIZE(p2) - PROCSIZE(p1)) == 0 )
|
|
|
|
|
|
|
|
/* compare_cpu - the comparison function for sorting by cpu percentage */
|
|
|
|
|
1997-03-23 18:55:20 +00:00
|
|
|
int
|
1998-08-12 09:58:15 +00:00
|
|
|
#ifdef ORDER
|
|
|
|
compare_cpu(pp1, pp2)
|
|
|
|
#else
|
1997-03-23 18:55:20 +00:00
|
|
|
proc_compare(pp1, pp2)
|
1998-08-12 09:58:15 +00:00
|
|
|
#endif
|
1997-03-23 18:55:20 +00:00
|
|
|
|
|
|
|
struct proc **pp1;
|
|
|
|
struct proc **pp2;
|
|
|
|
|
|
|
|
{
|
|
|
|
register struct kinfo_proc *p1;
|
|
|
|
register struct kinfo_proc *p2;
|
|
|
|
register int result;
|
|
|
|
register pctcpu lresult;
|
|
|
|
|
|
|
|
/* remove one level of indirection */
|
|
|
|
p1 = *(struct kinfo_proc **) pp1;
|
|
|
|
p2 = *(struct kinfo_proc **) pp2;
|
|
|
|
|
1998-08-12 09:58:15 +00:00
|
|
|
ORDERKEY_PCTCPU
|
|
|
|
ORDERKEY_CPTICKS
|
|
|
|
ORDERKEY_STATE
|
|
|
|
ORDERKEY_PRIO
|
|
|
|
ORDERKEY_RSSIZE
|
|
|
|
ORDERKEY_MEM
|
|
|
|
;
|
1997-03-23 18:55:20 +00:00
|
|
|
|
|
|
|
return(result);
|
|
|
|
}
|
|
|
|
|
1998-08-12 09:58:15 +00:00
|
|
|
#ifdef ORDER
|
|
|
|
/* compare routines */
|
|
|
|
int compare_size(), compare_res(), compare_time(), compare_prio();
|
|
|
|
|
|
|
|
int (*proc_compares[])() = {
|
|
|
|
compare_cpu,
|
|
|
|
compare_size,
|
|
|
|
compare_res,
|
|
|
|
compare_time,
|
|
|
|
compare_prio,
|
|
|
|
NULL
|
|
|
|
};
|
|
|
|
|
|
|
|
/* compare_size - the comparison function for sorting by total memory usage */
|
|
|
|
|
|
|
|
int
|
|
|
|
compare_size(pp1, pp2)
|
|
|
|
|
|
|
|
struct proc **pp1;
|
|
|
|
struct proc **pp2;
|
|
|
|
|
|
|
|
{
|
|
|
|
register struct kinfo_proc *p1;
|
|
|
|
register struct kinfo_proc *p2;
|
|
|
|
register int result;
|
|
|
|
register pctcpu lresult;
|
|
|
|
|
|
|
|
/* remove one level of indirection */
|
|
|
|
p1 = *(struct kinfo_proc **) pp1;
|
|
|
|
p2 = *(struct kinfo_proc **) pp2;
|
|
|
|
|
|
|
|
ORDERKEY_MEM
|
|
|
|
ORDERKEY_RSSIZE
|
|
|
|
ORDERKEY_PCTCPU
|
|
|
|
ORDERKEY_CPTICKS
|
|
|
|
ORDERKEY_STATE
|
|
|
|
ORDERKEY_PRIO
|
|
|
|
;
|
|
|
|
|
|
|
|
return(result);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* compare_res - the comparison function for sorting by resident set size */
|
|
|
|
|
|
|
|
int
|
|
|
|
compare_res(pp1, pp2)
|
|
|
|
|
|
|
|
struct proc **pp1;
|
|
|
|
struct proc **pp2;
|
|
|
|
|
|
|
|
{
|
|
|
|
register struct kinfo_proc *p1;
|
|
|
|
register struct kinfo_proc *p2;
|
|
|
|
register int result;
|
|
|
|
register pctcpu lresult;
|
|
|
|
|
|
|
|
/* remove one level of indirection */
|
|
|
|
p1 = *(struct kinfo_proc **) pp1;
|
|
|
|
p2 = *(struct kinfo_proc **) pp2;
|
|
|
|
|
|
|
|
ORDERKEY_RSSIZE
|
|
|
|
ORDERKEY_MEM
|
|
|
|
ORDERKEY_PCTCPU
|
|
|
|
ORDERKEY_CPTICKS
|
|
|
|
ORDERKEY_STATE
|
|
|
|
ORDERKEY_PRIO
|
|
|
|
;
|
|
|
|
|
|
|
|
return(result);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* compare_time - the comparison function for sorting by total cpu time */
|
|
|
|
|
|
|
|
int
|
|
|
|
compare_time(pp1, pp2)
|
|
|
|
|
|
|
|
struct proc **pp1;
|
|
|
|
struct proc **pp2;
|
|
|
|
|
|
|
|
{
|
|
|
|
register struct kinfo_proc *p1;
|
|
|
|
register struct kinfo_proc *p2;
|
|
|
|
register int result;
|
|
|
|
register pctcpu lresult;
|
|
|
|
|
|
|
|
/* remove one level of indirection */
|
|
|
|
p1 = *(struct kinfo_proc **) pp1;
|
|
|
|
p2 = *(struct kinfo_proc **) pp2;
|
|
|
|
|
|
|
|
ORDERKEY_CPTICKS
|
|
|
|
ORDERKEY_PCTCPU
|
|
|
|
ORDERKEY_STATE
|
|
|
|
ORDERKEY_PRIO
|
|
|
|
ORDERKEY_RSSIZE
|
|
|
|
ORDERKEY_MEM
|
|
|
|
;
|
|
|
|
|
|
|
|
return(result);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* compare_prio - the comparison function for sorting by cpu percentage */
|
|
|
|
|
|
|
|
int
|
|
|
|
compare_prio(pp1, pp2)
|
|
|
|
|
|
|
|
struct proc **pp1;
|
|
|
|
struct proc **pp2;
|
|
|
|
|
|
|
|
{
|
|
|
|
register struct kinfo_proc *p1;
|
|
|
|
register struct kinfo_proc *p2;
|
|
|
|
register int result;
|
|
|
|
register pctcpu lresult;
|
|
|
|
|
|
|
|
/* remove one level of indirection */
|
|
|
|
p1 = *(struct kinfo_proc **) pp1;
|
|
|
|
p2 = *(struct kinfo_proc **) pp2;
|
|
|
|
|
|
|
|
ORDERKEY_PRIO
|
|
|
|
ORDERKEY_CPTICKS
|
|
|
|
ORDERKEY_PCTCPU
|
|
|
|
ORDERKEY_STATE
|
|
|
|
ORDERKEY_RSSIZE
|
|
|
|
ORDERKEY_MEM
|
|
|
|
;
|
|
|
|
|
|
|
|
return(result);
|
|
|
|
}
|
|
|
|
#endif
|
1997-03-23 18:55:20 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* proc_owner(pid) - returns the uid that owns process "pid", or -1 if
|
|
|
|
* the process does not exist.
|
|
|
|
* It is EXTREMLY IMPORTANT that this function work correctly.
|
|
|
|
* If top runs setuid root (as in SVR4), then this function
|
|
|
|
* is the only thing that stands in the way of a serious
|
|
|
|
* security problem. It validates requests for the "kill"
|
|
|
|
* and "renice" commands.
|
|
|
|
*/
|
|
|
|
|
|
|
|
int proc_owner(pid)
|
|
|
|
|
|
|
|
int pid;
|
|
|
|
|
|
|
|
{
|
|
|
|
register int cnt;
|
|
|
|
register struct kinfo_proc **prefp;
|
|
|
|
register struct kinfo_proc *pp;
|
|
|
|
|
|
|
|
prefp = pref;
|
|
|
|
cnt = pref_len;
|
|
|
|
while (--cnt >= 0)
|
|
|
|
{
|
|
|
|
pp = *prefp++;
|
Change the proc information returned from the kernel so that it
no longer contains kernel specific data structures, but rather
only scalar values and structures that are already part of the
kernel/user interface, specifically rusage and rtprio. It no
longer contains proc, session, pcred, ucred, procsig, vmspace,
pstats, mtx, sigiolst, klist, callout, pasleep, or mdproc. If
any of these changed in size, ps, w, fstat, gcore, systat, and
top would all stop working. The new structure has over 200 bytes
of unassigned space for future values to be added, yet is nearly
100 bytes smaller per entry than the structure that it replaced.
2000-12-12 07:25:57 +00:00
|
|
|
if (pp->ki_pid == (pid_t)pid)
|
1997-03-23 18:55:20 +00:00
|
|
|
{
|
Change the proc information returned from the kernel so that it
no longer contains kernel specific data structures, but rather
only scalar values and structures that are already part of the
kernel/user interface, specifically rusage and rtprio. It no
longer contains proc, session, pcred, ucred, procsig, vmspace,
pstats, mtx, sigiolst, klist, callout, pasleep, or mdproc. If
any of these changed in size, ps, w, fstat, gcore, systat, and
top would all stop working. The new structure has over 200 bytes
of unassigned space for future values to be added, yet is nearly
100 bytes smaller per entry than the structure that it replaced.
2000-12-12 07:25:57 +00:00
|
|
|
return((int)pp->ki_ruid);
|
1997-03-23 18:55:20 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return(-1);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
swapmode(retavail, retfree)
|
|
|
|
int *retavail;
|
|
|
|
int *retfree;
|
|
|
|
{
|
1999-01-22 11:09:41 +00:00
|
|
|
int n;
|
|
|
|
int pagesize = getpagesize();
|
|
|
|
struct kvm_swap swapary[1];
|
1997-03-23 18:55:20 +00:00
|
|
|
|
1999-01-22 11:09:41 +00:00
|
|
|
*retavail = 0;
|
|
|
|
*retfree = 0;
|
1997-03-23 18:55:20 +00:00
|
|
|
|
1999-01-22 11:09:41 +00:00
|
|
|
#define CONVERT(v) ((quad_t)(v) * pagesize / 1024)
|
1997-03-23 18:55:20 +00:00
|
|
|
|
1999-01-22 11:09:41 +00:00
|
|
|
n = kvm_getswapinfo(kd, swapary, 1, 0);
|
1999-02-06 06:33:55 +00:00
|
|
|
if (n < 0 || swapary[0].ksw_total == 0)
|
1999-01-22 11:09:41 +00:00
|
|
|
return(0);
|
1997-03-23 18:55:20 +00:00
|
|
|
|
1999-01-22 11:09:41 +00:00
|
|
|
*retavail = CONVERT(swapary[0].ksw_total);
|
|
|
|
*retfree = CONVERT(swapary[0].ksw_total - swapary[0].ksw_used);
|
1997-03-23 18:55:20 +00:00
|
|
|
|
1999-01-22 11:09:41 +00:00
|
|
|
n = (int)((double)swapary[0].ksw_used * 100.0 /
|
|
|
|
(double)swapary[0].ksw_total);
|
|
|
|
return(n);
|
1997-03-23 18:55:20 +00:00
|
|
|
}
|
1999-01-22 11:09:41 +00:00
|
|
|
|