]>
git.wh0rd.org - dump.git/blob - restore/restore.c
94e0bb6cc8f853c5a4243aeaf0c2dcf738568a2c
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. Neither the name of the University nor the names of its contributors
22 * may be used to endorse or promote products derived from this software
23 * without specific prior written permission.
25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
39 static const char rcsid
[] =
40 "$Id: restore.c,v 1.36 2005/03/18 22:12:55 stelian Exp $";
44 #include <sys/types.h>
47 #include <sys/param.h>
50 #ifdef HAVE_EXT2FS_EXT2_FS_H
51 #include <ext2fs/ext2_fs.h>
53 #include <linux/ext2_fs.h>
55 #include <bsdcompat.h>
58 #include <sys/fcntl.h>
59 #include <bsdcompat.h>
61 #include <ufs/ufs/dinode.h>
63 #endif /* __linux__ */
65 #include <protocols/dumprestore.h>
67 #include <compaterr.h>
73 #include <ext2fs/ext2fs.h>
79 static char *keyval
__P((int));
82 * This implements the 't' option.
83 * List entries on the tape.
86 listfile(char *name
, dump_ino_t ino
, int type
)
88 long descend
= hflag
? GOOD
: FAIL
;
94 if (TSTINO(ino
, dumpmap
) == 0)
96 Vprintf(stdout
, "%s", type
== LEAF
? "leaf" : "dir ");
98 if (tapeposflag
) { /* add QFA positions to output */
99 (void)Inode2Tapepos(ino
, &tnum
, &tpos
, 1);
100 fprintf(stdout
, "%10lu\t%ld\t%lld\t%s\n", (unsigned long)ino
,
105 fprintf(stdout
, "%10lu\t%s\n", (unsigned long)ino
, name
);
110 * This implements the 'x' option.
111 * Request that new entries be extracted.
114 addfile(char *name
, dump_ino_t ino
, int type
)
116 struct entry
*ep
, *np
;
117 long descend
= hflag
? GOOD
: FAIL
;
120 if (TSTINO(ino
, dumpmap
) == 0) {
121 Dprintf(stdout
, "%s: not on the tape\n", name
);
124 if (ino
== WINO
&& command
== 'i' && !vflag
)
127 (void) snprintf(buf
, sizeof(buf
), "./%lu", (unsigned long)ino
);
130 (void) genliteraldir(name
, ino
);
136 if (strcmp(name
, myname(ep
)) == 0) {
141 for (np
= ep
->e_links
; np
; np
= np
->e_links
)
142 if (strcmp(name
, myname(np
)) == 0) {
147 ep
= addentry(name
, ino
, type
);
149 if ((type
== NODE
) && (!createtapeposflag
))
159 * This is used by the 'i' option to undo previous requests made by addfile.
160 * Delete entries from the request queue.
164 deletefile(char *name
, dump_ino_t ino
, UNUSED(int type
))
166 long descend
= hflag
? GOOD
: FAIL
;
169 if (TSTINO(ino
, dumpmap
) == 0)
171 ep
= lookupname(name
);
174 ep
->e_flags
|= REMOVED
;
175 if (ep
->e_type
!= NODE
)
182 * The following four routines implement the incremental
183 * restore algorithm. The first removes old entries, the second
184 * does renames and calculates the extraction list, the third
185 * cleans up link names missed by the first two, and the final
186 * one deletes old directories.
188 * Directories cannot be immediately deleted, as they may have
189 * other files in them which need to be moved out first. As
190 * directories to be deleted are found, they are put on the
191 * following deletion list. After all deletions and renames
192 * are done, this list is actually deleted.
194 static struct entry
*removelist
;
197 * Remove invalid whiteouts from the old tree.
198 * Remove unneeded leaves from the old tree.
199 * Remove directories from the lookup chains.
202 removeoldleaves(void)
204 struct entry
*ep
, *nextep
;
205 dump_ino_t i
, mydirino
;
207 Vprintf(stdout
, "Mark entries to be removed.\n");
208 if ((ep
= lookupino(WINO
))) {
209 Vprintf(stdout
, "Delete whiteouts\n");
210 for ( ; ep
!= NULL
; ep
= nextep
) {
211 nextep
= ep
->e_links
;
212 mydirino
= ep
->e_parent
->e_ino
;
214 * We remove all whiteouts that are in directories
215 * that have been removed or that have been dumped.
217 if (TSTINO(mydirino
, usedinomap
) &&
218 !TSTINO(mydirino
, dumpmap
))
221 (void)fprintf(stderr
, "BUG! Should call delwhiteout\n");
231 for (i
= ROOTINO
+ 1; i
< maxino
; i
++) {
235 if (TSTINO(i
, usedinomap
))
237 for ( ; ep
!= NULL
; ep
= ep
->e_links
) {
238 Dprintf(stdout
, "%s: REMOVE\n", myname(ep
));
239 if (ep
->e_type
== LEAF
) {
244 deleteino(ep
->e_ino
);
245 ep
->e_next
= removelist
;
253 * For each directory entry on the incremental tape, determine which
254 * category it falls into as follows:
255 * KEEP - entries that are to be left alone.
256 * NEW - new entries to be added.
257 * EXTRACT - files that must be updated with new contents.
258 * LINK - new links to be added.
259 * Renames are done at the same time.
262 nodeupdates(char *name
, dump_ino_t ino
, int type
)
264 struct entry
*ep
, *np
, *ip
;
269 # define ONTAPE 0x1 /* inode is on the tape */
270 # define INOFND 0x2 /* inode already exists */
271 # define NAMEFND 0x4 /* name already exists */
272 # define MODECHG 0x8 /* mode of inode changed */
275 * This routine is called once for each element in the
276 * directory hierarchy, with a full path name.
277 * The "type" value is incorrectly specified as LEAF for
278 * directories that are not on the dump tape.
280 * Check to see if the file is on the tape.
282 if (TSTINO(ino
, dumpmap
))
285 * Check to see if the name exists, and if the name is a link.
287 np
= lookupname(name
);
290 ip
= lookupino(np
->e_ino
);
292 panic("corrupted symbol table\n");
297 * Check to see if the inode exists, and if one of its links
298 * corresponds to the name (if one was found).
303 for (ep
= ip
->e_links
; ep
!= NULL
; ep
= ep
->e_links
) {
311 * If both a name and an inode are found, but they do not
312 * correspond to the same file, then both the inode that has
313 * been found and the inode corresponding to the name that
314 * has been found need to be renamed. The current pathname
315 * is the new name for the inode that has been found. Since
316 * all files to be deleted have already been removed, the
317 * named file is either a now unneeded link, or it must live
318 * under a new name in this dump level. If it is a link, it
319 * can be removed. If it is not a link, it is given a
320 * temporary name in anticipation that it will be renamed
321 * when it is later found by inode number.
323 if (((key
& (INOFND
|NAMEFND
)) == (INOFND
|NAMEFND
)) && ip
!= np
) {
324 if (lookuptype
== LINK
) {
328 Dprintf(stdout
, "name/inode conflict, mktempname %s\n",
335 if ((key
& ONTAPE
) &&
336 (((key
& INOFND
) && ip
->e_type
!= type
) ||
337 ((key
& NAMEFND
) && np
->e_type
!= type
)))
341 * Decide on the disposition of the file based on its flags.
342 * Note that we have already handled the case in which
343 * a name and inode are found that correspond to different files.
344 * Thus if both NAMEFND and INOFND are set then ip == np.
349 * A previously existing file has been found.
350 * Mark it as KEEP so that other links to the inode can be
351 * detected, and so that it will not be reclaimed by the search
352 * for unreferenced names.
356 Dprintf(stdout
, "[%s] %s: %s\n", keyval(key
), name
,
361 * A file on the tape has a name which is the same as a name
362 * corresponding to a different file in the previous dump.
363 * Since all files to be deleted have already been removed,
364 * this file is either a now unneeded link, or it must live
365 * under a new name in this dump level. If it is a link, it
366 * can simply be removed. If it is not a link, it is given a
367 * temporary name in anticipation that it will be renamed
368 * when it is later found by inode number (see INOFND case
369 * below). The entry is then treated as a new file.
372 case ONTAPE
|NAMEFND
|MODECHG
:
373 if (lookuptype
== LINK
) {
382 * A previously non-existent file.
383 * Add it to the file system, and request its extraction.
384 * If it is a directory, create it immediately.
385 * (Since the name is unused there can be no conflict)
388 ep
= addentry(name
, ino
, type
);
391 ep
->e_flags
|= NEW
|KEEP
;
392 Dprintf(stdout
, "[%s] %s: %s\n", keyval(key
), name
,
397 * A file with the same inode number, but a different
398 * name has been found. If the other name has not already
399 * been found (indicated by the KEEP flag, see above) then
400 * this must be a new name for the file, and it is renamed.
401 * If the other name has been found then this must be a
402 * link to the file. Hard links to directories are not
403 * permitted, and are either deleted or converted to
404 * symbolic links. Finally, if the file is on the tape,
405 * a request is made to extract it.
408 if (type
== LEAF
&& (ip
->e_flags
& KEEP
) == 0)
409 ip
->e_flags
|= EXTRACT
;
412 if ((ip
->e_flags
& KEEP
) == 0) {
413 renameit(myname(ip
), name
);
416 Dprintf(stdout
, "[%s] %s: %s\n", keyval(key
), name
,
420 if (ip
->e_type
== NODE
) {
423 "deleted hard link %s to directory %s\n",
427 ep
= addentry(name
, ino
, type
|LINK
);
429 Dprintf(stdout
, "[%s] %s: %s|LINK\n", keyval(key
), name
,
434 * A previously known file which is to be updated. If it is a link,
435 * then all names referring to the previous file must be removed
436 * so that the subset of them that remain can be recreated.
438 case ONTAPE
|INOFND
|NAMEFND
:
439 if (lookuptype
== LINK
) {
442 ep
= addentry(name
, ino
, type
|LINK
);
445 ep
->e_flags
|= NEW
|KEEP
;
446 Dprintf(stdout
, "[%s] %s: %s|LINK\n", keyval(key
), name
,
450 if (type
== LEAF
&& lookuptype
!= LINK
)
451 np
->e_flags
|= EXTRACT
;
453 Dprintf(stdout
, "[%s] %s: %s\n", keyval(key
), name
,
458 * An inode is being reused in a completely different way.
459 * Normally an extract can simply do an "unlink" followed
460 * by a "creat". Here we must do effectively the same
461 * thing. The complications arise because we cannot really
462 * delete a directory since it may still contain files
463 * that we need to rename, so we delete it from the symbol
464 * table, and put it on the list to be deleted eventually.
465 * Conversely if a directory is to be created, it must be
466 * done immediately, rather than waiting until the
469 case ONTAPE
|INOFND
|MODECHG
:
470 case ONTAPE
|INOFND
|NAMEFND
|MODECHG
:
471 if (ip
->e_flags
& KEEP
) {
472 badentry(ip
, "cannot KEEP and change modes");
475 if (ip
->e_type
== LEAF
) {
476 /* changing from leaf to node */
477 for ( ; ip
!= NULL
; ip
= ip
->e_links
) {
478 if (ip
->e_type
!= LEAF
)
479 badentry(ip
, "NODE and LEAF links to same inode");
483 ip
= addentry(name
, ino
, type
);
486 /* changing from node to leaf */
487 if ((ip
->e_flags
& TMPNAME
) == 0)
489 deleteino(ip
->e_ino
);
490 ip
->e_next
= removelist
;
492 ip
= addentry(name
, ino
, type
);
494 ip
->e_flags
|= NEW
|KEEP
;
495 Dprintf(stdout
, "[%s] %s: %s\n", keyval(key
), name
,
500 * A hard link to a directory that has been removed.
504 Dprintf(stdout
, "[%s] %s: Extraneous name\n", keyval(key
),
510 * If we find a directory entry for a file that is not on
511 * the tape, then we must have found a file that was created
512 * while the dump was in progress. Since we have no contents
513 * for it, we discard the name knowing that it will be on the
514 * next incremental tape.
517 if (compare_ignore_not_found
) break;
518 fprintf(stderr
, "%s: (inode %lu) not found on tape\n",
519 name
, (unsigned long)ino
);
524 * If any of these arise, something is grievously wrong with
525 * the current state of the symbol table.
527 case INOFND
|NAMEFND
|MODECHG
:
528 case NAMEFND
|MODECHG
:
530 fprintf(stderr
, "[%s] %s: inconsistent state\n", keyval(key
),
535 * These states "cannot" arise for any state of the symbol table.
540 panic("[%s] %s: impossible state\n", keyval(key
), name
);
547 * Calculate the active flags in a key.
552 static char keybuf
[32];
554 (void) strcpy(keybuf
, "|NIL");
557 (void) strcat(keybuf
, "|ONTAPE");
559 (void) strcat(keybuf
, "|INOFND");
561 (void) strcat(keybuf
, "|NAMEFND");
563 (void) strcat(keybuf
, "|MODECHG");
568 * Find unreferenced link names.
573 struct entry
*ep
, *np
;
577 Vprintf(stdout
, "Find unreferenced names.\n");
578 for (i
= ROOTINO
; i
< maxino
; i
++) {
580 if (ep
== NULL
|| ep
->e_type
== LEAF
|| TSTINO(i
, dumpmap
) == 0)
582 if (ep
->e_entries
== NULL
)
584 for (j
= 0; j
< DIRHASH_SIZE
; j
++) {
585 for (np
= ep
->e_entries
[j
]; np
!= NULL
; np
= np
->e_sibling
) {
586 if (np
->e_flags
== 0) {
588 "%s: remove unreferenced name\n",
597 * Any leaves remaining in removed directories is unreferenced.
599 for (ep
= removelist
; ep
!= NULL
; ep
= ep
->e_next
) {
600 if (ep
->e_entries
== NULL
)
602 for (j
= 0; j
< DIRHASH_SIZE
; j
++) {
603 for (np
= ep
->e_entries
[j
]; np
!= NULL
; np
= np
->e_sibling
) {
604 if (np
->e_type
== LEAF
) {
605 if (np
->e_flags
!= 0)
606 badentry(np
, "unreferenced with flags");
608 "%s: remove unreferenced name\n",
619 * Remove old nodes (directories).
620 * Note that this routine runs in O(N*D) where:
621 * N is the number of directory entries to be removed.
622 * D is the maximum depth of the tree.
623 * If N == D this can be quite slow. If the list were
624 * topologically sorted, the deletion could be done in
630 struct entry
*ep
, **prev
;
633 Vprintf(stdout
, "Remove old nodes (directories).\n");
637 for (ep
= removelist
; ep
!= NULL
; ep
= *prev
) {
639 if (ep
->e_entries
!= NULL
) {
641 for (i
= 0; i
< DIRHASH_SIZE
; i
++) {
642 if (ep
->e_entries
[i
] != NULL
) {
657 for (ep
= removelist
; ep
!= NULL
; ep
= ep
->e_next
)
658 badentry(ep
, "cannot remove, non-empty");
661 /* Compare the file specified in `ep' (which is on tape) to the */
662 /* current copy of this file on disk. If do_compare is 0, then just */
663 /* make our caller think we did it--this is used to handle hard links */
664 /* to files and devices. */
666 compare_entry(struct entry
*ep
, int do_compare
)
668 if ((ep
->e_flags
& (NEW
|EXTRACT
)) == 0) {
669 badentry(ep
, "unexpected file on tape");
673 (void) comparefile(myname(ep
));
676 ep
->e_flags
&= ~(NEW
|EXTRACT
);
680 * This is the routine used to compare files for the 'C' command.
689 first
= lowerbnd(ROOTINO
);
691 while (curfile
.ino
< maxino
) {
692 first
= lowerbnd(first
);
694 * If the next available file is not the one which we
695 * expect then we have missed one or more files. Since
696 * we do not request files that were not on the tape,
697 * the lost files must have been due to a tape read error,
698 * or a file that was removed while the dump was in progress.
700 while (first
< curfile
.ino
) {
701 ep
= lookupino(first
);
703 panic("%d: bad first\n", first
);
704 fprintf(stderr
, "%s: not found on tape\n", myname(ep
));
706 ep
->e_flags
&= ~(NEW
|EXTRACT
);
707 first
= lowerbnd(first
);
710 * If we find files on the tape that have no corresponding
711 * directory entries, then we must have found a file that
712 * was created while the dump was in progress. Since we have
713 * no name for it, we discard it knowing that it will be
714 * on the next incremental tape.
716 if (first
!= curfile
.ino
) {
717 fprintf(stderr
, "expected next file %ld, got %lu\n",
718 (long)first
, (unsigned long)curfile
.ino
);
723 ep
= lookupino(curfile
.ino
);
725 panic("unknown file on tape\n");
728 compare_entry(ep
, 1);
729 for (ep
= ep
->e_links
; ep
!= NULL
; ep
= ep
->e_links
) {
730 compare_entry(ep
, 0);
734 * We checkpoint the restore after every tape reel, so
735 * as to simplify the amount of work re quired by the
739 if (curvol
!= volno
) {
745 * If we encounter the end of the tape and the next available
746 * file is not the one which we expect then we have missed one
747 * or more files. Since we do not request files that were not
748 * on the tape, the lost files must have been due to a tape
749 * read error, or a file that was removed while the dump was
752 first
= lowerbnd(first
);
753 while (first
< curfile
.ino
) {
754 ep
= lookupino(first
);
756 panic("%d: bad first\n", first
);
757 fprintf(stderr
, "%s: (inode %lu) not found on tape\n",
758 myname(ep
), (unsigned long)first
);
760 ep
->e_flags
&= ~(NEW
|EXTRACT
);
761 first
= lowerbnd(first
);
766 * This is the routine used to extract files for the 'r' command.
767 * Extract new leaves.
770 createleaves(char *symtabfile
)
777 if (command
== 'R') {
778 Vprintf(stdout
, "Continue extraction of new leaves\n");
780 Vprintf(stdout
, "Extract new leaves.\n");
781 dumpsymtable(symtabfile
, volno
);
783 first
= lowerbnd(ROOTINO
);
785 while (curfile
.ino
< maxino
) {
786 first
= lowerbnd(first
);
788 * If the next available file is not the one which we
789 * expect then we have missed one or more files. Since
790 * we do not request files that were not on the tape,
791 * the lost files must have been due to a tape read error,
792 * or a file that was removed while the dump was in progress.
794 while (first
< curfile
.ino
) {
795 ep
= lookupino(first
);
797 panic("%d: bad first\n", first
);
798 fprintf(stderr
, "%s: (inode %lu) not found on tape\n",
799 myname(ep
), (unsigned long)first
);
800 ep
->e_flags
&= ~(NEW
|EXTRACT
);
801 first
= lowerbnd(first
);
804 * If we find files on the tape that have no corresponding
805 * directory entries, then we must have found a file that
806 * was created while the dump was in progress. Since we have
807 * no name for it, we discard it knowing that it will be
808 * on the next incremental tape.
810 if (first
!= curfile
.ino
) {
811 fprintf(stderr
, "expected next file %ld, got %lu\n",
812 (long)first
, (unsigned long)curfile
.ino
);
816 ep
= lookupino(curfile
.ino
);
818 panic("unknown file on tape\n");
819 if ((ep
->e_flags
& (NEW
|EXTRACT
)) == 0)
820 badentry(ep
, "unexpected file on tape");
822 * If the file is to be extracted, then the old file must
823 * be removed since its type may change from one leaf type
824 * to another (e.g. "file" to "character special").
826 if ((ep
->e_flags
& EXTRACT
) != 0)
830 (void) extractfile(ep
, doremove
);
832 ep
->e_flags
&= ~(NEW
|EXTRACT
);
835 * We checkpoint the restore after every tape reel, so
836 * as to simplify the amount of work required by the
840 if (curvol
!= volno
) {
841 dumpsymtable(symtabfile
, volno
);
847 * If we encounter the end of the tape and the next available
848 * file is not the one which we expect then we have missed one
849 * or more files. Since we do not request files that were not
850 * on the tape, the lost files must have been due to a tape
851 * read error, or a file that was removed while the dump was
854 first
= lowerbnd(first
);
855 while (first
< curfile
.ino
) {
856 ep
= lookupino(first
);
858 panic("%d: bad first\n", first
);
859 fprintf(stderr
, "%s: (inode %lu) not found on tape\n",
860 myname(ep
), (unsigned long)first
);
862 ep
->e_flags
&= ~(NEW
|EXTRACT
);
863 first
= lowerbnd(first
);
868 * This is the routine used to extract files for the 'x' and 'i' commands.
869 * Efficiently extract a subset of the files on a tape.
874 dump_ino_t first
, next
, last
;
879 long long tpos
, curtpos
= 0;
880 time_t tistart
, tiend
, titaken
;
884 Vprintf(stdout
, "Extract requested files\n");
885 curfile
.action
= SKIP
;
891 if (volinfo
[1] == ROOTINO
)
897 first
= lowerbnd(ROOTINO
);
898 last
= upperbnd(maxino
- 1);
903 first
= lowerbnd(first
);
904 last
= upperbnd(last
);
906 * Check to see if any files remain to be extracted
911 * Reject any volumes with inodes greater
912 * than the last one needed
914 while (curfile
.ino
> last
) {
915 curfile
.action
= SKIP
;
918 if (curfile
.ino
== maxino
) {
919 next
= lowerbnd(first
);
920 while (next
< curfile
.ino
) {
921 ep
= lookupino(next
);
923 panic("corrupted symbol table\n");
924 fprintf(stderr
, "%s: (inode %lu) not found on tape\n",
925 myname(ep
), (unsigned long)next
);
927 next
= lowerbnd(next
);
935 * Decide on the next inode needed.
936 * Skip across the inodes until it is found
937 * or an out of order volume change is encountered
939 next
= lowerbnd(curfile
.ino
);
941 tistart
= time(NULL
);
943 /* get tape position for inode */
944 (void)Inode2Tapepos(next
, &tnum
, &tpos
, 0);
947 (void)RequestVol(tnum
);
952 if (GetTapePos(&curtpos
) == 0) {
953 /* curtpos +1000 ???, some drives
954 * might be too slow */
955 if (((tpos
> (curtpos
+ 1000)) && (volChg
== 0)) || ((tpos
!= curtpos
) && (volChg
== 1))) {
958 msg("positioning tape %ld from %lld to %lld for inode %lu ...\n", volno
, curtpos
, tpos
, (unsigned long)next
);
960 if (GotoTapePos(tpos
) == 0) {
962 if (GetTapePos(&curtpos
) == 0) {
963 msg("before resnyc at tape position %lld (%ld, %ld, %s)\n", curtpos
, next
, curfile
.ino
, curfile
.name
);
966 ReReadInodeFromTape(next
);
968 if (GetTapePos(&curtpos
) == 0) {
969 msg("after resnyc at tape position %lld (%ld, %ld, %s)\n", curtpos
, next
, curfile
.ino
, curfile
.name
);
975 msg("already at tape %ld position %ld for inode %lu ...\n", volno
, tpos
, (unsigned long)next
);
983 if (volinfo
[1] == ROOTINO
) {
986 for (i
= 1; i
< (int)TP_NINOS
&& volinfo
[i
] != 0; ++i
)
987 if (volinfo
[i
] < next
)
990 if (goodvol
!= volno
)
996 while (next
> curfile
.ino
&& volno
== curvol
) {
1004 } while (volno
== curvol
+ 1);
1007 titaken
= tiend
- tistart
;
1009 if (titaken
/ 60 > 0)
1010 msg("%ld reads took %d:%02d:%02d\n",
1011 tmpcnt
, titaken
/ 3600,
1012 (titaken
% 3600) / 60, titaken
% 60);
1014 #endif /* USE_QFA */
1017 * If volume change out of order occurred the
1018 * current state must be recalculated
1020 if (volno
!= curvol
)
1023 * If the current inode is greater than the one we were
1024 * looking for then we missed the one we were looking for.
1025 * Since we only attempt to extract files listed in the
1026 * dump map, the lost files must have been due to a tape
1027 * read error, or a file that was removed while the dump
1028 * was in progress. Thus we report all requested files
1029 * between the one we were looking for, and the one we
1030 * found as missing, and delete their request flags.
1032 while (next
< curfile
.ino
) {
1033 ep
= lookupino(next
);
1035 panic("corrupted symbol table\n");
1037 if (!createtapeposflag
)
1039 fprintf(stderr
, "%s: (inode %lu) not found on tape\n",
1040 myname(ep
), (unsigned long)next
);
1041 ep
->e_flags
&= ~NEW
;
1042 next
= lowerbnd(next
);
1045 * The current inode is the one that we are looking for,
1046 * so extract it per its requested name.
1048 if (next
== curfile
.ino
&& next
<= last
) {
1049 ep
= lookupino(next
);
1051 panic("corrupted symbol table\n");
1053 if (createtapeposflag
) {
1055 msg("inode %ld at tapepos %ld\n", curfile
.ino
, curtapepos
);
1057 sprintf(gTps
, "%ld\t%ld\t%lld\n", (unsigned long)curfile
.ino
, volno
, curtapepos
);
1058 if (write(gTapeposfd
, gTps
, strlen(gTps
)) != (ssize_t
)strlen(gTps
))
1059 warn("error writing tapepos file.\n");
1062 #endif /* USE_QFA */
1063 (void) extractfile(ep
, 0);
1068 #endif /* USE_QFA */
1069 ep
->e_flags
&= ~NEW
;
1070 if (volno
!= curvol
)
1082 struct entry
*np
, *ep
;
1086 if ((ep
= lookupino(WINO
))) {
1087 Vprintf(stdout
, "Add whiteouts\n");
1088 for ( ; ep
!= NULL
; ep
= ep
->e_links
) {
1089 if ((ep
->e_flags
& NEW
) == 0)
1092 (void)fprintf(stderr
, "BUG! Should call addwhiteout\n");
1096 (void) addwhiteout(myname(ep
));
1099 ep
->e_flags
&= ~NEW
;
1102 Vprintf(stdout
, "Add links\n");
1103 for (i
= ROOTINO
; i
< maxino
; i
++) {
1107 for (np
= ep
->e_links
; np
!= NULL
; np
= np
->e_links
) {
1108 if ((np
->e_flags
& NEW
) == 0)
1110 (void) strcpy(name
, myname(ep
));
1111 if (ep
->e_type
== NODE
) {
1112 (void) linkit(name
, myname(np
), SYMLINK
);
1114 (void) linkit(name
, myname(np
), HARDLINK
);
1116 np
->e_flags
&= ~NEW
;
1122 * Check the symbol table.
1123 * We do this to insure that all the requested work was done, and
1124 * that no temporary names remain.
1132 Vprintf(stdout
, "Check the symbol table.\n");
1133 for (i
= WINO
; i
< maxino
; i
++) {
1134 for (ep
= lookupino(i
); ep
!= NULL
; ep
= ep
->e_links
) {
1135 ep
->e_flags
&= ~KEEP
;
1136 if (ep
->e_type
== NODE
)
1137 ep
->e_flags
&= ~(NEW
|EXISTED
);
1138 if (ep
->e_flags
/* != NULL */)
1139 badentry(ep
, "incomplete operations");
1145 * Compare with the directory structure on the tape
1146 * A paranoid check that things are as they should be.
1149 verifyfile(char *name
, dump_ino_t ino
, int type
)
1151 struct entry
*np
, *ep
;
1152 long descend
= GOOD
;
1154 ep
= lookupname(name
);
1156 fprintf(stderr
, "Warning: missing name %s\n", name
);
1159 np
= lookupino(ino
);
1162 for ( ; np
!= NULL
; np
= np
->e_links
)
1166 panic("missing inumber %d\n", ino
);
1167 if (ep
->e_type
== LEAF
&& type
!= LEAF
)
1168 badentry(ep
, "type should be LEAF");