1 /* $NetBSD: mkfs.c,v 1.22 2011/10/09 22:30:13 christos Exp $ */ 2 3 /*- 4 * SPDX-License-Identifier: BSD-3-Clause 5 * 6 * Copyright (c) 2002 Networks Associates Technology, Inc. 7 * All rights reserved. 8 * 9 * This software was developed for the FreeBSD Project by Marshall 10 * Kirk McKusick and Network Associates Laboratories, the Security 11 * Research Division of Network Associates, Inc. under DARPA/SPAWAR 12 * contract N66001-01-C-8035 ("CBOSS"), as part of the DARPA CHATS 13 * research program 14 * 15 * Copyright (c) 1980, 1989, 1993 16 * The Regents of the University of California. All rights reserved. 17 * 18 * Redistribution and use in source and binary forms, with or without 19 * modification, are permitted provided that the following conditions 20 * are met: 21 * 1. Redistributions of source code must retain the above copyright 22 * notice, this list of conditions and the following disclaimer. 23 * 2. Redistributions in binary form must reproduce the above copyright 24 * notice, this list of conditions and the following disclaimer in the 25 * documentation and/or other materials provided with the distribution. 26 * 3. Neither the name of the University nor the names of its contributors 27 * may be used to endorse or promote products derived from this software 28 * without specific prior written permission. 29 * 30 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 31 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 32 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 33 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 34 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 35 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 36 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 37 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 38 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 39 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 40 * SUCH DAMAGE. 41 */ 42 43 #include <sys/cdefs.h> 44 __FBSDID("$FreeBSD$"); 45 46 #include <sys/param.h> 47 #include <sys/time.h> 48 #include <sys/resource.h> 49 50 #include <stdio.h> 51 #include <stdlib.h> 52 #include <string.h> 53 #include <unistd.h> 54 #include <errno.h> 55 #include <util.h> 56 57 #include "makefs.h" 58 #include "ffs.h" 59 60 #include <ufs/ufs/dinode.h> 61 #include <ufs/ffs/fs.h> 62 63 #include "ffs/ufs_bswap.h" 64 #include "ffs/ufs_inode.h" 65 #include "ffs/ffs_extern.h" 66 #include "ffs/newfs_extern.h" 67 68 #ifndef BBSIZE 69 #define BBSIZE 8192 /* size of boot area, with label */ 70 #endif 71 72 static void initcg(uint32_t, time_t, const fsinfo_t *); 73 static int ilog2(int); 74 75 static int count_digits(int); 76 77 /* 78 * make file system for cylinder-group style file systems 79 */ 80 #define UMASK 0755 81 #define POWEROF2(num) (((num) & ((num) - 1)) == 0) 82 83 static union { 84 struct fs fs; 85 char pad[SBLOCKSIZE]; 86 } fsun; 87 #define sblock fsun.fs 88 89 static union { 90 struct cg cg; 91 char pad[FFS_MAXBSIZE]; 92 } cgun; 93 #define acg cgun.cg 94 95 static char *iobuf; 96 static int iobufsize; 97 98 static char writebuf[FFS_MAXBSIZE]; 99 100 static int Oflag; /* format as an 4.3BSD file system */ 101 static int64_t fssize; /* file system size */ 102 static int sectorsize; /* bytes/sector */ 103 static int fsize; /* fragment size */ 104 static int bsize; /* block size */ 105 static int maxbsize; /* maximum clustering */ 106 static int maxblkspercg; 107 static int minfree; /* free space threshold */ 108 static int opt; /* optimization preference (space or time) */ 109 static int density; /* number of bytes per inode */ 110 static int maxcontig; /* max contiguous blocks to allocate */ 111 static int maxbpg; /* maximum blocks per file in a cyl group */ 112 static int bbsize; /* boot block size */ 113 static int sbsize; /* superblock size */ 114 static int avgfilesize; /* expected average file size */ 115 static int avgfpdir; /* expected number of files per directory */ 116 117 struct fs * 118 ffs_mkfs(const char *fsys, const fsinfo_t *fsopts, time_t tstamp) 119 { 120 int fragsperinode, optimalfpg, origdensity, minfpg, lastminfpg; 121 int32_t csfrags; 122 uint32_t i, cylno; 123 long long sizepb; 124 void *space; 125 int size; 126 int nprintcols, printcolwidth; 127 ffs_opt_t *ffs_opts = fsopts->fs_specific; 128 129 Oflag = ffs_opts->version; 130 fssize = fsopts->size / fsopts->sectorsize; 131 sectorsize = fsopts->sectorsize; 132 fsize = ffs_opts->fsize; 133 bsize = ffs_opts->bsize; 134 maxbsize = ffs_opts->maxbsize; 135 maxblkspercg = ffs_opts->maxblkspercg; 136 minfree = ffs_opts->minfree; 137 opt = ffs_opts->optimization; 138 density = ffs_opts->density; 139 maxcontig = ffs_opts->maxcontig; 140 maxbpg = ffs_opts->maxbpg; 141 avgfilesize = ffs_opts->avgfilesize; 142 avgfpdir = ffs_opts->avgfpdir; 143 bbsize = BBSIZE; 144 sbsize = SBLOCKSIZE; 145 146 strlcpy(sblock.fs_volname, ffs_opts->label, sizeof(sblock.fs_volname)); 147 148 if (Oflag == 0) { 149 sblock.fs_old_inodefmt = FS_42INODEFMT; 150 sblock.fs_maxsymlinklen = 0; 151 sblock.fs_old_flags = 0; 152 } else { 153 sblock.fs_old_inodefmt = FS_44INODEFMT; 154 sblock.fs_maxsymlinklen = (Oflag == 1 ? UFS1_MAXSYMLINKLEN : 155 UFS2_MAXSYMLINKLEN); 156 sblock.fs_old_flags = FS_FLAGS_UPDATED; 157 sblock.fs_flags = 0; 158 } 159 /* 160 * Validate the given file system size. 161 * Verify that its last block can actually be accessed. 162 * Convert to file system fragment sized units. 163 */ 164 if (fssize <= 0) { 165 printf("preposterous size %lld\n", (long long)fssize); 166 exit(13); 167 } 168 ffs_wtfs(fssize - 1, sectorsize, (char *)&sblock, fsopts); 169 170 /* 171 * collect and verify the filesystem density info 172 */ 173 sblock.fs_avgfilesize = avgfilesize; 174 sblock.fs_avgfpdir = avgfpdir; 175 if (sblock.fs_avgfilesize <= 0) 176 printf("illegal expected average file size %d\n", 177 sblock.fs_avgfilesize), exit(14); 178 if (sblock.fs_avgfpdir <= 0) 179 printf("illegal expected number of files per directory %d\n", 180 sblock.fs_avgfpdir), exit(15); 181 /* 182 * collect and verify the block and fragment sizes 183 */ 184 sblock.fs_bsize = bsize; 185 sblock.fs_fsize = fsize; 186 if (!POWEROF2(sblock.fs_bsize)) { 187 printf("block size must be a power of 2, not %d\n", 188 sblock.fs_bsize); 189 exit(16); 190 } 191 if (!POWEROF2(sblock.fs_fsize)) { 192 printf("fragment size must be a power of 2, not %d\n", 193 sblock.fs_fsize); 194 exit(17); 195 } 196 if (sblock.fs_fsize < sectorsize) { 197 printf("fragment size %d is too small, minimum is %d\n", 198 sblock.fs_fsize, sectorsize); 199 exit(18); 200 } 201 if (sblock.fs_bsize < MINBSIZE) { 202 printf("block size %d is too small, minimum is %d\n", 203 sblock.fs_bsize, MINBSIZE); 204 exit(19); 205 } 206 if (sblock.fs_bsize > FFS_MAXBSIZE) { 207 printf("block size %d is too large, maximum is %d\n", 208 sblock.fs_bsize, FFS_MAXBSIZE); 209 exit(19); 210 } 211 if (sblock.fs_bsize < sblock.fs_fsize) { 212 printf("block size (%d) cannot be smaller than fragment size (%d)\n", 213 sblock.fs_bsize, sblock.fs_fsize); 214 exit(20); 215 } 216 217 if (maxbsize < bsize || !POWEROF2(maxbsize)) { 218 sblock.fs_maxbsize = sblock.fs_bsize; 219 printf("Extent size set to %d\n", sblock.fs_maxbsize); 220 } else if (sblock.fs_maxbsize > FS_MAXCONTIG * sblock.fs_bsize) { 221 sblock.fs_maxbsize = FS_MAXCONTIG * sblock.fs_bsize; 222 printf("Extent size reduced to %d\n", sblock.fs_maxbsize); 223 } else { 224 sblock.fs_maxbsize = maxbsize; 225 } 226 sblock.fs_maxcontig = maxcontig; 227 if (sblock.fs_maxcontig < sblock.fs_maxbsize / sblock.fs_bsize) { 228 sblock.fs_maxcontig = sblock.fs_maxbsize / sblock.fs_bsize; 229 printf("Maxcontig raised to %d\n", sblock.fs_maxbsize); 230 } 231 232 if (sblock.fs_maxcontig > 1) 233 sblock.fs_contigsumsize = MIN(sblock.fs_maxcontig,FS_MAXCONTIG); 234 235 sblock.fs_bmask = ~(sblock.fs_bsize - 1); 236 sblock.fs_fmask = ~(sblock.fs_fsize - 1); 237 sblock.fs_qbmask = ~sblock.fs_bmask; 238 sblock.fs_qfmask = ~sblock.fs_fmask; 239 for (sblock.fs_bshift = 0, i = sblock.fs_bsize; i > 1; i >>= 1) 240 sblock.fs_bshift++; 241 for (sblock.fs_fshift = 0, i = sblock.fs_fsize; i > 1; i >>= 1) 242 sblock.fs_fshift++; 243 sblock.fs_frag = numfrags(&sblock, sblock.fs_bsize); 244 for (sblock.fs_fragshift = 0, i = sblock.fs_frag; i > 1; i >>= 1) 245 sblock.fs_fragshift++; 246 if (sblock.fs_frag > MAXFRAG) { 247 printf("fragment size %d is too small, " 248 "minimum with block size %d is %d\n", 249 sblock.fs_fsize, sblock.fs_bsize, 250 sblock.fs_bsize / MAXFRAG); 251 exit(21); 252 } 253 sblock.fs_fsbtodb = ilog2(sblock.fs_fsize / sectorsize); 254 sblock.fs_size = sblock.fs_providersize = fssize = 255 dbtofsb(&sblock, fssize); 256 257 if (Oflag <= 1) { 258 sblock.fs_magic = FS_UFS1_MAGIC; 259 sblock.fs_sblockloc = SBLOCK_UFS1; 260 sblock.fs_nindir = sblock.fs_bsize / sizeof(ufs1_daddr_t); 261 sblock.fs_inopb = sblock.fs_bsize / sizeof(struct ufs1_dinode); 262 sblock.fs_maxsymlinklen = ((UFS_NDADDR + UFS_NIADDR) * 263 sizeof (ufs1_daddr_t)); 264 sblock.fs_old_inodefmt = FS_44INODEFMT; 265 sblock.fs_old_cgoffset = 0; 266 sblock.fs_old_cgmask = 0xffffffff; 267 sblock.fs_old_size = sblock.fs_size; 268 sblock.fs_old_rotdelay = 0; 269 sblock.fs_old_rps = 60; 270 sblock.fs_old_nspf = sblock.fs_fsize / sectorsize; 271 sblock.fs_old_cpg = 1; 272 sblock.fs_old_interleave = 1; 273 sblock.fs_old_trackskew = 0; 274 sblock.fs_old_cpc = 0; 275 sblock.fs_old_postblformat = 1; 276 sblock.fs_old_nrpos = 1; 277 } else { 278 sblock.fs_magic = FS_UFS2_MAGIC; 279 sblock.fs_sblockloc = SBLOCK_UFS2; 280 sblock.fs_nindir = sblock.fs_bsize / sizeof(ufs2_daddr_t); 281 sblock.fs_inopb = sblock.fs_bsize / sizeof(struct ufs2_dinode); 282 sblock.fs_maxsymlinklen = ((UFS_NDADDR + UFS_NIADDR) * 283 sizeof (ufs2_daddr_t)); 284 if (ffs_opts->softupdates == 1) 285 sblock.fs_flags |= FS_DOSOFTDEP; 286 } 287 288 sblock.fs_sblkno = 289 roundup(howmany(sblock.fs_sblockloc + SBLOCKSIZE, sblock.fs_fsize), 290 sblock.fs_frag); 291 sblock.fs_cblkno = (daddr_t)(sblock.fs_sblkno + 292 roundup(howmany(SBLOCKSIZE, sblock.fs_fsize), sblock.fs_frag)); 293 sblock.fs_iblkno = sblock.fs_cblkno + sblock.fs_frag; 294 sblock.fs_maxfilesize = sblock.fs_bsize * UFS_NDADDR - 1; 295 for (sizepb = sblock.fs_bsize, i = 0; i < UFS_NIADDR; i++) { 296 sizepb *= NINDIR(&sblock); 297 sblock.fs_maxfilesize += sizepb; 298 } 299 300 /* 301 * Calculate the number of blocks to put into each cylinder group. 302 * 303 * This algorithm selects the number of blocks per cylinder 304 * group. The first goal is to have at least enough data blocks 305 * in each cylinder group to meet the density requirement. Once 306 * this goal is achieved we try to expand to have at least 307 * 1 cylinder group. Once this goal is achieved, we pack as 308 * many blocks into each cylinder group map as will fit. 309 * 310 * We start by calculating the smallest number of blocks that we 311 * can put into each cylinder group. If this is too big, we reduce 312 * the density until it fits. 313 */ 314 origdensity = density; 315 for (;;) { 316 fragsperinode = MAX(numfrags(&sblock, density), 1); 317 minfpg = fragsperinode * INOPB(&sblock); 318 if (minfpg > sblock.fs_size) 319 minfpg = sblock.fs_size; 320 sblock.fs_ipg = INOPB(&sblock); 321 sblock.fs_fpg = roundup(sblock.fs_iblkno + 322 sblock.fs_ipg / INOPF(&sblock), sblock.fs_frag); 323 if (sblock.fs_fpg < minfpg) 324 sblock.fs_fpg = minfpg; 325 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode), 326 INOPB(&sblock)); 327 sblock.fs_fpg = roundup(sblock.fs_iblkno + 328 sblock.fs_ipg / INOPF(&sblock), sblock.fs_frag); 329 if (sblock.fs_fpg < minfpg) 330 sblock.fs_fpg = minfpg; 331 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode), 332 INOPB(&sblock)); 333 if (CGSIZE(&sblock) < (unsigned long)sblock.fs_bsize) 334 break; 335 density -= sblock.fs_fsize; 336 } 337 if (density != origdensity) 338 printf("density reduced from %d to %d\n", origdensity, density); 339 340 if (maxblkspercg <= 0 || maxblkspercg >= fssize) 341 maxblkspercg = fssize - 1; 342 /* 343 * Start packing more blocks into the cylinder group until 344 * it cannot grow any larger, the number of cylinder groups 345 * drops below 1, or we reach the size requested. 346 */ 347 for ( ; sblock.fs_fpg < maxblkspercg; sblock.fs_fpg += sblock.fs_frag) { 348 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode), 349 INOPB(&sblock)); 350 if (sblock.fs_size / sblock.fs_fpg < 1) 351 break; 352 if (CGSIZE(&sblock) < (unsigned long)sblock.fs_bsize) 353 continue; 354 if (CGSIZE(&sblock) == (unsigned long)sblock.fs_bsize) 355 break; 356 sblock.fs_fpg -= sblock.fs_frag; 357 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode), 358 INOPB(&sblock)); 359 break; 360 } 361 /* 362 * Check to be sure that the last cylinder group has enough blocks 363 * to be viable. If it is too small, reduce the number of blocks 364 * per cylinder group which will have the effect of moving more 365 * blocks into the last cylinder group. 366 */ 367 optimalfpg = sblock.fs_fpg; 368 for (;;) { 369 sblock.fs_ncg = howmany(sblock.fs_size, sblock.fs_fpg); 370 lastminfpg = roundup(sblock.fs_iblkno + 371 sblock.fs_ipg / INOPF(&sblock), sblock.fs_frag); 372 if (sblock.fs_size < lastminfpg) { 373 printf("Filesystem size %lld < minimum size of %d\n", 374 (long long)sblock.fs_size, lastminfpg); 375 exit(28); 376 } 377 if (sblock.fs_size % sblock.fs_fpg >= lastminfpg || 378 sblock.fs_size % sblock.fs_fpg == 0) 379 break; 380 sblock.fs_fpg -= sblock.fs_frag; 381 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode), 382 INOPB(&sblock)); 383 } 384 if (optimalfpg != sblock.fs_fpg) 385 printf("Reduced frags per cylinder group from %d to %d %s\n", 386 optimalfpg, sblock.fs_fpg, "to enlarge last cyl group"); 387 sblock.fs_cgsize = fragroundup(&sblock, CGSIZE(&sblock)); 388 sblock.fs_dblkno = sblock.fs_iblkno + sblock.fs_ipg / INOPF(&sblock); 389 if (Oflag <= 1) { 390 sblock.fs_old_spc = sblock.fs_fpg * sblock.fs_old_nspf; 391 sblock.fs_old_nsect = sblock.fs_old_spc; 392 sblock.fs_old_npsect = sblock.fs_old_spc; 393 sblock.fs_old_ncyl = sblock.fs_ncg; 394 } 395 396 /* 397 * fill in remaining fields of the super block 398 */ 399 sblock.fs_csaddr = cgdmin(&sblock, 0); 400 sblock.fs_cssize = 401 fragroundup(&sblock, sblock.fs_ncg * sizeof(struct csum)); 402 403 /* 404 * Setup memory for temporary in-core cylgroup summaries. 405 * Cribbed from ffs_mountfs(). 406 */ 407 size = sblock.fs_cssize; 408 if (sblock.fs_contigsumsize > 0) 409 size += sblock.fs_ncg * sizeof(int32_t); 410 space = ecalloc(1, size); 411 sblock.fs_csp = space; 412 space = (char *)space + sblock.fs_cssize; 413 if (sblock.fs_contigsumsize > 0) { 414 int32_t *lp; 415 416 sblock.fs_maxcluster = lp = space; 417 for (i = 0; i < sblock.fs_ncg; i++) 418 *lp++ = sblock.fs_contigsumsize; 419 } 420 421 sblock.fs_sbsize = fragroundup(&sblock, sizeof(struct fs)); 422 if (sblock.fs_sbsize > SBLOCKSIZE) 423 sblock.fs_sbsize = SBLOCKSIZE; 424 sblock.fs_minfree = minfree; 425 sblock.fs_maxcontig = maxcontig; 426 sblock.fs_maxbpg = maxbpg; 427 sblock.fs_optim = opt; 428 sblock.fs_cgrotor = 0; 429 sblock.fs_pendingblocks = 0; 430 sblock.fs_pendinginodes = 0; 431 sblock.fs_cstotal.cs_ndir = 0; 432 sblock.fs_cstotal.cs_nbfree = 0; 433 sblock.fs_cstotal.cs_nifree = 0; 434 sblock.fs_cstotal.cs_nffree = 0; 435 sblock.fs_fmod = 0; 436 sblock.fs_ronly = 0; 437 sblock.fs_state = 0; 438 sblock.fs_clean = FS_ISCLEAN; 439 sblock.fs_ronly = 0; 440 sblock.fs_id[0] = tstamp; 441 sblock.fs_id[1] = random(); 442 sblock.fs_fsmnt[0] = '\0'; 443 csfrags = howmany(sblock.fs_cssize, sblock.fs_fsize); 444 sblock.fs_dsize = sblock.fs_size - sblock.fs_sblkno - 445 sblock.fs_ncg * (sblock.fs_dblkno - sblock.fs_sblkno); 446 sblock.fs_cstotal.cs_nbfree = 447 fragstoblks(&sblock, sblock.fs_dsize) - 448 howmany(csfrags, sblock.fs_frag); 449 sblock.fs_cstotal.cs_nffree = 450 fragnum(&sblock, sblock.fs_size) + 451 (fragnum(&sblock, csfrags) > 0 ? 452 sblock.fs_frag - fragnum(&sblock, csfrags) : 0); 453 sblock.fs_cstotal.cs_nifree = 454 sblock.fs_ncg * sblock.fs_ipg - UFS_ROOTINO; 455 sblock.fs_cstotal.cs_ndir = 0; 456 sblock.fs_dsize -= csfrags; 457 sblock.fs_time = tstamp; 458 if (Oflag <= 1) { 459 sblock.fs_old_time = tstamp; 460 sblock.fs_old_dsize = sblock.fs_dsize; 461 sblock.fs_old_csaddr = sblock.fs_csaddr; 462 sblock.fs_old_cstotal.cs_ndir = sblock.fs_cstotal.cs_ndir; 463 sblock.fs_old_cstotal.cs_nbfree = sblock.fs_cstotal.cs_nbfree; 464 sblock.fs_old_cstotal.cs_nifree = sblock.fs_cstotal.cs_nifree; 465 sblock.fs_old_cstotal.cs_nffree = sblock.fs_cstotal.cs_nffree; 466 } 467 /* 468 * Dump out summary information about file system. 469 */ 470 #define B2MBFACTOR (1 / (1024.0 * 1024.0)) 471 printf("%s: %.1fMB (%lld sectors) block size %d, " 472 "fragment size %d\n", 473 fsys, (float)sblock.fs_size * sblock.fs_fsize * B2MBFACTOR, 474 (long long)fsbtodb(&sblock, sblock.fs_size), 475 sblock.fs_bsize, sblock.fs_fsize); 476 printf("\tusing %d cylinder groups of %.2fMB, %d blks, " 477 "%d inodes.\n", 478 sblock.fs_ncg, 479 (float)sblock.fs_fpg * sblock.fs_fsize * B2MBFACTOR, 480 sblock.fs_fpg / sblock.fs_frag, sblock.fs_ipg); 481 #undef B2MBFACTOR 482 /* 483 * Now determine how wide each column will be, and calculate how 484 * many columns will fit in a 76 char line. 76 is the width of the 485 * subwindows in sysinst. 486 */ 487 printcolwidth = count_digits( 488 fsbtodb(&sblock, cgsblock(&sblock, sblock.fs_ncg -1))); 489 nprintcols = 76 / (printcolwidth + 2); 490 491 /* 492 * allocate space for superblock, cylinder group map, and 493 * two sets of inode blocks. 494 */ 495 if (sblock.fs_bsize < SBLOCKSIZE) 496 iobufsize = SBLOCKSIZE + 3 * sblock.fs_bsize; 497 else 498 iobufsize = 4 * sblock.fs_bsize; 499 iobuf = ecalloc(1, iobufsize); 500 /* 501 * Make a copy of the superblock into the buffer that we will be 502 * writing out in each cylinder group. 503 */ 504 memcpy(writebuf, &sblock, sbsize); 505 if (fsopts->needswap) 506 ffs_sb_swap(&sblock, (struct fs*)writebuf); 507 memcpy(iobuf, writebuf, SBLOCKSIZE); 508 509 printf("super-block backups (for fsck -b #) at:"); 510 for (cylno = 0; cylno < sblock.fs_ncg; cylno++) { 511 initcg(cylno, tstamp, fsopts); 512 if (cylno % nprintcols == 0) 513 printf("\n"); 514 printf(" %*lld,", printcolwidth, 515 (long long)fsbtodb(&sblock, cgsblock(&sblock, cylno))); 516 fflush(stdout); 517 } 518 printf("\n"); 519 520 /* 521 * Now construct the initial file system, 522 * then write out the super-block. 523 */ 524 sblock.fs_time = tstamp; 525 if (Oflag <= 1) { 526 sblock.fs_old_cstotal.cs_ndir = sblock.fs_cstotal.cs_ndir; 527 sblock.fs_old_cstotal.cs_nbfree = sblock.fs_cstotal.cs_nbfree; 528 sblock.fs_old_cstotal.cs_nifree = sblock.fs_cstotal.cs_nifree; 529 sblock.fs_old_cstotal.cs_nffree = sblock.fs_cstotal.cs_nffree; 530 } 531 if (fsopts->needswap) 532 sblock.fs_flags |= FS_SWAPPED; 533 ffs_write_superblock(&sblock, fsopts); 534 return (&sblock); 535 } 536 537 /* 538 * Write out the superblock and its duplicates, 539 * and the cylinder group summaries 540 */ 541 void 542 ffs_write_superblock(struct fs *fs, const fsinfo_t *fsopts) 543 { 544 int size, blks, i, saveflag; 545 uint32_t cylno; 546 void *space; 547 char *wrbuf; 548 549 saveflag = fs->fs_flags & FS_INTERNAL; 550 fs->fs_flags &= ~FS_INTERNAL; 551 552 memcpy(writebuf, &sblock, sbsize); 553 if (fsopts->needswap) 554 ffs_sb_swap(fs, (struct fs*)writebuf); 555 ffs_wtfs(fs->fs_sblockloc / sectorsize, sbsize, writebuf, fsopts); 556 557 /* Write out the duplicate super blocks */ 558 for (cylno = 0; cylno < fs->fs_ncg; cylno++) 559 ffs_wtfs(fsbtodb(fs, cgsblock(fs, cylno)), 560 sbsize, writebuf, fsopts); 561 562 /* Write out the cylinder group summaries */ 563 size = fs->fs_cssize; 564 blks = howmany(size, fs->fs_fsize); 565 space = (void *)fs->fs_csp; 566 wrbuf = emalloc(size); 567 for (i = 0; i < blks; i+= fs->fs_frag) { 568 size = fs->fs_bsize; 569 if (i + fs->fs_frag > blks) 570 size = (blks - i) * fs->fs_fsize; 571 if (fsopts->needswap) 572 ffs_csum_swap((struct csum *)space, 573 (struct csum *)wrbuf, size); 574 else 575 memcpy(wrbuf, space, (u_int)size); 576 ffs_wtfs(fsbtodb(fs, fs->fs_csaddr + i), size, wrbuf, fsopts); 577 space = (char *)space + size; 578 } 579 free(wrbuf); 580 fs->fs_flags |= saveflag; 581 } 582 583 /* 584 * Initialize a cylinder group. 585 */ 586 static void 587 initcg(uint32_t cylno, time_t utime, const fsinfo_t *fsopts) 588 { 589 daddr_t cbase, dmax; 590 int32_t blkno; 591 uint32_t i, j, d, dlower, dupper; 592 struct ufs1_dinode *dp1; 593 struct ufs2_dinode *dp2; 594 int start; 595 596 /* 597 * Determine block bounds for cylinder group. 598 * Allow space for super block summary information in first 599 * cylinder group. 600 */ 601 cbase = cgbase(&sblock, cylno); 602 dmax = cbase + sblock.fs_fpg; 603 if (dmax > sblock.fs_size) 604 dmax = sblock.fs_size; 605 dlower = cgsblock(&sblock, cylno) - cbase; 606 dupper = cgdmin(&sblock, cylno) - cbase; 607 if (cylno == 0) 608 dupper += howmany(sblock.fs_cssize, sblock.fs_fsize); 609 memset(&acg, 0, sblock.fs_cgsize); 610 acg.cg_time = utime; 611 acg.cg_magic = CG_MAGIC; 612 acg.cg_cgx = cylno; 613 acg.cg_niblk = sblock.fs_ipg; 614 acg.cg_initediblk = MIN(sblock.fs_ipg, 2 * INOPB(&sblock)); 615 acg.cg_ndblk = dmax - cbase; 616 if (sblock.fs_contigsumsize > 0) 617 acg.cg_nclusterblks = acg.cg_ndblk >> sblock.fs_fragshift; 618 start = &acg.cg_space[0] - (u_char *)(&acg.cg_firstfield); 619 if (Oflag == 2) { 620 acg.cg_iusedoff = start; 621 } else { 622 if (cylno == sblock.fs_ncg - 1) 623 acg.cg_old_ncyl = howmany(acg.cg_ndblk, 624 sblock.fs_fpg / sblock.fs_old_cpg); 625 else 626 acg.cg_old_ncyl = sblock.fs_old_cpg; 627 acg.cg_old_time = acg.cg_time; 628 acg.cg_time = 0; 629 acg.cg_old_niblk = acg.cg_niblk; 630 acg.cg_niblk = 0; 631 acg.cg_initediblk = 0; 632 acg.cg_old_btotoff = start; 633 acg.cg_old_boff = acg.cg_old_btotoff + 634 sblock.fs_old_cpg * sizeof(int32_t); 635 acg.cg_iusedoff = acg.cg_old_boff + 636 sblock.fs_old_cpg * sizeof(u_int16_t); 637 } 638 acg.cg_freeoff = acg.cg_iusedoff + howmany(sblock.fs_ipg, CHAR_BIT); 639 if (sblock.fs_contigsumsize <= 0) { 640 acg.cg_nextfreeoff = acg.cg_freeoff + 641 howmany(sblock.fs_fpg, CHAR_BIT); 642 } else { 643 acg.cg_clustersumoff = acg.cg_freeoff + 644 howmany(sblock.fs_fpg, CHAR_BIT) - sizeof(int32_t); 645 acg.cg_clustersumoff = 646 roundup(acg.cg_clustersumoff, sizeof(int32_t)); 647 acg.cg_clusteroff = acg.cg_clustersumoff + 648 (sblock.fs_contigsumsize + 1) * sizeof(int32_t); 649 acg.cg_nextfreeoff = acg.cg_clusteroff + 650 howmany(fragstoblks(&sblock, sblock.fs_fpg), CHAR_BIT); 651 } 652 if (acg.cg_nextfreeoff > (uint32_t)sblock.fs_cgsize) { 653 printf("Panic: cylinder group too big\n"); 654 exit(37); 655 } 656 acg.cg_cs.cs_nifree += sblock.fs_ipg; 657 if (cylno == 0) 658 for (i = 0; i < UFS_ROOTINO; i++) { 659 setbit(cg_inosused_swap(&acg, 0), i); 660 acg.cg_cs.cs_nifree--; 661 } 662 if (cylno > 0) { 663 /* 664 * In cylno 0, beginning space is reserved 665 * for boot and super blocks. 666 */ 667 for (d = 0, blkno = 0; d < dlower;) { 668 ffs_setblock(&sblock, cg_blksfree_swap(&acg, 0), blkno); 669 if (sblock.fs_contigsumsize > 0) 670 setbit(cg_clustersfree_swap(&acg, 0), blkno); 671 acg.cg_cs.cs_nbfree++; 672 d += sblock.fs_frag; 673 blkno++; 674 } 675 } 676 if ((i = (dupper & (sblock.fs_frag - 1))) != 0) { 677 acg.cg_frsum[sblock.fs_frag - i]++; 678 for (d = dupper + sblock.fs_frag - i; dupper < d; dupper++) { 679 setbit(cg_blksfree_swap(&acg, 0), dupper); 680 acg.cg_cs.cs_nffree++; 681 } 682 } 683 for (d = dupper, blkno = dupper >> sblock.fs_fragshift; 684 d + sblock.fs_frag <= acg.cg_ndblk; ) { 685 ffs_setblock(&sblock, cg_blksfree_swap(&acg, 0), blkno); 686 if (sblock.fs_contigsumsize > 0) 687 setbit(cg_clustersfree_swap(&acg, 0), blkno); 688 acg.cg_cs.cs_nbfree++; 689 d += sblock.fs_frag; 690 blkno++; 691 } 692 if (d < acg.cg_ndblk) { 693 acg.cg_frsum[acg.cg_ndblk - d]++; 694 for (; d < acg.cg_ndblk; d++) { 695 setbit(cg_blksfree_swap(&acg, 0), d); 696 acg.cg_cs.cs_nffree++; 697 } 698 } 699 if (sblock.fs_contigsumsize > 0) { 700 int32_t *sump = cg_clustersum_swap(&acg, 0); 701 u_char *mapp = cg_clustersfree_swap(&acg, 0); 702 int map = *mapp++; 703 int bit = 1; 704 int run = 0; 705 706 for (i = 0; i < acg.cg_nclusterblks; i++) { 707 if ((map & bit) != 0) { 708 run++; 709 } else if (run != 0) { 710 if (run > sblock.fs_contigsumsize) 711 run = sblock.fs_contigsumsize; 712 sump[run]++; 713 run = 0; 714 } 715 if ((i & (CHAR_BIT - 1)) != (CHAR_BIT - 1)) { 716 bit <<= 1; 717 } else { 718 map = *mapp++; 719 bit = 1; 720 } 721 } 722 if (run != 0) { 723 if (run > sblock.fs_contigsumsize) 724 run = sblock.fs_contigsumsize; 725 sump[run]++; 726 } 727 } 728 sblock.fs_cs(&sblock, cylno) = acg.cg_cs; 729 /* 730 * Write out the duplicate super block, the cylinder group map 731 * and two blocks worth of inodes in a single write. 732 */ 733 start = MAX(sblock.fs_bsize, SBLOCKSIZE); 734 memcpy(&iobuf[start], &acg, sblock.fs_cgsize); 735 if (fsopts->needswap) 736 ffs_cg_swap(&acg, (struct cg*)&iobuf[start], &sblock); 737 start += sblock.fs_bsize; 738 dp1 = (struct ufs1_dinode *)(&iobuf[start]); 739 dp2 = (struct ufs2_dinode *)(&iobuf[start]); 740 for (i = 0; i < acg.cg_initediblk; i++) { 741 if (sblock.fs_magic == FS_UFS1_MAGIC) { 742 /* No need to swap, it'll stay random */ 743 dp1->di_gen = random(); 744 dp1++; 745 } else { 746 dp2->di_gen = random(); 747 dp2++; 748 } 749 } 750 ffs_wtfs(fsbtodb(&sblock, cgsblock(&sblock, cylno)), iobufsize, iobuf, 751 fsopts); 752 /* 753 * For the old file system, we have to initialize all the inodes. 754 */ 755 if (Oflag <= 1) { 756 for (i = 2 * sblock.fs_frag; 757 i < sblock.fs_ipg / INOPF(&sblock); 758 i += sblock.fs_frag) { 759 dp1 = (struct ufs1_dinode *)(&iobuf[start]); 760 for (j = 0; j < INOPB(&sblock); j++) { 761 dp1->di_gen = random(); 762 dp1++; 763 } 764 ffs_wtfs(fsbtodb(&sblock, cgimin(&sblock, cylno) + i), 765 sblock.fs_bsize, &iobuf[start], fsopts); 766 } 767 } 768 } 769 770 /* 771 * read a block from the file system 772 */ 773 void 774 ffs_rdfs(daddr_t bno, int size, void *bf, const fsinfo_t *fsopts) 775 { 776 int n; 777 off_t offset; 778 779 offset = bno * fsopts->sectorsize + fsopts->offset; 780 if (lseek(fsopts->fd, offset, SEEK_SET) < 0) 781 err(1, "%s: seek error for sector %lld", __func__, 782 (long long)bno); 783 n = read(fsopts->fd, bf, size); 784 if (n == -1) { 785 abort(); 786 err(1, "%s: read error bno %lld size %d", __func__, 787 (long long)bno, size); 788 } 789 else if (n != size) 790 errx(1, "%s: read error for sector %lld", __func__, 791 (long long)bno); 792 } 793 794 /* 795 * write a block to the file system 796 */ 797 void 798 ffs_wtfs(daddr_t bno, int size, void *bf, const fsinfo_t *fsopts) 799 { 800 int n; 801 off_t offset; 802 803 offset = bno * fsopts->sectorsize + fsopts->offset; 804 if (lseek(fsopts->fd, offset, SEEK_SET) < 0) 805 err(1, "%s: seek error for sector %lld", __func__, 806 (long long)bno); 807 n = write(fsopts->fd, bf, size); 808 if (n == -1) 809 err(1, "%s: write error for sector %lld", __func__, 810 (long long)bno); 811 else if (n != size) 812 errx(1, "%s: write error for sector %lld", __func__, 813 (long long)bno); 814 } 815 816 817 /* Determine how many digits are needed to print a given integer */ 818 static int 819 count_digits(int num) 820 { 821 int ndig; 822 823 for(ndig = 1; num > 9; num /=10, ndig++); 824 825 return (ndig); 826 } 827 828 static int 829 ilog2(int val) 830 { 831 u_int n; 832 833 for (n = 0; n < sizeof(n) * CHAR_BIT; n++) 834 if (1 << n == val) 835 return (n); 836 errx(1, "%s: %d is not a power of 2", __func__, val); 837 } 838