v29i109: top-3.4 - top process display, V3.4, Part08/22

[William Lefebvre]

Submitted-By: w...@groupsys.com (William Lefebvre)
Posting-Number: Volume 29, Issue 109
Archive-Name: top-3.4/part08

#! /bin/sh
# This is a shell archive. Remove anything before this line, then unpack
# it by saving it into a file and typing "sh file". To overwrite existing
# files, type "sh file -c". You can also feed this as standard input via
# unshar, or by typing "sh <file", e.g.. If this archive is complete, you
# will see the following message at the end:
# "End of archive 8 (of 22)."
# Contents: top-3.4/machine/m_386bsd.c top-3.4/machine/m_bsd386.c
# top-3.4/machine/m_dcosx.c
# Wrapped by lefebvre@acapulco on Fri Aug 30 12:35:50 1996
PATH=/bin:/usr/bin:/usr/ucb ; export PATH
if test -f 'top-3.4/machine/m_386bsd.c' -a "${1}" != "-c" ; then
echo shar: Will not clobber existing file \"'top-3.4/machine/m_386bsd.c'\"
else
echo shar: Extracting \"'top-3.4/machine/m_386bsd.c'\" \(16918 characters\)
sed "s/^X//" >'top-3.4/machine/m_386bsd.c' <<'END_OF_FILE'
X/*
X * top - a top users display for Unix
X *
X * SYNOPSIS: For a 386BSD system
X * Note memory statistisc and process sizes could be wrong,
X * by ps gets them wrong too...
X *
X * DESCRIPTION:
X * This is the machine-dependent module for BSD4.3 NET/2 386bsd
X * READ THE NOTE AT THE END OF "INSTALL" BEFORE COMPILING.
X * Works for:
X * i386 PC
X *
X * LIBS: -lutil
X *
X * AUTHOR: Steve Hocking (adapted from Christos Zoulas <chri...@ee.cornell.edu>)
X * Updated by Andrew Herbert <and...@werple.apana.org.au>
X */
X
X#include <sys/types.h>
X#include <sys/signal.h>
X#include <sys/param.h>
X
X#include <stdio.h>
X#include <nlist.h>
X#include <math.h>
X#include <kvm.h>
X#include <sys/errno.h>
X#include <sys/kinfo.h>
X#include <sys/kinfo_proc.h>
X#ifdef notyet
X#define time __time
X#define hz __hz
X#include <sys/kernel.h>
X#undef time
X#undef hz
X#endif
X#include <sys/dir.h>
X#include <sys/dkstat.h>
X#include <sys/file.h>
X#include <sys/time.h>
X#include <sys/vmmeter.h>
X
X
X/* #define PATCHED_KVM /* READ THE FOLLOWING NOTE: */
X /* define this ONLY if your version of 386bsd
X has patchkit 2.4 installed. */
X
X/* #define TOTAL_WORKING */ /* Uncomment when the total structure in */
X /* the kernel actually works */
X#define DOSWAP
X
X#include "top.h"
X#include "machine.h"
X#include "utils.h"
X
X#define VMUNIX "/386bsd"
X#define KMEM "/dev/kmem"
X#define MEM "/dev/mem"
X#ifdef DOSWAP
X#define SWAP "/dev/drum"
X#endif
X
Xtypedef struct _kinfo {
X struct proc ki_p; /* proc structure */
X struct eproc ki_e; /* extra stuff */
X} KINFO;
X
X/* get_process_info passes back a handle. This is what it looks like: */
X
Xstruct handle
X{
X KINFO **next_proc; /* points to next valid proc pointer */
X int remaining; /* number of pointers remaining */
X};
X
X/* declarations for load_avg */
X#include "loadavg.h"
X
X#define PP(pp, field) ((pp)->ki_p . field)
X#define EP(pp, field) ((pp)->ki_e . field)
X#define VP(pp, field) ((pp)->ki_e.e_vm . field)
X
X/* define what weighted cpu is. */
X#define weighted_cpu(pct, pp) (PP((pp), p_time) == 0 ? 0.0 : \
X ((pct) / (1.0 - exp(PP((pp), p_time) * logcpu))))
X
X/* what we consider to be process size: */
X#define PROCSIZE(pp) (VP((pp), vm_tsize) + VP((pp), vm_dsize) + VP((pp), vm_ssize))
X
X/* definitions for indices in the nlist array */
X#define X_CCPU 0
X#define X_CP_TIME 1
X#define X_HZ 2
X#define X_AVENRUN 3
X#define X_TOTAL 4
X#define X_PG_FREE 5
X#define X_PG_ACTIVE 6
X#define X_PG_INACTIVE 7
X#define X_PG_WIRED 8
X
Xstatic struct nlist nlst[] = {
X { "_ccpu" }, /* 0 */
X { "_cp_time" }, /* 1 */
X { "_hz" }, /* 2 */
X { "_averunnable" }, /* 3 */
X { "_total"}, /* 4 */
X { "_vm_page_free_count" }, /* 5 */
X { "_vm_page_active_count" }, /* 6 */
X { "_vm_page_inactive_count" },/* 7 */
X { "_vm_page_wire_count" }, /* 8 */
X { 0 }
X};
X
X/*
X * These definitions control the format of the per-process area
X */
X
Xstatic char header[] =
X " PID X PRI NICE SIZE RES STATE TIME WCPU CPU COMMAND";
X/* 0123456 -- field to fill in starts at header+6 */
X#define UNAME_START 6
X
X#define Proc_format \
X "%5d %-8.8s %3d %4d %5s %5s %-5s %6s %5.2f%% %5.2f%% %.16s"
X
X
X/* process state names for the "STATE" column of the display */
X/* the extra nulls in the string "run" are for adding a slash and
X the processor number when needed */
X
Xchar *state_abbrev[] =
X{
X "", "sleep", "WAIT", "run\0\0\0", "start", "zomb", "stop"
X};
X
X
X/* values that we stash away in _init and use in later routines */
X
Xstatic double logcpu;
X
X/* these are retrieved from the kernel in _init */
X
Xstatic long hz;
Xstatic load_avg ccpu;
Xstatic int ncpu = 0;
X
X/* these are offsets obtained via nlist and used in the get_ functions */
X
Xstatic unsigned long cp_time_offset;
Xstatic unsigned long avenrun_offset;
X
X/* these are for calculating cpu state percentages */
X
Xstatic long cp_time[CPUSTATES];
Xstatic long cp_old[CPUSTATES];
Xstatic long cp_diff[CPUSTATES];
X
X/* these are for detailing the process states */
X
Xint process_states[7];
Xchar *procstatenames[] = {
X "", " sleeping, ", " ABANDONED, ", " running, ", " starting, ",
X " zombie, ", " stopped, ",
X NULL
X};
X
X/* these are for detailing the cpu states */
X
Xint cpu_states[4];
Xchar *cpustatenames[] = {
X "user", "nice", "system", "idle", NULL
X};
X
X/* these are for detailing the memory statistics */
X
Xint memory_stats[8];
Xchar *memorynames[] = {
X#ifdef TOTAL_WORKING
X "Real: ", "K/", "K ", "Virt: ", "K/",
X "K ", "Free: ", "K", NULL
X#else
X " Free: ", "K ", " Active: ", "K ", " Inactive: ",
X "K ", " Wired: ", "K ", NULL
X#endif
X};
X
X/* these are for keeping track of the proc array */
X
Xstatic int bytes;
Xstatic int nproc;
Xstatic int onproc = -1;
Xstatic int pref_len;
Xstatic KINFO *pbase;
Xstatic KINFO **pref;
X
X/* these are for getting the memory statistics */
X
Xstatic int pageshift; /* log base 2 of the pagesize */
X
X/* define pagetok in terms of pageshift */
X
X#define pagetok(size) ((size) << pageshift)
X
Xmachine_init(statics)
X
Xstruct statics *statics;
X
X{
X register int i = 0;
X register int pagesize;
X char buf[1024];
X
X#if 0 /* some funny stuff going on here */
X if (kvm_openfiles(NULL, NULL, NULL) == -1);
X return -1;
X#else
X kvm_openfiles(VMUNIX, NULL, NULL);
X#endif
X
X /* get the list of symbols we want to access in the kernel */
X (void) kvm_nlist(nlst);
X if (nlst[0].n_type == 0)
X {
X fprintf(stderr, "top: nlist failed\n");
X return(-1);
X }
X
X /* make sure they were all found */
X if (i > 0 && check_nlist(nlst) > 0)
X {
X return(-1);
X }
X
X /* get the symbol values out of kmem */
X (void) getkval(nlst[X_HZ].n_value, (int *)(&hz), sizeof(hz),
X nlst[X_HZ].n_name);
X (void) getkval(nlst[X_CCPU].n_value, (int *)(&ccpu), sizeof(ccpu),
X nlst[X_CCPU].n_name);
X
X /* stash away certain offsets for later use */
X cp_time_offset = nlst[X_CP_TIME].n_value;
X avenrun_offset = nlst[X_AVENRUN].n_value;
X
X /* this is used in calculating WCPU -- calculate it ahead of time */
X logcpu = log(loaddouble(ccpu));
X
X pbase = NULL;
X pref = NULL;
X nproc = 0;
X onproc = -1;
X /* get the page size with "getpagesize" and calculate pageshift from it */
X pagesize = getpagesize();
X pageshift = 0;
X while (pagesize > 1)
X {
X pageshift++;
X pagesize >>= 1;
X }
X
X /* we only need the amount of log(2)1024 for our conversion */
X pageshift -= LOG1024;
X
X /* fill in the statics information */
X statics->procstate_names = procstatenames;
X statics->cpustate_names = cpustatenames;
X statics->memory_names = memorynames;
X
X /* all done! */
X return(0);
X}
X
Xchar *format_header(uname_field)
X
Xregister char *uname_field;
X
X{
X register char *ptr;
X
X ptr = header + UNAME_START;
X while (*uname_field != '\0')
X {
X *ptr++ = *uname_field++;
X }
X
X return(header);
X}
X
Xget_system_info(si)
X
Xstruct system_info *si;
X
X{
X long total;
X load_avg avenrun[3];
X
X /* get the cp_time array */
X (void) getkval(cp_time_offset, (int *)cp_time, sizeof(cp_time),
X "_cp_time");
X (void) getkval(avenrun_offset, (int *)avenrun, sizeof(avenrun),
X "_avenrun");
X
X /* convert load averages to doubles */
X {
X register int i;
X register double *infoloadp;
X load_avg *avenrunp;
X
X#ifdef KINFO_LOADAVG
X struct loadavg sysload;
X int size;
X getkerninfo(KINFO_LOADAVG, &sysload, &size, 0);
X#endif
X
X infoloadp = si->load_avg;
X avenrunp = avenrun;
X for (i = 0; i < 3; i++)
X {
X#ifdef KINFO_LOADAVG
X *infoloadp++ = ((double) sysload.ldavg[i]) / sysload.fscale;
X#endif
X *infoloadp++ = loaddouble(*avenrunp++);
X }
X }
X
X /* convert cp_time counts to percentages */
X total = percentages(CPUSTATES, cpu_states, cp_time, cp_old, cp_diff);
X
X /* sum memory statistics */
X {
X#ifdef TOTAL_WORKING
X static struct vmtotal total;
X int size;
X
X /* get total -- systemwide main memory usage structure */
X#ifdef KINFO_METER
X getkerninfo(KINFO_METER, &total, &size, 0);
X#else
X (void) getkval(nlst[X_TOTAL].n_value, (int *)(&total), sizeof(total),
X nlst[X_TOTAL].n_name);
X#endif
X /* convert memory stats to Kbytes */
X memory_stats[0] = -1;
X memory_stats[1] = pagetok(total.t_arm);
X memory_stats[2] = pagetok(total.t_rm);
X memory_stats[3] = -1;
X memory_stats[4] = pagetok(total.t_avm);
X memory_stats[5] = pagetok(total.t_vm);
X memory_stats[6] = -1;
X memory_stats[7] = pagetok(total.t_free);
X#else
X static int free, active, inactive, wired;
X
X (void) getkval(nlst[X_PG_FREE].n_value, (int *)(&free), sizeof(free),
X nlst[X_PG_FREE].n_name);
X (void) getkval(nlst[X_PG_ACTIVE].n_value, (int *)(&active), sizeof(active),
X nlst[X_PG_ACTIVE].n_name);
X (void) getkval(nlst[X_PG_INACTIVE].n_value, (int *)(&inactive), sizeof(inactive),
X nlst[X_PG_INACTIVE].n_name);
X (void) getkval(nlst[X_PG_WIRED].n_value, (int *)(&wired), sizeof(wired),
X nlst[X_PG_WIRED].n_name);
X memory_stats[0] = -1;
X memory_stats[1] = pagetok(free);
X memory_stats[2] = -1;
X memory_stats[3] = pagetok(active);
X memory_stats[4] = -1;
X memory_stats[5] = pagetok(inactive);
X memory_stats[6] = -1;
X memory_stats[7] = pagetok(wired);
X#endif
X }
X
X /* set arrays and strings */
X si->cpustates = cpu_states;
X si->memory = memory_stats;
X si->last_pid = -1;
X}
X
Xstatic struct handle handle;
X
Xcaddr_t get_process_info(si, sel, compare)
X
Xstruct system_info *si;
Xstruct process_select *sel;
Xint (*compare)();
X
X{
X register int i;
X register int total_procs;
X register int active_procs;
X register KINFO **prefp;
X KINFO *pp;
X struct proc *pr;
X struct eproc *epr;
X
X /* these are copied out of sel for speed */
X int show_idle;
X int show_system;
X int show_uid;
X int show_command;
X
X
X nproc = kvm_getprocs(KINFO_PROC_ALL, 0);
X if (nproc > onproc)
X {
X pref = (KINFO **) realloc(pref, sizeof(KINFO *)
X * nproc);
X pbase = (KINFO *) realloc(pbase, sizeof(KINFO)
X * (nproc + 2));
X onproc = nproc;
X }
X if (pref == NULL || pbase == NULL) {
X (void) fprintf(stderr, "top: Out of memory.\n");
X quit(23);
X }
X /* get a pointer to the states summary array */
X si->procstates = process_states;
X
X /* set up flags which define what we are going to select */
X show_idle = sel->idle;
X show_system = sel->system;
X show_uid = sel->uid != -1;
X show_command = sel->command != NULL;
X
X /* count up process states and get pointers to interesting procs */
X total_procs = 0;
X active_procs = 0;
X memset((char *)process_states, 0, sizeof(process_states));
X prefp = pref;
X for (pp = pbase, i = 0; pr = kvm_nextproc(); pp++, i++)
X {
X /*
X * Place pointers to each valid proc structure in pref[].
X * Process slots that are actually in use have a non-zero
X * status field. Processes with SSYS set are system
X * processes---these get ignored unless show_sysprocs is set.
X */
X epr = kvm_geteproc(pr);
X pp->ki_p = *pr;
X pp->ki_e = *epr;
X if (PP(pp, p_stat) != 0 &&
X (show_system || ((PP(pp, p_flag) & SSYS) == 0)))
X {
X total_procs++;
X process_states[PP(pp, p_stat)]++;
X if ((PP(pp, p_stat) != SZOMB) &&
X (show_idle || (PP(pp, p_pctcpu) != 0) ||
X (PP(pp, p_stat) == SRUN)) &&
X (!show_uid || EP(pp, e_pcred.p_ruid) == (uid_t)sel->uid))
X {
X *prefp++ = pp;
X active_procs++;
X }
X }
X }
X
X /* if requested, sort the "interesting" processes */
X if (compare != NULL)
X {
X qsort((char *)pref, active_procs, sizeof(KINFO *), compare);
X }
X
X /* remember active and total counts */
X si->p_total = total_procs;
X si->p_active = pref_len = active_procs;
X
X /* pass back a handle */
X handle.next_proc = pref;
X handle.remaining = active_procs;
X#ifndef PATCHED_KVM
X kvm_freeprocs();
X#endif
X return((caddr_t)&handle);
X}
X
Xchar fmt[MAX_COLS]; /* static area where result is built */
X
Xchar *format_next_process(handle, get_userid)
X
Xcaddr_t handle;
Xchar *(*get_userid)();
X
X{
X register KINFO *pp;
X register long cputime;
X register double pct;
X int where;
X struct handle *hp;
X
X /* find and remember the next proc structure */
X hp = (struct handle *)handle;
X pp = *(hp->next_proc++);
X hp->remaining--;
X
X
X /* get the process's user struct and set cputime */
X cputime = PP(pp, p_utime.tv_sec) + PP(pp, p_stime.tv_sec);
X
X /* calculate the base for cpu percentages */
X pct = pctdouble(PP(pp, p_pctcpu));
X
X /* format this entry */
X sprintf(fmt,
X Proc_format,
X PP(pp, p_pid),
X (*get_userid)(EP(pp, e_pcred.p_ruid)),
X PP(pp, p_pri) - PZERO,
X PP(pp, p_nice) - NZERO,
X format_k(pagetok(PROCSIZE(pp))),
X#ifdef notyet
X format_k(pagetok(VP(pp, vm_rssize))),
X#else
X format_k(pagetok(pp->ki_e.e_vm.vm_pmap.pm_stats.resident_count)),
X#endif
X state_abbrev[PP(pp, p_stat)],
X format_time(cputime),
X 100.0 * weighted_cpu(pct, pp),
X 100.0 * pct,
X printable(PP(pp, p_comm)));
X
X /* return the result */
X return(fmt);
X}
X
X
X/*
X * check_nlist(nlst) - checks the nlist to see if any symbols were not
X * found. For every symbol that was not found, a one-line
X * message is printed to stderr. The routine returns the
X * number of symbols NOT found.
X */
X
Xint check_nlist(nlst)
X
Xregister struct nlist *nlst;
X
X{
X register int i;
X
X /* check to see if we got ALL the symbols we requested */
X /* this will write one line to stderr for every symbol not found */
X
X i = 0;
X while (nlst->n_name != NULL)
X {
X if (nlst->n_type == 0)
X {
X /* this one wasn't found */
X fprintf(stderr, "kernel: no symbol named `%s'\n", nlst->n_name);
X i = 1;
X }
X nlst++;
X }
X
X return(i);
X}
X
X
X/*
X * getkval(offset, ptr, size, refstr) - get a value out of the kernel.
X * "offset" is the byte offset into the kernel for the desired value,
X * "ptr" points to a buffer into which the value is retrieved,
X * "size" is the size of the buffer (and the object to retrieve),
X * "refstr" is a reference string used when printing error meessages,
X * if "refstr" starts with a '!', then a failure on read will not
X * be fatal (this may seem like a silly way to do things, but I
X * really didn't want the overhead of another argument).
X *
X */
X
Xgetkval(offset, ptr, size, refstr)
X
Xunsigned long offset;
Xint *ptr;
Xint size;
Xchar *refstr;
X
X{
X if (kvm_read((void *) offset, (void *) ptr, size) != size)
X {
X if (*refstr == '!')
X {
X return(0);
X }
X else
X {
X fprintf(stderr, "top: kvm_read for %s: %s\n",
X refstr, strerror(errno));
X quit(23);
X }
X }
X return(1);
X}
X
X/* comparison routine for qsort */
X
X/*
X * proc_compare - comparison function for "qsort"
X * Compares the resource consumption of two processes using five
X * distinct keys. The keys (in descending order of importance) are:
X * percent cpu, cpu ticks, state, resident set size, total virtual
X * memory usage. The process states are ordered as follows (from least
X * to most important): WAIT, zombie, sleep, stop, start, run. The
X * array declaration below maps a process state index into a number
X * that reflects this ordering.
X */
X
Xstatic unsigned char sorted_state[] =
X{
X 0, /* not used */
X 3, /* sleep */
X 1, /* ABANDONED (WAIT) */
X 6, /* run */
X 5, /* start */
X 2, /* zombie */
X 4 /* stop */
X};
X
Xproc_compare(pp1, pp2)
X
XKINFO **pp1;
XKINFO **pp2;
X
X{
X register KINFO *p1;
X register KINFO *p2;
X register int result;
X register pctcpu lresult;
X
X /* remove one level of indirection */
X p1 = *pp1;
X p2 = *pp2;
X
X /* compare percent cpu (pctcpu) */
X if ((lresult = PP(p2, p_pctcpu) - PP(p1, p_pctcpu)) == 0)
X {
X /* use cpticks to break the tie */
X if ((result = PP(p2, p_cpticks) - PP(p1, p_cpticks)) == 0)
X {
X /* use process state to break the tie */
X if ((result = sorted_state[PP(p2, p_stat)] -
X sorted_state[PP(p1, p_stat)]) == 0)
X {
X /* use priority to break the tie */
X if ((result = PP(p2, p_pri) - PP(p1, p_pri)) == 0)
X {
X /* use resident set size (rssize) to break the tie */
X if ((result = VP(p2, vm_rssize) - VP(p1, vm_rssize)) == 0)
X {
X /* use total memory to break the tie */
X result = PROCSIZE(p2) - PROCSIZE(p1);
X }
X }
X }
X }
X }
X else
X {
X result = lresult < 0 ? -1 : 1;
X }
X
X return(result);
X}
X
X/*
X * proc_owner(pid) - returns the uid that owns process "pid", or -1 if
X * the process does not exist.
X * It is EXTREMLY IMPORTANT that this function work correctly.
X * If top runs setuid root (as in SVR4), then this function
X * is the only thing that stands in the way of a serious
X * security problem. It validates requests for the "kill"
X * and "renice" commands.
X */
X
Xint proc_owner(pid)
X
Xint pid;
X
X{
X register int cnt;
X register KINFO **prefp;
X register KINFO *pp;
X
X prefp = pref;
X cnt = pref_len;
X while (--cnt >= 0)
X {
X pp = *prefp++;
X if (PP(pp, p_pid) == (pid_t)pid)
X {
X return((int)EP(pp, e_pcred.p_ruid));
X }
X }
X return(-1);
X}
END_OF_FILE
if test 16918 -ne `wc -c <'top-3.4/machine/m_386bsd.c'`; then
echo shar: \"'top-3.4/machine/m_386bsd.c'\" unpacked with wrong size!
fi
# end of 'top-3.4/machine/m_386bsd.c'
fi
if test -f 'top-3.4/machine/m_bsd386.c' -a "${1}" != "-c" ; then
echo shar: Will not clobber existing file \"'top-3.4/machine/m_bsd386.c'\"
else
echo shar: Extracting \"'top-3.4/machine/m_bsd386.c'\" \(16556 characters\)
sed "s/^X//" >'top-3.4/machine/m_bsd386.c' <<'END_OF_FILE'
X/*
X * top - a top users display for Unix
X *
X * SYNOPSIS: For a BSD/386 system
X * Note memory statistic and process sizes could be wrong,
X * but ps gets them wrong too...
X *
X * DESCRIPTION:
X * This is the machine-dependent module for BSD/386
X * Works for:
X * hp300
X * i386
X *
X * CFLAGS: -DHAVE_GETOPT
X *
X * LIBS: -lkvm
X *
X * AUTHOR: Christos Zoulas <chri...@ee.cornell.edu>
X */
X
X#include <sys/types.h>
X#include <sys/signal.h>
X#include <sys/param.h>
X
X#include <stdio.h>
X#include <nlist.h>
X#include <math.h>
X#ifdef __bsdi__
X#include <sys/time.h>
X#include <sys/proc.h>
X#include <sys/vmmeter.h>
X#endif
X#include <kvm.h>
X#include <sys/errno.h>
X#include <sys/kinfo.h>
X#include <sys/kinfo_proc.h>
X#ifdef notyet
X#define time __time
X#define hz __hz
X#include <sys/kernel.h>
X#undef time
X#undef hz
X#endif
X#include <sys/dir.h>
X#ifdef __bsdi__
X#include <sys/cpustats.h>
X#include <sys/sysinfo.h>
X#else
X#include <sys/dkstat.h>
X#endif
X#include <sys/file.h>
X#include <sys/time.h>
X
X
X#define DOSWAP
X
X#include "top.h"
X#include "machine.h"
X#include "utils.h"
X
X#ifdef __bsdi__
X#define VMUNIX "/bsd"
X#else
X#define VMUNIX "/vmunix"
X#endif
X#define KMEM "/dev/kmem"
X#define MEM "/dev/mem"
X#ifdef DOSWAP
X#define SWAP "/dev/drum"
X#endif
X
X/* get_process_info passes back a handle. This is what it looks like: */
X
Xstruct handle
X{
X struct kinfo_proc **next_proc; /* points to next valid proc pointer */
X int remaining; /* number of pointers remaining */
X};
X
X/* declarations for load_avg */
X#include "loadavg.h"
X
X#define PP(pp, field) ((pp)->kp_proc . field)
X#define EP(pp, field) ((pp)->kp_eproc . field)
X#define VP(pp, field) ((pp)->kp_eproc.e_vm . field)
X
X/* define what weighted cpu is. */
X#define weighted_cpu(pct, pp) (PP((pp), p_time) == 0 ? 0.0 : \
X ((pct) / (1.0 - exp(PP((pp), p_time) * logcpu))))
X
X/* what we consider to be process size: */
X#define PROCSIZE(pp) (VP((pp), vm_tsize) \
X + VP((pp), vm_dsize) \
X + VP((pp), vm_ssize))
X
X/* definitions for indices in the nlist array */
X#define X_CCPU 0
X#ifdef __bsdi__
X#define X_TOTAL 1
X#else
X#define X_CP_TIME 1
X#endif
X#define X_HZ 2
X#define X_AVENRUN 3
X
Xstatic struct nlist nlst[] = {
X { "_ccpu" }, /* 0 */
X#ifdef __bsdi__
X { "_total" }, /* 1 */
X#else
X { "_cp_time" }, /* 1 */
X#endif
X { "_hz" }, /* 2 */
X { "_averunnable" }, /* 3 */
X { 0 }
X};
X
X/*
X * These definitions control the format of the per-process area
X */
X
Xstatic char header[] =
X " PID X PRI NICE SIZE RES STATE TIME WCPU CPU COMMAND";
X/* 0123456 -- field to fill in starts at header+6 */
X#define UNAME_START 6
X
X#define Proc_format \
X"%5d %-8.8s %3d %4d %5s %5s %-5s %6s %5.2f%% %5.2f%% %.16s"
X
X
X/* process state names for the "STATE" column of the display */
X/* the extra nulls in the string "run" are for adding a slash and
X the processor number when needed */
X
Xstatic char *state_abbrev[] =
X{
X "", "sleep", "WAIT", "run\0\0\0", "start", "zomb", "stop"
X};
X
X
Xstatic kvm_t *kd;
X
X/* values that we stash away in _init and use in later routines */
X
Xstatic double logcpu;
X
X/* these are retrieved from the kernel in _init */
X
Xstatic long hz;
Xstatic load_avg ccpu;
Xstatic int ncpu = 0;
X
X/* these are offsets obtained via nlist and used in the get_ functions */
X
X#ifdef __bsdi__
Xstatic unsigned long total_offset;
X#else
Xstatic unsigned long cp_time_offset;
X#endif
Xstatic unsigned long avenrun_offset;
X
X#ifndef __bsdi__
X/* these are for calculating cpu state percentages */
X
Xstatic u_long cp_time[CPUSTATES];
Xstatic u_long cp_old[CPUSTATES];
Xstatic u_long cp_diff[CPUSTATES];
X#endif
X
X/* these are for detailing the process states */
X
Xstatic int process_states[7];
Xstatic char *procstatenames[] = {
X "", " sleeping, ", " ABANDONED, ", " running, ", " starting, ",
X " zombie, ", " stopped, ",
X NULL
X};
X
X/* these are for detailing the cpu states */
X
Xstatic int cpu_states[CPUSTATES];
Xstatic char *cpustatenames[CPUSTATES+1] = {
X "user", "nice", "system", "idle", NULL
X};
X
X/* these are for detailing the memory statistics */
X
Xstatic int memory_stats[8];
Xstatic char *memorynames[] = {
X "Real: ", "K/", "K ", "Virt: ", "K/",
X "K ", "Free: ", "K", NULL
X};
X
X/* these are for keeping track of the proc array */
X
Xstatic int bytes;
Xstatic int nproc;
Xstatic int onproc = -1;
Xstatic int pref_len;
Xstatic struct kinfo_proc *pbase;
Xstatic struct kinfo_proc **pref;
X
X/* these are for getting the memory statistics */
X
Xstatic int pageshift; /* log base 2 of the pagesize */
X
X/* define pagetok in terms of pageshift */
X
X#define pagetok(size) ((size) << pageshift)
X
Xmachine_init(statics)
X
Xstruct statics *statics;
X
X{
X register int i = 0;
X register int pagesize;
X
X if ((kd = kvm_open(VMUNIX, MEM, SWAP, O_RDONLY, "kvm_open")) == NULL)
X return -1;
X
X
X /* get the list of symbols we want to access in the kernel */
X (void) kvm_nlist(kd, nlst);
X if (nlst[0].n_type == 0)
X {
X fprintf(stderr, "top: nlist failed\n");
X return(-1);
X }
X
X /* make sure they were all found */
X if (i > 0 && check_nlist(nlst) > 0)
X {
X return(-1);
X }
X
X /* get the symbol values out of kmem */
X (void) getkval(nlst[X_HZ].n_value, (int *)(&hz), sizeof(hz),
X nlst[X_HZ].n_name);
X (void) getkval(nlst[X_CCPU].n_value, (int *)(&ccpu), sizeof(ccpu),
X nlst[X_CCPU].n_name);
X
X /* stash away certain offsets for later use */
X#ifdef __bsdi__
X total_offset = nlst[X_TOTAL].n_value;
X#else
X cp_time_offset = nlst[X_CP_TIME].n_value;
X#endif
X avenrun_offset = nlst[X_AVENRUN].n_value;
X
X /* this is used in calculating WCPU -- calculate it ahead of time */
X logcpu = log(loaddouble(ccpu));
X
X pbase = NULL;
X pref = NULL;
X nproc = 0;
X onproc = -1;
X /* get the page size with "getpagesize" and calculate pageshift from it */
X pagesize = getpagesize();
X pageshift = 0;
X while (pagesize > 1)
X {
X pageshift++;
X pagesize >>= 1;
X }
X
X /* we only need the amount of log(2)1024 for our conversion */
X pageshift -= LOG1024;
X
X /* fill in the statics information */
X statics->procstate_names = procstatenames;
X statics->cpustate_names = cpustatenames;
X statics->memory_names = memorynames;
X
X /* all done! */
X return(0);
X}
X
Xchar *format_header(uname_field)
X
Xregister char *uname_field;
X
X{
X register char *ptr;
X
X ptr = header + UNAME_START;
X while (*uname_field != '\0')
X {
X *ptr++ = *uname_field++;
X }
X
X return(header);
X}
X
Xget_system_info(si)
X
Xstruct system_info *si;
X
X{
X register u_long total;
X load_avg avenrun[3];
X#ifdef __bsdi__
X struct cpustats cpu;
X struct sysinfo sys;
X int size;
X#else
X load_avg *avenrunp = avenrun;
X#endif
X
X /* get the various high-level data structures */
X#ifdef __bsdi__
X size = sizeof(struct cpustats);
X if (getkerninfo(KINFO_CPU, &cpu, &size, 0) < 0) {
X perror("getkerninfo#1");
X abort();
X }
X#ifdef notyet
X size = sizeof(struct sysinfo);
X if (getkerninfo(KINFO_SYSINFO, &sys, &size, 0) < 0) {
X perror("getkerninfo#2");
X abort();
X }
X#endif /*notyet*/
X#else
X (void) getkval(cp_time_offset, (int *)cp_time, sizeof(cp_time),
X "_cp_time");
X (void) getkval(avenrun_offset, (int *)avenrun, sizeof(avenrun),
X "_avenrun");
X#endif
X
X /* convert load averages to doubles */
X {
X register int i;
X register double *infoloadp = si->load_avg;
X
X for (i = 0; i < CPUSTATES; i++)
X {
X#ifdef __bsdi__
X *infoloadp++ = ((double) cpu.cp_averunnable[i]) / FSCALE;
X#else
X *infoloadp++ = loaddouble(*avenrunp++);
X#endif
X }
X }
X
X /* convert cp_time counts to percentages */
X#ifdef __bsdi__
X {
X register int i;
X register double total, pct;
X
X total = 0.0;
X for (i = 0; i < CPUSTATES; i++)
X total += (double) cpu.cp_time[i];
X if (total == 0)
X pct = 0;
X else
X pct = 100 / total;
X for (i = 0; i < CPUSTATES; i++)
X cpu_states[i] = 10.0 * ((double)cpu.cp_time[i]) * pct;
X }
X#else
X total = percentages(CPUSTATES, cpu_states, cp_time, cp_old, cp_diff);
X#endif
X
X /* sum memory statistics */
X {
X struct vmtotal total;
X int size;
X
X#ifdef __bsdi__
X (void) getkval(total_offset, (int*)&total, sizeof(total),
X "_total");
X#else
X /* get total -- systemwide main memory usage structure */
X size = sizeof(struct vmtotal);
X getkerninfo(KINFO_METER, &total, &size, 0);
X#endif
X /* convert memory stats to Kbytes */
X memory_stats[0] = -1;
X memory_stats[1] = pagetok(total.t_arm);
X memory_stats[2] = pagetok(total.t_rm);
X memory_stats[3] = -1;
X memory_stats[4] = pagetok(total.t_avm);
X memory_stats[5] = pagetok(total.t_vm);
X memory_stats[6] = -1;
X memory_stats[7] = pagetok(total.t_free);
X }
X
X /* set arrays and strings */
X si->cpustates = cpu_states;
X si->memory = memory_stats;
X si->last_pid = -1;
X}
X
Xstatic struct handle handle;
X
Xcaddr_t get_process_info(si, sel, compare)
X
Xstruct system_info *si;
Xstruct process_select *sel;
Xint (*compare)();
X
X{
X register int i;
X register int total_procs;
X register int active_procs;
X register struct kinfo_proc **prefp;
X register struct kinfo_proc *pp;
X
X /* these are copied out of sel for speed */
X int show_idle;
X int show_system;
X int show_uid;
X int show_command;
X
X
X pbase = kvm_getprocs(kd, KINFO_PROC_ALL, 0, &nproc);
X if (nproc > onproc)
X pref = (struct kinfo_proc **) realloc(pref, sizeof(struct kinfo_proc *)
X * (onproc = nproc));
X if (pref == NULL || pbase == NULL) {
X (void) fprintf(stderr, "top: Out of memory.\n");
X quit(23);
X }
X /* get a pointer to the states summary array */
X si->procstates = process_states;
X
X /* set up flags which define what we are going to select */
X show_idle = sel->idle;
X show_system = sel->system;
X show_uid = sel->uid != -1;
X show_command = sel->command != NULL;
X
X /* count up process states and get pointers to interesting procs */
X total_procs = 0;
X active_procs = 0;
X memset((char *)process_states, 0, sizeof(process_states));
X prefp = pref;
X for (pp = pbase, i = 0; i < nproc; pp++, i++)
X {
X /*
X * Place pointers to each valid proc structure in pref[].
X * Process slots that are actually in use have a non-zero
X * status field. Processes with SSYS set are system
X * processes---these get ignored unless show_sysprocs is set.
X */
X if (PP(pp, p_stat) != 0 &&
X (show_system || ((PP(pp, p_flag) & SSYS) == 0)))
X {
X int p_stat = PP(pp, p_stat);
X
X total_procs++;
X if (p_stat < 1 || p_stat > 6)
X abort();
X process_states[p_stat]++;
X if ((PP(pp, p_stat) != SZOMB) &&
X (show_idle || (PP(pp, p_pctcpu) != 0) ||
X (PP(pp, p_stat) == SRUN)) &&
X (!show_uid || EP(pp, e_pcred.p_ruid) == (uid_t)sel->uid))
X {
X *prefp++ = pp;
X active_procs++;
X }
X }
X }
X
X /* if requested, sort the "interesting" processes */
X if (compare != NULL)
X {
X qsort((char *)pref, active_procs, sizeof(struct kinfo_proc *), compare);
X }
X
X /* remember active and total counts */
X si->p_total = total_procs;
X si->p_active = pref_len = active_procs;
X
X /* pass back a handle */
X handle.next_proc = pref;
X handle.remaining = active_procs;
X return((caddr_t)&handle);
X}
X
Xchar fmt[MAX_COLS]; /* static area where result is built */
X
Xchar *format_next_process(handle, get_userid)
X
Xcaddr_t handle;
Xchar *(*get_userid)();
X
X{
X register struct kinfo_proc *pp;
X register long cputime;
X register double pct;
X int where;
X struct handle *hp;
X
X /* find and remember the next proc structure */
X hp = (struct handle *)handle;
X pp = *(hp->next_proc++);
X hp->remaining--;
X
X
X /* get the process's user struct and set cputime */
X if ((PP(pp, p_flag) & SLOAD) == 0) {
X /*
X * Print swapped processes as <pname>
X */
X char *comm = PP(pp, p_comm);
X#define COMSIZ sizeof(PP(pp, p_comm))
X char buf[COMSIZ];
X (void) strncpy(buf, comm, COMSIZ);
X comm[0] = '<';
X (void) strncpy(&comm[1], buf, COMSIZ - 2);
X comm[COMSIZ - 2] = '\0';
X (void) strncat(comm, ">", COMSIZ - 1);
X comm[COMSIZ - 1] = '\0';
X }
X
X cputime = PP(pp, p_utime.tv_sec) + PP(pp, p_stime.tv_sec);
X
X /* calculate the base for cpu percentages */
X pct = pctdouble(PP(pp, p_pctcpu));
X
X /* format this entry */
X sprintf(fmt,
X Proc_format,
X PP(pp, p_pid),
X (*get_userid)(EP(pp, e_pcred.p_ruid)),
X PP(pp, p_pri) - PZERO,
X PP(pp, p_nice) - NZERO,
X format_k(pagetok(PROCSIZE(pp))),
X format_k(pagetok(VP(pp, vm_rssize))),
X state_abbrev[PP(pp, p_stat)],
X format_time(cputime),
X 100.0 * weighted_cpu(pct, pp),
X 100.0 * pct,
X printable(PP(pp, p_comm)));
X
X /* return the result */
X return(fmt);
X}
X
X
X/*
X * check_nlist(nlst) - checks the nlist to see if any symbols were not
X * found. For every symbol that was not found, a one-line
X * message is printed to stderr. The routine returns the
X * number of symbols NOT found.
X */
X
Xint check_nlist(nlst)
X
Xregister struct nlist *nlst;
X
X{
X register int i;
X
X /* check to see if we got ALL the symbols we requested */
X /* this will write one line to stderr for every symbol not found */
X
X i = 0;
X while (nlst->n_name != NULL)
X {
X if (nlst->n_type == 0)
X {
X /* this one wasn't found */
X fprintf(stderr, "kernel: no symbol named `%s'\n", nlst->n_name);
X i = 1;
X }
X nlst++;
X }
X
X return(i);
X}
X
X
X/*
X * getkval(offset, ptr, size, refstr) - get a value out of the kernel.
X * "offset" is the byte offset into the kernel for the desired value,
X * "ptr" points to a buffer into which the value is retrieved,
X * "size" is the size of the buffer (and the object to retrieve),
X * "refstr" is a reference string used when printing error meessages,
X * if "refstr" starts with a '!', then a failure on read will not
X * be fatal (this may seem like a silly way to do things, but I
X * really didn't want the overhead of another argument).
X *
X */
X
Xgetkval(offset, ptr, size, refstr)
X
Xunsigned long offset;
Xint *ptr;
Xint size;
Xchar *refstr;
X
X{
X if (kvm_read(kd, offset, (char *) ptr, size) != size)
X {
X if (*refstr == '!')
X {
X return(0);
X }
X else
X {
X fprintf(stderr, "top: kvm_read for %s: %s\n",
X refstr, strerror(errno));
X quit(23);
X }
X }
X return(1);
X}
X
X/* comparison routine for qsort */
X
X/*
X * proc_compare - comparison function for "qsort"
X * Compares the resource consumption of two processes using five
X * distinct keys. The keys (in descending order of importance) are:
X * percent cpu, cpu ticks, state, resident set size, total virtual
X * memory usage. The process states are ordered as follows (from least
X * to most important): WAIT, zombie, sleep, stop, start, run. The
X * array declaration below maps a process state index into a number
X * that reflects this ordering.
X */
X
Xstatic unsigned char sorted_state[] =
X{
X 0, /* not used */
X 3, /* sleep */
X 1, /* ABANDONED (WAIT) */
X 6, /* run */
X 5, /* start */
X 2, /* zombie */
X 4 /* stop */
X};
X
Xproc_compare(pp1, pp2)
X
Xstruct kinfo_proc **pp1;
Xstruct kinfo_proc **pp2;
X
X{
X register struct kinfo_proc *p1;
X register struct kinfo_proc *p2;
X register int result;
X register pctcpu lresult;
X
X /* remove one level of indirection */
X p1 = *pp1;
X p2 = *pp2;
X
X /* compare percent cpu (pctcpu) */
X if ((lresult = PP(p2, p_pctcpu) - PP(p1, p_pctcpu)) == 0)
X {
X /* use cpticks to break the tie */
X if ((result = PP(p2, p_cpticks) - PP(p1, p_cpticks)) == 0)
X {
X /* use process state to break the tie */
X if ((result = sorted_state[PP(p2, p_stat)] -
X sorted_state[PP(p1, p_stat)]) == 0)
X {
X /* use priority to break the tie */
X if ((result = PP(p2, p_pri) - PP(p1, p_pri)) == 0)
X {
X /* use resident set size (rssize) to break the tie */
X if ((result = VP(p2, vm_rssize) - VP(p1, vm_rssize)) == 0)
X {
X /* use total memory to break the tie */
X result = PROCSIZE(p2) - PROCSIZE(p1);
X }
X }
X }
X }
X }
X else
X {
X result = lresult < 0 ? -1 : 1;
X }
X
X return(result);
X}
X
X/*
X * proc_owner(pid) - returns the uid that owns process "pid", or -1 if
X * the process does not exist.
X * It is EXTREMLY IMPORTANT that this function work correctly.
X * If top runs setuid root (as in SVR4), then this function
X * is the only thing that stands in the way of a serious
X * security problem. It validates requests for the "kill"
X * and "renice" commands.
X */
X
Xint proc_owner(pid)
X
Xint pid;
X
X{
X register int cnt;
X register struct kinfo_proc **prefp;
X register struct kinfo_proc *pp;
X
X prefp = pref;
X cnt = pref_len;
X while (--cnt >= 0)
X {
X pp = *prefp++;
X if (PP(pp, p_pid) == (pid_t)pid)
X {
X return((int)EP(pp, e_pcred.p_ruid));
X }
X }
X return(-1);
X}
END_OF_FILE
if test 16556 -ne `wc -c <'top-3.4/machine/m_bsd386.c'`; then
echo shar: \"'top-3.4/machine/m_bsd386.c'\" unpacked with wrong size!
fi
# end of 'top-3.4/machine/m_bsd386.c'
fi
if test -f 'top-3.4/machine/m_dcosx.c' -a "${1}" != "-c" ; then
echo shar: Will not clobber existing file \"'top-3.4/machine/m_dcosx.c'\"
else
echo shar: Extracting \"'top-3.4/machine/m_dcosx.c'\" \(16366 characters\)
sed "s/^X//" >'top-3.4/machine/m_dcosx.c' <<'END_OF_FILE'
X/*
X * top - a top users display for Unix
X *
X * SYNOPSIS: For Pyramid DC/OSX
X *
X * DESCRIPTION:
X * DC/OSX for MISserver
X * DC/OSX for Nile
X *
X * LIBS: -lelf -lext
X *
X * AUTHORS: Phillip Wu <pw...@qantek.com.au>
X */
X
X#include "top.h"
X#include "machine.h"
X#include "utils.h"
X#include <stdio.h>
X#include <fcntl.h>
X#include <unistd.h>
X#include <stdlib.h>
X#include <errno.h>
X#include <dirent.h>
X#include <nlist.h>
X#include <string.h>
X#include <sys/types.h>
X#include <sys/param.h>
X#include <sys/tuneable.h>
X#include <sys/statis.h>
X#include <sys/proc.h>
X#include <sys/procfs.h>
X#include <sys/sysinfo.h>
X#include <sys/immu.h>
X#include <sys/sysmacros.h>
X#include <sys/vmmeter.h>
X#include <vm/anon.h>
X#include <sys/priocntl.h>
X#include <sys/rtpriocntl.h>
X#include <sys/tspriocntl.h>
X#include <sys/procset.h>
X#include <sys/var.h>
X
X#define UNIX "/stand/unix"
X#define KMEM "/dev/kmem"
X#define PROCFS "/proc"
X#define MAXCPU 24
X#define CPUSTATES 5
X
X#ifndef PRIO_MAX
X#define PRIO_MAX 20
X#endif
X#ifndef PRIO_MIN
X#define PRIO_MIN -20
X#endif
X
X#ifndef FSCALE
X#define FSHIFT 8 /* bits to right of fixed binary point */
X#define FSCALE (1<<FSHIFT)
X#endif
X
X#define loaddouble(x) ((double)(x) / FSCALE)
X#define percent_cpu(x) ((double)(x)->pr_cpu / FSCALE)
X#define weighted_cpu(pct, pp) ( ((pp)->pr_time.tv_sec) == 0 ? 0.0 : \
X ((pp)->pr_cpu) / ((pp)->pr_time.tv_sec) )
X#define pagetok(size) ctob(size) >> LOG1024
X
X/* definitions for the index in the nlist array */
X#define X_AVENRUN 0
X#define X_MPID 1
X#define X_V 2
X#define X_NPROC 3
X#define X_PHYSMEM 4
X
Xstatic struct nlist nlst[] =
X{
X {"avenrun"}, /* 0 */
X {"mpid"}, /* 1 */
X {"v"}, /* 2 */
X {"nproc"}, /* 3 */
X {"physmem"}, /* 4 */
X {NULL}
X};
X
Xstatic unsigned long avenrun_offset;
Xstatic unsigned long mpid_offset;
Xstatic unsigned long nproc_offset;
Xstatic unsigned long physmem_offset;
X
X/* get_process_info passes back a handle. This is what it looks like: */
X
Xstruct handle
X {
X struct prpsinfo **next_proc;/* points to next valid proc pointer */
X int remaining; /* number of pointers remaining */
X };
X
X/*
X * These definitions control the format of the per-process area
X */
X
Xstatic char header[] =
X" PID X PRI NICE SIZE RES STATE TIME WCPU CPU COMMAND";
X/* 0123456 -- field to fill in starts at header+6 */
X#define UNAME_START 6
X#define Proc_format \
X "%5d %-8.8s %3d %4d %5s %5s %-5s %6s %3d.0%% %5.2f%% %.16s"
X
Xchar *state_abbrev[] =
X{"", "sleep", "run", "zombie", "stop", "start", "cpu", "swap"};
X
Xint process_states[8];
Xchar *procstatenames[] =
X{
X "", " sleeping, ", " running, ", " zombie, ", " stopped, ",
X " starting, ", " on cpu, ", " swapped, ",
X NULL
X};
X
Xint cpu_states[CPUSTATES];
Xchar *cpustatenames[] =
X{"idle", "user", "kernel", "wait", "swap", NULL};
X
X/* these are for detailing the memory statistics */
X
Xint memory_stats[5];
Xchar *memorynames[] =
X{"K real, ", "K active, ", "K free, ", "K swap, ", "K free swap", NULL};
X
Xstatic int kmem = -1;
Xstatic int nproc;
Xstatic int bytes;
Xstatic struct prpsinfo *pbase;
Xstatic struct prpsinfo **pref;
Xstatic DIR *procdir;
X
X/* useful externals */
Xextern int errno;
Xextern char *sys_errlist[];
Xextern char *myname;
Xextern int check_nlist ();
Xextern int getkval ();
Xextern void perror ();
Xextern void getptable ();
Xextern void quit ();
Xextern int nlist ();
X
Xint
Xmachine_init (struct statics *statics)
X {
X static struct var v;
X
X /* fill in the statics information */
X statics->procstate_names = procstatenames;
X statics->cpustate_names = cpustatenames;
X statics->memory_names = memorynames;
X
X /* get the list of symbols we want to access in the kernel */
X if (nlist (UNIX, nlst))
X {
X (void) fprintf (stderr, "Unable to nlist %s\n", UNIX);
X return (-1);
X }
X
X /* make sure they were all found */
X if (check_nlist (nlst) > 0)
X return (-1);
X
X /* open kernel memory */
X if ((kmem = open (KMEM, O_RDONLY)) == -1)
X {
X perror (KMEM);
X return (-1);
X }
X
X /* get the symbol values out of kmem */
X /* NPROC Tuning parameter for max number of processes */
X (void) getkval (nlst[X_V].n_value, &v, sizeof (struct var), nlst[X_V].n_name);
X nproc = v.v_proc;
X
X /* stash away certain offsets for later use */
X mpid_offset = nlst[X_MPID].n_value;
X nproc_offset = nlst[X_NPROC].n_value;
X avenrun_offset = nlst[X_AVENRUN].n_value;
X physmem_offset = nlst[X_PHYSMEM].n_value;
X
X /* allocate space for proc structure array and array of pointers */
X bytes = nproc * sizeof (struct prpsinfo);
X pbase = (struct prpsinfo *) malloc (bytes);
X pref = (struct prpsinfo **) malloc (nproc * sizeof (struct prpsinfo *));
X
X /* Just in case ... */
X if (pbase == (struct prpsinfo *) NULL || pref == (struct prpsinfo **) NULL)
X {
X (void) fprintf (stderr, "%s: can't allocate sufficient memory\n", myname);
X return (-1);
X }
X
X if (!(procdir = opendir (PROCFS)))
X {
X (void) fprintf (stderr, "Unable to open %s\n", PROCFS);
X return (-1);
X }
X
X if (chdir (PROCFS))
X { /* handy for later on when we're reading it */
X (void) fprintf (stderr, "Unable to chdir to %s\n", PROCFS);
X return (-1);
X }
X
X /* all done! */
X return (0);
X }
X
Xchar *
Xformat_header (char *uname_field)
X{
X register char *ptr;
X
X ptr = header + UNAME_START;
X while (*uname_field != '\0')
X *ptr++ = *uname_field++;
X
X return (header);
X}
X
Xstatic int get_sysinfo_firsttime=0;
Xstatic int physmem;
Xstatic size_t sysinfo_size, vmtotal_size, minfo_size;
Xstatic int ncpu;
Xvoid
Xget_system_info (struct system_info *si)
X{
X long avenrun[3];
X static struct sysinfo sysinfo[MAXCPU];
X static struct vmtotal vmtotal;
X static struct minfo minfo;
X static time_t cp_time[CPUSTATES];
X static time_t cp_old[CPUSTATES];
X static time_t cp_diff[CPUSTATES]; /* for cpu state percentages */
X register int i, j, k, cpu;
X
X /* Get number of cpus and size of system information data structure
X but only first time */
X if( ! get_sysinfo_firsttime )
X {
X get_sysinfo_firsttime=1;
X if (statis("ncpu", STATIS_GET, &ncpu, sizeof(ncpu))== -1)
X {
X perror("failed to get sysinfo");
X exit(1);
X }
X if (statis("sysinfo", STATIS_SIZ, &sysinfo_size, sizeof(sysinfo_size))==-1)
X {
X perror("failed to get sysinfo");
X exit(1);
X }
X if (statis("vm total", STATIS_SIZ, &vmtotal_size, sizeof(vmtotal_size))==-1)
X {
X perror("failed to get vm total");
X exit(1);
X }
X if (statis("minfo", STATIS_SIZ, &minfo_size, sizeof(minfo_size))==-1)
X {
X perror("failed to get minfo");
X exit(1);
X }
X sysinfo_size *= ncpu;
X (void) getkval (physmem_offset, (int *)(&physmem), sizeof(int), "physmem");
X physmem=physmem<<2;
X memory_stats[0] = (physmem/1024)*1000;
X }
X
X /* Get system information data structure from the kernel - one per cpu */
X if( statis("sysinfo", STATIS_GET, sysinfo, sysinfo_size) != sysinfo_size )
X {
X perror("failed to get sysinfo");
X exit(1);
X }
X
X for( j = 0; j < CPUSTATES; j++)
X {
X cp_time[j] = 0;
X for( cpu = 1; cpu < ncpu; cpu++)
X cp_time[j] += sysinfo[cpu].cpu[j];
X cp_time[j] /= ncpu;
X }
X
X /* convert cp_time counts to percentages */
X (void) percentages (CPUSTATES, cpu_states, cp_time, cp_old, cp_diff);
X
X /* get mpid -- process id of last process */
X (void) getkval (mpid_offset, &(si->last_pid), sizeof (si->last_pid),
X "mpid");
X
X /* get load average array */
X (void) getkval (avenrun_offset, (int *) avenrun, sizeof (avenrun), "avenrun");
X
X /* convert load averages to doubles */
X for (i = 0; i < 3; i++)
X si->load_avg[i] = loaddouble (avenrun[i]);
X
X /* get vmmeter and minfo */
X if( statis("vm total", STATIS_GET, &vmtotal, vmtotal_size) != vmtotal_size )
X {
X perror("failed to get vm total");
X exit(1);
X }
X if( statis("minfo", STATIS_GET, &minfo, minfo_size) != minfo_size )
X {
X perror("failed to get minfo");
X exit(1);
X }
X /* convert memory stats to Kbytes */
X memory_stats[1] = pagetok (vmtotal.t_arm);
X memory_stats[2] = pagetok (vmtotal.t_free);
X memory_stats[3] = pagetok (minfo.swap);
X memory_stats[4] = pagetok (minfo.freeswap);
X
X /* set arrays and strings */
X si->cpustates = cpu_states;
X si->memory = memory_stats;
X}
X
Xstatic struct handle handle;
X
Xcaddr_t
Xget_process_info (
X struct system_info *si,
X struct process_select *sel,
X int (*compare) ())
X{
X register int i;
X register int total_procs;
X register int active_procs;
X register struct prpsinfo **prefp;
X register struct prpsinfo *pp;
X
X /* these are copied out of sel for speed */
X int show_idle;
X int show_system;
X int show_uid;
X
X /* Get current number of processes */
X (void) getkval (nproc_offset, (int *) (&nproc), sizeof (nproc), "nproc");
X
X /* read all the proc structures */
X getptable (pbase);
X
X /* get a pointer to the states summary array */
X si->procstates = process_states;
X
X /* set up flags which define what we are going to select */
X show_idle = sel->idle;
X show_system = sel->system;
X show_uid = sel->uid != -1;
X
X /* count up process states and get pointers to interesting procs */
X total_procs = 0;
X active_procs = 0;
X (void) memset (process_states, 0, sizeof (process_states));
X prefp = pref;
X
X for (pp = pbase, i = 0; i < nproc; pp++, i++)
X {
X /*
X * Place pointers to each valid proc structure in pref[].
X * Process slots that are actually in use have a non-zero
X * status field. Processes with SSYS set are system
X * processes---these get ignored unless show_sysprocs is set.
X */
X if (pp->pr_state != 0 &&
X (show_system || ((pp->pr_flag & SSYS) == 0)))
X {
X total_procs++;
X process_states[pp->pr_state]++;
X if ((!pp->pr_zomb) &&
X (show_idle || (pp->pr_state == SRUN) || (pp->pr_state == SONPROC)) &&
X (!show_uid || pp->pr_uid == (uid_t) sel->uid))
X {
X *prefp++ = pp;
X active_procs++;
X }
X }
X }
X
X /* if requested, sort the "interesting" processes */
X if (compare != NULL)
X qsort ((char *) pref, active_procs, sizeof (struct prpsinfo *), compare);
X
X /* remember active and total counts */
X si->p_total = total_procs;
X si->p_active = active_procs;
X
X /* pass back a handle */
X handle.next_proc = pref;
X handle.remaining = active_procs;
X return ((caddr_t) & handle);
X}
X
Xchar fmt[MAX_COLS]; /* static area where result is built */
X
Xchar *
Xformat_next_process (
X caddr_t handle,
X char *(*get_userid) ())
X{
X register struct prpsinfo *pp;
X struct handle *hp;
X register long cputime;
X register double pctcpu;
X
X /* find and remember the next proc structure */
X hp = (struct handle *) handle;
X pp = *(hp->next_proc++);
X hp->remaining--;
X
X /* get the cpu usage and calculate the cpu percentages */
X cputime = pp->pr_time.tv_sec;
X pctcpu = percent_cpu (pp);
X
X /* format this entry */
X (void) sprintf (fmt,
X Proc_format,
X pp->pr_pid,
X (*get_userid) (pp->pr_uid),
X pp->pr_pri - PZERO,
X pp->pr_nice - NZERO,
X format_k(pagetok (pp->pr_size)),
X format_k(pagetok (pp->pr_rssize)),
X state_abbrev[pp->pr_state],
X format_time(cputime),
X (pp->pr_cpu & 0377),
X 100.0 * pctcpu,
X pp->pr_fname);
X
X /* return the result */
X return (fmt);
X}
X
X/*
X * check_nlist(nlst) - checks the nlist to see if any symbols were not
X * found. For every symbol that was not found, a one-line
X * message is printed to stderr. The routine returns the
X * number of symbols NOT found.
X */
Xint
Xcheck_nlist (register struct nlist *nlst)
X{
X register int i;
X
X /* check to see if we got ALL the symbols we requested */
X /* this will write one line to stderr for every symbol not found */
X
X i = 0;
X while (nlst->n_name != NULL)
X {
X if (nlst->n_type == 0)
X {
X /* this one wasn't found */
X (void) fprintf (stderr, "kernel: no symbol named `%s'\n", nlst->n_name);
X i = 1;
X }
X nlst++;
X }
X return (i);
X}
X
X
X/*
X * getkval(offset, ptr, size, refstr) - get a value out of the kernel.
X * "offset" is the byte offset into the kernel for the desired value,
X * "ptr" points to a buffer into which the value is retrieved,
X * "size" is the size of the buffer (and the object to retrieve),
X * "refstr" is a reference string used when printing error meessages,
X * if "refstr" starts with a '!', then a failure on read will not
X * be fatal (this may seem like a silly way to do things, but I
X * really didn't want the overhead of another argument).
X *
X */
Xint
Xgetkval (
X unsigned long offset,
X int *ptr,
X int size,
X char *refstr)
X{
X#ifdef MIPS
X if (lseek (kmem, (long) (offset & 0x7fffffff), 0) == -1)
X#else
X if (lseek (kmem, (long) offset, 0) == -1)
X#endif
X {
X if (*refstr == '!')
X refstr++;
X (void) fprintf (stderr, "%s: lseek to %s: %s\n",
X myname, refstr, sys_errlist[errno]);
X quit (22);
X }
X if (read (kmem, (char *) ptr, size) == -1)
X if (*refstr == '!')
X /* we lost the race with the kernel, process isn't in memory */
X return (0);
X else
X {
X (void) fprintf (stderr, "%s: reading %s: %s\n",
X myname, refstr, sys_errlist[errno]);
X quit (23);
X }
X return (1);
X}
X
X/* comparison routine for qsort */
X
X/*
X * proc_compare - comparison function for "qsort"
X * Compares the resource consumption of two processes using five
X * distinct keys. The keys (in descending order of importance) are:
X * percent cpu, cpu ticks, state, resident set size, total virtual
X * memory usage. The process states are ordered as follows (from least
X * to most important): WAIT, zombie, sleep, stop, start, run. The
X * array declaration below maps a process state index into a number
X * that reflects this ordering.
X */
X
X
Xunsigned char sorted_state[] =
X{
X 0, /* not used */
X 3, /* sleep */
X 6, /* run */
X 2, /* zombie */
X 4, /* stop */
X 5, /* start */
X 7, /* run on a processor */
X 1 /* being swapped (WAIT) */
X};
X
Xint
Xproc_compare (
X struct prpsinfo **pp1,
X struct prpsinfo **pp2)
X {
X register struct prpsinfo *p1;
X register struct prpsinfo *p2;
X register long result;
X
X /* remove one level of indirection */
X p1 = *pp1;
X p2 = *pp2;
X
X /* compare percent cpu (pctcpu) */
X if ((result = (long) (p2->pr_cpu - p1->pr_cpu)) == 0)
X {
X /* use cpticks to break the tie */
X if ((result = p2->pr_time.tv_sec - p1->pr_time.tv_sec) == 0)
X {
X /* use process state to break the tie */
X if ((result = (long) (sorted_state[p2->pr_state] -
X sorted_state[p1->pr_state])) == 0)
X {
X /* use priority to break the tie */
X if ((result = p2->pr_oldpri - p1->pr_oldpri) == 0)
X {
X /* use resident set size (rssize) to break the tie */
X if ((result = p2->pr_rssize - p1->pr_rssize) == 0)
X {
X /* use total memory to break the tie */
X result = (p2->pr_size - p1->pr_size);
X }
X }
X }
X }
X }
X return (result);
X }
X
X/*
Xget process table
X*/
Xvoid
Xgetptable (struct prpsinfo *baseptr)
X{
X struct prpsinfo *currproc; /* pointer to current proc structure */
X int numprocs = 0;
X struct dirent *direntp;
X
X for (rewinddir (procdir); direntp = readdir (procdir);)
X {
X int fd;
X
X if ((fd = open (direntp->d_name, O_RDONLY)) < 0)
X continue;
X
X currproc = &baseptr[numprocs];
X if (ioctl (fd, PIOCPSINFO, currproc) < 0)
X {
X (void) close (fd);
X continue;
X }
X
X numprocs++;
X (void) close (fd);
X }
X
X if (nproc != numprocs)
X nproc = numprocs;
X}
X
X/* return the owner of the specified process, for use in commands.c as we're
X running setuid root */
Xuid_t
Xproc_owner (pid_t pid)
X{
X register struct prpsinfo *p;
X int i;
X for (i = 0, p = pbase; i < nproc; i++, p++)
X if (p->pr_pid == pid)
X return (p->pr_uid);
X
X return (-1);
X}
X
Xint
Xsetpriority (int dummy, int who, int niceval)
X{
X int scale;
X int prio;
X pcinfo_t pcinfo;
X pcparms_t pcparms;
X tsparms_t *tsparms;
X
X strcpy (pcinfo.pc_clname, "TS");
X if (priocntl (0, 0, PC_GETCID, (caddr_t) & pcinfo) == -1)
X return (-1);
X
X prio = niceval;
X if (prio > PRIO_MAX)
X prio = PRIO_MAX;
X else if (prio < PRIO_MIN)
X prio = PRIO_MIN;
X
X tsparms = (tsparms_t *) pcparms.pc_clparms;
X scale = ((tsinfo_t *) pcinfo.pc_clinfo)->ts_maxupri;
X tsparms->ts_uprilim = tsparms->ts_upri = -(scale * prio) / 20;
X pcparms.pc_cid = pcinfo.pc_cid;
X
X if (priocntl (P_PID, who, PC_SETPARMS, (caddr_t) & pcparms) == -1)
X return (-1);
X
X return (0);
X}
END_OF_FILE
if test 16366 -ne `wc -c <'top-3.4/machine/m_dcosx.c'`; then
echo shar: \"'top-3.4/machine/m_dcosx.c'\" unpacked with wrong size!
fi
# end of 'top-3.4/machine/m_dcosx.c'
fi
echo shar: End of archive 8 \(of 22\).
cp /dev/null ark8isdone
MISSING=""
for I in 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 ; do
if test ! -f ark${I}isdone ; then
MISSING="${MISSING} ${I}"
fi
done
if test "${MISSING}" = "" ; then
echo You have unpacked all 22 archives.
echo "Now read README and INSTALL, then run Configure"
rm -f ark[1-9]isdone ark[1-9][0-9]isdone
else
echo You still need to unpack the following archives:
echo " " ${MISSING}
fi
## End of shell archive.
exit 0