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.20 (Berkeley) 12/19/91"; 10 #endif /* not lint */ 11 12 #ifndef STANDALONE 13 #include <stdio.h> 14 #include <a.out.h> 15 #endif 16 17 #include <sys/param.h> 18 #include <sys/time.h> 19 #include <sys/wait.h> 20 #include <sys/resource.h> 21 #include <ufs/ufs/dinode.h> 22 #include <ufs/ufs/dir.h> 23 #include <ufs/ffs/fs.h> 24 #include <sys/disklabel.h> 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 printf("\t%.1fMB in %d cyl groups (%d c/g, %.2fMB/g, %d i/g)\n", 553 (float)sblock.fs_size * sblock.fs_fsize * 1e-6, 554 sblock.fs_ncg, sblock.fs_cpg, 555 (float)sblock.fs_fpg * sblock.fs_fsize * 1e-6, 556 sblock.fs_ipg); 557 } 558 /* 559 * Now build the cylinders group blocks and 560 * then print out indices of cylinder groups. 561 */ 562 if (!mfs) 563 printf("super-block backups (for fsck -b #) at:"); 564 for (cylno = 0; cylno < sblock.fs_ncg; cylno++) { 565 initcg(cylno, utime); 566 if (mfs) 567 continue; 568 if (cylno % 9 == 0) 569 printf("\n"); 570 printf(" %d,", fsbtodb(&sblock, cgsblock(&sblock, cylno))); 571 } 572 if (!mfs) 573 printf("\n"); 574 if (Nflag && !mfs) 575 exit(0); 576 /* 577 * Now construct the initial file system, 578 * then write out the super-block. 579 */ 580 fsinit(utime); 581 sblock.fs_time = utime; 582 wtfs(SBOFF / sectorsize, sbsize, (char *)&sblock); 583 for (i = 0; i < sblock.fs_cssize; i += sblock.fs_bsize) 584 wtfs(fsbtodb(&sblock, sblock.fs_csaddr + numfrags(&sblock, i)), 585 sblock.fs_cssize - i < sblock.fs_bsize ? 586 sblock.fs_cssize - i : sblock.fs_bsize, 587 ((char *)fscs) + i); 588 /* 589 * Write out the duplicate super blocks 590 */ 591 for (cylno = 0; cylno < sblock.fs_ncg; cylno++) 592 wtfs(fsbtodb(&sblock, cgsblock(&sblock, cylno)), 593 sbsize, (char *)&sblock); 594 /* 595 * Update information about this partion in pack 596 * label, to that it may be updated on disk. 597 */ 598 pp->p_fstype = FS_BSDFFS; 599 pp->p_fsize = sblock.fs_fsize; 600 pp->p_frag = sblock.fs_frag; 601 pp->p_cpg = sblock.fs_cpg; 602 /* 603 * Notify parent process of success. 604 * Dissociate from session and tty. 605 */ 606 if (mfs) { 607 kill(ppid, SIGUSR1); 608 (void) setsid(); 609 (void) close(0); 610 (void) close(1); 611 (void) close(2); 612 (void) chdir("/"); 613 } 614 } 615 616 /* 617 * Initialize a cylinder group. 618 */ 619 initcg(cylno, utime) 620 int cylno; 621 time_t utime; 622 { 623 daddr_t cbase, d, dlower, dupper, dmax; 624 long i, j, s; 625 register struct csum *cs; 626 627 /* 628 * Determine block bounds for cylinder group. 629 * Allow space for super block summary information in first 630 * cylinder group. 631 */ 632 cbase = cgbase(&sblock, cylno); 633 dmax = cbase + sblock.fs_fpg; 634 if (dmax > sblock.fs_size) 635 dmax = sblock.fs_size; 636 dlower = cgsblock(&sblock, cylno) - cbase; 637 dupper = cgdmin(&sblock, cylno) - cbase; 638 if (cylno == 0) 639 dupper += howmany(sblock.fs_cssize, sblock.fs_fsize); 640 cs = fscs + cylno; 641 acg.cg_time = utime; 642 acg.cg_magic = CG_MAGIC; 643 acg.cg_cgx = cylno; 644 if (cylno == sblock.fs_ncg - 1) 645 acg.cg_ncyl = sblock.fs_ncyl % sblock.fs_cpg; 646 else 647 acg.cg_ncyl = sblock.fs_cpg; 648 acg.cg_niblk = sblock.fs_ipg; 649 acg.cg_ndblk = dmax - cbase; 650 acg.cg_cs.cs_ndir = 0; 651 acg.cg_cs.cs_nffree = 0; 652 acg.cg_cs.cs_nbfree = 0; 653 acg.cg_cs.cs_nifree = 0; 654 acg.cg_rotor = 0; 655 acg.cg_frotor = 0; 656 acg.cg_irotor = 0; 657 acg.cg_btotoff = &acg.cg_space[0] - (u_char *)(&acg.cg_link); 658 acg.cg_boff = acg.cg_btotoff + sblock.fs_cpg * sizeof(long); 659 acg.cg_iusedoff = acg.cg_boff + 660 sblock.fs_cpg * sblock.fs_nrpos * sizeof(short); 661 acg.cg_freeoff = acg.cg_iusedoff + howmany(sblock.fs_ipg, NBBY); 662 acg.cg_nextfreeoff = acg.cg_freeoff + 663 howmany(sblock.fs_cpg * sblock.fs_spc / NSPF(&sblock), NBBY); 664 for (i = 0; i < sblock.fs_frag; i++) { 665 acg.cg_frsum[i] = 0; 666 } 667 bzero((caddr_t)cg_inosused(&acg), acg.cg_freeoff - acg.cg_iusedoff); 668 acg.cg_cs.cs_nifree += sblock.fs_ipg; 669 if (cylno == 0) 670 for (i = 0; i < ROOTINO; i++) { 671 setbit(cg_inosused(&acg), i); 672 acg.cg_cs.cs_nifree--; 673 } 674 for (i = 0; i < sblock.fs_ipg / INOPF(&sblock); i += sblock.fs_frag) 675 wtfs(fsbtodb(&sblock, cgimin(&sblock, cylno) + i), 676 sblock.fs_bsize, (char *)zino); 677 bzero((caddr_t)cg_blktot(&acg), acg.cg_boff - acg.cg_btotoff); 678 bzero((caddr_t)cg_blks(&sblock, &acg, 0), 679 acg.cg_iusedoff - acg.cg_boff); 680 bzero((caddr_t)cg_blksfree(&acg), acg.cg_nextfreeoff - acg.cg_freeoff); 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 setblock(&sblock, cg_blksfree(&acg), d/sblock.fs_frag); 688 acg.cg_cs.cs_nbfree++; 689 cg_blktot(&acg)[cbtocylno(&sblock, d)]++; 690 cg_blks(&sblock, &acg, cbtocylno(&sblock, d)) 691 [cbtorpos(&sblock, d)]++; 692 } 693 sblock.fs_dsize += dlower; 694 } 695 sblock.fs_dsize += acg.cg_ndblk - dupper; 696 if (i = dupper % sblock.fs_frag) { 697 acg.cg_frsum[sblock.fs_frag - i]++; 698 for (d = dupper + sblock.fs_frag - i; dupper < d; dupper++) { 699 setbit(cg_blksfree(&acg), dupper); 700 acg.cg_cs.cs_nffree++; 701 } 702 } 703 for (d = dupper; d + sblock.fs_frag <= dmax - cbase; ) { 704 setblock(&sblock, cg_blksfree(&acg), d / sblock.fs_frag); 705 acg.cg_cs.cs_nbfree++; 706 cg_blktot(&acg)[cbtocylno(&sblock, d)]++; 707 cg_blks(&sblock, &acg, cbtocylno(&sblock, d)) 708 [cbtorpos(&sblock, d)]++; 709 d += sblock.fs_frag; 710 } 711 if (d < dmax - cbase) { 712 acg.cg_frsum[dmax - cbase - d]++; 713 for (; d < dmax - cbase; d++) { 714 setbit(cg_blksfree(&acg), d); 715 acg.cg_cs.cs_nffree++; 716 } 717 } 718 sblock.fs_cstotal.cs_ndir += acg.cg_cs.cs_ndir; 719 sblock.fs_cstotal.cs_nffree += acg.cg_cs.cs_nffree; 720 sblock.fs_cstotal.cs_nbfree += acg.cg_cs.cs_nbfree; 721 sblock.fs_cstotal.cs_nifree += acg.cg_cs.cs_nifree; 722 *cs = acg.cg_cs; 723 wtfs(fsbtodb(&sblock, cgtod(&sblock, cylno)), 724 sblock.fs_bsize, (char *)&acg); 725 } 726 727 /* 728 * initialize the file system 729 */ 730 struct dinode node; 731 732 #ifdef LOSTDIR 733 #define PREDEFDIR 3 734 #else 735 #define PREDEFDIR 2 736 #endif 737 738 struct direct root_dir[] = { 739 { ROOTINO, sizeof(struct direct), 1, "." }, 740 { ROOTINO, sizeof(struct direct), 2, ".." }, 741 #ifdef LOSTDIR 742 { LOSTFOUNDINO, sizeof(struct direct), 10, "lost+found" }, 743 #endif 744 }; 745 #ifdef LOSTDIR 746 struct direct lost_found_dir[] = { 747 { LOSTFOUNDINO, sizeof(struct direct), 1, "." }, 748 { ROOTINO, sizeof(struct direct), 2, ".." }, 749 { 0, DIRBLKSIZ, 0, 0 }, 750 }; 751 #endif 752 char buf[MAXBSIZE]; 753 754 fsinit(utime) 755 time_t utime; 756 { 757 int i; 758 759 /* 760 * initialize the node 761 */ 762 node.di_atime = utime; 763 node.di_mtime = utime; 764 node.di_ctime = utime; 765 #ifdef LOSTDIR 766 /* 767 * create the lost+found directory 768 */ 769 (void)makedir(lost_found_dir, 2); 770 for (i = DIRBLKSIZ; i < sblock.fs_bsize; i += DIRBLKSIZ) 771 bcopy(&lost_found_dir[2], &buf[i], DIRSIZ(&lost_found_dir[2])); 772 node.di_mode = IFDIR | UMASK; 773 node.di_nlink = 2; 774 node.di_size = sblock.fs_bsize; 775 node.di_db[0] = alloc(node.di_size, node.di_mode); 776 node.di_blocks = btodb(fragroundup(&sblock, node.di_size)); 777 wtfs(fsbtodb(&sblock, node.di_db[0]), node.di_size, buf); 778 iput(&node, LOSTFOUNDINO); 779 #endif 780 /* 781 * create the root directory 782 */ 783 if (mfs) 784 node.di_mode = IFDIR | 01777; 785 else 786 node.di_mode = IFDIR | UMASK; 787 node.di_nlink = PREDEFDIR; 788 node.di_size = makedir(root_dir, PREDEFDIR); 789 node.di_db[0] = alloc(sblock.fs_fsize, node.di_mode); 790 node.di_blocks = btodb(fragroundup(&sblock, node.di_size)); 791 wtfs(fsbtodb(&sblock, node.di_db[0]), sblock.fs_fsize, buf); 792 iput(&node, ROOTINO); 793 } 794 795 /* 796 * construct a set of directory entries in "buf". 797 * return size of directory. 798 */ 799 makedir(protodir, entries) 800 register struct direct *protodir; 801 int entries; 802 { 803 char *cp; 804 int i, spcleft; 805 806 spcleft = DIRBLKSIZ; 807 for (cp = buf, i = 0; i < entries - 1; i++) { 808 protodir[i].d_reclen = DIRSIZ(&protodir[i]); 809 bcopy(&protodir[i], cp, protodir[i].d_reclen); 810 cp += protodir[i].d_reclen; 811 spcleft -= protodir[i].d_reclen; 812 } 813 protodir[i].d_reclen = spcleft; 814 bcopy(&protodir[i], cp, DIRSIZ(&protodir[i])); 815 return (DIRBLKSIZ); 816 } 817 818 /* 819 * allocate a block or frag 820 */ 821 daddr_t 822 alloc(size, mode) 823 int size; 824 int mode; 825 { 826 int i, frag; 827 daddr_t d; 828 829 rdfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize, 830 (char *)&acg); 831 if (acg.cg_magic != CG_MAGIC) { 832 printf("cg 0: bad magic number\n"); 833 return (0); 834 } 835 if (acg.cg_cs.cs_nbfree == 0) { 836 printf("first cylinder group ran out of space\n"); 837 return (0); 838 } 839 for (d = 0; d < acg.cg_ndblk; d += sblock.fs_frag) 840 if (isblock(&sblock, cg_blksfree(&acg), d / sblock.fs_frag)) 841 goto goth; 842 printf("internal error: can't find block in cyl 0\n"); 843 return (0); 844 goth: 845 clrblock(&sblock, cg_blksfree(&acg), d / sblock.fs_frag); 846 acg.cg_cs.cs_nbfree--; 847 sblock.fs_cstotal.cs_nbfree--; 848 fscs[0].cs_nbfree--; 849 if (mode & IFDIR) { 850 acg.cg_cs.cs_ndir++; 851 sblock.fs_cstotal.cs_ndir++; 852 fscs[0].cs_ndir++; 853 } 854 cg_blktot(&acg)[cbtocylno(&sblock, d)]--; 855 cg_blks(&sblock, &acg, cbtocylno(&sblock, d))[cbtorpos(&sblock, d)]--; 856 if (size != sblock.fs_bsize) { 857 frag = howmany(size, sblock.fs_fsize); 858 fscs[0].cs_nffree += sblock.fs_frag - frag; 859 sblock.fs_cstotal.cs_nffree += sblock.fs_frag - frag; 860 acg.cg_cs.cs_nffree += sblock.fs_frag - frag; 861 acg.cg_frsum[sblock.fs_frag - frag]++; 862 for (i = frag; i < sblock.fs_frag; i++) 863 setbit(cg_blksfree(&acg), d + i); 864 } 865 wtfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize, 866 (char *)&acg); 867 return (d); 868 } 869 870 /* 871 * Allocate an inode on the disk 872 */ 873 iput(ip, ino) 874 register struct dinode *ip; 875 register ino_t ino; 876 { 877 struct dinode buf[MAXINOPB]; 878 daddr_t d; 879 int c; 880 881 c = itog(&sblock, ino); 882 rdfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize, 883 (char *)&acg); 884 if (acg.cg_magic != CG_MAGIC) { 885 printf("cg 0: bad magic number\n"); 886 exit(31); 887 } 888 acg.cg_cs.cs_nifree--; 889 setbit(cg_inosused(&acg), ino); 890 wtfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize, 891 (char *)&acg); 892 sblock.fs_cstotal.cs_nifree--; 893 fscs[0].cs_nifree--; 894 if (ino >= sblock.fs_ipg * sblock.fs_ncg) { 895 printf("fsinit: inode value out of range (%d).\n", ino); 896 exit(32); 897 } 898 d = fsbtodb(&sblock, itod(&sblock, ino)); 899 rdfs(d, sblock.fs_bsize, buf); 900 buf[itoo(&sblock, ino)] = *ip; 901 wtfs(d, sblock.fs_bsize, buf); 902 } 903 904 /* 905 * Notify parent process that the filesystem has created itself successfully. 906 */ 907 void 908 started() 909 { 910 911 exit(0); 912 } 913 914 /* 915 * Replace libc function with one suited to our needs. 916 */ 917 caddr_t 918 malloc(size) 919 register u_long size; 920 { 921 u_long base, i; 922 static u_long pgsz; 923 struct rlimit rlp; 924 925 if (pgsz == 0) { 926 base = sbrk(0); 927 pgsz = getpagesize() - 1; 928 i = (base + pgsz) &~ pgsz; 929 base = sbrk(i - base); 930 if (getrlimit(RLIMIT_DATA, &rlp) < 0) 931 perror("getrlimit"); 932 rlp.rlim_cur = rlp.rlim_max; 933 if (setrlimit(RLIMIT_DATA, &rlp) < 0) 934 perror("setrlimit"); 935 memleft = rlp.rlim_max - base; 936 } 937 size = (size + pgsz) &~ pgsz; 938 if (size > memleft) 939 size = memleft; 940 memleft -= size; 941 if (size == 0) 942 return (0); 943 return ((caddr_t)sbrk(size)); 944 } 945 946 /* 947 * Replace libc function with one suited to our needs. 948 */ 949 caddr_t 950 realloc(ptr, size) 951 char *ptr; 952 u_long size; 953 { 954 955 /* always fail for now */ 956 return ((caddr_t)0); 957 } 958 959 /* 960 * Replace libc function with one suited to our needs. 961 */ 962 char * 963 calloc(size, numelm) 964 u_long size, numelm; 965 { 966 caddr_t base; 967 968 size *= numelm; 969 base = malloc(size); 970 bzero(base, size); 971 return (base); 972 } 973 974 /* 975 * Replace libc function with one suited to our needs. 976 */ 977 free(ptr) 978 char *ptr; 979 { 980 981 /* do not worry about it for now */ 982 } 983 984 /* 985 * read a block from the file system 986 */ 987 rdfs(bno, size, bf) 988 daddr_t bno; 989 int size; 990 char *bf; 991 { 992 int n; 993 994 if (mfs) { 995 bcopy(membase + bno * sectorsize, bf, size); 996 return; 997 } 998 if (lseek(fsi, bno * sectorsize, 0) < 0) { 999 printf("seek error: %ld\n", bno); 1000 perror("rdfs"); 1001 exit(33); 1002 } 1003 n = read(fsi, bf, size); 1004 if(n != size) { 1005 printf("read error: %ld\n", bno); 1006 perror("rdfs"); 1007 exit(34); 1008 } 1009 } 1010 1011 /* 1012 * write a block to the file system 1013 */ 1014 wtfs(bno, size, bf) 1015 daddr_t bno; 1016 int size; 1017 char *bf; 1018 { 1019 int n; 1020 1021 if (mfs) { 1022 bcopy(bf, membase + bno * sectorsize, size); 1023 return; 1024 } 1025 if (Nflag) 1026 return; 1027 if (lseek(fso, bno * sectorsize, 0) < 0) { 1028 printf("seek error: %ld\n", bno); 1029 perror("wtfs"); 1030 exit(35); 1031 } 1032 n = write(fso, bf, size); 1033 if(n != size) { 1034 printf("write error: %ld\n", bno); 1035 perror("wtfs"); 1036 exit(36); 1037 } 1038 } 1039 1040 /* 1041 * check if a block is available 1042 */ 1043 isblock(fs, cp, h) 1044 struct fs *fs; 1045 unsigned char *cp; 1046 int h; 1047 { 1048 unsigned char mask; 1049 1050 switch (fs->fs_frag) { 1051 case 8: 1052 return (cp[h] == 0xff); 1053 case 4: 1054 mask = 0x0f << ((h & 0x1) << 2); 1055 return ((cp[h >> 1] & mask) == mask); 1056 case 2: 1057 mask = 0x03 << ((h & 0x3) << 1); 1058 return ((cp[h >> 2] & mask) == mask); 1059 case 1: 1060 mask = 0x01 << (h & 0x7); 1061 return ((cp[h >> 3] & mask) == mask); 1062 default: 1063 #ifdef STANDALONE 1064 printf("isblock bad fs_frag %d\n", fs->fs_frag); 1065 #else 1066 fprintf(stderr, "isblock bad fs_frag %d\n", fs->fs_frag); 1067 #endif 1068 return (0); 1069 } 1070 } 1071 1072 /* 1073 * take a block out of the map 1074 */ 1075 clrblock(fs, cp, h) 1076 struct fs *fs; 1077 unsigned char *cp; 1078 int h; 1079 { 1080 switch ((fs)->fs_frag) { 1081 case 8: 1082 cp[h] = 0; 1083 return; 1084 case 4: 1085 cp[h >> 1] &= ~(0x0f << ((h & 0x1) << 2)); 1086 return; 1087 case 2: 1088 cp[h >> 2] &= ~(0x03 << ((h & 0x3) << 1)); 1089 return; 1090 case 1: 1091 cp[h >> 3] &= ~(0x01 << (h & 0x7)); 1092 return; 1093 default: 1094 #ifdef STANDALONE 1095 printf("clrblock bad fs_frag %d\n", fs->fs_frag); 1096 #else 1097 fprintf(stderr, "clrblock bad fs_frag %d\n", fs->fs_frag); 1098 #endif 1099 return; 1100 } 1101 } 1102 1103 /* 1104 * put a block into the map 1105 */ 1106 setblock(fs, cp, h) 1107 struct fs *fs; 1108 unsigned char *cp; 1109 int h; 1110 { 1111 switch (fs->fs_frag) { 1112 case 8: 1113 cp[h] = 0xff; 1114 return; 1115 case 4: 1116 cp[h >> 1] |= (0x0f << ((h & 0x1) << 2)); 1117 return; 1118 case 2: 1119 cp[h >> 2] |= (0x03 << ((h & 0x3) << 1)); 1120 return; 1121 case 1: 1122 cp[h >> 3] |= (0x01 << (h & 0x7)); 1123 return; 1124 default: 1125 #ifdef STANDALONE 1126 printf("setblock bad fs_frag %d\n", fs->fs_frag); 1127 #else 1128 fprintf(stderr, "setblock bad fs_frag %d\n", fs->fs_frag); 1129 #endif 1130 return; 1131 } 1132 } 1133