]>
git.wh0rd.org - dump.git/blob - restore/utilities.c
2 * Ported to Linux's Second Extended File System as part of the
3 * dump and restore backup suit
4 * Remy Card <card@Linux.EU.Org>, 1994-1997
5 * Stelian Pop <stelian@popies.net>, 1999-2000
6 * Stelian Pop <stelian@popies.net> - AlcĂ´ve <www.alcove.com>, 2000-2002
10 * Copyright (c) 1983, 1993
11 * The Regents of the University of California. All rights reserved.
13 * Redistribution and use in source and binary forms, with or without
14 * modification, are permitted provided that the following conditions
16 * 1. Redistributions of source code must retain the above copyright
17 * notice, this list of conditions and the following disclaimer.
18 * 2. Redistributions in binary form must reproduce the above copyright
19 * notice, this list of conditions and the following disclaimer in the
20 * documentation and/or other materials provided with the distribution.
21 * 3. All advertising materials mentioning features or use of this software
22 * must display the following acknowledgement:
23 * This product includes software developed by the University of
24 * California, Berkeley and its contributors.
25 * 4. Neither the name of the University nor the names of its contributors
26 * may be used to endorse or promote products derived from this software
27 * without specific prior written permission.
29 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
30 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
31 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
32 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
33 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
34 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
35 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
36 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
37 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
38 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
43 static const char rcsid
[] =
44 "$Id: utilities.c,v 1.20 2002/02/04 11:18:46 stelian Exp $";
49 #include <compaterr.h>
54 #include <sys/param.h>
60 #ifdef HAVE_EXT2FS_EXT2_FS_H
61 #include <ext2fs/ext2_fs.h>
63 #include <linux/ext2_fs.h>
65 #include <ext2fs/ext2fs.h>
66 #include <bsdcompat.h>
68 #include <ufs/ufs/dinode.h>
69 #include <ufs/ufs/dir.h>
70 #endif /* __linux__ */
76 * Insure that all the components of a pathname exist.
85 start
= strchr(name
, '/');
88 for (cp
= start
; *cp
!= '\0'; cp
++) {
92 ep
= lookupname(name
);
94 /* Safe; we know the pathname exists in the dump. */
95 ep
= addentry(name
, pathsearch(name
)->d_ino
, NODE
);
98 ep
->e_flags
|= NEW
|KEEP
;
104 * Change a name to a unique temporary name.
107 mktempname(struct entry
*ep
)
109 char oldname
[MAXPATHLEN
];
111 if (ep
->e_flags
& TMPNAME
)
112 badentry(ep
, "mktempname: called with TMPNAME");
113 ep
->e_flags
|= TMPNAME
;
114 (void) strcpy(oldname
, myname(ep
));
115 freename(ep
->e_name
);
116 ep
->e_name
= savename(gentempname(ep
));
117 ep
->e_namlen
= strlen(ep
->e_name
);
118 renameit(oldname
, myname(ep
));
122 * Generate a temporary name for an entry.
125 gentempname(struct entry
*ep
)
127 static char name
[MAXPATHLEN
];
131 for (np
= lookupino(ep
->e_ino
);
132 np
!= NULL
&& np
!= ep
; np
= np
->e_links
)
135 badentry(ep
, "not on ino list");
136 (void) snprintf(name
, sizeof(name
), "%s%ld%lu", TMPHDR
, i
, (unsigned long)ep
->e_ino
);
141 * Rename a file or directory.
144 renameit(char *from
, char *to
)
146 if (!Nflag
&& rename(from
, to
) < 0) {
147 warn("cannot rename %s to %s", from
, to
);
150 Vprintf(stdout
, "rename %s to %s\n", from
, to
);
154 * Create a new node (directory).
157 newnode(struct entry
*np
)
160 if (np
->e_type
!= NODE
)
161 badentry(np
, "newnode: not a node");
163 if (command
== 'C') return;
165 if (!Nflag
&& mkdir(cp
, 0777) < 0 && !uflag
) {
166 np
->e_flags
|= EXISTED
;
170 Vprintf(stdout
, "Make node %s\n", cp
);
174 * Remove an old node (directory).
177 removenode(struct entry
*ep
)
181 if (ep
->e_type
!= NODE
)
182 badentry(ep
, "removenode: not a node");
183 if (ep
->e_entries
!= NULL
)
184 badentry(ep
, "removenode: non-empty directory");
185 ep
->e_flags
|= REMOVED
;
186 ep
->e_flags
&= ~TMPNAME
;
188 if (!Nflag
&& rmdir(cp
) < 0) {
192 Vprintf(stdout
, "Remove node %s\n", cp
);
199 removeleaf(struct entry
*ep
)
203 if (command
== 'C') return;
205 if (ep
->e_type
!= LEAF
)
206 badentry(ep
, "removeleaf: not a leaf");
207 ep
->e_flags
|= REMOVED
;
208 ep
->e_flags
&= ~TMPNAME
;
210 if (!Nflag
&& unlink(cp
) < 0) {
214 Vprintf(stdout
, "Remove leaf %s\n", cp
);
221 linkit(char *existing
, char *new, int type
)
224 /* if we want to unlink first, do it now so *link() won't fail */
228 if (type
== SYMLINK
) {
229 if (!Nflag
&& symlink(existing
, new) < 0) {
230 warn("cannot create symbolic link %s->%s",
234 } else if (type
== HARDLINK
) {
237 if (!Nflag
&& (ret
= link(existing
, new)) < 0) {
239 #if !defined(__linux__) && !defined(sunos)
243 * Most likely, the schg flag is set. Clear the
244 * flags and try again.
246 if (stat(existing
, &s
) == 0 && s
.st_flags
!= 0 &&
247 chflags(existing
, 0) == 0) {
248 ret
= link(existing
, new);
249 chflags(existing
, s
.st_flags
);
255 * Most likely, the immutable or append-only attribute
256 * is set. Clear the attributes and try again.
258 if (fgetflags (existing
, &s
) != -1 &&
259 fsetflags (existing
, 0) != -1) {
260 ret
= link(existing
, new);
261 fsetflags(existing
, s
);
265 warn("warning: cannot create hard link %s->%s",
271 panic("linkit: unknown type %d\n", type
);
274 Vprintf(stdout
, "Create %s link %s->%s\n",
275 type
== SYMLINK
? "symbolic" : "hard", new, existing
);
279 #if !defined(__linux__) && !defined(sunos)
284 addwhiteout(char *name
)
287 if (!Nflag
&& mknod(name
, S_IFWHT
, 0) < 0) {
288 warn("cannot create whiteout %s", name
);
291 Vprintf(stdout
, "Create whiteout %s\n", name
);
299 delwhiteout(struct entry
*ep
)
303 if (ep
->e_type
!= LEAF
)
304 badentry(ep
, "delwhiteout: not a leaf");
305 ep
->e_flags
|= REMOVED
;
306 ep
->e_flags
&= ~TMPNAME
;
308 if (!Nflag
&& undelete(name
) < 0) {
309 warn("cannot delete whiteout %s", name
);
312 Vprintf(stdout
, "Delete whiteout %s\n", name
);
317 * find lowest number file (above "start") that needs to be extracted
320 lowerbnd(dump_ino_t start
)
324 for ( ; start
< maxino
; start
++) {
325 ep
= lookupino(start
);
326 if (ep
== NULL
|| ep
->e_type
== NODE
)
328 if (ep
->e_flags
& (NEW
|EXTRACT
))
335 * find highest number file (below "start") that needs to be extracted
338 upperbnd(dump_ino_t start
)
342 for ( ; start
> ROOTINO
; start
--) {
343 ep
= lookupino(start
);
344 if (ep
== NULL
|| ep
->e_type
== NODE
)
346 if (ep
->e_flags
& (NEW
|EXTRACT
))
353 * report on a badly formed entry
356 badentry(struct entry
*ep
, const char *msg
)
359 fprintf(stderr
, "bad entry: %s\n", msg
);
360 fprintf(stderr
, "name: %s\n", myname(ep
));
361 fprintf(stderr
, "parent name %s\n", myname(ep
->e_parent
));
362 if (ep
->e_sibling
!= NULL
)
363 fprintf(stderr
, "sibling name: %s\n", myname(ep
->e_sibling
));
364 if (ep
->e_entries
!= NULL
)
365 fprintf(stderr
, "next entry name: %s\n", myname(ep
->e_entries
));
366 if (ep
->e_links
!= NULL
)
367 fprintf(stderr
, "next link name: %s\n", myname(ep
->e_links
));
368 if (ep
->e_next
!= NULL
)
370 "next hashchain name: %s\n", myname(ep
->e_next
));
371 fprintf(stderr
, "entry type: %s\n",
372 ep
->e_type
== NODE
? "NODE" : "LEAF");
373 fprintf(stderr
, "inode number: %lu\n", (unsigned long)ep
->e_ino
);
374 panic("flags: %s\n", flagvalues(ep
));
378 * Construct a string indicating the active flag bits of an entry.
381 flagvalues(struct entry
*ep
)
383 static char flagbuf
[BUFSIZ
];
385 (void) strcpy(flagbuf
, "|NIL");
387 if (ep
->e_flags
& REMOVED
)
388 (void) strcat(flagbuf
, "|REMOVED");
389 if (ep
->e_flags
& TMPNAME
)
390 (void) strcat(flagbuf
, "|TMPNAME");
391 if (ep
->e_flags
& EXTRACT
)
392 (void) strcat(flagbuf
, "|EXTRACT");
393 if (ep
->e_flags
& NEW
)
394 (void) strcat(flagbuf
, "|NEW");
395 if (ep
->e_flags
& KEEP
)
396 (void) strcat(flagbuf
, "|KEEP");
397 if (ep
->e_flags
& EXISTED
)
398 (void) strcat(flagbuf
, "|EXISTED");
399 return (&flagbuf
[1]);
403 * Check to see if a name is on a dump tape.
406 dirlookup(const char *name
)
411 ino
= ((dp
= pathsearch(name
)) == NULL
) ? 0 : dp
->d_ino
;
413 if (ino
== 0 || TSTINO(ino
, dumpmap
) == 0)
414 fprintf(stderr
, "%s is not on the tape\n", name
);
422 reply(const char *question
)
427 fprintf(stderr
, "%s? [yn] ", question
);
428 (void) fflush(stderr
);
430 while (c
!= '\n' && getc(terminal
) != '\n')
433 } while (c
!= 'y' && c
!= 'n');
440 * handle unexpected inconsistencies
450 panic(const char *fmt
, ...)
464 vfprintf(stderr
, fmt
, ap
);
467 if (reply("abort") == GOOD
) {
468 if (reply("dump core") == GOOD
)
476 * search for ino in QFA file
479 * if ino found return tape number and tape position
480 * if ino not found return tnum=0 and tpos=0
483 * if ino found return tape number and tape position
484 * if ino not found return tape number and tape position of last smaller ino
485 * if no smaller inode found return tnum=0 and tpos=0
488 Inode2Tapepos(dump_ino_t ino
, long *tnum
, long long *tpos
, int exactmatch
)
492 unsigned long tmpino
;
498 if (fseek(gTapeposfp
, gSeekstart
, SEEK_SET
) == -1)
500 while (fgets(gTps
, sizeof(gTps
), gTapeposfp
) != NULL
) {
501 gTps
[strlen(gTps
) - 1] = 0; /* delete end of line */
503 bzero(numbuff
, sizeof(numbuff
));
506 while ((*p
!= 0) && (*p
!= '\t'))
508 tmpino
= atol(numbuff
);
510 return 1; /* may NOT happen */
512 bzero(numbuff
, sizeof(numbuff
));
515 while ((*p
!= 0) && (*p
!= '\t'))
518 return 1; /* may NOT happen */
519 tmptnum
= atol(numbuff
);
521 bzero(numbuff
, sizeof(numbuff
));
524 while ((*p
!= 0) && (*p
!= '\t'))
526 tmptpos
= atoll(numbuff
);