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