1 /* $NetBSD: walk.c,v 1.24 2008/12/28 21:51:46 christos Exp $ */
4 * Copyright (c) 2001 Wasabi Systems, Inc.
7 * Written by Luke Mewburn for Wasabi Systems, Inc.
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. All advertising materials mentioning features or use of this software
18 * must display the following acknowledgement:
19 * This product includes software developed for the NetBSD Project by
20 * Wasabi Systems, Inc.
21 * 4. The name of Wasabi Systems, Inc. may not be used to endorse
22 * or promote products derived from this software without specific prior
25 * THIS SOFTWARE IS PROVIDED BY WASABI SYSTEMS, INC. ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
27 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
28 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL WASABI SYSTEMS, INC
29 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
30 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
31 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
32 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
33 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
34 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
35 * POSSIBILITY OF SUCH DAMAGE.
39 #include <sys/cdefs.h>
40 __FBSDID("$FreeBSD$");
42 #include <sys/param.h>
58 static void apply_specdir(const char *, NODE *, fsnode *, int);
59 static void apply_specentry(const char *, NODE *, fsnode *);
60 static fsnode *create_fsnode(const char *, const char *, const char *,
62 static fsinode *link_check(fsinode *);
67 * build a tree of fsnodes from `root' and `dir', with a parent
68 * fsnode of `parent' (which may be NULL for the root of the tree).
69 * append the tree to a fsnode of `join' if it is not NULL.
70 * each "level" is a directory, with the "." entry guaranteed to be
71 * at the start of the list, and without ".." entries.
74 walk_dir(const char *root, const char *dir, fsnode *parent, fsnode *join)
76 fsnode *first, *cur, *prev, *last;
79 char path[MAXPATHLEN + 1];
87 len = snprintf(path, sizeof(path), "%s/%s", root, dir);
88 if (len >= (int)sizeof(path))
89 errx(1, "Pathname too long.");
90 if (debug & DEBUG_WALK_DIR)
91 printf("walk_dir: %s %p\n", path, parent);
92 if ((dirp = opendir(path)) == NULL)
93 err(1, "Can't opendir `%s'", path);
94 rp = path + strlen(root) + 1;
97 while (cur->next != NULL)
103 while ((dent = readdir(dirp)) != NULL) {
120 if (debug & DEBUG_WALK_DIR_NODE)
121 printf("scanning %s/%s/%s\n", root, dir, name);
122 if (snprintf(path + len, sizeof(path) - len, "/%s", name) >=
123 (int)sizeof(path) - len)
124 errx(1, "Pathname too long.");
125 if (lstat(path, &stbuf) == -1)
126 err(1, "Can't lstat `%s'", path);
128 if (S_ISSOCK(stbuf.st_mode & S_IFMT)) {
129 if (debug & DEBUG_WALK_DIR_NODE)
130 printf(" skipping socket %s\n", path);
138 if (cur == NULL || strcmp(cur->name, name) == 0)
147 if (S_ISDIR(cur->type) &&
148 S_ISDIR(stbuf.st_mode)) {
149 if (debug & DEBUG_WALK_DIR_NODE)
150 printf("merging %s with %p\n",
152 cur->child = walk_dir(root, rp, cur,
156 errx(1, "Can't merge %s `%s' with existing %s",
157 inode_type(stbuf.st_mode), path,
158 inode_type(cur->type));
162 cur = create_fsnode(root, dir, name, &stbuf);
163 cur->parent = parent;
165 /* ensure "." is at the start of the list */
171 } else { /* not "." */
178 if (S_ISDIR(cur->type)) {
179 cur->child = walk_dir(root, rp, cur, NULL);
183 if (stbuf.st_nlink > 1) {
186 curino = link_check(cur->inode);
187 if (curino != NULL) {
191 if (debug & DEBUG_WALK_DIR_LINKCHECK)
192 printf("link_check: found [%llu, %llu]\n",
193 (unsigned long long)curino->st.st_dev,
194 (unsigned long long)curino->st.st_ino);
197 if (S_ISLNK(cur->type)) {
198 char slink[PATH_MAX+1];
201 llen = readlink(path, slink, sizeof(slink) - 1);
203 err(1, "Readlink `%s'", path);
205 if ((cur->symlink = strdup(slink)) == NULL)
206 err(1, "Memory allocation error");
209 assert(first != NULL);
211 for (cur = first->next; cur != NULL; cur = cur->next)
213 if (closedir(dirp) == -1)
214 err(1, "Can't closedir `%s/%s'", root, dir);
219 create_fsnode(const char *root, const char *path, const char *name,
224 if ((cur = calloc(1, sizeof(fsnode))) == NULL ||
225 (cur->path = strdup(path)) == NULL ||
226 (cur->name = strdup(name)) == NULL ||
227 (cur->inode = calloc(1, sizeof(fsinode))) == NULL)
228 err(1, "Memory allocation error");
230 cur->type = stbuf->st_mode & S_IFMT;
231 cur->inode->nlink = 1;
232 cur->inode->st = *stbuf;
238 * Removes node from tree and frees it and all of
242 free_fsnodes(fsnode *node)
246 assert(node != NULL);
248 /* for ".", start with actual parent node */
249 if (node->first == node) {
250 assert(node->name[0] == '.' && node->name[1] == '\0');
252 assert(node->parent->child == node);
257 /* Find ourselves in our sibling list and unlink */
258 if (node->first != node) {
259 for (cur = node->first; cur->next; cur = cur->next) {
260 if (cur->next == node) {
261 cur->next = node->next;
268 for (cur = node; cur != NULL; cur = next) {
271 cur->child->parent = NULL;
272 free_fsnodes(cur->child);
274 if (cur->inode->nlink-- == 1)
286 * read in the mtree(8) specfile, and apply it to the tree
287 * at dir,parent. parameters in parent on equivalent types
288 * will be changed to those found in specfile, and missing
289 * entries will be added.
292 apply_specfile(const char *specfile, const char *dir, fsnode *parent, int speconly)
294 struct timeval start;
298 assert(specfile != NULL);
299 assert(parent != NULL);
301 if (debug & DEBUG_APPLY_SPECFILE)
302 printf("apply_specfile: %s, %s %p\n", specfile, dir, parent);
304 /* read in the specfile */
305 if ((fp = fopen(specfile, "r")) == NULL)
306 err(1, "Can't open `%s'", specfile);
308 root = mtree_readspec(fp);
309 TIMER_RESULTS(start, "spec");
310 if (fclose(fp) == EOF)
311 err(1, "Can't close `%s'", specfile);
313 /* perform some sanity checks */
315 errx(1, "Specfile `%s' did not contain a tree", specfile);
316 assert(strcmp(root->name, ".") == 0);
317 assert(root->type == F_DIR);
319 /* merge in the changes */
320 apply_specdir(dir, root, parent, speconly);
325 nodetoino(u_int type)
344 printf("unknown type %d", type);
352 apply_specdir(const char *dir, NODE *specnode, fsnode *dirnode, int speconly)
354 char path[MAXPATHLEN + 1];
358 assert(specnode != NULL);
359 assert(dirnode != NULL);
361 if (debug & DEBUG_APPLY_SPECFILE)
362 printf("apply_specdir: %s %p %p\n", dir, specnode, dirnode);
364 if (specnode->type != F_DIR)
365 errx(1, "Specfile node `%s/%s' is not a directory",
366 dir, specnode->name);
367 if (dirnode->type != S_IFDIR)
368 errx(1, "Directory node `%s/%s' is not a directory",
371 apply_specentry(dir, specnode, dirnode);
373 /* Remove any filesystem nodes not found in specfile */
374 /* XXX inefficient. This is O^2 in each dir and it would
375 * have been better never to have walked this part of the tree
380 assert(dirnode->name[0] == '.' && dirnode->name[1] == '\0');
381 for (curfsnode = dirnode->next; curfsnode != NULL; curfsnode = next) {
382 next = curfsnode->next;
383 for (curnode = specnode->child; curnode != NULL;
384 curnode = curnode->next) {
385 if (strcmp(curnode->name, curfsnode->name) == 0)
388 if (curnode == NULL) {
389 if (debug & DEBUG_APPLY_SPECONLY) {
390 printf("apply_specdir: trimming %s/%s %p\n", dir, curfsnode->name, curfsnode);
392 free_fsnodes(curfsnode);
397 /* now walk specnode->child matching up with dirnode */
398 for (curnode = specnode->child; curnode != NULL;
399 curnode = curnode->next) {
400 if (debug & DEBUG_APPLY_SPECENTRY)
401 printf("apply_specdir: spec %s\n",
403 for (curfsnode = dirnode->next; curfsnode != NULL;
404 curfsnode = curfsnode->next) {
405 #if 0 /* too verbose for now */
406 if (debug & DEBUG_APPLY_SPECENTRY)
407 printf("apply_specdir: dirent %s\n",
410 if (strcmp(curnode->name, curfsnode->name) == 0)
413 if (snprintf(path, sizeof(path), "%s/%s",
414 dir, curnode->name) >= sizeof(path))
415 errx(1, "Pathname too long.");
416 if (curfsnode == NULL) { /* need new entry */
420 * don't add optional spec entries
421 * that lack an existing fs entry
423 if ((curnode->flags & F_OPT) &&
424 lstat(path, &stbuf) == -1)
427 /* check that enough info is provided */
428 #define NODETEST(t, m) \
430 errx(1, "`%s': %s not provided", path, m)
431 NODETEST(curnode->flags & F_TYPE, "type");
432 NODETEST(curnode->flags & F_MODE, "mode");
433 /* XXX: require F_TIME ? */
434 NODETEST(curnode->flags & F_GID ||
435 curnode->flags & F_GNAME, "group");
436 NODETEST(curnode->flags & F_UID ||
437 curnode->flags & F_UNAME, "user");
438 /* if (curnode->type == F_BLOCK || curnode->type == F_CHAR)
439 NODETEST(curnode->flags & F_DEV,
443 if (debug & DEBUG_APPLY_SPECFILE)
444 printf("apply_specdir: adding %s\n",
446 /* build minimal fsnode */
447 memset(&stbuf, 0, sizeof(stbuf));
448 stbuf.st_mode = nodetoino(curnode->type);
450 stbuf.st_mtime = stbuf.st_atime =
451 stbuf.st_ctime = start_time.tv_sec;
452 #if HAVE_STRUCT_STAT_ST_MTIMENSEC
453 stbuf.st_mtimensec = stbuf.st_atimensec =
454 stbuf.st_ctimensec = start_time.tv_nsec;
456 curfsnode = create_fsnode(".", ".", curnode->name,
458 curfsnode->parent = dirnode->parent;
459 curfsnode->first = dirnode;
460 curfsnode->next = dirnode->next;
461 dirnode->next = curfsnode;
462 if (curfsnode->type == S_IFDIR) {
463 /* for dirs, make "." entry as well */
464 curfsnode->child = create_fsnode(".", ".", ".",
466 curfsnode->child->parent = curfsnode;
467 curfsnode->child->first = curfsnode->child;
469 if (curfsnode->type == S_IFLNK) {
470 assert(curnode->slink != NULL);
471 /* for symlinks, copy the target */
472 if ((curfsnode->symlink =
473 strdup(curnode->slink)) == NULL)
474 err(1, "Memory allocation error");
477 apply_specentry(dir, curnode, curfsnode);
478 if (curnode->type == F_DIR) {
479 if (curfsnode->type != S_IFDIR)
480 errx(1, "`%s' is not a directory", path);
481 assert (curfsnode->child != NULL);
482 apply_specdir(path, curnode, curfsnode->child, speconly);
488 apply_specentry(const char *dir, NODE *specnode, fsnode *dirnode)
491 assert(specnode != NULL);
492 assert(dirnode != NULL);
494 if (nodetoino(specnode->type) != dirnode->type)
495 errx(1, "`%s/%s' type mismatch: specfile %s, tree %s",
496 dir, specnode->name, inode_type(nodetoino(specnode->type)),
497 inode_type(dirnode->type));
499 if (debug & DEBUG_APPLY_SPECENTRY)
500 printf("apply_specentry: %s/%s\n", dir, dirnode->name);
502 #define ASEPRINT(t, b, o, n) \
503 if (debug & DEBUG_APPLY_SPECENTRY) \
504 printf("\t\t\tchanging %s from " b " to " b "\n", \
507 if (specnode->flags & (F_GID | F_GNAME)) {
508 ASEPRINT("gid", "%d",
509 dirnode->inode->st.st_gid, specnode->st_gid);
510 dirnode->inode->st.st_gid = specnode->st_gid;
512 if (specnode->flags & F_MODE) {
513 ASEPRINT("mode", "%#o",
514 dirnode->inode->st.st_mode & ALLPERMS, specnode->st_mode);
515 dirnode->inode->st.st_mode &= ~ALLPERMS;
516 dirnode->inode->st.st_mode |= (specnode->st_mode & ALLPERMS);
518 /* XXX: ignoring F_NLINK for now */
519 if (specnode->flags & F_SIZE) {
520 ASEPRINT("size", "%lld",
521 (long long)dirnode->inode->st.st_size,
522 (long long)specnode->st_size);
523 dirnode->inode->st.st_size = specnode->st_size;
525 if (specnode->flags & F_SLINK) {
526 assert(dirnode->symlink != NULL);
527 assert(specnode->slink != NULL);
528 ASEPRINT("symlink", "%s", dirnode->symlink, specnode->slink);
529 free(dirnode->symlink);
530 if ((dirnode->symlink = strdup(specnode->slink)) == NULL)
531 err(1, "Memory allocation error");
533 if (specnode->flags & F_TIME) {
534 ASEPRINT("time", "%ld",
535 (long)dirnode->inode->st.st_mtime,
536 (long)specnode->st_mtimespec.tv_sec);
537 dirnode->inode->st.st_mtime = specnode->st_mtimespec.tv_sec;
538 dirnode->inode->st.st_atime = specnode->st_mtimespec.tv_sec;
539 dirnode->inode->st.st_ctime = start_time.tv_sec;
540 #if HAVE_STRUCT_STAT_ST_MTIMENSEC
541 dirnode->inode->st.st_mtimensec = specnode->st_mtimespec.tv_nsec;
542 dirnode->inode->st.st_atimensec = specnode->st_mtimespec.tv_nsec;
543 dirnode->inode->st.st_ctimensec = start_time.tv_nsec;
546 if (specnode->flags & (F_UID | F_UNAME)) {
547 ASEPRINT("uid", "%d",
548 dirnode->inode->st.st_uid, specnode->st_uid);
549 dirnode->inode->st.st_uid = specnode->st_uid;
551 #if HAVE_STRUCT_STAT_ST_FLAGS
552 if (specnode->flags & F_FLAGS) {
553 ASEPRINT("flags", "%#lX",
554 (unsigned long)dirnode->inode->st.st_flags,
555 (unsigned long)specnode->st_flags);
556 dirnode->inode->st.st_flags = specnode->st_flags;
559 /* if (specnode->flags & F_DEV) {
560 ASEPRINT("rdev", "%#llx",
561 (unsigned long long)dirnode->inode->st.st_rdev,
562 (unsigned long long)specnode->st_rdev);
563 dirnode->inode->st.st_rdev = specnode->st_rdev;
567 dirnode->flags |= FSNODE_F_HASSPEC;
573 * dump the fsnodes from `cur'
576 dump_fsnodes(fsnode *root)
579 char path[MAXPATHLEN + 1];
581 printf("dump_fsnodes: %s %p\n", root->path, root);
582 for (cur = root; cur != NULL; cur = cur->next) {
583 if (snprintf(path, sizeof(path), "%s/%s", cur->path,
584 cur->name) >= (int)sizeof(path))
585 errx(1, "Pathname too long.");
587 if (debug & DEBUG_DUMP_FSNODES_VERBOSE)
588 printf("cur=%8p parent=%8p first=%8p ",
589 cur, cur->parent, cur->first);
590 printf("%7s: %s", inode_type(cur->type), path);
591 if (S_ISLNK(cur->type)) {
592 assert(cur->symlink != NULL);
593 printf(" -> %s", cur->symlink);
595 assert (cur->symlink == NULL);
597 if (cur->inode->nlink > 1)
598 printf(", nlinks=%d", cur->inode->nlink);
602 assert (cur->type == S_IFDIR);
603 dump_fsnodes(cur->child);
606 printf("dump_fsnodes: finished %s/%s\n", root->path, root->name);
612 * for a given inode type `mode', return a descriptive string.
613 * for most cases, uses inotype() from mtree/misc.c
616 inode_type(mode_t mode)
630 /* XXX should not happen but handle them */
641 * return pointer to fsinode matching `entry's st_ino & st_dev if it exists,
642 * otherwise add `entry' to table and return NULL
644 /* This was borrowed from du.c and tweaked to keep an fsnode
645 * pointer instead. -- dbj@netbsd.org
648 link_check(fsinode *entry)
650 static struct entry {
653 static int htshift; /* log(allocated size) */
654 static int htmask; /* allocated size - 1 */
655 static int htused; /* 2*number of insertions */
658 /* this constant is (1<<64)/((1+sqrt(5))/2)
659 * aka (word size)/(golden ratio)
661 const uint64_t HTCONST = 11400714819323198485ULL;
662 const int HTBITS = 64;
664 /* Never store zero in hashtable */
667 /* Extend hash table if necessary, keep load under 0.5 */
668 if (htused<<1 >= htmask) {
669 struct entry *ohtable;
672 htshift = 10; /* starting hashtable size */
674 htshift++; /* exponential hashtable growth */
676 htmask = (1 << htshift) - 1;
680 htable = calloc(htmask+1, sizeof(*htable));
682 err(1, "Memory allocation error");
684 /* populate newly allocated hashtable */
687 for (i = 0; i <= htmask>>1; i++)
689 link_check(ohtable[i].data);
694 /* multiplicative hashing */
695 tmp = entry->st.st_dev;
697 tmp |= entry->st.st_ino;
699 h = tmp >> (HTBITS - htshift);
700 h2 = 1 | ( tmp >> (HTBITS - (htshift<<1) - 1)); /* must be odd */
702 /* open address hashtable search with double hash probing */
703 while (htable[h].data) {
704 if ((htable[h].data->st.st_ino == entry->st.st_ino) &&
705 (htable[h].data->st.st_dev == entry->st.st_dev)) {
706 return htable[h].data;
708 h = (h + h2) & htmask;
711 /* Insert the current entry into hashtable */
712 htable[h].data = entry;