2 * Copyright (c) 1980, 1989, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 static char sccsid[] = "@(#)mkfs.c 8.11 (Berkeley) 5/3/95";
38 static const char rcsid[] =
39 "$FreeBSD: src/sbin/newfs/mkfs.c,v 1.29.2.6 2001/09/21 19:15:21 dillon Exp $";
47 #include <sys/param.h>
49 #include <sys/types.h>
51 #include <sys/resource.h>
53 #include <ufs/ufs/dinode.h>
54 #include <ufs/ufs/dir.h>
55 #include <ufs/ffs/fs.h>
56 #include <sys/disklabel.h>
59 #include <sys/ioctl.h>
64 extern int atoi __P((char *));
65 extern char * getenv __P((char *));
69 extern long random __P((void));
70 extern void srandomdev __P((void));
74 * make file system for cylinder-group style file systems
78 * We limit the size of the inode map to be no more than a
79 * third of the cylinder group space, since we must leave at
80 * least an equal amount of space for the block map.
82 * N.B.: MAXIPG must be a multiple of INOPB(fs).
84 #define MAXIPG(fs) roundup((fs)->fs_bsize * NBBY / 3, INOPB(fs))
87 #define MAXINOPB (MAXBSIZE / sizeof(struct dinode))
88 #define POWEROF2(num) (((num) & ((num) - 1)) == 0)
91 * variables set up by front end.
93 extern int mfs; /* run as the memory based filesystem */
94 extern char *mfs_mtpt; /* mount point for mfs */
95 extern struct stat mfs_mtstat; /* stat prior to mount */
96 extern int Nflag; /* run mkfs without writing file system */
97 extern int Oflag; /* format as an 4.3BSD file system */
98 extern int Uflag; /* enable soft updates for file system */
99 extern int fssize; /* file system size */
100 extern int ntracks; /* # tracks/cylinder */
101 extern int nsectors; /* # sectors/track */
102 extern int nphyssectors; /* # sectors/track including spares */
103 extern int secpercyl; /* sectors per cylinder */
104 extern int sectorsize; /* bytes/sector */
105 extern int realsectorsize; /* bytes/sector in hardware*/
106 extern int rpm; /* revolutions/minute of drive */
107 extern int interleave; /* hardware sector interleave */
108 extern int trackskew; /* sector 0 skew, per track */
109 extern int fsize; /* fragment size */
110 extern int bsize; /* block size */
111 extern int cpg; /* cylinders/cylinder group */
112 extern int cpgflg; /* cylinders/cylinder group flag was given */
113 extern int minfree; /* free space threshold */
114 extern int opt; /* optimization preference (space or time) */
115 extern int density; /* number of bytes per inode */
116 extern int maxcontig; /* max contiguous blocks to allocate */
117 extern int rotdelay; /* rotational delay between blocks */
118 extern int maxbpg; /* maximum blocks per file in a cyl group */
119 extern int nrpos; /* # of distinguished rotational positions */
120 extern int bbsize; /* boot block size */
121 extern int sbsize; /* superblock size */
122 extern int avgfilesize; /* expected average file size */
123 extern int avgfilesperdir; /* expected number of files per directory */
124 extern u_long memleft; /* virtual memory available */
125 extern caddr_t membase; /* start address of memory based filesystem */
126 extern char * filename;
132 #define sblock fsun.fs
141 struct dinode zino[MAXBSIZE / sizeof(struct dinode)];
149 static int charsperline();
150 void clrblock __P((struct fs *, unsigned char *, int));
151 void fsinit __P((time_t));
152 void initcg __P((int, time_t));
153 int isblock __P((struct fs *, unsigned char *, int));
154 void iput __P((struct dinode *, ino_t));
155 int makedir __P((struct direct *, int));
156 void rdfs __P((daddr_t, int, char *));
157 void setblock __P((struct fs *, unsigned char *, int));
158 void wtfs __P((daddr_t, int, char *));
159 void wtfsflush __P((void));
162 void get_memleft __P((void));
163 void raise_data_limit __P((void));
165 void free __P((char *));
166 char * calloc __P((u_long, u_long));
167 caddr_t malloc __P((u_long));
168 caddr_t realloc __P((char *, u_long));
174 mkfs(pp, fsys, fi, fo)
175 struct partition *pp;
179 register long i, mincpc, mincpg, inospercg;
180 long cylno, rpos, blk, j, warn = 0;
181 long used, mincpgcnt, bpcg;
183 long mapcramped, inodecramped;
184 long postblsize, rotblsize, totalsbsize;
190 char tmpbuf[100]; /* XXX this will break in about 2,500 years */
203 (void) signal(SIGUSR1, started);
207 if (waitpid(i, &status, 0) != -1 && WIFEXITED(status))
208 exit(WEXITSTATUS(status));
218 unsigned char buf[BUFSIZ];
220 fd = open(filename,O_RDWR|O_TRUNC|O_CREAT,0644);
222 err(12, "%s", filename);
223 for(l=0;l< fssize * sectorsize;l += l1) {
224 l1 = fssize * sectorsize;
227 if (l1 != write(fd,buf,l1))
228 err(12, "%s", filename);
233 PROT_READ|PROT_WRITE,
237 if(membase == MAP_FAILED)
244 if (fssize * sectorsize > (memleft - 131072))
245 fssize = (memleft - 131072) / sectorsize;
246 if ((membase = malloc(fssize * sectorsize)) == NULL)
247 errx(13, "malloc failed");
253 sblock.fs_inodefmt = FS_42INODEFMT;
254 sblock.fs_maxsymlinklen = 0;
256 sblock.fs_inodefmt = FS_44INODEFMT;
257 sblock.fs_maxsymlinklen = MAXSYMLINKLEN;
260 sblock.fs_flags |= FS_DOSOFTDEP;
262 * Validate the given file system size.
263 * Verify that its last block can actually be accessed.
266 printf("preposterous size %d\n", fssize), exit(13);
267 wtfs(fssize - (realsectorsize / DEV_BSIZE), realsectorsize,
270 * collect and verify the sector and track info
272 sblock.fs_nsect = nsectors;
273 sblock.fs_ntrak = ntracks;
274 if (sblock.fs_ntrak <= 0)
275 printf("preposterous ntrak %d\n", sblock.fs_ntrak), exit(14);
276 if (sblock.fs_nsect <= 0)
277 printf("preposterous nsect %d\n", sblock.fs_nsect), exit(15);
279 * collect and verify the filesystem density info
281 sblock.fs_avgfilesize = avgfilesize;
282 sblock.fs_avgfpdir = avgfilesperdir;
283 if (sblock.fs_avgfilesize <= 0)
284 printf("illegal expected average file size %d\n",
285 sblock.fs_avgfilesize), exit(14);
286 if (sblock.fs_avgfpdir <= 0)
287 printf("illegal expected number of files per directory %d\n",
288 sblock.fs_avgfpdir), exit(15);
290 * collect and verify the block and fragment sizes
292 sblock.fs_bsize = bsize;
293 sblock.fs_fsize = fsize;
294 if (!POWEROF2(sblock.fs_bsize)) {
295 printf("block size must be a power of 2, not %d\n",
299 if (!POWEROF2(sblock.fs_fsize)) {
300 printf("fragment size must be a power of 2, not %d\n",
304 if (sblock.fs_fsize < sectorsize) {
305 printf("fragment size %d is too small, minimum is %d\n",
306 sblock.fs_fsize, sectorsize);
309 if (sblock.fs_bsize < MINBSIZE) {
310 printf("block size %d is too small, minimum is %d\n",
311 sblock.fs_bsize, MINBSIZE);
314 if (sblock.fs_bsize < sblock.fs_fsize) {
315 printf("block size (%d) cannot be smaller than fragment size (%d)\n",
316 sblock.fs_bsize, sblock.fs_fsize);
319 sblock.fs_bmask = ~(sblock.fs_bsize - 1);
320 sblock.fs_fmask = ~(sblock.fs_fsize - 1);
321 sblock.fs_qbmask = ~sblock.fs_bmask;
322 sblock.fs_qfmask = ~sblock.fs_fmask;
323 for (sblock.fs_bshift = 0, i = sblock.fs_bsize; i > 1; i >>= 1)
325 for (sblock.fs_fshift = 0, i = sblock.fs_fsize; i > 1; i >>= 1)
327 sblock.fs_frag = numfrags(&sblock, sblock.fs_bsize);
328 for (sblock.fs_fragshift = 0, i = sblock.fs_frag; i > 1; i >>= 1)
329 sblock.fs_fragshift++;
330 if (sblock.fs_frag > MAXFRAG) {
331 printf("fragment size %d is too small, minimum with block size %d is %d\n",
332 sblock.fs_fsize, sblock.fs_bsize,
333 sblock.fs_bsize / MAXFRAG);
336 sblock.fs_nrpos = nrpos;
337 sblock.fs_nindir = sblock.fs_bsize / sizeof(daddr_t);
338 sblock.fs_inopb = sblock.fs_bsize / sizeof(struct dinode);
339 sblock.fs_nspf = sblock.fs_fsize / sectorsize;
340 for (sblock.fs_fsbtodb = 0, i = NSPF(&sblock); i > 1; i >>= 1)
343 roundup(howmany(bbsize + sbsize, sblock.fs_fsize), sblock.fs_frag);
344 sblock.fs_cblkno = (daddr_t)(sblock.fs_sblkno +
345 roundup(howmany(sbsize, sblock.fs_fsize), sblock.fs_frag));
346 sblock.fs_iblkno = sblock.fs_cblkno + sblock.fs_frag;
347 sblock.fs_cgoffset = roundup(
348 howmany(sblock.fs_nsect, NSPF(&sblock)), sblock.fs_frag);
349 for (sblock.fs_cgmask = 0xffffffff, i = sblock.fs_ntrak; i > 1; i >>= 1)
350 sblock.fs_cgmask <<= 1;
351 if (!POWEROF2(sblock.fs_ntrak))
352 sblock.fs_cgmask <<= 1;
353 sblock.fs_maxfilesize = sblock.fs_bsize * NDADDR - 1;
354 for (sizepb = sblock.fs_bsize, i = 0; i < NIADDR; i++) {
355 sizepb *= NINDIR(&sblock);
356 sblock.fs_maxfilesize += sizepb;
359 * Validate specified/determined secpercyl
360 * and calculate minimum cylinders per group.
362 sblock.fs_spc = secpercyl;
363 for (sblock.fs_cpc = NSPB(&sblock), i = sblock.fs_spc;
364 sblock.fs_cpc > 1 && (i & 1) == 0;
365 sblock.fs_cpc >>= 1, i >>= 1)
367 mincpc = sblock.fs_cpc;
368 bpcg = sblock.fs_spc * sectorsize;
369 inospercg = roundup(bpcg / sizeof(struct dinode), INOPB(&sblock));
370 if (inospercg > MAXIPG(&sblock))
371 inospercg = MAXIPG(&sblock);
372 used = (sblock.fs_iblkno + inospercg / INOPF(&sblock)) * NSPF(&sblock);
373 mincpgcnt = howmany(sblock.fs_cgoffset * (~sblock.fs_cgmask) + used,
375 mincpg = roundup(mincpgcnt, mincpc);
377 * Ensure that cylinder group with mincpg has enough space
380 sblock.fs_cpg = mincpg;
381 sblock.fs_ipg = inospercg;
383 sblock.fs_contigsumsize = MIN(maxcontig, FS_MAXCONTIG);
385 while (CGSIZE(&sblock) > sblock.fs_bsize) {
387 if (sblock.fs_bsize < MAXBSIZE) {
388 sblock.fs_bsize <<= 1;
394 mincpg = roundup(mincpgcnt, mincpc);
395 sblock.fs_cpg = mincpg;
397 sblock.fs_frag <<= 1;
398 sblock.fs_fragshift += 1;
399 if (sblock.fs_frag <= MAXFRAG)
402 if (sblock.fs_fsize == sblock.fs_bsize) {
403 printf("There is no block size that");
404 printf(" can support this disk\n");
407 sblock.fs_frag >>= 1;
408 sblock.fs_fragshift -= 1;
409 sblock.fs_fsize <<= 1;
410 sblock.fs_nspf <<= 1;
413 * Ensure that cylinder group with mincpg has enough space for inodes.
416 inospercg = calcipg(mincpg, bpcg, &usedb);
417 sblock.fs_ipg = inospercg;
418 while (inospercg > MAXIPG(&sblock)) {
420 if (mincpc == 1 || sblock.fs_frag == 1 ||
421 sblock.fs_bsize == MINBSIZE)
423 printf("With a block size of %d %s %d\n", sblock.fs_bsize,
424 "minimum bytes per inode is",
425 (int)((mincpg * (off_t)bpcg - usedb)
426 / MAXIPG(&sblock) + 1));
427 sblock.fs_bsize >>= 1;
428 sblock.fs_frag >>= 1;
429 sblock.fs_fragshift -= 1;
431 sblock.fs_cpg = roundup(mincpgcnt, mincpc);
432 if (CGSIZE(&sblock) > sblock.fs_bsize) {
433 sblock.fs_bsize <<= 1;
436 mincpg = sblock.fs_cpg;
437 inospercg = calcipg(mincpg, bpcg, &usedb);
438 sblock.fs_ipg = inospercg;
441 if (inospercg > MAXIPG(&sblock)) {
442 printf("Minimum bytes per inode is %d\n",
443 (int)((mincpg * (off_t)bpcg - usedb)
444 / MAXIPG(&sblock) + 1));
445 } else if (!mapcramped) {
446 printf("With %d bytes per inode, ", density);
447 printf("minimum cylinders per group is %ld\n", mincpg);
451 printf("With %d sectors per cylinder, ", sblock.fs_spc);
452 printf("minimum cylinders per group is %ld\n", mincpg);
454 if (inodecramped || mapcramped) {
455 if (sblock.fs_bsize != bsize)
456 printf("%s to be changed from %d to %d\n",
457 "This requires the block size",
458 bsize, sblock.fs_bsize);
459 if (sblock.fs_fsize != fsize)
460 printf("\t%s to be changed from %d to %d\n",
461 "and the fragment size",
462 fsize, sblock.fs_fsize);
466 * Calculate the number of cylinders per group
469 if (sblock.fs_cpg % mincpc != 0) {
470 printf("%s groups must have a multiple of %ld cylinders\n",
471 cpgflg ? "Cylinder" : "Warning: cylinder", mincpc);
472 sblock.fs_cpg = roundup(sblock.fs_cpg, mincpc);
477 * Must ensure there is enough space for inodes.
479 sblock.fs_ipg = calcipg(sblock.fs_cpg, bpcg, &usedb);
480 while (sblock.fs_ipg > MAXIPG(&sblock)) {
482 sblock.fs_cpg -= mincpc;
483 sblock.fs_ipg = calcipg(sblock.fs_cpg, bpcg, &usedb);
486 * Must ensure there is enough space to hold block map.
488 while (CGSIZE(&sblock) > sblock.fs_bsize) {
490 sblock.fs_cpg -= mincpc;
491 sblock.fs_ipg = calcipg(sblock.fs_cpg, bpcg, &usedb);
493 sblock.fs_fpg = (sblock.fs_cpg * sblock.fs_spc) / NSPF(&sblock);
494 if ((sblock.fs_cpg * sblock.fs_spc) % NSPB(&sblock) != 0) {
495 printf("panic (fs_cpg * fs_spc) %% NSPF != 0");
498 if (sblock.fs_cpg < mincpg) {
499 printf("cylinder groups must have at least %ld cylinders\n",
502 } else if (sblock.fs_cpg != cpg) {
505 else if (!mapcramped && !inodecramped)
507 if (mapcramped && inodecramped)
508 printf("Block size and bytes per inode restrict");
510 printf("Block size restricts");
512 printf("Bytes per inode restrict");
513 printf(" cylinders per group to %d.\n", sblock.fs_cpg);
517 sblock.fs_cgsize = fragroundup(&sblock, CGSIZE(&sblock));
519 * Now have size for file system and nsect and ntrak.
520 * Determine number of cylinders and blocks in the file system.
522 sblock.fs_size = fssize = dbtofsb(&sblock, fssize);
523 sblock.fs_ncyl = fssize * NSPF(&sblock) / sblock.fs_spc;
524 if (fssize * NSPF(&sblock) > sblock.fs_ncyl * sblock.fs_spc) {
528 if (sblock.fs_ncyl < 1) {
529 printf("file systems must have at least one cylinder\n");
533 * Determine feasability/values of rotational layout tables.
535 * The size of the rotational layout tables is limited by the
536 * size of the superblock, SBSIZE. The amount of space available
537 * for tables is calculated as (SBSIZE - sizeof (struct fs)).
538 * The size of these tables is inversely proportional to the block
539 * size of the file system. The size increases if sectors per track
540 * are not powers of two, because more cylinders must be described
541 * by the tables before the rotational pattern repeats (fs_cpc).
543 sblock.fs_interleave = interleave;
544 sblock.fs_trackskew = trackskew;
545 sblock.fs_npsect = nphyssectors;
546 sblock.fs_postblformat = FS_DYNAMICPOSTBLFMT;
547 sblock.fs_sbsize = fragroundup(&sblock, sizeof(struct fs));
548 if (sblock.fs_sbsize > SBSIZE)
549 sblock.fs_sbsize = SBSIZE;
550 if (sblock.fs_ntrak == 1) {
554 postblsize = sblock.fs_nrpos * sblock.fs_cpc * sizeof(int16_t);
555 rotblsize = sblock.fs_cpc * sblock.fs_spc / NSPB(&sblock);
556 totalsbsize = sizeof(struct fs) + rotblsize;
557 if (sblock.fs_nrpos == 8 && sblock.fs_cpc <= 16) {
558 /* use old static table space */
559 sblock.fs_postbloff = (char *)(&sblock.fs_opostbl[0][0]) -
560 (char *)(&sblock.fs_firstfield);
561 sblock.fs_rotbloff = &sblock.fs_space[0] -
562 (u_char *)(&sblock.fs_firstfield);
564 /* use dynamic table space */
565 sblock.fs_postbloff = &sblock.fs_space[0] -
566 (u_char *)(&sblock.fs_firstfield);
567 sblock.fs_rotbloff = sblock.fs_postbloff + postblsize;
568 totalsbsize += postblsize;
570 if (totalsbsize > SBSIZE ||
571 sblock.fs_nsect > (1 << NBBY) * NSPB(&sblock)) {
572 printf("%s %s %d %s %d.%s",
573 "Warning: insufficient space in super block for\n",
574 "rotational layout tables with nsect", sblock.fs_nsect,
575 "and ntrak", sblock.fs_ntrak,
576 "\nFile system performance may be impaired.\n");
580 sblock.fs_sbsize = fragroundup(&sblock, totalsbsize);
581 if (sblock.fs_sbsize > SBSIZE)
582 sblock.fs_sbsize = SBSIZE;
584 * calculate the available blocks for each rotational position
586 for (cylno = 0; cylno < sblock.fs_cpc; cylno++)
587 for (rpos = 0; rpos < sblock.fs_nrpos; rpos++)
588 fs_postbl(&sblock, cylno)[rpos] = -1;
589 for (i = (rotblsize - 1) * sblock.fs_frag;
590 i >= 0; i -= sblock.fs_frag) {
591 cylno = cbtocylno(&sblock, i);
592 rpos = cbtorpos(&sblock, i);
593 blk = fragstoblks(&sblock, i);
594 if (fs_postbl(&sblock, cylno)[rpos] == -1)
595 fs_rotbl(&sblock)[blk] = 0;
597 fs_rotbl(&sblock)[blk] =
598 fs_postbl(&sblock, cylno)[rpos] - blk;
599 fs_postbl(&sblock, cylno)[rpos] = blk;
603 * Compute/validate number of cylinder groups.
605 sblock.fs_ncg = sblock.fs_ncyl / sblock.fs_cpg;
606 if (sblock.fs_ncyl % sblock.fs_cpg)
608 sblock.fs_dblkno = sblock.fs_iblkno + sblock.fs_ipg / INOPF(&sblock);
609 i = MIN(~sblock.fs_cgmask, sblock.fs_ncg - 1);
610 if (cgdmin(&sblock, i) - cgbase(&sblock, i) >= sblock.fs_fpg) {
611 printf("inode blocks/cyl group (%ld) >= data blocks (%ld)\n",
612 cgdmin(&sblock, i) - cgbase(&sblock, i) / sblock.fs_frag,
613 (long)(sblock.fs_fpg / sblock.fs_frag));
614 printf("number of cylinders per cylinder group (%d) %s.\n",
615 sblock.fs_cpg, "must be increased");
618 j = sblock.fs_ncg - 1;
619 if ((i = fssize - j * sblock.fs_fpg) < sblock.fs_fpg &&
620 cgdmin(&sblock, j) - cgbase(&sblock, j) > i) {
622 printf("Filesystem must have at least %d sectors\n",
624 (cgdmin(&sblock, 0) + 3 * sblock.fs_frag));
628 "Warning: inode blocks/cyl group (%ld) >= data blocks (%ld) in last\n",
629 (cgdmin(&sblock, j) - cgbase(&sblock, j)) / sblock.fs_frag,
632 " cylinder group. This implies %ld sector(s) cannot be allocated.\n",
635 sblock.fs_ncyl -= sblock.fs_ncyl % sblock.fs_cpg;
636 sblock.fs_size = fssize = sblock.fs_ncyl * sblock.fs_spc /
641 printf("Warning: %d sector(s) in last cylinder unallocated\n",
643 (fssize * NSPF(&sblock) - (sblock.fs_ncyl - 1)
647 * fill in remaining fields of the super block
649 sblock.fs_csaddr = cgdmin(&sblock, 0);
651 fragroundup(&sblock, sblock.fs_ncg * sizeof(struct csum));
653 * The superblock fields 'fs_csmask' and 'fs_csshift' are no
654 * longer used. However, we still initialise them so that the
655 * filesystem remains compatible with old kernels.
657 i = sblock.fs_bsize / sizeof(struct csum);
658 sblock.fs_csmask = ~(i - 1);
659 for (sblock.fs_csshift = 0; i > 1; i >>= 1)
661 fscs = (struct csum *)calloc(1, sblock.fs_cssize);
663 errx(31, "calloc failed");
664 sblock.fs_magic = FS_MAGIC;
665 sblock.fs_rotdelay = rotdelay;
666 sblock.fs_minfree = minfree;
667 sblock.fs_maxcontig = maxcontig;
668 sblock.fs_maxbpg = maxbpg;
669 sblock.fs_rps = rpm / 60;
670 sblock.fs_optim = opt;
671 sblock.fs_cgrotor = 0;
672 sblock.fs_cstotal.cs_ndir = 0;
673 sblock.fs_cstotal.cs_nbfree = 0;
674 sblock.fs_cstotal.cs_nifree = 0;
675 sblock.fs_cstotal.cs_nffree = 0;
680 sblock.fs_id[0] = (long)utime;
681 sblock.fs_id[1] = random();
685 * Dump out summary information about file system.
688 printf("%s:\t%d sectors in %d %s of %d tracks, %d sectors\n",
689 fsys, sblock.fs_size * NSPF(&sblock), sblock.fs_ncyl,
690 "cylinders", sblock.fs_ntrak, sblock.fs_nsect);
691 #define B2MBFACTOR (1 / (1024.0 * 1024.0))
692 printf("\t%.1fMB in %d cyl groups (%d c/g, %.2fMB/g, %d i/g)%s\n",
693 (float)sblock.fs_size * sblock.fs_fsize * B2MBFACTOR,
694 sblock.fs_ncg, sblock.fs_cpg,
695 (float)sblock.fs_fpg * sblock.fs_fsize * B2MBFACTOR,
697 sblock.fs_flags & FS_DOSOFTDEP ? " SOFTUPDATES" : "");
701 * Now build the cylinders group blocks and
702 * then print out indices of cylinder groups.
705 printf("super-block backups (for fsck -b #) at:\n");
707 width = charsperline();
708 for (cylno = 0; cylno < sblock.fs_ncg; cylno++) {
709 initcg(cylno, utime);
712 j = snprintf(tmpbuf, sizeof(tmpbuf), " %ld%s",
713 fsbtodb(&sblock, cgsblock(&sblock, cylno)),
714 cylno < (sblock.fs_ncg-1) ? "," : "" );
715 if (i + j >= width) {
720 printf("%s", tmpbuf);
728 * Now construct the initial file system,
729 * then write out the super-block.
732 sblock.fs_time = utime;
733 wtfs((int)SBOFF / sectorsize, sbsize, (char *)&sblock);
734 for (i = 0; i < sblock.fs_cssize; i += sblock.fs_bsize)
735 wtfs(fsbtodb(&sblock, sblock.fs_csaddr + numfrags(&sblock, i)),
736 sblock.fs_cssize - i < sblock.fs_bsize ?
737 sblock.fs_cssize - i : sblock.fs_bsize,
740 * Write out the duplicate super blocks
742 for (cylno = 0; cylno < sblock.fs_ncg; cylno++)
743 wtfs(fsbtodb(&sblock, cgsblock(&sblock, cylno)),
744 sbsize, (char *)&sblock);
747 * Update information about this partion in pack
748 * label, to that it may be updated on disk.
750 pp->p_fstype = FS_BSDFFS;
751 pp->p_fsize = sblock.fs_fsize;
752 pp->p_frag = sblock.fs_frag;
753 pp->p_cpg = sblock.fs_cpg;
755 * Notify parent process of success.
756 * Dissociate from session and tty.
759 kill(mfs_ppid, SIGUSR1);
769 * Initialize a cylinder group.
776 daddr_t cbase, d, dlower, dupper, dmax, blkno;
778 register struct csum *cs;
784 * Determine block bounds for cylinder group.
785 * Allow space for super block summary information in first
788 cbase = cgbase(&sblock, cylno);
789 dmax = cbase + sblock.fs_fpg;
790 if (dmax > sblock.fs_size)
791 dmax = sblock.fs_size;
792 dlower = cgsblock(&sblock, cylno) - cbase;
793 dupper = cgdmin(&sblock, cylno) - cbase;
795 dupper += howmany(sblock.fs_cssize, sblock.fs_fsize);
797 memset(&acg, 0, sblock.fs_cgsize);
799 acg.cg_magic = CG_MAGIC;
801 if (cylno == sblock.fs_ncg - 1)
802 acg.cg_ncyl = sblock.fs_ncyl % sblock.fs_cpg;
804 acg.cg_ncyl = sblock.fs_cpg;
805 acg.cg_niblk = sblock.fs_ipg;
806 acg.cg_ndblk = dmax - cbase;
807 if (sblock.fs_contigsumsize > 0)
808 acg.cg_nclusterblks = acg.cg_ndblk / sblock.fs_frag;
809 acg.cg_btotoff = &acg.cg_space[0] - (u_char *)(&acg.cg_firstfield);
810 acg.cg_boff = acg.cg_btotoff + sblock.fs_cpg * sizeof(int32_t);
811 acg.cg_iusedoff = acg.cg_boff +
812 sblock.fs_cpg * sblock.fs_nrpos * sizeof(u_int16_t);
813 acg.cg_freeoff = acg.cg_iusedoff + howmany(sblock.fs_ipg, NBBY);
814 if (sblock.fs_contigsumsize <= 0) {
815 acg.cg_nextfreeoff = acg.cg_freeoff +
816 howmany(sblock.fs_cpg * sblock.fs_spc / NSPF(&sblock), NBBY);
818 acg.cg_clustersumoff = acg.cg_freeoff + howmany
819 (sblock.fs_cpg * sblock.fs_spc / NSPF(&sblock), NBBY) -
821 acg.cg_clustersumoff =
822 roundup(acg.cg_clustersumoff, sizeof(u_int32_t));
823 acg.cg_clusteroff = acg.cg_clustersumoff +
824 (sblock.fs_contigsumsize + 1) * sizeof(u_int32_t);
825 acg.cg_nextfreeoff = acg.cg_clusteroff + howmany
826 (sblock.fs_cpg * sblock.fs_spc / NSPB(&sblock), NBBY);
828 if (acg.cg_nextfreeoff - (long)(&acg.cg_firstfield) > sblock.fs_cgsize) {
829 printf("Panic: cylinder group too big\n");
832 acg.cg_cs.cs_nifree += sblock.fs_ipg;
834 for (i = 0; i < ROOTINO; i++) {
835 setbit(cg_inosused(&acg), i);
836 acg.cg_cs.cs_nifree--;
838 for (i = 0; i < sblock.fs_ipg / INOPF(&sblock); i += sblock.fs_frag) {
840 for (j = 0; j < sblock.fs_bsize / sizeof(struct dinode); j++)
841 zino[j].di_gen = random();
843 wtfs(fsbtodb(&sblock, cgimin(&sblock, cylno) + i),
844 sblock.fs_bsize, (char *)zino);
848 * In cylno 0, beginning space is reserved
849 * for boot and super blocks.
851 for (d = 0; d < dlower; d += sblock.fs_frag) {
852 blkno = d / sblock.fs_frag;
853 setblock(&sblock, cg_blksfree(&acg), blkno);
854 if (sblock.fs_contigsumsize > 0)
855 setbit(cg_clustersfree(&acg), blkno);
856 acg.cg_cs.cs_nbfree++;
857 cg_blktot(&acg)[cbtocylno(&sblock, d)]++;
858 cg_blks(&sblock, &acg, cbtocylno(&sblock, d))
859 [cbtorpos(&sblock, d)]++;
861 sblock.fs_dsize += dlower;
863 sblock.fs_dsize += acg.cg_ndblk - dupper;
864 if ((i = dupper % sblock.fs_frag)) {
865 acg.cg_frsum[sblock.fs_frag - i]++;
866 for (d = dupper + sblock.fs_frag - i; dupper < d; dupper++) {
867 setbit(cg_blksfree(&acg), dupper);
868 acg.cg_cs.cs_nffree++;
871 for (d = dupper; d + sblock.fs_frag <= dmax - cbase; ) {
872 blkno = d / sblock.fs_frag;
873 setblock(&sblock, cg_blksfree(&acg), blkno);
874 if (sblock.fs_contigsumsize > 0)
875 setbit(cg_clustersfree(&acg), blkno);
876 acg.cg_cs.cs_nbfree++;
877 cg_blktot(&acg)[cbtocylno(&sblock, d)]++;
878 cg_blks(&sblock, &acg, cbtocylno(&sblock, d))
879 [cbtorpos(&sblock, d)]++;
882 if (d < dmax - cbase) {
883 acg.cg_frsum[dmax - cbase - d]++;
884 for (; d < dmax - cbase; d++) {
885 setbit(cg_blksfree(&acg), d);
886 acg.cg_cs.cs_nffree++;
889 if (sblock.fs_contigsumsize > 0) {
890 int32_t *sump = cg_clustersum(&acg);
891 u_char *mapp = cg_clustersfree(&acg);
896 for (i = 0; i < acg.cg_nclusterblks; i++) {
897 if ((map & bit) != 0) {
899 } else if (run != 0) {
900 if (run > sblock.fs_contigsumsize)
901 run = sblock.fs_contigsumsize;
905 if ((i & (NBBY - 1)) != (NBBY - 1)) {
913 if (run > sblock.fs_contigsumsize)
914 run = sblock.fs_contigsumsize;
918 sblock.fs_cstotal.cs_ndir += acg.cg_cs.cs_ndir;
919 sblock.fs_cstotal.cs_nffree += acg.cg_cs.cs_nffree;
920 sblock.fs_cstotal.cs_nbfree += acg.cg_cs.cs_nbfree;
921 sblock.fs_cstotal.cs_nifree += acg.cg_cs.cs_nifree;
923 wtfs(fsbtodb(&sblock, cgtod(&sblock, cylno)),
924 sblock.fs_bsize, (char *)&acg);
928 * initialize the file system
938 struct direct root_dir[] = {
939 { ROOTINO, sizeof(struct direct), DT_DIR, 1, "." },
940 { ROOTINO, sizeof(struct direct), DT_DIR, 2, ".." },
942 { LOSTFOUNDINO, sizeof(struct direct), DT_DIR, 10, "lost+found" },
949 u_char d_name[MAXNAMLEN + 1];
951 { ROOTINO, sizeof(struct direct), 1, "." },
952 { ROOTINO, sizeof(struct direct), 2, ".." },
954 { LOSTFOUNDINO, sizeof(struct direct), 10, "lost+found" },
958 struct direct lost_found_dir[] = {
959 { LOSTFOUNDINO, sizeof(struct direct), DT_DIR, 1, "." },
960 { ROOTINO, sizeof(struct direct), DT_DIR, 2, ".." },
961 { 0, DIRBLKSIZ, 0, 0, 0 },
963 struct odirect olost_found_dir[] = {
964 { LOSTFOUNDINO, sizeof(struct direct), 1, "." },
965 { ROOTINO, sizeof(struct direct), 2, ".." },
966 { 0, DIRBLKSIZ, 0, 0 },
980 * initialize the node
982 node.di_atime = utime;
983 node.di_mtime = utime;
984 node.di_ctime = utime;
987 * create the lost+found directory
990 (void)makedir((struct direct *)olost_found_dir, 2);
991 for (i = DIRBLKSIZ; i < sblock.fs_bsize; i += DIRBLKSIZ)
992 memmove(&buf[i], &olost_found_dir[2],
993 DIRSIZ(0, &olost_found_dir[2]));
995 (void)makedir(lost_found_dir, 2);
996 for (i = DIRBLKSIZ; i < sblock.fs_bsize; i += DIRBLKSIZ)
997 memmove(&buf[i], &lost_found_dir[2],
998 DIRSIZ(0, &lost_found_dir[2]));
1000 node.di_mode = IFDIR | UMASK;
1002 node.di_size = sblock.fs_bsize;
1003 node.di_db[0] = alloc(node.di_size, node.di_mode);
1004 node.di_blocks = btodb(fragroundup(&sblock, node.di_size));
1005 wtfs(fsbtodb(&sblock, node.di_db[0]), node.di_size, buf);
1006 iput(&node, LOSTFOUNDINO);
1009 * create the root directory
1012 node.di_mode = IFDIR | 01777;
1014 node.di_mode = IFDIR | UMASK;
1015 node.di_nlink = PREDEFDIR;
1017 node.di_size = makedir((struct direct *)oroot_dir, PREDEFDIR);
1019 node.di_size = makedir(root_dir, PREDEFDIR);
1020 node.di_db[0] = alloc(sblock.fs_fsize, node.di_mode);
1021 node.di_blocks = btodb(fragroundup(&sblock, node.di_size));
1022 wtfs(fsbtodb(&sblock, node.di_db[0]), sblock.fs_fsize, buf);
1023 iput(&node, ROOTINO);
1027 * construct a set of directory entries in "buf".
1028 * return size of directory.
1031 makedir(protodir, entries)
1032 register struct direct *protodir;
1038 spcleft = DIRBLKSIZ;
1039 for (cp = buf, i = 0; i < entries - 1; i++) {
1040 protodir[i].d_reclen = DIRSIZ(0, &protodir[i]);
1041 memmove(cp, &protodir[i], protodir[i].d_reclen);
1042 cp += protodir[i].d_reclen;
1043 spcleft -= protodir[i].d_reclen;
1045 protodir[i].d_reclen = spcleft;
1046 memmove(cp, &protodir[i], DIRSIZ(0, &protodir[i]));
1051 * allocate a block or frag
1061 rdfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize,
1063 if (acg.cg_magic != CG_MAGIC) {
1064 printf("cg 0: bad magic number\n");
1067 if (acg.cg_cs.cs_nbfree == 0) {
1068 printf("first cylinder group ran out of space\n");
1071 for (d = 0; d < acg.cg_ndblk; d += sblock.fs_frag)
1072 if (isblock(&sblock, cg_blksfree(&acg), d / sblock.fs_frag))
1074 printf("internal error: can't find block in cyl 0\n");
1077 blkno = fragstoblks(&sblock, d);
1078 clrblock(&sblock, cg_blksfree(&acg), blkno);
1079 if (sblock.fs_contigsumsize > 0)
1080 clrbit(cg_clustersfree(&acg), blkno);
1081 acg.cg_cs.cs_nbfree--;
1082 sblock.fs_cstotal.cs_nbfree--;
1083 fscs[0].cs_nbfree--;
1085 acg.cg_cs.cs_ndir++;
1086 sblock.fs_cstotal.cs_ndir++;
1089 cg_blktot(&acg)[cbtocylno(&sblock, d)]--;
1090 cg_blks(&sblock, &acg, cbtocylno(&sblock, d))[cbtorpos(&sblock, d)]--;
1091 if (size != sblock.fs_bsize) {
1092 frag = howmany(size, sblock.fs_fsize);
1093 fscs[0].cs_nffree += sblock.fs_frag - frag;
1094 sblock.fs_cstotal.cs_nffree += sblock.fs_frag - frag;
1095 acg.cg_cs.cs_nffree += sblock.fs_frag - frag;
1096 acg.cg_frsum[sblock.fs_frag - frag]++;
1097 for (i = frag; i < sblock.fs_frag; i++)
1098 setbit(cg_blksfree(&acg), d + i);
1100 wtfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize,
1106 * Calculate number of inodes per group.
1109 calcipg(cpg, bpcg, usedbp)
1115 long ipg, new_ipg, ncg, ncyl;
1119 * Prepare to scale by fssize / (number of sectors in cylinder groups).
1120 * Note that fssize is still in sectors, not filesystem blocks.
1122 ncyl = howmany(fssize, (u_int)secpercyl);
1123 ncg = howmany(ncyl, cpg);
1125 * Iterate a few times to allow for ipg depending on itself.
1128 for (i = 0; i < 10; i++) {
1129 usedb = (sblock.fs_iblkno + ipg / INOPF(&sblock))
1130 * NSPF(&sblock) * (off_t)sectorsize;
1131 new_ipg = (cpg * (quad_t)bpcg - usedb) / density * fssize
1132 / ncg / secpercyl / cpg;
1133 new_ipg = roundup(new_ipg, INOPB(&sblock));
1143 * Allocate an inode on the disk
1147 register struct dinode *ip;
1150 struct dinode buf[MAXINOPB];
1155 ip->di_gen = random();
1157 c = ino_to_cg(&sblock, ino);
1158 rdfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize,
1160 if (acg.cg_magic != CG_MAGIC) {
1161 printf("cg 0: bad magic number\n");
1164 acg.cg_cs.cs_nifree--;
1165 setbit(cg_inosused(&acg), ino);
1166 wtfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize,
1168 sblock.fs_cstotal.cs_nifree--;
1169 fscs[0].cs_nifree--;
1170 if (ino >= sblock.fs_ipg * sblock.fs_ncg) {
1171 printf("fsinit: inode value out of range (%d).\n", ino);
1174 d = fsbtodb(&sblock, ino_to_fsba(&sblock, ino));
1175 rdfs(d, sblock.fs_bsize, (char *)buf);
1176 buf[ino_to_fsbo(&sblock, ino)] = *ip;
1177 wtfs(d, sblock.fs_bsize, (char *)buf);
1181 * Notify parent process that the filesystem has created itself successfully.
1183 * We have to wait until the mount has actually completed!
1188 int retry = 100; /* 10 seconds, 100ms */
1190 while (mfs_ppid && retry) {
1194 stat(mfs_mtpt, &st) < 0 ||
1195 st.st_dev != mfs_mtstat.st_dev
1203 fatal("mfs mount failed waiting for mount to go active");
1210 * Replace libc function with one suited to our needs.
1214 register u_long size;
1222 pgsz = getpagesize() - 1;
1223 i = (char *)((u_long)(base + pgsz) &~ pgsz);
1224 base = sbrk(i - base);
1225 if (getrlimit(RLIMIT_DATA, &rlp) < 0)
1227 rlp.rlim_cur = rlp.rlim_max;
1228 if (setrlimit(RLIMIT_DATA, &rlp) < 0)
1230 memleft = rlp.rlim_max - (u_long)base;
1232 size = (size + pgsz) &~ pgsz;
1238 return ((caddr_t)sbrk(size));
1242 * Replace libc function with one suited to our needs.
1251 if ((p = malloc(size)) == NULL)
1253 memmove(p, ptr, size);
1259 * Replace libc function with one suited to our needs.
1262 calloc(size, numelm)
1263 u_long size, numelm;
1268 if ((base = malloc(size)) == NULL)
1270 memset(base, 0, size);
1275 * Replace libc function with one suited to our needs.
1282 /* do not worry about it for now */
1285 #else /* !STANDALONE */
1292 if (getrlimit(RLIMIT_DATA, &rlp) < 0)
1294 rlp.rlim_cur = rlp.rlim_max;
1295 if (setrlimit(RLIMIT_DATA, &rlp) < 0)
1300 extern char *_etext;
1301 #define etext _etext
1315 pgsz = getpagesize() - 1;
1316 dstart = ((u_long)&etext) &~ pgsz;
1317 freestart = ((u_long)(sbrk(0) + pgsz) &~ pgsz);
1318 if (getrlimit(RLIMIT_DATA, &rlp) < 0)
1320 memused = freestart - dstart;
1321 memleft = rlp.rlim_cur - memused;
1323 #endif /* STANDALONE */
1326 * read a block from the file system
1338 memmove(bf, membase + bno * sectorsize, size);
1341 if (lseek(fsi, (off_t)bno * sectorsize, 0) < 0) {
1342 printf("seek error: %ld\n", (long)bno);
1345 n = read(fsi, bf, size);
1347 printf("read error: %ld\n", (long)bno);
1352 #define WCSIZE (128 * 1024)
1353 daddr_t wc_sect; /* units of sectorsize */
1354 int wc_end; /* bytes */
1355 static char wc[WCSIZE]; /* bytes */
1358 * Flush dirty write behind buffer.
1365 if (lseek(fso, (off_t)wc_sect * sectorsize, SEEK_SET) < 0) {
1366 printf("seek error: %ld\n", (long)wc_sect);
1367 err(35, "wtfs - writecombine");
1369 n = write(fso, wc, wc_end);
1371 printf("write error: %ld\n", (long)wc_sect);
1372 err(36, "wtfs - writecombine");
1379 * write a block to the file system
1391 memmove(membase + bno * sectorsize, bf, size);
1397 if (wc_end == 0 && size <= WCSIZE) {
1399 bcopy(bf, wc, size);
1401 if (wc_end < WCSIZE)
1405 if ((off_t)wc_sect * sectorsize + wc_end == (off_t)bno * sectorsize &&
1406 wc_end + size <= WCSIZE) {
1407 bcopy(bf, wc + wc_end, size);
1409 if (wc_end < WCSIZE)
1416 if (lseek(fso, (off_t)bno * sectorsize, SEEK_SET) < 0) {
1417 printf("seek error: %ld\n", (long)bno);
1420 n = write(fso, bf, size);
1422 printf("write error: %ld\n", (long)bno);
1428 * check if a block is available
1438 switch (fs->fs_frag) {
1440 return (cp[h] == 0xff);
1442 mask = 0x0f << ((h & 0x1) << 2);
1443 return ((cp[h >> 1] & mask) == mask);
1445 mask = 0x03 << ((h & 0x3) << 1);
1446 return ((cp[h >> 2] & mask) == mask);
1448 mask = 0x01 << (h & 0x7);
1449 return ((cp[h >> 3] & mask) == mask);
1452 printf("isblock bad fs_frag %d\n", fs->fs_frag);
1454 fprintf(stderr, "isblock bad fs_frag %d\n", fs->fs_frag);
1461 * take a block out of the map
1469 switch ((fs)->fs_frag) {
1474 cp[h >> 1] &= ~(0x0f << ((h & 0x1) << 2));
1477 cp[h >> 2] &= ~(0x03 << ((h & 0x3) << 1));
1480 cp[h >> 3] &= ~(0x01 << (h & 0x7));
1484 printf("clrblock bad fs_frag %d\n", fs->fs_frag);
1486 fprintf(stderr, "clrblock bad fs_frag %d\n", fs->fs_frag);
1493 * put a block into the map
1501 switch (fs->fs_frag) {
1506 cp[h >> 1] |= (0x0f << ((h & 0x1) << 2));
1509 cp[h >> 2] |= (0x03 << ((h & 0x3) << 1));
1512 cp[h >> 3] |= (0x01 << (h & 0x7));
1516 printf("setblock bad fs_frag %d\n", fs->fs_frag);
1518 fprintf(stderr, "setblock bad fs_frag %d\n", fs->fs_frag);
1525 * Determine the number of characters in a
1537 if (ioctl(0, TIOCGWINSZ, &ws) != -1)
1538 columns = ws.ws_col;
1539 if (columns == 0 && (cp = getenv("COLUMNS")))
1542 columns = 80; /* last resort */