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