verify.c revision 1.8 1 1.1 cgd /*-
2 1.8 cgd * Copyright (c) 1990, 1993
3 1.8 cgd * The Regents of the University of California. All rights reserved.
4 1.1 cgd *
5 1.1 cgd * Redistribution and use in source and binary forms, with or without
6 1.1 cgd * modification, are permitted provided that the following conditions
7 1.1 cgd * are met:
8 1.1 cgd * 1. Redistributions of source code must retain the above copyright
9 1.1 cgd * notice, this list of conditions and the following disclaimer.
10 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer in the
12 1.1 cgd * documentation and/or other materials provided with the distribution.
13 1.1 cgd * 3. All advertising materials mentioning features or use of this software
14 1.1 cgd * must display the following acknowledgement:
15 1.1 cgd * This product includes software developed by the University of
16 1.1 cgd * California, Berkeley and its contributors.
17 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
18 1.1 cgd * may be used to endorse or promote products derived from this software
19 1.1 cgd * without specific prior written permission.
20 1.1 cgd *
21 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 1.1 cgd * SUCH DAMAGE.
32 1.1 cgd */
33 1.1 cgd
34 1.1 cgd #ifndef lint
35 1.8 cgd static char sccsid[] = "@(#)verify.c 8.1 (Berkeley) 6/6/93";
36 1.1 cgd #endif /* not lint */
37 1.1 cgd
38 1.1 cgd #include <sys/param.h>
39 1.1 cgd #include <sys/stat.h>
40 1.1 cgd #include <dirent.h>
41 1.1 cgd #include <fts.h>
42 1.8 cgd #include <fnmatch.h>
43 1.1 cgd #include <unistd.h>
44 1.1 cgd #include <errno.h>
45 1.1 cgd #include <stdio.h>
46 1.1 cgd #include "mtree.h"
47 1.6 cgd #include "extern.h"
48 1.1 cgd
49 1.6 cgd extern int crc_total, ftsoptions;
50 1.6 cgd extern int dflag, eflag, rflag, sflag, uflag;
51 1.6 cgd extern char fullpath[MAXPATHLEN];
52 1.1 cgd
53 1.6 cgd static NODE *root;
54 1.1 cgd static char path[MAXPATHLEN];
55 1.1 cgd
56 1.6 cgd static void miss __P((NODE *, char *));
57 1.6 cgd static int vwalk __P((void));
58 1.6 cgd
59 1.6 cgd int
60 1.1 cgd verify()
61 1.1 cgd {
62 1.6 cgd int rval;
63 1.6 cgd
64 1.6 cgd root = spec();
65 1.6 cgd rval = vwalk();
66 1.1 cgd miss(root, path);
67 1.6 cgd return (rval);
68 1.1 cgd }
69 1.1 cgd
70 1.6 cgd static int
71 1.1 cgd vwalk()
72 1.1 cgd {
73 1.1 cgd register FTS *t;
74 1.1 cgd register FTSENT *p;
75 1.1 cgd register NODE *ep, *level;
76 1.6 cgd int ftsdepth, specdepth, rval;
77 1.1 cgd char *argv[2];
78 1.1 cgd
79 1.1 cgd argv[0] = ".";
80 1.6 cgd argv[1] = NULL;
81 1.6 cgd if ((t = fts_open(argv, ftsoptions, NULL)) == NULL)
82 1.6 cgd err("fts_open: %s", strerror(errno));
83 1.1 cgd level = root;
84 1.6 cgd ftsdepth = specdepth = rval = 0;
85 1.1 cgd while (p = fts_read(t)) {
86 1.1 cgd switch(p->fts_info) {
87 1.1 cgd case FTS_D:
88 1.6 cgd ++ftsdepth;
89 1.1 cgd break;
90 1.1 cgd case FTS_DP:
91 1.6 cgd --ftsdepth;
92 1.1 cgd if (specdepth > ftsdepth) {
93 1.1 cgd for (level = level->parent; level->prev;
94 1.1 cgd level = level->prev);
95 1.6 cgd --specdepth;
96 1.1 cgd }
97 1.1 cgd continue;
98 1.1 cgd case FTS_DNR:
99 1.1 cgd case FTS_ERR:
100 1.1 cgd case FTS_NS:
101 1.6 cgd (void)fprintf(stderr, "mtree: %s: %s\n",
102 1.6 cgd RP(p), strerror(errno));
103 1.1 cgd continue;
104 1.1 cgd default:
105 1.1 cgd if (dflag)
106 1.1 cgd continue;
107 1.1 cgd }
108 1.1 cgd
109 1.1 cgd for (ep = level; ep; ep = ep->next)
110 1.8 cgd if (ep->flags & F_MAGIC &&
111 1.8 cgd !fnmatch(ep->name, p->fts_name, FNM_PATHNAME) ||
112 1.1 cgd !strcmp(ep->name, p->fts_name)) {
113 1.1 cgd ep->flags |= F_VISIT;
114 1.6 cgd if (compare(ep->name, ep, p))
115 1.6 cgd rval = MISMATCHEXIT;
116 1.6 cgd if (ep->flags & F_IGN)
117 1.1 cgd (void)fts_set(t, p, FTS_SKIP);
118 1.6 cgd else if (ep->child && ep->type == F_DIR &&
119 1.1 cgd p->fts_info == FTS_D) {
120 1.1 cgd level = ep->child;
121 1.6 cgd ++specdepth;
122 1.1 cgd }
123 1.1 cgd break;
124 1.1 cgd }
125 1.1 cgd
126 1.1 cgd if (ep)
127 1.1 cgd continue;
128 1.1 cgd if (!eflag) {
129 1.1 cgd (void)printf("extra: %s", RP(p));
130 1.1 cgd if (rflag) {
131 1.1 cgd if (unlink(p->fts_accpath)) {
132 1.1 cgd (void)printf(", not removed: %s",
133 1.1 cgd strerror(errno));
134 1.1 cgd } else
135 1.1 cgd (void)printf(", removed");
136 1.1 cgd }
137 1.1 cgd (void)putchar('\n');
138 1.1 cgd }
139 1.1 cgd (void)fts_set(t, p, FTS_SKIP);
140 1.1 cgd }
141 1.1 cgd (void)fts_close(t);
142 1.6 cgd if (sflag)
143 1.6 cgd (void)fprintf(stderr,
144 1.6 cgd "mtree: %s checksum: %lu\n", fullpath, crc_total);
145 1.6 cgd return (rval);
146 1.1 cgd }
147 1.1 cgd
148 1.6 cgd static void
149 1.1 cgd miss(p, tail)
150 1.1 cgd register NODE *p;
151 1.1 cgd register char *tail;
152 1.1 cgd {
153 1.1 cgd register int create;
154 1.1 cgd register char *tp;
155 1.1 cgd
156 1.1 cgd for (; p; p = p->next) {
157 1.1 cgd if (p->type != F_DIR && (dflag || p->flags & F_VISIT))
158 1.1 cgd continue;
159 1.1 cgd (void)strcpy(tail, p->name);
160 1.1 cgd if (!(p->flags & F_VISIT))
161 1.1 cgd (void)printf("missing: %s", path);
162 1.1 cgd if (p->type != F_DIR) {
163 1.1 cgd putchar('\n');
164 1.1 cgd continue;
165 1.1 cgd }
166 1.1 cgd
167 1.1 cgd create = 0;
168 1.1 cgd if (!(p->flags & F_VISIT) && uflag)
169 1.6 cgd if (!(p->flags & (F_UID | F_UNAME)))
170 1.6 cgd (void)printf(" (not created: user not specified)");
171 1.6 cgd else if (!(p->flags & (F_GID | F_GNAME)))
172 1.6 cgd (void)printf(" (not created: group not specified)");
173 1.6 cgd else if (!(p->flags & F_MODE))
174 1.6 cgd (void)printf(" (not created: mode not specified)");
175 1.1 cgd else if (mkdir(path, S_IRWXU))
176 1.1 cgd (void)printf(" (not created: %s)",
177 1.1 cgd strerror(errno));
178 1.1 cgd else {
179 1.1 cgd create = 1;
180 1.1 cgd (void)printf(" (created)");
181 1.1 cgd }
182 1.1 cgd
183 1.1 cgd if (!(p->flags & F_VISIT))
184 1.1 cgd (void)putchar('\n');
185 1.1 cgd
186 1.1 cgd for (tp = tail; *tp; ++tp);
187 1.1 cgd *tp = '/';
188 1.1 cgd miss(p->child, tp + 1);
189 1.1 cgd *tp = '\0';
190 1.1 cgd
191 1.1 cgd if (!create)
192 1.1 cgd continue;
193 1.1 cgd if (chown(path, p->st_uid, p->st_gid)) {
194 1.6 cgd (void)printf("%s: user/group/mode not modified: %s\n",
195 1.1 cgd path, strerror(errno));
196 1.1 cgd continue;
197 1.1 cgd }
198 1.1 cgd if (chmod(path, p->st_mode))
199 1.1 cgd (void)printf("%s: permissions not set: %s\n",
200 1.1 cgd path, strerror(errno));
201 1.1 cgd }
202 1.1 cgd }
203