Home | History | Annotate | Line # | Download | only in common_source
displayq.c revision 1.25
      1  1.25   itojun /*	$NetBSD: displayq.c,v 1.25 2003/05/17 20:46:42 itojun Exp $	*/
      2   1.7      jtc 
      3   1.1      cgd /*
      4   1.4      cgd  * Copyright (c) 1983, 1993
      5   1.4      cgd  *	The Regents of the University of California.  All rights reserved.
      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.12      mrg #include <sys/cdefs.h>
     37   1.1      cgd #ifndef lint
     38  1.10    mikel #if 0
     39  1.11      mrg static char sccsid[] = "@(#)displayq.c	8.4 (Berkeley) 4/28/95";
     40  1.10    mikel #else
     41  1.25   itojun __RCSID("$NetBSD: displayq.c,v 1.25 2003/05/17 20:46:42 itojun Exp $");
     42  1.10    mikel #endif
     43   1.1      cgd #endif /* not lint */
     44   1.1      cgd 
     45   1.4      cgd #include <sys/param.h>
     46   1.4      cgd #include <sys/stat.h>
     47  1.11      mrg #include <sys/file.h>
     48   1.1      cgd 
     49   1.4      cgd #include <signal.h>
     50   1.4      cgd #include <fcntl.h>
     51   1.4      cgd #include <dirent.h>
     52   1.4      cgd #include <unistd.h>
     53   1.4      cgd #include <stdio.h>
     54   1.4      cgd #include <stdlib.h>
     55   1.4      cgd #include <string.h>
     56   1.4      cgd #include <ctype.h>
     57   1.1      cgd #include "lp.h"
     58   1.4      cgd #include "lp.local.h"
     59   1.1      cgd #include "pathnames.h"
     60   1.1      cgd 
     61   1.4      cgd /*
     62   1.4      cgd  * Routines to display the state of the queue.
     63   1.4      cgd  */
     64   1.1      cgd #define JOBCOL	40		/* column for job # in -l format */
     65   1.1      cgd #define OWNCOL	7		/* start of Owner column in normal */
     66   1.1      cgd #define SIZCOL	62		/* start of Size column in normal */
     67   1.1      cgd 
     68   1.1      cgd /*
     69   1.1      cgd  * Stuff for handling job specifications
     70   1.1      cgd  */
     71   1.1      cgd extern int	requ[];		/* job number of spool entries */
     72   1.1      cgd extern int	requests;	/* # of spool requests */
     73   1.4      cgd extern char    *user[];	        /* users to process */
     74   1.4      cgd extern int	users;		/* # of users in user array */
     75   1.1      cgd 
     76   1.5  hpeyerl extern uid_t	uid, euid;
     77   1.5  hpeyerl 
     78   1.4      cgd static int	col;		/* column on screen */
     79  1.21   itojun static char	current[MAXPATHLEN]; /* current file being printed */
     80  1.21   itojun static char	file[MAXPATHLEN]; /* print file name */
     81   1.4      cgd static int	first;		/* first file in ``files'' column? */
     82   1.4      cgd static int	garbage;	/* # of garbage cf files */
     83   1.4      cgd static int	lflag;		/* long output option */
     84   1.4      cgd static int	rank;		/* order to be printed (-1=none, 0=active) */
     85   1.4      cgd static long	totsize;	/* total print job size in bytes */
     86   1.1      cgd 
     87  1.18       is static const char head0[] = "Rank   Owner      Job  Files";
     88  1.18       is static const char head1[] = "Total Size\n";
     89   1.1      cgd 
     90  1.24      wiz static	void	alarmer(int);
     91  1.17      mrg 
     92  1.17      mrg int wait_time = 300;	/* time out after 5 minutes by default */
     93  1.17      mrg 
     94   1.1      cgd /*
     95   1.1      cgd  * Display the current state of the queue. Format = 1 if long format.
     96   1.1      cgd  */
     97   1.4      cgd void
     98  1.24      wiz displayq(int format)
     99   1.1      cgd {
    100  1.12      mrg 	struct queue *q;
    101  1.12      mrg 	int i, nitems, fd, ret;
    102  1.21   itojun 	char *cp, *ecp;
    103   1.1      cgd 	struct queue **queue;
    104   1.1      cgd 	struct stat statb;
    105   1.1      cgd 	FILE *fp;
    106   1.1      cgd 
    107   1.1      cgd 	lflag = format;
    108   1.1      cgd 	totsize = 0;
    109   1.1      cgd 	rank = -1;
    110   1.4      cgd 	if ((i = cgetent(&bp, printcapdb, printer)) == -2)
    111   1.4      cgd 		fatal("can't open printer description file");
    112   1.4      cgd 	else if (i == -1)
    113   1.1      cgd 		fatal("unknown printer");
    114   1.4      cgd 	else if (i == -3)
    115   1.4      cgd 		fatal("potential reference loop detected in printcap file");
    116  1.20      mrg 	if (cgetstr(bp, DEFLP, &LP) < 0)
    117   1.1      cgd 		LP = _PATH_DEFDEVLP;
    118   1.4      cgd 	if (cgetstr(bp, "rp", &RP) < 0)
    119   1.1      cgd 		RP = DEFLP;
    120   1.4      cgd 	if (cgetstr(bp, "sd", &SD) < 0)
    121   1.1      cgd 		SD = _PATH_DEFSPOOL;
    122   1.4      cgd 	if (cgetstr(bp,"lo", &LO) < 0)
    123   1.1      cgd 		LO = DEFLOCK;
    124   1.4      cgd 	if (cgetstr(bp, "st", &ST) < 0)
    125   1.1      cgd 		ST = DEFSTAT;
    126   1.4      cgd 	cgetstr(bp, "rm", &RM);
    127  1.10    mikel 	if ((cp = checkremote()) != NULL)
    128   1.1      cgd 		printf("Warning: %s\n", cp);
    129   1.1      cgd 
    130   1.1      cgd 	/*
    131   1.1      cgd 	 * Print out local queue
    132   1.1      cgd 	 * Find all the control files in the spooling directory
    133   1.1      cgd 	 */
    134   1.5  hpeyerl 	seteuid(euid);
    135   1.1      cgd 	if (chdir(SD) < 0)
    136   1.1      cgd 		fatal("cannot chdir to spooling directory");
    137   1.5  hpeyerl 	seteuid(uid);
    138   1.1      cgd 	if ((nitems = getq(&queue)) < 0)
    139   1.1      cgd 		fatal("cannot examine spooling area\n");
    140   1.5  hpeyerl 	seteuid(euid);
    141   1.5  hpeyerl 	ret = stat(LO, &statb);
    142   1.5  hpeyerl 	seteuid(uid);
    143   1.5  hpeyerl 	if (ret >= 0) {
    144  1.23   itojun 		if (statb.st_mode & S_IXUSR) {
    145  1.11      mrg 			if (remote)
    146   1.1      cgd 				printf("%s: ", host);
    147   1.1      cgd 			printf("Warning: %s is down: ", printer);
    148   1.5  hpeyerl 			seteuid(euid);
    149   1.1      cgd 			fd = open(ST, O_RDONLY);
    150   1.5  hpeyerl 			seteuid(uid);
    151   1.1      cgd 			if (fd >= 0) {
    152   1.8      mrg 				(void)flock(fd, LOCK_SH);
    153   1.1      cgd 				while ((i = read(fd, line, sizeof(line))) > 0)
    154  1.16      mrg 					(void)fwrite(line, 1, (size_t)i, stdout);
    155   1.8      mrg 				(void)close(fd);	/* unlocks as well */
    156   1.1      cgd 			} else
    157   1.1      cgd 				putchar('\n');
    158   1.1      cgd 		}
    159  1.23   itojun 		if (statb.st_mode & S_IXGRP) {
    160  1.11      mrg 			if (remote)
    161   1.1      cgd 				printf("%s: ", host);
    162   1.1      cgd 			printf("Warning: %s queue is turned off\n", printer);
    163   1.1      cgd 		}
    164   1.1      cgd 	}
    165   1.1      cgd 
    166   1.1      cgd 	if (nitems) {
    167   1.5  hpeyerl 		seteuid(euid);
    168   1.1      cgd 		fp = fopen(LO, "r");
    169   1.5  hpeyerl 		seteuid(uid);
    170   1.1      cgd 		if (fp == NULL)
    171  1.12      mrg 			nodaemon();
    172   1.1      cgd 		else {
    173   1.1      cgd 			/* get daemon pid */
    174   1.1      cgd 			cp = current;
    175  1.21   itojun 			ecp = cp + sizeof(current) - 1;
    176  1.21   itojun 			while ((i = getc(fp)) != EOF && i != '\n') {
    177  1.21   itojun 				if (cp < ecp)
    178  1.21   itojun 					*cp++ = i;
    179  1.21   itojun 			}
    180   1.1      cgd 			*cp = '\0';
    181   1.1      cgd 			i = atoi(current);
    182   1.5  hpeyerl 			if (i <= 0) {
    183   1.6       pk 				ret = -1;
    184   1.6       pk 			} else {
    185   1.5  hpeyerl 				seteuid(euid);
    186   1.5  hpeyerl 				ret = kill(i, 0);
    187   1.5  hpeyerl 				seteuid(uid);
    188   1.5  hpeyerl 			}
    189   1.5  hpeyerl 			if (ret < 0) {
    190  1.12      mrg 				nodaemon();
    191   1.6       pk 			} else {
    192   1.1      cgd 				/* read current file name */
    193   1.1      cgd 				cp = current;
    194  1.21   itojun 		    		ecp = cp + sizeof(current) - 1;
    195  1.21   itojun 				while ((i = getc(fp)) != EOF && i != '\n') {
    196  1.21   itojun 					if (cp < ecp)
    197  1.21   itojun 						*cp++ = i;
    198  1.21   itojun 				}
    199   1.1      cgd 				*cp = '\0';
    200   1.1      cgd 				/*
    201   1.1      cgd 				 * Print the status file.
    202   1.1      cgd 				 */
    203  1.11      mrg 				if (remote)
    204   1.1      cgd 					printf("%s: ", host);
    205   1.5  hpeyerl 				seteuid(euid);
    206   1.1      cgd 				fd = open(ST, O_RDONLY);
    207   1.5  hpeyerl 				seteuid(uid);
    208   1.1      cgd 				if (fd >= 0) {
    209   1.8      mrg 					(void)flock(fd, LOCK_SH);
    210   1.1      cgd 					while ((i = read(fd, line, sizeof(line))) > 0)
    211  1.16      mrg 						(void)fwrite(line, 1, (size_t)i, stdout);
    212   1.8      mrg 					(void)close(fd);	/* unlocks as well */
    213   1.1      cgd 				} else
    214   1.1      cgd 					putchar('\n');
    215   1.1      cgd 			}
    216   1.8      mrg 			(void)fclose(fp);
    217   1.1      cgd 		}
    218   1.1      cgd 		/*
    219   1.1      cgd 		 * Now, examine the control files and print out the jobs to
    220   1.1      cgd 		 * be done for each user.
    221   1.1      cgd 		 */
    222   1.1      cgd 		if (!lflag)
    223   1.1      cgd 			header();
    224   1.1      cgd 		for (i = 0; i < nitems; i++) {
    225   1.1      cgd 			q = queue[i];
    226   1.1      cgd 			inform(q->q_name);
    227   1.1      cgd 			free(q);
    228   1.1      cgd 		}
    229   1.1      cgd 		free(queue);
    230   1.1      cgd 	}
    231  1.11      mrg 	if (!remote) {
    232   1.1      cgd 		if (nitems == 0)
    233   1.1      cgd 			puts("no entries");
    234   1.1      cgd 		return;
    235   1.1      cgd 	}
    236   1.1      cgd 
    237   1.1      cgd 	/*
    238   1.1      cgd 	 * Print foreign queue
    239   1.1      cgd 	 * Note that a file in transit may show up in either queue.
    240   1.1      cgd 	 */
    241   1.1      cgd 	if (nitems)
    242   1.1      cgd 		putchar('\n');
    243   1.8      mrg 	(void)snprintf(line, sizeof(line), "%c%s", format + '\3', RP);
    244   1.1      cgd 	cp = line;
    245  1.25   itojun 	ecp = line + sizeof(line);
    246  1.25   itojun 	for (i = 0; i < requests && cp - line + 11 < sizeof(line) - 2; i++) {
    247   1.1      cgd 		cp += strlen(cp);
    248  1.25   itojun 		(void)snprintf(cp, ecp - cp, " %d", requ[i]);
    249   1.1      cgd 	}
    250  1.12      mrg 	for (i = 0; i < users && cp - line + 1 + strlen(user[i]) <
    251  1.25   itojun 	    sizeof(line) - 2; i++) {
    252   1.1      cgd 		cp += strlen(cp);
    253  1.25   itojun 		if (cp - line > sizeof(line) - 2)
    254   1.8      mrg 			break;
    255   1.1      cgd 		*cp++ = ' ';
    256  1.25   itojun 		/* truncation may happen */
    257  1.25   itojun 		(void)strlcpy(cp, user[i], ecp - cp);
    258   1.1      cgd 	}
    259  1.25   itojun 	(void)strlcat(line, "\n", sizeof(line));
    260  1.11      mrg 	fd = getport(RM, 0);
    261   1.1      cgd 	if (fd < 0) {
    262   1.1      cgd 		if (from != host)
    263   1.1      cgd 			printf("%s: ", host);
    264   1.8      mrg 		(void)printf("connection to %s is down\n", RM);
    265   1.1      cgd 	}
    266   1.1      cgd 	else {
    267  1.17      mrg 		struct sigaction osa, nsa;
    268  1.17      mrg 
    269   1.1      cgd 		i = strlen(line);
    270  1.16      mrg 		if (write(fd, line, (size_t)i) != i)
    271   1.1      cgd 			fatal("Lost connection");
    272  1.17      mrg 		nsa.sa_handler = alarmer;
    273  1.17      mrg 		sigemptyset(&nsa.sa_mask);
    274  1.17      mrg 		sigaddset(&nsa.sa_mask, SIGALRM);
    275  1.17      mrg 		nsa.sa_flags = 0;
    276  1.17      mrg 		(void)sigaction(SIGALRM, &nsa, &osa);
    277  1.17      mrg 		alarm(wait_time);
    278  1.17      mrg 		while ((i = read(fd, line, sizeof(line))) > 0) {
    279  1.16      mrg 			(void)fwrite(line, 1, (size_t)i, stdout);
    280  1.17      mrg 			alarm(wait_time);
    281  1.17      mrg 		}
    282  1.17      mrg 		alarm(0);
    283  1.17      mrg 		(void)sigaction(SIGALRM, &osa, NULL);
    284   1.8      mrg 		(void)close(fd);
    285   1.1      cgd 	}
    286  1.17      mrg }
    287  1.17      mrg 
    288  1.17      mrg static void
    289  1.24      wiz alarmer(int s)
    290  1.17      mrg {
    291  1.17      mrg 	/* nothing */
    292   1.1      cgd }
    293   1.1      cgd 
    294   1.1      cgd /*
    295   1.1      cgd  * Print a warning message if there is no daemon present.
    296   1.1      cgd  */
    297   1.4      cgd void
    298  1.24      wiz nodaemon(void)
    299   1.1      cgd {
    300  1.11      mrg 	if (remote)
    301   1.1      cgd 		printf("\n%s: ", host);
    302   1.1      cgd 	puts("Warning: no daemon present");
    303   1.1      cgd 	current[0] = '\0';
    304   1.1      cgd }
    305   1.1      cgd 
    306   1.1      cgd /*
    307   1.1      cgd  * Print the header for the short listing format
    308   1.1      cgd  */
    309   1.4      cgd void
    310  1.24      wiz header(void)
    311   1.1      cgd {
    312   1.1      cgd 	printf(head0);
    313   1.1      cgd 	col = strlen(head0)+1;
    314   1.1      cgd 	blankfill(SIZCOL);
    315   1.1      cgd 	printf(head1);
    316   1.1      cgd }
    317   1.1      cgd 
    318   1.4      cgd void
    319  1.24      wiz inform(char *cf)
    320   1.1      cgd {
    321  1.12      mrg 	int j;
    322   1.1      cgd 	FILE *cfp;
    323   1.1      cgd 
    324   1.1      cgd 	/*
    325   1.1      cgd 	 * There's a chance the control file has gone away
    326   1.1      cgd 	 * in the meantime; if this is the case just keep going
    327   1.1      cgd 	 */
    328   1.5  hpeyerl 	seteuid(euid);
    329   1.1      cgd 	if ((cfp = fopen(cf, "r")) == NULL)
    330   1.1      cgd 		return;
    331   1.5  hpeyerl 	seteuid(uid);
    332   1.1      cgd 
    333   1.1      cgd 	if (rank < 0)
    334   1.1      cgd 		rank = 0;
    335  1.11      mrg 	if (remote || garbage || strcmp(cf, current))
    336   1.1      cgd 		rank++;
    337   1.1      cgd 	j = 0;
    338   1.1      cgd 	while (getline(cfp)) {
    339   1.1      cgd 		switch (line[0]) {
    340   1.1      cgd 		case 'P': /* Was this file specified in the user's list? */
    341   1.1      cgd 			if (!inlist(line+1, cf)) {
    342   1.1      cgd 				fclose(cfp);
    343   1.1      cgd 				return;
    344   1.1      cgd 			}
    345   1.1      cgd 			if (lflag) {
    346   1.1      cgd 				printf("\n%s: ", line+1);
    347   1.1      cgd 				col = strlen(line+1) + 2;
    348   1.1      cgd 				prank(rank);
    349   1.1      cgd 				blankfill(JOBCOL);
    350   1.1      cgd 				printf(" [job %s]\n", cf+3);
    351   1.1      cgd 			} else {
    352   1.1      cgd 				col = 0;
    353   1.1      cgd 				prank(rank);
    354   1.1      cgd 				blankfill(OWNCOL);
    355   1.1      cgd 				printf("%-10s %-3d  ", line+1, atoi(cf+3));
    356   1.1      cgd 				col += 16;
    357   1.1      cgd 				first = 1;
    358   1.1      cgd 			}
    359   1.1      cgd 			continue;
    360   1.1      cgd 		default: /* some format specifer and file name? */
    361   1.1      cgd 			if (line[0] < 'a' || line[0] > 'z')
    362   1.1      cgd 				continue;
    363  1.12      mrg 			if (j == 0 || strcmp(file, line+1) != 0) {
    364  1.22   itojun 				(void)strlcpy(file, line+1, sizeof(file));
    365  1.12      mrg 			}
    366   1.1      cgd 			j++;
    367   1.1      cgd 			continue;
    368   1.1      cgd 		case 'N':
    369   1.1      cgd 			show(line+1, file, j);
    370   1.1      cgd 			file[0] = '\0';
    371   1.1      cgd 			j = 0;
    372   1.1      cgd 		}
    373   1.1      cgd 	}
    374   1.1      cgd 	fclose(cfp);
    375   1.1      cgd 	if (!lflag) {
    376   1.1      cgd 		blankfill(SIZCOL);
    377   1.1      cgd 		printf("%ld bytes\n", totsize);
    378   1.1      cgd 		totsize = 0;
    379   1.1      cgd 	}
    380   1.1      cgd }
    381   1.1      cgd 
    382   1.4      cgd int
    383  1.24      wiz inlist(char *name, char *file)
    384   1.1      cgd {
    385  1.12      mrg 	int *r, n;
    386  1.12      mrg 	char **u, *cp;
    387   1.1      cgd 
    388   1.1      cgd 	if (users == 0 && requests == 0)
    389   1.1      cgd 		return(1);
    390   1.1      cgd 	/*
    391   1.1      cgd 	 * Check to see if it's in the user list
    392   1.1      cgd 	 */
    393   1.1      cgd 	for (u = user; u < &user[users]; u++)
    394   1.1      cgd 		if (!strcmp(*u, name))
    395   1.1      cgd 			return(1);
    396   1.1      cgd 	/*
    397   1.1      cgd 	 * Check the request list
    398   1.1      cgd 	 */
    399   1.1      cgd 	for (n = 0, cp = file+3; isdigit(*cp); )
    400   1.1      cgd 		n = n * 10 + (*cp++ - '0');
    401   1.1      cgd 	for (r = requ; r < &requ[requests]; r++)
    402   1.1      cgd 		if (*r == n && !strcmp(cp, from))
    403   1.1      cgd 			return(1);
    404   1.1      cgd 	return(0);
    405   1.1      cgd }
    406   1.1      cgd 
    407   1.4      cgd void
    408  1.24      wiz show(char *nfile, char *file, int copies)
    409   1.1      cgd {
    410   1.1      cgd 	if (strcmp(nfile, " ") == 0)
    411   1.1      cgd 		nfile = "(standard input)";
    412   1.1      cgd 	if (lflag)
    413   1.1      cgd 		ldump(nfile, file, copies);
    414   1.1      cgd 	else
    415   1.1      cgd 		dump(nfile, file, copies);
    416   1.1      cgd }
    417   1.1      cgd 
    418   1.1      cgd /*
    419   1.1      cgd  * Fill the line with blanks to the specified column
    420   1.1      cgd  */
    421   1.4      cgd void
    422  1.24      wiz blankfill(int n)
    423   1.1      cgd {
    424   1.1      cgd 	while (col++ < n)
    425   1.1      cgd 		putchar(' ');
    426   1.1      cgd }
    427   1.1      cgd 
    428   1.1      cgd /*
    429   1.1      cgd  * Give the abbreviated dump of the file names
    430   1.1      cgd  */
    431   1.4      cgd void
    432  1.24      wiz dump(char *nfile, char *file, int copies)
    433   1.1      cgd {
    434  1.12      mrg 	short n, fill;
    435   1.1      cgd 	struct stat lbuf;
    436   1.1      cgd 
    437   1.1      cgd 	/*
    438   1.1      cgd 	 * Print as many files as will fit
    439   1.1      cgd 	 *  (leaving room for the total size)
    440   1.1      cgd 	 */
    441   1.1      cgd 	 fill = first ? 0 : 2;	/* fill space for ``, '' */
    442   1.1      cgd 	 if (((n = strlen(nfile)) + col + fill) >= SIZCOL-4) {
    443   1.1      cgd 		if (col < SIZCOL) {
    444   1.1      cgd 			printf(" ..."), col += 4;
    445   1.1      cgd 			blankfill(SIZCOL);
    446   1.1      cgd 		}
    447   1.1      cgd 	} else {
    448   1.1      cgd 		if (first)
    449   1.1      cgd 			first = 0;
    450   1.1      cgd 		else
    451   1.1      cgd 			printf(", ");
    452   1.1      cgd 		printf("%s", nfile);
    453   1.1      cgd 		col += n+fill;
    454   1.1      cgd 	}
    455   1.5  hpeyerl 	seteuid(euid);
    456   1.1      cgd 	if (*file && !stat(file, &lbuf))
    457  1.16      mrg 		totsize += copies * (long)lbuf.st_size;
    458   1.5  hpeyerl 	seteuid(uid);
    459   1.1      cgd }
    460   1.1      cgd 
    461   1.1      cgd /*
    462   1.1      cgd  * Print the long info about the file
    463   1.1      cgd  */
    464   1.4      cgd void
    465  1.24      wiz ldump(char *nfile, char *file, int copies)
    466   1.1      cgd {
    467   1.1      cgd 	struct stat lbuf;
    468   1.1      cgd 
    469   1.1      cgd 	putchar('\t');
    470   1.1      cgd 	if (copies > 1)
    471   1.1      cgd 		printf("%-2d copies of %-19s", copies, nfile);
    472   1.1      cgd 	else
    473   1.1      cgd 		printf("%-32s", nfile);
    474   1.1      cgd 	if (*file && !stat(file, &lbuf))
    475  1.19    lukem 		printf(" %lld bytes", (long long)lbuf.st_size);
    476   1.1      cgd 	else
    477   1.1      cgd 		printf(" ??? bytes");
    478   1.1      cgd 	putchar('\n');
    479   1.1      cgd }
    480   1.1      cgd 
    481   1.1      cgd /*
    482   1.1      cgd  * Print the job's rank in the queue,
    483   1.1      cgd  *   update col for screen management
    484   1.1      cgd  */
    485   1.4      cgd void
    486  1.24      wiz prank(int n)
    487   1.1      cgd {
    488   1.4      cgd 	char rline[100];
    489   1.1      cgd 	static char *r[] = {
    490   1.1      cgd 		"th", "st", "nd", "rd", "th", "th", "th", "th", "th", "th"
    491   1.1      cgd 	};
    492   1.1      cgd 
    493   1.1      cgd 	if (n == 0) {
    494   1.1      cgd 		printf("active");
    495   1.1      cgd 		col += 6;
    496   1.1      cgd 		return;
    497   1.1      cgd 	}
    498   1.1      cgd 	if ((n/10)%10 == 1)
    499   1.4      cgd 		(void)snprintf(rline, sizeof(rline), "%dth", n);
    500   1.1      cgd 	else
    501   1.4      cgd 		(void)snprintf(rline, sizeof(rline), "%d%s", n, r[n%10]);
    502   1.4      cgd 	col += strlen(rline);
    503   1.4      cgd 	printf("%s", rline);
    504   1.1      cgd }
    505