xref: /netbsd-src/usr.sbin/lpr/lprm/lprm.c (revision d710132b4b8ce7f7cccaaf660cb16aa16b4077a0)
1 /*	$NetBSD: lprm.c,v 1.14 2003/05/17 20:46:44 itojun Exp $	*/
2 
3 /*
4  * Copyright (c) 1983, 1993
5  *	The Regents of the University of California.  All rights reserved.
6  *
7  *
8  * Redistribution and use in source and binary forms, with or without
9  * modification, are permitted provided that the following conditions
10  * are met:
11  * 1. Redistributions of source code must retain the above copyright
12  *    notice, this list of conditions and the following disclaimer.
13  * 2. Redistributions in binary form must reproduce the above copyright
14  *    notice, this list of conditions and the following disclaimer in the
15  *    documentation and/or other materials provided with the distribution.
16  * 3. All advertising materials mentioning features or use of this software
17  *    must display the following acknowledgement:
18  *	This product includes software developed by the University of
19  *	California, Berkeley and its contributors.
20  * 4. Neither the name of the University nor the names of its contributors
21  *    may be used to endorse or promote products derived from this software
22  *    without specific prior written permission.
23  *
24  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34  * SUCH DAMAGE.
35  */
36 
37 #include <sys/cdefs.h>
38 #ifndef lint
39 __COPYRIGHT("@(#) Copyright (c) 1983, 1993\n\
40 	The Regents of the University of California.  All rights reserved.\n");
41 #if 0
42 static char sccsid[] = "@(#)lprm.c	8.1 (Berkeley) 6/6/93";
43 #else
44 __RCSID("$NetBSD: lprm.c,v 1.14 2003/05/17 20:46:44 itojun Exp $");
45 #endif
46 #endif /* not lint */
47 
48 /*
49  * lprm - remove the current user's spool entry
50  *
51  * lprm [-] [[job #] [user] ...]
52  *
53  * Using information in the lock file, lprm will kill the
54  * currently active daemon (if necessary), remove the associated files,
55  * and startup a new daemon.  Privileged users may remove anyone's spool
56  * entries, otherwise one can only remove their own.
57  */
58 
59 #include <sys/param.h>
60 
61 #include <err.h>
62 #include <syslog.h>
63 #include <dirent.h>
64 #include <pwd.h>
65 #include <unistd.h>
66 #include <stdlib.h>
67 #include <stdio.h>
68 #include <string.h>
69 #include <ctype.h>
70 
71 #include "lp.h"
72 #include "lp.local.h"
73 
74 /*
75  * Stuff for handling job specifications
76  */
77 char	*person;		/* name of person doing lprm */
78 int	 requ[MAXREQUESTS];	/* job number of spool entries */
79 int	 requests;		/* # of spool requests */
80 char	*user[MAXUSERS];	/* users to process */
81 int	 users;			/* # of users in user array */
82 uid_t	 uid, euid;		/* real and effective user id's */
83 
84 static char	luser[16];	/* buffer for person */
85 
86 static void usage(void);
87 int main(int, char *[]);
88 
89 int
90 main(int argc, char *argv[])
91 {
92 	char *arg;
93 	struct passwd *p;
94 
95 	uid = getuid();
96 	euid = geteuid();
97 	seteuid(uid);	/* be safe */
98 	name = argv[0];
99 	gethostname(host, sizeof(host));
100 	host[sizeof(host) - 1] = '\0';
101 	openlog("lpd", 0, LOG_LPR);
102 	if ((p = getpwuid(getuid())) == NULL)
103 		fatal("Who are you?");
104 	if (strlen(p->pw_name) >= sizeof(luser))
105 		fatal("Your name is too long");
106 	strlcpy(luser, p->pw_name, sizeof(luser));
107 	person = luser;
108 	while (--argc) {
109 		if ((arg = *++argv)[0] == '-')
110 			switch (arg[1]) {
111 			case 'P':
112 				if (arg[2])
113 					printer = &arg[2];
114 				else if (argc > 1) {
115 					argc--;
116 					printer = *++argv;
117 				}
118 				break;
119 			case 'w':
120 				if (arg[2])
121 					wait_time = atoi(&arg[2]);
122 				else if (argc > 1) {
123 					argc--;
124 					wait_time = atoi(*++argv);
125 				}
126 				if (wait_time < 0)
127 					errx(1, "wait time must be positive: %d",
128 					    wait_time);
129 				if (wait_time < 30)
130 				    warnx("warning: wait time less than 30 seconds");
131 				break;
132 			case '\0':
133 				if (!users) {
134 					users = -1;
135 					break;
136 				}
137 			default:
138 				usage();
139 			}
140 		else {
141 			if (users < 0)
142 				usage();
143 			if (isdigit(arg[0])) {
144 				if (requests >= MAXREQUESTS)
145 					fatal("Too many requests");
146 				requ[requests++] = atoi(arg);
147 			} else {
148 				if (users >= MAXUSERS)
149 					fatal("Too many users");
150 				user[users++] = arg;
151 			}
152 		}
153 	}
154 	if (printer == NULL && (printer = getenv("PRINTER")) == NULL)
155 		printer = DEFLP;
156 
157 	rmjob();
158 	exit(0);
159 }
160 
161 static void
162 usage(void)
163 {
164 	fprintf(stderr,
165 		"usage: lprm [-] [-Pprinter] [-w maxwait] [[job #] [user] ...]\n");
166 	exit(2);
167 }
168