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