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 * 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.
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
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 $
36 * Spool Queue examination program
38 * lpq [-a] [-l] [-Pprinter] [user...] [job...]
40 * -a show all non-null queues on the local machine
42 * -P used to identify printer as per lpr/lprm
45 #include <sys/param.h>
57 #include "pathnames.h"
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 */
66 static int ckqueue(const struct printer
*_pp
);
67 static void usage(void);
70 main(int argc
, char **argv
)
74 struct printer myprinter
, *pp
= &myprinter
;
81 if (gethostname(local_host
, sizeof(local_host
)))
82 err(1, "gethostname");
83 openlog("lpd", 0, LOG_LPR
);
86 while ((ch
= getopt(argc
, argv
, "alP:")) != -1)
91 case 'l': /* long output */
94 case 'P': /* printer name */
102 if (!aflag
&& printer
== NULL
&& (printer
= getenv("PRINTER")) == NULL
)
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
);
112 if (users
>= MAXUSERS
)
113 fatal(0, "too many users");
114 user
[users
++] = *argv
;
120 more
= firstprinter(pp
, &status
);
124 if (ckqueue(pp
) > 0) {
125 printf("%s:\n", pp
->printer
);
130 more
= nextprinter(pp
, &status
);
134 printf("warning: %s: unresolved "
137 case PCAPERR_SUCCESS
:
140 fatal(pp
, "%s", pcaperr(status
));
142 } while (more
&& status
);
148 status
= getprintcap(printer
, pp
);
150 fatal(pp
, "%s", pcaperr(status
));
158 ckqueue(const struct printer
*pp
)
164 spooldir
= pp
->spool_dir
;
165 if ((dirp
= opendir(spooldir
)) == NULL
)
167 while ((d
= readdir(dirp
)) != NULL
) {
168 if (d
->d_name
[0] != 'c' || d
->d_name
[1] != 'f')
169 continue; /* daemon control files only */
171 return (1); /* found something */
181 "usage: lpq [-a] [-l] [-Pprinter] [user ...] [job ...]\n");