verify.c revision 1.14 1 1.14 ross /* $NetBSD: verify.c,v 1.14 1998/08/27 18:03:45 ross 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.14 ross __RCSID("$NetBSD: verify.c,v 1.14 1998/08/27 18:03:45 ross 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.1 cgd #include <dirent.h>
48 1.1 cgd #include <fts.h>
49 1.8 cgd #include <fnmatch.h>
50 1.1 cgd #include <unistd.h>
51 1.1 cgd #include <errno.h>
52 1.1 cgd #include <stdio.h>
53 1.1 cgd #include "mtree.h"
54 1.6 cgd #include "extern.h"
55 1.1 cgd
56 1.6 cgd extern int crc_total, ftsoptions;
57 1.6 cgd extern int dflag, eflag, rflag, sflag, uflag;
58 1.6 cgd extern char fullpath[MAXPATHLEN];
59 1.1 cgd
60 1.6 cgd static NODE *root;
61 1.1 cgd static char path[MAXPATHLEN];
62 1.1 cgd
63 1.6 cgd static void miss __P((NODE *, char *));
64 1.6 cgd static int vwalk __P((void));
65 1.6 cgd
66 1.6 cgd int
67 1.1 cgd verify()
68 1.1 cgd {
69 1.6 cgd int rval;
70 1.6 cgd
71 1.6 cgd root = spec();
72 1.6 cgd rval = vwalk();
73 1.1 cgd miss(root, path);
74 1.6 cgd return (rval);
75 1.1 cgd }
76 1.1 cgd
77 1.6 cgd static int
78 1.1 cgd vwalk()
79 1.1 cgd {
80 1.13 lukem FTS *t;
81 1.13 lukem FTSENT *p;
82 1.13 lukem NODE *ep, *level;
83 1.6 cgd int ftsdepth, specdepth, rval;
84 1.1 cgd char *argv[2];
85 1.1 cgd
86 1.1 cgd argv[0] = ".";
87 1.6 cgd argv[1] = NULL;
88 1.6 cgd if ((t = fts_open(argv, ftsoptions, NULL)) == NULL)
89 1.6 cgd err("fts_open: %s", strerror(errno));
90 1.1 cgd level = root;
91 1.6 cgd ftsdepth = specdepth = rval = 0;
92 1.12 mikel while ((p = fts_read(t)) != NULL) {
93 1.1 cgd switch(p->fts_info) {
94 1.1 cgd case FTS_D:
95 1.6 cgd ++ftsdepth;
96 1.1 cgd break;
97 1.1 cgd case FTS_DP:
98 1.6 cgd --ftsdepth;
99 1.1 cgd if (specdepth > ftsdepth) {
100 1.1 cgd for (level = level->parent; level->prev;
101 1.1 cgd level = level->prev);
102 1.6 cgd --specdepth;
103 1.1 cgd }
104 1.1 cgd continue;
105 1.1 cgd case FTS_DNR:
106 1.1 cgd case FTS_ERR:
107 1.1 cgd case FTS_NS:
108 1.6 cgd (void)fprintf(stderr, "mtree: %s: %s\n",
109 1.6 cgd RP(p), strerror(errno));
110 1.1 cgd continue;
111 1.1 cgd default:
112 1.1 cgd if (dflag)
113 1.1 cgd continue;
114 1.1 cgd }
115 1.1 cgd
116 1.1 cgd for (ep = level; ep; ep = ep->next)
117 1.12 mikel if ((ep->flags & F_MAGIC &&
118 1.12 mikel !fnmatch(ep->name, p->fts_name, FNM_PATHNAME)) ||
119 1.1 cgd !strcmp(ep->name, p->fts_name)) {
120 1.1 cgd ep->flags |= F_VISIT;
121 1.6 cgd if (compare(ep->name, ep, p))
122 1.6 cgd rval = MISMATCHEXIT;
123 1.11 lukem if (!(ep->flags & F_IGN) &&
124 1.11 lukem ep->child && ep->type == F_DIR &&
125 1.1 cgd p->fts_info == FTS_D) {
126 1.1 cgd level = ep->child;
127 1.6 cgd ++specdepth;
128 1.11 lukem } else
129 1.11 lukem (void)fts_set(t, p, FTS_SKIP);
130 1.1 cgd break;
131 1.1 cgd }
132 1.1 cgd
133 1.1 cgd if (ep)
134 1.1 cgd continue;
135 1.1 cgd if (!eflag) {
136 1.1 cgd (void)printf("extra: %s", RP(p));
137 1.1 cgd if (rflag) {
138 1.1 cgd if (unlink(p->fts_accpath)) {
139 1.1 cgd (void)printf(", not removed: %s",
140 1.1 cgd strerror(errno));
141 1.1 cgd } else
142 1.1 cgd (void)printf(", removed");
143 1.1 cgd }
144 1.1 cgd (void)putchar('\n');
145 1.1 cgd }
146 1.1 cgd (void)fts_set(t, p, FTS_SKIP);
147 1.1 cgd }
148 1.1 cgd (void)fts_close(t);
149 1.6 cgd if (sflag)
150 1.6 cgd (void)fprintf(stderr,
151 1.12 mikel "mtree: %s checksum: %u\n", fullpath, crc_total);
152 1.6 cgd return (rval);
153 1.1 cgd }
154 1.1 cgd
155 1.6 cgd static void
156 1.1 cgd miss(p, tail)
157 1.13 lukem NODE *p;
158 1.13 lukem char *tail;
159 1.1 cgd {
160 1.13 lukem int create;
161 1.13 lukem char *tp;
162 1.1 cgd
163 1.1 cgd for (; p; p = p->next) {
164 1.10 cgd if (p->flags & F_OPT && !(p->flags & F_VISIT))
165 1.10 cgd continue;
166 1.1 cgd if (p->type != F_DIR && (dflag || p->flags & F_VISIT))
167 1.1 cgd continue;
168 1.1 cgd (void)strcpy(tail, p->name);
169 1.1 cgd if (!(p->flags & F_VISIT))
170 1.1 cgd (void)printf("missing: %s", path);
171 1.1 cgd if (p->type != F_DIR) {
172 1.1 cgd putchar('\n');
173 1.1 cgd continue;
174 1.1 cgd }
175 1.1 cgd
176 1.1 cgd create = 0;
177 1.14 ross if (!(p->flags & F_VISIT) && uflag) {
178 1.6 cgd if (!(p->flags & (F_UID | F_UNAME)))
179 1.6 cgd (void)printf(" (not created: user not specified)");
180 1.6 cgd else if (!(p->flags & (F_GID | F_GNAME)))
181 1.6 cgd (void)printf(" (not created: group not specified)");
182 1.6 cgd else if (!(p->flags & F_MODE))
183 1.6 cgd (void)printf(" (not created: mode not specified)");
184 1.1 cgd else if (mkdir(path, S_IRWXU))
185 1.1 cgd (void)printf(" (not created: %s)",
186 1.1 cgd strerror(errno));
187 1.1 cgd else {
188 1.1 cgd create = 1;
189 1.1 cgd (void)printf(" (created)");
190 1.1 cgd }
191 1.14 ross }
192 1.1 cgd if (!(p->flags & F_VISIT))
193 1.1 cgd (void)putchar('\n');
194 1.1 cgd
195 1.1 cgd for (tp = tail; *tp; ++tp);
196 1.1 cgd *tp = '/';
197 1.1 cgd miss(p->child, tp + 1);
198 1.1 cgd *tp = '\0';
199 1.1 cgd
200 1.1 cgd if (!create)
201 1.1 cgd continue;
202 1.1 cgd if (chown(path, p->st_uid, p->st_gid)) {
203 1.6 cgd (void)printf("%s: user/group/mode not modified: %s\n",
204 1.1 cgd path, strerror(errno));
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.1 cgd path, strerror(errno));
210 1.1 cgd }
211 1.1 cgd }
212