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) 1980, 1989, 1993 12 * The Regents of the University of California. All rights reserved. 13 * 14 * Redistribution and use in source and binary forms, with or without 15 * modification, are permitted provided that the following conditions 16 * are met: 17 * 1. Redistributions of source code must retain the above copyright 18 * notice, this list of conditions and the following disclaimer. 19 * 2. Redistributions in binary form must reproduce the above copyright 20 * notice, this list of conditions and the following disclaimer in the 21 * documentation and/or other materials provided with the distribution. 22 * 4. Neither the name of the University nor the names of its contributors 23 * may be used to endorse or promote products derived from this software 24 * without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 36 * SUCH DAMAGE. 37 */ 38 39 #if 0 40 #ifndef lint 41 static char sccsid[] = "@(#)mkfs.c 8.11 (Berkeley) 5/3/95"; 42 #endif /* not lint */ 43 #endif 44 #include <sys/cdefs.h> 45 __FBSDID("$FreeBSD$"); 46 47 #include <sys/param.h> 48 #include <sys/disklabel.h> 49 #include <sys/file.h> 50 #include <sys/ioctl.h> 51 #include <sys/mman.h> 52 #include <sys/resource.h> 53 #include <sys/stat.h> 54 #include <sys/wait.h> 55 #include <err.h> 56 #include <grp.h> 57 #include <limits.h> 58 #include <signal.h> 59 #include <stdlib.h> 60 #include <string.h> 61 #include <stdint.h> 62 #include <stdio.h> 63 #include <time.h> 64 #include <unistd.h> 65 #include <ufs/ufs/dinode.h> 66 #include <ufs/ufs/dir.h> 67 #include <ufs/ffs/fs.h> 68 #include "newfs.h" 69 70 /* 71 * make file system for cylinder-group style file systems 72 */ 73 #define UMASK 0755 74 #define POWEROF2(num) (((num) & ((num) - 1)) == 0) 75 76 static struct csum *fscs; 77 #define sblock disk.d_fs 78 #define acg disk.d_cg 79 80 union dinode { 81 struct ufs1_dinode dp1; 82 struct ufs2_dinode dp2; 83 }; 84 #define DIP(dp, field) \ 85 ((sblock.fs_magic == FS_UFS1_MAGIC) ? \ 86 (dp)->dp1.field : (dp)->dp2.field) 87 88 static caddr_t iobuf; 89 static long iobufsize; 90 static ufs2_daddr_t alloc(int size, int mode); 91 static int charsperline(void); 92 static void clrblock(struct fs *, unsigned char *, int); 93 static void fsinit(time_t); 94 static int ilog2(int); 95 static void initcg(int, time_t); 96 static int isblock(struct fs *, unsigned char *, int); 97 static void iput(union dinode *, ino_t); 98 static int makedir(struct direct *, int); 99 static void setblock(struct fs *, unsigned char *, int); 100 static void wtfs(ufs2_daddr_t, int, char *); 101 static u_int32_t newfs_random(void); 102 103 static int 104 do_sbwrite(struct uufsd *disk) 105 { 106 if (!disk->d_sblock) 107 disk->d_sblock = disk->d_fs.fs_sblockloc / disk->d_bsize; 108 return (pwrite(disk->d_fd, &disk->d_fs, SBLOCKSIZE, (off_t)((part_ofs + 109 disk->d_sblock) * disk->d_bsize))); 110 } 111 112 void 113 mkfs(struct partition *pp, char *fsys) 114 { 115 int fragsperinode, optimalfpg, origdensity, minfpg, lastminfpg; 116 long i, j, csfrags; 117 uint cg; 118 time_t utime; 119 quad_t sizepb; 120 int width; 121 ino_t maxinum; 122 int minfragsperinode; /* minimum ratio of frags to inodes */ 123 char tmpbuf[100]; /* XXX this will break in about 2,500 years */ 124 union { 125 struct fs fdummy; 126 char cdummy[SBLOCKSIZE]; 127 } dummy; 128 #define fsdummy dummy.fdummy 129 #define chdummy dummy.cdummy 130 131 /* 132 * Our blocks == sector size, and the version of UFS we are using is 133 * specified by Oflag. 134 */ 135 disk.d_bsize = sectorsize; 136 disk.d_ufs = Oflag; 137 if (Rflag) { 138 utime = 1000000000; 139 } else { 140 time(&utime); 141 arc4random_stir(); 142 } 143 sblock.fs_old_flags = FS_FLAGS_UPDATED; 144 sblock.fs_flags = 0; 145 if (Uflag) 146 sblock.fs_flags |= FS_DOSOFTDEP; 147 if (Lflag) 148 strlcpy(sblock.fs_volname, volumelabel, MAXVOLLEN); 149 if (Jflag) 150 sblock.fs_flags |= FS_GJOURNAL; 151 if (lflag) 152 sblock.fs_flags |= FS_MULTILABEL; 153 if (tflag) 154 sblock.fs_flags |= FS_TRIM; 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 restart: 179 /* 180 * collect and verify the block and fragment sizes 181 */ 182 sblock.fs_bsize = bsize; 183 sblock.fs_fsize = fsize; 184 if (!POWEROF2(sblock.fs_bsize)) { 185 printf("block size must be a power of 2, not %d\n", 186 sblock.fs_bsize); 187 exit(16); 188 } 189 if (!POWEROF2(sblock.fs_fsize)) { 190 printf("fragment size must be a power of 2, not %d\n", 191 sblock.fs_fsize); 192 exit(17); 193 } 194 if (sblock.fs_fsize < sectorsize) { 195 printf("increasing fragment size from %d to sector size (%d)\n", 196 sblock.fs_fsize, sectorsize); 197 sblock.fs_fsize = sectorsize; 198 } 199 if (sblock.fs_bsize > MAXBSIZE) { 200 printf("decreasing block size from %d to maximum (%d)\n", 201 sblock.fs_bsize, MAXBSIZE); 202 sblock.fs_bsize = MAXBSIZE; 203 } 204 if (sblock.fs_bsize < MINBSIZE) { 205 printf("increasing block size from %d to minimum (%d)\n", 206 sblock.fs_bsize, MINBSIZE); 207 sblock.fs_bsize = MINBSIZE; 208 } 209 if (sblock.fs_fsize > MAXBSIZE) { 210 printf("decreasing fragment size from %d to maximum (%d)\n", 211 sblock.fs_fsize, MAXBSIZE); 212 sblock.fs_fsize = MAXBSIZE; 213 } 214 if (sblock.fs_bsize < sblock.fs_fsize) { 215 printf("increasing block size from %d to fragment size (%d)\n", 216 sblock.fs_bsize, sblock.fs_fsize); 217 sblock.fs_bsize = sblock.fs_fsize; 218 } 219 if (sblock.fs_fsize * MAXFRAG < sblock.fs_bsize) { 220 printf( 221 "increasing fragment size from %d to block size / %d (%d)\n", 222 sblock.fs_fsize, MAXFRAG, sblock.fs_bsize / MAXFRAG); 223 sblock.fs_fsize = sblock.fs_bsize / MAXFRAG; 224 } 225 if (maxbsize == 0) 226 maxbsize = bsize; 227 if (maxbsize < bsize || !POWEROF2(maxbsize)) { 228 sblock.fs_maxbsize = sblock.fs_bsize; 229 printf("Extent size set to %d\n", sblock.fs_maxbsize); 230 } else if (sblock.fs_maxbsize > FS_MAXCONTIG * sblock.fs_bsize) { 231 sblock.fs_maxbsize = FS_MAXCONTIG * sblock.fs_bsize; 232 printf("Extent size reduced to %d\n", sblock.fs_maxbsize); 233 } else { 234 sblock.fs_maxbsize = maxbsize; 235 } 236 /* 237 * Maxcontig sets the default for the maximum number of blocks 238 * that may be allocated sequentially. With file system clustering 239 * it is possible to allocate contiguous blocks up to the maximum 240 * transfer size permitted by the controller or buffering. 241 */ 242 if (maxcontig == 0) 243 maxcontig = MAX(1, MAXPHYS / bsize); 244 sblock.fs_maxcontig = maxcontig; 245 if (sblock.fs_maxcontig < sblock.fs_maxbsize / sblock.fs_bsize) { 246 sblock.fs_maxcontig = sblock.fs_maxbsize / sblock.fs_bsize; 247 printf("Maxcontig raised to %d\n", sblock.fs_maxbsize); 248 } 249 if (sblock.fs_maxcontig > 1) 250 sblock.fs_contigsumsize = MIN(sblock.fs_maxcontig,FS_MAXCONTIG); 251 sblock.fs_bmask = ~(sblock.fs_bsize - 1); 252 sblock.fs_fmask = ~(sblock.fs_fsize - 1); 253 sblock.fs_qbmask = ~sblock.fs_bmask; 254 sblock.fs_qfmask = ~sblock.fs_fmask; 255 sblock.fs_bshift = ilog2(sblock.fs_bsize); 256 sblock.fs_fshift = ilog2(sblock.fs_fsize); 257 sblock.fs_frag = numfrags(&sblock, sblock.fs_bsize); 258 sblock.fs_fragshift = ilog2(sblock.fs_frag); 259 if (sblock.fs_frag > MAXFRAG) { 260 printf("fragment size %d is still too small (can't happen)\n", 261 sblock.fs_bsize / MAXFRAG); 262 exit(21); 263 } 264 sblock.fs_fsbtodb = ilog2(sblock.fs_fsize / sectorsize); 265 sblock.fs_size = fssize = dbtofsb(&sblock, fssize); 266 sblock.fs_providersize = dbtofsb(&sblock, mediasize / sectorsize); 267 268 /* 269 * Before the filesystem is finally initialized, mark it 270 * as incompletely initialized. 271 */ 272 sblock.fs_magic = FS_BAD_MAGIC; 273 274 if (Oflag == 1) { 275 sblock.fs_sblockloc = SBLOCK_UFS1; 276 sblock.fs_nindir = sblock.fs_bsize / sizeof(ufs1_daddr_t); 277 sblock.fs_inopb = sblock.fs_bsize / sizeof(struct ufs1_dinode); 278 sblock.fs_maxsymlinklen = ((NDADDR + NIADDR) * 279 sizeof(ufs1_daddr_t)); 280 sblock.fs_old_inodefmt = FS_44INODEFMT; 281 sblock.fs_old_cgoffset = 0; 282 sblock.fs_old_cgmask = 0xffffffff; 283 sblock.fs_old_size = sblock.fs_size; 284 sblock.fs_old_rotdelay = 0; 285 sblock.fs_old_rps = 60; 286 sblock.fs_old_nspf = sblock.fs_fsize / sectorsize; 287 sblock.fs_old_cpg = 1; 288 sblock.fs_old_interleave = 1; 289 sblock.fs_old_trackskew = 0; 290 sblock.fs_old_cpc = 0; 291 sblock.fs_old_postblformat = 1; 292 sblock.fs_old_nrpos = 1; 293 } else { 294 sblock.fs_sblockloc = SBLOCK_UFS2; 295 sblock.fs_nindir = sblock.fs_bsize / sizeof(ufs2_daddr_t); 296 sblock.fs_inopb = sblock.fs_bsize / sizeof(struct ufs2_dinode); 297 sblock.fs_maxsymlinklen = ((NDADDR + NIADDR) * 298 sizeof(ufs2_daddr_t)); 299 } 300 sblock.fs_sblkno = 301 roundup(howmany(sblock.fs_sblockloc + SBLOCKSIZE, sblock.fs_fsize), 302 sblock.fs_frag); 303 sblock.fs_cblkno = sblock.fs_sblkno + 304 roundup(howmany(SBLOCKSIZE, sblock.fs_fsize), sblock.fs_frag); 305 sblock.fs_iblkno = sblock.fs_cblkno + sblock.fs_frag; 306 sblock.fs_maxfilesize = sblock.fs_bsize * NDADDR - 1; 307 for (sizepb = sblock.fs_bsize, i = 0; i < NIADDR; i++) { 308 sizepb *= NINDIR(&sblock); 309 sblock.fs_maxfilesize += sizepb; 310 } 311 312 /* 313 * It's impossible to create a snapshot in case that fs_maxfilesize 314 * is smaller than the fssize. 315 */ 316 if (sblock.fs_maxfilesize < (u_quad_t)fssize) { 317 warnx("WARNING: You will be unable to create snapshots on this " 318 "file system. Correct by using a larger blocksize."); 319 } 320 321 /* 322 * Calculate the number of blocks to put into each cylinder group. 323 * 324 * This algorithm selects the number of blocks per cylinder 325 * group. The first goal is to have at least enough data blocks 326 * in each cylinder group to meet the density requirement. Once 327 * this goal is achieved we try to expand to have at least 328 * MINCYLGRPS cylinder groups. Once this goal is achieved, we 329 * pack as many blocks into each cylinder group map as will fit. 330 * 331 * We start by calculating the smallest number of blocks that we 332 * can put into each cylinder group. If this is too big, we reduce 333 * the density until it fits. 334 */ 335 maxinum = (((int64_t)(1)) << 32) - INOPB(&sblock); 336 minfragsperinode = 1 + fssize / maxinum; 337 if (density == 0) { 338 density = MAX(NFPI, minfragsperinode) * fsize; 339 } else if (density < minfragsperinode * fsize) { 340 origdensity = density; 341 density = minfragsperinode * fsize; 342 fprintf(stderr, "density increased from %d to %d\n", 343 origdensity, density); 344 } 345 origdensity = density; 346 for (;;) { 347 fragsperinode = MAX(numfrags(&sblock, density), 1); 348 if (fragsperinode < minfragsperinode) { 349 bsize <<= 1; 350 fsize <<= 1; 351 printf("Block size too small for a file system %s %d\n", 352 "of this size. Increasing blocksize to", bsize); 353 goto restart; 354 } 355 minfpg = fragsperinode * INOPB(&sblock); 356 if (minfpg > sblock.fs_size) 357 minfpg = sblock.fs_size; 358 sblock.fs_ipg = INOPB(&sblock); 359 sblock.fs_fpg = roundup(sblock.fs_iblkno + 360 sblock.fs_ipg / INOPF(&sblock), sblock.fs_frag); 361 if (sblock.fs_fpg < minfpg) 362 sblock.fs_fpg = minfpg; 363 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode), 364 INOPB(&sblock)); 365 sblock.fs_fpg = roundup(sblock.fs_iblkno + 366 sblock.fs_ipg / INOPF(&sblock), sblock.fs_frag); 367 if (sblock.fs_fpg < minfpg) 368 sblock.fs_fpg = minfpg; 369 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode), 370 INOPB(&sblock)); 371 if (CGSIZE(&sblock) < (unsigned long)sblock.fs_bsize) 372 break; 373 density -= sblock.fs_fsize; 374 } 375 if (density != origdensity) 376 printf("density reduced from %d to %d\n", origdensity, density); 377 /* 378 * Start packing more blocks into the cylinder group until 379 * it cannot grow any larger, the number of cylinder groups 380 * drops below MINCYLGRPS, or we reach the size requested. 381 * For UFS1 inodes per cylinder group are stored in an int16_t 382 * so fs_ipg is limited to 2^15 - 1. 383 */ 384 for ( ; sblock.fs_fpg < maxblkspercg; sblock.fs_fpg += sblock.fs_frag) { 385 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode), 386 INOPB(&sblock)); 387 if (Oflag > 1 || (Oflag == 1 && sblock.fs_ipg <= 0x7fff)) { 388 if (sblock.fs_size / sblock.fs_fpg < MINCYLGRPS) 389 break; 390 if (CGSIZE(&sblock) < (unsigned long)sblock.fs_bsize) 391 continue; 392 if (CGSIZE(&sblock) == (unsigned long)sblock.fs_bsize) 393 break; 394 } 395 sblock.fs_fpg -= sblock.fs_frag; 396 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode), 397 INOPB(&sblock)); 398 break; 399 } 400 /* 401 * Check to be sure that the last cylinder group has enough blocks 402 * to be viable. If it is too small, reduce the number of blocks 403 * per cylinder group which will have the effect of moving more 404 * blocks into the last cylinder group. 405 */ 406 optimalfpg = sblock.fs_fpg; 407 for (;;) { 408 sblock.fs_ncg = howmany(sblock.fs_size, sblock.fs_fpg); 409 lastminfpg = roundup(sblock.fs_iblkno + 410 sblock.fs_ipg / INOPF(&sblock), sblock.fs_frag); 411 if (sblock.fs_size < lastminfpg) { 412 printf("Filesystem size %jd < minimum size of %d\n", 413 (intmax_t)sblock.fs_size, lastminfpg); 414 exit(28); 415 } 416 if (sblock.fs_size % sblock.fs_fpg >= lastminfpg || 417 sblock.fs_size % sblock.fs_fpg == 0) 418 break; 419 sblock.fs_fpg -= sblock.fs_frag; 420 sblock.fs_ipg = roundup(howmany(sblock.fs_fpg, fragsperinode), 421 INOPB(&sblock)); 422 } 423 if (optimalfpg != sblock.fs_fpg) 424 printf("Reduced frags per cylinder group from %d to %d %s\n", 425 optimalfpg, sblock.fs_fpg, "to enlarge last cyl group"); 426 sblock.fs_cgsize = fragroundup(&sblock, CGSIZE(&sblock)); 427 sblock.fs_dblkno = sblock.fs_iblkno + sblock.fs_ipg / INOPF(&sblock); 428 if (Oflag == 1) { 429 sblock.fs_old_spc = sblock.fs_fpg * sblock.fs_old_nspf; 430 sblock.fs_old_nsect = sblock.fs_old_spc; 431 sblock.fs_old_npsect = sblock.fs_old_spc; 432 sblock.fs_old_ncyl = sblock.fs_ncg; 433 } 434 /* 435 * fill in remaining fields of the super block 436 */ 437 sblock.fs_csaddr = cgdmin(&sblock, 0); 438 sblock.fs_cssize = 439 fragroundup(&sblock, sblock.fs_ncg * sizeof(struct csum)); 440 fscs = (struct csum *)calloc(1, sblock.fs_cssize); 441 if (fscs == NULL) 442 errx(31, "calloc failed"); 443 sblock.fs_sbsize = fragroundup(&sblock, sizeof(struct fs)); 444 if (sblock.fs_sbsize > SBLOCKSIZE) 445 sblock.fs_sbsize = SBLOCKSIZE; 446 sblock.fs_minfree = minfree; 447 if (maxbpg == 0) 448 sblock.fs_maxbpg = MAXBLKPG(sblock.fs_bsize); 449 else 450 sblock.fs_maxbpg = maxbpg; 451 sblock.fs_optim = opt; 452 sblock.fs_cgrotor = 0; 453 sblock.fs_pendingblocks = 0; 454 sblock.fs_pendinginodes = 0; 455 sblock.fs_fmod = 0; 456 sblock.fs_ronly = 0; 457 sblock.fs_state = 0; 458 sblock.fs_clean = 1; 459 sblock.fs_id[0] = (long)utime; 460 sblock.fs_id[1] = newfs_random(); 461 sblock.fs_fsmnt[0] = '\0'; 462 csfrags = howmany(sblock.fs_cssize, sblock.fs_fsize); 463 sblock.fs_dsize = sblock.fs_size - sblock.fs_sblkno - 464 sblock.fs_ncg * (sblock.fs_dblkno - sblock.fs_sblkno); 465 sblock.fs_cstotal.cs_nbfree = 466 fragstoblks(&sblock, sblock.fs_dsize) - 467 howmany(csfrags, sblock.fs_frag); 468 sblock.fs_cstotal.cs_nffree = 469 fragnum(&sblock, sblock.fs_size) + 470 (fragnum(&sblock, csfrags) > 0 ? 471 sblock.fs_frag - fragnum(&sblock, csfrags) : 0); 472 sblock.fs_cstotal.cs_nifree = sblock.fs_ncg * sblock.fs_ipg - ROOTINO; 473 sblock.fs_cstotal.cs_ndir = 0; 474 sblock.fs_dsize -= csfrags; 475 sblock.fs_time = utime; 476 if (Oflag == 1) { 477 sblock.fs_old_time = utime; 478 sblock.fs_old_dsize = sblock.fs_dsize; 479 sblock.fs_old_csaddr = sblock.fs_csaddr; 480 sblock.fs_old_cstotal.cs_ndir = sblock.fs_cstotal.cs_ndir; 481 sblock.fs_old_cstotal.cs_nbfree = sblock.fs_cstotal.cs_nbfree; 482 sblock.fs_old_cstotal.cs_nifree = sblock.fs_cstotal.cs_nifree; 483 sblock.fs_old_cstotal.cs_nffree = sblock.fs_cstotal.cs_nffree; 484 } 485 486 /* 487 * Dump out summary information about file system. 488 */ 489 # define B2MBFACTOR (1 / (1024.0 * 1024.0)) 490 printf("%s: %.1fMB (%jd sectors) block size %d, fragment size %d\n", 491 fsys, (float)sblock.fs_size * sblock.fs_fsize * B2MBFACTOR, 492 (intmax_t)fsbtodb(&sblock, sblock.fs_size), sblock.fs_bsize, 493 sblock.fs_fsize); 494 printf("\tusing %d cylinder groups of %.2fMB, %d blks, %d inodes.\n", 495 sblock.fs_ncg, (float)sblock.fs_fpg * sblock.fs_fsize * B2MBFACTOR, 496 sblock.fs_fpg / sblock.fs_frag, sblock.fs_ipg); 497 if (sblock.fs_flags & FS_DOSOFTDEP) 498 printf("\twith soft updates\n"); 499 # undef B2MBFACTOR 500 501 if (Eflag && !Nflag) { 502 printf("Erasing sectors [%jd...%jd]\n", 503 sblock.fs_sblockloc / disk.d_bsize, 504 fsbtodb(&sblock, sblock.fs_size) - 1); 505 berase(&disk, sblock.fs_sblockloc / disk.d_bsize, 506 sblock.fs_size * sblock.fs_fsize - sblock.fs_sblockloc); 507 } 508 /* 509 * Wipe out old UFS1 superblock(s) if necessary. 510 */ 511 if (!Nflag && Oflag != 1) { 512 i = bread(&disk, part_ofs + SBLOCK_UFS1 / disk.d_bsize, chdummy, SBLOCKSIZE); 513 if (i == -1) 514 err(1, "can't read old UFS1 superblock: %s", disk.d_error); 515 516 if (fsdummy.fs_magic == FS_UFS1_MAGIC) { 517 fsdummy.fs_magic = 0; 518 bwrite(&disk, part_ofs + SBLOCK_UFS1 / disk.d_bsize, 519 chdummy, SBLOCKSIZE); 520 for (cg = 0; cg < fsdummy.fs_ncg; cg++) { 521 if (fsbtodb(&fsdummy, cgsblock(&fsdummy, cg)) > fssize) 522 break; 523 bwrite(&disk, part_ofs + fsbtodb(&fsdummy, 524 cgsblock(&fsdummy, cg)), chdummy, SBLOCKSIZE); 525 } 526 } 527 } 528 if (!Nflag) 529 do_sbwrite(&disk); 530 if (Xflag == 1) { 531 printf("** Exiting on Xflag 1\n"); 532 exit(0); 533 } 534 if (Xflag == 2) 535 printf("** Leaving BAD MAGIC on Xflag 2\n"); 536 else 537 sblock.fs_magic = (Oflag != 1) ? FS_UFS2_MAGIC : FS_UFS1_MAGIC; 538 539 /* 540 * Now build the cylinders group blocks and 541 * then print out indices of cylinder groups. 542 */ 543 printf("super-block backups (for fsck -b #) at:\n"); 544 i = 0; 545 width = charsperline(); 546 /* 547 * allocate space for superblock, cylinder group map, and 548 * two sets of inode blocks. 549 */ 550 if (sblock.fs_bsize < SBLOCKSIZE) 551 iobufsize = SBLOCKSIZE + 3 * sblock.fs_bsize; 552 else 553 iobufsize = 4 * sblock.fs_bsize; 554 if ((iobuf = calloc(1, iobufsize)) == 0) { 555 printf("Cannot allocate I/O buffer\n"); 556 exit(38); 557 } 558 /* 559 * Make a copy of the superblock into the buffer that we will be 560 * writing out in each cylinder group. 561 */ 562 bcopy((char *)&sblock, iobuf, SBLOCKSIZE); 563 for (cg = 0; cg < sblock.fs_ncg; cg++) { 564 initcg(cg, utime); 565 j = snprintf(tmpbuf, sizeof(tmpbuf), " %jd%s", 566 (intmax_t)fsbtodb(&sblock, cgsblock(&sblock, cg)), 567 cg < (sblock.fs_ncg-1) ? "," : ""); 568 if (j < 0) 569 tmpbuf[j = 0] = '\0'; 570 if (i + j >= width) { 571 printf("\n"); 572 i = 0; 573 } 574 i += j; 575 printf("%s", tmpbuf); 576 fflush(stdout); 577 } 578 printf("\n"); 579 if (Nflag) 580 exit(0); 581 /* 582 * Now construct the initial file system, 583 * then write out the super-block. 584 */ 585 fsinit(utime); 586 if (Oflag == 1) { 587 sblock.fs_old_cstotal.cs_ndir = sblock.fs_cstotal.cs_ndir; 588 sblock.fs_old_cstotal.cs_nbfree = sblock.fs_cstotal.cs_nbfree; 589 sblock.fs_old_cstotal.cs_nifree = sblock.fs_cstotal.cs_nifree; 590 sblock.fs_old_cstotal.cs_nffree = sblock.fs_cstotal.cs_nffree; 591 } 592 if (Xflag == 3) { 593 printf("** Exiting on Xflag 3\n"); 594 exit(0); 595 } 596 if (!Nflag) { 597 do_sbwrite(&disk); 598 /* 599 * For UFS1 filesystems with a blocksize of 64K, the first 600 * alternate superblock resides at the location used for 601 * the default UFS2 superblock. As there is a valid 602 * superblock at this location, the boot code will use 603 * it as its first choice. Thus we have to ensure that 604 * all of its statistcs on usage are correct. 605 */ 606 if (Oflag == 1 && sblock.fs_bsize == 65536) 607 wtfs(fsbtodb(&sblock, cgsblock(&sblock, 0)), 608 sblock.fs_bsize, (char *)&sblock); 609 } 610 for (i = 0; i < sblock.fs_cssize; i += sblock.fs_bsize) 611 wtfs(fsbtodb(&sblock, sblock.fs_csaddr + numfrags(&sblock, i)), 612 sblock.fs_cssize - i < sblock.fs_bsize ? 613 sblock.fs_cssize - i : sblock.fs_bsize, 614 ((char *)fscs) + i); 615 /* 616 * Update information about this partition in pack 617 * label, to that it may be updated on disk. 618 */ 619 if (pp != NULL) { 620 pp->p_fstype = FS_BSDFFS; 621 pp->p_fsize = sblock.fs_fsize; 622 pp->p_frag = sblock.fs_frag; 623 pp->p_cpg = sblock.fs_fpg; 624 } 625 } 626 627 /* 628 * Initialize a cylinder group. 629 */ 630 void 631 initcg(int cylno, time_t utime) 632 { 633 long blkno, start; 634 uint i, j, d, dlower, dupper; 635 ufs2_daddr_t cbase, dmax; 636 struct ufs1_dinode *dp1; 637 struct ufs2_dinode *dp2; 638 struct csum *cs; 639 640 /* 641 * Determine block bounds for cylinder group. 642 * Allow space for super block summary information in first 643 * cylinder group. 644 */ 645 cbase = cgbase(&sblock, cylno); 646 dmax = cbase + sblock.fs_fpg; 647 if (dmax > sblock.fs_size) 648 dmax = sblock.fs_size; 649 dlower = cgsblock(&sblock, cylno) - cbase; 650 dupper = cgdmin(&sblock, cylno) - cbase; 651 if (cylno == 0) 652 dupper += howmany(sblock.fs_cssize, sblock.fs_fsize); 653 cs = &fscs[cylno]; 654 memset(&acg, 0, sblock.fs_cgsize); 655 acg.cg_time = utime; 656 acg.cg_magic = CG_MAGIC; 657 acg.cg_cgx = cylno; 658 acg.cg_niblk = sblock.fs_ipg; 659 acg.cg_initediblk = sblock.fs_ipg < 2 * INOPB(&sblock) ? 660 sblock.fs_ipg : 2 * INOPB(&sblock); 661 acg.cg_ndblk = dmax - cbase; 662 if (sblock.fs_contigsumsize > 0) 663 acg.cg_nclusterblks = acg.cg_ndblk / sblock.fs_frag; 664 start = &acg.cg_space[0] - (u_char *)(&acg.cg_firstfield); 665 if (Oflag == 2) { 666 acg.cg_iusedoff = start; 667 } else { 668 acg.cg_old_ncyl = sblock.fs_old_cpg; 669 acg.cg_old_time = acg.cg_time; 670 acg.cg_time = 0; 671 acg.cg_old_niblk = acg.cg_niblk; 672 acg.cg_niblk = 0; 673 acg.cg_initediblk = 0; 674 acg.cg_old_btotoff = start; 675 acg.cg_old_boff = acg.cg_old_btotoff + 676 sblock.fs_old_cpg * sizeof(int32_t); 677 acg.cg_iusedoff = acg.cg_old_boff + 678 sblock.fs_old_cpg * sizeof(u_int16_t); 679 } 680 acg.cg_freeoff = acg.cg_iusedoff + howmany(sblock.fs_ipg, CHAR_BIT); 681 acg.cg_nextfreeoff = acg.cg_freeoff + howmany(sblock.fs_fpg, CHAR_BIT); 682 if (sblock.fs_contigsumsize > 0) { 683 acg.cg_clustersumoff = 684 roundup(acg.cg_nextfreeoff, sizeof(u_int32_t)); 685 acg.cg_clustersumoff -= sizeof(u_int32_t); 686 acg.cg_clusteroff = acg.cg_clustersumoff + 687 (sblock.fs_contigsumsize + 1) * sizeof(u_int32_t); 688 acg.cg_nextfreeoff = acg.cg_clusteroff + 689 howmany(fragstoblks(&sblock, sblock.fs_fpg), CHAR_BIT); 690 } 691 if (acg.cg_nextfreeoff > (unsigned)sblock.fs_cgsize) { 692 printf("Panic: cylinder group too big\n"); 693 exit(37); 694 } 695 acg.cg_cs.cs_nifree += sblock.fs_ipg; 696 if (cylno == 0) 697 for (i = 0; i < (long)ROOTINO; i++) { 698 setbit(cg_inosused(&acg), i); 699 acg.cg_cs.cs_nifree--; 700 } 701 if (cylno > 0) { 702 /* 703 * In cylno 0, beginning space is reserved 704 * for boot and super blocks. 705 */ 706 for (d = 0; d < dlower; d += sblock.fs_frag) { 707 blkno = d / sblock.fs_frag; 708 setblock(&sblock, cg_blksfree(&acg), blkno); 709 if (sblock.fs_contigsumsize > 0) 710 setbit(cg_clustersfree(&acg), blkno); 711 acg.cg_cs.cs_nbfree++; 712 } 713 } 714 if ((i = dupper % sblock.fs_frag)) { 715 acg.cg_frsum[sblock.fs_frag - i]++; 716 for (d = dupper + sblock.fs_frag - i; dupper < d; dupper++) { 717 setbit(cg_blksfree(&acg), dupper); 718 acg.cg_cs.cs_nffree++; 719 } 720 } 721 for (d = dupper; d + sblock.fs_frag <= acg.cg_ndblk; 722 d += sblock.fs_frag) { 723 blkno = d / sblock.fs_frag; 724 setblock(&sblock, cg_blksfree(&acg), blkno); 725 if (sblock.fs_contigsumsize > 0) 726 setbit(cg_clustersfree(&acg), blkno); 727 acg.cg_cs.cs_nbfree++; 728 } 729 if (d < acg.cg_ndblk) { 730 acg.cg_frsum[acg.cg_ndblk - d]++; 731 for (; d < acg.cg_ndblk; d++) { 732 setbit(cg_blksfree(&acg), d); 733 acg.cg_cs.cs_nffree++; 734 } 735 } 736 if (sblock.fs_contigsumsize > 0) { 737 int32_t *sump = cg_clustersum(&acg); 738 u_char *mapp = cg_clustersfree(&acg); 739 int map = *mapp++; 740 int bit = 1; 741 int run = 0; 742 743 for (i = 0; i < acg.cg_nclusterblks; i++) { 744 if ((map & bit) != 0) 745 run++; 746 else if (run != 0) { 747 if (run > sblock.fs_contigsumsize) 748 run = sblock.fs_contigsumsize; 749 sump[run]++; 750 run = 0; 751 } 752 if ((i & (CHAR_BIT - 1)) != CHAR_BIT - 1) 753 bit <<= 1; 754 else { 755 map = *mapp++; 756 bit = 1; 757 } 758 } 759 if (run != 0) { 760 if (run > sblock.fs_contigsumsize) 761 run = sblock.fs_contigsumsize; 762 sump[run]++; 763 } 764 } 765 *cs = acg.cg_cs; 766 /* 767 * Write out the duplicate super block, the cylinder group map 768 * and two blocks worth of inodes in a single write. 769 */ 770 start = sblock.fs_bsize > SBLOCKSIZE ? sblock.fs_bsize : SBLOCKSIZE; 771 bcopy((char *)&acg, &iobuf[start], sblock.fs_cgsize); 772 start += sblock.fs_bsize; 773 dp1 = (struct ufs1_dinode *)(&iobuf[start]); 774 dp2 = (struct ufs2_dinode *)(&iobuf[start]); 775 for (i = 0; i < acg.cg_initediblk; i++) { 776 if (sblock.fs_magic == FS_UFS1_MAGIC) { 777 dp1->di_gen = newfs_random(); 778 dp1++; 779 } else { 780 dp2->di_gen = newfs_random(); 781 dp2++; 782 } 783 } 784 wtfs(fsbtodb(&sblock, cgsblock(&sblock, cylno)), iobufsize, iobuf); 785 /* 786 * For the old file system, we have to initialize all the inodes. 787 */ 788 if (Oflag == 1) { 789 for (i = 2 * sblock.fs_frag; 790 i < sblock.fs_ipg / INOPF(&sblock); 791 i += sblock.fs_frag) { 792 dp1 = (struct ufs1_dinode *)(&iobuf[start]); 793 for (j = 0; j < INOPB(&sblock); j++) { 794 dp1->di_gen = newfs_random(); 795 dp1++; 796 } 797 wtfs(fsbtodb(&sblock, cgimin(&sblock, cylno) + i), 798 sblock.fs_bsize, &iobuf[start]); 799 } 800 } 801 } 802 803 /* 804 * initialize the file system 805 */ 806 #define ROOTLINKCNT 3 807 808 static struct direct root_dir[] = { 809 { ROOTINO, sizeof(struct direct), DT_DIR, 1, "." }, 810 { ROOTINO, sizeof(struct direct), DT_DIR, 2, ".." }, 811 { ROOTINO + 1, sizeof(struct direct), DT_DIR, 5, ".snap" }, 812 }; 813 814 #define SNAPLINKCNT 2 815 816 static struct direct snap_dir[] = { 817 { ROOTINO + 1, sizeof(struct direct), DT_DIR, 1, "." }, 818 { ROOTINO, sizeof(struct direct), DT_DIR, 2, ".." }, 819 }; 820 821 void 822 fsinit(time_t utime) 823 { 824 union dinode node; 825 struct group *grp; 826 gid_t gid; 827 int entries; 828 829 memset(&node, 0, sizeof node); 830 if ((grp = getgrnam("operator")) != NULL) { 831 gid = grp->gr_gid; 832 } else { 833 warnx("Cannot retrieve operator gid, using gid 0."); 834 gid = 0; 835 } 836 entries = (nflag) ? ROOTLINKCNT - 1: ROOTLINKCNT; 837 if (sblock.fs_magic == FS_UFS1_MAGIC) { 838 /* 839 * initialize the node 840 */ 841 node.dp1.di_atime = utime; 842 node.dp1.di_mtime = utime; 843 node.dp1.di_ctime = utime; 844 /* 845 * create the root directory 846 */ 847 node.dp1.di_mode = IFDIR | UMASK; 848 node.dp1.di_nlink = entries; 849 node.dp1.di_size = makedir(root_dir, entries); 850 node.dp1.di_db[0] = alloc(sblock.fs_fsize, node.dp1.di_mode); 851 node.dp1.di_blocks = 852 btodb(fragroundup(&sblock, node.dp1.di_size)); 853 wtfs(fsbtodb(&sblock, node.dp1.di_db[0]), sblock.fs_fsize, 854 iobuf); 855 iput(&node, ROOTINO); 856 if (!nflag) { 857 /* 858 * create the .snap directory 859 */ 860 node.dp1.di_mode |= 020; 861 node.dp1.di_gid = gid; 862 node.dp1.di_nlink = SNAPLINKCNT; 863 node.dp1.di_size = makedir(snap_dir, SNAPLINKCNT); 864 node.dp1.di_db[0] = 865 alloc(sblock.fs_fsize, node.dp1.di_mode); 866 node.dp1.di_blocks = 867 btodb(fragroundup(&sblock, node.dp1.di_size)); 868 wtfs(fsbtodb(&sblock, node.dp1.di_db[0]), 869 sblock.fs_fsize, iobuf); 870 iput(&node, ROOTINO + 1); 871 } 872 } else { 873 /* 874 * initialize the node 875 */ 876 node.dp2.di_atime = utime; 877 node.dp2.di_mtime = utime; 878 node.dp2.di_ctime = utime; 879 node.dp2.di_birthtime = utime; 880 /* 881 * create the root directory 882 */ 883 node.dp2.di_mode = IFDIR | UMASK; 884 node.dp2.di_nlink = entries; 885 node.dp2.di_size = makedir(root_dir, entries); 886 node.dp2.di_db[0] = alloc(sblock.fs_fsize, node.dp2.di_mode); 887 node.dp2.di_blocks = 888 btodb(fragroundup(&sblock, node.dp2.di_size)); 889 wtfs(fsbtodb(&sblock, node.dp2.di_db[0]), sblock.fs_fsize, 890 iobuf); 891 iput(&node, ROOTINO); 892 if (!nflag) { 893 /* 894 * create the .snap directory 895 */ 896 node.dp2.di_mode |= 020; 897 node.dp2.di_gid = gid; 898 node.dp2.di_nlink = SNAPLINKCNT; 899 node.dp2.di_size = makedir(snap_dir, SNAPLINKCNT); 900 node.dp2.di_db[0] = 901 alloc(sblock.fs_fsize, node.dp2.di_mode); 902 node.dp2.di_blocks = 903 btodb(fragroundup(&sblock, node.dp2.di_size)); 904 wtfs(fsbtodb(&sblock, node.dp2.di_db[0]), 905 sblock.fs_fsize, iobuf); 906 iput(&node, ROOTINO + 1); 907 } 908 } 909 } 910 911 /* 912 * construct a set of directory entries in "iobuf". 913 * return size of directory. 914 */ 915 int 916 makedir(struct direct *protodir, int entries) 917 { 918 char *cp; 919 int i, spcleft; 920 921 spcleft = DIRBLKSIZ; 922 memset(iobuf, 0, DIRBLKSIZ); 923 for (cp = iobuf, i = 0; i < entries - 1; i++) { 924 protodir[i].d_reclen = DIRSIZ(0, &protodir[i]); 925 memmove(cp, &protodir[i], protodir[i].d_reclen); 926 cp += protodir[i].d_reclen; 927 spcleft -= protodir[i].d_reclen; 928 } 929 protodir[i].d_reclen = spcleft; 930 memmove(cp, &protodir[i], DIRSIZ(0, &protodir[i])); 931 return (DIRBLKSIZ); 932 } 933 934 /* 935 * allocate a block or frag 936 */ 937 ufs2_daddr_t 938 alloc(int size, int mode) 939 { 940 int i, blkno, frag; 941 uint d; 942 943 bread(&disk, part_ofs + fsbtodb(&sblock, cgtod(&sblock, 0)), (char *)&acg, 944 sblock.fs_cgsize); 945 if (acg.cg_magic != CG_MAGIC) { 946 printf("cg 0: bad magic number\n"); 947 exit(38); 948 } 949 if (acg.cg_cs.cs_nbfree == 0) { 950 printf("first cylinder group ran out of space\n"); 951 exit(39); 952 } 953 for (d = 0; d < acg.cg_ndblk; d += sblock.fs_frag) 954 if (isblock(&sblock, cg_blksfree(&acg), d / sblock.fs_frag)) 955 goto goth; 956 printf("internal error: can't find block in cyl 0\n"); 957 exit(40); 958 goth: 959 blkno = fragstoblks(&sblock, d); 960 clrblock(&sblock, cg_blksfree(&acg), blkno); 961 if (sblock.fs_contigsumsize > 0) 962 clrbit(cg_clustersfree(&acg), blkno); 963 acg.cg_cs.cs_nbfree--; 964 sblock.fs_cstotal.cs_nbfree--; 965 fscs[0].cs_nbfree--; 966 if (mode & IFDIR) { 967 acg.cg_cs.cs_ndir++; 968 sblock.fs_cstotal.cs_ndir++; 969 fscs[0].cs_ndir++; 970 } 971 if (size != sblock.fs_bsize) { 972 frag = howmany(size, sblock.fs_fsize); 973 fscs[0].cs_nffree += sblock.fs_frag - frag; 974 sblock.fs_cstotal.cs_nffree += sblock.fs_frag - frag; 975 acg.cg_cs.cs_nffree += sblock.fs_frag - frag; 976 acg.cg_frsum[sblock.fs_frag - frag]++; 977 for (i = frag; i < sblock.fs_frag; i++) 978 setbit(cg_blksfree(&acg), d + i); 979 } 980 /* XXX cgwrite(&disk, 0)??? */ 981 wtfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize, 982 (char *)&acg); 983 return ((ufs2_daddr_t)d); 984 } 985 986 /* 987 * Allocate an inode on the disk 988 */ 989 void 990 iput(union dinode *ip, ino_t ino) 991 { 992 ufs2_daddr_t d; 993 994 bread(&disk, part_ofs + fsbtodb(&sblock, cgtod(&sblock, 0)), (char *)&acg, 995 sblock.fs_cgsize); 996 if (acg.cg_magic != CG_MAGIC) { 997 printf("cg 0: bad magic number\n"); 998 exit(31); 999 } 1000 acg.cg_cs.cs_nifree--; 1001 setbit(cg_inosused(&acg), ino); 1002 wtfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize, 1003 (char *)&acg); 1004 sblock.fs_cstotal.cs_nifree--; 1005 fscs[0].cs_nifree--; 1006 if (ino >= (unsigned long)sblock.fs_ipg * sblock.fs_ncg) { 1007 printf("fsinit: inode value out of range (%ju).\n", 1008 (uintmax_t)ino); 1009 exit(32); 1010 } 1011 d = fsbtodb(&sblock, ino_to_fsba(&sblock, ino)); 1012 bread(&disk, part_ofs + d, (char *)iobuf, sblock.fs_bsize); 1013 if (sblock.fs_magic == FS_UFS1_MAGIC) 1014 ((struct ufs1_dinode *)iobuf)[ino_to_fsbo(&sblock, ino)] = 1015 ip->dp1; 1016 else 1017 ((struct ufs2_dinode *)iobuf)[ino_to_fsbo(&sblock, ino)] = 1018 ip->dp2; 1019 wtfs(d, sblock.fs_bsize, (char *)iobuf); 1020 } 1021 1022 /* 1023 * possibly write to disk 1024 */ 1025 static void 1026 wtfs(ufs2_daddr_t bno, int size, char *bf) 1027 { 1028 if (Nflag) 1029 return; 1030 if (bwrite(&disk, part_ofs + bno, bf, size) < 0) 1031 err(36, "wtfs: %d bytes at sector %jd", size, (intmax_t)bno); 1032 } 1033 1034 /* 1035 * check if a block is available 1036 */ 1037 static int 1038 isblock(struct fs *fs, unsigned char *cp, int h) 1039 { 1040 unsigned char mask; 1041 1042 switch (fs->fs_frag) { 1043 case 8: 1044 return (cp[h] == 0xff); 1045 case 4: 1046 mask = 0x0f << ((h & 0x1) << 2); 1047 return ((cp[h >> 1] & mask) == mask); 1048 case 2: 1049 mask = 0x03 << ((h & 0x3) << 1); 1050 return ((cp[h >> 2] & mask) == mask); 1051 case 1: 1052 mask = 0x01 << (h & 0x7); 1053 return ((cp[h >> 3] & mask) == mask); 1054 default: 1055 fprintf(stderr, "isblock bad fs_frag %d\n", fs->fs_frag); 1056 return (0); 1057 } 1058 } 1059 1060 /* 1061 * take a block out of the map 1062 */ 1063 static void 1064 clrblock(struct fs *fs, unsigned char *cp, int h) 1065 { 1066 switch ((fs)->fs_frag) { 1067 case 8: 1068 cp[h] = 0; 1069 return; 1070 case 4: 1071 cp[h >> 1] &= ~(0x0f << ((h & 0x1) << 2)); 1072 return; 1073 case 2: 1074 cp[h >> 2] &= ~(0x03 << ((h & 0x3) << 1)); 1075 return; 1076 case 1: 1077 cp[h >> 3] &= ~(0x01 << (h & 0x7)); 1078 return; 1079 default: 1080 fprintf(stderr, "clrblock bad fs_frag %d\n", fs->fs_frag); 1081 return; 1082 } 1083 } 1084 1085 /* 1086 * put a block into the map 1087 */ 1088 static void 1089 setblock(struct fs *fs, unsigned char *cp, int h) 1090 { 1091 switch (fs->fs_frag) { 1092 case 8: 1093 cp[h] = 0xff; 1094 return; 1095 case 4: 1096 cp[h >> 1] |= (0x0f << ((h & 0x1) << 2)); 1097 return; 1098 case 2: 1099 cp[h >> 2] |= (0x03 << ((h & 0x3) << 1)); 1100 return; 1101 case 1: 1102 cp[h >> 3] |= (0x01 << (h & 0x7)); 1103 return; 1104 default: 1105 fprintf(stderr, "setblock bad fs_frag %d\n", fs->fs_frag); 1106 return; 1107 } 1108 } 1109 1110 /* 1111 * Determine the number of characters in a 1112 * single line. 1113 */ 1114 1115 static int 1116 charsperline(void) 1117 { 1118 int columns; 1119 char *cp; 1120 struct winsize ws; 1121 1122 columns = 0; 1123 if (ioctl(0, TIOCGWINSZ, &ws) != -1) 1124 columns = ws.ws_col; 1125 if (columns == 0 && (cp = getenv("COLUMNS"))) 1126 columns = atoi(cp); 1127 if (columns == 0) 1128 columns = 80; /* last resort */ 1129 return (columns); 1130 } 1131 1132 static int 1133 ilog2(int val) 1134 { 1135 u_int n; 1136 1137 for (n = 0; n < sizeof(n) * CHAR_BIT; n++) 1138 if (1 << n == val) 1139 return (n); 1140 errx(1, "ilog2: %d is not a power of 2\n", val); 1141 } 1142 1143 /* 1144 * For the regression test, return predictable random values. 1145 * Otherwise use a true random number generator. 1146 */ 1147 static u_int32_t 1148 newfs_random(void) 1149 { 1150 static int nextnum = 1; 1151 1152 if (Rflag) 1153 return (nextnum++); 1154 return (arc4random()); 1155 } 1156