Home | History | Annotate | Line # | Download | only in pac
pac.c revision 1.6
      1  1.6       pk /*	$NetBSD: pac.c,v 1.6 1996/01/13 23:18:15 pk Exp $	*/
      2  1.1      cgd /*
      3  1.3      cgd  * Copyright (c) 1983, 1993
      4  1.3      cgd  *	The Regents of the University of California.  All rights reserved.
      5  1.3      cgd  *
      6  1.1      cgd  *
      7  1.1      cgd  * Redistribution and use in source and binary forms, with or without
      8  1.1      cgd  * modification, are permitted provided that the following conditions
      9  1.1      cgd  * are met:
     10  1.1      cgd  * 1. Redistributions of source code must retain the above copyright
     11  1.1      cgd  *    notice, this list of conditions and the following disclaimer.
     12  1.1      cgd  * 2. Redistributions in binary form must reproduce the above copyright
     13  1.1      cgd  *    notice, this list of conditions and the following disclaimer in the
     14  1.1      cgd  *    documentation and/or other materials provided with the distribution.
     15  1.1      cgd  * 3. All advertising materials mentioning features or use of this software
     16  1.1      cgd  *    must display the following acknowledgement:
     17  1.1      cgd  *	This product includes software developed by the University of
     18  1.1      cgd  *	California, Berkeley and its contributors.
     19  1.1      cgd  * 4. Neither the name of the University nor the names of its contributors
     20  1.1      cgd  *    may be used to endorse or promote products derived from this software
     21  1.1      cgd  *    without specific prior written permission.
     22  1.1      cgd  *
     23  1.1      cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     24  1.1      cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     25  1.1      cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     26  1.1      cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     27  1.1      cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     28  1.1      cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     29  1.1      cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     30  1.1      cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     31  1.1      cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     32  1.1      cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     33  1.1      cgd  * SUCH DAMAGE.
     34  1.1      cgd  */
     35  1.1      cgd 
     36  1.1      cgd #ifndef lint
     37  1.3      cgd static char copyright[] =
     38  1.3      cgd "@(#) Copyright (c) 1983, 1993\n\
     39  1.3      cgd 	The Regents of the University of California.  All rights reserved.\n";
     40  1.1      cgd #endif /* not lint */
     41  1.1      cgd 
     42  1.1      cgd #ifndef lint
     43  1.3      cgd static char sccsid[] = "@(#)pac.c	8.1 (Berkeley) 6/6/93";
     44  1.1      cgd #endif /* not lint */
     45  1.1      cgd 
     46  1.1      cgd /*
     47  1.1      cgd  * Do Printer accounting summary.
     48  1.1      cgd  * Currently, usage is
     49  1.1      cgd  *	pac [-Pprinter] [-pprice] [-s] [-r] [-c] [-m] [user ...]
     50  1.1      cgd  * to print the usage information for the named people.
     51  1.1      cgd  */
     52  1.1      cgd 
     53  1.3      cgd #include <sys/param.h>
     54  1.3      cgd 
     55  1.3      cgd #include <dirent.h>
     56  1.3      cgd #include <stdlib.h>
     57  1.1      cgd #include <stdio.h>
     58  1.3      cgd #include <string.h>
     59  1.3      cgd #include "lp.h"
     60  1.1      cgd #include "lp.local.h"
     61  1.1      cgd 
     62  1.3      cgd static char	*acctfile;	/* accounting file (input data) */
     63  1.3      cgd static int	 allflag = 1;	/* Get stats on everybody */
     64  1.3      cgd static int	 errs;
     65  1.3      cgd static int	 hcount;	/* Count of hash entries */
     66  1.3      cgd static int	 mflag = 0;	/* disregard machine names */
     67  1.3      cgd static int	 pflag = 0;	/* 1 if -p on cmd line */
     68  1.3      cgd static float	 price = 0.02;	/* cost per page (or what ever) */
     69  1.3      cgd static long	 price100;	/* per-page cost in 100th of a cent */
     70  1.3      cgd static int	 reverse;	/* Reverse sort order */
     71  1.3      cgd static int	 sort;		/* Sort by cost */
     72  1.3      cgd static char	*sumfile;	/* summary file */
     73  1.3      cgd static int	 summarize;	/* Compress accounting file */
     74  1.1      cgd 
     75  1.4  hpeyerl uid_t	uid, euid;
     76  1.4  hpeyerl 
     77  1.1      cgd /*
     78  1.1      cgd  * Grossness follows:
     79  1.1      cgd  *  Names to be accumulated are hashed into the following
     80  1.1      cgd  *  table.
     81  1.1      cgd  */
     82  1.1      cgd 
     83  1.1      cgd #define	HSHSIZE	97			/* Number of hash buckets */
     84  1.1      cgd 
     85  1.1      cgd struct hent {
     86  1.1      cgd 	struct	hent *h_link;		/* Forward hash link */
     87  1.1      cgd 	char	*h_name;		/* Name of this user */
     88  1.1      cgd 	float	h_feetpages;		/* Feet or pages of paper */
     89  1.1      cgd 	int	h_count;		/* Number of runs */
     90  1.1      cgd };
     91  1.1      cgd 
     92  1.3      cgd static struct	hent	*hashtab[HSHSIZE];	/* Hash table proper */
     93  1.3      cgd 
     94  1.3      cgd static void	account __P((FILE *));
     95  1.3      cgd static int	any __P((int, char []));
     96  1.3      cgd static int	chkprinter __P((char *));
     97  1.3      cgd static void	dumpit __P((void));
     98  1.3      cgd static int	hash __P((char []));
     99  1.3      cgd static struct	hent *enter __P((char []));
    100  1.3      cgd static struct	hent *lookup __P((char []));
    101  1.3      cgd static int	qucmp __P((const void *, const void *));
    102  1.3      cgd static void	rewrite __P((void));
    103  1.1      cgd 
    104  1.3      cgd void
    105  1.1      cgd main(argc, argv)
    106  1.3      cgd 	int argc;
    107  1.1      cgd 	char **argv;
    108  1.1      cgd {
    109  1.1      cgd 	register FILE *acct;
    110  1.1      cgd 	register char *cp;
    111  1.1      cgd 
    112  1.4  hpeyerl 	euid = geteuid();	/* these aren't used in pac(1) */
    113  1.4  hpeyerl 	uid = getuid();
    114  1.1      cgd 	while (--argc) {
    115  1.1      cgd 		cp = *++argv;
    116  1.1      cgd 		if (*cp++ == '-') {
    117  1.1      cgd 			switch(*cp++) {
    118  1.1      cgd 			case 'P':
    119  1.1      cgd 				/*
    120  1.1      cgd 				 * Printer name.
    121  1.1      cgd 				 */
    122  1.1      cgd 				printer = cp;
    123  1.1      cgd 				continue;
    124  1.1      cgd 
    125  1.1      cgd 			case 'p':
    126  1.1      cgd 				/*
    127  1.1      cgd 				 * get the price.
    128  1.1      cgd 				 */
    129  1.1      cgd 				price = atof(cp);
    130  1.1      cgd 				pflag = 1;
    131  1.1      cgd 				continue;
    132  1.1      cgd 
    133  1.1      cgd 			case 's':
    134  1.1      cgd 				/*
    135  1.1      cgd 				 * Summarize and compress accounting file.
    136  1.1      cgd 				 */
    137  1.1      cgd 				summarize++;
    138  1.1      cgd 				continue;
    139  1.1      cgd 
    140  1.1      cgd 			case 'c':
    141  1.1      cgd 				/*
    142  1.1      cgd 				 * Sort by cost.
    143  1.1      cgd 				 */
    144  1.1      cgd 				sort++;
    145  1.1      cgd 				continue;
    146  1.1      cgd 
    147  1.1      cgd 			case 'm':
    148  1.1      cgd 				/*
    149  1.1      cgd 				 * disregard machine names for each user
    150  1.1      cgd 				 */
    151  1.1      cgd 				mflag = 1;
    152  1.1      cgd 				continue;
    153  1.1      cgd 
    154  1.1      cgd 			case 'r':
    155  1.1      cgd 				/*
    156  1.1      cgd 				 * Reverse sorting order.
    157  1.1      cgd 				 */
    158  1.1      cgd 				reverse++;
    159  1.1      cgd 				continue;
    160  1.1      cgd 
    161  1.1      cgd 			default:
    162  1.1      cgd fprintf(stderr,
    163  1.1      cgd     "usage: pac [-Pprinter] [-pprice] [-s] [-c] [-r] [-m] [user ...]\n");
    164  1.1      cgd 				exit(1);
    165  1.1      cgd 			}
    166  1.1      cgd 		}
    167  1.1      cgd 		(void) enter(--cp);
    168  1.1      cgd 		allflag = 0;
    169  1.1      cgd 	}
    170  1.1      cgd 	if (printer == NULL && (printer = getenv("PRINTER")) == NULL)
    171  1.1      cgd 		printer = DEFLP;
    172  1.1      cgd 	if (!chkprinter(printer)) {
    173  1.1      cgd 		printf("pac: unknown printer %s\n", printer);
    174  1.1      cgd 		exit(2);
    175  1.1      cgd 	}
    176  1.1      cgd 
    177  1.1      cgd 	if ((acct = fopen(acctfile, "r")) == NULL) {
    178  1.1      cgd 		perror(acctfile);
    179  1.1      cgd 		exit(1);
    180  1.1      cgd 	}
    181  1.1      cgd 	account(acct);
    182  1.1      cgd 	fclose(acct);
    183  1.1      cgd 	if ((acct = fopen(sumfile, "r")) != NULL) {
    184  1.1      cgd 		account(acct);
    185  1.1      cgd 		fclose(acct);
    186  1.1      cgd 	}
    187  1.1      cgd 	if (summarize)
    188  1.1      cgd 		rewrite();
    189  1.1      cgd 	else
    190  1.1      cgd 		dumpit();
    191  1.1      cgd 	exit(errs);
    192  1.1      cgd }
    193  1.1      cgd 
    194  1.1      cgd /*
    195  1.1      cgd  * Read the entire accounting file, accumulating statistics
    196  1.1      cgd  * for the users that we have in the hash table.  If allflag
    197  1.1      cgd  * is set, then just gather the facts on everyone.
    198  1.1      cgd  * Note that we must accomodate both the active and summary file
    199  1.1      cgd  * formats here.
    200  1.1      cgd  * Host names are ignored if the -m flag is present.
    201  1.1      cgd  */
    202  1.3      cgd static void
    203  1.1      cgd account(acct)
    204  1.1      cgd 	register FILE *acct;
    205  1.1      cgd {
    206  1.1      cgd 	char linebuf[BUFSIZ];
    207  1.1      cgd 	double t;
    208  1.1      cgd 	register char *cp, *cp2;
    209  1.1      cgd 	register struct hent *hp;
    210  1.1      cgd 	register int ic;
    211  1.1      cgd 
    212  1.1      cgd 	while (fgets(linebuf, BUFSIZ, acct) != NULL) {
    213  1.1      cgd 		cp = linebuf;
    214  1.6       pk 		while (any(*cp, " \t"))
    215  1.1      cgd 			cp++;
    216  1.1      cgd 		t = atof(cp);
    217  1.1      cgd 		while (any(*cp, ".0123456789"))
    218  1.1      cgd 			cp++;
    219  1.1      cgd 		while (any(*cp, " \t"))
    220  1.1      cgd 			cp++;
    221  1.1      cgd 		for (cp2 = cp; !any(*cp2, " \t\n"); cp2++)
    222  1.1      cgd 			;
    223  1.1      cgd 		ic = atoi(cp2);
    224  1.1      cgd 		*cp2 = '\0';
    225  1.1      cgd 		if (mflag && index(cp, ':'))
    226  1.1      cgd 		    cp = index(cp, ':') + 1;
    227  1.1      cgd 		hp = lookup(cp);
    228  1.3      cgd 		if (hp == NULL) {
    229  1.1      cgd 			if (!allflag)
    230  1.1      cgd 				continue;
    231  1.1      cgd 			hp = enter(cp);
    232  1.1      cgd 		}
    233  1.1      cgd 		hp->h_feetpages += t;
    234  1.1      cgd 		if (ic)
    235  1.1      cgd 			hp->h_count += ic;
    236  1.1      cgd 		else
    237  1.1      cgd 			hp->h_count++;
    238  1.1      cgd 	}
    239  1.1      cgd }
    240  1.1      cgd 
    241  1.1      cgd /*
    242  1.1      cgd  * Sort the hashed entries by name or footage
    243  1.1      cgd  * and print it all out.
    244  1.1      cgd  */
    245  1.3      cgd static void
    246  1.1      cgd dumpit()
    247  1.1      cgd {
    248  1.1      cgd 	struct hent **base;
    249  1.1      cgd 	register struct hent *hp, **ap;
    250  1.1      cgd 	register int hno, c, runs;
    251  1.1      cgd 	float feet;
    252  1.1      cgd 
    253  1.1      cgd 	hp = hashtab[0];
    254  1.1      cgd 	hno = 1;
    255  1.1      cgd 	base = (struct hent **) calloc(sizeof hp, hcount);
    256  1.1      cgd 	for (ap = base, c = hcount; c--; ap++) {
    257  1.3      cgd 		while (hp == NULL)
    258  1.1      cgd 			hp = hashtab[hno++];
    259  1.1      cgd 		*ap = hp;
    260  1.1      cgd 		hp = hp->h_link;
    261  1.1      cgd 	}
    262  1.1      cgd 	qsort(base, hcount, sizeof hp, qucmp);
    263  1.1      cgd 	printf("  Login               pages/feet   runs    price\n");
    264  1.1      cgd 	feet = 0.0;
    265  1.1      cgd 	runs = 0;
    266  1.1      cgd 	for (ap = base, c = hcount; c--; ap++) {
    267  1.1      cgd 		hp = *ap;
    268  1.1      cgd 		runs += hp->h_count;
    269  1.1      cgd 		feet += hp->h_feetpages;
    270  1.1      cgd 		printf("%-24s %7.2f %4d   $%6.2f\n", hp->h_name,
    271  1.1      cgd 		    hp->h_feetpages, hp->h_count, hp->h_feetpages * price);
    272  1.1      cgd 	}
    273  1.1      cgd 	if (allflag) {
    274  1.1      cgd 		printf("\n");
    275  1.1      cgd 		printf("%-24s %7.2f %4d   $%6.2f\n", "total", feet,
    276  1.1      cgd 		    runs, feet * price);
    277  1.1      cgd 	}
    278  1.1      cgd }
    279  1.1      cgd 
    280  1.1      cgd /*
    281  1.1      cgd  * Rewrite the summary file with the summary information we have accumulated.
    282  1.1      cgd  */
    283  1.3      cgd static void
    284  1.1      cgd rewrite()
    285  1.1      cgd {
    286  1.1      cgd 	register struct hent *hp;
    287  1.1      cgd 	register int i;
    288  1.1      cgd 	register FILE *acctf;
    289  1.1      cgd 
    290  1.1      cgd 	if ((acctf = fopen(sumfile, "w")) == NULL) {
    291  1.1      cgd 		perror(sumfile);
    292  1.1      cgd 		errs++;
    293  1.1      cgd 		return;
    294  1.1      cgd 	}
    295  1.1      cgd 	for (i = 0; i < HSHSIZE; i++) {
    296  1.1      cgd 		hp = hashtab[i];
    297  1.1      cgd 		while (hp != NULL) {
    298  1.1      cgd 			fprintf(acctf, "%7.2f\t%s\t%d\n", hp->h_feetpages,
    299  1.1      cgd 			    hp->h_name, hp->h_count);
    300  1.1      cgd 			hp = hp->h_link;
    301  1.1      cgd 		}
    302  1.1      cgd 	}
    303  1.1      cgd 	fflush(acctf);
    304  1.1      cgd 	if (ferror(acctf)) {
    305  1.1      cgd 		perror(sumfile);
    306  1.1      cgd 		errs++;
    307  1.1      cgd 	}
    308  1.1      cgd 	fclose(acctf);
    309  1.1      cgd 	if ((acctf = fopen(acctfile, "w")) == NULL)
    310  1.1      cgd 		perror(acctfile);
    311  1.1      cgd 	else
    312  1.1      cgd 		fclose(acctf);
    313  1.1      cgd }
    314  1.1      cgd 
    315  1.1      cgd /*
    316  1.1      cgd  * Hashing routines.
    317  1.1      cgd  */
    318  1.1      cgd 
    319  1.1      cgd /*
    320  1.1      cgd  * Enter the name into the hash table and return the pointer allocated.
    321  1.1      cgd  */
    322  1.1      cgd 
    323  1.3      cgd static struct hent *
    324  1.1      cgd enter(name)
    325  1.1      cgd 	char name[];
    326  1.1      cgd {
    327  1.1      cgd 	register struct hent *hp;
    328  1.1      cgd 	register int h;
    329  1.1      cgd 
    330  1.3      cgd 	if ((hp = lookup(name)) != NULL)
    331  1.1      cgd 		return(hp);
    332  1.1      cgd 	h = hash(name);
    333  1.1      cgd 	hcount++;
    334  1.1      cgd 	hp = (struct hent *) calloc(sizeof *hp, 1);
    335  1.1      cgd 	hp->h_name = (char *) calloc(sizeof(char), strlen(name)+1);
    336  1.1      cgd 	strcpy(hp->h_name, name);
    337  1.1      cgd 	hp->h_feetpages = 0.0;
    338  1.1      cgd 	hp->h_count = 0;
    339  1.1      cgd 	hp->h_link = hashtab[h];
    340  1.1      cgd 	hashtab[h] = hp;
    341  1.1      cgd 	return(hp);
    342  1.1      cgd }
    343  1.1      cgd 
    344  1.1      cgd /*
    345  1.1      cgd  * Lookup a name in the hash table and return a pointer
    346  1.1      cgd  * to it.
    347  1.1      cgd  */
    348  1.1      cgd 
    349  1.3      cgd static struct hent *
    350  1.1      cgd lookup(name)
    351  1.1      cgd 	char name[];
    352  1.1      cgd {
    353  1.1      cgd 	register int h;
    354  1.1      cgd 	register struct hent *hp;
    355  1.1      cgd 
    356  1.1      cgd 	h = hash(name);
    357  1.3      cgd 	for (hp = hashtab[h]; hp != NULL; hp = hp->h_link)
    358  1.1      cgd 		if (strcmp(hp->h_name, name) == 0)
    359  1.1      cgd 			return(hp);
    360  1.3      cgd 	return(NULL);
    361  1.1      cgd }
    362  1.1      cgd 
    363  1.1      cgd /*
    364  1.1      cgd  * Hash the passed name and return the index in
    365  1.1      cgd  * the hash table to begin the search.
    366  1.1      cgd  */
    367  1.3      cgd static int
    368  1.1      cgd hash(name)
    369  1.1      cgd 	char name[];
    370  1.1      cgd {
    371  1.1      cgd 	register int h;
    372  1.1      cgd 	register char *cp;
    373  1.1      cgd 
    374  1.1      cgd 	for (cp = name, h = 0; *cp; h = (h << 2) + *cp++)
    375  1.1      cgd 		;
    376  1.1      cgd 	return((h & 0x7fffffff) % HSHSIZE);
    377  1.1      cgd }
    378  1.1      cgd 
    379  1.1      cgd /*
    380  1.1      cgd  * Other stuff
    381  1.1      cgd  */
    382  1.3      cgd static int
    383  1.1      cgd any(ch, str)
    384  1.3      cgd 	int ch;
    385  1.1      cgd 	char str[];
    386  1.1      cgd {
    387  1.1      cgd 	register int c = ch;
    388  1.1      cgd 	register char *cp = str;
    389  1.1      cgd 
    390  1.1      cgd 	while (*cp)
    391  1.1      cgd 		if (*cp++ == c)
    392  1.1      cgd 			return(1);
    393  1.1      cgd 	return(0);
    394  1.1      cgd }
    395  1.1      cgd 
    396  1.1      cgd /*
    397  1.1      cgd  * The qsort comparison routine.
    398  1.1      cgd  * The comparison is ascii collating order
    399  1.1      cgd  * or by feet of typesetter film, according to sort.
    400  1.1      cgd  */
    401  1.3      cgd static int
    402  1.3      cgd qucmp(a, b)
    403  1.3      cgd 	const void *a, *b;
    404  1.1      cgd {
    405  1.1      cgd 	register struct hent *h1, *h2;
    406  1.1      cgd 	register int r;
    407  1.1      cgd 
    408  1.3      cgd 	h1 = *(struct hent **)a;
    409  1.3      cgd 	h2 = *(struct hent **)b;
    410  1.1      cgd 	if (sort)
    411  1.3      cgd 		r = h1->h_feetpages < h2->h_feetpages ?
    412  1.3      cgd 		    -1 : h1->h_feetpages > h2->h_feetpages;
    413  1.1      cgd 	else
    414  1.1      cgd 		r = strcmp(h1->h_name, h2->h_name);
    415  1.1      cgd 	return(reverse ? -r : r);
    416  1.1      cgd }
    417  1.1      cgd 
    418  1.1      cgd /*
    419  1.1      cgd  * Perform lookup for printer name or abbreviation --
    420  1.1      cgd  */
    421  1.3      cgd static int
    422  1.1      cgd chkprinter(s)
    423  1.1      cgd 	register char *s;
    424  1.1      cgd {
    425  1.1      cgd 	int stat;
    426  1.1      cgd 
    427  1.3      cgd 	if ((stat = cgetent(&bp, printcapdb, s)) == -2) {
    428  1.1      cgd 		printf("pac: can't open printer description file\n");
    429  1.1      cgd 		exit(3);
    430  1.3      cgd 	} else if (stat == -1)
    431  1.1      cgd 		return(0);
    432  1.3      cgd 	else if (stat == -3)
    433  1.3      cgd 		fatal("potential reference loop detected in printcap file");
    434  1.3      cgd 
    435  1.3      cgd 	if (cgetstr(bp, "af", &acctfile) == -1) {
    436  1.1      cgd 		printf("accounting not enabled for printer %s\n", printer);
    437  1.1      cgd 		exit(2);
    438  1.1      cgd 	}
    439  1.3      cgd 	if (!pflag && (cgetnum(bp, "pc", &price100) == 0))
    440  1.1      cgd 		price = price100/10000.0;
    441  1.1      cgd 	sumfile = (char *) calloc(sizeof(char), strlen(acctfile)+5);
    442  1.1      cgd 	if (sumfile == NULL) {
    443  1.1      cgd 		perror("pac");
    444  1.1      cgd 		exit(1);
    445  1.1      cgd 	}
    446  1.1      cgd 	strcpy(sumfile, acctfile);
    447  1.1      cgd 	strcat(sumfile, "_sum");
    448  1.1      cgd 	return(1);
    449  1.1      cgd }
    450