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