displayq.c revision 1.5 1 1.1 cgd /*
2 1.4 cgd * Copyright (c) 1983, 1993
3 1.4 cgd * The Regents of the University of California. All rights reserved.
4 1.1 cgd *
5 1.1 cgd * Redistribution and use in source and binary forms, with or without
6 1.1 cgd * modification, are permitted provided that the following conditions
7 1.1 cgd * are met:
8 1.1 cgd * 1. Redistributions of source code must retain the above copyright
9 1.1 cgd * notice, this list of conditions and the following disclaimer.
10 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer in the
12 1.1 cgd * documentation and/or other materials provided with the distribution.
13 1.1 cgd * 3. All advertising materials mentioning features or use of this software
14 1.1 cgd * must display the following acknowledgement:
15 1.1 cgd * This product includes software developed by the University of
16 1.1 cgd * California, Berkeley and its contributors.
17 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
18 1.1 cgd * may be used to endorse or promote products derived from this software
19 1.1 cgd * without specific prior written permission.
20 1.1 cgd *
21 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 1.1 cgd * SUCH DAMAGE.
32 1.1 cgd */
33 1.1 cgd
34 1.1 cgd #ifndef lint
35 1.4 cgd static char sccsid[] = "@(#)displayq.c 8.1 (Berkeley) 6/6/93";
36 1.1 cgd #endif /* not lint */
37 1.1 cgd
38 1.4 cgd #include <sys/param.h>
39 1.4 cgd #include <sys/stat.h>
40 1.1 cgd
41 1.4 cgd #include <signal.h>
42 1.4 cgd #include <fcntl.h>
43 1.4 cgd #include <dirent.h>
44 1.4 cgd #include <unistd.h>
45 1.4 cgd #include <stdio.h>
46 1.4 cgd #include <stdlib.h>
47 1.4 cgd #include <string.h>
48 1.4 cgd #include <ctype.h>
49 1.1 cgd #include "lp.h"
50 1.4 cgd #include "lp.local.h"
51 1.1 cgd #include "pathnames.h"
52 1.1 cgd
53 1.4 cgd /*
54 1.4 cgd * Routines to display the state of the queue.
55 1.4 cgd */
56 1.1 cgd #define JOBCOL 40 /* column for job # in -l format */
57 1.1 cgd #define OWNCOL 7 /* start of Owner column in normal */
58 1.1 cgd #define SIZCOL 62 /* start of Size column in normal */
59 1.1 cgd
60 1.1 cgd /*
61 1.1 cgd * Stuff for handling job specifications
62 1.1 cgd */
63 1.1 cgd extern int requ[]; /* job number of spool entries */
64 1.1 cgd extern int requests; /* # of spool requests */
65 1.4 cgd extern char *user[]; /* users to process */
66 1.4 cgd extern int users; /* # of users in user array */
67 1.1 cgd
68 1.5 hpeyerl extern uid_t uid, euid;
69 1.5 hpeyerl
70 1.4 cgd static int col; /* column on screen */
71 1.4 cgd static char current[40]; /* current file being printed */
72 1.4 cgd static char file[132]; /* print file name */
73 1.4 cgd static int first; /* first file in ``files'' column? */
74 1.4 cgd static int garbage; /* # of garbage cf files */
75 1.4 cgd static int lflag; /* long output option */
76 1.4 cgd static int rank; /* order to be printed (-1=none, 0=active) */
77 1.4 cgd static long totsize; /* total print job size in bytes */
78 1.1 cgd
79 1.4 cgd static char *head0 = "Rank Owner Job Files";
80 1.4 cgd static char *head1 = "Total Size\n";
81 1.1 cgd
82 1.1 cgd /*
83 1.1 cgd * Display the current state of the queue. Format = 1 if long format.
84 1.1 cgd */
85 1.4 cgd void
86 1.1 cgd displayq(format)
87 1.1 cgd int format;
88 1.1 cgd {
89 1.1 cgd register struct queue *q;
90 1.5 hpeyerl register int i, nitems, fd, ret;
91 1.1 cgd register char *cp;
92 1.1 cgd struct queue **queue;
93 1.1 cgd struct stat statb;
94 1.1 cgd FILE *fp;
95 1.1 cgd
96 1.1 cgd lflag = format;
97 1.1 cgd totsize = 0;
98 1.1 cgd rank = -1;
99 1.4 cgd if ((i = cgetent(&bp, printcapdb, printer)) == -2)
100 1.4 cgd fatal("can't open printer description file");
101 1.4 cgd else if (i == -1)
102 1.1 cgd fatal("unknown printer");
103 1.4 cgd else if (i == -3)
104 1.4 cgd fatal("potential reference loop detected in printcap file");
105 1.4 cgd if (cgetstr(bp, "lp", &LP) < 0)
106 1.1 cgd LP = _PATH_DEFDEVLP;
107 1.4 cgd if (cgetstr(bp, "rp", &RP) < 0)
108 1.1 cgd RP = DEFLP;
109 1.4 cgd if (cgetstr(bp, "sd", &SD) < 0)
110 1.1 cgd SD = _PATH_DEFSPOOL;
111 1.4 cgd if (cgetstr(bp,"lo", &LO) < 0)
112 1.1 cgd LO = DEFLOCK;
113 1.4 cgd if (cgetstr(bp, "st", &ST) < 0)
114 1.1 cgd ST = DEFSTAT;
115 1.4 cgd cgetstr(bp, "rm", &RM);
116 1.1 cgd if (cp = checkremote())
117 1.1 cgd printf("Warning: %s\n", cp);
118 1.1 cgd
119 1.1 cgd /*
120 1.1 cgd * Print out local queue
121 1.1 cgd * Find all the control files in the spooling directory
122 1.1 cgd */
123 1.5 hpeyerl seteuid(euid);
124 1.1 cgd if (chdir(SD) < 0)
125 1.1 cgd fatal("cannot chdir to spooling directory");
126 1.5 hpeyerl seteuid(uid);
127 1.1 cgd if ((nitems = getq(&queue)) < 0)
128 1.1 cgd fatal("cannot examine spooling area\n");
129 1.5 hpeyerl seteuid(euid);
130 1.5 hpeyerl ret = stat(LO, &statb);
131 1.5 hpeyerl seteuid(uid);
132 1.5 hpeyerl if (ret >= 0) {
133 1.1 cgd if (statb.st_mode & 0100) {
134 1.1 cgd if (sendtorem)
135 1.1 cgd printf("%s: ", host);
136 1.1 cgd printf("Warning: %s is down: ", printer);
137 1.5 hpeyerl seteuid(euid);
138 1.1 cgd fd = open(ST, O_RDONLY);
139 1.5 hpeyerl seteuid(uid);
140 1.1 cgd if (fd >= 0) {
141 1.1 cgd (void) flock(fd, LOCK_SH);
142 1.1 cgd while ((i = read(fd, line, sizeof(line))) > 0)
143 1.1 cgd (void) fwrite(line, 1, i, stdout);
144 1.1 cgd (void) close(fd); /* unlocks as well */
145 1.1 cgd } else
146 1.1 cgd putchar('\n');
147 1.1 cgd }
148 1.1 cgd if (statb.st_mode & 010) {
149 1.1 cgd if (sendtorem)
150 1.1 cgd printf("%s: ", host);
151 1.1 cgd printf("Warning: %s queue is turned off\n", printer);
152 1.1 cgd }
153 1.1 cgd }
154 1.1 cgd
155 1.1 cgd if (nitems) {
156 1.5 hpeyerl seteuid(euid);
157 1.1 cgd fp = fopen(LO, "r");
158 1.5 hpeyerl seteuid(uid);
159 1.1 cgd if (fp == NULL)
160 1.1 cgd warn();
161 1.1 cgd else {
162 1.1 cgd /* get daemon pid */
163 1.1 cgd cp = current;
164 1.1 cgd while ((*cp = getc(fp)) != EOF && *cp != '\n')
165 1.1 cgd cp++;
166 1.1 cgd *cp = '\0';
167 1.1 cgd i = atoi(current);
168 1.5 hpeyerl if (i <= 0) {
169 1.5 hpeyerl seteuid(euid);
170 1.5 hpeyerl ret = kill(i, 0);
171 1.5 hpeyerl seteuid(uid);
172 1.5 hpeyerl }
173 1.5 hpeyerl ret = -1;
174 1.5 hpeyerl if (ret < 0) {
175 1.1 cgd /* read current file name */
176 1.1 cgd cp = current;
177 1.1 cgd while ((*cp = getc(fp)) != EOF && *cp != '\n')
178 1.1 cgd cp++;
179 1.1 cgd *cp = '\0';
180 1.1 cgd /*
181 1.1 cgd * Print the status file.
182 1.1 cgd */
183 1.1 cgd if (sendtorem)
184 1.1 cgd printf("%s: ", host);
185 1.5 hpeyerl seteuid(euid);
186 1.1 cgd fd = open(ST, O_RDONLY);
187 1.5 hpeyerl seteuid(uid);
188 1.1 cgd if (fd >= 0) {
189 1.1 cgd (void) flock(fd, LOCK_SH);
190 1.1 cgd while ((i = read(fd, line, sizeof(line))) > 0)
191 1.1 cgd (void) fwrite(line, 1, i, stdout);
192 1.1 cgd (void) close(fd); /* unlocks as well */
193 1.1 cgd } else
194 1.1 cgd putchar('\n');
195 1.1 cgd }
196 1.1 cgd (void) fclose(fp);
197 1.1 cgd }
198 1.1 cgd /*
199 1.1 cgd * Now, examine the control files and print out the jobs to
200 1.1 cgd * be done for each user.
201 1.1 cgd */
202 1.1 cgd if (!lflag)
203 1.1 cgd header();
204 1.1 cgd for (i = 0; i < nitems; i++) {
205 1.1 cgd q = queue[i];
206 1.1 cgd inform(q->q_name);
207 1.1 cgd free(q);
208 1.1 cgd }
209 1.1 cgd free(queue);
210 1.1 cgd }
211 1.1 cgd if (!sendtorem) {
212 1.1 cgd if (nitems == 0)
213 1.1 cgd puts("no entries");
214 1.1 cgd return;
215 1.1 cgd }
216 1.1 cgd
217 1.1 cgd /*
218 1.1 cgd * Print foreign queue
219 1.1 cgd * Note that a file in transit may show up in either queue.
220 1.1 cgd */
221 1.1 cgd if (nitems)
222 1.1 cgd putchar('\n');
223 1.1 cgd (void) sprintf(line, "%c%s", format + '\3', RP);
224 1.1 cgd cp = line;
225 1.1 cgd for (i = 0; i < requests; i++) {
226 1.1 cgd cp += strlen(cp);
227 1.1 cgd (void) sprintf(cp, " %d", requ[i]);
228 1.1 cgd }
229 1.1 cgd for (i = 0; i < users; i++) {
230 1.1 cgd cp += strlen(cp);
231 1.1 cgd *cp++ = ' ';
232 1.1 cgd (void) strcpy(cp, user[i]);
233 1.1 cgd }
234 1.1 cgd strcat(line, "\n");
235 1.1 cgd fd = getport(RM);
236 1.1 cgd if (fd < 0) {
237 1.1 cgd if (from != host)
238 1.1 cgd printf("%s: ", host);
239 1.1 cgd printf("connection to %s is down\n", RM);
240 1.1 cgd }
241 1.1 cgd else {
242 1.1 cgd i = strlen(line);
243 1.1 cgd if (write(fd, line, i) != i)
244 1.1 cgd fatal("Lost connection");
245 1.1 cgd while ((i = read(fd, line, sizeof(line))) > 0)
246 1.1 cgd (void) fwrite(line, 1, i, stdout);
247 1.1 cgd (void) close(fd);
248 1.1 cgd }
249 1.1 cgd }
250 1.1 cgd
251 1.1 cgd /*
252 1.1 cgd * Print a warning message if there is no daemon present.
253 1.1 cgd */
254 1.4 cgd void
255 1.1 cgd warn()
256 1.1 cgd {
257 1.1 cgd if (sendtorem)
258 1.1 cgd printf("\n%s: ", host);
259 1.1 cgd puts("Warning: no daemon present");
260 1.1 cgd current[0] = '\0';
261 1.1 cgd }
262 1.1 cgd
263 1.1 cgd /*
264 1.1 cgd * Print the header for the short listing format
265 1.1 cgd */
266 1.4 cgd void
267 1.1 cgd header()
268 1.1 cgd {
269 1.1 cgd printf(head0);
270 1.1 cgd col = strlen(head0)+1;
271 1.1 cgd blankfill(SIZCOL);
272 1.1 cgd printf(head1);
273 1.1 cgd }
274 1.1 cgd
275 1.4 cgd void
276 1.1 cgd inform(cf)
277 1.1 cgd char *cf;
278 1.1 cgd {
279 1.4 cgd register int j;
280 1.1 cgd FILE *cfp;
281 1.1 cgd
282 1.1 cgd /*
283 1.1 cgd * There's a chance the control file has gone away
284 1.1 cgd * in the meantime; if this is the case just keep going
285 1.1 cgd */
286 1.5 hpeyerl seteuid(euid);
287 1.1 cgd if ((cfp = fopen(cf, "r")) == NULL)
288 1.1 cgd return;
289 1.5 hpeyerl seteuid(uid);
290 1.1 cgd
291 1.1 cgd if (rank < 0)
292 1.1 cgd rank = 0;
293 1.1 cgd if (sendtorem || garbage || strcmp(cf, current))
294 1.1 cgd rank++;
295 1.1 cgd j = 0;
296 1.1 cgd while (getline(cfp)) {
297 1.1 cgd switch (line[0]) {
298 1.1 cgd case 'P': /* Was this file specified in the user's list? */
299 1.1 cgd if (!inlist(line+1, cf)) {
300 1.1 cgd fclose(cfp);
301 1.1 cgd return;
302 1.1 cgd }
303 1.1 cgd if (lflag) {
304 1.1 cgd printf("\n%s: ", line+1);
305 1.1 cgd col = strlen(line+1) + 2;
306 1.1 cgd prank(rank);
307 1.1 cgd blankfill(JOBCOL);
308 1.1 cgd printf(" [job %s]\n", cf+3);
309 1.1 cgd } else {
310 1.1 cgd col = 0;
311 1.1 cgd prank(rank);
312 1.1 cgd blankfill(OWNCOL);
313 1.1 cgd printf("%-10s %-3d ", line+1, atoi(cf+3));
314 1.1 cgd col += 16;
315 1.1 cgd first = 1;
316 1.1 cgd }
317 1.1 cgd continue;
318 1.1 cgd default: /* some format specifer and file name? */
319 1.1 cgd if (line[0] < 'a' || line[0] > 'z')
320 1.1 cgd continue;
321 1.1 cgd if (j == 0 || strcmp(file, line+1) != 0)
322 1.1 cgd (void) strcpy(file, line+1);
323 1.1 cgd j++;
324 1.1 cgd continue;
325 1.1 cgd case 'N':
326 1.1 cgd show(line+1, file, j);
327 1.1 cgd file[0] = '\0';
328 1.1 cgd j = 0;
329 1.1 cgd }
330 1.1 cgd }
331 1.1 cgd fclose(cfp);
332 1.1 cgd if (!lflag) {
333 1.1 cgd blankfill(SIZCOL);
334 1.1 cgd printf("%ld bytes\n", totsize);
335 1.1 cgd totsize = 0;
336 1.1 cgd }
337 1.1 cgd }
338 1.1 cgd
339 1.4 cgd int
340 1.1 cgd inlist(name, file)
341 1.1 cgd char *name, *file;
342 1.1 cgd {
343 1.1 cgd register int *r, n;
344 1.1 cgd register char **u, *cp;
345 1.1 cgd
346 1.1 cgd if (users == 0 && requests == 0)
347 1.1 cgd return(1);
348 1.1 cgd /*
349 1.1 cgd * Check to see if it's in the user list
350 1.1 cgd */
351 1.1 cgd for (u = user; u < &user[users]; u++)
352 1.1 cgd if (!strcmp(*u, name))
353 1.1 cgd return(1);
354 1.1 cgd /*
355 1.1 cgd * Check the request list
356 1.1 cgd */
357 1.1 cgd for (n = 0, cp = file+3; isdigit(*cp); )
358 1.1 cgd n = n * 10 + (*cp++ - '0');
359 1.1 cgd for (r = requ; r < &requ[requests]; r++)
360 1.1 cgd if (*r == n && !strcmp(cp, from))
361 1.1 cgd return(1);
362 1.1 cgd return(0);
363 1.1 cgd }
364 1.1 cgd
365 1.4 cgd void
366 1.1 cgd show(nfile, file, copies)
367 1.1 cgd register char *nfile, *file;
368 1.4 cgd int copies;
369 1.1 cgd {
370 1.1 cgd if (strcmp(nfile, " ") == 0)
371 1.1 cgd nfile = "(standard input)";
372 1.1 cgd if (lflag)
373 1.1 cgd ldump(nfile, file, copies);
374 1.1 cgd else
375 1.1 cgd dump(nfile, file, copies);
376 1.1 cgd }
377 1.1 cgd
378 1.1 cgd /*
379 1.1 cgd * Fill the line with blanks to the specified column
380 1.1 cgd */
381 1.4 cgd void
382 1.1 cgd blankfill(n)
383 1.1 cgd register int n;
384 1.1 cgd {
385 1.1 cgd while (col++ < n)
386 1.1 cgd putchar(' ');
387 1.1 cgd }
388 1.1 cgd
389 1.1 cgd /*
390 1.1 cgd * Give the abbreviated dump of the file names
391 1.1 cgd */
392 1.4 cgd void
393 1.1 cgd dump(nfile, file, copies)
394 1.1 cgd char *nfile, *file;
395 1.4 cgd int copies;
396 1.1 cgd {
397 1.1 cgd register short n, fill;
398 1.1 cgd struct stat lbuf;
399 1.1 cgd
400 1.1 cgd /*
401 1.1 cgd * Print as many files as will fit
402 1.1 cgd * (leaving room for the total size)
403 1.1 cgd */
404 1.1 cgd fill = first ? 0 : 2; /* fill space for ``, '' */
405 1.1 cgd if (((n = strlen(nfile)) + col + fill) >= SIZCOL-4) {
406 1.1 cgd if (col < SIZCOL) {
407 1.1 cgd printf(" ..."), col += 4;
408 1.1 cgd blankfill(SIZCOL);
409 1.1 cgd }
410 1.1 cgd } else {
411 1.1 cgd if (first)
412 1.1 cgd first = 0;
413 1.1 cgd else
414 1.1 cgd printf(", ");
415 1.1 cgd printf("%s", nfile);
416 1.1 cgd col += n+fill;
417 1.1 cgd }
418 1.5 hpeyerl seteuid(euid);
419 1.1 cgd if (*file && !stat(file, &lbuf))
420 1.1 cgd totsize += copies * lbuf.st_size;
421 1.5 hpeyerl seteuid(uid);
422 1.1 cgd }
423 1.1 cgd
424 1.1 cgd /*
425 1.1 cgd * Print the long info about the file
426 1.1 cgd */
427 1.4 cgd void
428 1.1 cgd ldump(nfile, file, copies)
429 1.1 cgd char *nfile, *file;
430 1.4 cgd int copies;
431 1.1 cgd {
432 1.1 cgd struct stat lbuf;
433 1.1 cgd
434 1.1 cgd putchar('\t');
435 1.1 cgd if (copies > 1)
436 1.1 cgd printf("%-2d copies of %-19s", copies, nfile);
437 1.1 cgd else
438 1.1 cgd printf("%-32s", nfile);
439 1.1 cgd if (*file && !stat(file, &lbuf))
440 1.3 cgd printf(" %qd bytes", lbuf.st_size);
441 1.1 cgd else
442 1.1 cgd printf(" ??? bytes");
443 1.1 cgd putchar('\n');
444 1.1 cgd }
445 1.1 cgd
446 1.1 cgd /*
447 1.1 cgd * Print the job's rank in the queue,
448 1.1 cgd * update col for screen management
449 1.1 cgd */
450 1.4 cgd void
451 1.1 cgd prank(n)
452 1.4 cgd int n;
453 1.1 cgd {
454 1.4 cgd char rline[100];
455 1.1 cgd static char *r[] = {
456 1.1 cgd "th", "st", "nd", "rd", "th", "th", "th", "th", "th", "th"
457 1.1 cgd };
458 1.1 cgd
459 1.1 cgd if (n == 0) {
460 1.1 cgd printf("active");
461 1.1 cgd col += 6;
462 1.1 cgd return;
463 1.1 cgd }
464 1.1 cgd if ((n/10)%10 == 1)
465 1.4 cgd (void)snprintf(rline, sizeof(rline), "%dth", n);
466 1.1 cgd else
467 1.4 cgd (void)snprintf(rline, sizeof(rline), "%d%s", n, r[n%10]);
468 1.4 cgd col += strlen(rline);
469 1.4 cgd printf("%s", rline);
470 1.1 cgd }
471