]>
Commit | Line | Data |
---|---|---|
1227625a SP |
1 | /* |
2 | * Ported to Linux's Second Extended File System as part of the | |
3 | * dump and restore backup suit | |
b45f51d6 | 4 | * Remy Card <card@Linux.EU.Org>, 1994-1997 |
ebcbe7f6 | 5 | * Stelian Pop <pop@cybercable.fr>, 1999-2000 |
1227625a SP |
6 | */ |
7 | ||
8 | /* | |
9 | * Copyright (c) 1983, 1993 | |
10 | * The Regents of the University of California. All rights reserved. | |
11 | * | |
12 | * Redistribution and use in source and binary forms, with or without | |
13 | * modification, are permitted provided that the following conditions | |
14 | * are met: | |
15 | * 1. Redistributions of source code must retain the above copyright | |
16 | * notice, this list of conditions and the following disclaimer. | |
17 | * 2. Redistributions in binary form must reproduce the above copyright | |
18 | * notice, this list of conditions and the following disclaimer in the | |
19 | * documentation and/or other materials provided with the distribution. | |
20 | * 3. All advertising materials mentioning features or use of this software | |
21 | * must display the following acknowledgement: | |
22 | * This product includes software developed by the University of | |
23 | * California, Berkeley and its contributors. | |
24 | * 4. Neither the name of the University nor the names of its contributors | |
25 | * may be used to endorse or promote products derived from this software | |
26 | * without specific prior written permission. | |
27 | * | |
28 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND | |
29 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
30 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
31 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | |
32 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
33 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
34 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
35 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
36 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
37 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
38 | * SUCH DAMAGE. | |
39 | */ | |
40 | ||
df9ae507 SP |
41 | #ifndef lint |
42 | static const char rcsid[] = | |
c60338a5 | 43 | "$Id: utilities.c,v 1.8 2000/02/08 12:22:43 stelian Exp $"; |
df9ae507 SP |
44 | #endif /* not lint */ |
45 | ||
1227625a SP |
46 | #include <sys/param.h> |
47 | #include <sys/stat.h> | |
48 | ||
49 | #ifdef __linux__ | |
50 | #include <sys/time.h> | |
51 | #include <linux/ext2_fs.h> | |
52 | #include <bsdcompat.h> | |
53 | #else /* __linux__ */ | |
54 | #include <ufs/ufs/dinode.h> | |
55 | #include <ufs/ufs/dir.h> | |
56 | #endif /* __linux__ */ | |
57 | ||
58 | #include <errno.h> | |
ddd2ef55 | 59 | #include <compaterr.h> |
1227625a | 60 | #include <stdio.h> |
1227625a SP |
61 | #include <string.h> |
62 | #include <unistd.h> | |
63 | ||
64 | #ifdef __linux__ | |
65 | #include <ext2fs/ext2fs.h> | |
66 | #endif | |
67 | ||
68 | #include "restore.h" | |
69 | #include "extern.h" | |
70 | ||
71 | /* | |
72 | * Insure that all the components of a pathname exist. | |
73 | */ | |
74 | void | |
ddd2ef55 | 75 | pathcheck(char *name) |
1227625a SP |
76 | { |
77 | register char *cp; | |
78 | struct entry *ep; | |
79 | char *start; | |
80 | ||
b45f51d6 | 81 | start = strchr(name, '/'); |
1227625a SP |
82 | if (start == 0) |
83 | return; | |
84 | for (cp = start; *cp != '\0'; cp++) { | |
85 | if (*cp != '/') | |
86 | continue; | |
87 | *cp = '\0'; | |
88 | ep = lookupname(name); | |
89 | if (ep == NULL) { | |
90 | /* Safe; we know the pathname exists in the dump. */ | |
91 | ep = addentry(name, pathsearch(name)->d_ino, NODE); | |
92 | newnode(ep); | |
93 | } | |
94 | ep->e_flags |= NEW|KEEP; | |
95 | *cp = '/'; | |
96 | } | |
97 | } | |
98 | ||
99 | /* | |
100 | * Change a name to a unique temporary name. | |
101 | */ | |
102 | void | |
ddd2ef55 | 103 | mktempname(struct entry *ep) |
1227625a SP |
104 | { |
105 | char oldname[MAXPATHLEN]; | |
106 | ||
107 | if (ep->e_flags & TMPNAME) | |
108 | badentry(ep, "mktempname: called with TMPNAME"); | |
109 | ep->e_flags |= TMPNAME; | |
110 | (void) strcpy(oldname, myname(ep)); | |
111 | freename(ep->e_name); | |
112 | ep->e_name = savename(gentempname(ep)); | |
113 | ep->e_namlen = strlen(ep->e_name); | |
114 | renameit(oldname, myname(ep)); | |
115 | } | |
116 | ||
117 | /* | |
118 | * Generate a temporary name for an entry. | |
119 | */ | |
120 | char * | |
ddd2ef55 | 121 | gentempname(struct entry *ep) |
1227625a SP |
122 | { |
123 | static char name[MAXPATHLEN]; | |
124 | struct entry *np; | |
125 | long i = 0; | |
126 | ||
127 | for (np = lookupino(ep->e_ino); | |
128 | np != NULL && np != ep; np = np->e_links) | |
129 | i++; | |
130 | if (np == NULL) | |
131 | badentry(ep, "not on ino list"); | |
ddd2ef55 | 132 | (void) snprintf(name, sizeof(name), "%s%ld%lu", TMPHDR, i, (unsigned long)ep->e_ino); |
1227625a SP |
133 | return (name); |
134 | } | |
135 | ||
136 | /* | |
137 | * Rename a file or directory. | |
138 | */ | |
139 | void | |
ddd2ef55 | 140 | renameit(char *from, char *to) |
1227625a SP |
141 | { |
142 | if (!Nflag && rename(from, to) < 0) { | |
ddd2ef55 | 143 | warn("cannot rename %s to %s", from, to); |
1227625a SP |
144 | return; |
145 | } | |
ddd2ef55 | 146 | Vprintf(stdout, "rename %s to %s\n", from, to); |
1227625a SP |
147 | } |
148 | ||
149 | /* | |
150 | * Create a new node (directory). | |
151 | */ | |
152 | void | |
ddd2ef55 | 153 | newnode(struct entry *np) |
1227625a SP |
154 | { |
155 | char *cp; | |
1227625a SP |
156 | if (np->e_type != NODE) |
157 | badentry(np, "newnode: not a node"); | |
158 | cp = myname(np); | |
159 | if (command == 'C') return; | |
b45f51d6 SP |
160 | |
161 | if (!Nflag && mkdir(cp, 0777) < 0 && !uflag) { | |
1227625a | 162 | np->e_flags |= EXISTED; |
ddd2ef55 | 163 | warn("%s", cp); |
1227625a SP |
164 | return; |
165 | } | |
ddd2ef55 | 166 | Vprintf(stdout, "Make node %s\n", cp); |
1227625a SP |
167 | } |
168 | ||
169 | /* | |
170 | * Remove an old node (directory). | |
171 | */ | |
172 | void | |
ddd2ef55 | 173 | removenode(struct entry *ep) |
1227625a SP |
174 | { |
175 | char *cp; | |
176 | ||
177 | if (ep->e_type != NODE) | |
178 | badentry(ep, "removenode: not a node"); | |
179 | if (ep->e_entries != NULL) | |
180 | badentry(ep, "removenode: non-empty directory"); | |
181 | ep->e_flags |= REMOVED; | |
182 | ep->e_flags &= ~TMPNAME; | |
183 | cp = myname(ep); | |
184 | if (!Nflag && rmdir(cp) < 0) { | |
ddd2ef55 | 185 | warn("%s", cp); |
1227625a SP |
186 | return; |
187 | } | |
ddd2ef55 | 188 | Vprintf(stdout, "Remove node %s\n", cp); |
1227625a SP |
189 | } |
190 | ||
191 | /* | |
192 | * Remove a leaf. | |
193 | */ | |
194 | void | |
ddd2ef55 | 195 | removeleaf(struct entry *ep) |
1227625a SP |
196 | { |
197 | char *cp; | |
198 | ||
199 | if (command == 'C') return; | |
200 | ||
201 | if (ep->e_type != LEAF) | |
202 | badentry(ep, "removeleaf: not a leaf"); | |
203 | ep->e_flags |= REMOVED; | |
204 | ep->e_flags &= ~TMPNAME; | |
205 | cp = myname(ep); | |
206 | if (!Nflag && unlink(cp) < 0) { | |
ddd2ef55 | 207 | warn("%s", cp); |
1227625a SP |
208 | return; |
209 | } | |
ddd2ef55 | 210 | Vprintf(stdout, "Remove leaf %s\n", cp); |
1227625a SP |
211 | } |
212 | ||
213 | /* | |
214 | * Create a link. | |
215 | */ | |
216 | int | |
ddd2ef55 | 217 | linkit(char *existing, char *new, int type) |
1227625a SP |
218 | { |
219 | ||
b45f51d6 SP |
220 | /* if we want to unlink first, do it now so *link() won't fail */ |
221 | if (uflag && !Nflag) | |
222 | (void)unlink(new); | |
223 | ||
1227625a SP |
224 | if (type == SYMLINK) { |
225 | if (!Nflag && symlink(existing, new) < 0) { | |
ddd2ef55 SP |
226 | warn("cannot create symbolic link %s->%s", |
227 | new, existing); | |
1227625a SP |
228 | return (FAIL); |
229 | } | |
230 | } else if (type == HARDLINK) { | |
b45f51d6 SP |
231 | int ret; |
232 | ||
233 | if (!Nflag && (ret = link(existing, new)) < 0) { | |
234 | ||
235 | #ifndef __linux__ | |
236 | struct stat s; | |
237 | ||
238 | /* | |
239 | * Most likely, the schg flag is set. Clear the | |
240 | * flags and try again. | |
241 | */ | |
242 | if (stat(existing, &s) == 0 && s.st_flags != 0 && | |
243 | chflags(existing, 0) == 0) { | |
244 | ret = link(existing, new); | |
245 | chflags(existing, s.st_flags); | |
246 | } | |
c60338a5 SP |
247 | #else |
248 | unsigned long s; | |
249 | ||
250 | /* | |
251 | * Most likely, the immutable or append-only attribute | |
252 | * is set. Clear the attributes and try again. | |
253 | */ | |
254 | if (fgetflags (existing, &s) != -1 && | |
255 | fsetflags (existing, 0) != -1) { | |
256 | ret = link(existing, new); | |
257 | fsetflags(existing, s); | |
258 | } | |
b45f51d6 SP |
259 | #endif |
260 | if (ret < 0) { | |
ddd2ef55 SP |
261 | warn("warning: cannot create hard link %s->%s", |
262 | new, existing); | |
b45f51d6 SP |
263 | return (FAIL); |
264 | } | |
1227625a SP |
265 | } |
266 | } else { | |
267 | panic("linkit: unknown type %d\n", type); | |
268 | return (FAIL); | |
269 | } | |
ddd2ef55 | 270 | Vprintf(stdout, "Create %s link %s->%s\n", |
1227625a SP |
271 | type == SYMLINK ? "symbolic" : "hard", new, existing); |
272 | return (GOOD); | |
273 | } | |
274 | ||
275 | #ifndef __linux__ | |
276 | /* | |
b45f51d6 | 277 | * Create a whiteout. |
1227625a SP |
278 | */ |
279 | int | |
ddd2ef55 | 280 | addwhiteout(char *name) |
1227625a SP |
281 | { |
282 | ||
283 | if (!Nflag && mknod(name, S_IFWHT, 0) < 0) { | |
ddd2ef55 | 284 | warn("cannot create whiteout %s", name); |
1227625a SP |
285 | return (FAIL); |
286 | } | |
ddd2ef55 | 287 | Vprintf(stdout, "Create whiteout %s\n", name); |
1227625a SP |
288 | return (GOOD); |
289 | } | |
290 | ||
291 | /* | |
292 | * Delete a whiteout. | |
293 | */ | |
294 | void | |
ddd2ef55 | 295 | delwhiteout(struct entry *ep) |
1227625a SP |
296 | { |
297 | char *name; | |
298 | ||
299 | if (ep->e_type != LEAF) | |
300 | badentry(ep, "delwhiteout: not a leaf"); | |
301 | ep->e_flags |= REMOVED; | |
302 | ep->e_flags &= ~TMPNAME; | |
303 | name = myname(ep); | |
304 | if (!Nflag && undelete(name) < 0) { | |
ddd2ef55 | 305 | warn("cannot delete whiteout %s", name); |
1227625a SP |
306 | return; |
307 | } | |
ddd2ef55 | 308 | Vprintf(stdout, "Delete whiteout %s\n", name); |
1227625a SP |
309 | } |
310 | #endif | |
311 | ||
312 | /* | |
313 | * find lowest number file (above "start") that needs to be extracted | |
314 | */ | |
315 | ino_t | |
ddd2ef55 | 316 | lowerbnd(ino_t start) |
1227625a SP |
317 | { |
318 | register struct entry *ep; | |
319 | ||
320 | for ( ; start < maxino; start++) { | |
321 | ep = lookupino(start); | |
322 | if (ep == NULL || ep->e_type == NODE) | |
323 | continue; | |
324 | if (ep->e_flags & (NEW|EXTRACT)) | |
325 | return (start); | |
326 | } | |
327 | return (start); | |
328 | } | |
329 | ||
330 | /* | |
331 | * find highest number file (below "start") that needs to be extracted | |
332 | */ | |
333 | ino_t | |
ddd2ef55 | 334 | upperbnd(ino_t start) |
1227625a SP |
335 | { |
336 | register struct entry *ep; | |
337 | ||
338 | for ( ; start > ROOTINO; start--) { | |
339 | ep = lookupino(start); | |
340 | if (ep == NULL || ep->e_type == NODE) | |
341 | continue; | |
342 | if (ep->e_flags & (NEW|EXTRACT)) | |
343 | return (start); | |
344 | } | |
345 | return (start); | |
346 | } | |
347 | ||
348 | /* | |
349 | * report on a badly formed entry | |
350 | */ | |
351 | void | |
ddd2ef55 | 352 | badentry(struct entry *ep, const char *msg) |
1227625a SP |
353 | { |
354 | ||
355 | fprintf(stderr, "bad entry: %s\n", msg); | |
356 | fprintf(stderr, "name: %s\n", myname(ep)); | |
357 | fprintf(stderr, "parent name %s\n", myname(ep->e_parent)); | |
358 | if (ep->e_sibling != NULL) | |
359 | fprintf(stderr, "sibling name: %s\n", myname(ep->e_sibling)); | |
360 | if (ep->e_entries != NULL) | |
361 | fprintf(stderr, "next entry name: %s\n", myname(ep->e_entries)); | |
362 | if (ep->e_links != NULL) | |
363 | fprintf(stderr, "next link name: %s\n", myname(ep->e_links)); | |
364 | if (ep->e_next != NULL) | |
365 | fprintf(stderr, | |
366 | "next hashchain name: %s\n", myname(ep->e_next)); | |
367 | fprintf(stderr, "entry type: %s\n", | |
368 | ep->e_type == NODE ? "NODE" : "LEAF"); | |
ddd2ef55 | 369 | fprintf(stderr, "inode number: %lu\n", (unsigned long)ep->e_ino); |
1227625a SP |
370 | panic("flags: %s\n", flagvalues(ep)); |
371 | } | |
372 | ||
373 | /* | |
374 | * Construct a string indicating the active flag bits of an entry. | |
375 | */ | |
376 | char * | |
ddd2ef55 | 377 | flagvalues(struct entry *ep) |
1227625a SP |
378 | { |
379 | static char flagbuf[BUFSIZ]; | |
380 | ||
381 | (void) strcpy(flagbuf, "|NIL"); | |
382 | flagbuf[0] = '\0'; | |
383 | if (ep->e_flags & REMOVED) | |
384 | (void) strcat(flagbuf, "|REMOVED"); | |
385 | if (ep->e_flags & TMPNAME) | |
386 | (void) strcat(flagbuf, "|TMPNAME"); | |
387 | if (ep->e_flags & EXTRACT) | |
388 | (void) strcat(flagbuf, "|EXTRACT"); | |
389 | if (ep->e_flags & NEW) | |
390 | (void) strcat(flagbuf, "|NEW"); | |
391 | if (ep->e_flags & KEEP) | |
392 | (void) strcat(flagbuf, "|KEEP"); | |
393 | if (ep->e_flags & EXISTED) | |
394 | (void) strcat(flagbuf, "|EXISTED"); | |
395 | return (&flagbuf[1]); | |
396 | } | |
397 | ||
398 | /* | |
399 | * Check to see if a name is on a dump tape. | |
400 | */ | |
401 | ino_t | |
ddd2ef55 | 402 | dirlookup(const char *name) |
1227625a SP |
403 | { |
404 | struct direct *dp; | |
405 | ino_t ino; | |
b45f51d6 | 406 | |
1227625a SP |
407 | ino = ((dp = pathsearch(name)) == NULL) ? 0 : dp->d_ino; |
408 | ||
409 | if (ino == 0 || TSTINO(ino, dumpmap) == 0) | |
410 | fprintf(stderr, "%s is not on the tape\n", name); | |
411 | return (ino); | |
412 | } | |
413 | ||
414 | /* | |
415 | * Elicit a reply. | |
416 | */ | |
417 | int | |
ddd2ef55 | 418 | reply(const char *question) |
1227625a SP |
419 | { |
420 | char c; | |
421 | ||
422 | do { | |
423 | fprintf(stderr, "%s? [yn] ", question); | |
424 | (void) fflush(stderr); | |
425 | c = getc(terminal); | |
426 | while (c != '\n' && getc(terminal) != '\n') | |
427 | if (feof(terminal)) | |
428 | return (FAIL); | |
429 | } while (c != 'y' && c != 'n'); | |
430 | if (c == 'y') | |
431 | return (GOOD); | |
432 | return (FAIL); | |
433 | } | |
434 | ||
435 | /* | |
436 | * handle unexpected inconsistencies | |
437 | */ | |
ddd2ef55 | 438 | #ifdef __STDC__ |
1227625a SP |
439 | #include <stdarg.h> |
440 | #else | |
441 | #include <varargs.h> | |
442 | #endif | |
443 | ||
444 | void | |
ddd2ef55 | 445 | #ifdef __STDC__ |
1227625a SP |
446 | panic(const char *fmt, ...) |
447 | #else | |
448 | panic(fmt, va_alist) | |
449 | char *fmt; | |
450 | va_dcl | |
451 | #endif | |
452 | { | |
453 | va_list ap; | |
ddd2ef55 | 454 | #ifdef __STDC__ |
1227625a SP |
455 | va_start(ap, fmt); |
456 | #else | |
457 | va_start(ap); | |
458 | #endif | |
459 | ||
460 | vfprintf(stderr, fmt, ap); | |
461 | if (yflag) | |
462 | return; | |
463 | if (reply("abort") == GOOD) { | |
464 | if (reply("dump core") == GOOD) | |
465 | abort(); | |
ddd2ef55 | 466 | exit(1); |
1227625a SP |
467 | } |
468 | } |