dumplfs.c revision 1.53
1 /* $NetBSD: dumplfs.c,v 1.53 2015/08/12 18:27:01 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.53 2015/08/12 18:27:01 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 union lfs_blocks fipblocks; 502 int i, j, acc; 503 int ck; 504 int numbytes, numblocks; 505 char *datap; 506 struct ulfs1_dinode *inop; 507 size_t el_size; 508 u_int32_t datasum; 509 u_int32_t ssflags; 510 time_t t; 511 char *buf; 512 size_t sumstart; 513 514 sumstart = lfs_ss_getsumstart(lfsp); 515 if (lfs_ss_getmagic(lfsp, sp) != SS_MAGIC || 516 lfs_ss_getsumsum(lfsp, sp) != (ck = cksum((char *)sp + sumstart, 517 lfs_sb_getsumsize(lfsp) - sumstart))) { 518 /* Don't print "corrupt" if we're just too close to the edge */ 519 if (lfs_dtosn(lfsp, addr + LFS_FSBTODB(lfsp, 1)) == 520 lfs_dtosn(lfsp, addr)) 521 (void)printf("dumplfs: %s %d address 0x%llx\n", 522 "corrupt summary block; segment", segnum, 523 (long long)addr); 524 return -1; 525 } 526 if (lfs_sb_getversion(lfsp) > 1 && lfs_ss_getident(lfsp, sp) != lfs_sb_getident(lfsp)) { 527 (void)printf("dumplfs: %s %d address 0x%llx\n", 528 "summary from a former life; segment", segnum, 529 (long long)addr); 530 return -1; 531 } 532 533 (void)printf("Segment Summary Info at 0x%llx\n", (long long)addr); 534 ssflags = lfs_ss_getflags(lfsp, sp); 535 (void)printf(" %s0x%jx\t%s%d\t%s%d\t%s%c%c%c%c\n %s0x%x\t%s0x%x", 536 "next ", (intmax_t)lfs_ss_getnext(lfsp, sp), 537 "nfinfo ", lfs_ss_getnfinfo(lfsp, sp), 538 "ninos ", lfs_ss_getninos(lfsp, sp), 539 "flags ", (ssflags & SS_DIROP) ? 'D' : '-', 540 (ssflags & SS_CONT) ? 'C' : '-', 541 (ssflags & SS_CLEAN) ? 'L' : '-', 542 (ssflags & SS_RFW) ? 'R' : '-', 543 "sumsum ", lfs_ss_getsumsum(lfsp, sp), 544 "datasum ", lfs_ss_getdatasum(lfsp, sp)); 545 if (lfs_sb_getversion(lfsp) == 1) { 546 t = lfs_ss_getocreate(lfsp, sp); 547 (void)printf("\tcreate %s\n", ctime(&t)); 548 } else { 549 t = lfs_ss_getcreate(lfsp, sp); 550 (void)printf("\tcreate %s", ctime(&t)); 551 (void)printf(" roll_id %-8x", lfs_ss_getident(lfsp, sp)); 552 (void)printf(" serial %lld\n", 553 (long long)lfs_ss_getserial(lfsp, sp)); 554 } 555 556 /* Dump out inode disk addresses */ 557 /* XXX ondisk32 */ 558 dp = (int32_t *)sp; 559 dp += lfs_sb_getsumsize(lfsp) / sizeof(int32_t); 560 inop = malloc(lfs_sb_getbsize(lfsp)); 561 printf(" Inode addresses:"); 562 numbytes = 0; 563 numblocks = 0; 564 for (dp--, i = 0; i < lfs_ss_getninos(lfsp, sp); dp--) { 565 ++numblocks; 566 numbytes += lfs_sb_getibsize(lfsp); /* add bytes for inode block */ 567 printf("\t0x%x {", *dp); 568 get(fd, fsbtobyte(lfsp, *dp), inop, lfs_sb_getibsize(lfsp)); 569 for (j = 0; i < lfs_ss_getninos(lfsp, sp) && j < LFS_INOPB(lfsp); j++, i++) { 570 if (j > 0) 571 (void)printf(", "); 572 (void)printf("%dv%d", inop[j].di_inumber, inop[j].di_gen); 573 } 574 (void)printf("}"); 575 if (((i/LFS_INOPB(lfsp)) % 4) == 3) 576 (void)printf("\n"); 577 } 578 free(inop); 579 580 printf("\n"); 581 582 fp = SEGSUM_FINFOBASE(lfsp, sp); 583 for (i = 0; i < lfs_ss_getnfinfo(lfsp, sp); i++) { 584 (void)printf(" FINFO for inode: %ju version %u nblocks %u lastlength %u\n", 585 (uintmax_t)lfs_fi_getino(lfsp, fp), 586 lfs_fi_getversion(lfsp, fp), 587 lfs_fi_getnblocks(lfsp, fp), 588 lfs_fi_getlastlength(lfsp, fp)); 589 lfs_blocks_fromfinfo(lfsp, &fipblocks, fp); 590 numblocks += lfs_fi_getnblocks(lfsp, fp); 591 for (j = 0; j < lfs_fi_getnblocks(lfsp, fp); j++) { 592 (void)printf("\t%jd", 593 (intmax_t)lfs_blocks_get(lfsp, &fipblocks, j)); 594 if ((j % 8) == 7) 595 (void)printf("\n"); 596 if (j == lfs_fi_getnblocks(lfsp, fp) - 1) 597 numbytes += lfs_fi_getlastlength(lfsp, fp); 598 else 599 numbytes += lfs_sb_getbsize(lfsp); 600 } 601 if ((j % 8) != 0) 602 (void)printf("\n"); 603 fp = NEXT_FINFO(lfsp, fp); 604 } 605 606 if (datasum_check == 0) 607 return (numbytes); 608 609 /* 610 * Now that we know the number of blocks, run back through and 611 * compute the data checksum. (A bad data checksum is not enough 612 * to prevent us from continuing, but it odes merit a warning.) 613 */ 614 idp = (int32_t *)sp; 615 idp += lfs_sb_getsumsize(lfsp) / sizeof(int32_t); 616 --idp; 617 if (lfs_sb_getversion(lfsp) == 1) { 618 fp = (FINFO *)((SEGSUM_V1 *)sp + 1); 619 el_size = sizeof(unsigned long); 620 } else { 621 fp = (FINFO *)(sp + 1); 622 el_size = sizeof(u_int32_t); 623 } 624 datap = (char *)malloc(el_size * numblocks); 625 memset(datap, 0, el_size * numblocks); 626 acc = 0; 627 addr += lfs_btofsb(lfsp, lfs_sb_getsumsize(lfsp)); 628 buf = malloc(lfs_sb_getbsize(lfsp)); 629 for (i = 0; i < lfs_ss_getnfinfo(lfsp, sp); i++) { 630 while (addr == *idp) { 631 get(fd, fsbtobyte(lfsp, addr), buf, lfs_sb_getibsize(lfsp)); 632 memcpy(datap + acc * el_size, buf, el_size); 633 addr += lfs_btofsb(lfsp, lfs_sb_getibsize(lfsp)); 634 --idp; 635 ++acc; 636 } 637 for (j = 0; j < lfs_fi_getnblocks(lfsp, fp); j++) { 638 get(fd, fsbtobyte(lfsp, addr), buf, lfs_sb_getfsize(lfsp)); 639 memcpy(datap + acc * el_size, buf, el_size); 640 if (j == lfs_fi_getnblocks(lfsp, fp) - 1) 641 addr += lfs_btofsb(lfsp, lfs_fi_getlastlength(lfsp, fp)); 642 else 643 addr += lfs_btofsb(lfsp, lfs_sb_getbsize(lfsp)); 644 ++acc; 645 } 646 fp = NEXT_FINFO(lfsp, fp); 647 } 648 while (addr == *idp) { 649 get(fd, fsbtobyte(lfsp, addr), buf, lfs_sb_getibsize(lfsp)); 650 memcpy(datap + acc * el_size, buf, el_size); 651 addr += lfs_btofsb(lfsp, lfs_sb_getibsize(lfsp)); 652 --idp; 653 ++acc; 654 } 655 free(buf); 656 if (acc != numblocks) 657 printf("** counted %d blocks but should have been %d\n", 658 acc, numblocks); 659 datasum = cksum(datap, numblocks * el_size); 660 if (datasum != lfs_ss_getdatasum(lfsp, sp)) 661 printf("** computed datasum 0x%lx does not match given datasum 0x%lx\n", (unsigned long)datasum, (unsigned long)lfs_ss_getdatasum(lfsp, sp)); 662 free(datap); 663 664 return (numbytes); 665 } 666 667 static void 668 dump_segment(int fd, int segnum, daddr_t addr, struct lfs *lfsp, int dump_sb) 669 { 670 struct lfs lfs_sb, *sbp; 671 SEGSUM *sump; 672 size_t sumstart; 673 char *sumblock; 674 int did_one, nbytes, sb; 675 off_t sum_offset; 676 daddr_t new_addr; 677 678 (void)printf("\nSEGMENT %lld (Disk Address 0x%llx)\n", 679 (long long)lfs_dtosn(lfsp, addr), (long long)addr); 680 sum_offset = fsbtobyte(lfsp, addr); 681 sumblock = malloc(lfs_sb_getsumsize(lfsp)); 682 683 if (lfs_sb_getversion(lfsp) > 1 && segnum == 0) { 684 if (lfs_fsbtob(lfsp, lfs_sb_gets0addr(lfsp)) < LFS_LABELPAD) { 685 /* First segment eats the disklabel */ 686 sum_offset += lfs_fragroundup(lfsp, LFS_LABELPAD) - 687 lfs_fsbtob(lfsp, lfs_sb_gets0addr(lfsp)); 688 addr += lfs_btofsb(lfsp, lfs_fragroundup(lfsp, LFS_LABELPAD)) - 689 lfs_sb_gets0addr(lfsp); 690 printf("Disklabel at 0x0\n"); 691 } 692 } 693 694 sb = 0; 695 did_one = 0; 696 do { 697 get(fd, sum_offset, sumblock, lfs_sb_getsumsize(lfsp)); 698 sump = (SEGSUM *)sumblock; 699 sumstart = lfs_ss_getsumstart(lfsp); 700 if ((lfs_sb_getversion(lfsp) > 1 && 701 lfs_ss_getident(lfsp, sump) != lfs_sb_getident(lfsp)) || 702 lfs_ss_getsumsum(lfsp, sump) != 703 cksum((char *)sump + sumstart, 704 lfs_sb_getsumsize(lfsp) - sumstart)) { 705 sbp = (struct lfs *)sump; 706 if ((sb = (sbp->lfs_dlfs_u.u_32.dlfs_magic == LFS_MAGIC))) { 707 printf("Superblock at 0x%x\n", 708 (unsigned)lfs_btofsb(lfsp, sum_offset)); 709 if (dump_sb) { 710 __CTASSERT(sizeof(struct dlfs) == 711 sizeof(struct dlfs64)); 712 get(fd, sum_offset, &(lfs_sb.lfs_dlfs_u), 713 sizeof(struct dlfs)); 714 dump_super(&lfs_sb); 715 } 716 if (lfs_sb_getversion(lfsp) > 1) 717 sum_offset += lfs_fragroundup(lfsp, LFS_SBPAD); 718 else 719 sum_offset += LFS_SBPAD; 720 } else if (did_one) 721 break; 722 else { 723 printf("Segment at 0x%llx empty or corrupt\n", 724 (long long)addr); 725 break; 726 } 727 } else { 728 nbytes = dump_sum(fd, lfsp, sump, segnum, 729 lfs_btofsb(lfsp, sum_offset)); 730 if (nbytes >= 0) 731 sum_offset += lfs_sb_getsumsize(lfsp) + nbytes; 732 else 733 sum_offset = 0; 734 did_one = 1; 735 } 736 /* If the segment ends right on a boundary, it still ends */ 737 new_addr = lfs_btofsb(lfsp, sum_offset); 738 /* printf("end daddr = 0x%lx\n", (long)new_addr); */ 739 if (lfs_dtosn(lfsp, new_addr) != lfs_dtosn(lfsp, addr)) 740 break; 741 } while (sum_offset); 742 743 free(sumblock); 744 } 745 746 static void 747 dump_super(struct lfs *lfsp) 748 { 749 time_t stamp; 750 int i; 751 752 (void)printf(" %s0x%-8x %s0x%-8x %s%-10ju\n", 753 "magic ", lfsp->lfs_dlfs_u.u_32.dlfs_magic, 754 "version ", lfs_sb_getversion(lfsp), 755 "size ", (uintmax_t)lfs_sb_getsize(lfsp)); 756 (void)printf(" %s%-10d %s%-10ju %s%-10d\n", 757 "ssize ", lfs_sb_getssize(lfsp), 758 "dsize ", (uintmax_t)lfs_sb_getdsize(lfsp), 759 "bsize ", lfs_sb_getbsize(lfsp)); 760 (void)printf(" %s%-10d %s%-10d %s%-10d\n", 761 "fsize ", lfs_sb_getfsize(lfsp), 762 "frag ", lfs_sb_getfrag(lfsp), 763 "minfree ", lfs_sb_getminfree(lfsp)); 764 (void)printf(" %s%-10d %s%-10d %s%-10d\n", 765 "inopb ", lfs_sb_getinopb(lfsp), 766 "ifpb ", lfs_sb_getifpb(lfsp), 767 "nindir ", lfs_sb_getnindir(lfsp)); 768 (void)printf(" %s%-10d %s%-10d %s%-10d\n", 769 "nseg ", lfs_sb_getnseg(lfsp), 770 "sepb ", lfs_sb_getsepb(lfsp), 771 "cleansz ", lfs_sb_getcleansz(lfsp)); 772 (void)printf(" %s%-10d %s0x%-8x %s%-10d\n", 773 "segtabsz ", lfs_sb_getsegtabsz(lfsp), 774 "segmask ", lfs_sb_getsegmask(lfsp), 775 "segshift ", lfs_sb_getsegshift(lfsp)); 776 (void)printf(" %s0x%-8jx %s%-10d %s0x%-8jX\n", 777 "bmask ", (uintmax_t)lfs_sb_getbmask(lfsp), 778 "bshift ", lfs_sb_getbshift(lfsp), 779 "ffmask ", (uintmax_t)lfs_sb_getffmask(lfsp)); 780 (void)printf(" %s%-10d %s0x%-8jx %s%u\n", 781 "ffshift ", lfs_sb_getffshift(lfsp), 782 "fbmask ", (uintmax_t)lfs_sb_getfbmask(lfsp), 783 "fbshift ", lfs_sb_getfbshift(lfsp)); 784 785 (void)printf(" %s%-10d %s%-10d %s0x%-8x\n", 786 "sushift ", lfs_sb_getsushift(lfsp), 787 "fsbtodb ", lfs_sb_getfsbtodb(lfsp), 788 "cksum ", lfs_sb_getcksum(lfsp)); 789 (void)printf(" %s%-10d %s%-10d %s%-10d\n", 790 "nclean ", lfs_sb_getnclean(lfsp), 791 "dmeta ", lfs_sb_getdmeta(lfsp), 792 "minfreeseg ", lfs_sb_getminfreeseg(lfsp)); 793 (void)printf(" %s0x%-8x %s%-9d %s%-10d\n", 794 "roll_id ", lfs_sb_getident(lfsp), 795 "interleave ", lfs_sb_getinterleave(lfsp), 796 "sumsize ", lfs_sb_getsumsize(lfsp)); 797 (void)printf(" %s%-10jd %s0x%-8jx\n", 798 "seg0addr ", (intmax_t)lfs_sb_gets0addr(lfsp), 799 "maxfilesize ", (uintmax_t)lfs_sb_getmaxfilesize(lfsp)); 800 801 802 (void)printf(" Superblock disk addresses:\n "); 803 for (i = 0; i < LFS_MAXNUMSB; i++) { 804 (void)printf(" 0x%-8jx", (intmax_t)lfs_sb_getsboff(lfsp, i)); 805 if (i == (LFS_MAXNUMSB >> 1)) 806 (void)printf("\n "); 807 } 808 (void)printf("\n"); 809 810 (void)printf(" Checkpoint Info\n"); 811 (void)printf(" %s%-10d %s0x%-8jx %s%-10d\n", 812 "freehd ", lfs_sb_getfreehd(lfsp), 813 "idaddr ", (intmax_t)lfs_sb_getidaddr(lfsp), 814 "ifile ", lfs_sb_getifile(lfsp)); 815 (void)printf(" %s%-10d %s%-10jd %s%-10jd\n", 816 "uinodes ", lfs_sb_getuinodes(lfsp), 817 "bfree ", (intmax_t)lfs_sb_getbfree(lfsp), 818 "avail ", (intmax_t)lfs_sb_getavail(lfsp)); 819 (void)printf(" %s%-10d %s0x%-8jx %s0x%-8jx\n", 820 "nfiles ", lfs_sb_getnfiles(lfsp), 821 "lastseg ", (uintmax_t)lfs_sb_getlastseg(lfsp), 822 "nextseg ", (uintmax_t)lfs_sb_getnextseg(lfsp)); 823 (void)printf(" %s0x%-8jx %s0x%-8jx %s%-10ju\n", 824 "curseg ", (uintmax_t)lfs_sb_getcurseg(lfsp), 825 "offset ", (uintmax_t)lfs_sb_getoffset(lfsp), 826 "serial ", (uintmax_t)lfs_sb_getserial(lfsp)); 827 stamp = lfs_sb_gettstamp(lfsp); 828 (void)printf(" tstamp %s", ctime(&stamp)); 829 } 830 831 static void 832 addseg(char *arg) 833 { 834 SEGLIST *p; 835 836 if ((p = malloc(sizeof(SEGLIST))) == NULL) 837 err(1, "malloc"); 838 p->next = seglist; 839 p->num = atoi(arg); 840 seglist = p; 841 } 842 843 static void 844 dump_cleaner_info(struct lfs *lfsp, void *ipage) 845 { 846 CLEANERINFO *cip; 847 848 cip = (CLEANERINFO *)ipage; 849 if (lfs_sb_getversion(lfsp) > 1) { 850 (void)printf("free_head %ju\n", 851 (uintmax_t)lfs_ci_getfree_head(lfsp, cip)); 852 (void)printf("free_tail %ju\n", 853 (uintmax_t)lfs_ci_getfree_tail(lfsp, cip)); 854 } 855 (void)printf("clean\t%u\tdirty\t%u\n", 856 lfs_ci_getclean(lfsp, cip), lfs_ci_getdirty(lfsp, cip)); 857 (void)printf("bfree\t%jd\tavail\t%jd\n\n", 858 (intmax_t)lfs_ci_getbfree(lfsp, cip), 859 (intmax_t)lfs_ci_getavail(lfsp, cip)); 860 } 861 862 static void 863 usage(void) 864 { 865 (void)fprintf(stderr, "usage: dumplfs [-adiS] [-b blkno] [-I blkno] [-s segno] filesys|device\n"); 866 exit(1); 867 } 868
Indexes created Sun Sep 28 07:09:56 GMT 2025