xref: /original-bsd/sbin/dumpfs/dumpfs.c (revision 358f5c7d)
1 /*
2  * Copyright (c) 1983 The Regents of the University of California.
3  * All rights reserved.
4  *
5  * %sccs.include.redist.c%
6  */
7 
8 #ifndef lint
9 char copyright[] =
10 "@(#) Copyright (c) 1983 The Regents of the University of California.\n\
11  All rights reserved.\n";
12 #endif /* not lint */
13 
14 #ifndef lint
15 static char sccsid[] = "@(#)dumpfs.c	5.12 (Berkeley) 05/28/92";
16 #endif /* not lint */
17 
18 #include <sys/param.h>
19 #include <sys/time.h>
20 #include <ufs/ufs/dinode.h>
21 #include <ufs/ffs/fs.h>
22 
23 #include <stdio.h>
24 #include <fstab.h>
25 
26 /*
27  * dumpfs
28  */
29 
30 union {
31 	struct fs fs;
32 	char pad[MAXBSIZE];
33 } fsun;
34 #define	afs	fsun.fs
35 
36 union {
37 	struct cg cg;
38 	char pad[MAXBSIZE];
39 } cgun;
40 #define	acg	cgun.cg
41 
42 long	dev_bsize = 1;
43 
44 main(argc, argv)
45 	char **argv;
46 {
47 	register struct fstab *fs;
48 
49 	argc--, argv++;
50 	if (argc < 1) {
51 		fprintf(stderr, "usage: dumpfs fs ...\n");
52 		exit(1);
53 	}
54 	for (; argc > 0; argv++, argc--) {
55 		fs = getfsfile(*argv);
56 		if (fs == 0)
57 			dumpfs(*argv);
58 		else
59 			dumpfs(fs->fs_spec);
60 	}
61 }
62 
63 dumpfs(name)
64 	char *name;
65 {
66 	int c, i, j, k, size;
67 
68 	close(0);
69 	if (open(name, 0) != 0) {
70 		perror(name);
71 		return;
72 	}
73 	lseek(0, SBOFF, 0);
74 	if (read(0, &afs, SBSIZE) != SBSIZE) {
75 		perror(name);
76 		return;
77 	}
78 	if (afs.fs_postblformat == FS_42POSTBLFMT)
79 		afs.fs_nrpos = 8;
80 	dev_bsize = afs.fs_fsize / fsbtodb(&afs, 1);
81 	printf("magic\t%x\tformat\t%s\ttime\t%s", afs.fs_magic,
82 	    afs.fs_postblformat == FS_42POSTBLFMT ? "static" : "dynamic",
83 	    ctime(&afs.fs_time));
84 	printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n",
85 	    afs.fs_cstotal.cs_nbfree, afs.fs_cstotal.cs_ndir,
86 	    afs.fs_cstotal.cs_nifree, afs.fs_cstotal.cs_nffree);
87 	printf("ncg\t%d\tncyl\t%d\tsize\t%d\tblocks\t%d\n",
88 	    afs.fs_ncg, afs.fs_ncyl, afs.fs_size, afs.fs_dsize);
89 	printf("bsize\t%d\tshift\t%d\tmask\t0x%08x\n",
90 	    afs.fs_bsize, afs.fs_bshift, afs.fs_bmask);
91 	printf("fsize\t%d\tshift\t%d\tmask\t0x%08x\n",
92 	    afs.fs_fsize, afs.fs_fshift, afs.fs_fmask);
93 	printf("frag\t%d\tshift\t%d\tfsbtodb\t%d\n",
94 	    afs.fs_frag, afs.fs_fragshift, afs.fs_fsbtodb);
95 	printf("cpg\t%d\tbpg\t%d\tfpg\t%d\tipg\t%d\n",
96 	    afs.fs_cpg, afs.fs_fpg / afs.fs_frag, afs.fs_fpg, afs.fs_ipg);
97 	printf("minfree\t%d%%\toptim\t%s\tmaxcontig %d\tmaxbpg\t%d\n",
98 	    afs.fs_minfree, afs.fs_optim == FS_OPTSPACE ? "space" : "time",
99 	    afs.fs_maxcontig, afs.fs_maxbpg);
100 	printf("rotdelay %dms\theadswitch %dus\ttrackseek %dus\trps\t%d\n",
101 	    afs.fs_rotdelay, afs.fs_headswitch, afs.fs_trkseek, afs.fs_rps);
102 	printf("ntrak\t%d\tnsect\t%d\tnpsect\t%d\tspc\t%d\n",
103 	    afs.fs_ntrak, afs.fs_nsect, afs.fs_npsect, afs.fs_spc);
104 	printf("trackskew %d\tinterleave %d\n",
105 	    afs.fs_trackskew, afs.fs_interleave);
106 	printf("nindir\t%d\tinopb\t%d\tnspf\t%d\n",
107 	    afs.fs_nindir, afs.fs_inopb, afs.fs_nspf);
108 	printf("sblkno\t%d\tcblkno\t%d\tiblkno\t%d\tdblkno\t%d\n",
109 	    afs.fs_sblkno, afs.fs_cblkno, afs.fs_iblkno, afs.fs_dblkno);
110 	printf("sbsize\t%d\tcgsize\t%d\tcgoffset %d\tcgmask\t0x%08x\n",
111 	    afs.fs_sbsize, afs.fs_cgsize, afs.fs_cgoffset, afs.fs_cgmask);
112 	printf("csaddr\t%d\tcssize\t%d\tshift\t%d\tmask\t0x%08x\n",
113 	    afs.fs_csaddr, afs.fs_cssize, afs.fs_csshift, afs.fs_csmask);
114 	printf("cgrotor\t%d\tfmod\t%d\tronly\t%d\n",
115 	    afs.fs_cgrotor, afs.fs_fmod, afs.fs_ronly);
116 	if (afs.fs_cpc != 0)
117 		printf("blocks available in each of %d rotational positions",
118 		     afs.fs_nrpos);
119 	else
120 		printf("insufficient space to maintain rotational tables\n");
121 	for (c = 0; c < afs.fs_cpc; c++) {
122 		printf("\ncylinder number %d:", c);
123 		for (i = 0; i < afs.fs_nrpos; i++) {
124 			if (fs_postbl(&afs, c)[i] == -1)
125 				continue;
126 			printf("\n   position %d:\t", i);
127 			for (j = fs_postbl(&afs, c)[i], k = 1; ;
128 			     j += fs_rotbl(&afs)[j], k++) {
129 				printf("%5d", j);
130 				if (k % 12 == 0)
131 					printf("\n\t\t");
132 				if (fs_rotbl(&afs)[j] == 0)
133 					break;
134 			}
135 		}
136 	}
137 	printf("\ncs[].cs_(nbfree,ndir,nifree,nffree):\n\t");
138 	for (i = 0, j = 0; i < afs.fs_cssize; i += afs.fs_bsize, j++) {
139 		size = afs.fs_cssize - i < afs.fs_bsize ?
140 		    afs.fs_cssize - i : afs.fs_bsize;
141 		afs.fs_csp[j] = (struct csum *)calloc(1, size);
142 		lseek(0, fsbtodb(&afs, (afs.fs_csaddr + j * afs.fs_frag)) *
143 		    dev_bsize, 0);
144 		if (read(0, afs.fs_csp[j], size) != size) {
145 			perror(name);
146 			return;
147 		}
148 	}
149 	for (i = 0; i < afs.fs_ncg; i++) {
150 		struct csum *cs = &afs.fs_cs(&afs, i);
151 		if (i && i % 4 == 0)
152 			printf("\n\t");
153 		printf("(%d,%d,%d,%d) ",
154 		    cs->cs_nbfree, cs->cs_ndir, cs->cs_nifree, cs->cs_nffree);
155 	}
156 	printf("\n");
157 	if (afs.fs_ncyl % afs.fs_cpg) {
158 		printf("cylinders in last group %d\n",
159 		    i = afs.fs_ncyl % afs.fs_cpg);
160 		printf("blocks in last group %d\n",
161 		    i * afs.fs_spc / NSPB(&afs));
162 	}
163 	printf("\n");
164 	for (i = 0; i < afs.fs_ncg; i++)
165 		dumpcg(name, i);
166 	close(0);
167 };
168 
169 dumpcg(name, c)
170 	char *name;
171 	int c;
172 {
173 	int i,j;
174 
175 	printf("\ncg %d:\n", c);
176 	lseek(0, fsbtodb(&afs, cgtod(&afs, c)) * dev_bsize, 0);
177 	i = lseek(0, 0, 1);
178 	if (read(0, (char *)&acg, afs.fs_bsize) != afs.fs_bsize) {
179 		printf("dumpfs: %s: error reading cg\n", name);
180 		return;
181 	}
182 	printf("magic\t%x\ttell\t%x\ttime\t%s",
183 	    afs.fs_postblformat == FS_42POSTBLFMT ?
184 	    ((struct ocg *)&acg)->cg_magic : acg.cg_magic,
185 	    i, ctime(&acg.cg_time));
186 	printf("cgx\t%d\tncyl\t%d\tniblk\t%d\tndblk\t%d\n",
187 	    acg.cg_cgx, acg.cg_ncyl, acg.cg_niblk, acg.cg_ndblk);
188 	printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n",
189 	    acg.cg_cs.cs_nbfree, acg.cg_cs.cs_ndir,
190 	    acg.cg_cs.cs_nifree, acg.cg_cs.cs_nffree);
191 	printf("rotor\t%d\tirotor\t%d\tfrotor\t%d\nfrsum",
192 	    acg.cg_rotor, acg.cg_irotor, acg.cg_frotor);
193 	for (i = 1, j = 0; i < afs.fs_frag; i++) {
194 		printf("\t%d", acg.cg_frsum[i]);
195 		j += i * acg.cg_frsum[i];
196 	}
197 	printf("\nsum of frsum: %d\niused:\t", j);
198 	pbits(cg_inosused(&acg), afs.fs_ipg);
199 	printf("free:\t");
200 	pbits(cg_blksfree(&acg), afs.fs_fpg);
201 	printf("b:\n");
202 	for (i = 0; i < afs.fs_cpg; i++) {
203 		if (cg_blktot(&acg)[i] == 0)
204 			continue;
205 		printf("   c%d:\t(%d)\t", i, cg_blktot(&acg)[i]);
206 		for (j = 0; j < afs.fs_nrpos; j++) {
207 			if (afs.fs_cpc > 0 &&
208 			    fs_postbl(&afs, i % afs.fs_cpc)[j] == -1)
209 				continue;
210 			printf(" %d", cg_blks(&afs, &acg, i)[j]);
211 		}
212 		printf("\n");
213 	}
214 };
215 
216 pbits(cp, max)
217 	register char *cp;
218 	int max;
219 {
220 	register int i;
221 	int count = 0, j;
222 
223 	for (i = 0; i < max; i++)
224 		if (isset(cp, i)) {
225 			if (count)
226 				printf(",%s", count % 6 ? " " : "\n\t");
227 			count++;
228 			printf("%d", i);
229 			j = i;
230 			while ((i+1)<max && isset(cp, i+1))
231 				i++;
232 			if (i != j)
233 				printf("-%d", i);
234 		}
235 	printf("\n");
236 }
237