1 /* 2 * Copyright (c) 1980, 1989, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * %sccs.include.redist.c% 6 */ 7 8 #ifndef lint 9 static char sccsid[] = "@(#)mkfs.c 8.7 (Berkeley) 11/30/94"; 10 #endif /* not lint */ 11 12 #include <unistd.h> 13 #include <sys/param.h> 14 #include <sys/time.h> 15 #include <sys/wait.h> 16 #include <sys/resource.h> 17 #include <ufs/ufs/dinode.h> 18 #include <ufs/ufs/dir.h> 19 #include <ufs/ffs/fs.h> 20 #include <sys/disklabel.h> 21 22 #ifndef STANDALONE 23 #include <a.out.h> 24 #include <stdio.h> 25 #endif 26 27 /* 28 * make file system for cylinder-group style file systems 29 */ 30 31 /* 32 * We limit the size of the inode map to be no more than a 33 * third of the cylinder group space, since we must leave at 34 * least an equal amount of space for the block map. 35 * 36 * N.B.: MAXIPG must be a multiple of INOPB(fs). 37 */ 38 #define MAXIPG(fs) roundup((fs)->fs_bsize * NBBY / 3, INOPB(fs)) 39 40 #define UMASK 0755 41 #define MAXINOPB (MAXBSIZE / sizeof(struct dinode)) 42 #define POWEROF2(num) (((num) & ((num) - 1)) == 0) 43 44 /* 45 * variables set up by front end. 46 */ 47 extern int mfs; /* run as the memory based filesystem */ 48 extern int Nflag; /* run mkfs without writing file system */ 49 extern int Oflag; /* format as an 4.3BSD file system */ 50 extern int fssize; /* file system size */ 51 extern int ntracks; /* # tracks/cylinder */ 52 extern int nsectors; /* # sectors/track */ 53 extern int nphyssectors; /* # sectors/track including spares */ 54 extern int secpercyl; /* sectors per cylinder */ 55 extern int sectorsize; /* bytes/sector */ 56 extern int rpm; /* revolutions/minute of drive */ 57 extern int interleave; /* hardware sector interleave */ 58 extern int trackskew; /* sector 0 skew, per track */ 59 extern int headswitch; /* head switch time, usec */ 60 extern int trackseek; /* track-to-track seek, usec */ 61 extern int fsize; /* fragment size */ 62 extern int bsize; /* block size */ 63 extern int cpg; /* cylinders/cylinder group */ 64 extern int cpgflg; /* cylinders/cylinder group flag was given */ 65 extern int minfree; /* free space threshold */ 66 extern int opt; /* optimization preference (space or time) */ 67 extern int density; /* number of bytes per inode */ 68 extern int maxcontig; /* max contiguous blocks to allocate */ 69 extern int rotdelay; /* rotational delay between blocks */ 70 extern int maxbpg; /* maximum blocks per file in a cyl group */ 71 extern int nrpos; /* # of distinguished rotational positions */ 72 extern int bbsize; /* boot block size */ 73 extern int sbsize; /* superblock size */ 74 extern u_long memleft; /* virtual memory available */ 75 extern caddr_t membase; /* start address of memory based filesystem */ 76 extern caddr_t malloc(), calloc(); 77 78 union { 79 struct fs fs; 80 char pad[SBSIZE]; 81 } fsun; 82 #define sblock fsun.fs 83 struct csum *fscs; 84 85 union { 86 struct cg cg; 87 char pad[MAXBSIZE]; 88 } cgun; 89 #define acg cgun.cg 90 91 struct dinode zino[MAXBSIZE / sizeof(struct dinode)]; 92 93 int fsi, fso; 94 daddr_t alloc(); 95 96 mkfs(pp, fsys, fi, fo) 97 struct partition *pp; 98 char *fsys; 99 int fi, fo; 100 { 101 register long i, mincpc, mincpg, inospercg; 102 long cylno, rpos, blk, j, warn = 0; 103 long used, mincpgcnt, bpcg; 104 long mapcramped, inodecramped; 105 long postblsize, rotblsize, totalsbsize; 106 int ppid, status; 107 time_t utime; 108 quad_t sizepb; 109 void started(); 110 111 #ifndef STANDALONE 112 time(&utime); 113 #endif 114 if (mfs) { 115 ppid = getpid(); 116 (void) signal(SIGUSR1, started); 117 if (i = fork()) { 118 if (i == -1) { 119 perror("mfs"); 120 exit(10); 121 } 122 if (waitpid(i, &status, 0) != -1 && WIFEXITED(status)) 123 exit(WEXITSTATUS(status)); 124 exit(11); 125 /* NOTREACHED */ 126 } 127 (void)malloc(0); 128 if (fssize * sectorsize > memleft) 129 fssize = (memleft - 16384) / sectorsize; 130 if ((membase = malloc(fssize * sectorsize)) == 0) 131 exit(12); 132 } 133 fsi = fi; 134 fso = fo; 135 if (Oflag) { 136 sblock.fs_inodefmt = FS_42INODEFMT; 137 sblock.fs_maxsymlinklen = 0; 138 } else { 139 sblock.fs_inodefmt = FS_44INODEFMT; 140 sblock.fs_maxsymlinklen = MAXSYMLINKLEN; 141 } 142 /* 143 * Validate the given file system size. 144 * Verify that its last block can actually be accessed. 145 */ 146 if (fssize <= 0) 147 printf("preposterous size %d\n", fssize), exit(13); 148 wtfs(fssize - 1, sectorsize, (char *)&sblock); 149 /* 150 * collect and verify the sector and track info 151 */ 152 sblock.fs_nsect = nsectors; 153 sblock.fs_ntrak = ntracks; 154 if (sblock.fs_ntrak <= 0) 155 printf("preposterous ntrak %d\n", sblock.fs_ntrak), exit(14); 156 if (sblock.fs_nsect <= 0) 157 printf("preposterous nsect %d\n", sblock.fs_nsect), exit(15); 158 /* 159 * collect and verify the block and fragment sizes 160 */ 161 sblock.fs_bsize = bsize; 162 sblock.fs_fsize = fsize; 163 if (!POWEROF2(sblock.fs_bsize)) { 164 printf("block size must be a power of 2, not %d\n", 165 sblock.fs_bsize); 166 exit(16); 167 } 168 if (!POWEROF2(sblock.fs_fsize)) { 169 printf("fragment size must be a power of 2, not %d\n", 170 sblock.fs_fsize); 171 exit(17); 172 } 173 if (sblock.fs_fsize < sectorsize) { 174 printf("fragment size %d is too small, minimum is %d\n", 175 sblock.fs_fsize, sectorsize); 176 exit(18); 177 } 178 if (sblock.fs_bsize < MINBSIZE) { 179 printf("block size %d is too small, minimum is %d\n", 180 sblock.fs_bsize, MINBSIZE); 181 exit(19); 182 } 183 if (sblock.fs_bsize < sblock.fs_fsize) { 184 printf("block size (%d) cannot be smaller than fragment size (%d)\n", 185 sblock.fs_bsize, sblock.fs_fsize); 186 exit(20); 187 } 188 sblock.fs_bmask = ~(sblock.fs_bsize - 1); 189 sblock.fs_fmask = ~(sblock.fs_fsize - 1); 190 sblock.fs_qbmask = ~sblock.fs_bmask; 191 sblock.fs_qfmask = ~sblock.fs_fmask; 192 for (sblock.fs_bshift = 0, i = sblock.fs_bsize; i > 1; i >>= 1) 193 sblock.fs_bshift++; 194 for (sblock.fs_fshift = 0, i = sblock.fs_fsize; i > 1; i >>= 1) 195 sblock.fs_fshift++; 196 sblock.fs_frag = numfrags(&sblock, sblock.fs_bsize); 197 for (sblock.fs_fragshift = 0, i = sblock.fs_frag; i > 1; i >>= 1) 198 sblock.fs_fragshift++; 199 if (sblock.fs_frag > MAXFRAG) { 200 printf("fragment size %d is too small, minimum with block size %d is %d\n", 201 sblock.fs_fsize, sblock.fs_bsize, 202 sblock.fs_bsize / MAXFRAG); 203 exit(21); 204 } 205 sblock.fs_nrpos = nrpos; 206 sblock.fs_nindir = sblock.fs_bsize / sizeof(daddr_t); 207 sblock.fs_inopb = sblock.fs_bsize / sizeof(struct dinode); 208 sblock.fs_nspf = sblock.fs_fsize / sectorsize; 209 for (sblock.fs_fsbtodb = 0, i = NSPF(&sblock); i > 1; i >>= 1) 210 sblock.fs_fsbtodb++; 211 sblock.fs_sblkno = 212 roundup(howmany(bbsize + sbsize, sblock.fs_fsize), sblock.fs_frag); 213 sblock.fs_cblkno = (daddr_t)(sblock.fs_sblkno + 214 roundup(howmany(sbsize, sblock.fs_fsize), sblock.fs_frag)); 215 sblock.fs_iblkno = sblock.fs_cblkno + sblock.fs_frag; 216 sblock.fs_cgoffset = roundup( 217 howmany(sblock.fs_nsect, NSPF(&sblock)), sblock.fs_frag); 218 for (sblock.fs_cgmask = 0xffffffff, i = sblock.fs_ntrak; i > 1; i >>= 1) 219 sblock.fs_cgmask <<= 1; 220 if (!POWEROF2(sblock.fs_ntrak)) 221 sblock.fs_cgmask <<= 1; 222 sblock.fs_maxfilesize = sblock.fs_bsize * NDADDR - 1; 223 for (sizepb = sblock.fs_bsize, i = 0; i < NIADDR; i++) { 224 sizepb *= NINDIR(&sblock); 225 sblock.fs_maxfilesize += sizepb; 226 } 227 /* 228 * Validate specified/determined secpercyl 229 * and calculate minimum cylinders per group. 230 */ 231 sblock.fs_spc = secpercyl; 232 for (sblock.fs_cpc = NSPB(&sblock), i = sblock.fs_spc; 233 sblock.fs_cpc > 1 && (i & 1) == 0; 234 sblock.fs_cpc >>= 1, i >>= 1) 235 /* void */; 236 mincpc = sblock.fs_cpc; 237 bpcg = sblock.fs_spc * sectorsize; 238 inospercg = roundup(bpcg / sizeof(struct dinode), INOPB(&sblock)); 239 if (inospercg > MAXIPG(&sblock)) 240 inospercg = MAXIPG(&sblock); 241 used = (sblock.fs_iblkno + inospercg / INOPF(&sblock)) * NSPF(&sblock); 242 mincpgcnt = howmany(sblock.fs_cgoffset * (~sblock.fs_cgmask) + used, 243 sblock.fs_spc); 244 mincpg = roundup(mincpgcnt, mincpc); 245 /* 246 * Ensure that cylinder group with mincpg has enough space 247 * for block maps. 248 */ 249 sblock.fs_cpg = mincpg; 250 sblock.fs_ipg = inospercg; 251 if (maxcontig > 1) 252 sblock.fs_contigsumsize = MIN(maxcontig, FS_MAXCONTIG); 253 mapcramped = 0; 254 while (CGSIZE(&sblock) > sblock.fs_bsize) { 255 mapcramped = 1; 256 if (sblock.fs_bsize < MAXBSIZE) { 257 sblock.fs_bsize <<= 1; 258 if ((i & 1) == 0) { 259 i >>= 1; 260 } else { 261 sblock.fs_cpc <<= 1; 262 mincpc <<= 1; 263 mincpg = roundup(mincpgcnt, mincpc); 264 sblock.fs_cpg = mincpg; 265 } 266 sblock.fs_frag <<= 1; 267 sblock.fs_fragshift += 1; 268 if (sblock.fs_frag <= MAXFRAG) 269 continue; 270 } 271 if (sblock.fs_fsize == sblock.fs_bsize) { 272 printf("There is no block size that"); 273 printf(" can support this disk\n"); 274 exit(22); 275 } 276 sblock.fs_frag >>= 1; 277 sblock.fs_fragshift -= 1; 278 sblock.fs_fsize <<= 1; 279 sblock.fs_nspf <<= 1; 280 } 281 /* 282 * Ensure that cylinder group with mincpg has enough space for inodes. 283 */ 284 inodecramped = 0; 285 used *= sectorsize; 286 inospercg = roundup((mincpg * bpcg - used) / density, INOPB(&sblock)); 287 sblock.fs_ipg = inospercg; 288 while (inospercg > MAXIPG(&sblock)) { 289 inodecramped = 1; 290 if (mincpc == 1 || sblock.fs_frag == 1 || 291 sblock.fs_bsize == MINBSIZE) 292 break; 293 printf("With a block size of %d %s %d\n", sblock.fs_bsize, 294 "minimum bytes per inode is", 295 (mincpg * bpcg - used) / MAXIPG(&sblock) + 1); 296 sblock.fs_bsize >>= 1; 297 sblock.fs_frag >>= 1; 298 sblock.fs_fragshift -= 1; 299 mincpc >>= 1; 300 sblock.fs_cpg = roundup(mincpgcnt, mincpc); 301 if (CGSIZE(&sblock) > sblock.fs_bsize) { 302 sblock.fs_bsize <<= 1; 303 break; 304 } 305 mincpg = sblock.fs_cpg; 306 inospercg = 307 roundup((mincpg * bpcg - used) / density, INOPB(&sblock)); 308 sblock.fs_ipg = inospercg; 309 } 310 if (inodecramped) { 311 if (inospercg > MAXIPG(&sblock)) { 312 printf("Minimum bytes per inode is %d\n", 313 (mincpg * bpcg - used) / MAXIPG(&sblock) + 1); 314 } else if (!mapcramped) { 315 printf("With %d bytes per inode, ", density); 316 printf("minimum cylinders per group is %d\n", mincpg); 317 } 318 } 319 if (mapcramped) { 320 printf("With %d sectors per cylinder, ", sblock.fs_spc); 321 printf("minimum cylinders per group is %d\n", mincpg); 322 } 323 if (inodecramped || mapcramped) { 324 if (sblock.fs_bsize != bsize) 325 printf("%s to be changed from %d to %d\n", 326 "This requires the block size", 327 bsize, sblock.fs_bsize); 328 if (sblock.fs_fsize != fsize) 329 printf("\t%s to be changed from %d to %d\n", 330 "and the fragment size", 331 fsize, sblock.fs_fsize); 332 exit(23); 333 } 334 /* 335 * Calculate the number of cylinders per group 336 */ 337 sblock.fs_cpg = cpg; 338 if (sblock.fs_cpg % mincpc != 0) { 339 printf("%s groups must have a multiple of %d cylinders\n", 340 cpgflg ? "Cylinder" : "Warning: cylinder", mincpc); 341 sblock.fs_cpg = roundup(sblock.fs_cpg, mincpc); 342 if (!cpgflg) 343 cpg = sblock.fs_cpg; 344 } 345 /* 346 * Must ensure there is enough space for inodes. 347 */ 348 sblock.fs_ipg = roundup((sblock.fs_cpg * bpcg - used) / density, 349 INOPB(&sblock)); 350 while (sblock.fs_ipg > MAXIPG(&sblock)) { 351 inodecramped = 1; 352 sblock.fs_cpg -= mincpc; 353 sblock.fs_ipg = roundup((sblock.fs_cpg * bpcg - used) / density, 354 INOPB(&sblock)); 355 } 356 /* 357 * Must ensure there is enough space to hold block map. 358 */ 359 while (CGSIZE(&sblock) > sblock.fs_bsize) { 360 mapcramped = 1; 361 sblock.fs_cpg -= mincpc; 362 sblock.fs_ipg = roundup((sblock.fs_cpg * bpcg - used) / density, 363 INOPB(&sblock)); 364 } 365 sblock.fs_fpg = (sblock.fs_cpg * sblock.fs_spc) / NSPF(&sblock); 366 if ((sblock.fs_cpg * sblock.fs_spc) % NSPB(&sblock) != 0) { 367 printf("panic (fs_cpg * fs_spc) % NSPF != 0"); 368 exit(24); 369 } 370 if (sblock.fs_cpg < mincpg) { 371 printf("cylinder groups must have at least %d cylinders\n", 372 mincpg); 373 exit(25); 374 } else if (sblock.fs_cpg != cpg) { 375 if (!cpgflg) 376 printf("Warning: "); 377 else if (!mapcramped && !inodecramped) 378 exit(26); 379 if (mapcramped && inodecramped) 380 printf("Block size and bytes per inode restrict"); 381 else if (mapcramped) 382 printf("Block size restricts"); 383 else 384 printf("Bytes per inode restrict"); 385 printf(" cylinders per group to %d.\n", sblock.fs_cpg); 386 if (cpgflg) 387 exit(27); 388 } 389 sblock.fs_cgsize = fragroundup(&sblock, CGSIZE(&sblock)); 390 /* 391 * Now have size for file system and nsect and ntrak. 392 * Determine number of cylinders and blocks in the file system. 393 */ 394 sblock.fs_size = fssize = dbtofsb(&sblock, fssize); 395 sblock.fs_ncyl = fssize * NSPF(&sblock) / sblock.fs_spc; 396 if (fssize * NSPF(&sblock) > sblock.fs_ncyl * sblock.fs_spc) { 397 sblock.fs_ncyl++; 398 warn = 1; 399 } 400 if (sblock.fs_ncyl < 1) { 401 printf("file systems must have at least one cylinder\n"); 402 exit(28); 403 } 404 /* 405 * Determine feasability/values of rotational layout tables. 406 * 407 * The size of the rotational layout tables is limited by the 408 * size of the superblock, SBSIZE. The amount of space available 409 * for tables is calculated as (SBSIZE - sizeof (struct fs)). 410 * The size of these tables is inversely proportional to the block 411 * size of the file system. The size increases if sectors per track 412 * are not powers of two, because more cylinders must be described 413 * by the tables before the rotational pattern repeats (fs_cpc). 414 */ 415 sblock.fs_interleave = interleave; 416 sblock.fs_trackskew = trackskew; 417 sblock.fs_npsect = nphyssectors; 418 sblock.fs_postblformat = FS_DYNAMICPOSTBLFMT; 419 sblock.fs_sbsize = fragroundup(&sblock, sizeof(struct fs)); 420 if (sblock.fs_ntrak == 1) { 421 sblock.fs_cpc = 0; 422 goto next; 423 } 424 postblsize = sblock.fs_nrpos * sblock.fs_cpc * sizeof(short); 425 rotblsize = sblock.fs_cpc * sblock.fs_spc / NSPB(&sblock); 426 totalsbsize = sizeof(struct fs) + rotblsize; 427 if (sblock.fs_nrpos == 8 && sblock.fs_cpc <= 16) { 428 /* use old static table space */ 429 sblock.fs_postbloff = (char *)(&sblock.fs_opostbl[0][0]) - 430 (char *)(&sblock.fs_firstfield); 431 sblock.fs_rotbloff = &sblock.fs_space[0] - 432 (u_char *)(&sblock.fs_firstfield); 433 } else { 434 /* use dynamic table space */ 435 sblock.fs_postbloff = &sblock.fs_space[0] - 436 (u_char *)(&sblock.fs_firstfield); 437 sblock.fs_rotbloff = sblock.fs_postbloff + postblsize; 438 totalsbsize += postblsize; 439 } 440 if (totalsbsize > SBSIZE || 441 sblock.fs_nsect > (1 << NBBY) * NSPB(&sblock)) { 442 printf("%s %s %d %s %d.%s", 443 "Warning: insufficient space in super block for\n", 444 "rotational layout tables with nsect", sblock.fs_nsect, 445 "and ntrak", sblock.fs_ntrak, 446 "\nFile system performance may be impaired.\n"); 447 sblock.fs_cpc = 0; 448 goto next; 449 } 450 sblock.fs_sbsize = fragroundup(&sblock, totalsbsize); 451 /* 452 * calculate the available blocks for each rotational position 453 */ 454 for (cylno = 0; cylno < sblock.fs_cpc; cylno++) 455 for (rpos = 0; rpos < sblock.fs_nrpos; rpos++) 456 fs_postbl(&sblock, cylno)[rpos] = -1; 457 for (i = (rotblsize - 1) * sblock.fs_frag; 458 i >= 0; i -= sblock.fs_frag) { 459 cylno = cbtocylno(&sblock, i); 460 rpos = cbtorpos(&sblock, i); 461 blk = fragstoblks(&sblock, i); 462 if (fs_postbl(&sblock, cylno)[rpos] == -1) 463 fs_rotbl(&sblock)[blk] = 0; 464 else 465 fs_rotbl(&sblock)[blk] = 466 fs_postbl(&sblock, cylno)[rpos] - blk; 467 fs_postbl(&sblock, cylno)[rpos] = blk; 468 } 469 next: 470 /* 471 * Compute/validate number of cylinder groups. 472 */ 473 sblock.fs_ncg = sblock.fs_ncyl / sblock.fs_cpg; 474 if (sblock.fs_ncyl % sblock.fs_cpg) 475 sblock.fs_ncg++; 476 sblock.fs_dblkno = sblock.fs_iblkno + sblock.fs_ipg / INOPF(&sblock); 477 i = MIN(~sblock.fs_cgmask, sblock.fs_ncg - 1); 478 if (cgdmin(&sblock, i) - cgbase(&sblock, i) >= sblock.fs_fpg) { 479 printf("inode blocks/cyl group (%d) >= data blocks (%d)\n", 480 cgdmin(&sblock, i) - cgbase(&sblock, i) / sblock.fs_frag, 481 sblock.fs_fpg / sblock.fs_frag); 482 printf("number of cylinders per cylinder group (%d) %s.\n", 483 sblock.fs_cpg, "must be increased"); 484 exit(29); 485 } 486 j = sblock.fs_ncg - 1; 487 if ((i = fssize - j * sblock.fs_fpg) < sblock.fs_fpg && 488 cgdmin(&sblock, j) - cgbase(&sblock, j) > i) { 489 if (j == 0) { 490 printf("Filesystem must have at least %d sectors\n", 491 NSPF(&sblock) * 492 (cgdmin(&sblock, 0) + 3 * sblock.fs_frag)); 493 exit(30); 494 } 495 printf("Warning: inode blocks/cyl group (%d) >= data blocks (%d) in last\n", 496 (cgdmin(&sblock, j) - cgbase(&sblock, j)) / sblock.fs_frag, 497 i / sblock.fs_frag); 498 printf(" cylinder group. This implies %d sector(s) cannot be allocated.\n", 499 i * NSPF(&sblock)); 500 sblock.fs_ncg--; 501 sblock.fs_ncyl -= sblock.fs_ncyl % sblock.fs_cpg; 502 sblock.fs_size = fssize = sblock.fs_ncyl * sblock.fs_spc / 503 NSPF(&sblock); 504 warn = 0; 505 } 506 if (warn && !mfs) { 507 printf("Warning: %d sector(s) in last cylinder unallocated\n", 508 sblock.fs_spc - 509 (fssize * NSPF(&sblock) - (sblock.fs_ncyl - 1) 510 * sblock.fs_spc)); 511 } 512 /* 513 * fill in remaining fields of the super block 514 */ 515 sblock.fs_csaddr = cgdmin(&sblock, 0); 516 sblock.fs_cssize = 517 fragroundup(&sblock, sblock.fs_ncg * sizeof(struct csum)); 518 i = sblock.fs_bsize / sizeof(struct csum); 519 sblock.fs_csmask = ~(i - 1); 520 for (sblock.fs_csshift = 0; i > 1; i >>= 1) 521 sblock.fs_csshift++; 522 fscs = (struct csum *)calloc(1, sblock.fs_cssize); 523 sblock.fs_magic = FS_MAGIC; 524 sblock.fs_rotdelay = rotdelay; 525 sblock.fs_minfree = minfree; 526 sblock.fs_maxcontig = maxcontig; 527 sblock.fs_headswitch = headswitch; 528 sblock.fs_trkseek = trackseek; 529 sblock.fs_maxbpg = maxbpg; 530 sblock.fs_rps = rpm / 60; 531 sblock.fs_optim = opt; 532 sblock.fs_cgrotor = 0; 533 sblock.fs_cstotal.cs_ndir = 0; 534 sblock.fs_cstotal.cs_nbfree = 0; 535 sblock.fs_cstotal.cs_nifree = 0; 536 sblock.fs_cstotal.cs_nffree = 0; 537 sblock.fs_fmod = 0; 538 sblock.fs_ronly = 0; 539 /* 540 * Dump out summary information about file system. 541 */ 542 if (!mfs) { 543 printf("%s:\t%d sectors in %d %s of %d tracks, %d sectors\n", 544 fsys, sblock.fs_size * NSPF(&sblock), sblock.fs_ncyl, 545 "cylinders", sblock.fs_ntrak, sblock.fs_nsect); 546 #define B2MBFACTOR (1 / (1024.0 * 1024.0)) 547 printf("\t%.1fMB in %d cyl groups (%d c/g, %.2fMB/g, %d i/g)\n", 548 (float)sblock.fs_size * sblock.fs_fsize * B2MBFACTOR, 549 sblock.fs_ncg, sblock.fs_cpg, 550 (float)sblock.fs_fpg * sblock.fs_fsize * B2MBFACTOR, 551 sblock.fs_ipg); 552 #undef B2MBFACTOR 553 } 554 /* 555 * Now build the cylinders group blocks and 556 * then print out indices of cylinder groups. 557 */ 558 if (!mfs) 559 printf("super-block backups (for fsck -b #) at:"); 560 for (cylno = 0; cylno < sblock.fs_ncg; cylno++) { 561 initcg(cylno, utime); 562 if (mfs) 563 continue; 564 if (cylno % 8 == 0) 565 printf("\n"); 566 printf(" %d,", fsbtodb(&sblock, cgsblock(&sblock, cylno))); 567 } 568 if (!mfs) 569 printf("\n"); 570 if (Nflag && !mfs) 571 exit(0); 572 /* 573 * Now construct the initial file system, 574 * then write out the super-block. 575 */ 576 fsinit(utime); 577 sblock.fs_time = utime; 578 wtfs((int)SBOFF / sectorsize, sbsize, (char *)&sblock); 579 for (i = 0; i < sblock.fs_cssize; i += sblock.fs_bsize) 580 wtfs(fsbtodb(&sblock, sblock.fs_csaddr + numfrags(&sblock, i)), 581 sblock.fs_cssize - i < sblock.fs_bsize ? 582 sblock.fs_cssize - i : sblock.fs_bsize, 583 ((char *)fscs) + i); 584 /* 585 * Write out the duplicate super blocks 586 */ 587 for (cylno = 0; cylno < sblock.fs_ncg; cylno++) 588 wtfs(fsbtodb(&sblock, cgsblock(&sblock, cylno)), 589 sbsize, (char *)&sblock); 590 /* 591 * Update information about this partion in pack 592 * label, to that it may be updated on disk. 593 */ 594 pp->p_fstype = FS_BSDFFS; 595 pp->p_fsize = sblock.fs_fsize; 596 pp->p_frag = sblock.fs_frag; 597 pp->p_cpg = sblock.fs_cpg; 598 /* 599 * Notify parent process of success. 600 * Dissociate from session and tty. 601 */ 602 if (mfs) { 603 kill(ppid, SIGUSR1); 604 (void) setsid(); 605 (void) close(0); 606 (void) close(1); 607 (void) close(2); 608 (void) chdir("/"); 609 } 610 } 611 612 /* 613 * Initialize a cylinder group. 614 */ 615 initcg(cylno, utime) 616 int cylno; 617 time_t utime; 618 { 619 daddr_t cbase, d, dlower, dupper, dmax, blkno; 620 long i, j, s; 621 register struct csum *cs; 622 623 /* 624 * Determine block bounds for cylinder group. 625 * Allow space for super block summary information in first 626 * cylinder group. 627 */ 628 cbase = cgbase(&sblock, cylno); 629 dmax = cbase + sblock.fs_fpg; 630 if (dmax > sblock.fs_size) 631 dmax = sblock.fs_size; 632 dlower = cgsblock(&sblock, cylno) - cbase; 633 dupper = cgdmin(&sblock, cylno) - cbase; 634 if (cylno == 0) 635 dupper += howmany(sblock.fs_cssize, sblock.fs_fsize); 636 cs = fscs + cylno; 637 bzero(&acg, sblock.fs_cgsize); 638 acg.cg_time = utime; 639 acg.cg_magic = CG_MAGIC; 640 acg.cg_cgx = cylno; 641 if (cylno == sblock.fs_ncg - 1) 642 acg.cg_ncyl = sblock.fs_ncyl % sblock.fs_cpg; 643 else 644 acg.cg_ncyl = sblock.fs_cpg; 645 acg.cg_niblk = sblock.fs_ipg; 646 acg.cg_ndblk = dmax - cbase; 647 if (sblock.fs_contigsumsize > 0) 648 acg.cg_nclusterblks = acg.cg_ndblk / sblock.fs_frag; 649 acg.cg_btotoff = &acg.cg_space[0] - (u_char *)(&acg.cg_firstfield); 650 acg.cg_boff = acg.cg_btotoff + sblock.fs_cpg * sizeof(long); 651 acg.cg_iusedoff = acg.cg_boff + 652 sblock.fs_cpg * sblock.fs_nrpos * sizeof(short); 653 acg.cg_freeoff = acg.cg_iusedoff + howmany(sblock.fs_ipg, NBBY); 654 if (sblock.fs_contigsumsize <= 0) { 655 acg.cg_nextfreeoff = acg.cg_freeoff + 656 howmany(sblock.fs_cpg * sblock.fs_spc / NSPF(&sblock), NBBY); 657 } else { 658 acg.cg_clustersumoff = acg.cg_freeoff + howmany 659 (sblock.fs_cpg * sblock.fs_spc / NSPF(&sblock), NBBY) - 660 sizeof(long); 661 acg.cg_clustersumoff = 662 roundup(acg.cg_clustersumoff, sizeof(long)); 663 acg.cg_clusteroff = acg.cg_clustersumoff + 664 (sblock.fs_contigsumsize + 1) * sizeof(long); 665 acg.cg_nextfreeoff = acg.cg_clusteroff + howmany 666 (sblock.fs_cpg * sblock.fs_spc / NSPB(&sblock), NBBY); 667 } 668 if (acg.cg_nextfreeoff - (long)(&acg.cg_firstfield) > sblock.fs_cgsize) { 669 printf("Panic: cylinder group too big\n"); 670 exit(37); 671 } 672 acg.cg_cs.cs_nifree += sblock.fs_ipg; 673 if (cylno == 0) 674 for (i = 0; i < ROOTINO; i++) { 675 setbit(cg_inosused(&acg), i); 676 acg.cg_cs.cs_nifree--; 677 } 678 for (i = 0; i < sblock.fs_ipg / INOPF(&sblock); i += sblock.fs_frag) 679 wtfs(fsbtodb(&sblock, cgimin(&sblock, cylno) + i), 680 sblock.fs_bsize, (char *)zino); 681 if (cylno > 0) { 682 /* 683 * In cylno 0, beginning space is reserved 684 * for boot and super blocks. 685 */ 686 for (d = 0; d < dlower; d += sblock.fs_frag) { 687 blkno = d / sblock.fs_frag; 688 setblock(&sblock, cg_blksfree(&acg), blkno); 689 if (sblock.fs_contigsumsize > 0) 690 setbit(cg_clustersfree(&acg), blkno); 691 acg.cg_cs.cs_nbfree++; 692 cg_blktot(&acg)[cbtocylno(&sblock, d)]++; 693 cg_blks(&sblock, &acg, cbtocylno(&sblock, d)) 694 [cbtorpos(&sblock, d)]++; 695 } 696 sblock.fs_dsize += dlower; 697 } 698 sblock.fs_dsize += acg.cg_ndblk - dupper; 699 if (i = dupper % sblock.fs_frag) { 700 acg.cg_frsum[sblock.fs_frag - i]++; 701 for (d = dupper + sblock.fs_frag - i; dupper < d; dupper++) { 702 setbit(cg_blksfree(&acg), dupper); 703 acg.cg_cs.cs_nffree++; 704 } 705 } 706 for (d = dupper; d + sblock.fs_frag <= dmax - cbase; ) { 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 cg_blktot(&acg)[cbtocylno(&sblock, d)]++; 713 cg_blks(&sblock, &acg, cbtocylno(&sblock, d)) 714 [cbtorpos(&sblock, d)]++; 715 d += sblock.fs_frag; 716 } 717 if (d < dmax - cbase) { 718 acg.cg_frsum[dmax - cbase - d]++; 719 for (; d < dmax - cbase; d++) { 720 setbit(cg_blksfree(&acg), d); 721 acg.cg_cs.cs_nffree++; 722 } 723 } 724 if (sblock.fs_contigsumsize > 0) { 725 int32_t *sump = cg_clustersum(&acg); 726 u_char *mapp = cg_clustersfree(&acg); 727 int map = *mapp++; 728 int bit = 1; 729 int run = 0; 730 731 for (i = 0; i < acg.cg_nclusterblks; i++) { 732 if ((map & bit) != 0) { 733 run++; 734 } else if (run != 0) { 735 if (run > sblock.fs_contigsumsize) 736 run = sblock.fs_contigsumsize; 737 sump[run]++; 738 run = 0; 739 } 740 if ((i & (NBBY - 1)) != (NBBY - 1)) { 741 bit <<= 1; 742 } else { 743 map = *mapp++; 744 bit = 1; 745 } 746 } 747 if (run != 0) { 748 if (run > sblock.fs_contigsumsize) 749 run = sblock.fs_contigsumsize; 750 sump[run]++; 751 } 752 } 753 sblock.fs_cstotal.cs_ndir += acg.cg_cs.cs_ndir; 754 sblock.fs_cstotal.cs_nffree += acg.cg_cs.cs_nffree; 755 sblock.fs_cstotal.cs_nbfree += acg.cg_cs.cs_nbfree; 756 sblock.fs_cstotal.cs_nifree += acg.cg_cs.cs_nifree; 757 *cs = acg.cg_cs; 758 wtfs(fsbtodb(&sblock, cgtod(&sblock, cylno)), 759 sblock.fs_bsize, (char *)&acg); 760 } 761 762 /* 763 * initialize the file system 764 */ 765 struct dinode node; 766 767 #ifdef LOSTDIR 768 #define PREDEFDIR 3 769 #else 770 #define PREDEFDIR 2 771 #endif 772 773 struct direct root_dir[] = { 774 { ROOTINO, sizeof(struct direct), DT_DIR, 1, "." }, 775 { ROOTINO, sizeof(struct direct), DT_DIR, 2, ".." }, 776 #ifdef LOSTDIR 777 { LOSTFOUNDINO, sizeof(struct direct), DT_DIR, 10, "lost+found" }, 778 #endif 779 }; 780 struct odirect { 781 u_long d_ino; 782 u_short d_reclen; 783 u_short d_namlen; 784 u_char d_name[MAXNAMLEN + 1]; 785 } oroot_dir[] = { 786 { ROOTINO, sizeof(struct direct), 1, "." }, 787 { ROOTINO, sizeof(struct direct), 2, ".." }, 788 #ifdef LOSTDIR 789 { LOSTFOUNDINO, sizeof(struct direct), 10, "lost+found" }, 790 #endif 791 }; 792 #ifdef LOSTDIR 793 struct direct lost_found_dir[] = { 794 { LOSTFOUNDINO, sizeof(struct direct), DT_DIR, 1, "." }, 795 { ROOTINO, sizeof(struct direct), DT_DIR, 2, ".." }, 796 { 0, DIRBLKSIZ, 0, 0, 0 }, 797 }; 798 struct odirect olost_found_dir[] = { 799 { LOSTFOUNDINO, sizeof(struct direct), 1, "." }, 800 { ROOTINO, sizeof(struct direct), 2, ".." }, 801 { 0, DIRBLKSIZ, 0, 0 }, 802 }; 803 #endif 804 char buf[MAXBSIZE]; 805 806 fsinit(utime) 807 time_t utime; 808 { 809 int i; 810 811 /* 812 * initialize the node 813 */ 814 node.di_atime.ts_sec = utime; 815 node.di_mtime.ts_sec = utime; 816 node.di_ctime.ts_sec = utime; 817 #ifdef LOSTDIR 818 /* 819 * create the lost+found directory 820 */ 821 if (Oflag) { 822 (void)makedir((struct direct *)olost_found_dir, 2); 823 for (i = DIRBLKSIZ; i < sblock.fs_bsize; i += DIRBLKSIZ) 824 bcopy(&olost_found_dir[2], &buf[i], 825 DIRSIZ(0, &olost_found_dir[2])); 826 } else { 827 (void)makedir(lost_found_dir, 2); 828 for (i = DIRBLKSIZ; i < sblock.fs_bsize; i += DIRBLKSIZ) 829 bcopy(&lost_found_dir[2], &buf[i], 830 DIRSIZ(0, &lost_found_dir[2])); 831 } 832 node.di_mode = IFDIR | UMASK; 833 node.di_nlink = 2; 834 node.di_size = sblock.fs_bsize; 835 node.di_db[0] = alloc(node.di_size, node.di_mode); 836 node.di_blocks = btodb(fragroundup(&sblock, node.di_size)); 837 wtfs(fsbtodb(&sblock, node.di_db[0]), node.di_size, buf); 838 iput(&node, LOSTFOUNDINO); 839 #endif 840 /* 841 * create the root directory 842 */ 843 if (mfs) 844 node.di_mode = IFDIR | 01777; 845 else 846 node.di_mode = IFDIR | UMASK; 847 node.di_nlink = PREDEFDIR; 848 if (Oflag) 849 node.di_size = makedir((struct direct *)oroot_dir, PREDEFDIR); 850 else 851 node.di_size = makedir(root_dir, PREDEFDIR); 852 node.di_db[0] = alloc(sblock.fs_fsize, node.di_mode); 853 node.di_blocks = btodb(fragroundup(&sblock, node.di_size)); 854 wtfs(fsbtodb(&sblock, node.di_db[0]), sblock.fs_fsize, buf); 855 iput(&node, ROOTINO); 856 } 857 858 /* 859 * construct a set of directory entries in "buf". 860 * return size of directory. 861 */ 862 makedir(protodir, entries) 863 register struct direct *protodir; 864 int entries; 865 { 866 char *cp; 867 int i, spcleft; 868 869 spcleft = DIRBLKSIZ; 870 for (cp = buf, i = 0; i < entries - 1; i++) { 871 protodir[i].d_reclen = DIRSIZ(0, &protodir[i]); 872 bcopy(&protodir[i], cp, protodir[i].d_reclen); 873 cp += protodir[i].d_reclen; 874 spcleft -= protodir[i].d_reclen; 875 } 876 protodir[i].d_reclen = spcleft; 877 bcopy(&protodir[i], cp, DIRSIZ(0, &protodir[i])); 878 return (DIRBLKSIZ); 879 } 880 881 /* 882 * allocate a block or frag 883 */ 884 daddr_t 885 alloc(size, mode) 886 int size; 887 int mode; 888 { 889 int i, frag; 890 daddr_t d, blkno; 891 892 rdfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize, 893 (char *)&acg); 894 if (acg.cg_magic != CG_MAGIC) { 895 printf("cg 0: bad magic number\n"); 896 return (0); 897 } 898 if (acg.cg_cs.cs_nbfree == 0) { 899 printf("first cylinder group ran out of space\n"); 900 return (0); 901 } 902 for (d = 0; d < acg.cg_ndblk; d += sblock.fs_frag) 903 if (isblock(&sblock, cg_blksfree(&acg), d / sblock.fs_frag)) 904 goto goth; 905 printf("internal error: can't find block in cyl 0\n"); 906 return (0); 907 goth: 908 blkno = fragstoblks(&sblock, d); 909 clrblock(&sblock, cg_blksfree(&acg), blkno); 910 if (sblock.fs_contigsumsize > 0) 911 clrbit(cg_clustersfree(&acg), blkno); 912 acg.cg_cs.cs_nbfree--; 913 sblock.fs_cstotal.cs_nbfree--; 914 fscs[0].cs_nbfree--; 915 if (mode & IFDIR) { 916 acg.cg_cs.cs_ndir++; 917 sblock.fs_cstotal.cs_ndir++; 918 fscs[0].cs_ndir++; 919 } 920 cg_blktot(&acg)[cbtocylno(&sblock, d)]--; 921 cg_blks(&sblock, &acg, cbtocylno(&sblock, d))[cbtorpos(&sblock, d)]--; 922 if (size != sblock.fs_bsize) { 923 frag = howmany(size, sblock.fs_fsize); 924 fscs[0].cs_nffree += sblock.fs_frag - frag; 925 sblock.fs_cstotal.cs_nffree += sblock.fs_frag - frag; 926 acg.cg_cs.cs_nffree += sblock.fs_frag - frag; 927 acg.cg_frsum[sblock.fs_frag - frag]++; 928 for (i = frag; i < sblock.fs_frag; i++) 929 setbit(cg_blksfree(&acg), d + i); 930 } 931 wtfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize, 932 (char *)&acg); 933 return (d); 934 } 935 936 /* 937 * Allocate an inode on the disk 938 */ 939 iput(ip, ino) 940 register struct dinode *ip; 941 register ino_t ino; 942 { 943 struct dinode buf[MAXINOPB]; 944 daddr_t d; 945 int c; 946 947 c = ino_to_cg(&sblock, ino); 948 rdfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize, 949 (char *)&acg); 950 if (acg.cg_magic != CG_MAGIC) { 951 printf("cg 0: bad magic number\n"); 952 exit(31); 953 } 954 acg.cg_cs.cs_nifree--; 955 setbit(cg_inosused(&acg), ino); 956 wtfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize, 957 (char *)&acg); 958 sblock.fs_cstotal.cs_nifree--; 959 fscs[0].cs_nifree--; 960 if (ino >= sblock.fs_ipg * sblock.fs_ncg) { 961 printf("fsinit: inode value out of range (%d).\n", ino); 962 exit(32); 963 } 964 d = fsbtodb(&sblock, ino_to_fsba(&sblock, ino)); 965 rdfs(d, sblock.fs_bsize, buf); 966 buf[ino_to_fsbo(&sblock, ino)] = *ip; 967 wtfs(d, sblock.fs_bsize, buf); 968 } 969 970 /* 971 * Notify parent process that the filesystem has created itself successfully. 972 */ 973 void 974 started() 975 { 976 977 exit(0); 978 } 979 980 /* 981 * Replace libc function with one suited to our needs. 982 */ 983 caddr_t 984 malloc(size) 985 register u_long size; 986 { 987 char *base, *i; 988 static u_long pgsz; 989 struct rlimit rlp; 990 991 if (pgsz == 0) { 992 base = sbrk(0); 993 pgsz = getpagesize() - 1; 994 i = (char *)((u_long)(base + pgsz) &~ pgsz); 995 base = sbrk(i - base); 996 if (getrlimit(RLIMIT_DATA, &rlp) < 0) 997 perror("getrlimit"); 998 rlp.rlim_cur = rlp.rlim_max; 999 if (setrlimit(RLIMIT_DATA, &rlp) < 0) 1000 perror("setrlimit"); 1001 memleft = rlp.rlim_max - (u_long)base; 1002 } 1003 size = (size + pgsz) &~ pgsz; 1004 if (size > memleft) 1005 size = memleft; 1006 memleft -= size; 1007 if (size == 0) 1008 return (0); 1009 return ((caddr_t)sbrk(size)); 1010 } 1011 1012 /* 1013 * Replace libc function with one suited to our needs. 1014 */ 1015 caddr_t 1016 realloc(ptr, size) 1017 char *ptr; 1018 u_long size; 1019 { 1020 void *p; 1021 1022 if ((p = malloc(size)) == NULL) 1023 return (NULL); 1024 bcopy(ptr, p, size); 1025 free(ptr); 1026 return (p); 1027 } 1028 1029 /* 1030 * Replace libc function with one suited to our needs. 1031 */ 1032 char * 1033 calloc(size, numelm) 1034 u_long size, numelm; 1035 { 1036 caddr_t base; 1037 1038 size *= numelm; 1039 base = malloc(size); 1040 bzero(base, size); 1041 return (base); 1042 } 1043 1044 /* 1045 * Replace libc function with one suited to our needs. 1046 */ 1047 free(ptr) 1048 char *ptr; 1049 { 1050 1051 /* do not worry about it for now */ 1052 } 1053 1054 /* 1055 * read a block from the file system 1056 */ 1057 rdfs(bno, size, bf) 1058 daddr_t bno; 1059 int size; 1060 char *bf; 1061 { 1062 int n; 1063 1064 if (mfs) { 1065 bcopy(membase + bno * sectorsize, bf, size); 1066 return; 1067 } 1068 if (lseek(fsi, (off_t)bno * sectorsize, 0) < 0) { 1069 printf("seek error: %ld\n", bno); 1070 perror("rdfs"); 1071 exit(33); 1072 } 1073 n = read(fsi, bf, size); 1074 if (n != size) { 1075 printf("read error: %ld\n", bno); 1076 perror("rdfs"); 1077 exit(34); 1078 } 1079 } 1080 1081 /* 1082 * write a block to the file system 1083 */ 1084 wtfs(bno, size, bf) 1085 daddr_t bno; 1086 int size; 1087 char *bf; 1088 { 1089 int n; 1090 1091 if (mfs) { 1092 bcopy(bf, membase + bno * sectorsize, size); 1093 return; 1094 } 1095 if (Nflag) 1096 return; 1097 if (lseek(fso, (off_t)bno * sectorsize, SEEK_SET) < 0) { 1098 printf("seek error: %ld\n", bno); 1099 perror("wtfs"); 1100 exit(35); 1101 } 1102 n = write(fso, bf, size); 1103 if (n != size) { 1104 printf("write error: %ld\n", bno); 1105 perror("wtfs"); 1106 exit(36); 1107 } 1108 } 1109 1110 /* 1111 * check if a block is available 1112 */ 1113 isblock(fs, cp, h) 1114 struct fs *fs; 1115 unsigned char *cp; 1116 int h; 1117 { 1118 unsigned char mask; 1119 1120 switch (fs->fs_frag) { 1121 case 8: 1122 return (cp[h] == 0xff); 1123 case 4: 1124 mask = 0x0f << ((h & 0x1) << 2); 1125 return ((cp[h >> 1] & mask) == mask); 1126 case 2: 1127 mask = 0x03 << ((h & 0x3) << 1); 1128 return ((cp[h >> 2] & mask) == mask); 1129 case 1: 1130 mask = 0x01 << (h & 0x7); 1131 return ((cp[h >> 3] & mask) == mask); 1132 default: 1133 #ifdef STANDALONE 1134 printf("isblock bad fs_frag %d\n", fs->fs_frag); 1135 #else 1136 fprintf(stderr, "isblock bad fs_frag %d\n", fs->fs_frag); 1137 #endif 1138 return (0); 1139 } 1140 } 1141 1142 /* 1143 * take a block out of the map 1144 */ 1145 clrblock(fs, cp, h) 1146 struct fs *fs; 1147 unsigned char *cp; 1148 int h; 1149 { 1150 switch ((fs)->fs_frag) { 1151 case 8: 1152 cp[h] = 0; 1153 return; 1154 case 4: 1155 cp[h >> 1] &= ~(0x0f << ((h & 0x1) << 2)); 1156 return; 1157 case 2: 1158 cp[h >> 2] &= ~(0x03 << ((h & 0x3) << 1)); 1159 return; 1160 case 1: 1161 cp[h >> 3] &= ~(0x01 << (h & 0x7)); 1162 return; 1163 default: 1164 #ifdef STANDALONE 1165 printf("clrblock bad fs_frag %d\n", fs->fs_frag); 1166 #else 1167 fprintf(stderr, "clrblock bad fs_frag %d\n", fs->fs_frag); 1168 #endif 1169 return; 1170 } 1171 } 1172 1173 /* 1174 * put a block into the map 1175 */ 1176 setblock(fs, cp, h) 1177 struct fs *fs; 1178 unsigned char *cp; 1179 int h; 1180 { 1181 switch (fs->fs_frag) { 1182 case 8: 1183 cp[h] = 0xff; 1184 return; 1185 case 4: 1186 cp[h >> 1] |= (0x0f << ((h & 0x1) << 2)); 1187 return; 1188 case 2: 1189 cp[h >> 2] |= (0x03 << ((h & 0x3) << 1)); 1190 return; 1191 case 1: 1192 cp[h >> 3] |= (0x01 << (h & 0x7)); 1193 return; 1194 default: 1195 #ifdef STANDALONE 1196 printf("setblock bad fs_frag %d\n", fs->fs_frag); 1197 #else 1198 fprintf(stderr, "setblock bad fs_frag %d\n", fs->fs_frag); 1199 #endif 1200 return; 1201 } 1202 } 1203