lpq.c revision 1.1
1/* 2 * Copyright (c) 1983 Regents of the University of California. 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 */ 33 34#ifndef lint 35char copyright[] = 36"@(#) Copyright (c) 1983 Regents of the University of California.\n\ 37 All rights reserved.\n"; 38#endif /* not lint */ 39 40#ifndef lint 41static char sccsid[] = "@(#)lpq.c 5.7 (Berkeley) 3/2/91"; 42#endif /* not lint */ 43 44/* 45 * Spool Queue examination program 46 * 47 * lpq [-l] [-Pprinter] [user...] [job...] 48 * 49 * -l long output 50 * -P used to identify printer as per lpr/lprm 51 */ 52 53#include "lp.h" 54 55char *user[MAXUSERS]; /* users to process */ 56int users; /* # of users in user array */ 57int requ[MAXREQUESTS]; /* job number of spool entries */ 58int requests; /* # of spool requests */ 59 60main(argc, argv) 61 register int argc; 62 register char **argv; 63{ 64 extern char *optarg; 65 extern int optind; 66 int ch, lflag; /* long output option */ 67 68 name = *argv; 69 if (gethostname(host, sizeof(host))) { 70 perror("lpq: gethostname"); 71 exit(1); 72 } 73 openlog("lpd", 0, LOG_LPR); 74 75 lflag = 0; 76 while ((ch = getopt(argc, argv, "lP:")) != EOF) 77 switch((char)ch) { 78 case 'l': /* long output */ 79 ++lflag; 80 break; 81 case 'P': /* printer name */ 82 printer = optarg; 83 break; 84 case '?': 85 default: 86 usage(); 87 } 88 89 if (printer == NULL && (printer = getenv("PRINTER")) == NULL) 90 printer = DEFLP; 91 92 for (argc -= optind, argv += optind; argc; --argc, ++argv) 93 if (isdigit(argv[0][0])) { 94 if (requests >= MAXREQUESTS) 95 fatal("too many requests"); 96 requ[requests++] = atoi(*argv); 97 } 98 else { 99 if (users >= MAXUSERS) 100 fatal("too many users"); 101 user[users++] = *argv; 102 } 103 104 displayq(lflag); 105 exit(0); 106} 107 108usage() 109{ 110 puts("usage: lpq [-l] [-Pprinter] [user ...] [job ...]"); 111 exit(1); 112} 113