Aren/NetBSD
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
9a9926ee57
NetBSD/usr.sbin/dumplfs/dumplfs.c
perseant 4e3fced95b Merge the short-lived perseant-lfsv2 branch into the trunk. 
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default.  Changes for the v2 layout include:

- Segments of non-PO2 size and arbitrary block offset, so these can be
  matched to convenient physical characteristics of the partition (e.g.,
  stripe or track size and offset).

- Address by fragment instead of by disk sector, paving the way for
  non-512-byte-sector devices.  In theory fragments can be as large
  as you like, though in reality they must be smaller than MAXBSIZE in size.

- Use serial number and filesystem identifier to ensure that roll-forward
  doesn't get old data and think it's new.  Roll-forward is enabled for
  v2 filesystems, though not for v1 filesystems by default.

- The inode free list is now a tailq, paving the way for undelete (undelete
  is not yet implemented, but can be without further non-backwards-compatible
  changes to disk structures).

- Inode atime information is kept in the Ifile, instead of on the inode;
  that is, the inode is never written *just* because atime was changed.
  Because of this the inodes remain near the file data on the disk, rather
  than wandering all over as the disk is read repeatedly.  This speeds up
  repeated reads by a small but noticeable amount.

Other changes of note include:

- The ifile written by newfs_lfs can now be of arbitrary length, it is no
  longer restricted to a single indirect block.

- Fixed an old bug where ctime was changed every time a vnode was created.
  I need to look more closely to make sure that the times are only updated
  during write(2) and friends, not after-the-fact during a segment write,
  and certainly not by the cleaner.
2001-07-13 20:30:18 +00:00

732 lines
21 KiB
C
Raw Blame History

/* $NetBSD: dumplfs.c,v 1.19 2001/07/13 20:30:21 perseant Exp $ */
/*-
* Copyright (c) 1991, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#ifndef lint
__COPYRIGHT(
"@(#) Copyright (c) 1991, 1993\n\
The Regents of the University of California. All rights reserved.\n");
#endif /* not lint */
#ifndef lint
#if 0
static char sccsid[] = "@(#)dumplfs.c 8.5 (Berkeley) 5/24/95";
#else
__RCSID("$NetBSD: dumplfs.c,v 1.19 2001/07/13 20:30:21 perseant Exp $");
#endif
#endif /* not lint */
#include <sys/param.h>
#include <sys/ucred.h>
#include <sys/mount.h>
#include <sys/time.h>
#include <ufs/ufs/dinode.h>
#include <ufs/lfs/lfs.h>
#include <err.h>
#include <errno.h>
#include <fcntl.h>
#include <fstab.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <unistd.h>
#include "extern.h"
static void addseg(char *);
static void dump_cleaner_info(struct lfs *, void *);
static void dump_dinode(struct dinode *);
static void dump_ifile(int, struct lfs *, int, int, int);
static int dump_ipage_ifile(struct lfs *, int, char *, int);
static int dump_ipage_segusage(struct lfs *, int, char *, int);
static void dump_segment(int, int, daddr_t, struct lfs *, int);
static int dump_sum(int, struct lfs *, SEGSUM *, int, daddr_t);
static void dump_super(struct lfs *);
static void usage(void);
extern u_long cksum(void *, size_t);
typedef struct seglist SEGLIST;
struct seglist {
SEGLIST *next;
int num;
};
SEGLIST *seglist;
char *special;
/* Segment Usage formats */
#define print_suheader \
(void)printf("segnum\tflags\tnbytes\tninos\tnsums\tlastmod\n")
#define print_suentry(i, sp, fs) \
(void)printf("%d\t%c%c%c\t%d\t%d\t%d\t%s", i, \
(((sp)->su_flags & SEGUSE_ACTIVE) ? 'A' : ' '), \
(((sp)->su_flags & SEGUSE_DIRTY) ? 'D' : 'C'), \
(((sp)->su_flags & SEGUSE_SUPERBLOCK) ? 'S' : ' '), \
(sp)->su_nbytes, (sp)->su_ninos, (sp)->su_nsums, \
((fs)->lfs_version == 1 ? ctime((time_t *)&(sp)->su_olastmod) : \
ctime((time_t *)&(sp)->su_lastmod)))
/* Ifile formats */
#define print_iheader \
(void)printf("inum\tstatus\tversion\tdaddr\t\tfreeptr\n")
#define print_ientry(i, ip) \
if ((ip)->if_daddr == LFS_UNUSED_DADDR) \
(void)printf("%d\tFREE\t%d\t \t\t%d\n", \
i, (ip)->if_version, (ip)->if_nextfree); \
else \
(void)printf("%d\tINUSE\t%d\t%8X \n", \
i, (ip)->if_version, (ip)->if_daddr)
#define fsbtobyte(fs, b) fsbtob((fs), (off_t)((b)))
int
main(int argc, char **argv)
{
struct lfs lfs_sb1, lfs_sb2, *lfs_master;
daddr_t seg_addr, idaddr, sbdaddr;
int ch, do_allsb, do_ientries, do_segentries, fd, segnum;
do_allsb = 0;
do_ientries = 0;
do_segentries = 0;
idaddr = 0x0;
sbdaddr = 0x0;
while ((ch = getopt(argc, argv, "ab:iI:Ss:")) != -1)
switch(ch) {
case 'a': /* Dump all superblocks */
do_allsb = 1;
break;
case 'b': /* Use this superblock */
sbdaddr = strtol(optarg, NULL, 0);
break;
case 'i': /* Dump ifile entries */
do_ientries = !do_ientries;
break;
case 'I': /* Use this ifile inode */
idaddr = strtol(optarg, NULL, 0);
break;
case 'S':
do_segentries = !do_segentries;
break;
case 's': /* Dump out these segments */
addseg(optarg);
break;
default:
usage();
}
argc -= optind;
argv += optind;
if (argc != 1)
usage();
special = argv[0];
if ((fd = open(special, O_RDONLY, 0)) < 0)
err(1, "%s", special);
if (sbdaddr == 0x0) {
/* Read the proto-superblock */
get(fd, LFS_LABELPAD, &(lfs_sb1.lfs_dlfs), sizeof(struct dlfs));
/* If that wasn't the real first sb, get the real first sb */
if (lfs_sb1.lfs_version > 1 &&
lfs_sb1.lfs_sboffs[0] > btofsb(&lfs_sb1, LFS_LABELPAD))
get(fd, fsbtob(&lfs_sb1, lfs_sb1.lfs_sboffs[0]),
&(lfs_sb1.lfs_dlfs), sizeof(struct dlfs));
/*
* Read the second superblock and figure out which check point is
* most up to date.
*/
get(fd,
fsbtobyte(&lfs_sb1, lfs_sb1.lfs_sboffs[1]),
&(lfs_sb2.lfs_dlfs), sizeof(struct dlfs));
lfs_master = &lfs_sb1;
if (lfs_sb1.lfs_version > 1) {
if (lfs_sb1.lfs_serial > lfs_sb2.lfs_serial) {
lfs_master = &lfs_sb2;
sbdaddr = lfs_sb1.lfs_sboffs[1];
} else
sbdaddr = lfs_sb1.lfs_sboffs[0];
} else {
if (lfs_sb1.lfs_otstamp > lfs_sb2.lfs_otstamp) {
lfs_master = &lfs_sb2;
sbdaddr = lfs_sb1.lfs_sboffs[1];
} else
sbdaddr = lfs_sb1.lfs_sboffs[0];
}
} else {
/* Read the first superblock */
get(fd, dbtob((off_t)sbdaddr), &(lfs_sb1.lfs_dlfs),
sizeof(struct dlfs));
lfs_master = &lfs_sb1;
}
/* Compatibility */
if (lfs_master->lfs_version == 1) {
lfs_master->lfs_sumsize = LFS_V1_SUMMARY_SIZE;
lfs_master->lfs_ibsize = lfs_master->lfs_bsize;
lfs_master->lfs_start = lfs_master->lfs_sboffs[0];
lfs_master->lfs_tstamp = lfs_master->lfs_otstamp;
lfs_master->lfs_fsbtodb = 0;
}
(void)printf("Master Superblock at 0x%x:\n", sbdaddr);
dump_super(lfs_master);
dump_ifile(fd, lfs_master, do_ientries, do_segentries, idaddr);
if (seglist != NULL)
for (; seglist != NULL; seglist = seglist->next) {
seg_addr = sntod(lfs_master, seglist->num);
dump_segment(fd, seglist->num, seg_addr, lfs_master,
do_allsb);
}
else
for (segnum = 0, seg_addr = sntod(lfs_master, 0);
segnum < lfs_master->lfs_nseg;
segnum++, seg_addr = sntod(lfs_master, segnum))
dump_segment(fd, segnum, seg_addr, lfs_master,
do_allsb);
(void)close(fd);
exit(0);
}
/*
* We are reading all the blocks of an inode and dumping out the ifile table.
* This code could be tighter, but this is a first pass at getting the stuff
* printed out rather than making this code incredibly efficient.
*/
static void
dump_ifile(int fd, struct lfs *lfsp, int do_ientries, int do_segentries, daddr_t addr)
{
char *ipage;
struct dinode *dip, *dpage;
daddr_t *addrp, *dindir, *iaddrp, *indir;
int block_limit, i, inum, j, nblocks, psize;
psize = lfsp->lfs_bsize;
if (!addr)
addr = lfsp->lfs_idaddr;
if (!(dpage = malloc(psize)))
err(1, "malloc");
get(fd, fsbtobyte(lfsp, addr), dpage, psize);
for (dip = dpage + INOPB(lfsp) - 1; dip >= dpage; --dip)
if (dip->di_inumber == LFS_IFILE_INUM)
break;
if (dip < dpage)
errx(1, "unable to locate ifile inode at disk address 0x%x",
addr);
(void)printf("\nIFILE inode\n");
dump_dinode(dip);
(void)printf("\nIFILE contents\n");
nblocks = dip->di_size >> lfsp->lfs_bshift;
block_limit = MIN(nblocks, NDADDR);
/* Get the direct block */
if ((ipage = malloc(psize)) == NULL)
err(1, "malloc");
for (inum = 0, addrp = dip->di_db, i = 0; i < block_limit;
i++, addrp++) {
get(fd, fsbtobyte(lfsp, *addrp), ipage, psize);
if (i < lfsp->lfs_cleansz) {
dump_cleaner_info(lfsp, ipage);
if (do_segentries)
print_suheader;
continue;
}
if (i < (lfsp->lfs_segtabsz + lfsp->lfs_cleansz)) {
if (do_segentries)
inum = dump_ipage_segusage(lfsp, inum, ipage,
lfsp->lfs_sepb);
else
inum = (i < lfsp->lfs_segtabsz + lfsp->lfs_cleansz - 1);
if (!inum) {
if(!do_ientries)
goto e0;
else
print_iheader;
}
} else
inum = dump_ipage_ifile(lfsp, inum, ipage, lfsp->lfs_ifpb);
}
if (nblocks <= NDADDR)
goto e0;
/* Dump out blocks off of single indirect block */
if (!(indir = malloc(psize)))
err(1, "malloc");
get(fd, fsbtobyte(lfsp, dip->di_ib[0]), indir, psize);
block_limit = MIN(i + lfsp->lfs_nindir, nblocks);
for (addrp = indir; i < block_limit; i++, addrp++) {
if (*addrp == LFS_UNUSED_DADDR)
break;
get(fd, fsbtobyte(lfsp, *addrp), ipage, psize);
if (i < lfsp->lfs_cleansz) {
dump_cleaner_info(lfsp, ipage);
continue;
}
if (i < lfsp->lfs_segtabsz + lfsp->lfs_cleansz) {
if (do_segentries)
inum = dump_ipage_segusage(lfsp, inum, ipage,
lfsp->lfs_sepb);
else
inum = (i < lfsp->lfs_segtabsz + lfsp->lfs_cleansz - 1);
if (!inum) {
if(!do_ientries)
goto e1;
else
print_iheader;
}
} else
inum = dump_ipage_ifile(lfsp, inum, ipage, lfsp->lfs_ifpb);
}
if (nblocks <= lfsp->lfs_nindir * lfsp->lfs_ifpb)
goto e1;
/* Get the double indirect block */
if (!(dindir = malloc(psize)))
err(1, "malloc");
get(fd, fsbtobyte(lfsp, dip->di_ib[1]), dindir, psize);
for (iaddrp = dindir, j = 0; j < lfsp->lfs_nindir; j++, iaddrp++) {
if (*iaddrp == LFS_UNUSED_DADDR)
break;
get(fd, fsbtobyte(lfsp, *iaddrp), indir, psize);
block_limit = MIN(i + lfsp->lfs_nindir, nblocks);
for (addrp = indir; i < block_limit; i++, addrp++) {
if (*addrp == LFS_UNUSED_DADDR)
break;
get(fd, fsbtobyte(lfsp, *addrp), ipage, psize);
if (i < lfsp->lfs_cleansz) {
dump_cleaner_info(lfsp, ipage);
continue;
}
if (i < lfsp->lfs_segtabsz + lfsp->lfs_cleansz) {
if (do_segentries)
inum = dump_ipage_segusage(lfsp,
inum, ipage, lfsp->lfs_sepb);
else
inum = (i < lfsp->lfs_segtabsz +
lfsp->lfs_cleansz - 1);
if (!inum) {
if(!do_ientries)
goto e2;
else
print_iheader;
}
} else
inum = dump_ipage_ifile(lfsp, inum,
ipage, lfsp->lfs_ifpb);
}
}
e2: free(dindir);
e1: free(indir);
e0: free(dpage);
free(ipage);
}
static int
dump_ipage_ifile(struct lfs *lfsp, int i, char *pp, int tot)
{
char *ip;
int cnt, max, entsize;
if (lfsp->lfs_version == 1)
entsize = sizeof(IFILE_V1);
else
entsize = sizeof(IFILE);
max = i + tot;
for (ip = pp, cnt = i; cnt < max; cnt++, ip += entsize)
print_ientry(cnt, (IFILE *)ip);
return (max);
}
static int
dump_ipage_segusage(struct lfs *lfsp, int i, char *pp, int tot)
{
SEGUSE *sp;
int cnt, max;
struct seglist *slp;
max = i + tot;
for (sp = (SEGUSE *)pp, cnt = i;
cnt < lfsp->lfs_nseg && cnt < max; cnt++) {
if (seglist == NULL)
print_suentry(cnt, sp, lfsp);
else {
for (slp = seglist; slp != NULL; slp = slp->next)
if (cnt == slp->num) {
print_suentry(cnt, sp, lfsp);
break;
}
}
if (lfsp->lfs_version > 1)
++sp;
else
sp = (SEGUSE *)((SEGUSE_V1 *)sp + 1);
}
if (max >= lfsp->lfs_nseg)
return (0);
else
return (max);
}
static void
dump_dinode(struct dinode *dip)
{
int i;
time_t at, mt, ct;
at = dip->di_atime;
mt = dip->di_mtime;
ct = dip->di_ctime;
(void)printf(" %so%o\t%s%d\t%s%d\t%s%d\t%s%llu\n",
"mode ", dip->di_mode,
"nlink ", dip->di_nlink,
"uid ", dip->di_uid,
"gid ", dip->di_gid,
"size ", (long long)dip->di_size);
(void)printf(" %s%s %s%s %s%s",
"atime ", ctime(&at),
"mtime ", ctime(&mt),
"ctime ", ctime(&ct));
(void)printf(" inum %d\n", dip->di_inumber);
(void)printf(" Direct Addresses\n");
for (i = 0; i < NDADDR; i++) {
(void)printf("\t0x%x", dip->di_db[i]);
if ((i % 6) == 5)
(void)printf("\n");
}
for (i = 0; i < NIADDR; i++)
(void)printf("\t0x%x", dip->di_ib[i]);
(void)printf("\n");
}
static int
dump_sum(int fd, struct lfs *lfsp, SEGSUM *sp, int segnum, daddr_t addr)
{
FINFO *fp;
daddr_t *dp;
int i, j;
int ck;
int numbytes;
struct dinode *inop;
if (sp->ss_magic != SS_MAGIC ||
sp->ss_sumsum != (ck = cksum(&sp->ss_datasum,
lfsp->lfs_sumsize - sizeof(sp->ss_sumsum)))) {
/* Don't print "corrupt" if we're just too close to the edge */
if (dtosn(lfsp, addr + fsbtodb(lfsp, 1)) ==
dtosn(lfsp, addr))
(void)printf("dumplfs: %s %d address 0x%x\n",
"corrupt summary block; segment", segnum,
addr);
return (0);
}
if (lfsp->lfs_version > 1 && sp->ss_ident != lfsp->lfs_ident) {
(void)printf("dumplfs: %s %d address 0x%x\n",
"summary from a former life; segment", segnum,
addr);
return (0);
}
(void)printf("Segment Summary Info at 0x%x\n", addr);
(void)printf(" %s0x%x\t%s%d\t%s%d\t%s%c%c\n %s0x%x\t%s0x%x",
"next ", sp->ss_next,
"nfinfo ", sp->ss_nfinfo,
"ninos ", sp->ss_ninos,
"flags ", (sp->ss_flags & SS_DIROP) ? 'D' : '-',
(sp->ss_flags & SS_CONT) ? 'C' : '-',
"sumsum ", sp->ss_sumsum,
"datasum ", sp->ss_datasum );
if (lfsp->lfs_version == 1)
(void)printf("\tcreate %s\n", ctime((time_t *)&sp->ss_ident));
else {
(void)printf("\tcreate %s", ctime((time_t *)&sp->ss_create));
(void)printf(" roll_id %-8x", sp->ss_ident);
(void)printf(" serial %lld\n", (long long)sp->ss_serial);
}
/* Dump out inode disk addresses */
dp = (daddr_t *)sp;
dp += lfsp->lfs_sumsize / sizeof(daddr_t);
inop = malloc(lfsp->lfs_bsize);
printf(" Inode addresses:");
numbytes = 0;
for (dp--, i = 0; i < sp->ss_ninos; dp--) {
numbytes += lfsp->lfs_ibsize; /* add bytes for inode block */
printf("\t0x%x {", *dp);
get(fd, fsbtobyte(lfsp, *dp), inop, lfsp->lfs_ibsize);
for (j = 0; i < sp->ss_ninos && j < INOPB(lfsp); j++, i++) {
if (j > 0)
(void)printf(", ");
(void)printf("%dv%d", inop[j].di_inumber, inop[j].di_gen);
}
(void)printf("}");
if (((i/INOPB(lfsp)) % 4) == 3)
(void)printf("\n");
}
free(inop);
printf("\n");
if (lfsp->lfs_version == 1)
fp = (FINFO *)((SEGSUM_V1 *)sp + 1);
else
fp = (FINFO *)(sp + 1);
for (i = 0; i < sp->ss_nfinfo; i++) {
(void)printf(" FINFO for inode: %d version %d nblocks %d lastlength %d\n",
fp->fi_ino, fp->fi_version, fp->fi_nblocks,
fp->fi_lastlength);
dp = &(fp->fi_blocks[0]);
for (j = 0; j < fp->fi_nblocks; j++, dp++) {
(void)printf("\t%d", *dp);
if ((j % 8) == 7)
(void)printf("\n");
if (j == fp->fi_nblocks - 1)
numbytes += fp->fi_lastlength;
else
numbytes += lfsp->lfs_bsize;
}
if ((j % 8) != 0)
(void)printf("\n");
fp = (FINFO *)dp;
}
return (numbytes);
}
static void
dump_segment(int fd, int segnum, daddr_t addr, struct lfs *lfsp, int dump_sb)
{
struct lfs lfs_sb, *sbp;
SEGSUM *sump;
char *sumblock;
int did_one, nbytes, sb;
off_t sum_offset;
daddr_t new_addr;
(void)printf("\nSEGMENT %d (Disk Address 0x%x)\n", dtosn(lfsp, addr),
addr);
sum_offset = fsbtobyte(lfsp, addr);
sumblock = malloc(lfsp->lfs_sumsize);
if (lfsp->lfs_version > 1 && segnum == 0) {
/* First segment eats the label as well as the superblock */
sum_offset += fragroundup(lfsp, LFS_LABELPAD);
addr += btofsb(lfsp, fragroundup(lfsp, LFS_LABELPAD));
printf("Disklabel at 0x0\n");
}
sb = 0;
did_one = 0;
do {
get(fd, sum_offset, sumblock, lfsp->lfs_sumsize);
sump = (SEGSUM *)sumblock;
if ((lfsp->lfs_version > 1 &&
sump->ss_ident != lfsp->lfs_ident) ||
sump->ss_sumsum != cksum (&sump->ss_datasum,
lfsp->lfs_sumsize - sizeof(sump->ss_sumsum))) {
sbp = (struct lfs *)sump;
if ((sb = (sbp->lfs_magic == LFS_MAGIC))) {
printf("Superblock at 0x%x\n",
(unsigned)btofsb(lfsp, sum_offset));
if (dump_sb) {
get(fd, sum_offset, &(lfs_sb.lfs_dlfs),
sizeof(struct dlfs));
dump_super(&lfs_sb);
}
if (lfsp->lfs_version > 1)
sum_offset += fragroundup(lfsp, LFS_SBPAD);
else
sum_offset += LFS_SBPAD;
} else if (did_one)
break;
else {
printf("Segment at 0x%x empty or corrupt\n",
addr);
break;
}
} else {
nbytes = dump_sum(fd, lfsp, sump, segnum,
btofsb(lfsp, sum_offset));
if (nbytes)
sum_offset += lfsp->lfs_sumsize + nbytes;
else
sum_offset = 0;
did_one = 1;
}
/* If the segment ends right on a boundary, it still ends */
new_addr = btofsb(lfsp, sum_offset);
/* printf("end daddr = 0x%lx\n", (long)new_addr); */
if (dtosn(lfsp, new_addr) != dtosn(lfsp, addr))
break;
} while (sum_offset);
return;
}
static void
dump_super(struct lfs *lfsp)
{
int i;
(void)printf(" %s0x%-8x %s0x%-8x %s%-10d\n",
"magic ", lfsp->lfs_magic,
"version ", lfsp->lfs_version,
"size ", lfsp->lfs_size);
(void)printf(" %s%-10d %s%-10d %s%-10d\n",
"ssize ", lfsp->lfs_ssize,
"dsize ", lfsp->lfs_dsize,
"bsize ", lfsp->lfs_bsize);
(void)printf(" %s%-10d %s%-10d %s%-10d\n",
"fsize ", lfsp->lfs_fsize,
"frag ", lfsp->lfs_frag,
"minfree ", lfsp->lfs_minfree);
(void)printf(" %s%-10d %s%-10d %s%-10d\n",
"inopb ", lfsp->lfs_inopb,
"ifpb ", lfsp->lfs_ifpb,
"nindir ", lfsp->lfs_nindir);
(void)printf(" %s%-10d %s%-10d %s%-10d\n",
"nseg ", lfsp->lfs_nseg,
"sepb ", lfsp->lfs_sepb,
"cleansz ", lfsp->lfs_cleansz);
(void)printf(" %s%-10d %s0x%-8x %s%-10d\n",
"segtabsz ", lfsp->lfs_segtabsz,
"segmask ", lfsp->lfs_segmask,
"segshift ", lfsp->lfs_segshift);
(void)printf(" %s0x%-8qx %s%-10d %s0x%-8qX\n",
"bmask ", (long long)lfsp->lfs_bmask,
"bshift ", lfsp->lfs_bshift,
"ffmask ", (long long)lfsp->lfs_ffmask);
(void)printf(" %s%-10d %s0x%-8qx %s%u\n",
"ffshift ", lfsp->lfs_ffshift,
"fbmask ", (long long)lfsp->lfs_fbmask,
"fbshift ", lfsp->lfs_fbshift);
(void)printf(" %s%-10d %s%-10d %s0x%-8x\n",
"sushift ", lfsp->lfs_sushift,
"fsbtodb ", lfsp->lfs_fsbtodb,
"cksum ", lfsp->lfs_cksum);
(void)printf(" %s%-10d %s%-10d %s%-10d\n",
"nclean ", lfsp->lfs_nclean,
"dmeta ", lfsp->lfs_dmeta,
"minfreeseg ", lfsp->lfs_minfreeseg);
(void)printf(" %s0x%-8x %s%-9d %s%-10d\n",
"roll_id ", lfsp->lfs_ident,
"interleave ", lfsp->lfs_interleave,
"sumsize ", lfsp->lfs_sumsize);
(void)printf(" %s0x%-8qx\n",
"maxfilesize ", (long long)lfsp->lfs_maxfilesize);
(void)printf(" Superblock disk addresses:\n ");
for (i = 0; i < LFS_MAXNUMSB; i++) {
(void)printf(" 0x%-8x", lfsp->lfs_sboffs[i]);
if (i == (LFS_MAXNUMSB >> 1))
(void)printf("\n ");
}
(void)printf("\n");
(void)printf(" Checkpoint Info\n");
(void)printf(" %s%-10d %s0x%-8x %s%-10d\n",
"free ", lfsp->lfs_free,
"idaddr ", lfsp->lfs_idaddr,
"ifile ", lfsp->lfs_ifile);
(void)printf(" %s%-10d %s%-10d %s%-10d\n",
"uinodes ", lfsp->lfs_uinodes,
"bfree ", lfsp->lfs_bfree,
"avail ", lfsp->lfs_avail);
(void)printf(" %s%-10d %s0x%-8x %s0x%-8x\n",
"nfiles ", lfsp->lfs_nfiles,
"lastseg ", lfsp->lfs_lastseg,
"nextseg ", lfsp->lfs_nextseg);
(void)printf(" %s0x%-8x %s0x%-8x %s%-10lld\n",
"curseg ", lfsp->lfs_curseg,
"offset ", lfsp->lfs_offset,
"serial ", (long long)lfsp->lfs_serial);
(void)printf(" tstamp %s", ctime((time_t *)&lfsp->lfs_tstamp));
}
static void
addseg(char *arg)
{
SEGLIST *p;
if ((p = malloc(sizeof(SEGLIST))) == NULL)
err(1, "malloc");
p->next = seglist;
p->num = atoi(arg);
seglist = p;
}
static void
dump_cleaner_info(struct lfs *lfsp, void *ipage)
{
CLEANERINFO *cip;
cip = (CLEANERINFO *)ipage;
if (lfsp->lfs_version > 1) {
(void)printf("free_head %d\n", cip->free_head);
(void)printf("free_tail %d\n", cip->free_tail);
}
(void)printf("clean\t%d\tdirty\t%d\n",
cip->clean, cip->dirty);
(void)printf("bfree\t%d\tavail\t%d\n\n",
cip->bfree, cip->avail);
}
static void
usage(void)
{
(void)fprintf(stderr, "usage: dumplfs [-aiS] [-b daddr] [-I daddr] [-s segnum] file\n");
exit(1);
}
Reference in New Issue View Git Blame Copy Permalink