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