BSD 4_3_Tahoe release
[unix-history] / usr / src / etc / dumpfs.c
CommitLineData
da158ee3
DF
1/*
2 * Copyright (c) 1983 Regents of the University of California.
3 * All rights reserved. The Berkeley software License Agreement
4 * specifies the terms and conditions for redistribution.
5 */
6
7#ifndef lint
8char copyright[] =
9"@(#) Copyright (c) 1983 Regents of the University of California.\n\
10 All rights reserved.\n";
11#endif not lint
12
d696309b 13#ifndef lint
ca67e7b4 14static char sccsid[] = "@(#)dumpfs.c 5.6 (Berkeley) 5/1/88";
da158ee3 15#endif not lint
b6407c9d 16
45eb394d
KM
17#include <sys/param.h>
18#include <sys/inode.h>
19#include <sys/fs.h>
d696309b
SL
20
21#include <stdio.h>
22#include <fstab.h>
4abe96a0
KM
23
24/*
25 * dumpfs
26 */
27
28union {
29 struct fs fs;
b6407c9d 30 char pad[MAXBSIZE];
4abe96a0
KM
31} fsun;
32#define afs fsun.fs
33
4abe96a0
KM
34union {
35 struct cg cg;
b6407c9d 36 char pad[MAXBSIZE];
4abe96a0
KM
37} cgun;
38#define acg cgun.cg
39
a66ab591
KM
40long dev_bsize = 1;
41
4abe96a0
KM
42main(argc, argv)
43 char **argv;
d696309b
SL
44{
45 register struct fstab *fs;
46
47 argc--, argv++;
48 if (argc < 1) {
49 fprintf(stderr, "usage: dumpfs fs ...\n");
50 exit(1);
51 }
52 for (; argc > 0; argv++, argc--) {
53 fs = getfsfile(*argv);
54 if (fs == 0)
55 dumpfs(*argv);
56 else
57 dumpfs(fs->fs_spec);
58 }
59}
60
61dumpfs(name)
62 char *name;
4abe96a0 63{
bf541624 64 int c, i, j, k, size;
4abe96a0
KM
65
66 close(0);
d696309b
SL
67 if (open(name, 0) != 0) {
68 perror(name);
69 return;
70 }
a66ab591 71 lseek(0, SBOFF, 0);
d696309b
SL
72 if (read(0, &afs, SBSIZE) != SBSIZE) {
73 perror(name);
74 return;
75 }
48f6b0fe
KM
76 if (afs.fs_postblformat == FS_42POSTBLFMT)
77 afs.fs_nrpos = 8;
a66ab591 78 dev_bsize = afs.fs_fsize / fsbtodb(&afs, 1);
48f6b0fe
KM
79 printf("magic\t%x\tformat\t%s\ttime\t%s", afs.fs_magic,
80 afs.fs_postblformat == FS_42POSTBLFMT ? "static" : "dynamic",
81 ctime(&afs.fs_time));
5495e217
KM
82 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n",
83 afs.fs_cstotal.cs_nbfree, afs.fs_cstotal.cs_ndir,
84 afs.fs_cstotal.cs_nifree, afs.fs_cstotal.cs_nffree);
85 printf("ncg\t%d\tncyl\t%d\tsize\t%d\tblocks\t%d\n",
86 afs.fs_ncg, afs.fs_ncyl, afs.fs_size, afs.fs_dsize);
3352e84a
KM
87 printf("bsize\t%d\tshift\t%d\tmask\t0x%08x\n",
88 afs.fs_bsize, afs.fs_bshift, afs.fs_bmask);
89 printf("fsize\t%d\tshift\t%d\tmask\t0x%08x\n",
90 afs.fs_fsize, afs.fs_fshift, afs.fs_fmask);
19782540
KM
91 printf("frag\t%d\tshift\t%d\tfsbtodb\t%d\n",
92 afs.fs_frag, afs.fs_fragshift, afs.fs_fsbtodb);
3352e84a 93 printf("cpg\t%d\tbpg\t%d\tfpg\t%d\tipg\t%d\n",
c312eebd 94 afs.fs_cpg, afs.fs_fpg / afs.fs_frag, afs.fs_fpg, afs.fs_ipg);
5495e217
KM
95 printf("minfree\t%d%%\toptim\t%s\tmaxcontig %d\tmaxbpg\t%d\n",
96 afs.fs_minfree, afs.fs_optim == FS_OPTSPACE ? "space" : "time",
97 afs.fs_maxcontig, afs.fs_maxbpg);
98 printf("rotdelay %dms\theadswitch %dus\ttrackseek %dus\trps\t%d\n",
99 afs.fs_rotdelay, afs.fs_headswitch, afs.fs_trkseek, afs.fs_rps);
100 printf("ntrak\t%d\tnsect\t%d\tnpsect\t%d\tspc\t%d\n",
101 afs.fs_ntrak, afs.fs_nsect, afs.fs_npsect, afs.fs_spc);
102 printf("trackskew %d\tinterleave %d\n",
103 afs.fs_trackskew, afs.fs_interleave);
19782540
KM
104 printf("nindir\t%d\tinopb\t%d\tnspf\t%d\n",
105 afs.fs_nindir, afs.fs_inopb, afs.fs_nspf);
5495e217
KM
106 printf("sblkno\t%d\tcblkno\t%d\tiblkno\t%d\tdblkno\t%d\n",
107 afs.fs_sblkno, afs.fs_cblkno, afs.fs_iblkno, afs.fs_dblkno);
108 printf("sbsize\t%d\tcgsize\t%d\tcgoffset %d\tcgmask\t0x%08x\n",
109 afs.fs_sbsize, afs.fs_cgsize, afs.fs_cgoffset, afs.fs_cgmask);
110 printf("csaddr\t%d\tcssize\t%d\tshift\t%d\tmask\t0x%08x\n",
111 afs.fs_csaddr, afs.fs_cssize, afs.fs_csshift, afs.fs_csmask);
3352e84a 112 printf("cgrotor\t%d\tfmod\t%d\tronly\t%d\n",
c312eebd 113 afs.fs_cgrotor, afs.fs_fmod, afs.fs_ronly);
aca50d72 114 if (afs.fs_cpc != 0)
48f6b0fe
KM
115 printf("blocks available in each of %d rotational positions",
116 afs.fs_nrpos);
aca50d72
KM
117 else
118 printf("insufficient space to maintain rotational tables\n");
119 for (c = 0; c < afs.fs_cpc; c++) {
120 printf("\ncylinder number %d:", c);
48f6b0fe
KM
121 for (i = 0; i < afs.fs_nrpos; i++) {
122 if (fs_postbl(&afs, c)[i] == -1)
aca50d72
KM
123 continue;
124 printf("\n position %d:\t", i);
48f6b0fe
KM
125 for (j = fs_postbl(&afs, c)[i], k = 1; ;
126 j += fs_rotbl(&afs)[j], k++) {
aca50d72
KM
127 printf("%5d", j);
128 if (k % 12 == 0)
129 printf("\n\t\t");
48f6b0fe 130 if (fs_rotbl(&afs)[j] == 0)
aca50d72
KM
131 break;
132 }
743f1ef7
KM
133 }
134 }
0947395d 135 printf("\ncs[].cs_(nbfree,ndir,nifree,nffree):\n\t");
bf541624
KM
136 for (i = 0, j = 0; i < afs.fs_cssize; i += afs.fs_bsize, j++) {
137 size = afs.fs_cssize - i < afs.fs_bsize ?
138 afs.fs_cssize - i : afs.fs_bsize;
139 afs.fs_csp[j] = (struct csum *)calloc(1, size);
140 lseek(0, fsbtodb(&afs, (afs.fs_csaddr + j * afs.fs_frag)) *
a66ab591 141 dev_bsize, 0);
d696309b
SL
142 if (read(0, afs.fs_csp[j], size) != size) {
143 perror(name);
144 return;
145 }
743f1ef7 146 }
4abe96a0 147 for (i = 0; i < afs.fs_ncg; i++) {
b6407c9d 148 struct csum *cs = &afs.fs_cs(&afs, i);
0947395d 149 if (i && i % 4 == 0)
4abe96a0 150 printf("\n\t");
0947395d
KM
151 printf("(%d,%d,%d,%d) ",
152 cs->cs_nbfree, cs->cs_ndir, cs->cs_nifree, cs->cs_nffree);
4abe96a0
KM
153 }
154 printf("\n");
c312eebd
KM
155 if (afs.fs_ncyl % afs.fs_cpg) {
156 printf("cylinders in last group %d\n",
157 i = afs.fs_ncyl % afs.fs_cpg);
158 printf("blocks in last group %d\n",
159 i * afs.fs_spc / NSPB(&afs));
160 }
4abe96a0
KM
161 printf("\n");
162 for (i = 0; i < afs.fs_ncg; i++)
d696309b
SL
163 dumpcg(name, i);
164 close(0);
4abe96a0
KM
165};
166
d696309b
SL
167dumpcg(name, c)
168 char *name;
4abe96a0
KM
169 int c;
170{
171 int i,j;
172
173 printf("\ncg %d:\n", c);
a66ab591 174 lseek(0, fsbtodb(&afs, cgtod(&afs, c)) * dev_bsize, 0);
3d1d86a6 175 i = lseek(0, 0, 1);
b6407c9d 176 if (read(0, (char *)&acg, afs.fs_bsize) != afs.fs_bsize) {
d696309b 177 printf("dumpfs: %s: error reading cg\n", name);
4abe96a0
KM
178 return;
179 }
3352e84a 180 printf("magic\t%x\ttell\t%x\ttime\t%s",
48f6b0fe
KM
181 afs.fs_postblformat == FS_42POSTBLFMT ?
182 ((struct ocg *)&acg)->cg_magic : acg.cg_magic,
183 i, ctime(&acg.cg_time));
3352e84a 184 printf("cgx\t%d\tncyl\t%d\tniblk\t%d\tndblk\t%d\n",
4abe96a0 185 acg.cg_cgx, acg.cg_ncyl, acg.cg_niblk, acg.cg_ndblk);
3352e84a
KM
186 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n",
187 acg.cg_cs.cs_nbfree, acg.cg_cs.cs_ndir,
188 acg.cg_cs.cs_nifree, acg.cg_cs.cs_nffree);
189 printf("rotor\t%d\tirotor\t%d\tfrotor\t%d\nfrsum",
743f1ef7 190 acg.cg_rotor, acg.cg_irotor, acg.cg_frotor);
b6407c9d 191 for (i = 1, j = 0; i < afs.fs_frag; i++) {
f3c028b7
KM
192 printf("\t%d", acg.cg_frsum[i]);
193 j += i * acg.cg_frsum[i];
194 }
195 printf("\nsum of frsum: %d\niused:\t", j);
48f6b0fe 196 pbits(cg_inosused(&acg), afs.fs_ipg);
4abe96a0 197 printf("free:\t");
48f6b0fe 198 pbits(cg_blksfree(&acg), afs.fs_fpg);
4abe96a0
KM
199 printf("b:\n");
200 for (i = 0; i < afs.fs_cpg; i++) {
48f6b0fe
KM
201 if (cg_blktot(&acg)[i] == 0)
202 continue;
203 printf(" c%d:\t(%d)\t", i, cg_blktot(&acg)[i]);
204 for (j = 0; j < afs.fs_nrpos; j++) {
205 if (afs.fs_cpc > 0 &&
206 fs_postbl(&afs, i % afs.fs_cpc)[j] == -1)
207 continue;
208 printf(" %d", cg_blks(&afs, &acg, i)[j]);
209 }
4abe96a0
KM
210 printf("\n");
211 }
212};
213
4abe96a0
KM
214pbits(cp, max)
215 register char *cp;
216 int max;
217{
218 register int i;
219 int count = 0, j;
220
221 for (i = 0; i < max; i++)
222 if (isset(cp, i)) {
223 if (count)
48f6b0fe 224 printf(",%s", count % 6 ? " " : "\n\t");
4abe96a0
KM
225 count++;
226 printf("%d", i);
227 j = i;
228 while ((i+1)<max && isset(cp, i+1))
229 i++;
230 if (i != j)
231 printf("-%d", i);
232 }
233 printf("\n");
234}