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[] =
42 #include <sys/param.h>
45 #include <ufs/ufs/dinode.h>
46 #include <ufs/ufs/dir.h>
57 * Insure that all the components of a pathname exist.
67 start = strchr(name, '/');
70 for (cp = start; *cp != '\0'; cp++) {
74 ep = lookupname(name);
76 /* Safe; we know the pathname exists in the dump. */
77 ep = addentry(name, pathsearch(name)->d_ino, NODE);
80 ep->e_flags |= NEW|KEEP;
86 * Change a name to a unique temporary name.
90 register struct entry *ep;
92 char oldname[MAXPATHLEN];
94 if (ep->e_flags & TMPNAME)
95 badentry(ep, "mktempname: called with TMPNAME");
96 ep->e_flags |= TMPNAME;
97 (void) strcpy(oldname, myname(ep));
99 ep->e_name = savename(gentempname(ep));
100 ep->e_namlen = strlen(ep->e_name);
101 renameit(oldname, myname(ep));
105 * Generate a temporary name for an entry.
111 static char name[MAXPATHLEN];
115 for (np = lookupino(ep->e_ino);
116 np != NULL && np != ep; np = np->e_links)
119 badentry(ep, "not on ino list");
120 (void) sprintf(name, "%s%ld%lu", TMPHDR, i, (u_long)ep->e_ino);
125 * Rename a file or directory.
131 if (!Nflag && rename(from, to) < 0) {
132 fprintf(stderr, "warning: cannot rename %s to %s: %s\n",
133 from, to, strerror(errno));
136 vprintf(stdout, "rename %s to %s\n", from, to);
140 * Create a new node (directory).
148 if (np->e_type != NODE)
149 badentry(np, "newnode: not a node");
151 if (!Nflag && mkdir(cp, 0777) < 0 && !uflag) {
152 np->e_flags |= EXISTED;
153 fprintf(stderr, "warning: %s: %s\n", cp, strerror(errno));
156 vprintf(stdout, "Make node %s\n", cp);
160 * Remove an old node (directory).
164 register struct entry *ep;
168 if (ep->e_type != NODE)
169 badentry(ep, "removenode: not a node");
170 if (ep->e_entries != NULL)
171 badentry(ep, "removenode: non-empty directory");
172 ep->e_flags |= REMOVED;
173 ep->e_flags &= ~TMPNAME;
175 if (!Nflag && rmdir(cp) < 0) {
176 fprintf(stderr, "warning: %s: %s\n", cp, strerror(errno));
179 vprintf(stdout, "Remove node %s\n", cp);
187 register struct entry *ep;
191 if (ep->e_type != LEAF)
192 badentry(ep, "removeleaf: not a leaf");
193 ep->e_flags |= REMOVED;
194 ep->e_flags &= ~TMPNAME;
196 if (!Nflag && unlink(cp) < 0) {
197 fprintf(stderr, "warning: %s: %s\n", cp, strerror(errno));
200 vprintf(stdout, "Remove leaf %s\n", cp);
207 linkit(existing, new, type)
208 char *existing, *new;
212 /* if we want to unlink first, do it now so *link() won't fail */
216 if (type == SYMLINK) {
217 if (!Nflag && symlink(existing, new) < 0) {
219 "warning: cannot create symbolic link %s->%s: %s\n",
220 new, existing, strerror(errno));
223 } else if (type == HARDLINK) {
226 if (!Nflag && (ret = link(existing, new)) < 0) {
230 * Most likely, the schg flag is set. Clear the
231 * flags and try again.
233 if (stat(existing, &s) == 0 && s.st_flags != 0 &&
234 chflags(existing, 0) == 0) {
235 ret = link(existing, new);
236 chflags(existing, s.st_flags);
239 fprintf(stderr, "warning: cannot create "
240 "hard link %s->%s: %s\n",
241 new, existing, strerror(errno));
246 panic("linkit: unknown type %d\n", type);
249 vprintf(stdout, "Create %s link %s->%s\n",
250 type == SYMLINK ? "symbolic" : "hard", new, existing);
262 if (!Nflag && mknod(name, S_IFWHT, 0) < 0) {
263 fprintf(stderr, "warning: cannot create whiteout %s: %s\n",
264 name, strerror(errno));
267 vprintf(stdout, "Create whiteout %s\n", name);
276 register struct entry *ep;
280 if (ep->e_type != LEAF)
281 badentry(ep, "delwhiteout: not a leaf");
282 ep->e_flags |= REMOVED;
283 ep->e_flags &= ~TMPNAME;
285 if (!Nflag && undelete(name) < 0) {
286 fprintf(stderr, "warning: cannot delete whiteout %s: %s\n",
287 name, strerror(errno));
290 vprintf(stdout, "Delete whiteout %s\n", name);
294 * find lowest number file (above "start") that needs to be extracted
300 register struct entry *ep;
302 for ( ; start < maxino; start++) {
303 ep = lookupino(start);
304 if (ep == NULL || ep->e_type == NODE)
306 if (ep->e_flags & (NEW|EXTRACT))
313 * find highest number file (below "start") that needs to be extracted
319 register struct entry *ep;
321 for ( ; start > ROOTINO; start--) {
322 ep = lookupino(start);
323 if (ep == NULL || ep->e_type == NODE)
325 if (ep->e_flags & (NEW|EXTRACT))
332 * report on a badly formed entry
336 register struct entry *ep;
340 fprintf(stderr, "bad entry: %s\n", msg);
341 fprintf(stderr, "name: %s\n", myname(ep));
342 fprintf(stderr, "parent name %s\n", myname(ep->e_parent));
343 if (ep->e_sibling != NULL)
344 fprintf(stderr, "sibling name: %s\n", myname(ep->e_sibling));
345 if (ep->e_entries != NULL)
346 fprintf(stderr, "next entry name: %s\n", myname(ep->e_entries));
347 if (ep->e_links != NULL)
348 fprintf(stderr, "next link name: %s\n", myname(ep->e_links));
349 if (ep->e_next != NULL)
351 "next hashchain name: %s\n", myname(ep->e_next));
352 fprintf(stderr, "entry type: %s\n",
353 ep->e_type == NODE ? "NODE" : "LEAF");
354 fprintf(stderr, "inode number: %lu\n", (u_long)ep->e_ino);
355 panic("flags: %s\n", flagvalues(ep));
359 * Construct a string indicating the active flag bits of an entry.
363 register struct entry *ep;
365 static char flagbuf[BUFSIZ];
367 (void) strcpy(flagbuf, "|NIL");
369 if (ep->e_flags & REMOVED)
370 (void) strcat(flagbuf, "|REMOVED");
371 if (ep->e_flags & TMPNAME)
372 (void) strcat(flagbuf, "|TMPNAME");
373 if (ep->e_flags & EXTRACT)
374 (void) strcat(flagbuf, "|EXTRACT");
375 if (ep->e_flags & NEW)
376 (void) strcat(flagbuf, "|NEW");
377 if (ep->e_flags & KEEP)
378 (void) strcat(flagbuf, "|KEEP");
379 if (ep->e_flags & EXISTED)
380 (void) strcat(flagbuf, "|EXISTED");
381 return (&flagbuf[1]);
385 * Check to see if a name is on a dump tape.
394 ino = ((dp = pathsearch(name)) == NULL) ? 0 : dp->d_ino;
396 if (ino == 0 || TSTINO(ino, dumpmap) == 0)
397 fprintf(stderr, "%s is not on the tape\n", name);
411 fprintf(stderr, "%s? [yn] ", question);
412 (void) fflush(stderr);
414 while (c != '\n' && getc(terminal) != '\n')
417 } while (c != 'y' && c != 'n');
424 * handle unexpected inconsistencies
434 panic(const char *fmt, ...)
448 vfprintf(stderr, fmt, ap);
451 if (reply("abort") == GOOD) {
452 if (reply("dump core") == GOOD)