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
33 * @(#)mkfs.c 8.11 (Berkeley) 5/3/95
34 * $FreeBSD: src/sbin/newfs/mkfs.c,v 1.29.2.6 2001/09/21 19:15:21 dillon Exp $
35 * $DragonFly: src/sbin/newfs/mkfs.c,v 1.14 2007/05/20 19:29:21 dillon Exp $
44 extern int atoi(char *);
45 extern char * getenv(char *);
48 extern long random(void);
49 extern void srandomdev(void);
52 #endif /* STANDALONE */
55 * make file system for cylinder-group style file systems
59 * We limit the size of the inode map to be no more than a
60 * third of the cylinder group space, since we must leave at
61 * least an equal amount of space for the block map.
63 * N.B.: MAXIPG must be a multiple of INOPB(fs).
65 #define MAXIPG(fs) roundup((fs)->fs_bsize * NBBY / 3, INOPB(fs))
68 #define MAXINOPB (MAXBSIZE / sizeof(struct ufs1_dinode))
69 #define POWEROF2(num) (((num) & ((num) - 1)) == 0)
72 * variables set up by front end.
74 extern int mfs; /* run as the memory based filesystem */
75 extern char *mfs_mtpt; /* mount point for mfs */
76 extern struct stat mfs_mtstat; /* stat prior to mount */
77 extern int Nflag; /* run mkfs without writing file system */
78 extern int Oflag; /* format as an 4.3BSD file system */
79 extern int Uflag; /* enable soft updates for file system */
80 extern int fssize; /* file system size */
81 extern int ntracks; /* # tracks/cylinder */
82 extern int nsectors; /* # sectors/track */
83 extern int nphyssectors; /* # sectors/track including spares */
84 extern int secpercyl; /* sectors per cylinder */
85 extern int sectorsize; /* bytes/sector */
86 extern int realsectorsize; /* bytes/sector in hardware*/
87 extern int rpm; /* revolutions/minute of drive */
88 extern int interleave; /* hardware sector interleave */
89 extern int trackskew; /* sector 0 skew, per track */
90 extern int fsize; /* fragment size */
91 extern int bsize; /* block size */
92 extern int cpg; /* cylinders/cylinder group */
93 extern int cpgflg; /* cylinders/cylinder group flag was given */
94 extern int minfree; /* free space threshold */
95 extern int opt; /* optimization preference (space or time) */
96 extern int density; /* number of bytes per inode */
97 extern int maxcontig; /* max contiguous blocks to allocate */
98 extern int rotdelay; /* rotational delay between blocks */
99 extern int maxbpg; /* maximum blocks per file in a cyl group */
100 extern int nrpos; /* # of distinguished rotational positions */
101 extern int bbsize; /* boot block size */
102 extern int sbsize; /* superblock size */
103 extern int avgfilesize; /* expected average file size */
104 extern int avgfilesperdir; /* expected number of files per directory */
105 extern u_long memleft; /* virtual memory available */
106 extern caddr_t membase; /* start address of memory based filesystem */
107 extern char * filename;
108 extern struct disktab geom;
110 extern void fatal(const char *fmt, ...);
116 #define sblock fsun.fs
125 struct ufs1_dinode zino[MAXBSIZE / sizeof(struct ufs1_dinode)];
128 static fsnode_t copyroot;
129 static fsnode_t copyhlinks;
133 daddr_t alloc(int, int);
134 long calcipg(long, long, off_t *);
135 static int charsperline(void);
136 void clrblock(struct fs *, unsigned char *, int);
138 void initcg(int, time_t);
139 int isblock(struct fs *, unsigned char *, int);
140 void iput(struct ufs1_dinode *, ino_t);
141 int makedir(struct direct *, int);
142 void parentready(int);
143 void rdfs(daddr_t, int, char *);
144 void setblock(struct fs *, unsigned char *, int);
146 void wtfs(daddr_t, int, char *);
147 void wtfsflush(void);
150 void get_memleft(void);
151 void raise_data_limit(void);
154 char * calloc(u_long, u_long);
155 caddr_t malloc(u_long);
156 caddr_t realloc(char *, u_long);
160 int parentready_signalled;
163 mkfs(char *fsys, int fi, int fo, const char *mfscopy)
165 long i, mincpc, mincpg, inospercg;
166 long cylno, rpos, blk, j, emitwarn = 0;
167 long used, mincpgcnt, bpcg;
169 long mapcramped, inodecramped;
170 long postblsize, rotblsize, totalsbsize;
175 char tmpbuf[100]; /* XXX this will break in about 2,500 years */
191 signal(SIGUSR1, parentready);
192 if ((child = fork()) != 0) {
196 copyroot = FSCopy(©hlinks, mfscopy);
197 signal(SIGUSR1, started);
198 kill(child, SIGUSR1);
199 if (waitpid(child, &status, 0) != -1 && WIFEXITED(status))
200 exit(WEXITSTATUS(status));
204 omask = sigblock(1 << SIGUSR1);
205 while (parentready_signalled == 0)
206 sigpause(1 << SIGUSR1);
213 if (filename != NULL) {
214 unsigned char buf[BUFSIZ];
218 fd = open(filename, O_RDWR|O_TRUNC|O_CREAT, 0644);
220 err(12, "%s", filename);
221 l1 = fssize * sectorsize;
224 for (l = 0; l < (u_long)fssize * (u_long)sectorsize; l += l1) {
225 w = write(fd, buf, l1);
226 if (w < 0 || (u_long)w != l1)
227 err(12, "%s", filename);
232 PROT_READ|PROT_WRITE,
236 if(membase == MAP_FAILED)
243 if ((u_long)fssize * (u_long)sectorsize >
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 ufs1_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 ufs1_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) > (uint32_t)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) > (uint32_t)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) > (uint32_t)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)
508 if (mapcramped && inodecramped)
509 printf("Block size and bytes per inode restrict");
511 printf("Block size restricts");
513 printf("Bytes per inode restrict");
514 printf(" cylinders per group to %d.\n", sblock.fs_cpg);
519 sblock.fs_cgsize = fragroundup(&sblock, CGSIZE(&sblock));
521 * Now have size for file system and nsect and ntrak.
522 * Determine number of cylinders and blocks in the file system.
524 sblock.fs_size = fssize = dbtofsb(&sblock, fssize);
525 sblock.fs_ncyl = fssize * NSPF(&sblock) / sblock.fs_spc;
526 if (fssize * NSPF(&sblock) > sblock.fs_ncyl * sblock.fs_spc) {
530 if (sblock.fs_ncyl < 1) {
531 printf("file systems must have at least one cylinder\n");
535 * Determine feasability/values of rotational layout tables.
537 * The size of the rotational layout tables is limited by the
538 * size of the superblock, SBSIZE. The amount of space available
539 * for tables is calculated as (SBSIZE - sizeof (struct fs)).
540 * The size of these tables is inversely proportional to the block
541 * size of the file system. The size increases if sectors per track
542 * are not powers of two, because more cylinders must be described
543 * by the tables before the rotational pattern repeats (fs_cpc).
545 sblock.fs_interleave = interleave;
546 sblock.fs_trackskew = trackskew;
547 sblock.fs_npsect = nphyssectors;
548 sblock.fs_postblformat = FS_DYNAMICPOSTBLFMT;
549 sblock.fs_sbsize = fragroundup(&sblock, sizeof(struct fs));
550 if (sblock.fs_sbsize > SBSIZE)
551 sblock.fs_sbsize = SBSIZE;
552 if (sblock.fs_ntrak == 1) {
556 postblsize = sblock.fs_nrpos * sblock.fs_cpc * sizeof(int16_t);
557 rotblsize = sblock.fs_cpc * sblock.fs_spc / NSPB(&sblock);
558 totalsbsize = sizeof(struct fs) + rotblsize;
559 if (sblock.fs_nrpos == 8 && sblock.fs_cpc <= 16) {
560 /* use old static table space */
561 sblock.fs_postbloff = (char *)(&sblock.fs_opostbl[0][0]) -
562 (char *)(&sblock.fs_firstfield);
563 sblock.fs_rotbloff = &sblock.fs_space[0] -
564 (u_char *)(&sblock.fs_firstfield);
566 /* use dynamic table space */
567 sblock.fs_postbloff = &sblock.fs_space[0] -
568 (u_char *)(&sblock.fs_firstfield);
569 sblock.fs_rotbloff = sblock.fs_postbloff + postblsize;
570 totalsbsize += postblsize;
572 if (totalsbsize > SBSIZE ||
573 sblock.fs_nsect > (1 << NBBY) * NSPB(&sblock)) {
574 printf("%s %s %d %s %d.%s",
575 "Warning: insufficient space in super block for\n",
576 "rotational layout tables with nsect", sblock.fs_nsect,
577 "and ntrak", sblock.fs_ntrak,
578 "\nFile system performance may be impaired.\n");
582 sblock.fs_sbsize = fragroundup(&sblock, totalsbsize);
583 if (sblock.fs_sbsize > SBSIZE)
584 sblock.fs_sbsize = SBSIZE;
586 * calculate the available blocks for each rotational position
588 for (cylno = 0; cylno < sblock.fs_cpc; cylno++)
589 for (rpos = 0; rpos < sblock.fs_nrpos; rpos++)
590 fs_postbl(&sblock, cylno)[rpos] = -1;
591 for (i = (rotblsize - 1) * sblock.fs_frag;
592 i >= 0; i -= sblock.fs_frag) {
593 cylno = cbtocylno(&sblock, i);
594 rpos = cbtorpos(&sblock, i);
595 blk = fragstoblks(&sblock, i);
596 if (fs_postbl(&sblock, cylno)[rpos] == -1)
597 fs_rotbl(&sblock)[blk] = 0;
599 fs_rotbl(&sblock)[blk] =
600 fs_postbl(&sblock, cylno)[rpos] - blk;
601 fs_postbl(&sblock, cylno)[rpos] = blk;
605 * Compute/validate number of cylinder groups.
607 sblock.fs_ncg = sblock.fs_ncyl / sblock.fs_cpg;
608 if (sblock.fs_ncyl % sblock.fs_cpg)
610 sblock.fs_dblkno = sblock.fs_iblkno + sblock.fs_ipg / INOPF(&sblock);
611 i = MIN(~sblock.fs_cgmask, sblock.fs_ncg - 1);
612 if (cgdmin(&sblock, i) - cgbase(&sblock, i) >= sblock.fs_fpg) {
613 printf("inode blocks/cyl group (%ld) >= data blocks (%ld)\n",
614 cgdmin(&sblock, i) - cgbase(&sblock, i) / sblock.fs_frag,
615 (long)(sblock.fs_fpg / sblock.fs_frag));
616 printf("number of cylinders per cylinder group (%d) %s.\n",
617 sblock.fs_cpg, "must be increased");
620 j = sblock.fs_ncg - 1;
621 if ((i = fssize - j * sblock.fs_fpg) < sblock.fs_fpg &&
622 cgdmin(&sblock, j) - cgbase(&sblock, j) > i) {
624 printf("Filesystem must have at least %d sectors\n",
626 (cgdmin(&sblock, 0) + 3 * sblock.fs_frag));
630 "Warning: inode blocks/cyl group (%ld) >= data blocks (%ld) in last\n",
631 (cgdmin(&sblock, j) - cgbase(&sblock, j)) / sblock.fs_frag,
634 " cylinder group. This implies %ld sector(s) cannot be allocated.\n",
637 sblock.fs_ncyl -= sblock.fs_ncyl % sblock.fs_cpg;
638 sblock.fs_size = fssize = sblock.fs_ncyl * sblock.fs_spc /
642 if (emitwarn && !mfs) {
643 printf("Warning: %d sector(s) in last cylinder unallocated\n",
645 (fssize * NSPF(&sblock) - (sblock.fs_ncyl - 1)
649 * fill in remaining fields of the super block
651 sblock.fs_csaddr = cgdmin(&sblock, 0);
653 fragroundup(&sblock, sblock.fs_ncg * sizeof(struct csum));
655 * The superblock fields 'fs_csmask' and 'fs_csshift' are no
656 * longer used. However, we still initialise them so that the
657 * filesystem remains compatible with old kernels.
659 i = sblock.fs_bsize / sizeof(struct csum);
660 sblock.fs_csmask = ~(i - 1);
661 for (sblock.fs_csshift = 0; i > 1; i >>= 1)
663 fscs = (struct csum *)calloc(1, sblock.fs_cssize);
665 errx(31, "calloc failed");
666 sblock.fs_magic = FS_MAGIC;
667 sblock.fs_rotdelay = rotdelay;
668 sblock.fs_minfree = minfree;
669 sblock.fs_maxcontig = maxcontig;
670 sblock.fs_maxbpg = maxbpg;
671 sblock.fs_rps = rpm / 60;
672 sblock.fs_optim = opt;
673 sblock.fs_cgrotor = 0;
674 sblock.fs_cstotal.cs_ndir = 0;
675 sblock.fs_cstotal.cs_nbfree = 0;
676 sblock.fs_cstotal.cs_nifree = 0;
677 sblock.fs_cstotal.cs_nffree = 0;
682 sblock.fs_id[0] = (long)utime;
683 sblock.fs_id[1] = random();
687 * Dump out summary information about file system.
690 printf("%s:\t%d sectors in %d %s of %d tracks, %d sectors\n",
691 fsys, sblock.fs_size * NSPF(&sblock), sblock.fs_ncyl,
692 "cylinders", sblock.fs_ntrak, sblock.fs_nsect);
693 #define B2MBFACTOR (1 / (1024.0 * 1024.0))
694 printf("\t%.1fMB in %d cyl groups (%d c/g, %.2fMB/g, %d i/g)%s\n",
695 (float)sblock.fs_size * sblock.fs_fsize * B2MBFACTOR,
696 sblock.fs_ncg, sblock.fs_cpg,
697 (float)sblock.fs_fpg * sblock.fs_fsize * B2MBFACTOR,
699 sblock.fs_flags & FS_DOSOFTDEP ? " SOFTUPDATES" : "");
703 * Now build the cylinders group blocks and
704 * then print out indices of cylinder groups.
707 printf("super-block backups (for fsck -b #) at:\n");
709 width = charsperline();
710 for (cylno = 0; cylno < sblock.fs_ncg; cylno++) {
711 initcg(cylno, utime);
714 j = snprintf(tmpbuf, sizeof(tmpbuf), " %ld%s",
715 fsbtodb(&sblock, cgsblock(&sblock, cylno)),
716 cylno < (sblock.fs_ncg-1) ? "," : "" );
717 if (i + j >= width) {
722 printf("%s", tmpbuf);
730 * Now construct the initial file system,
731 * then write out the super-block.
734 sblock.fs_time = utime;
735 wtfs((int)SBOFF / sectorsize, sbsize, (char *)&sblock);
736 for (i = 0; i < sblock.fs_cssize; i += sblock.fs_bsize)
737 wtfs(fsbtodb(&sblock, sblock.fs_csaddr + numfrags(&sblock, i)),
738 sblock.fs_cssize - i < sblock.fs_bsize ?
739 sblock.fs_cssize - i : sblock.fs_bsize,
742 * Write out the duplicate super blocks
744 for (cylno = 0; cylno < sblock.fs_ncg; cylno++)
745 wtfs(fsbtodb(&sblock, cgsblock(&sblock, cylno)),
746 sbsize, (char *)&sblock);
750 * NOTE: we no longer update information in the disklabel
754 * Notify parent process of success.
755 * Dissociate from session and tty.
758 kill(mfs_ppid, SIGUSR1);
768 * Initialize a cylinder group.
771 initcg(int cylno, time_t utime)
773 daddr_t cbase, d, dlower, dupper, dmax, blkno;
782 * Determine block bounds for cylinder group.
783 * Allow space for super block summary information in first
786 cbase = cgbase(&sblock, cylno);
787 dmax = cbase + sblock.fs_fpg;
788 if (dmax > sblock.fs_size)
789 dmax = sblock.fs_size;
790 dlower = cgsblock(&sblock, cylno) - cbase;
791 dupper = cgdmin(&sblock, cylno) - cbase;
793 dupper += howmany(sblock.fs_cssize, sblock.fs_fsize);
795 memset(&acg, 0, sblock.fs_cgsize);
797 acg.cg_magic = CG_MAGIC;
799 if (cylno == sblock.fs_ncg - 1)
800 acg.cg_ncyl = sblock.fs_ncyl % sblock.fs_cpg;
802 acg.cg_ncyl = sblock.fs_cpg;
803 acg.cg_niblk = sblock.fs_ipg;
804 acg.cg_ndblk = dmax - cbase;
805 if (sblock.fs_contigsumsize > 0)
806 acg.cg_nclusterblks = acg.cg_ndblk / sblock.fs_frag;
807 acg.cg_btotoff = &acg.cg_space[0] - (u_char *)(&acg.cg_firstfield);
808 acg.cg_boff = acg.cg_btotoff + sblock.fs_cpg * sizeof(int32_t);
809 acg.cg_iusedoff = acg.cg_boff +
810 sblock.fs_cpg * sblock.fs_nrpos * sizeof(u_int16_t);
811 acg.cg_freeoff = acg.cg_iusedoff + howmany(sblock.fs_ipg, NBBY);
812 if (sblock.fs_contigsumsize <= 0) {
813 acg.cg_nextfreeoff = acg.cg_freeoff +
814 howmany(sblock.fs_cpg * sblock.fs_spc / NSPF(&sblock), NBBY);
816 acg.cg_clustersumoff = acg.cg_freeoff + howmany
817 (sblock.fs_cpg * sblock.fs_spc / NSPF(&sblock), NBBY) -
819 acg.cg_clustersumoff =
820 roundup(acg.cg_clustersumoff, sizeof(u_int32_t));
821 acg.cg_clusteroff = acg.cg_clustersumoff +
822 (sblock.fs_contigsumsize + 1) * sizeof(u_int32_t);
823 acg.cg_nextfreeoff = acg.cg_clusteroff + howmany
824 (sblock.fs_cpg * sblock.fs_spc / NSPB(&sblock), NBBY);
826 if (acg.cg_nextfreeoff - (long)(&acg.cg_firstfield) > sblock.fs_cgsize) {
827 printf("Panic: cylinder group too big\n");
830 acg.cg_cs.cs_nifree += sblock.fs_ipg;
832 for (k = 0; k < ROOTINO; k++) {
833 setbit(cg_inosused(&acg), k);
834 acg.cg_cs.cs_nifree--;
837 for (i = 0; i < sblock.fs_ipg / INOPF(&sblock); i += sblock.fs_frag) {
840 j < sblock.fs_bsize / sizeof(struct ufs1_dinode);
842 zino[j].di_gen = random();
845 wtfs(fsbtodb(&sblock, cgimin(&sblock, cylno) + i),
846 sblock.fs_bsize, (char *)zino);
850 * In cylno 0, beginning space is reserved
851 * for boot and super blocks.
853 for (d = 0; d < dlower; d += sblock.fs_frag) {
854 blkno = d / sblock.fs_frag;
855 setblock(&sblock, cg_blksfree(&acg), blkno);
856 if (sblock.fs_contigsumsize > 0)
857 setbit(cg_clustersfree(&acg), blkno);
858 acg.cg_cs.cs_nbfree++;
859 cg_blktot(&acg)[cbtocylno(&sblock, d)]++;
860 cg_blks(&sblock, &acg, cbtocylno(&sblock, d))
861 [cbtorpos(&sblock, d)]++;
863 sblock.fs_dsize += dlower;
865 sblock.fs_dsize += acg.cg_ndblk - dupper;
866 if ((i = dupper % sblock.fs_frag)) {
867 acg.cg_frsum[sblock.fs_frag - i]++;
868 for (d = dupper + sblock.fs_frag - i; dupper < d; dupper++) {
869 setbit(cg_blksfree(&acg), dupper);
870 acg.cg_cs.cs_nffree++;
873 for (d = dupper; d + sblock.fs_frag <= dmax - cbase; ) {
874 blkno = d / sblock.fs_frag;
875 setblock(&sblock, cg_blksfree(&acg), blkno);
876 if (sblock.fs_contigsumsize > 0)
877 setbit(cg_clustersfree(&acg), blkno);
878 acg.cg_cs.cs_nbfree++;
879 cg_blktot(&acg)[cbtocylno(&sblock, d)]++;
880 cg_blks(&sblock, &acg, cbtocylno(&sblock, d))
881 [cbtorpos(&sblock, d)]++;
884 if (d < dmax - cbase) {
885 acg.cg_frsum[dmax - cbase - d]++;
886 for (; d < dmax - cbase; d++) {
887 setbit(cg_blksfree(&acg), d);
888 acg.cg_cs.cs_nffree++;
891 if (sblock.fs_contigsumsize > 0) {
892 int32_t *sump = cg_clustersum(&acg);
893 u_char *mapp = cg_clustersfree(&acg);
898 for (i = 0; i < acg.cg_nclusterblks; i++) {
899 if ((map & bit) != 0) {
901 } else if (run != 0) {
902 if (run > sblock.fs_contigsumsize)
903 run = sblock.fs_contigsumsize;
907 if ((i & (NBBY - 1)) != (NBBY - 1)) {
915 if (run > sblock.fs_contigsumsize)
916 run = sblock.fs_contigsumsize;
920 sblock.fs_cstotal.cs_ndir += acg.cg_cs.cs_ndir;
921 sblock.fs_cstotal.cs_nffree += acg.cg_cs.cs_nffree;
922 sblock.fs_cstotal.cs_nbfree += acg.cg_cs.cs_nbfree;
923 sblock.fs_cstotal.cs_nifree += acg.cg_cs.cs_nifree;
925 wtfs(fsbtodb(&sblock, cgtod(&sblock, cylno)),
926 sblock.fs_bsize, (char *)&acg);
930 * initialize the file system
932 struct ufs1_dinode node;
940 struct direct root_dir[] = {
941 { ROOTINO, sizeof(struct direct), DT_DIR, 1, "." },
942 { ROOTINO, sizeof(struct direct), DT_DIR, 2, ".." },
944 { LOSTFOUNDINO, sizeof(struct direct), DT_DIR, 10, "lost+found" },
951 u_char d_name[MAXNAMLEN + 1];
953 { ROOTINO, sizeof(struct direct), 1, "." },
954 { ROOTINO, sizeof(struct direct), 2, ".." },
956 { LOSTFOUNDINO, sizeof(struct direct), 10, "lost+found" },
960 struct direct lost_found_dir[] = {
961 { LOSTFOUNDINO, sizeof(struct direct), DT_DIR, 1, "." },
962 { ROOTINO, sizeof(struct direct), DT_DIR, 2, ".." },
963 { 0, DIRBLKSIZ, 0, 0, 0 },
965 struct odirect olost_found_dir[] = {
966 { LOSTFOUNDINO, sizeof(struct direct), 1, "." },
967 { ROOTINO, sizeof(struct direct), 2, ".." },
968 { 0, DIRBLKSIZ, 0, 0 },
981 * initialize the node
983 node.di_atime = utime;
984 node.di_mtime = utime;
985 node.di_ctime = utime;
988 * create the lost+found directory
991 makedir((struct direct *)olost_found_dir, 2);
992 for (i = DIRBLKSIZ; i < sblock.fs_bsize; i += DIRBLKSIZ)
993 memmove(&buf[i], &olost_found_dir[2],
994 DIRSIZ(0, &olost_found_dir[2]));
996 makedir(lost_found_dir, 2);
997 for (i = DIRBLKSIZ; i < sblock.fs_bsize; i += DIRBLKSIZ)
998 memmove(&buf[i], &lost_found_dir[2],
999 DIRSIZ(0, &lost_found_dir[2]));
1001 node.di_mode = IFDIR | UMASK;
1003 node.di_size = sblock.fs_bsize;
1004 node.di_db[0] = alloc(node.di_size, node.di_mode);
1005 node.di_blocks = btodb(fragroundup(&sblock, node.di_size));
1006 wtfs(fsbtodb(&sblock, node.di_db[0]), node.di_size, buf);
1007 iput(&node, LOSTFOUNDINO);
1010 * create the root directory
1013 node.di_mode = IFDIR | 01777;
1015 node.di_mode = IFDIR | UMASK;
1016 node.di_nlink = PREDEFDIR;
1018 node.di_size = makedir((struct direct *)oroot_dir, PREDEFDIR);
1020 node.di_size = makedir(root_dir, PREDEFDIR);
1021 node.di_db[0] = alloc(sblock.fs_fsize, node.di_mode);
1022 node.di_blocks = btodb(fragroundup(&sblock, node.di_size));
1023 wtfs(fsbtodb(&sblock, node.di_db[0]), sblock.fs_fsize, buf);
1024 iput(&node, ROOTINO);
1028 * construct a set of directory entries in "buf".
1029 * return size of directory.
1032 makedir(struct direct *protodir, int entries)
1037 spcleft = DIRBLKSIZ;
1038 for (cp = buf, i = 0; i < entries - 1; i++) {
1039 protodir[i].d_reclen = DIRSIZ(0, &protodir[i]);
1040 memmove(cp, &protodir[i], protodir[i].d_reclen);
1041 cp += protodir[i].d_reclen;
1042 spcleft -= protodir[i].d_reclen;
1044 protodir[i].d_reclen = spcleft;
1045 memmove(cp, &protodir[i], DIRSIZ(0, &protodir[i]));
1050 * allocate a block or frag
1053 alloc(int size, int mode)
1058 rdfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize,
1060 if (acg.cg_magic != CG_MAGIC) {
1061 printf("cg 0: bad magic number\n");
1064 if (acg.cg_cs.cs_nbfree == 0) {
1065 printf("first cylinder group ran out of space\n");
1068 for (d = 0; d < acg.cg_ndblk; d += sblock.fs_frag)
1069 if (isblock(&sblock, cg_blksfree(&acg), d / sblock.fs_frag))
1071 printf("internal error: can't find block in cyl 0\n");
1074 blkno = fragstoblks(&sblock, d);
1075 clrblock(&sblock, cg_blksfree(&acg), blkno);
1076 if (sblock.fs_contigsumsize > 0)
1077 clrbit(cg_clustersfree(&acg), blkno);
1078 acg.cg_cs.cs_nbfree--;
1079 sblock.fs_cstotal.cs_nbfree--;
1080 fscs[0].cs_nbfree--;
1082 acg.cg_cs.cs_ndir++;
1083 sblock.fs_cstotal.cs_ndir++;
1086 cg_blktot(&acg)[cbtocylno(&sblock, d)]--;
1087 cg_blks(&sblock, &acg, cbtocylno(&sblock, d))[cbtorpos(&sblock, d)]--;
1088 if (size != sblock.fs_bsize) {
1089 frag = howmany(size, sblock.fs_fsize);
1090 fscs[0].cs_nffree += sblock.fs_frag - frag;
1091 sblock.fs_cstotal.cs_nffree += sblock.fs_frag - frag;
1092 acg.cg_cs.cs_nffree += sblock.fs_frag - frag;
1093 acg.cg_frsum[sblock.fs_frag - frag]++;
1094 for (i = frag; i < sblock.fs_frag; i++)
1095 setbit(cg_blksfree(&acg), d + i);
1097 wtfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize,
1103 * Calculate number of inodes per group.
1106 calcipg(long cylspg, long bpcg, off_t *usedbp)
1109 long ipg, new_ipg, ncg, ncyl;
1113 * Prepare to scale by fssize / (number of sectors in cylinder groups).
1114 * Note that fssize is still in sectors, not filesystem blocks.
1116 ncyl = howmany(fssize, (u_int)secpercyl);
1117 ncg = howmany(ncyl, cylspg);
1119 * Iterate a few times to allow for ipg depending on itself.
1122 for (i = 0; i < 10; i++) {
1123 usedb = (sblock.fs_iblkno + ipg / INOPF(&sblock))
1124 * NSPF(&sblock) * (off_t)sectorsize;
1125 new_ipg = (cylspg * (quad_t)bpcg - usedb) / density * fssize
1126 / ncg / secpercyl / cylspg;
1127 new_ipg = roundup(new_ipg, INOPB(&sblock));
1137 * Allocate an inode on the disk
1140 iput(struct ufs1_dinode *ip, ino_t ino)
1142 struct ufs1_dinode inobuf[MAXINOPB];
1147 ip->di_gen = random();
1149 c = ino_to_cg(&sblock, ino);
1150 rdfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize,
1152 if (acg.cg_magic != CG_MAGIC) {
1153 printf("cg 0: bad magic number\n");
1156 acg.cg_cs.cs_nifree--;
1157 setbit(cg_inosused(&acg), ino);
1158 wtfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize,
1160 sblock.fs_cstotal.cs_nifree--;
1161 fscs[0].cs_nifree--;
1162 if (ino >= (uint32_t)sblock.fs_ipg * (uint32_t)sblock.fs_ncg) {
1163 printf("fsinit: inode value out of range (%ju).\n",
1167 d = fsbtodb(&sblock, ino_to_fsba(&sblock, ino));
1168 rdfs(d, sblock.fs_bsize, (char *)inobuf);
1169 inobuf[ino_to_fsbo(&sblock, ino)] = *ip;
1170 wtfs(d, sblock.fs_bsize, (char *)inobuf);
1174 * Parent notifies child that it can proceed with the newfs and mount
1175 * operation (occurs after parent has copied the underlying filesystem
1176 * if the -C option was specified (for MFS), or immediately after the
1177 * parent forked the child otherwise).
1180 parentready(__unused int signo)
1182 parentready_signalled = 1;
1186 * Notify parent process that the filesystem has created itself successfully.
1188 * We have to wait until the mount has actually completed!
1191 started(__unused int signo)
1193 int retry = 100; /* 10 seconds, 100ms */
1195 while (mfs_ppid && retry) {
1199 stat(mfs_mtpt, &st) < 0 ||
1200 st.st_dev != mfs_mtstat.st_dev
1208 fatal("mfs mount failed waiting for mount to go active");
1209 } else if (copyroot) {
1210 FSPaste(mfs_mtpt, copyroot, copyhlinks);
1217 * Replace libc function with one suited to our needs.
1228 pgsz = getpagesize() - 1;
1229 i = (char *)((u_long)(base + pgsz) &~ pgsz);
1230 base = sbrk(i - base);
1231 if (getrlimit(RLIMIT_DATA, &rlp) < 0)
1233 rlp.rlim_cur = rlp.rlim_max;
1234 if (setrlimit(RLIMIT_DATA, &rlp) < 0)
1236 memleft = rlp.rlim_max - (u_long)base;
1238 size = (size + pgsz) &~ pgsz;
1244 return ((caddr_t)sbrk(size));
1248 * Replace libc function with one suited to our needs.
1251 realloc(char *ptr, u_long size)
1255 if ((p = malloc(size)) == NULL)
1257 memmove(p, ptr, size);
1263 * Replace libc function with one suited to our needs.
1266 calloc(u_long size, u_long numelm)
1271 if ((base = malloc(size)) == NULL)
1273 memset(base, 0, size);
1278 * Replace libc function with one suited to our needs.
1284 /* do not worry about it for now */
1287 #else /* !STANDALONE */
1290 raise_data_limit(void)
1294 if (getrlimit(RLIMIT_DATA, &rlp) < 0)
1296 rlp.rlim_cur = rlp.rlim_max;
1297 if (setrlimit(RLIMIT_DATA, &rlp) < 0)
1302 extern char *_etext;
1303 #define etext _etext
1317 pgsz = getpagesize() - 1;
1318 dstart = ((u_long)&etext) &~ pgsz;
1319 freestart = ((u_long)((char *)sbrk(0) + pgsz) &~ pgsz);
1320 if (getrlimit(RLIMIT_DATA, &rlp) < 0)
1322 memused = freestart - dstart;
1323 memleft = rlp.rlim_cur - memused;
1325 #endif /* STANDALONE */
1328 * read a block from the file system
1331 rdfs(daddr_t bno, int size, char *bf)
1337 memmove(bf, membase + bno * sectorsize, size);
1340 if (lseek(fsi, (off_t)bno * sectorsize, 0) < 0) {
1341 printf("seek error: %ld\n", (long)bno);
1344 n = read(fsi, bf, size);
1346 printf("read error: %ld\n", (long)bno);
1351 #define WCSIZE (128 * 1024)
1352 daddr_t wc_sect; /* units of sectorsize */
1353 int wc_end; /* bytes */
1354 static char wc[WCSIZE]; /* bytes */
1357 * Flush dirty write behind buffer.
1364 if (lseek(fso, (off_t)wc_sect * sectorsize, SEEK_SET) < 0) {
1365 printf("seek error: %ld\n", (long)wc_sect);
1366 err(35, "wtfs - writecombine");
1368 n = write(fso, wc, wc_end);
1370 printf("write error: %ld\n", (long)wc_sect);
1371 err(36, "wtfs - writecombine");
1378 * write a block to the file system
1381 wtfs(daddr_t bno, int size, char *bf)
1387 memmove(membase + bno * sectorsize, bf, size);
1393 if (wc_end == 0 && size <= WCSIZE) {
1395 bcopy(bf, wc, size);
1397 if (wc_end < WCSIZE)
1401 if ((off_t)wc_sect * sectorsize + wc_end == (off_t)bno * sectorsize &&
1402 wc_end + size <= WCSIZE) {
1403 bcopy(bf, wc + wc_end, size);
1405 if (wc_end < WCSIZE)
1412 if (lseek(fso, (off_t)bno * sectorsize, SEEK_SET) < 0) {
1413 printf("seek error: %ld\n", (long)bno);
1416 n = write(fso, bf, size);
1418 printf("write error: fso %d blk %ld %d/%d\n",
1419 fso, (long)bno, n, size);
1425 * check if a block is available
1428 isblock(struct fs *fs, unsigned char *cp, int h)
1432 switch (fs->fs_frag) {
1434 return (cp[h] == 0xff);
1436 mask = 0x0f << ((h & 0x1) << 2);
1437 return ((cp[h >> 1] & mask) == mask);
1439 mask = 0x03 << ((h & 0x3) << 1);
1440 return ((cp[h >> 2] & mask) == mask);
1442 mask = 0x01 << (h & 0x7);
1443 return ((cp[h >> 3] & mask) == mask);
1446 printf("isblock bad fs_frag %d\n", fs->fs_frag);
1448 fprintf(stderr, "isblock bad fs_frag %d\n", fs->fs_frag);
1455 * take a block out of the map
1458 clrblock(struct fs *fs, unsigned char *cp, int h)
1460 switch ((fs)->fs_frag) {
1465 cp[h >> 1] &= ~(0x0f << ((h & 0x1) << 2));
1468 cp[h >> 2] &= ~(0x03 << ((h & 0x3) << 1));
1471 cp[h >> 3] &= ~(0x01 << (h & 0x7));
1475 printf("clrblock bad fs_frag %d\n", fs->fs_frag);
1477 fprintf(stderr, "clrblock bad fs_frag %d\n", fs->fs_frag);
1484 * put a block into the map
1487 setblock(struct fs *fs, unsigned char *cp, int h)
1489 switch (fs->fs_frag) {
1494 cp[h >> 1] |= (0x0f << ((h & 0x1) << 2));
1497 cp[h >> 2] |= (0x03 << ((h & 0x3) << 1));
1500 cp[h >> 3] |= (0x01 << (h & 0x7));
1504 printf("setblock bad fs_frag %d\n", fs->fs_frag);
1506 fprintf(stderr, "setblock bad fs_frag %d\n", fs->fs_frag);
1513 * Determine the number of characters in a
1525 if (ioctl(0, TIOCGWINSZ, &ws) != -1)
1526 columns = ws.ws_col;
1527 if (columns == 0 && (cp = getenv("COLUMNS")))
1530 columns = 80; /* last resort */