1 /* $NetBSD: spec.c,v 1.89 2014/04/24 17:22:41 christos Exp $ */
4 * Copyright (c) 1989, 1993
5 * The Regents of the University of California. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
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.
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
33 * Copyright (c) 2001-2004 The NetBSD Foundation, Inc.
34 * All rights reserved.
36 * This code is derived from software contributed to The NetBSD Foundation
37 * by Luke Mewburn of Wasabi Systems.
39 * Redistribution and use in source and binary forms, with or without
40 * modification, are permitted provided that the following conditions
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.
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.
61 #if HAVE_NBTOOL_CONFIG_H
62 #include "nbtool_config.h"
65 #include <sys/cdefs.h>
66 #if defined(__RCSID) && !defined(lint)
68 static char sccsid[] = "@(#)spec.c 8.2 (Berkeley) 4/28/95";
70 __RCSID("$NetBSD: spec.c,v 1.89 2014/04/24 17:22:41 christos Exp $");
74 #include <sys/param.h>
94 size_t mtree_lineno; /* Current spec line number */
95 int mtree_Mflag; /* Merge duplicate entries */
96 int mtree_Wflag; /* Don't "whack" permissions */
97 int mtree_Sflag; /* Sort entries */
99 static dev_t parsedev(char *);
100 static void replacenode(NODE *, NODE *);
101 static void set(char *, NODE *);
102 static void unset(char *, NODE *);
103 static void addchild(NODE *, NODE *);
104 static int nodecmp(const NODE *, const NODE *);
105 static int appendfield(FILE *, int, const char *, ...) __printflike(3, 4);
107 #define REPLACEPTR(x,v) do { if ((x)) free((x)); (x) = (v); } while (0)
112 NODE *centry, *last, *pathparent, *cur;
115 char *buf, *tname, *ntname;
116 size_t tnamelen, plen;
119 centry = last = NULL;
122 memset(&ginfo, 0, sizeof(ginfo));
123 for (mtree_lineno = 0;
124 (buf = fparseln(fp, NULL, &mtree_lineno, NULL,
125 FPARSELN_UNESCCOMM));
127 /* Skip leading whitespace. */
128 for (p = buf; *p && isspace((unsigned char)*p); ++p)
131 /* If nothing but whitespace, continue. */
136 fprintf(stderr, "line %lu: {%s}\n",
137 (u_long)mtree_lineno, p);
139 /* Grab file name, "$", "set", or "unset". */
141 while ((p = strsep(&next, " \t")) != NULL && *p == '\0')
144 mtree_err("missing field");
147 if (strcmp(p + 1, "set") == 0)
149 else if (strcmp(p + 1, "unset") == 0)
152 mtree_err("invalid specification `%s'", p);
156 if (strcmp(p, "..") == 0) {
157 /* Don't go up, if haven't gone down. */
160 if (last->type != F_DIR || last->flags & F_DONE) {
165 last->flags |= F_DONE;
168 noparent: mtree_err("no parent node");
171 plen = strlen(p) + 1;
172 if (plen > tnamelen) {
173 if ((ntname = realloc(tname, plen)) == NULL)
174 mtree_err("realloc: %s", strerror(errno));
178 if (strunvis(tname, p) == -1)
179 mtree_err("strunvis failed on `%s'", p);
183 if (strchr(p, '/') != NULL) {
185 for (; (e = strchr(p, '/')) != NULL; p = e+1) {
187 continue; /* handle // */
189 if (strcmp(p, ".") != 0) {
191 strcmp(cur->name, p) != 0) {
195 if (cur == NULL || cur->type != F_DIR) {
196 mtree_err("%s: %s", tname,
197 "missing directory in specification");
204 mtree_err("%s: empty leaf element", tname);
207 if ((centry = calloc(1, sizeof(NODE) + strlen(p))) == NULL)
208 mtree_err("%s", strerror(errno));
210 centry->lineno = mtree_lineno;
211 strcpy(centry->name, p);
213 if (strpbrk(p, MAGIC))
214 centry->flags |= F_MAGIC;
222 * Allow a bare "." root node by forcing it to
223 * type=dir for compatibility with FreeBSD.
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)
230 "root node must be the directory `.'");
231 last = root = centry;
233 } else if (pathparent != NULL) {
235 * full path entry; add or replace
237 centry->parent = pathparent;
238 addchild(pathparent, centry);
240 } else if (strcmp(centry->name, ".") == 0) {
242 * duplicate "." entry; always replace
244 replacenode(root, centry);
245 } else if (last->type == F_DIR && !(last->flags & F_DONE)) {
247 * new relative child in current dir;
250 centry->parent = last;
251 addchild(last, centry);
255 * new relative child in parent dir
256 * (after encountering ".." entry);
259 centry->parent = last->parent;
260 addchild(last->parent, centry);
268 free_nodes(NODE *root)
276 for (cur = root; cur != NULL; 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);
293 * Like fprintf(), but output a space either before or after
294 * the regular output, according to the pathlast flag.
297 appendfield(FILE *fp, int pathlast, const char *fmt, ...)
305 result = vprintf(fmt, ap);
314 * dump the NODEs from `cur', based in the directory `dir'.
315 * if pathlast is none zero, print the path last, otherwise print
319 dump_nodes(FILE *fp, const char *dir, NODE *root, int pathlast)
322 char path[MAXPATHLEN];
327 for (cur = root; cur != NULL; cur = cur->next) {
328 if (cur->type != F_DIR && !matchtags(cur))
331 if (snprintf(path, sizeof(path), "%s%s%s",
332 dir, *dir ? "/" : "", cur->name)
333 >= (int)sizeof(path))
334 mtree_err("Pathname too long.");
337 fprintf(fp, "%s", vispath(path));
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);
348 appendfield(fp, pathlast, "uid=%u",
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);
356 appendfield(fp, pathlast, "gid=%u",
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=%ju",
367 (uintmax_t)cur->st_nlink);
368 if (MATCHFLAG(F_SLINK))
369 appendfield(fp, pathlast, "link=%s",
370 vispath(cur->slink));
371 if (MATCHFLAG(F_SIZE))
372 appendfield(fp, pathlast, "size=%ju",
373 (uintmax_t)cur->st_size);
374 if (MATCHFLAG(F_TIME))
375 appendfield(fp, pathlast, "time=%jd.%09ld",
376 (intmax_t)cur->st_mtimespec.tv_sec,
377 cur->st_mtimespec.tv_nsec);
378 if (MATCHFLAG(F_CKSUM))
379 appendfield(fp, pathlast, "cksum=%lu", cur->cksum);
380 if (MATCHFLAG(F_MD5))
381 appendfield(fp, pathlast, "%s=%s", MD5KEY,
383 if (MATCHFLAG(F_RMD160))
384 appendfield(fp, pathlast, "%s=%s", RMD160KEY,
386 if (MATCHFLAG(F_SHA1))
387 appendfield(fp, pathlast, "%s=%s", SHA1KEY,
389 if (MATCHFLAG(F_SHA256))
390 appendfield(fp, pathlast, "%s=%s", SHA256KEY,
392 if (MATCHFLAG(F_SHA384))
393 appendfield(fp, pathlast, "%s=%s", SHA384KEY,
395 if (MATCHFLAG(F_SHA512))
396 appendfield(fp, pathlast, "%s=%s", SHA512KEY,
398 if (MATCHFLAG(F_FLAGS)) {
399 str = flags_to_string(cur->st_flags, "none");
400 appendfield(fp, pathlast, "flags=%s", str);
403 if (MATCHFLAG(F_IGN))
404 appendfield(fp, pathlast, "ignore");
405 if (MATCHFLAG(F_OPT))
406 appendfield(fp, pathlast, "optional");
407 if (MATCHFLAG(F_TAGS)) {
408 /* don't output leading or trailing commas */
413 while(q > p && q[-1] == ',')
415 appendfield(fp, pathlast, "tags=%.*s", (int)(q - p), p);
417 puts(pathlast ? vispath(path) : "");
420 dump_nodes(fp, path, cur->child, pathlast);
426 * strsvis(3) encodes path, which must not be longer than MAXPATHLEN
427 * characters long, and returns a pointer to a static buffer containing
431 vispath(const char *path)
433 static const char extra[] = { ' ', '\t', '\n', '\\', '#', '\0' };
434 static const char extra_glob[] = { ' ', '\t', '\n', '\\', '#', '*',
436 static char pathbuf[4*MAXPATHLEN + 1];
438 if (flavor == F_NETBSD6)
439 strsvis(pathbuf, path, VIS_CSTYLE, extra);
441 strsvis(pathbuf, path, VIS_OCTAL, extra_glob);
449 #define MAX_PACK_ARGS 3
450 u_long numbers[MAX_PACK_ARGS];
455 const char *error = NULL;
457 if ((dev = strchr(arg, ',')) != NULL) {
459 if ((pack = pack_find(arg)) == NULL)
460 mtree_err("unknown format `%s'", arg);
462 while ((p = strsep(&dev, ",")) != NULL) {
464 mtree_err("missing number");
465 numbers[argc++] = strtoul(p, &ep, 0);
467 mtree_err("invalid number `%s'",
469 if (argc > MAX_PACK_ARGS)
470 mtree_err("too many arguments");
473 mtree_err("not enough arguments");
474 result = (*pack)(argc, numbers, &error);
476 mtree_err("%s", error);
478 result = (dev_t)strtoul(arg, &ep, 0);
480 mtree_err("invalid device `%s'", arg);
486 replacenode(NODE *cur, NODE *new)
489 #define REPLACE(x) cur->x = new->x
490 #define REPLACESTR(x) REPLACEPTR(cur->x,new->x)
492 if (cur->type != new->type) {
495 * merge entries with different types; we
496 * don't want children retained in this case.
499 free_nodes(cur->child);
503 "existing entry for `%s', type `%s'"
504 " does not match type `%s'",
505 cur->name, nodetype(cur->type),
506 nodetype(new->type));
511 REPLACE(st_mtimespec);
513 if (cur->slink != NULL) {
514 if ((cur->slink = strdup(new->slink)) == NULL)
515 mtree_err("memory allocation error");
516 if (strunvis(cur->slink, new->slink) == -1)
517 mtree_err("strunvis failed on `%s'", new->slink);
527 REPLACESTR(md5digest);
528 REPLACESTR(rmd160digest);
529 REPLACESTR(sha1digest);
530 REPLACESTR(sha256digest);
531 REPLACESTR(sha384digest);
532 REPLACESTR(sha512digest);
540 set(char *t, NODE *ip)
542 int type, value, len;
545 char *kw, *val, *md, *ep;
548 while ((kw = strsep(&t, "= \t")) != NULL) {
551 if (strcmp(kw, "all") == 0)
552 mtree_err("invalid keyword `all'");
553 ip->flags |= type = parsekey(kw, &value);
555 /* Just set flag bit (F_IGN and F_OPT) */
557 while ((val = strsep(&t, " \t")) != NULL && *val == '\0')
560 mtree_err("missing value");
563 ip->cksum = strtoul(val, &ep, 10);
565 mtree_err("invalid checksum `%s'", val);
568 ip->st_rdev = parsedev(val);
571 if (strcmp("none", val) == 0)
573 else if (string_to_flags(&val, &ip->st_flags, NULL)
575 mtree_err("invalid flag `%s'", val);
578 ip->st_gid = (gid_t)strtoul(val, &ep, 10);
580 mtree_err("invalid gid `%s'", val);
583 if (mtree_Wflag) /* don't parse if whacking */
585 if (gid_from_group(val, &gid) == -1)
586 mtree_err("unknown group `%s'", val);
590 if (val[0]=='0' && val[1]=='x')
594 if ((ip->md5digest = strdup(md)) == NULL)
595 mtree_err("memory allocation error");
598 if ((m = setmode(val)) == NULL)
599 mtree_err("cannot set file mode `%s' (%s)",
600 val, strerror(errno));
601 ip->st_mode = getmode(m, 0);
605 ip->st_nlink = (nlink_t)strtoul(val, &ep, 10);
607 mtree_err("invalid link count `%s'", val);
610 if (val[0]=='0' && val[1]=='x')
614 if ((ip->rmd160digest = strdup(md)) == NULL)
615 mtree_err("memory allocation error");
618 if (val[0]=='0' && val[1]=='x')
622 if ((ip->sha1digest = strdup(md)) == NULL)
623 mtree_err("memory allocation error");
626 ip->st_size = (off_t)strtoll(val, &ep, 10);
628 mtree_err("invalid size `%s'", val);
631 if ((ip->slink = strdup(val)) == NULL)
632 mtree_err("memory allocation error");
633 if (strunvis(ip->slink, val) == -1)
634 mtree_err("strunvis failed on `%s'", val);
637 len = strlen(val) + 3; /* "," + str + ",\0" */
638 if ((ip->tags = malloc(len)) == NULL)
639 mtree_err("memory allocation error");
640 snprintf(ip->tags, len, ",%s,", val);
643 ip->st_mtimespec.tv_sec =
644 (time_t)strtoll(val, &ep, 10);
646 mtree_err("invalid time `%s'", val);
648 ip->st_mtimespec.tv_nsec = strtol(val, &ep, 10);
650 mtree_err("invalid time `%s'", val);
653 ip->type = parsetype(val);
656 ip->st_uid = (uid_t)strtoul(val, &ep, 10);
658 mtree_err("invalid uid `%s'", val);
661 if (mtree_Wflag) /* don't parse if whacking */
663 if (uid_from_user(val, &uid) == -1)
664 mtree_err("unknown user `%s'", val);
668 if (val[0]=='0' && val[1]=='x')
672 if ((ip->sha256digest = strdup(md)) == NULL)
673 mtree_err("memory allocation error");
676 if (val[0]=='0' && val[1]=='x')
680 if ((ip->sha384digest = strdup(md)) == NULL)
681 mtree_err("memory allocation error");
684 if (val[0]=='0' && val[1]=='x')
688 if ((ip->sha512digest = strdup(md)) == NULL)
689 mtree_err("memory allocation error");
693 "set(): unsupported key type 0x%x (INTERNAL ERROR)",
701 unset(char *t, NODE *ip)
705 while ((p = strsep(&t, " \t")) != NULL) {
708 ip->flags &= ~parsekey(p, NULL);
714 * Add the centry node as a child of the pathparent node. If
715 * centry is a duplicate, call replacenode(). If centry is not
716 * a duplicate, insert it into the linked list referenced by
717 * pathparent->child. Keep the list sorted if Sflag is set.
720 addchild(NODE *pathparent, NODE *centry)
722 NODE *samename; /* node with the same name as centry */
723 NODE *replacepos; /* if non-NULL, centry should replace this node */
724 NODE *insertpos; /* if non-NULL, centry should be inserted
726 NODE *cur; /* for stepping through the list */
727 NODE *last; /* the last node in the list */
734 cur = pathparent->child;
736 /* centry is pathparent's first and only child node so far */
737 pathparent->child = centry;
742 * pathparent already has at least one other child, so add the
743 * centry node to the list.
745 * We first scan through the list looking for an existing node
746 * with the same name (setting samename), and also looking
747 * for the correct position to replace or insert the new node
748 * (setting replacepos and/or insertpos).
750 for (; cur != NULL; last = cur, cur = cur->next) {
751 if (strcmp(centry->name, cur->name) == 0) {
755 cmp = nodecmp(centry, cur);
758 } else if (cmp > 0) {
764 if (samename != NULL) {
765 /* replace node with same name */
766 replacepos = samename;
768 /* add new node at end of list */
773 if (samename != NULL) {
775 * We found a node with the same name above. Call
776 * replacenode(), which will either exit with an error,
777 * or replace the information in the samename node and
778 * free the information in the centry node.
780 replacenode(samename, centry);
781 if (samename == replacepos) {
782 /* The just-replaced node was in the correct position */
785 if (samename == insertpos || samename->prev == insertpos) {
787 * We thought the new node should be just before
788 * or just after the replaced node, but that would
789 * be equivalent to just retaining the replaced node.
795 * The just-replaced node is in the wrong position in
796 * the list. This can happen if sort order depends on
797 * criteria other than the node name.
799 * Make centry point to the just-replaced node. Unlink
800 * the just-replaced node from the list, and allow it to
801 * be insterted in the correct position later.
805 centry->prev->next = centry->next;
807 /* centry->next is the new head of the list */
808 pathparent->child = centry->next;
809 assert(centry->next != NULL);
812 centry->next->prev = centry->prev;
817 if (insertpos == NULL) {
818 /* insert centry at the beginning of the list */
819 pathparent->child->prev = centry;
820 centry->next = pathparent->child;
822 pathparent->child = centry;
824 /* insert centry into the list just after insertpos */
825 centry->next = insertpos->next;
826 insertpos->next = centry;
827 centry->prev = insertpos;
829 centry->next->prev = centry;
836 * used as a comparison function by addchild() to control the order
837 * in which entries appear within a list of sibling nodes. We make
838 * directories sort after non-directories, but otherwise sort in
841 * Keep this in sync with dcmp() in create.c.
844 nodecmp(const NODE *a, const NODE *b)
847 if ((a->type & F_DIR) != 0) {
848 if ((b->type & F_DIR) == 0)
850 } else if ((b->type & F_DIR) != 0)
852 return strcmp(a->name, b->name);