1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
|
/*
* Copyright 1997 Massachusetts Institute of Technology
*
* Permission to use, copy, modify, and distribute this software and
* its documentation for any purpose and without fee is hereby
* granted, provided that both the above copyright notice and this
* permission notice appear in all copies, that both the above
* copyright notice and this permission notice appear in all
* supporting documentation, and that the name of M.I.T. not be used
* in advertising or publicity pertaining to distribution of the
* software without specific, written prior permission. M.I.T. makes
* no representations about the suitability of this software for any
* purpose. It is provided "as is" without express or implied
* warranty.
*
* THIS SOFTWARE IS PROVIDED BY M.I.T. ``AS IS''. M.I.T. DISCLAIMS
* ALL EXPRESS OR IMPLIED WARRANTIES WITH REGARD TO THIS SOFTWARE,
* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. IN NO EVENT
* SHALL M.I.T. BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
static const char copyright[] =
"Copyright (C) 1997, Massachusetts Institute of Technology\r\n";
static const char rcsid[] =
"$FreeBSD$";
#include <sys/types.h>
#include <sys/queue.h>
#include <sys/stat.h>
#include <err.h>
#include <errno.h>
#include <grp.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <unistd.h>
#include <sys/param.h> /* needed for lp.h but not used here */
#include <dirent.h> /* ditto */
#include "lp.h"
#include "lp.local.h"
#include "pathnames.h"
#include "skimprintcap.h"
static void check_spool_dirs(void);
static int interpret_error(const struct printer *pp, int error);
static void make_spool_dir(const struct printer *pp);
static void note_spool_dir(const struct printer *pp, const struct stat *st);
static void usage(void) __dead2;
static int problems; /* number of problems encountered */
/*
* chkprintcap - check the printcap file for syntactic and semantic errors
* Returns the number of problems found.
*/
int
main(int argc, char **argv)
{
struct skiminfo *skres;
char *pcap_fname;
int c, error, makedirs, more, queuecnt, verbosity;
struct printer myprinter, *pp;
makedirs = 0;
queuecnt = 0;
verbosity = 0;
pcap_fname = NULL;
pp = &myprinter;
while ((c = getopt(argc, argv, "df:v")) != -1) {
switch (c) {
case 'd':
makedirs = 1;
break;
case 'f':
pcap_fname = strdup(optarg);
setprintcap(pcap_fname);
break;
case 'v':
verbosity++;
break;
default:
usage();
}
}
if (optind != argc)
usage();
if (pcap_fname == NULL)
pcap_fname = strdup(_PATH_PRINTCAP);
/*
* Skim through the printcap file looking for simple user-mistakes
* which will produce the wrong result for the user, but which may
* be pretty hard for the user to notice. Such user-mistakes will
* only generate warning messages. The (fatal-) problem count will
* only be incremented if there is a system problem trying to read
* the printcap file.
*/
skres = skim_printcap(pcap_fname, verbosity);
if (skres->fatalerr)
return (skres->fatalerr);
/*
* Now use the standard capability-db routines to check the values
* in each of the queues defined in the printcap file.
*/
more = firstprinter(pp, &error);
if (interpret_error(pp, error) && more)
goto next;
while (more) {
struct stat stab;
queuecnt++;
errno = 0;
if (stat(pp->spool_dir, &stab) < 0) {
if (errno == ENOENT && makedirs) {
make_spool_dir(pp);
} else {
problems++;
warn("%s: %s", pp->printer, pp->spool_dir);
}
} else {
note_spool_dir(pp, &stab);
}
/* Make other queue-specific validity checks here... */
next:
more = nextprinter(pp, &error);
if (interpret_error(pp, error) && more)
goto next;
}
check_spool_dirs();
if (queuecnt != skres->entries) {
warnx("WARNING: found %d entries when skimming %s,",
skres->entries, pcap_fname);
warnx("WARNING: but only found %d queues to process!",
queuecnt);
}
return (problems);
}
/*
* Interpret the error code. Returns 1 if we should skip to the next
* record (as this record is unlikely to make sense). If the problem
* is very severe, exit. Otherwise, return zero.
*/
static int
interpret_error(const struct printer *pp, int error)
{
switch(error) {
case PCAPERR_OSERR:
err(++problems, "reading printer database");
case PCAPERR_TCLOOP:
++problems;
warnx("%s: loop detected in tc= expansion", pp->printer);
return 1;
case PCAPERR_TCOPEN:
warnx("%s: unresolved tc= expansion", pp->printer);
return 1;
case PCAPERR_SUCCESS:
break;
default:
errx(++problems, "unknown printcap library error %d", error);
}
return 0;
}
/*
* Keep the list of spool directories. Note that we don't whine
* until all spool directories are noted, so that all of the more serious
* problems are noted first. We keep the list sorted by st_dev and
* st_ino, so that the problem spool directories can be noted in
* a single loop.
*/
struct dirlist {
LIST_ENTRY(dirlist) link;
struct stat stab;
char *path;
char *printer;
};
static LIST_HEAD(, dirlist) dirlist;
static int
lessp(const struct dirlist *a, const struct dirlist *b)
{
if (a->stab.st_dev == b->stab.st_dev)
return a->stab.st_ino < b->stab.st_ino;
return a->stab.st_dev < b->stab.st_dev;
}
static int
equal(const struct dirlist *a, const struct dirlist *b)
{
return ((a->stab.st_dev == b->stab.st_dev)
&& (a->stab.st_ino == b->stab.st_ino));
}
static void
note_spool_dir(const struct printer *pp, const struct stat *st)
{
struct dirlist *dp, *dp2, *last;
dp = malloc(sizeof *dp);
if (dp == 0)
err(++problems, "malloc(%lu)", (u_long)sizeof *dp);
dp->stab = *st;
dp->printer = strdup(pp->printer);
if (dp->printer == 0)
err(++problems, "malloc(%lu)", strlen(pp->printer) + 1UL);
dp->path = strdup(pp->spool_dir);
if (dp->path == 0)
err(++problems, "malloc(%lu)", strlen(pp->spool_dir) + 1UL);
last = 0;
LIST_FOREACH(dp2, &dirlist, link) {
if(!lessp(dp, dp2))
break;
last = dp2;
}
if (last) {
LIST_INSERT_AFTER(last, dp, link);
} else {
LIST_INSERT_HEAD(&dirlist, dp, link);
}
}
static void
check_spool_dirs(void)
{
struct dirlist *dp, *dp2;
for (dp = LIST_FIRST(&dirlist); dp; dp = dp2) {
dp2 = LIST_NEXT(dp, link);
if (dp2 != 0 && equal(dp, dp2)) {
++problems;
if (strcmp(dp->path, dp2->path) == 0) {
warnx("%s and %s share the same spool, %s",
dp->printer, dp2->printer, dp->path);
} else {
warnx("%s (%s) and %s (%s) are the same "
"directory", dp->path, dp->printer,
dp2->path, dp2->printer);
}
continue;
}
/* Should probably check owners and modes here. */
}
}
#ifndef SPOOL_DIR_MODE
#define SPOOL_DIR_MODE (S_IRUSR | S_IWUSR | S_IXUSR \
| S_IRGRP | S_IXGRP | S_IROTH | S_IXOTH)
#endif
static void
make_spool_dir(const struct printer *pp)
{
char *sd = pp->spool_dir;
struct group *gr;
struct stat stab;
if (mkdir(sd, S_IRUSR | S_IXUSR) < 0) {
problems++;
warn("%s: mkdir %s", pp->printer, sd);
return;
}
gr = getgrnam("daemon");
if (gr == 0)
errx(++problems, "cannot locate daemon group");
if (chown(sd, pp->daemon_user, gr->gr_gid) < 0) {
++problems;
warn("%s: cannot change ownership to %ld:%ld", sd,
(long)pp->daemon_user, (long)gr->gr_gid);
return;
}
if (chmod(sd, SPOOL_DIR_MODE) < 0) {
++problems;
warn("%s: cannot change mode to %lo", sd, (long)SPOOL_DIR_MODE);
return;
}
if (stat(sd, &stab) < 0)
err(++problems, "stat: %s", sd);
note_spool_dir(pp, &stab);
}
static void
usage(void)
{
fprintf(stderr, "usage:\n\tchkprintcap [-dv] [-f printcapfile]\n");
exit(1);
}
|