1 /* $NetBSD: dumpfs.c,v 1.18 1998/08/27 20:31:00 ross Exp $ */ 2 3 /* 4 * Copyright (c) 1983, 1992, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. All advertising materials mentioning features or use of this software 16 * must display the following acknowledgement: 17 * This product includes software developed by the University of 18 * California, Berkeley and its contributors. 19 * 4. Neither the name of the University nor the names of its contributors 20 * may be used to endorse or promote products derived from this software 21 * without specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 */ 35 36 #include <sys/cdefs.h> 37 #ifndef lint 38 __COPYRIGHT("@(#) Copyright (c) 1983, 1992, 1993\n\ 39 The Regents of the University of California. All rights reserved.\n"); 40 #endif /* not lint */ 41 42 #ifndef lint 43 #if 0 44 static char sccsid[] = "@(#)dumpfs.c 8.5 (Berkeley) 4/29/95"; 45 #else 46 __RCSID("$NetBSD: dumpfs.c,v 1.18 1998/08/27 20:31:00 ross Exp $"); 47 #endif 48 #endif /* not lint */ 49 50 #include <sys/param.h> 51 #include <sys/time.h> 52 53 #include <ufs/ufs/dinode.h> 54 #include <ufs/ufs/ufs_bswap.h> 55 #include <ufs/ffs/fs.h> 56 #include <ufs/ffs/ffs_extern.h> 57 58 #include <err.h> 59 #include <errno.h> 60 #include <fcntl.h> 61 #include <fstab.h> 62 #include <stdio.h> 63 #include <stdlib.h> 64 #include <string.h> 65 #include <unistd.h> 66 67 union { 68 struct fs fs; 69 char pad[MAXBSIZE]; 70 } fsun; 71 #define afs fsun.fs 72 73 union { 74 struct cg cg; 75 char pad[MAXBSIZE]; 76 } cgun; 77 #define acg cgun.cg 78 79 long dev_bsize = 1; 80 int needswap = 0; 81 82 int dumpfs __P((const char *)); 83 int dumpcg __P((const char *, int, int)); 84 int main __P((int, char **)); 85 void pbits __P((void *, int)); 86 void usage __P((void)); 87 void swap_cg __P((struct cg *)); 88 89 int 90 main(argc, argv) 91 int argc; 92 char *argv[]; 93 { 94 struct fstab *fs; 95 int ch, eval; 96 97 while ((ch = getopt(argc, argv, "")) != -1) 98 switch(ch) { 99 case '?': 100 default: 101 usage(); 102 } 103 argc -= optind; 104 argv += optind; 105 106 if (argc < 1) 107 usage(); 108 109 for (eval = 0; *argv; ++argv) 110 if ((fs = getfsfile(*argv)) == NULL) 111 eval |= dumpfs(*argv); 112 else 113 eval |= dumpfs(fs->fs_spec); 114 exit(eval); 115 } 116 117 int 118 dumpfs(name) 119 const char *name; 120 { 121 int fd, c, i, j, k, size; 122 123 if ((fd = open(name, O_RDONLY, 0)) < 0) 124 goto err; 125 if (lseek(fd, (off_t)SBOFF, SEEK_SET) == (off_t)-1) 126 goto err; 127 if (read(fd, &afs, SBSIZE) != SBSIZE) 128 goto err; 129 130 if (afs.fs_magic != FS_MAGIC) { 131 if (afs.fs_magic == bswap32(FS_MAGIC)) { 132 ffs_sb_swap(&afs, &afs, 0); 133 needswap = 1; 134 } else { 135 warnx("%s: superblock has bad magic number, skipped", name); 136 (void)close(fd); 137 return (1); 138 } 139 } 140 #if BYTE_ORDER == LITTLE_ENDIAN 141 if (needswap) 142 #else 143 if (!needswap) 144 #endif 145 printf("Endian big-endian "); 146 else 147 printf("Endian little-endian "); 148 if (afs.fs_postblformat == FS_42POSTBLFMT) 149 afs.fs_nrpos = 8; 150 dev_bsize = afs.fs_fsize / fsbtodb(&afs, 1); 151 printf("magic\t%x\ttime\t%s", afs.fs_magic, 152 ctime(&afs.fs_time)); 153 i = 0; 154 if (afs.fs_postblformat != FS_42POSTBLFMT) { 155 i++; 156 if (afs.fs_inodefmt >= FS_44INODEFMT) { 157 int max; 158 159 i++; 160 max = afs.fs_maxcontig; 161 size = afs.fs_contigsumsize; 162 if ((max < 2 && size == 0) 163 || (max > 1 && size >= MIN(max, FS_MAXCONTIG))) 164 i++; 165 } 166 } 167 printf("cylgrp\t%s\tinodes\t%s\tfslevel %d\n", 168 i < 1 ? "static" : "dynamic", i < 2 ? "4.2/4.3BSD" : "4.4BSD", i); 169 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n", 170 afs.fs_cstotal.cs_nbfree, afs.fs_cstotal.cs_ndir, 171 afs.fs_cstotal.cs_nifree, afs.fs_cstotal.cs_nffree); 172 printf("ncg\t%d\tncyl\t%d\tsize\t%d\tblocks\t%d\n", 173 afs.fs_ncg, afs.fs_ncyl, afs.fs_size, afs.fs_dsize); 174 printf("bsize\t%d\tshift\t%d\tmask\t0x%08x\n", 175 afs.fs_bsize, afs.fs_bshift, afs.fs_bmask); 176 printf("fsize\t%d\tshift\t%d\tmask\t0x%08x\n", 177 afs.fs_fsize, afs.fs_fshift, afs.fs_fmask); 178 printf("frag\t%d\tshift\t%d\tfsbtodb\t%d\n", 179 afs.fs_frag, afs.fs_fragshift, afs.fs_fsbtodb); 180 printf("cpg\t%d\tbpg\t%d\tfpg\t%d\tipg\t%d\n", 181 afs.fs_cpg, afs.fs_fpg / afs.fs_frag, afs.fs_fpg, afs.fs_ipg); 182 printf("minfree\t%d%%\toptim\t%s\tmaxcontig %d\tmaxbpg\t%d\n", 183 afs.fs_minfree, afs.fs_optim == FS_OPTSPACE ? "space" : "time", 184 afs.fs_maxcontig, afs.fs_maxbpg); 185 printf("rotdelay %dms\theadswitch %dus\ttrackseek %dus\trps\t%d\n", 186 afs.fs_rotdelay, afs.fs_headswitch, afs.fs_trkseek, afs.fs_rps); 187 printf("ntrak\t%d\tnsect\t%d\tnpsect\t%d\tspc\t%d\n", 188 afs.fs_ntrak, afs.fs_nsect, afs.fs_npsect, afs.fs_spc); 189 printf("symlinklen %d\ttrackskew %d\tinterleave %d\tcontigsumsize %d\n", 190 afs.fs_maxsymlinklen, afs.fs_trackskew, afs.fs_interleave, 191 afs.fs_contigsumsize); 192 printf("nindir\t%d\tinopb\t%d\tnspf\t%d\n", 193 afs.fs_nindir, afs.fs_inopb, afs.fs_nspf); 194 printf("sblkno\t%d\tcblkno\t%d\tiblkno\t%d\tdblkno\t%d\n", 195 afs.fs_sblkno, afs.fs_cblkno, afs.fs_iblkno, afs.fs_dblkno); 196 printf("sbsize\t%d\tcgsize\t%d\tcgoffset %d\tcgmask\t0x%08x\n", 197 afs.fs_sbsize, afs.fs_cgsize, afs.fs_cgoffset, afs.fs_cgmask); 198 printf("csaddr\t%d\tcssize\t%d\tshift\t%d\tmask\t0x%08x\n", 199 afs.fs_csaddr, afs.fs_cssize, afs.fs_csshift, afs.fs_csmask); 200 printf("cgrotor\t%d\tfmod\t%d\tronly\t%d\tclean\t0x%02x\n", 201 afs.fs_cgrotor, afs.fs_fmod, afs.fs_ronly, afs.fs_clean); 202 if (afs.fs_cpc != 0) 203 printf("blocks available in each of %d rotational positions", 204 afs.fs_nrpos); 205 else 206 printf("insufficient space to maintain rotational tables\n"); 207 for (c = 0; c < afs.fs_cpc; c++) { 208 printf("\ncylinder number %d:", c); 209 for (i = 0; i < afs.fs_nrpos; i++) { 210 if (fs_postbl(&afs, c)[i] == -1) 211 continue; 212 printf("\n position %d:\t", i); 213 for (j = fs_postbl(&afs, c)[i], k = 1; ; 214 j += fs_rotbl(&afs)[j], k++) { 215 printf("%5d", j); 216 if (k % 12 == 0) 217 printf("\n\t\t"); 218 if (fs_rotbl(&afs)[j] == 0) 219 break; 220 } 221 } 222 } 223 printf("\ncs[].cs_(nbfree,ndir,nifree,nffree):\n\t"); 224 for (i = 0, j = 0; i < afs.fs_cssize; i += afs.fs_bsize, j++) { 225 size = afs.fs_cssize - i < afs.fs_bsize ? 226 afs.fs_cssize - i : afs.fs_bsize; 227 afs.fs_csp[j] = calloc(1, size); 228 if (lseek(fd, 229 (off_t)(fsbtodb(&afs, (afs.fs_csaddr + j * afs.fs_frag))) * 230 dev_bsize, SEEK_SET) == (off_t)-1) 231 goto err; 232 if (read(fd, afs.fs_csp[j], size) != size) 233 goto err; 234 if (needswap) 235 ffs_csum_swap(afs.fs_csp[j], afs.fs_csp[j], size); 236 } 237 for (i = 0; i < afs.fs_ncg; i++) { 238 struct csum *cs = &afs.fs_cs(&afs, i); 239 if (i && i % 4 == 0) 240 printf("\n\t"); 241 printf("(%d,%d,%d,%d) ", 242 cs->cs_nbfree, cs->cs_ndir, cs->cs_nifree, cs->cs_nffree); 243 } 244 printf("\n"); 245 if (afs.fs_ncyl % afs.fs_cpg) { 246 printf("cylinders in last group %d\n", 247 i = afs.fs_ncyl % afs.fs_cpg); 248 printf("blocks in last group %d\n", 249 i * afs.fs_spc / NSPB(&afs)); 250 } 251 printf("\n"); 252 for (i = 0; i < afs.fs_ncg; i++) 253 if (dumpcg(name, fd, i)) 254 goto err; 255 (void)close(fd); 256 return (0); 257 258 err: if (fd != -1) 259 (void)close(fd); 260 warn("%s", name); 261 return (1); 262 }; 263 264 int 265 dumpcg(name, fd, c) 266 const char *name; 267 int fd, c; 268 { 269 off_t cur; 270 int i, j; 271 272 printf("\ncg %d:\n", c); 273 if ((cur = lseek(fd, (off_t)(fsbtodb(&afs, cgtod(&afs, c))) * dev_bsize, 274 SEEK_SET)) == (off_t)-1) 275 return (1); 276 if (read(fd, &acg, afs.fs_bsize) != afs.fs_bsize) { 277 warnx("%s: error reading cg", name); 278 return (1); 279 } 280 if (needswap) 281 swap_cg(&acg); 282 printf("magic\t%x\ttell\t%qx\ttime\t%s", 283 afs.fs_postblformat == FS_42POSTBLFMT ? 284 ((struct ocg *)&acg)->cg_magic : acg.cg_magic, 285 (long long)cur, ctime(&acg.cg_time)); 286 printf("cgx\t%d\tncyl\t%d\tniblk\t%d\tndblk\t%d\n", 287 acg.cg_cgx, acg.cg_ncyl, acg.cg_niblk, acg.cg_ndblk); 288 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n", 289 acg.cg_cs.cs_nbfree, acg.cg_cs.cs_ndir, 290 acg.cg_cs.cs_nifree, acg.cg_cs.cs_nffree); 291 printf("rotor\t%d\tirotor\t%d\tfrotor\t%d\nfrsum", 292 acg.cg_rotor, acg.cg_irotor, acg.cg_frotor); 293 for (i = 1, j = 0; i < afs.fs_frag; i++) { 294 printf("\t%d", acg.cg_frsum[i]); 295 j += i * acg.cg_frsum[i]; 296 } 297 printf("\nsum of frsum: %d", j); 298 if (afs.fs_contigsumsize > 0) { 299 for (i = 1; i < afs.fs_contigsumsize; i++) { 300 if ((i - 1) % 8 == 0) 301 printf("\nclusters %d-%d:", i, 302 afs.fs_contigsumsize - 1 < i + 7 ? 303 afs.fs_contigsumsize - 1 : i + 7); 304 printf("\t%d", cg_clustersum(&acg, 0)[i]); 305 } 306 printf("\nclusters size %d and over: %d\n", 307 afs.fs_contigsumsize, 308 cg_clustersum(&acg, 0)[afs.fs_contigsumsize]); 309 printf("clusters free:\t"); 310 pbits(cg_clustersfree(&acg, 0), acg.cg_nclusterblks); 311 } else 312 printf("\n"); 313 printf("iused:\t"); 314 pbits(cg_inosused(&acg, 0), afs.fs_ipg); 315 printf("free:\t"); 316 pbits(cg_blksfree(&acg, 0), afs.fs_fpg); 317 printf("b:\n"); 318 for (i = 0; i < afs.fs_cpg; i++) { 319 if (cg_blktot(&acg, 0)[i] == 0) 320 continue; 321 printf(" c%d:\t(%d)\t", i, cg_blktot(&acg, 0)[i]); 322 for (j = 0; j < afs.fs_nrpos; j++) { 323 if (afs.fs_cpc > 0 && 324 fs_postbl(&afs, i % afs.fs_cpc)[j] == -1) 325 continue; 326 printf(" %d", cg_blks(&afs, &acg, i, 0)[j]); 327 } 328 printf("\n"); 329 } 330 return (0); 331 }; 332 333 void 334 pbits(vp, max) 335 void *vp; 336 int max; 337 { 338 int i; 339 char *p; 340 int count, j; 341 342 for (count = i = 0, p = vp; i < max; i++) 343 if (isset(p, i)) { 344 if (count) 345 printf(",%s", count % 6 ? " " : "\n\t"); 346 count++; 347 printf("%d", i); 348 j = i; 349 while ((i+1)<max && isset(p, i+1)) 350 i++; 351 if (i != j) 352 printf("-%d", i); 353 } 354 printf("\n"); 355 } 356 357 void 358 usage() 359 { 360 361 (void)fprintf(stderr, "usage: dumpfs filesys | device\n"); 362 exit(1); 363 } 364 365 void 366 swap_cg(cg) 367 struct cg *cg; 368 { 369 int i; 370 u_int32_t *n32; 371 u_int16_t *n16; 372 373 cg->cg_firstfield = bswap32(cg->cg_firstfield); 374 cg->cg_magic = bswap32(cg->cg_magic); 375 cg->cg_time = bswap32(cg->cg_time); 376 cg->cg_cgx = bswap32(cg->cg_cgx); 377 cg->cg_ncyl = bswap16(cg->cg_ncyl); 378 cg->cg_niblk = bswap16(cg->cg_niblk); 379 cg->cg_ndblk = bswap32(cg->cg_ndblk); 380 cg->cg_cs.cs_ndir = bswap32(cg->cg_cs.cs_ndir); 381 cg->cg_cs.cs_nbfree = bswap32(cg->cg_cs.cs_nbfree); 382 cg->cg_cs.cs_nifree = bswap32(cg->cg_cs.cs_nifree); 383 cg->cg_cs.cs_nffree = bswap32(cg->cg_cs.cs_nffree); 384 cg->cg_rotor = bswap32(cg->cg_rotor); 385 cg->cg_frotor = bswap32(cg->cg_frotor); 386 cg->cg_irotor = bswap32(cg->cg_irotor); 387 cg->cg_btotoff = bswap32(cg->cg_btotoff); 388 cg->cg_boff = bswap32(cg->cg_boff); 389 cg->cg_iusedoff = bswap32(cg->cg_iusedoff); 390 cg->cg_freeoff = bswap32(cg->cg_freeoff); 391 cg->cg_nextfreeoff = bswap32(cg->cg_nextfreeoff); 392 cg->cg_clustersumoff = bswap32(cg->cg_clustersumoff); 393 cg->cg_clusteroff = bswap32(cg->cg_clusteroff); 394 cg->cg_nclusterblks = bswap32(cg->cg_nclusterblks); 395 for (i=0; i < MAXFRAG; i++) 396 cg->cg_frsum[i] = bswap32(cg->cg_frsum[i]); 397 398 if (afs.fs_postblformat == FS_42POSTBLFMT) { /* old format */ 399 struct ocg *ocg; 400 int j; 401 ocg = (struct ocg *)cg; 402 for(i = 0; i < 8; i++) { 403 ocg->cg_frsum[i] = bswap32(ocg->cg_frsum[i]); 404 } 405 for(i = 0; i < 32; i++) { 406 ocg->cg_btot[i] = bswap32(ocg->cg_btot[i]); 407 for (j = 0; j < 8; j++) 408 ocg->cg_b[i][j] = bswap16(ocg->cg_b[i][j]); 409 } 410 ocg->cg_magic = bswap32(ocg->cg_magic); 411 } else { /* new format */ 412 if (cg->cg_magic == CG_MAGIC) { 413 n32 = (u_int32_t*)((u_int8_t*)cg + cg->cg_btotoff); 414 n16 = (u_int16_t*)((u_int8_t*)cg + cg->cg_boff); 415 } else { 416 n32 = (u_int32_t*)((u_int8_t*)cg + bswap32(cg->cg_btotoff)); 417 n16 = (u_int16_t*)((u_int8_t*)cg + bswap32(cg->cg_boff)); 418 } 419 for (i=0; i< afs.fs_cpg; i++) 420 n32[i] = bswap32(n32[i]); 421 422 for (i=0; i < afs.fs_cpg * afs.fs_nrpos; i++) 423 n16[i] = bswap16(n16[i]); 424 425 if (cg->cg_magic == CG_MAGIC) { 426 n32 = (u_int32_t*)((u_int8_t*)cg + cg->cg_clustersumoff); 427 } else { 428 n32 = (u_int32_t*)((u_int8_t*)cg + cg->cg_clustersumoff); 429 } 430 for (i = 0; i < afs.fs_contigsumsize + 1; i++) 431 n32[i] = bswap32(n32[i]); 432 } 433 } 434