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