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