1 /* $NetBSD: misc.c,v 1.34 2012/12/20 19:09:25 christos Exp $ */
4 * Copyright (c) 1991, 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
31 * @(#)misc.c 8.1 (Berkeley) 6/6/93
34 #if HAVE_NBTOOL_CONFIG_H
35 #include "nbtool_config.h"
38 #include <sys/cdefs.h>
39 #if defined(__RCSID) && !defined(lint)
40 __RCSID("$NetBSD: misc.c,v 1.34 2012/12/20 19:09:25 christos Exp $");
43 #include <sys/types.h>
53 enum flavor flavor = F_MTREE;
56 const char *name; /* key name */
57 u_int val; /* value */
59 #define NEEDVALUE 0x01
63 /* NB: the following tables must be sorted lexically. */
64 static KEY keylist[] = {
65 {"cksum", F_CKSUM, NEEDVALUE},
66 {"device", F_DEV, NEEDVALUE},
67 {"flags", F_FLAGS, NEEDVALUE},
68 {"gid", F_GID, NEEDVALUE},
69 {"gname", F_GNAME, NEEDVALUE},
71 {"link", F_SLINK, NEEDVALUE},
72 {"md5", F_MD5, NEEDVALUE},
73 {"md5digest", F_MD5, NEEDVALUE},
74 {"mode", F_MODE, NEEDVALUE},
75 {"nlink", F_NLINK, NEEDVALUE},
76 {"nochange", F_NOCHANGE, 0},
77 {"optional", F_OPT, 0},
78 {"ripemd160digest", F_RMD160, NEEDVALUE},
79 {"rmd160", F_RMD160, NEEDVALUE},
80 {"rmd160digest",F_RMD160, NEEDVALUE},
81 {"sha1", F_SHA1, NEEDVALUE},
82 {"sha1digest", F_SHA1, NEEDVALUE},
83 {"sha256", F_SHA256, NEEDVALUE},
84 {"sha256digest",F_SHA256, NEEDVALUE},
85 {"sha384", F_SHA384, NEEDVALUE},
86 {"sha384digest",F_SHA384, NEEDVALUE},
87 {"sha512", F_SHA512, NEEDVALUE},
88 {"sha512digest",F_SHA512, NEEDVALUE},
89 {"size", F_SIZE, NEEDVALUE},
90 {"tags", F_TAGS, NEEDVALUE},
91 {"time", F_TIME, NEEDVALUE},
92 {"type", F_TYPE, NEEDVALUE},
93 {"uid", F_UID, NEEDVALUE},
94 {"uname", F_UNAME, NEEDVALUE}
97 static KEY typelist[] = {
98 {"block", F_BLOCK, 0},
107 {"socket", F_SOCK, 0},
110 slist_t excludetags, includetags;
111 int keys = KEYDEFAULT;
114 int keycompare(const void *, const void *);
117 parsekey(const char *name, int *needvaluep)
125 for (i = 0; i < sizeof(keylist) / sizeof(KEY); i++)
126 allbits |= keylist[i].val;
129 if (strcmp(name, "all") == 0)
131 k = (KEY *)bsearch(&tmp, keylist, sizeof(keylist) / sizeof(KEY),
132 sizeof(KEY), keycompare);
134 mtree_err("unknown keyword `%s'", name);
137 *needvaluep = k->flags & NEEDVALUE ? 1 : 0;
143 parsetype(const char *name)
148 k = (KEY *)bsearch(&tmp, typelist, sizeof(typelist) / sizeof(KEY),
149 sizeof(KEY), keycompare);
151 mtree_err("unknown file type `%s'", name);
157 keycompare(const void *a, const void *b)
160 return (strcmp(((const KEY *)a)->name, ((const KEY *)b)->name));
164 mtree_err(const char *fmt, ...)
172 warnx("failed at line %lu of the specification",
173 (u_long) mtree_lineno);
179 addtag(slist_t *list, char *elem)
184 if ((list->count % TAG_CHUNK) == 0) {
187 new = (char **)realloc(list->list, (list->count + TAG_CHUNK)
190 mtree_err("memory allocation error");
193 list->list[list->count] = elem;
198 parsetags(slist_t *list, char *args)
207 while ((p = strsep(&args, ",")) != NULL) {
210 len = strlen(p) + 3; /* "," + p + ",\0" */
211 if ((e = malloc(len)) == NULL)
212 mtree_err("memory allocation error");
213 snprintf(e, len, ",%s,", p);
220 * returns 0 if there's a match from the exclude list in the node's tags,
221 * or there's an include list and no match.
222 * return 1 otherwise.
225 matchtags(NODE *node)
230 for (i = 0; i < excludetags.count; i++)
231 if (strstr(node->tags, excludetags.list[i]))
233 if (i < excludetags.count)
236 for (i = 0; i < includetags.count; i++)
237 if (strstr(node->tags, includetags.list[i]))
239 if (i > 0 && i == includetags.count)
241 } else if (includetags.count > 0) {
248 nodetoino(u_int type)
269 printf("unknown type %d", type);
279 return (inotype(nodetoino(type)));
287 switch (type & S_IFMT) {