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