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) 1980, 1989, 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 #if 0 48 static char sccsid[] = "@(#)mkfs.c 8.11 (Berkeley) 5/3/95"; 49 #endif 50 static const char rcsid[] = 51 "$FreeBSD$"; 52 #endif /* not lint */ 53 54 #include <err.h> 55 #include <limits.h> 56 #include <signal.h> 57 #include <stdlib.h> 58 #include <string.h> 59 #include <stdint.h> 60 #include <stdio.h> 61 #include <unistd.h> 62 #include <sys/param.h> 63 #include <sys/time.h> 64 #include <sys/types.h> 65 #include <sys/wait.h> 66 #include <sys/resource.h> 67 #include <sys/stat.h> 68 #include <ufs/ufs/dinode.h> 69 #include <ufs/ufs/dir.h> 70 #include <ufs/ffs/fs.h> 71 #include <sys/disklabel.h> 72 #include <sys/file.h> 73 #include <sys/mman.h> 74 #include <sys/ioctl.h> 75 #include "newfs.h" 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 static struct csum *fscs; 89 90 static union { 91 struct cg cg; 92 char pad[MAXBSIZE]; 93 } cgun; 94 #define acg cgun.cg 95 96 union dinode { 97 struct ufs1_dinode dp1; 98 struct ufs2_dinode dp2; 99 }; 100 #define DIP(dp, field) \ 101 ((sblock.fs_magic == FS_UFS1_MAGIC) ? \ 102 (dp)->dp1.field : (dp)->dp2.field) 103 104 static int randinit; 105 static caddr_t iobuf; 106 static long iobufsize; 107 static ufs2_daddr_t alloc(int size, int mode); 108 static int charsperline(void); 109 static void clrblock(struct fs *, unsigned char *, int); 110 static void fsinit(time_t); 111 static int ilog2(int); 112 static void initcg(int, time_t); 113 static int isblock(struct fs *, unsigned char *, int); 114 static void iput(union dinode *, ino_t); 115 static int makedir(struct direct *, int); 116 static void rdfs(ufs2_daddr_t, int, char *); 117 static void setblock(struct fs *, unsigned char *, int); 118 static void wtfs(ufs2_daddr_t, int, char *); 119 static void wtfsflush(void); 120 121 void 122 mkfs(struct partition *pp, char *fsys) 123 { 124 int fragsperinode, optimalfpg, origdensity, minfpg, lastminfpg; 125 long i, j, cylno, csfrags; 126 time_t utime; 127 quad_t sizepb; 128 int width; 129 char tmpbuf[100]; /* XXX this will break in about 2,500 years */ 130 131 if (Rflag) 132 utime = 1000000000; 133 else 134 time(&utime); 135 if (!Rflag && !randinit) { 136 randinit = 1; 137 srandomdev(); 138 } 139 /* 140 * allocate space for superblock, cylinder group map, and 141 * two sets of inode blocks. 142 */ 143 if (bsize < SBLOCKSIZE) 144 iobufsize = SBLOCKSIZE + 3 * bsize; 145 else 146 iobufsize = 4 * bsize; 147 if ((iobuf = malloc(iobufsize)) == 0) { 148 printf("Cannot allocate I/O buffer\n"); 149 exit(38); 150 } 151 bzero(iobuf, iobufsize); 152 sblock.fs_flags = 0; 153 if (Uflag) 154 sblock.fs_flags |= FS_DOSOFTDEP; 155 /* 156 * Validate the given file system size. 157 * Verify that its last block can actually be accessed. 158 * Convert to file system fragment sized units. 159 */ 160 if (fssize <= 0) { 161 printf("preposterous size %jd\n", (intmax_t)fssize); 162 exit(13); 163 } 164 wtfs(fssize - (realsectorsize / DEV_BSIZE), realsectorsize, 165 (char *)&sblock); 166 /* 167 * collect and verify the file system density info 168 */ 169 sblock.fs_avgfilesize = avgfilesize; 170 sblock.fs_avgfpdir = avgfilesperdir; 171 if (sblock.fs_avgfilesize <= 0) 172 printf("illegal expected average file size %d\n", 173 sblock.fs_avgfilesize), exit(14); 174 if (sblock.fs_avgfpdir <= 0) 175 printf("illegal expected number of files per directory %d\n", 176 sblock.fs_avgfpdir), exit(15); 177 /* 178 * collect and verify the block and fragment sizes 179 */ 180 sblock.fs_bsize = bsize; 181 sblock.fs_fsize = fsize; 182 if (!POWEROF2(sblock.fs_bsize)) { 183 printf("block size must be a power of 2, not %d\n", 184 sblock.fs_bsize); 185 exit(16); 186 } 187 if (!POWEROF2(sblock.fs_fsize)) { 188 printf("fragment size must be a power of 2, not %d\n", 189 sblock.fs_fsize); 190 exit(17); 191 } 192 if (sblock.fs_fsize < sectorsize) { 193 printf("increasing fragment size from %d to sector size (%d)\n", 194 sblock.fs_fsize, sectorsize); 195 sblock.fs_fsize = sectorsize; 196 } 197 if (sblock.fs_bsize < MINBSIZE) { 198 printf("increasing block size from %d to minimum (%d)\n", 199 sblock.fs_bsize, MINBSIZE); 200 sblock.fs_bsize = MINBSIZE; 201 } 202 if (sblock.fs_bsize < sblock.fs_fsize) { 203 printf("increasing block size from %d to fragment size (%d)\n", 204 sblock.fs_bsize, sblock.fs_fsize); 205 sblock.fs_bsize = sblock.fs_fsize; 206 } 207 if (sblock.fs_fsize * MAXFRAG < sblock.fs_bsize) { 208 printf( 209 "increasing fragment size from %d to block size / %d (%d)\n", 210 sblock.fs_fsize, MAXFRAG, sblock.fs_bsize / MAXFRAG); 211 sblock.fs_fsize = sblock.fs_bsize / MAXFRAG; 212 } 213 if (maxbsize < bsize || !POWEROF2(maxbsize)) { 214 sblock.fs_maxbsize = sblock.fs_bsize; 215 printf("Extent size set to %d\n", sblock.fs_maxbsize); 216 } else if (sblock.fs_maxbsize > FS_MAXCONTIG * sblock.fs_bsize) { 217 sblock.fs_maxbsize = FS_MAXCONTIG * sblock.fs_bsize; 218 printf("Extent size reduced to %d\n", sblock.fs_maxbsize); 219 } else { 220 sblock.fs_maxbsize = maxbsize; 221 } 222 sblock.fs_maxcontig = maxcontig; 223 if (sblock.fs_maxcontig < sblock.fs_maxbsize / sblock.fs_bsize) { 224 sblock.fs_maxcontig = sblock.fs_maxbsize / sblock.fs_bsize; 225 printf("Maxcontig raised to %d\n", sblock.fs_maxbsize); 226 } 227 if (sblock.fs_maxcontig > 1) 228 sblock.fs_contigsumsize = MIN(sblock.fs_maxcontig,FS_MAXCONTIG); 229 sblock.fs_bmask = ~(sblock.fs_bsize - 1); 230 sblock.fs_fmask = ~(sblock.fs_fsize - 1); 231 sblock.fs_qbmask = ~sblock.fs_bmask; 232 sblock.fs_qfmask = ~sblock.fs_fmask; 233 sblock.fs_bshift = ilog2(sblock.fs_bsize); 234 sblock.fs_fshift = ilog2(sblock.fs_fsize); 235 sblock.fs_frag = numfrags(&sblock, sblock.fs_bsize); 236 sblock.fs_fragshift = ilog2(sblock.fs_frag); 237 if (sblock.fs_frag > MAXFRAG) { 238 printf("fragment size %d is still too small (can't happen)\n", 239 sblock.fs_bsize / MAXFRAG); 240 exit(21); 241 } 242 sblock.fs_fsbtodb = ilog2(sblock.fs_fsize / sectorsize); 243 sblock.fs_size = fssize = dbtofsb(&sblock, fssize); 244 if (Oflag == 1) { 245 sblock.fs_magic = FS_UFS1_MAGIC; 246 sblock.fs_sblockloc = numfrags(&sblock, SBLOCK_UFS1); 247 sblock.fs_nindir = sblock.fs_bsize / sizeof(ufs1_daddr_t); 248 sblock.fs_inopb = sblock.fs_bsize / sizeof(struct ufs1_dinode); 249 sblock.fs_maxsymlinklen = ((NDADDR + NIADDR) * 250 sizeof(ufs1_daddr_t)); 251 sblock.fs_old_inodefmt = FS_44INODEFMT; 252 sblock.fs_old_cgoffset = 0; 253 sblock.fs_old_cgmask = 0xffffffff; 254 sblock.fs_old_size = sblock.fs_size; 255 sblock.fs_old_rotdelay = 0; 256 sblock.fs_old_rps = 60; 257 sblock.fs_old_nspf = sblock.fs_fsize / sectorsize; 258 sblock.fs_old_cpg = 1; 259 sblock.fs_old_interleave = 1; 260 sblock.fs_old_trackskew = 0; 261 sblock.fs_old_cpc = 0; 262 sblock.fs_old_postblformat = 1; 263 sblock.fs_old_nrpos = 1; 264 } else { 265 sblock.fs_magic = FS_UFS2_MAGIC; 266 sblock.fs_sblockloc = numfrags(&sblock, SBLOCK_UFS2); 267 sblock.fs_nindir = sblock.fs_bsize / sizeof(ufs2_daddr_t); 268 sblock.fs_inopb = sblock.fs_bsize / sizeof(struct ufs2_dinode); 269 sblock.fs_maxsymlinklen = ((NDADDR + NIADDR) * 270 sizeof(ufs2_daddr_t)); 271 } 272 sblock.fs_sblkno = 273 roundup(howmany(lfragtosize(&sblock, sblock.fs_sblockloc) + 274 SBLOCKSIZE, sblock.fs_fsize), sblock.fs_frag); 275 sblock.fs_cblkno = sblock.fs_sblkno + 276 roundup(howmany(SBLOCKSIZE, sblock.fs_fsize), sblock.fs_frag); 277 sblock.fs_iblkno = sblock.fs_cblkno + sblock.fs_frag; 278 sblock.fs_maxfilesize = sblock.fs_bsize * NDADDR - 1; 279 for (sizepb = sblock.fs_bsize, i = 0; i < NIADDR; i++) { 280 sizepb *= NINDIR(&sblock); 281 sblock.fs_maxfilesize += sizepb; 282 } 283 /* 284 * Calculate the number of blocks to put into each cylinder group. 285 * 286 * This algorithm selects the number of blocks per cylinder 287 * group. The first goal is to have at least enough data blocks 288 * in each cylinder group to meet the density requirement. Once 289 * this goal is achieved we try to expand to have at least 290 * MINCYLGRPS cylinder groups. Once this goal is achieved, we 291 * pack as many blocks into each cylinder group map as will fit. 292 * 293 * We start by calculating the smallest number of blocks that we 294 * can put into each cylinder group. If this is too big, we reduce 295 * the density until it fits. 296 */ 297 origdensity = density; 298 for (;;) { 299 fragsperinode = numfrags(&sblock, density); 300 minfpg = fragsperinode * INOPB(&sblock); 301 if (minfpg > sblock.fs_size) 302 minfpg = sblock.fs_size; 303 sblock.fs_ipg = INOPB(&sblock); 304 sblock.fs_fpg = roundup(sblock.fs_iblkno + 305 sblock.fs_ipg / INOPF(&sblock), sblock.fs_frag); 306 if (sblock.fs_fpg < minfpg) 307 sblock.fs_fpg = minfpg; 308 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode), 309 INOPB(&sblock)); 310 sblock.fs_fpg = roundup(sblock.fs_iblkno + 311 sblock.fs_ipg / INOPF(&sblock), sblock.fs_frag); 312 if (sblock.fs_fpg < minfpg) 313 sblock.fs_fpg = minfpg; 314 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode), 315 INOPB(&sblock)); 316 if (CGSIZE(&sblock) < (unsigned long)sblock.fs_bsize) 317 break; 318 density -= sblock.fs_fsize; 319 } 320 if (density != origdensity) 321 printf("density reduced from %d to %d\n", origdensity, density); 322 /* 323 * Start packing more blocks into the cylinder group until 324 * it cannot grow any larger, the number of cylinder groups 325 * drops below MINCYLGRPS, or we reach the size requested. 326 */ 327 for ( ; sblock.fs_fpg < maxblkspercg; sblock.fs_fpg += sblock.fs_frag) { 328 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode), 329 INOPB(&sblock)); 330 if (sblock.fs_size / sblock.fs_fpg < MINCYLGRPS) 331 break; 332 if (CGSIZE(&sblock) < (unsigned long)sblock.fs_bsize) 333 continue; 334 if (CGSIZE(&sblock) == (unsigned long)sblock.fs_bsize) 335 break; 336 sblock.fs_fpg -= sblock.fs_frag; 337 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode), 338 INOPB(&sblock)); 339 break; 340 } 341 /* 342 * Check to be sure that the last cylinder group has enough blocks 343 * to be viable. If it is too small, reduce the number of blocks 344 * per cylinder group which will have the effect of moving more 345 * blocks into the last cylinder group. 346 */ 347 optimalfpg = sblock.fs_fpg; 348 for (;;) { 349 sblock.fs_ncg = howmany(sblock.fs_size, sblock.fs_fpg); 350 lastminfpg = roundup(sblock.fs_iblkno + 351 sblock.fs_ipg / INOPF(&sblock), sblock.fs_frag); 352 if (sblock.fs_size < lastminfpg) { 353 printf("Filesystem size %jd < minimum size of %d\n", 354 (intmax_t)sblock.fs_size, lastminfpg); 355 exit(28); 356 } 357 if (sblock.fs_size % sblock.fs_fpg >= lastminfpg || 358 sblock.fs_size % sblock.fs_fpg == 0) 359 break; 360 sblock.fs_fpg -= sblock.fs_frag; 361 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode), 362 INOPB(&sblock)); 363 } 364 if (optimalfpg != sblock.fs_fpg) 365 printf("Reduced frags per cylinder group from %d to %d %s\n", 366 optimalfpg, sblock.fs_fpg, "to enlarge last cyl group"); 367 sblock.fs_cgsize = fragroundup(&sblock, CGSIZE(&sblock)); 368 sblock.fs_dblkno = sblock.fs_iblkno + sblock.fs_ipg / INOPF(&sblock); 369 if (Oflag == 1) { 370 sblock.fs_old_spc = sblock.fs_fpg * sblock.fs_old_nspf; 371 sblock.fs_old_nsect = sblock.fs_old_spc; 372 sblock.fs_old_npsect = sblock.fs_old_spc; 373 sblock.fs_old_ncyl = sblock.fs_ncg; 374 } 375 /* 376 * fill in remaining fields of the super block 377 */ 378 sblock.fs_csaddr = cgdmin(&sblock, 0); 379 sblock.fs_cssize = 380 fragroundup(&sblock, sblock.fs_ncg * sizeof(struct csum)); 381 fscs = (struct csum *)calloc(1, sblock.fs_cssize); 382 if (fscs == NULL) 383 errx(31, "calloc failed"); 384 sblock.fs_sbsize = fragroundup(&sblock, sizeof(struct fs)); 385 if (sblock.fs_sbsize > SBLOCKSIZE) 386 sblock.fs_sbsize = SBLOCKSIZE; 387 sblock.fs_minfree = minfree; 388 sblock.fs_maxbpg = maxbpg; 389 sblock.fs_optim = opt; 390 sblock.fs_cgrotor = 0; 391 sblock.fs_pendingblocks = 0; 392 sblock.fs_pendinginodes = 0; 393 sblock.fs_fmod = 0; 394 sblock.fs_ronly = 0; 395 sblock.fs_state = 0; 396 sblock.fs_clean = 1; 397 sblock.fs_id[0] = (long)utime; 398 sblock.fs_id[1] = random(); 399 sblock.fs_fsmnt[0] = '\0'; 400 csfrags = howmany(sblock.fs_cssize, sblock.fs_fsize); 401 sblock.fs_dsize = sblock.fs_size - sblock.fs_sblkno - 402 sblock.fs_ncg * (sblock.fs_dblkno - sblock.fs_sblkno); 403 sblock.fs_cstotal.cs_nbfree = 404 fragstoblks(&sblock, sblock.fs_dsize) - 405 howmany(csfrags, sblock.fs_frag); 406 sblock.fs_cstotal.cs_nffree = 407 fragnum(&sblock, sblock.fs_size) + 408 (csfrags > 0 ? sblock.fs_frag - csfrags : 0); 409 sblock.fs_cstotal.cs_nifree = sblock.fs_ncg * sblock.fs_ipg - ROOTINO; 410 sblock.fs_cstotal.cs_ndir = 0; 411 sblock.fs_dsize -= csfrags; 412 sblock.fs_time = utime; 413 if (Oflag == 1) { 414 sblock.fs_old_time = utime; 415 sblock.fs_old_dsize = sblock.fs_dsize; 416 sblock.fs_old_csaddr = sblock.fs_csaddr; 417 sblock.fs_old_cstotal.cs_ndir = sblock.fs_cstotal.cs_ndir; 418 sblock.fs_old_cstotal.cs_nbfree = sblock.fs_cstotal.cs_nbfree; 419 sblock.fs_old_cstotal.cs_nifree = sblock.fs_cstotal.cs_nifree; 420 sblock.fs_old_cstotal.cs_nffree = sblock.fs_cstotal.cs_nffree; 421 } 422 423 /* 424 * Dump out summary information about file system. 425 */ 426 # define B2MBFACTOR (1 / (1024.0 * 1024.0)) 427 printf("%s: %.1fMB (%jd sectors) block size %d, fragment size %d\n", 428 fsys, (float)sblock.fs_size * sblock.fs_fsize * B2MBFACTOR, 429 (intmax_t)fsbtodb(&sblock, sblock.fs_size), sblock.fs_bsize, 430 sblock.fs_fsize); 431 printf("\tusing %d cylinder groups of %.2fMB, %d blks, %d inodes.\n", 432 sblock.fs_ncg, (float)sblock.fs_fpg * sblock.fs_fsize * B2MBFACTOR, 433 sblock.fs_fpg / sblock.fs_frag, sblock.fs_ipg); 434 if (sblock.fs_flags & FS_DOSOFTDEP) 435 printf("\twith soft updates\n"); 436 # undef B2MBFACTOR 437 /* 438 * Now build the cylinders group blocks and 439 * then print out indices of cylinder groups. 440 */ 441 printf("super-block backups (for fsck -b #) at:\n"); 442 i = 0; 443 width = charsperline(); 444 /* 445 * Make a copy of the superblock into the buffer that we will be 446 * writing out in each cylinder group. 447 */ 448 bcopy((char *)&sblock, iobuf, SBLOCKSIZE); 449 for (cylno = 0; cylno < sblock.fs_ncg; cylno++) { 450 initcg(cylno, utime); 451 j = snprintf(tmpbuf, sizeof(tmpbuf), " %jd%s", 452 (intmax_t)fsbtodb(&sblock, cgsblock(&sblock, cylno)), 453 cylno < (sblock.fs_ncg-1) ? "," : ""); 454 if (j < 0) 455 tmpbuf[j = 0] = '\0'; 456 if (i + j >= width) { 457 printf("\n"); 458 i = 0; 459 } 460 i += j; 461 printf("%s", tmpbuf); 462 fflush(stdout); 463 } 464 printf("\n"); 465 if (Nflag) 466 exit(0); 467 /* 468 * Now construct the initial file system, 469 * then write out the super-block. 470 */ 471 fsinit(utime); 472 if (Oflag == 1) { 473 sblock.fs_old_cstotal.cs_ndir = sblock.fs_cstotal.cs_ndir; 474 sblock.fs_old_cstotal.cs_nbfree = sblock.fs_cstotal.cs_nbfree; 475 sblock.fs_old_cstotal.cs_nifree = sblock.fs_cstotal.cs_nifree; 476 sblock.fs_old_cstotal.cs_nffree = sblock.fs_cstotal.cs_nffree; 477 } 478 wtfs(lfragtosize(&sblock, sblock.fs_sblockloc) / sectorsize, 479 SBLOCKSIZE, (char *)&sblock); 480 for (i = 0; i < sblock.fs_cssize; i += sblock.fs_bsize) 481 wtfs(fsbtodb(&sblock, sblock.fs_csaddr + numfrags(&sblock, i)), 482 sblock.fs_cssize - i < sblock.fs_bsize ? 483 sblock.fs_cssize - i : sblock.fs_bsize, 484 ((char *)fscs) + i); 485 wtfsflush(); 486 /* 487 * Update information about this partion in pack 488 * label, to that it may be updated on disk. 489 */ 490 if (pp != NULL) { 491 pp->p_fstype = FS_BSDFFS; 492 pp->p_fsize = sblock.fs_fsize; 493 pp->p_frag = sblock.fs_frag; 494 pp->p_cpg = sblock.fs_fpg; 495 } 496 } 497 498 /* 499 * Initialize a cylinder group. 500 */ 501 void 502 initcg(int cylno, time_t utime) 503 { 504 long i, j, d, dlower, dupper, blkno, start; 505 ufs2_daddr_t cbase, dmax; 506 struct ufs1_dinode *dp1; 507 struct ufs2_dinode *dp2; 508 struct csum *cs; 509 510 /* 511 * Determine block bounds for cylinder group. 512 * Allow space for super block summary information in first 513 * cylinder group. 514 */ 515 cbase = cgbase(&sblock, cylno); 516 dmax = cbase + sblock.fs_fpg; 517 if (dmax > sblock.fs_size) 518 dmax = sblock.fs_size; 519 dlower = cgsblock(&sblock, cylno) - cbase; 520 dupper = cgdmin(&sblock, cylno) - cbase; 521 if (cylno == 0) 522 dupper += howmany(sblock.fs_cssize, sblock.fs_fsize); 523 cs = &fscs[cylno]; 524 memset(&acg, 0, sblock.fs_cgsize); 525 acg.cg_time = utime; 526 acg.cg_magic = CG_MAGIC; 527 acg.cg_cgx = cylno; 528 acg.cg_niblk = sblock.fs_ipg; 529 acg.cg_initediblk = sblock.fs_ipg < 2 * INOPB(&sblock) ? 530 sblock.fs_ipg : 2 * INOPB(&sblock); 531 acg.cg_ndblk = dmax - cbase; 532 if (sblock.fs_contigsumsize > 0) 533 acg.cg_nclusterblks = acg.cg_ndblk / sblock.fs_frag; 534 start = &acg.cg_space[0] - (u_char *)(&acg.cg_firstfield); 535 if (Oflag == 2) { 536 acg.cg_iusedoff = start; 537 } else { 538 acg.cg_old_ncyl = sblock.fs_old_cpg; 539 acg.cg_old_time = acg.cg_time; 540 acg.cg_time = 0; 541 acg.cg_old_niblk = acg.cg_niblk; 542 acg.cg_niblk = 0; 543 acg.cg_initediblk = 0; 544 acg.cg_old_btotoff = start; 545 acg.cg_old_boff = acg.cg_old_btotoff + 546 sblock.fs_old_cpg * sizeof(int32_t); 547 acg.cg_iusedoff = acg.cg_old_boff + 548 sblock.fs_old_cpg * sizeof(u_int16_t); 549 } 550 acg.cg_freeoff = acg.cg_iusedoff + howmany(sblock.fs_ipg, CHAR_BIT); 551 acg.cg_nextfreeoff = acg.cg_freeoff + howmany(sblock.fs_fpg, CHAR_BIT); 552 if (sblock.fs_contigsumsize > 0) { 553 acg.cg_clustersumoff = 554 roundup(acg.cg_nextfreeoff, sizeof(u_int32_t)); 555 acg.cg_clustersumoff -= sizeof(u_int32_t); 556 acg.cg_clusteroff = acg.cg_clustersumoff + 557 (sblock.fs_contigsumsize + 1) * sizeof(u_int32_t); 558 acg.cg_nextfreeoff = acg.cg_clusteroff + 559 howmany(fragstoblks(&sblock, sblock.fs_fpg), CHAR_BIT); 560 } 561 if (acg.cg_nextfreeoff > sblock.fs_cgsize) { 562 printf("Panic: cylinder group too big\n"); 563 exit(37); 564 } 565 acg.cg_cs.cs_nifree += sblock.fs_ipg; 566 if (cylno == 0) 567 for (i = 0; i < (long)ROOTINO; i++) { 568 setbit(cg_inosused(&acg), i); 569 acg.cg_cs.cs_nifree--; 570 } 571 if (cylno > 0) { 572 /* 573 * In cylno 0, beginning space is reserved 574 * for boot and super blocks. 575 */ 576 for (d = 0; d < dlower; d += sblock.fs_frag) { 577 blkno = d / sblock.fs_frag; 578 setblock(&sblock, cg_blksfree(&acg), blkno); 579 if (sblock.fs_contigsumsize > 0) 580 setbit(cg_clustersfree(&acg), blkno); 581 acg.cg_cs.cs_nbfree++; 582 } 583 } 584 if ((i = dupper % sblock.fs_frag)) { 585 acg.cg_frsum[sblock.fs_frag - i]++; 586 for (d = dupper + sblock.fs_frag - i; dupper < d; dupper++) { 587 setbit(cg_blksfree(&acg), dupper); 588 acg.cg_cs.cs_nffree++; 589 } 590 } 591 for (d = dupper; d + sblock.fs_frag <= acg.cg_ndblk; 592 d += sblock.fs_frag) { 593 blkno = d / sblock.fs_frag; 594 setblock(&sblock, cg_blksfree(&acg), blkno); 595 if (sblock.fs_contigsumsize > 0) 596 setbit(cg_clustersfree(&acg), blkno); 597 acg.cg_cs.cs_nbfree++; 598 } 599 if (d < acg.cg_ndblk) { 600 acg.cg_frsum[acg.cg_ndblk - d]++; 601 for (; d < acg.cg_ndblk; d++) { 602 setbit(cg_blksfree(&acg), d); 603 acg.cg_cs.cs_nffree++; 604 } 605 } 606 if (sblock.fs_contigsumsize > 0) { 607 int32_t *sump = cg_clustersum(&acg); 608 u_char *mapp = cg_clustersfree(&acg); 609 int map = *mapp++; 610 int bit = 1; 611 int run = 0; 612 613 for (i = 0; i < acg.cg_nclusterblks; i++) { 614 if ((map & bit) != 0) 615 run++; 616 else if (run != 0) { 617 if (run > sblock.fs_contigsumsize) 618 run = sblock.fs_contigsumsize; 619 sump[run]++; 620 run = 0; 621 } 622 if ((i & (CHAR_BIT - 1)) != CHAR_BIT - 1) 623 bit <<= 1; 624 else { 625 map = *mapp++; 626 bit = 1; 627 } 628 } 629 if (run != 0) { 630 if (run > sblock.fs_contigsumsize) 631 run = sblock.fs_contigsumsize; 632 sump[run]++; 633 } 634 } 635 *cs = acg.cg_cs; 636 /* 637 * Write out the duplicate super block, the cylinder group map 638 * and two blocks worth of inodes in a single write. 639 */ 640 start = sblock.fs_bsize > SBLOCKSIZE ? sblock.fs_bsize : SBLOCKSIZE; 641 bcopy((char *)&acg, &iobuf[start], sblock.fs_cgsize); 642 start += sblock.fs_bsize; 643 dp1 = (struct ufs1_dinode *)(&iobuf[start]); 644 dp2 = (struct ufs2_dinode *)(&iobuf[start]); 645 for (i = 0; i < acg.cg_initediblk; i++) { 646 if (sblock.fs_magic == FS_UFS1_MAGIC) { 647 dp1->di_gen = random(); 648 dp1++; 649 } else { 650 dp2->di_gen = random(); 651 dp2++; 652 } 653 } 654 wtfs(fsbtodb(&sblock, cgsblock(&sblock, cylno)), iobufsize, iobuf); 655 /* 656 * For the old file system, we have to initialize all the inodes. 657 */ 658 if (Oflag == 1) { 659 for (i = 2 * sblock.fs_frag; 660 i < sblock.fs_ipg / INOPF(&sblock); 661 i += sblock.fs_frag) { 662 dp1 = (struct ufs1_dinode *)(&iobuf[start]); 663 for (j = 0; j < INOPB(&sblock); j++) { 664 dp1->di_gen = random(); 665 dp1++; 666 } 667 wtfs(fsbtodb(&sblock, cgimin(&sblock, cylno) + i), 668 sblock.fs_bsize, &iobuf[start]); 669 } 670 } 671 } 672 673 /* 674 * initialize the file system 675 */ 676 #define PREDEFDIR 2 677 678 struct direct root_dir[] = { 679 { ROOTINO, sizeof(struct direct), DT_DIR, 1, "." }, 680 { ROOTINO, sizeof(struct direct), DT_DIR, 2, ".." }, 681 }; 682 683 void 684 fsinit(time_t utime) 685 { 686 union dinode node; 687 688 memset(&node, 0, sizeof node); 689 if (sblock.fs_magic == FS_UFS1_MAGIC) { 690 /* 691 * initialize the node 692 */ 693 node.dp1.di_atime = utime; 694 node.dp1.di_mtime = utime; 695 node.dp1.di_ctime = utime; 696 /* 697 * create the root directory 698 */ 699 node.dp1.di_mode = IFDIR | UMASK; 700 node.dp1.di_nlink = PREDEFDIR; 701 node.dp1.di_size = makedir(root_dir, PREDEFDIR); 702 node.dp1.di_db[0] = alloc(sblock.fs_fsize, node.dp1.di_mode); 703 node.dp1.di_blocks = 704 btodb(fragroundup(&sblock, node.dp1.di_size)); 705 wtfs(fsbtodb(&sblock, node.dp1.di_db[0]), sblock.fs_fsize, 706 iobuf); 707 } else { 708 /* 709 * initialize the node 710 */ 711 node.dp2.di_atime = utime; 712 node.dp2.di_mtime = utime; 713 node.dp2.di_ctime = utime; 714 node.dp2.di_birthtime = utime; 715 /* 716 * create the root directory 717 */ 718 node.dp2.di_mode = IFDIR | UMASK; 719 node.dp2.di_nlink = PREDEFDIR; 720 node.dp2.di_size = makedir(root_dir, PREDEFDIR); 721 node.dp2.di_db[0] = alloc(sblock.fs_fsize, node.dp2.di_mode); 722 node.dp2.di_blocks = 723 btodb(fragroundup(&sblock, node.dp2.di_size)); 724 wtfs(fsbtodb(&sblock, node.dp2.di_db[0]), sblock.fs_fsize, 725 iobuf); 726 } 727 iput(&node, ROOTINO); 728 } 729 730 /* 731 * construct a set of directory entries in "iobuf". 732 * return size of directory. 733 */ 734 int 735 makedir(struct direct *protodir, int entries) 736 { 737 char *cp; 738 int i, spcleft; 739 740 spcleft = DIRBLKSIZ; 741 memset(iobuf, 0, DIRBLKSIZ); 742 for (cp = iobuf, i = 0; i < entries - 1; i++) { 743 protodir[i].d_reclen = DIRSIZ(0, &protodir[i]); 744 memmove(cp, &protodir[i], protodir[i].d_reclen); 745 cp += protodir[i].d_reclen; 746 spcleft -= protodir[i].d_reclen; 747 } 748 protodir[i].d_reclen = spcleft; 749 memmove(cp, &protodir[i], DIRSIZ(0, &protodir[i])); 750 return (DIRBLKSIZ); 751 } 752 753 /* 754 * allocate a block or frag 755 */ 756 ufs2_daddr_t 757 alloc(int size, int mode) 758 { 759 int i, d, blkno, frag; 760 761 rdfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize, 762 (char *)&acg); 763 if (acg.cg_magic != CG_MAGIC) { 764 printf("cg 0: bad magic number\n"); 765 return (0); 766 } 767 if (acg.cg_cs.cs_nbfree == 0) { 768 printf("first cylinder group ran out of space\n"); 769 return (0); 770 } 771 for (d = 0; d < acg.cg_ndblk; d += sblock.fs_frag) 772 if (isblock(&sblock, cg_blksfree(&acg), d / sblock.fs_frag)) 773 goto goth; 774 printf("internal error: can't find block in cyl 0\n"); 775 return (0); 776 goth: 777 blkno = fragstoblks(&sblock, d); 778 clrblock(&sblock, cg_blksfree(&acg), blkno); 779 if (sblock.fs_contigsumsize > 0) 780 clrbit(cg_clustersfree(&acg), blkno); 781 acg.cg_cs.cs_nbfree--; 782 sblock.fs_cstotal.cs_nbfree--; 783 fscs[0].cs_nbfree--; 784 if (mode & IFDIR) { 785 acg.cg_cs.cs_ndir++; 786 sblock.fs_cstotal.cs_ndir++; 787 fscs[0].cs_ndir++; 788 } 789 if (size != sblock.fs_bsize) { 790 frag = howmany(size, sblock.fs_fsize); 791 fscs[0].cs_nffree += sblock.fs_frag - frag; 792 sblock.fs_cstotal.cs_nffree += sblock.fs_frag - frag; 793 acg.cg_cs.cs_nffree += sblock.fs_frag - frag; 794 acg.cg_frsum[sblock.fs_frag - frag]++; 795 for (i = frag; i < sblock.fs_frag; i++) 796 setbit(cg_blksfree(&acg), d + i); 797 } 798 wtfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize, 799 (char *)&acg); 800 return ((ufs2_daddr_t)d); 801 } 802 803 /* 804 * Allocate an inode on the disk 805 */ 806 void 807 iput(union dinode *ip, ino_t ino) 808 { 809 ufs2_daddr_t d; 810 int c; 811 812 c = ino_to_cg(&sblock, ino); 813 rdfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize, 814 (char *)&acg); 815 if (acg.cg_magic != CG_MAGIC) { 816 printf("cg 0: bad magic number\n"); 817 exit(31); 818 } 819 acg.cg_cs.cs_nifree--; 820 setbit(cg_inosused(&acg), ino); 821 wtfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize, 822 (char *)&acg); 823 sblock.fs_cstotal.cs_nifree--; 824 fscs[0].cs_nifree--; 825 if (ino >= (unsigned long)sblock.fs_ipg * sblock.fs_ncg) { 826 printf("fsinit: inode value out of range (%d).\n", ino); 827 exit(32); 828 } 829 d = fsbtodb(&sblock, ino_to_fsba(&sblock, ino)); 830 rdfs(d, sblock.fs_bsize, (char *)iobuf); 831 if (sblock.fs_magic == FS_UFS1_MAGIC) 832 ((struct ufs1_dinode *)iobuf)[ino_to_fsbo(&sblock, ino)] = 833 ip->dp1; 834 else 835 ((struct ufs2_dinode *)iobuf)[ino_to_fsbo(&sblock, ino)] = 836 ip->dp2; 837 wtfs(d, sblock.fs_bsize, (char *)iobuf); 838 } 839 840 /* 841 * read a block from the file system 842 */ 843 void 844 rdfs(ufs2_daddr_t bno, int size, char *bf) 845 { 846 int n; 847 848 wtfsflush(); 849 if (lseek(fso, (off_t)bno * sectorsize, 0) < 0) { 850 printf("seek error: %ld\n", (long)bno); 851 err(33, "rdfs"); 852 } 853 n = read(fso, bf, size); 854 if (n != size) { 855 printf("read error: %ld\n", (long)bno); 856 err(34, "rdfs"); 857 } 858 } 859 860 #define WCSIZE (128 * 1024) 861 ufs2_daddr_t wc_sect; /* units of sectorsize */ 862 int wc_end; /* bytes */ 863 static char wc[WCSIZE]; /* bytes */ 864 865 /* 866 * Flush dirty write behind buffer. 867 */ 868 static void 869 wtfsflush() 870 { 871 int n; 872 if (wc_end) { 873 if (lseek(fso, (off_t)wc_sect * sectorsize, SEEK_SET) < 0) { 874 printf("seek error: %ld\n", (long)wc_sect); 875 err(35, "wtfs - writecombine"); 876 } 877 n = write(fso, wc, wc_end); 878 if (n != wc_end) { 879 printf("write error: %ld\n", (long)wc_sect); 880 err(36, "wtfs - writecombine"); 881 } 882 wc_end = 0; 883 } 884 } 885 886 /* 887 * write a block to the file system 888 */ 889 static void 890 wtfs(ufs2_daddr_t bno, int size, char *bf) 891 { 892 int done, n; 893 894 if (Nflag) 895 return; 896 done = 0; 897 if (wc_end == 0 && size <= WCSIZE) { 898 wc_sect = bno; 899 bcopy(bf, wc, size); 900 wc_end = size; 901 if (wc_end < WCSIZE) 902 return; 903 done = 1; 904 } 905 if ((off_t)wc_sect * sectorsize + wc_end == (off_t)bno * sectorsize && 906 wc_end + size <= WCSIZE) { 907 bcopy(bf, wc + wc_end, size); 908 wc_end += size; 909 if (wc_end < WCSIZE) 910 return; 911 done = 1; 912 } 913 wtfsflush(); 914 if (done) 915 return; 916 if (lseek(fso, (off_t)bno * sectorsize, SEEK_SET) < 0) { 917 printf("seek error: %ld\n", (long)bno); 918 err(35, "wtfs"); 919 } 920 n = write(fso, bf, size); 921 if (n != size) { 922 printf("write error: %ld\n", (long)bno); 923 err(36, "wtfs"); 924 } 925 } 926 927 /* 928 * check if a block is available 929 */ 930 static int 931 isblock(struct fs *fs, unsigned char *cp, int h) 932 { 933 unsigned char mask; 934 935 switch (fs->fs_frag) { 936 case 8: 937 return (cp[h] == 0xff); 938 case 4: 939 mask = 0x0f << ((h & 0x1) << 2); 940 return ((cp[h >> 1] & mask) == mask); 941 case 2: 942 mask = 0x03 << ((h & 0x3) << 1); 943 return ((cp[h >> 2] & mask) == mask); 944 case 1: 945 mask = 0x01 << (h & 0x7); 946 return ((cp[h >> 3] & mask) == mask); 947 default: 948 fprintf(stderr, "isblock bad fs_frag %d\n", fs->fs_frag); 949 return (0); 950 } 951 } 952 953 /* 954 * take a block out of the map 955 */ 956 static void 957 clrblock(struct fs *fs, unsigned char *cp, int h) 958 { 959 switch ((fs)->fs_frag) { 960 case 8: 961 cp[h] = 0; 962 return; 963 case 4: 964 cp[h >> 1] &= ~(0x0f << ((h & 0x1) << 2)); 965 return; 966 case 2: 967 cp[h >> 2] &= ~(0x03 << ((h & 0x3) << 1)); 968 return; 969 case 1: 970 cp[h >> 3] &= ~(0x01 << (h & 0x7)); 971 return; 972 default: 973 fprintf(stderr, "clrblock bad fs_frag %d\n", fs->fs_frag); 974 return; 975 } 976 } 977 978 /* 979 * put a block into the map 980 */ 981 static void 982 setblock(struct fs *fs, unsigned char *cp, int h) 983 { 984 switch (fs->fs_frag) { 985 case 8: 986 cp[h] = 0xff; 987 return; 988 case 4: 989 cp[h >> 1] |= (0x0f << ((h & 0x1) << 2)); 990 return; 991 case 2: 992 cp[h >> 2] |= (0x03 << ((h & 0x3) << 1)); 993 return; 994 case 1: 995 cp[h >> 3] |= (0x01 << (h & 0x7)); 996 return; 997 default: 998 fprintf(stderr, "setblock bad fs_frag %d\n", fs->fs_frag); 999 return; 1000 } 1001 } 1002 1003 /* 1004 * Determine the number of characters in a 1005 * single line. 1006 */ 1007 1008 static int 1009 charsperline(void) 1010 { 1011 int columns; 1012 char *cp; 1013 struct winsize ws; 1014 1015 columns = 0; 1016 if (ioctl(0, TIOCGWINSZ, &ws) != -1) 1017 columns = ws.ws_col; 1018 if (columns == 0 && (cp = getenv("COLUMNS"))) 1019 columns = atoi(cp); 1020 if (columns == 0) 1021 columns = 80; /* last resort */ 1022 return (columns); 1023 } 1024 1025 static int 1026 ilog2(int val) 1027 { 1028 u_int n; 1029 1030 for (n = 0; n < sizeof(n) * CHAR_BIT; n++) 1031 if (1 << n == val) 1032 return (n); 1033 errx(1, "ilog2: %d is not a power of 2\n", val); 1034 } 1035