1/*
2 * Copyright (c) 2002 Networks Associates Technology, Inc.
3 * All rights reserved.
4 *
5 * This software was developed for the FreeBSD Project by Marshall
6 * Kirk McKusick and Network Associates Laboratories, the Security
7 * Research Division of Network Associates, Inc. under DARPA/SPAWAR
8 * contract N66001-01-C-8035 ("CBOSS"), as part of the DARPA CHATS
9 * research program
10 *
11 * Copyright (c) 1982, 1989, 1993
12 * The Regents of the University of California. All rights reserved.
13 * (c) UNIX System Laboratories, Inc.
14 * Copyright (c) 1983, 1992, 1993
15 * The Regents of the University of California. All rights reserved.
16 *
17 * Redistribution and use in source and binary forms, with or without
18 * modification, are permitted provided that the following conditions
19 * are met:
20 * 1. Redistributions of source code must retain the above copyright
21 * notice, this list of conditions and the following disclaimer.
22 * 2. Redistributions in binary form must reproduce the above copyright
23 * notice, this list of conditions and the following disclaimer in the
24 * documentation and/or other materials provided with the distribution.
25 * 3. All advertising materials mentioning features or use of this software
26 * must display the following acknowledgement:
27 * This product includes software developed by the University of
28 * California, Berkeley and its contributors.
29 * 4. Neither the name of the University nor the names of its contributors
30 * may be used to endorse or promote products derived from this software
31 * without specific prior written permission.
32 *
33 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
34 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
35 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
36 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
37 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
38 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
39 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
40 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
41 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
42 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
43 * SUCH DAMAGE.
44 */
45
46#ifndef lint
47static const char copyright[] =
48"@(#) Copyright (c) 1983, 1992, 1993\n\
49 The Regents of the University of California. All rights reserved.\n";
50#endif /* not lint */
51
52#ifndef lint
53#if 0
54static char sccsid[] = "@(#)dumpfs.c 8.5 (Berkeley) 4/29/95";
55#endif
56static const char rcsid[] =
57 "$FreeBSD: head/sbin/dumpfs/dumpfs.c 109525 2003-01-19 10:25:11Z jmallett $";
58#endif /* not lint */
59
60#include <sys/param.h>
61#include <sys/time.h>
62#include <sys/disklabel.h>
63
64#include <ufs/ufs/dinode.h>
65#include <ufs/ffs/fs.h>
66
67#include <err.h>
68#include <errno.h>
69#include <fcntl.h>
70#include <fstab.h>
71#include <libufs.h>
72#include <stdint.h>
73#include <stdio.h>
74#include <stdlib.h>
75#include <unistd.h>
76
77#define afs disk.d_fs
78#define acg disk.d_cg
79
80struct uufsd disk;
81
82int dumpfs(const char *);
83int dumpcg(void);
84int marshal(const char *);
85void pbits(void *, int);
86void ufserr(const char *);
87void usage(void) __dead2;
88
89int
90main(int argc, char *argv[])
91{
92 const char *name;
93 int ch, domarshal, eval;
94
95 domarshal = eval = 0;
96
97 while ((ch = getopt(argc, argv, "m")) != -1) {
98 switch (ch) {
99 case 'm':
100 domarshal = 1;
101 break;
102 case '?':
103 default:
104 usage();
105 }
106 }
107 argc -= optind;
108 argv += optind;
109
110 if (argc < 1)
111 usage();
112
113 while ((name = *argv++) != NULL) {
114 if (ufs_disk_fillout(&disk, name) == -1) {
115 ufserr(name);
116 eval |= 1;
117 continue;
118 }
119 if (domarshal)
120 eval |= marshal(name);
121 else
122 eval |= dumpfs(name);
123 ufs_disk_close(&disk);
124 }
125 exit(eval);
126}
127
128int
129dumpfs(const char *name)
130{
131 time_t time;
132 int64_t fssize;
133 int i;
134
135 switch (disk.d_ufs) {
136 case 2:
137 fssize = afs.fs_size;
138 time = afs.fs_time;
139 printf("magic\t%x (UFS2)\ttime\t%s",
140 afs.fs_magic, ctime(&time));
141 printf("superblock location\t%qd\tid\t[ %x %x ]\n",
142 afs.fs_sblockloc, afs.fs_id[0], afs.fs_id[1]);
143 printf("ncg\t%d\tsize\t%qd\tblocks\t%d\n",
144 afs.fs_ncg, fssize, afs.fs_dsize);
145 break;
146 case 1:
147 fssize = afs.fs_old_size;
148 time = afs.fs_old_time;
149 printf("magic\t%x (UFS1)\ttime\t%s",
150 afs.fs_magic, ctime(&time));
151 printf("id\t[ %x %x ]\n", afs.fs_id[0], afs.fs_id[1]);
152 printf("ncg\t%d\tsize\t%qd\tblocks\t%d\n",
153 afs.fs_ncg, fssize, afs.fs_dsize);
154 break;
155 default:
156 break;
157 }
158 printf("bsize\t%d\tshift\t%d\tmask\t0x%08x\n",
159 afs.fs_bsize, afs.fs_bshift, afs.fs_bmask);
160 printf("fsize\t%d\tshift\t%d\tmask\t0x%08x\n",
161 afs.fs_fsize, afs.fs_fshift, afs.fs_fmask);
162 printf("frag\t%d\tshift\t%d\tfsbtodb\t%d\n",
163 afs.fs_frag, afs.fs_fragshift, afs.fs_fsbtodb);
164 printf("minfree\t%d%%\toptim\t%s\tsymlinklen %d\n",
165 afs.fs_minfree, afs.fs_optim == FS_OPTSPACE ? "space" : "time",
166 afs.fs_maxsymlinklen);
167 switch (disk.d_ufs) {
168 case 2:
169 printf("%s %d\tmaxbpg\t%d\tmaxcontig %d\tcontigsumsize %d\n",
170 "maxbsize", afs.fs_maxbsize, afs.fs_maxbpg,
171 afs.fs_maxcontig, afs.fs_contigsumsize);
172 printf("nbfree\t%qd\tndir\t%qd\tnifree\t%qd\tnffree\t%qd\n",
173 afs.fs_cstotal.cs_nbfree, afs.fs_cstotal.cs_ndir,
174 afs.fs_cstotal.cs_nifree, afs.fs_cstotal.cs_nffree);
175 printf("bpg\t%d\tfpg\t%d\tipg\t%d\n",
176 afs.fs_fpg / afs.fs_frag, afs.fs_fpg, afs.fs_ipg);
177 printf("nindir\t%d\tinopb\t%d\tmaxfilesize\t%qu\n",
178 afs.fs_nindir, afs.fs_inopb, afs.fs_maxfilesize);
179 printf("sbsize\t%d\tcgsize\t%d\tcsaddr\t%d\tcssize\t%d\n",
180 afs.fs_sbsize, afs.fs_cgsize, afs.fs_csaddr, afs.fs_cssize);
181 break;
182 case 1:
183 printf("maxbpg\t%d\tmaxcontig %d\tcontigsumsize %d\n",
184 afs.fs_maxbpg, afs.fs_maxcontig, afs.fs_contigsumsize);
185 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n",
186 afs.fs_old_cstotal.cs_nbfree, afs.fs_old_cstotal.cs_ndir,
187 afs.fs_old_cstotal.cs_nifree, afs.fs_old_cstotal.cs_nffree);
188 printf("cpg\t%d\tbpg\t%d\tfpg\t%d\tipg\t%d\n",
189 afs.fs_old_cpg, afs.fs_fpg / afs.fs_frag, afs.fs_fpg,
190 afs.fs_ipg);
191 printf("nindir\t%d\tinopb\t%d\tnspf\t%d\tmaxfilesize\t%qu\n",
192 afs.fs_nindir, afs.fs_inopb, afs.fs_old_nspf,
193 afs.fs_maxfilesize);
194 printf("sbsize\t%d\tcgsize\t%d\tcgoffset %d\tcgmask\t0x%08x\n",
195 afs.fs_sbsize, afs.fs_cgsize, afs.fs_old_cgoffset,
196 afs.fs_old_cgmask);
197 printf("csaddr\t%d\tcssize\t%d\n",
198 afs.fs_old_csaddr, afs.fs_cssize);
199 printf("rotdelay %dms\trps\t%d\ttrackskew %d\tinterleave %d\n",
200 afs.fs_old_rotdelay, afs.fs_old_rps, afs.fs_old_trackskew,
201 afs.fs_old_interleave);
202 printf("nsect\t%d\tnpsect\t%d\tspc\t%d\n",
203 afs.fs_old_nsect, afs.fs_old_npsect, afs.fs_old_spc);
204 break;
205 default:
206 break;
207 }
208 printf("sblkno\t%d\tcblkno\t%d\tiblkno\t%d\tdblkno\t%d\n",
209 afs.fs_sblkno, afs.fs_cblkno, afs.fs_iblkno, afs.fs_dblkno);
210 printf("cgrotor\t%d\tfmod\t%d\tronly\t%d\tclean\t%d\n",
211 afs.fs_cgrotor, afs.fs_fmod, afs.fs_ronly, afs.fs_clean);
212 printf("flags\t");
213 if (afs.fs_flags == 0)
214 printf("none");
215 if (afs.fs_flags & FS_UNCLEAN)
216 printf("unclean ");
217 if (afs.fs_flags & FS_DOSOFTDEP)
218 printf("soft-updates ");
219 if (afs.fs_flags & FS_NEEDSFSCK)
220 printf("needs fsck run ");
221 if (afs.fs_flags & FS_INDEXDIRS)
222 printf("indexed directories ");
223 if ((afs.fs_flags &
224 ~(FS_UNCLEAN | FS_DOSOFTDEP | FS_NEEDSFSCK | FS_INDEXDIRS)) != 0)
225 printf("unknown flags (%#x)", afs.fs_flags &
226 ~(FS_UNCLEAN | FS_DOSOFTDEP |
227 FS_NEEDSFSCK | FS_INDEXDIRS));
228 putchar('\n');
229 printf("\ncs[].cs_(nbfree,ndir,nifree,nffree):\n\t");
230 afs.fs_csp = calloc(1, afs.fs_cssize);
231 if (bread(&disk, fsbtodb(&afs, afs.fs_csaddr), afs.fs_csp, afs.fs_cssize) == -1)
232 goto err;
233 for (i = 0; i < afs.fs_ncg; i++) {
234 struct csum *cs = &afs.fs_cs(&afs, i);
235 if (i && i % 4 == 0)
236 printf("\n\t");
237 printf("(%d,%d,%d,%d) ",
238 cs->cs_nbfree, cs->cs_ndir, cs->cs_nifree, cs->cs_nffree);
239 }
240 printf("\n");
241 if (fssize % afs.fs_fpg) {
242 if (disk.d_ufs == 1)
243 printf("cylinders in last group %d\n",
244 howmany(afs.fs_old_size % afs.fs_fpg,
245 afs.fs_old_spc / afs.fs_old_nspf));
246 printf("blocks in last group %d\n\n",
247 (fssize % afs.fs_fpg) / afs.fs_frag);
248 }
249 while ((i = cgread(&disk)) != 0) {
250 if (i == -1 || dumpcg())
251 goto err;
252 }
253 return (0);
254
255err: ufserr(name);
256 return (1);
257}
258
259int
260dumpcg(void)
261{
262 time_t time;
263 off_t cur;
264 int i, j;
265
266 printf("\ncg %d:\n", disk.d_lcg);
267 cur = fsbtodb(&afs, cgtod(&afs, disk.d_lcg)) * disk.d_bsize;
268 switch (disk.d_ufs) {
269 case 2:
270 time = acg.cg_time;
271 printf("magic\t%x\ttell\t%qx\ttime\t%s",
272 acg.cg_magic, cur, ctime(&time));
273 printf("cgx\t%d\tndblk\t%d\tniblk\t%d\tinitiblk %d\n",
274 acg.cg_cgx, acg.cg_ndblk, acg.cg_niblk, acg.cg_initediblk);
275 break;
276 case 1:
277 time = acg.cg_old_time;
278 printf("magic\t%x\ttell\t%qx\ttime\t%s",
279 acg.cg_magic, cur, ctime(&time));
280 printf("cgx\t%d\tncyl\t%d\tniblk\t%d\tndblk\t%d\n",
281 acg.cg_cgx, acg.cg_old_ncyl, acg.cg_old_niblk,
282 acg.cg_ndblk);
283 break;
284 default:
285 break;
286 }
287 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n",
288 acg.cg_cs.cs_nbfree, acg.cg_cs.cs_ndir,
289 acg.cg_cs.cs_nifree, acg.cg_cs.cs_nffree);
290 printf("rotor\t%d\tirotor\t%d\tfrotor\t%d\nfrsum",
291 acg.cg_rotor, acg.cg_irotor, acg.cg_frotor);
292 for (i = 1, j = 0; i < afs.fs_frag; i++) {
293 printf("\t%d", acg.cg_frsum[i]);
294 j += i * acg.cg_frsum[i];
295 }
296 printf("\nsum of frsum: %d", j);
297 if (afs.fs_contigsumsize > 0) {
298 for (i = 1; i < afs.fs_contigsumsize; i++) {
299 if ((i - 1) % 8 == 0)
300 printf("\nclusters %d-%d:", i,
301 afs.fs_contigsumsize - 1 < i + 7 ?
302 afs.fs_contigsumsize - 1 : i + 7);
303 printf("\t%d", cg_clustersum(&acg)[i]);
304 }
305 printf("\nclusters size %d and over: %d\n",
306 afs.fs_contigsumsize,
307 cg_clustersum(&acg)[afs.fs_contigsumsize]);
308 printf("clusters free:\t");
309 pbits(cg_clustersfree(&acg), acg.cg_nclusterblks);
310 } else
311 printf("\n");
312 printf("inodes used:\t");
313 pbits(cg_inosused(&acg), afs.fs_ipg);
314 printf("blks free:\t");
315 pbits(cg_blksfree(&acg), afs.fs_fpg);
316 return (0);
317}
318
319int
320marshal(const char *name)
321{
322 struct fs *fs;
323
324 fs = &disk.d_fs;
325
326 printf("# newfs command for %s (%s)\n", name, disk.d_name);
327 printf("newfs ");
328 printf("-O %d ", disk.d_ufs);
329 if (fs->fs_flags & FS_DOSOFTDEP)
330 printf("-U ");
331 printf("-a %d ", fs->fs_maxcontig);
332 printf("-b %d ", fs->fs_bsize);
333 /* -c is dumb */
334 printf("-d %d ", fs->fs_maxbsize);
335 printf("-e %d ", fs->fs_maxbpg);
336 printf("-f %d ", fs->fs_fsize);
337 printf("-g %d ", fs->fs_avgfilesize);
338 printf("-h %d ", fs->fs_avgfpdir);
339 /* -i is dumb */
340 /* -j..l unimplemented */
341 printf("-m %d ", fs->fs_minfree);
342 /* -n unimplemented */
343 printf("-o ");
344 switch (fs->fs_optim) {
345 case FS_OPTSPACE:
346 printf("space ");
347 break;
348 case FS_OPTTIME:
349 printf("time ");
350 break;
351 default:
352 printf("unknown ");
353 break;
354 }
355 /* -p..r unimplemented */
356 printf("-s %jd ", (intmax_t)fs->fs_size);
357 printf("%s ", disk.d_name);
358 printf("\n");
359
360 return 0;
361}
362
363void
364pbits(void *vp, int max)
365{
366 int i;
367 char *p;
368 int count, j;
369
370 for (count = i = 0, p = vp; i < max; i++)
371 if (isset(p, i)) {
372 if (count)
373 printf(",%s", count % 6 ? " " : "\n\t");
374 count++;
375 printf("%d", i);
376 j = i;
377 while ((i+1)<max && isset(p, i+1))
378 i++;
379 if (i != j)
380 printf("-%d", i);
381 }
382 printf("\n");
383}
384
385void
386ufserr(const char *name)
387{
388 if (disk.d_error != NULL)
389 warnx("%s: %s", name, disk.d_error);
390 else if (errno)
391 warn("%s", name);
392}
393
394void
395usage(void)
396{
397 (void)fprintf(stderr, "usage: dumpfs [-m] filesys | device\n");
398 exit(1);
399}
2 * Copyright (c) 2002 Networks Associates Technology, Inc.
3 * All rights reserved.
4 *
5 * This software was developed for the FreeBSD Project by Marshall
6 * Kirk McKusick and Network Associates Laboratories, the Security
7 * Research Division of Network Associates, Inc. under DARPA/SPAWAR
8 * contract N66001-01-C-8035 ("CBOSS"), as part of the DARPA CHATS
9 * research program
10 *
11 * Copyright (c) 1982, 1989, 1993
12 * The Regents of the University of California. All rights reserved.
13 * (c) UNIX System Laboratories, Inc.
14 * Copyright (c) 1983, 1992, 1993
15 * The Regents of the University of California. All rights reserved.
16 *
17 * Redistribution and use in source and binary forms, with or without
18 * modification, are permitted provided that the following conditions
19 * are met:
20 * 1. Redistributions of source code must retain the above copyright
21 * notice, this list of conditions and the following disclaimer.
22 * 2. Redistributions in binary form must reproduce the above copyright
23 * notice, this list of conditions and the following disclaimer in the
24 * documentation and/or other materials provided with the distribution.
25 * 3. All advertising materials mentioning features or use of this software
26 * must display the following acknowledgement:
27 * This product includes software developed by the University of
28 * California, Berkeley and its contributors.
29 * 4. Neither the name of the University nor the names of its contributors
30 * may be used to endorse or promote products derived from this software
31 * without specific prior written permission.
32 *
33 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
34 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
35 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
36 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
37 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
38 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
39 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
40 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
41 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
42 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
43 * SUCH DAMAGE.
44 */
45
46#ifndef lint
47static const char copyright[] =
48"@(#) Copyright (c) 1983, 1992, 1993\n\
49 The Regents of the University of California. All rights reserved.\n";
50#endif /* not lint */
51
52#ifndef lint
53#if 0
54static char sccsid[] = "@(#)dumpfs.c 8.5 (Berkeley) 4/29/95";
55#endif
56static const char rcsid[] =
57 "$FreeBSD: head/sbin/dumpfs/dumpfs.c 109525 2003-01-19 10:25:11Z jmallett $";
58#endif /* not lint */
59
60#include <sys/param.h>
61#include <sys/time.h>
62#include <sys/disklabel.h>
63
64#include <ufs/ufs/dinode.h>
65#include <ufs/ffs/fs.h>
66
67#include <err.h>
68#include <errno.h>
69#include <fcntl.h>
70#include <fstab.h>
71#include <libufs.h>
72#include <stdint.h>
73#include <stdio.h>
74#include <stdlib.h>
75#include <unistd.h>
76
77#define afs disk.d_fs
78#define acg disk.d_cg
79
80struct uufsd disk;
81
82int dumpfs(const char *);
83int dumpcg(void);
84int marshal(const char *);
85void pbits(void *, int);
86void ufserr(const char *);
87void usage(void) __dead2;
88
89int
90main(int argc, char *argv[])
91{
92 const char *name;
93 int ch, domarshal, eval;
94
95 domarshal = eval = 0;
96
97 while ((ch = getopt(argc, argv, "m")) != -1) {
98 switch (ch) {
99 case 'm':
100 domarshal = 1;
101 break;
102 case '?':
103 default:
104 usage();
105 }
106 }
107 argc -= optind;
108 argv += optind;
109
110 if (argc < 1)
111 usage();
112
113 while ((name = *argv++) != NULL) {
114 if (ufs_disk_fillout(&disk, name) == -1) {
115 ufserr(name);
116 eval |= 1;
117 continue;
118 }
119 if (domarshal)
120 eval |= marshal(name);
121 else
122 eval |= dumpfs(name);
123 ufs_disk_close(&disk);
124 }
125 exit(eval);
126}
127
128int
129dumpfs(const char *name)
130{
131 time_t time;
132 int64_t fssize;
133 int i;
134
135 switch (disk.d_ufs) {
136 case 2:
137 fssize = afs.fs_size;
138 time = afs.fs_time;
139 printf("magic\t%x (UFS2)\ttime\t%s",
140 afs.fs_magic, ctime(&time));
141 printf("superblock location\t%qd\tid\t[ %x %x ]\n",
142 afs.fs_sblockloc, afs.fs_id[0], afs.fs_id[1]);
143 printf("ncg\t%d\tsize\t%qd\tblocks\t%d\n",
144 afs.fs_ncg, fssize, afs.fs_dsize);
145 break;
146 case 1:
147 fssize = afs.fs_old_size;
148 time = afs.fs_old_time;
149 printf("magic\t%x (UFS1)\ttime\t%s",
150 afs.fs_magic, ctime(&time));
151 printf("id\t[ %x %x ]\n", afs.fs_id[0], afs.fs_id[1]);
152 printf("ncg\t%d\tsize\t%qd\tblocks\t%d\n",
153 afs.fs_ncg, fssize, afs.fs_dsize);
154 break;
155 default:
156 break;
157 }
158 printf("bsize\t%d\tshift\t%d\tmask\t0x%08x\n",
159 afs.fs_bsize, afs.fs_bshift, afs.fs_bmask);
160 printf("fsize\t%d\tshift\t%d\tmask\t0x%08x\n",
161 afs.fs_fsize, afs.fs_fshift, afs.fs_fmask);
162 printf("frag\t%d\tshift\t%d\tfsbtodb\t%d\n",
163 afs.fs_frag, afs.fs_fragshift, afs.fs_fsbtodb);
164 printf("minfree\t%d%%\toptim\t%s\tsymlinklen %d\n",
165 afs.fs_minfree, afs.fs_optim == FS_OPTSPACE ? "space" : "time",
166 afs.fs_maxsymlinklen);
167 switch (disk.d_ufs) {
168 case 2:
169 printf("%s %d\tmaxbpg\t%d\tmaxcontig %d\tcontigsumsize %d\n",
170 "maxbsize", afs.fs_maxbsize, afs.fs_maxbpg,
171 afs.fs_maxcontig, afs.fs_contigsumsize);
172 printf("nbfree\t%qd\tndir\t%qd\tnifree\t%qd\tnffree\t%qd\n",
173 afs.fs_cstotal.cs_nbfree, afs.fs_cstotal.cs_ndir,
174 afs.fs_cstotal.cs_nifree, afs.fs_cstotal.cs_nffree);
175 printf("bpg\t%d\tfpg\t%d\tipg\t%d\n",
176 afs.fs_fpg / afs.fs_frag, afs.fs_fpg, afs.fs_ipg);
177 printf("nindir\t%d\tinopb\t%d\tmaxfilesize\t%qu\n",
178 afs.fs_nindir, afs.fs_inopb, afs.fs_maxfilesize);
179 printf("sbsize\t%d\tcgsize\t%d\tcsaddr\t%d\tcssize\t%d\n",
180 afs.fs_sbsize, afs.fs_cgsize, afs.fs_csaddr, afs.fs_cssize);
181 break;
182 case 1:
183 printf("maxbpg\t%d\tmaxcontig %d\tcontigsumsize %d\n",
184 afs.fs_maxbpg, afs.fs_maxcontig, afs.fs_contigsumsize);
185 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n",
186 afs.fs_old_cstotal.cs_nbfree, afs.fs_old_cstotal.cs_ndir,
187 afs.fs_old_cstotal.cs_nifree, afs.fs_old_cstotal.cs_nffree);
188 printf("cpg\t%d\tbpg\t%d\tfpg\t%d\tipg\t%d\n",
189 afs.fs_old_cpg, afs.fs_fpg / afs.fs_frag, afs.fs_fpg,
190 afs.fs_ipg);
191 printf("nindir\t%d\tinopb\t%d\tnspf\t%d\tmaxfilesize\t%qu\n",
192 afs.fs_nindir, afs.fs_inopb, afs.fs_old_nspf,
193 afs.fs_maxfilesize);
194 printf("sbsize\t%d\tcgsize\t%d\tcgoffset %d\tcgmask\t0x%08x\n",
195 afs.fs_sbsize, afs.fs_cgsize, afs.fs_old_cgoffset,
196 afs.fs_old_cgmask);
197 printf("csaddr\t%d\tcssize\t%d\n",
198 afs.fs_old_csaddr, afs.fs_cssize);
199 printf("rotdelay %dms\trps\t%d\ttrackskew %d\tinterleave %d\n",
200 afs.fs_old_rotdelay, afs.fs_old_rps, afs.fs_old_trackskew,
201 afs.fs_old_interleave);
202 printf("nsect\t%d\tnpsect\t%d\tspc\t%d\n",
203 afs.fs_old_nsect, afs.fs_old_npsect, afs.fs_old_spc);
204 break;
205 default:
206 break;
207 }
208 printf("sblkno\t%d\tcblkno\t%d\tiblkno\t%d\tdblkno\t%d\n",
209 afs.fs_sblkno, afs.fs_cblkno, afs.fs_iblkno, afs.fs_dblkno);
210 printf("cgrotor\t%d\tfmod\t%d\tronly\t%d\tclean\t%d\n",
211 afs.fs_cgrotor, afs.fs_fmod, afs.fs_ronly, afs.fs_clean);
212 printf("flags\t");
213 if (afs.fs_flags == 0)
214 printf("none");
215 if (afs.fs_flags & FS_UNCLEAN)
216 printf("unclean ");
217 if (afs.fs_flags & FS_DOSOFTDEP)
218 printf("soft-updates ");
219 if (afs.fs_flags & FS_NEEDSFSCK)
220 printf("needs fsck run ");
221 if (afs.fs_flags & FS_INDEXDIRS)
222 printf("indexed directories ");
223 if ((afs.fs_flags &
224 ~(FS_UNCLEAN | FS_DOSOFTDEP | FS_NEEDSFSCK | FS_INDEXDIRS)) != 0)
225 printf("unknown flags (%#x)", afs.fs_flags &
226 ~(FS_UNCLEAN | FS_DOSOFTDEP |
227 FS_NEEDSFSCK | FS_INDEXDIRS));
228 putchar('\n');
229 printf("\ncs[].cs_(nbfree,ndir,nifree,nffree):\n\t");
230 afs.fs_csp = calloc(1, afs.fs_cssize);
231 if (bread(&disk, fsbtodb(&afs, afs.fs_csaddr), afs.fs_csp, afs.fs_cssize) == -1)
232 goto err;
233 for (i = 0; i < afs.fs_ncg; i++) {
234 struct csum *cs = &afs.fs_cs(&afs, i);
235 if (i && i % 4 == 0)
236 printf("\n\t");
237 printf("(%d,%d,%d,%d) ",
238 cs->cs_nbfree, cs->cs_ndir, cs->cs_nifree, cs->cs_nffree);
239 }
240 printf("\n");
241 if (fssize % afs.fs_fpg) {
242 if (disk.d_ufs == 1)
243 printf("cylinders in last group %d\n",
244 howmany(afs.fs_old_size % afs.fs_fpg,
245 afs.fs_old_spc / afs.fs_old_nspf));
246 printf("blocks in last group %d\n\n",
247 (fssize % afs.fs_fpg) / afs.fs_frag);
248 }
249 while ((i = cgread(&disk)) != 0) {
250 if (i == -1 || dumpcg())
251 goto err;
252 }
253 return (0);
254
255err: ufserr(name);
256 return (1);
257}
258
259int
260dumpcg(void)
261{
262 time_t time;
263 off_t cur;
264 int i, j;
265
266 printf("\ncg %d:\n", disk.d_lcg);
267 cur = fsbtodb(&afs, cgtod(&afs, disk.d_lcg)) * disk.d_bsize;
268 switch (disk.d_ufs) {
269 case 2:
270 time = acg.cg_time;
271 printf("magic\t%x\ttell\t%qx\ttime\t%s",
272 acg.cg_magic, cur, ctime(&time));
273 printf("cgx\t%d\tndblk\t%d\tniblk\t%d\tinitiblk %d\n",
274 acg.cg_cgx, acg.cg_ndblk, acg.cg_niblk, acg.cg_initediblk);
275 break;
276 case 1:
277 time = acg.cg_old_time;
278 printf("magic\t%x\ttell\t%qx\ttime\t%s",
279 acg.cg_magic, cur, ctime(&time));
280 printf("cgx\t%d\tncyl\t%d\tniblk\t%d\tndblk\t%d\n",
281 acg.cg_cgx, acg.cg_old_ncyl, acg.cg_old_niblk,
282 acg.cg_ndblk);
283 break;
284 default:
285 break;
286 }
287 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n",
288 acg.cg_cs.cs_nbfree, acg.cg_cs.cs_ndir,
289 acg.cg_cs.cs_nifree, acg.cg_cs.cs_nffree);
290 printf("rotor\t%d\tirotor\t%d\tfrotor\t%d\nfrsum",
291 acg.cg_rotor, acg.cg_irotor, acg.cg_frotor);
292 for (i = 1, j = 0; i < afs.fs_frag; i++) {
293 printf("\t%d", acg.cg_frsum[i]);
294 j += i * acg.cg_frsum[i];
295 }
296 printf("\nsum of frsum: %d", j);
297 if (afs.fs_contigsumsize > 0) {
298 for (i = 1; i < afs.fs_contigsumsize; i++) {
299 if ((i - 1) % 8 == 0)
300 printf("\nclusters %d-%d:", i,
301 afs.fs_contigsumsize - 1 < i + 7 ?
302 afs.fs_contigsumsize - 1 : i + 7);
303 printf("\t%d", cg_clustersum(&acg)[i]);
304 }
305 printf("\nclusters size %d and over: %d\n",
306 afs.fs_contigsumsize,
307 cg_clustersum(&acg)[afs.fs_contigsumsize]);
308 printf("clusters free:\t");
309 pbits(cg_clustersfree(&acg), acg.cg_nclusterblks);
310 } else
311 printf("\n");
312 printf("inodes used:\t");
313 pbits(cg_inosused(&acg), afs.fs_ipg);
314 printf("blks free:\t");
315 pbits(cg_blksfree(&acg), afs.fs_fpg);
316 return (0);
317}
318
319int
320marshal(const char *name)
321{
322 struct fs *fs;
323
324 fs = &disk.d_fs;
325
326 printf("# newfs command for %s (%s)\n", name, disk.d_name);
327 printf("newfs ");
328 printf("-O %d ", disk.d_ufs);
329 if (fs->fs_flags & FS_DOSOFTDEP)
330 printf("-U ");
331 printf("-a %d ", fs->fs_maxcontig);
332 printf("-b %d ", fs->fs_bsize);
333 /* -c is dumb */
334 printf("-d %d ", fs->fs_maxbsize);
335 printf("-e %d ", fs->fs_maxbpg);
336 printf("-f %d ", fs->fs_fsize);
337 printf("-g %d ", fs->fs_avgfilesize);
338 printf("-h %d ", fs->fs_avgfpdir);
339 /* -i is dumb */
340 /* -j..l unimplemented */
341 printf("-m %d ", fs->fs_minfree);
342 /* -n unimplemented */
343 printf("-o ");
344 switch (fs->fs_optim) {
345 case FS_OPTSPACE:
346 printf("space ");
347 break;
348 case FS_OPTTIME:
349 printf("time ");
350 break;
351 default:
352 printf("unknown ");
353 break;
354 }
355 /* -p..r unimplemented */
356 printf("-s %jd ", (intmax_t)fs->fs_size);
357 printf("%s ", disk.d_name);
358 printf("\n");
359
360 return 0;
361}
362
363void
364pbits(void *vp, int max)
365{
366 int i;
367 char *p;
368 int count, j;
369
370 for (count = i = 0, p = vp; i < max; i++)
371 if (isset(p, i)) {
372 if (count)
373 printf(",%s", count % 6 ? " " : "\n\t");
374 count++;
375 printf("%d", i);
376 j = i;
377 while ((i+1)<max && isset(p, i+1))
378 i++;
379 if (i != j)
380 printf("-%d", i);
381 }
382 printf("\n");
383}
384
385void
386ufserr(const char *name)
387{
388 if (disk.d_error != NULL)
389 warnx("%s: %s", name, disk.d_error);
390 else if (errno)
391 warn("%s", name);
392}
393
394void
395usage(void)
396{
397 (void)fprintf(stderr, "usage: dumpfs [-m] filesys | device\n");
398 exit(1);
399}