1/* $NetBSD: spec.c,v 1.89 2014/04/24 17:22:41 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 68static char sccsid[] = "@(#)spec.c 8.2 (Berkeley) 4/28/95"; 69#else 70__RCSID("$NetBSD: spec.c,v 1.89 2014/04/24 17:22:41 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 <stdint.h> 85#include <stdlib.h> 86#include <string.h> 87#include <unistd.h> 88#include <vis.h> 89#include <util.h> 90 91#include "extern.h" 92#include "pack_dev.h" 93 94size_t mtree_lineno; /* Current spec line number */ 95int mtree_Mflag; /* Merge duplicate entries */ 96int mtree_Wflag; /* Don't "whack" permissions */ 97int mtree_Sflag; /* Sort entries */ 98 99static dev_t parsedev(char *); 100static void replacenode(NODE *, NODE *); 101static void set(char *, NODE *); 102static void unset(char *, NODE *); 103static void addchild(NODE *, NODE *); 104static int nodecmp(const NODE *, const NODE *); 105static int appendfield(FILE *, int, const char *, ...) __printflike(3, 4); 106 107#define REPLACEPTR(x,v) do { if ((x)) free((x)); (x) = (v); } while (0) 108 109NODE * 110spec(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 168noparent: 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 "missing directory in specification"); 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 /* 222 * Allow a bare "." root node by forcing it to 223 * type=dir for compatibility with FreeBSD. 224 */ 225 if (strcmp(centry->name, ".") == 0 && centry->type == 0) 226 centry->type = F_DIR; 227 if (strcmp(centry->name, ".") != 0 || 228 centry->type != F_DIR) 229 mtree_err( 230 "root node must be the directory `.'"); 231 last = root = centry; 232 root->parent = root; 233 } else if (pathparent != NULL) { 234 /* 235 * full path entry; add or replace 236 */ 237 centry->parent = pathparent; 238 addchild(pathparent, centry); 239 last = centry; 240 } else if (strcmp(centry->name, ".") == 0) { 241 /* 242 * duplicate "." entry; always replace 243 */ 244 replacenode(root, centry); 245 } else if (last->type == F_DIR && !(last->flags & F_DONE)) { 246 /* 247 * new relative child in current dir; 248 * add or replace 249 */ 250 centry->parent = last; 251 addchild(last, centry); 252 last = centry; 253 } else { 254 /* 255 * new relative child in parent dir 256 * (after encountering ".." entry); 257 * add or replace 258 */ 259 centry->parent = last->parent; 260 addchild(last->parent, centry); 261 last = centry; 262 } 263 } 264 return (root); 265} 266 267void 268free_nodes(NODE *root) 269{ 270 NODE *cur, *next; 271 272 if (root == NULL) 273 return; 274 275 next = NULL; 276 for (cur = root; cur != NULL; cur = next) { 277 next = cur->next; 278 free_nodes(cur->child); 279 REPLACEPTR(cur->slink, NULL); 280 REPLACEPTR(cur->md5digest, NULL); 281 REPLACEPTR(cur->rmd160digest, NULL); 282 REPLACEPTR(cur->sha1digest, NULL); 283 REPLACEPTR(cur->sha256digest, NULL); 284 REPLACEPTR(cur->sha384digest, NULL); 285 REPLACEPTR(cur->sha512digest, NULL); 286 REPLACEPTR(cur->tags, NULL); 287 REPLACEPTR(cur, NULL); 288 } 289} 290 291/* 292 * appendfield -- 293 * Like fprintf(), but output a space either before or after 294 * the regular output, according to the pathlast flag. 295 */ 296static int 297appendfield(FILE *fp, int pathlast, const char *fmt, ...) 298{ 299 va_list ap; 300 int result; 301 302 va_start(ap, fmt); 303 if (!pathlast) 304 fprintf(fp, " "); 305 result = vprintf(fmt, ap); 306 if (pathlast) 307 fprintf(fp, " "); 308 va_end(ap); 309 return result; 310} 311 312/* 313 * dump_nodes -- 314 * dump the NODEs from `cur', based in the directory `dir'. 315 * if pathlast is none zero, print the path last, otherwise print 316 * it first. 317 */ 318void 319dump_nodes(FILE *fp, const char *dir, NODE *root, int pathlast) 320{ 321 NODE *cur; 322 char path[MAXPATHLEN]; 323 const char *name; 324 char *str; 325 char *p, *q; 326 327 for (cur = root; cur != NULL; cur = cur->next) { 328 if (cur->type != F_DIR && !matchtags(cur)) 329 continue; 330 331 if (snprintf(path, sizeof(path), "%s%s%s", 332 dir, *dir ? "/" : "", cur->name) 333 >= (int)sizeof(path)) 334 mtree_err("Pathname too long."); 335 336 if (!pathlast) 337 fprintf(fp, "%s", vispath(path)); 338 339#define MATCHFLAG(f) ((keys & (f)) && (cur->flags & (f))) 340 if (MATCHFLAG(F_TYPE)) 341 appendfield(fp, pathlast, "type=%s", 342 nodetype(cur->type)); 343 if (MATCHFLAG(F_UID | F_UNAME)) { 344 if (keys & F_UNAME && 345 (name = user_from_uid(cur->st_uid, 1)) != NULL) 346 appendfield(fp, pathlast, "uname=%s", name); 347 else 348 appendfield(fp, pathlast, "uid=%u", 349 cur->st_uid); 350 } 351 if (MATCHFLAG(F_GID | F_GNAME)) { 352 if (keys & F_GNAME && 353 (name = group_from_gid(cur->st_gid, 1)) != NULL) 354 appendfield(fp, pathlast, "gname=%s", name); 355 else 356 appendfield(fp, pathlast, "gid=%u", 357 cur->st_gid); 358 } 359 if (MATCHFLAG(F_MODE)) 360 appendfield(fp, pathlast, "mode=%#o", cur->st_mode); 361 if (MATCHFLAG(F_DEV) && 362 (cur->type == F_BLOCK || cur->type == F_CHAR)) 363 appendfield(fp, pathlast, "device=%#jx", 364 (uintmax_t)cur->st_rdev); 365 if (MATCHFLAG(F_NLINK)) 366 appendfield(fp, pathlast, "nlink=%d", cur->st_nlink); 367 if (MATCHFLAG(F_SLINK)) 368 appendfield(fp, pathlast, "link=%s", 369 vispath(cur->slink)); 370 if (MATCHFLAG(F_SIZE)) 371 appendfield(fp, pathlast, "size=%ju", 372 (uintmax_t)cur->st_size); 373 if (MATCHFLAG(F_TIME)) 374 appendfield(fp, pathlast, "time=%jd.%09ld", 375 (intmax_t)cur->st_mtimespec.tv_sec, 376 cur->st_mtimespec.tv_nsec); 377 if (MATCHFLAG(F_CKSUM)) 378 appendfield(fp, pathlast, "cksum=%lu", cur->cksum); 379 if (MATCHFLAG(F_MD5)) 380 appendfield(fp, pathlast, "%s=%s", MD5KEY, 381 cur->md5digest); 382 if (MATCHFLAG(F_RMD160)) 383 appendfield(fp, pathlast, "%s=%s", RMD160KEY, 384 cur->rmd160digest); 385 if (MATCHFLAG(F_SHA1)) 386 appendfield(fp, pathlast, "%s=%s", SHA1KEY, 387 cur->sha1digest); 388 if (MATCHFLAG(F_SHA256)) 389 appendfield(fp, pathlast, "%s=%s", SHA256KEY, 390 cur->sha256digest); 391 if (MATCHFLAG(F_SHA384)) 392 appendfield(fp, pathlast, "%s=%s", SHA384KEY, 393 cur->sha384digest); 394 if (MATCHFLAG(F_SHA512)) 395 appendfield(fp, pathlast, "%s=%s", SHA512KEY, 396 cur->sha512digest); 397 if (MATCHFLAG(F_FLAGS)) { 398 str = flags_to_string(cur->st_flags, "none"); 399 appendfield(fp, pathlast, "flags=%s", str); 400 free(str); 401 } 402 if (MATCHFLAG(F_IGN)) 403 appendfield(fp, pathlast, "ignore"); 404 if (MATCHFLAG(F_OPT)) 405 appendfield(fp, pathlast, "optional"); 406 if (MATCHFLAG(F_TAGS)) { 407 /* don't output leading or trailing commas */ 408 p = cur->tags; 409 while (*p == ',') 410 p++; 411 q = p + strlen(p); 412 while(q > p && q[-1] == ',') 413 q--; 414 appendfield(fp, pathlast, "tags=%.*s", (int)(q - p), p); 415 } 416 puts(pathlast ? vispath(path) : ""); 417 418 if (cur->child) 419 dump_nodes(fp, path, cur->child, pathlast); 420 } 421} 422 423/* 424 * vispath -- 425 * strsvis(3) encodes path, which must not be longer than MAXPATHLEN 426 * characters long, and returns a pointer to a static buffer containing 427 * the result. 428 */ 429char * 430vispath(const char *path) 431{ 432 static const char extra[] = { ' ', '\t', '\n', '\\', '#', '\0' }; 433 static const char extra_glob[] = { ' ', '\t', '\n', '\\', '#', '*', 434 '?', '[', '\0' }; 435 static char pathbuf[4*MAXPATHLEN + 1]; 436 437 if (flavor == F_NETBSD6) 438 strsvis(pathbuf, path, VIS_CSTYLE, extra); 439 else 440 strsvis(pathbuf, path, VIS_OCTAL, extra_glob); 441 return pathbuf; 442} 443 444 445static dev_t 446parsedev(char *arg) 447{ 448#define MAX_PACK_ARGS 3 449 u_long numbers[MAX_PACK_ARGS]; 450 char *p, *ep, *dev; 451 int argc; 452 pack_t *pack; 453 dev_t result; 454 const char *error = NULL; 455 456 if ((dev = strchr(arg, ',')) != NULL) { 457 *dev++='\0'; 458 if ((pack = pack_find(arg)) == NULL) 459 mtree_err("unknown format `%s'", arg); 460 argc = 0; 461 while ((p = strsep(&dev, ",")) != NULL) { 462 if (*p == '\0') 463 mtree_err("missing number"); 464 numbers[argc++] = strtoul(p, &ep, 0); 465 if (*ep != '\0') 466 mtree_err("invalid number `%s'", 467 p); 468 if (argc > MAX_PACK_ARGS) 469 mtree_err("too many arguments"); 470 } 471 if (argc < 2) 472 mtree_err("not enough arguments"); 473 result = (*pack)(argc, numbers, &error); 474 if (error != NULL) 475 mtree_err("%s", error); 476 } else { 477 result = (dev_t)strtoul(arg, &ep, 0); 478 if (*ep != '\0') 479 mtree_err("invalid device `%s'", arg); 480 } 481 return (result); 482} 483 484static void 485replacenode(NODE *cur, NODE *new) 486{ 487 488#define REPLACE(x) cur->x = new->x 489#define REPLACESTR(x) REPLACEPTR(cur->x,new->x) 490 491 if (cur->type != new->type) { 492 if (mtree_Mflag) { 493 /* 494 * merge entries with different types; we 495 * don't want children retained in this case. 496 */ 497 REPLACE(type); 498 free_nodes(cur->child); 499 cur->child = NULL; 500 } else { 501 mtree_err( 502 "existing entry for `%s', type `%s'" 503 " does not match type `%s'", 504 cur->name, nodetype(cur->type), 505 nodetype(new->type)); 506 } 507 } 508 509 REPLACE(st_size); 510 REPLACE(st_mtimespec); 511 REPLACESTR(slink); 512 if (cur->slink != NULL) { 513 if ((cur->slink = strdup(new->slink)) == NULL) 514 mtree_err("memory allocation error"); 515 if (strunvis(cur->slink, new->slink) == -1) 516 mtree_err("strunvis failed on `%s'", new->slink); 517 free(new->slink); 518 } 519 REPLACE(st_uid); 520 REPLACE(st_gid); 521 REPLACE(st_mode); 522 REPLACE(st_rdev); 523 REPLACE(st_flags); 524 REPLACE(st_nlink); 525 REPLACE(cksum); 526 REPLACESTR(md5digest); 527 REPLACESTR(rmd160digest); 528 REPLACESTR(sha1digest); 529 REPLACESTR(sha256digest); 530 REPLACESTR(sha384digest); 531 REPLACESTR(sha512digest); 532 REPLACESTR(tags); 533 REPLACE(lineno); 534 REPLACE(flags); 535 free(new); 536} 537 538static void 539set(char *t, NODE *ip) 540{ 541 int type, value, len; 542 gid_t gid; 543 uid_t uid; 544 char *kw, *val, *md, *ep; 545 void *m; 546 547 while ((kw = strsep(&t, "= \t")) != NULL) { 548 if (*kw == '\0') 549 continue; 550 if (strcmp(kw, "all") == 0) 551 mtree_err("invalid keyword `all'"); 552 ip->flags |= type = parsekey(kw, &value); 553 if (!value) 554 /* Just set flag bit (F_IGN and F_OPT) */ 555 continue; 556 while ((val = strsep(&t, " \t")) != NULL && *val == '\0') 557 continue; 558 if (val == NULL) 559 mtree_err("missing value"); 560 switch (type) { 561 case F_CKSUM: 562 ip->cksum = strtoul(val, &ep, 10); 563 if (*ep) 564 mtree_err("invalid checksum `%s'", val); 565 break; 566 case F_DEV: 567 ip->st_rdev = parsedev(val); 568 break; 569 case F_FLAGS: 570 if (strcmp("none", val) == 0) 571 ip->st_flags = 0; 572 else if (string_to_flags(&val, &ip->st_flags, NULL) 573 != 0) 574 mtree_err("invalid flag `%s'", val); 575 break; 576 case F_GID: 577 ip->st_gid = (gid_t)strtoul(val, &ep, 10); 578 if (*ep) 579 mtree_err("invalid gid `%s'", val); 580 break; 581 case F_GNAME: 582 if (mtree_Wflag) /* don't parse if whacking */ 583 break; 584 if (gid_from_group(val, &gid) == -1) 585 mtree_err("unknown group `%s'", val); 586 ip->st_gid = gid; 587 break; 588 case F_MD5: 589 if (val[0]=='0' && val[1]=='x') 590 md=&val[2]; 591 else 592 md=val; 593 if ((ip->md5digest = strdup(md)) == NULL) 594 mtree_err("memory allocation error"); 595 break; 596 case F_MODE: 597 if ((m = setmode(val)) == NULL) 598 mtree_err("cannot set file mode `%s' (%s)", 599 val, strerror(errno)); 600 ip->st_mode = getmode(m, 0); 601 free(m); 602 break; 603 case F_NLINK: 604 ip->st_nlink = (nlink_t)strtoul(val, &ep, 10); 605 if (*ep) 606 mtree_err("invalid link count `%s'", val); 607 break; 608 case F_RMD160: 609 if (val[0]=='0' && val[1]=='x') 610 md=&val[2]; 611 else 612 md=val; 613 if ((ip->rmd160digest = strdup(md)) == NULL) 614 mtree_err("memory allocation error"); 615 break; 616 case F_SHA1: 617 if (val[0]=='0' && val[1]=='x') 618 md=&val[2]; 619 else 620 md=val; 621 if ((ip->sha1digest = strdup(md)) == NULL) 622 mtree_err("memory allocation error"); 623 break; 624 case F_SIZE: 625 ip->st_size = (off_t)strtoll(val, &ep, 10); 626 if (*ep) 627 mtree_err("invalid size `%s'", val); 628 break; 629 case F_SLINK: 630 if ((ip->slink = strdup(val)) == NULL) 631 mtree_err("memory allocation error"); 632 if (strunvis(ip->slink, val) == -1) 633 mtree_err("strunvis failed on `%s'", val); 634 break; 635 case F_TAGS: 636 len = strlen(val) + 3; /* "," + str + ",\0" */ 637 if ((ip->tags = malloc(len)) == NULL) 638 mtree_err("memory allocation error"); 639 snprintf(ip->tags, len, ",%s,", val); 640 break; 641 case F_TIME: 642 ip->st_mtimespec.tv_sec = 643 (time_t)strtoll(val, &ep, 10); 644 if (*ep != '.') 645 mtree_err("invalid time `%s'", val); 646 val = ep + 1; 647 ip->st_mtimespec.tv_nsec = strtol(val, &ep, 10); 648 if (*ep) 649 mtree_err("invalid time `%s'", val); 650 break; 651 case F_TYPE: 652 ip->type = parsetype(val); 653 break; 654 case F_UID: 655 ip->st_uid = (uid_t)strtoul(val, &ep, 10); 656 if (*ep) 657 mtree_err("invalid uid `%s'", val); 658 break; 659 case F_UNAME: 660 if (mtree_Wflag) /* don't parse if whacking */ 661 break; 662 if (uid_from_user(val, &uid) == -1) 663 mtree_err("unknown user `%s'", val); 664 ip->st_uid = uid; 665 break; 666 case F_SHA256: 667 if (val[0]=='0' && val[1]=='x') 668 md=&val[2]; 669 else 670 md=val; 671 if ((ip->sha256digest = strdup(md)) == NULL) 672 mtree_err("memory allocation error"); 673 break; 674 case F_SHA384: 675 if (val[0]=='0' && val[1]=='x') 676 md=&val[2]; 677 else 678 md=val; 679 if ((ip->sha384digest = strdup(md)) == NULL) 680 mtree_err("memory allocation error"); 681 break; 682 case F_SHA512: 683 if (val[0]=='0' && val[1]=='x') 684 md=&val[2]; 685 else 686 md=val; 687 if ((ip->sha512digest = strdup(md)) == NULL) 688 mtree_err("memory allocation error"); 689 break; 690 default: 691 mtree_err( 692 "set(): unsupported key type 0x%x (INTERNAL ERROR)", 693 type); 694 /* NOTREACHED */ 695 } 696 } 697} 698 699static void 700unset(char *t, NODE *ip) 701{ 702 char *p; 703 704 while ((p = strsep(&t, " \t")) != NULL) { 705 if (*p == '\0') 706 continue; 707 ip->flags &= ~parsekey(p, NULL); 708 } 709} 710 711/* 712 * addchild -- 713 * Add the centry node as a child of the pathparent node. If 714 * centry is a duplicate, call replacenode(). If centry is not 715 * a duplicate, insert it into the linked list referenced by 716 * pathparent->child. Keep the list sorted if Sflag is set. 717 */ 718static void 719addchild(NODE *pathparent, NODE *centry) 720{ 721 NODE *samename; /* node with the same name as centry */ 722 NODE *replacepos; /* if non-NULL, centry should replace this node */ 723 NODE *insertpos; /* if non-NULL, centry should be inserted 724 * after this node */ 725 NODE *cur; /* for stepping through the list */ 726 NODE *last; /* the last node in the list */ 727 int cmp; 728 729 samename = NULL; 730 replacepos = NULL; 731 insertpos = NULL; 732 last = NULL; 733 cur = pathparent->child; 734 if (cur == NULL) { 735 /* centry is pathparent's first and only child node so far */ 736 pathparent->child = centry; 737 return; 738 } 739 740 /* 741 * pathparent already has at least one other child, so add the 742 * centry node to the list. 743 * 744 * We first scan through the list looking for an existing node 745 * with the same name (setting samename), and also looking 746 * for the correct position to replace or insert the new node 747 * (setting replacepos and/or insertpos). 748 */ 749 for (; cur != NULL; last = cur, cur = cur->next) { 750 if (strcmp(centry->name, cur->name) == 0) { 751 samename = cur; 752 } 753 if (mtree_Sflag) { 754 cmp = nodecmp(centry, cur); 755 if (cmp == 0) { 756 replacepos = cur; 757 } else if (cmp > 0) { 758 insertpos = cur; 759 } 760 } 761 } 762 if (! mtree_Sflag) { 763 if (samename != NULL) { 764 /* replace node with same name */ 765 replacepos = samename; 766 } else { 767 /* add new node at end of list */ 768 insertpos = last; 769 } 770 } 771 772 if (samename != NULL) { 773 /* 774 * We found a node with the same name above. Call 775 * replacenode(), which will either exit with an error, 776 * or replace the information in the samename node and 777 * free the information in the centry node. 778 */ 779 replacenode(samename, centry); 780 if (samename == replacepos) { 781 /* The just-replaced node was in the correct position */ 782 return; 783 } 784 if (samename == insertpos || samename->prev == insertpos) { 785 /* 786 * We thought the new node should be just before 787 * or just after the replaced node, but that would 788 * be equivalent to just retaining the replaced node. 789 */ 790 return; 791 } 792 793 /* 794 * The just-replaced node is in the wrong position in 795 * the list. This can happen if sort order depends on 796 * criteria other than the node name. 797 * 798 * Make centry point to the just-replaced node. Unlink 799 * the just-replaced node from the list, and allow it to 800 * be insterted in the correct position later. 801 */ 802 centry = samename; 803 if (centry->prev) 804 centry->prev->next = centry->next; 805 else { 806 /* centry->next is the new head of the list */ 807 pathparent->child = centry->next; 808 assert(centry->next != NULL); 809 } 810 if (centry->next) 811 centry->next->prev = centry->prev; 812 centry->prev = NULL; 813 centry->next = NULL; 814 } 815 816 if (insertpos == NULL) { 817 /* insert centry at the beginning of the list */ 818 pathparent->child->prev = centry; 819 centry->next = pathparent->child; 820 centry->prev = NULL; 821 pathparent->child = centry; 822 } else { 823 /* insert centry into the list just after insertpos */ 824 centry->next = insertpos->next; 825 insertpos->next = centry; 826 centry->prev = insertpos; 827 if (centry->next) 828 centry->next->prev = centry; 829 } 830 return; 831} 832 833/* 834 * nodecmp -- 835 * used as a comparison function by addchild() to control the order 836 * in which entries appear within a list of sibling nodes. We make 837 * directories sort after non-directories, but otherwise sort in 838 * strcmp() order. 839 * 840 * Keep this in sync with dcmp() in create.c. 841 */ 842static int 843nodecmp(const NODE *a, const NODE *b) 844{ 845 846 if ((a->type & F_DIR) != 0) { 847 if ((b->type & F_DIR) == 0) 848 return 1; 849 } else if ((b->type & F_DIR) != 0) 850 return -1; 851 return strcmp(a->name, b->name); 852} 853