dumplfs.c revision 1.30 1 1.30 dsl /* $NetBSD: dumplfs.c,v 1.30 2006/04/24 21:14:59 dsl Exp $ */
2 1.5 cgd
3 1.1 mycroft /*-
4 1.1 mycroft * Copyright (c) 1991, 1993
5 1.1 mycroft * The Regents of the University of California. All rights reserved.
6 1.1 mycroft *
7 1.1 mycroft * Redistribution and use in source and binary forms, with or without
8 1.1 mycroft * modification, are permitted provided that the following conditions
9 1.1 mycroft * are met:
10 1.1 mycroft * 1. Redistributions of source code must retain the above copyright
11 1.1 mycroft * notice, this list of conditions and the following disclaimer.
12 1.1 mycroft * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 mycroft * notice, this list of conditions and the following disclaimer in the
14 1.1 mycroft * documentation and/or other materials provided with the distribution.
15 1.28 agc * 3. Neither the name of the University nor the names of its contributors
16 1.1 mycroft * may be used to endorse or promote products derived from this software
17 1.1 mycroft * without specific prior written permission.
18 1.1 mycroft *
19 1.1 mycroft * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.1 mycroft * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.1 mycroft * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.1 mycroft * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.1 mycroft * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.1 mycroft * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.1 mycroft * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.1 mycroft * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.1 mycroft * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.1 mycroft * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.1 mycroft * SUCH DAMAGE.
30 1.1 mycroft */
31 1.1 mycroft
32 1.8 fvdl #include <sys/cdefs.h>
33 1.8 fvdl
34 1.1 mycroft #ifndef lint
35 1.8 fvdl __COPYRIGHT(
36 1.1 mycroft "@(#) Copyright (c) 1991, 1993\n\
37 1.8 fvdl The Regents of the University of California. All rights reserved.\n");
38 1.1 mycroft #endif /* not lint */
39 1.1 mycroft
40 1.1 mycroft #ifndef lint
41 1.5 cgd #if 0
42 1.8 fvdl static char sccsid[] = "@(#)dumplfs.c 8.5 (Berkeley) 5/24/95";
43 1.5 cgd #else
44 1.30 dsl __RCSID("$NetBSD: dumplfs.c,v 1.30 2006/04/24 21:14:59 dsl Exp $");
45 1.5 cgd #endif
46 1.1 mycroft #endif /* not lint */
47 1.1 mycroft
48 1.1 mycroft #include <sys/param.h>
49 1.1 mycroft #include <sys/ucred.h>
50 1.1 mycroft #include <sys/mount.h>
51 1.1 mycroft #include <sys/time.h>
52 1.1 mycroft
53 1.1 mycroft #include <ufs/ufs/dinode.h>
54 1.1 mycroft #include <ufs/lfs/lfs.h>
55 1.1 mycroft
56 1.2 mycroft #include <err.h>
57 1.2 mycroft #include <errno.h>
58 1.1 mycroft #include <fcntl.h>
59 1.1 mycroft #include <fstab.h>
60 1.1 mycroft #include <stdlib.h>
61 1.1 mycroft #include <stdio.h>
62 1.1 mycroft #include <string.h>
63 1.2 mycroft #include <unistd.h>
64 1.1 mycroft #include "extern.h"
65 1.1 mycroft
66 1.19 perseant static void addseg(char *);
67 1.19 perseant static void dump_cleaner_info(struct lfs *, void *);
68 1.26 fvdl static void dump_dinode(struct ufs1_dinode *);
69 1.20 fvdl static void dump_ifile(int, struct lfs *, int, int, daddr_t);
70 1.19 perseant static int dump_ipage_ifile(struct lfs *, int, char *, int);
71 1.19 perseant static int dump_ipage_segusage(struct lfs *, int, char *, int);
72 1.19 perseant static void dump_segment(int, int, daddr_t, struct lfs *, int);
73 1.19 perseant static int dump_sum(int, struct lfs *, SEGSUM *, int, daddr_t);
74 1.19 perseant static void dump_super(struct lfs *);
75 1.19 perseant static void usage(void);
76 1.1 mycroft
77 1.19 perseant extern u_long cksum(void *, size_t);
78 1.8 fvdl
79 1.1 mycroft typedef struct seglist SEGLIST;
80 1.1 mycroft struct seglist {
81 1.1 mycroft SEGLIST *next;
82 1.1 mycroft int num;
83 1.1 mycroft };
84 1.1 mycroft SEGLIST *seglist;
85 1.1 mycroft
86 1.1 mycroft char *special;
87 1.1 mycroft
88 1.1 mycroft /* Segment Usage formats */
89 1.1 mycroft #define print_suheader \
90 1.1 mycroft (void)printf("segnum\tflags\tnbytes\tninos\tnsums\tlastmod\n")
91 1.1 mycroft
92 1.19 perseant #define print_suentry(i, sp, fs) \
93 1.19 perseant (void)printf("%d\t%c%c%c\t%d\t%d\t%d\t%s", i, \
94 1.19 perseant (((sp)->su_flags & SEGUSE_ACTIVE) ? 'A' : ' '), \
95 1.19 perseant (((sp)->su_flags & SEGUSE_DIRTY) ? 'D' : 'C'), \
96 1.19 perseant (((sp)->su_flags & SEGUSE_SUPERBLOCK) ? 'S' : ' '), \
97 1.19 perseant (sp)->su_nbytes, (sp)->su_ninos, (sp)->su_nsums, \
98 1.19 perseant ((fs)->lfs_version == 1 ? ctime((time_t *)&(sp)->su_olastmod) : \
99 1.19 perseant ctime((time_t *)&(sp)->su_lastmod)))
100 1.1 mycroft
101 1.1 mycroft /* Ifile formats */
102 1.1 mycroft #define print_iheader \
103 1.1 mycroft (void)printf("inum\tstatus\tversion\tdaddr\t\tfreeptr\n")
104 1.1 mycroft #define print_ientry(i, ip) \
105 1.19 perseant if ((ip)->if_daddr == LFS_UNUSED_DADDR) \
106 1.29 christos (void)printf("%d\tFREE\t%d\t \t\t%llu\n", \
107 1.29 christos i, (ip)->if_version, \
108 1.29 christos (unsigned long long)(ip)->if_nextfree); \
109 1.1 mycroft else \
110 1.1 mycroft (void)printf("%d\tINUSE\t%d\t%8X \n", \
111 1.19 perseant i, (ip)->if_version, (ip)->if_daddr)
112 1.19 perseant #define fsbtobyte(fs, b) fsbtob((fs), (off_t)((b)))
113 1.16 toshii
114 1.25 perseant int datasum_check = 0;
115 1.25 perseant
116 1.1 mycroft int
117 1.19 perseant main(int argc, char **argv)
118 1.1 mycroft {
119 1.1 mycroft struct lfs lfs_sb1, lfs_sb2, *lfs_master;
120 1.14 perseant daddr_t seg_addr, idaddr, sbdaddr;
121 1.19 perseant int ch, do_allsb, do_ientries, do_segentries, fd, segnum;
122 1.1 mycroft
123 1.1 mycroft do_allsb = 0;
124 1.1 mycroft do_ientries = 0;
125 1.19 perseant do_segentries = 0;
126 1.14 perseant idaddr = 0x0;
127 1.14 perseant sbdaddr = 0x0;
128 1.25 perseant while ((ch = getopt(argc, argv, "ab:diI:Ss:")) != -1)
129 1.1 mycroft switch(ch) {
130 1.1 mycroft case 'a': /* Dump all superblocks */
131 1.1 mycroft do_allsb = 1;
132 1.1 mycroft break;
133 1.14 perseant case 'b': /* Use this superblock */
134 1.14 perseant sbdaddr = strtol(optarg, NULL, 0);
135 1.14 perseant break;
136 1.25 perseant case 'd':
137 1.25 perseant datasum_check = 1;
138 1.25 perseant break;
139 1.1 mycroft case 'i': /* Dump ifile entries */
140 1.19 perseant do_ientries = !do_ientries;
141 1.1 mycroft break;
142 1.14 perseant case 'I': /* Use this ifile inode */
143 1.14 perseant idaddr = strtol(optarg, NULL, 0);
144 1.14 perseant break;
145 1.19 perseant case 'S':
146 1.19 perseant do_segentries = !do_segentries;
147 1.19 perseant break;
148 1.1 mycroft case 's': /* Dump out these segments */
149 1.1 mycroft addseg(optarg);
150 1.1 mycroft break;
151 1.1 mycroft default:
152 1.1 mycroft usage();
153 1.1 mycroft }
154 1.1 mycroft argc -= optind;
155 1.1 mycroft argv += optind;
156 1.1 mycroft
157 1.1 mycroft if (argc != 1)
158 1.1 mycroft usage();
159 1.1 mycroft
160 1.1 mycroft special = argv[0];
161 1.1 mycroft if ((fd = open(special, O_RDONLY, 0)) < 0)
162 1.2 mycroft err(1, "%s", special);
163 1.1 mycroft
164 1.14 perseant if (sbdaddr == 0x0) {
165 1.19 perseant /* Read the proto-superblock */
166 1.14 perseant get(fd, LFS_LABELPAD, &(lfs_sb1.lfs_dlfs), sizeof(struct dlfs));
167 1.19 perseant
168 1.19 perseant /* If that wasn't the real first sb, get the real first sb */
169 1.19 perseant if (lfs_sb1.lfs_version > 1 &&
170 1.19 perseant lfs_sb1.lfs_sboffs[0] > btofsb(&lfs_sb1, LFS_LABELPAD))
171 1.19 perseant get(fd, fsbtob(&lfs_sb1, lfs_sb1.lfs_sboffs[0]),
172 1.19 perseant &(lfs_sb1.lfs_dlfs), sizeof(struct dlfs));
173 1.14 perseant
174 1.14 perseant /*
175 1.14 perseant * Read the second superblock and figure out which check point is
176 1.14 perseant * most up to date.
177 1.14 perseant */
178 1.14 perseant get(fd,
179 1.19 perseant fsbtobyte(&lfs_sb1, lfs_sb1.lfs_sboffs[1]),
180 1.16 toshii &(lfs_sb2.lfs_dlfs), sizeof(struct dlfs));
181 1.14 perseant
182 1.14 perseant lfs_master = &lfs_sb1;
183 1.19 perseant if (lfs_sb1.lfs_version > 1) {
184 1.19 perseant if (lfs_sb1.lfs_serial > lfs_sb2.lfs_serial) {
185 1.19 perseant lfs_master = &lfs_sb2;
186 1.19 perseant sbdaddr = lfs_sb1.lfs_sboffs[1];
187 1.19 perseant } else
188 1.19 perseant sbdaddr = lfs_sb1.lfs_sboffs[0];
189 1.19 perseant } else {
190 1.19 perseant if (lfs_sb1.lfs_otstamp > lfs_sb2.lfs_otstamp) {
191 1.19 perseant lfs_master = &lfs_sb2;
192 1.19 perseant sbdaddr = lfs_sb1.lfs_sboffs[1];
193 1.19 perseant } else
194 1.19 perseant sbdaddr = lfs_sb1.lfs_sboffs[0];
195 1.19 perseant }
196 1.14 perseant } else {
197 1.14 perseant /* Read the first superblock */
198 1.16 toshii get(fd, dbtob((off_t)sbdaddr), &(lfs_sb1.lfs_dlfs),
199 1.16 toshii sizeof(struct dlfs));
200 1.14 perseant lfs_master = &lfs_sb1;
201 1.13 perseant }
202 1.1 mycroft
203 1.19 perseant /* Compatibility */
204 1.19 perseant if (lfs_master->lfs_version == 1) {
205 1.19 perseant lfs_master->lfs_sumsize = LFS_V1_SUMMARY_SIZE;
206 1.19 perseant lfs_master->lfs_ibsize = lfs_master->lfs_bsize;
207 1.19 perseant lfs_master->lfs_start = lfs_master->lfs_sboffs[0];
208 1.19 perseant lfs_master->lfs_tstamp = lfs_master->lfs_otstamp;
209 1.19 perseant lfs_master->lfs_fsbtodb = 0;
210 1.19 perseant }
211 1.19 perseant
212 1.20 fvdl (void)printf("Master Superblock at 0x%llx:\n", (long long)sbdaddr);
213 1.1 mycroft dump_super(lfs_master);
214 1.1 mycroft
215 1.19 perseant dump_ifile(fd, lfs_master, do_ientries, do_segentries, idaddr);
216 1.1 mycroft
217 1.1 mycroft if (seglist != NULL)
218 1.1 mycroft for (; seglist != NULL; seglist = seglist->next) {
219 1.19 perseant seg_addr = sntod(lfs_master, seglist->num);
220 1.19 perseant dump_segment(fd, seglist->num, seg_addr, lfs_master,
221 1.19 perseant do_allsb);
222 1.1 mycroft }
223 1.1 mycroft else
224 1.19 perseant for (segnum = 0, seg_addr = sntod(lfs_master, 0);
225 1.19 perseant segnum < lfs_master->lfs_nseg;
226 1.19 perseant segnum++, seg_addr = sntod(lfs_master, segnum))
227 1.19 perseant dump_segment(fd, segnum, seg_addr, lfs_master,
228 1.19 perseant do_allsb);
229 1.1 mycroft
230 1.1 mycroft (void)close(fd);
231 1.1 mycroft exit(0);
232 1.1 mycroft }
233 1.1 mycroft
234 1.1 mycroft /*
235 1.1 mycroft * We are reading all the blocks of an inode and dumping out the ifile table.
236 1.1 mycroft * This code could be tighter, but this is a first pass at getting the stuff
237 1.1 mycroft * printed out rather than making this code incredibly efficient.
238 1.1 mycroft */
239 1.1 mycroft static void
240 1.19 perseant dump_ifile(int fd, struct lfs *lfsp, int do_ientries, int do_segentries, daddr_t addr)
241 1.1 mycroft {
242 1.19 perseant char *ipage;
243 1.26 fvdl struct ufs1_dinode *dip, *dpage;
244 1.20 fvdl /* XXX ondisk32 */
245 1.20 fvdl int32_t *addrp, *dindir, *iaddrp, *indir;
246 1.4 cgd int block_limit, i, inum, j, nblocks, psize;
247 1.1 mycroft
248 1.1 mycroft psize = lfsp->lfs_bsize;
249 1.14 perseant if (!addr)
250 1.14 perseant addr = lfsp->lfs_idaddr;
251 1.1 mycroft
252 1.1 mycroft if (!(dpage = malloc(psize)))
253 1.2 mycroft err(1, "malloc");
254 1.19 perseant get(fd, fsbtobyte(lfsp, addr), dpage, psize);
255 1.1 mycroft
256 1.1 mycroft for (dip = dpage + INOPB(lfsp) - 1; dip >= dpage; --dip)
257 1.1 mycroft if (dip->di_inumber == LFS_IFILE_INUM)
258 1.1 mycroft break;
259 1.1 mycroft
260 1.1 mycroft if (dip < dpage)
261 1.20 fvdl errx(1, "unable to locate ifile inode at disk address 0x%llx",
262 1.20 fvdl (long long)addr);
263 1.1 mycroft
264 1.1 mycroft (void)printf("\nIFILE inode\n");
265 1.1 mycroft dump_dinode(dip);
266 1.1 mycroft
267 1.1 mycroft (void)printf("\nIFILE contents\n");
268 1.1 mycroft nblocks = dip->di_size >> lfsp->lfs_bshift;
269 1.1 mycroft block_limit = MIN(nblocks, NDADDR);
270 1.1 mycroft
271 1.1 mycroft /* Get the direct block */
272 1.1 mycroft if ((ipage = malloc(psize)) == NULL)
273 1.2 mycroft err(1, "malloc");
274 1.1 mycroft for (inum = 0, addrp = dip->di_db, i = 0; i < block_limit;
275 1.1 mycroft i++, addrp++) {
276 1.19 perseant get(fd, fsbtobyte(lfsp, *addrp), ipage, psize);
277 1.1 mycroft if (i < lfsp->lfs_cleansz) {
278 1.1 mycroft dump_cleaner_info(lfsp, ipage);
279 1.19 perseant if (do_segentries)
280 1.19 perseant print_suheader;
281 1.1 mycroft continue;
282 1.1 mycroft }
283 1.1 mycroft
284 1.1 mycroft if (i < (lfsp->lfs_segtabsz + lfsp->lfs_cleansz)) {
285 1.19 perseant if (do_segentries)
286 1.19 perseant inum = dump_ipage_segusage(lfsp, inum, ipage,
287 1.19 perseant lfsp->lfs_sepb);
288 1.19 perseant else
289 1.19 perseant inum = (i < lfsp->lfs_segtabsz + lfsp->lfs_cleansz - 1);
290 1.10 ross if (!inum) {
291 1.1 mycroft if(!do_ientries)
292 1.1 mycroft goto e0;
293 1.1 mycroft else
294 1.1 mycroft print_iheader;
295 1.10 ross }
296 1.1 mycroft } else
297 1.19 perseant inum = dump_ipage_ifile(lfsp, inum, ipage, lfsp->lfs_ifpb);
298 1.1 mycroft }
299 1.1 mycroft
300 1.1 mycroft if (nblocks <= NDADDR)
301 1.1 mycroft goto e0;
302 1.1 mycroft
303 1.1 mycroft /* Dump out blocks off of single indirect block */
304 1.1 mycroft if (!(indir = malloc(psize)))
305 1.2 mycroft err(1, "malloc");
306 1.19 perseant get(fd, fsbtobyte(lfsp, dip->di_ib[0]), indir, psize);
307 1.1 mycroft block_limit = MIN(i + lfsp->lfs_nindir, nblocks);
308 1.1 mycroft for (addrp = indir; i < block_limit; i++, addrp++) {
309 1.1 mycroft if (*addrp == LFS_UNUSED_DADDR)
310 1.1 mycroft break;
311 1.19 perseant get(fd, fsbtobyte(lfsp, *addrp), ipage, psize);
312 1.1 mycroft if (i < lfsp->lfs_cleansz) {
313 1.1 mycroft dump_cleaner_info(lfsp, ipage);
314 1.1 mycroft continue;
315 1.19 perseant }
316 1.1 mycroft
317 1.19 perseant if (i < lfsp->lfs_segtabsz + lfsp->lfs_cleansz) {
318 1.19 perseant if (do_segentries)
319 1.19 perseant inum = dump_ipage_segusage(lfsp, inum, ipage,
320 1.19 perseant lfsp->lfs_sepb);
321 1.19 perseant else
322 1.19 perseant inum = (i < lfsp->lfs_segtabsz + lfsp->lfs_cleansz - 1);
323 1.11 nathanw if (!inum) {
324 1.1 mycroft if(!do_ientries)
325 1.1 mycroft goto e1;
326 1.1 mycroft else
327 1.1 mycroft print_iheader;
328 1.11 nathanw }
329 1.1 mycroft } else
330 1.19 perseant inum = dump_ipage_ifile(lfsp, inum, ipage, lfsp->lfs_ifpb);
331 1.1 mycroft }
332 1.1 mycroft
333 1.1 mycroft if (nblocks <= lfsp->lfs_nindir * lfsp->lfs_ifpb)
334 1.1 mycroft goto e1;
335 1.1 mycroft
336 1.1 mycroft /* Get the double indirect block */
337 1.1 mycroft if (!(dindir = malloc(psize)))
338 1.2 mycroft err(1, "malloc");
339 1.19 perseant get(fd, fsbtobyte(lfsp, dip->di_ib[1]), dindir, psize);
340 1.1 mycroft for (iaddrp = dindir, j = 0; j < lfsp->lfs_nindir; j++, iaddrp++) {
341 1.1 mycroft if (*iaddrp == LFS_UNUSED_DADDR)
342 1.1 mycroft break;
343 1.19 perseant get(fd, fsbtobyte(lfsp, *iaddrp), indir, psize);
344 1.1 mycroft block_limit = MIN(i + lfsp->lfs_nindir, nblocks);
345 1.1 mycroft for (addrp = indir; i < block_limit; i++, addrp++) {
346 1.1 mycroft if (*addrp == LFS_UNUSED_DADDR)
347 1.1 mycroft break;
348 1.19 perseant get(fd, fsbtobyte(lfsp, *addrp), ipage, psize);
349 1.1 mycroft if (i < lfsp->lfs_cleansz) {
350 1.1 mycroft dump_cleaner_info(lfsp, ipage);
351 1.1 mycroft continue;
352 1.19 perseant }
353 1.1 mycroft
354 1.19 perseant if (i < lfsp->lfs_segtabsz + lfsp->lfs_cleansz) {
355 1.19 perseant if (do_segentries)
356 1.19 perseant inum = dump_ipage_segusage(lfsp,
357 1.19 perseant inum, ipage, lfsp->lfs_sepb);
358 1.19 perseant else
359 1.19 perseant inum = (i < lfsp->lfs_segtabsz +
360 1.19 perseant lfsp->lfs_cleansz - 1);
361 1.10 ross if (!inum) {
362 1.1 mycroft if(!do_ientries)
363 1.1 mycroft goto e2;
364 1.1 mycroft else
365 1.1 mycroft print_iheader;
366 1.10 ross }
367 1.1 mycroft } else
368 1.19 perseant inum = dump_ipage_ifile(lfsp, inum,
369 1.1 mycroft ipage, lfsp->lfs_ifpb);
370 1.1 mycroft }
371 1.1 mycroft }
372 1.1 mycroft e2: free(dindir);
373 1.1 mycroft e1: free(indir);
374 1.1 mycroft e0: free(dpage);
375 1.1 mycroft free(ipage);
376 1.1 mycroft }
377 1.1 mycroft
378 1.1 mycroft static int
379 1.19 perseant dump_ipage_ifile(struct lfs *lfsp, int i, char *pp, int tot)
380 1.1 mycroft {
381 1.19 perseant char *ip;
382 1.19 perseant int cnt, max, entsize;
383 1.1 mycroft
384 1.19 perseant if (lfsp->lfs_version == 1)
385 1.19 perseant entsize = sizeof(IFILE_V1);
386 1.19 perseant else
387 1.19 perseant entsize = sizeof(IFILE);
388 1.1 mycroft max = i + tot;
389 1.1 mycroft
390 1.19 perseant for (ip = pp, cnt = i; cnt < max; cnt++, ip += entsize)
391 1.19 perseant print_ientry(cnt, (IFILE *)ip);
392 1.1 mycroft return (max);
393 1.1 mycroft }
394 1.1 mycroft
395 1.1 mycroft static int
396 1.19 perseant dump_ipage_segusage(struct lfs *lfsp, int i, char *pp, int tot)
397 1.1 mycroft {
398 1.1 mycroft SEGUSE *sp;
399 1.1 mycroft int cnt, max;
400 1.15 perseant struct seglist *slp;
401 1.1 mycroft
402 1.1 mycroft max = i + tot;
403 1.1 mycroft for (sp = (SEGUSE *)pp, cnt = i;
404 1.19 perseant cnt < lfsp->lfs_nseg && cnt < max; cnt++) {
405 1.15 perseant if (seglist == NULL)
406 1.19 perseant print_suentry(cnt, sp, lfsp);
407 1.15 perseant else {
408 1.15 perseant for (slp = seglist; slp != NULL; slp = slp->next)
409 1.15 perseant if (cnt == slp->num) {
410 1.19 perseant print_suentry(cnt, sp, lfsp);
411 1.15 perseant break;
412 1.15 perseant }
413 1.15 perseant }
414 1.19 perseant if (lfsp->lfs_version > 1)
415 1.19 perseant ++sp;
416 1.19 perseant else
417 1.19 perseant sp = (SEGUSE *)((SEGUSE_V1 *)sp + 1);
418 1.15 perseant }
419 1.1 mycroft if (max >= lfsp->lfs_nseg)
420 1.1 mycroft return (0);
421 1.1 mycroft else
422 1.1 mycroft return (max);
423 1.1 mycroft }
424 1.1 mycroft
425 1.1 mycroft static void
426 1.26 fvdl dump_dinode(struct ufs1_dinode *dip)
427 1.1 mycroft {
428 1.1 mycroft int i;
429 1.7 thorpej time_t at, mt, ct;
430 1.7 thorpej
431 1.7 thorpej at = dip->di_atime;
432 1.7 thorpej mt = dip->di_mtime;
433 1.7 thorpej ct = dip->di_ctime;
434 1.1 mycroft
435 1.19 perseant (void)printf(" %so%o\t%s%d\t%s%d\t%s%d\t%s%llu\n",
436 1.1 mycroft "mode ", dip->di_mode,
437 1.1 mycroft "nlink ", dip->di_nlink,
438 1.1 mycroft "uid ", dip->di_uid,
439 1.1 mycroft "gid ", dip->di_gid,
440 1.9 thorpej "size ", (long long)dip->di_size);
441 1.19 perseant (void)printf(" %s%s %s%s %s%s",
442 1.7 thorpej "atime ", ctime(&at),
443 1.7 thorpej "mtime ", ctime(&mt),
444 1.7 thorpej "ctime ", ctime(&ct));
445 1.19 perseant (void)printf(" inum %d\n", dip->di_inumber);
446 1.19 perseant (void)printf(" Direct Addresses\n");
447 1.1 mycroft for (i = 0; i < NDADDR; i++) {
448 1.14 perseant (void)printf("\t0x%x", dip->di_db[i]);
449 1.1 mycroft if ((i % 6) == 5)
450 1.1 mycroft (void)printf("\n");
451 1.1 mycroft }
452 1.1 mycroft for (i = 0; i < NIADDR; i++)
453 1.14 perseant (void)printf("\t0x%x", dip->di_ib[i]);
454 1.1 mycroft (void)printf("\n");
455 1.1 mycroft }
456 1.1 mycroft
457 1.1 mycroft static int
458 1.19 perseant dump_sum(int fd, struct lfs *lfsp, SEGSUM *sp, int segnum, daddr_t addr)
459 1.1 mycroft {
460 1.1 mycroft FINFO *fp;
461 1.25 perseant int32_t *dp, *idp;
462 1.25 perseant int i, j, acc;
463 1.1 mycroft int ck;
464 1.25 perseant int numbytes, numblocks;
465 1.25 perseant char *datap;
466 1.26 fvdl struct ufs1_dinode *inop;
467 1.25 perseant size_t el_size;
468 1.25 perseant u_int32_t datasum;
469 1.25 perseant char *buf;
470 1.1 mycroft
471 1.8 fvdl if (sp->ss_magic != SS_MAGIC ||
472 1.8 fvdl sp->ss_sumsum != (ck = cksum(&sp->ss_datasum,
473 1.19 perseant lfsp->lfs_sumsize - sizeof(sp->ss_sumsum)))) {
474 1.14 perseant /* Don't print "corrupt" if we're just too close to the edge */
475 1.19 perseant if (dtosn(lfsp, addr + fsbtodb(lfsp, 1)) ==
476 1.19 perseant dtosn(lfsp, addr))
477 1.20 fvdl (void)printf("dumplfs: %s %d address 0x%llx\n",
478 1.14 perseant "corrupt summary block; segment", segnum,
479 1.20 fvdl (long long)addr);
480 1.19 perseant return (0);
481 1.19 perseant }
482 1.19 perseant if (lfsp->lfs_version > 1 && sp->ss_ident != lfsp->lfs_ident) {
483 1.20 fvdl (void)printf("dumplfs: %s %d address 0x%llx\n",
484 1.19 perseant "summary from a former life; segment", segnum,
485 1.21 mrg (long long)addr);
486 1.19 perseant return (0);
487 1.1 mycroft }
488 1.1 mycroft
489 1.20 fvdl (void)printf("Segment Summary Info at 0x%llx\n", (long long)addr);
490 1.14 perseant (void)printf(" %s0x%x\t%s%d\t%s%d\t%s%c%c\n %s0x%x\t%s0x%x",
491 1.1 mycroft "next ", sp->ss_next,
492 1.1 mycroft "nfinfo ", sp->ss_nfinfo,
493 1.1 mycroft "ninos ", sp->ss_ninos,
494 1.14 perseant "flags ", (sp->ss_flags & SS_DIROP) ? 'D' : '-',
495 1.14 perseant (sp->ss_flags & SS_CONT) ? 'C' : '-',
496 1.1 mycroft "sumsum ", sp->ss_sumsum,
497 1.1 mycroft "datasum ", sp->ss_datasum );
498 1.19 perseant if (lfsp->lfs_version == 1)
499 1.19 perseant (void)printf("\tcreate %s\n", ctime((time_t *)&sp->ss_ident));
500 1.19 perseant else {
501 1.19 perseant (void)printf("\tcreate %s", ctime((time_t *)&sp->ss_create));
502 1.19 perseant (void)printf(" roll_id %-8x", sp->ss_ident);
503 1.19 perseant (void)printf(" serial %lld\n", (long long)sp->ss_serial);
504 1.19 perseant }
505 1.1 mycroft
506 1.1 mycroft /* Dump out inode disk addresses */
507 1.20 fvdl dp = (int32_t *)sp;
508 1.20 fvdl dp += lfsp->lfs_sumsize / sizeof(int32_t);
509 1.19 perseant inop = malloc(lfsp->lfs_bsize);
510 1.1 mycroft printf(" Inode addresses:");
511 1.8 fvdl numbytes = 0;
512 1.25 perseant numblocks = 0;
513 1.1 mycroft for (dp--, i = 0; i < sp->ss_ninos; dp--) {
514 1.25 perseant ++numblocks;
515 1.19 perseant numbytes += lfsp->lfs_ibsize; /* add bytes for inode block */
516 1.14 perseant printf("\t0x%x {", *dp);
517 1.19 perseant get(fd, fsbtobyte(lfsp, *dp), inop, lfsp->lfs_ibsize);
518 1.1 mycroft for (j = 0; i < sp->ss_ninos && j < INOPB(lfsp); j++, i++) {
519 1.1 mycroft if (j > 0)
520 1.1 mycroft (void)printf(", ");
521 1.19 perseant (void)printf("%dv%d", inop[j].di_inumber, inop[j].di_gen);
522 1.1 mycroft }
523 1.1 mycroft (void)printf("}");
524 1.1 mycroft if (((i/INOPB(lfsp)) % 4) == 3)
525 1.1 mycroft (void)printf("\n");
526 1.1 mycroft }
527 1.1 mycroft free(inop);
528 1.1 mycroft
529 1.1 mycroft printf("\n");
530 1.25 perseant
531 1.19 perseant if (lfsp->lfs_version == 1)
532 1.19 perseant fp = (FINFO *)((SEGSUM_V1 *)sp + 1);
533 1.19 perseant else
534 1.19 perseant fp = (FINFO *)(sp + 1);
535 1.19 perseant for (i = 0; i < sp->ss_nfinfo; i++) {
536 1.8 fvdl (void)printf(" FINFO for inode: %d version %d nblocks %d lastlength %d\n",
537 1.8 fvdl fp->fi_ino, fp->fi_version, fp->fi_nblocks,
538 1.8 fvdl fp->fi_lastlength);
539 1.1 mycroft dp = &(fp->fi_blocks[0]);
540 1.25 perseant numblocks += fp->fi_nblocks;
541 1.1 mycroft for (j = 0; j < fp->fi_nblocks; j++, dp++) {
542 1.1 mycroft (void)printf("\t%d", *dp);
543 1.1 mycroft if ((j % 8) == 7)
544 1.1 mycroft (void)printf("\n");
545 1.8 fvdl if (j == fp->fi_nblocks - 1)
546 1.8 fvdl numbytes += fp->fi_lastlength;
547 1.8 fvdl else
548 1.8 fvdl numbytes += lfsp->lfs_bsize;
549 1.1 mycroft }
550 1.1 mycroft if ((j % 8) != 0)
551 1.1 mycroft (void)printf("\n");
552 1.1 mycroft fp = (FINFO *)dp;
553 1.1 mycroft }
554 1.25 perseant
555 1.25 perseant if (datasum_check == 0)
556 1.25 perseant return (numbytes);
557 1.25 perseant
558 1.25 perseant /*
559 1.25 perseant * Now that we know the number of blocks, run back through and
560 1.25 perseant * compute the data checksum. (A bad data checksum is not enough
561 1.25 perseant * to prevent us from continuing, but it odes merit a warning.)
562 1.25 perseant */
563 1.25 perseant idp = (int32_t *)sp;
564 1.25 perseant idp += lfsp->lfs_sumsize / sizeof(int32_t);
565 1.25 perseant --idp;
566 1.25 perseant if (lfsp->lfs_version == 1) {
567 1.25 perseant fp = (FINFO *)((SEGSUM_V1 *)sp + 1);
568 1.25 perseant el_size = sizeof(unsigned long);
569 1.25 perseant } else {
570 1.25 perseant fp = (FINFO *)(sp + 1);
571 1.25 perseant el_size = sizeof(u_int32_t);
572 1.25 perseant }
573 1.25 perseant datap = (char *)malloc(el_size * numblocks);
574 1.25 perseant memset(datap, 0, el_size * numblocks);
575 1.25 perseant acc = 0;
576 1.25 perseant addr += btofsb(lfsp, lfsp->lfs_sumsize);
577 1.25 perseant buf = malloc(lfsp->lfs_bsize);
578 1.25 perseant for (i = 0; i < sp->ss_nfinfo; i++) {
579 1.25 perseant while (addr == *idp) {
580 1.25 perseant get(fd, fsbtobyte(lfsp, addr), buf, lfsp->lfs_ibsize);
581 1.25 perseant memcpy(datap + acc * el_size, buf, el_size);
582 1.25 perseant addr += btofsb(lfsp, lfsp->lfs_ibsize);
583 1.25 perseant --idp;
584 1.25 perseant ++acc;
585 1.25 perseant }
586 1.25 perseant for (j = 0; j < fp->fi_nblocks; j++) {
587 1.25 perseant get(fd, fsbtobyte(lfsp, addr), buf, lfsp->lfs_fsize);
588 1.25 perseant memcpy(datap + acc * el_size, buf, el_size);
589 1.25 perseant if (j == fp->fi_nblocks - 1)
590 1.25 perseant addr += btofsb(lfsp, fp->fi_lastlength);
591 1.25 perseant else
592 1.25 perseant addr += btofsb(lfsp, lfsp->lfs_bsize);
593 1.25 perseant ++acc;
594 1.25 perseant }
595 1.25 perseant fp = (FINFO *)&(fp->fi_blocks[fp->fi_nblocks]);
596 1.25 perseant }
597 1.25 perseant while (addr == *idp) {
598 1.25 perseant get(fd, fsbtobyte(lfsp, addr), buf, lfsp->lfs_ibsize);
599 1.25 perseant memcpy(datap + acc * el_size, buf, el_size);
600 1.25 perseant addr += btofsb(lfsp, lfsp->lfs_ibsize);
601 1.25 perseant --idp;
602 1.25 perseant ++acc;
603 1.25 perseant }
604 1.25 perseant free(buf);
605 1.25 perseant if (acc != numblocks)
606 1.25 perseant printf("** counted %d blocks but should have been %d\n",
607 1.25 perseant acc, numblocks);
608 1.25 perseant datasum = cksum(datap, numblocks * el_size);
609 1.25 perseant if (datasum != sp->ss_datasum)
610 1.25 perseant printf("** computed datasum 0x%lx does not match given datasum 0x%lx\n", (unsigned long)datasum, (unsigned long)sp->ss_datasum);
611 1.25 perseant free(datap);
612 1.25 perseant
613 1.8 fvdl return (numbytes);
614 1.1 mycroft }
615 1.1 mycroft
616 1.1 mycroft static void
617 1.19 perseant dump_segment(int fd, int segnum, daddr_t addr, struct lfs *lfsp, int dump_sb)
618 1.1 mycroft {
619 1.1 mycroft struct lfs lfs_sb, *sbp;
620 1.1 mycroft SEGSUM *sump;
621 1.19 perseant char *sumblock;
622 1.8 fvdl int did_one, nbytes, sb;
623 1.14 perseant off_t sum_offset;
624 1.14 perseant daddr_t new_addr;
625 1.1 mycroft
626 1.20 fvdl (void)printf("\nSEGMENT %lld (Disk Address 0x%llx)\n",
627 1.20 fvdl (long long)dtosn(lfsp, addr), (long long)addr);
628 1.19 perseant sum_offset = fsbtobyte(lfsp, addr);
629 1.19 perseant sumblock = malloc(lfsp->lfs_sumsize);
630 1.19 perseant
631 1.19 perseant if (lfsp->lfs_version > 1 && segnum == 0) {
632 1.24 perseant if (fsbtob(lfsp, lfsp->lfs_start) < LFS_LABELPAD) {
633 1.24 perseant /* First segment eats the disklabel */
634 1.24 perseant sum_offset += fragroundup(lfsp, LFS_LABELPAD) -
635 1.24 perseant fsbtob(lfsp, lfsp->lfs_start);
636 1.24 perseant addr += btofsb(lfsp, fragroundup(lfsp, LFS_LABELPAD)) -
637 1.24 perseant lfsp->lfs_start;
638 1.24 perseant printf("Disklabel at 0x0\n");
639 1.24 perseant }
640 1.19 perseant }
641 1.1 mycroft
642 1.1 mycroft sb = 0;
643 1.1 mycroft did_one = 0;
644 1.1 mycroft do {
645 1.19 perseant get(fd, sum_offset, sumblock, lfsp->lfs_sumsize);
646 1.1 mycroft sump = (SEGSUM *)sumblock;
647 1.19 perseant if ((lfsp->lfs_version > 1 &&
648 1.19 perseant sump->ss_ident != lfsp->lfs_ident) ||
649 1.19 perseant sump->ss_sumsum != cksum (&sump->ss_datasum,
650 1.19 perseant lfsp->lfs_sumsize - sizeof(sump->ss_sumsum))) {
651 1.1 mycroft sbp = (struct lfs *)sump;
652 1.8 fvdl if ((sb = (sbp->lfs_magic == LFS_MAGIC))) {
653 1.19 perseant printf("Superblock at 0x%x\n",
654 1.19 perseant (unsigned)btofsb(lfsp, sum_offset));
655 1.14 perseant if (dump_sb) {
656 1.14 perseant get(fd, sum_offset, &(lfs_sb.lfs_dlfs),
657 1.14 perseant sizeof(struct dlfs));
658 1.14 perseant dump_super(&lfs_sb);
659 1.14 perseant }
660 1.19 perseant if (lfsp->lfs_version > 1)
661 1.19 perseant sum_offset += fragroundup(lfsp, LFS_SBPAD);
662 1.19 perseant else
663 1.19 perseant sum_offset += LFS_SBPAD;
664 1.1 mycroft } else if (did_one)
665 1.1 mycroft break;
666 1.1 mycroft else {
667 1.20 fvdl printf("Segment at 0x%llx empty or corrupt\n",
668 1.20 fvdl (long long)addr);
669 1.1 mycroft break;
670 1.1 mycroft }
671 1.1 mycroft } else {
672 1.19 perseant nbytes = dump_sum(fd, lfsp, sump, segnum,
673 1.19 perseant btofsb(lfsp, sum_offset));
674 1.8 fvdl if (nbytes)
675 1.19 perseant sum_offset += lfsp->lfs_sumsize + nbytes;
676 1.1 mycroft else
677 1.1 mycroft sum_offset = 0;
678 1.1 mycroft did_one = 1;
679 1.1 mycroft }
680 1.14 perseant /* If the segment ends right on a boundary, it still ends */
681 1.19 perseant new_addr = btofsb(lfsp, sum_offset);
682 1.19 perseant /* printf("end daddr = 0x%lx\n", (long)new_addr); */
683 1.19 perseant if (dtosn(lfsp, new_addr) != dtosn(lfsp, addr))
684 1.14 perseant break;
685 1.1 mycroft } while (sum_offset);
686 1.1 mycroft
687 1.30 dsl free(sumblock);
688 1.1 mycroft }
689 1.1 mycroft
690 1.1 mycroft static void
691 1.19 perseant dump_super(struct lfs *lfsp)
692 1.1 mycroft {
693 1.1 mycroft int i;
694 1.1 mycroft
695 1.19 perseant (void)printf(" %s0x%-8x %s0x%-8x %s%-10d\n",
696 1.19 perseant "magic ", lfsp->lfs_magic,
697 1.19 perseant "version ", lfsp->lfs_version,
698 1.19 perseant "size ", lfsp->lfs_size);
699 1.19 perseant (void)printf(" %s%-10d %s%-10d %s%-10d\n",
700 1.19 perseant "ssize ", lfsp->lfs_ssize,
701 1.19 perseant "dsize ", lfsp->lfs_dsize,
702 1.19 perseant "bsize ", lfsp->lfs_bsize);
703 1.19 perseant (void)printf(" %s%-10d %s%-10d %s%-10d\n",
704 1.19 perseant "fsize ", lfsp->lfs_fsize,
705 1.19 perseant "frag ", lfsp->lfs_frag,
706 1.19 perseant "minfree ", lfsp->lfs_minfree);
707 1.19 perseant (void)printf(" %s%-10d %s%-10d %s%-10d\n",
708 1.19 perseant "inopb ", lfsp->lfs_inopb,
709 1.19 perseant "ifpb ", lfsp->lfs_ifpb,
710 1.19 perseant "nindir ", lfsp->lfs_nindir);
711 1.19 perseant (void)printf(" %s%-10d %s%-10d %s%-10d\n",
712 1.19 perseant "nseg ", lfsp->lfs_nseg,
713 1.19 perseant "sepb ", lfsp->lfs_sepb,
714 1.19 perseant "cleansz ", lfsp->lfs_cleansz);
715 1.19 perseant (void)printf(" %s%-10d %s0x%-8x %s%-10d\n",
716 1.19 perseant "segtabsz ", lfsp->lfs_segtabsz,
717 1.19 perseant "segmask ", lfsp->lfs_segmask,
718 1.19 perseant "segshift ", lfsp->lfs_segshift);
719 1.19 perseant (void)printf(" %s0x%-8qx %s%-10d %s0x%-8qX\n",
720 1.19 perseant "bmask ", (long long)lfsp->lfs_bmask,
721 1.19 perseant "bshift ", lfsp->lfs_bshift,
722 1.19 perseant "ffmask ", (long long)lfsp->lfs_ffmask);
723 1.19 perseant (void)printf(" %s%-10d %s0x%-8qx %s%u\n",
724 1.19 perseant "ffshift ", lfsp->lfs_ffshift,
725 1.19 perseant "fbmask ", (long long)lfsp->lfs_fbmask,
726 1.19 perseant "fbshift ", lfsp->lfs_fbshift);
727 1.19 perseant
728 1.19 perseant (void)printf(" %s%-10d %s%-10d %s0x%-8x\n",
729 1.19 perseant "sushift ", lfsp->lfs_sushift,
730 1.19 perseant "fsbtodb ", lfsp->lfs_fsbtodb,
731 1.19 perseant "cksum ", lfsp->lfs_cksum);
732 1.19 perseant (void)printf(" %s%-10d %s%-10d %s%-10d\n",
733 1.19 perseant "nclean ", lfsp->lfs_nclean,
734 1.19 perseant "dmeta ", lfsp->lfs_dmeta,
735 1.19 perseant "minfreeseg ", lfsp->lfs_minfreeseg);
736 1.19 perseant (void)printf(" %s0x%-8x %s%-9d %s%-10d\n",
737 1.19 perseant "roll_id ", lfsp->lfs_ident,
738 1.19 perseant "interleave ", lfsp->lfs_interleave,
739 1.19 perseant "sumsize ", lfsp->lfs_sumsize);
740 1.23 simonb (void)printf(" %s%-10d %s0x%-8qx\n",
741 1.23 simonb "seg0addr ", lfsp->lfs_start,
742 1.19 perseant "maxfilesize ", (long long)lfsp->lfs_maxfilesize);
743 1.19 perseant
744 1.19 perseant
745 1.19 perseant (void)printf(" Superblock disk addresses:\n ");
746 1.19 perseant for (i = 0; i < LFS_MAXNUMSB; i++) {
747 1.19 perseant (void)printf(" 0x%-8x", lfsp->lfs_sboffs[i]);
748 1.19 perseant if (i == (LFS_MAXNUMSB >> 1))
749 1.19 perseant (void)printf("\n ");
750 1.19 perseant }
751 1.19 perseant (void)printf("\n");
752 1.19 perseant
753 1.19 perseant (void)printf(" Checkpoint Info\n");
754 1.19 perseant (void)printf(" %s%-10d %s0x%-8x %s%-10d\n",
755 1.22 perseant "freehd ", lfsp->lfs_freehd,
756 1.19 perseant "idaddr ", lfsp->lfs_idaddr,
757 1.19 perseant "ifile ", lfsp->lfs_ifile);
758 1.19 perseant (void)printf(" %s%-10d %s%-10d %s%-10d\n",
759 1.19 perseant "uinodes ", lfsp->lfs_uinodes,
760 1.19 perseant "bfree ", lfsp->lfs_bfree,
761 1.19 perseant "avail ", lfsp->lfs_avail);
762 1.19 perseant (void)printf(" %s%-10d %s0x%-8x %s0x%-8x\n",
763 1.19 perseant "nfiles ", lfsp->lfs_nfiles,
764 1.19 perseant "lastseg ", lfsp->lfs_lastseg,
765 1.19 perseant "nextseg ", lfsp->lfs_nextseg);
766 1.19 perseant (void)printf(" %s0x%-8x %s0x%-8x %s%-10lld\n",
767 1.19 perseant "curseg ", lfsp->lfs_curseg,
768 1.19 perseant "offset ", lfsp->lfs_offset,
769 1.19 perseant "serial ", (long long)lfsp->lfs_serial);
770 1.19 perseant (void)printf(" tstamp %s", ctime((time_t *)&lfsp->lfs_tstamp));
771 1.1 mycroft }
772 1.1 mycroft
773 1.1 mycroft static void
774 1.19 perseant addseg(char *arg)
775 1.1 mycroft {
776 1.1 mycroft SEGLIST *p;
777 1.1 mycroft
778 1.1 mycroft if ((p = malloc(sizeof(SEGLIST))) == NULL)
779 1.2 mycroft err(1, "malloc");
780 1.1 mycroft p->next = seglist;
781 1.1 mycroft p->num = atoi(arg);
782 1.1 mycroft seglist = p;
783 1.1 mycroft }
784 1.1 mycroft
785 1.1 mycroft static void
786 1.19 perseant dump_cleaner_info(struct lfs *lfsp, void *ipage)
787 1.1 mycroft {
788 1.1 mycroft CLEANERINFO *cip;
789 1.1 mycroft
790 1.1 mycroft cip = (CLEANERINFO *)ipage;
791 1.19 perseant if (lfsp->lfs_version > 1) {
792 1.19 perseant (void)printf("free_head %d\n", cip->free_head);
793 1.19 perseant (void)printf("free_tail %d\n", cip->free_tail);
794 1.19 perseant }
795 1.17 perseant (void)printf("clean\t%d\tdirty\t%d\n",
796 1.17 perseant cip->clean, cip->dirty);
797 1.17 perseant (void)printf("bfree\t%d\tavail\t%d\n\n",
798 1.17 perseant cip->bfree, cip->avail);
799 1.1 mycroft }
800 1.1 mycroft
801 1.1 mycroft static void
802 1.19 perseant usage(void)
803 1.1 mycroft {
804 1.27 wiz (void)fprintf(stderr, "usage: dumplfs [-adiS] [-b blkno] [-I blkno] [-s segno] filesys|device\n");
805 1.1 mycroft exit(1);
806 1.1 mycroft }
807