2 * Copyright (c) 1983, 1993
3 * The Regents of the University of California. All rights reserved.
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
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 * 4. 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.
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
32 static const char copyright[] =
33 "@(#) Copyright (c) 1983, 1993\n\
34 The Regents of the University of California. All rights reserved.\n";
39 static char sccsid[] = "@(#)lpq.c 8.3 (Berkeley) 5/10/95";
43 #include "lp.cdefs.h" /* A cross-platform version of <sys/cdefs.h> */
44 __FBSDID("$FreeBSD$");
47 * Spool Queue examination program
49 * lpq [-a] [-l] [-Pprinter] [user...] [job...]
51 * -a show all non-null queues on the local machine
53 * -P used to identify printer as per lpr/lprm
56 #include <sys/param.h>
68 #include "pathnames.h"
70 int requ[MAXREQUESTS]; /* job number of spool entries */
71 int requests; /* # of spool requests */
72 char *user[MAXUSERS]; /* users to process */
73 int users; /* # of users in user array */
77 static int ckqueue(const struct printer *_pp);
78 static void usage(void);
79 int main(int _argc, char **_argv);
82 main(int argc, char **argv)
86 struct printer myprinter, *pp = &myprinter;
93 if (gethostname(local_host, sizeof(local_host)))
94 err(1, "gethostname");
95 openlog("lpd", 0, LOG_LPR);
98 while ((ch = getopt(argc, argv, "alP:")) != -1)
103 case 'l': /* long output */
106 case 'P': /* printer name */
114 if (!aflag && printer == NULL && (printer = getenv("PRINTER")) == NULL)
117 for (argc -= optind, argv += optind; argc; --argc, ++argv)
118 if (isdigit(argv[0][0])) {
119 if (requests >= MAXREQUESTS)
120 fatal(0, "too many requests");
121 requ[requests++] = atoi(*argv);
124 if (users >= MAXUSERS)
125 fatal(0, "too many users");
126 user[users++] = *argv;
132 more = firstprinter(pp, &status);
136 if (ckqueue(pp) > 0) {
137 printf("%s:\n", pp->printer);
142 more = nextprinter(pp, &status);
146 printf("warning: %s: unresolved "
149 case PCAPERR_SUCCESS:
152 fatal(pp, "%s", pcaperr(status));
154 } while (more && status);
160 status = getprintcap(printer, pp);
162 fatal(pp, "%s", pcaperr(status));
170 ckqueue(const struct printer *pp)
172 register struct dirent *d;
176 spooldir = pp->spool_dir;
177 if ((dirp = opendir(spooldir)) == NULL)
179 while ((d = readdir(dirp)) != NULL) {
180 if (d->d_name[0] != 'c' || d->d_name[1] != 'f')
181 continue; /* daemon control files only */
183 return (1); /* found something */
193 "usage: lpq [-a] [-l] [-Pprinter] [user ...] [job ...]\n");