1 /* $OpenBSD: dumpfs.c,v 1.18 2003/06/25 21:23:53 deraadt Exp $ */
2 /* $NetBSD: dumpfs.c,v 1.12 1997/04/26 05:41:33 lukem Exp $ */
3
4 /*
5 * Copyright (c) 1983, 1992, 1993
6 * The Regents of the University of California. All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the name of the University nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
19 *
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 * SUCH DAMAGE.
31 */
32
33 #ifndef lint
34 static char copyright[] =
35 "@(#) Copyright (c) 1983, 1992, 1993\n\
36 The Regents of the University of California. All rights reserved.\n";
37 #endif /* not lint */
38
39 #ifndef lint
40 #if 0
41 static char sccsid[] = "@(#)dumpfs.c 8.2 (Berkeley) 2/2/94";
42 #else
43 static char rcsid[] = "$OpenBSD: dumpfs.c,v 1.18 2003/06/25 21:23:53 deraadt Exp $";
44 #endif
45 #endif /* not lint */
46
47 #include <sys/param.h>
48 #include <sys/time.h>
49
50 #include <ufs/ufs/dinode.h>
51 #include <ufs/ffs/fs.h>
52
53 #include <err.h>
54 #include <errno.h>
55 #include <fcntl.h>
56 #include <fstab.h>
57 #include <stdio.h>
58 #include <stdlib.h>
59 #include <string.h>
60 #include <unistd.h>
61
62 union {
63 struct fs fs;
64 char pad[MAXBSIZE];
65 } fsun;
66 #define afs fsun.fs
67
68 union {
69 struct cg cg;
70 char pad[MAXBSIZE];
71 } cgun;
72 #define acg cgun.cg
73
74 long dev_bsize = 1;
75
76 int dumpfs(char *);
77 int dumpcg(char *, int, int);
78 void pbits(void *, int);
79 void usage(void);
80
81 int
main(int argc,char * argv[])82 main(int argc, char *argv[])
83 {
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
107 int
dumpfs(char * name)108 dumpfs(char *name)
109 {
110 ssize_t n;
111 int fd, c, i, j, k, size;
112 time_t t;
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, skipping.", 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 t = afs.fs_time;
137 printf("magic\t%x\ttime\t%s", afs.fs_magic,
138 ctime(&t));
139 i = 0;
140 if (afs.fs_postblformat != FS_42POSTBLFMT) {
141 i++;
142 if (afs.fs_inodefmt >= FS_44INODEFMT) {
143 int max;
144
145 i++;
146 max = afs.fs_maxcontig;
147 size = afs.fs_contigsumsize;
148 if ((max < 2 && size == 0)
149 || (max > 1 && size >= MIN(max, FS_MAXCONTIG)))
150 i++;
151 }
152 }
153 printf("cylgrp\t%s\tinodes\t%s\tfslevel %d%s\n",
154 i < 1 ? "static" : "dynamic", i < 2 ? "4.2/4.3BSD" : "4.4BSD", i,
155 (afs.fs_flags & FS_DOSOFTDEP) ? "\tsoft updates" : "");
156 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n",
157 afs.fs_cstotal.cs_nbfree, afs.fs_cstotal.cs_ndir,
158 afs.fs_cstotal.cs_nifree, afs.fs_cstotal.cs_nffree);
159 printf("ncg\t%d\tncyl\t%d\tsize\t%d\tblocks\t%d\n",
160 afs.fs_ncg, afs.fs_ncyl, afs.fs_size, afs.fs_dsize);
161 printf("bsize\t%d\tshift\t%d\tmask\t0x%08x\n",
162 afs.fs_bsize, afs.fs_bshift, afs.fs_bmask);
163 printf("fsize\t%d\tshift\t%d\tmask\t0x%08x\n",
164 afs.fs_fsize, afs.fs_fshift, afs.fs_fmask);
165 printf("frag\t%d\tshift\t%d\tfsbtodb\t%d\n",
166 afs.fs_frag, afs.fs_fragshift, afs.fs_fsbtodb);
167 printf("cpg\t%d\tbpg\t%d\tfpg\t%d\tipg\t%d\n",
168 afs.fs_cpg, afs.fs_fpg / afs.fs_frag, afs.fs_fpg, afs.fs_ipg);
169 printf("minfree\t%d%%\toptim\t%s\tmaxcontig %d\tmaxbpg\t%d\n",
170 afs.fs_minfree, afs.fs_optim == FS_OPTSPACE ? "space" : "time",
171 afs.fs_maxcontig, afs.fs_maxbpg);
172 printf("rotdelay %dms\trps\t%d\n", afs.fs_rotdelay, afs.fs_rps);
173 printf("ntrak\t%d\tnsect\t%d\tnpsect\t%d\tspc\t%d\n",
174 afs.fs_ntrak, afs.fs_nsect, afs.fs_npsect, afs.fs_spc);
175 printf("symlinklen %d\ttrackskew %d\tinterleave %d\tcontigsumsize %d\n",
176 afs.fs_maxsymlinklen, afs.fs_trackskew, afs.fs_interleave,
177 afs.fs_contigsumsize);
178 printf("nindir\t%d\tinopb\t%d\tnspf\t%d\tmaxfilesize\t%qu\n",
179 afs.fs_nindir, afs.fs_inopb, afs.fs_nspf, afs.fs_maxfilesize);
180 printf("sblkno\t%d\tcblkno\t%d\tiblkno\t%d\tdblkno\t%d\n",
181 afs.fs_sblkno, afs.fs_cblkno, afs.fs_iblkno, afs.fs_dblkno);
182 printf("sbsize\t%d\tcgsize\t%d\tcgoffset %d\tcgmask\t0x%08x\n",
183 afs.fs_sbsize, afs.fs_cgsize, afs.fs_cgoffset, afs.fs_cgmask);
184 printf("csaddr\t%d\tcssize\t%d\tshift\t%d\tmask\t0x%08x\n",
185 afs.fs_csaddr, afs.fs_cssize, afs.fs_csshift, afs.fs_csmask);
186 printf("cgrotor\t%d\tfmod\t%d\tronly\t%d\tclean\t0x%02x\n",
187 afs.fs_cgrotor, afs.fs_fmod, afs.fs_ronly, afs.fs_clean);
188 printf("flags\t");
189 if (afs.fs_flags == 0)
190 printf("none");
191 if (afs.fs_flags & FS_UNCLEAN)
192 printf("unclean ");
193 if (afs.fs_flags & FS_DOSOFTDEP)
194 printf("soft-updates ");
195 if ((afs.fs_flags & ~(FS_UNCLEAN | FS_DOSOFTDEP)) != 0)
196 printf("unknown flags (%#x)",
197 afs.fs_flags & ~(FS_UNCLEAN | FS_DOSOFTDEP));
198 printf("\n");
199 if (afs.fs_cpc != 0)
200 printf("blocks available in each of %d rotational positions",
201 afs.fs_nrpos);
202 else
203 printf("insufficient space to maintain rotational tables\n");
204 for (c = 0; c < afs.fs_cpc; c++) {
205 printf("\ncylinder number %d:", c);
206 for (i = 0; i < afs.fs_nrpos; i++) {
207 if (fs_postbl(&afs, c)[i] == -1)
208 continue;
209 printf("\n position %d:\t", i);
210 for (j = fs_postbl(&afs, c)[i], k = 1; ;
211 j += fs_rotbl(&afs)[j], k++) {
212 printf("%5d", j);
213 if (k % 12 == 0)
214 printf("\n\t\t");
215 if (fs_rotbl(&afs)[j] == 0)
216 break;
217 }
218 }
219 }
220 printf("\ncs[].cs_(nbfree,ndir,nifree,nffree):\n\t");
221 afs.fs_csp = calloc(1, afs.fs_cssize);
222 for (i = 0, j = 0; i < afs.fs_cssize; i += afs.fs_bsize, j++) {
223 size = afs.fs_cssize - i < afs.fs_bsize ?
224 afs.fs_cssize - i : afs.fs_bsize;
225 if (lseek(fd,
226 (off_t)(fsbtodb(&afs, (afs.fs_csaddr + j * afs.fs_frag))) *
227 dev_bsize, SEEK_SET) == (off_t)-1)
228 goto err;
229 if (read(fd, (char *)afs.fs_csp + i, size) != size)
230 goto err;
231 }
232 for (i = 0; i < afs.fs_ncg; i++) {
233 struct csum *cs = &afs.fs_cs(&afs, i);
234 if (i && i % 4 == 0)
235 printf("\n\t");
236 printf("(%d,%d,%d,%d) ",
237 cs->cs_nbfree, cs->cs_ndir, cs->cs_nifree, cs->cs_nffree);
238 }
239 printf("\n");
240 if (afs.fs_ncyl % afs.fs_cpg) {
241 printf("cylinders in last group %d\n",
242 i = afs.fs_ncyl % afs.fs_cpg);
243 printf("blocks in last group %d\n",
244 i * afs.fs_spc / NSPB(&afs));
245 }
246 printf("\n");
247 for (i = 0; i < afs.fs_ncg; i++)
248 if (dumpcg(name, fd, i))
249 goto err;
250 (void)close(fd);
251 return (0);
252
253 err: if (fd != -1)
254 (void)close(fd);
255 warn("%s", name);
256 return (1);
257 }
258
259 int
dumpcg(char * name,int fd,int c)260 dumpcg(char *name, int fd, int c)
261 {
262 off_t cur;
263 int i, j;
264 time_t t;
265
266 printf("\ncg %d:\n", c);
267 if ((cur = lseek(fd, (off_t)(fsbtodb(&afs, cgtod(&afs, c))) * dev_bsize,
268 SEEK_SET)) == (off_t)-1)
269 return (1);
270 if (read(fd, &acg, afs.fs_bsize) != afs.fs_bsize) {
271 warnx("%s: error reading cg", name);
272 return (1);
273 }
274 t = acg.cg_time;
275 printf("magic\t%x\ttell\t%qx\ttime\t%s",
276 afs.fs_postblformat == FS_42POSTBLFMT ?
277 ((struct ocg *)&acg)->cg_magic : acg.cg_magic,
278 cur, ctime(&t));
279 printf("cgx\t%d\tncyl\t%d\tniblk\t%d\tndblk\t%d\n",
280 acg.cg_cgx, acg.cg_ncyl, acg.cg_niblk, acg.cg_ndblk);
281 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n",
282 acg.cg_cs.cs_nbfree, acg.cg_cs.cs_ndir,
283 acg.cg_cs.cs_nifree, acg.cg_cs.cs_nffree);
284 printf("rotor\t%d\tirotor\t%d\tfrotor\t%d\nfrsum",
285 acg.cg_rotor, acg.cg_irotor, acg.cg_frotor);
286 for (i = 1, j = 0; i < afs.fs_frag; i++) {
287 printf("\t%d", acg.cg_frsum[i]);
288 j += i * acg.cg_frsum[i];
289 }
290 printf("\nsum of frsum: %d", j);
291 if (afs.fs_contigsumsize > 0) {
292 for (i = 1; i < afs.fs_contigsumsize; i++) {
293 if ((i - 1) % 8 == 0)
294 printf("\nclusters %d-%d:", i,
295 afs.fs_contigsumsize - 1 < i + 7 ?
296 afs.fs_contigsumsize - 1 : i + 7);
297 printf("\t%d", cg_clustersum(&acg)[i]);
298 }
299 printf("\nclusters size %d and over: %d\n",
300 afs.fs_contigsumsize,
301 cg_clustersum(&acg)[afs.fs_contigsumsize]);
302 printf("clusters free:\t");
303 pbits(cg_clustersfree(&acg), acg.cg_nclusterblks);
304 } else
305 printf("\n");
306 printf("iused:\t");
307 pbits(cg_inosused(&acg), afs.fs_ipg);
308 printf("free:\t");
309 pbits(cg_blksfree(&acg), afs.fs_fpg);
310 printf("b:\n");
311 for (i = 0; i < afs.fs_cpg; i++) {
312 if (cg_blktot(&acg)[i] == 0)
313 continue;
314 printf(" c%d:\t(%d)\t", i, cg_blktot(&acg)[i]);
315 for (j = 0; j < afs.fs_nrpos; j++) {
316 if (afs.fs_cpc > 0 &&
317 fs_postbl(&afs, i % afs.fs_cpc)[j] == -1)
318 continue;
319 printf(" %d", cg_blks(&afs, &acg, i)[j]);
320 }
321 printf("\n");
322 }
323 return (0);
324 }
325
326 void
pbits(void * vp,int max)327 pbits(void *vp, int max)
328 {
329 int i;
330 char *p;
331 int count, j;
332
333 for (count = i = 0, p = vp; i < max; i++)
334 if (isset(p, i)) {
335 if (count)
336 printf(",%s", count % 6 ? " " : "\n\t");
337 count++;
338 printf("%d", i);
339 j = i;
340 while ((i+1)<max && isset(p, i+1))
341 i++;
342 if (i != j)
343 printf("-%d", i);
344 }
345 printf("\n");
346 }
347
348 void
usage(void)349 usage(void)
350 {
351
352 (void)fprintf(stderr, "usage: dumpfs filesys | device\n");
353 exit(1);
354 }
355