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