1 /* $NetBSD: spec.c,v 1.85 2012/12/20 16:43:16 christos 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 * 48 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 49 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 50 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 51 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 52 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 53 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 54 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 55 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 56 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 57 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 58 * POSSIBILITY OF SUCH DAMAGE. 59 */ 60 61 #if HAVE_NBTOOL_CONFIG_H 62 #include "nbtool_config.h" 63 #endif 64 65 #include <sys/cdefs.h> 66 #if defined(__RCSID) && !defined(lint) 67 #if 0 68 static char sccsid[] = "@(#)spec.c 8.2 (Berkeley) 4/28/95"; 69 #else 70 __RCSID("$NetBSD: spec.c,v 1.85 2012/12/20 16:43:16 christos Exp $"); 71 #endif 72 #endif /* not lint */ 73 74 #include <sys/param.h> 75 #include <sys/stat.h> 76 77 #include <assert.h> 78 #include <ctype.h> 79 #include <errno.h> 80 #include <grp.h> 81 #include <pwd.h> 82 #include <stdarg.h> 83 #include <stdio.h> 84 #include <stdlib.h> 85 #include <string.h> 86 #include <unistd.h> 87 #include <vis.h> 88 #include <util.h> 89 90 #include "extern.h" 91 #include "pack_dev.h" 92 93 size_t mtree_lineno; /* Current spec line number */ 94 int mtree_Mflag; /* Merge duplicate entries */ 95 int mtree_Wflag; /* Don't "whack" permissions */ 96 int mtree_Sflag; /* Sort entries */ 97 98 static dev_t parsedev(char *); 99 static void replacenode(NODE *, NODE *); 100 static void set(char *, NODE *); 101 static void unset(char *, NODE *); 102 static void addchild(NODE *, NODE *); 103 static int nodecmp(const NODE *, const NODE *); 104 static int appendfield(int, const char *, ...) __printflike(2, 3); 105 106 #define REPLACEPTR(x,v) do { if ((x)) free((x)); (x) = (v); } while (0) 107 108 NODE * 109 spec(FILE *fp) 110 { 111 NODE *centry, *last, *pathparent, *cur; 112 char *p, *e, *next; 113 NODE ginfo, *root; 114 char *buf, *tname, *ntname; 115 size_t tnamelen, plen; 116 117 root = NULL; 118 centry = last = NULL; 119 tname = NULL; 120 tnamelen = 0; 121 memset(&ginfo, 0, sizeof(ginfo)); 122 for (mtree_lineno = 0; 123 (buf = fparseln(fp, NULL, &mtree_lineno, NULL, 124 FPARSELN_UNESCCOMM)); 125 free(buf)) { 126 /* Skip leading whitespace. */ 127 for (p = buf; *p && isspace((unsigned char)*p); ++p) 128 continue; 129 130 /* If nothing but whitespace, continue. */ 131 if (!*p) 132 continue; 133 134 #ifdef DEBUG 135 fprintf(stderr, "line %lu: {%s}\n", 136 (u_long)mtree_lineno, p); 137 #endif 138 /* Grab file name, "$", "set", or "unset". */ 139 next = buf; 140 while ((p = strsep(&next, " \t")) != NULL && *p == '\0') 141 continue; 142 if (p == NULL) 143 mtree_err("missing field"); 144 145 if (p[0] == '/') { 146 if (strcmp(p + 1, "set") == 0) 147 set(next, &ginfo); 148 else if (strcmp(p + 1, "unset") == 0) 149 unset(next, &ginfo); 150 else 151 mtree_err("invalid specification `%s'", p); 152 continue; 153 } 154 155 if (strcmp(p, "..") == 0) { 156 /* Don't go up, if haven't gone down. */ 157 if (root == NULL) 158 goto noparent; 159 if (last->type != F_DIR || last->flags & F_DONE) { 160 if (last == root) 161 goto noparent; 162 last = last->parent; 163 } 164 last->flags |= F_DONE; 165 continue; 166 167 noparent: mtree_err("no parent node"); 168 } 169 170 plen = strlen(p) + 1; 171 if (plen > tnamelen) { 172 if ((ntname = realloc(tname, plen)) == NULL) 173 mtree_err("realloc: %s", strerror(errno)); 174 tname = ntname; 175 tnamelen = plen; 176 } 177 if (strunvis(tname, p) == -1) 178 mtree_err("strunvis failed on `%s'", p); 179 p = tname; 180 181 pathparent = NULL; 182 if (strchr(p, '/') != NULL) { 183 cur = root; 184 for (; (e = strchr(p, '/')) != NULL; p = e+1) { 185 if (p == e) 186 continue; /* handle // */ 187 *e = '\0'; 188 if (strcmp(p, ".") != 0) { 189 while (cur && 190 strcmp(cur->name, p) != 0) { 191 cur = cur->next; 192 } 193 } 194 if (cur == NULL || cur->type != F_DIR) { 195 mtree_err("%s: %s", tname, 196 "missing directory in specification"); 197 } 198 *e = '/'; 199 pathparent = cur; 200 cur = cur->child; 201 } 202 if (*p == '\0') 203 mtree_err("%s: empty leaf element", tname); 204 } 205 206 if ((centry = calloc(1, sizeof(NODE) + strlen(p))) == NULL) 207 mtree_err("%s", strerror(errno)); 208 *centry = ginfo; 209 centry->lineno = mtree_lineno; 210 strcpy(centry->name, p); 211 #define MAGIC "?*[" 212 if (strpbrk(p, MAGIC)) 213 centry->flags |= F_MAGIC; 214 set(next, centry); 215 216 if (root == NULL) { 217 /* 218 * empty tree 219 */ 220 if (strcmp(centry->name, ".") != 0 || 221 centry->type != F_DIR) 222 mtree_err( 223 "root node must be the directory `.'"); 224 last = root = centry; 225 root->parent = root; 226 } else if (pathparent != NULL) { 227 /* 228 * full path entry; add or replace 229 */ 230 centry->parent = pathparent; 231 addchild(pathparent, centry); 232 last = centry; 233 } else if (strcmp(centry->name, ".") == 0) { 234 /* 235 * duplicate "." entry; always replace 236 */ 237 replacenode(root, centry); 238 } else if (last->type == F_DIR && !(last->flags & F_DONE)) { 239 /* 240 * new relative child in current dir; 241 * add or replace 242 */ 243 centry->parent = last; 244 addchild(last, centry); 245 last = centry; 246 } else { 247 /* 248 * new relative child in parent dir 249 * (after encountering ".." entry); 250 * add or replace 251 */ 252 centry->parent = last->parent; 253 addchild(last->parent, centry); 254 last = centry; 255 } 256 } 257 return (root); 258 } 259 260 void 261 free_nodes(NODE *root) 262 { 263 NODE *cur, *next; 264 265 if (root == NULL) 266 return; 267 268 next = NULL; 269 for (cur = root; cur != NULL; cur = next) { 270 next = cur->next; 271 free_nodes(cur->child); 272 REPLACEPTR(cur->slink, NULL); 273 REPLACEPTR(cur->md5digest, NULL); 274 REPLACEPTR(cur->rmd160digest, NULL); 275 REPLACEPTR(cur->sha1digest, NULL); 276 REPLACEPTR(cur->sha256digest, NULL); 277 REPLACEPTR(cur->sha384digest, NULL); 278 REPLACEPTR(cur->sha512digest, NULL); 279 REPLACEPTR(cur->tags, NULL); 280 REPLACEPTR(cur, NULL); 281 } 282 } 283 284 /* 285 * appendfield -- 286 * Like printf(), but output a space either before or after 287 * the regular output, according to the pathlast flag. 288 */ 289 static int 290 appendfield(int pathlast, const char *fmt, ...) 291 { 292 va_list ap; 293 int result; 294 295 va_start(ap, fmt); 296 if (!pathlast) 297 printf(" "); 298 result = vprintf(fmt, ap); 299 if (pathlast) 300 printf(" "); 301 va_end(ap); 302 return result; 303 } 304 305 /* 306 * dump_nodes -- 307 * dump the NODEs from `cur', based in the directory `dir'. 308 * if pathlast is none zero, print the path last, otherwise print 309 * it first. 310 */ 311 void 312 dump_nodes(const char *dir, NODE *root, int pathlast) 313 { 314 NODE *cur; 315 char path[MAXPATHLEN]; 316 const char *name; 317 char *str; 318 char *p, *q; 319 320 for (cur = root; cur != NULL; cur = cur->next) { 321 if (cur->type != F_DIR && !matchtags(cur)) 322 continue; 323 324 if (snprintf(path, sizeof(path), "%s%s%s", 325 dir, *dir ? "/" : "", cur->name) 326 >= (int)sizeof(path)) 327 mtree_err("Pathname too long."); 328 329 if (!pathlast) 330 printf("%s", vispath(path)); 331 332 #define MATCHFLAG(f) ((keys & (f)) && (cur->flags & (f))) 333 if (MATCHFLAG(F_TYPE)) 334 appendfield(pathlast, "type=%s", nodetype(cur->type)); 335 if (MATCHFLAG(F_UID | F_UNAME)) { 336 if (keys & F_UNAME && 337 (name = user_from_uid(cur->st_uid, 1)) != NULL) 338 appendfield(pathlast, "uname=%s", name); 339 else 340 appendfield(pathlast, "uid=%u", cur->st_uid); 341 } 342 if (MATCHFLAG(F_GID | F_GNAME)) { 343 if (keys & F_GNAME && 344 (name = group_from_gid(cur->st_gid, 1)) != NULL) 345 appendfield(pathlast, "gname=%s", name); 346 else 347 appendfield(pathlast, "gid=%u", cur->st_gid); 348 } 349 if (MATCHFLAG(F_MODE)) 350 appendfield(pathlast, "mode=%#o", cur->st_mode); 351 if (MATCHFLAG(F_DEV) && 352 (cur->type == F_BLOCK || cur->type == F_CHAR)) 353 appendfield(pathlast, "device=%#llx", (long long)cur->st_rdev); 354 if (MATCHFLAG(F_NLINK)) 355 appendfield(pathlast, "nlink=%d", cur->st_nlink); 356 if (MATCHFLAG(F_SLINK)) 357 appendfield(pathlast, "link=%s", vispath(cur->slink)); 358 if (MATCHFLAG(F_SIZE)) 359 appendfield(pathlast, "size=%lld", (long long)cur->st_size); 360 if (MATCHFLAG(F_TIME)) 361 appendfield(pathlast, "time=%lld.%09ld", 362 (long long)cur->st_mtimespec.tv_sec, 363 cur->st_mtimespec.tv_nsec); 364 if (MATCHFLAG(F_CKSUM)) 365 appendfield(pathlast, "cksum=%lu", cur->cksum); 366 if (MATCHFLAG(F_MD5)) 367 appendfield(pathlast, "%s=%s", MD5KEY, cur->md5digest); 368 if (MATCHFLAG(F_RMD160)) 369 appendfield(pathlast, "%s=%s", RMD160KEY, 370 cur->rmd160digest); 371 if (MATCHFLAG(F_SHA1)) 372 appendfield(pathlast, "%s=%s", SHA1KEY, 373 cur->sha1digest); 374 if (MATCHFLAG(F_SHA256)) 375 appendfield(pathlast, "%s=%s", SHA256KEY, 376 cur->sha256digest); 377 if (MATCHFLAG(F_SHA384)) 378 appendfield(pathlast, "%s=%s", SHA384KEY, 379 cur->sha384digest); 380 if (MATCHFLAG(F_SHA512)) 381 appendfield(pathlast, "%s=%s", SHA512KEY, 382 cur->sha512digest); 383 if (MATCHFLAG(F_FLAGS)) { 384 str = flags_to_string(cur->st_flags, "none"); 385 appendfield(pathlast, "flags=%s", str); 386 free(str); 387 } 388 if (MATCHFLAG(F_IGN)) 389 appendfield(pathlast, "ignore"); 390 if (MATCHFLAG(F_OPT)) 391 appendfield(pathlast, "optional"); 392 if (MATCHFLAG(F_TAGS)) { 393 /* don't output leading or trailing commas */ 394 p = cur->tags; 395 while (*p == ',') 396 p++; 397 q = p + strlen(p); 398 while(q > p && q[-1] == ',') 399 q--; 400 appendfield(pathlast, "tags=%.*s", (int)(q - p), p); 401 } 402 puts(pathlast ? vispath(path) : ""); 403 404 if (cur->child) 405 dump_nodes(path, cur->child, pathlast); 406 } 407 } 408 409 /* 410 * vispath -- 411 * strsvis(3) encodes path, which must not be longer than MAXPATHLEN 412 * characters long, and returns a pointer to a static buffer containing 413 * the result. 414 */ 415 char * 416 vispath(const char *path) 417 { 418 static const char extra[] = { ' ', '\t', '\n', '\\', '#', '\0' }; 419 static const char extra_glob[] = { ' ', '\t', '\n', '\\', '#', '*', 420 '?', '[', '\0' }; 421 static char pathbuf[4*MAXPATHLEN + 1]; 422 423 if (flavor == F_NETBSD6) 424 strsvis(pathbuf, path, VIS_CSTYLE, extra); 425 else 426 strsvis(pathbuf, path, VIS_OCTAL, extra_glob); 427 return pathbuf; 428 } 429 430 431 static dev_t 432 parsedev(char *arg) 433 { 434 #define MAX_PACK_ARGS 3 435 u_long numbers[MAX_PACK_ARGS]; 436 char *p, *ep, *dev; 437 int argc; 438 pack_t *pack; 439 dev_t result; 440 const char *error = NULL; 441 442 if ((dev = strchr(arg, ',')) != NULL) { 443 *dev++='\0'; 444 if ((pack = pack_find(arg)) == NULL) 445 mtree_err("unknown format `%s'", arg); 446 argc = 0; 447 while ((p = strsep(&dev, ",")) != NULL) { 448 if (*p == '\0') 449 mtree_err("missing number"); 450 numbers[argc++] = strtoul(p, &ep, 0); 451 if (*ep != '\0') 452 mtree_err("invalid number `%s'", 453 p); 454 if (argc > MAX_PACK_ARGS) 455 mtree_err("too many arguments"); 456 } 457 if (argc < 2) 458 mtree_err("not enough arguments"); 459 result = (*pack)(argc, numbers, &error); 460 if (error != NULL) 461 mtree_err("%s", error); 462 } else { 463 result = (dev_t)strtoul(arg, &ep, 0); 464 if (*ep != '\0') 465 mtree_err("invalid device `%s'", arg); 466 } 467 return (result); 468 } 469 470 static void 471 replacenode(NODE *cur, NODE *new) 472 { 473 474 #define REPLACE(x) cur->x = new->x 475 #define REPLACESTR(x) REPLACEPTR(cur->x,new->x) 476 477 if (cur->type != new->type) { 478 if (mtree_Mflag) { 479 /* 480 * merge entries with different types; we 481 * don't want children retained in this case. 482 */ 483 REPLACE(type); 484 free_nodes(cur->child); 485 cur->child = NULL; 486 } else { 487 mtree_err( 488 "existing entry for `%s', type `%s'" 489 " does not match type `%s'", 490 cur->name, nodetype(cur->type), 491 nodetype(new->type)); 492 } 493 } 494 495 REPLACE(st_size); 496 REPLACE(st_mtimespec); 497 REPLACESTR(slink); 498 if (cur->slink != NULL) { 499 if ((cur->slink = strdup(new->slink)) == NULL) 500 mtree_err("memory allocation error"); 501 if (strunvis(cur->slink, new->slink) == -1) 502 mtree_err("strunvis failed on `%s'", new->slink); 503 free(new->slink); 504 } 505 REPLACE(st_uid); 506 REPLACE(st_gid); 507 REPLACE(st_mode); 508 REPLACE(st_rdev); 509 REPLACE(st_flags); 510 REPLACE(st_nlink); 511 REPLACE(cksum); 512 REPLACESTR(md5digest); 513 REPLACESTR(rmd160digest); 514 REPLACESTR(sha1digest); 515 REPLACESTR(sha256digest); 516 REPLACESTR(sha384digest); 517 REPLACESTR(sha512digest); 518 REPLACESTR(tags); 519 REPLACE(lineno); 520 REPLACE(flags); 521 free(new); 522 } 523 524 static void 525 set(char *t, NODE *ip) 526 { 527 int type, value, len; 528 gid_t gid; 529 uid_t uid; 530 char *kw, *val, *md, *ep; 531 void *m; 532 533 while ((kw = strsep(&t, "= \t")) != NULL) { 534 if (*kw == '\0') 535 continue; 536 if (strcmp(kw, "all") == 0) 537 mtree_err("invalid keyword `all'"); 538 ip->flags |= type = parsekey(kw, &value); 539 if (!value) 540 /* Just set flag bit (F_IGN and F_OPT) */ 541 continue; 542 while ((val = strsep(&t, " \t")) != NULL && *val == '\0') 543 continue; 544 if (val == NULL) 545 mtree_err("missing value"); 546 switch (type) { 547 case F_CKSUM: 548 ip->cksum = strtoul(val, &ep, 10); 549 if (*ep) 550 mtree_err("invalid checksum `%s'", val); 551 break; 552 case F_DEV: 553 ip->st_rdev = parsedev(val); 554 break; 555 case F_FLAGS: 556 if (strcmp("none", val) == 0) 557 ip->st_flags = 0; 558 else if (string_to_flags(&val, &ip->st_flags, NULL) 559 != 0) 560 mtree_err("invalid flag `%s'", val); 561 break; 562 case F_GID: 563 ip->st_gid = (gid_t)strtoul(val, &ep, 10); 564 if (*ep) 565 mtree_err("invalid gid `%s'", val); 566 break; 567 case F_GNAME: 568 if (mtree_Wflag) /* don't parse if whacking */ 569 break; 570 if (gid_from_group(val, &gid) == -1) 571 mtree_err("unknown group `%s'", val); 572 ip->st_gid = gid; 573 break; 574 case F_MD5: 575 if (val[0]=='0' && val[1]=='x') 576 md=&val[2]; 577 else 578 md=val; 579 if ((ip->md5digest = strdup(md)) == NULL) 580 mtree_err("memory allocation error"); 581 break; 582 case F_MODE: 583 if ((m = setmode(val)) == NULL) 584 mtree_err("cannot set file mode `%s' (%s)", 585 val, strerror(errno)); 586 ip->st_mode = getmode(m, 0); 587 free(m); 588 break; 589 case F_NLINK: 590 ip->st_nlink = (nlink_t)strtoul(val, &ep, 10); 591 if (*ep) 592 mtree_err("invalid link count `%s'", val); 593 break; 594 case F_RMD160: 595 if (val[0]=='0' && val[1]=='x') 596 md=&val[2]; 597 else 598 md=val; 599 if ((ip->rmd160digest = strdup(md)) == NULL) 600 mtree_err("memory allocation error"); 601 break; 602 case F_SHA1: 603 if (val[0]=='0' && val[1]=='x') 604 md=&val[2]; 605 else 606 md=val; 607 if ((ip->sha1digest = strdup(md)) == NULL) 608 mtree_err("memory allocation error"); 609 break; 610 case F_SIZE: 611 ip->st_size = (off_t)strtoll(val, &ep, 10); 612 if (*ep) 613 mtree_err("invalid size `%s'", val); 614 break; 615 case F_SLINK: 616 if ((ip->slink = strdup(val)) == NULL) 617 mtree_err("memory allocation error"); 618 if (strunvis(ip->slink, val) == -1) 619 mtree_err("strunvis failed on `%s'", val); 620 break; 621 case F_TAGS: 622 len = strlen(val) + 3; /* "," + str + ",\0" */ 623 if ((ip->tags = malloc(len)) == NULL) 624 mtree_err("memory allocation error"); 625 snprintf(ip->tags, len, ",%s,", val); 626 break; 627 case F_TIME: 628 ip->st_mtimespec.tv_sec = 629 (time_t)strtoll(val, &ep, 10); 630 if (*ep != '.') 631 mtree_err("invalid time `%s'", val); 632 val = ep + 1; 633 ip->st_mtimespec.tv_nsec = strtol(val, &ep, 10); 634 if (*ep) 635 mtree_err("invalid time `%s'", val); 636 break; 637 case F_TYPE: 638 ip->type = parsetype(val); 639 break; 640 case F_UID: 641 ip->st_uid = (uid_t)strtoul(val, &ep, 10); 642 if (*ep) 643 mtree_err("invalid uid `%s'", val); 644 break; 645 case F_UNAME: 646 if (mtree_Wflag) /* don't parse if whacking */ 647 break; 648 if (uid_from_user(val, &uid) == -1) 649 mtree_err("unknown user `%s'", val); 650 ip->st_uid = uid; 651 break; 652 case F_SHA256: 653 if (val[0]=='0' && val[1]=='x') 654 md=&val[2]; 655 else 656 md=val; 657 if ((ip->sha256digest = strdup(md)) == NULL) 658 mtree_err("memory allocation error"); 659 break; 660 case F_SHA384: 661 if (val[0]=='0' && val[1]=='x') 662 md=&val[2]; 663 else 664 md=val; 665 if ((ip->sha384digest = strdup(md)) == NULL) 666 mtree_err("memory allocation error"); 667 break; 668 case F_SHA512: 669 if (val[0]=='0' && val[1]=='x') 670 md=&val[2]; 671 else 672 md=val; 673 if ((ip->sha512digest = strdup(md)) == NULL) 674 mtree_err("memory allocation error"); 675 break; 676 default: 677 mtree_err( 678 "set(): unsupported key type 0x%x (INTERNAL ERROR)", 679 type); 680 /* NOTREACHED */ 681 } 682 } 683 } 684 685 static void 686 unset(char *t, NODE *ip) 687 { 688 char *p; 689 690 while ((p = strsep(&t, " \t")) != NULL) { 691 if (*p == '\0') 692 continue; 693 ip->flags &= ~parsekey(p, NULL); 694 } 695 } 696 697 /* 698 * addchild -- 699 * Add the centry node as a child of the pathparent node. If 700 * centry is a duplicate, call replacenode(). If centry is not 701 * a duplicate, insert it into the linked list referenced by 702 * pathparent->child. Keep the list sorted if Sflag is set. 703 */ 704 static void 705 addchild(NODE *pathparent, NODE *centry) 706 { 707 NODE *samename; /* node with the same name as centry */ 708 NODE *replacepos; /* if non-NULL, centry should replace this node */ 709 NODE *insertpos; /* if non-NULL, centry should be inserted 710 * after this node */ 711 NODE *cur; /* for stepping through the list */ 712 NODE *last; /* the last node in the list */ 713 int cmp; 714 715 samename = NULL; 716 replacepos = NULL; 717 insertpos = NULL; 718 last = NULL; 719 cur = pathparent->child; 720 if (cur == NULL) { 721 /* centry is pathparent's first and only child node so far */ 722 pathparent->child = centry; 723 return; 724 } 725 726 /* 727 * pathparent already has at least one other child, so add the 728 * centry node to the list. 729 * 730 * We first scan through the list looking for an existing node 731 * with the same name (setting samename), and also looking 732 * for the correct position to replace or insert the new node 733 * (setting replacepos and/or insertpos). 734 */ 735 for (; cur != NULL; last = cur, cur = cur->next) { 736 if (strcmp(centry->name, cur->name) == 0) { 737 samename = cur; 738 } 739 if (mtree_Sflag) { 740 cmp = nodecmp(centry, cur); 741 if (cmp == 0) { 742 replacepos = cur; 743 } else if (cmp > 0) { 744 insertpos = cur; 745 } 746 } 747 } 748 if (! mtree_Sflag) { 749 if (samename != NULL) { 750 /* replace node with same name */ 751 replacepos = samename; 752 } else { 753 /* add new node at end of list */ 754 insertpos = last; 755 } 756 } 757 758 if (samename != NULL) { 759 /* 760 * We found a node with the same name above. Call 761 * replacenode(), which will either exit with an error, 762 * or replace the information in the samename node and 763 * free the information in the centry node. 764 */ 765 replacenode(samename, centry); 766 if (samename == replacepos) { 767 /* The just-replaced node was in the correct position */ 768 return; 769 } 770 if (samename == insertpos || samename->prev == insertpos) { 771 /* 772 * We thought the new node should be just before 773 * or just after the replaced node, but that would 774 * be equivalent to just retaining the replaced node. 775 */ 776 return; 777 } 778 779 /* 780 * The just-replaced node is in the wrong position in 781 * the list. This can happen if sort order depends on 782 * criteria other than the node name. 783 * 784 * Make centry point to the just-replaced node. Unlink 785 * the just-replaced node from the list, and allow it to 786 * be insterted in the correct position later. 787 */ 788 centry = samename; 789 if (centry->prev) 790 centry->prev->next = centry->next; 791 else { 792 /* centry->next is the new head of the list */ 793 pathparent->child = centry->next; 794 assert(centry->next != NULL); 795 } 796 if (centry->next) 797 centry->next->prev = centry->prev; 798 centry->prev = NULL; 799 centry->next = NULL; 800 } 801 802 if (insertpos == NULL) { 803 /* insert centry at the beginning of the list */ 804 pathparent->child->prev = centry; 805 centry->next = pathparent->child; 806 centry->prev = NULL; 807 pathparent->child = centry; 808 } else { 809 /* insert centry into the list just after insertpos */ 810 centry->next = insertpos->next; 811 insertpos->next = centry; 812 centry->prev = insertpos; 813 if (centry->next) 814 centry->next->prev = centry; 815 } 816 return; 817 } 818 819 /* 820 * nodecmp -- 821 * used as a comparison function by addchild() to control the order 822 * in which entries appear within a list of sibling nodes. We make 823 * directories sort after non-directories, but otherwise sort in 824 * strcmp() order. 825 * 826 * Keep this in sync with dcmp() in create.c. 827 */ 828 static int 829 nodecmp(const NODE *a, const NODE *b) 830 { 831 832 if ((a->type & F_DIR) != 0) { 833 if ((b->type & F_DIR) == 0) 834 return 1; 835 } else if ((b->type & F_DIR) != 0) 836 return -1; 837 return strcmp(a->name, b->name); 838 } 839