spec.c revision 1.82 1 1.82 christos /* $NetBSD: spec.c,v 1.82 2012/10/05 01:19:54 christos Exp $ */
2 1.6 cgd
3 1.1 cgd /*-
4 1.5 cgd * Copyright (c) 1989, 1993
5 1.5 cgd * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.50 agc * 3. Neither the name of the University nor the names of its contributors
16 1.1 cgd * may be used to endorse or promote products derived from this software
17 1.1 cgd * without specific prior written permission.
18 1.1 cgd *
19 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.1 cgd * SUCH DAMAGE.
30 1.1 cgd */
31 1.1 cgd
32 1.31 lukem /*-
33 1.57 lukem * Copyright (c) 2001-2004 The NetBSD Foundation, Inc.
34 1.31 lukem * All rights reserved.
35 1.31 lukem *
36 1.31 lukem * This code is derived from software contributed to The NetBSD Foundation
37 1.31 lukem * by Luke Mewburn of Wasabi Systems.
38 1.31 lukem *
39 1.31 lukem * Redistribution and use in source and binary forms, with or without
40 1.31 lukem * modification, are permitted provided that the following conditions
41 1.31 lukem * are met:
42 1.31 lukem * 1. Redistributions of source code must retain the above copyright
43 1.31 lukem * notice, this list of conditions and the following disclaimer.
44 1.31 lukem * 2. Redistributions in binary form must reproduce the above copyright
45 1.31 lukem * notice, this list of conditions and the following disclaimer in the
46 1.31 lukem * documentation and/or other materials provided with the distribution.
47 1.31 lukem *
48 1.31 lukem * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
49 1.31 lukem * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
50 1.31 lukem * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
51 1.31 lukem * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
52 1.31 lukem * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
53 1.31 lukem * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
54 1.31 lukem * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
55 1.31 lukem * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
56 1.31 lukem * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
57 1.31 lukem * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
58 1.31 lukem * POSSIBILITY OF SUCH DAMAGE.
59 1.31 lukem */
60 1.31 lukem
61 1.56 jmc #if HAVE_NBTOOL_CONFIG_H
62 1.56 jmc #include "nbtool_config.h"
63 1.56 jmc #endif
64 1.56 jmc
65 1.11 lukem #include <sys/cdefs.h>
66 1.45 tv #if defined(__RCSID) && !defined(lint)
67 1.6 cgd #if 0
68 1.10 mrg static char sccsid[] = "@(#)spec.c 8.2 (Berkeley) 4/28/95";
69 1.6 cgd #else
70 1.82 christos __RCSID("$NetBSD: spec.c,v 1.82 2012/10/05 01:19:54 christos Exp $");
71 1.6 cgd #endif
72 1.1 cgd #endif /* not lint */
73 1.1 cgd
74 1.25 lukem #include <sys/param.h>
75 1.3 cgd #include <sys/stat.h>
76 1.21 simonb
77 1.76 apb #include <assert.h>
78 1.11 lukem #include <ctype.h>
79 1.11 lukem #include <errno.h>
80 1.11 lukem #include <grp.h>
81 1.1 cgd #include <pwd.h>
82 1.77 apb #include <stdarg.h>
83 1.11 lukem #include <stdio.h>
84 1.34 lukem #include <stdlib.h>
85 1.11 lukem #include <string.h>
86 1.3 cgd #include <unistd.h>
87 1.49 lukem #include <vis.h>
88 1.53 dbj #include <util.h>
89 1.11 lukem
90 1.3 cgd #include "extern.h"
91 1.32 lukem #include "pack_dev.h"
92 1.1 cgd
93 1.39 lukem size_t mtree_lineno; /* Current spec line number */
94 1.57 lukem int mtree_Mflag; /* Merge duplicate entries */
95 1.57 lukem int mtree_Wflag; /* Don't "whack" permissions */
96 1.74 apb int mtree_Sflag; /* Sort entries */
97 1.1 cgd
98 1.47 lukem static dev_t parsedev(char *);
99 1.47 lukem static void replacenode(NODE *, NODE *);
100 1.47 lukem static void set(char *, NODE *);
101 1.47 lukem static void unset(char *, NODE *);
102 1.69 apb static void addchild(NODE *, NODE *);
103 1.69 apb static int nodecmp(const NODE *, const NODE *);
104 1.80 joerg static int appendfield(int, const char *, ...) __printflike(2, 3);
105 1.1 cgd
106 1.57 lukem #define REPLACEPTR(x,v) do { if ((x)) free((x)); (x) = (v); } while (0)
107 1.57 lukem
108 1.3 cgd NODE *
109 1.34 lukem spec(FILE *fp)
110 1.1 cgd {
111 1.31 lukem NODE *centry, *last, *pathparent, *cur;
112 1.33 lukem char *p, *e, *next;
113 1.3 cgd NODE ginfo, *root;
114 1.51 itojun char *buf, *tname, *ntname;
115 1.31 lukem size_t tnamelen, plen;
116 1.1 cgd
117 1.3 cgd root = NULL;
118 1.11 lukem centry = last = NULL;
119 1.31 lukem tname = NULL;
120 1.31 lukem tnamelen = 0;
121 1.11 lukem memset(&ginfo, 0, sizeof(ginfo));
122 1.39 lukem for (mtree_lineno = 0;
123 1.39 lukem (buf = fparseln(fp, NULL, &mtree_lineno, NULL,
124 1.63 martin FPARSELN_UNESCCOMM));
125 1.24 lukem free(buf)) {
126 1.24 lukem /* Skip leading whitespace. */
127 1.24 lukem for (p = buf; *p && isspace((unsigned char)*p); ++p)
128 1.3 cgd continue;
129 1.3 cgd
130 1.24 lukem /* If nothing but whitespace, continue. */
131 1.24 lukem if (!*p)
132 1.1 cgd continue;
133 1.1 cgd
134 1.3 cgd #ifdef DEBUG
135 1.40 lukem fprintf(stderr, "line %lu: {%s}\n",
136 1.39 lukem (u_long)mtree_lineno, p);
137 1.3 cgd #endif
138 1.3 cgd /* Grab file name, "$", "set", or "unset". */
139 1.33 lukem next = buf;
140 1.33 lukem while ((p = strsep(&next, " \t")) != NULL && *p == '\0')
141 1.33 lukem continue;
142 1.33 lukem if (p == NULL)
143 1.13 wsanchez mtree_err("missing field");
144 1.1 cgd
145 1.23 lukem if (p[0] == '/') {
146 1.23 lukem if (strcmp(p + 1, "set") == 0)
147 1.33 lukem set(next, &ginfo);
148 1.23 lukem else if (strcmp(p + 1, "unset") == 0)
149 1.33 lukem unset(next, &ginfo);
150 1.23 lukem else
151 1.23 lukem mtree_err("invalid specification `%s'", p);
152 1.23 lukem continue;
153 1.23 lukem }
154 1.1 cgd
155 1.31 lukem if (strcmp(p, "..") == 0) {
156 1.3 cgd /* Don't go up, if haven't gone down. */
157 1.31 lukem if (root == NULL)
158 1.3 cgd goto noparent;
159 1.1 cgd if (last->type != F_DIR || last->flags & F_DONE) {
160 1.1 cgd if (last == root)
161 1.3 cgd goto noparent;
162 1.1 cgd last = last->parent;
163 1.1 cgd }
164 1.1 cgd last->flags |= F_DONE;
165 1.1 cgd continue;
166 1.3 cgd
167 1.13 wsanchez noparent: mtree_err("no parent node");
168 1.1 cgd }
169 1.1 cgd
170 1.31 lukem plen = strlen(p) + 1;
171 1.31 lukem if (plen > tnamelen) {
172 1.51 itojun if ((ntname = realloc(tname, plen)) == NULL)
173 1.51 itojun mtree_err("realloc: %s", strerror(errno));
174 1.51 itojun tname = ntname;
175 1.31 lukem tnamelen = plen;
176 1.31 lukem }
177 1.31 lukem if (strunvis(tname, p) == -1)
178 1.31 lukem mtree_err("strunvis failed on `%s'", p);
179 1.31 lukem p = tname;
180 1.31 lukem
181 1.31 lukem pathparent = NULL;
182 1.31 lukem if (strchr(p, '/') != NULL) {
183 1.31 lukem cur = root;
184 1.31 lukem for (; (e = strchr(p, '/')) != NULL; p = e+1) {
185 1.31 lukem if (p == e)
186 1.31 lukem continue; /* handle // */
187 1.31 lukem *e = '\0';
188 1.31 lukem if (strcmp(p, ".") != 0) {
189 1.47 lukem while (cur &&
190 1.47 lukem strcmp(cur->name, p) != 0) {
191 1.31 lukem cur = cur->next;
192 1.31 lukem }
193 1.31 lukem }
194 1.31 lukem if (cur == NULL || cur->type != F_DIR) {
195 1.31 lukem mtree_err("%s: %s", tname,
196 1.75 apb "missing directory in specification");
197 1.31 lukem }
198 1.31 lukem *e = '/';
199 1.31 lukem pathparent = cur;
200 1.31 lukem cur = cur->child;
201 1.31 lukem }
202 1.31 lukem if (*p == '\0')
203 1.31 lukem mtree_err("%s: empty leaf element", tname);
204 1.31 lukem }
205 1.31 lukem
206 1.3 cgd if ((centry = calloc(1, sizeof(NODE) + strlen(p))) == NULL)
207 1.13 wsanchez mtree_err("%s", strerror(errno));
208 1.1 cgd *centry = ginfo;
209 1.39 lukem centry->lineno = mtree_lineno;
210 1.31 lukem strcpy(centry->name, p);
211 1.1 cgd #define MAGIC "?*["
212 1.1 cgd if (strpbrk(p, MAGIC))
213 1.1 cgd centry->flags |= F_MAGIC;
214 1.33 lukem set(next, centry);
215 1.1 cgd
216 1.31 lukem if (root == NULL) {
217 1.47 lukem /*
218 1.47 lukem * empty tree
219 1.47 lukem */
220 1.47 lukem if (strcmp(centry->name, ".") != 0 ||
221 1.47 lukem centry->type != F_DIR)
222 1.34 lukem mtree_err(
223 1.34 lukem "root node must be the directory `.'");
224 1.1 cgd last = root = centry;
225 1.1 cgd root->parent = root;
226 1.31 lukem } else if (pathparent != NULL) {
227 1.47 lukem /*
228 1.69 apb * full path entry; add or replace
229 1.47 lukem */
230 1.31 lukem centry->parent = pathparent;
231 1.69 apb addchild(pathparent, centry);
232 1.69 apb last = centry;
233 1.47 lukem } else if (strcmp(centry->name, ".") == 0) {
234 1.47 lukem /*
235 1.47 lukem * duplicate "." entry; always replace
236 1.47 lukem */
237 1.47 lukem replacenode(root, centry);
238 1.1 cgd } else if (last->type == F_DIR && !(last->flags & F_DONE)) {
239 1.47 lukem /*
240 1.69 apb * new relative child in current dir;
241 1.69 apb * add or replace
242 1.47 lukem */
243 1.1 cgd centry->parent = last;
244 1.69 apb addchild(last, centry);
245 1.69 apb last = centry;
246 1.1 cgd } else {
247 1.47 lukem /*
248 1.69 apb * new relative child in parent dir
249 1.69 apb * (after encountering ".." entry);
250 1.69 apb * add or replace
251 1.47 lukem */
252 1.1 cgd centry->parent = last->parent;
253 1.69 apb addchild(last->parent, centry);
254 1.69 apb last = centry;
255 1.1 cgd }
256 1.1 cgd }
257 1.3 cgd return (root);
258 1.1 cgd }
259 1.1 cgd
260 1.57 lukem void
261 1.57 lukem free_nodes(NODE *root)
262 1.57 lukem {
263 1.57 lukem NODE *cur, *next;
264 1.57 lukem
265 1.57 lukem if (root == NULL)
266 1.57 lukem return;
267 1.57 lukem
268 1.57 lukem next = NULL;
269 1.57 lukem for (cur = root; cur != NULL; cur = next) {
270 1.57 lukem next = cur->next;
271 1.57 lukem free_nodes(cur->child);
272 1.57 lukem REPLACEPTR(cur->slink, NULL);
273 1.57 lukem REPLACEPTR(cur->md5digest, NULL);
274 1.57 lukem REPLACEPTR(cur->rmd160digest, NULL);
275 1.57 lukem REPLACEPTR(cur->sha1digest, NULL);
276 1.60 elad REPLACEPTR(cur->sha256digest, NULL);
277 1.60 elad REPLACEPTR(cur->sha384digest, NULL);
278 1.60 elad REPLACEPTR(cur->sha512digest, NULL);
279 1.57 lukem REPLACEPTR(cur->tags, NULL);
280 1.57 lukem REPLACEPTR(cur, NULL);
281 1.57 lukem }
282 1.57 lukem }
283 1.57 lukem
284 1.25 lukem /*
285 1.77 apb * appendfield --
286 1.77 apb * Like printf(), but output a space either before or after
287 1.77 apb * the regular output, according to the pathlast flag.
288 1.77 apb */
289 1.77 apb static int
290 1.77 apb appendfield(int pathlast, const char *fmt, ...)
291 1.77 apb {
292 1.77 apb va_list ap;
293 1.77 apb int result;
294 1.77 apb
295 1.77 apb va_start(ap, fmt);
296 1.77 apb if (!pathlast)
297 1.77 apb printf(" ");
298 1.77 apb result = vprintf(fmt, ap);
299 1.77 apb if (pathlast)
300 1.77 apb printf(" ");
301 1.77 apb va_end(ap);
302 1.77 apb return result;
303 1.77 apb }
304 1.77 apb
305 1.77 apb /*
306 1.25 lukem * dump_nodes --
307 1.49 lukem * dump the NODEs from `cur', based in the directory `dir'.
308 1.49 lukem * if pathlast is none zero, print the path last, otherwise print
309 1.49 lukem * it first.
310 1.25 lukem */
311 1.25 lukem void
312 1.49 lukem dump_nodes(const char *dir, NODE *root, int pathlast)
313 1.25 lukem {
314 1.25 lukem NODE *cur;
315 1.41 lukem char path[MAXPATHLEN];
316 1.30 lukem const char *name;
317 1.64 he char *str;
318 1.70 apb char *p, *q;
319 1.25 lukem
320 1.25 lukem for (cur = root; cur != NULL; cur = cur->next) {
321 1.28 lukem if (cur->type != F_DIR && !matchtags(cur))
322 1.28 lukem continue;
323 1.26 lukem
324 1.25 lukem if (snprintf(path, sizeof(path), "%s%s%s",
325 1.25 lukem dir, *dir ? "/" : "", cur->name)
326 1.68 lukem >= (int)sizeof(path))
327 1.25 lukem mtree_err("Pathname too long.");
328 1.30 lukem
329 1.49 lukem if (!pathlast)
330 1.77 apb printf("%s", vispath(path));
331 1.49 lukem
332 1.30 lukem #define MATCHFLAG(f) ((keys & (f)) && (cur->flags & (f)))
333 1.30 lukem if (MATCHFLAG(F_TYPE))
334 1.77 apb appendfield(pathlast, "type=%s", nodetype(cur->type));
335 1.30 lukem if (MATCHFLAG(F_UID | F_UNAME)) {
336 1.30 lukem if (keys & F_UNAME &&
337 1.30 lukem (name = user_from_uid(cur->st_uid, 1)) != NULL)
338 1.77 apb appendfield(pathlast, "uname=%s", name);
339 1.30 lukem else
340 1.77 apb appendfield(pathlast, "uid=%u", cur->st_uid);
341 1.30 lukem }
342 1.30 lukem if (MATCHFLAG(F_GID | F_GNAME)) {
343 1.30 lukem if (keys & F_GNAME &&
344 1.30 lukem (name = group_from_gid(cur->st_gid, 1)) != NULL)
345 1.77 apb appendfield(pathlast, "gname=%s", name);
346 1.30 lukem else
347 1.77 apb appendfield(pathlast, "gid=%u", cur->st_gid);
348 1.30 lukem }
349 1.30 lukem if (MATCHFLAG(F_MODE))
350 1.77 apb appendfield(pathlast, "mode=%#o", cur->st_mode);
351 1.32 lukem if (MATCHFLAG(F_DEV) &&
352 1.32 lukem (cur->type == F_BLOCK || cur->type == F_CHAR))
353 1.77 apb appendfield(pathlast, "device=%#llx", (long long)cur->st_rdev);
354 1.31 lukem if (MATCHFLAG(F_NLINK))
355 1.77 apb appendfield(pathlast, "nlink=%d", cur->st_nlink);
356 1.30 lukem if (MATCHFLAG(F_SLINK))
357 1.77 apb appendfield(pathlast, "link=%s", vispath(cur->slink));
358 1.30 lukem if (MATCHFLAG(F_SIZE))
359 1.77 apb appendfield(pathlast, "size=%lld", (long long)cur->st_size);
360 1.30 lukem if (MATCHFLAG(F_TIME))
361 1.82 christos appendfield(pathlast, "time=%lld.%09ld",
362 1.67 christos (long long)cur->st_mtimespec.tv_sec,
363 1.25 lukem cur->st_mtimespec.tv_nsec);
364 1.30 lukem if (MATCHFLAG(F_CKSUM))
365 1.77 apb appendfield(pathlast, "cksum=%lu", cur->cksum);
366 1.30 lukem if (MATCHFLAG(F_MD5))
367 1.81 christos appendfield(pathlast, "%s=%s", MD5KEY, cur->md5digest);
368 1.40 lukem if (MATCHFLAG(F_RMD160))
369 1.81 christos appendfield(pathlast, "%s=%s", RMD160KEY,
370 1.81 christos cur->rmd160digest);
371 1.40 lukem if (MATCHFLAG(F_SHA1))
372 1.81 christos appendfield(pathlast, "%s=%s", SHA1KEY,
373 1.81 christos cur->sha1digest);
374 1.60 elad if (MATCHFLAG(F_SHA256))
375 1.81 christos appendfield(pathlast, "%s=%s", SHA256KEY,
376 1.81 christos cur->sha256digest);
377 1.60 elad if (MATCHFLAG(F_SHA384))
378 1.81 christos appendfield(pathlast, "%s=%s", SHA384KEY,
379 1.81 christos cur->sha384digest);
380 1.60 elad if (MATCHFLAG(F_SHA512))
381 1.81 christos appendfield(pathlast, "%s=%s", SHA512KEY,
382 1.81 christos cur->sha512digest);
383 1.64 he if (MATCHFLAG(F_FLAGS)) {
384 1.64 he str = flags_to_string(cur->st_flags, "none");
385 1.77 apb appendfield(pathlast, "flags=%s", str);
386 1.64 he free(str);
387 1.64 he }
388 1.30 lukem if (MATCHFLAG(F_IGN))
389 1.78 apb appendfield(pathlast, "ignore");
390 1.30 lukem if (MATCHFLAG(F_OPT))
391 1.78 apb appendfield(pathlast, "optional");
392 1.70 apb if (MATCHFLAG(F_TAGS)) {
393 1.70 apb /* don't output leading or trailing commas */
394 1.70 apb p = cur->tags;
395 1.70 apb while (*p == ',')
396 1.70 apb p++;
397 1.70 apb q = p + strlen(p);
398 1.70 apb while(q > p && q[-1] == ',')
399 1.70 apb q--;
400 1.77 apb appendfield(pathlast, "tags=%.*s", (int)(q - p), p);
401 1.70 apb }
402 1.49 lukem puts(pathlast ? vispath(path) : "");
403 1.25 lukem
404 1.25 lukem if (cur->child)
405 1.49 lukem dump_nodes(path, cur->child, pathlast);
406 1.25 lukem }
407 1.25 lukem }
408 1.49 lukem
409 1.49 lukem /*
410 1.49 lukem * vispath --
411 1.49 lukem * strsvis(3) encodes path, which must not be longer than MAXPATHLEN
412 1.49 lukem * characters long, and returns a pointer to a static buffer containing
413 1.49 lukem * the result.
414 1.49 lukem */
415 1.49 lukem char *
416 1.49 lukem vispath(const char *path)
417 1.49 lukem {
418 1.49 lukem const char extra[] = { ' ', '\t', '\n', '\\', '#', '\0' };
419 1.49 lukem static char pathbuf[4*MAXPATHLEN + 1];
420 1.49 lukem
421 1.49 lukem strsvis(pathbuf, path, VIS_CSTYLE, extra);
422 1.49 lukem return(pathbuf);
423 1.49 lukem }
424 1.49 lukem
425 1.25 lukem
426 1.32 lukem static dev_t
427 1.32 lukem parsedev(char *arg)
428 1.32 lukem {
429 1.32 lukem #define MAX_PACK_ARGS 3
430 1.32 lukem u_long numbers[MAX_PACK_ARGS];
431 1.32 lukem char *p, *ep, *dev;
432 1.32 lukem int argc;
433 1.32 lukem pack_t *pack;
434 1.32 lukem dev_t result;
435 1.55 christos const char *error = NULL;
436 1.32 lukem
437 1.32 lukem if ((dev = strchr(arg, ',')) != NULL) {
438 1.32 lukem *dev++='\0';
439 1.32 lukem if ((pack = pack_find(arg)) == NULL)
440 1.32 lukem mtree_err("unknown format `%s'", arg);
441 1.32 lukem argc = 0;
442 1.32 lukem while ((p = strsep(&dev, ",")) != NULL) {
443 1.32 lukem if (*p == '\0')
444 1.32 lukem mtree_err("missing number");
445 1.32 lukem numbers[argc++] = strtoul(p, &ep, 0);
446 1.32 lukem if (*ep != '\0')
447 1.32 lukem mtree_err("invalid number `%s'",
448 1.32 lukem p);
449 1.32 lukem if (argc > MAX_PACK_ARGS)
450 1.32 lukem mtree_err("too many arguments");
451 1.32 lukem }
452 1.32 lukem if (argc < 2)
453 1.32 lukem mtree_err("not enough arguments");
454 1.54 ross result = (*pack)(argc, numbers, &error);
455 1.54 ross if (error != NULL)
456 1.66 dbj mtree_err("%s", error);
457 1.32 lukem } else {
458 1.32 lukem result = (dev_t)strtoul(arg, &ep, 0);
459 1.32 lukem if (*ep != '\0')
460 1.32 lukem mtree_err("invalid device `%s'", arg);
461 1.32 lukem }
462 1.32 lukem return (result);
463 1.47 lukem }
464 1.47 lukem
465 1.47 lukem static void
466 1.47 lukem replacenode(NODE *cur, NODE *new)
467 1.47 lukem {
468 1.47 lukem
469 1.47 lukem #define REPLACE(x) cur->x = new->x
470 1.57 lukem #define REPLACESTR(x) REPLACEPTR(cur->x,new->x)
471 1.57 lukem
472 1.57 lukem if (cur->type != new->type) {
473 1.57 lukem if (mtree_Mflag) {
474 1.57 lukem /*
475 1.57 lukem * merge entries with different types; we
476 1.57 lukem * don't want children retained in this case.
477 1.57 lukem */
478 1.57 lukem REPLACE(type);
479 1.57 lukem free_nodes(cur->child);
480 1.57 lukem cur->child = NULL;
481 1.57 lukem } else {
482 1.57 lukem mtree_err(
483 1.57 lukem "existing entry for `%s', type `%s'"
484 1.57 lukem " does not match type `%s'",
485 1.57 lukem cur->name, nodetype(cur->type),
486 1.57 lukem nodetype(new->type));
487 1.57 lukem }
488 1.57 lukem }
489 1.47 lukem
490 1.47 lukem REPLACE(st_size);
491 1.47 lukem REPLACE(st_mtimespec);
492 1.47 lukem REPLACESTR(slink);
493 1.59 lukem if (cur->slink != NULL) {
494 1.59 lukem if ((cur->slink = strdup(new->slink)) == NULL)
495 1.59 lukem mtree_err("memory allocation error");
496 1.59 lukem if (strunvis(cur->slink, new->slink) == -1)
497 1.59 lukem mtree_err("strunvis failed on `%s'", new->slink);
498 1.59 lukem free(new->slink);
499 1.59 lukem }
500 1.47 lukem REPLACE(st_uid);
501 1.47 lukem REPLACE(st_gid);
502 1.47 lukem REPLACE(st_mode);
503 1.47 lukem REPLACE(st_rdev);
504 1.47 lukem REPLACE(st_flags);
505 1.47 lukem REPLACE(st_nlink);
506 1.47 lukem REPLACE(cksum);
507 1.47 lukem REPLACESTR(md5digest);
508 1.47 lukem REPLACESTR(rmd160digest);
509 1.47 lukem REPLACESTR(sha1digest);
510 1.60 elad REPLACESTR(sha256digest);
511 1.60 elad REPLACESTR(sha384digest);
512 1.60 elad REPLACESTR(sha512digest);
513 1.47 lukem REPLACESTR(tags);
514 1.47 lukem REPLACE(lineno);
515 1.47 lukem REPLACE(flags);
516 1.47 lukem free(new);
517 1.32 lukem }
518 1.32 lukem
519 1.3 cgd static void
520 1.21 simonb set(char *t, NODE *ip)
521 1.1 cgd {
522 1.32 lukem int type, value, len;
523 1.32 lukem gid_t gid;
524 1.32 lukem uid_t uid;
525 1.32 lukem char *kw, *val, *md, *ep;
526 1.32 lukem void *m;
527 1.3 cgd
528 1.33 lukem while ((kw = strsep(&t, "= \t")) != NULL) {
529 1.33 lukem if (*kw == '\0')
530 1.33 lukem continue;
531 1.30 lukem if (strcmp(kw, "all") == 0)
532 1.30 lukem mtree_err("invalid keyword `all'");
533 1.3 cgd ip->flags |= type = parsekey(kw, &value);
534 1.62 dsl if (!value)
535 1.62 dsl /* Just set flag bit (F_IGN and F_OPT) */
536 1.62 dsl continue;
537 1.62 dsl while ((val = strsep(&t, " \t")) != NULL && *val == '\0')
538 1.62 dsl continue;
539 1.62 dsl if (val == NULL)
540 1.62 dsl mtree_err("missing value");
541 1.62 dsl switch (type) {
542 1.1 cgd case F_CKSUM:
543 1.3 cgd ip->cksum = strtoul(val, &ep, 10);
544 1.3 cgd if (*ep)
545 1.22 christos mtree_err("invalid checksum `%s'", val);
546 1.14 mrg break;
547 1.32 lukem case F_DEV:
548 1.32 lukem ip->st_rdev = parsedev(val);
549 1.32 lukem break;
550 1.14 mrg case F_FLAGS:
551 1.14 mrg if (strcmp("none", val) == 0)
552 1.14 mrg ip->st_flags = 0;
553 1.32 lukem else if (string_to_flags(&val, &ip->st_flags, NULL)
554 1.32 lukem != 0)
555 1.22 christos mtree_err("invalid flag `%s'", val);
556 1.3 cgd break;
557 1.3 cgd case F_GID:
558 1.8 mikel ip->st_gid = (gid_t)strtoul(val, &ep, 10);
559 1.3 cgd if (*ep)
560 1.22 christos mtree_err("invalid gid `%s'", val);
561 1.3 cgd break;
562 1.3 cgd case F_GNAME:
563 1.57 lukem if (mtree_Wflag) /* don't parse if whacking */
564 1.39 lukem break;
565 1.38 tv if (gid_from_group(val, &gid) == -1)
566 1.39 lukem mtree_err("unknown group `%s'", val);
567 1.38 tv ip->st_gid = gid;
568 1.1 cgd break;
569 1.15 jwise case F_MD5:
570 1.15 jwise if (val[0]=='0' && val[1]=='x')
571 1.15 jwise md=&val[2];
572 1.15 jwise else
573 1.15 jwise md=val;
574 1.40 lukem if ((ip->md5digest = strdup(md)) == NULL)
575 1.15 jwise mtree_err("memory allocation error");
576 1.15 jwise break;
577 1.3 cgd case F_MODE:
578 1.3 cgd if ((m = setmode(val)) == NULL)
579 1.61 christos mtree_err("cannot set file mode `%s' (%s)",
580 1.61 christos val, strerror(errno));
581 1.1 cgd ip->st_mode = getmode(m, 0);
582 1.12 itohy free(m);
583 1.1 cgd break;
584 1.1 cgd case F_NLINK:
585 1.8 mikel ip->st_nlink = (nlink_t)strtoul(val, &ep, 10);
586 1.3 cgd if (*ep)
587 1.22 christos mtree_err("invalid link count `%s'", val);
588 1.32 lukem break;
589 1.40 lukem case F_RMD160:
590 1.40 lukem if (val[0]=='0' && val[1]=='x')
591 1.40 lukem md=&val[2];
592 1.40 lukem else
593 1.40 lukem md=val;
594 1.40 lukem if ((ip->rmd160digest = strdup(md)) == NULL)
595 1.40 lukem mtree_err("memory allocation error");
596 1.40 lukem break;
597 1.40 lukem case F_SHA1:
598 1.40 lukem if (val[0]=='0' && val[1]=='x')
599 1.40 lukem md=&val[2];
600 1.40 lukem else
601 1.40 lukem md=val;
602 1.40 lukem if ((ip->sha1digest = strdup(md)) == NULL)
603 1.40 lukem mtree_err("memory allocation error");
604 1.40 lukem break;
605 1.1 cgd case F_SIZE:
606 1.40 lukem ip->st_size = (off_t)strtoll(val, &ep, 10);
607 1.3 cgd if (*ep)
608 1.22 christos mtree_err("invalid size `%s'", val);
609 1.1 cgd break;
610 1.1 cgd case F_SLINK:
611 1.3 cgd if ((ip->slink = strdup(val)) == NULL)
612 1.15 jwise mtree_err("memory allocation error");
613 1.58 lukem if (strunvis(ip->slink, val) == -1)
614 1.58 lukem mtree_err("strunvis failed on `%s'", val);
615 1.27 lukem break;
616 1.27 lukem case F_TAGS:
617 1.27 lukem len = strlen(val) + 3; /* "," + str + ",\0" */
618 1.27 lukem if ((ip->tags = malloc(len)) == NULL)
619 1.27 lukem mtree_err("memory allocation error");
620 1.27 lukem snprintf(ip->tags, len, ",%s,", val);
621 1.1 cgd break;
622 1.1 cgd case F_TIME:
623 1.8 mikel ip->st_mtimespec.tv_sec =
624 1.67 christos (time_t)strtoll(val, &ep, 10);
625 1.5 cgd if (*ep != '.')
626 1.22 christos mtree_err("invalid time `%s'", val);
627 1.5 cgd val = ep + 1;
628 1.67 christos ip->st_mtimespec.tv_nsec = strtol(val, &ep, 10);
629 1.3 cgd if (*ep)
630 1.22 christos mtree_err("invalid time `%s'", val);
631 1.1 cgd break;
632 1.1 cgd case F_TYPE:
633 1.23 lukem ip->type = parsetype(val);
634 1.1 cgd break;
635 1.3 cgd case F_UID:
636 1.8 mikel ip->st_uid = (uid_t)strtoul(val, &ep, 10);
637 1.3 cgd if (*ep)
638 1.22 christos mtree_err("invalid uid `%s'", val);
639 1.3 cgd break;
640 1.3 cgd case F_UNAME:
641 1.57 lukem if (mtree_Wflag) /* don't parse if whacking */
642 1.39 lukem break;
643 1.38 tv if (uid_from_user(val, &uid) == -1)
644 1.39 lukem mtree_err("unknown user `%s'", val);
645 1.38 tv ip->st_uid = uid;
646 1.3 cgd break;
647 1.60 elad case F_SHA256:
648 1.60 elad if (val[0]=='0' && val[1]=='x')
649 1.60 elad md=&val[2];
650 1.60 elad else
651 1.60 elad md=val;
652 1.60 elad if ((ip->sha256digest = strdup(md)) == NULL)
653 1.60 elad mtree_err("memory allocation error");
654 1.60 elad break;
655 1.60 elad case F_SHA384:
656 1.60 elad if (val[0]=='0' && val[1]=='x')
657 1.60 elad md=&val[2];
658 1.60 elad else
659 1.60 elad md=val;
660 1.60 elad if ((ip->sha384digest = strdup(md)) == NULL)
661 1.60 elad mtree_err("memory allocation error");
662 1.60 elad break;
663 1.60 elad case F_SHA512:
664 1.60 elad if (val[0]=='0' && val[1]=='x')
665 1.60 elad md=&val[2];
666 1.60 elad else
667 1.60 elad md=val;
668 1.60 elad if ((ip->sha512digest = strdup(md)) == NULL)
669 1.60 elad mtree_err("memory allocation error");
670 1.60 elad break;
671 1.26 lukem default:
672 1.26 lukem mtree_err(
673 1.26 lukem "set(): unsupported key type 0x%x (INTERNAL ERROR)",
674 1.26 lukem type);
675 1.26 lukem /* NOTREACHED */
676 1.1 cgd }
677 1.1 cgd }
678 1.1 cgd }
679 1.1 cgd
680 1.3 cgd static void
681 1.21 simonb unset(char *t, NODE *ip)
682 1.1 cgd {
683 1.11 lukem char *p;
684 1.1 cgd
685 1.33 lukem while ((p = strsep(&t, " \t")) != NULL) {
686 1.33 lukem if (*p == '\0')
687 1.33 lukem continue;
688 1.3 cgd ip->flags &= ~parsekey(p, NULL);
689 1.30 lukem }
690 1.1 cgd }
691 1.69 apb
692 1.69 apb /*
693 1.69 apb * addchild --
694 1.69 apb * Add the centry node as a child of the pathparent node. If
695 1.69 apb * centry is a duplicate, call replacenode(). If centry is not
696 1.69 apb * a duplicate, insert it into the linked list referenced by
697 1.74 apb * pathparent->child. Keep the list sorted if Sflag is set.
698 1.69 apb */
699 1.69 apb static void
700 1.69 apb addchild(NODE *pathparent, NODE *centry)
701 1.69 apb {
702 1.76 apb NODE *samename; /* node with the same name as centry */
703 1.76 apb NODE *replacepos; /* if non-NULL, centry should replace this node */
704 1.76 apb NODE *insertpos; /* if non-NULL, centry should be inserted
705 1.76 apb * after this node */
706 1.76 apb NODE *cur; /* for stepping through the list */
707 1.76 apb NODE *last; /* the last node in the list */
708 1.69 apb int cmp;
709 1.69 apb
710 1.76 apb samename = NULL;
711 1.76 apb replacepos = NULL;
712 1.76 apb insertpos = NULL;
713 1.76 apb last = NULL;
714 1.69 apb cur = pathparent->child;
715 1.69 apb if (cur == NULL) {
716 1.69 apb /* centry is pathparent's first and only child node so far */
717 1.69 apb pathparent->child = centry;
718 1.69 apb return;
719 1.69 apb }
720 1.69 apb
721 1.69 apb /*
722 1.69 apb * pathparent already has at least one other child, so add the
723 1.69 apb * centry node to the list.
724 1.69 apb *
725 1.76 apb * We first scan through the list looking for an existing node
726 1.76 apb * with the same name (setting samename), and also looking
727 1.76 apb * for the correct position to replace or insert the new node
728 1.76 apb * (setting replacepos and/or insertpos).
729 1.69 apb */
730 1.76 apb for (; cur != NULL; last = cur, cur = cur->next) {
731 1.76 apb if (strcmp(centry->name, cur->name) == 0) {
732 1.76 apb samename = cur;
733 1.76 apb }
734 1.76 apb if (mtree_Sflag) {
735 1.76 apb cmp = nodecmp(centry, cur);
736 1.76 apb if (cmp == 0) {
737 1.76 apb replacepos = cur;
738 1.76 apb } else if (cmp > 0) {
739 1.76 apb insertpos = cur;
740 1.76 apb }
741 1.76 apb }
742 1.76 apb }
743 1.76 apb if (! mtree_Sflag) {
744 1.76 apb if (samename != NULL) {
745 1.76 apb /* replace node with same name */
746 1.76 apb replacepos = samename;
747 1.76 apb } else {
748 1.76 apb /* add new node at end of list */
749 1.76 apb insertpos = last;
750 1.76 apb }
751 1.76 apb }
752 1.76 apb
753 1.76 apb if (samename != NULL) {
754 1.76 apb /*
755 1.76 apb * We found a node with the same name above. Call
756 1.76 apb * replacenode(), which will either exit with an error,
757 1.76 apb * or replace the information in the samename node and
758 1.76 apb * free the information in the centry node.
759 1.76 apb */
760 1.76 apb replacenode(samename, centry);
761 1.76 apb if (samename == replacepos) {
762 1.76 apb /* The just-replaced node was in the correct position */
763 1.76 apb return;
764 1.69 apb }
765 1.76 apb if (samename == insertpos || samename->prev == insertpos) {
766 1.69 apb /*
767 1.76 apb * We thought the new node should be just before
768 1.76 apb * or just after the replaced node, but that would
769 1.76 apb * be equivalent to just retaining the replaced node.
770 1.69 apb */
771 1.76 apb return;
772 1.69 apb }
773 1.76 apb
774 1.76 apb /*
775 1.76 apb * The just-replaced node is in the wrong position in
776 1.76 apb * the list. This can happen if sort order depends on
777 1.76 apb * criteria other than the node name.
778 1.76 apb *
779 1.76 apb * Make centry point to the just-replaced node. Unlink
780 1.76 apb * the just-replaced node from the list, and allow it to
781 1.76 apb * be insterted in the correct position later.
782 1.76 apb */
783 1.76 apb centry = samename;
784 1.76 apb if (centry->prev)
785 1.76 apb centry->prev->next = centry->next;
786 1.76 apb else {
787 1.76 apb /* centry->next is the new head of the list */
788 1.76 apb pathparent->child = centry->next;
789 1.76 apb assert(centry->next != NULL);
790 1.76 apb }
791 1.76 apb if (centry->next)
792 1.76 apb centry->next->prev = centry->prev;
793 1.76 apb centry->prev = NULL;
794 1.76 apb centry->next = NULL;
795 1.76 apb }
796 1.76 apb
797 1.76 apb if (insertpos == NULL) {
798 1.76 apb /* insert centry at the beginning of the list */
799 1.76 apb pathparent->child->prev = centry;
800 1.76 apb centry->next = pathparent->child;
801 1.76 apb centry->prev = NULL;
802 1.76 apb pathparent->child = centry;
803 1.76 apb } else {
804 1.76 apb /* insert centry into the list just after insertpos */
805 1.76 apb centry->next = insertpos->next;
806 1.76 apb insertpos->next = centry;
807 1.76 apb centry->prev = insertpos;
808 1.76 apb if (centry->next)
809 1.76 apb centry->next->prev = centry;
810 1.69 apb }
811 1.69 apb return;
812 1.69 apb }
813 1.69 apb
814 1.69 apb /*
815 1.69 apb * nodecmp --
816 1.69 apb * used as a comparison function by addchild() to control the order
817 1.69 apb * in which entries appear within a list of sibling nodes. We make
818 1.69 apb * directories sort after non-directories, but otherwise sort in
819 1.69 apb * strcmp() order.
820 1.69 apb *
821 1.69 apb * Keep this in sync with dcmp() in create.c.
822 1.69 apb */
823 1.69 apb static int
824 1.69 apb nodecmp(const NODE *a, const NODE *b)
825 1.69 apb {
826 1.69 apb
827 1.69 apb if ((a->type & F_DIR) != 0) {
828 1.69 apb if ((b->type & F_DIR) == 0)
829 1.69 apb return 1;
830 1.69 apb } else if ((b->type & F_DIR) != 0)
831 1.69 apb return -1;
832 1.69 apb return strcmp(a->name, b->name);
833 1.69 apb }
834