traverse.c revision 1.42 1 1.42 agc /* $NetBSD: traverse.c,v 1.42 2003/08/07 10:04:14 agc Exp $ */
2 1.9 cgd
3 1.1 cgd /*-
4 1.4 mycroft * Copyright (c) 1980, 1988, 1991, 1993
5 1.4 mycroft * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.42 agc * 3. Neither the name of the University nor the names of its contributors
16 1.1 cgd * may be used to endorse or promote products derived from this software
17 1.1 cgd * without specific prior written permission.
18 1.1 cgd *
19 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.1 cgd * SUCH DAMAGE.
30 1.1 cgd */
31 1.1 cgd
32 1.18 lukem #include <sys/cdefs.h>
33 1.1 cgd #ifndef lint
34 1.9 cgd #if 0
35 1.19 lukem static char sccsid[] = "@(#)traverse.c 8.7 (Berkeley) 6/15/95";
36 1.9 cgd #else
37 1.42 agc __RCSID("$NetBSD: traverse.c,v 1.42 2003/08/07 10:04:14 agc Exp $");
38 1.9 cgd #endif
39 1.1 cgd #endif /* not lint */
40 1.1 cgd
41 1.4 mycroft #include <sys/param.h>
42 1.4 mycroft #include <sys/time.h>
43 1.4 mycroft #include <sys/stat.h>
44 1.4 mycroft #include <ufs/ufs/dir.h>
45 1.4 mycroft #include <ufs/ufs/dinode.h>
46 1.19 lukem #include <ufs/ffs/fs.h>
47 1.20 bouyer #include <ufs/ffs/ffs_extern.h>
48 1.4 mycroft
49 1.1 cgd #include <protocols/dumprestore.h>
50 1.4 mycroft
51 1.4 mycroft #include <ctype.h>
52 1.17 lukem #include <errno.h>
53 1.17 lukem #include <fts.h>
54 1.4 mycroft #include <stdio.h>
55 1.37 fvdl #include <stdlib.h>
56 1.4 mycroft #include <string.h>
57 1.1 cgd #include <unistd.h>
58 1.4 mycroft
59 1.1 cgd #include "dump.h"
60 1.1 cgd
61 1.1 cgd #define HASDUMPEDFILE 0x1
62 1.1 cgd #define HASSUBDIRS 0x2
63 1.1 cgd
64 1.37 fvdl static int dirindir(ino_t, daddr_t, int, off_t *, u_int64_t *, int);
65 1.37 fvdl static void dmpindir(ino_t, daddr_t, int, off_t *);
66 1.37 fvdl static int searchdir(ino_t, daddr_t, long, off_t, u_int64_t *, int);
67 1.4 mycroft
68 1.1 cgd /*
69 1.1 cgd * This is an estimation of the number of TP_BSIZE blocks in the file.
70 1.1 cgd * It estimates the number of blocks in files with holes by assuming
71 1.1 cgd * that all of the blocks accounted for by di_blocks are data blocks
72 1.1 cgd * (when some of the blocks are usually used for indirect pointers);
73 1.1 cgd * hence the estimate may be high.
74 1.1 cgd */
75 1.37 fvdl int64_t
76 1.37 fvdl blockest(union dinode *dp)
77 1.1 cgd {
78 1.37 fvdl int64_t blkest, sizeest;
79 1.1 cgd
80 1.1 cgd /*
81 1.1 cgd * dp->di_size is the size of the file in bytes.
82 1.1 cgd * dp->di_blocks stores the number of sectors actually in the file.
83 1.1 cgd * If there are more sectors than the size would indicate, this just
84 1.1 cgd * means that there are indirect blocks in the file or unused
85 1.1 cgd * sectors in the last file block; we can safely ignore these
86 1.1 cgd * (blkest = sizeest below).
87 1.1 cgd * If the file is bigger than the number of sectors would indicate,
88 1.1 cgd * then the file has holes in it. In this case we must use the
89 1.1 cgd * block count to estimate the number of data blocks used, but
90 1.1 cgd * we use the actual size for estimating the number of indirect
91 1.1 cgd * dump blocks (sizeest vs. blkest in the indirect block
92 1.1 cgd * calculation).
93 1.1 cgd */
94 1.37 fvdl blkest = howmany(dbtob((u_int64_t)DIP(dp, blocks)), TP_BSIZE);
95 1.37 fvdl sizeest = howmany(DIP(dp, size), TP_BSIZE);
96 1.1 cgd if (blkest > sizeest)
97 1.1 cgd blkest = sizeest;
98 1.37 fvdl if (DIP(dp, size) > ufsib->ufs_bsize * NDADDR) {
99 1.1 cgd /* calculate the number of indirect blocks on the dump tape */
100 1.1 cgd blkest +=
101 1.28 perseant howmany(sizeest - NDADDR * ufsib->ufs_bsize / TP_BSIZE,
102 1.1 cgd TP_NINDIR);
103 1.1 cgd }
104 1.1 cgd return (blkest + 1);
105 1.1 cgd }
106 1.1 cgd
107 1.4 mycroft /* Auxiliary macro to pick up files changed since previous dump. */
108 1.4 mycroft #define CHANGEDSINCE(dp, t) \
109 1.37 fvdl (DIP((dp), mtime) >= (t) || DIP((dp), ctime) >= (t))
110 1.4 mycroft
111 1.4 mycroft /* The WANTTODUMP macro decides whether a file should be dumped. */
112 1.4 mycroft #ifdef UF_NODUMP
113 1.4 mycroft #define WANTTODUMP(dp) \
114 1.37 fvdl (CHANGEDSINCE(dp, iswap64(spcl.c_ddate)) && \
115 1.37 fvdl (nonodump || (DIP((dp), flags) & UF_NODUMP) != UF_NODUMP))
116 1.4 mycroft #else
117 1.37 fvdl #define WANTTODUMP(dp) CHANGEDSINCE(dp, iswap64(spcl.c_ddate))
118 1.4 mycroft #endif
119 1.4 mycroft
120 1.1 cgd /*
121 1.17 lukem * Determine if given inode should be dumped
122 1.17 lukem */
123 1.17 lukem void
124 1.37 fvdl mapfileino(ino_t ino, u_int64_t *tape_size, int *dirskipped)
125 1.17 lukem {
126 1.17 lukem int mode;
127 1.37 fvdl union dinode *dp;
128 1.17 lukem
129 1.22 lukem /*
130 1.22 lukem * Skip inode if we've already marked it for dumping
131 1.22 lukem */
132 1.22 lukem if (TSTINO(ino, usedinomap))
133 1.22 lukem return;
134 1.17 lukem dp = getino(ino);
135 1.37 fvdl if ((mode = (DIP(dp, mode) & IFMT)) == 0)
136 1.17 lukem return;
137 1.23 bouyer /*
138 1.23 bouyer * Put all dirs in dumpdirmap, inodes that are to be dumped in the
139 1.23 bouyer * used map. All inode but dirs who have the nodump attribute go
140 1.23 bouyer * to the usedinomap.
141 1.23 bouyer */
142 1.17 lukem SETINO(ino, usedinomap);
143 1.17 lukem if (mode == IFDIR)
144 1.17 lukem SETINO(ino, dumpdirmap);
145 1.17 lukem if (WANTTODUMP(dp)) {
146 1.17 lukem SETINO(ino, dumpinomap);
147 1.17 lukem if (mode != IFREG && mode != IFDIR && mode != IFLNK)
148 1.33 lukem *tape_size += 1;
149 1.17 lukem else
150 1.33 lukem *tape_size += blockest(dp);
151 1.17 lukem return;
152 1.17 lukem }
153 1.23 bouyer if (mode == IFDIR) {
154 1.23 bouyer #ifdef UF_NODUMP
155 1.37 fvdl if (!nonodump && (DIP(dp, flags) & UF_NODUMP))
156 1.23 bouyer CLRINO(ino, usedinomap);
157 1.23 bouyer #endif
158 1.17 lukem *dirskipped = 1;
159 1.23 bouyer }
160 1.17 lukem }
161 1.17 lukem
162 1.17 lukem /*
163 1.1 cgd * Dump pass 1.
164 1.1 cgd *
165 1.32 lukem * Walk the inode list for a file system to find all allocated inodes
166 1.1 cgd * that have been modified since the previous dump time. Also, find all
167 1.32 lukem * the directories in the file system.
168 1.31 lukem * disk may be NULL if dirv is NULL.
169 1.1 cgd */
170 1.4 mycroft int
171 1.37 fvdl mapfiles(ino_t maxino, u_int64_t *tape_size, char *diskname, char * const *dirv)
172 1.1 cgd {
173 1.1 cgd int anydirskipped = 0;
174 1.1 cgd
175 1.17 lukem if (dirv != NULL) {
176 1.17 lukem char curdir[MAXPATHLEN];
177 1.17 lukem FTS *dirh;
178 1.17 lukem FTSENT *entry;
179 1.17 lukem int d;
180 1.17 lukem
181 1.17 lukem if (getcwd(curdir, sizeof(curdir)) == NULL) {
182 1.17 lukem msg("Can't determine cwd: %s\n", strerror(errno));
183 1.17 lukem dumpabort(0);
184 1.17 lukem }
185 1.17 lukem if ((dirh = fts_open(dirv, FTS_PHYSICAL|FTS_SEEDOT|FTS_XDEV,
186 1.18 lukem NULL)) == NULL) {
187 1.17 lukem msg("fts_open failed: %s\n", strerror(errno));
188 1.17 lukem dumpabort(0);
189 1.17 lukem }
190 1.17 lukem while ((entry = fts_read(dirh)) != NULL) {
191 1.17 lukem switch (entry->fts_info) {
192 1.17 lukem case FTS_DNR: /* an error */
193 1.17 lukem case FTS_ERR:
194 1.17 lukem case FTS_NS:
195 1.17 lukem msg("Can't fts_read %s: %s\n", entry->fts_path,
196 1.17 lukem strerror(errno));
197 1.17 lukem case FTS_DP: /* already seen dir */
198 1.17 lukem continue;
199 1.17 lukem }
200 1.33 lukem mapfileino(entry->fts_statp->st_ino, tape_size,
201 1.17 lukem &anydirskipped);
202 1.17 lukem }
203 1.17 lukem (void)fts_close(dirh);
204 1.17 lukem
205 1.17 lukem /*
206 1.17 lukem * Add any parent directories
207 1.17 lukem */
208 1.17 lukem for (d = 0 ; dirv[d] != NULL ; d++) {
209 1.17 lukem char path[MAXPATHLEN];
210 1.17 lukem
211 1.17 lukem if (dirv[d][0] != '/')
212 1.17 lukem (void)snprintf(path, sizeof(path), "%s/%s",
213 1.17 lukem curdir, dirv[d]);
214 1.4 mycroft else
215 1.17 lukem (void)snprintf(path, sizeof(path), "%s",
216 1.17 lukem dirv[d]);
217 1.33 lukem while (strcmp(path, diskname) != 0) {
218 1.17 lukem char *p;
219 1.17 lukem struct stat sb;
220 1.17 lukem
221 1.17 lukem if (*path == '\0')
222 1.17 lukem break;
223 1.17 lukem if ((p = strrchr(path, '/')) == NULL)
224 1.17 lukem break;
225 1.17 lukem if (p == path)
226 1.17 lukem break;
227 1.17 lukem *p = '\0';
228 1.17 lukem if (stat(path, &sb) == -1) {
229 1.17 lukem msg("Can't stat %s: %s\n", path,
230 1.17 lukem strerror(errno));
231 1.17 lukem break;
232 1.17 lukem }
233 1.33 lukem mapfileino(sb.st_ino, tape_size, &anydirskipped);
234 1.17 lukem }
235 1.17 lukem }
236 1.17 lukem
237 1.17 lukem /*
238 1.17 lukem * Ensure that the root inode actually appears in the
239 1.17 lukem * file list for a subdir
240 1.17 lukem */
241 1.33 lukem mapfileino(ROOTINO, tape_size, &anydirskipped);
242 1.17 lukem } else {
243 1.37 fvdl fs_mapinodes(maxino, tape_size, &anydirskipped);
244 1.1 cgd }
245 1.1 cgd /*
246 1.1 cgd * Restore gets very upset if the root is not dumped,
247 1.1 cgd * so ensure that it always is dumped.
248 1.1 cgd */
249 1.1 cgd SETINO(ROOTINO, dumpinomap);
250 1.1 cgd return (anydirskipped);
251 1.1 cgd }
252 1.1 cgd
253 1.1 cgd /*
254 1.1 cgd * Dump pass 2.
255 1.1 cgd *
256 1.32 lukem * Scan each directory on the file system to see if it has any modified
257 1.1 cgd * files in it. If it does, and has not already been added to the dump
258 1.1 cgd * list (because it was itself modified), then add it. If a directory
259 1.1 cgd * has not been modified itself, contains no modified files and has no
260 1.1 cgd * subdirectories, then it can be deleted from the dump list and from
261 1.1 cgd * the list of directories. By deleting it from the list of directories,
262 1.1 cgd * its parent may now qualify for the same treatment on this or a later
263 1.1 cgd * pass using this algorithm.
264 1.1 cgd */
265 1.4 mycroft int
266 1.37 fvdl mapdirs(ino_t maxino, u_int64_t *tape_size)
267 1.1 cgd {
268 1.37 fvdl union dinode *dp, di;
269 1.23 bouyer int i, isdir, nodump;
270 1.16 lukem char *map;
271 1.16 lukem ino_t ino;
272 1.37 fvdl off_t filesize;
273 1.1 cgd int ret, change = 0;
274 1.37 fvdl daddr_t blk;
275 1.1 cgd
276 1.4 mycroft isdir = 0; /* XXX just to get gcc to shut up */
277 1.4 mycroft for (map = dumpdirmap, ino = 1; ino < maxino; ino++) {
278 1.4 mycroft if (((ino - 1) % NBBY) == 0) /* map is offset by 1 */
279 1.1 cgd isdir = *map++;
280 1.1 cgd else
281 1.1 cgd isdir >>= 1;
282 1.23 bouyer /*
283 1.23 bouyer * If dir has been removed from the used map, it's either
284 1.38 fvdl * because it had the nodump flag, or it inherited it from
285 1.23 bouyer * its parent. A directory can't be in dumpinomap if
286 1.23 bouyer * not in usedinomap, but we have to go throuh it anyway
287 1.23 bouyer * to propagate the nodump attribute.
288 1.23 bouyer */
289 1.23 bouyer nodump = (TSTINO(ino, usedinomap) == 0);
290 1.23 bouyer if ((isdir & 1) == 0 ||
291 1.23 bouyer (TSTINO(ino, dumpinomap) && nodump == 0))
292 1.1 cgd continue;
293 1.23 bouyer
294 1.1 cgd dp = getino(ino);
295 1.37 fvdl /*
296 1.37 fvdl * inode buf may be changed in searchdir().
297 1.37 fvdl */
298 1.37 fvdl if (is_ufs2)
299 1.37 fvdl di.dp2 = dp->dp2;
300 1.37 fvdl else
301 1.37 fvdl di.dp1 = dp->dp1;
302 1.37 fvdl filesize = DIP(&di, size);
303 1.1 cgd for (ret = 0, i = 0; filesize > 0 && i < NDADDR; i++) {
304 1.37 fvdl if (is_ufs2)
305 1.37 fvdl blk = iswap64(di.dp2.di_db[i]);
306 1.37 fvdl else
307 1.37 fvdl blk = iswap32(di.dp1.di_db[i]);
308 1.37 fvdl if (blk != 0)
309 1.37 fvdl ret |= searchdir(ino, blk,
310 1.28 perseant (long)ufs_dblksize(ufsib, &di, i),
311 1.33 lukem filesize, tape_size, nodump);
312 1.1 cgd if (ret & HASDUMPEDFILE)
313 1.1 cgd filesize = 0;
314 1.1 cgd else
315 1.28 perseant filesize -= ufsib->ufs_bsize;
316 1.1 cgd }
317 1.1 cgd for (i = 0; filesize > 0 && i < NIADDR; i++) {
318 1.37 fvdl if (is_ufs2)
319 1.37 fvdl blk = iswap64(di.dp2.di_ib[i]);
320 1.37 fvdl else
321 1.40 fvdl blk = iswap32(di.dp1.di_ib[i]);
322 1.37 fvdl if (blk == 0)
323 1.1 cgd continue;
324 1.37 fvdl ret |= dirindir(ino, blk, i, &filesize,
325 1.33 lukem tape_size, nodump);
326 1.1 cgd }
327 1.1 cgd if (ret & HASDUMPEDFILE) {
328 1.1 cgd SETINO(ino, dumpinomap);
329 1.33 lukem *tape_size += blockest(&di);
330 1.1 cgd change = 1;
331 1.1 cgd continue;
332 1.1 cgd }
333 1.23 bouyer if (nodump) {
334 1.23 bouyer if (ret & HASSUBDIRS)
335 1.23 bouyer change = 1; /* subdirs have inherited nodump */
336 1.23 bouyer CLRINO(ino, dumpdirmap);
337 1.23 bouyer } else if ((ret & HASSUBDIRS) == 0) {
338 1.1 cgd if (!TSTINO(ino, dumpinomap)) {
339 1.1 cgd CLRINO(ino, dumpdirmap);
340 1.1 cgd change = 1;
341 1.1 cgd }
342 1.1 cgd }
343 1.1 cgd }
344 1.1 cgd return (change);
345 1.1 cgd }
346 1.1 cgd
347 1.1 cgd /*
348 1.1 cgd * Read indirect blocks, and pass the data blocks to be searched
349 1.1 cgd * as directories. Quit as soon as any entry is found that will
350 1.1 cgd * require the directory to be dumped.
351 1.1 cgd */
352 1.4 mycroft static int
353 1.37 fvdl dirindir(ino_t ino, daddr_t blkno, int ind_level, off_t *filesize,
354 1.37 fvdl u_int64_t *tape_size, int nodump)
355 1.1 cgd {
356 1.1 cgd int ret = 0;
357 1.16 lukem int i;
358 1.37 fvdl union {
359 1.37 fvdl int64_t i64[MAXBSIZE / sizeof (int64_t)];
360 1.37 fvdl int32_t i32[MAXBSIZE / sizeof (int32_t)];
361 1.37 fvdl } idblk;
362 1.1 cgd
363 1.37 fvdl bread(fsatoda(ufsib, blkno), (char *)&idblk, (int)ufsib->ufs_bsize);
364 1.1 cgd if (ind_level <= 0) {
365 1.28 perseant for (i = 0; *filesize > 0 && i < ufsib->ufs_nindir; i++) {
366 1.37 fvdl if (is_ufs2)
367 1.41 fvdl blkno = iswap64(idblk.i64[i]);
368 1.37 fvdl else
369 1.41 fvdl blkno = iswap32(idblk.i32[i]);
370 1.1 cgd if (blkno != 0)
371 1.41 fvdl ret |= searchdir(ino, blkno,
372 1.28 perseant ufsib->ufs_bsize, *filesize,
373 1.33 lukem tape_size, nodump);
374 1.1 cgd if (ret & HASDUMPEDFILE)
375 1.1 cgd *filesize = 0;
376 1.1 cgd else
377 1.28 perseant *filesize -= ufsib->ufs_bsize;
378 1.1 cgd }
379 1.1 cgd return (ret);
380 1.1 cgd }
381 1.1 cgd ind_level--;
382 1.28 perseant for (i = 0; *filesize > 0 && i < ufsib->ufs_nindir; i++) {
383 1.37 fvdl if (is_ufs2)
384 1.41 fvdl blkno = iswap64(idblk.i64[i]);
385 1.37 fvdl else
386 1.41 fvdl blkno = iswap32(idblk.i32[i]);
387 1.1 cgd if (blkno != 0)
388 1.23 bouyer ret |= dirindir(ino, blkno, ind_level, filesize,
389 1.33 lukem tape_size, nodump);
390 1.1 cgd }
391 1.1 cgd return (ret);
392 1.1 cgd }
393 1.1 cgd
394 1.1 cgd /*
395 1.1 cgd * Scan a disk block containing directory information looking to see if
396 1.1 cgd * any of the entries are on the dump list and to see if the directory
397 1.1 cgd * contains any subdirectories.
398 1.1 cgd */
399 1.4 mycroft static int
400 1.37 fvdl searchdir(ino_t dino, daddr_t blkno, long size, off_t filesize,
401 1.37 fvdl u_int64_t *tape_size, int nodump)
402 1.1 cgd {
403 1.16 lukem struct direct *dp;
404 1.37 fvdl union dinode *ip;
405 1.16 lukem long loc, ret = 0;
406 1.39 fvdl char *dblk;
407 1.23 bouyer ino_t ino;
408 1.1 cgd
409 1.39 fvdl dblk = malloc(size);
410 1.39 fvdl if (dblk == NULL)
411 1.39 fvdl quit("searchdir: cannot allocate directory memory.\n");
412 1.28 perseant bread(fsatoda(ufsib, blkno), dblk, (int)size);
413 1.1 cgd if (filesize < size)
414 1.1 cgd size = filesize;
415 1.1 cgd for (loc = 0; loc < size; ) {
416 1.1 cgd dp = (struct direct *)(dblk + loc);
417 1.1 cgd if (dp->d_reclen == 0) {
418 1.23 bouyer msg("corrupted directory, inumber %d\n", dino);
419 1.1 cgd break;
420 1.1 cgd }
421 1.20 bouyer loc += iswap16(dp->d_reclen);
422 1.1 cgd if (dp->d_ino == 0)
423 1.1 cgd continue;
424 1.1 cgd if (dp->d_name[0] == '.') {
425 1.1 cgd if (dp->d_name[1] == '\0')
426 1.1 cgd continue;
427 1.1 cgd if (dp->d_name[1] == '.' && dp->d_name[2] == '\0')
428 1.1 cgd continue;
429 1.1 cgd }
430 1.23 bouyer ino = iswap32(dp->d_ino);
431 1.23 bouyer if (nodump) {
432 1.23 bouyer ip = getino(ino);
433 1.23 bouyer if (TSTINO(ino, dumpinomap)) {
434 1.23 bouyer CLRINO(ino, dumpinomap);
435 1.33 lukem *tape_size -= blockest(ip);
436 1.23 bouyer }
437 1.35 lukem /*
438 1.35 lukem * Add back to dumpdirmap and remove from usedinomap
439 1.35 lukem * to propagate nodump.
440 1.35 lukem */
441 1.37 fvdl if ((DIP(ip, mode) & IFMT) == IFDIR) {
442 1.23 bouyer SETINO(ino, dumpdirmap);
443 1.35 lukem CLRINO(ino, usedinomap);
444 1.23 bouyer ret |= HASSUBDIRS;
445 1.23 bouyer }
446 1.23 bouyer } else {
447 1.23 bouyer if (TSTINO(ino, dumpinomap)) {
448 1.23 bouyer ret |= HASDUMPEDFILE;
449 1.23 bouyer if (ret & HASSUBDIRS)
450 1.23 bouyer break;
451 1.23 bouyer }
452 1.23 bouyer if (TSTINO(ino, dumpdirmap)) {
453 1.23 bouyer ret |= HASSUBDIRS;
454 1.23 bouyer if (ret & HASDUMPEDFILE)
455 1.23 bouyer break;
456 1.23 bouyer }
457 1.1 cgd }
458 1.1 cgd }
459 1.39 fvdl free(dblk);
460 1.1 cgd return (ret);
461 1.1 cgd }
462 1.1 cgd
463 1.1 cgd /*
464 1.1 cgd * Dump passes 3 and 4.
465 1.1 cgd *
466 1.1 cgd * Dump the contents of an inode to tape.
467 1.1 cgd */
468 1.1 cgd void
469 1.37 fvdl dumpino(union dinode *dp, ino_t ino)
470 1.1 cgd {
471 1.1 cgd int ind_level, cnt;
472 1.37 fvdl off_t size;
473 1.1 cgd char buf[TP_BSIZE];
474 1.37 fvdl daddr_t blk;
475 1.37 fvdl void *shortlink;
476 1.1 cgd
477 1.1 cgd if (newtape) {
478 1.1 cgd newtape = 0;
479 1.1 cgd dumpmap(dumpinomap, TS_BITS, ino);
480 1.1 cgd }
481 1.1 cgd CLRINO(ino, dumpinomap);
482 1.37 fvdl if (!is_ufs2) {
483 1.37 fvdl if (needswap)
484 1.37 fvdl ffs_dinode1_swap(&dp->dp1, &spcl.c_dinode);
485 1.37 fvdl else
486 1.37 fvdl spcl.c_dinode = dp->dp1;
487 1.37 fvdl } else {
488 1.37 fvdl if (needswap)
489 1.37 fvdl ffs_dinode2_swap(&dp->dp2, &dp->dp2);
490 1.37 fvdl spcl.c_mode = dp->dp2.di_mode;
491 1.37 fvdl spcl.c_size = dp->dp2.di_size;
492 1.37 fvdl spcl.c_atime = dp->dp2.di_atime;
493 1.37 fvdl spcl.c_atimensec = dp->dp2.di_atimensec;
494 1.37 fvdl spcl.c_mtime = dp->dp2.di_mtime;
495 1.37 fvdl spcl.c_mtimensec = dp->dp2.di_mtimensec;
496 1.37 fvdl spcl.c_birthtime = dp->dp2.di_birthtime;
497 1.37 fvdl spcl.c_birthtimensec = dp->dp2.di_birthnsec;
498 1.37 fvdl spcl.c_rdev = dp->dp2.di_rdev;
499 1.37 fvdl spcl.c_file_flags = dp->dp2.di_flags;
500 1.37 fvdl spcl.c_uid = dp->dp2.di_uid;
501 1.37 fvdl spcl.c_gid = dp->dp2.di_gid;
502 1.37 fvdl }
503 1.20 bouyer spcl.c_type = iswap32(TS_INODE);
504 1.1 cgd spcl.c_count = 0;
505 1.37 fvdl switch (DIP(dp, mode) & IFMT) {
506 1.1 cgd
507 1.4 mycroft case 0:
508 1.1 cgd /*
509 1.1 cgd * Freed inode.
510 1.1 cgd */
511 1.1 cgd return;
512 1.1 cgd
513 1.8 mycroft case IFLNK:
514 1.1 cgd /*
515 1.1 cgd * Check for short symbolic link.
516 1.1 cgd */
517 1.37 fvdl if (DIP(dp, size) > 0 &&
518 1.4 mycroft #ifdef FS_44INODEFMT
519 1.37 fvdl (DIP(dp, size) < ufsib->ufs_maxsymlinklen ||
520 1.37 fvdl (ufsib->ufs_maxsymlinklen == 0 && DIP(dp, blocks) == 0))
521 1.5 mycroft #else
522 1.37 fvdl DIP(dp, blocks) == 0
523 1.5 mycroft #endif
524 1.29 lukem ) {
525 1.1 cgd spcl.c_addr[0] = 1;
526 1.20 bouyer spcl.c_count = iswap32(1);
527 1.1 cgd writeheader(ino);
528 1.37 fvdl if (is_ufs2)
529 1.37 fvdl shortlink = dp->dp2.di_db;
530 1.37 fvdl else
531 1.37 fvdl shortlink = dp->dp1.di_db;
532 1.37 fvdl memmove(buf, shortlink, DIP(dp, size));
533 1.37 fvdl buf[DIP(dp, size)] = '\0';
534 1.1 cgd writerec(buf, 0);
535 1.1 cgd return;
536 1.1 cgd }
537 1.1 cgd /* fall through */
538 1.1 cgd
539 1.8 mycroft case IFDIR:
540 1.8 mycroft case IFREG:
541 1.37 fvdl if (DIP(dp, size) > 0)
542 1.1 cgd break;
543 1.1 cgd /* fall through */
544 1.1 cgd
545 1.8 mycroft case IFIFO:
546 1.8 mycroft case IFSOCK:
547 1.8 mycroft case IFCHR:
548 1.8 mycroft case IFBLK:
549 1.1 cgd writeheader(ino);
550 1.1 cgd return;
551 1.1 cgd
552 1.1 cgd default:
553 1.37 fvdl msg("Warning: undefined file type 0%o\n", DIP(dp, mode) & IFMT);
554 1.1 cgd return;
555 1.1 cgd }
556 1.37 fvdl if (DIP(dp, size) > NDADDR * ufsib->ufs_bsize)
557 1.28 perseant cnt = NDADDR * ufsib->ufs_frag;
558 1.1 cgd else
559 1.37 fvdl cnt = howmany(DIP(dp, size), ufsib->ufs_fsize);
560 1.37 fvdl if (is_ufs2)
561 1.37 fvdl blksout64(&dp->dp2.di_db[0], cnt, ino);
562 1.37 fvdl else
563 1.37 fvdl blksout32(&dp->dp1.di_db[0], cnt, ino);
564 1.37 fvdl
565 1.37 fvdl if ((size = DIP(dp, size) - NDADDR * ufsib->ufs_bsize) <= 0)
566 1.1 cgd return;
567 1.1 cgd for (ind_level = 0; ind_level < NIADDR; ind_level++) {
568 1.37 fvdl if (is_ufs2)
569 1.37 fvdl blk = iswap64(dp->dp2.di_ib[ind_level]);
570 1.37 fvdl else
571 1.37 fvdl blk = iswap32(dp->dp1.di_ib[ind_level]);
572 1.37 fvdl dmpindir(ino, blk, ind_level, &size);
573 1.1 cgd if (size <= 0)
574 1.1 cgd return;
575 1.1 cgd }
576 1.1 cgd }
577 1.1 cgd
578 1.1 cgd /*
579 1.1 cgd * Read indirect blocks, and pass the data blocks to be dumped.
580 1.1 cgd */
581 1.4 mycroft static void
582 1.37 fvdl dmpindir(ino_t ino, daddr_t blk, int ind_level, off_t *size)
583 1.1 cgd {
584 1.1 cgd int i, cnt;
585 1.37 fvdl union {
586 1.37 fvdl int32_t i32[MAXBSIZE / sizeof (int32_t)];
587 1.37 fvdl int64_t i64[MAXBSIZE / sizeof (int64_t)];
588 1.37 fvdl } idblk;
589 1.37 fvdl daddr_t iblk;
590 1.37 fvdl
591 1.1 cgd
592 1.1 cgd if (blk != 0)
593 1.37 fvdl bread(fsatoda(ufsib, blk), (char *)&idblk,
594 1.28 perseant (int) ufsib->ufs_bsize);
595 1.1 cgd else
596 1.37 fvdl memset(&idblk, 0, (int)ufsib->ufs_bsize);
597 1.1 cgd if (ind_level <= 0) {
598 1.28 perseant if (*size < ufsib->ufs_nindir * ufsib->ufs_bsize)
599 1.28 perseant cnt = howmany(*size, ufsib->ufs_fsize);
600 1.1 cgd else
601 1.28 perseant cnt = ufsib->ufs_nindir * ufsib->ufs_frag;
602 1.28 perseant *size -= ufsib->ufs_nindir * ufsib->ufs_bsize;
603 1.37 fvdl if (is_ufs2)
604 1.37 fvdl blksout64(&idblk.i64[0], cnt, ino);
605 1.37 fvdl else
606 1.37 fvdl blksout32(&idblk.i32[0], cnt, ino);
607 1.1 cgd return;
608 1.1 cgd }
609 1.1 cgd ind_level--;
610 1.28 perseant for (i = 0; i < ufsib->ufs_nindir; i++) {
611 1.37 fvdl if (is_ufs2)
612 1.37 fvdl iblk = iswap64(idblk.i64[i]);
613 1.37 fvdl else
614 1.37 fvdl iblk = iswap32(idblk.i32[i]);
615 1.37 fvdl dmpindir(ino, iblk, ind_level, size);
616 1.1 cgd if (*size <= 0)
617 1.1 cgd return;
618 1.1 cgd }
619 1.1 cgd }
620 1.1 cgd
621 1.1 cgd /*
622 1.1 cgd * Collect up the data into tape record sized buffers and output them.
623 1.1 cgd */
624 1.1 cgd void
625 1.37 fvdl blksout32(int32_t *blkp, int frags, ino_t ino)
626 1.1 cgd {
627 1.36 fvdl int32_t *bp;
628 1.1 cgd int i, j, count, blks, tbperdb;
629 1.1 cgd
630 1.28 perseant blks = howmany(frags * ufsib->ufs_fsize, TP_BSIZE);
631 1.28 perseant tbperdb = ufsib->ufs_bsize >> tp_bshift;
632 1.1 cgd for (i = 0; i < blks; i += TP_NINDIR) {
633 1.1 cgd if (i + TP_NINDIR > blks)
634 1.1 cgd count = blks;
635 1.1 cgd else
636 1.1 cgd count = i + TP_NINDIR;
637 1.1 cgd for (j = i; j < count; j++)
638 1.1 cgd if (blkp[j / tbperdb] != 0)
639 1.1 cgd spcl.c_addr[j - i] = 1;
640 1.1 cgd else
641 1.1 cgd spcl.c_addr[j - i] = 0;
642 1.20 bouyer spcl.c_count = iswap32(count - i);
643 1.1 cgd writeheader(ino);
644 1.1 cgd bp = &blkp[i / tbperdb];
645 1.1 cgd for (j = i; j < count; j += tbperdb, bp++)
646 1.21 ross if (*bp != 0) {
647 1.1 cgd if (j + tbperdb <= count)
648 1.28 perseant dumpblock(iswap32(*bp), (int)ufsib->ufs_bsize);
649 1.1 cgd else
650 1.20 bouyer dumpblock(iswap32(*bp), (count - j) * TP_BSIZE);
651 1.21 ross }
652 1.20 bouyer spcl.c_type = iswap32(TS_ADDR);
653 1.1 cgd }
654 1.1 cgd }
655 1.1 cgd
656 1.37 fvdl void
657 1.37 fvdl blksout64(int64_t *blkp, int frags, ino_t ino)
658 1.37 fvdl {
659 1.37 fvdl int64_t *bp;
660 1.37 fvdl int i, j, count, blks, tbperdb;
661 1.37 fvdl
662 1.37 fvdl blks = howmany(frags * ufsib->ufs_fsize, TP_BSIZE);
663 1.37 fvdl tbperdb = ufsib->ufs_bsize >> tp_bshift;
664 1.37 fvdl for (i = 0; i < blks; i += TP_NINDIR) {
665 1.37 fvdl if (i + TP_NINDIR > blks)
666 1.37 fvdl count = blks;
667 1.37 fvdl else
668 1.37 fvdl count = i + TP_NINDIR;
669 1.37 fvdl for (j = i; j < count; j++)
670 1.37 fvdl if (blkp[j / tbperdb] != 0)
671 1.37 fvdl spcl.c_addr[j - i] = 1;
672 1.37 fvdl else
673 1.37 fvdl spcl.c_addr[j - i] = 0;
674 1.37 fvdl spcl.c_count = iswap32(count - i);
675 1.37 fvdl writeheader(ino);
676 1.37 fvdl bp = &blkp[i / tbperdb];
677 1.37 fvdl for (j = i; j < count; j += tbperdb, bp++)
678 1.37 fvdl if (*bp != 0) {
679 1.37 fvdl if (j + tbperdb <= count)
680 1.37 fvdl dumpblock(iswap64(*bp), (int)ufsib->ufs_bsize);
681 1.37 fvdl else
682 1.37 fvdl dumpblock(iswap64(*bp), (count - j) * TP_BSIZE);
683 1.37 fvdl }
684 1.37 fvdl spcl.c_type = iswap32(TS_ADDR);
685 1.37 fvdl }
686 1.37 fvdl }
687 1.37 fvdl
688 1.1 cgd /*
689 1.1 cgd * Dump a map to the tape.
690 1.1 cgd */
691 1.1 cgd void
692 1.29 lukem dumpmap(char *map, int type, ino_t ino)
693 1.1 cgd {
694 1.16 lukem int i;
695 1.1 cgd char *cp;
696 1.1 cgd
697 1.20 bouyer spcl.c_type = iswap32(type);
698 1.20 bouyer spcl.c_count = iswap32(howmany(mapsize * sizeof(char), TP_BSIZE));
699 1.1 cgd writeheader(ino);
700 1.20 bouyer for (i = 0, cp = map; i < iswap32(spcl.c_count); i++, cp += TP_BSIZE)
701 1.1 cgd writerec(cp, 0);
702 1.1 cgd }
703 1.1 cgd
704 1.1 cgd /*
705 1.1 cgd * Write a header record to the dump tape.
706 1.1 cgd */
707 1.1 cgd void
708 1.29 lukem writeheader(ino_t ino)
709 1.1 cgd {
710 1.16 lukem int32_t sum, cnt, *lp;
711 1.1 cgd
712 1.20 bouyer spcl.c_inumber = iswap32(ino);
713 1.37 fvdl if (is_ufs2)
714 1.37 fvdl spcl.c_magic = iswap32(FS_UFS2_MAGIC);
715 1.37 fvdl else {
716 1.37 fvdl spcl.c_magic = iswap32(NFS_MAGIC);
717 1.37 fvdl spcl.c_old_date = iswap32(iswap64(spcl.c_date));
718 1.37 fvdl spcl.c_old_ddate = iswap32(iswap64(spcl.c_ddate));
719 1.37 fvdl spcl.c_old_tapea = iswap32(iswap64(spcl.c_tapea));
720 1.37 fvdl spcl.c_old_firstrec = iswap32(iswap64(spcl.c_firstrec));
721 1.37 fvdl }
722 1.1 cgd spcl.c_checksum = 0;
723 1.15 cgd lp = (int32_t *)&spcl;
724 1.1 cgd sum = 0;
725 1.15 cgd cnt = sizeof(union u_spcl) / (4 * sizeof(int32_t));
726 1.1 cgd while (--cnt >= 0) {
727 1.20 bouyer sum += iswap32(*lp++);
728 1.20 bouyer sum += iswap32(*lp++);
729 1.20 bouyer sum += iswap32(*lp++);
730 1.20 bouyer sum += iswap32(*lp++);
731 1.1 cgd }
732 1.20 bouyer spcl.c_checksum = iswap32(CHECKSUM - sum);
733 1.1 cgd writerec((char *)&spcl, 1);
734 1.1 cgd }
735