Home | History | Annotate | Line # | Download | only in dumpfs
dumpfs.c revision 1.36
      1  1.36       dsl /*	$NetBSD: dumpfs.c,v 1.36 2003/08/12 13:15:35 dsl Exp $	*/
      2   1.9       cgd 
      3   1.1       cgd /*
      4   1.6   mycroft  * Copyright (c) 1983, 1992, 1993
      5   1.6   mycroft  *	The Regents of the University of California.  All rights reserved.
      6   1.1       cgd  *
      7   1.1       cgd  * Redistribution and use in source and binary forms, with or without
      8   1.1       cgd  * modification, are permitted provided that the following conditions
      9   1.1       cgd  * are met:
     10   1.1       cgd  * 1. Redistributions of source code must retain the above copyright
     11   1.1       cgd  *    notice, this list of conditions and the following disclaimer.
     12   1.1       cgd  * 2. Redistributions in binary form must reproduce the above copyright
     13   1.1       cgd  *    notice, this list of conditions and the following disclaimer in the
     14   1.1       cgd  *    documentation and/or other materials provided with the distribution.
     15  1.35       agc  * 3. Neither the name of the University nor the names of its contributors
     16   1.1       cgd  *    may be used to endorse or promote products derived from this software
     17   1.1       cgd  *    without specific prior written permission.
     18   1.1       cgd  *
     19   1.1       cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     20   1.1       cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     21   1.1       cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     22   1.1       cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     23   1.1       cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     24   1.1       cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     25   1.1       cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     26   1.1       cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     27   1.1       cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     28   1.1       cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     29   1.1       cgd  * SUCH DAMAGE.
     30   1.1       cgd  */
     31   1.1       cgd 
     32  1.14     lukem #include <sys/cdefs.h>
     33   1.1       cgd #ifndef lint
     34  1.14     lukem __COPYRIGHT("@(#) Copyright (c) 1983, 1992, 1993\n\
     35  1.14     lukem 	The Regents of the University of California.  All rights reserved.\n");
     36   1.1       cgd #endif /* not lint */
     37   1.1       cgd 
     38   1.1       cgd #ifndef lint
     39   1.9       cgd #if 0
     40  1.13     lukem static char sccsid[] = "@(#)dumpfs.c	8.5 (Berkeley) 4/29/95";
     41   1.9       cgd #else
     42  1.36       dsl __RCSID("$NetBSD: dumpfs.c,v 1.36 2003/08/12 13:15:35 dsl Exp $");
     43   1.9       cgd #endif
     44   1.1       cgd #endif /* not lint */
     45   1.1       cgd 
     46   1.1       cgd #include <sys/param.h>
     47   1.5       cgd #include <sys/time.h>
     48   1.1       cgd 
     49  1.32     lukem #include <ufs/ufs/dinode.h>
     50  1.16    bouyer #include <ufs/ufs/ufs_bswap.h>
     51   1.6   mycroft #include <ufs/ffs/fs.h>
     52  1.16    bouyer #include <ufs/ffs/ffs_extern.h>
     53   1.6   mycroft 
     54   1.7   mycroft #include <err.h>
     55  1.31     lukem #include <errno.h>
     56   1.6   mycroft #include <fcntl.h>
     57   1.6   mycroft #include <fstab.h>
     58   1.1       cgd #include <stdio.h>
     59   1.6   mycroft #include <stdlib.h>
     60  1.31     lukem #include <string.h>
     61   1.7   mycroft #include <unistd.h>
     62  1.31     lukem #include <util.h>
     63   1.1       cgd 
     64   1.1       cgd union {
     65   1.1       cgd 	struct fs fs;
     66   1.1       cgd 	char pad[MAXBSIZE];
     67   1.1       cgd } fsun;
     68   1.1       cgd #define	afs	fsun.fs
     69   1.1       cgd 
     70   1.1       cgd union {
     71   1.1       cgd 	struct cg cg;
     72   1.1       cgd 	char pad[MAXBSIZE];
     73   1.1       cgd } cgun;
     74   1.1       cgd #define	acg	cgun.cg
     75   1.1       cgd 
     76   1.1       cgd long	dev_bsize = 1;
     77  1.31     lukem int	needswap, Fflag;
     78  1.33      fvdl int	is_ufs2;
     79   1.1       cgd 
     80  1.25     lukem int	dumpfs(const char *);
     81  1.25     lukem int	dumpcg(const char *, int, int);
     82  1.25     lukem int	main(int, char **);
     83  1.31     lukem int	openpartition(const char *, int, char *, size_t);
     84  1.25     lukem void	pbits(void *, int);
     85  1.25     lukem void	usage(void);
     86  1.25     lukem void	swap_cg(struct cg *);
     87   1.6   mycroft 
     88   1.6   mycroft int
     89  1.25     lukem main(int argc, char *argv[])
     90   1.1       cgd {
     91   1.6   mycroft 	int ch, eval;
     92   1.1       cgd 
     93  1.25     lukem 	while ((ch = getopt(argc, argv, "F")) != -1)
     94   1.6   mycroft 		switch(ch) {
     95  1.25     lukem 		case 'F':
     96  1.25     lukem 			Fflag = 1;
     97  1.25     lukem 			break;
     98   1.6   mycroft 		case '?':
     99   1.6   mycroft 		default:
    100   1.6   mycroft 			usage();
    101   1.6   mycroft 		}
    102   1.6   mycroft 	argc -= optind;
    103   1.6   mycroft 	argv += optind;
    104   1.6   mycroft 
    105   1.6   mycroft 	if (argc < 1)
    106   1.6   mycroft 		usage();
    107   1.6   mycroft 
    108  1.31     lukem 	for (eval = 0; *argv; ++argv) {
    109  1.31     lukem 		eval |= dumpfs(*argv);
    110  1.31     lukem 		printf("\n");
    111  1.31     lukem 	}
    112  1.31     lukem 
    113   1.6   mycroft 	exit(eval);
    114   1.1       cgd }
    115   1.1       cgd 
    116  1.33      fvdl off_t sblock_try[] = SBLOCKSEARCH;
    117  1.33      fvdl 
    118   1.6   mycroft int
    119  1.25     lukem dumpfs(const char *name)
    120   1.1       cgd {
    121  1.33      fvdl 	int fd, i, j, size, printold;
    122  1.23  christos 	time_t t;
    123  1.31     lukem 	char device[MAXPATHLEN];
    124  1.29     lukem 	struct csum *ccsp;
    125   1.6   mycroft 
    126  1.31     lukem 	if (Fflag)
    127  1.31     lukem 		fd = open(name, O_RDONLY);
    128  1.31     lukem 	else {
    129  1.31     lukem 		fd = openpartition(name, O_RDONLY, device, sizeof(device));
    130  1.31     lukem 		name = device;
    131  1.31     lukem 	}
    132  1.31     lukem 	if (fd == -1)
    133   1.6   mycroft 		goto err;
    134  1.31     lukem 
    135  1.36       dsl 	for (i = 0; ; i++) {
    136  1.36       dsl 		if (sblock_try[i] == -1) {
    137  1.36       dsl 			warnx("%s: could not find superblock, skipped", name);
    138  1.36       dsl 			return 1;
    139  1.36       dsl 		}
    140  1.33      fvdl 		if (lseek(fd, sblock_try[i], SEEK_SET) == (off_t)-1)
    141  1.33      fvdl 			continue;
    142  1.33      fvdl 		if (read(fd, &afs, SBLOCKSIZE) != SBLOCKSIZE)
    143  1.33      fvdl 			continue;
    144  1.33      fvdl 		switch(afs.fs_magic) {
    145  1.33      fvdl 		case FS_UFS2_MAGIC:
    146  1.33      fvdl 			is_ufs2 = 1;
    147  1.36       dsl 			break;
    148  1.33      fvdl 		case FS_UFS1_MAGIC:
    149  1.36       dsl 			break;
    150  1.33      fvdl 		case FS_UFS2_MAGIC_SWAPPED:
    151  1.36       dsl 			is_ufs2 = 1;
    152  1.36       dsl 			needswap = 1;
    153  1.36       dsl 			break;
    154  1.33      fvdl 		case FS_UFS1_MAGIC_SWAPPED:
    155  1.33      fvdl 			needswap = 1;
    156  1.36       dsl 			break;
    157  1.33      fvdl 		default:
    158  1.33      fvdl 			continue;
    159  1.33      fvdl 		}
    160  1.36       dsl 		break;
    161  1.33      fvdl 	}
    162  1.33      fvdl 
    163  1.33      fvdl 	if (needswap)
    164  1.33      fvdl 		ffs_sb_swap(&afs, &afs);
    165   1.8     glass 
    166  1.33      fvdl 	printold = (afs.fs_magic == FS_UFS1_MAGIC &&
    167  1.33      fvdl 		    (afs.fs_old_flags & FS_FLAGS_UPDATED) == 0);
    168  1.33      fvdl 	if (printold) {
    169  1.33      fvdl 		afs.fs_flags = afs.fs_old_flags;
    170  1.33      fvdl 		afs.fs_maxbsize = afs.fs_bsize;
    171  1.33      fvdl 		afs.fs_time = afs.fs_old_time;
    172  1.33      fvdl 		afs.fs_size = afs.fs_old_size;
    173  1.33      fvdl 		afs.fs_dsize = afs.fs_old_dsize;
    174  1.33      fvdl 		afs.fs_csaddr = afs.fs_old_csaddr;
    175  1.33      fvdl 		afs.fs_cstotal.cs_ndir = afs.fs_old_cstotal.cs_ndir;
    176  1.33      fvdl 		afs.fs_cstotal.cs_nbfree = afs.fs_old_cstotal.cs_nbfree;
    177  1.33      fvdl 		afs.fs_cstotal.cs_nifree = afs.fs_old_cstotal.cs_nifree;
    178  1.33      fvdl 		afs.fs_cstotal.cs_nffree = afs.fs_old_cstotal.cs_nffree;
    179  1.33      fvdl 	}
    180  1.31     lukem 
    181  1.31     lukem 	printf("file system: %s\n", name);
    182  1.16    bouyer #if BYTE_ORDER == LITTLE_ENDIAN
    183  1.16    bouyer 	if (needswap)
    184  1.16    bouyer #else
    185  1.16    bouyer 	if (!needswap)
    186  1.16    bouyer #endif
    187  1.19   mycroft 		printf("endian\tbig-endian\n");
    188  1.16    bouyer 	else
    189  1.19   mycroft 		printf("endian\tlittle-endian\n");
    190  1.33      fvdl 	if (printold && afs.fs_old_postblformat == FS_42POSTBLFMT)
    191  1.33      fvdl 		afs.fs_old_nrpos = 8;
    192   1.1       cgd 	dev_bsize = afs.fs_fsize / fsbtodb(&afs, 1);
    193  1.24     lukem 	t = afs.fs_time;
    194  1.34        he 	printf("location%lld\tmagic\t%x\ttime\t%s", (long long)sblock_try[i],
    195  1.34        he 	    afs.fs_magic, ctime(&t));
    196  1.36       dsl 	if (is_ufs2)
    197  1.36       dsl 		i = 4;
    198  1.36       dsl 	else {
    199  1.36       dsl 		i = 0;
    200  1.36       dsl 		if (!printold && afs.fs_old_postblformat != FS_42POSTBLFMT) {
    201  1.36       dsl 			i++;
    202  1.36       dsl 			if (afs.fs_old_inodefmt >= FS_44INODEFMT) {
    203  1.36       dsl 				int max;
    204  1.12     lukem 
    205  1.12     lukem 				i++;
    206  1.36       dsl 				max = afs.fs_maxcontig;
    207  1.36       dsl 				size = afs.fs_contigsumsize;
    208  1.36       dsl 				if ((max < 2 && size == 0)
    209  1.36       dsl 				    || (max > 1 && size >= MIN(max, FS_MAXCONTIG)))
    210  1.36       dsl 					i++;
    211  1.36       dsl 			}
    212  1.12     lukem 		}
    213  1.12     lukem 	}
    214  1.28     lukem 	printf("id\t[ %x %x ]\n", afs.fs_id[0], afs.fs_id[1]);
    215  1.21        pk 	printf("cylgrp\t%s\tinodes\t%s\tfslevel %d\tsoftdep %sabled\n",
    216  1.36       dsl 	    i < 1 ? "static" : "dynamic",
    217  1.36       dsl 	    i < 2 ? "4.2/4.3BSD" : i < 4 ? "4.4BSD" : "FFSv2", i,
    218  1.21        pk 	    (afs.fs_flags & FS_DOSOFTDEP) ? "en" : "dis");
    219  1.33      fvdl 	printf("nbfree\t%lld\tndir\t%lld\tnifree\t%lld\tnffree\t%lld\n",
    220  1.33      fvdl 	    (long long)afs.fs_cstotal.cs_nbfree,
    221  1.33      fvdl 	    (long long)afs.fs_cstotal.cs_ndir,
    222  1.33      fvdl 	    (long long)afs.fs_cstotal.cs_nifree,
    223  1.33      fvdl 	    (long long)afs.fs_cstotal.cs_nffree);
    224  1.33      fvdl 	printf("ncg\t%d\tsize\t%lld\tblocks\t%lld\n",
    225  1.34        he 	    afs.fs_ncg, (long long)afs.fs_size, (long long)afs.fs_dsize);
    226  1.33      fvdl 	if (printold)
    227  1.33      fvdl 		printf("ncyl\t%d\n", afs.fs_old_ncyl);
    228   1.1       cgd 	printf("bsize\t%d\tshift\t%d\tmask\t0x%08x\n",
    229   1.1       cgd 	    afs.fs_bsize, afs.fs_bshift, afs.fs_bmask);
    230   1.1       cgd 	printf("fsize\t%d\tshift\t%d\tmask\t0x%08x\n",
    231   1.1       cgd 	    afs.fs_fsize, afs.fs_fshift, afs.fs_fmask);
    232   1.1       cgd 	printf("frag\t%d\tshift\t%d\tfsbtodb\t%d\n",
    233   1.1       cgd 	    afs.fs_frag, afs.fs_fragshift, afs.fs_fsbtodb);
    234  1.33      fvdl 	printf("bpg\t%d\tfpg\t%d\tipg\t%d\n",
    235  1.33      fvdl 	    afs.fs_fpg / afs.fs_frag, afs.fs_fpg, afs.fs_ipg);
    236   1.1       cgd 	printf("minfree\t%d%%\toptim\t%s\tmaxcontig %d\tmaxbpg\t%d\n",
    237   1.1       cgd 	    afs.fs_minfree, afs.fs_optim == FS_OPTSPACE ? "space" : "time",
    238   1.1       cgd 	    afs.fs_maxcontig, afs.fs_maxbpg);
    239  1.33      fvdl 	if (printold) {
    240  1.33      fvdl 		printf("cpg\t%d\trotdelay %dms\trps\t%d\n",
    241  1.33      fvdl 		    afs.fs_old_cpg, afs.fs_old_rotdelay, afs.fs_old_rps);
    242  1.33      fvdl 		printf("ntrak\t%d\tnsect\t%d\tnpsect\t%d\tspc\t%d\n",
    243  1.33      fvdl 		    afs.fs_spare2, afs.fs_old_nsect, afs.fs_old_npsect,
    244  1.33      fvdl 		    afs.fs_old_spc);
    245  1.33      fvdl 		printf("trackskew %d\tinterleave %d\n",
    246  1.33      fvdl 		    afs.fs_old_trackskew, afs.fs_old_interleave);
    247  1.33      fvdl 	}
    248  1.33      fvdl 	printf("symlinklen %d\tcontigsumsize %d\n",
    249  1.33      fvdl 	    afs.fs_maxsymlinklen, afs.fs_contigsumsize);
    250  1.22     lukem 	printf("maxfilesize 0x%016llx\n",
    251  1.20   thorpej 	    (unsigned long long)afs.fs_maxfilesize);
    252  1.33      fvdl 	printf("nindir\t%d\tinopb\t%d\n", afs.fs_nindir, afs.fs_inopb);
    253  1.33      fvdl 	if (printold)
    254  1.33      fvdl 		printf("nspf\t%d\n", afs.fs_old_nspf);
    255  1.30     lukem 	printf("avgfilesize %d\tavgfpdir %d\n",
    256  1.30     lukem 	    afs.fs_avgfilesize, afs.fs_avgfpdir);
    257   1.1       cgd 	printf("sblkno\t%d\tcblkno\t%d\tiblkno\t%d\tdblkno\t%d\n",
    258   1.1       cgd 	    afs.fs_sblkno, afs.fs_cblkno, afs.fs_iblkno, afs.fs_dblkno);
    259  1.33      fvdl 	printf("sbsize\t%d\tcgsize\t%d\n", afs.fs_sbsize, afs.fs_cgsize);
    260  1.33      fvdl 	if (printold)
    261  1.33      fvdl 		printf("offset\t%d\tmask\t0x%08x\n",
    262  1.33      fvdl 		    afs.fs_old_cgoffset, afs.fs_old_cgmask);
    263  1.33      fvdl 	printf("csaddr\t%lld\tcssize %d\n",
    264  1.33      fvdl 	    (long long)afs.fs_csaddr, afs.fs_cssize);
    265  1.33      fvdl 	if (printold)
    266  1.33      fvdl 		printf("shift\t%d\tmask\t0x%08x\n",
    267  1.33      fvdl 		    afs.fs_spare1[0], afs.fs_spare1[1]);
    268  1.10   mycroft 	printf("cgrotor\t%d\tfmod\t%d\tronly\t%d\tclean\t0x%02x\n",
    269  1.10   mycroft 	    afs.fs_cgrotor, afs.fs_fmod, afs.fs_ronly, afs.fs_clean);
    270  1.33      fvdl 	if (printold) {
    271  1.33      fvdl 		if (afs.fs_old_cpc != 0)
    272  1.33      fvdl 			printf("blocks available in each of %d rotational "
    273  1.33      fvdl 			       "positions", afs.fs_old_nrpos);
    274  1.33      fvdl 		else
    275  1.33      fvdl 			printf("(no rotational position table)\n");
    276   1.1       cgd 	}
    277   1.1       cgd 	printf("\ncs[].cs_(nbfree,ndir,nifree,nffree):\n\t");
    278  1.29     lukem 	afs.fs_csp = calloc(1, afs.fs_cssize);
    279   1.1       cgd 	for (i = 0, j = 0; i < afs.fs_cssize; i += afs.fs_bsize, j++) {
    280   1.1       cgd 		size = afs.fs_cssize - i < afs.fs_bsize ?
    281   1.1       cgd 		    afs.fs_cssize - i : afs.fs_bsize;
    282  1.29     lukem 		ccsp = (struct csum *)((char *)afs.fs_csp + i);
    283   1.6   mycroft 		if (lseek(fd,
    284  1.11        pk 		    (off_t)(fsbtodb(&afs, (afs.fs_csaddr + j * afs.fs_frag))) *
    285  1.11        pk 		    dev_bsize, SEEK_SET) == (off_t)-1)
    286   1.6   mycroft 			goto err;
    287  1.29     lukem 		if (read(fd, ccsp, size) != size)
    288   1.6   mycroft 			goto err;
    289  1.16    bouyer 		if (needswap)
    290  1.29     lukem 			ffs_csum_swap(ccsp, ccsp, size);
    291   1.1       cgd 	}
    292   1.1       cgd 	for (i = 0; i < afs.fs_ncg; i++) {
    293   1.1       cgd 		struct csum *cs = &afs.fs_cs(&afs, i);
    294   1.1       cgd 		if (i && i % 4 == 0)
    295   1.1       cgd 			printf("\n\t");
    296   1.1       cgd 		printf("(%d,%d,%d,%d) ",
    297   1.1       cgd 		    cs->cs_nbfree, cs->cs_ndir, cs->cs_nifree, cs->cs_nffree);
    298   1.1       cgd 	}
    299   1.1       cgd 	printf("\n");
    300  1.33      fvdl 	if (printold && (afs.fs_old_ncyl % afs.fs_old_cpg)) {
    301   1.1       cgd 		printf("cylinders in last group %d\n",
    302  1.33      fvdl 		    i = afs.fs_old_ncyl % afs.fs_old_cpg);
    303   1.1       cgd 		printf("blocks in last group %d\n",
    304  1.33      fvdl 		    i * afs.fs_old_spc / (afs.fs_old_nspf << afs.fs_fragshift));
    305   1.1       cgd 	}
    306   1.1       cgd 	printf("\n");
    307   1.1       cgd 	for (i = 0; i < afs.fs_ncg; i++)
    308   1.6   mycroft 		if (dumpcg(name, fd, i))
    309   1.6   mycroft 			goto err;
    310   1.6   mycroft 	(void)close(fd);
    311  1.33      fvdl 	return 0;
    312   1.6   mycroft 
    313   1.6   mycroft err:	if (fd != -1)
    314   1.6   mycroft 		(void)close(fd);
    315   1.7   mycroft 	warn("%s", name);
    316  1.33      fvdl 	return 1;
    317   1.1       cgd };
    318   1.1       cgd 
    319   1.6   mycroft int
    320  1.25     lukem dumpcg(const char *name, int fd, int c)
    321   1.1       cgd {
    322   1.6   mycroft 	off_t cur;
    323   1.6   mycroft 	int i, j;
    324  1.23  christos 	time_t t;
    325   1.1       cgd 
    326   1.1       cgd 	printf("\ncg %d:\n", c);
    327  1.11        pk 	if ((cur = lseek(fd, (off_t)(fsbtodb(&afs, cgtod(&afs, c))) * dev_bsize,
    328   1.6   mycroft 	    SEEK_SET)) == (off_t)-1)
    329   1.6   mycroft 		return (1);
    330   1.6   mycroft 	if (read(fd, &acg, afs.fs_bsize) != afs.fs_bsize) {
    331   1.7   mycroft 		warnx("%s: error reading cg", name);
    332   1.6   mycroft 		return (1);
    333   1.1       cgd 	}
    334  1.16    bouyer 	if (needswap)
    335  1.33      fvdl 		ffs_cg_swap(&acg, &acg, &afs);
    336  1.24     lukem 	t = acg.cg_time;
    337  1.22     lukem 	printf("magic\t%x\ttell\t%llx\ttime\t%s",
    338  1.33      fvdl 	    afs.fs_old_postblformat == FS_42POSTBLFMT ?
    339   1.1       cgd 	    ((struct ocg *)&acg)->cg_magic : acg.cg_magic,
    340  1.23  christos 	    (long long)cur, ctime(&t));
    341  1.33      fvdl 	printf("cgx\t%d\tniblk\t%d\tndblk\t%d\n",
    342  1.33      fvdl 	    acg.cg_cgx, acg.cg_niblk, acg.cg_ndblk);
    343   1.1       cgd 	printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n",
    344   1.1       cgd 	    acg.cg_cs.cs_nbfree, acg.cg_cs.cs_ndir,
    345   1.1       cgd 	    acg.cg_cs.cs_nifree, acg.cg_cs.cs_nffree);
    346   1.1       cgd 	printf("rotor\t%d\tirotor\t%d\tfrotor\t%d\nfrsum",
    347   1.1       cgd 	    acg.cg_rotor, acg.cg_irotor, acg.cg_frotor);
    348   1.1       cgd 	for (i = 1, j = 0; i < afs.fs_frag; i++) {
    349   1.1       cgd 		printf("\t%d", acg.cg_frsum[i]);
    350   1.1       cgd 		j += i * acg.cg_frsum[i];
    351   1.1       cgd 	}
    352   1.6   mycroft 	printf("\nsum of frsum: %d", j);
    353   1.6   mycroft 	if (afs.fs_contigsumsize > 0) {
    354   1.6   mycroft 		for (i = 1; i < afs.fs_contigsumsize; i++) {
    355   1.6   mycroft 			if ((i - 1) % 8 == 0)
    356   1.6   mycroft 				printf("\nclusters %d-%d:", i,
    357   1.6   mycroft 				    afs.fs_contigsumsize - 1 < i + 7 ?
    358   1.6   mycroft 				    afs.fs_contigsumsize - 1 : i + 7);
    359  1.16    bouyer 			printf("\t%d", cg_clustersum(&acg, 0)[i]);
    360   1.6   mycroft 		}
    361   1.6   mycroft 		printf("\nclusters size %d and over: %d\n",
    362   1.6   mycroft 		    afs.fs_contigsumsize,
    363  1.16    bouyer 		    cg_clustersum(&acg, 0)[afs.fs_contigsumsize]);
    364   1.6   mycroft 		printf("clusters free:\t");
    365  1.16    bouyer 		pbits(cg_clustersfree(&acg, 0), acg.cg_nclusterblks);
    366   1.6   mycroft 	} else
    367   1.6   mycroft 		printf("\n");
    368   1.6   mycroft 	printf("iused:\t");
    369  1.16    bouyer 	pbits(cg_inosused(&acg, 0), afs.fs_ipg);
    370   1.1       cgd 	printf("free:\t");
    371  1.16    bouyer 	pbits(cg_blksfree(&acg, 0), afs.fs_fpg);
    372   1.6   mycroft 	return (0);
    373   1.1       cgd };
    374   1.1       cgd 
    375   1.6   mycroft void
    376  1.25     lukem pbits(void *vp, int max)
    377   1.1       cgd {
    378  1.14     lukem 	int i;
    379  1.14     lukem 	char *p;
    380   1.6   mycroft 	int count, j;
    381   1.1       cgd 
    382   1.6   mycroft 	for (count = i = 0, p = vp; i < max; i++)
    383   1.6   mycroft 		if (isset(p, i)) {
    384   1.1       cgd 			if (count)
    385   1.1       cgd 				printf(",%s", count % 6 ? " " : "\n\t");
    386   1.1       cgd 			count++;
    387   1.1       cgd 			printf("%d", i);
    388   1.1       cgd 			j = i;
    389   1.6   mycroft 			while ((i+1)<max && isset(p, i+1))
    390   1.1       cgd 				i++;
    391   1.1       cgd 			if (i != j)
    392   1.1       cgd 				printf("-%d", i);
    393   1.1       cgd 		}
    394   1.1       cgd 	printf("\n");
    395   1.6   mycroft }
    396   1.6   mycroft 
    397   1.6   mycroft void
    398  1.25     lukem usage(void)
    399   1.6   mycroft {
    400   1.7   mycroft 
    401  1.25     lukem 	(void)fprintf(stderr, "usage: dumpfs [-F] filesys | device [...]\n");
    402   1.6   mycroft 	exit(1);
    403  1.31     lukem }
    404  1.31     lukem 
    405  1.31     lukem int
    406  1.31     lukem openpartition(const char *name, int flags, char *device, size_t devicelen)
    407  1.31     lukem {
    408  1.31     lukem 	char		rawspec[MAXPATHLEN], *p;
    409  1.31     lukem 	struct fstab	*fs;
    410  1.31     lukem 	int		fd, oerrno;
    411  1.31     lukem 
    412  1.31     lukem 	fs = getfsfile(name);
    413  1.31     lukem 	if (fs) {
    414  1.31     lukem 		if ((p = strrchr(fs->fs_spec, '/')) != NULL) {
    415  1.31     lukem 			snprintf(rawspec, sizeof(rawspec), "%.*s/r%s",
    416  1.31     lukem 			    (int)(p - fs->fs_spec), fs->fs_spec, p + 1);
    417  1.31     lukem 			name = rawspec;
    418  1.31     lukem 		} else
    419  1.31     lukem 			name = fs->fs_spec;
    420  1.31     lukem 	}
    421  1.31     lukem 	fd = opendisk(name, flags, device, devicelen, 0);
    422  1.31     lukem 	if (fd == -1 && errno == ENOENT) {
    423  1.31     lukem 		oerrno = errno;
    424  1.31     lukem 		strlcpy(device, name, devicelen);
    425  1.31     lukem 		errno = oerrno;
    426  1.31     lukem 	}
    427  1.31     lukem 	return (fd);
    428   1.1       cgd }
    429