xref: /dragonfly/usr.sbin/lpr/lpq/lpq.c (revision 6ca88057)
1 /*
2  * Copyright (c) 1983, 1993
3  *	The Regents of the University of California.  All rights reserved.
4  *
5  *
6  * Redistribution and use in source and binary forms, with or without
7  * modification, are permitted provided that the following conditions
8  * are met:
9  * 1. Redistributions of source code must retain the above copyright
10  *    notice, this list of conditions and the following disclaimer.
11  * 2. Redistributions in binary form must reproduce the above copyright
12  *    notice, this list of conditions and the following disclaimer in the
13  *    documentation and/or other materials provided with the distribution.
14  * 3. Neither the name of the University nor the names of its contributors
15  *    may be used to endorse or promote products derived from this software
16  *    without specific prior written permission.
17  *
18  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
19  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
22  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
24  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
25  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
26  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
27  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28  * SUCH DAMAGE.
29  *
30  * @(#) Copyright (c) 1983, 1993 The Regents of the University of California.  All rights reserved.
31  * @(#)lpq.c	8.3 (Berkeley) 5/10/95
32  * $FreeBSD: src/usr.sbin/lpr/lpq/lpq.c,v 1.7.2.4 2001/07/22 02:51:53 gad Exp $
33  */
34 
35 /*
36  * Spool Queue examination program
37  *
38  * lpq [-a] [-l] [-Pprinter] [user...] [job...]
39  *
40  * -a show all non-null queues on the local machine
41  * -l long output
42  * -P used to identify printer as per lpr/lprm
43  */
44 
45 #include <sys/param.h>
46 
47 #include <ctype.h>
48 #include <dirent.h>
49 #include <err.h>
50 #include <stdio.h>
51 #include <stdlib.h>
52 #include <syslog.h>
53 #include <unistd.h>
54 
55 #include "lp.h"
56 #include "lp.local.h"
57 #include "pathnames.h"
58 
59 int	 requ[MAXREQUESTS];	/* job number of spool entries */
60 int	 requests;		/* # of spool requests */
61 char	*user[MAXUSERS];	/* users to process */
62 int	 users;			/* # of users in user array */
63 
64 uid_t	uid, euid;
65 
66 static int	 ckqueue(const struct printer *_pp);
67 static void	 usage(void);
68 
69 int
70 main(int argc, char **argv)
71 {
72 	int ch, aflag, lflag;
73 	const char *printer;
74 	struct printer myprinter, *pp = &myprinter;
75 
76 	printer = NULL;
77 	euid = geteuid();
78 	uid = getuid();
79 	seteuid(uid);
80 	progname = *argv;
81 	if (gethostname(local_host, sizeof(local_host)))
82 		err(1, "gethostname");
83 	openlog("lpd", 0, LOG_LPR);
84 
85 	aflag = lflag = 0;
86 	while ((ch = getopt(argc, argv, "alP:")) != -1)
87 		switch((char)ch) {
88 		case 'a':
89 			++aflag;
90 			break;
91 		case 'l':			/* long output */
92 			++lflag;
93 			break;
94 		case 'P':		/* printer name */
95 			printer = optarg;
96 			break;
97 		case '?':
98 		default:
99 			usage();
100 		}
101 
102 	if (!aflag && printer == NULL && (printer = getenv("PRINTER")) == NULL)
103 		printer = DEFLP;
104 
105 	for (argc -= optind, argv += optind; argc; --argc, ++argv)
106 		if (isdigit(argv[0][0])) {
107 			if (requests >= MAXREQUESTS)
108 				fatal(0, "too many requests");
109 			requ[requests++] = atoi(*argv);
110 		}
111 		else {
112 			if (users >= MAXUSERS)
113 				fatal(0, "too many users");
114 			user[users++] = *argv;
115 		}
116 
117 	if (aflag) {
118 		int more, status;
119 
120 		more = firstprinter(pp, &status);
121 		if (status)
122 			goto looperr;
123 		while (more) {
124 			if (ckqueue(pp) > 0) {
125 				printf("%s:\n", pp->printer);
126 				displayq(pp, lflag);
127 				printf("\n");
128 			}
129 			do {
130 				more = nextprinter(pp, &status);
131 looperr:
132 				switch (status) {
133 				case PCAPERR_TCOPEN:
134 					printf("warning: %s: unresolved "
135 					       "tc= reference(s) ",
136 					       pp->printer);
137 				case PCAPERR_SUCCESS:
138 					break;
139 				default:
140 					fatal(pp, "%s", pcaperr(status));
141 				}
142 			} while (more && status);
143 		}
144 	} else {
145 		int status;
146 
147 		init_printer(pp);
148 		status = getprintcap(printer, pp);
149 		if (status < 0)
150 			fatal(pp, "%s", pcaperr(status));
151 
152 		displayq(pp, lflag);
153 	}
154 	exit(0);
155 }
156 
157 static int
158 ckqueue(const struct printer *pp)
159 {
160 	struct dirent *d;
161 	DIR *dirp;
162 	char *spooldir;
163 
164 	spooldir = pp->spool_dir;
165 	if ((dirp = opendir(spooldir)) == NULL)
166 		return (-1);
167 	while ((d = readdir(dirp)) != NULL) {
168 		if (d->d_name[0] != 'c' || d->d_name[1] != 'f')
169 			continue;	/* daemon control files only */
170 		closedir(dirp);
171 		return (1);		/* found something */
172 	}
173 	closedir(dirp);
174 	return (0);
175 }
176 
177 static void
178 usage(void)
179 {
180 	fprintf(stderr,
181 	"usage: lpq [-a] [-l] [-Pprinter] [user ...] [job ...]\n");
182 	exit(1);
183 }
184