Usenet 1994 October/usenetsourcesnewsgroupsinfomagicoctober1994disk2.iso/unix/volume27/top-3.2/part08

Text File | 1993-08-08 | 41KB | 1,624 lines

Newsgroups: comp.sources.unix
From: [e-mail] (William LeFebvre)
Subject: v27i008: top - a top process display, version 3.2, Part08/13
References: <[e-mail]>
Sender: [e-mail]
Approved: [e-mail]

Submitted-By: [e-mail] (William LeFebvre)
Posting-Number: Volume 27, Issue 8
Archive-Name: top-3.2/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 13)."
# Contents:  machine/m_bsd43.c machine/m_hpux8.c
# Wrapped by phil@pex on Wed Aug  4 14:22:44 1993
PATH=/bin:/usr/bin:/usr/ucb ; export PATH
if test -f 'machine/m_bsd43.c' -a "${1}" != "-c" ; then
  echo shar: Will not clobber existing file \"'machine/m_bsd43.c'\"
else
echo shar: Extracting \"'machine/m_bsd43.c'\" \(18432 characters\)
sed "s/^X//" >'machine/m_bsd43.c' <<'END_OF_FILE'
X/*
X * top - a top users display for Unix
X *
X * SYNOPSIS:  any generic 4.3BSD system
X *
X * DESCRIPTION:
X * This is the machine-dependent module for BSD4.3
X * Works for:
X *      4.3 BSD
X *    AOS4.3,    IBM rt/pc
X *    mtXinu, vax
X *
X * LIBS:
X *
X * AUTHOR:  Christos Zoulas <[e-mail]>
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 <sys/dir.h>
X#include <sys/user.h>
X#include <sys/proc.h>
X#include <sys/dk.h>
X#include <sys/vm.h>
X#include <sys/file.h>
X#include <sys/time.h>
X#include <machine/pte.h>
X
X
X#define DOSWAP
X
X#include "top.h"
X#include "machine.h"
X
Xextern int errno, sys_nerr;
Xextern char *sys_errlist[];
X#define strerror(e) (((e) >= 0 && (e) < sys_nerr) ? sys_errlist[(e)] : "Unknown error")
X
X#define VMUNIX    "/vmunix"
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 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 what weighted cpu is.  */
X#define weighted_cpu(pct, pp) ((pp)->p_time == 0 ? 0.0 : \
X             ((pct) / (1.0 - exp((pp)->p_time * logcpu))))
X
X/* what we consider to be process size: */
X#define PROCSIZE(pp) ((pp)->p_tsize + (pp)->p_dsize + (pp)->p_ssize)
X
X/* definitions for indices in the nlist array */
X#define X_AVENRUN    0
X#define X_CCPU        1
X#define X_NPROC        2
X#define X_PROC        3
X#define X_TOTAL        4
X#define X_CP_TIME    5
X#define X_MPID        6
X#define X_HZ        7
X
Xstatic struct nlist nlst[] = {
X    { "_avenrun" },        /* 0 */
X    { "_ccpu" },        /* 1 */
X    { "_nproc" },        /* 2 */
X    { "_proc" },        /* 3 */
X    { "_total" },        /* 4 */
X    { "_cp_time" },        /* 5 */
X    { "_mpid" },        /* 6 */
X    { "_hz" },            /* 7 */
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%6dK %4dK %-5s%4d:%02d %5.2f%% %5.2f%% %.14s"
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
Xstatic int kmem, mem;
X#ifdef DOSWAP
Xstatic int swap;
X#endif
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 unsigned long proc;
Xstatic          int  nproc;
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 avenrun_offset;
Xstatic unsigned long mpid_offset;
Xstatic unsigned long total_offset;
Xstatic unsigned long cp_time_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    "Real: ", "K/", "K act/tot  ", "Virtual: ", "K/",
X    "K act/tot  ", "Free: ", "K", NULL
X};
X
X/* these are for keeping track of the proc array */
X
Xstatic int bytes;
Xstatic int pref_len;
Xstatic struct proc *pbase;
Xstatic struct 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
X/* useful externals */
Xextern int errno;
Xextern char *sys_errlist[];
X
Xlong lseek();
Xlong time();
Xlong percentages();
X
Xmachine_init(statics)
X
Xstruct statics *statics;
X
X{
X    register int i = 0;
X    register int pagesize;
X
X    if ((kmem = open(KMEM, O_RDONLY)) == -1) {
X    perror(KMEM);
X    return(-1);
X    }
X    if ((mem = open(MEM, O_RDONLY)) == -1) {
X    perror(MEM);
X    return(-1);
X    }
X
X#ifdef DOSWAP
X    if ((swap = open(SWAP, O_RDONLY)) == -1) {
X    perror(SWAP);
X    return(-1);
X    }
X#endif
X
X    /* get the list of symbols we want to access in the kernel */
X    (void) nlist(VMUNIX, 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_PROC].n_value,   (int *)(&proc),    sizeof(proc),
X        nlst[X_PROC].n_name);
X    (void) getkval(nlst[X_NPROC].n_value,  &nproc,        sizeof(nproc),
X        nlst[X_NPROC].n_name);
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    mpid_offset = nlst[X_MPID].n_value;
X    avenrun_offset = nlst[X_AVENRUN].n_value;
X    total_offset = nlst[X_TOTAL].n_value;
X    cp_time_offset = nlst[X_CP_TIME].n_value;
X
X    /* this is used in calculating WCPU -- calculate it ahead of time */
X    logcpu = log(loaddouble(ccpu));
X
X    /* allocate space for proc structure array and array of pointers */
X    bytes = nproc * sizeof(struct proc);
X    pbase = (struct proc *)malloc(bytes);
X    pref  = (struct proc **)malloc(nproc * sizeof(struct proc *));
X
X    /* Just in case ... */
X    if (pbase == (struct proc *)NULL || pref == (struct proc **)NULL)
X    {
X    fprintf(stderr, "top: can't allocate sufficient memory\n");
X    return(-1);
X    }
X
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    load_avg avenrun[3];
X    long total;
X
X    /* get the cp_time array */
X    (void) getkval(cp_time_offset, (int *)cp_time, sizeof(cp_time),
X           "_cp_time");
X
X    /* get load average array */
X    (void) getkval(avenrun_offset, (int *)avenrun, sizeof(avenrun),
X           "_avenrun");
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    /* convert load averages to doubles */
X    {
X    register int i;
X    register double *infoloadp;
X    register load_avg *sysloadp;
X
X    infoloadp = si->load_avg;
X    sysloadp = avenrun;
X    for (i = 0; i < 3; i++)
X    {
X        *infoloadp++ = loaddouble(*sysloadp++);
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    struct vmtotal total;
X
X    /* get total -- systemwide main memory usage structure */
X    (void) getkval(total_offset, (int *)(&total), sizeof(total),
X               "_total");
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}
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 proc **prefp;
X    register struct 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    /* read all the proc structures in one fell swoop */
X    (void) getkval(proc, (int *)pbase, bytes, "proc array");
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->p_stat != 0 &&
X        (show_system || ((pp->p_flag & SSYS) == 0)))
X    {
X        total_procs++;
X        process_states[pp->p_stat]++;
X        if ((pp->p_stat != SZOMB) &&
X        (show_idle || (pp->p_pctcpu != 0) || (pp->p_stat == SRUN)) &&
X        (!show_uid || pp->p_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    {
X    qsort((char *)pref, active_procs, sizeof(struct 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[128];        /* 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 proc *pp;
X    register long cputime;
X    register double pct;
X    int where;
X    struct user u;
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    where = getu(pp, &u);
X    if (where == -1)
X    {
X    (void) strcpy(u.u_comm, "<swapped>");
X    cputime = 0;
X    }
X    else
X    {
X
X
X    /* set u_comm for system processes */
X    if (u.u_comm[0] == '\0')
X    {
X        if (pp->p_pid == 0)
X        {
X        (void) strcpy(u.u_comm, "Swapper");
X        }
X        else if (pp->p_pid == 2)
X        {
X        (void) strcpy(u.u_comm, "Pager");
X        }
X    }
X    if (where == 1) {
X        /*
X         * Print swapped processes as <pname>
X         */
X        char buf[sizeof(u.u_comm)];
X        (void) strncpy(buf, u.u_comm, sizeof(u.u_comm));
X        u.u_comm[0] = '<';
X        (void) strncpy(&u.u_comm[1], buf, sizeof(u.u_comm) - 2);
X        u.u_comm[sizeof(u.u_comm) - 2] = '\0';
X        (void) strncat(u.u_comm, ">", sizeof(u.u_comm) - 1);
X        u.u_comm[sizeof(u.u_comm) - 1] = '\0';
X    }
X
X    cputime = u.u_ru.ru_utime.tv_sec + u.u_ru.ru_stime.tv_sec;
X    }
X
X    /* calculate the base for cpu percentages */
X    pct = pctdouble(pp->p_pctcpu);
X
X    /* format this entry */
X    sprintf(fmt,
X        Proc_format,
X        pp->p_pid,
X        (*get_userid)(pp->p_uid),
X        pp->p_pri - PZERO,
X        pp->p_nice - NZERO,
X        pagetok(PROCSIZE(pp)),
X        pagetok(pp->p_rssize),
X        state_abbrev[pp->p_stat],
X        cputime / 60l,
X        cputime % 60l,
X        100.0 * weighted_cpu(pct, pp),
X        100.0 * pct,
X        printable(u.u_comm));
X
X    /* return the result */
X    return(fmt);
X}
X
X/*
X *  getu(p, u) - get the user structure for the process whose proc structure
X *    is pointed to by p.  The user structure is put in the buffer pointed
X *    to by u.  Return 0 if successful, -1 on failure (such as the process
X *    being swapped out).
X */
X
X#ifdef ibm032
Xstatic struct alignuser {
X    char userfill[UPAGES*NBPG-sizeof (struct user)];
X    struct user user;
X} au;
X# define USERSIZE sizeof(struct alignuser)
X# define GETUSER(b)    (&au)
X# define SETUSER(b)    *(b) = au.user
X#else
X# define USERSIZE sizeof(struct user)
X# define GETUSER(b)    (b)
X# define SETUSER(b)    /* Nothing */
X#endif
X
Xgetu(p, u)
X
Xregister struct proc *p;
Xstruct user *u;
X
X{
X    struct pte uptes[UPAGES];
X    register caddr_t upage;
X    register struct pte *pte;
X    register nbytes, n;
X
X    /*
X     *  Check if the process is currently loaded or swapped out.  The way we
X     *  get the u area is totally different for the two cases.  For this
X     *  application, we just don't bother if the process is swapped out.
X     */
X    if ((p->p_flag & SLOAD) == 0) {
X#ifdef DOSWAP
X    if (lseek(swap, (long)dtob(p->p_swaddr), 0) == -1) {
X        perror("lseek(swap)");
X        return(-1);
X    }
X    if (read(swap, (char *) GETUSER(u), USERSIZE) != USERSIZE)  {
X        perror("read(swap)");
X        return(-1);
X    }
X    SETUSER(u);
X    return (1);
X#else
X    return(-1);
X#endif
X    }
X
X    /*
X     *  Process is currently in memory, we hope!
X     */
X    if (!getkval((unsigned long)p->p_addr, (int *)uptes, sizeof(uptes),
X                "!p->p_addr"))
X    {
X#ifdef DEBUG
X    perror("getkval(uptes)");
X#endif
X    /* we can't seem to get to it, so pretend it's swapped out */
X    return(-1);
X    }
X    upage = (caddr_t) GETUSER(u);
X    pte = uptes;
X    for (nbytes = USERSIZE; nbytes > 0; nbytes -= NBPG) {
X        (void) lseek(mem, (long)(pte++->pg_pfnum * NBPG), 0);
X#ifdef DEBUG
X    perror("lseek(mem)");
X#endif
X    n = MIN(nbytes, NBPG);
X    if (read(mem, upage, n) != n) {
X#ifdef DEBUG
X    perror("read(mem)");
X#endif
X        /* we can't seem to get to it, so pretend it's swapped out */
X        return(-1);
X    }
X    upage += n;
X    }
X    SETUSER(u);
X    return(0);
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 (lseek(kmem, (long)offset, L_SET) == -1) {
X        if (*refstr == '!')
X            refstr++;
X        (void) fprintf(stderr, "%s: lseek to %s: %s\n", KMEM,
X               refstr, strerror(errno));
X        quit(23);
X    }
X    if (read(kmem, (char *) ptr, size) == -1) {
X        if (*refstr == '!')
X            return(0);
X        else {
X            (void) fprintf(stderr, "%s: reading %s: %s\n", KMEM,
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 proc **pp1;
Xstruct proc **pp2;
X
X{
X    register struct proc *p1;
X    register struct 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 = p2->p_pctcpu - p1->p_pctcpu) == 0)
X    {
X    /* use cpticks to break the tie */
X    if ((result = p2->p_cpticks - p1->p_cpticks) == 0)
X    {
X        /* use process state to break the tie */
X        if ((result = sorted_state[p2->p_stat] -
X              sorted_state[p1->p_stat])  == 0)
X        {
X        /* use priority to break the tie */
X        if ((result = p2->p_pri - p1->p_pri) == 0)
X        {
X            /* use resident set size (rssize) to break the tie */
X            if ((result = p2->p_rssize - p1->p_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 proc **prefp;
X    register struct proc *pp;
X
X    prefp = pref;
X    cnt = pref_len;
X    while (--cnt >= 0)
X    {
X    if ((pp = *prefp++)->p_pid == (pid_t)pid)
X    {
X        return((int)pp->p_uid);
X    }
X    }
X    return(-1);
X}
END_OF_FILE
if test 18432 -ne `wc -c <'machine/m_bsd43.c'`; then
    echo shar: \"'machine/m_bsd43.c'\" unpacked with wrong size!
fi
# end of 'machine/m_bsd43.c'
fi
if test -f 'machine/m_hpux8.c' -a "${1}" != "-c" ; then
  echo shar: Will not clobber existing file \"'machine/m_hpux8.c'\"
else
echo shar: Extracting \"'machine/m_hpux8.c'\" \(18940 characters\)
sed "s/^X//" >'machine/m_hpux8.c' <<'END_OF_FILE'
X/*
X * top - a top users display for Unix
X *
X * SYNOPSIS:  any hp9000 running hpux version 8 (may work with 9)
X *
X * DESCRIPTION:
X * This is the machine-dependent module for HPUX 8 and is rumored to work
X * for version 9 as well.  This makes top work on (at least) the
X * following systems:
X *    hp9000s300
X *    hp9000s700
X *    hp9000s800
X *
X * LIBS:
X *
X * AUTHOR:  Christos Zoulas <[e-mail]>
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 <sys/dir.h>
X#include <sys/user.h>
X#include <sys/proc.h>
X#include <sys/dk.h>
X#include <sys/vm.h>
X#include <sys/file.h>
X#include <sys/time.h>
X#ifndef hpux
X# define P_RSSIZE(p) (p)->p_rssize
X# define P_TSIZE(p) (p)->p_tsize
X# define P_DSIZE(p) (p)->p_dsize
X# define P_SSIZE(p) (p)->p_ssize
X#else
X# include <sys/pstat.h>
X# define __PST2P(p, field) \
X    ((p)->p_upreg ? ((struct pst_status *) (p)->p_upreg)->field : 0)
X# define P_RSSIZE(p) __PST2P(p, pst_rssize)
X# define P_TSIZE(p) __PST2P(p, pst_tsize)
X# define P_DSIZE(p) __PST2P(p, pst_dsize)
X# define P_SSIZE(p) __PST2P(p, pst_ssize)
X#endif
X
X#include "top.h"
X#include "machine.h"
X
X#define VMUNIX    "/hp-ux"
X#define KMEM    "/dev/kmem"
X#define MEM    "/dev/mem"
X#ifdef DOSWAP
X#define SWAP    "/dev/dmem"
X#endif
X
X/* get_process_info passes back a handle.  This is what it looks like: */
X
Xstruct handle
X{
X    struct 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 what weighted cpu is.  */
X#define weighted_cpu(pct, pp) ((pp)->p_time == 0 ? 0.0 : \
X             ((pct) / (1.0 - exp((pp)->p_time * logcpu))))
X
X/* what we consider to be process size: */
X#define PROCSIZE(pp) (P_TSIZE(pp) + P_DSIZE(pp) + P_SSIZE(pp))
X
X/* definitions for indices in the nlist array */
X#define X_AVENRUN    0
X#define X_CCPU        1
X#define X_NPROC        2
X#define X_PROC        3
X#define X_TOTAL        4
X#define X_CP_TIME    5
X#define X_MPID        6
X
X/*
X * Steinar Haug from University of Trondheim, NORWAY pointed out that
X * the HP 9000 system 800 doesn't have _hz defined in the kernel.  He
X * provided a patch to work around this.  We've improved on this patch
X * here and set the constant X_HZ only when _hz is available in the
X * kernel.  Code in this module that uses X_HZ is surrounded with
X * appropriate ifdefs.
X */
X
X#ifndef hp9000s300
X#define X_HZ        7
X#endif
X
X
Xstatic struct nlist nlst[] = {
X    { "_avenrun" },        /* 0 */
X    { "_ccpu" },        /* 1 */
X    { "_nproc" },        /* 2 */
X    { "_proc" },        /* 3 */
X    { "_total" },        /* 4 */
X    { "_cp_time" },        /* 5 */
X    { "_mpid" },        /* 6 */
X#ifdef X_HZ
X    { "_hz" },            /* 7 */
X#endif
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%6dK %4dK %-5s%4d:%02d %5.2f%% %5.2f%% %.14s"
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
Xstatic int kmem;
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 unsigned long proc;
Xstatic          int  nproc;
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 */
Xstatic unsigned long mpid_offset;
Xstatic unsigned long avenrun_offset;
Xstatic unsigned long total_offset;
Xstatic unsigned long cp_time_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[9];
Xchar *cpustatenames[] = {
X    "usr", "nice", "sys", "idle", "", "", "", "intr", "ker",
X    NULL
X};
X
X/* these are for detailing the memory statistics */
X
Xint memory_stats[8];
Xchar *memorynames[] = {
X    "Real: ", "K/", "K act/tot  ", "Virtual: ", "K/",
X    "K act/tot  ", "Free: ", "K", NULL
X};
X
X/* these are for keeping track of the proc array */
X
Xstatic int bytes;
Xstatic int pref_len;
Xstatic struct proc *pbase;
Xstatic struct proc **pref;
Xstatic struct pst_status *pst;
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
X/* useful externals */
Xextern int errno;
Xextern char *sys_errlist[];
X
Xlong lseek();
Xlong time();
Xlong percentages();
X
Xmachine_init(statics)
X
Xstruct statics *statics;
X
X{
X    register int i = 0;
X    register int pagesize;
X
X    if ((kmem = open(KMEM, O_RDONLY)) == -1) {
X    perror(KMEM);
X    return(-1);
X    }
X#ifdef hp9000s800
X    /* 800 names don't have leading underscores */
X    for (i = 0; nlst[i].n_name; nlst[i++].n_name++)
X    continue;
X#endif
X
X    /* get the list of symbols we want to access in the kernel */
X    (void) nlist(VMUNIX, 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 (check_nlist(nlst) > 0)
X    {
X    return(-1);
X    }
X
X    /* get the symbol values out of kmem */
X    (void) getkval(nlst[X_PROC].n_value,   (int *)(&proc),    sizeof(proc),
X        nlst[X_PROC].n_name);
X    (void) getkval(nlst[X_NPROC].n_value,  &nproc,        sizeof(nproc),
X        nlst[X_NPROC].n_name);
X    (void) getkval(nlst[X_CCPU].n_value,   (int *)(&ccpu),    sizeof(ccpu),
X        nlst[X_CCPU].n_name);
X#ifdef X_HZ
X    (void) getkval(nlst[X_HZ].n_value,     (int *)(&hz),    sizeof(hz),
X        nlst[X_HZ].n_name);
X#else
X    hz = HZ;
X#endif
X
X    /* stash away certain offsets for later use */
X    mpid_offset = nlst[X_MPID].n_value;
X    avenrun_offset = nlst[X_AVENRUN].n_value;
X    total_offset = nlst[X_TOTAL].n_value;
X    cp_time_offset = nlst[X_CP_TIME].n_value;
X
X    /* this is used in calculating WCPU -- calculate it ahead of time */
X    logcpu = log(loaddouble(ccpu));
X
X    /* allocate space for proc structure array and array of pointers */
X    bytes = nproc * sizeof(struct proc);
X    pbase = (struct proc *)malloc(bytes);
X    pref  = (struct proc **)malloc(nproc * sizeof(struct proc *));
X    pst   = (struct pst_status *)malloc(nproc * sizeof(struct pst_status));
X
X    /* Just in case ... */
X    if (pbase == (struct proc *)NULL || pref == (struct proc **)NULL)
X    {
X    fprintf(stderr, "top: can't allocate sufficient memory\n");
X    return(-1);
X    }
X
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    load_avg avenrun[3];
X    long total;
X
X    /* get the cp_time array */
X    (void) getkval(cp_time_offset, (int *)cp_time, sizeof(cp_time),
X           "_cp_time");
X
X    /* get load average array */
X    (void) getkval(avenrun_offset, (int *)avenrun, sizeof(avenrun),
X           "_avenrun");
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    /* convert load averages to doubles */
X    {
X    register int i;
X    register double *infoloadp;
X    register load_avg *sysloadp;
X
X    infoloadp = si->load_avg;
X    sysloadp = avenrun;
X    for (i = 0; i < 3; i++)
X    {
X        *infoloadp++ = loaddouble(*sysloadp++);
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    struct vmtotal total;
X
X    /* get total -- systemwide main memory usage structure */
X    (void) getkval(total_offset, (int *)(&total), sizeof(total),
X               "_total");
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}
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 proc **prefp;
X    register struct 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    /* read all the proc structures in one fell swoop */
X    (void) getkval(proc, (int *)pbase, bytes, "proc array");
X    for (i = 0; i < nproc; ++i) {
X    if (pstat(PSTAT_PROC, &pst[i], sizeof(pst[i]), 0, pbase[i].p_pid) != 1)
X        pbase[i].p_upreg = (preg_t *) 0;
X    else
X        pbase[i].p_upreg = (preg_t *) &pst[i];
X    pbase[i].p_nice = pst[i].pst_nice;
X    pbase[i].p_cpticks = pst[i].pst_cpticks;
X    }
X
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->p_stat != 0 &&
X        (show_system || ((pp->p_flag & SSYS) == 0)))
X    {
X        total_procs++;
X        process_states[pp->p_stat]++;
X        if ((pp->p_stat != SZOMB) &&
X        (show_idle || (pp->p_pctcpu != 0) || (pp->p_stat == SRUN)) &&
X        (!show_uid || pp->p_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    {
X    qsort((char *)pref, active_procs, sizeof(struct 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[128];        /* 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 proc *pp;
X    register long cputime;
X    register double pct;
X    int where;
X    struct user u;
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    where = getu(pp, &u);
X    if (where == -1)
X    {
X    (void) strcpy(u.u_comm, "<swapped>");
X    cputime = 0;
X    }
X    else
X    {
X
X
X    /* set u_comm for system processes */
X    if (u.u_comm[0] == '\0')
X    {
X        if (pp->p_pid == 0)
X        {
X        (void) strcpy(u.u_comm, "Swapper");
X        }
X        else if (pp->p_pid == 2)
X        {
X        (void) strcpy(u.u_comm, "Pager");
X        }
X    }
X    if (where == 1) {
X        /*
X         * Print swapped processes as <pname>
X         */
X        char buf[sizeof(u.u_comm)];
X        (void) strncpy(buf, u.u_comm, sizeof(u.u_comm));
X        u.u_comm[0] = '<';
X        (void) strncpy(&u.u_comm[1], buf, sizeof(u.u_comm) - 2);
X        u.u_comm[sizeof(u.u_comm) - 2] = '\0';
X        (void) strncat(u.u_comm, ">", sizeof(u.u_comm) - 1);
X        u.u_comm[sizeof(u.u_comm) - 1] = '\0';
X    }
X
X    cputime = __PST2P(pp, pst_cptickstotal) / hz;
X    }
X
X    /* calculate the base for cpu percentages */
X    pct = pctdouble(pp->p_pctcpu);
X
X    /* format this entry */
X    sprintf(fmt,
X        Proc_format,
X        pp->p_pid,
X        (*get_userid)(pp->p_uid),
X        pp->p_pri - PZERO,
X        pp->p_nice - NZERO,
X        pagetok(PROCSIZE(pp)),
X        pagetok(P_RSSIZE(pp)),
X        state_abbrev[pp->p_stat],
X        cputime / 60l,
X        cputime % 60l,
X        100.0 * weighted_cpu(pct, pp),
X        100.0 * pct,
X        printable(u.u_comm));
X
X    /* return the result */
X    return(fmt);
X}
X
X/*
X *  getu(p, u) - get the user structure for the process whose proc structure
X *    is pointed to by p.  The user structure is put in the buffer pointed
X *    to by u.  Return 0 if successful, -1 on failure (such as the process
X *    being swapped out).
X */
X
X
Xgetu(p, u)
X
Xregister struct proc *p;
Xstruct user *u;
X
X{
X    struct pst_status *ps;
X    char *s, *c;
X    int i;
X
X    if ((ps = (struct pst_status *) p->p_upreg) == NULL)
X    return -1;
X
X    memset(u, 0, sizeof(struct user));
X    c = ps->pst_cmd;
X    ps->pst_cmd[PST_CLEN - 1] = '\0';        /* paranoia */
X    s = strtok(ps->pst_cmd, "\t \n");
X
X    if (c = strrchr(s, '/'))
X    c++;
X    else
X    c = s;
X    if (*c == '-')
X    c++;
X    i = 0;
X    for (; i < MAXCOMLEN; i++) {
X    if (*c == '\0' || *c == ' ' || *c == '/')
X        break;
X    u->u_comm[i] = *c++;
X    }
X#ifndef DOSWAP
X    return ((p->p_flag & SLOAD) == 0 ? 1 : 0);
X#endif
X    return(0);
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 (lseek(kmem, (long)offset, L_SET) == -1) {
X        if (*refstr == '!')
X            refstr++;
X        (void) fprintf(stderr, "%s: lseek to %s: %s\n", KMEM,
X               refstr, strerror(errno));
X        quit(23);
X    }
X    if (read(kmem, (char *) ptr, size) == -1) {
X        if (*refstr == '!')
X            return(0);
X        else {
X            (void) fprintf(stderr, "%s: reading %s: %s\n", KMEM,
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 proc **pp1;
Xstruct proc **pp2;
X
X{
X    register struct proc *p1;
X    register struct 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 = p2->p_pctcpu - p1->p_pctcpu) == 0)
X    {
X    /* use cpticks to break the tie */
X    if ((result = p2->p_cpticks - p1->p_cpticks) == 0)
X    {
X        /* use process state to break the tie */
X        if ((result = sorted_state[p2->p_stat] -
X              sorted_state[p1->p_stat])  == 0)
X        {
X        /* use priority to break the tie */
X        if ((result = p2->p_pri - p1->p_pri) == 0)
X        {
X            /* use resident set size (rssize) to break the tie */
X            if ((result = P_RSSIZE(p2) - P_RSSIZE(p1)) == 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
Xvoid (*signal(sig, func))()
X    int sig;
X    void (*func)();
X{
X    struct sigvec osv, sv;
X
X    /*
X     * XXX: we should block the signal we are playing with,
X     *        in case we get interrupted in here.
X     */
X    if (sigvector(sig, NULL, &osv) == -1)
X    return BADSIG;
X    sv = osv;
X    sv.sv_handler = func;
X#ifdef SV_BSDSIG
X    sv.sv_flags |= SV_BSDSIG;
X#endif
X    if (sigvector(sig, &sv, NULL) == -1)
X    return BADSIG;
X    return osv.sv_handler;
X}
X
Xint getpagesize() { return 1 << PGSHIFT; }
X
Xint setpriority(a, b, c) { errno = ENOSYS; return -1; }
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 proc **prefp;
X    register struct proc *pp;
X
X    prefp = pref;
X    cnt = pref_len;
X    while (--cnt >= 0)
X    {
X    if ((pp = *prefp++)->p_pid == (pid_t)pid)
X    {
X        return((int)pp->p_uid);
X    }
X    }
X    return(-1);
X}
END_OF_FILE
if test 18940 -ne `wc -c <'machine/m_hpux8.c'`; then
    echo shar: \"'machine/m_hpux8.c'\" unpacked with wrong size!
fi
# end of 'machine/m_hpux8.c'
fi
echo shar: End of archive 8 \(of 13\).
cp /dev/null ark8isdone
MISSING=""
for I in 1 2 3 4 5 6 7 8 9 10 11 12 13 ; do
    if test ! -f ark${I}isdone ; then
    MISSING="${MISSING} ${I}"
    fi
done
if test "${MISSING}" = "" ; then
    echo You have unpacked all 13 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