1 /*
2 * Copyright (c) 1983 The Regents of the University of California.
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
32 */
33
34 #ifndef lint
35 char copyright[] =
36 "@(#) Copyright (c) 1983 The Regents of the University of California.\n\
37 All rights reserved.\n";
38 #endif /* not lint */
39
40 #ifndef lint
41 static char sccsid[] = "@(#)dumpfs.c 5.10 (Berkeley) 6/1/90";
42 #endif /* not lint */
43
44 #include <sys/param.h>
45 #include <ufs/dinode.h>
46 #include <ufs/fs.h>
47
48 #include <stdio.h>
49 #include <fstab.h>
50
51 /*
52 * dumpfs
53 */
54
55 union {
56 struct fs fs;
57 char pad[MAXBSIZE];
58 } fsun;
59 #define afs fsun.fs
60
61 union {
62 struct cg cg;
63 char pad[MAXBSIZE];
64 } cgun;
65 #define acg cgun.cg
66
67 long dev_bsize = 1;
68
main(argc,argv)69 main(argc, argv)
70 char **argv;
71 {
72 register struct fstab *fs;
73
74 argc--, argv++;
75 if (argc < 1) {
76 fprintf(stderr, "usage: dumpfs fs ...\n");
77 exit(1);
78 }
79 for (; argc > 0; argv++, argc--) {
80 fs = getfsfile(*argv);
81 if (fs == 0)
82 dumpfs(*argv);
83 else
84 dumpfs(fs->fs_spec);
85 }
86 }
87
dumpfs(name)88 dumpfs(name)
89 char *name;
90 {
91 int c, i, j, k, size;
92
93 close(0);
94 if (open(name, 0) != 0) {
95 perror(name);
96 return;
97 }
98 lseek(0, SBOFF, 0);
99 if (read(0, &afs, SBSIZE) != SBSIZE) {
100 perror(name);
101 return;
102 }
103 if (afs.fs_postblformat == FS_42POSTBLFMT)
104 afs.fs_nrpos = 8;
105 dev_bsize = afs.fs_fsize / fsbtodb(&afs, 1);
106 printf("magic\t%x\tformat\t%s\ttime\t%s", afs.fs_magic,
107 afs.fs_postblformat == FS_42POSTBLFMT ? "static" : "dynamic",
108 ctime(&afs.fs_time));
109 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n",
110 afs.fs_cstotal.cs_nbfree, afs.fs_cstotal.cs_ndir,
111 afs.fs_cstotal.cs_nifree, afs.fs_cstotal.cs_nffree);
112 printf("ncg\t%d\tncyl\t%d\tsize\t%d\tblocks\t%d\n",
113 afs.fs_ncg, afs.fs_ncyl, afs.fs_size, afs.fs_dsize);
114 printf("bsize\t%d\tshift\t%d\tmask\t0x%08x\n",
115 afs.fs_bsize, afs.fs_bshift, afs.fs_bmask);
116 printf("fsize\t%d\tshift\t%d\tmask\t0x%08x\n",
117 afs.fs_fsize, afs.fs_fshift, afs.fs_fmask);
118 printf("frag\t%d\tshift\t%d\tfsbtodb\t%d\n",
119 afs.fs_frag, afs.fs_fragshift, afs.fs_fsbtodb);
120 printf("cpg\t%d\tbpg\t%d\tfpg\t%d\tipg\t%d\n",
121 afs.fs_cpg, afs.fs_fpg / afs.fs_frag, afs.fs_fpg, afs.fs_ipg);
122 printf("minfree\t%d%%\toptim\t%s\tmaxcontig %d\tmaxbpg\t%d\n",
123 afs.fs_minfree, afs.fs_optim == FS_OPTSPACE ? "space" : "time",
124 afs.fs_maxcontig, afs.fs_maxbpg);
125 printf("rotdelay %dms\theadswitch %dus\ttrackseek %dus\trps\t%d\n",
126 afs.fs_rotdelay, afs.fs_headswitch, afs.fs_trkseek, afs.fs_rps);
127 printf("ntrak\t%d\tnsect\t%d\tnpsect\t%d\tspc\t%d\n",
128 afs.fs_ntrak, afs.fs_nsect, afs.fs_npsect, afs.fs_spc);
129 printf("trackskew %d\tinterleave %d\n",
130 afs.fs_trackskew, afs.fs_interleave);
131 printf("nindir\t%d\tinopb\t%d\tnspf\t%d\n",
132 afs.fs_nindir, afs.fs_inopb, afs.fs_nspf);
133 printf("sblkno\t%d\tcblkno\t%d\tiblkno\t%d\tdblkno\t%d\n",
134 afs.fs_sblkno, afs.fs_cblkno, afs.fs_iblkno, afs.fs_dblkno);
135 printf("sbsize\t%d\tcgsize\t%d\tcgoffset %d\tcgmask\t0x%08x\n",
136 afs.fs_sbsize, afs.fs_cgsize, afs.fs_cgoffset, afs.fs_cgmask);
137 printf("csaddr\t%d\tcssize\t%d\tshift\t%d\tmask\t0x%08x\n",
138 afs.fs_csaddr, afs.fs_cssize, afs.fs_csshift, afs.fs_csmask);
139 printf("cgrotor\t%d\tfmod\t%d\tronly\t%d\n",
140 afs.fs_cgrotor, afs.fs_fmod, afs.fs_ronly);
141 if (afs.fs_cpc != 0)
142 printf("blocks available in each of %d rotational positions",
143 afs.fs_nrpos);
144 else
145 printf("insufficient space to maintain rotational tables\n");
146 for (c = 0; c < afs.fs_cpc; c++) {
147 printf("\ncylinder number %d:", c);
148 for (i = 0; i < afs.fs_nrpos; i++) {
149 if (fs_postbl(&afs, c)[i] == -1)
150 continue;
151 printf("\n position %d:\t", i);
152 for (j = fs_postbl(&afs, c)[i], k = 1; ;
153 j += fs_rotbl(&afs)[j], k++) {
154 printf("%5d", j);
155 if (k % 12 == 0)
156 printf("\n\t\t");
157 if (fs_rotbl(&afs)[j] == 0)
158 break;
159 }
160 }
161 }
162 printf("\ncs[].cs_(nbfree,ndir,nifree,nffree):\n\t");
163 for (i = 0, j = 0; i < afs.fs_cssize; i += afs.fs_bsize, j++) {
164 size = afs.fs_cssize - i < afs.fs_bsize ?
165 afs.fs_cssize - i : afs.fs_bsize;
166 afs.fs_csp[j] = (struct csum *)calloc(1, size);
167 lseek(0, fsbtodb(&afs, (afs.fs_csaddr + j * afs.fs_frag)) *
168 dev_bsize, 0);
169 if (read(0, afs.fs_csp[j], size) != size) {
170 perror(name);
171 return;
172 }
173 }
174 for (i = 0; i < afs.fs_ncg; i++) {
175 struct csum *cs = &afs.fs_cs(&afs, i);
176 if (i && i % 4 == 0)
177 printf("\n\t");
178 printf("(%d,%d,%d,%d) ",
179 cs->cs_nbfree, cs->cs_ndir, cs->cs_nifree, cs->cs_nffree);
180 }
181 printf("\n");
182 if (afs.fs_ncyl % afs.fs_cpg) {
183 printf("cylinders in last group %d\n",
184 i = afs.fs_ncyl % afs.fs_cpg);
185 printf("blocks in last group %d\n",
186 i * afs.fs_spc / NSPB(&afs));
187 }
188 printf("\n");
189 for (i = 0; i < afs.fs_ncg; i++)
190 dumpcg(name, i);
191 close(0);
192 };
193
dumpcg(name,c)194 dumpcg(name, c)
195 char *name;
196 int c;
197 {
198 int i,j;
199
200 printf("\ncg %d:\n", c);
201 lseek(0, fsbtodb(&afs, cgtod(&afs, c)) * dev_bsize, 0);
202 i = lseek(0, 0, 1);
203 if (read(0, (char *)&acg, afs.fs_bsize) != afs.fs_bsize) {
204 printf("dumpfs: %s: error reading cg\n", name);
205 return;
206 }
207 printf("magic\t%x\ttell\t%x\ttime\t%s",
208 afs.fs_postblformat == FS_42POSTBLFMT ?
209 ((struct ocg *)&acg)->cg_magic : acg.cg_magic,
210 i, ctime(&acg.cg_time));
211 printf("cgx\t%d\tncyl\t%d\tniblk\t%d\tndblk\t%d\n",
212 acg.cg_cgx, acg.cg_ncyl, acg.cg_niblk, acg.cg_ndblk);
213 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n",
214 acg.cg_cs.cs_nbfree, acg.cg_cs.cs_ndir,
215 acg.cg_cs.cs_nifree, acg.cg_cs.cs_nffree);
216 printf("rotor\t%d\tirotor\t%d\tfrotor\t%d\nfrsum",
217 acg.cg_rotor, acg.cg_irotor, acg.cg_frotor);
218 for (i = 1, j = 0; i < afs.fs_frag; i++) {
219 printf("\t%d", acg.cg_frsum[i]);
220 j += i * acg.cg_frsum[i];
221 }
222 printf("\nsum of frsum: %d\niused:\t", j);
223 pbits(cg_inosused(&acg), afs.fs_ipg);
224 printf("free:\t");
225 pbits(cg_blksfree(&acg), afs.fs_fpg);
226 printf("b:\n");
227 for (i = 0; i < afs.fs_cpg; i++) {
228 if (cg_blktot(&acg)[i] == 0)
229 continue;
230 printf(" c%d:\t(%d)\t", i, cg_blktot(&acg)[i]);
231 for (j = 0; j < afs.fs_nrpos; j++) {
232 if (afs.fs_cpc > 0 &&
233 fs_postbl(&afs, i % afs.fs_cpc)[j] == -1)
234 continue;
235 printf(" %d", cg_blks(&afs, &acg, i)[j]);
236 }
237 printf("\n");
238 }
239 };
240
pbits(cp,max)241 pbits(cp, max)
242 register char *cp;
243 int max;
244 {
245 register int i;
246 int count = 0, j;
247
248 for (i = 0; i < max; i++)
249 if (isset(cp, i)) {
250 if (count)
251 printf(",%s", count % 6 ? " " : "\n\t");
252 count++;
253 printf("%d", i);
254 j = i;
255 while ((i+1)<max && isset(cp, i+1))
256 i++;
257 if (i != j)
258 printf("-%d", i);
259 }
260 printf("\n");
261 }
262