2 * Copyright (c) 1983, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 static char sccsid[] = "@(#)utilities.c 8.5 (Berkeley) 4/28/95";
38 static const char rcsid[] =
39 "$FreeBSD: src/sbin/restore/utilities.c,v 1.8.2.2 2001/07/30 10:30:08 dd Exp $";
42 #include <sys/param.h>
45 #include <ufs/ufs/dinode.h>
46 #include <ufs/ufs/dir.h>
58 * Insure that all the components of a pathname exist.
68 start = strchr(name, '/');
71 for (cp = start; *cp != '\0'; cp++) {
75 ep = lookupname(name);
77 /* Safe; we know the pathname exists in the dump. */
78 ep = addentry(name, pathsearch(name)->d_ino, NODE);
81 ep->e_flags |= NEW|KEEP;
87 * Change a name to a unique temporary name.
91 register struct entry *ep;
93 char oldname[MAXPATHLEN];
95 if (ep->e_flags & TMPNAME)
96 badentry(ep, "mktempname: called with TMPNAME");
97 ep->e_flags |= TMPNAME;
98 (void) strcpy(oldname, myname(ep));
100 ep->e_name = savename(gentempname(ep));
101 ep->e_namlen = strlen(ep->e_name);
102 renameit(oldname, myname(ep));
106 * Generate a temporary name for an entry.
112 static char name[MAXPATHLEN];
116 for (np = lookupino(ep->e_ino);
117 np != NULL && np != ep; np = np->e_links)
120 badentry(ep, "not on ino list");
121 (void) sprintf(name, "%s%ld%lu", TMPHDR, i, (u_long)ep->e_ino);
126 * Rename a file or directory.
132 if (!Nflag && rename(from, to) < 0) {
133 fprintf(stderr, "warning: cannot rename %s to %s: %s\n",
134 from, to, strerror(errno));
137 vprintf(stdout, "rename %s to %s\n", from, to);
141 * Create a new node (directory).
149 if (np->e_type != NODE)
150 badentry(np, "newnode: not a node");
152 if (!Nflag && mkdir(cp, 0777) < 0 && !uflag) {
153 np->e_flags |= EXISTED;
154 fprintf(stderr, "warning: %s: %s\n", cp, strerror(errno));
157 vprintf(stdout, "Make node %s\n", cp);
161 * Remove an old node (directory).
165 register struct entry *ep;
169 if (ep->e_type != NODE)
170 badentry(ep, "removenode: not a node");
171 if (ep->e_entries != NULL)
172 badentry(ep, "removenode: non-empty directory");
173 ep->e_flags |= REMOVED;
174 ep->e_flags &= ~TMPNAME;
176 if (!Nflag && rmdir(cp) < 0) {
177 fprintf(stderr, "warning: %s: %s\n", cp, strerror(errno));
180 vprintf(stdout, "Remove node %s\n", cp);
188 register struct entry *ep;
192 if (ep->e_type != LEAF)
193 badentry(ep, "removeleaf: not a leaf");
194 ep->e_flags |= REMOVED;
195 ep->e_flags &= ~TMPNAME;
197 if (!Nflag && unlink(cp) < 0) {
198 fprintf(stderr, "warning: %s: %s\n", cp, strerror(errno));
201 vprintf(stdout, "Remove leaf %s\n", cp);
208 linkit(existing, new, type)
209 char *existing, *new;
213 /* if we want to unlink first, do it now so *link() won't fail */
217 if (type == SYMLINK) {
218 if (!Nflag && symlink(existing, new) < 0) {
220 "warning: cannot create symbolic link %s->%s: %s\n",
221 new, existing, strerror(errno));
224 } else if (type == HARDLINK) {
227 if (!Nflag && (ret = link(existing, new)) < 0) {
231 * Most likely, the schg flag is set. Clear the
232 * flags and try again.
234 if (stat(existing, &s) == 0 && s.st_flags != 0 &&
235 chflags(existing, 0) == 0) {
236 ret = link(existing, new);
237 chflags(existing, s.st_flags);
240 fprintf(stderr, "warning: cannot create "
241 "hard link %s->%s: %s\n",
242 new, existing, strerror(errno));
247 panic("linkit: unknown type %d\n", type);
250 vprintf(stdout, "Create %s link %s->%s\n",
251 type == SYMLINK ? "symbolic" : "hard", new, existing);
263 if (!Nflag && mknod(name, S_IFWHT, 0) < 0) {
264 fprintf(stderr, "warning: cannot create whiteout %s: %s\n",
265 name, strerror(errno));
268 vprintf(stdout, "Create whiteout %s\n", name);
277 register struct entry *ep;
281 if (ep->e_type != LEAF)
282 badentry(ep, "delwhiteout: not a leaf");
283 ep->e_flags |= REMOVED;
284 ep->e_flags &= ~TMPNAME;
286 if (!Nflag && undelete(name) < 0) {
287 fprintf(stderr, "warning: cannot delete whiteout %s: %s\n",
288 name, strerror(errno));
291 vprintf(stdout, "Delete whiteout %s\n", name);
295 * find lowest number file (above "start") that needs to be extracted
301 register struct entry *ep;
303 for ( ; start < maxino; start++) {
304 ep = lookupino(start);
305 if (ep == NULL || ep->e_type == NODE)
307 if (ep->e_flags & (NEW|EXTRACT))
314 * find highest number file (below "start") that needs to be extracted
320 register struct entry *ep;
322 for ( ; start > ROOTINO; start--) {
323 ep = lookupino(start);
324 if (ep == NULL || ep->e_type == NODE)
326 if (ep->e_flags & (NEW|EXTRACT))
333 * report on a badly formed entry
337 register struct entry *ep;
341 fprintf(stderr, "bad entry: %s\n", msg);
342 fprintf(stderr, "name: %s\n", myname(ep));
343 fprintf(stderr, "parent name %s\n", myname(ep->e_parent));
344 if (ep->e_sibling != NULL)
345 fprintf(stderr, "sibling name: %s\n", myname(ep->e_sibling));
346 if (ep->e_entries != NULL)
347 fprintf(stderr, "next entry name: %s\n", myname(ep->e_entries));
348 if (ep->e_links != NULL)
349 fprintf(stderr, "next link name: %s\n", myname(ep->e_links));
350 if (ep->e_next != NULL)
352 "next hashchain name: %s\n", myname(ep->e_next));
353 fprintf(stderr, "entry type: %s\n",
354 ep->e_type == NODE ? "NODE" : "LEAF");
355 fprintf(stderr, "inode number: %lu\n", (u_long)ep->e_ino);
356 panic("flags: %s\n", flagvalues(ep));
360 * Construct a string indicating the active flag bits of an entry.
364 register struct entry *ep;
366 static char flagbuf[BUFSIZ];
368 (void) strcpy(flagbuf, "|NIL");
370 if (ep->e_flags & REMOVED)
371 (void) strcat(flagbuf, "|REMOVED");
372 if (ep->e_flags & TMPNAME)
373 (void) strcat(flagbuf, "|TMPNAME");
374 if (ep->e_flags & EXTRACT)
375 (void) strcat(flagbuf, "|EXTRACT");
376 if (ep->e_flags & NEW)
377 (void) strcat(flagbuf, "|NEW");
378 if (ep->e_flags & KEEP)
379 (void) strcat(flagbuf, "|KEEP");
380 if (ep->e_flags & EXISTED)
381 (void) strcat(flagbuf, "|EXISTED");
382 return (&flagbuf[1]);
386 * Check to see if a name is on a dump tape.
395 ino = ((dp = pathsearch(name)) == NULL) ? 0 : dp->d_ino;
397 if (ino == 0 || TSTINO(ino, dumpmap) == 0)
398 fprintf(stderr, "%s is not on the tape\n", name);
412 fprintf(stderr, "%s? [yn] ", question);
413 (void) fflush(stderr);
415 while (c != '\n' && getc(terminal) != '\n')
418 } while (c != 'y' && c != 'n');
425 * handle unexpected inconsistencies
435 panic(const char *fmt, ...)
449 vfprintf(stderr, fmt, ap);
452 if (reply("abort") == GOOD) {
453 if (reply("dump core") == GOOD)