![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to dumpfs.c CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [CSRG BSD Unix] / 43BSDReno / sbin / dumpfs|
Return to dumpfs.c CVS log | Up to [CSRG BSD Unix] / 43BSDReno / sbin / dumpfs |
1.1 root 1: /*
2: * Copyright (c) 1983 The Regents of the University of California.
3: * All rights reserved.
4: *
5: * Redistribution and use in source and binary forms are permitted
6: * provided that: (1) source distributions retain this entire copyright
7: * notice and comment, and (2) distributions including binaries display
8: * the following acknowledgement: ``This product includes software
9: * developed by the University of California, Berkeley and its contributors''
10: * in the documentation or other materials provided with the distribution
11: * and in all advertising materials mentioning features or use of this
12: * software. Neither the name of the University nor the names of its
13: * contributors may be used to endorse or promote products derived
14: * from this software without specific prior written permission.
15: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
16: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
17: * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
18: */
19:
20: #ifndef lint
21: char copyright[] =
22: "@(#) Copyright (c) 1983 The Regents of the University of California.\n\
23: All rights reserved.\n";
24: #endif /* not lint */
25:
26: #ifndef lint
27: static char sccsid[] = "@(#)dumpfs.c 5.10 (Berkeley) 6/1/90";
28: #endif /* not lint */
29:
30: #include <sys/param.h>
31: #include <ufs/dinode.h>
32: #include <ufs/fs.h>
33:
34: #include <stdio.h>
35: #include <fstab.h>
36:
37: /*
38: * dumpfs
39: */
40:
41: union {
42: struct fs fs;
43: char pad[MAXBSIZE];
44: } fsun;
45: #define afs fsun.fs
46:
47: union {
48: struct cg cg;
49: char pad[MAXBSIZE];
50: } cgun;
51: #define acg cgun.cg
52:
53: long dev_bsize = 1;
54:
55: main(argc, argv)
56: char **argv;
57: {
58: register struct fstab *fs;
59:
60: argc--, argv++;
61: if (argc < 1) {
62: fprintf(stderr, "usage: dumpfs fs ...\n");
63: exit(1);
64: }
65: for (; argc > 0; argv++, argc--) {
66: fs = getfsfile(*argv);
67: if (fs == 0)
68: dumpfs(*argv);
69: else
70: dumpfs(fs->fs_spec);
71: }
72: }
73:
74: dumpfs(name)
75: char *name;
76: {
77: int c, i, j, k, size;
78:
79: close(0);
80: if (open(name, 0) != 0) {
81: perror(name);
82: return;
83: }
84: lseek(0, SBOFF, 0);
85: if (read(0, &afs, SBSIZE) != SBSIZE) {
86: perror(name);
87: return;
88: }
89: if (afs.fs_postblformat == FS_42POSTBLFMT)
90: afs.fs_nrpos = 8;
91: dev_bsize = afs.fs_fsize / fsbtodb(&afs, 1);
92: printf("magic\t%x\tformat\t%s\ttime\t%s", afs.fs_magic,
93: afs.fs_postblformat == FS_42POSTBLFMT ? "static" : "dynamic",
94: ctime(&afs.fs_time));
95: printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n",
96: afs.fs_cstotal.cs_nbfree, afs.fs_cstotal.cs_ndir,
97: afs.fs_cstotal.cs_nifree, afs.fs_cstotal.cs_nffree);
98: printf("ncg\t%d\tncyl\t%d\tsize\t%d\tblocks\t%d\n",
99: afs.fs_ncg, afs.fs_ncyl, afs.fs_size, afs.fs_dsize);
100: printf("bsize\t%d\tshift\t%d\tmask\t0x%08x\n",
101: afs.fs_bsize, afs.fs_bshift, afs.fs_bmask);
102: printf("fsize\t%d\tshift\t%d\tmask\t0x%08x\n",
103: afs.fs_fsize, afs.fs_fshift, afs.fs_fmask);
104: printf("frag\t%d\tshift\t%d\tfsbtodb\t%d\n",
105: afs.fs_frag, afs.fs_fragshift, afs.fs_fsbtodb);
106: printf("cpg\t%d\tbpg\t%d\tfpg\t%d\tipg\t%d\n",
107: afs.fs_cpg, afs.fs_fpg / afs.fs_frag, afs.fs_fpg, afs.fs_ipg);
108: printf("minfree\t%d%%\toptim\t%s\tmaxcontig %d\tmaxbpg\t%d\n",
109: afs.fs_minfree, afs.fs_optim == FS_OPTSPACE ? "space" : "time",
110: afs.fs_maxcontig, afs.fs_maxbpg);
111: printf("rotdelay %dms\theadswitch %dus\ttrackseek %dus\trps\t%d\n",
112: afs.fs_rotdelay, afs.fs_headswitch, afs.fs_trkseek, afs.fs_rps);
113: printf("ntrak\t%d\tnsect\t%d\tnpsect\t%d\tspc\t%d\n",
114: afs.fs_ntrak, afs.fs_nsect, afs.fs_npsect, afs.fs_spc);
115: printf("trackskew %d\tinterleave %d\n",
116: afs.fs_trackskew, afs.fs_interleave);
117: printf("nindir\t%d\tinopb\t%d\tnspf\t%d\n",
118: afs.fs_nindir, afs.fs_inopb, afs.fs_nspf);
119: printf("sblkno\t%d\tcblkno\t%d\tiblkno\t%d\tdblkno\t%d\n",
120: afs.fs_sblkno, afs.fs_cblkno, afs.fs_iblkno, afs.fs_dblkno);
121: printf("sbsize\t%d\tcgsize\t%d\tcgoffset %d\tcgmask\t0x%08x\n",
122: afs.fs_sbsize, afs.fs_cgsize, afs.fs_cgoffset, afs.fs_cgmask);
123: printf("csaddr\t%d\tcssize\t%d\tshift\t%d\tmask\t0x%08x\n",
124: afs.fs_csaddr, afs.fs_cssize, afs.fs_csshift, afs.fs_csmask);
125: printf("cgrotor\t%d\tfmod\t%d\tronly\t%d\n",
126: afs.fs_cgrotor, afs.fs_fmod, afs.fs_ronly);
127: if (afs.fs_cpc != 0)
128: printf("blocks available in each of %d rotational positions",
129: afs.fs_nrpos);
130: else
131: printf("insufficient space to maintain rotational tables\n");
132: for (c = 0; c < afs.fs_cpc; c++) {
133: printf("\ncylinder number %d:", c);
134: for (i = 0; i < afs.fs_nrpos; i++) {
135: if (fs_postbl(&afs, c)[i] == -1)
136: continue;
137: printf("\n position %d:\t", i);
138: for (j = fs_postbl(&afs, c)[i], k = 1; ;
139: j += fs_rotbl(&afs)[j], k++) {
140: printf("%5d", j);
141: if (k % 12 == 0)
142: printf("\n\t\t");
143: if (fs_rotbl(&afs)[j] == 0)
144: break;
145: }
146: }
147: }
148: printf("\ncs[].cs_(nbfree,ndir,nifree,nffree):\n\t");
149: for (i = 0, j = 0; i < afs.fs_cssize; i += afs.fs_bsize, j++) {
150: size = afs.fs_cssize - i < afs.fs_bsize ?
151: afs.fs_cssize - i : afs.fs_bsize;
152: afs.fs_csp[j] = (struct csum *)calloc(1, size);
153: lseek(0, fsbtodb(&afs, (afs.fs_csaddr + j * afs.fs_frag)) *
154: dev_bsize, 0);
155: if (read(0, afs.fs_csp[j], size) != size) {
156: perror(name);
157: return;
158: }
159: }
160: for (i = 0; i < afs.fs_ncg; i++) {
161: struct csum *cs = &afs.fs_cs(&afs, i);
162: if (i && i % 4 == 0)
163: printf("\n\t");
164: printf("(%d,%d,%d,%d) ",
165: cs->cs_nbfree, cs->cs_ndir, cs->cs_nifree, cs->cs_nffree);
166: }
167: printf("\n");
168: if (afs.fs_ncyl % afs.fs_cpg) {
169: printf("cylinders in last group %d\n",
170: i = afs.fs_ncyl % afs.fs_cpg);
171: printf("blocks in last group %d\n",
172: i * afs.fs_spc / NSPB(&afs));
173: }
174: printf("\n");
175: for (i = 0; i < afs.fs_ncg; i++)
176: dumpcg(name, i);
177: close(0);
178: };
179:
180: dumpcg(name, c)
181: char *name;
182: int c;
183: {
184: int i,j;
185:
186: printf("\ncg %d:\n", c);
187: lseek(0, fsbtodb(&afs, cgtod(&afs, c)) * dev_bsize, 0);
188: i = lseek(0, 0, 1);
189: if (read(0, (char *)&acg, afs.fs_bsize) != afs.fs_bsize) {
190: printf("dumpfs: %s: error reading cg\n", name);
191: return;
192: }
193: printf("magic\t%x\ttell\t%x\ttime\t%s",
194: afs.fs_postblformat == FS_42POSTBLFMT ?
195: ((struct ocg *)&acg)->cg_magic : acg.cg_magic,
196: i, ctime(&acg.cg_time));
197: printf("cgx\t%d\tncyl\t%d\tniblk\t%d\tndblk\t%d\n",
198: acg.cg_cgx, acg.cg_ncyl, acg.cg_niblk, acg.cg_ndblk);
199: printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n",
200: acg.cg_cs.cs_nbfree, acg.cg_cs.cs_ndir,
201: acg.cg_cs.cs_nifree, acg.cg_cs.cs_nffree);
202: printf("rotor\t%d\tirotor\t%d\tfrotor\t%d\nfrsum",
203: acg.cg_rotor, acg.cg_irotor, acg.cg_frotor);
204: for (i = 1, j = 0; i < afs.fs_frag; i++) {
205: printf("\t%d", acg.cg_frsum[i]);
206: j += i * acg.cg_frsum[i];
207: }
208: printf("\nsum of frsum: %d\niused:\t", j);
209: pbits(cg_inosused(&acg), afs.fs_ipg);
210: printf("free:\t");
211: pbits(cg_blksfree(&acg), afs.fs_fpg);
212: printf("b:\n");
213: for (i = 0; i < afs.fs_cpg; i++) {
214: if (cg_blktot(&acg)[i] == 0)
215: continue;
216: printf(" c%d:\t(%d)\t", i, cg_blktot(&acg)[i]);
217: for (j = 0; j < afs.fs_nrpos; j++) {
218: if (afs.fs_cpc > 0 &&
219: fs_postbl(&afs, i % afs.fs_cpc)[j] == -1)
220: continue;
221: printf(" %d", cg_blks(&afs, &acg, i)[j]);
222: }
223: printf("\n");
224: }
225: };
226:
227: pbits(cp, max)
228: register char *cp;
229: int max;
230: {
231: register int i;
232: int count = 0, j;
233:
234: for (i = 0; i < max; i++)
235: if (isset(cp, i)) {
236: if (count)
237: printf(",%s", count % 6 ? " " : "\n\t");
238: count++;
239: printf("%d", i);
240: j = i;
241: while ((i+1)<max && isset(cp, i+1))
242: i++;
243: if (i != j)
244: printf("-%d", i);
245: }
246: printf("\n");
247: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.