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
33 * @(#)utilities.c 8.5 (Berkeley) 4/28/95
34 * $FreeBSD: src/sbin/restore/utilities.c,v 1.8.2.2 2001/07/30 10:30:08 dd Exp $
37 #include <sys/param.h>
40 #include <vfs/ufs/dinode.h>
41 #include <vfs/ufs/dir.h>
53 * Insure that all the components of a pathname exist.
62 start = strchr(name, '/');
65 for (cp = start; *cp != '\0'; cp++) {
69 ep = lookupname(name);
71 /* Safe; we know the pathname exists in the dump. */
72 ep = addentry(name, pathsearch(name)->d_ino, NODE);
75 ep->e_flags |= NEW|KEEP;
81 * Change a name to a unique temporary name.
84 mktempname(struct entry *ep)
86 char oldname[MAXPATHLEN];
88 if (ep->e_flags & TMPNAME)
89 badentry(ep, "mktempname: called with TMPNAME");
90 ep->e_flags |= TMPNAME;
91 strcpy(oldname, myname(ep));
93 ep->e_name = savename(gentempname(ep));
94 ep->e_namlen = strlen(ep->e_name);
95 renameit(oldname, myname(ep));
99 * Generate a temporary name for an entry.
102 gentempname(struct entry *ep)
104 static char name[MAXPATHLEN];
108 for (np = lookupino(ep->e_ino);
109 np != NULL && np != ep; np = np->e_links)
112 badentry(ep, "not on ino list");
113 sprintf(name, "%s%ld%lu", TMPHDR, i, (u_long)ep->e_ino);
118 * Rename a file or directory.
121 renameit(char *from, char *to)
123 if (!Nflag && rename(from, to) < 0) {
124 fprintf(stderr, "warning: cannot rename %s to %s: %s\n",
125 from, to, strerror(errno));
128 vprintf(stdout, "rename %s to %s\n", from, to);
132 * Create a new node (directory).
135 newnode(struct entry *np)
139 if (np->e_type != NODE)
140 badentry(np, "newnode: not a node");
142 if (!Nflag && mkdir(cp, 0777) < 0 && !uflag) {
143 np->e_flags |= EXISTED;
144 fprintf(stderr, "warning: %s: %s\n", cp, strerror(errno));
147 vprintf(stdout, "Make node %s\n", cp);
151 * Remove an old node (directory).
154 removenode(struct entry *ep)
158 if (ep->e_type != NODE)
159 badentry(ep, "removenode: not a node");
160 if (ep->e_entries != NULL)
161 badentry(ep, "removenode: non-empty directory");
162 ep->e_flags |= REMOVED;
163 ep->e_flags &= ~TMPNAME;
165 if (!Nflag && rmdir(cp) < 0) {
166 fprintf(stderr, "warning: %s: %s\n", cp, strerror(errno));
169 vprintf(stdout, "Remove node %s\n", cp);
176 removeleaf(struct entry *ep)
180 if (ep->e_type != LEAF)
181 badentry(ep, "removeleaf: not a leaf");
182 ep->e_flags |= REMOVED;
183 ep->e_flags &= ~TMPNAME;
185 if (!Nflag && unlink(cp) < 0) {
186 fprintf(stderr, "warning: %s: %s\n", cp, strerror(errno));
189 vprintf(stdout, "Remove leaf %s\n", cp);
196 linkit(char *existing, char *new, int type)
199 /* if we want to unlink first, do it now so *link() won't fail */
203 if (type == SYMLINK) {
204 if (!Nflag && symlink(existing, new) < 0) {
206 "warning: cannot create symbolic link %s->%s: %s\n",
207 new, existing, strerror(errno));
210 } else if (type == HARDLINK) {
213 if (!Nflag && (ret = link(existing, new)) < 0) {
217 * Most likely, the schg flag is set. Clear the
218 * flags and try again.
220 if (stat(existing, &s) == 0 && s.st_flags != 0 &&
221 chflags(existing, 0) == 0) {
222 ret = link(existing, new);
223 chflags(existing, s.st_flags);
226 fprintf(stderr, "warning: cannot create "
227 "hard link %s->%s: %s\n",
228 new, existing, strerror(errno));
233 panic("linkit: unknown type %d\n", type);
236 vprintf(stdout, "Create %s link %s->%s\n",
237 type == SYMLINK ? "symbolic" : "hard", new, existing);
245 addwhiteout(char *name)
248 if (!Nflag && mknod(name, S_IFWHT, 0) < 0) {
249 fprintf(stderr, "warning: cannot create whiteout %s: %s\n",
250 name, strerror(errno));
253 vprintf(stdout, "Create whiteout %s\n", name);
261 delwhiteout(struct entry *ep)
265 if (ep->e_type != LEAF)
266 badentry(ep, "delwhiteout: not a leaf");
267 ep->e_flags |= REMOVED;
268 ep->e_flags &= ~TMPNAME;
270 if (!Nflag && undelete(name) < 0) {
271 fprintf(stderr, "warning: cannot delete whiteout %s: %s\n",
272 name, strerror(errno));
275 vprintf(stdout, "Delete whiteout %s\n", name);
279 * find lowest number file (above "start") that needs to be extracted
282 lowerbnd(ufs1_ino_t start)
286 for ( ; start < maxino; start++) {
287 ep = lookupino(start);
288 if (ep == NULL || ep->e_type == NODE)
290 if (ep->e_flags & (NEW|EXTRACT))
297 * find highest number file (below "start") that needs to be extracted
300 upperbnd(ufs1_ino_t start)
304 for ( ; start > ROOTINO; start--) {
305 ep = lookupino(start);
306 if (ep == NULL || ep->e_type == NODE)
308 if (ep->e_flags & (NEW|EXTRACT))
315 * report on a badly formed entry
318 badentry(struct entry *ep, char *msg)
321 fprintf(stderr, "bad entry: %s\n", msg);
322 fprintf(stderr, "name: %s\n", myname(ep));
323 fprintf(stderr, "parent name %s\n", myname(ep->e_parent));
324 if (ep->e_sibling != NULL)
325 fprintf(stderr, "sibling name: %s\n", myname(ep->e_sibling));
326 if (ep->e_entries != NULL)
327 fprintf(stderr, "next entry name: %s\n", myname(ep->e_entries));
328 if (ep->e_links != NULL)
329 fprintf(stderr, "next link name: %s\n", myname(ep->e_links));
330 if (ep->e_next != NULL)
332 "next hashchain name: %s\n", myname(ep->e_next));
333 fprintf(stderr, "entry type: %s\n",
334 ep->e_type == NODE ? "NODE" : "LEAF");
335 fprintf(stderr, "inode number: %lu\n", (u_long)ep->e_ino);
336 panic("flags: %s\n", flagvalues(ep));
340 * Construct a string indicating the active flag bits of an entry.
343 flagvalues(struct entry *ep)
345 static char flagbuf[BUFSIZ];
347 strcpy(flagbuf, "|NIL");
349 if (ep->e_flags & REMOVED)
350 strcat(flagbuf, "|REMOVED");
351 if (ep->e_flags & TMPNAME)
352 strcat(flagbuf, "|TMPNAME");
353 if (ep->e_flags & EXTRACT)
354 strcat(flagbuf, "|EXTRACT");
355 if (ep->e_flags & NEW)
356 strcat(flagbuf, "|NEW");
357 if (ep->e_flags & KEEP)
358 strcat(flagbuf, "|KEEP");
359 if (ep->e_flags & EXISTED)
360 strcat(flagbuf, "|EXISTED");
361 return (&flagbuf[1]);
365 * Check to see if a name is on a dump tape.
368 dirlookup(const char *name)
373 ino = ((dp = pathsearch(name)) == NULL) ? 0 : dp->d_ino;
375 if (ino == 0 || TSTINO(ino, dumpmap) == 0)
376 fprintf(stderr, "%s is not on the tape\n", name);
384 reply(char *question)
389 fprintf(stderr, "%s? [yn] ", question);
392 while (c != '\n' && getc(terminal) != '\n')
395 } while (c != 'y' && c != 'n');
402 * handle unexpected inconsistencies
407 panic(const char *fmt, ...)
412 vfprintf(stderr, fmt, ap);
415 if (reply("abort") == GOOD) {
416 if (reply("dump core") == GOOD)