![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to sa.c CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [Research Unix] / researchv10no / cmd|
Return to sa.c CVS log | Up to [Research Unix] / researchv10no / cmd |
researchv10 Norman
static char *sccsid = "@(#)sa.c 4.2 (Berkeley) 81/02/28";
/*
* Extensive modifications to internal data structures
* to allow arbitrary number of different commands and users added.
*
* Also allowed the digit option on the -v flag (interactive
* threshold compress) to be a digit string, so one can
* set the threshold > 9.
*
* Also added the -f flag, to force no interactive threshold
* compression with the -v flag.
*
* Robert Henry
* UC Berkeley
* 31jan81
*/
#include <stdio.h>
#include <sys/types.h>
#include <sys/acct.h>
#include <signal.h>
#include <utmp.h>
#include <pwd.h>
/* interpret command time accounting */
#define NC sizeof(acctbuf.ac_comm)
struct acct acctbuf;
int aflg; /* put stuff under `***other' */
int bflg; /* sort by (user+sys)/ncalls */
int cflg; /* add pct of total for each command */
int Dflg; /* sort by total disk i/o */
int dflg; /* sort by avg disk i/o */
int eflg; /* use argv + 1 for prefix */
int fflg; /* force no interaction */
int gflg; /* ignore ACCT */
int iflg; /* ignore summaries */
int jflg; /* seconds per call replaces total minutes */
int Kflg; /* sort by cpu-storage integral */
int kflg; /* sort by cpu * avg mem */
int lflg; /* separate sys & user time */
int mflg; /* print # procs, cpu, disk i/o, memory seconds for each user */
int nflg; /* sort by number of calls */
int oflg; /* ? */
int rflg; /* reverse order of sort */
int sflg; /* merge data to summary file */
int tflg; /* print ratio of real to (user+sys) */
int uflg; /* print uid & command only */
int vflg; /* set `**junk**' limit */
int thres = 1; /* to thres */
struct utmp utmp;
#define NAMELG (sizeof(utmp.ut_name)+1)
struct Olduser{
int Us_cnt;
double Us_ctime;
double Us_io;
double Us_imem;
};
struct user {
char name[NC]; /* this is <\001><user id><\000> */
struct Olduser oldu;
char us_name[NAMELG];
};
#define us_cnt oldu.Us_cnt
#define us_ctime oldu.Us_ctime
#define us_io oldu.Us_io
#define us_imem oldu.Us_imem
/*
* We protect ourselves from preposterous user id's by looking
* through the passwd file for the highest uid allocated, and
* then adding 10 to that.
* This prevents the user structure from growing too large.
*/
#define USERSLOP 10
int maxuser; /* highest uid from /etc/passwd, + 10 for slop*/
struct process {
char name[NC];
int count;
double realt;
double cput;
double syst;
double imem;
double io;
};
union Tab{
struct process p;
struct user u;
};
typedef union Tab cell;
int (*cmp)(); /* compares 2 cells; set to appropriate func */
cell *enter();
struct user *finduser();
struct user *wasuser();
/*
* Table elements are keyed by the name of the file exec'ed.
* Because on large systems, many files can be exec'ed,
* a static table size may grow to be too large.
*
* Table elements are allocated in chunks dynamically, linked
* together so that they may be retrieved sequentially.
*
* An index into the table structure is provided by hashing through
* a seperate hash table.
* The hash table is segmented, and dynamically extendable.
* Realize that the hash table and accounting information is kept
* in different segments!
*
* We have a linked list of hash table segments; within each
* segment we use a quadratic rehash that touches no more than 1/2
* of the buckets in the hash table when probing.
* If the probe does not find the desired symbol, it moves to the
* next segment, or allocates a new segment.
*
* Hash table segments are kept on the linked list with the first
* segment always first (that will probably contain the
* most frequently executed commands) and
* the last added segment immediately after the first segment,
* to hopefully gain something by locality of reference.
*
* We store the per user information in the same structure as
* the per exec'ed file information. This allows us to use the
* same managers for both, as the number of user id's may be very
* large.
* User information is keyed by the first character in the name
* being a '\001', followed by four bytes of (long extended)
* user id number, followed by a null byte.
* The actual user names are kept in a seperate field of the
* user structure, and is filled in upon demand later.
* Iteration through all users by low user id to high user id
* is done by just probing the table, which is gross.
*/
#define USERKEY '\001'
#define ISPROCESS(tp) (tp->p.name[0] && (tp->p.name[0] != USERKEY))
#define ISUSER(tp) (tp->p.name[0] && (tp->p.name[0] == USERKEY))
#define TABDALLOP 500
struct allocbox{
struct allocbox *nextalloc;
cell tabslots[TABDALLOP];
};
struct allocbox *allochead; /*head of chunk list*/
struct allocbox *alloctail; /*tail*/
struct allocbox *newbox; /*for creating a new chunk*/
cell *nexttab; /*next table element that is free*/
int tabsleft; /*slots left in current chunk*/
int ntabs;
/*
* Iterate through all symbols in the symbol table in declaration
* order.
* struct allocbox *allocwalk;
* cell *sp, *ub;
*
* sp points to the desired item, allocwalk and ub are there
* to make the iteration go.
*/
#define DECLITERATE(allocwalk, walkpointer, ubpointer) \
for(allocwalk = allochead; \
allocwalk != 0; \
allocwalk = allocwalk->nextalloc) \
for (walkpointer = &allocwalk->tabslots[0],\
ubpointer = &allocwalk->tabslots[TABDALLOP], \
ubpointer = ubpointer > ( (cell *)alloctail) \
? nexttab : ubpointer ;\
walkpointer < ubpointer; \
walkpointer++ )
#define TABCHUNKS(allocwalk, tabptr, size) \
for (allocwalk = allochead; \
allocwalk != 0; \
allocwalk = allocwalk->nextalloc) \
if ( \
(tabptr = &allocwalk->tabslots[0]), \
(size = \
( (&allocwalk->tabslots[TABDALLOP]) \
> ((cell *)alloctail) \
) \
? (nexttab - tabptr) : TABDALLOP \
), \
1 \
)
#define PROCESSITERATE(allocwalk, walkpointer, ubpointer) \
DECLITERATE(allocwalk, walkpointer, ubpointer) \
if (ISPROCESS(walkpointer))
#define USERITERATE(allocwalk, walkpointer, ubpointer) \
DECLITERATE(allocwalk, walkpointer, ubpointer) \
if (ISUSER(walkpointer))
/*
* When we have to sort the segmented accounting table, we
* create a vector of sorted queues that is merged
* to sort the entire accounting table.
*/
struct chunkdesc {
cell *chunk_tp;
int chunk_n;
};
/*
* Hash table segments and manager
*/
#define NHASH 1103
struct hashdallop {
int h_nused;
struct hashdallop *h_next;
cell *h_tab[NHASH];
};
struct hashdallop *htab; /* head of the list */
int htabinstall; /* install the symbol */
double treal;
double tcpu;
double tsys;
double tio;
double timem;
cell *junkp;
char *sname;
double ncom;
double expand();
char *getname();
/*
* usracct saves records of type Olduser.
* There is one record for every possible uid less than
* the largest uid seen in the previous usracct or in savacct.
* uid's that had no activity correspond to zero filled slots;
* thus one can index the file and get the user record out.
* It would be better to save only user information for users
* that the system knows about to save space, but that is not
* upward compatabile with the old system.
*
* In the old version of sa, uid's greater than 999 were not handled
* properly; this system will do that.
*/
char * USRACCT = "usracct";
char * SAVACCT = "savacct";
char * ACCT = "acct";
char * ACCTDIR = "/usr/adm/\0"; /* padded with an extra null! */
int cellcmp();
cell *junkp = 0;
int htabinstall = 1;
int maxuser = -1;
int (*cmp)();
main(argc, argv)
char **argv;
{
FILE *ff;
int i, j;
extern tcmp(), ncmp(), bcmp(), dcmp(), Dcmp(), kcmp(), Kcmp();
extern double sum();
double ft;
register struct allocbox *allocwalk;
register cell *tp, *ub;
int size;
int nchunks;
struct chunkdesc *chunkvector;
int smallest;
int c;
extern char * optarg;
extern int optind;
setbuf(stdout, NULL);
setbuf(stderr, NULL);
maxuser = USERSLOP + getmaxuid();
tabinit();
cmp = tcmp;
while ((c = getopt(argc, argv, "abcdDe:fgijkKlmnorstuv:")) != EOF)
{
switch (c)
{
case 'a': aflg++; break;
case 'b': bflg++; cmp = bcmp; break;
case 'c': cflg++; break;
case 'd': dflg++; cmp = dcmp; break;
case 'D': Dflg++; cmp = Dcmp; break;
case 'e': ACCTDIR = optarg; break;
case 'f': fflg++; break;
case 'g': gflg++; break;
case 'i': iflg++; break;
case 'j': jflg++; break;
case 'k': kflg++; cmp = kcmp; break;
case 'K': Kflg++; cmp = Kcmp; break;
case 'l': lflg++; break;
case 'm': mflg++; break;
case 'n': nflg++; cmp = ncmp; break;
case 'o': oflg++; break;
case 'r': rflg++; break;
case 's': sflg++; aflg++; break;
case 't': tflg++; break;
case 'u': uflg++; break;
case 'v': vflg++; thres = atoi(optarg); break;
default:
case '?': fprintf(stderr, "sa: bad option: %c\n", c);
}
}
argv += optind;
argc -= optind;
if (thres == 0)
thres = 1;
if (iflg==0)
init();
if (argc < 1 && !gflg)
{
static char fname[BUFSIZ];
sprintf(fname, "%s%s", ACCTDIR, ACCT);
doacct(fname);
}
else
while (*argv)
doacct(*argv++);
if (uflg)
return;
/*
* cleanup pass
* put junk together
*/
if (vflg)
strip();
if(!aflg)
PROCESSITERATE(allocwalk, tp, ub){
for(j=0; j<NC; j++)
if(tp->p.name[j] == '?')
goto yes;
if(tp->p.count != 1)
continue;
yes:
if(junkp == 0)
junkp = enter("***other");
junkp->p.count += tp->p.count;
junkp->p.realt += tp->p.realt;
junkp->p.cput += tp->p.cput;
junkp->p.syst += tp->p.syst;
junkp->p.imem += tp->p.imem;
junkp->p.io += tp->p.io;
tp->p.name[0] = 0;
}
if (sflg) {
static char fname[BUFSIZ];
sprintf(fname, "%s%s", ACCTDIR, USRACCT);
signal(SIGINT, SIG_IGN);
if ((ff = fopen(fname, "w")) != NULL) {
static struct user ZeroUser = {0};
struct user *up;
int uid;
/*
* Write out just enough user slots,
* filling with zero slots for users that
* weren't found.
* The file can be indexed directly by uid
* to get the correct record.
*/
for (uid = 0; uid < maxuser; uid++){
if ( (up = wasuser(uid)) != 0)
fwrite((char *)&(up->oldu),
sizeof(struct Olduser),1,ff);
else
fwrite((char *)&(ZeroUser.oldu),
sizeof(struct Olduser),1,ff);
}
}
(void) fclose(ff);
sprintf(fname, "%s%s", ACCTDIR, SAVACCT);
if ((ff = fopen(fname, "w")) == NULL) {
printf("Can't save\n");
exit(0);
}
PROCESSITERATE(allocwalk, tp, ub)
fwrite((char *)&(tp->p), sizeof(struct process), 1, ff);
(void) fclose(ff);
creat(sname, 0644);
signal(SIGINT, SIG_DFL);
}
/*
* sort and print
*/
if (mflg) {
printmoney();
exit(0);
}
column(ncom, treal, tcpu, tsys, timem, tio);
printf("\n");
/*
* the fragmented table is sorted by sorting each fragment
* and then merging.
*/
nchunks = 0;
TABCHUNKS(allocwalk, tp, size){
qsort(tp, size, sizeof(cell), cellcmp);
nchunks ++;
}
chunkvector = (struct chunkdesc *)calloc(nchunks,
sizeof(struct chunkdesc));
nchunks = 0;
TABCHUNKS(allocwalk, tp, size){
chunkvector[nchunks].chunk_tp = tp;
chunkvector[nchunks].chunk_n = size;
nchunks++;
}
for(; nchunks; ){
/*
* Find the smallest element at the head of the queues.
*/
smallest = 0;
for (i = 1; i < nchunks; i++){
if (cellcmp(chunkvector[i].chunk_tp,
chunkvector[smallest].chunk_tp) < 0)
smallest = i;
}
tp = chunkvector[smallest].chunk_tp++;
/*
* If this queue is drained, drop the chunk count,
* and readjust the queues.
*/
if (--chunkvector[smallest].chunk_n == 0){
nchunks--;
for (i = smallest; i < nchunks; i++)
chunkvector[i] = chunkvector[i+1];
}
if (ISPROCESS(tp)){
ft = tp->p.count;
column(ft, tp->p.realt, tp->p.cput,
tp->p.syst, tp->p.imem, tp->p.io);
printf(" %.14s\n", tp->p.name);
}
} /* iterate to merge the lists */
}
printmoney()
{
register i;
register char *cp;
register struct user *up;
getnames(); /* fetches all of the names! */
for (i = 0; i < maxuser; i++) {
if ( (up = wasuser(i)) != 0){
if (up->us_cnt) {
if (up->us_name[0])
printf("%-8s", up->us_name);
else
printf("%-8d", i);
printf("%7u %9.2fcpu %10.0ftio %12.0fk*sec\n",
up->us_cnt, up->us_ctime/60,
up->us_io,
up->us_imem / (60 * 2));
}
}
}
}
column(n, a, b, c, d, e)
double n, a, b, c, d, e;
{
printf("%8.0f", n);
if(cflg) {
if(n == ncom)
printf("%9s", ""); else
printf("%8.2f%%", 100.*n/ncom);
}
col(n, a, treal, "re");
if (oflg)
col(n, 3600*(b/(b+c)), tcpu+tsys, "u/s");
else if(lflg) {
col(n, b, tcpu, "u");
col(n, c, tsys, "s");
} else
col(n, b+c, tcpu+tsys, "cp");
if(tflg)
printf("%8.1f", a/(b+c), "re/cp");
if(dflg || !Dflg)
printf("%10.0favio", e/(n?n:1));
else
printf("%10.0ftio", e);
if (kflg || !Kflg)
printf("%10.0fk", d/(2*((b+c)!=0.0?(b+c):1.0)));
else
printf("%10.0fk*sec", d/(2*60));
}
col(n, a, m, cp)
double n, a, m;
char *cp;
{
if(jflg)
printf("%11.2f%s", a/(n*60.), cp); else
printf("%11.2f%s", a/3600., cp);
if(cflg) {
if(a == m)
printf("%9s", ""); else
printf("%8.2f%%", 100.*a/m);
}
}
doacct(f)
char *f;
{
FILE *ff;
long x, y, z;
struct acct fbuf;
register char *cp;
register int c;
register struct user *up;
register cell *tp;
int nrecords = 0;
if (sflg && sname) {
printf("Only 1 file with -s\n");
exit(0);
}
if (sflg)
{
sname = f;
}
if ((ff = fopen(f, "r"))==NULL) {
printf("Can't open %s\n", f);
return;
}
while (fread((char *)&fbuf, sizeof(fbuf), 1, ff) == 1) {
++nrecords;
#ifdef DEBUG
if (nrecords % 1000 == 0)
printf("Input record from %s number %d\n",
f, nrecords);
#endif DEBUG
if (fbuf.ac_comm[0]==0) {
fbuf.ac_comm[0] = '?';
}
for (cp = fbuf.ac_comm; cp < &fbuf.ac_comm[NC]; cp++) {
c = *cp & 0377;
if (c && (c < ' ' || c >= 0200)) {
*cp = '?';
}
}
if (fbuf.ac_flag&AFORK) {
for (cp=fbuf.ac_comm; cp < &fbuf.ac_comm[NC]; cp++)
if (*cp==0) {
*cp = '*';
break;
}
}
x = expand(fbuf.ac_utime) + expand(fbuf.ac_stime);
y = fbuf.ac_mem;
z = expand(fbuf.ac_io);
if (uflg) {
printf("%5d %6.1fcp %6dmem %6dio %.*s\n",
fbuf.ac_uid, x/60.0, y, z,
NC, fbuf.ac_comm);
continue;
}
up = finduser(fbuf.ac_uid);
if (up == 0)
{
fprintf(stderr,"sa: Invalid record #%d\n", nrecords);
dumprec(&fbuf);
continue; /* preposterous user id */
}
up->us_cnt++;
up->us_ctime += x/60.;
up->us_imem += x * y;
up->us_io += z;
ncom += 1.0;
tp = enter(fbuf.ac_comm);
tp->p.imem += x * y;
timem += x * y;
tp->p.count++;
x = expand(fbuf.ac_etime)*60;
tp->p.realt += x;
treal += x;
x = expand(fbuf.ac_utime);
tp->p.cput += x;
tcpu += x;
x = expand(fbuf.ac_stime);
tp->p.syst += x;
tsys += x;
tp->p.io += z;
tio += z;
}
fclose(ff);
}
/*
* Generalized cell compare routine, to cast out users
*/
cellcmp(p1, p2)
cell *p1, *p2;
{
if (ISPROCESS(p1)){
if (ISPROCESS(p2))
return(cmp(p1, p2));
return(-1);
}
if (ISPROCESS(p2))
return(1);
return(0);
}
ncmp(p1, p2)
cell *p1, *p2;
{
if(p1->p.count == p2->p.count)
return(tcmp(p1, p2));
if(rflg)
return(p1->p.count - p2->p.count);
return(p2->p.count - p1->p.count);
}
bcmp(p1, p2)
cell *p1, *p2;
{
double f1, f2;
double sum();
f1 = sum(p1)/p1->p.count;
f2 = sum(p2)/p2->p.count;
if(f1 < f2) {
if(rflg)
return(-1);
return(1);
}
if(f1 > f2) {
if(rflg)
return(1);
return(-1);
}
return(0);
}
Kcmp(p1, p2)
cell *p1, *p2;
{
if (p1->p.imem < p2->p.imem) {
if(rflg)
return(-1);
return(1);
}
if (p1->p.imem > p2->p.imem) {
if(rflg)
return(1);
return(-1);
}
return(0);
}
kcmp(p1, p2)
cell *p1, *p2;
{
double a1, a2;
a1 = p1->p.imem / ((p1->p.cput+p1->p.syst)?(p1->p.cput+p1->p.syst):1);
a2 = p2->p.imem / ((p2->p.cput+p2->p.syst)?(p2->p.cput+p2->p.syst):1);
if (a1 < a2) {
if(rflg)
return(-1);
return(1);
}
if (a1 > a2) {
if(rflg)
return(1);
return(-1);
}
return(0);
}
dcmp(p1, p2)
cell *p1, *p2;
{
double a1, a2;
a1 = p1->p.io / (p1->p.count?p1->p.count:1);
a2 = p2->p.io / (p2->p.count?p2->p.count:1);
if (a1 < a2) {
if(rflg)
return(-1);
return(1);
}
if (a1 > a2) {
if(rflg)
return(1);
return(-1);
}
return(0);
}
Dcmp(p1, p2)
cell *p1, *p2;
{
if (p1->p.io < p2->p.io) {
if(rflg)
return(-1);
return(1);
}
if (p1->p.io > p2->p.io) {
if(rflg)
return(1);
return(-1);
}
return(0);
}
tcmp(p1, p2)
cell *p1, *p2;
{
extern double sum();
double f1, f2;
f1 = sum(p1);
f2 = sum(p2);
if(f1 < f2) {
if(rflg)
return(-1);
return(1);
}
if(f1 > f2) {
if(rflg)
return(1);
return(-1);
}
return(0);
}
double sum(p)
cell *p;
{
if(p->p.name[0] == 0)
return(0.0);
return( p->p.cput + p->p.syst);
}
init()
{
struct user userbuf;
struct process tbuf;
register cell *tp;
register struct user *up;
int uid;
FILE *f;
static char fname[BUFSIZ];
sprintf(fname, "%s%s", ACCTDIR, SAVACCT);
if ((f = fopen(fname, "r")) == NULL)
goto gshm;
while (fread((char *)&tbuf, sizeof(struct process), 1, f) == 1) {
tp = enter(tbuf.name);
ncom += tbuf.count;
tp->p.count = tbuf.count;
treal += tbuf.realt;
tp->p.realt = tbuf.realt;
tcpu += tbuf.cput;
tp->p.cput = tbuf.cput;
tsys += tbuf.syst;
tp->p.syst = tbuf.syst;
tio += tbuf.io;
tp->p.io = tbuf.io;
timem += tbuf.imem;
tp->p.imem = tbuf.imem;
}
fclose(f);
gshm:
sprintf(fname, "%s%s", ACCTDIR, USRACCT);
if ((f = fopen(fname, "r")) == NULL)
return;
for(uid = 0;
fread((char *)&(userbuf.oldu), sizeof(struct Olduser), 1, f) == 1;
uid++){
if (userbuf.us_cnt){
up = finduser(uid);
if (up == 0)
continue; /* preposterous user id */
up->oldu = userbuf.oldu;
}
}
fclose(f);
}
strip()
{
int c;
register struct allocbox *allocwalk;
register cell *tp, *ub, *junkp;
if (fflg)
printf("Categorizing commands used %d times or fewer as **junk**\n",
thres);
junkp = enter("**junk**");
PROCESSITERATE(allocwalk, tp, ub){
if (tp->p.name[0] && tp->p.count <= thres) {
if (!fflg)
printf("%.14s--", tp->p.name);
if (fflg || ((c=getchar())=='y')) {
tp->p.name[0] = '\0';
junkp->p.count += tp->p.count;
junkp->p.realt += tp->p.realt;
junkp->p.cput += tp->p.cput;
junkp->p.syst += tp->p.syst;
junkp->p.imem += tp->p.imem;
junkp->p.io += tp->p.io;
}
if (!fflg)
while (c && c!='\n')
c = getchar();
}
}
}
double
expand(t)
unsigned short t;
{
register double nt;
nt = t&017777;
t >>= 13;
while (t!=0) {
t--;
nt *= 8.0;
}
return(nt);
}
static char UserKey[NAMELG + 2];
char *makekey(uid)
int uid;
{
sprintf(UserKey+1, "%04x", uid);
UserKey[0] = USERKEY;
return(UserKey);
}
struct user *wasuser(uid)
int uid;
{
struct user *tp;
htabinstall = 0;
tp = finduser(uid);
htabinstall = 1;
return(tp);
}
/*
* Only call this if you really want to insert it in the table!
*/
struct user *finduser(uid)
int uid;
{
if (uid > maxuser){
fprintf(stderr, "Preposterous user id, %d: ignored\n", uid);
return(0);
} else {
return((struct user*)enter(makekey(uid)));
}
}
/*
* Set the names of all users in the password file.
* We will later not print those that didn't do anything.
*/
getnames()
{
register struct user *tp;
register struct passwd *pw;
struct passwd *getpwent();
setpwent();
while (pw = getpwent()){
if ( (tp = wasuser(pw->pw_uid)) != 0)
strncpy(tp->us_name, pw->pw_name, NAMELG);
}
endpwent();
}
int getmaxuid()
{
register struct user *tp;
register struct passwd *pw;
struct passwd *getpwent();
int maxuid = -1;
setpwent();
while(pw = getpwent()){
if (pw->pw_uid > maxuid)
maxuid = pw->pw_uid;
}
endpwent();
return(maxuid);
}
tabinit()
{
allochead = 0;
alloctail = 0;
nexttab = 0;
tabsleft = 0;
htab = 0;
ntabs = 0;
htaballoc(); /* get the first part of the hash table */
}
#define ALLOCQTY sizeof (struct allocbox)
cell *taballoc()
{
if (tabsleft == 0){
newbox = (struct allocbox *)calloc(1, ALLOCQTY);
tabsleft = TABDALLOP;
nexttab = &newbox->tabslots[0];
if (alloctail == 0){
allochead = alloctail = newbox;
} else {
alloctail->nextalloc = newbox;
alloctail = newbox;
}
}
--tabsleft;
++ntabs;
#ifdef DEBUG
if (ntabs % 100 == 0)
printf("##Accounting table slot # %d\n", ntabs);
#endif DEBUG
return(nexttab++);
}
htaballoc()
{
register struct hashdallop *new;
#ifdef DEBUG
static int ntables = 0;
printf("%%%New hash table chunk allocated, number %d\n", ++ntables);
#endif DEBUG
new = (struct hashdallop *)calloc(1, sizeof (struct hashdallop));
if (htab == 0)
htab = new;
else { /* add AFTER the 1st slot */
new->h_next = htab->h_next;
htab->h_next = new;
}
}
#define HASHCLOGGED (NHASH / 2)
/*
* Lookup a symbol passed in as the argument.
*
* We take pains to avoid function calls; this function
* is called quite frequently, and the calling overhead
* contributes significantly to the overall execution speed of sa.
*/
cell *
enter(name)
char *name;
{
static int initialprobe;
register cell **hp;
register char *from;
register char *to;
register int len;
register int nprobes;
static struct hashdallop *hdallop;
static cell **emptyslot;
static struct hashdallop *emptyhd;
static cell **hp_ub;
emptyslot = 0;
for (nprobes = 0, from = name, len = 0;
*from && len < NC;
nprobes <<= 2, nprobes += *from++, len++)
continue;
nprobes += from[-1] << 5;
nprobes %= NHASH;
if (nprobes < 0)
nprobes += NHASH;
initialprobe = nprobes;
for (hdallop = htab; hdallop != 0; hdallop = hdallop->h_next){
for (hp = &(hdallop->h_tab[initialprobe]),
nprobes = 1,
hp_ub = &(hdallop->h_tab[NHASH]);
(*hp) && (nprobes < NHASH);
hp += nprobes,
hp -= (hp >= hp_ub) ? NHASH:0,
nprobes += 2)
{
from = name;
to = (*hp)->p.name;
for (len = 0; (len<NC) && *from; len++)
if (*from++ != *to++)
goto nextprobe;
if (len >= NC) /*both are maximal length*/
return(*hp);
if (*to == 0) /*assert *from == 0*/
return(*hp);
nextprobe: ;
}
if (*hp == 0 && emptyslot == 0 &&
hdallop->h_nused < HASHCLOGGED) {
emptyslot = hp;
emptyhd = hdallop;
}
}
if (emptyslot == 0) {
htaballoc();
hdallop = htab->h_next; /* aren't we smart! */
hp = &hdallop->h_tab[initialprobe];
} else {
hdallop = emptyhd;
hp = emptyslot;
}
if (htabinstall){
*hp = taballoc();
hdallop->h_nused++;
for(len = 0, from = name, to = (*hp)->p.name; (len<NC); len++)
if ((*to++ = *from++) == '\0')
break;
return(*hp);
}
return(0);
} /*end of lookup*/
dumprec(ap)
struct acct *ap;
{
fprintf(stderr, "ac_comm:<%-*.*s>; ", sizeof ap->ac_comm,
sizeof ap->ac_comm, ap->ac_comm);
fprintf(stderr, "ac_utime:%g; ", expand(ap->ac_utime));
fprintf(stderr, "ac_stime:%g; ", expand(ap->ac_stime));
fprintf(stderr, "ac_etime:%g\n", expand(ap->ac_etime));
fprintf(stderr, "ac_btime:%-24.24s; ", ctime(&ap->ac_btime));
fprintf(stderr, "ac_uid:%5hd; ", ap->ac_uid);
fprintf(stderr, "ac_gid:%5hd; ", ap->ac_gid);
fprintf(stderr, "ac_mem:%5hd\n", ap->ac_mem);
fprintf(stderr, "ac_io:%g; ", expand(ap->ac_io));
fprintf(stderr, "ac_tty:0x%4hX; ", ap->ac_tty);
fprintf(stderr, "ac_flag:0x%X\n", ap->ac_flag);
}
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.