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