common.c revision 1.26 1 1.26 itojun /* $NetBSD: common.c,v 1.26 2003/10/16 06:30:11 itojun Exp $ */
2 1.8 jtc
3 1.4 cgd /*
4 1.5 cgd * Copyright (c) 1983, 1993
5 1.5 cgd * The Regents of the University of California. All rights reserved.
6 1.4 cgd * (c) UNIX System Laboratories, Inc.
7 1.4 cgd * All or some portions of this file are derived from material licensed
8 1.4 cgd * to the University of California by American Telephone and Telegraph
9 1.4 cgd * Co. or Unix System Laboratories, Inc. and are reproduced herein with
10 1.4 cgd * the permission of UNIX System Laboratories, Inc.
11 1.4 cgd *
12 1.4 cgd * Redistribution and use in source and binary forms, with or without
13 1.4 cgd * modification, are permitted provided that the following conditions
14 1.4 cgd * are met:
15 1.4 cgd * 1. Redistributions of source code must retain the above copyright
16 1.4 cgd * notice, this list of conditions and the following disclaimer.
17 1.4 cgd * 2. Redistributions in binary form must reproduce the above copyright
18 1.4 cgd * notice, this list of conditions and the following disclaimer in the
19 1.4 cgd * documentation and/or other materials provided with the distribution.
20 1.25 agc * 3. Neither the name of the University nor the names of its contributors
21 1.4 cgd * may be used to endorse or promote products derived from this software
22 1.4 cgd * without specific prior written permission.
23 1.4 cgd *
24 1.4 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 1.4 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 1.4 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 1.4 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 1.4 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 1.4 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 1.4 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 1.4 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 1.4 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 1.4 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 1.4 cgd * SUCH DAMAGE.
35 1.4 cgd */
36 1.4 cgd
37 1.11 mrg #include <sys/cdefs.h>
38 1.4 cgd #ifndef lint
39 1.11 mrg #if 0
40 1.10 mrg static char sccsid[] = "@(#)common.c 8.5 (Berkeley) 4/28/95";
41 1.11 mrg #else
42 1.26 itojun __RCSID("$NetBSD: common.c,v 1.26 2003/10/16 06:30:11 itojun Exp $");
43 1.11 mrg #endif
44 1.4 cgd #endif /* not lint */
45 1.4 cgd
46 1.5 cgd #include <sys/param.h>
47 1.5 cgd #include <sys/stat.h>
48 1.10 mrg #include <sys/time.h>
49 1.5 cgd
50 1.5 cgd #include <sys/socket.h>
51 1.5 cgd #include <netinet/in.h>
52 1.11 mrg #include <arpa/inet.h>
53 1.5 cgd #include <netdb.h>
54 1.5 cgd
55 1.5 cgd #include <dirent.h>
56 1.5 cgd #include <errno.h>
57 1.5 cgd #include <unistd.h>
58 1.5 cgd #include <stdlib.h>
59 1.5 cgd #include <stdio.h>
60 1.5 cgd #include <string.h>
61 1.21 itojun #include <ifaddrs.h>
62 1.5 cgd #include "lp.h"
63 1.5 cgd #include "pathnames.h"
64 1.5 cgd
65 1.4 cgd /*
66 1.4 cgd * Routines and data common to all the line printer functions.
67 1.4 cgd */
68 1.4 cgd
69 1.5 cgd char *AF; /* accounting file */
70 1.5 cgd long BR; /* baud rate if lp is a tty */
71 1.5 cgd char *CF; /* name of cifplot filter (per job) */
72 1.5 cgd char *DF; /* name of tex filter (per job) */
73 1.5 cgd long DU; /* daeomon user-id */
74 1.5 cgd long FC; /* flags to clear if lp is a tty */
75 1.5 cgd char *FF; /* form feed string */
76 1.5 cgd long FS; /* flags to set if lp is a tty */
77 1.5 cgd char *GF; /* name of graph(1G) filter (per job) */
78 1.5 cgd long HL; /* print header last */
79 1.5 cgd char *IF; /* name of input filter (created per job) */
80 1.5 cgd char *LF; /* log file for error messages */
81 1.5 cgd char *LO; /* lock file name */
82 1.4 cgd char *LP; /* line printer device name */
83 1.5 cgd long MC; /* maximum number of copies allowed */
84 1.6 hpeyerl char *MS; /* stty flags to set if lp is a tty */
85 1.5 cgd long MX; /* maximum number of blocks to copy */
86 1.5 cgd char *NF; /* name of ditroff filter (per job) */
87 1.5 cgd char *OF; /* name of output filter (created once) */
88 1.5 cgd char *PF; /* name of vrast filter (per job) */
89 1.5 cgd long PL; /* page length */
90 1.5 cgd long PW; /* page width */
91 1.5 cgd long PX; /* page width in pixels */
92 1.5 cgd long PY; /* page length in pixels */
93 1.5 cgd char *RF; /* name of fortran text filter (per job) */
94 1.5 cgd char *RG; /* resricted group */
95 1.4 cgd char *RM; /* remote machine name */
96 1.4 cgd char *RP; /* remote printer name */
97 1.5 cgd long RS; /* restricted to those with local accounts */
98 1.5 cgd long RW; /* open LP for reading and writing */
99 1.5 cgd long SB; /* short banner instead of normal header */
100 1.5 cgd long SC; /* suppress multiple copies */
101 1.5 cgd char *SD; /* spool directory */
102 1.5 cgd long SF; /* suppress FF on each print job */
103 1.5 cgd long SH; /* suppress header page */
104 1.4 cgd char *ST; /* status file name */
105 1.4 cgd char *TF; /* name of troff filter (per job) */
106 1.5 cgd char *TR; /* trailer string to be output when Q empties */
107 1.4 cgd char *VF; /* name of vplot filter (per job) */
108 1.5 cgd long XC; /* flags to clear for local mode */
109 1.5 cgd long XS; /* flags to set for local mode */
110 1.4 cgd
111 1.4 cgd char line[BUFSIZ];
112 1.10 mrg int remote; /* true if sending files to a remote host */
113 1.5 cgd
114 1.6 hpeyerl extern uid_t uid, euid;
115 1.6 hpeyerl
116 1.23 wiz static int compar(const void *, const void *);
117 1.4 cgd
118 1.4 cgd /*
119 1.10 mrg * Create a TCP connection to host "rhost" at port "rport".
120 1.10 mrg * If rport == 0, then use the printer service port.
121 1.4 cgd * Most of this code comes from rcmd.c.
122 1.4 cgd */
123 1.5 cgd int
124 1.23 wiz getport(char *rhost, int rport)
125 1.4 cgd {
126 1.17 itojun struct addrinfo hints, *res, *r;
127 1.15 mrg u_int timo = 1;
128 1.15 mrg int s, lport = IPPORT_RESERVED - 1;
129 1.17 itojun int error;
130 1.18 itojun int refuse, trial;
131 1.20 itojun char pbuf[NI_MAXSERV];
132 1.4 cgd
133 1.4 cgd /*
134 1.4 cgd * Get the host address and port number to connect to.
135 1.4 cgd */
136 1.4 cgd if (rhost == NULL)
137 1.4 cgd fatal("no remote host to connect to");
138 1.17 itojun memset(&hints, 0, sizeof(hints));
139 1.17 itojun hints.ai_family = PF_UNSPEC;
140 1.17 itojun hints.ai_socktype = SOCK_STREAM;
141 1.20 itojun if (rport)
142 1.20 itojun snprintf(pbuf, sizeof(pbuf), "%d", rport);
143 1.20 itojun else
144 1.20 itojun snprintf(pbuf, sizeof(pbuf), "printer");
145 1.20 itojun error = getaddrinfo(rhost, pbuf, &hints, &res);
146 1.17 itojun if (error)
147 1.17 itojun fatal("printer/tcp: %s", gai_strerror(error));
148 1.4 cgd
149 1.4 cgd /*
150 1.4 cgd * Try connecting to the server.
151 1.4 cgd */
152 1.18 itojun retry:
153 1.17 itojun s = -1;
154 1.18 itojun refuse = trial = 0;
155 1.17 itojun for (r = res; r; r = r->ai_next) {
156 1.18 itojun trial++;
157 1.18 itojun retryport:
158 1.17 itojun seteuid(euid);
159 1.17 itojun s = rresvport_af(&lport, r->ai_family);
160 1.17 itojun seteuid(uid);
161 1.17 itojun if (s < 0)
162 1.17 itojun return(-1);
163 1.17 itojun if (connect(s, r->ai_addr, r->ai_addrlen) < 0) {
164 1.17 itojun error = errno;
165 1.17 itojun (void)close(s);
166 1.17 itojun s = -1;
167 1.17 itojun errno = error;
168 1.17 itojun if (errno == EADDRINUSE) {
169 1.17 itojun lport--;
170 1.18 itojun goto retryport;
171 1.18 itojun } else if (errno == ECONNREFUSED)
172 1.18 itojun refuse++;
173 1.17 itojun continue;
174 1.17 itojun } else
175 1.17 itojun break;
176 1.18 itojun }
177 1.18 itojun if (s < 0 && trial == refuse && timo <= 16) {
178 1.18 itojun sleep(timo);
179 1.18 itojun timo *= 2;
180 1.18 itojun goto retry;
181 1.4 cgd }
182 1.17 itojun if (res)
183 1.17 itojun freeaddrinfo(res);
184 1.4 cgd return(s);
185 1.4 cgd }
186 1.4 cgd
187 1.4 cgd /*
188 1.4 cgd * Getline reads a line from the control file cfp, removes tabs, converts
189 1.4 cgd * new-line to null and leaves it in line.
190 1.4 cgd * Returns 0 at EOF or the number of characters read.
191 1.4 cgd */
192 1.5 cgd int
193 1.23 wiz getline(FILE *cfp)
194 1.4 cgd {
195 1.11 mrg int linel = 0, c;
196 1.11 mrg char *lp = line;
197 1.4 cgd
198 1.11 mrg while ((c = getc(cfp)) != '\n' && linel+1<sizeof(line)) {
199 1.4 cgd if (c == EOF)
200 1.4 cgd return(0);
201 1.4 cgd if (c == '\t') {
202 1.4 cgd do {
203 1.4 cgd *lp++ = ' ';
204 1.4 cgd linel++;
205 1.11 mrg } while ((linel & 07) != 0 && linel+1 < sizeof(line));
206 1.4 cgd continue;
207 1.4 cgd }
208 1.4 cgd *lp++ = c;
209 1.4 cgd linel++;
210 1.4 cgd }
211 1.4 cgd *lp++ = '\0';
212 1.4 cgd return(linel);
213 1.4 cgd }
214 1.4 cgd
215 1.4 cgd /*
216 1.4 cgd * Scan the current directory and make a list of daemon files sorted by
217 1.4 cgd * creation time.
218 1.4 cgd * Return the number of entries and a pointer to the list.
219 1.4 cgd */
220 1.5 cgd int
221 1.23 wiz getq(struct queue **namelist[])
222 1.4 cgd {
223 1.11 mrg struct dirent *d;
224 1.26 itojun struct queue *q, **queue, **nqueue;
225 1.4 cgd struct stat stbuf;
226 1.4 cgd DIR *dirp;
227 1.15 mrg u_int nitems, arraysz;
228 1.4 cgd
229 1.6 hpeyerl seteuid(euid);
230 1.22 wiz dirp = opendir(SD);
231 1.22 wiz seteuid(uid);
232 1.22 wiz if (dirp == NULL)
233 1.4 cgd return(-1);
234 1.4 cgd if (fstat(dirp->dd_fd, &stbuf) < 0)
235 1.4 cgd goto errdone;
236 1.4 cgd
237 1.4 cgd /*
238 1.4 cgd * Estimate the array size by taking the size of the directory file
239 1.4 cgd * and dividing it by a multiple of the minimum size entry.
240 1.4 cgd */
241 1.15 mrg arraysz = (int)(stbuf.st_size / 24);
242 1.4 cgd queue = (struct queue **)malloc(arraysz * sizeof(struct queue *));
243 1.4 cgd if (queue == NULL)
244 1.4 cgd goto errdone;
245 1.4 cgd
246 1.4 cgd nitems = 0;
247 1.4 cgd while ((d = readdir(dirp)) != NULL) {
248 1.4 cgd if (d->d_name[0] != 'c' || d->d_name[1] != 'f')
249 1.4 cgd continue; /* daemon control files only */
250 1.6 hpeyerl seteuid(euid);
251 1.22 wiz if (stat(d->d_name, &stbuf) < 0) {
252 1.22 wiz seteuid(uid);
253 1.4 cgd continue; /* Doesn't exist */
254 1.22 wiz }
255 1.6 hpeyerl seteuid(uid);
256 1.4 cgd q = (struct queue *)malloc(sizeof(time_t)+strlen(d->d_name)+1);
257 1.4 cgd if (q == NULL)
258 1.4 cgd goto errdone;
259 1.4 cgd q->q_time = stbuf.st_mtime;
260 1.9 mrg strcpy(q->q_name, d->d_name); /* XXX: strcpy is safe */
261 1.4 cgd /*
262 1.4 cgd * Check to make sure the array has space left and
263 1.4 cgd * realloc the maximum size.
264 1.4 cgd */
265 1.4 cgd if (++nitems > arraysz) {
266 1.26 itojun nqueue = (struct queue **)realloc(queue,
267 1.26 itojun arraysz * 2 * sizeof(struct queue *));
268 1.26 itojun if (nqueue == NULL)
269 1.26 itojun goto errdone;
270 1.26 itojun queue = nqueue;
271 1.10 mrg arraysz *= 2;
272 1.4 cgd }
273 1.4 cgd queue[nitems-1] = q;
274 1.4 cgd }
275 1.4 cgd closedir(dirp);
276 1.4 cgd if (nitems)
277 1.4 cgd qsort(queue, nitems, sizeof(struct queue *), compar);
278 1.4 cgd *namelist = queue;
279 1.4 cgd return(nitems);
280 1.4 cgd
281 1.4 cgd errdone:
282 1.4 cgd closedir(dirp);
283 1.4 cgd return(-1);
284 1.4 cgd }
285 1.4 cgd
286 1.4 cgd /*
287 1.4 cgd * Compare modification times.
288 1.4 cgd */
289 1.5 cgd static int
290 1.23 wiz compar(const void *p1, const void *p2)
291 1.4 cgd {
292 1.5 cgd if ((*(struct queue **)p1)->q_time < (*(struct queue **)p2)->q_time)
293 1.4 cgd return(-1);
294 1.5 cgd if ((*(struct queue **)p1)->q_time > (*(struct queue **)p2)->q_time)
295 1.4 cgd return(1);
296 1.4 cgd return(0);
297 1.4 cgd }
298 1.4 cgd
299 1.4 cgd /*
300 1.4 cgd * Figure out whether the local machine is the same
301 1.4 cgd * as the remote machine (RM) entry (if it exists).
302 1.4 cgd */
303 1.4 cgd char *
304 1.23 wiz checkremote(void)
305 1.4 cgd {
306 1.21 itojun char lname[NI_MAXHOST], rname[NI_MAXHOST];
307 1.21 itojun struct addrinfo hints, *res, *res0;
308 1.4 cgd static char errbuf[128];
309 1.17 itojun int error;
310 1.21 itojun struct ifaddrs *ifap, *ifa;
311 1.21 itojun #ifdef NI_WITHSCOPEID
312 1.21 itojun const int niflags = NI_NUMERICHOST | NI_WITHSCOPEID;
313 1.21 itojun #else
314 1.21 itojun const int niflags = NI_NUMERICHOST;
315 1.21 itojun #endif
316 1.21 itojun #ifdef __KAME__
317 1.21 itojun struct sockaddr_in6 sin6;
318 1.21 itojun struct sockaddr_in6 *sin6p;
319 1.21 itojun #endif
320 1.21 itojun
321 1.21 itojun remote = 0; /* assume printer is local on failure */
322 1.4 cgd
323 1.21 itojun if (RM == NULL)
324 1.21 itojun return NULL;
325 1.21 itojun
326 1.21 itojun /* get the local interface addresses */
327 1.21 itojun if (getifaddrs(&ifap) < 0) {
328 1.21 itojun (void)snprintf(errbuf, sizeof(errbuf),
329 1.21 itojun "unable to get local interface address: %s",
330 1.21 itojun strerror(errno));
331 1.21 itojun return errbuf;
332 1.21 itojun }
333 1.4 cgd
334 1.21 itojun /* get the remote host addresses (RM) */
335 1.21 itojun memset(&hints, 0, sizeof(hints));
336 1.21 itojun hints.ai_flags = AI_CANONNAME;
337 1.21 itojun hints.ai_family = PF_UNSPEC;
338 1.21 itojun hints.ai_socktype = SOCK_STREAM;
339 1.21 itojun res = NULL;
340 1.21 itojun error = getaddrinfo(RM, NULL, &hints, &res0);
341 1.21 itojun if (error) {
342 1.21 itojun (void)snprintf(errbuf, sizeof(errbuf),
343 1.21 itojun "unable to resolve remote machine %s: %s",
344 1.21 itojun RM, gai_strerror(error));
345 1.21 itojun freeifaddrs(ifap);
346 1.21 itojun return errbuf;
347 1.21 itojun }
348 1.4 cgd
349 1.21 itojun remote = 1; /* assume printer is remote */
350 1.17 itojun
351 1.21 itojun for (res = res0; res; res = res->ai_next) {
352 1.21 itojun if (getnameinfo(res->ai_addr, res->ai_addrlen,
353 1.21 itojun rname, sizeof(rname), NULL, 0, niflags) != 0)
354 1.21 itojun continue;
355 1.21 itojun for (ifa = ifap; ifa; ifa = ifa->ifa_next) {
356 1.21 itojun #ifdef __KAME__
357 1.21 itojun sin6p = (struct sockaddr_in6 *)ifa->ifa_addr;
358 1.21 itojun if (ifa->ifa_addr->sa_family == AF_INET6 &&
359 1.21 itojun ifa->ifa_addr->sa_len == sizeof(sin6) &&
360 1.21 itojun IN6_IS_ADDR_LINKLOCAL(&sin6p->sin6_addr) &&
361 1.21 itojun *(u_int16_t *)&sin6p->sin6_addr.s6_addr[2]) {
362 1.21 itojun /* kame scopeid hack */
363 1.21 itojun memcpy(&sin6, ifa->ifa_addr, sizeof(sin6));
364 1.21 itojun sin6.sin6_scope_id =
365 1.21 itojun ntohs(*(u_int16_t *)&sin6p->sin6_addr.s6_addr[2]);
366 1.21 itojun sin6.sin6_addr.s6_addr[2] = 0;
367 1.21 itojun sin6.sin6_addr.s6_addr[3] = 0;
368 1.21 itojun if (getnameinfo((struct sockaddr *)&sin6,
369 1.21 itojun sin6.sin6_len, lname, sizeof(lname),
370 1.21 itojun NULL, 0, niflags) != 0)
371 1.21 itojun continue;
372 1.21 itojun } else
373 1.21 itojun #endif
374 1.21 itojun if (getnameinfo(ifa->ifa_addr, ifa->ifa_addr->sa_len,
375 1.21 itojun lname, sizeof(lname), NULL, 0, niflags) != 0)
376 1.21 itojun continue;
377 1.21 itojun
378 1.21 itojun if (strcmp(rname, lname) == 0) {
379 1.21 itojun remote = 0;
380 1.21 itojun goto done;
381 1.21 itojun }
382 1.21 itojun }
383 1.4 cgd }
384 1.21 itojun done:
385 1.21 itojun freeaddrinfo(res0);
386 1.21 itojun freeifaddrs(ifap);
387 1.10 mrg return NULL;
388 1.10 mrg }
389 1.10 mrg
390 1.10 mrg /* sleep n milliseconds */
391 1.10 mrg void
392 1.23 wiz delay(int n)
393 1.10 mrg {
394 1.24 mycroft struct timespec tdelay;
395 1.10 mrg
396 1.10 mrg if (n <= 0 || n > 10000)
397 1.10 mrg fatal("unreasonable delay period (%d)", n);
398 1.10 mrg tdelay.tv_sec = n / 1000;
399 1.24 mycroft tdelay.tv_nsec = (n % 1000) * 1000000;
400 1.24 mycroft nanosleep(&tdelay, NULL);
401 1.4 cgd }
402