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
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
|
/* $OpenBSD: common.c,v 1.18 2002/06/08 01:53:43 millert Exp $ */
/* $NetBSD: common.c,v 1.21 2000/08/09 14:28:50 itojun Exp $ */
/*
* Copyright (c) 1983, 1993
* The Regents of the University of California. All rights reserved.
* (c) UNIX System Laboratories, Inc.
* All or some portions of this file are derived from material licensed
* to the University of California by American Telephone and Telegraph
* Co. or Unix System Laboratories, Inc. and are reproduced herein with
* the permission of UNIX System Laboratories, Inc.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS 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.
*/
#ifndef lint
#if 0
static const char sccsid[] = "@(#)common.c 8.5 (Berkeley) 4/28/95";
#else
static const char rcsid[] = "$OpenBSD: common.c,v 1.18 2002/06/08 01:53:43 millert Exp $";
#endif
#endif /* not lint */
#include <sys/param.h>
#include <sys/stat.h>
#include <sys/time.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <netdb.h>
#include <dirent.h>
#include <errno.h>
#include <fcntl.h>
#include <unistd.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <signal.h>
#include <stdarg.h>
#include <ifaddrs.h>
#include "lp.h"
#include "pathnames.h"
/*
* Routines and data common to all the line printer functions.
*/
char *AF; /* accounting file */
long BR; /* baud rate if lp is a tty */
char *CF; /* name of cifplot filter (per job) */
char *DF; /* name of tex filter (per job) */
long DU; /* daeomon user-id */
long FC; /* flags to clear if lp is a tty */
char *FF; /* form feed string */
long FS; /* flags to set if lp is a tty */
char *GF; /* name of graph(1G) filter (per job) */
long HL; /* print header last */
char *IF; /* name of input filter (created per job) */
char *LF; /* log file for error messages */
char *LO; /* lock file name */
char *LP; /* line printer device name */
long MC; /* maximum number of copies allowed */
char *MS; /* stty flags to set if lp is a tty */
long MX; /* maximum number of blocks to copy */
char *NF; /* name of ditroff filter (per job) */
char *OF; /* name of output filter (created once) */
char *PF; /* name of vrast filter (per job) */
long PL; /* page length */
long PW; /* page width */
long PX; /* page width in pixels */
long PY; /* page length in pixels */
char *RF; /* name of fortran text filter (per job) */
char *RG; /* resricted group */
char *RM; /* remote machine name */
char *RP; /* remote printer name */
long RS; /* restricted to those with local accounts */
long RW; /* open LP for reading and writing */
long SB; /* short banner instead of normal header */
long SC; /* suppress multiple copies */
char *SD; /* spool directory */
long SF; /* suppress FF on each print job */
long SH; /* suppress header page */
char *ST; /* status file name */
char *TF; /* name of troff filter (per job) */
char *TR; /* trailer string to be output when Q empties */
char *VF; /* name of vplot filter (per job) */
long XC; /* flags to clear for local mode */
long XS; /* flags to set for local mode */
char line[BUFSIZ];
int remote; /* true if sending files to a remote host */
static int compar(const void *, const void *);
/*
* Create a TCP connection to host "rhost" at port "rport".
* If rport == 0, then use the printer service port.
* Most of this code comes from rcmd.c.
*/
int
getport(rhost, rport)
char *rhost;
int rport;
{
struct addrinfo hints, *res, *r;
u_int timo = 1;
int s, lport = IPPORT_RESERVED - 1;
int error;
int refuse, trial;
char pbuf[NI_MAXSERV];
/*
* Get the host address and port number to connect to.
*/
if (rhost == NULL)
fatal("no remote host to connect to");
memset(&hints, 0, sizeof(hints));
hints.ai_family = PF_UNSPEC;
hints.ai_socktype = SOCK_STREAM;
if (rport)
snprintf(pbuf, sizeof(pbuf), "%d", rport);
else
snprintf(pbuf, sizeof(pbuf), "printer");
siginterrupt(SIGINT, 1);
error = getaddrinfo(rhost, pbuf, &hints, &res);
siginterrupt(SIGINT, 0);
if (error)
fatal("printer/tcp: %s", gai_strerror(error));
/*
* Try connecting to the server.
*/
retry:
s = -1;
refuse = trial = 0;
for (r = res; r; r = r->ai_next) {
trial++;
retryport:
PRIV_START;
s = rresvport_af(&lport, r->ai_family);
PRIV_END;
if (s < 0) {
/* fall back to non-privileged port */
if (errno != EACCES ||
(s = socket(r->ai_family, SOCK_STREAM, 0)) < 0)
return(-1);
}
siginterrupt(SIGINT, 1);
if (connect(s, r->ai_addr, r->ai_addrlen) < 0) {
error = errno;
siginterrupt(SIGINT, 0);
(void)close(s);
s = -1;
errno = error;
if (errno == EADDRINUSE) {
lport--;
goto retryport;
} else if (errno == ECONNREFUSED)
refuse++;
continue;
} else {
siginterrupt(SIGINT, 0);
break;
}
}
if (s < 0 && trial == refuse && timo <= 16) {
sleep(timo);
timo *= 2;
goto retry;
}
if (res)
freeaddrinfo(res);
/* Don't worry if we get an error from setsockopt(). */
trial = 1;
setsockopt(s, SOL_SOCKET, SO_KEEPALIVE, &trial, sizeof(trial));
return(s);
}
/*
* Getline reads a line from the control file cfp, removes tabs, converts
* new-line to null and leaves it in line.
* Returns 0 at EOF or the number of characters read.
*/
int
getline(cfp)
FILE *cfp;
{
int linel = 0;
char *lp = line;
int c;
while ((c = getc(cfp)) != '\n' && linel+1<sizeof(line)) {
if (c == EOF)
return(0);
if (c == '\t') {
do {
*lp++ = ' ';
linel++;
} while ((linel & 07) != 0 && linel+1 < sizeof(line));
continue;
}
*lp++ = c;
linel++;
}
*lp++ = '\0';
return(linel);
}
/*
* Scan the current directory and make a list of daemon files sorted by
* creation time.
* Return the number of entries and a pointer to the list.
*/
int
getq(namelist)
struct queue *(*namelist[]);
{
struct dirent *d;
struct queue *q, **queue;
size_t nitems, arraysz;
struct stat stbuf;
DIR *dirp;
PRIV_START;
dirp = opendir(SD);
PRIV_END;
if (dirp == NULL)
return(-1);
if (fstat(dirp->dd_fd, &stbuf) < 0)
goto errdone;
/*
* Estimate the array size by taking the size of the directory file
* and dividing it by a multiple of the minimum size entry.
*/
arraysz = (stbuf.st_size / 24);
queue = (struct queue **)malloc(arraysz * sizeof(struct queue *));
if (queue == NULL)
goto errdone;
nitems = 0;
while ((d = readdir(dirp)) != NULL) {
if (d->d_name[0] != 'c' || d->d_name[1] != 'f')
continue; /* daemon control files only */
PRIV_START;
if (stat(d->d_name, &stbuf) < 0) {
PRIV_END;
continue; /* Doesn't exist */
}
PRIV_END;
q = (struct queue *)malloc(sizeof(time_t)+strlen(d->d_name)+1);
if (q == NULL)
goto errdone;
q->q_time = stbuf.st_mtime;
strcpy(q->q_name, d->d_name); /* safe */
/*
* Check to make sure the array has space left and
* realloc the maximum size.
*/
if (++nitems > arraysz) {
arraysz *= 2;
queue = (struct queue **)realloc(queue,
arraysz * sizeof(struct queue *));
if (queue == NULL)
goto errdone;
}
queue[nitems-1] = q;
}
closedir(dirp);
if (nitems)
qsort(queue, nitems, sizeof(struct queue *), compar);
*namelist = queue;
return(nitems);
errdone:
closedir(dirp);
return(-1);
}
/*
* Compare modification times.
*/
static int
compar(p1, p2)
const void *p1, *p2;
{
if ((*(struct queue **)p1)->q_time < (*(struct queue **)p2)->q_time)
return(-1);
if ((*(struct queue **)p1)->q_time > (*(struct queue **)p2)->q_time)
return(1);
return(0);
}
/*
* Figure out whether the local machine is the same
* as the remote machine (RM) entry (if it exists).
*/
char *
checkremote(void)
{
char lname[NI_MAXHOST], rname[NI_MAXHOST];
struct addrinfo hints, *res, *res0;
static char errbuf[128];
int error;
struct ifaddrs *ifap, *ifa;
#ifdef NI_WITHSCOPEID
const int niflags = NI_NUMERICHOST | NI_WITHSCOPEID;
#else
const int niflags = NI_NUMERICHOST;
#endif
#ifdef __KAME__
struct sockaddr_in6 sin6;
struct sockaddr_in6 *sin6p;
#endif
remote = 0; /* assume printer is local on failure */
if (RM == NULL || *RM == '\0')
return NULL;
/* XXX */
remote = 1;
return NULL; /* XXX -- for local testing only! */
/* XXX */
/* get the local interface addresses */
siginterrupt(SIGINT, 1);
if (getifaddrs(&ifap) < 0) {
(void)snprintf(errbuf, sizeof(errbuf),
"unable to get local interface address: %s",
strerror(errno));
siginterrupt(SIGINT, 0);
return errbuf;
}
siginterrupt(SIGINT, 0);
/* get the remote host addresses (RM) */
memset(&hints, 0, sizeof(hints));
hints.ai_flags = AI_CANONNAME;
hints.ai_family = PF_UNSPEC;
hints.ai_socktype = SOCK_STREAM;
res = NULL;
siginterrupt(SIGINT, 1);
error = getaddrinfo(RM, NULL, &hints, &res0);
siginterrupt(SIGINT, 0);
if (error) {
(void)snprintf(errbuf, sizeof(errbuf),
"unable to resolve remote machine %s: %s",
RM, gai_strerror(error));
freeifaddrs(ifap);
return errbuf;
}
remote = 1; /* assume printer is remote */
for (res = res0; res; res = res->ai_next) {
siginterrupt(SIGINT, 1);
error = getnameinfo(res->ai_addr, res->ai_addrlen,
rname, sizeof(rname), NULL, 0, niflags);
siginterrupt(SIGINT, 0);
if (error != 0)
continue;
for (ifa = ifap; ifa; ifa = ifa->ifa_next) {
#ifdef __KAME__
sin6p = (struct sockaddr_in6 *)ifa->ifa_addr;
if (ifa->ifa_addr->sa_family == AF_INET6 &&
ifa->ifa_addr->sa_len == sizeof(sin6) &&
IN6_IS_ADDR_LINKLOCAL(&sin6p->sin6_addr) &&
*(u_int16_t *)&sin6p->sin6_addr.s6_addr[2]) {
/* kame scopeid hack */
memcpy(&sin6, ifa->ifa_addr, sizeof(sin6));
sin6.sin6_scope_id =
ntohs(*(u_int16_t *)&sin6p->sin6_addr.s6_addr[2]);
sin6.sin6_addr.s6_addr[2] = 0;
sin6.sin6_addr.s6_addr[3] = 0;
siginterrupt(SIGINT, 1);
error = getnameinfo((struct sockaddr *)&sin6,
sin6.sin6_len, lname, sizeof(lname),
NULL, 0, niflags);
siginterrupt(SIGINT, 0);
if (error != 0)
continue;
} else
#endif
siginterrupt(SIGINT, 1);
error = getnameinfo(ifa->ifa_addr,
ifa->ifa_addr->sa_len, lname, sizeof(lname), NULL,
0, niflags);
siginterrupt(SIGINT, 0);
if (error != 0)
continue;
if (strcmp(rname, lname) == 0) {
remote = 0;
goto done;
}
}
}
done:
freeaddrinfo(res0);
freeifaddrs(ifap);
return NULL;
}
/* sleep n milliseconds */
void
delay(int n)
{
struct timeval tdelay;
if (n <= 0 || n > 10000)
fatal("unreasonable delay period (%d)", n);
tdelay.tv_sec = n / 1000;
tdelay.tv_usec = n * 1000 % 1000000;
(void) select(0, (fd_set *)0, (fd_set *)0, (fd_set *)0, &tdelay);
}
void
fatal(const char *msg, ...)
{
extern char *__progname;
va_list ap;
va_start(ap, msg);
if (from != host)
(void)printf("%s: ", host);
(void)printf("%s: ", __progname);
if (printer)
(void)printf("%s: ", printer);
(void)vprintf(msg, ap);
va_end(ap);
(void)putchar('\n');
exit(1);
}
int
safe_open(const char *path, int flags, mode_t mode)
{
int fd, serrno;
struct stat stbuf;
if ((fd = open(path, flags|O_NONBLOCK, mode)) < 0 ||
fstat(fd, &stbuf) < 0) {
if (fd >= 0) {
serrno = errno;
close(fd);
errno = serrno;
}
return (-1);
}
if (!S_ISREG(stbuf.st_mode)) {
close(fd);
errno = EACCES;
return (-1);
}
if (mode)
(void)fchmod(fd, mode);
return (fd);
}
|