sbin/dumpfs/dumpfs.c

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