lpc.c revision 1.9 1 1.9 mrg /* $NetBSD: lpc.c,v 1.9 1997/10/05 16:45:44 mrg Exp $ */
2 1.8 mrg
3 1.1 cgd /*
4 1.3 cgd * Copyright (c) 1983, 1993
5 1.3 cgd * The Regents of the University of California. All rights reserved.
6 1.3 cgd *
7 1.1 cgd *
8 1.1 cgd * Redistribution and use in source and binary forms, with or without
9 1.1 cgd * modification, are permitted provided that the following conditions
10 1.1 cgd * are met:
11 1.1 cgd * 1. Redistributions of source code must retain the above copyright
12 1.1 cgd * notice, this list of conditions and the following disclaimer.
13 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer in the
15 1.1 cgd * documentation and/or other materials provided with the distribution.
16 1.1 cgd * 3. All advertising materials mentioning features or use of this software
17 1.1 cgd * must display the following acknowledgement:
18 1.1 cgd * This product includes software developed by the University of
19 1.1 cgd * California, Berkeley and its contributors.
20 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
21 1.1 cgd * may be used to endorse or promote products derived from this software
22 1.1 cgd * without specific prior written permission.
23 1.1 cgd *
24 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 1.1 cgd * SUCH DAMAGE.
35 1.1 cgd */
36 1.1 cgd
37 1.8 mrg #include <sys/cdefs.h>
38 1.1 cgd #ifndef lint
39 1.8 mrg __COPYRIGHT("@(#) Copyright (c) 1983, 1993\n\
40 1.8 mrg The Regents of the University of California. All rights reserved.\n");
41 1.8 mrg #if 0
42 1.7 mrg static char sccsid[] = "@(#)lpc.c 8.3 (Berkeley) 4/28/95";
43 1.8 mrg #else
44 1.9 mrg __RCSID("$NetBSD: lpc.c,v 1.9 1997/10/05 16:45:44 mrg Exp $");
45 1.8 mrg #endif
46 1.1 cgd #endif /* not lint */
47 1.1 cgd
48 1.3 cgd #include <sys/param.h>
49 1.3 cgd
50 1.3 cgd #include <dirent.h>
51 1.1 cgd #include <signal.h>
52 1.1 cgd #include <setjmp.h>
53 1.1 cgd #include <syslog.h>
54 1.3 cgd #include <unistd.h>
55 1.3 cgd #include <stdlib.h>
56 1.3 cgd #include <stdio.h>
57 1.3 cgd #include <ctype.h>
58 1.3 cgd #include <string.h>
59 1.7 mrg #include <grp.h>
60 1.8 mrg #include <err.h>
61 1.3 cgd #include "lp.h"
62 1.3 cgd #include "lpc.h"
63 1.3 cgd #include "extern.h"
64 1.1 cgd
65 1.7 mrg #ifndef LPR_OPER
66 1.7 mrg #define LPR_OPER "operator" /* group name of lpr operators */
67 1.7 mrg #endif
68 1.7 mrg
69 1.3 cgd /*
70 1.3 cgd * lpc -- line printer control program
71 1.3 cgd */
72 1.1 cgd
73 1.4 hpeyerl #define MAX_CMDLINE 200
74 1.4 hpeyerl #define MAX_MARGV 20
75 1.1 cgd int fromatty;
76 1.1 cgd
77 1.4 hpeyerl char cmdline[MAX_CMDLINE];
78 1.1 cgd int margc;
79 1.4 hpeyerl char *margv[MAX_MARGV];
80 1.1 cgd int top;
81 1.4 hpeyerl uid_t uid, euid;
82 1.1 cgd
83 1.1 cgd jmp_buf toplevel;
84 1.1 cgd
85 1.3 cgd static void cmdscanner __P((int));
86 1.3 cgd static struct cmd *getcmd __P((char *));
87 1.3 cgd static void intr __P((int));
88 1.3 cgd static void makeargv __P((void));
89 1.7 mrg static int ingroup __P((char *));
90 1.8 mrg int main __P((int, char *p[]));
91 1.3 cgd
92 1.3 cgd int
93 1.1 cgd main(argc, argv)
94 1.3 cgd int argc;
95 1.1 cgd char *argv[];
96 1.1 cgd {
97 1.8 mrg struct cmd *c;
98 1.1 cgd
99 1.4 hpeyerl euid = geteuid();
100 1.4 hpeyerl uid = getuid();
101 1.4 hpeyerl seteuid(uid);
102 1.1 cgd name = argv[0];
103 1.1 cgd openlog("lpd", 0, LOG_LPR);
104 1.1 cgd
105 1.1 cgd if (--argc > 0) {
106 1.1 cgd c = getcmd(*++argv);
107 1.1 cgd if (c == (struct cmd *)-1) {
108 1.1 cgd printf("?Ambiguous command\n");
109 1.1 cgd exit(1);
110 1.1 cgd }
111 1.1 cgd if (c == 0) {
112 1.1 cgd printf("?Invalid command\n");
113 1.1 cgd exit(1);
114 1.1 cgd }
115 1.7 mrg if (c->c_priv && getuid() && ingroup(LPR_OPER) == 0) {
116 1.1 cgd printf("?Privileged command\n");
117 1.1 cgd exit(1);
118 1.1 cgd }
119 1.1 cgd (*c->c_handler)(argc, argv);
120 1.1 cgd exit(0);
121 1.1 cgd }
122 1.1 cgd fromatty = isatty(fileno(stdin));
123 1.1 cgd top = setjmp(toplevel) == 0;
124 1.1 cgd if (top)
125 1.1 cgd signal(SIGINT, intr);
126 1.1 cgd for (;;) {
127 1.1 cgd cmdscanner(top);
128 1.1 cgd top = 1;
129 1.1 cgd }
130 1.1 cgd }
131 1.1 cgd
132 1.3 cgd static void
133 1.3 cgd intr(signo)
134 1.3 cgd int signo;
135 1.1 cgd {
136 1.1 cgd if (!fromatty)
137 1.1 cgd exit(0);
138 1.1 cgd longjmp(toplevel, 1);
139 1.1 cgd }
140 1.1 cgd
141 1.1 cgd /*
142 1.1 cgd * Command parser.
143 1.1 cgd */
144 1.3 cgd static void
145 1.1 cgd cmdscanner(top)
146 1.1 cgd int top;
147 1.1 cgd {
148 1.8 mrg struct cmd *c;
149 1.1 cgd
150 1.1 cgd if (!top)
151 1.1 cgd putchar('\n');
152 1.1 cgd for (;;) {
153 1.1 cgd if (fromatty) {
154 1.1 cgd printf("lpc> ");
155 1.1 cgd fflush(stdout);
156 1.1 cgd }
157 1.4 hpeyerl if (fgets(cmdline, MAX_CMDLINE, stdin) == 0)
158 1.3 cgd quit(0, NULL);
159 1.1 cgd if (cmdline[0] == 0 || cmdline[0] == '\n')
160 1.1 cgd break;
161 1.1 cgd makeargv();
162 1.1 cgd c = getcmd(margv[0]);
163 1.1 cgd if (c == (struct cmd *)-1) {
164 1.1 cgd printf("?Ambiguous command\n");
165 1.1 cgd continue;
166 1.1 cgd }
167 1.1 cgd if (c == 0) {
168 1.1 cgd printf("?Invalid command\n");
169 1.1 cgd continue;
170 1.1 cgd }
171 1.7 mrg if (c->c_priv && getuid() && ingroup(LPR_OPER) == 0) {
172 1.1 cgd printf("?Privileged command\n");
173 1.1 cgd continue;
174 1.1 cgd }
175 1.1 cgd (*c->c_handler)(margc, margv);
176 1.1 cgd }
177 1.1 cgd longjmp(toplevel, 0);
178 1.1 cgd }
179 1.1 cgd
180 1.7 mrg static struct cmd *
181 1.1 cgd getcmd(name)
182 1.8 mrg char *name;
183 1.1 cgd {
184 1.8 mrg char *p, *q;
185 1.8 mrg struct cmd *c, *found;
186 1.8 mrg int nmatches, longest;
187 1.1 cgd
188 1.1 cgd longest = 0;
189 1.1 cgd nmatches = 0;
190 1.1 cgd found = 0;
191 1.6 mikel for (c = cmdtab; (p = c->c_name) != NULL; c++) {
192 1.1 cgd for (q = name; *q == *p++; q++)
193 1.1 cgd if (*q == 0) /* exact match? */
194 1.1 cgd return(c);
195 1.1 cgd if (!*q) { /* the name was a prefix */
196 1.1 cgd if (q - name > longest) {
197 1.1 cgd longest = q - name;
198 1.1 cgd nmatches = 1;
199 1.1 cgd found = c;
200 1.1 cgd } else if (q - name == longest)
201 1.1 cgd nmatches++;
202 1.1 cgd }
203 1.1 cgd }
204 1.1 cgd if (nmatches > 1)
205 1.1 cgd return((struct cmd *)-1);
206 1.1 cgd return(found);
207 1.1 cgd }
208 1.1 cgd
209 1.1 cgd /*
210 1.1 cgd * Slice a string up into argc/argv.
211 1.1 cgd */
212 1.3 cgd static void
213 1.1 cgd makeargv()
214 1.1 cgd {
215 1.8 mrg char *cp;
216 1.8 mrg char **argp = margv;
217 1.8 mrg int n = 0;
218 1.1 cgd
219 1.1 cgd margc = 0;
220 1.8 mrg for (cp = cmdline; *cp && (cp - cmdline) < sizeof(cmdline) &&
221 1.8 mrg n < MAX_MARGV; n++) {
222 1.1 cgd while (isspace(*cp))
223 1.1 cgd cp++;
224 1.1 cgd if (*cp == '\0')
225 1.1 cgd break;
226 1.1 cgd *argp++ = cp;
227 1.1 cgd margc += 1;
228 1.1 cgd while (*cp != '\0' && !isspace(*cp))
229 1.1 cgd cp++;
230 1.1 cgd if (*cp == '\0')
231 1.1 cgd break;
232 1.1 cgd *cp++ = '\0';
233 1.1 cgd }
234 1.1 cgd *argp++ = 0;
235 1.1 cgd }
236 1.1 cgd
237 1.1 cgd #define HELPINDENT (sizeof ("directory"))
238 1.1 cgd
239 1.1 cgd /*
240 1.1 cgd * Help command.
241 1.1 cgd */
242 1.3 cgd void
243 1.1 cgd help(argc, argv)
244 1.1 cgd int argc;
245 1.1 cgd char *argv[];
246 1.1 cgd {
247 1.8 mrg struct cmd *c;
248 1.1 cgd
249 1.1 cgd if (argc == 1) {
250 1.8 mrg int i, j, w;
251 1.1 cgd int columns, width = 0, lines;
252 1.1 cgd
253 1.1 cgd printf("Commands may be abbreviated. Commands are:\n\n");
254 1.1 cgd for (c = cmdtab; c->c_name; c++) {
255 1.1 cgd int len = strlen(c->c_name);
256 1.1 cgd
257 1.1 cgd if (len > width)
258 1.1 cgd width = len;
259 1.1 cgd }
260 1.1 cgd width = (width + 8) &~ 7;
261 1.1 cgd columns = 80 / width;
262 1.1 cgd if (columns == 0)
263 1.1 cgd columns = 1;
264 1.1 cgd lines = (NCMDS + columns - 1) / columns;
265 1.1 cgd for (i = 0; i < lines; i++) {
266 1.1 cgd for (j = 0; j < columns; j++) {
267 1.1 cgd c = cmdtab + j * lines + i;
268 1.1 cgd if (c->c_name)
269 1.1 cgd printf("%s", c->c_name);
270 1.1 cgd if (c + lines >= &cmdtab[NCMDS]) {
271 1.1 cgd printf("\n");
272 1.1 cgd break;
273 1.1 cgd }
274 1.1 cgd w = strlen(c->c_name);
275 1.1 cgd while (w < width) {
276 1.1 cgd w = (w + 8) &~ 7;
277 1.1 cgd putchar('\t');
278 1.1 cgd }
279 1.1 cgd }
280 1.1 cgd }
281 1.1 cgd return;
282 1.1 cgd }
283 1.1 cgd while (--argc > 0) {
284 1.8 mrg char *arg;
285 1.1 cgd arg = *++argv;
286 1.1 cgd c = getcmd(arg);
287 1.1 cgd if (c == (struct cmd *)-1)
288 1.1 cgd printf("?Ambiguous help command %s\n", arg);
289 1.1 cgd else if (c == (struct cmd *)0)
290 1.1 cgd printf("?Invalid help command %s\n", arg);
291 1.1 cgd else
292 1.9 mrg printf("%-*s\t%s\n", (int)HELPINDENT,
293 1.1 cgd c->c_name, c->c_help);
294 1.1 cgd }
295 1.7 mrg }
296 1.7 mrg
297 1.7 mrg /*
298 1.7 mrg * return non-zero if the user is a member of the given group
299 1.7 mrg */
300 1.7 mrg static int
301 1.7 mrg ingroup(grname)
302 1.7 mrg char *grname;
303 1.7 mrg {
304 1.7 mrg static struct group *gptr=NULL;
305 1.7 mrg static gid_t groups[NGROUPS];
306 1.8 mrg gid_t gid;
307 1.8 mrg int i;
308 1.7 mrg
309 1.7 mrg if (gptr == NULL) {
310 1.7 mrg if ((gptr = getgrnam(grname)) == NULL) {
311 1.8 mrg warnx("Warning: unknown group `%s'\n",
312 1.7 mrg grname);
313 1.7 mrg return(0);
314 1.7 mrg }
315 1.8 mrg if (getgroups(NGROUPS, groups) < 0)
316 1.8 mrg err(1, "getgroups");
317 1.7 mrg }
318 1.7 mrg gid = gptr->gr_gid;
319 1.7 mrg for (i = 0; i < NGROUPS; i++)
320 1.7 mrg if (gid == groups[i])
321 1.7 mrg return(1);
322 1.7 mrg return(0);
323 1.1 cgd }
324