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