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