dumplfs.c revision 1.16
1 /* $NetBSD: dumplfs.c,v 1.16 2000/08/25 05:27:49 toshii 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. All advertising materials mentioning features or use of this software 16 * must display the following acknowledgement: 17 * This product includes software developed by the University of 18 * California, Berkeley and its contributors. 19 * 4. Neither the name of the University nor the names of its contributors 20 * may be used to endorse or promote products derived from this software 21 * without specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 */ 35 36 #include <sys/cdefs.h> 37 38 #ifndef lint 39 __COPYRIGHT( 40 "@(#) Copyright (c) 1991, 1993\n\ 41 The Regents of the University of California. All rights reserved.\n"); 42 #endif /* not lint */ 43 44 #ifndef lint 45 #if 0 46 static char sccsid[] = "@(#)dumplfs.c 8.5 (Berkeley) 5/24/95"; 47 #else 48 __RCSID("$NetBSD: dumplfs.c,v 1.16 2000/08/25 05:27:49 toshii Exp $"); 49 #endif 50 #endif /* not lint */ 51 52 #include <sys/param.h> 53 #include <sys/ucred.h> 54 #include <sys/mount.h> 55 #include <sys/time.h> 56 57 #include <ufs/ufs/dinode.h> 58 #include <ufs/lfs/lfs.h> 59 60 #include <err.h> 61 #include <errno.h> 62 #include <fcntl.h> 63 #include <fstab.h> 64 #include <stdlib.h> 65 #include <stdio.h> 66 #include <string.h> 67 #include <unistd.h> 68 #include "extern.h" 69 70 static void addseg __P((char *)); 71 static void dump_cleaner_info __P((struct lfs *, void *)); 72 static void dump_dinode __P((struct dinode *)); 73 static void dump_ifile __P((int, struct lfs *, int, int)); 74 static int dump_ipage_ifile __P((int, IFILE *, int)); 75 static int dump_ipage_segusage __P((struct lfs *, int, IFILE *, int)); 76 static void dump_segment __P((int, int, daddr_t, struct lfs *, int)); 77 static int dump_sum __P((int, struct lfs *, SEGSUM *, int, daddr_t)); 78 static void dump_super __P((struct lfs *)); 79 static void usage __P((void)); 80 81 int main __P((int, char *[])); 82 83 extern u_long cksum __P((void *, size_t)); 84 85 typedef struct seglist SEGLIST; 86 struct seglist { 87 SEGLIST *next; 88 int num; 89 }; 90 SEGLIST *seglist; 91 92 char *special; 93 94 /* Segment Usage formats */ 95 #define print_suheader \ 96 (void)printf("segnum\tflags\tnbytes\tninos\tnsums\tlastmod\n") 97 98 #define print_suentry(i, sp) \ 99 (void)printf("%d\t%c%c%c\t%d\t%d\t%d\t%s", i, \ 100 (((sp)->su_flags & SEGUSE_ACTIVE) ? 'A' : ' '), \ 101 (((sp)->su_flags & SEGUSE_DIRTY) ? 'D' : 'C'), \ 102 (((sp)->su_flags & SEGUSE_SUPERBLOCK) ? 'S' : ' '), \ 103 (sp)->su_nbytes, (sp)->su_ninos, (sp)->su_nsums, \ 104 ctime((time_t *)&(sp)->su_lastmod)) 105 106 /* Ifile formats */ 107 #define print_iheader \ 108 (void)printf("inum\tstatus\tversion\tdaddr\t\tfreeptr\n") 109 #define print_ientry(i, ip) \ 110 if (ip->if_daddr == LFS_UNUSED_DADDR) \ 111 (void)printf("%d\tFREE\t%d\t \t\t%d\n", \ 112 i, ip->if_version, ip->if_nextfree); \ 113 else \ 114 (void)printf("%d\tINUSE\t%d\t%8X \n", \ 115 i, ip->if_version, ip->if_daddr) 116 117 #define datobyte(fs, da) /* disk address to bytes */ \ 118 (((off_t)(da)) << ((fs)->lfs_bshift - (fs)->lfs_fsbtodb)) 119 120 int 121 main(argc, argv) 122 int argc; 123 char *argv[]; 124 { 125 struct lfs lfs_sb1, lfs_sb2, *lfs_master; 126 daddr_t seg_addr, idaddr, sbdaddr; 127 int ch, do_allsb, do_ientries, fd, segnum; 128 129 do_allsb = 0; 130 do_ientries = 0; 131 idaddr = 0x0; 132 sbdaddr = 0x0; 133 while ((ch = getopt(argc, argv, "ab:iI:s:")) != -1) 134 switch(ch) { 135 case 'a': /* Dump all superblocks */ 136 do_allsb = 1; 137 break; 138 case 'b': /* Use this superblock */ 139 sbdaddr = strtol(optarg, NULL, 0); 140 break; 141 case 'i': /* Dump ifile entries */ 142 do_ientries = 1; 143 break; 144 case 'I': /* Use this ifile inode */ 145 idaddr = strtol(optarg, NULL, 0); 146 break; 147 case 's': /* Dump out these segments */ 148 addseg(optarg); 149 break; 150 default: 151 usage(); 152 } 153 argc -= optind; 154 argv += optind; 155 156 if (argc != 1) 157 usage(); 158 159 special = argv[0]; 160 if ((fd = open(special, O_RDONLY, 0)) < 0) 161 err(1, "%s", special); 162 163 if (sbdaddr == 0x0) { 164 /* Read the first superblock */ 165 get(fd, LFS_LABELPAD, &(lfs_sb1.lfs_dlfs), sizeof(struct dlfs)); 166 167 /* 168 * Read the second superblock and figure out which check point is 169 * most up to date. 170 */ 171 get(fd, 172 datobyte(&lfs_sb1, lfs_sb1.lfs_sboffs[1]), 173 &(lfs_sb2.lfs_dlfs), sizeof(struct dlfs)); 174 175 lfs_master = &lfs_sb1; 176 if (lfs_sb1.lfs_tstamp > lfs_sb2.lfs_tstamp) { 177 lfs_master = &lfs_sb2; 178 sbdaddr = 179 btodb(datobyte(&lfs_sb1, lfs_sb1.lfs_sboffs[1])); 180 } else 181 sbdaddr = btodb(LFS_LABELPAD); 182 } else { 183 /* Read the first superblock */ 184 get(fd, dbtob((off_t)sbdaddr), &(lfs_sb1.lfs_dlfs), 185 sizeof(struct dlfs)); 186 lfs_master = &lfs_sb1; 187 } 188 189 (void)printf("Master Superblock at 0x%x:\n", sbdaddr); 190 dump_super(lfs_master); 191 192 dump_ifile(fd, lfs_master, do_ientries, idaddr); 193 194 if (seglist != NULL) 195 for (; seglist != NULL; seglist = seglist->next) { 196 seg_addr = lfs_master->lfs_sboffs[0] + seglist->num * 197 (lfs_master->lfs_ssize << lfs_master->lfs_fsbtodb); 198 dump_segment(fd, 199 seglist->num, seg_addr, lfs_master, do_allsb); 200 } 201 else 202 for (segnum = 0, seg_addr = lfs_master->lfs_sboffs[0]; 203 segnum < lfs_master->lfs_nseg; segnum++, seg_addr += 204 lfs_master->lfs_ssize << lfs_master->lfs_fsbtodb) 205 dump_segment(fd, 206 segnum, seg_addr, lfs_master, do_allsb); 207 208 (void)close(fd); 209 exit(0); 210 } 211 212 /* 213 * We are reading all the blocks of an inode and dumping out the ifile table. 214 * This code could be tighter, but this is a first pass at getting the stuff 215 * printed out rather than making this code incredibly efficient. 216 */ 217 static void 218 dump_ifile(fd, lfsp, do_ientries, addr) 219 int fd; 220 struct lfs *lfsp; 221 int do_ientries; 222 daddr_t addr; 223 { 224 IFILE *ipage; 225 struct dinode *dip, *dpage; 226 daddr_t *addrp, *dindir, *iaddrp, *indir; 227 int block_limit, i, inum, j, nblocks, psize; 228 229 psize = lfsp->lfs_bsize; 230 if (!addr) 231 addr = lfsp->lfs_idaddr; 232 233 if (!(dpage = malloc(psize))) 234 err(1, "malloc"); 235 get(fd, datobyte(lfsp, addr), dpage, psize); 236 237 for (dip = dpage + INOPB(lfsp) - 1; dip >= dpage; --dip) 238 if (dip->di_inumber == LFS_IFILE_INUM) 239 break; 240 241 if (dip < dpage) 242 errx(1, "unable to locate ifile inode at disk address 0x%x", 243 addr); 244 245 (void)printf("\nIFILE inode\n"); 246 dump_dinode(dip); 247 248 (void)printf("\nIFILE contents\n"); 249 nblocks = dip->di_size >> lfsp->lfs_bshift; 250 block_limit = MIN(nblocks, NDADDR); 251 252 /* Get the direct block */ 253 if ((ipage = malloc(psize)) == NULL) 254 err(1, "malloc"); 255 for (inum = 0, addrp = dip->di_db, i = 0; i < block_limit; 256 i++, addrp++) { 257 get(fd, datobyte(lfsp, *addrp), ipage, psize); 258 if (i < lfsp->lfs_cleansz) { 259 dump_cleaner_info(lfsp, ipage); 260 print_suheader; 261 continue; 262 } 263 264 if (i < (lfsp->lfs_segtabsz + lfsp->lfs_cleansz)) { 265 inum = dump_ipage_segusage(lfsp, inum, ipage, 266 lfsp->lfs_sepb); 267 if (!inum) { 268 if(!do_ientries) 269 goto e0; 270 else 271 print_iheader; 272 } 273 } else 274 inum = dump_ipage_ifile(inum, ipage, lfsp->lfs_ifpb); 275 276 } 277 278 if (nblocks <= NDADDR) 279 goto e0; 280 281 /* Dump out blocks off of single indirect block */ 282 if (!(indir = malloc(psize))) 283 err(1, "malloc"); 284 get(fd, datobyte(lfsp, dip->di_ib[0]), indir, psize); 285 block_limit = MIN(i + lfsp->lfs_nindir, nblocks); 286 for (addrp = indir; i < block_limit; i++, addrp++) { 287 if (*addrp == LFS_UNUSED_DADDR) 288 break; 289 get(fd, datobyte(lfsp, *addrp), ipage, psize); 290 if (i < lfsp->lfs_cleansz) { 291 dump_cleaner_info(lfsp, ipage); 292 continue; 293 } else 294 i -= lfsp->lfs_cleansz; 295 296 if (i < lfsp->lfs_segtabsz) { 297 inum = dump_ipage_segusage(lfsp, inum, ipage, 298 lfsp->lfs_sepb); 299 if (!inum) { 300 if(!do_ientries) 301 goto e1; 302 else 303 print_iheader; 304 } 305 } else 306 inum = dump_ipage_ifile(inum, ipage, lfsp->lfs_ifpb); 307 } 308 309 if (nblocks <= lfsp->lfs_nindir * lfsp->lfs_ifpb) 310 goto e1; 311 312 /* Get the double indirect block */ 313 if (!(dindir = malloc(psize))) 314 err(1, "malloc"); 315 get(fd, datobyte(lfsp, dip->di_ib[1]), dindir, psize); 316 for (iaddrp = dindir, j = 0; j < lfsp->lfs_nindir; j++, iaddrp++) { 317 if (*iaddrp == LFS_UNUSED_DADDR) 318 break; 319 get(fd, datobyte(lfsp, *iaddrp), indir, psize); 320 block_limit = MIN(i + lfsp->lfs_nindir, nblocks); 321 for (addrp = indir; i < block_limit; i++, addrp++) { 322 if (*addrp == LFS_UNUSED_DADDR) 323 break; 324 get(fd, datobyte(lfsp, *addrp), ipage, psize); 325 if (i < lfsp->lfs_cleansz) { 326 dump_cleaner_info(lfsp, ipage); 327 continue; 328 } else 329 i -= lfsp->lfs_cleansz; 330 331 if (i < lfsp->lfs_segtabsz) { 332 inum = dump_ipage_segusage(lfsp, 333 inum, ipage, lfsp->lfs_sepb); 334 if (!inum) { 335 if(!do_ientries) 336 goto e2; 337 else 338 print_iheader; 339 } 340 } else 341 inum = dump_ipage_ifile(inum, 342 ipage, lfsp->lfs_ifpb); 343 } 344 } 345 e2: free(dindir); 346 e1: free(indir); 347 e0: free(dpage); 348 free(ipage); 349 } 350 351 static int 352 dump_ipage_ifile(i, pp, tot) 353 int i; 354 IFILE *pp; 355 int tot; 356 { 357 IFILE *ip; 358 int cnt, max; 359 360 max = i + tot; 361 362 for (ip = pp, cnt = i; cnt < max; cnt++, ip++) 363 print_ientry(cnt, ip); 364 return (max); 365 } 366 367 static int 368 dump_ipage_segusage(lfsp, i, pp, tot) 369 struct lfs *lfsp; 370 int i; 371 IFILE *pp; 372 int tot; 373 { 374 SEGUSE *sp; 375 int cnt, max; 376 struct seglist *slp; 377 378 max = i + tot; 379 for (sp = (SEGUSE *)pp, cnt = i; 380 cnt < lfsp->lfs_nseg && cnt < max; cnt++, sp++) { 381 if (seglist == NULL) 382 print_suentry(cnt, sp); 383 else { 384 for (slp = seglist; slp != NULL; slp = slp->next) 385 if (cnt == slp->num) { 386 print_suentry(cnt, sp); 387 break; 388 } 389 } 390 } 391 if (max >= lfsp->lfs_nseg) 392 return (0); 393 else 394 return (max); 395 } 396 397 static void 398 dump_dinode(dip) 399 struct dinode *dip; 400 { 401 int i; 402 time_t at, mt, ct; 403 404 at = dip->di_atime; 405 mt = dip->di_mtime; 406 ct = dip->di_ctime; 407 408 (void)printf("%s%d\t%s%d\t%s%d\t%s%d\t%s%qu\n", 409 "mode ", dip->di_mode, 410 "nlink ", dip->di_nlink, 411 "uid ", dip->di_uid, 412 "gid ", dip->di_gid, 413 "size ", (long long)dip->di_size); 414 (void)printf("%s%s%s%s%s%s", 415 "atime ", ctime(&at), 416 "mtime ", ctime(&mt), 417 "ctime ", ctime(&ct)); 418 (void)printf("inum %d\n", dip->di_inumber); 419 (void)printf("Direct Addresses\n"); 420 for (i = 0; i < NDADDR; i++) { 421 (void)printf("\t0x%x", dip->di_db[i]); 422 if ((i % 6) == 5) 423 (void)printf("\n"); 424 } 425 for (i = 0; i < NIADDR; i++) 426 (void)printf("\t0x%x", dip->di_ib[i]); 427 (void)printf("\n"); 428 } 429 430 static int 431 dump_sum(fd, lfsp, sp, segnum, addr) 432 struct lfs *lfsp; 433 SEGSUM *sp; 434 int fd, segnum; 435 daddr_t addr; 436 { 437 FINFO *fp; 438 daddr_t *dp; 439 int i, j; 440 int ck; 441 int numbytes; 442 struct dinode *inop; 443 444 if (sp->ss_magic != SS_MAGIC || 445 sp->ss_sumsum != (ck = cksum(&sp->ss_datasum, 446 LFS_SUMMARY_SIZE - sizeof(sp->ss_sumsum)))) { 447 /* Don't print "corrupt" if we're just too close to the edge */ 448 if (datosn(lfsp, addr + fsbtodb(lfsp, lfsp->lfs_bsize)) == 449 datosn(lfsp, addr)) 450 (void)printf("dumplfs: %s %d address 0x%x\n", 451 "corrupt summary block; segment", segnum, 452 addr); 453 return(0); 454 } 455 456 (void)printf("Segment Summary Info at 0x%x\n", addr); 457 (void)printf(" %s0x%x\t%s%d\t%s%d\t%s%c%c\n %s0x%x\t%s0x%x", 458 "next ", sp->ss_next, 459 "nfinfo ", sp->ss_nfinfo, 460 "ninos ", sp->ss_ninos, 461 "flags ", (sp->ss_flags & SS_DIROP) ? 'D' : '-', 462 (sp->ss_flags & SS_CONT) ? 'C' : '-', 463 "sumsum ", sp->ss_sumsum, 464 "datasum ", sp->ss_datasum ); 465 (void)printf("\tcreate %s", ctime((time_t *)&sp->ss_create)); 466 467 /* Dump out inode disk addresses */ 468 dp = (daddr_t *)sp; 469 dp += LFS_SUMMARY_SIZE / sizeof(daddr_t); 470 inop = malloc(1 << lfsp->lfs_bshift); 471 printf(" Inode addresses:"); 472 numbytes = 0; 473 for (dp--, i = 0; i < sp->ss_ninos; dp--) { 474 numbytes += lfsp->lfs_bsize; /* add bytes for inode block */ 475 printf("\t0x%x {", *dp); 476 get(fd, datobyte(lfsp, *dp), inop, (1 << lfsp->lfs_bshift)); 477 for (j = 0; i < sp->ss_ninos && j < INOPB(lfsp); j++, i++) { 478 if (j > 0) 479 (void)printf(", "); 480 (void)printf("%d", inop[j].di_inumber); 481 } 482 (void)printf("}"); 483 if (((i/INOPB(lfsp)) % 4) == 3) 484 (void)printf("\n"); 485 } 486 free(inop); 487 488 printf("\n"); 489 for (fp = (FINFO *)(sp + 1), i = 0; i < sp->ss_nfinfo; i++) { 490 (void)printf(" FINFO for inode: %d version %d nblocks %d lastlength %d\n", 491 fp->fi_ino, fp->fi_version, fp->fi_nblocks, 492 fp->fi_lastlength); 493 dp = &(fp->fi_blocks[0]); 494 for (j = 0; j < fp->fi_nblocks; j++, dp++) { 495 (void)printf("\t%d", *dp); 496 if ((j % 8) == 7) 497 (void)printf("\n"); 498 if (j == fp->fi_nblocks - 1) 499 numbytes += fp->fi_lastlength; 500 else 501 numbytes += lfsp->lfs_bsize; 502 } 503 if ((j % 8) != 0) 504 (void)printf("\n"); 505 fp = (FINFO *)dp; 506 } 507 return (numbytes); 508 } 509 510 static void 511 dump_segment(fd, segnum, addr, lfsp, dump_sb) 512 int fd, segnum; 513 daddr_t addr; 514 struct lfs *lfsp; 515 int dump_sb; 516 { 517 struct lfs lfs_sb, *sbp; 518 SEGSUM *sump; 519 char sumblock[LFS_SUMMARY_SIZE]; 520 int did_one, nbytes, sb; 521 off_t sum_offset; 522 daddr_t new_addr; 523 524 (void)printf("\nSEGMENT %d (Disk Address 0x%x)\n", 525 /* addr >> (lfsp->lfs_segshift - daddr_shift), */ 526 datosn(lfsp, addr), 527 addr); 528 sum_offset = datobyte(lfsp, addr); 529 530 sb = 0; 531 did_one = 0; 532 do { 533 get(fd, sum_offset, sumblock, LFS_SUMMARY_SIZE); 534 sump = (SEGSUM *)sumblock; 535 if (sump->ss_sumsum != cksum (&sump->ss_datasum, 536 LFS_SUMMARY_SIZE - sizeof(sump->ss_sumsum))) { 537 sbp = (struct lfs *)sump; 538 if ((sb = (sbp->lfs_magic == LFS_MAGIC))) { 539 if (dump_sb) { 540 get(fd, sum_offset, &(lfs_sb.lfs_dlfs), 541 sizeof(struct dlfs)); 542 (void)printf("\nSuperblock at 0x%x:\n", 543 (unsigned)btodb(sum_offset)); 544 dump_super(&lfs_sb); 545 (void)printf("%s","\n"); 546 } 547 sum_offset += LFS_SBPAD; 548 } else if (did_one) 549 break; 550 else { 551 printf("Segment at 0x%x corrupt\n", addr); 552 break; 553 } 554 } else { 555 nbytes = dump_sum(fd, lfsp, sump, segnum, sum_offset >> 556 (lfsp->lfs_bshift - lfsp->lfs_fsbtodb)); 557 if (nbytes) 558 sum_offset += LFS_SUMMARY_SIZE + nbytes; 559 else 560 sum_offset = 0; 561 did_one = 1; 562 } 563 /* If the segment ends right on a boundary, it still ends */ 564 new_addr = sum_offset >> (lfsp->lfs_bshift - lfsp->lfs_fsbtodb); 565 if (datosn(lfsp, new_addr) != datosn(lfsp, addr)) 566 break; 567 } while (sum_offset); 568 569 return; 570 } 571 572 static void 573 dump_super(lfsp) 574 struct lfs *lfsp; 575 { 576 int i; 577 578 (void)printf("%s0x%x\t%s0x%x\t%s%d\t%s%d\n", 579 "magic ", lfsp->lfs_magic, 580 "version ", lfsp->lfs_version, 581 "size ", lfsp->lfs_size, 582 "ssize ", lfsp->lfs_ssize); 583 (void)printf("%s%d\t\t%s%d\t%s%d\t%s%d\n", 584 "dsize ", lfsp->lfs_dsize, 585 "bsize ", lfsp->lfs_bsize, 586 "fsize ", lfsp->lfs_fsize, 587 "frag ", lfsp->lfs_frag); 588 589 (void)printf("%s%d\t\t%s%d\t%s%d\t%s%d\n", 590 "minfree ", lfsp->lfs_minfree, 591 "inopb ", lfsp->lfs_inopb, 592 "ifpb ", lfsp->lfs_ifpb, 593 "nindir ", lfsp->lfs_nindir); 594 595 (void)printf("%s%d\t\t%s%d\t%s%d\t%s%d\n", 596 "nseg ", lfsp->lfs_nseg, 597 "nspf ", lfsp->lfs_nspf, 598 "cleansz ", lfsp->lfs_cleansz, 599 "segtabsz ", lfsp->lfs_segtabsz); 600 601 (void)printf("%s0x%x\t%s%d\t%s0x%qX\t%s%d\n", 602 "segmask ", lfsp->lfs_segmask, 603 "segshift ", lfsp->lfs_segshift, 604 "bmask ", (long long)lfsp->lfs_bmask, 605 "bshift ", lfsp->lfs_bshift); 606 607 (void)printf("%s0x%qX\t\t%s%d\t%s0x%qX\t%s%u\n", 608 "ffmask ", (long long)lfsp->lfs_ffmask, 609 "ffshift ", lfsp->lfs_ffshift, 610 "fbmask ", (long long)lfsp->lfs_fbmask, 611 "fbshift ", lfsp->lfs_fbshift); 612 613 (void)printf("%s%d\t%s%d\t%s0x%x\t%s0x%qx\n", 614 "sushift ", lfsp->lfs_sushift, 615 "fsbtodb ", lfsp->lfs_fsbtodb, 616 "cksum ", lfsp->lfs_cksum, 617 "maxfilesize ", (long long)lfsp->lfs_maxfilesize); 618 619 (void)printf("Superblock disk addresses:\t"); 620 for (i = 0; i < LFS_MAXNUMSB; i++) { 621 (void)printf(" 0x%x", lfsp->lfs_sboffs[i]); 622 if ( i == (LFS_MAXNUMSB >> 1)) 623 (void)printf("\n\t\t\t\t"); 624 } 625 (void)printf("\n"); 626 627 (void)printf("Checkpoint Info\n"); 628 (void)printf("%s%d\t%s0x%x\t%s%d\n", 629 "free ", lfsp->lfs_free, 630 "idaddr ", lfsp->lfs_idaddr, 631 "ifile ", lfsp->lfs_ifile); 632 (void)printf("%s%d\t%s%d\t%s%d\n", 633 "bfree ", lfsp->lfs_bfree, 634 "avail ", lfsp->lfs_avail, 635 "uinodes ", lfsp->lfs_uinodes); 636 (void)printf("%s%d\t%s0x%x\t%s0x%x\n%s0x%x\t%s0x%x\t", 637 "nfiles ", lfsp->lfs_nfiles, 638 "lastseg ", lfsp->lfs_lastseg, 639 "nextseg ", lfsp->lfs_nextseg, 640 "curseg ", lfsp->lfs_curseg, 641 "offset ", lfsp->lfs_offset); 642 (void)printf("tstamp %s", ctime((time_t *)&lfsp->lfs_tstamp)); 643 #if 0 /* This is no longer stored on disk! --ks */ 644 (void)printf("\nIn-Memory Information\n"); 645 (void)printf("%s%d\t%s0x%x\t%s%d%s%d\t%s%d\n", 646 "seglock ", lfsp->lfs_seglock, 647 "iocount ", lfsp->lfs_iocount, 648 "writer ", lfsp->lfs_writer, 649 "dirops ", lfsp->lfs_dirops, 650 "doifile ", lfsp->lfs_doifile); 651 (void)printf("%s%d\t%s%d\t%s0x%x\t%s%d\n", 652 "nactive ", lfsp->lfs_nactive, 653 "fmod ", lfsp->lfs_fmod, 654 "clean ", lfsp->lfs_clean, 655 "ronly ", lfsp->lfs_ronly); 656 #endif 657 } 658 659 static void 660 addseg(arg) 661 char *arg; 662 { 663 SEGLIST *p; 664 665 if ((p = malloc(sizeof(SEGLIST))) == NULL) 666 err(1, "malloc"); 667 p->next = seglist; 668 p->num = atoi(arg); 669 seglist = p; 670 } 671 672 static void 673 dump_cleaner_info(lfsp, ipage) 674 struct lfs *lfsp; 675 void *ipage; 676 { 677 CLEANERINFO *cip; 678 679 cip = (CLEANERINFO *)ipage; 680 (void)printf("segments clean\t%d\tsegments dirty\t%d\n\n", 681 cip->clean, cip->dirty); 682 } 683 684 static void 685 usage() 686 { 687 (void)fprintf(stderr, "usage: dumplfs [-ai] [-s segnum] file\n"); 688 exit(1); 689 } 690
Indexes created Thu Sep 25 16:09:42 GMT 2025