]>
Commit | Line | Data |
---|---|---|
1227625a SP |
1 | /* |
2 | * Ported to Linux's Second Extended File System as part of the | |
3 | * dump and restore backup suit | |
b45f51d6 | 4 | * Remy Card <card@Linux.EU.Org>, 1994-1997 |
df9ae507 | 5 | * Stelian Pop <pop@cybercable.fr>, 1999 |
1227625a SP |
6 | */ |
7 | ||
8 | /*- | |
9 | * Copyright (c) 1980, 1988, 1991, 1993 | |
10 | * The Regents of the University of California. All rights reserved. | |
11 | * | |
12 | * Redistribution and use in source and binary forms, with or without | |
13 | * modification, are permitted provided that the following conditions | |
14 | * are met: | |
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. | |
27 | * | |
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 | |
38 | * SUCH DAMAGE. | |
39 | */ | |
40 | ||
df9ae507 SP |
41 | #ifndef lint |
42 | static const char rcsid[] = | |
7fbb9b02 | 43 | "$Id: traverse.c,v 1.11 1999/12/05 18:21:23 tiniou Exp $"; |
df9ae507 SP |
44 | #endif /* not lint */ |
45 | ||
1227625a | 46 | #include <sys/param.h> |
1227625a SP |
47 | #include <sys/stat.h> |
48 | #ifdef __linux__ | |
49 | #include <linux/ext2_fs.h> | |
50 | #include <bsdcompat.h> | |
ddd2ef55 | 51 | #include <compaterr.h> |
1227625a | 52 | #include <stdlib.h> |
b45f51d6 | 53 | #define swab32(x) ext2fs_swab32(x) |
1227625a | 54 | #else /* __linux__ */ |
ddd2ef55 | 55 | #define swab32(x) x |
1227625a SP |
56 | #ifdef sunos |
57 | #include <sys/vnode.h> | |
58 | ||
59 | #include <ufs/fs.h> | |
60 | #include <ufs/fsdir.h> | |
61 | #include <ufs/inode.h> | |
62 | #else | |
63 | #include <ufs/ufs/dir.h> | |
64 | #include <ufs/ufs/dinode.h> | |
65 | #include <ufs/ffs/fs.h> | |
66 | #endif | |
67 | #endif /* __linux__ */ | |
68 | ||
69 | #include <protocols/dumprestore.h> | |
70 | ||
71 | #include <ctype.h> | |
72 | #include <stdio.h> | |
73 | #ifdef __STDC__ | |
74 | #include <string.h> | |
75 | #include <unistd.h> | |
76 | #endif | |
77 | ||
78 | #ifdef __linux__ | |
79 | #include <ext2fs/ext2fs.h> | |
80 | #endif | |
81 | ||
82 | #include "dump.h" | |
83 | ||
84 | #define HASDUMPEDFILE 0x1 | |
85 | #define HASSUBDIRS 0x2 | |
86 | ||
87 | #ifdef FS_44INODEFMT | |
88 | typedef quad_t fsizeT; | |
89 | #else | |
90 | typedef long fsizeT; | |
91 | #endif | |
92 | ||
1227625a SP |
93 | #ifdef __linux__ |
94 | static int searchdir __P((struct ext2_dir_entry *dp, int offset, | |
95 | int blocksize, char *buf, void *private)); | |
96 | #else | |
b45f51d6 SP |
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)); | |
1227625a SP |
99 | static int searchdir __P((ino_t ino, daddr_t blkno, long size, long filesize)); |
100 | #endif | |
4267a8ad | 101 | static void mapfileino __P((ino_t ino, long *tapesize, int *dirskipped)); |
1227625a | 102 | |
c930abff SP |
103 | /* #define EXT3_FEATURE_INCOMPAT_RECOVER */ |
104 | ||
105 | int dump_fs_open(const char *disk, ext2_filsys *fs) | |
106 | { | |
107 | int retval; | |
108 | struct ext2fs_sb *s; | |
109 | ||
110 | #ifdef EXT3_FEATURE_INCOMPAT_RECOVER | |
111 | retval = ext2fs_open(disk, EXT2_FLAG_FORCE, 0, 0, unix_io_manager, fs); | |
112 | #else | |
113 | retval = ext2fs_open(disk, 0, 0, 0, unix_io_manager, fs); | |
114 | #endif | |
115 | if (!retval) { | |
116 | s = (struct ext2fs_sb *) (*fs)->super; | |
117 | if ((s->s_feature_compat & ~EXT2_LIB_FEATURE_COMPAT_SUPP) || | |
118 | #ifdef EXT3_FEATURE_INCOMPAT_RECOVER | |
119 | (s->s_feature_incompat & ~(EXT3_FEATURE_INCOMPAT_RECOVER | EXT2_LIB_FEATURE_INCOMPAT_SUPP))) { | |
120 | #else | |
121 | (s->s_feature_incompat & ~EXT2_LIB_FEATURE_INCOMPAT_SUPP)) { | |
122 | #endif | |
123 | retval = EXT2_ET_UNSUPP_FEATURE; | |
124 | } | |
125 | else if (s->s_feature_ro_compat & ~EXT2_LIB_FEATURE_RO_COMPAT_SUPP) { | |
126 | retval = EXT2_ET_RO_UNSUPP_FEATURE; | |
127 | } | |
128 | } | |
129 | return retval; | |
130 | } | |
131 | ||
1227625a SP |
132 | /* |
133 | * This is an estimation of the number of TP_BSIZE blocks in the file. | |
134 | * It estimates the number of blocks in files with holes by assuming | |
135 | * that all of the blocks accounted for by di_blocks are data blocks | |
136 | * (when some of the blocks are usually used for indirect pointers); | |
137 | * hence the estimate may be high. | |
138 | */ | |
139 | long | |
ddd2ef55 | 140 | blockest(struct dinode *dp) |
1227625a SP |
141 | { |
142 | long blkest, sizeest; | |
143 | ||
144 | /* | |
145 | * dp->di_size is the size of the file in bytes. | |
146 | * dp->di_blocks stores the number of sectors actually in the file. | |
147 | * If there are more sectors than the size would indicate, this just | |
148 | * means that there are indirect blocks in the file or unused | |
149 | * sectors in the last file block; we can safely ignore these | |
150 | * (blkest = sizeest below). | |
151 | * If the file is bigger than the number of sectors would indicate, | |
152 | * then the file has holes in it. In this case we must use the | |
153 | * block count to estimate the number of data blocks used, but | |
154 | * we use the actual size for estimating the number of indirect | |
155 | * dump blocks (sizeest vs. blkest in the indirect block | |
156 | * calculation). | |
157 | */ | |
158 | blkest = howmany(dbtob(dp->di_blocks), TP_BSIZE); | |
159 | sizeest = howmany(dp->di_size, TP_BSIZE); | |
160 | if (blkest > sizeest) | |
161 | blkest = sizeest; | |
162 | #ifdef __linux__ | |
163 | if (dp->di_size > fs->blocksize * NDADDR) { | |
164 | /* calculate the number of indirect blocks on the dump tape */ | |
165 | blkest += | |
166 | howmany(sizeest - NDADDR * fs->blocksize / TP_BSIZE, | |
167 | TP_NINDIR); | |
168 | } | |
169 | #else | |
170 | if (dp->di_size > sblock->fs_bsize * NDADDR) { | |
171 | /* calculate the number of indirect blocks on the dump tape */ | |
172 | blkest += | |
173 | howmany(sizeest - NDADDR * sblock->fs_bsize / TP_BSIZE, | |
174 | TP_NINDIR); | |
175 | } | |
176 | #endif | |
177 | return (blkest + 1); | |
178 | } | |
179 | ||
180 | /* Auxiliary macro to pick up files changed since previous dump. */ | |
181 | #define CHANGEDSINCE(dp, t) \ | |
182 | ((dp)->di_mtime >= (t) || (dp)->di_ctime >= (t)) | |
183 | ||
184 | /* The WANTTODUMP macro decides whether a file should be dumped. */ | |
185 | #ifdef UF_NODUMP | |
186 | #define WANTTODUMP(dp) \ | |
187 | (CHANGEDSINCE(dp, spcl.c_ddate) && \ | |
188 | (nonodump || ((dp)->di_flags & UF_NODUMP) != UF_NODUMP)) | |
189 | #else | |
190 | #define WANTTODUMP(dp) CHANGEDSINCE(dp, spcl.c_ddate) | |
191 | #endif | |
192 | ||
4267a8ad SP |
193 | /* |
194 | * Determine if given inode should be dumped | |
195 | */ | |
196 | void | |
197 | mapfileino(ino_t ino, long *tapesize, int *dirskipped) | |
198 | { | |
199 | register int mode; | |
200 | register struct dinode *dp; | |
201 | ||
202 | /* | |
203 | * Skip inode if we've already marked it for dumping | |
204 | */ | |
205 | if (TSTINO(ino, usedinomap)) | |
206 | return; | |
207 | dp = getino(ino); | |
208 | if ((mode = (dp->di_mode & IFMT)) == 0) | |
209 | return; | |
210 | #ifdef __linux__ | |
211 | if (dp->di_nlink == 0 || dp->di_dtime != 0) | |
212 | return; | |
213 | #endif | |
214 | /* | |
215 | * Put all dirs in dumpdirmap, inodes that are to be dumped in the | |
216 | * used map. All inode but dirs who have the nodump attribute go | |
217 | * to the usedinomap. | |
218 | */ | |
219 | SETINO(ino, usedinomap); | |
220 | if (mode == IFDIR) | |
221 | SETINO(ino, dumpdirmap); | |
222 | if (WANTTODUMP(dp)) { | |
223 | SETINO(ino, dumpinomap); | |
224 | if (mode != IFREG && mode != IFDIR && mode != IFLNK) | |
225 | *tapesize += 1; | |
226 | else | |
227 | *tapesize += blockest(dp); | |
228 | return; | |
229 | } | |
230 | if (mode == IFDIR) { | |
231 | #ifdef UF_NODUMP | |
232 | if (!nonodump && (dp->di_flags & UF_NODUMP)) | |
233 | CLRINO(ino, usedinomap); | |
234 | #endif | |
235 | *dirskipped = 1; | |
236 | } | |
237 | } | |
238 | ||
1227625a SP |
239 | /* |
240 | * Dump pass 1. | |
241 | * | |
242 | * Walk the inode list for a filesystem to find all allocated inodes | |
243 | * that have been modified since the previous dump time. Also, find all | |
244 | * the directories in the filesystem. | |
245 | */ | |
246 | int | |
ddd2ef55 | 247 | mapfiles(ino_t maxino, long *tapesize) |
1227625a | 248 | { |
1227625a | 249 | register ino_t ino; |
1227625a SP |
250 | int anydirskipped = 0; |
251 | ||
4267a8ad SP |
252 | for (ino = ROOTINO; ino < maxino; ino++) |
253 | mapfileino(ino, tapesize, &anydirskipped); | |
254 | ||
1227625a SP |
255 | /* |
256 | * Restore gets very upset if the root is not dumped, | |
257 | * so ensure that it always is dumped. | |
258 | */ | |
259 | SETINO(ROOTINO, dumpinomap); | |
260 | return (anydirskipped); | |
261 | } | |
262 | ||
263 | #ifdef __linux__ | |
264 | struct mapfile_context { | |
265 | long *tapesize; | |
4267a8ad | 266 | int *anydirskipped; |
1227625a SP |
267 | }; |
268 | ||
269 | static int | |
ddd2ef55 | 270 | mapfilesindir(struct ext2_dir_entry *dirent, int offset, int blocksize, char *buf, void *private) |
1227625a SP |
271 | { |
272 | register struct dinode *dp; | |
273 | register int mode; | |
1227625a SP |
274 | errcode_t retval; |
275 | struct mapfile_context *mfc; | |
4267a8ad | 276 | ino_t ino; |
1227625a SP |
277 | |
278 | ino = dirent->inode; | |
279 | mfc = (struct mapfile_context *)private; | |
4267a8ad SP |
280 | |
281 | mapfileino(dirent->inode, mfc->tapesize, mfc->anydirskipped); | |
282 | ||
283 | dp = getino(dirent->inode); | |
284 | mode = dp->di_mode & IFMT; | |
285 | if (mode == IFDIR && dp->di_nlink != 0 && dp->di_dtime == 0) { | |
286 | if ((dirent->name[0] != '.' || dirent->name_len != 1) && | |
287 | (dirent->name[0] != '.' || dirent->name[1] != '.' || | |
288 | dirent->name_len != 2)) { | |
289 | retval = ext2fs_dir_iterate(fs, ino, 0, NULL, | |
290 | mapfilesindir, private); | |
291 | if (retval) | |
292 | return retval; | |
1227625a SP |
293 | } |
294 | } | |
295 | return 0; | |
296 | } | |
297 | ||
298 | /* | |
299 | * Dump pass 1. | |
300 | * | |
301 | * Walk the inode list for a filesystem to find all allocated inodes | |
302 | * that have been modified since the previous dump time. Also, find all | |
303 | * the directories in the filesystem. | |
304 | */ | |
305 | int | |
ddd2ef55 | 306 | mapfilesfromdir(ino_t maxino, long *tapesize, char *directory) |
1227625a SP |
307 | { |
308 | errcode_t retval; | |
309 | struct mapfile_context mfc; | |
310 | ino_t dir_ino; | |
311 | char dir_name [MAXPATHLEN]; | |
4267a8ad | 312 | int i, anydirskipped = 0; |
1227625a SP |
313 | |
314 | /* | |
315 | * Mark every directory in the path as being dumped | |
316 | */ | |
317 | for (i = 0; i < strlen (directory); i++) { | |
318 | if (directory[i] == '/') { | |
319 | strncpy (dir_name, directory, i); | |
320 | dir_name[i] = '\0'; | |
321 | retval = ext2fs_namei(fs, ROOTINO, ROOTINO, dir_name, | |
322 | &dir_ino); | |
323 | if (retval) { | |
324 | com_err(disk, retval, "while translating %s", | |
325 | dir_name); | |
326 | exit(X_ABORT); | |
327 | } | |
4267a8ad | 328 | mapfileino(dir_ino, tapesize, &anydirskipped); |
1227625a SP |
329 | } |
330 | } | |
331 | /* | |
332 | * Mark the final directory | |
333 | */ | |
334 | retval = ext2fs_namei(fs, ROOTINO, ROOTINO, directory, &dir_ino); | |
335 | if (retval) { | |
336 | com_err(disk, retval, "while translating %s", directory); | |
337 | exit(X_ABORT); | |
338 | } | |
4267a8ad | 339 | mapfileino(dir_ino, tapesize, &anydirskipped); |
1227625a SP |
340 | |
341 | mfc.tapesize = tapesize; | |
4267a8ad | 342 | mfc.anydirskipped = &anydirskipped; |
1227625a SP |
343 | retval = ext2fs_dir_iterate(fs, dir_ino, 0, NULL, mapfilesindir, |
344 | (void *)&mfc); | |
345 | ||
346 | if (retval) { | |
347 | com_err(disk, retval, "while mapping files in %s", directory); | |
348 | exit(X_ABORT); | |
349 | } | |
4267a8ad SP |
350 | /* |
351 | * Ensure that the root inode actually appears in the file list | |
352 | * for a subdir | |
353 | */ | |
354 | mapfileino(ROOTINO, tapesize, &anydirskipped); | |
1227625a SP |
355 | /* |
356 | * Restore gets very upset if the root is not dumped, | |
357 | * so ensure that it always is dumped. | |
358 | */ | |
4267a8ad SP |
359 | SETINO(ROOTINO, dumpinomap); |
360 | return anydirskipped; | |
1227625a SP |
361 | } |
362 | #endif | |
363 | ||
4267a8ad SP |
364 | #ifdef __linux__ |
365 | struct mapdirs_context { | |
366 | int *ret; | |
367 | int nodump; | |
368 | long *tapesize; | |
369 | }; | |
370 | #endif | |
371 | ||
1227625a SP |
372 | /* |
373 | * Dump pass 2. | |
374 | * | |
375 | * Scan each directory on the filesystem to see if it has any modified | |
376 | * files in it. If it does, and has not already been added to the dump | |
377 | * list (because it was itself modified), then add it. If a directory | |
378 | * has not been modified itself, contains no modified files and has no | |
379 | * subdirectories, then it can be deleted from the dump list and from | |
380 | * the list of directories. By deleting it from the list of directories, | |
381 | * its parent may now qualify for the same treatment on this or a later | |
382 | * pass using this algorithm. | |
383 | */ | |
384 | int | |
ddd2ef55 | 385 | mapdirs(ino_t maxino, long *tapesize) |
1227625a SP |
386 | { |
387 | register struct dinode *dp; | |
b45f51d6 | 388 | register int isdir; |
1227625a SP |
389 | register char *map; |
390 | register ino_t ino; | |
8d4197bb | 391 | #ifndef __linux__ |
b45f51d6 | 392 | register int i; |
1227625a | 393 | long filesize; |
4267a8ad SP |
394 | #else |
395 | struct mapdirs_context mdc; | |
b45f51d6 | 396 | #endif |
4267a8ad | 397 | int ret, change = 0, nodump; |
1227625a SP |
398 | |
399 | isdir = 0; /* XXX just to get gcc to shut up */ | |
400 | for (map = dumpdirmap, ino = 1; ino < maxino; ino++) { | |
401 | if (((ino - 1) % NBBY) == 0) /* map is offset by 1 */ | |
402 | isdir = *map++; | |
403 | else | |
404 | isdir >>= 1; | |
4267a8ad SP |
405 | /* |
406 | * If dir has been removed from the used map, it's either | |
407 | * because it had the nodump flag, or it herited it from | |
408 | * its parent. A directory can't be in dumpinomap if not | |
409 | * in usedinomap, but we have to go through it anyway | |
410 | * to propagate the nodump attribute. | |
411 | */ | |
412 | nodump = (TSTINO(ino, usedinomap) == 0); | |
413 | if ((isdir & 1) == 0 || | |
414 | (TSTINO(ino, dumpinomap) && nodump == 0)) | |
1227625a | 415 | continue; |
1227625a | 416 | dp = getino(ino); |
b45f51d6 | 417 | #ifdef __linux__ |
1227625a | 418 | ret = 0; |
4267a8ad SP |
419 | mdc.ret = &ret; |
420 | mdc.nodump = nodump; | |
421 | mdc.tapesize = tapesize; | |
422 | ext2fs_dir_iterate(fs, ino, 0, NULL, searchdir, (void *) &mdc); | |
1227625a | 423 | #else /* __linux__ */ |
1227625a SP |
424 | filesize = dp->di_size; |
425 | for (ret = 0, i = 0; filesize > 0 && i < NDADDR; i++) { | |
426 | if (dp->di_db[i] != 0) | |
427 | ret |= searchdir(ino, dp->di_db[i], | |
428 | (long)dblksize(sblock, dp, i), | |
429 | filesize); | |
430 | if (ret & HASDUMPEDFILE) | |
431 | filesize = 0; | |
432 | else | |
433 | filesize -= sblock->fs_bsize; | |
434 | } | |
435 | for (i = 0; filesize > 0 && i < NIADDR; i++) { | |
436 | if (dp->di_ib[i] == 0) | |
437 | continue; | |
438 | ret |= dirindir(ino, dp->di_ib[i], i, &filesize); | |
439 | } | |
440 | #endif /* __linux__ */ | |
441 | if (ret & HASDUMPEDFILE) { | |
442 | SETINO(ino, dumpinomap); | |
443 | *tapesize += blockest(dp); | |
444 | change = 1; | |
445 | continue; | |
446 | } | |
4267a8ad SP |
447 | if (nodump) { |
448 | if (ret & HASSUBDIRS) | |
449 | change = 1; /* subdirs have inherited nodump */ | |
450 | CLRINO(ino, dumpdirmap); | |
451 | } else if ((ret & HASSUBDIRS) == 0) { | |
1227625a SP |
452 | if (!TSTINO(ino, dumpinomap)) { |
453 | CLRINO(ino, dumpdirmap); | |
454 | change = 1; | |
455 | } | |
456 | } | |
457 | } | |
458 | return (change); | |
459 | } | |
460 | ||
461 | #ifndef __linux__ | |
462 | /* | |
463 | * Read indirect blocks, and pass the data blocks to be searched | |
464 | * as directories. Quit as soon as any entry is found that will | |
465 | * require the directory to be dumped. | |
466 | */ | |
467 | static int | |
ddd2ef55 | 468 | dirindir(ino_t ino, daddr_t blkno, int ind_level, long *filesize) |
1227625a SP |
469 | { |
470 | int ret = 0; | |
471 | register int i; | |
472 | daddr_t idblk[MAXNINDIR]; | |
473 | ||
474 | bread(fsbtodb(sblock, blkno), (char *)idblk, (int)sblock->fs_bsize); | |
475 | if (ind_level <= 0) { | |
476 | for (i = 0; *filesize > 0 && i < NINDIR(sblock); i++) { | |
477 | blkno = idblk[i]; | |
478 | if (blkno != 0) | |
479 | ret |= searchdir(ino, blkno, sblock->fs_bsize, | |
480 | *filesize); | |
481 | if (ret & HASDUMPEDFILE) | |
482 | *filesize = 0; | |
483 | else | |
484 | *filesize -= sblock->fs_bsize; | |
485 | } | |
486 | return (ret); | |
487 | } | |
488 | ind_level--; | |
489 | for (i = 0; *filesize > 0 && i < NINDIR(sblock); i++) { | |
490 | blkno = idblk[i]; | |
491 | if (blkno != 0) | |
492 | ret |= dirindir(ino, blkno, ind_level, filesize); | |
493 | } | |
494 | return (ret); | |
495 | } | |
496 | #endif /* !__linux__ */ | |
497 | ||
498 | /* | |
499 | * Scan a disk block containing directory information looking to see if | |
500 | * any of the entries are on the dump list and to see if the directory | |
501 | * contains any subdirectories. | |
502 | */ | |
503 | #ifdef __linux__ | |
504 | static int | |
ddd2ef55 | 505 | searchdir(struct ext2_dir_entry *dp, int offset, int blocksize, char *buf, void *private) |
1227625a | 506 | { |
4267a8ad SP |
507 | struct mapdirs_context *mdc; |
508 | int *ret; | |
509 | long *tapesize; | |
510 | struct dinode *ip; | |
511 | ||
512 | mdc = (struct mapdirs_context *)private; | |
513 | ret = mdc->ret; | |
514 | tapesize = mdc->tapesize; | |
1227625a SP |
515 | |
516 | if (dp->inode == 0) | |
517 | return 0; | |
518 | if (dp->name[0] == '.') { | |
519 | if (dp->name_len == 1) | |
520 | return 0; | |
521 | if (dp->name[1] == '.' && dp->name_len == 2) | |
522 | return 0; | |
523 | } | |
4267a8ad SP |
524 | if (mdc->nodump) { |
525 | ip = getino(dp->inode); | |
526 | if (TSTINO(dp->inode, dumpinomap)) { | |
527 | CLRINO(dp->inode, dumpinomap); | |
528 | CLRINO(dp->inode, usedinomap); | |
529 | *tapesize -= blockest(ip); | |
530 | } | |
531 | /* Add dir back to the dir map, to propagate nodump */ | |
532 | if ((ip->di_mode & IFMT) == IFDIR) { | |
533 | SETINO(dp->inode, dumpdirmap); | |
534 | *ret |= HASSUBDIRS; | |
535 | } | |
536 | } else { | |
537 | if (TSTINO(dp->inode, dumpinomap)) { | |
538 | *ret |= HASDUMPEDFILE; | |
539 | if (*ret & HASSUBDIRS) | |
540 | return DIRENT_ABORT; | |
541 | } | |
542 | if (TSTINO(dp->inode, dumpdirmap)) { | |
543 | *ret |= HASSUBDIRS; | |
544 | if (*ret & HASDUMPEDFILE) | |
545 | return DIRENT_ABORT; | |
546 | } | |
1227625a SP |
547 | } |
548 | return 0; | |
549 | } | |
550 | ||
551 | #else /* __linux__ */ | |
552 | ||
553 | static int | |
ddd2ef55 | 554 | searchdir(ino_t ino, daddr_t blkno, long size, long filesize) |
1227625a SP |
555 | { |
556 | register struct direct *dp; | |
557 | register long loc, ret = 0; | |
558 | char dblk[MAXBSIZE]; | |
559 | ||
560 | bread(fsbtodb(sblock, blkno), dblk, (int)size); | |
561 | if (filesize < size) | |
562 | size = filesize; | |
563 | for (loc = 0; loc < size; ) { | |
564 | dp = (struct direct *)(dblk + loc); | |
565 | if (dp->d_reclen == 0) { | |
566 | msg("corrupted directory, inumber %d\n", ino); | |
567 | break; | |
568 | } | |
569 | loc += dp->d_reclen; | |
570 | if (dp->d_ino == 0) | |
571 | continue; | |
572 | if (dp->d_name[0] == '.') { | |
573 | if (dp->d_name[1] == '\0') | |
574 | continue; | |
575 | if (dp->d_name[1] == '.' && dp->d_name[2] == '\0') | |
576 | continue; | |
577 | } | |
578 | if (TSTINO(dp->d_ino, dumpinomap)) { | |
579 | ret |= HASDUMPEDFILE; | |
580 | if (ret & HASSUBDIRS) | |
581 | break; | |
582 | } | |
583 | if (TSTINO(dp->d_ino, dumpdirmap)) { | |
584 | ret |= HASSUBDIRS; | |
585 | if (ret & HASDUMPEDFILE) | |
586 | break; | |
587 | } | |
588 | } | |
589 | return (ret); | |
590 | } | |
591 | #endif /* __linux__ */ | |
592 | ||
593 | #ifdef __linux__ | |
594 | ||
595 | struct block_context { | |
596 | ino_t ino; | |
597 | int *buf; | |
598 | int cnt; | |
599 | int max; | |
600 | int next_block; | |
601 | }; | |
602 | ||
603 | /* | |
604 | * Dump a block to the tape | |
605 | */ | |
606 | static int | |
607 | dumponeblock(ext2_filsys fs, blk_t *blocknr, int blockcnt, void *private) | |
608 | { | |
609 | struct block_context *p; | |
610 | int i; | |
611 | ||
612 | if (blockcnt < NDADDR) | |
613 | return 0; | |
614 | p = (struct block_context *)private; | |
615 | for (i = p->next_block; i < blockcnt; i++) { | |
616 | p->buf[p->cnt++] = 0; | |
617 | if (p->cnt == p->max) { | |
618 | blksout (p->buf, p->cnt, p->ino); | |
619 | p->cnt = 0; | |
620 | } | |
621 | } | |
622 | p->buf[p->cnt++] = *blocknr; | |
623 | if (p->cnt == p->max) { | |
624 | blksout (p->buf, p->cnt, p->ino); | |
625 | p->cnt = 0; | |
626 | } | |
627 | p->next_block = blockcnt + 1; | |
628 | return 0; | |
629 | } | |
630 | #endif | |
631 | ||
632 | /* | |
633 | * Dump passes 3 and 4. | |
634 | * | |
635 | * Dump the contents of an inode to tape. | |
636 | */ | |
637 | void | |
ddd2ef55 | 638 | dumpino(struct dinode *dp, ino_t ino) |
1227625a | 639 | { |
b45f51d6 | 640 | int cnt; |
1227625a SP |
641 | fsizeT size; |
642 | char buf[TP_BSIZE]; | |
643 | struct old_bsd_inode obi; | |
644 | #ifdef __linux__ | |
645 | struct block_context bc; | |
b45f51d6 SP |
646 | #else |
647 | int ind_level; | |
1227625a SP |
648 | #endif |
649 | ||
650 | if (newtape) { | |
651 | newtape = 0; | |
652 | dumpmap(dumpinomap, TS_BITS, ino); | |
653 | } | |
654 | CLRINO(ino, dumpinomap); | |
655 | #ifdef __linux__ | |
656 | memset(&obi, 0, sizeof(obi)); | |
657 | obi.di_mode = dp->di_mode; | |
658 | obi.di_uid = dp->di_uid; | |
659 | obi.di_gid = dp->di_gid; | |
660 | obi.di_qsize.v = (u_quad_t)dp->di_size; | |
661 | obi.di_atime = dp->di_atime; | |
662 | obi.di_mtime = dp->di_mtime; | |
663 | obi.di_ctime = dp->di_ctime; | |
664 | obi.di_nlink = dp->di_nlink; | |
665 | obi.di_blocks = dp->di_blocks; | |
666 | obi.di_flags = dp->di_flags; | |
667 | obi.di_gen = dp->di_gen; | |
668 | memmove(&obi.di_db, &dp->di_db, (NDADDR + NIADDR) * sizeof(daddr_t)); | |
669 | if (dp->di_file_acl || dp->di_dir_acl) | |
ddd2ef55 | 670 | warn("ACLs in inode #%ld won't be dumped", ino); |
1227625a SP |
671 | memmove(&spcl.c_dinode, &obi, sizeof(obi)); |
672 | #else /* __linux__ */ | |
673 | spcl.c_dinode = *dp; | |
674 | #endif /* __linux__ */ | |
675 | spcl.c_type = TS_INODE; | |
676 | spcl.c_count = 0; | |
677 | switch (dp->di_mode & S_IFMT) { | |
678 | ||
679 | case 0: | |
680 | /* | |
681 | * Freed inode. | |
682 | */ | |
683 | return; | |
684 | ||
685 | #ifdef __linux__ | |
686 | case S_IFDIR: | |
687 | msg("Warning: dumpino called on a directory (ino %d)\n", ino); | |
688 | return; | |
689 | #endif | |
690 | ||
691 | case S_IFLNK: | |
692 | /* | |
693 | * Check for short symbolic link. | |
694 | */ | |
695 | #ifdef __linux__ | |
696 | if (dp->di_size > 0 && | |
697 | dp->di_size < EXT2_N_BLOCKS * sizeof (daddr_t)) { | |
698 | spcl.c_addr[0] = 1; | |
699 | spcl.c_count = 1; | |
700 | writeheader(ino); | |
701 | memmove(buf, dp->di_db, (u_long)dp->di_size); | |
702 | buf[dp->di_size] = '\0'; | |
703 | writerec(buf, 0); | |
704 | return; | |
705 | } | |
706 | #endif /* __linux__ */ | |
707 | #ifdef FS_44INODEFMT | |
708 | if (dp->di_size > 0 && | |
709 | dp->di_size < sblock->fs_maxsymlinklen) { | |
710 | spcl.c_addr[0] = 1; | |
711 | spcl.c_count = 1; | |
712 | writeheader(ino); | |
713 | memmove(buf, dp->di_shortlink, (u_long)dp->di_size); | |
714 | buf[dp->di_size] = '\0'; | |
715 | writerec(buf, 0); | |
716 | return; | |
717 | } | |
718 | #endif | |
719 | /* fall through */ | |
720 | ||
721 | #ifndef __linux__ | |
722 | case S_IFDIR: | |
723 | #endif | |
724 | case S_IFREG: | |
725 | if (dp->di_size > 0) | |
726 | break; | |
727 | /* fall through */ | |
728 | ||
729 | case S_IFIFO: | |
730 | case S_IFSOCK: | |
731 | case S_IFCHR: | |
732 | case S_IFBLK: | |
733 | writeheader(ino); | |
734 | return; | |
735 | ||
736 | default: | |
737 | msg("Warning: undefined file type 0%o\n", dp->di_mode & IFMT); | |
738 | return; | |
739 | } | |
740 | if (dp->di_size > NDADDR * sblock->fs_bsize) | |
741 | #ifdef __linux__ | |
742 | cnt = NDADDR * EXT2_FRAGS_PER_BLOCK(fs->super); | |
743 | #else | |
744 | cnt = NDADDR * sblock->fs_frag; | |
745 | #endif | |
746 | else | |
747 | cnt = howmany(dp->di_size, sblock->fs_fsize); | |
748 | blksout(&dp->di_db[0], cnt, ino); | |
b45f51d6 | 749 | if ((size = dp->di_size - NDADDR * sblock->fs_bsize) <= 0) |
1227625a SP |
750 | return; |
751 | #ifdef __linux__ | |
752 | bc.max = NINDIR(sblock) * EXT2_FRAGS_PER_BLOCK(fs->super); | |
753 | bc.buf = (int *)malloc (bc.max * sizeof (int)); | |
754 | bc.cnt = 0; | |
755 | bc.ino = ino; | |
756 | bc.next_block = NDADDR; | |
757 | ||
758 | ext2fs_block_iterate (fs, ino, 0, NULL, dumponeblock, (void *)&bc); | |
759 | if (bc.cnt > 0) { | |
760 | blksout (bc.buf, bc.cnt, bc.ino); | |
761 | } | |
7fbb9b02 | 762 | free(bc.buf); |
1227625a SP |
763 | #else |
764 | for (ind_level = 0; ind_level < NIADDR; ind_level++) { | |
765 | dmpindir(ino, dp->di_ib[ind_level], ind_level, &size); | |
766 | if (size <= 0) | |
767 | return; | |
768 | } | |
769 | #endif | |
770 | } | |
771 | ||
772 | #ifdef __linux__ | |
773 | ||
774 | struct convert_dir_context { | |
775 | char *buf; | |
776 | int prev_offset; | |
777 | int offset; | |
778 | int bs; | |
779 | }; | |
780 | ||
781 | /* | |
782 | * This function converts an ext2fs directory entry to the BSD format. | |
783 | * | |
784 | * Basically, it adds a null-character at the end of the name, recomputes the | |
785 | * size of the entry, and creates it in a temporary buffer | |
786 | */ | |
787 | static int | |
ddd2ef55 | 788 | convert_dir(struct ext2_dir_entry *dirent, int offset, int blocksize, char *buf, void *private) |
1227625a SP |
789 | { |
790 | struct convert_dir_context *p; | |
791 | struct direct *dp; | |
792 | int reclen; | |
793 | ||
794 | p = (struct convert_dir_context *)private; | |
795 | ||
c5886bd7 | 796 | reclen = EXT2_DIR_REC_LEN((dirent->name_len & 0xFF) + 1); |
1227625a SP |
797 | if (((p->offset + reclen - 1) / p->bs) != (p->offset / p->bs)) { |
798 | dp = (struct direct *)(p->buf + p->prev_offset); | |
799 | dp->d_reclen += p->bs - (p->offset % p->bs); | |
800 | p->offset += p->bs - (p->offset % p->bs); | |
801 | } | |
802 | ||
803 | dp = (struct direct *)(p->buf + p->offset); | |
804 | dp->d_ino = dirent->inode; | |
805 | dp->d_reclen = reclen; | |
806 | dp->d_type = 0; | |
c5886bd7 SP |
807 | dp->d_namlen = dirent->name_len & 0xFF; |
808 | strncpy(dp->d_name, dirent->name, dp->d_namlen); | |
1227625a SP |
809 | dp->d_name[dp->d_namlen] = '\0'; |
810 | p->prev_offset = p->offset; | |
811 | p->offset += reclen; | |
812 | ||
813 | return 0; | |
814 | } | |
815 | ||
816 | /* | |
817 | * Dump pass 3 | |
818 | * | |
819 | * Dumps a directory to tape after converting it to the BSD format | |
820 | */ | |
821 | void | |
ddd2ef55 | 822 | dumpdirino(struct dinode *dp, ino_t ino) |
1227625a SP |
823 | { |
824 | fsizeT size; | |
825 | char buf[TP_BSIZE]; | |
826 | struct old_bsd_inode obi; | |
827 | struct convert_dir_context cdc; | |
828 | errcode_t retval; | |
829 | struct ext2_dir_entry *de; | |
830 | fsizeT dir_size; | |
831 | ||
832 | if (newtape) { | |
833 | newtape = 0; | |
834 | dumpmap(dumpinomap, TS_BITS, ino); | |
835 | } | |
836 | CLRINO(ino, dumpinomap); | |
837 | ||
838 | /* | |
839 | * Convert the directory to the BSD format | |
840 | */ | |
841 | /* Allocate a buffer for the conversion (twice the size of the | |
842 | ext2fs directory to avoid problems ;-) */ | |
843 | cdc.buf = (char *)malloc(dp->di_size * 2 * sizeof(char)); | |
844 | if (cdc.buf == NULL) | |
ddd2ef55 SP |
845 | err(1, "Cannot allocate buffer to convert directory #%lu\n", |
846 | (unsigned long)ino); | |
1227625a SP |
847 | cdc.offset = 0; |
848 | cdc.prev_offset = 0; | |
849 | cdc.bs = MIN(DIRBLKSIZ, TP_BSIZE); | |
850 | /* Do the conversion */ | |
851 | retval = ext2fs_dir_iterate(fs, ino, 0, NULL, convert_dir, (void *)&cdc); | |
852 | if (retval) { | |
853 | com_err(disk, retval, "while converting directory #%ld\n", ino); | |
854 | exit(X_ABORT); | |
855 | } | |
856 | /* Fix the last entry */ | |
857 | if ((cdc.offset % cdc.bs) != 0) { | |
858 | de = (struct ext2_dir_entry *)(cdc.buf + cdc.prev_offset); | |
859 | de->rec_len += cdc.bs - (cdc.offset % cdc.bs); | |
860 | cdc.offset += cdc.bs - (cdc.offset % cdc.bs); | |
861 | } | |
862 | ||
863 | dir_size = cdc.offset; | |
864 | ||
865 | #ifdef __linux__ | |
866 | memset(&obi, 0, sizeof(obi)); | |
867 | obi.di_mode = dp->di_mode; | |
868 | obi.di_uid = dp->di_uid; | |
869 | obi.di_gid = dp->di_gid; | |
870 | obi.di_qsize.v = dir_size; /* (u_quad_t)dp->di_size; */ | |
871 | obi.di_atime = dp->di_atime; | |
872 | obi.di_mtime = dp->di_mtime; | |
873 | obi.di_ctime = dp->di_ctime; | |
874 | obi.di_nlink = dp->di_nlink; | |
875 | obi.di_blocks = dp->di_blocks; | |
876 | obi.di_flags = dp->di_flags; | |
877 | obi.di_gen = dp->di_gen; | |
878 | memmove(&obi.di_db, &dp->di_db, (NDADDR + NIADDR) * sizeof(daddr_t)); | |
879 | if (dp->di_file_acl || dp->di_dir_acl) | |
ddd2ef55 | 880 | warn("ACLs in inode #%ld won't be dumped", ino); |
1227625a SP |
881 | memmove(&spcl.c_dinode, &obi, sizeof(obi)); |
882 | #else /* __linux__ */ | |
883 | spcl.c_dinode = *dp; | |
884 | #endif /* __linux__ */ | |
885 | spcl.c_type = TS_INODE; | |
886 | spcl.c_count = 0; | |
887 | switch (dp->di_mode & S_IFMT) { | |
888 | ||
889 | case 0: | |
890 | /* | |
891 | * Freed inode. | |
892 | */ | |
893 | return; | |
894 | ||
895 | case S_IFDIR: | |
896 | if (dir_size > 0) | |
897 | break; | |
898 | msg("Warning: size of directory inode #%d is <= 0 (%d)!\n", | |
899 | ino, dir_size); | |
900 | return; | |
901 | ||
902 | default: | |
903 | msg("Warning: dumpdirino called with file type 0%o (inode #%d)\n", | |
904 | dp->di_mode & IFMT, ino); | |
905 | return; | |
906 | } | |
907 | for (size = 0; size < dir_size; size += TP_BSIZE) { | |
908 | spcl.c_addr[0] = 1; | |
909 | spcl.c_count = 1; | |
910 | writeheader(ino); | |
911 | memmove(buf, cdc.buf + size, TP_BSIZE); | |
912 | writerec(buf, 0); | |
913 | spcl.c_type = TS_ADDR; | |
914 | } | |
915 | ||
916 | (void)free(cdc.buf); | |
917 | } | |
918 | #endif /* __linux__ */ | |
919 | ||
920 | #ifndef __linux__ | |
921 | /* | |
922 | * Read indirect blocks, and pass the data blocks to be dumped. | |
923 | */ | |
924 | static void | |
ddd2ef55 | 925 | dmpindir(ino_t ino, daddr_t blk, int ind_level, fsizeT *size) |
1227625a SP |
926 | { |
927 | int i, cnt; | |
b45f51d6 SP |
928 | #ifdef __linux__ |
929 | int max; | |
930 | blk_t *swapme; | |
931 | #endif | |
1227625a SP |
932 | daddr_t idblk[MAXNINDIR]; |
933 | ||
b45f51d6 | 934 | if (blk != 0) { |
1227625a | 935 | bread(fsbtodb(sblock, blk), (char *)idblk, (int) sblock->fs_bsize); |
b45f51d6 SP |
936 | #ifdef __linux__ |
937 | /* | |
938 | * My RedHat 4.0 system doesn't have these flags; I haven't | |
939 | * upgraded e2fsprogs yet | |
940 | */ | |
941 | #if defined(EXT2_FLAG_SWAP_BYTES) | |
942 | if ((fs->flags & EXT2_FLAG_SWAP_BYTES) || | |
943 | (fs->flags & EXT2_FLAG_SWAP_BYTES_READ)) { | |
944 | #endif | |
945 | max = sblock->fs_bsize >> 2; | |
946 | swapme = (blk_t *) idblk; | |
947 | for (i = 0; i < max; i++, swapme++) | |
948 | *swapme = swab32(*swapme); | |
949 | #if defined(EXT2_FLAG_SWAP_BYTES) | |
950 | } | |
951 | #endif | |
952 | #endif | |
1227625a SP |
953 | else |
954 | memset(idblk, 0, (int)sblock->fs_bsize); | |
955 | if (ind_level <= 0) { | |
956 | if (*size < NINDIR(sblock) * sblock->fs_bsize) | |
957 | cnt = howmany(*size, sblock->fs_fsize); | |
958 | else | |
959 | #ifdef __linux__ | |
960 | cnt = NINDIR(sblock) * EXT2_FRAGS_PER_BLOCK(fs->super); | |
961 | #else | |
962 | cnt = NINDIR(sblock) * sblock->fs_frag; | |
963 | #endif | |
964 | *size -= NINDIR(sblock) * sblock->fs_bsize; | |
965 | blksout(&idblk[0], cnt, ino); | |
966 | return; | |
967 | } | |
968 | ind_level--; | |
969 | for (i = 0; i < NINDIR(sblock); i++) { | |
970 | dmpindir(ino, idblk[i], ind_level, size); | |
971 | if (*size <= 0) | |
972 | return; | |
973 | } | |
974 | } | |
975 | #endif | |
976 | ||
977 | /* | |
978 | * Collect up the data into tape record sized buffers and output them. | |
979 | */ | |
980 | void | |
ddd2ef55 | 981 | blksout(daddr_t *blkp, int frags, ino_t ino) |
1227625a SP |
982 | { |
983 | register daddr_t *bp; | |
984 | int i, j, count, blks, tbperdb; | |
985 | ||
986 | blks = howmany(frags * sblock->fs_fsize, TP_BSIZE); | |
987 | tbperdb = sblock->fs_bsize >> tp_bshift; | |
988 | for (i = 0; i < blks; i += TP_NINDIR) { | |
989 | if (i + TP_NINDIR > blks) | |
990 | count = blks; | |
991 | else | |
992 | count = i + TP_NINDIR; | |
993 | for (j = i; j < count; j++) | |
994 | if (blkp[j / tbperdb] != 0) | |
995 | spcl.c_addr[j - i] = 1; | |
996 | else | |
997 | spcl.c_addr[j - i] = 0; | |
998 | spcl.c_count = count - i; | |
999 | writeheader(ino); | |
1000 | bp = &blkp[i / tbperdb]; | |
ddd2ef55 SP |
1001 | for (j = i; j < count; j += tbperdb, bp++) { |
1002 | if (*bp != 0) { | |
1227625a SP |
1003 | if (j + tbperdb <= count) |
1004 | dumpblock(*bp, (int)sblock->fs_bsize); | |
1005 | else | |
1006 | dumpblock(*bp, (count - j) * TP_BSIZE); | |
ddd2ef55 SP |
1007 | } |
1008 | } | |
1227625a SP |
1009 | spcl.c_type = TS_ADDR; |
1010 | } | |
1011 | } | |
1012 | ||
1013 | /* | |
1014 | * Dump a map to the tape. | |
1015 | */ | |
1016 | void | |
ddd2ef55 | 1017 | dumpmap(char *map, int type, ino_t ino) |
1227625a SP |
1018 | { |
1019 | register int i; | |
1020 | char *cp; | |
1021 | ||
1022 | spcl.c_type = type; | |
1023 | spcl.c_count = howmany(mapsize * sizeof(char), TP_BSIZE); | |
1024 | writeheader(ino); | |
1025 | for (i = 0, cp = map; i < spcl.c_count; i++, cp += TP_BSIZE) | |
1026 | writerec(cp, 0); | |
1027 | } | |
1028 | ||
1029 | /* | |
1030 | * Write a header record to the dump tape. | |
1031 | */ | |
1032 | void | |
ddd2ef55 | 1033 | writeheader(ino_t ino) |
1227625a SP |
1034 | { |
1035 | #ifdef __linux__ | |
1036 | register __s32 sum, cnt, *lp; | |
1037 | #else | |
b45f51d6 | 1038 | register int32_t sum, cnt, *lp; |
1227625a SP |
1039 | #endif |
1040 | ||
1041 | spcl.c_inumber = ino; | |
1042 | spcl.c_magic = NFS_MAGIC; | |
1043 | spcl.c_checksum = 0; | |
1044 | #ifdef __linux__ | |
1045 | lp = (__s32 *)&spcl; | |
1046 | #else | |
b45f51d6 | 1047 | lp = (int32_t *)&spcl; |
1227625a SP |
1048 | #endif |
1049 | sum = 0; | |
1050 | #ifdef __linux__ | |
1051 | cnt = sizeof(union u_spcl) / (4 * sizeof(__s32)); | |
1052 | #else | |
b45f51d6 | 1053 | cnt = sizeof(union u_spcl) / (4 * sizeof(int32_t)); |
1227625a SP |
1054 | #endif |
1055 | while (--cnt >= 0) { | |
1056 | sum += *lp++; | |
1057 | sum += *lp++; | |
1058 | sum += *lp++; | |
1059 | sum += *lp++; | |
1060 | } | |
1061 | spcl.c_checksum = CHECKSUM - sum; | |
1062 | writerec((char *)&spcl, 1); | |
1063 | } | |
1064 | ||
1065 | #ifdef __linux__ | |
1066 | struct dinode * | |
ddd2ef55 | 1067 | getino(ino_t inum) |
1227625a SP |
1068 | { |
1069 | static struct dinode dinode; | |
1070 | ||
1071 | curino = inum; | |
1072 | ext2fs_read_inode(fs, inum, (struct ext2_inode *) &dinode); | |
1073 | return &dinode; | |
1074 | } | |
1075 | #else /* __linux__ */ | |
1076 | struct dinode * | |
ddd2ef55 | 1077 | getino(ino_t inum) |
1227625a SP |
1078 | { |
1079 | static daddr_t minino, maxino; | |
1080 | static struct dinode inoblock[MAXINOPB]; | |
1081 | ||
1082 | curino = inum; | |
1083 | if (inum >= minino && inum < maxino) | |
1084 | return (&inoblock[inum - minino]); | |
1085 | bread(fsbtodb(sblock, ino_to_fsba(sblock, inum)), (char *)inoblock, | |
1086 | (int)sblock->fs_bsize); | |
1087 | minino = inum - (inum % INOPB(sblock)); | |
1088 | maxino = minino + INOPB(sblock); | |
1089 | return (&inoblock[inum - minino]); | |
1090 | } | |
1091 | #endif /* __linux__ */ | |
1092 | ||
1093 | /* | |
1094 | * Read a chunk of data from the disk. | |
1095 | * Try to recover from hard errors by reading in sector sized pieces. | |
1096 | * Error recovery is attempted at most BREADEMAX times before seeking | |
1097 | * consent from the operator to continue. | |
1098 | */ | |
b45f51d6 | 1099 | int breaderrors = 0; |
1227625a SP |
1100 | #define BREADEMAX 32 |
1101 | ||
1102 | void | |
ddd2ef55 | 1103 | bread(daddr_t blkno, char *buf, int size) |
1227625a SP |
1104 | { |
1105 | int cnt, i; | |
1106 | extern int errno; | |
1107 | ||
1108 | loop: | |
1109 | #ifdef __linux__ | |
f34aca37 SP |
1110 | if (ext2fs_llseek(diskfd, (((ext2_loff_t)blkno) << dev_bshift), 0) != |
1111 | (((ext2_loff_t)blkno) << dev_bshift)) | |
1227625a | 1112 | #else |
b45f51d6 SP |
1113 | if (lseek(diskfd, ((off_t)blkno << dev_bshift), 0) != |
1114 | ((off_t)blkno << dev_bshift)) | |
1227625a SP |
1115 | #endif |
1116 | msg("bread: lseek fails\n"); | |
1117 | if ((cnt = read(diskfd, buf, size)) == size) | |
1118 | return; | |
1119 | if (blkno + (size / dev_bsize) > fsbtodb(sblock, sblock->fs_size)) { | |
1120 | /* | |
1121 | * Trying to read the final fragment. | |
1122 | * | |
1123 | * NB - dump only works in TP_BSIZE blocks, hence | |
1124 | * rounds `dev_bsize' fragments up to TP_BSIZE pieces. | |
1125 | * It should be smarter about not actually trying to | |
1126 | * read more than it can get, but for the time being | |
1127 | * we punt and scale back the read only when it gets | |
1128 | * us into trouble. (mkm 9/25/83) | |
1129 | */ | |
1130 | size -= dev_bsize; | |
1131 | goto loop; | |
1132 | } | |
1133 | if (cnt == -1) | |
1134 | msg("read error from %s: %s: [block %d]: count=%d\n", | |
1135 | disk, strerror(errno), blkno, size); | |
1136 | else | |
1137 | msg("short read error from %s: [block %d]: count=%d, got=%d\n", | |
1138 | disk, blkno, size, cnt); | |
1139 | if (++breaderrors > BREADEMAX) { | |
1140 | msg("More than %d block read errors from %d\n", | |
1141 | BREADEMAX, disk); | |
1142 | broadcast("DUMP IS AILING!\n"); | |
1143 | msg("This is an unrecoverable error.\n"); | |
1144 | if (!query("Do you want to attempt to continue?")){ | |
1145 | dumpabort(0); | |
1146 | /*NOTREACHED*/ | |
1147 | } else | |
1148 | breaderrors = 0; | |
1149 | } | |
1150 | /* | |
1151 | * Zero buffer, then try to read each sector of buffer separately. | |
1152 | */ | |
1153 | memset(buf, 0, size); | |
1154 | for (i = 0; i < size; i += dev_bsize, buf += dev_bsize, blkno++) { | |
1155 | #ifdef __linux__ | |
f34aca37 SP |
1156 | if (ext2fs_llseek(diskfd, (((ext2_loff_t)blkno) << dev_bshift), 0) != |
1157 | (((ext2_loff_t)blkno) << dev_bshift)) | |
1227625a | 1158 | #else |
b45f51d6 SP |
1159 | if (lseek(diskfd, ((off_t)blkno << dev_bshift), 0) != |
1160 | ((off_t)blkno << dev_bshift)) | |
1227625a SP |
1161 | #endif |
1162 | msg("bread: lseek2 fails!\n"); | |
1163 | if ((cnt = read(diskfd, buf, (int)dev_bsize)) == dev_bsize) | |
1164 | continue; | |
1165 | if (cnt == -1) { | |
1166 | msg("read error from %s: %s: [sector %d]: count=%d\n", | |
1167 | disk, strerror(errno), blkno, dev_bsize); | |
1168 | continue; | |
1169 | } | |
1170 | msg("short read error from %s: [sector %d]: count=%d, got=%d\n", | |
1171 | disk, blkno, dev_bsize, cnt); | |
1172 | } | |
1173 | } |