1 /* 2 * Copyright (c) 2002 Networks Associates Technology, Inc. 3 * All rights reserved. 4 * 5 * This software was developed for the FreeBSD Project by Marshall 6 * Kirk McKusick and Network Associates Laboratories, the Security 7 * Research Division of Network Associates, Inc. under DARPA/SPAWAR 8 * contract N66001-01-C-8035 ("CBOSS"), as part of the DARPA CHATS 9 * research program 10 * 11 * Copyright (c) 1982, 1989, 1993 12 * The Regents of the University of California. All rights reserved. 13 * (c) UNIX System Laboratories, Inc. 14 * Copyright (c) 1983, 1992, 1993 15 * The Regents of the University of California. All rights reserved. 16 * 17 * Redistribution and use in source and binary forms, with or without 18 * modification, are permitted provided that the following conditions 19 * are met: 20 * 1. Redistributions of source code must retain the above copyright 21 * notice, this list of conditions and the following disclaimer. 22 * 2. Redistributions in binary form must reproduce the above copyright 23 * notice, this list of conditions and the following disclaimer in the 24 * documentation and/or other materials provided with the distribution. 25 * 3. All advertising materials mentioning features or use of this software 26 * must display the following acknowledgement: 27 * This product includes software developed by the University of 28 * California, Berkeley and its contributors. 29 * 4. Neither the name of the University nor the names of its contributors 30 * may be used to endorse or promote products derived from this software 31 * without specific prior written permission. 32 * 33 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 34 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 35 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 36 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 37 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 38 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 39 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 40 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 41 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 42 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 43 * SUCH DAMAGE. 44 */ 45 46 #ifndef lint 47 static const char copyright[] = 48 "@(#) Copyright (c) 1983, 1992, 1993\n\ 49 The Regents of the University of California. All rights reserved.\n"; 50 #endif /* not lint */ 51 52 #ifndef lint 53 #if 0 54 static char sccsid[] = "@(#)dumpfs.c 8.5 (Berkeley) 4/29/95"; 55 #endif 56 static const char rcsid[] = 57 "$FreeBSD$"; 58 #endif /* not lint */ 59 60 #include <sys/param.h> 61 #include <sys/time.h> 62 #include <sys/disklabel.h> 63 64 #include <ufs/ufs/dinode.h> 65 #include <ufs/ffs/fs.h> 66 67 #include <err.h> 68 #include <fcntl.h> 69 #include <fstab.h> 70 #include <libufs.h> 71 #include <stdio.h> 72 #include <stdlib.h> 73 #include <unistd.h> 74 75 #define afs disk.d_fs 76 77 union { 78 struct cg cg; 79 char pad[MAXBSIZE]; 80 } cgun; 81 #define acg cgun.cg 82 83 struct uufsd disk; 84 85 int dumpfs(const char *); 86 int dumpcg(const char *, int, int); 87 void pbits(void *, int); 88 void usage(void) __dead2; 89 90 int 91 main(int argc, char *argv[]) 92 { 93 struct fstab *fs; 94 int ch, eval; 95 96 while ((ch = getopt(argc, argv, "")) != -1) 97 switch(ch) { 98 case '?': 99 default: 100 usage(); 101 } 102 argc -= optind; 103 argv += optind; 104 105 if (argc < 1) 106 usage(); 107 108 for (eval = 0; *argv; ++argv) 109 if ((fs = getfsfile(*argv)) == NULL) 110 eval |= dumpfs(*argv); 111 else 112 eval |= dumpfs(fs->fs_spec); 113 exit(eval); 114 } 115 116 int 117 dumpfs(const char *name) 118 { 119 time_t time; 120 int64_t fssize; 121 int i; 122 123 if (ufs_disk_fillout(&disk, name) == -1) 124 goto err; 125 126 if (afs.fs_magic == FS_UFS2_MAGIC) { 127 fssize = afs.fs_size; 128 time = afs.fs_time; 129 printf("magic\t%x (UFS2)\ttime\t%s", 130 afs.fs_magic, ctime(&time)); 131 printf("offset\t%qd\tid\t[ %x %x ]\n", 132 afs.fs_sblockloc, afs.fs_id[0], afs.fs_id[1]); 133 printf("ncg\t%d\tsize\t%qd\tblocks\t%d\n", 134 afs.fs_ncg, fssize, afs.fs_dsize); 135 } else { 136 fssize = afs.fs_old_size; 137 printf("magic\t%x (UFS1)\ttime\t%s", 138 afs.fs_magic, ctime(&afs.fs_old_time)); 139 printf("id\t[ %x %x ]\n", afs.fs_id[0], afs.fs_id[1]); 140 printf("ncg\t%d\tsize\t%qd\tblocks\t%d\n", 141 afs.fs_ncg, fssize, afs.fs_dsize); 142 } 143 printf("bsize\t%d\tshift\t%d\tmask\t0x%08x\n", 144 afs.fs_bsize, afs.fs_bshift, afs.fs_bmask); 145 printf("fsize\t%d\tshift\t%d\tmask\t0x%08x\n", 146 afs.fs_fsize, afs.fs_fshift, afs.fs_fmask); 147 printf("frag\t%d\tshift\t%d\tfsbtodb\t%d\n", 148 afs.fs_frag, afs.fs_fragshift, afs.fs_fsbtodb); 149 printf("minfree\t%d%%\toptim\t%s\tsymlinklen %d\n", 150 afs.fs_minfree, afs.fs_optim == FS_OPTSPACE ? "space" : "time", 151 afs.fs_maxsymlinklen); 152 if (afs.fs_magic == FS_UFS2_MAGIC) { 153 printf("%s %d\tmaxbpg\t%d\tmaxcontig %d\tcontigsumsize %d\n", 154 "maxbsize", afs.fs_maxbsize, afs.fs_maxbpg, 155 afs.fs_maxcontig, afs.fs_contigsumsize); 156 printf("nbfree\t%qd\tndir\t%qd\tnifree\t%qd\tnffree\t%qd\n", 157 afs.fs_cstotal.cs_nbfree, afs.fs_cstotal.cs_ndir, 158 afs.fs_cstotal.cs_nifree, afs.fs_cstotal.cs_nffree); 159 printf("bpg\t%d\tfpg\t%d\tipg\t%d\n", 160 afs.fs_fpg / afs.fs_frag, afs.fs_fpg, afs.fs_ipg); 161 printf("nindir\t%d\tinopb\t%d\tmaxfilesize\t%qu\n", 162 afs.fs_nindir, afs.fs_inopb, afs.fs_maxfilesize); 163 printf("sbsize\t%d\tcgsize\t%d\tcsaddr\t%d\tcssize\t%d\n", 164 afs.fs_sbsize, afs.fs_cgsize, afs.fs_csaddr, afs.fs_cssize); 165 } else { 166 printf("maxbpg\t%d\tmaxcontig %d\tcontigsumsize %d\n", 167 afs.fs_maxbpg, afs.fs_maxcontig, afs.fs_contigsumsize); 168 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n", 169 afs.fs_old_cstotal.cs_nbfree, afs.fs_old_cstotal.cs_ndir, 170 afs.fs_old_cstotal.cs_nifree, afs.fs_old_cstotal.cs_nffree); 171 printf("cpg\t%d\tbpg\t%d\tfpg\t%d\tipg\t%d\n", 172 afs.fs_old_cpg, afs.fs_fpg / afs.fs_frag, afs.fs_fpg, 173 afs.fs_ipg); 174 printf("nindir\t%d\tinopb\t%d\tnspf\t%d\tmaxfilesize\t%qu\n", 175 afs.fs_nindir, afs.fs_inopb, afs.fs_old_nspf, 176 afs.fs_maxfilesize); 177 printf("sbsize\t%d\tcgsize\t%d\tcgoffset %d\tcgmask\t0x%08x\n", 178 afs.fs_sbsize, afs.fs_cgsize, afs.fs_old_cgoffset, 179 afs.fs_old_cgmask); 180 printf("csaddr\t%d\tcssize\t%d\n", 181 afs.fs_old_csaddr, afs.fs_cssize); 182 printf("rotdelay %dms\trps\t%d\ttrackskew %d\tinterleave %d\n", 183 afs.fs_old_rotdelay, afs.fs_old_rps, afs.fs_old_trackskew, 184 afs.fs_old_interleave); 185 printf("nsect\t%d\tnpsect\t%d\tspc\t%d\n", 186 afs.fs_old_nsect, afs.fs_old_npsect, afs.fs_old_spc); 187 } 188 printf("sblkno\t%d\tcblkno\t%d\tiblkno\t%d\tdblkno\t%d\n", 189 afs.fs_sblkno, afs.fs_cblkno, afs.fs_iblkno, afs.fs_dblkno); 190 printf("cgrotor\t%d\tfmod\t%d\tronly\t%d\tclean\t%d\n", 191 afs.fs_cgrotor, afs.fs_fmod, afs.fs_ronly, afs.fs_clean); 192 printf("flags\t"); 193 if (afs.fs_flags == 0) 194 printf("none"); 195 if (afs.fs_flags & FS_UNCLEAN) 196 printf("unclean "); 197 if (afs.fs_flags & FS_DOSOFTDEP) 198 printf("soft-updates "); 199 if (afs.fs_flags & FS_NEEDSFSCK) 200 printf("needs fsck run "); 201 if (afs.fs_flags & FS_INDEXDIRS) 202 printf("indexed directories "); 203 if ((afs.fs_flags & 204 ~(FS_UNCLEAN | FS_DOSOFTDEP | FS_NEEDSFSCK | FS_INDEXDIRS)) != 0) 205 printf("unknown flags (%#x)", afs.fs_flags & 206 ~(FS_UNCLEAN | FS_DOSOFTDEP | 207 FS_NEEDSFSCK | FS_INDEXDIRS)); 208 putchar('\n'); 209 printf("\ncs[].cs_(nbfree,ndir,nifree,nffree):\n\t"); 210 afs.fs_csp = calloc(1, afs.fs_cssize); 211 if (lseek(disk.d_fd, 212 (off_t)(fsbtodb(&afs, afs.fs_csaddr)) * (off_t)disk.d_bsize, 213 SEEK_SET) == (off_t)-1) 214 goto err; 215 if (read(disk.d_fd, (char *)afs.fs_csp, afs.fs_cssize) != afs.fs_cssize) 216 goto err; 217 for (i = 0; i < afs.fs_ncg; i++) { 218 struct csum *cs = &afs.fs_cs(&afs, i); 219 if (i && i % 4 == 0) 220 printf("\n\t"); 221 printf("(%d,%d,%d,%d) ", 222 cs->cs_nbfree, cs->cs_ndir, cs->cs_nifree, cs->cs_nffree); 223 } 224 printf("\n"); 225 if (fssize % afs.fs_fpg) { 226 if (afs.fs_magic == FS_UFS1_MAGIC) 227 printf("cylinders in last group %d\n", 228 howmany(afs.fs_old_size % afs.fs_fpg, 229 afs.fs_old_spc / afs.fs_old_nspf)); 230 printf("blocks in last group %d\n\n", 231 (fssize % afs.fs_fpg) / afs.fs_frag); 232 } 233 for (i = 0; i < afs.fs_ncg; i++) 234 if (dumpcg(name, disk.d_fd, i)) 235 goto err; 236 ufs_disk_close(&disk); 237 return (0); 238 239 err: ufs_disk_close(&disk); 240 warn("%s", name); 241 return (1); 242 } 243 244 int 245 dumpcg(const char *name, int fd, int c) 246 { 247 time_t time; 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)disk.d_bsize, SEEK_SET)) == (off_t)-1) 254 return (1); 255 if (read(disk.d_fd, &acg, afs.fs_bsize) != afs.fs_bsize) { 256 warnx("%s: error reading cg", name); 257 return (1); 258 } 259 if (afs.fs_magic == FS_UFS2_MAGIC) { 260 time = acg.cg_time; 261 printf("magic\t%x\ttell\t%qx\ttime\t%s", 262 acg.cg_magic, cur, ctime(&time)); 263 printf("cgx\t%d\tndblk\t%d\tniblk\t%d\tinitiblk %d\n", 264 acg.cg_cgx, acg.cg_ndblk, acg.cg_niblk, acg.cg_initediblk); 265 } else { 266 printf("magic\t%x\ttell\t%qx\ttime\t%s", 267 acg.cg_magic, cur, ctime(&acg.cg_old_time)); 268 printf("cgx\t%d\tncyl\t%d\tniblk\t%d\tndblk\t%d\n", 269 acg.cg_cgx, acg.cg_old_ncyl, acg.cg_old_niblk, 270 acg.cg_ndblk); 271 } 272 printf("nbfree\t%d\tndir\t%d\tnifree\t%d\tnffree\t%d\n", 273 acg.cg_cs.cs_nbfree, acg.cg_cs.cs_ndir, 274 acg.cg_cs.cs_nifree, acg.cg_cs.cs_nffree); 275 printf("rotor\t%d\tirotor\t%d\tfrotor\t%d\nfrsum", 276 acg.cg_rotor, acg.cg_irotor, acg.cg_frotor); 277 for (i = 1, j = 0; i < afs.fs_frag; i++) { 278 printf("\t%d", acg.cg_frsum[i]); 279 j += i * acg.cg_frsum[i]; 280 } 281 printf("\nsum of frsum: %d", j); 282 if (afs.fs_contigsumsize > 0) { 283 for (i = 1; i < afs.fs_contigsumsize; i++) { 284 if ((i - 1) % 8 == 0) 285 printf("\nclusters %d-%d:", i, 286 afs.fs_contigsumsize - 1 < i + 7 ? 287 afs.fs_contigsumsize - 1 : i + 7); 288 printf("\t%d", cg_clustersum(&acg)[i]); 289 } 290 printf("\nclusters size %d and over: %d\n", 291 afs.fs_contigsumsize, 292 cg_clustersum(&acg)[afs.fs_contigsumsize]); 293 printf("clusters free:\t"); 294 pbits(cg_clustersfree(&acg), acg.cg_nclusterblks); 295 } else 296 printf("\n"); 297 printf("inodes used:\t"); 298 pbits(cg_inosused(&acg), afs.fs_ipg); 299 printf("blks free:\t"); 300 pbits(cg_blksfree(&acg), afs.fs_fpg); 301 return (0); 302 } 303 304 void 305 pbits(void *vp, int max) 306 { 307 int i; 308 char *p; 309 int count, j; 310 311 for (count = i = 0, p = vp; i < max; i++) 312 if (isset(p, i)) { 313 if (count) 314 printf(",%s", count % 6 ? " " : "\n\t"); 315 count++; 316 printf("%d", i); 317 j = i; 318 while ((i+1)<max && isset(p, i+1)) 319 i++; 320 if (i != j) 321 printf("-%d", i); 322 } 323 printf("\n"); 324 } 325 326 void 327 usage(void) 328 { 329 (void)fprintf(stderr, "usage: dumpfs filesys | device\n"); 330 exit(1); 331 } 332