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