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 <pop@cybercable.fr>, 1999-2000
9 * Copyright (c) 1980, 1988, 1991, 1993
10 * The Regents of the University of California. All rights reserved.
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
15 * 1. Redistributions of source code must retain the above copyright
16 * notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 * notice, this list of conditions and the following disclaimer in the
19 * documentation and/or other materials provided with the distribution.
20 * 3. All advertising materials mentioning features or use of this software
21 * must display the following acknowledgement:
22 * This product includes software developed by the University of
23 * California, Berkeley and its contributors.
24 * 4. Neither the name of the University nor the names of its contributors
25 * may be used to endorse or promote products derived from this software
26 * without specific prior written permission.
28 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
29 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
30 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
31 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
32 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
33 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
34 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
35 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
36 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
37 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
42 static const char rcsid[] =
43 "$Id: traverse.c,v 1.19 2000/09/01 14:26:23 stelian Exp $";
46 #include <sys/param.h>
49 #include <linux/ext2_fs.h>
50 #include <bsdcompat.h>
51 #include <compaterr.h>
53 #define swab32(x) ext2fs_swab32(x)
57 #include <sys/vnode.h>
60 #include <ufs/fsdir.h>
61 #include <ufs/inode.h>
63 #include <ufs/ufs/dir.h>
64 #include <ufs/ufs/dinode.h>
65 #include <ufs/ffs/fs.h>
67 #endif /* __linux__ */
69 #include <protocols/dumprestore.h>
79 #include <ext2fs/ext2fs.h>
84 #define HASDUMPEDFILE 0x1
85 #define HASSUBDIRS 0x2
88 typedef quad_t fsizeT;
94 static int searchdir __P((struct ext2_dir_entry *dp, int offset,
95 int blocksize, char *buf, void *private));
97 static int dirindir __P((ino_t ino, daddr_t blkno, int level, long *size));
98 static void dmpindir __P((ino_t ino, daddr_t blk, int level, fsizeT *size));
99 static int searchdir __P((ino_t ino, daddr_t blkno, long size, long filesize));
101 static void mapfileino __P((ino_t ino, long *tapesize, int *dirskipped));
102 static int exclude_ino __P((ino_t ino));
104 /* #define EXT3_FEATURE_INCOMPAT_RECOVER */
106 int dump_fs_open(const char *disk, ext2_filsys *fs)
111 #ifdef EXT3_FEATURE_INCOMPAT_RECOVER
112 retval = ext2fs_open(disk, EXT2_FLAG_FORCE, 0, 0, unix_io_manager, fs);
114 retval = ext2fs_open(disk, 0, 0, 0, unix_io_manager, fs);
116 #if defined(EXT2_LIB_FEATURE_COMPAT_SUPP) && defined(EXT2_LIB_FEATURE_INCOMPAT_SUPP) && defined(EXT2_LIB_FEATURE_RO_COMPAT_SUPP) && defined(EXT2_ET_UNSUPP_FEATURE) && defined(EXT2_ET_RO_UNSUPP_FEATURE)
118 s = (struct ext2fs_sb *) (*fs)->super;
119 if ((s->s_feature_compat & ~EXT2_LIB_FEATURE_COMPAT_SUPP) ||
120 #ifdef EXT3_FEATURE_INCOMPAT_RECOVER
121 (s->s_feature_incompat & ~(EXT3_FEATURE_INCOMPAT_RECOVER | EXT2_LIB_FEATURE_INCOMPAT_SUPP))) {
123 (s->s_feature_incompat & ~EXT2_LIB_FEATURE_INCOMPAT_SUPP)) {
125 retval = EXT2_ET_UNSUPP_FEATURE;
127 else if (s->s_feature_ro_compat & ~EXT2_LIB_FEATURE_RO_COMPAT_SUPP) {
128 retval = EXT2_ET_RO_UNSUPP_FEATURE;
131 #endif /* defined && defined && defined... */
136 * This is an estimation of the number of TP_BSIZE blocks in the file.
137 * It estimates the number of blocks in files with holes by assuming
138 * that all of the blocks accounted for by di_blocks are data blocks
139 * (when some of the blocks are usually used for indirect pointers);
140 * hence the estimate may be high.
143 blockest(struct dinode *dp)
145 long blkest, sizeest;
148 * dp->di_size is the size of the file in bytes.
149 * dp->di_blocks stores the number of sectors actually in the file.
150 * If there are more sectors than the size would indicate, this just
151 * means that there are indirect blocks in the file or unused
152 * sectors in the last file block; we can safely ignore these
153 * (blkest = sizeest below).
154 * If the file is bigger than the number of sectors would indicate,
155 * then the file has holes in it. In this case we must use the
156 * block count to estimate the number of data blocks used, but
157 * we use the actual size for estimating the number of indirect
158 * dump blocks (sizeest vs. blkest in the indirect block
161 blkest = howmany(dbtob(dp->di_blocks), TP_BSIZE);
162 sizeest = howmany(dp->di_size, TP_BSIZE);
163 if (blkest > sizeest)
166 if (dp->di_size > fs->blocksize * NDADDR) {
167 /* calculate the number of indirect blocks on the dump tape */
169 howmany(sizeest - NDADDR * fs->blocksize / TP_BSIZE,
170 NINDIR(sblock) * EXT2_FRAGS_PER_BLOCK(fs->super));
173 if (dp->di_size > sblock->fs_bsize * NDADDR) {
174 /* calculate the number of indirect blocks on the dump tape */
176 howmany(sizeest - NDADDR * sblock->fs_bsize / TP_BSIZE,
183 extern ino_t iexclude_list[IEXCLUDE_MAXNUM]; /* the inode exclude list */
184 extern int iexclude_num; /* number of elements in the list */
187 * This tests whether an inode is in the exclude list
190 exclude_ino(ino_t ino)
193 if (iexclude_num) { /* if there are inodes in the exclude list */
194 int idx; /* then check this inode against it */
195 for (idx = 0; idx < iexclude_num; idx++)
196 if (ino == iexclude_list[idx])
202 /* Auxiliary macro to pick up files changed since previous dump. */
203 #define CHANGEDSINCE(dp, t) \
204 ((dp)->di_mtime >= (t) || (dp)->di_ctime >= (t))
206 /* The NODUMP_FLAG macro tests if a file has the nodump flag. */
208 #define NODUMP_FLAG(dp) (!nonodump && (((dp)->di_flags & UF_NODUMP) == UF_NODUMP))
210 #define NODUMP_FLAG(dp) 0
213 /* The WANTTODUMP macro decides whether a file should be dumped. */
214 #define WANTTODUMP(dp, ino) \
215 (CHANGEDSINCE(dp, spcl.c_ddate) && \
216 (!NODUMP_FLAG(dp)) && \
220 * Determine if given inode should be dumped
223 mapfileino(ino_t ino, long *tapesize, int *dirskipped)
226 register struct dinode *dp;
229 * Skip inode if we've already marked it for dumping
231 if (TSTINO(ino, usedinomap))
234 if ((mode = (dp->di_mode & IFMT)) == 0)
237 if (dp->di_nlink == 0 || dp->di_dtime != 0)
241 * Put all dirs in dumpdirmap, inodes that are to be dumped in the
242 * used map. All inode but dirs who have the nodump attribute go
245 SETINO(ino, usedinomap);
248 SETINO(ino, dumpdirmap);
249 if (WANTTODUMP(dp, ino)) {
250 SETINO(ino, dumpinomap);
251 if (mode != IFREG && mode != IFDIR && mode != IFLNK)
254 *tapesize += blockest(dp);
258 if ( NODUMP_FLAG(dp) || exclude_ino(ino) )
259 CLRINO(ino, usedinomap);
267 * Walk the inode list for a filesystem to find all allocated inodes
268 * that have been modified since the previous dump time. Also, find all
269 * the directories in the filesystem.
272 mapfiles(ino_t maxino, long *tapesize)
275 int anydirskipped = 0;
277 for (ino = ROOTINO; ino < maxino; ino++)
278 mapfileino(ino, tapesize, &anydirskipped);
281 * Restore gets very upset if the root is not dumped,
282 * so ensure that it always is dumped.
284 SETINO(ROOTINO, dumpinomap);
285 return (anydirskipped);
289 struct mapfile_context {
295 mapfilesindir(struct ext2_dir_entry *dirent, int offset, int blocksize, char *buf, void *private)
297 register struct dinode *dp;
300 struct mapfile_context *mfc;
304 mfc = (struct mapfile_context *)private;
306 mapfileino(dirent->inode, mfc->tapesize, mfc->anydirskipped);
308 dp = getino(dirent->inode);
309 mode = dp->di_mode & IFMT;
310 if (mode == IFDIR && dp->di_nlink != 0 && dp->di_dtime == 0) {
311 if ((dirent->name[0] != '.' || ( dirent->name_len & 0xFF ) != 1) &&
312 (dirent->name[0] != '.' || dirent->name[1] != '.' ||
313 ( dirent->name_len & 0xFF ) != 2)) {
314 retval = ext2fs_dir_iterate(fs, ino, 0, NULL,
315 mapfilesindir, private);
326 * Walk the inode list for a filesystem to find all allocated inodes
327 * that have been modified since the previous dump time. Also, find all
328 * the directories in the filesystem.
331 mapfilesfromdir(ino_t maxino, long *tapesize, char *directory)
334 struct mapfile_context mfc;
336 char dir_name [MAXPATHLEN];
337 int i, anydirskipped = 0;
340 * Mark every directory in the path as being dumped
342 for (i = 0; i < strlen (directory); i++) {
343 if (directory[i] == '/') {
344 strncpy (dir_name, directory, i);
346 retval = ext2fs_namei(fs, ROOTINO, ROOTINO, dir_name,
349 com_err(disk, retval, "while translating %s",
353 mapfileino(dir_ino, tapesize, &anydirskipped);
357 * Mark the final directory
359 retval = ext2fs_namei(fs, ROOTINO, ROOTINO, directory, &dir_ino);
361 com_err(disk, retval, "while translating %s", directory);
364 mapfileino(dir_ino, tapesize, &anydirskipped);
366 mfc.tapesize = tapesize;
367 mfc.anydirskipped = &anydirskipped;
368 retval = ext2fs_dir_iterate(fs, dir_ino, 0, NULL, mapfilesindir,
372 com_err(disk, retval, "while mapping files in %s", directory);
376 * Ensure that the root inode actually appears in the file list
379 mapfileino(ROOTINO, tapesize, &anydirskipped);
381 * Restore gets very upset if the root is not dumped,
382 * so ensure that it always is dumped.
384 SETINO(ROOTINO, dumpinomap);
385 return anydirskipped;
390 struct mapdirs_context {
400 * Scan each directory on the filesystem to see if it has any modified
401 * files in it. If it does, and has not already been added to the dump
402 * list (because it was itself modified), then add it. If a directory
403 * has not been modified itself, contains no modified files and has no
404 * subdirectories, then it can be deleted from the dump list and from
405 * the list of directories. By deleting it from the list of directories,
406 * its parent may now qualify for the same treatment on this or a later
407 * pass using this algorithm.
410 mapdirs(ino_t maxino, long *tapesize)
412 register struct dinode *dp;
420 struct mapdirs_context mdc;
422 int ret, change = 0, nodump;
424 isdir = 0; /* XXX just to get gcc to shut up */
425 for (map = dumpdirmap, ino = 1; ino < maxino; ino++) {
426 if (((ino - 1) % NBBY) == 0) /* map is offset by 1 */
431 * If dir has been removed from the used map, it's either
432 * because it had the nodump flag, or it herited it from
433 * its parent. A directory can't be in dumpinomap if not
434 * in usedinomap, but we have to go through it anyway
435 * to propagate the nodump attribute.
437 nodump = (TSTINO(ino, usedinomap) == 0);
438 if ((isdir & 1) == 0 ||
439 (TSTINO(ino, dumpinomap) && nodump == 0))
446 mdc.tapesize = tapesize;
447 ext2fs_dir_iterate(fs, ino, 0, NULL, searchdir, (void *) &mdc);
448 #else /* __linux__ */
449 filesize = dp->di_size;
450 for (ret = 0, i = 0; filesize > 0 && i < NDADDR; i++) {
451 if (dp->di_db[i] != 0)
452 ret |= searchdir(ino, dp->di_db[i],
453 (long)dblksize(sblock, dp, i),
455 if (ret & HASDUMPEDFILE)
458 filesize -= sblock->fs_bsize;
460 for (i = 0; filesize > 0 && i < NIADDR; i++) {
461 if (dp->di_ib[i] == 0)
463 ret |= dirindir(ino, dp->di_ib[i], i, &filesize);
465 #endif /* __linux__ */
466 if (ret & HASDUMPEDFILE) {
467 SETINO(ino, dumpinomap);
468 *tapesize += blockest(dp);
473 if (ret & HASSUBDIRS)
474 change = 1; /* subdirs have inherited nodump */
475 CLRINO(ino, dumpdirmap);
476 } else if ((ret & HASSUBDIRS) == 0) {
477 if (!TSTINO(ino, dumpinomap)) {
478 CLRINO(ino, dumpdirmap);
488 * Read indirect blocks, and pass the data blocks to be searched
489 * as directories. Quit as soon as any entry is found that will
490 * require the directory to be dumped.
493 dirindir(ino_t ino, daddr_t blkno, int ind_level, long *filesize)
497 daddr_t idblk[MAXNINDIR];
499 bread(fsbtodb(sblock, blkno), (char *)idblk, (int)sblock->fs_bsize);
500 if (ind_level <= 0) {
501 for (i = 0; *filesize > 0 && i < NINDIR(sblock); i++) {
504 ret |= searchdir(ino, blkno, sblock->fs_bsize,
506 if (ret & HASDUMPEDFILE)
509 *filesize -= sblock->fs_bsize;
514 for (i = 0; *filesize > 0 && i < NINDIR(sblock); i++) {
517 ret |= dirindir(ino, blkno, ind_level, filesize);
521 #endif /* !__linux__ */
524 * Scan a disk block containing directory information looking to see if
525 * any of the entries are on the dump list and to see if the directory
526 * contains any subdirectories.
530 searchdir(struct ext2_dir_entry *dp, int offset, int blocksize, char *buf, void *private)
532 struct mapdirs_context *mdc;
537 mdc = (struct mapdirs_context *)private;
539 tapesize = mdc->tapesize;
543 if (dp->name[0] == '.') {
544 if (( dp->name_len & 0xFF ) == 1)
546 if (dp->name[1] == '.' && ( dp->name_len & 0xFF ) == 2)
550 ip = getino(dp->inode);
551 if (TSTINO(dp->inode, dumpinomap)) {
552 CLRINO(dp->inode, dumpinomap);
553 CLRINO(dp->inode, usedinomap);
554 *tapesize -= blockest(ip);
556 /* Add dir back to the dir map, to propagate nodump */
557 if ((ip->di_mode & IFMT) == IFDIR) {
558 SETINO(dp->inode, dumpdirmap);
562 if (TSTINO(dp->inode, dumpinomap)) {
563 *ret |= HASDUMPEDFILE;
564 if (*ret & HASSUBDIRS)
567 if (TSTINO(dp->inode, dumpdirmap)) {
569 if (*ret & HASDUMPEDFILE)
576 #else /* __linux__ */
579 searchdir(ino_t ino, daddr_t blkno, long size, long filesize)
581 register struct direct *dp;
582 register long loc, ret = 0;
585 bread(fsbtodb(sblock, blkno), dblk, (int)size);
588 for (loc = 0; loc < size; ) {
589 dp = (struct direct *)(dblk + loc);
590 if (dp->d_reclen == 0) {
591 msg("corrupted directory, inumber %d\n", ino);
597 if (dp->d_name[0] == '.') {
598 if (dp->d_name[1] == '\0')
600 if (dp->d_name[1] == '.' && dp->d_name[2] == '\0')
603 if (TSTINO(dp->d_ino, dumpinomap)) {
604 ret |= HASDUMPEDFILE;
605 if (ret & HASSUBDIRS)
608 if (TSTINO(dp->d_ino, dumpdirmap)) {
610 if (ret & HASDUMPEDFILE)
616 #endif /* __linux__ */
620 struct block_context {
629 * Dump a block to the tape
632 dumponeblock(ext2_filsys fs, blk_t *blocknr, int blockcnt, void *private)
634 struct block_context *p;
637 if (blockcnt < NDADDR)
639 p = (struct block_context *)private;
640 for (i = p->next_block; i < blockcnt; i++) {
641 p->buf[p->cnt++] = 0;
642 if (p->cnt == p->max) {
643 blksout (p->buf, p->cnt, p->ino);
647 p->buf[p->cnt++] = *blocknr;
648 if (p->cnt == p->max) {
649 blksout (p->buf, p->cnt, p->ino);
652 p->next_block = blockcnt + 1;
658 * Dump passes 3 and 4.
660 * Dump the contents of an inode to tape.
663 dumpino(struct dinode *dp, ino_t ino)
668 struct old_bsd_inode obi;
670 struct block_context bc;
677 dumpmap(dumpinomap, TS_BITS, ino);
679 CLRINO(ino, dumpinomap);
681 memset(&obi, 0, sizeof(obi));
682 obi.di_mode = dp->di_mode;
683 obi.di_uid = dp->di_uid;
684 obi.di_gid = dp->di_gid;
685 obi.di_qsize.v = (u_quad_t)dp->di_size;
686 obi.di_atime = dp->di_atime;
687 obi.di_mtime = dp->di_mtime;
688 obi.di_ctime = dp->di_ctime;
689 obi.di_nlink = dp->di_nlink;
690 obi.di_blocks = dp->di_blocks;
691 obi.di_flags = dp->di_flags;
692 obi.di_gen = dp->di_gen;
693 memmove(&obi.di_db, &dp->di_db, (NDADDR + NIADDR) * sizeof(daddr_t));
694 if (dp->di_file_acl || dp->di_dir_acl)
695 warn("ACLs in inode #%ld won't be dumped", (long)ino);
696 memmove(&spcl.c_dinode, &obi, sizeof(obi));
697 #else /* __linux__ */
699 #endif /* __linux__ */
700 spcl.c_type = TS_INODE;
702 switch (dp->di_mode & S_IFMT) {
712 msg("Warning: dumpino called on a directory (ino %d)\n", ino);
718 * Check for short symbolic link.
721 if (dp->di_size > 0 &&
722 dp->di_size < EXT2_N_BLOCKS * sizeof (daddr_t)) {
726 memmove(buf, dp->di_db, (u_long)dp->di_size);
727 buf[dp->di_size] = '\0';
731 #endif /* __linux__ */
733 if (dp->di_size > 0 &&
734 dp->di_size < sblock->fs_maxsymlinklen) {
738 memmove(buf, dp->di_shortlink, (u_long)dp->di_size);
739 buf[dp->di_size] = '\0';
762 msg("Warning: undefined file type 0%o\n", dp->di_mode & IFMT);
765 if (dp->di_size > NDADDR * sblock->fs_bsize)
767 cnt = NDADDR * EXT2_FRAGS_PER_BLOCK(fs->super);
769 cnt = NDADDR * sblock->fs_frag;
772 cnt = howmany(dp->di_size, sblock->fs_fsize);
773 blksout(&dp->di_db[0], cnt, ino);
774 if ((size = dp->di_size - NDADDR * sblock->fs_bsize) <= 0)
777 bc.max = NINDIR(sblock) * EXT2_FRAGS_PER_BLOCK(fs->super);
778 bc.buf = (int *)malloc (bc.max * sizeof (int));
781 bc.next_block = NDADDR;
783 ext2fs_block_iterate (fs, ino, 0, NULL, dumponeblock, (void *)&bc);
785 blksout (bc.buf, bc.cnt, bc.ino);
789 for (ind_level = 0; ind_level < NIADDR; ind_level++) {
790 dmpindir(ino, dp->di_ib[ind_level], ind_level, &size);
799 struct convert_dir_context {
807 * This function converts an ext2fs directory entry to the BSD format.
809 * Basically, it adds a null-character at the end of the name, recomputes the
810 * size of the entry, and creates it in a temporary buffer
813 convert_dir(struct ext2_dir_entry *dirent, int offset, int blocksize, char *buf, void *private)
815 struct convert_dir_context *p;
816 struct olddirect *dp;
819 p = (struct convert_dir_context *)private;
821 reclen = EXT2_DIR_REC_LEN((dirent->name_len & 0xFF) + 1);
822 if (((p->offset + reclen - 1) / p->bs) != (p->offset / p->bs)) {
823 dp = (struct olddirect *)(p->buf + p->prev_offset);
824 dp->d_reclen += p->bs - (p->offset % p->bs);
825 p->offset += p->bs - (p->offset % p->bs);
828 dp = (struct olddirect *)(p->buf + p->offset);
829 dp->d_ino = dirent->inode;
830 dp->d_reclen = reclen;
831 dp->d_namlen = dirent->name_len & 0xFF;
832 strncpy(dp->d_name, dirent->name, dp->d_namlen);
833 dp->d_name[dp->d_namlen] = '\0';
834 p->prev_offset = p->offset;
843 * Dumps a directory to tape after converting it to the BSD format
846 dumpdirino(struct dinode *dp, ino_t ino)
850 struct old_bsd_inode obi;
851 struct convert_dir_context cdc;
853 struct ext2_dir_entry *de;
858 dumpmap(dumpinomap, TS_BITS, ino);
860 CLRINO(ino, dumpinomap);
863 * Convert the directory to the BSD format
865 /* Allocate a buffer for the conversion (twice the size of the
866 ext2fs directory to avoid problems ;-) */
867 cdc.buf = (char *)malloc(dp->di_size * 2 * sizeof(char));
869 err(1, "Cannot allocate buffer to convert directory #%lu\n",
873 cdc.bs = MIN(DIRBLKSIZ, TP_BSIZE);
874 /* Do the conversion */
875 retval = ext2fs_dir_iterate(fs, ino, 0, NULL, convert_dir, (void *)&cdc);
877 com_err(disk, retval, "while converting directory #%ld\n", (long)ino);
880 /* Fix the last entry */
881 if ((cdc.offset % cdc.bs) != 0) {
882 de = (struct ext2_dir_entry *)(cdc.buf + cdc.prev_offset);
883 de->rec_len += cdc.bs - (cdc.offset % cdc.bs);
884 cdc.offset += cdc.bs - (cdc.offset % cdc.bs);
887 dir_size = cdc.offset;
890 memset(&obi, 0, sizeof(obi));
891 obi.di_mode = dp->di_mode;
892 obi.di_uid = dp->di_uid;
893 obi.di_gid = dp->di_gid;
894 obi.di_qsize.v = dir_size; /* (u_quad_t)dp->di_size; */
895 obi.di_atime = dp->di_atime;
896 obi.di_mtime = dp->di_mtime;
897 obi.di_ctime = dp->di_ctime;
898 obi.di_nlink = dp->di_nlink;
899 obi.di_blocks = dp->di_blocks;
900 obi.di_flags = dp->di_flags;
901 obi.di_gen = dp->di_gen;
902 memmove(&obi.di_db, &dp->di_db, (NDADDR + NIADDR) * sizeof(daddr_t));
903 if (dp->di_file_acl || dp->di_dir_acl)
904 warn("ACLs in inode #%ld won't be dumped", (long)ino);
905 memmove(&spcl.c_dinode, &obi, sizeof(obi));
906 #else /* __linux__ */
908 #endif /* __linux__ */
909 spcl.c_type = TS_INODE;
911 switch (dp->di_mode & S_IFMT) {
922 msg("Warning: size of directory inode #%d is <= 0 (%d)!\n",
927 msg("Warning: dumpdirino called with file type 0%o (inode #%d)\n",
928 dp->di_mode & IFMT, ino);
931 for (size = 0; size < dir_size; size += TP_BSIZE) {
935 memmove(buf, cdc.buf + size, TP_BSIZE);
937 spcl.c_type = TS_ADDR;
942 #endif /* __linux__ */
946 * Read indirect blocks, and pass the data blocks to be dumped.
949 dmpindir(ino_t ino, daddr_t blk, int ind_level, fsizeT *size)
956 daddr_t idblk[MAXNINDIR];
959 bread(fsbtodb(sblock, blk), (char *)idblk, (int) sblock->fs_bsize);
962 * My RedHat 4.0 system doesn't have these flags; I haven't
963 * upgraded e2fsprogs yet
965 #if defined(EXT2_FLAG_SWAP_BYTES)
966 if ((fs->flags & EXT2_FLAG_SWAP_BYTES) ||
967 (fs->flags & EXT2_FLAG_SWAP_BYTES_READ)) {
969 max = sblock->fs_bsize >> 2;
970 swapme = (blk_t *) idblk;
971 for (i = 0; i < max; i++, swapme++)
972 *swapme = swab32(*swapme);
973 #if defined(EXT2_FLAG_SWAP_BYTES)
978 memset(idblk, 0, (int)sblock->fs_bsize);
979 if (ind_level <= 0) {
980 if (*size < NINDIR(sblock) * sblock->fs_bsize)
981 cnt = howmany(*size, sblock->fs_fsize);
984 cnt = NINDIR(sblock) * EXT2_FRAGS_PER_BLOCK(fs->super);
986 cnt = NINDIR(sblock) * sblock->fs_frag;
988 *size -= NINDIR(sblock) * sblock->fs_bsize;
989 blksout(&idblk[0], cnt, ino);
993 for (i = 0; i < NINDIR(sblock); i++) {
994 dmpindir(ino, idblk[i], ind_level, size);
1002 * Collect up the data into tape record sized buffers and output them.
1005 blksout(daddr_t *blkp, int frags, ino_t ino)
1007 register daddr_t *bp;
1008 int i, j, count, blks, tbperdb;
1010 blks = howmany(frags * sblock->fs_fsize, TP_BSIZE);
1011 tbperdb = sblock->fs_bsize >> tp_bshift;
1012 for (i = 0; i < blks; i += TP_NINDIR) {
1013 if (i + TP_NINDIR > blks)
1016 count = i + TP_NINDIR;
1017 for (j = i; j < count; j++)
1018 if (blkp[j / tbperdb] != 0)
1019 spcl.c_addr[j - i] = 1;
1021 spcl.c_addr[j - i] = 0;
1022 spcl.c_count = count - i;
1024 bp = &blkp[i / tbperdb];
1025 for (j = i; j < count; j += tbperdb, bp++) {
1027 if (j + tbperdb <= count)
1028 dumpblock(*bp, (int)sblock->fs_bsize);
1030 dumpblock(*bp, (count - j) * TP_BSIZE);
1033 spcl.c_type = TS_ADDR;
1038 * Dump a map to the tape.
1041 dumpmap(char *map, int type, ino_t ino)
1047 spcl.c_count = howmany(mapsize * sizeof(char), TP_BSIZE);
1049 for (i = 0, cp = map; i < spcl.c_count; i++, cp += TP_BSIZE)
1054 * Write a header record to the dump tape.
1057 writeheader(ino_t ino)
1060 register __s32 sum, cnt, *lp;
1062 register int32_t sum, cnt, *lp;
1065 spcl.c_inumber = ino;
1066 spcl.c_magic = NFS_MAGIC;
1067 spcl.c_checksum = 0;
1069 lp = (__s32 *)&spcl;
1071 lp = (int32_t *)&spcl;
1075 cnt = sizeof(union u_spcl) / (4 * sizeof(__s32));
1077 cnt = sizeof(union u_spcl) / (4 * sizeof(int32_t));
1079 while (--cnt >= 0) {
1085 spcl.c_checksum = CHECKSUM - sum;
1086 writerec((char *)&spcl, 1);
1093 static struct dinode dinode;
1096 ext2fs_read_inode(fs, inum, (struct ext2_inode *) &dinode);
1099 #else /* __linux__ */
1103 static daddr_t minino, maxino;
1104 static struct dinode inoblock[MAXINOPB];
1107 if (inum >= minino && inum < maxino)
1108 return (&inoblock[inum - minino]);
1109 bread(fsbtodb(sblock, ino_to_fsba(sblock, inum)), (char *)inoblock,
1110 (int)sblock->fs_bsize);
1111 minino = inum - (inum % INOPB(sblock));
1112 maxino = minino + INOPB(sblock);
1113 return (&inoblock[inum - minino]);
1115 #endif /* __linux__ */
1118 * Read a chunk of data from the disk.
1119 * Try to recover from hard errors by reading in sector sized pieces.
1120 * Error recovery is attempted at most BREADEMAX times before seeking
1121 * consent from the operator to continue.
1123 int breaderrors = 0;
1124 #define BREADEMAX 32
1127 bread(daddr_t blkno, char *buf, int size)
1134 if (ext2fs_llseek(diskfd, (((ext2_loff_t)blkno) << dev_bshift), 0) !=
1135 (((ext2_loff_t)blkno) << dev_bshift))
1137 if (lseek(diskfd, ((off_t)blkno << dev_bshift), 0) !=
1138 ((off_t)blkno << dev_bshift))
1140 msg("bread: lseek fails\n");
1141 if ((cnt = read(diskfd, buf, size)) == size)
1143 if (blkno + (size / dev_bsize) > fsbtodb(sblock, sblock->fs_size)) {
1145 * Trying to read the final fragment.
1147 * NB - dump only works in TP_BSIZE blocks, hence
1148 * rounds `dev_bsize' fragments up to TP_BSIZE pieces.
1149 * It should be smarter about not actually trying to
1150 * read more than it can get, but for the time being
1151 * we punt and scale back the read only when it gets
1152 * us into trouble. (mkm 9/25/83)
1158 msg("read error from %s: %s: [block %d]: count=%d\n",
1159 disk, strerror(errno), blkno, size);
1161 msg("short read error from %s: [block %d]: count=%d, got=%d\n",
1162 disk, blkno, size, cnt);
1163 if (++breaderrors > BREADEMAX) {
1164 msg("More than %d block read errors from %d\n",
1166 broadcast("DUMP IS AILING!\n");
1167 msg("This is an unrecoverable error.\n");
1168 if (!query("Do you want to attempt to continue?")){
1175 * Zero buffer, then try to read each sector of buffer separately.
1177 memset(buf, 0, size);
1178 for (i = 0; i < size; i += dev_bsize, buf += dev_bsize, blkno++) {
1180 if (ext2fs_llseek(diskfd, (((ext2_loff_t)blkno) << dev_bshift), 0) !=
1181 (((ext2_loff_t)blkno) << dev_bshift))
1183 if (lseek(diskfd, ((off_t)blkno << dev_bshift), 0) !=
1184 ((off_t)blkno << dev_bshift))
1186 msg("bread: lseek2 fails!\n");
1187 if ((cnt = read(diskfd, buf, (int)dev_bsize)) == dev_bsize)
1190 msg("read error from %s: %s: [sector %d]: count=%d\n",
1191 disk, strerror(errno), blkno, dev_bsize);
1194 msg("short read error from %s: [sector %d]: count=%d, got=%d\n",
1195 disk, blkno, dev_bsize, cnt);