1 /*
2 * Copyright (c) 1983, 1992, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * %sccs.include.redist.c%
6 */
7
8 #ifndef lint
9 static char copyright[] =
10 "@(#) Copyright (c) 1983, 1992, 1993\n\
11 The Regents of the University of California. All rights reserved.\n";
12 #endif /* not lint */
13
14 #ifndef lint
15 static char sccsid[] = "@(#)dumpfs.c 8.5 (Berkeley) 04/29/95";
16 #endif /* not lint */
17
18 #include <sys/param.h>
19 #include <sys/time.h>
20
21 #include <ufs/ufs/dinode.h>
22 #include <ufs/ffs/fs.h>
23
24 #include <err.h>
25 #include <errno.h>
26 #include <fcntl.h>
27 #include <fstab.h>
28 #include <stdio.h>
29 #include <stdlib.h>
30 #include <string.h>
31 #include <unistd.h>
32
33 union {
34 struct fs fs;
35 char pad[MAXBSIZE];
36 } fsun;
37 #define afs fsun.fs
38
39 union {
40 struct cg cg;
41 char pad[MAXBSIZE];
42 } cgun;
43 #define acg cgun.cg
44
45 long dev_bsize = 1;
46
47 int dumpfs __P((char *));
48 int dumpcg __P((char *, int, int));
49 void pbits __P((void *, int));
50 void usage __P((void));
51
52 int
main(argc,argv)53 main(argc, argv)
54 int argc;
55 char *argv[];
56 {
57 register struct fstab *fs;
58 int ch, eval;
59
60 while ((ch = getopt(argc, argv, "")) != -1)
61 switch(ch) {
62 case '?':
63 default:
64 usage();
65 }
66 argc -= optind;
67 argv += optind;
68
69 if (argc < 1)
70 usage();
71
72 for (eval = 0; *argv; ++argv)
73 if ((fs = getfsfile(*argv)) == NULL)
74 eval |= dumpfs(*argv);
75 else
76 eval |= dumpfs(fs->fs_spec);
77 exit(eval);
78 }
79
80 int
dumpfs(name)81 dumpfs(name)
82 char *name;
83 {
84 int fd, c, i, j, k, size;
85
86 if ((fd = open(name, O_RDONLY, 0)) < 0)
87 goto err;
88 if (lseek(fd, (off_t)SBOFF, SEEK_SET) == (off_t)-1)
89 goto err;
90 if (read(fd, &afs, SBSIZE) != SBSIZE)
91 goto err;
92
93 if (afs.fs_magic != FS_MAGIC) {
94 warnx("%s: superblock has bad magic number, skipped", name);
95 (void)close(fd);
96 return (1);
97 }
98
99 if (afs.fs_postblformat == FS_42POSTBLFMT)
100 afs.fs_nrpos = 8;
101 dev_bsize = afs.fs_fsize / fsbtodb(&afs, 1);
102 printf("magic\t%x\ttime\t%s", afs.fs_magic,
103 ctime(&afs.fs_time));
104 printf("cylgrp\t%s\tinodes\t%s\n",
105 afs.fs_postblformat == FS_42POSTBLFMT ? "static" : "dynamic",
106 afs.fs_inodefmt < FS_44INODEFMT ? "4.2/4.3BSD" : "4.4BSD");
107 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n",
108 afs.fs_cstotal.cs_nbfree, afs.fs_cstotal.cs_ndir,
109 afs.fs_cstotal.cs_nifree, afs.fs_cstotal.cs_nffree);
110 printf("ncg\t%d\tncyl\t%d\tsize\t%d\tblocks\t%d\n",
111 afs.fs_ncg, afs.fs_ncyl, afs.fs_size, afs.fs_dsize);
112 printf("bsize\t%d\tshift\t%d\tmask\t0x%08x\n",
113 afs.fs_bsize, afs.fs_bshift, afs.fs_bmask);
114 printf("fsize\t%d\tshift\t%d\tmask\t0x%08x\n",
115 afs.fs_fsize, afs.fs_fshift, afs.fs_fmask);
116 printf("frag\t%d\tshift\t%d\tfsbtodb\t%d\n",
117 afs.fs_frag, afs.fs_fragshift, afs.fs_fsbtodb);
118 printf("cpg\t%d\tbpg\t%d\tfpg\t%d\tipg\t%d\n",
119 afs.fs_cpg, afs.fs_fpg / afs.fs_frag, afs.fs_fpg, afs.fs_ipg);
120 printf("minfree\t%d%%\toptim\t%s\tmaxcontig %d\tmaxbpg\t%d\n",
121 afs.fs_minfree, afs.fs_optim == FS_OPTSPACE ? "space" : "time",
122 afs.fs_maxcontig, afs.fs_maxbpg);
123 printf("rotdelay %dms\theadswitch %dus\ttrackseek %dus\trps\t%d\n",
124 afs.fs_rotdelay, afs.fs_headswitch, afs.fs_trkseek, afs.fs_rps);
125 printf("ntrak\t%d\tnsect\t%d\tnpsect\t%d\tspc\t%d\n",
126 afs.fs_ntrak, afs.fs_nsect, afs.fs_npsect, afs.fs_spc);
127 printf("symlinklen %d\ttrackskew %d\tinterleave %d\tcontigsumsize %d\n",
128 afs.fs_maxsymlinklen, afs.fs_trackskew, afs.fs_interleave,
129 afs.fs_contigsumsize);
130 printf("nindir\t%d\tinopb\t%d\tnspf\t%d\n",
131 afs.fs_nindir, afs.fs_inopb, afs.fs_nspf);
132 printf("sblkno\t%d\tcblkno\t%d\tiblkno\t%d\tdblkno\t%d\n",
133 afs.fs_sblkno, afs.fs_cblkno, afs.fs_iblkno, afs.fs_dblkno);
134 printf("sbsize\t%d\tcgsize\t%d\tcgoffset %d\tcgmask\t0x%08x\n",
135 afs.fs_sbsize, afs.fs_cgsize, afs.fs_cgoffset, afs.fs_cgmask);
136 printf("csaddr\t%d\tcssize\t%d\tshift\t%d\tmask\t0x%08x\n",
137 afs.fs_csaddr, afs.fs_cssize, afs.fs_csshift, afs.fs_csmask);
138 printf("cgrotor\t%d\tfmod\t%d\tronly\t%d\tclean\t%d\n",
139 afs.fs_cgrotor, afs.fs_fmod, afs.fs_ronly, afs.fs_clean);
140 if (afs.fs_cpc != 0)
141 printf("blocks available in each of %d rotational positions",
142 afs.fs_nrpos);
143 else
144 printf("(no rotational position table)\n");
145 for (c = 0; c < afs.fs_cpc; c++) {
146 printf("\ncylinder number %d:", c);
147 for (i = 0; i < afs.fs_nrpos; i++) {
148 if (fs_postbl(&afs, c)[i] == -1)
149 continue;
150 printf("\n position %d:\t", i);
151 for (j = fs_postbl(&afs, c)[i], k = 1; ;
152 j += fs_rotbl(&afs)[j], k++) {
153 printf("%5d", j);
154 if (k % 12 == 0)
155 printf("\n\t\t");
156 if (fs_rotbl(&afs)[j] == 0)
157 break;
158 }
159 }
160 }
161 printf("\ncs[].cs_(nbfree,ndir,nifree,nffree):\n\t");
162 for (i = 0, j = 0; i < afs.fs_cssize; i += afs.fs_bsize, j++) {
163 size = afs.fs_cssize - i < afs.fs_bsize ?
164 afs.fs_cssize - i : afs.fs_bsize;
165 afs.fs_csp[j] = calloc(1, size);
166 if (lseek(fd,
167 (off_t)(fsbtodb(&afs, (afs.fs_csaddr + j * afs.fs_frag)) *
168 dev_bsize), SEEK_SET) == (off_t)-1)
169 goto err;
170 if (read(fd, afs.fs_csp[j], size) != size)
171 goto err;
172 }
173 for (i = 0; i < afs.fs_ncg; i++) {
174 struct csum *cs = &afs.fs_cs(&afs, i);
175 if (i && i % 4 == 0)
176 printf("\n\t");
177 printf("(%d,%d,%d,%d) ",
178 cs->cs_nbfree, cs->cs_ndir, cs->cs_nifree, cs->cs_nffree);
179 }
180 printf("\n");
181 if (afs.fs_ncyl % afs.fs_cpg) {
182 printf("cylinders in last group %d\n",
183 i = afs.fs_ncyl % afs.fs_cpg);
184 printf("blocks in last group %d\n",
185 i * afs.fs_spc / NSPB(&afs));
186 }
187 printf("\n");
188 for (i = 0; i < afs.fs_ncg; i++)
189 if (dumpcg(name, fd, i))
190 goto err;
191 (void)close(fd);
192 return (0);
193
194 err: if (fd != -1)
195 (void)close(fd);
196 warn("%s", name);
197 return (1);
198 };
199
200 int
dumpcg(name,fd,c)201 dumpcg(name, fd, c)
202 char *name;
203 int fd, c;
204 {
205 off_t cur;
206 int i, j;
207
208 printf("\ncg %d:\n", c);
209 if ((cur = lseek(fd, (off_t)(fsbtodb(&afs, cgtod(&afs, c)) * dev_bsize),
210 SEEK_SET)) == (off_t)-1)
211 return (1);
212 if (read(fd, &acg, afs.fs_bsize) != afs.fs_bsize) {
213 warnx("%s: error reading cg", name);
214 return (1);
215 }
216 printf("magic\t%x\ttell\t%qx\ttime\t%s",
217 afs.fs_postblformat == FS_42POSTBLFMT ?
218 ((struct ocg *)&acg)->cg_magic : acg.cg_magic,
219 cur, ctime(&acg.cg_time));
220 printf("cgx\t%d\tncyl\t%d\tniblk\t%d\tndblk\t%d\n",
221 acg.cg_cgx, acg.cg_ncyl, acg.cg_niblk, acg.cg_ndblk);
222 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n",
223 acg.cg_cs.cs_nbfree, acg.cg_cs.cs_ndir,
224 acg.cg_cs.cs_nifree, acg.cg_cs.cs_nffree);
225 printf("rotor\t%d\tirotor\t%d\tfrotor\t%d\nfrsum",
226 acg.cg_rotor, acg.cg_irotor, acg.cg_frotor);
227 for (i = 1, j = 0; i < afs.fs_frag; i++) {
228 printf("\t%d", acg.cg_frsum[i]);
229 j += i * acg.cg_frsum[i];
230 }
231 printf("\nsum of frsum: %d", j);
232 if (afs.fs_contigsumsize > 0) {
233 for (i = 1; i < afs.fs_contigsumsize; i++) {
234 if ((i - 1) % 8 == 0)
235 printf("\nclusters %d-%d:", i,
236 afs.fs_contigsumsize - 1 < i + 7 ?
237 afs.fs_contigsumsize - 1 : i + 7);
238 printf("\t%d", cg_clustersum(&acg)[i]);
239 }
240 printf("\nclusters size %d and over: %d\n",
241 afs.fs_contigsumsize,
242 cg_clustersum(&acg)[afs.fs_contigsumsize]);
243 printf("clusters free:\t");
244 pbits(cg_clustersfree(&acg), acg.cg_nclusterblks);
245 } else
246 printf("\n");
247 printf("iused:\t");
248 pbits(cg_inosused(&acg), afs.fs_ipg);
249 printf("free:\t");
250 pbits(cg_blksfree(&acg), afs.fs_fpg);
251 printf("b:\n");
252 for (i = 0; i < afs.fs_cpg; i++) {
253 if (cg_blktot(&acg)[i] == 0)
254 continue;
255 printf(" c%d:\t(%d)\t", i, cg_blktot(&acg)[i]);
256 for (j = 0; j < afs.fs_nrpos; j++) {
257 if (afs.fs_cpc > 0 &&
258 fs_postbl(&afs, i % afs.fs_cpc)[j] == -1)
259 continue;
260 printf(" %d", cg_blks(&afs, &acg, i)[j]);
261 }
262 printf("\n");
263 }
264 return (0);
265 };
266
267 void
pbits(vp,max)268 pbits(vp, max)
269 register void *vp;
270 int max;
271 {
272 register int i;
273 register char *p;
274 int count, j;
275
276 for (count = i = 0, p = vp; i < max; i++)
277 if (isset(p, i)) {
278 if (count)
279 printf(",%s", count % 6 ? " " : "\n\t");
280 count++;
281 printf("%d", i);
282 j = i;
283 while ((i+1)<max && isset(p, i+1))
284 i++;
285 if (i != j)
286 printf("-%d", i);
287 }
288 printf("\n");
289 }
290
291 void
usage()292 usage()
293 {
294 (void)fprintf(stderr, "usage: dumpfs filesys | device\n");
295 exit(1);
296 }
297