displayq.c revision 1.1.1.2 1 1.1 cgd /*
2 1.1.1.2 cgd * Copyright (c) 1983, 1993
3 1.1.1.2 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.1.1.2 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.1.1.2 cgd #include <sys/param.h>
39 1.1.1.2 cgd #include <sys/stat.h>
40 1.1 cgd
41 1.1.1.2 cgd #include <signal.h>
42 1.1.1.2 cgd #include <fcntl.h>
43 1.1.1.2 cgd #include <dirent.h>
44 1.1.1.2 cgd #include <unistd.h>
45 1.1.1.2 cgd #include <stdio.h>
46 1.1.1.2 cgd #include <stdlib.h>
47 1.1.1.2 cgd #include <string.h>
48 1.1.1.2 cgd #include <ctype.h>
49 1.1 cgd #include "lp.h"
50 1.1.1.2 cgd #include "lp.local.h"
51 1.1 cgd #include "pathnames.h"
52 1.1 cgd
53 1.1.1.2 cgd /*
54 1.1.1.2 cgd * Routines to display the state of the queue.
55 1.1.1.2 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.1.1.2 cgd extern char *user[]; /* users to process */
66 1.1.1.2 cgd extern int users; /* # of users in user array */
67 1.1 cgd
68 1.1.1.2 cgd static int col; /* column on screen */
69 1.1.1.2 cgd static char current[40]; /* current file being printed */
70 1.1.1.2 cgd static char file[132]; /* print file name */
71 1.1.1.2 cgd static int first; /* first file in ``files'' column? */
72 1.1.1.2 cgd static int garbage; /* # of garbage cf files */
73 1.1.1.2 cgd static int lflag; /* long output option */
74 1.1.1.2 cgd static int rank; /* order to be printed (-1=none, 0=active) */
75 1.1.1.2 cgd static long totsize; /* total print job size in bytes */
76 1.1 cgd
77 1.1.1.2 cgd static char *head0 = "Rank Owner Job Files";
78 1.1.1.2 cgd static char *head1 = "Total Size\n";
79 1.1 cgd
80 1.1 cgd /*
81 1.1 cgd * Display the current state of the queue. Format = 1 if long format.
82 1.1 cgd */
83 1.1.1.2 cgd void
84 1.1 cgd displayq(format)
85 1.1 cgd int format;
86 1.1 cgd {
87 1.1 cgd register struct queue *q;
88 1.1 cgd register int i, nitems, fd;
89 1.1 cgd register char *cp;
90 1.1 cgd struct queue **queue;
91 1.1 cgd struct stat statb;
92 1.1 cgd FILE *fp;
93 1.1 cgd
94 1.1 cgd lflag = format;
95 1.1 cgd totsize = 0;
96 1.1 cgd rank = -1;
97 1.1.1.2 cgd if ((i = cgetent(&bp, printcapdb, printer)) == -2)
98 1.1.1.2 cgd fatal("can't open printer description file");
99 1.1.1.2 cgd else if (i == -1)
100 1.1 cgd fatal("unknown printer");
101 1.1.1.2 cgd else if (i == -3)
102 1.1.1.2 cgd fatal("potential reference loop detected in printcap file");
103 1.1.1.2 cgd if (cgetstr(bp, "lp", &LP) < 0)
104 1.1 cgd LP = _PATH_DEFDEVLP;
105 1.1.1.2 cgd if (cgetstr(bp, "rp", &RP) < 0)
106 1.1 cgd RP = DEFLP;
107 1.1.1.2 cgd if (cgetstr(bp, "sd", &SD) < 0)
108 1.1 cgd SD = _PATH_DEFSPOOL;
109 1.1.1.2 cgd if (cgetstr(bp,"lo", &LO) < 0)
110 1.1 cgd LO = DEFLOCK;
111 1.1.1.2 cgd if (cgetstr(bp, "st", &ST) < 0)
112 1.1 cgd ST = DEFSTAT;
113 1.1.1.2 cgd cgetstr(bp, "rm", &RM);
114 1.1 cgd if (cp = checkremote())
115 1.1 cgd printf("Warning: %s\n", cp);
116 1.1 cgd
117 1.1 cgd /*
118 1.1 cgd * Print out local queue
119 1.1 cgd * Find all the control files in the spooling directory
120 1.1 cgd */
121 1.1 cgd if (chdir(SD) < 0)
122 1.1 cgd fatal("cannot chdir to spooling directory");
123 1.1 cgd if ((nitems = getq(&queue)) < 0)
124 1.1 cgd fatal("cannot examine spooling area\n");
125 1.1 cgd if (stat(LO, &statb) >= 0) {
126 1.1 cgd if (statb.st_mode & 0100) {
127 1.1 cgd if (sendtorem)
128 1.1 cgd printf("%s: ", host);
129 1.1 cgd printf("Warning: %s is down: ", printer);
130 1.1 cgd fd = open(ST, O_RDONLY);
131 1.1 cgd if (fd >= 0) {
132 1.1 cgd (void) flock(fd, LOCK_SH);
133 1.1 cgd while ((i = read(fd, line, sizeof(line))) > 0)
134 1.1 cgd (void) fwrite(line, 1, i, stdout);
135 1.1 cgd (void) close(fd); /* unlocks as well */
136 1.1 cgd } else
137 1.1 cgd putchar('\n');
138 1.1 cgd }
139 1.1 cgd if (statb.st_mode & 010) {
140 1.1 cgd if (sendtorem)
141 1.1 cgd printf("%s: ", host);
142 1.1 cgd printf("Warning: %s queue is turned off\n", printer);
143 1.1 cgd }
144 1.1 cgd }
145 1.1 cgd
146 1.1 cgd if (nitems) {
147 1.1 cgd fp = fopen(LO, "r");
148 1.1 cgd if (fp == NULL)
149 1.1 cgd warn();
150 1.1 cgd else {
151 1.1 cgd /* get daemon pid */
152 1.1 cgd cp = current;
153 1.1 cgd while ((*cp = getc(fp)) != EOF && *cp != '\n')
154 1.1 cgd cp++;
155 1.1 cgd *cp = '\0';
156 1.1 cgd i = atoi(current);
157 1.1 cgd if (i <= 0 || kill(i, 0) < 0)
158 1.1 cgd warn();
159 1.1 cgd else {
160 1.1 cgd /* read current file name */
161 1.1 cgd cp = current;
162 1.1 cgd while ((*cp = getc(fp)) != EOF && *cp != '\n')
163 1.1 cgd cp++;
164 1.1 cgd *cp = '\0';
165 1.1 cgd /*
166 1.1 cgd * Print the status file.
167 1.1 cgd */
168 1.1 cgd if (sendtorem)
169 1.1 cgd printf("%s: ", host);
170 1.1 cgd fd = open(ST, O_RDONLY);
171 1.1 cgd if (fd >= 0) {
172 1.1 cgd (void) flock(fd, LOCK_SH);
173 1.1 cgd while ((i = read(fd, line, sizeof(line))) > 0)
174 1.1 cgd (void) fwrite(line, 1, i, stdout);
175 1.1 cgd (void) close(fd); /* unlocks as well */
176 1.1 cgd } else
177 1.1 cgd putchar('\n');
178 1.1 cgd }
179 1.1 cgd (void) fclose(fp);
180 1.1 cgd }
181 1.1 cgd /*
182 1.1 cgd * Now, examine the control files and print out the jobs to
183 1.1 cgd * be done for each user.
184 1.1 cgd */
185 1.1 cgd if (!lflag)
186 1.1 cgd header();
187 1.1 cgd for (i = 0; i < nitems; i++) {
188 1.1 cgd q = queue[i];
189 1.1 cgd inform(q->q_name);
190 1.1 cgd free(q);
191 1.1 cgd }
192 1.1 cgd free(queue);
193 1.1 cgd }
194 1.1 cgd if (!sendtorem) {
195 1.1 cgd if (nitems == 0)
196 1.1 cgd puts("no entries");
197 1.1 cgd return;
198 1.1 cgd }
199 1.1 cgd
200 1.1 cgd /*
201 1.1 cgd * Print foreign queue
202 1.1 cgd * Note that a file in transit may show up in either queue.
203 1.1 cgd */
204 1.1 cgd if (nitems)
205 1.1 cgd putchar('\n');
206 1.1 cgd (void) sprintf(line, "%c%s", format + '\3', RP);
207 1.1 cgd cp = line;
208 1.1 cgd for (i = 0; i < requests; i++) {
209 1.1 cgd cp += strlen(cp);
210 1.1 cgd (void) sprintf(cp, " %d", requ[i]);
211 1.1 cgd }
212 1.1 cgd for (i = 0; i < users; i++) {
213 1.1 cgd cp += strlen(cp);
214 1.1 cgd *cp++ = ' ';
215 1.1 cgd (void) strcpy(cp, user[i]);
216 1.1 cgd }
217 1.1 cgd strcat(line, "\n");
218 1.1 cgd fd = getport(RM);
219 1.1 cgd if (fd < 0) {
220 1.1 cgd if (from != host)
221 1.1 cgd printf("%s: ", host);
222 1.1 cgd printf("connection to %s is down\n", RM);
223 1.1 cgd }
224 1.1 cgd else {
225 1.1 cgd i = strlen(line);
226 1.1 cgd if (write(fd, line, i) != i)
227 1.1 cgd fatal("Lost connection");
228 1.1 cgd while ((i = read(fd, line, sizeof(line))) > 0)
229 1.1 cgd (void) fwrite(line, 1, i, stdout);
230 1.1 cgd (void) close(fd);
231 1.1 cgd }
232 1.1 cgd }
233 1.1 cgd
234 1.1 cgd /*
235 1.1 cgd * Print a warning message if there is no daemon present.
236 1.1 cgd */
237 1.1.1.2 cgd void
238 1.1 cgd warn()
239 1.1 cgd {
240 1.1 cgd if (sendtorem)
241 1.1 cgd printf("\n%s: ", host);
242 1.1 cgd puts("Warning: no daemon present");
243 1.1 cgd current[0] = '\0';
244 1.1 cgd }
245 1.1 cgd
246 1.1 cgd /*
247 1.1 cgd * Print the header for the short listing format
248 1.1 cgd */
249 1.1.1.2 cgd void
250 1.1 cgd header()
251 1.1 cgd {
252 1.1 cgd printf(head0);
253 1.1 cgd col = strlen(head0)+1;
254 1.1 cgd blankfill(SIZCOL);
255 1.1 cgd printf(head1);
256 1.1 cgd }
257 1.1 cgd
258 1.1.1.2 cgd void
259 1.1 cgd inform(cf)
260 1.1 cgd char *cf;
261 1.1 cgd {
262 1.1.1.2 cgd register int j;
263 1.1 cgd FILE *cfp;
264 1.1 cgd
265 1.1 cgd /*
266 1.1 cgd * There's a chance the control file has gone away
267 1.1 cgd * in the meantime; if this is the case just keep going
268 1.1 cgd */
269 1.1 cgd if ((cfp = fopen(cf, "r")) == NULL)
270 1.1 cgd return;
271 1.1 cgd
272 1.1 cgd if (rank < 0)
273 1.1 cgd rank = 0;
274 1.1 cgd if (sendtorem || garbage || strcmp(cf, current))
275 1.1 cgd rank++;
276 1.1 cgd j = 0;
277 1.1 cgd while (getline(cfp)) {
278 1.1 cgd switch (line[0]) {
279 1.1 cgd case 'P': /* Was this file specified in the user's list? */
280 1.1 cgd if (!inlist(line+1, cf)) {
281 1.1 cgd fclose(cfp);
282 1.1 cgd return;
283 1.1 cgd }
284 1.1 cgd if (lflag) {
285 1.1 cgd printf("\n%s: ", line+1);
286 1.1 cgd col = strlen(line+1) + 2;
287 1.1 cgd prank(rank);
288 1.1 cgd blankfill(JOBCOL);
289 1.1 cgd printf(" [job %s]\n", cf+3);
290 1.1 cgd } else {
291 1.1 cgd col = 0;
292 1.1 cgd prank(rank);
293 1.1 cgd blankfill(OWNCOL);
294 1.1 cgd printf("%-10s %-3d ", line+1, atoi(cf+3));
295 1.1 cgd col += 16;
296 1.1 cgd first = 1;
297 1.1 cgd }
298 1.1 cgd continue;
299 1.1 cgd default: /* some format specifer and file name? */
300 1.1 cgd if (line[0] < 'a' || line[0] > 'z')
301 1.1 cgd continue;
302 1.1 cgd if (j == 0 || strcmp(file, line+1) != 0)
303 1.1 cgd (void) strcpy(file, line+1);
304 1.1 cgd j++;
305 1.1 cgd continue;
306 1.1 cgd case 'N':
307 1.1 cgd show(line+1, file, j);
308 1.1 cgd file[0] = '\0';
309 1.1 cgd j = 0;
310 1.1 cgd }
311 1.1 cgd }
312 1.1 cgd fclose(cfp);
313 1.1 cgd if (!lflag) {
314 1.1 cgd blankfill(SIZCOL);
315 1.1 cgd printf("%ld bytes\n", totsize);
316 1.1 cgd totsize = 0;
317 1.1 cgd }
318 1.1 cgd }
319 1.1 cgd
320 1.1.1.2 cgd int
321 1.1 cgd inlist(name, file)
322 1.1 cgd char *name, *file;
323 1.1 cgd {
324 1.1 cgd register int *r, n;
325 1.1 cgd register char **u, *cp;
326 1.1 cgd
327 1.1 cgd if (users == 0 && requests == 0)
328 1.1 cgd return(1);
329 1.1 cgd /*
330 1.1 cgd * Check to see if it's in the user list
331 1.1 cgd */
332 1.1 cgd for (u = user; u < &user[users]; u++)
333 1.1 cgd if (!strcmp(*u, name))
334 1.1 cgd return(1);
335 1.1 cgd /*
336 1.1 cgd * Check the request list
337 1.1 cgd */
338 1.1 cgd for (n = 0, cp = file+3; isdigit(*cp); )
339 1.1 cgd n = n * 10 + (*cp++ - '0');
340 1.1 cgd for (r = requ; r < &requ[requests]; r++)
341 1.1 cgd if (*r == n && !strcmp(cp, from))
342 1.1 cgd return(1);
343 1.1 cgd return(0);
344 1.1 cgd }
345 1.1 cgd
346 1.1.1.2 cgd void
347 1.1 cgd show(nfile, file, copies)
348 1.1 cgd register char *nfile, *file;
349 1.1.1.2 cgd int copies;
350 1.1 cgd {
351 1.1 cgd if (strcmp(nfile, " ") == 0)
352 1.1 cgd nfile = "(standard input)";
353 1.1 cgd if (lflag)
354 1.1 cgd ldump(nfile, file, copies);
355 1.1 cgd else
356 1.1 cgd dump(nfile, file, copies);
357 1.1 cgd }
358 1.1 cgd
359 1.1 cgd /*
360 1.1 cgd * Fill the line with blanks to the specified column
361 1.1 cgd */
362 1.1.1.2 cgd void
363 1.1 cgd blankfill(n)
364 1.1 cgd register int n;
365 1.1 cgd {
366 1.1 cgd while (col++ < n)
367 1.1 cgd putchar(' ');
368 1.1 cgd }
369 1.1 cgd
370 1.1 cgd /*
371 1.1 cgd * Give the abbreviated dump of the file names
372 1.1 cgd */
373 1.1.1.2 cgd void
374 1.1 cgd dump(nfile, file, copies)
375 1.1 cgd char *nfile, *file;
376 1.1.1.2 cgd int copies;
377 1.1 cgd {
378 1.1 cgd register short n, fill;
379 1.1 cgd struct stat lbuf;
380 1.1 cgd
381 1.1 cgd /*
382 1.1 cgd * Print as many files as will fit
383 1.1 cgd * (leaving room for the total size)
384 1.1 cgd */
385 1.1 cgd fill = first ? 0 : 2; /* fill space for ``, '' */
386 1.1 cgd if (((n = strlen(nfile)) + col + fill) >= SIZCOL-4) {
387 1.1 cgd if (col < SIZCOL) {
388 1.1 cgd printf(" ..."), col += 4;
389 1.1 cgd blankfill(SIZCOL);
390 1.1 cgd }
391 1.1 cgd } else {
392 1.1 cgd if (first)
393 1.1 cgd first = 0;
394 1.1 cgd else
395 1.1 cgd printf(", ");
396 1.1 cgd printf("%s", nfile);
397 1.1 cgd col += n+fill;
398 1.1 cgd }
399 1.1 cgd if (*file && !stat(file, &lbuf))
400 1.1 cgd totsize += copies * lbuf.st_size;
401 1.1 cgd }
402 1.1 cgd
403 1.1 cgd /*
404 1.1 cgd * Print the long info about the file
405 1.1 cgd */
406 1.1.1.2 cgd void
407 1.1 cgd ldump(nfile, file, copies)
408 1.1 cgd char *nfile, *file;
409 1.1.1.2 cgd int copies;
410 1.1 cgd {
411 1.1 cgd struct stat lbuf;
412 1.1 cgd
413 1.1 cgd putchar('\t');
414 1.1 cgd if (copies > 1)
415 1.1 cgd printf("%-2d copies of %-19s", copies, nfile);
416 1.1 cgd else
417 1.1 cgd printf("%-32s", nfile);
418 1.1 cgd if (*file && !stat(file, &lbuf))
419 1.1.1.2 cgd printf(" %qd bytes", lbuf.st_size);
420 1.1 cgd else
421 1.1 cgd printf(" ??? bytes");
422 1.1 cgd putchar('\n');
423 1.1 cgd }
424 1.1 cgd
425 1.1 cgd /*
426 1.1 cgd * Print the job's rank in the queue,
427 1.1 cgd * update col for screen management
428 1.1 cgd */
429 1.1.1.2 cgd void
430 1.1 cgd prank(n)
431 1.1.1.2 cgd int n;
432 1.1 cgd {
433 1.1.1.2 cgd char rline[100];
434 1.1 cgd static char *r[] = {
435 1.1 cgd "th", "st", "nd", "rd", "th", "th", "th", "th", "th", "th"
436 1.1 cgd };
437 1.1 cgd
438 1.1 cgd if (n == 0) {
439 1.1 cgd printf("active");
440 1.1 cgd col += 6;
441 1.1 cgd return;
442 1.1 cgd }
443 1.1 cgd if ((n/10)%10 == 1)
444 1.1.1.2 cgd (void)snprintf(rline, sizeof(rline), "%dth", n);
445 1.1 cgd else
446 1.1.1.2 cgd (void)snprintf(rline, sizeof(rline), "%d%s", n, r[n%10]);
447 1.1.1.2 cgd col += strlen(rline);
448 1.1.1.2 cgd printf("%s", rline);
449 1.1 cgd }
450