dumplfs.c revision 1.10
1 /* $NetBSD: dumplfs.c,v 1.10 1998/08/27 18:03:42 ross 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.10 1998/08/27 18:03:42 ross 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)); 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 int daddr_shift; 93 char *special; 94 95 /* Segment Usage formats */ 96 #define print_suheader \ 97 (void)printf("segnum\tflags\tnbytes\tninos\tnsums\tlastmod\n") 98 99 #define print_suentry(i, sp) \ 100 (void)printf("%d\t%c%c%c\t%d\t%d\t%d\t%s", i, \ 101 (((sp)->su_flags & SEGUSE_ACTIVE) ? 'A' : ' '), \ 102 (((sp)->su_flags & SEGUSE_DIRTY) ? 'D' : 'C'), \ 103 (((sp)->su_flags & SEGUSE_SUPERBLOCK) ? 'S' : ' '), \ 104 (sp)->su_nbytes, (sp)->su_ninos, (sp)->su_nsums, \ 105 ctime((time_t *)&(sp)->su_lastmod)) 106 107 /* Ifile formats */ 108 #define print_iheader \ 109 (void)printf("inum\tstatus\tversion\tdaddr\t\tfreeptr\n") 110 #define print_ientry(i, ip) \ 111 if (ip->if_daddr == LFS_UNUSED_DADDR) \ 112 (void)printf("%d\tFREE\t%d\t \t\t%d\n", \ 113 i, ip->if_version, ip->if_nextfree); \ 114 else \ 115 (void)printf("%d\tINUSE\t%d\t%8X \n", \ 116 i, ip->if_version, ip->if_daddr) 117 118 int 119 main(argc, argv) 120 int argc; 121 char *argv[]; 122 { 123 struct lfs lfs_sb1, lfs_sb2, *lfs_master; 124 daddr_t seg_addr; 125 int ch, do_allsb, do_ientries, fd, segnum; 126 127 do_allsb = 0; 128 do_ientries = 0; 129 while ((ch = getopt(argc, argv, "ais:")) != -1) 130 switch(ch) { 131 case 'a': /* Dump all superblocks */ 132 do_allsb = 1; 133 break; 134 case 'i': /* Dump ifile entries */ 135 do_ientries = 1; 136 break; 137 case 's': /* Dump out these segments */ 138 addseg(optarg); 139 break; 140 default: 141 usage(); 142 } 143 argc -= optind; 144 argv += optind; 145 146 if (argc != 1) 147 usage(); 148 149 special = argv[0]; 150 if ((fd = open(special, O_RDONLY, 0)) < 0) 151 err(1, "%s", special); 152 153 /* Read the first superblock */ 154 get(fd, LFS_LABELPAD, &lfs_sb1, sizeof(struct lfs)); 155 daddr_shift = lfs_sb1.lfs_bshift - lfs_sb1.lfs_fsbtodb; 156 157 /* 158 * Read the second superblock and figure out which check point is 159 * most up to date. 160 */ 161 get(fd, 162 lfs_sb1.lfs_sboffs[1] << daddr_shift, &lfs_sb2, sizeof(struct lfs)); 163 164 lfs_master = &lfs_sb1; 165 if (lfs_sb1.lfs_tstamp < lfs_sb2.lfs_tstamp) 166 lfs_master = &lfs_sb2; 167 168 (void)printf("Master Superblock:\n"); 169 dump_super(lfs_master); 170 171 dump_ifile(fd, lfs_master, do_ientries); 172 173 if (seglist != NULL) 174 for (; seglist != NULL; seglist = seglist->next) { 175 seg_addr = lfs_master->lfs_sboffs[0] + seglist->num * 176 (lfs_master->lfs_ssize << lfs_master->lfs_fsbtodb); 177 dump_segment(fd, 178 seglist->num, seg_addr, lfs_master, do_allsb); 179 } 180 else 181 for (segnum = 0, seg_addr = lfs_master->lfs_sboffs[0]; 182 segnum < lfs_master->lfs_nseg; segnum++, seg_addr += 183 lfs_master->lfs_ssize << lfs_master->lfs_fsbtodb) 184 dump_segment(fd, 185 segnum, seg_addr, lfs_master, do_allsb); 186 187 (void)close(fd); 188 exit(0); 189 } 190 191 /* 192 * We are reading all the blocks of an inode and dumping out the ifile table. 193 * This code could be tighter, but this is a first pass at getting the stuff 194 * printed out rather than making this code incredibly efficient. 195 */ 196 static void 197 dump_ifile(fd, lfsp, do_ientries) 198 int fd; 199 struct lfs *lfsp; 200 int do_ientries; 201 { 202 IFILE *ipage; 203 struct dinode *dip, *dpage; 204 daddr_t addr, *addrp, *dindir, *iaddrp, *indir; 205 int block_limit, i, inum, j, nblocks, psize; 206 207 psize = lfsp->lfs_bsize; 208 addr = lfsp->lfs_idaddr; 209 210 if (!(dpage = malloc(psize))) 211 err(1, "malloc"); 212 get(fd, addr << daddr_shift, dpage, psize); 213 214 for (dip = dpage + INOPB(lfsp) - 1; dip >= dpage; --dip) 215 if (dip->di_inumber == LFS_IFILE_INUM) 216 break; 217 218 if (dip < dpage) 219 errx(1, "unable to locate ifile inode"); 220 221 (void)printf("\nIFILE inode\n"); 222 dump_dinode(dip); 223 224 (void)printf("\nIFILE contents\n"); 225 nblocks = dip->di_size >> lfsp->lfs_bshift; 226 block_limit = MIN(nblocks, NDADDR); 227 228 /* Get the direct block */ 229 if ((ipage = malloc(psize)) == NULL) 230 err(1, "malloc"); 231 for (inum = 0, addrp = dip->di_db, i = 0; i < block_limit; 232 i++, addrp++) { 233 get(fd, *addrp << daddr_shift, ipage, psize); 234 if (i < lfsp->lfs_cleansz) { 235 dump_cleaner_info(lfsp, ipage); 236 print_suheader; 237 continue; 238 } 239 240 if (i < (lfsp->lfs_segtabsz + lfsp->lfs_cleansz)) { 241 inum = dump_ipage_segusage(lfsp, inum, ipage, 242 lfsp->lfs_sepb); 243 if (!inum) { 244 if(!do_ientries) 245 goto e0; 246 else 247 print_iheader; 248 } 249 } else 250 inum = dump_ipage_ifile(inum, ipage, lfsp->lfs_ifpb); 251 252 } 253 254 if (nblocks <= NDADDR) 255 goto e0; 256 257 /* Dump out blocks off of single indirect block */ 258 if (!(indir = malloc(psize))) 259 err(1, "malloc"); 260 get(fd, dip->di_ib[0] << daddr_shift, indir, psize); 261 block_limit = MIN(i + lfsp->lfs_nindir, nblocks); 262 for (addrp = indir; i < block_limit; i++, addrp++) { 263 if (*addrp == LFS_UNUSED_DADDR) 264 break; 265 get(fd, *addrp << daddr_shift,ipage, psize); 266 if (i < lfsp->lfs_cleansz) { 267 dump_cleaner_info(lfsp, ipage); 268 continue; 269 } else 270 i -= lfsp->lfs_cleansz; 271 272 if (i < lfsp->lfs_segtabsz) { 273 inum = dump_ipage_segusage(lfsp, inum, ipage, 274 lfsp->lfs_sepb); 275 if (!inum) 276 if(!do_ientries) 277 goto e1; 278 else 279 print_iheader; 280 } else 281 inum = dump_ipage_ifile(inum, ipage, lfsp->lfs_ifpb); 282 } 283 284 if (nblocks <= lfsp->lfs_nindir * lfsp->lfs_ifpb) 285 goto e1; 286 287 /* Get the double indirect block */ 288 if (!(dindir = malloc(psize))) 289 err(1, "malloc"); 290 get(fd, dip->di_ib[1] << daddr_shift, dindir, psize); 291 for (iaddrp = dindir, j = 0; j < lfsp->lfs_nindir; j++, iaddrp++) { 292 if (*iaddrp == LFS_UNUSED_DADDR) 293 break; 294 get(fd, *iaddrp << daddr_shift, indir, psize); 295 block_limit = MIN(i + lfsp->lfs_nindir, nblocks); 296 for (addrp = indir; i < block_limit; i++, addrp++) { 297 if (*addrp == LFS_UNUSED_DADDR) 298 break; 299 get(fd, *addrp << daddr_shift, ipage, psize); 300 if (i < lfsp->lfs_cleansz) { 301 dump_cleaner_info(lfsp, ipage); 302 continue; 303 } else 304 i -= lfsp->lfs_cleansz; 305 306 if (i < lfsp->lfs_segtabsz) { 307 inum = dump_ipage_segusage(lfsp, 308 inum, ipage, lfsp->lfs_sepb); 309 if (!inum) { 310 if(!do_ientries) 311 goto e2; 312 else 313 print_iheader; 314 } 315 } else 316 inum = dump_ipage_ifile(inum, 317 ipage, lfsp->lfs_ifpb); 318 } 319 } 320 e2: free(dindir); 321 e1: free(indir); 322 e0: free(dpage); 323 free(ipage); 324 } 325 326 static int 327 dump_ipage_ifile(i, pp, tot) 328 int i; 329 IFILE *pp; 330 int tot; 331 { 332 IFILE *ip; 333 int cnt, max; 334 335 max = i + tot; 336 337 for (ip = pp, cnt = i; cnt < max; cnt++, ip++) 338 print_ientry(cnt, ip); 339 return (max); 340 } 341 342 static int 343 dump_ipage_segusage(lfsp, i, pp, tot) 344 struct lfs *lfsp; 345 int i; 346 IFILE *pp; 347 int tot; 348 { 349 SEGUSE *sp; 350 int cnt, max; 351 352 max = i + tot; 353 for (sp = (SEGUSE *)pp, cnt = i; 354 cnt < lfsp->lfs_nseg && cnt < max; cnt++, sp++) 355 print_suentry(cnt, sp); 356 if (max >= lfsp->lfs_nseg) 357 return (0); 358 else 359 return (max); 360 } 361 362 static void 363 dump_dinode(dip) 364 struct dinode *dip; 365 { 366 int i; 367 time_t at, mt, ct; 368 369 at = dip->di_atime; 370 mt = dip->di_mtime; 371 ct = dip->di_ctime; 372 373 (void)printf("%s%d\t%s%d\t%s%d\t%s%d\t%s%qu\n", 374 "mode ", dip->di_mode, 375 "nlink ", dip->di_nlink, 376 "uid ", dip->di_uid, 377 "gid ", dip->di_gid, 378 "size ", (long long)dip->di_size); 379 (void)printf("%s%s%s%s%s%s", 380 "atime ", ctime(&at), 381 "mtime ", ctime(&mt), 382 "ctime ", ctime(&ct)); 383 (void)printf("inum %d\n", dip->di_inumber); 384 (void)printf("Direct Addresses\n"); 385 for (i = 0; i < NDADDR; i++) { 386 (void)printf("\t0x%X", dip->di_db[i]); 387 if ((i % 6) == 5) 388 (void)printf("\n"); 389 } 390 for (i = 0; i < NIADDR; i++) 391 (void)printf("\t0x%X", dip->di_ib[i]); 392 (void)printf("\n"); 393 } 394 395 static int 396 dump_sum(fd, lfsp, sp, segnum, addr) 397 struct lfs *lfsp; 398 SEGSUM *sp; 399 int fd, segnum; 400 daddr_t addr; 401 { 402 FINFO *fp; 403 daddr_t *dp; 404 int i, j; 405 int ck; 406 int numbytes; 407 struct dinode *inop; 408 409 if (sp->ss_magic != SS_MAGIC || 410 sp->ss_sumsum != (ck = cksum(&sp->ss_datasum, 411 LFS_SUMMARY_SIZE - sizeof(sp->ss_sumsum)))) { 412 (void)printf("dumplfs: %s %d address 0x%x\n", 413 "corrupt summary block; segment", segnum, addr); 414 return(0); 415 } 416 417 (void)printf("Segment Summary Info at 0x%x\n", addr); 418 (void)printf(" %s0x%X\t%s%d\t%s%d\n %s0x%X\t%s0x%X", 419 "next ", sp->ss_next, 420 "nfinfo ", sp->ss_nfinfo, 421 "ninos ", sp->ss_ninos, 422 "sumsum ", sp->ss_sumsum, 423 "datasum ", sp->ss_datasum ); 424 (void)printf("\tcreate %s", ctime((time_t *)&sp->ss_create)); 425 426 /* Dump out inode disk addresses */ 427 dp = (daddr_t *)sp; 428 dp += LFS_SUMMARY_SIZE / sizeof(daddr_t); 429 inop = malloc(1 << lfsp->lfs_bshift); 430 printf(" Inode addresses:"); 431 numbytes = 0; 432 for (dp--, i = 0; i < sp->ss_ninos; dp--) { 433 numbytes += lfsp->lfs_bsize; /* add bytes for inode block */ 434 printf("\t0x%X {", *dp); 435 get(fd, *dp << (lfsp->lfs_bshift - lfsp->lfs_fsbtodb), inop, 436 (1 << lfsp->lfs_bshift)); 437 for (j = 0; i < sp->ss_ninos && j < INOPB(lfsp); j++, i++) { 438 if (j > 0) 439 (void)printf(", "); 440 (void)printf("%d", inop[j].di_inumber); 441 } 442 (void)printf("}"); 443 if (((i/INOPB(lfsp)) % 4) == 3) 444 (void)printf("\n"); 445 } 446 free(inop); 447 448 printf("\n"); 449 for (fp = (FINFO *)(sp + 1), i = 0; i < sp->ss_nfinfo; i++) { 450 (void)printf(" FINFO for inode: %d version %d nblocks %d lastlength %d\n", 451 fp->fi_ino, fp->fi_version, fp->fi_nblocks, 452 fp->fi_lastlength); 453 dp = &(fp->fi_blocks[0]); 454 for (j = 0; j < fp->fi_nblocks; j++, dp++) { 455 (void)printf("\t%d", *dp); 456 if ((j % 8) == 7) 457 (void)printf("\n"); 458 if (j == fp->fi_nblocks - 1) 459 numbytes += fp->fi_lastlength; 460 else 461 numbytes += lfsp->lfs_bsize; 462 } 463 if ((j % 8) != 0) 464 (void)printf("\n"); 465 fp = (FINFO *)dp; 466 } 467 return (numbytes); 468 } 469 470 static void 471 dump_segment(fd, segnum, addr, lfsp, dump_sb) 472 int fd, segnum; 473 daddr_t addr; 474 struct lfs *lfsp; 475 int dump_sb; 476 { 477 struct lfs lfs_sb, *sbp; 478 SEGSUM *sump; 479 char sumblock[LFS_SUMMARY_SIZE]; 480 int did_one, nbytes, sb; 481 off_t sum_offset, super_off = 0; 482 483 (void)printf("\nSEGMENT %d (Disk Address 0x%X)\n", 484 addr >> (lfsp->lfs_segshift - daddr_shift), addr); 485 sum_offset = (addr << (lfsp->lfs_bshift - lfsp->lfs_fsbtodb)); 486 487 sb = 0; 488 did_one = 0; 489 do { 490 get(fd, sum_offset, sumblock, LFS_SUMMARY_SIZE); 491 sump = (SEGSUM *)sumblock; 492 if (sump->ss_sumsum != cksum (&sump->ss_datasum, 493 LFS_SUMMARY_SIZE - sizeof(sump->ss_sumsum))) { 494 sbp = (struct lfs *)sump; 495 if ((sb = (sbp->lfs_magic == LFS_MAGIC))) { 496 super_off = sum_offset; 497 sum_offset += LFS_SBPAD; 498 } else if (did_one) 499 break; 500 else { 501 printf("Segment at 0x%X corrupt\n", addr); 502 break; 503 } 504 } else { 505 nbytes = dump_sum(fd, lfsp, sump, segnum, sum_offset >> 506 (lfsp->lfs_bshift - lfsp->lfs_fsbtodb)); 507 if (nbytes) 508 sum_offset += LFS_SUMMARY_SIZE + nbytes; 509 else 510 sum_offset = 0; 511 did_one = 1; 512 } 513 } while (sum_offset); 514 515 if (dump_sb && sb) { 516 get(fd, super_off, &lfs_sb, sizeof(struct lfs)); 517 dump_super(&lfs_sb); 518 } 519 return; 520 } 521 522 static void 523 dump_super(lfsp) 524 struct lfs *lfsp; 525 { 526 int i; 527 528 (void)printf("%s0x%X\t%s0x%X\t%s%d\t%s%d\n", 529 "magic ", lfsp->lfs_magic, 530 "version ", lfsp->lfs_version, 531 "size ", lfsp->lfs_size, 532 "ssize ", lfsp->lfs_ssize); 533 (void)printf("%s%d\t\t%s%d\t%s%d\t%s%d\n", 534 "dsize ", lfsp->lfs_dsize, 535 "bsize ", lfsp->lfs_bsize, 536 "fsize ", lfsp->lfs_fsize, 537 "frag ", lfsp->lfs_frag); 538 539 (void)printf("%s%d\t\t%s%d\t%s%d\t%s%d\n", 540 "minfree ", lfsp->lfs_minfree, 541 "inopb ", lfsp->lfs_inopb, 542 "ifpb ", lfsp->lfs_ifpb, 543 "nindir ", lfsp->lfs_nindir); 544 545 (void)printf("%s%d\t\t%s%d\t%s%d\t%s%d\n", 546 "nseg ", lfsp->lfs_nseg, 547 "nspf ", lfsp->lfs_nspf, 548 "cleansz ", lfsp->lfs_cleansz, 549 "segtabsz ", lfsp->lfs_segtabsz); 550 551 (void)printf("%s0x%X\t%s%d\t%s0x%qX\t%s%d\n", 552 "segmask ", lfsp->lfs_segmask, 553 "segshift ", lfsp->lfs_segshift, 554 "bmask ", (long long)lfsp->lfs_bmask, 555 "bshift ", lfsp->lfs_bshift); 556 557 (void)printf("%s0x%qX\t\t%s%d\t%s0x%qX\t%s%u\n", 558 "ffmask ", (long long)lfsp->lfs_ffmask, 559 "ffshift ", lfsp->lfs_ffshift, 560 "fbmask ", (long long)lfsp->lfs_fbmask, 561 "fbshift ", lfsp->lfs_fbshift); 562 563 (void)printf("%s%d\t%s%d\t%s0x%X\t%s0x%qx\n", 564 "sushift ", lfsp->lfs_sushift, 565 "fsbtodb ", lfsp->lfs_fsbtodb, 566 "cksum ", lfsp->lfs_cksum, 567 "maxfilesize ", (long long)lfsp->lfs_maxfilesize); 568 569 (void)printf("Superblock disk addresses:\t"); 570 for (i = 0; i < LFS_MAXNUMSB; i++) { 571 (void)printf(" 0x%X", lfsp->lfs_sboffs[i]); 572 if ( i == (LFS_MAXNUMSB >> 1)) 573 (void)printf("\n\t\t\t\t"); 574 } 575 (void)printf("\n"); 576 577 (void)printf("Checkpoint Info\n"); 578 (void)printf("%s%d\t%s0x%X\t%s%d\n", 579 "free ", lfsp->lfs_free, 580 "idaddr ", lfsp->lfs_idaddr, 581 "ifile ", lfsp->lfs_ifile); 582 (void)printf("%s%d\t%s%d\t%s%d\n", 583 "bfree ", lfsp->lfs_bfree, 584 "avail ", lfsp->lfs_avail, 585 "uinodes ", lfsp->lfs_uinodes); 586 (void)printf("%s%d\t%s0x%X\t%s0x%X\n%s0x%X\t%s0x%X\t", 587 "nfiles ", lfsp->lfs_nfiles, 588 "lastseg ", lfsp->lfs_lastseg, 589 "nextseg ", lfsp->lfs_nextseg, 590 "curseg ", lfsp->lfs_curseg, 591 "offset ", lfsp->lfs_offset); 592 (void)printf("tstamp %s", ctime((time_t *)&lfsp->lfs_tstamp)); 593 (void)printf("\nIn-Memory Information\n"); 594 (void)printf("%s%d\t%s0x%X\t%s%d%s%d\t%s%d\n", 595 "seglock ", lfsp->lfs_seglock, 596 "iocount ", lfsp->lfs_iocount, 597 "writer ", lfsp->lfs_writer, 598 "dirops ", lfsp->lfs_dirops, 599 "doifile ", lfsp->lfs_doifile); 600 (void)printf("%s%d\t%s%d\t%s0x%X\t%s%d\n", 601 "nactive ", lfsp->lfs_nactive, 602 "fmod ", lfsp->lfs_fmod, 603 "clean ", lfsp->lfs_clean, 604 "ronly ", lfsp->lfs_ronly); 605 } 606 607 static void 608 addseg(arg) 609 char *arg; 610 { 611 SEGLIST *p; 612 613 if ((p = malloc(sizeof(SEGLIST))) == NULL) 614 err(1, "malloc"); 615 p->next = seglist; 616 p->num = atoi(arg); 617 seglist = p; 618 } 619 620 static void 621 dump_cleaner_info(lfsp, ipage) 622 struct lfs *lfsp; 623 void *ipage; 624 { 625 CLEANERINFO *cip; 626 627 cip = (CLEANERINFO *)ipage; 628 (void)printf("segments clean\t%d\tsegments dirty\t%d\n\n", 629 cip->clean, cip->dirty); 630 } 631 632 static void 633 usage() 634 { 635 (void)fprintf(stderr, "usage: dumplfs [-ai] [-s segnum] file\n"); 636 exit(1); 637 } 638
Indexes created Thu Sep 25 16:09:42 GMT 2025