1 /* $NetBSD: spec.c,v 1.85 2012/12/20 16:43:16 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.85 2012/12/20 16:43:16 christos Exp $");
74 #include <sys/param.h>
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 */
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);
106 #define REPLACEPTR(x,v) do { if ((x)) free((x)); (x) = (v); } while (0)
111 NODE *centry, *last, *pathparent, *cur;
114 char *buf, *tname, *ntname;
115 size_t tnamelen, plen;
118 centry = last = NULL;
121 memset(&ginfo, 0, sizeof(ginfo));
122 for (mtree_lineno = 0;
123 (buf = fparseln(fp, NULL, &mtree_lineno, NULL,
124 FPARSELN_UNESCCOMM));
126 /* Skip leading whitespace. */
127 for (p = buf; *p && isspace((unsigned char)*p); ++p)
130 /* If nothing but whitespace, continue. */
135 fprintf(stderr, "line %lu: {%s}\n",
136 (u_long)mtree_lineno, p);
138 /* Grab file name, "$", "set", or "unset". */
140 while ((p = strsep(&next, " \t")) != NULL && *p == '\0')
143 mtree_err("missing field");
146 if (strcmp(p + 1, "set") == 0)
148 else if (strcmp(p + 1, "unset") == 0)
151 mtree_err("invalid specification `%s'", p);
155 if (strcmp(p, "..") == 0) {
156 /* Don't go up, if haven't gone down. */
159 if (last->type != F_DIR || last->flags & F_DONE) {
164 last->flags |= F_DONE;
167 noparent: mtree_err("no parent node");
170 plen = strlen(p) + 1;
171 if (plen > tnamelen) {
172 if ((ntname = realloc(tname, plen)) == NULL)
173 mtree_err("realloc: %s", strerror(errno));
177 if (strunvis(tname, p) == -1)
178 mtree_err("strunvis failed on `%s'", p);
182 if (strchr(p, '/') != NULL) {
184 for (; (e = strchr(p, '/')) != NULL; p = e+1) {
186 continue; /* handle // */
188 if (strcmp(p, ".") != 0) {
190 strcmp(cur->name, p) != 0) {
194 if (cur == NULL || cur->type != F_DIR) {
195 mtree_err("%s: %s", tname,
196 "missing directory in specification");
203 mtree_err("%s: empty leaf element", tname);
206 if ((centry = calloc(1, sizeof(NODE) + strlen(p))) == NULL)
207 mtree_err("%s", strerror(errno));
209 centry->lineno = mtree_lineno;
210 strcpy(centry->name, p);
212 if (strpbrk(p, MAGIC))
213 centry->flags |= F_MAGIC;
220 if (strcmp(centry->name, ".") != 0 ||
221 centry->type != F_DIR)
223 "root node must be the directory `.'");
224 last = root = centry;
226 } else if (pathparent != NULL) {
228 * full path entry; add or replace
230 centry->parent = pathparent;
231 addchild(pathparent, centry);
233 } else if (strcmp(centry->name, ".") == 0) {
235 * duplicate "." entry; always replace
237 replacenode(root, centry);
238 } else if (last->type == F_DIR && !(last->flags & F_DONE)) {
240 * new relative child in current dir;
243 centry->parent = last;
244 addchild(last, centry);
248 * new relative child in parent dir
249 * (after encountering ".." entry);
252 centry->parent = last->parent;
253 addchild(last->parent, centry);
261 free_nodes(NODE *root)
269 for (cur = root; cur != NULL; 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);
286 * Like printf(), but output a space either before or after
287 * the regular output, according to the pathlast flag.
290 appendfield(int pathlast, const char *fmt, ...)
298 result = vprintf(fmt, ap);
307 * dump the NODEs from `cur', based in the directory `dir'.
308 * if pathlast is none zero, print the path last, otherwise print
312 dump_nodes(const char *dir, NODE *root, int pathlast)
315 char path[MAXPATHLEN];
320 for (cur = root; cur != NULL; cur = cur->next) {
321 if (cur->type != F_DIR && !matchtags(cur))
324 if (snprintf(path, sizeof(path), "%s%s%s",
325 dir, *dir ? "/" : "", cur->name)
326 >= (int)sizeof(path))
327 mtree_err("Pathname too long.");
330 printf("%s", vispath(path));
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);
340 appendfield(pathlast, "uid=%u", cur->st_uid);
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);
347 appendfield(pathlast, "gid=%u", cur->st_gid);
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,
371 if (MATCHFLAG(F_SHA1))
372 appendfield(pathlast, "%s=%s", SHA1KEY,
374 if (MATCHFLAG(F_SHA256))
375 appendfield(pathlast, "%s=%s", SHA256KEY,
377 if (MATCHFLAG(F_SHA384))
378 appendfield(pathlast, "%s=%s", SHA384KEY,
380 if (MATCHFLAG(F_SHA512))
381 appendfield(pathlast, "%s=%s", SHA512KEY,
383 if (MATCHFLAG(F_FLAGS)) {
384 str = flags_to_string(cur->st_flags, "none");
385 appendfield(pathlast, "flags=%s", str);
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 */
398 while(q > p && q[-1] == ',')
400 appendfield(pathlast, "tags=%.*s", (int)(q - p), p);
402 puts(pathlast ? vispath(path) : "");
405 dump_nodes(path, cur->child, pathlast);
411 * strsvis(3) encodes path, which must not be longer than MAXPATHLEN
412 * characters long, and returns a pointer to a static buffer containing
416 vispath(const char *path)
418 static const char extra[] = { ' ', '\t', '\n', '\\', '#', '\0' };
419 static const char extra_glob[] = { ' ', '\t', '\n', '\\', '#', '*',
421 static char pathbuf[4*MAXPATHLEN + 1];
423 if (flavor == F_NETBSD6)
424 strsvis(pathbuf, path, VIS_CSTYLE, extra);
426 strsvis(pathbuf, path, VIS_OCTAL, extra_glob);
434 #define MAX_PACK_ARGS 3
435 u_long numbers[MAX_PACK_ARGS];
440 const char *error = NULL;
442 if ((dev = strchr(arg, ',')) != NULL) {
444 if ((pack = pack_find(arg)) == NULL)
445 mtree_err("unknown format `%s'", arg);
447 while ((p = strsep(&dev, ",")) != NULL) {
449 mtree_err("missing number");
450 numbers[argc++] = strtoul(p, &ep, 0);
452 mtree_err("invalid number `%s'",
454 if (argc > MAX_PACK_ARGS)
455 mtree_err("too many arguments");
458 mtree_err("not enough arguments");
459 result = (*pack)(argc, numbers, &error);
461 mtree_err("%s", error);
463 result = (dev_t)strtoul(arg, &ep, 0);
465 mtree_err("invalid device `%s'", arg);
471 replacenode(NODE *cur, NODE *new)
474 #define REPLACE(x) cur->x = new->x
475 #define REPLACESTR(x) REPLACEPTR(cur->x,new->x)
477 if (cur->type != new->type) {
480 * merge entries with different types; we
481 * don't want children retained in this case.
484 free_nodes(cur->child);
488 "existing entry for `%s', type `%s'"
489 " does not match type `%s'",
490 cur->name, nodetype(cur->type),
491 nodetype(new->type));
496 REPLACE(st_mtimespec);
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);
512 REPLACESTR(md5digest);
513 REPLACESTR(rmd160digest);
514 REPLACESTR(sha1digest);
515 REPLACESTR(sha256digest);
516 REPLACESTR(sha384digest);
517 REPLACESTR(sha512digest);
525 set(char *t, NODE *ip)
527 int type, value, len;
530 char *kw, *val, *md, *ep;
533 while ((kw = strsep(&t, "= \t")) != NULL) {
536 if (strcmp(kw, "all") == 0)
537 mtree_err("invalid keyword `all'");
538 ip->flags |= type = parsekey(kw, &value);
540 /* Just set flag bit (F_IGN and F_OPT) */
542 while ((val = strsep(&t, " \t")) != NULL && *val == '\0')
545 mtree_err("missing value");
548 ip->cksum = strtoul(val, &ep, 10);
550 mtree_err("invalid checksum `%s'", val);
553 ip->st_rdev = parsedev(val);
556 if (strcmp("none", val) == 0)
558 else if (string_to_flags(&val, &ip->st_flags, NULL)
560 mtree_err("invalid flag `%s'", val);
563 ip->st_gid = (gid_t)strtoul(val, &ep, 10);
565 mtree_err("invalid gid `%s'", val);
568 if (mtree_Wflag) /* don't parse if whacking */
570 if (gid_from_group(val, &gid) == -1)
571 mtree_err("unknown group `%s'", val);
575 if (val[0]=='0' && val[1]=='x')
579 if ((ip->md5digest = strdup(md)) == NULL)
580 mtree_err("memory allocation error");
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);
590 ip->st_nlink = (nlink_t)strtoul(val, &ep, 10);
592 mtree_err("invalid link count `%s'", val);
595 if (val[0]=='0' && val[1]=='x')
599 if ((ip->rmd160digest = strdup(md)) == NULL)
600 mtree_err("memory allocation error");
603 if (val[0]=='0' && val[1]=='x')
607 if ((ip->sha1digest = strdup(md)) == NULL)
608 mtree_err("memory allocation error");
611 ip->st_size = (off_t)strtoll(val, &ep, 10);
613 mtree_err("invalid size `%s'", val);
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);
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);
628 ip->st_mtimespec.tv_sec =
629 (time_t)strtoll(val, &ep, 10);
631 mtree_err("invalid time `%s'", val);
633 ip->st_mtimespec.tv_nsec = strtol(val, &ep, 10);
635 mtree_err("invalid time `%s'", val);
638 ip->type = parsetype(val);
641 ip->st_uid = (uid_t)strtoul(val, &ep, 10);
643 mtree_err("invalid uid `%s'", val);
646 if (mtree_Wflag) /* don't parse if whacking */
648 if (uid_from_user(val, &uid) == -1)
649 mtree_err("unknown user `%s'", val);
653 if (val[0]=='0' && val[1]=='x')
657 if ((ip->sha256digest = strdup(md)) == NULL)
658 mtree_err("memory allocation error");
661 if (val[0]=='0' && val[1]=='x')
665 if ((ip->sha384digest = strdup(md)) == NULL)
666 mtree_err("memory allocation error");
669 if (val[0]=='0' && val[1]=='x')
673 if ((ip->sha512digest = strdup(md)) == NULL)
674 mtree_err("memory allocation error");
678 "set(): unsupported key type 0x%x (INTERNAL ERROR)",
686 unset(char *t, NODE *ip)
690 while ((p = strsep(&t, " \t")) != NULL) {
693 ip->flags &= ~parsekey(p, NULL);
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.
705 addchild(NODE *pathparent, NODE *centry)
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
711 NODE *cur; /* for stepping through the list */
712 NODE *last; /* the last node in the list */
719 cur = pathparent->child;
721 /* centry is pathparent's first and only child node so far */
722 pathparent->child = centry;
727 * pathparent already has at least one other child, so add the
728 * centry node to the list.
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).
735 for (; cur != NULL; last = cur, cur = cur->next) {
736 if (strcmp(centry->name, cur->name) == 0) {
740 cmp = nodecmp(centry, cur);
743 } else if (cmp > 0) {
749 if (samename != NULL) {
750 /* replace node with same name */
751 replacepos = samename;
753 /* add new node at end of list */
758 if (samename != NULL) {
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.
765 replacenode(samename, centry);
766 if (samename == replacepos) {
767 /* The just-replaced node was in the correct position */
770 if (samename == insertpos || samename->prev == insertpos) {
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.
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.
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.
790 centry->prev->next = centry->next;
792 /* centry->next is the new head of the list */
793 pathparent->child = centry->next;
794 assert(centry->next != NULL);
797 centry->next->prev = centry->prev;
802 if (insertpos == NULL) {
803 /* insert centry at the beginning of the list */
804 pathparent->child->prev = centry;
805 centry->next = pathparent->child;
807 pathparent->child = centry;
809 /* insert centry into the list just after insertpos */
810 centry->next = insertpos->next;
811 insertpos->next = centry;
812 centry->prev = insertpos;
814 centry->next->prev = centry;
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
826 * Keep this in sync with dcmp() in create.c.
829 nodecmp(const NODE *a, const NODE *b)
832 if ((a->type & F_DIR) != 0) {
833 if ((b->type & F_DIR) == 0)
835 } else if ((b->type & F_DIR) != 0)
837 return strcmp(a->name, b->name);