spec.c revision 1.63
1 /* $NetBSD: spec.c,v 1.63 2006/10/08 18:09:47 martin Exp $ */ 2 3 /*- 4 * Copyright (c) 1989, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. Neither the name of the University nor the names of its contributors 16 * may be used to endorse or promote products derived from this software 17 * without specific prior written permission. 18 * 19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29 * SUCH DAMAGE. 30 */ 31 32 /*- 33 * Copyright (c) 2001-2004 The NetBSD Foundation, Inc. 34 * All rights reserved. 35 * 36 * This code is derived from software contributed to The NetBSD Foundation 37 * by Luke Mewburn of Wasabi Systems. 38 * 39 * Redistribution and use in source and binary forms, with or without 40 * modification, are permitted provided that the following conditions 41 * are met: 42 * 1. Redistributions of source code must retain the above copyright 43 * notice, this list of conditions and the following disclaimer. 44 * 2. Redistributions in binary form must reproduce the above copyright 45 * notice, this list of conditions and the following disclaimer in the 46 * documentation and/or other materials provided with the distribution. 47 * 3. All advertising materials mentioning features or use of this software 48 * must display the following acknowledgement: 49 * This product includes software developed by the NetBSD 50 * Foundation, Inc. and its contributors. 51 * 4. Neither the name of The NetBSD Foundation nor the names of its 52 * contributors may be used to endorse or promote products derived 53 * from this software without specific prior written permission. 54 * 55 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 56 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 57 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 58 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 59 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 60 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 61 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 62 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 63 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 64 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 65 * POSSIBILITY OF SUCH DAMAGE. 66 */ 67 68 #if HAVE_NBTOOL_CONFIG_H 69 #include "nbtool_config.h" 70 #endif 71 72 #include <sys/cdefs.h> 73 #if defined(__RCSID) && !defined(lint) 74 #if 0 75 static char sccsid[] = "@(#)spec.c 8.2 (Berkeley) 4/28/95"; 76 #else 77 __RCSID("$NetBSD: spec.c,v 1.63 2006/10/08 18:09:47 martin Exp $"); 78 #endif 79 #endif /* not lint */ 80 81 #include <sys/param.h> 82 #include <sys/stat.h> 83 84 #include <ctype.h> 85 #include <errno.h> 86 #include <grp.h> 87 #include <pwd.h> 88 #include <stdio.h> 89 #include <stdlib.h> 90 #include <string.h> 91 #include <unistd.h> 92 #include <vis.h> 93 #include <util.h> 94 95 #include "extern.h" 96 #include "pack_dev.h" 97 98 size_t mtree_lineno; /* Current spec line number */ 99 int mtree_Mflag; /* Merge duplicate entries */ 100 int mtree_Wflag; /* Don't "whack" permissions */ 101 102 static dev_t parsedev(char *); 103 static void replacenode(NODE *, NODE *); 104 static void set(char *, NODE *); 105 static void unset(char *, NODE *); 106 107 #define REPLACEPTR(x,v) do { if ((x)) free((x)); (x) = (v); } while (0) 108 109 NODE * 110 spec(FILE *fp) 111 { 112 NODE *centry, *last, *pathparent, *cur; 113 char *p, *e, *next; 114 NODE ginfo, *root; 115 char *buf, *tname, *ntname; 116 size_t tnamelen, plen; 117 118 root = NULL; 119 centry = last = NULL; 120 tname = NULL; 121 tnamelen = 0; 122 memset(&ginfo, 0, sizeof(ginfo)); 123 for (mtree_lineno = 0; 124 (buf = fparseln(fp, NULL, &mtree_lineno, NULL, 125 FPARSELN_UNESCCOMM)); 126 free(buf)) { 127 /* Skip leading whitespace. */ 128 for (p = buf; *p && isspace((unsigned char)*p); ++p) 129 continue; 130 131 /* If nothing but whitespace, continue. */ 132 if (!*p) 133 continue; 134 135 #ifdef DEBUG 136 fprintf(stderr, "line %lu: {%s}\n", 137 (u_long)mtree_lineno, p); 138 #endif 139 /* Grab file name, "$", "set", or "unset". */ 140 next = buf; 141 while ((p = strsep(&next, " \t")) != NULL && *p == '\0') 142 continue; 143 if (p == NULL) 144 mtree_err("missing field"); 145 146 if (p[0] == '/') { 147 if (strcmp(p + 1, "set") == 0) 148 set(next, &ginfo); 149 else if (strcmp(p + 1, "unset") == 0) 150 unset(next, &ginfo); 151 else 152 mtree_err("invalid specification `%s'", p); 153 continue; 154 } 155 156 if (strcmp(p, "..") == 0) { 157 /* Don't go up, if haven't gone down. */ 158 if (root == NULL) 159 goto noparent; 160 if (last->type != F_DIR || last->flags & F_DONE) { 161 if (last == root) 162 goto noparent; 163 last = last->parent; 164 } 165 last->flags |= F_DONE; 166 continue; 167 168 noparent: mtree_err("no parent node"); 169 } 170 171 plen = strlen(p) + 1; 172 if (plen > tnamelen) { 173 if ((ntname = realloc(tname, plen)) == NULL) 174 mtree_err("realloc: %s", strerror(errno)); 175 tname = ntname; 176 tnamelen = plen; 177 } 178 if (strunvis(tname, p) == -1) 179 mtree_err("strunvis failed on `%s'", p); 180 p = tname; 181 182 pathparent = NULL; 183 if (strchr(p, '/') != NULL) { 184 cur = root; 185 for (; (e = strchr(p, '/')) != NULL; p = e+1) { 186 if (p == e) 187 continue; /* handle // */ 188 *e = '\0'; 189 if (strcmp(p, ".") != 0) { 190 while (cur && 191 strcmp(cur->name, p) != 0) { 192 cur = cur->next; 193 } 194 } 195 if (cur == NULL || cur->type != F_DIR) { 196 mtree_err("%s: %s", tname, 197 strerror(ENOENT)); 198 } 199 *e = '/'; 200 pathparent = cur; 201 cur = cur->child; 202 } 203 if (*p == '\0') 204 mtree_err("%s: empty leaf element", tname); 205 } 206 207 if ((centry = calloc(1, sizeof(NODE) + strlen(p))) == NULL) 208 mtree_err("%s", strerror(errno)); 209 *centry = ginfo; 210 centry->lineno = mtree_lineno; 211 strcpy(centry->name, p); 212 #define MAGIC "?*[" 213 if (strpbrk(p, MAGIC)) 214 centry->flags |= F_MAGIC; 215 set(next, centry); 216 217 if (root == NULL) { 218 /* 219 * empty tree 220 */ 221 if (strcmp(centry->name, ".") != 0 || 222 centry->type != F_DIR) 223 mtree_err( 224 "root node must be the directory `.'"); 225 last = root = centry; 226 root->parent = root; 227 } else if (pathparent != NULL) { 228 /* 229 * full path entry 230 */ 231 centry->parent = pathparent; 232 cur = pathparent->child; 233 if (cur == NULL) { 234 pathparent->child = centry; 235 last = centry; 236 } else { 237 for (; cur != NULL; cur = cur->next) { 238 if (strcmp(cur->name, centry->name) 239 == 0) { 240 /* existing entry; replace */ 241 replacenode(cur, centry); 242 break; 243 } 244 if (cur->next == NULL) { 245 /* last entry; add new */ 246 cur->next = centry; 247 centry->prev = cur; 248 break; 249 } 250 } 251 last = cur; 252 while (last->next != NULL) 253 last = last->next; 254 } 255 } else if (strcmp(centry->name, ".") == 0) { 256 /* 257 * duplicate "." entry; always replace 258 */ 259 replacenode(root, centry); 260 } else if (last->type == F_DIR && !(last->flags & F_DONE)) { 261 /* 262 * new relative child 263 * (no duplicate check) 264 */ 265 centry->parent = last; 266 last = last->child = centry; 267 } else { 268 /* 269 * relative entry, up one directory 270 * (no duplicate check) 271 */ 272 centry->parent = last->parent; 273 centry->prev = last; 274 last = last->next = centry; 275 } 276 } 277 return (root); 278 } 279 280 void 281 free_nodes(NODE *root) 282 { 283 NODE *cur, *next; 284 285 if (root == NULL) 286 return; 287 288 next = NULL; 289 for (cur = root; cur != NULL; cur = next) { 290 next = cur->next; 291 free_nodes(cur->child); 292 REPLACEPTR(cur->slink, NULL); 293 REPLACEPTR(cur->md5digest, NULL); 294 REPLACEPTR(cur->rmd160digest, NULL); 295 REPLACEPTR(cur->sha1digest, NULL); 296 REPLACEPTR(cur->sha256digest, NULL); 297 REPLACEPTR(cur->sha384digest, NULL); 298 REPLACEPTR(cur->sha512digest, NULL); 299 REPLACEPTR(cur->tags, NULL); 300 REPLACEPTR(cur, NULL); 301 } 302 } 303 304 /* 305 * dump_nodes -- 306 * dump the NODEs from `cur', based in the directory `dir'. 307 * if pathlast is none zero, print the path last, otherwise print 308 * it first. 309 */ 310 void 311 dump_nodes(const char *dir, NODE *root, int pathlast) 312 { 313 NODE *cur; 314 char path[MAXPATHLEN]; 315 const char *name; 316 317 for (cur = root; cur != NULL; cur = cur->next) { 318 if (cur->type != F_DIR && !matchtags(cur)) 319 continue; 320 321 if (snprintf(path, sizeof(path), "%s%s%s", 322 dir, *dir ? "/" : "", cur->name) 323 >= sizeof(path)) 324 mtree_err("Pathname too long."); 325 326 if (!pathlast) 327 printf("%s ", vispath(path)); 328 329 #define MATCHFLAG(f) ((keys & (f)) && (cur->flags & (f))) 330 if (MATCHFLAG(F_TYPE)) 331 printf("type=%s ", nodetype(cur->type)); 332 if (MATCHFLAG(F_UID | F_UNAME)) { 333 if (keys & F_UNAME && 334 (name = user_from_uid(cur->st_uid, 1)) != NULL) 335 printf("uname=%s ", name); 336 else 337 printf("uid=%u ", cur->st_uid); 338 } 339 if (MATCHFLAG(F_GID | F_GNAME)) { 340 if (keys & F_GNAME && 341 (name = group_from_gid(cur->st_gid, 1)) != NULL) 342 printf("gname=%s ", name); 343 else 344 printf("gid=%u ", cur->st_gid); 345 } 346 if (MATCHFLAG(F_MODE)) 347 printf("mode=%#o ", cur->st_mode); 348 if (MATCHFLAG(F_DEV) && 349 (cur->type == F_BLOCK || cur->type == F_CHAR)) 350 printf("device=%#x ", cur->st_rdev); 351 if (MATCHFLAG(F_NLINK)) 352 printf("nlink=%d ", cur->st_nlink); 353 if (MATCHFLAG(F_SLINK)) 354 printf("link=%s ", vispath(cur->slink)); 355 if (MATCHFLAG(F_SIZE)) 356 printf("size=%lld ", (long long)cur->st_size); 357 if (MATCHFLAG(F_TIME)) 358 printf("time=%ld.%ld ", (long)cur->st_mtimespec.tv_sec, 359 cur->st_mtimespec.tv_nsec); 360 if (MATCHFLAG(F_CKSUM)) 361 printf("cksum=%lu ", cur->cksum); 362 if (MATCHFLAG(F_MD5)) 363 printf("md5=%s ", cur->md5digest); 364 if (MATCHFLAG(F_RMD160)) 365 printf("rmd160=%s ", cur->rmd160digest); 366 if (MATCHFLAG(F_SHA1)) 367 printf("sha1=%s ", cur->sha1digest); 368 if (MATCHFLAG(F_SHA256)) 369 printf("sha256=%s ", cur->sha256digest); 370 if (MATCHFLAG(F_SHA384)) 371 printf("sha384=%s ", cur->sha384digest); 372 if (MATCHFLAG(F_SHA512)) 373 printf("sha512=%s ", cur->sha512digest); 374 if (MATCHFLAG(F_FLAGS)) 375 printf("flags=%s ", 376 flags_to_string(cur->st_flags, "none")); 377 if (MATCHFLAG(F_IGN)) 378 printf("ignore "); 379 if (MATCHFLAG(F_OPT)) 380 printf("optional "); 381 if (MATCHFLAG(F_TAGS)) 382 printf("tags=%s ", cur->tags); 383 puts(pathlast ? vispath(path) : ""); 384 385 if (cur->child) 386 dump_nodes(path, cur->child, pathlast); 387 } 388 } 389 390 /* 391 * vispath -- 392 * strsvis(3) encodes path, which must not be longer than MAXPATHLEN 393 * characters long, and returns a pointer to a static buffer containing 394 * the result. 395 */ 396 char * 397 vispath(const char *path) 398 { 399 const char extra[] = { ' ', '\t', '\n', '\\', '#', '\0' }; 400 static char pathbuf[4*MAXPATHLEN + 1]; 401 402 strsvis(pathbuf, path, VIS_CSTYLE, extra); 403 return(pathbuf); 404 } 405 406 407 static dev_t 408 parsedev(char *arg) 409 { 410 #define MAX_PACK_ARGS 3 411 u_long numbers[MAX_PACK_ARGS]; 412 char *p, *ep, *dev; 413 int argc; 414 pack_t *pack; 415 dev_t result; 416 const char *error = NULL; 417 418 if ((dev = strchr(arg, ',')) != NULL) { 419 *dev++='\0'; 420 if ((pack = pack_find(arg)) == NULL) 421 mtree_err("unknown format `%s'", arg); 422 argc = 0; 423 while ((p = strsep(&dev, ",")) != NULL) { 424 if (*p == '\0') 425 mtree_err("missing number"); 426 numbers[argc++] = strtoul(p, &ep, 0); 427 if (*ep != '\0') 428 mtree_err("invalid number `%s'", 429 p); 430 if (argc > MAX_PACK_ARGS) 431 mtree_err("too many arguments"); 432 } 433 if (argc < 2) 434 mtree_err("not enough arguments"); 435 result = (*pack)(argc, numbers, &error); 436 if (error != NULL) 437 mtree_err(error); 438 } else { 439 result = (dev_t)strtoul(arg, &ep, 0); 440 if (*ep != '\0') 441 mtree_err("invalid device `%s'", arg); 442 } 443 return (result); 444 } 445 446 static void 447 replacenode(NODE *cur, NODE *new) 448 { 449 450 #define REPLACE(x) cur->x = new->x 451 #define REPLACESTR(x) REPLACEPTR(cur->x,new->x) 452 453 if (cur->type != new->type) { 454 if (mtree_Mflag) { 455 /* 456 * merge entries with different types; we 457 * don't want children retained in this case. 458 */ 459 REPLACE(type); 460 free_nodes(cur->child); 461 cur->child = NULL; 462 } else { 463 mtree_err( 464 "existing entry for `%s', type `%s'" 465 " does not match type `%s'", 466 cur->name, nodetype(cur->type), 467 nodetype(new->type)); 468 } 469 } 470 471 REPLACE(st_size); 472 REPLACE(st_mtimespec); 473 REPLACESTR(slink); 474 if (cur->slink != NULL) { 475 if ((cur->slink = strdup(new->slink)) == NULL) 476 mtree_err("memory allocation error"); 477 if (strunvis(cur->slink, new->slink) == -1) 478 mtree_err("strunvis failed on `%s'", new->slink); 479 free(new->slink); 480 } 481 REPLACE(st_uid); 482 REPLACE(st_gid); 483 REPLACE(st_mode); 484 REPLACE(st_rdev); 485 REPLACE(st_flags); 486 REPLACE(st_nlink); 487 REPLACE(cksum); 488 REPLACESTR(md5digest); 489 REPLACESTR(rmd160digest); 490 REPLACESTR(sha1digest); 491 REPLACESTR(sha256digest); 492 REPLACESTR(sha384digest); 493 REPLACESTR(sha512digest); 494 REPLACESTR(tags); 495 REPLACE(lineno); 496 REPLACE(flags); 497 free(new); 498 } 499 500 static void 501 set(char *t, NODE *ip) 502 { 503 int type, value, len; 504 gid_t gid; 505 uid_t uid; 506 char *kw, *val, *md, *ep; 507 void *m; 508 509 while ((kw = strsep(&t, "= \t")) != NULL) { 510 if (*kw == '\0') 511 continue; 512 if (strcmp(kw, "all") == 0) 513 mtree_err("invalid keyword `all'"); 514 ip->flags |= type = parsekey(kw, &value); 515 if (!value) 516 /* Just set flag bit (F_IGN and F_OPT) */ 517 continue; 518 while ((val = strsep(&t, " \t")) != NULL && *val == '\0') 519 continue; 520 if (val == NULL) 521 mtree_err("missing value"); 522 switch (type) { 523 case F_CKSUM: 524 ip->cksum = strtoul(val, &ep, 10); 525 if (*ep) 526 mtree_err("invalid checksum `%s'", val); 527 break; 528 case F_DEV: 529 ip->st_rdev = parsedev(val); 530 break; 531 case F_FLAGS: 532 if (strcmp("none", val) == 0) 533 ip->st_flags = 0; 534 else if (string_to_flags(&val, &ip->st_flags, NULL) 535 != 0) 536 mtree_err("invalid flag `%s'", val); 537 break; 538 case F_GID: 539 ip->st_gid = (gid_t)strtoul(val, &ep, 10); 540 if (*ep) 541 mtree_err("invalid gid `%s'", val); 542 break; 543 case F_GNAME: 544 if (mtree_Wflag) /* don't parse if whacking */ 545 break; 546 if (gid_from_group(val, &gid) == -1) 547 mtree_err("unknown group `%s'", val); 548 ip->st_gid = gid; 549 break; 550 case F_MD5: 551 if (val[0]=='0' && val[1]=='x') 552 md=&val[2]; 553 else 554 md=val; 555 if ((ip->md5digest = strdup(md)) == NULL) 556 mtree_err("memory allocation error"); 557 break; 558 case F_MODE: 559 if ((m = setmode(val)) == NULL) 560 mtree_err("cannot set file mode `%s' (%s)", 561 val, strerror(errno)); 562 ip->st_mode = getmode(m, 0); 563 free(m); 564 break; 565 case F_NLINK: 566 ip->st_nlink = (nlink_t)strtoul(val, &ep, 10); 567 if (*ep) 568 mtree_err("invalid link count `%s'", val); 569 break; 570 case F_RMD160: 571 if (val[0]=='0' && val[1]=='x') 572 md=&val[2]; 573 else 574 md=val; 575 if ((ip->rmd160digest = strdup(md)) == NULL) 576 mtree_err("memory allocation error"); 577 break; 578 case F_SHA1: 579 if (val[0]=='0' && val[1]=='x') 580 md=&val[2]; 581 else 582 md=val; 583 if ((ip->sha1digest = strdup(md)) == NULL) 584 mtree_err("memory allocation error"); 585 break; 586 case F_SIZE: 587 ip->st_size = (off_t)strtoll(val, &ep, 10); 588 if (*ep) 589 mtree_err("invalid size `%s'", val); 590 break; 591 case F_SLINK: 592 if ((ip->slink = strdup(val)) == NULL) 593 mtree_err("memory allocation error"); 594 if (strunvis(ip->slink, val) == -1) 595 mtree_err("strunvis failed on `%s'", val); 596 break; 597 case F_TAGS: 598 len = strlen(val) + 3; /* "," + str + ",\0" */ 599 if ((ip->tags = malloc(len)) == NULL) 600 mtree_err("memory allocation error"); 601 snprintf(ip->tags, len, ",%s,", val); 602 break; 603 case F_TIME: 604 ip->st_mtimespec.tv_sec = 605 (time_t)strtoul(val, &ep, 10); 606 if (*ep != '.') 607 mtree_err("invalid time `%s'", val); 608 val = ep + 1; 609 ip->st_mtimespec.tv_nsec = strtoul(val, &ep, 10); 610 if (*ep) 611 mtree_err("invalid time `%s'", val); 612 break; 613 case F_TYPE: 614 ip->type = parsetype(val); 615 break; 616 case F_UID: 617 ip->st_uid = (uid_t)strtoul(val, &ep, 10); 618 if (*ep) 619 mtree_err("invalid uid `%s'", val); 620 break; 621 case F_UNAME: 622 if (mtree_Wflag) /* don't parse if whacking */ 623 break; 624 if (uid_from_user(val, &uid) == -1) 625 mtree_err("unknown user `%s'", val); 626 ip->st_uid = uid; 627 break; 628 case F_SHA256: 629 if (val[0]=='0' && val[1]=='x') 630 md=&val[2]; 631 else 632 md=val; 633 if ((ip->sha256digest = strdup(md)) == NULL) 634 mtree_err("memory allocation error"); 635 break; 636 case F_SHA384: 637 if (val[0]=='0' && val[1]=='x') 638 md=&val[2]; 639 else 640 md=val; 641 if ((ip->sha384digest = strdup(md)) == NULL) 642 mtree_err("memory allocation error"); 643 break; 644 case F_SHA512: 645 if (val[0]=='0' && val[1]=='x') 646 md=&val[2]; 647 else 648 md=val; 649 if ((ip->sha512digest = strdup(md)) == NULL) 650 mtree_err("memory allocation error"); 651 break; 652 default: 653 mtree_err( 654 "set(): unsupported key type 0x%x (INTERNAL ERROR)", 655 type); 656 /* NOTREACHED */ 657 } 658 } 659 } 660 661 static void 662 unset(char *t, NODE *ip) 663 { 664 char *p; 665 666 while ((p = strsep(&t, " \t")) != NULL) { 667 if (*p == '\0') 668 continue; 669 ip->flags &= ~parsekey(p, NULL); 670 } 671 } 672
Indexes created Tue Sep 23 07:09:52 GMT 2025