1 /* 2 * Copyright (c) 1983, 1992, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * %sccs.include.redist.c% 6 */ 7 8 #ifndef lint 9 static char copyright[] = 10 "@(#) Copyright (c) 1983, 1992, 1993\n\ 11 The Regents of the University of California. All rights reserved.\n"; 12 #endif /* not lint */ 13 14 #ifndef lint 15 static char sccsid[] = "@(#)dumpfs.c 8.2 (Berkeley) 02/02/94"; 16 #endif /* not lint */ 17 18 #include <sys/param.h> 19 #include <sys/time.h> 20 21 #include <ufs/ufs/dinode.h> 22 #include <ufs/ffs/fs.h> 23 24 #include <unistd.h> 25 #include <fcntl.h> 26 #include <errno.h> 27 #include <fstab.h> 28 #include <stdio.h> 29 #include <stdlib.h> 30 #include <string.h> 31 32 union { 33 struct fs fs; 34 char pad[MAXBSIZE]; 35 } fsun; 36 #define afs fsun.fs 37 38 union { 39 struct cg cg; 40 char pad[MAXBSIZE]; 41 } cgun; 42 #define acg cgun.cg 43 44 long dev_bsize = 1; 45 46 int dumpfs __P((char *)); 47 int dumpcg __P((char *, int, int)); 48 void pbits __P((void *, int)); 49 void usage __P((void)); 50 51 int 52 main(argc, argv) 53 int argc; 54 char *argv[]; 55 { 56 register struct fstab *fs; 57 int ch, eval; 58 59 while ((ch = getopt(argc, argv, "")) != EOF) 60 switch(ch) { 61 case '?': 62 default: 63 usage(); 64 } 65 argc -= optind; 66 argv += optind; 67 68 if (argc < 1) 69 usage(); 70 71 for (eval = 0; *argv; ++argv) 72 if ((fs = getfsfile(*argv)) == NULL) 73 eval |= dumpfs(*argv); 74 else 75 eval |= dumpfs(fs->fs_spec); 76 exit(eval); 77 } 78 79 int 80 dumpfs(name) 81 char *name; 82 { 83 int fd, c, i, j, k, size; 84 85 if ((fd = open(name, O_RDONLY, 0)) < 0) 86 goto err; 87 if (lseek(fd, (off_t)SBOFF, SEEK_SET) == (off_t)-1) 88 goto err; 89 if (read(fd, &afs, SBSIZE) != SBSIZE) 90 goto err; 91 92 if (afs.fs_postblformat == FS_42POSTBLFMT) 93 afs.fs_nrpos = 8; 94 dev_bsize = afs.fs_fsize / fsbtodb(&afs, 1); 95 printf("magic\t%x\ttime\t%s", afs.fs_magic, 96 ctime(&afs.fs_time)); 97 printf("cylgrp\t%s\tinodes\t%s\n", 98 afs.fs_postblformat == FS_42POSTBLFMT ? "static" : "dynamic", 99 afs.fs_inodefmt < FS_44INODEFMT ? "4.2/4.3BSD" : "4.4BSD"); 100 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n", 101 afs.fs_cstotal.cs_nbfree, afs.fs_cstotal.cs_ndir, 102 afs.fs_cstotal.cs_nifree, afs.fs_cstotal.cs_nffree); 103 printf("ncg\t%d\tncyl\t%d\tsize\t%d\tblocks\t%d\n", 104 afs.fs_ncg, afs.fs_ncyl, afs.fs_size, afs.fs_dsize); 105 printf("bsize\t%d\tshift\t%d\tmask\t0x%08x\n", 106 afs.fs_bsize, afs.fs_bshift, afs.fs_bmask); 107 printf("fsize\t%d\tshift\t%d\tmask\t0x%08x\n", 108 afs.fs_fsize, afs.fs_fshift, afs.fs_fmask); 109 printf("frag\t%d\tshift\t%d\tfsbtodb\t%d\n", 110 afs.fs_frag, afs.fs_fragshift, afs.fs_fsbtodb); 111 printf("cpg\t%d\tbpg\t%d\tfpg\t%d\tipg\t%d\n", 112 afs.fs_cpg, afs.fs_fpg / afs.fs_frag, afs.fs_fpg, afs.fs_ipg); 113 printf("minfree\t%d%%\toptim\t%s\tmaxcontig %d\tmaxbpg\t%d\n", 114 afs.fs_minfree, afs.fs_optim == FS_OPTSPACE ? "space" : "time", 115 afs.fs_maxcontig, afs.fs_maxbpg); 116 printf("rotdelay %dms\theadswitch %dus\ttrackseek %dus\trps\t%d\n", 117 afs.fs_rotdelay, afs.fs_headswitch, afs.fs_trkseek, afs.fs_rps); 118 printf("ntrak\t%d\tnsect\t%d\tnpsect\t%d\tspc\t%d\n", 119 afs.fs_ntrak, afs.fs_nsect, afs.fs_npsect, afs.fs_spc); 120 printf("symlinklen %d\ttrackskew %d\tinterleave %d\tcontigsumsize %d\n", 121 afs.fs_maxsymlinklen, afs.fs_trackskew, afs.fs_interleave, 122 afs.fs_contigsumsize); 123 printf("nindir\t%d\tinopb\t%d\tnspf\t%d\n", 124 afs.fs_nindir, afs.fs_inopb, afs.fs_nspf); 125 printf("sblkno\t%d\tcblkno\t%d\tiblkno\t%d\tdblkno\t%d\n", 126 afs.fs_sblkno, afs.fs_cblkno, afs.fs_iblkno, afs.fs_dblkno); 127 printf("sbsize\t%d\tcgsize\t%d\tcgoffset %d\tcgmask\t0x%08x\n", 128 afs.fs_sbsize, afs.fs_cgsize, afs.fs_cgoffset, afs.fs_cgmask); 129 printf("csaddr\t%d\tcssize\t%d\tshift\t%d\tmask\t0x%08x\n", 130 afs.fs_csaddr, afs.fs_cssize, afs.fs_csshift, afs.fs_csmask); 131 printf("cgrotor\t%d\tfmod\t%d\tronly\t%d\n", 132 afs.fs_cgrotor, afs.fs_fmod, afs.fs_ronly); 133 if (afs.fs_cpc != 0) 134 printf("blocks available in each of %d rotational positions", 135 afs.fs_nrpos); 136 else 137 printf("insufficient space to maintain rotational tables\n"); 138 for (c = 0; c < afs.fs_cpc; c++) { 139 printf("\ncylinder number %d:", c); 140 for (i = 0; i < afs.fs_nrpos; i++) { 141 if (fs_postbl(&afs, c)[i] == -1) 142 continue; 143 printf("\n position %d:\t", i); 144 for (j = fs_postbl(&afs, c)[i], k = 1; ; 145 j += fs_rotbl(&afs)[j], k++) { 146 printf("%5d", j); 147 if (k % 12 == 0) 148 printf("\n\t\t"); 149 if (fs_rotbl(&afs)[j] == 0) 150 break; 151 } 152 } 153 } 154 printf("\ncs[].cs_(nbfree,ndir,nifree,nffree):\n\t"); 155 for (i = 0, j = 0; i < afs.fs_cssize; i += afs.fs_bsize, j++) { 156 size = afs.fs_cssize - i < afs.fs_bsize ? 157 afs.fs_cssize - i : afs.fs_bsize; 158 afs.fs_csp[j] = calloc(1, size); 159 if (lseek(fd, 160 (off_t)(fsbtodb(&afs, (afs.fs_csaddr + j * afs.fs_frag)) * 161 dev_bsize), SEEK_SET) == (off_t)-1) 162 goto err; 163 if (read(fd, afs.fs_csp[j], size) != size) 164 goto err; 165 } 166 for (i = 0; i < afs.fs_ncg; i++) { 167 struct csum *cs = &afs.fs_cs(&afs, i); 168 if (i && i % 4 == 0) 169 printf("\n\t"); 170 printf("(%d,%d,%d,%d) ", 171 cs->cs_nbfree, cs->cs_ndir, cs->cs_nifree, cs->cs_nffree); 172 } 173 printf("\n"); 174 if (afs.fs_ncyl % afs.fs_cpg) { 175 printf("cylinders in last group %d\n", 176 i = afs.fs_ncyl % afs.fs_cpg); 177 printf("blocks in last group %d\n", 178 i * afs.fs_spc / NSPB(&afs)); 179 } 180 printf("\n"); 181 for (i = 0; i < afs.fs_ncg; i++) 182 if (dumpcg(name, fd, i)) 183 goto err; 184 (void)close(fd); 185 return (0); 186 187 err: if (fd != -1) 188 (void)close(fd); 189 (void)fprintf(stderr, "dumpfs: %s: %s\n", name, strerror(errno)); 190 return (1); 191 }; 192 193 int 194 dumpcg(name, fd, c) 195 char *name; 196 int fd, c; 197 { 198 off_t cur; 199 int i, j; 200 201 printf("\ncg %d:\n", c); 202 if ((cur = lseek(fd, (off_t)(fsbtodb(&afs, cgtod(&afs, c)) * dev_bsize), 203 SEEK_SET)) == (off_t)-1) 204 return (1); 205 if (read(fd, &acg, afs.fs_bsize) != afs.fs_bsize) { 206 (void)fprintf(stderr, "dumpfs: %s: error reading cg\n", name); 207 return (1); 208 } 209 printf("magic\t%x\ttell\t%qx\ttime\t%s", 210 afs.fs_postblformat == FS_42POSTBLFMT ? 211 ((struct ocg *)&acg)->cg_magic : acg.cg_magic, 212 cur, ctime(&acg.cg_time)); 213 printf("cgx\t%d\tncyl\t%d\tniblk\t%d\tndblk\t%d\n", 214 acg.cg_cgx, acg.cg_ncyl, acg.cg_niblk, acg.cg_ndblk); 215 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n", 216 acg.cg_cs.cs_nbfree, acg.cg_cs.cs_ndir, 217 acg.cg_cs.cs_nifree, acg.cg_cs.cs_nffree); 218 printf("rotor\t%d\tirotor\t%d\tfrotor\t%d\nfrsum", 219 acg.cg_rotor, acg.cg_irotor, acg.cg_frotor); 220 for (i = 1, j = 0; i < afs.fs_frag; i++) { 221 printf("\t%d", acg.cg_frsum[i]); 222 j += i * acg.cg_frsum[i]; 223 } 224 printf("\nsum of frsum: %d", j); 225 if (afs.fs_contigsumsize > 0) { 226 for (i = 1; i < afs.fs_contigsumsize; i++) { 227 if ((i - 1) % 8 == 0) 228 printf("\nclusters %d-%d:", i, 229 afs.fs_contigsumsize - 1 < i + 7 ? 230 afs.fs_contigsumsize - 1 : i + 7); 231 printf("\t%d", cg_clustersum(&acg)[i]); 232 } 233 printf("\nclusters size %d and over: %d\n", 234 afs.fs_contigsumsize, 235 cg_clustersum(&acg)[afs.fs_contigsumsize]); 236 printf("clusters free:\t"); 237 pbits(cg_clustersfree(&acg), acg.cg_nclusterblks); 238 } else 239 printf("\n"); 240 printf("iused:\t"); 241 pbits(cg_inosused(&acg), afs.fs_ipg); 242 printf("free:\t"); 243 pbits(cg_blksfree(&acg), afs.fs_fpg); 244 printf("b:\n"); 245 for (i = 0; i < afs.fs_cpg; i++) { 246 if (cg_blktot(&acg)[i] == 0) 247 continue; 248 printf(" c%d:\t(%d)\t", i, cg_blktot(&acg)[i]); 249 for (j = 0; j < afs.fs_nrpos; j++) { 250 if (afs.fs_cpc > 0 && 251 fs_postbl(&afs, i % afs.fs_cpc)[j] == -1) 252 continue; 253 printf(" %d", cg_blks(&afs, &acg, i)[j]); 254 } 255 printf("\n"); 256 } 257 return (0); 258 }; 259 260 void 261 pbits(vp, max) 262 register void *vp; 263 int max; 264 { 265 register int i; 266 register char *p; 267 int count, j; 268 269 for (count = i = 0, p = vp; i < max; i++) 270 if (isset(p, i)) { 271 if (count) 272 printf(",%s", count % 6 ? " " : "\n\t"); 273 count++; 274 printf("%d", i); 275 j = i; 276 while ((i+1)<max && isset(p, i+1)) 277 i++; 278 if (i != j) 279 printf("-%d", i); 280 } 281 printf("\n"); 282 } 283 284 void 285 usage() 286 { 287 (void)fprintf(stderr, "usage: dumpfs filesys | device\n"); 288 exit(1); 289 } 290