Commit | Line | Data |
---|---|---|
bf541624 | 1 | static char *sccsid = "@(#)dumpfs.c 2.2 (Berkeley) %G%"; |
b6407c9d | 2 | |
45eb394d KM |
3 | #ifndef SIMFS |
4 | #include <sys/param.h> | |
5 | #include <sys/inode.h> | |
6 | #include <sys/fs.h> | |
7 | #else | |
4abe96a0 | 8 | #include "../h/param.h" |
56d45dcd | 9 | #include "../h/inode.h" |
45eb394d KM |
10 | #include "../h/fs.h" |
11 | #endif | |
4abe96a0 KM |
12 | |
13 | /* | |
14 | * dumpfs | |
15 | */ | |
16 | ||
17 | union { | |
18 | struct fs fs; | |
b6407c9d | 19 | char pad[MAXBSIZE]; |
4abe96a0 KM |
20 | } fsun; |
21 | #define afs fsun.fs | |
22 | ||
4abe96a0 KM |
23 | union { |
24 | struct cg cg; | |
b6407c9d | 25 | char pad[MAXBSIZE]; |
4abe96a0 KM |
26 | } cgun; |
27 | #define acg cgun.cg | |
28 | ||
29 | main(argc, argv) | |
30 | char **argv; | |
31 | { | |
bf541624 | 32 | int c, i, j, k, size; |
4abe96a0 KM |
33 | |
34 | close(0); | |
35 | if (open(argv[1], 0) != 0) | |
36 | perror(argv[1]), exit(1); | |
b6407c9d | 37 | lseek(0, SBLOCK * DEV_BSIZE, 0); |
c312eebd | 38 | if (read(0, &afs, SBSIZE) != SBSIZE) |
4abe96a0 | 39 | perror(argv[1]), exit(1); |
3352e84a | 40 | printf("magic\t%x\ttime\t%s", afs.fs_magic, ctime(&afs.fs_time)); |
bf541624 KM |
41 | printf("sblkno\t%d\tcblkno\t%d\tiblkno\t%d\tdblkno\t%d\n", |
42 | afs.fs_sblkno, afs.fs_cblkno, afs.fs_iblkno, afs.fs_dblkno); | |
43 | printf("cgoffset\t%d\tcgmask\t0x%08x\n", | |
44 | afs.fs_cgoffset, afs.fs_cgmask); | |
3352e84a KM |
45 | printf("ncg\t%d\tsize\t%d\tblocks\t%d\tcgsize\t%d\n", |
46 | afs.fs_ncg, afs.fs_size, afs.fs_dsize, afs.fs_cgsize); | |
47 | printf("bsize\t%d\tshift\t%d\tmask\t0x%08x\n", | |
48 | afs.fs_bsize, afs.fs_bshift, afs.fs_bmask); | |
49 | printf("fsize\t%d\tshift\t%d\tmask\t0x%08x\n", | |
50 | afs.fs_fsize, afs.fs_fshift, afs.fs_fmask); | |
51 | printf("frag\t%d\tminfree\t%d%%\n", afs.fs_frag, afs.fs_minfree); | |
52 | printf("rotdelay %dms\trps\t%d\n", afs.fs_rotdelay, afs.fs_rps); | |
53 | printf("csaddr\t%d\tcssize\t%d\n", afs.fs_csaddr, afs.fs_cssize); | |
54 | printf("ntrak\t%d\tnsect\t%d\tspc\t%d\tncyl\t%d\n", | |
4abe96a0 | 55 | afs.fs_ntrak, afs.fs_nsect, afs.fs_spc, afs.fs_ncyl); |
3352e84a | 56 | printf("cpg\t%d\tbpg\t%d\tfpg\t%d\tipg\t%d\n", |
c312eebd | 57 | afs.fs_cpg, afs.fs_fpg / afs.fs_frag, afs.fs_fpg, afs.fs_ipg); |
3352e84a KM |
58 | printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n", |
59 | afs.fs_cstotal.cs_nbfree, afs.fs_cstotal.cs_ndir, | |
60 | afs.fs_cstotal.cs_nifree, afs.fs_cstotal.cs_nffree); | |
61 | printf("cgrotor\t%d\tfmod\t%d\tronly\t%d\n", | |
c312eebd | 62 | afs.fs_cgrotor, afs.fs_fmod, afs.fs_ronly); |
aca50d72 KM |
63 | if (afs.fs_cpc != 0) |
64 | printf("blocks available in each rotational position"); | |
65 | else | |
66 | printf("insufficient space to maintain rotational tables\n"); | |
67 | for (c = 0; c < afs.fs_cpc; c++) { | |
68 | printf("\ncylinder number %d:", c); | |
69 | for (i = 0; i < NRPOS; i++) { | |
70 | if (afs.fs_postbl[c][i] == -1) | |
71 | continue; | |
72 | printf("\n position %d:\t", i); | |
73 | for (j = afs.fs_postbl[c][i], k = 1; ; | |
74 | j += afs.fs_rotbl[j], k++) { | |
75 | printf("%5d", j); | |
76 | if (k % 12 == 0) | |
77 | printf("\n\t\t"); | |
78 | if (afs.fs_rotbl[j] == 0) | |
79 | break; | |
80 | } | |
743f1ef7 KM |
81 | } |
82 | } | |
0947395d | 83 | printf("\ncs[].cs_(nbfree,ndir,nifree,nffree):\n\t"); |
bf541624 KM |
84 | for (i = 0, j = 0; i < afs.fs_cssize; i += afs.fs_bsize, j++) { |
85 | size = afs.fs_cssize - i < afs.fs_bsize ? | |
86 | afs.fs_cssize - i : afs.fs_bsize; | |
87 | afs.fs_csp[j] = (struct csum *)calloc(1, size); | |
88 | lseek(0, fsbtodb(&afs, (afs.fs_csaddr + j * afs.fs_frag)) * | |
b6407c9d | 89 | DEV_BSIZE, 0); |
bf541624 | 90 | if (read(0, afs.fs_csp[j], size) != size) |
743f1ef7 KM |
91 | perror(argv[1]), exit(1); |
92 | } | |
4abe96a0 | 93 | for (i = 0; i < afs.fs_ncg; i++) { |
b6407c9d | 94 | struct csum *cs = &afs.fs_cs(&afs, i); |
0947395d | 95 | if (i && i % 4 == 0) |
4abe96a0 | 96 | printf("\n\t"); |
0947395d KM |
97 | printf("(%d,%d,%d,%d) ", |
98 | cs->cs_nbfree, cs->cs_ndir, cs->cs_nifree, cs->cs_nffree); | |
4abe96a0 KM |
99 | } |
100 | printf("\n"); | |
c312eebd KM |
101 | if (afs.fs_ncyl % afs.fs_cpg) { |
102 | printf("cylinders in last group %d\n", | |
103 | i = afs.fs_ncyl % afs.fs_cpg); | |
104 | printf("blocks in last group %d\n", | |
105 | i * afs.fs_spc / NSPB(&afs)); | |
106 | } | |
4abe96a0 KM |
107 | printf("\n"); |
108 | for (i = 0; i < afs.fs_ncg; i++) | |
109 | dumpcg(i); | |
110 | }; | |
111 | ||
112 | dumpcg(c) | |
113 | int c; | |
114 | { | |
115 | int i,j; | |
116 | ||
117 | printf("\ncg %d:\n", c); | |
6994bf5d | 118 | lseek(0, fsbtodb(&afs, cgtod(&afs, c)) * DEV_BSIZE, 0); |
3352e84a | 119 | i = tell(0); |
b6407c9d | 120 | if (read(0, (char *)&acg, afs.fs_bsize) != afs.fs_bsize) { |
4abe96a0 KM |
121 | printf("\terror reading cg\n"); |
122 | return; | |
123 | } | |
3352e84a KM |
124 | printf("magic\t%x\ttell\t%x\ttime\t%s", |
125 | acg.cg_magic, i, ctime(&acg.cg_time)); | |
126 | printf("cgx\t%d\tncyl\t%d\tniblk\t%d\tndblk\t%d\n", | |
4abe96a0 | 127 | acg.cg_cgx, acg.cg_ncyl, acg.cg_niblk, acg.cg_ndblk); |
3352e84a KM |
128 | printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n", |
129 | acg.cg_cs.cs_nbfree, acg.cg_cs.cs_ndir, | |
130 | acg.cg_cs.cs_nifree, acg.cg_cs.cs_nffree); | |
131 | printf("rotor\t%d\tirotor\t%d\tfrotor\t%d\nfrsum", | |
743f1ef7 | 132 | acg.cg_rotor, acg.cg_irotor, acg.cg_frotor); |
b6407c9d | 133 | for (i = 1, j = 0; i < afs.fs_frag; i++) { |
f3c028b7 KM |
134 | printf("\t%d", acg.cg_frsum[i]); |
135 | j += i * acg.cg_frsum[i]; | |
136 | } | |
137 | printf("\nsum of frsum: %d\niused:\t", j); | |
4abe96a0 KM |
138 | pbits(acg.cg_iused, afs.fs_ipg); |
139 | printf("free:\t"); | |
140 | pbits(acg.cg_free, afs.fs_fpg); | |
141 | printf("b:\n"); | |
142 | for (i = 0; i < afs.fs_cpg; i++) { | |
43f6367c | 143 | printf(" c%d:\t(%d)\t", i, acg.cg_btot[i]); |
4abe96a0 KM |
144 | for (j = 0; j < NRPOS; j++) |
145 | printf(" %d", acg.cg_b[i][j]); | |
146 | printf("\n"); | |
147 | } | |
148 | }; | |
149 | ||
4abe96a0 KM |
150 | pbits(cp, max) |
151 | register char *cp; | |
152 | int max; | |
153 | { | |
154 | register int i; | |
155 | int count = 0, j; | |
156 | ||
157 | for (i = 0; i < max; i++) | |
158 | if (isset(cp, i)) { | |
159 | if (count) | |
3352e84a | 160 | printf(",%s", count %9 == 8 ? "\n\t" : " "); |
4abe96a0 KM |
161 | count++; |
162 | printf("%d", i); | |
163 | j = i; | |
164 | while ((i+1)<max && isset(cp, i+1)) | |
165 | i++; | |
166 | if (i != j) | |
167 | printf("-%d", i); | |
168 | } | |
169 | printf("\n"); | |
170 | } |