dumpfs.c revision 1.21.4.6
1 /* $NetBSD: dumpfs.c,v 1.21.4.6 2001/11/25 19:58:53 he 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.21.4.6 2001/11/25 19:58:53 he Exp $"); 47 #endif 48 #endif /* not lint */ 49 50 #include <sys/param.h> 51 #include <sys/time.h> 52 53 #include <ufs/ufs/ufs_bswap.h> 54 #include <ufs/ffs/fs.h> 55 #include <ufs/ffs/ffs_extern.h> 56 57 #include <err.h> 58 #include <fcntl.h> 59 #include <fstab.h> 60 #include <stdio.h> 61 #include <stdlib.h> 62 #include <unistd.h> 63 64 union { 65 struct fs fs; 66 char pad[MAXBSIZE]; 67 } fsun; 68 #define afs fsun.fs 69 70 union { 71 struct cg cg; 72 char pad[MAXBSIZE]; 73 } cgun; 74 #define acg cgun.cg 75 76 long dev_bsize = 1; 77 int needswap = 0; 78 79 int dumpfs __P((const char *)); 80 int dumpcg __P((const char *, int, int)); 81 int main __P((int, char **)); 82 void pbits __P((void *, int)); 83 void usage __P((void)); 84 void swap_cg __P((struct cg *)); 85 86 int 87 main(argc, argv) 88 int argc; 89 char *argv[]; 90 { 91 struct fstab *fs; 92 int ch, eval; 93 94 while ((ch = getopt(argc, argv, "")) != -1) 95 switch(ch) { 96 case '?': 97 default: 98 usage(); 99 } 100 argc -= optind; 101 argv += optind; 102 103 if (argc < 1) 104 usage(); 105 106 for (eval = 0; *argv; ++argv) 107 if ((fs = getfsfile(*argv)) == NULL) 108 eval |= dumpfs(*argv); 109 else 110 eval |= dumpfs(fs->fs_spec); 111 exit(eval); 112 } 113 114 int 115 dumpfs(name) 116 const char *name; 117 { 118 int fd, c, i, j, k, size; 119 time_t t; 120 struct csum *ccsp; 121 122 if ((fd = open(name, O_RDONLY, 0)) < 0) 123 goto err; 124 if (lseek(fd, (off_t)SBOFF, SEEK_SET) == (off_t)-1) 125 goto err; 126 if (read(fd, &afs, SBSIZE) != SBSIZE) 127 goto err; 128 129 if (afs.fs_magic != FS_MAGIC) { 130 if (afs.fs_magic == bswap32(FS_MAGIC)) { 131 ffs_sb_swap(&afs, &afs); 132 needswap = 1; 133 } else { 134 warnx("%s: superblock has bad magic number, skipped", name); 135 (void)close(fd); 136 return (1); 137 } 138 } 139 #if BYTE_ORDER == LITTLE_ENDIAN 140 if (needswap) 141 #else 142 if (!needswap) 143 #endif 144 printf("endian\tbig-endian\n"); 145 else 146 printf("endian\tlittle-endian\n"); 147 if (afs.fs_postblformat == FS_42POSTBLFMT) 148 afs.fs_nrpos = 8; 149 dev_bsize = afs.fs_fsize / fsbtodb(&afs, 1); 150 t = afs.fs_time; 151 printf("magic\t%x\ttime\t%s", afs.fs_magic, 152 ctime(&t)); 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("id\t[ %x %x ]\n", afs.fs_id[0], afs.fs_id[1]); 168 printf("cylgrp\t%s\tinodes\t%s\tfslevel %d\tsoftdep %sabled\n", 169 i < 1 ? "static" : "dynamic", i < 2 ? "4.2/4.3BSD" : "4.4BSD", i, 170 (afs.fs_flags & FS_DOSOFTDEP) ? "en" : "dis"); 171 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n", 172 afs.fs_cstotal.cs_nbfree, afs.fs_cstotal.cs_ndir, 173 afs.fs_cstotal.cs_nifree, afs.fs_cstotal.cs_nffree); 174 printf("ncg\t%d\tncyl\t%d\tsize\t%d\tblocks\t%d\n", 175 afs.fs_ncg, afs.fs_ncyl, afs.fs_size, afs.fs_dsize); 176 printf("bsize\t%d\tshift\t%d\tmask\t0x%08x\n", 177 afs.fs_bsize, afs.fs_bshift, afs.fs_bmask); 178 printf("fsize\t%d\tshift\t%d\tmask\t0x%08x\n", 179 afs.fs_fsize, afs.fs_fshift, afs.fs_fmask); 180 printf("frag\t%d\tshift\t%d\tfsbtodb\t%d\n", 181 afs.fs_frag, afs.fs_fragshift, afs.fs_fsbtodb); 182 printf("cpg\t%d\tbpg\t%d\tfpg\t%d\tipg\t%d\n", 183 afs.fs_cpg, afs.fs_fpg / afs.fs_frag, afs.fs_fpg, afs.fs_ipg); 184 printf("minfree\t%d%%\toptim\t%s\tmaxcontig %d\tmaxbpg\t%d\n", 185 afs.fs_minfree, afs.fs_optim == FS_OPTSPACE ? "space" : "time", 186 afs.fs_maxcontig, afs.fs_maxbpg); 187 printf("rotdelay %dms\trps\t%d\n", 188 afs.fs_rotdelay, afs.fs_rps); 189 printf("ntrak\t%d\tnsect\t%d\tnpsect\t%d\tspc\t%d\n", 190 afs.fs_ntrak, afs.fs_nsect, afs.fs_npsect, afs.fs_spc); 191 printf("symlinklen %d\ttrackskew %d\tinterleave %d\tcontigsumsize %d\n", 192 afs.fs_maxsymlinklen, afs.fs_trackskew, afs.fs_interleave, 193 afs.fs_contigsumsize); 194 printf("maxfilesize 0x%016llx\n", 195 (unsigned long long)afs.fs_maxfilesize); 196 printf("nindir\t%d\tinopb\t%d\tnspf\t%d\n", 197 afs.fs_nindir, afs.fs_inopb, afs.fs_nspf); 198 printf("avgfilesize %d\tavgfpdir %d\n", 199 afs.fs_avgfilesize, afs.fs_avgfpdir); 200 printf("sblkno\t%d\tcblkno\t%d\tiblkno\t%d\tdblkno\t%d\n", 201 afs.fs_sblkno, afs.fs_cblkno, afs.fs_iblkno, afs.fs_dblkno); 202 printf("sbsize\t%d\tcgsize\t%d\toffset\t%d\tmask\t0x%08x\n", 203 afs.fs_sbsize, afs.fs_cgsize, afs.fs_cgoffset, afs.fs_cgmask); 204 printf("csaddr\t%d\tcssize\t%d\tshift\t%d\tmask\t0x%08x\n", 205 afs.fs_csaddr, afs.fs_cssize, afs.fs_csshift, afs.fs_csmask); 206 printf("cgrotor\t%d\tfmod\t%d\tronly\t%d\tclean\t0x%02x\n", 207 afs.fs_cgrotor, afs.fs_fmod, afs.fs_ronly, afs.fs_clean); 208 if (afs.fs_cpc != 0) 209 printf("blocks available in each of %d rotational positions", 210 afs.fs_nrpos); 211 else 212 printf("(no rotational position table)\n"); 213 for (c = 0; c < afs.fs_cpc; c++) { 214 printf("\ncylinder number %d:", c); 215 for (i = 0; i < afs.fs_nrpos; i++) { 216 if (fs_postbl(&afs, c)[i] == -1) 217 continue; 218 printf("\n position %d:\t", i); 219 for (j = fs_postbl(&afs, c)[i], k = 1; ; 220 j += fs_rotbl(&afs)[j], k++) { 221 printf("%5d", j); 222 if (k % 12 == 0) 223 printf("\n\t\t"); 224 if (fs_rotbl(&afs)[j] == 0) 225 break; 226 } 227 } 228 } 229 printf("\ncs[].cs_(nbfree,ndir,nifree,nffree):\n\t"); 230 afs.fs_csp = calloc(1, afs.fs_cssize); 231 for (i = 0, j = 0; i < afs.fs_cssize; i += afs.fs_bsize, j++) { 232 size = afs.fs_cssize - i < afs.fs_bsize ? 233 afs.fs_cssize - i : afs.fs_bsize; 234 ccsp = (struct csum *)((char *)afs.fs_csp + i); 235 if (lseek(fd, 236 (off_t)(fsbtodb(&afs, (afs.fs_csaddr + j * afs.fs_frag))) * 237 dev_bsize, SEEK_SET) == (off_t)-1) 238 goto err; 239 if (read(fd, ccsp, size) != size) 240 goto err; 241 if (needswap) 242 ffs_csum_swap(ccsp, ccsp, size); 243 } 244 for (i = 0; i < afs.fs_ncg; i++) { 245 struct csum *cs = &afs.fs_cs(&afs, i); 246 if (i && i % 4 == 0) 247 printf("\n\t"); 248 printf("(%d,%d,%d,%d) ", 249 cs->cs_nbfree, cs->cs_ndir, cs->cs_nifree, cs->cs_nffree); 250 } 251 printf("\n"); 252 if (afs.fs_ncyl % afs.fs_cpg) { 253 printf("cylinders in last group %d\n", 254 i = afs.fs_ncyl % afs.fs_cpg); 255 printf("blocks in last group %d\n", 256 i * afs.fs_spc / NSPB(&afs)); 257 } 258 printf("\n"); 259 for (i = 0; i < afs.fs_ncg; i++) 260 if (dumpcg(name, fd, i)) 261 goto err; 262 (void)close(fd); 263 return (0); 264 265 err: if (fd != -1) 266 (void)close(fd); 267 warn("%s", name); 268 return (1); 269 }; 270 271 int 272 dumpcg(name, fd, c) 273 const char *name; 274 int fd, c; 275 { 276 off_t cur; 277 int i, j; 278 time_t t; 279 280 printf("\ncg %d:\n", c); 281 if ((cur = lseek(fd, (off_t)(fsbtodb(&afs, cgtod(&afs, c))) * dev_bsize, 282 SEEK_SET)) == (off_t)-1) 283 return (1); 284 if (read(fd, &acg, afs.fs_bsize) != afs.fs_bsize) { 285 warnx("%s: error reading cg", name); 286 return (1); 287 } 288 if (needswap) 289 swap_cg(&acg); 290 t = acg.cg_time; 291 printf("magic\t%x\ttell\t%llx\ttime\t%s", 292 afs.fs_postblformat == FS_42POSTBLFMT ? 293 ((struct ocg *)&acg)->cg_magic : acg.cg_magic, 294 (long long)cur, ctime(&t)); 295 printf("cgx\t%d\tncyl\t%d\tniblk\t%d\tndblk\t%d\n", 296 acg.cg_cgx, acg.cg_ncyl, acg.cg_niblk, acg.cg_ndblk); 297 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n", 298 acg.cg_cs.cs_nbfree, acg.cg_cs.cs_ndir, 299 acg.cg_cs.cs_nifree, acg.cg_cs.cs_nffree); 300 printf("rotor\t%d\tirotor\t%d\tfrotor\t%d\nfrsum", 301 acg.cg_rotor, acg.cg_irotor, acg.cg_frotor); 302 for (i = 1, j = 0; i < afs.fs_frag; i++) { 303 printf("\t%d", acg.cg_frsum[i]); 304 j += i * acg.cg_frsum[i]; 305 } 306 printf("\nsum of frsum: %d", j); 307 if (afs.fs_contigsumsize > 0) { 308 for (i = 1; i < afs.fs_contigsumsize; i++) { 309 if ((i - 1) % 8 == 0) 310 printf("\nclusters %d-%d:", i, 311 afs.fs_contigsumsize - 1 < i + 7 ? 312 afs.fs_contigsumsize - 1 : i + 7); 313 printf("\t%d", cg_clustersum(&acg, 0)[i]); 314 } 315 printf("\nclusters size %d and over: %d\n", 316 afs.fs_contigsumsize, 317 cg_clustersum(&acg, 0)[afs.fs_contigsumsize]); 318 printf("clusters free:\t"); 319 pbits(cg_clustersfree(&acg, 0), acg.cg_nclusterblks); 320 } else 321 printf("\n"); 322 printf("iused:\t"); 323 pbits(cg_inosused(&acg, 0), afs.fs_ipg); 324 printf("free:\t"); 325 pbits(cg_blksfree(&acg, 0), afs.fs_fpg); 326 printf("b:\n"); 327 for (i = 0; i < afs.fs_cpg; i++) { 328 if (cg_blktot(&acg, 0)[i] == 0) 329 continue; 330 printf(" c%d:\t(%d)\t", i, cg_blktot(&acg, 0)[i]); 331 for (j = 0; j < afs.fs_nrpos; j++) { 332 if (afs.fs_cpc > 0 && 333 fs_postbl(&afs, i % afs.fs_cpc)[j] == -1) 334 continue; 335 printf(" %d", cg_blks(&afs, &acg, i, 0)[j]); 336 } 337 printf("\n"); 338 } 339 return (0); 340 }; 341 342 void 343 pbits(vp, max) 344 void *vp; 345 int max; 346 { 347 int i; 348 char *p; 349 int count, j; 350 351 for (count = i = 0, p = vp; i < max; i++) 352 if (isset(p, i)) { 353 if (count) 354 printf(",%s", count % 6 ? " " : "\n\t"); 355 count++; 356 printf("%d", i); 357 j = i; 358 while ((i+1)<max && isset(p, i+1)) 359 i++; 360 if (i != j) 361 printf("-%d", i); 362 } 363 printf("\n"); 364 } 365 366 void 367 usage() 368 { 369 370 (void)fprintf(stderr, "usage: dumpfs filesys | device\n"); 371 exit(1); 372 } 373 374 void 375 swap_cg(cg) 376 struct cg *cg; 377 { 378 int i; 379 u_int32_t *n32; 380 u_int16_t *n16; 381 382 cg->cg_firstfield = bswap32(cg->cg_firstfield); 383 cg->cg_magic = bswap32(cg->cg_magic); 384 cg->cg_time = bswap32(cg->cg_time); 385 cg->cg_cgx = bswap32(cg->cg_cgx); 386 cg->cg_ncyl = bswap16(cg->cg_ncyl); 387 cg->cg_niblk = bswap16(cg->cg_niblk); 388 cg->cg_ndblk = bswap32(cg->cg_ndblk); 389 cg->cg_cs.cs_ndir = bswap32(cg->cg_cs.cs_ndir); 390 cg->cg_cs.cs_nbfree = bswap32(cg->cg_cs.cs_nbfree); 391 cg->cg_cs.cs_nifree = bswap32(cg->cg_cs.cs_nifree); 392 cg->cg_cs.cs_nffree = bswap32(cg->cg_cs.cs_nffree); 393 cg->cg_rotor = bswap32(cg->cg_rotor); 394 cg->cg_frotor = bswap32(cg->cg_frotor); 395 cg->cg_irotor = bswap32(cg->cg_irotor); 396 cg->cg_btotoff = bswap32(cg->cg_btotoff); 397 cg->cg_boff = bswap32(cg->cg_boff); 398 cg->cg_iusedoff = bswap32(cg->cg_iusedoff); 399 cg->cg_freeoff = bswap32(cg->cg_freeoff); 400 cg->cg_nextfreeoff = bswap32(cg->cg_nextfreeoff); 401 cg->cg_clustersumoff = bswap32(cg->cg_clustersumoff); 402 cg->cg_clusteroff = bswap32(cg->cg_clusteroff); 403 cg->cg_nclusterblks = bswap32(cg->cg_nclusterblks); 404 for (i=0; i < MAXFRAG; i++) 405 cg->cg_frsum[i] = bswap32(cg->cg_frsum[i]); 406 407 if (afs.fs_postblformat == FS_42POSTBLFMT) { /* old format */ 408 struct ocg *ocg; 409 int j; 410 ocg = (struct ocg *)cg; 411 for(i = 0; i < 8; i++) { 412 ocg->cg_frsum[i] = bswap32(ocg->cg_frsum[i]); 413 } 414 for(i = 0; i < 32; i++) { 415 ocg->cg_btot[i] = bswap32(ocg->cg_btot[i]); 416 for (j = 0; j < 8; j++) 417 ocg->cg_b[i][j] = bswap16(ocg->cg_b[i][j]); 418 } 419 ocg->cg_magic = bswap32(ocg->cg_magic); 420 } else { /* new format */ 421 if (cg->cg_magic == CG_MAGIC) { 422 n32 = (u_int32_t*)((u_int8_t*)cg + cg->cg_btotoff); 423 n16 = (u_int16_t*)((u_int8_t*)cg + cg->cg_boff); 424 } else { 425 n32 = (u_int32_t*)((u_int8_t*)cg + bswap32(cg->cg_btotoff)); 426 n16 = (u_int16_t*)((u_int8_t*)cg + bswap32(cg->cg_boff)); 427 } 428 for (i=0; i< afs.fs_cpg; i++) 429 n32[i] = bswap32(n32[i]); 430 431 for (i=0; i < afs.fs_cpg * afs.fs_nrpos; i++) 432 n16[i] = bswap16(n16[i]); 433 434 if (cg->cg_magic == CG_MAGIC) { 435 n32 = (u_int32_t*)((u_int8_t*)cg + cg->cg_clustersumoff); 436 } else { 437 n32 = (u_int32_t*)((u_int8_t*)cg + cg->cg_clustersumoff); 438 } 439 for (i = 0; i < afs.fs_contigsumsize + 1; i++) 440 n32[i] = bswap32(n32[i]); 441 } 442 } 443
Indexes created Wed Oct 15 03:09:54 GMT 2025