usr.sbin/mtree/spec.c

   1 /*      $NetBSD: spec.c,v 1.80 2012/03/15 02:02:24 joerg 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.80 2012/03/15 02:02:24 joerg 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.%ld",
 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, "md5=%s", cur->md5digest);
 368                 if (MATCHFLAG(F_RMD160))
 369                         appendfield(pathlast, "rmd160=%s", cur->rmd160digest);
 370                 if (MATCHFLAG(F_SHA1))
 371                         appendfield(pathlast, "sha1=%s", cur->sha1digest);
 372                 if (MATCHFLAG(F_SHA256))
 373                         appendfield(pathlast, "sha256=%s", cur->sha256digest);
 374                 if (MATCHFLAG(F_SHA384))
 375                         appendfield(pathlast, "sha384=%s", cur->sha384digest);
 376                 if (MATCHFLAG(F_SHA512))
 377                         appendfield(pathlast, "sha512=%s", cur->sha512digest);
 378                 if (MATCHFLAG(F_FLAGS)) {
 379                         str = flags_to_string(cur->st_flags, "none");
 380                         appendfield(pathlast, "flags=%s", str);
 381                         free(str);
 382                 }
 383                 if (MATCHFLAG(F_IGN))
 384                         appendfield(pathlast, "ignore");
 385                 if (MATCHFLAG(F_OPT))
 386                         appendfield(pathlast, "optional");
 387                 if (MATCHFLAG(F_TAGS)) {
 388                         /* don't output leading or trailing commas */
 389                         p = cur->tags;
 390                         while (*p == ',')
 391                                 p++;
 392                         q = p + strlen(p);
 393                         while(q > p && q[-1] == ',')
 394                                 q--;
 395                         appendfield(pathlast, "tags=%.*s", (int)(q - p), p);
 396                 }
 397                 puts(pathlast ? vispath(path) : "");
 398
 399                 if (cur->child)
 400                         dump_nodes(path, cur->child, pathlast);
 401         }
 402 }
 403
 404 /*
 405  * vispath --
 406  *      strsvis(3) encodes path, which must not be longer than MAXPATHLEN
 407  *      characters long, and returns a pointer to a static buffer containing
 408  *      the result.
 409  */
 410 char *
 411 vispath(const char *path)
 412 {
 413         const char extra[] = { ' ', '\t', '\n', '\\', '#', '\0' };
 414         static char pathbuf[4*MAXPATHLEN + 1];
 415
 416         strsvis(pathbuf, path, VIS_CSTYLE, extra);
 417         return(pathbuf);
 418 }
 419
 420
 421 static dev_t
 422 parsedev(char *arg)
 423 {
 424 #define MAX_PACK_ARGS   3
 425         u_long  numbers[MAX_PACK_ARGS];
 426         char    *p, *ep, *dev;
 427         int     argc;
 428         pack_t  *pack;
 429         dev_t   result;
 430         const char *error = NULL;
 431
 432         if ((dev = strchr(arg, ',')) != NULL) {
 433                 *dev++='\0';
 434                 if ((pack = pack_find(arg)) == NULL)
 435                         mtree_err("unknown format `%s'", arg);
 436                 argc = 0;
 437                 while ((p = strsep(&dev, ",")) != NULL) {
 438                         if (*p == '\0')
 439                                 mtree_err("missing number");
 440                         numbers[argc++] = strtoul(p, &ep, 0);
 441                         if (*ep != '\0')
 442                                 mtree_err("invalid number `%s'",
 443                                     p);
 444                         if (argc > MAX_PACK_ARGS)
 445                                 mtree_err("too many arguments");
 446                 }
 447                 if (argc < 2)
 448                         mtree_err("not enough arguments");
 449                 result = (*pack)(argc, numbers, &error);
 450                 if (error != NULL)
 451                         mtree_err("%s", error);
 452         } else {
 453                 result = (dev_t)strtoul(arg, &ep, 0);
 454                 if (*ep != '\0')
 455                         mtree_err("invalid device `%s'", arg);
 456         }
 457         return (result);
 458 }
 459
 460 static void
 461 replacenode(NODE *cur, NODE *new)
 462 {
 463
 464 #define REPLACE(x)      cur->x = new->x
 465 #define REPLACESTR(x)   REPLACEPTR(cur->x,new->x)
 466
 467         if (cur->type != new->type) {
 468                 if (mtree_Mflag) {
 469                                 /*
 470                                  * merge entries with different types; we
 471                                  * don't want children retained in this case.
 472                                  */
 473                         REPLACE(type);
 474                         free_nodes(cur->child);
 475                         cur->child = NULL;
 476                 } else {
 477                         mtree_err(
 478                             "existing entry for `%s', type `%s'"
 479                             " does not match type `%s'",
 480                             cur->name, nodetype(cur->type),
 481                             nodetype(new->type));
 482                 }
 483         }
 484
 485         REPLACE(st_size);
 486         REPLACE(st_mtimespec);
 487         REPLACESTR(slink);
 488         if (cur->slink != NULL) {
 489                 if ((cur->slink = strdup(new->slink)) == NULL)
 490                         mtree_err("memory allocation error");
 491                 if (strunvis(cur->slink, new->slink) == -1)
 492                         mtree_err("strunvis failed on `%s'", new->slink);
 493                 free(new->slink);
 494         }
 495         REPLACE(st_uid);
 496         REPLACE(st_gid);
 497         REPLACE(st_mode);
 498         REPLACE(st_rdev);
 499         REPLACE(st_flags);
 500         REPLACE(st_nlink);
 501         REPLACE(cksum);
 502         REPLACESTR(md5digest);
 503         REPLACESTR(rmd160digest);
 504         REPLACESTR(sha1digest);
 505         REPLACESTR(sha256digest);
 506         REPLACESTR(sha384digest);
 507         REPLACESTR(sha512digest);
 508         REPLACESTR(tags);
 509         REPLACE(lineno);
 510         REPLACE(flags);
 511         free(new);
 512 }
 513
 514 static void
 515 set(char *t, NODE *ip)
 516 {
 517         int     type, value, len;
 518         gid_t   gid;
 519         uid_t   uid;
 520         char    *kw, *val, *md, *ep;
 521         void    *m;
 522
 523         while ((kw = strsep(&t, "= \t")) != NULL) {
 524                 if (*kw == '\0')
 525                         continue;
 526                 if (strcmp(kw, "all") == 0)
 527                         mtree_err("invalid keyword `all'");
 528                 ip->flags |= type = parsekey(kw, &value);
 529                 if (!value)
 530                         /* Just set flag bit (F_IGN and F_OPT) */
 531                         continue;
 532                 while ((val = strsep(&t, " \t")) != NULL && *val == '\0')
 533                         continue;
 534                 if (val == NULL)
 535                         mtree_err("missing value");
 536                 switch (type) {
 537                 case F_CKSUM:
 538                         ip->cksum = strtoul(val, &ep, 10);
 539                         if (*ep)
 540                                 mtree_err("invalid checksum `%s'", val);
 541                         break;
 542                 case F_DEV:
 543                         ip->st_rdev = parsedev(val);
 544                         break;
 545                 case F_FLAGS:
 546                         if (strcmp("none", val) == 0)
 547                                 ip->st_flags = 0;
 548                         else if (string_to_flags(&val, &ip->st_flags, NULL)
 549                             != 0)
 550                                 mtree_err("invalid flag `%s'", val);
 551                         break;
 552                 case F_GID:
 553                         ip->st_gid = (gid_t)strtoul(val, &ep, 10);
 554                         if (*ep)
 555                                 mtree_err("invalid gid `%s'", val);
 556                         break;
 557                 case F_GNAME:
 558                         if (mtree_Wflag)        /* don't parse if whacking */
 559                                 break;
 560                         if (gid_from_group(val, &gid) == -1)
 561                                 mtree_err("unknown group `%s'", val);
 562                         ip->st_gid = gid;
 563                         break;
 564                 case F_MD5:
 565                         if (val[0]=='0' && val[1]=='x')
 566                                 md=&val[2];
 567                         else
 568                                 md=val;
 569                         if ((ip->md5digest = strdup(md)) == NULL)
 570                                 mtree_err("memory allocation error");
 571                         break;
 572                 case F_MODE:
 573                         if ((m = setmode(val)) == NULL)
 574                                 mtree_err("cannot set file mode `%s' (%s)",
 575                                     val, strerror(errno));
 576                         ip->st_mode = getmode(m, 0);
 577                         free(m);
 578                         break;
 579                 case F_NLINK:
 580                         ip->st_nlink = (nlink_t)strtoul(val, &ep, 10);
 581                         if (*ep)
 582                                 mtree_err("invalid link count `%s'", val);
 583                         break;
 584                 case F_RMD160:
 585                         if (val[0]=='0' && val[1]=='x')
 586                                 md=&val[2];
 587                         else
 588                                 md=val;
 589                         if ((ip->rmd160digest = strdup(md)) == NULL)
 590                                 mtree_err("memory allocation error");
 591                         break;
 592                 case F_SHA1:
 593                         if (val[0]=='0' && val[1]=='x')
 594                                 md=&val[2];
 595                         else
 596                                 md=val;
 597                         if ((ip->sha1digest = strdup(md)) == NULL)
 598                                 mtree_err("memory allocation error");
 599                         break;
 600                 case F_SIZE:
 601                         ip->st_size = (off_t)strtoll(val, &ep, 10);
 602                         if (*ep)
 603                                 mtree_err("invalid size `%s'", val);
 604                         break;
 605                 case F_SLINK:
 606                         if ((ip->slink = strdup(val)) == NULL)
 607                                 mtree_err("memory allocation error");
 608                         if (strunvis(ip->slink, val) == -1)
 609                                 mtree_err("strunvis failed on `%s'", val);
 610                         break;
 611                 case F_TAGS:
 612                         len = strlen(val) + 3;  /* "," + str + ",\0" */
 613                         if ((ip->tags = malloc(len)) == NULL)
 614                                 mtree_err("memory allocation error");
 615                         snprintf(ip->tags, len, ",%s,", val);
 616                         break;
 617                 case F_TIME:
 618                         ip->st_mtimespec.tv_sec =
 619                             (time_t)strtoll(val, &ep, 10);
 620                         if (*ep != '.')
 621                                 mtree_err("invalid time `%s'", val);
 622                         val = ep + 1;
 623                         ip->st_mtimespec.tv_nsec = strtol(val, &ep, 10);
 624                         if (*ep)
 625                                 mtree_err("invalid time `%s'", val);
 626                         break;
 627                 case F_TYPE:
 628                         ip->type = parsetype(val);
 629                         break;
 630                 case F_UID:
 631                         ip->st_uid = (uid_t)strtoul(val, &ep, 10);
 632                         if (*ep)
 633                                 mtree_err("invalid uid `%s'", val);
 634                         break;
 635                 case F_UNAME:
 636                         if (mtree_Wflag)        /* don't parse if whacking */
 637                                 break;
 638                         if (uid_from_user(val, &uid) == -1)
 639                                 mtree_err("unknown user `%s'", val);
 640                         ip->st_uid = uid;
 641                         break;
 642                 case F_SHA256:
 643                         if (val[0]=='0' && val[1]=='x')
 644                                 md=&val[2];
 645                         else
 646                                 md=val;
 647                         if ((ip->sha256digest = strdup(md)) == NULL)
 648                                 mtree_err("memory allocation error");
 649                         break;
 650                 case F_SHA384:
 651                         if (val[0]=='0' && val[1]=='x')
 652                                 md=&val[2];
 653                         else
 654                                 md=val;
 655                         if ((ip->sha384digest = strdup(md)) == NULL)
 656                                 mtree_err("memory allocation error");
 657                         break;
 658                 case F_SHA512:
 659                         if (val[0]=='0' && val[1]=='x')
 660                                 md=&val[2];
 661                         else
 662                                 md=val;
 663                         if ((ip->sha512digest = strdup(md)) == NULL)
 664                                 mtree_err("memory allocation error");
 665                         break;
 666                 default:
 667                         mtree_err(
 668                             "set(): unsupported key type 0x%x (INTERNAL ERROR)",
 669                             type);
 670                         /* NOTREACHED */
 671                 }
 672         }
 673 }
 674
 675 static void
 676 unset(char *t, NODE *ip)
 677 {
 678         char *p;
 679
 680         while ((p = strsep(&t, " \t")) != NULL) {
 681                 if (*p == '\0')
 682                         continue;
 683                 ip->flags &= ~parsekey(p, NULL);
 684         }
 685 }
 686
 687 /*
 688  * addchild --
 689  *      Add the centry node as a child of the pathparent node.  If
 690  *      centry is a duplicate, call replacenode().  If centry is not
 691  *      a duplicate, insert it into the linked list referenced by
 692  *      pathparent->child.  Keep the list sorted if Sflag is set.
 693  */
 694 static void
 695 addchild(NODE *pathparent, NODE *centry)
 696 {
 697         NODE *samename;      /* node with the same name as centry */
 698         NODE *replacepos;    /* if non-NULL, centry should replace this node */
 699         NODE *insertpos;     /* if non-NULL, centry should be inserted
 700                               * after this node */
 701         NODE *cur;           /* for stepping through the list */
 702         NODE *last;          /* the last node in the list */
 703         int cmp;
 704
 705         samename = NULL;
 706         replacepos = NULL;
 707         insertpos = NULL;
 708         last = NULL;
 709         cur = pathparent->child;
 710         if (cur == NULL) {
 711                 /* centry is pathparent's first and only child node so far */
 712                 pathparent->child = centry;
 713                 return;
 714         }
 715
 716         /*
 717          * pathparent already has at least one other child, so add the
 718          * centry node to the list.
 719          *
 720          * We first scan through the list looking for an existing node
 721          * with the same name (setting samename), and also looking
 722          * for the correct position to replace or insert the new node
 723          * (setting replacepos and/or insertpos).
 724          */
 725         for (; cur != NULL; last = cur, cur = cur->next) {
 726                 if (strcmp(centry->name, cur->name) == 0) {
 727                         samename = cur;
 728                 }
 729                 if (mtree_Sflag) {
 730                         cmp = nodecmp(centry, cur);
 731                         if (cmp == 0) {
 732                                 replacepos = cur;
 733                         } else if (cmp > 0) {
 734                                 insertpos = cur;
 735                         }
 736                 }
 737         }
 738         if (! mtree_Sflag) {
 739                 if (samename != NULL) {
 740                         /* replace node with same name */
 741                         replacepos = samename;
 742                 } else {
 743                         /* add new node at end of list */
 744                         insertpos = last;
 745                 }
 746         }
 747
 748         if (samename != NULL) {
 749                 /*
 750                  * We found a node with the same name above.  Call
 751                  * replacenode(), which will either exit with an error,
 752                  * or replace the information in the samename node and
 753                  * free the information in the centry node.
 754                  */
 755                 replacenode(samename, centry);
 756                 if (samename == replacepos) {
 757                         /* The just-replaced node was in the correct position */
 758                         return;
 759                 }
 760                 if (samename == insertpos || samename->prev == insertpos) {
 761                         /*
 762                          * We thought the new node should be just before
 763                          * or just after the replaced node, but that would
 764                          * be equivalent to just retaining the replaced node.
 765                          */
 766                         return;
 767                 }
 768
 769                 /*
 770                  * The just-replaced node is in the wrong position in
 771                  * the list.  This can happen if sort order depends on
 772                  * criteria other than the node name.
 773                  *
 774                  * Make centry point to the just-replaced node.  Unlink
 775                  * the just-replaced node from the list, and allow it to
 776                  * be insterted in the correct position later.
 777                  */
 778                 centry = samename;
 779                 if (centry->prev)
 780                         centry->prev->next = centry->next;
 781                 else {
 782                         /* centry->next is the new head of the list */
 783                         pathparent->child = centry->next;
 784                         assert(centry->next != NULL);
 785                 }
 786                 if (centry->next)
 787                         centry->next->prev = centry->prev;
 788                 centry->prev = NULL;
 789                 centry->next = NULL;
 790         }
 791
 792         if (insertpos == NULL) {
 793                 /* insert centry at the beginning of the list */
 794                 pathparent->child->prev = centry;
 795                 centry->next = pathparent->child;
 796                 centry->prev = NULL;
 797                 pathparent->child = centry;
 798         } else {
 799                 /* insert centry into the list just after insertpos */
 800                 centry->next = insertpos->next;
 801                 insertpos->next = centry;
 802                 centry->prev = insertpos;
 803                 if (centry->next)
 804                         centry->next->prev = centry;
 805         }
 806         return;
 807 }
 808
 809 /*
 810  * nodecmp --
 811  *      used as a comparison function by addchild() to control the order
 812  *      in which entries appear within a list of sibling nodes.  We make
 813  *      directories sort after non-directories, but otherwise sort in
 814  *      strcmp() order.
 815  *
 816  * Keep this in sync with dcmp() in create.c.
 817  */
 818 static int
 819 nodecmp(const NODE *a, const NODE *b)
 820 {
 821
 822         if ((a->type & F_DIR) != 0) {
 823                 if ((b->type & F_DIR) == 0)
 824                         return 1;
 825         } else if ((b->type & F_DIR) != 0)
 826                 return -1;
 827         return strcmp(a->name, b->name);
 828 }