traverse.c revision 1.45 1 1.45 christos /* $NetBSD: traverse.c,v 1.45 2005/08/19 02:07:18 christos 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.45 christos __RCSID("$NetBSD: traverse.c,v 1.45 2005/08/19 02:07:18 christos 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.44 hannken if (DIP(dp, flags) & SF_SNAPSHOT)
95 1.44 hannken return (1);
96 1.43 hannken blkest = howmany(ufs_fragroundup(ufsib,
97 1.43 hannken dbtob((u_int64_t)DIP(dp, blocks))), TP_BSIZE);
98 1.43 hannken sizeest = howmany(ufs_fragroundup(ufsib, DIP(dp, size)), TP_BSIZE);
99 1.1 cgd if (blkest > sizeest)
100 1.1 cgd blkest = sizeest;
101 1.37 fvdl if (DIP(dp, size) > ufsib->ufs_bsize * NDADDR) {
102 1.1 cgd /* calculate the number of indirect blocks on the dump tape */
103 1.1 cgd blkest +=
104 1.28 perseant howmany(sizeest - NDADDR * ufsib->ufs_bsize / TP_BSIZE,
105 1.1 cgd TP_NINDIR);
106 1.1 cgd }
107 1.1 cgd return (blkest + 1);
108 1.1 cgd }
109 1.1 cgd
110 1.4 mycroft /* Auxiliary macro to pick up files changed since previous dump. */
111 1.4 mycroft #define CHANGEDSINCE(dp, t) \
112 1.37 fvdl (DIP((dp), mtime) >= (t) || DIP((dp), ctime) >= (t))
113 1.4 mycroft
114 1.4 mycroft /* The WANTTODUMP macro decides whether a file should be dumped. */
115 1.4 mycroft #ifdef UF_NODUMP
116 1.4 mycroft #define WANTTODUMP(dp) \
117 1.37 fvdl (CHANGEDSINCE(dp, iswap64(spcl.c_ddate)) && \
118 1.37 fvdl (nonodump || (DIP((dp), flags) & UF_NODUMP) != UF_NODUMP))
119 1.4 mycroft #else
120 1.37 fvdl #define WANTTODUMP(dp) CHANGEDSINCE(dp, iswap64(spcl.c_ddate))
121 1.4 mycroft #endif
122 1.4 mycroft
123 1.1 cgd /*
124 1.17 lukem * Determine if given inode should be dumped
125 1.17 lukem */
126 1.17 lukem void
127 1.37 fvdl mapfileino(ino_t ino, u_int64_t *tape_size, int *dirskipped)
128 1.17 lukem {
129 1.17 lukem int mode;
130 1.37 fvdl union dinode *dp;
131 1.17 lukem
132 1.22 lukem /*
133 1.22 lukem * Skip inode if we've already marked it for dumping
134 1.22 lukem */
135 1.22 lukem if (TSTINO(ino, usedinomap))
136 1.22 lukem return;
137 1.17 lukem dp = getino(ino);
138 1.37 fvdl if ((mode = (DIP(dp, mode) & IFMT)) == 0)
139 1.17 lukem return;
140 1.23 bouyer /*
141 1.23 bouyer * Put all dirs in dumpdirmap, inodes that are to be dumped in the
142 1.23 bouyer * used map. All inode but dirs who have the nodump attribute go
143 1.23 bouyer * to the usedinomap.
144 1.23 bouyer */
145 1.17 lukem SETINO(ino, usedinomap);
146 1.17 lukem if (mode == IFDIR)
147 1.17 lukem SETINO(ino, dumpdirmap);
148 1.17 lukem if (WANTTODUMP(dp)) {
149 1.17 lukem SETINO(ino, dumpinomap);
150 1.17 lukem if (mode != IFREG && mode != IFDIR && mode != IFLNK)
151 1.33 lukem *tape_size += 1;
152 1.17 lukem else
153 1.33 lukem *tape_size += blockest(dp);
154 1.17 lukem return;
155 1.17 lukem }
156 1.23 bouyer if (mode == IFDIR) {
157 1.23 bouyer #ifdef UF_NODUMP
158 1.37 fvdl if (!nonodump && (DIP(dp, flags) & UF_NODUMP))
159 1.23 bouyer CLRINO(ino, usedinomap);
160 1.23 bouyer #endif
161 1.17 lukem *dirskipped = 1;
162 1.23 bouyer }
163 1.17 lukem }
164 1.17 lukem
165 1.17 lukem /*
166 1.1 cgd * Dump pass 1.
167 1.1 cgd *
168 1.32 lukem * Walk the inode list for a file system to find all allocated inodes
169 1.1 cgd * that have been modified since the previous dump time. Also, find all
170 1.32 lukem * the directories in the file system.
171 1.31 lukem * disk may be NULL if dirv is NULL.
172 1.1 cgd */
173 1.4 mycroft int
174 1.37 fvdl mapfiles(ino_t maxino, u_int64_t *tape_size, char *diskname, char * const *dirv)
175 1.1 cgd {
176 1.1 cgd int anydirskipped = 0;
177 1.1 cgd
178 1.17 lukem if (dirv != NULL) {
179 1.17 lukem char curdir[MAXPATHLEN];
180 1.17 lukem FTS *dirh;
181 1.17 lukem FTSENT *entry;
182 1.17 lukem int d;
183 1.17 lukem
184 1.17 lukem if (getcwd(curdir, sizeof(curdir)) == NULL) {
185 1.17 lukem msg("Can't determine cwd: %s\n", strerror(errno));
186 1.17 lukem dumpabort(0);
187 1.17 lukem }
188 1.17 lukem if ((dirh = fts_open(dirv, FTS_PHYSICAL|FTS_SEEDOT|FTS_XDEV,
189 1.18 lukem NULL)) == NULL) {
190 1.17 lukem msg("fts_open failed: %s\n", strerror(errno));
191 1.17 lukem dumpabort(0);
192 1.17 lukem }
193 1.17 lukem while ((entry = fts_read(dirh)) != NULL) {
194 1.17 lukem switch (entry->fts_info) {
195 1.17 lukem case FTS_DNR: /* an error */
196 1.17 lukem case FTS_ERR:
197 1.17 lukem case FTS_NS:
198 1.17 lukem msg("Can't fts_read %s: %s\n", entry->fts_path,
199 1.17 lukem strerror(errno));
200 1.17 lukem case FTS_DP: /* already seen dir */
201 1.17 lukem continue;
202 1.17 lukem }
203 1.33 lukem mapfileino(entry->fts_statp->st_ino, tape_size,
204 1.17 lukem &anydirskipped);
205 1.17 lukem }
206 1.17 lukem (void)fts_close(dirh);
207 1.17 lukem
208 1.17 lukem /*
209 1.17 lukem * Add any parent directories
210 1.17 lukem */
211 1.17 lukem for (d = 0 ; dirv[d] != NULL ; d++) {
212 1.17 lukem char path[MAXPATHLEN];
213 1.17 lukem
214 1.17 lukem if (dirv[d][0] != '/')
215 1.17 lukem (void)snprintf(path, sizeof(path), "%s/%s",
216 1.17 lukem curdir, dirv[d]);
217 1.4 mycroft else
218 1.17 lukem (void)snprintf(path, sizeof(path), "%s",
219 1.17 lukem dirv[d]);
220 1.33 lukem while (strcmp(path, diskname) != 0) {
221 1.17 lukem char *p;
222 1.17 lukem struct stat sb;
223 1.17 lukem
224 1.17 lukem if (*path == '\0')
225 1.17 lukem break;
226 1.17 lukem if ((p = strrchr(path, '/')) == NULL)
227 1.17 lukem break;
228 1.17 lukem if (p == path)
229 1.17 lukem break;
230 1.17 lukem *p = '\0';
231 1.17 lukem if (stat(path, &sb) == -1) {
232 1.17 lukem msg("Can't stat %s: %s\n", path,
233 1.17 lukem strerror(errno));
234 1.17 lukem break;
235 1.17 lukem }
236 1.33 lukem mapfileino(sb.st_ino, tape_size, &anydirskipped);
237 1.17 lukem }
238 1.17 lukem }
239 1.17 lukem
240 1.17 lukem /*
241 1.17 lukem * Ensure that the root inode actually appears in the
242 1.17 lukem * file list for a subdir
243 1.17 lukem */
244 1.33 lukem mapfileino(ROOTINO, tape_size, &anydirskipped);
245 1.17 lukem } else {
246 1.37 fvdl fs_mapinodes(maxino, tape_size, &anydirskipped);
247 1.1 cgd }
248 1.1 cgd /*
249 1.1 cgd * Restore gets very upset if the root is not dumped,
250 1.1 cgd * so ensure that it always is dumped.
251 1.1 cgd */
252 1.1 cgd SETINO(ROOTINO, dumpinomap);
253 1.1 cgd return (anydirskipped);
254 1.1 cgd }
255 1.1 cgd
256 1.1 cgd /*
257 1.1 cgd * Dump pass 2.
258 1.1 cgd *
259 1.32 lukem * Scan each directory on the file system to see if it has any modified
260 1.1 cgd * files in it. If it does, and has not already been added to the dump
261 1.1 cgd * list (because it was itself modified), then add it. If a directory
262 1.1 cgd * has not been modified itself, contains no modified files and has no
263 1.1 cgd * subdirectories, then it can be deleted from the dump list and from
264 1.1 cgd * the list of directories. By deleting it from the list of directories,
265 1.1 cgd * its parent may now qualify for the same treatment on this or a later
266 1.1 cgd * pass using this algorithm.
267 1.1 cgd */
268 1.4 mycroft int
269 1.37 fvdl mapdirs(ino_t maxino, u_int64_t *tape_size)
270 1.1 cgd {
271 1.37 fvdl union dinode *dp, di;
272 1.23 bouyer int i, isdir, nodump;
273 1.16 lukem char *map;
274 1.16 lukem ino_t ino;
275 1.37 fvdl off_t filesize;
276 1.1 cgd int ret, change = 0;
277 1.37 fvdl daddr_t blk;
278 1.1 cgd
279 1.4 mycroft isdir = 0; /* XXX just to get gcc to shut up */
280 1.4 mycroft for (map = dumpdirmap, ino = 1; ino < maxino; ino++) {
281 1.4 mycroft if (((ino - 1) % NBBY) == 0) /* map is offset by 1 */
282 1.1 cgd isdir = *map++;
283 1.1 cgd else
284 1.1 cgd isdir >>= 1;
285 1.23 bouyer /*
286 1.23 bouyer * If dir has been removed from the used map, it's either
287 1.38 fvdl * because it had the nodump flag, or it inherited it from
288 1.23 bouyer * its parent. A directory can't be in dumpinomap if
289 1.23 bouyer * not in usedinomap, but we have to go throuh it anyway
290 1.23 bouyer * to propagate the nodump attribute.
291 1.23 bouyer */
292 1.23 bouyer nodump = (TSTINO(ino, usedinomap) == 0);
293 1.23 bouyer if ((isdir & 1) == 0 ||
294 1.23 bouyer (TSTINO(ino, dumpinomap) && nodump == 0))
295 1.1 cgd continue;
296 1.23 bouyer
297 1.1 cgd dp = getino(ino);
298 1.37 fvdl /*
299 1.37 fvdl * inode buf may be changed in searchdir().
300 1.37 fvdl */
301 1.37 fvdl if (is_ufs2)
302 1.37 fvdl di.dp2 = dp->dp2;
303 1.37 fvdl else
304 1.37 fvdl di.dp1 = dp->dp1;
305 1.37 fvdl filesize = DIP(&di, size);
306 1.1 cgd for (ret = 0, i = 0; filesize > 0 && i < NDADDR; i++) {
307 1.37 fvdl if (is_ufs2)
308 1.37 fvdl blk = iswap64(di.dp2.di_db[i]);
309 1.37 fvdl else
310 1.37 fvdl blk = iswap32(di.dp1.di_db[i]);
311 1.37 fvdl if (blk != 0)
312 1.37 fvdl ret |= searchdir(ino, blk,
313 1.28 perseant (long)ufs_dblksize(ufsib, &di, i),
314 1.33 lukem filesize, tape_size, nodump);
315 1.1 cgd if (ret & HASDUMPEDFILE)
316 1.1 cgd filesize = 0;
317 1.1 cgd else
318 1.28 perseant filesize -= ufsib->ufs_bsize;
319 1.1 cgd }
320 1.1 cgd for (i = 0; filesize > 0 && i < NIADDR; i++) {
321 1.37 fvdl if (is_ufs2)
322 1.37 fvdl blk = iswap64(di.dp2.di_ib[i]);
323 1.37 fvdl else
324 1.40 fvdl blk = iswap32(di.dp1.di_ib[i]);
325 1.37 fvdl if (blk == 0)
326 1.1 cgd continue;
327 1.37 fvdl ret |= dirindir(ino, blk, i, &filesize,
328 1.33 lukem tape_size, nodump);
329 1.1 cgd }
330 1.1 cgd if (ret & HASDUMPEDFILE) {
331 1.1 cgd SETINO(ino, dumpinomap);
332 1.33 lukem *tape_size += blockest(&di);
333 1.1 cgd change = 1;
334 1.1 cgd continue;
335 1.1 cgd }
336 1.23 bouyer if (nodump) {
337 1.23 bouyer if (ret & HASSUBDIRS)
338 1.23 bouyer change = 1; /* subdirs have inherited nodump */
339 1.23 bouyer CLRINO(ino, dumpdirmap);
340 1.23 bouyer } else if ((ret & HASSUBDIRS) == 0) {
341 1.1 cgd if (!TSTINO(ino, dumpinomap)) {
342 1.1 cgd CLRINO(ino, dumpdirmap);
343 1.1 cgd change = 1;
344 1.1 cgd }
345 1.1 cgd }
346 1.1 cgd }
347 1.1 cgd return (change);
348 1.1 cgd }
349 1.1 cgd
350 1.1 cgd /*
351 1.1 cgd * Read indirect blocks, and pass the data blocks to be searched
352 1.1 cgd * as directories. Quit as soon as any entry is found that will
353 1.1 cgd * require the directory to be dumped.
354 1.1 cgd */
355 1.4 mycroft static int
356 1.37 fvdl dirindir(ino_t ino, daddr_t blkno, int ind_level, off_t *filesize,
357 1.37 fvdl u_int64_t *tape_size, int nodump)
358 1.1 cgd {
359 1.1 cgd int ret = 0;
360 1.16 lukem int i;
361 1.37 fvdl union {
362 1.37 fvdl int64_t i64[MAXBSIZE / sizeof (int64_t)];
363 1.37 fvdl int32_t i32[MAXBSIZE / sizeof (int32_t)];
364 1.37 fvdl } idblk;
365 1.1 cgd
366 1.37 fvdl bread(fsatoda(ufsib, blkno), (char *)&idblk, (int)ufsib->ufs_bsize);
367 1.1 cgd if (ind_level <= 0) {
368 1.28 perseant for (i = 0; *filesize > 0 && i < ufsib->ufs_nindir; i++) {
369 1.37 fvdl if (is_ufs2)
370 1.41 fvdl blkno = iswap64(idblk.i64[i]);
371 1.37 fvdl else
372 1.41 fvdl blkno = iswap32(idblk.i32[i]);
373 1.1 cgd if (blkno != 0)
374 1.41 fvdl ret |= searchdir(ino, blkno,
375 1.28 perseant ufsib->ufs_bsize, *filesize,
376 1.33 lukem tape_size, nodump);
377 1.1 cgd if (ret & HASDUMPEDFILE)
378 1.1 cgd *filesize = 0;
379 1.1 cgd else
380 1.28 perseant *filesize -= ufsib->ufs_bsize;
381 1.1 cgd }
382 1.1 cgd return (ret);
383 1.1 cgd }
384 1.1 cgd ind_level--;
385 1.28 perseant for (i = 0; *filesize > 0 && i < ufsib->ufs_nindir; i++) {
386 1.37 fvdl if (is_ufs2)
387 1.41 fvdl blkno = iswap64(idblk.i64[i]);
388 1.37 fvdl else
389 1.41 fvdl blkno = iswap32(idblk.i32[i]);
390 1.1 cgd if (blkno != 0)
391 1.23 bouyer ret |= dirindir(ino, blkno, ind_level, filesize,
392 1.33 lukem tape_size, nodump);
393 1.1 cgd }
394 1.1 cgd return (ret);
395 1.1 cgd }
396 1.1 cgd
397 1.1 cgd /*
398 1.1 cgd * Scan a disk block containing directory information looking to see if
399 1.1 cgd * any of the entries are on the dump list and to see if the directory
400 1.1 cgd * contains any subdirectories.
401 1.1 cgd */
402 1.4 mycroft static int
403 1.37 fvdl searchdir(ino_t dino, daddr_t blkno, long size, off_t filesize,
404 1.37 fvdl u_int64_t *tape_size, int nodump)
405 1.1 cgd {
406 1.16 lukem struct direct *dp;
407 1.37 fvdl union dinode *ip;
408 1.16 lukem long loc, ret = 0;
409 1.39 fvdl char *dblk;
410 1.23 bouyer ino_t ino;
411 1.1 cgd
412 1.39 fvdl dblk = malloc(size);
413 1.39 fvdl if (dblk == NULL)
414 1.39 fvdl quit("searchdir: cannot allocate directory memory.\n");
415 1.28 perseant bread(fsatoda(ufsib, blkno), dblk, (int)size);
416 1.1 cgd if (filesize < size)
417 1.1 cgd size = filesize;
418 1.1 cgd for (loc = 0; loc < size; ) {
419 1.1 cgd dp = (struct direct *)(dblk + loc);
420 1.1 cgd if (dp->d_reclen == 0) {
421 1.45 christos msg("corrupted directory, inumber %llu\n",
422 1.45 christos (unsigned long long)dino);
423 1.1 cgd break;
424 1.1 cgd }
425 1.20 bouyer loc += iswap16(dp->d_reclen);
426 1.1 cgd if (dp->d_ino == 0)
427 1.1 cgd continue;
428 1.1 cgd if (dp->d_name[0] == '.') {
429 1.1 cgd if (dp->d_name[1] == '\0')
430 1.1 cgd continue;
431 1.1 cgd if (dp->d_name[1] == '.' && dp->d_name[2] == '\0')
432 1.1 cgd continue;
433 1.1 cgd }
434 1.23 bouyer ino = iswap32(dp->d_ino);
435 1.23 bouyer if (nodump) {
436 1.23 bouyer ip = getino(ino);
437 1.23 bouyer if (TSTINO(ino, dumpinomap)) {
438 1.23 bouyer CLRINO(ino, dumpinomap);
439 1.33 lukem *tape_size -= blockest(ip);
440 1.23 bouyer }
441 1.35 lukem /*
442 1.35 lukem * Add back to dumpdirmap and remove from usedinomap
443 1.35 lukem * to propagate nodump.
444 1.35 lukem */
445 1.37 fvdl if ((DIP(ip, mode) & IFMT) == IFDIR) {
446 1.23 bouyer SETINO(ino, dumpdirmap);
447 1.35 lukem CLRINO(ino, usedinomap);
448 1.23 bouyer ret |= HASSUBDIRS;
449 1.23 bouyer }
450 1.23 bouyer } else {
451 1.23 bouyer if (TSTINO(ino, dumpinomap)) {
452 1.23 bouyer ret |= HASDUMPEDFILE;
453 1.23 bouyer if (ret & HASSUBDIRS)
454 1.23 bouyer break;
455 1.23 bouyer }
456 1.23 bouyer if (TSTINO(ino, dumpdirmap)) {
457 1.23 bouyer ret |= HASSUBDIRS;
458 1.23 bouyer if (ret & HASDUMPEDFILE)
459 1.23 bouyer break;
460 1.23 bouyer }
461 1.1 cgd }
462 1.1 cgd }
463 1.39 fvdl free(dblk);
464 1.1 cgd return (ret);
465 1.1 cgd }
466 1.1 cgd
467 1.1 cgd /*
468 1.1 cgd * Dump passes 3 and 4.
469 1.1 cgd *
470 1.1 cgd * Dump the contents of an inode to tape.
471 1.1 cgd */
472 1.1 cgd void
473 1.37 fvdl dumpino(union dinode *dp, ino_t ino)
474 1.1 cgd {
475 1.1 cgd int ind_level, cnt;
476 1.37 fvdl off_t size;
477 1.1 cgd char buf[TP_BSIZE];
478 1.37 fvdl daddr_t blk;
479 1.37 fvdl void *shortlink;
480 1.1 cgd
481 1.1 cgd if (newtape) {
482 1.1 cgd newtape = 0;
483 1.1 cgd dumpmap(dumpinomap, TS_BITS, ino);
484 1.1 cgd }
485 1.1 cgd CLRINO(ino, dumpinomap);
486 1.44 hannken /*
487 1.44 hannken * Zero out the size of a snapshot so that it will be dumped
488 1.44 hannken * as a zero length file.
489 1.44 hannken */
490 1.44 hannken if (DIP(dp, flags) & SF_SNAPSHOT) {
491 1.44 hannken DIP(dp, size) = 0;
492 1.44 hannken DIP(dp, flags) &= ~SF_SNAPSHOT;
493 1.44 hannken }
494 1.37 fvdl if (!is_ufs2) {
495 1.37 fvdl if (needswap)
496 1.37 fvdl ffs_dinode1_swap(&dp->dp1, &spcl.c_dinode);
497 1.37 fvdl else
498 1.37 fvdl spcl.c_dinode = dp->dp1;
499 1.37 fvdl } else {
500 1.37 fvdl if (needswap)
501 1.37 fvdl ffs_dinode2_swap(&dp->dp2, &dp->dp2);
502 1.37 fvdl spcl.c_mode = dp->dp2.di_mode;
503 1.37 fvdl spcl.c_size = dp->dp2.di_size;
504 1.37 fvdl spcl.c_atime = dp->dp2.di_atime;
505 1.37 fvdl spcl.c_atimensec = dp->dp2.di_atimensec;
506 1.37 fvdl spcl.c_mtime = dp->dp2.di_mtime;
507 1.37 fvdl spcl.c_mtimensec = dp->dp2.di_mtimensec;
508 1.37 fvdl spcl.c_birthtime = dp->dp2.di_birthtime;
509 1.37 fvdl spcl.c_birthtimensec = dp->dp2.di_birthnsec;
510 1.37 fvdl spcl.c_rdev = dp->dp2.di_rdev;
511 1.37 fvdl spcl.c_file_flags = dp->dp2.di_flags;
512 1.37 fvdl spcl.c_uid = dp->dp2.di_uid;
513 1.37 fvdl spcl.c_gid = dp->dp2.di_gid;
514 1.37 fvdl }
515 1.20 bouyer spcl.c_type = iswap32(TS_INODE);
516 1.1 cgd spcl.c_count = 0;
517 1.37 fvdl switch (DIP(dp, mode) & IFMT) {
518 1.1 cgd
519 1.4 mycroft case 0:
520 1.1 cgd /*
521 1.1 cgd * Freed inode.
522 1.1 cgd */
523 1.1 cgd return;
524 1.1 cgd
525 1.8 mycroft case IFLNK:
526 1.1 cgd /*
527 1.1 cgd * Check for short symbolic link.
528 1.1 cgd */
529 1.37 fvdl if (DIP(dp, size) > 0 &&
530 1.4 mycroft #ifdef FS_44INODEFMT
531 1.37 fvdl (DIP(dp, size) < ufsib->ufs_maxsymlinklen ||
532 1.37 fvdl (ufsib->ufs_maxsymlinklen == 0 && DIP(dp, blocks) == 0))
533 1.5 mycroft #else
534 1.37 fvdl DIP(dp, blocks) == 0
535 1.5 mycroft #endif
536 1.29 lukem ) {
537 1.1 cgd spcl.c_addr[0] = 1;
538 1.20 bouyer spcl.c_count = iswap32(1);
539 1.1 cgd writeheader(ino);
540 1.37 fvdl if (is_ufs2)
541 1.37 fvdl shortlink = dp->dp2.di_db;
542 1.37 fvdl else
543 1.37 fvdl shortlink = dp->dp1.di_db;
544 1.37 fvdl memmove(buf, shortlink, DIP(dp, size));
545 1.37 fvdl buf[DIP(dp, size)] = '\0';
546 1.1 cgd writerec(buf, 0);
547 1.1 cgd return;
548 1.1 cgd }
549 1.1 cgd /* fall through */
550 1.1 cgd
551 1.8 mycroft case IFDIR:
552 1.8 mycroft case IFREG:
553 1.37 fvdl if (DIP(dp, size) > 0)
554 1.1 cgd break;
555 1.1 cgd /* fall through */
556 1.1 cgd
557 1.8 mycroft case IFIFO:
558 1.8 mycroft case IFSOCK:
559 1.8 mycroft case IFCHR:
560 1.8 mycroft case IFBLK:
561 1.1 cgd writeheader(ino);
562 1.1 cgd return;
563 1.1 cgd
564 1.1 cgd default:
565 1.37 fvdl msg("Warning: undefined file type 0%o\n", DIP(dp, mode) & IFMT);
566 1.1 cgd return;
567 1.1 cgd }
568 1.37 fvdl if (DIP(dp, size) > NDADDR * ufsib->ufs_bsize)
569 1.28 perseant cnt = NDADDR * ufsib->ufs_frag;
570 1.1 cgd else
571 1.37 fvdl cnt = howmany(DIP(dp, size), ufsib->ufs_fsize);
572 1.37 fvdl if (is_ufs2)
573 1.37 fvdl blksout64(&dp->dp2.di_db[0], cnt, ino);
574 1.37 fvdl else
575 1.37 fvdl blksout32(&dp->dp1.di_db[0], cnt, ino);
576 1.37 fvdl
577 1.37 fvdl if ((size = DIP(dp, size) - NDADDR * ufsib->ufs_bsize) <= 0)
578 1.1 cgd return;
579 1.1 cgd for (ind_level = 0; ind_level < NIADDR; ind_level++) {
580 1.37 fvdl if (is_ufs2)
581 1.37 fvdl blk = iswap64(dp->dp2.di_ib[ind_level]);
582 1.37 fvdl else
583 1.37 fvdl blk = iswap32(dp->dp1.di_ib[ind_level]);
584 1.37 fvdl dmpindir(ino, blk, ind_level, &size);
585 1.1 cgd if (size <= 0)
586 1.1 cgd return;
587 1.1 cgd }
588 1.1 cgd }
589 1.1 cgd
590 1.1 cgd /*
591 1.1 cgd * Read indirect blocks, and pass the data blocks to be dumped.
592 1.1 cgd */
593 1.4 mycroft static void
594 1.37 fvdl dmpindir(ino_t ino, daddr_t blk, int ind_level, off_t *size)
595 1.1 cgd {
596 1.1 cgd int i, cnt;
597 1.37 fvdl union {
598 1.37 fvdl int32_t i32[MAXBSIZE / sizeof (int32_t)];
599 1.37 fvdl int64_t i64[MAXBSIZE / sizeof (int64_t)];
600 1.37 fvdl } idblk;
601 1.37 fvdl daddr_t iblk;
602 1.37 fvdl
603 1.1 cgd
604 1.1 cgd if (blk != 0)
605 1.37 fvdl bread(fsatoda(ufsib, blk), (char *)&idblk,
606 1.28 perseant (int) ufsib->ufs_bsize);
607 1.1 cgd else
608 1.37 fvdl memset(&idblk, 0, (int)ufsib->ufs_bsize);
609 1.1 cgd if (ind_level <= 0) {
610 1.28 perseant if (*size < ufsib->ufs_nindir * ufsib->ufs_bsize)
611 1.28 perseant cnt = howmany(*size, ufsib->ufs_fsize);
612 1.1 cgd else
613 1.28 perseant cnt = ufsib->ufs_nindir * ufsib->ufs_frag;
614 1.28 perseant *size -= ufsib->ufs_nindir * ufsib->ufs_bsize;
615 1.37 fvdl if (is_ufs2)
616 1.37 fvdl blksout64(&idblk.i64[0], cnt, ino);
617 1.37 fvdl else
618 1.37 fvdl blksout32(&idblk.i32[0], cnt, ino);
619 1.1 cgd return;
620 1.1 cgd }
621 1.1 cgd ind_level--;
622 1.28 perseant for (i = 0; i < ufsib->ufs_nindir; i++) {
623 1.37 fvdl if (is_ufs2)
624 1.37 fvdl iblk = iswap64(idblk.i64[i]);
625 1.37 fvdl else
626 1.37 fvdl iblk = iswap32(idblk.i32[i]);
627 1.37 fvdl dmpindir(ino, iblk, ind_level, size);
628 1.1 cgd if (*size <= 0)
629 1.1 cgd return;
630 1.1 cgd }
631 1.1 cgd }
632 1.1 cgd
633 1.1 cgd /*
634 1.1 cgd * Collect up the data into tape record sized buffers and output them.
635 1.1 cgd */
636 1.1 cgd void
637 1.37 fvdl blksout32(int32_t *blkp, int frags, ino_t ino)
638 1.1 cgd {
639 1.36 fvdl int32_t *bp;
640 1.1 cgd int i, j, count, blks, tbperdb;
641 1.1 cgd
642 1.28 perseant blks = howmany(frags * ufsib->ufs_fsize, TP_BSIZE);
643 1.28 perseant tbperdb = ufsib->ufs_bsize >> tp_bshift;
644 1.1 cgd for (i = 0; i < blks; i += TP_NINDIR) {
645 1.1 cgd if (i + TP_NINDIR > blks)
646 1.1 cgd count = blks;
647 1.1 cgd else
648 1.1 cgd count = i + TP_NINDIR;
649 1.1 cgd for (j = i; j < count; j++)
650 1.1 cgd if (blkp[j / tbperdb] != 0)
651 1.1 cgd spcl.c_addr[j - i] = 1;
652 1.1 cgd else
653 1.1 cgd spcl.c_addr[j - i] = 0;
654 1.20 bouyer spcl.c_count = iswap32(count - i);
655 1.1 cgd writeheader(ino);
656 1.1 cgd bp = &blkp[i / tbperdb];
657 1.1 cgd for (j = i; j < count; j += tbperdb, bp++)
658 1.21 ross if (*bp != 0) {
659 1.1 cgd if (j + tbperdb <= count)
660 1.28 perseant dumpblock(iswap32(*bp), (int)ufsib->ufs_bsize);
661 1.1 cgd else
662 1.20 bouyer dumpblock(iswap32(*bp), (count - j) * TP_BSIZE);
663 1.21 ross }
664 1.20 bouyer spcl.c_type = iswap32(TS_ADDR);
665 1.1 cgd }
666 1.1 cgd }
667 1.1 cgd
668 1.37 fvdl void
669 1.37 fvdl blksout64(int64_t *blkp, int frags, ino_t ino)
670 1.37 fvdl {
671 1.37 fvdl int64_t *bp;
672 1.37 fvdl int i, j, count, blks, tbperdb;
673 1.37 fvdl
674 1.37 fvdl blks = howmany(frags * ufsib->ufs_fsize, TP_BSIZE);
675 1.37 fvdl tbperdb = ufsib->ufs_bsize >> tp_bshift;
676 1.37 fvdl for (i = 0; i < blks; i += TP_NINDIR) {
677 1.37 fvdl if (i + TP_NINDIR > blks)
678 1.37 fvdl count = blks;
679 1.37 fvdl else
680 1.37 fvdl count = i + TP_NINDIR;
681 1.37 fvdl for (j = i; j < count; j++)
682 1.37 fvdl if (blkp[j / tbperdb] != 0)
683 1.37 fvdl spcl.c_addr[j - i] = 1;
684 1.37 fvdl else
685 1.37 fvdl spcl.c_addr[j - i] = 0;
686 1.37 fvdl spcl.c_count = iswap32(count - i);
687 1.37 fvdl writeheader(ino);
688 1.37 fvdl bp = &blkp[i / tbperdb];
689 1.37 fvdl for (j = i; j < count; j += tbperdb, bp++)
690 1.37 fvdl if (*bp != 0) {
691 1.37 fvdl if (j + tbperdb <= count)
692 1.37 fvdl dumpblock(iswap64(*bp), (int)ufsib->ufs_bsize);
693 1.37 fvdl else
694 1.37 fvdl dumpblock(iswap64(*bp), (count - j) * TP_BSIZE);
695 1.37 fvdl }
696 1.37 fvdl spcl.c_type = iswap32(TS_ADDR);
697 1.37 fvdl }
698 1.37 fvdl }
699 1.37 fvdl
700 1.1 cgd /*
701 1.1 cgd * Dump a map to the tape.
702 1.1 cgd */
703 1.1 cgd void
704 1.29 lukem dumpmap(char *map, int type, ino_t ino)
705 1.1 cgd {
706 1.16 lukem int i;
707 1.1 cgd char *cp;
708 1.1 cgd
709 1.20 bouyer spcl.c_type = iswap32(type);
710 1.20 bouyer spcl.c_count = iswap32(howmany(mapsize * sizeof(char), TP_BSIZE));
711 1.1 cgd writeheader(ino);
712 1.20 bouyer for (i = 0, cp = map; i < iswap32(spcl.c_count); i++, cp += TP_BSIZE)
713 1.1 cgd writerec(cp, 0);
714 1.1 cgd }
715 1.1 cgd
716 1.1 cgd /*
717 1.1 cgd * Write a header record to the dump tape.
718 1.1 cgd */
719 1.1 cgd void
720 1.29 lukem writeheader(ino_t ino)
721 1.1 cgd {
722 1.16 lukem int32_t sum, cnt, *lp;
723 1.1 cgd
724 1.20 bouyer spcl.c_inumber = iswap32(ino);
725 1.37 fvdl if (is_ufs2)
726 1.37 fvdl spcl.c_magic = iswap32(FS_UFS2_MAGIC);
727 1.37 fvdl else {
728 1.37 fvdl spcl.c_magic = iswap32(NFS_MAGIC);
729 1.37 fvdl spcl.c_old_date = iswap32(iswap64(spcl.c_date));
730 1.37 fvdl spcl.c_old_ddate = iswap32(iswap64(spcl.c_ddate));
731 1.37 fvdl spcl.c_old_tapea = iswap32(iswap64(spcl.c_tapea));
732 1.37 fvdl spcl.c_old_firstrec = iswap32(iswap64(spcl.c_firstrec));
733 1.37 fvdl }
734 1.1 cgd spcl.c_checksum = 0;
735 1.15 cgd lp = (int32_t *)&spcl;
736 1.1 cgd sum = 0;
737 1.15 cgd cnt = sizeof(union u_spcl) / (4 * sizeof(int32_t));
738 1.1 cgd while (--cnt >= 0) {
739 1.20 bouyer sum += iswap32(*lp++);
740 1.20 bouyer sum += iswap32(*lp++);
741 1.20 bouyer sum += iswap32(*lp++);
742 1.20 bouyer sum += iswap32(*lp++);
743 1.1 cgd }
744 1.20 bouyer spcl.c_checksum = iswap32(CHECKSUM - sum);
745 1.1 cgd writerec((char *)&spcl, 1);
746 1.1 cgd }
747