lprm.c revision 1.2 1 1.1 cgd /*
2 1.1 cgd * Copyright (c) 1983 Regents of the University of California.
3 1.1 cgd * All rights reserved.
4 1.1 cgd *
5 1.1 cgd * Redistribution and use in source and binary forms, with or without
6 1.1 cgd * modification, are permitted provided that the following conditions
7 1.1 cgd * are met:
8 1.1 cgd * 1. Redistributions of source code must retain the above copyright
9 1.1 cgd * notice, this list of conditions and the following disclaimer.
10 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer in the
12 1.1 cgd * documentation and/or other materials provided with the distribution.
13 1.1 cgd * 3. All advertising materials mentioning features or use of this software
14 1.1 cgd * must display the following acknowledgement:
15 1.1 cgd * This product includes software developed by the University of
16 1.1 cgd * California, Berkeley and its contributors.
17 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
18 1.1 cgd * may be used to endorse or promote products derived from this software
19 1.1 cgd * without specific prior written permission.
20 1.1 cgd *
21 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 1.1 cgd * SUCH DAMAGE.
32 1.1 cgd */
33 1.1 cgd
34 1.1 cgd #ifndef lint
35 1.1 cgd char copyright[] =
36 1.1 cgd "@(#) Copyright (c) 1983 Regents of the University of California.\n\
37 1.1 cgd All rights reserved.\n";
38 1.1 cgd #endif /* not lint */
39 1.1 cgd
40 1.1 cgd #ifndef lint
41 1.2 mycroft /*static char sccsid[] = "from: @(#)lprm.c 5.6 (Berkeley) 3/2/91";*/
42 1.2 mycroft static char rcsid[] = "$Id: lprm.c,v 1.2 1993/08/01 17:58:36 mycroft Exp $";
43 1.1 cgd #endif /* not lint */
44 1.1 cgd
45 1.1 cgd /*
46 1.1 cgd * lprm - remove the current user's spool entry
47 1.1 cgd *
48 1.1 cgd * lprm [-] [[job #] [user] ...]
49 1.1 cgd *
50 1.1 cgd * Using information in the lock file, lprm will kill the
51 1.1 cgd * currently active daemon (if necessary), remove the associated files,
52 1.1 cgd * and startup a new daemon. Priviledged users may remove anyone's spool
53 1.1 cgd * entries, otherwise one can only remove their own.
54 1.1 cgd */
55 1.1 cgd
56 1.1 cgd #include "lp.h"
57 1.1 cgd
58 1.1 cgd /*
59 1.1 cgd * Stuff for handling job specifications
60 1.1 cgd */
61 1.1 cgd char *user[MAXUSERS]; /* users to process */
62 1.1 cgd int users; /* # of users in user array */
63 1.1 cgd int requ[MAXREQUESTS]; /* job number of spool entries */
64 1.1 cgd int requests; /* # of spool requests */
65 1.1 cgd char *person; /* name of person doing lprm */
66 1.1 cgd
67 1.1 cgd static char luser[16]; /* buffer for person */
68 1.1 cgd
69 1.1 cgd main(argc, argv)
70 1.1 cgd int argc;
71 1.1 cgd char *argv[];
72 1.1 cgd {
73 1.1 cgd register char *arg;
74 1.1 cgd struct passwd *p;
75 1.1 cgd struct direct **files;
76 1.1 cgd int nitems, assasinated = 0;
77 1.1 cgd
78 1.1 cgd name = argv[0];
79 1.1 cgd gethostname(host, sizeof(host));
80 1.1 cgd openlog("lpd", 0, LOG_LPR);
81 1.1 cgd if ((p = getpwuid(getuid())) == NULL)
82 1.1 cgd fatal("Who are you?");
83 1.1 cgd if (strlen(p->pw_name) >= sizeof(luser))
84 1.1 cgd fatal("Your name is too long");
85 1.1 cgd strcpy(luser, p->pw_name);
86 1.1 cgd person = luser;
87 1.1 cgd while (--argc) {
88 1.1 cgd if ((arg = *++argv)[0] == '-')
89 1.1 cgd switch (arg[1]) {
90 1.1 cgd case 'P':
91 1.1 cgd if (arg[2])
92 1.1 cgd printer = &arg[2];
93 1.1 cgd else if (argc > 1) {
94 1.1 cgd argc--;
95 1.1 cgd printer = *++argv;
96 1.1 cgd }
97 1.1 cgd break;
98 1.1 cgd case '\0':
99 1.1 cgd if (!users) {
100 1.1 cgd users = -1;
101 1.1 cgd break;
102 1.1 cgd }
103 1.1 cgd default:
104 1.1 cgd usage();
105 1.1 cgd }
106 1.1 cgd else {
107 1.1 cgd if (users < 0)
108 1.1 cgd usage();
109 1.1 cgd if (isdigit(arg[0])) {
110 1.1 cgd if (requests >= MAXREQUESTS)
111 1.1 cgd fatal("Too many requests");
112 1.1 cgd requ[requests++] = atoi(arg);
113 1.1 cgd } else {
114 1.1 cgd if (users >= MAXUSERS)
115 1.1 cgd fatal("Too many users");
116 1.1 cgd user[users++] = arg;
117 1.1 cgd }
118 1.1 cgd }
119 1.1 cgd }
120 1.1 cgd if (printer == NULL && (printer = getenv("PRINTER")) == NULL)
121 1.1 cgd printer = DEFLP;
122 1.1 cgd
123 1.1 cgd rmjob();
124 1.1 cgd }
125 1.1 cgd
126 1.1 cgd usage()
127 1.1 cgd {
128 1.1 cgd fprintf(stderr, "usage: lprm [-] [-Pprinter] [[job #] [user] ...]\n");
129 1.1 cgd exit(2);
130 1.1 cgd }
131