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