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.6 2003/12/01 04:35:39 dillon Exp $
44 extern int atoi(char *);
45 extern char * getenv(char *);
49 extern long random(void);
50 extern void srandomdev(void);
54 * make file system for cylinder-group style file systems
58 * We limit the size of the inode map to be no more than a
59 * third of the cylinder group space, since we must leave at
60 * least an equal amount of space for the block map.
62 * N.B.: MAXIPG must be a multiple of INOPB(fs).
64 #define MAXIPG(fs) roundup((fs)->fs_bsize * NBBY / 3, INOPB(fs))
67 #define MAXINOPB (MAXBSIZE / sizeof(struct dinode))
68 #define POWEROF2(num) (((num) & ((num) - 1)) == 0)
71 * variables set up by front end.
73 extern int mfs; /* run as the memory based filesystem */
74 extern char *mfs_mtpt; /* mount point for mfs */
75 extern struct stat mfs_mtstat; /* stat prior to mount */
76 extern int Nflag; /* run mkfs without writing file system */
77 extern int Oflag; /* format as an 4.3BSD file system */
78 extern int Uflag; /* enable soft updates for file system */
79 extern int fssize; /* file system size */
80 extern int ntracks; /* # tracks/cylinder */
81 extern int nsectors; /* # sectors/track */
82 extern int nphyssectors; /* # sectors/track including spares */
83 extern int secpercyl; /* sectors per cylinder */
84 extern int sectorsize; /* bytes/sector */
85 extern int realsectorsize; /* bytes/sector in hardware*/
86 extern int rpm; /* revolutions/minute of drive */
87 extern int interleave; /* hardware sector interleave */
88 extern int trackskew; /* sector 0 skew, per track */
89 extern int fsize; /* fragment size */
90 extern int bsize; /* block size */
91 extern int cpg; /* cylinders/cylinder group */
92 extern int cpgflg; /* cylinders/cylinder group flag was given */
93 extern int minfree; /* free space threshold */
94 extern int opt; /* optimization preference (space or time) */
95 extern int density; /* number of bytes per inode */
96 extern int maxcontig; /* max contiguous blocks to allocate */
97 extern int rotdelay; /* rotational delay between blocks */
98 extern int maxbpg; /* maximum blocks per file in a cyl group */
99 extern int nrpos; /* # of distinguished rotational positions */
100 extern int bbsize; /* boot block size */
101 extern int sbsize; /* superblock size */
102 extern int avgfilesize; /* expected average file size */
103 extern int avgfilesperdir; /* expected number of files per directory */
104 extern u_long memleft; /* virtual memory available */
105 extern caddr_t membase; /* start address of memory based filesystem */
106 extern char * filename;
112 #define sblock fsun.fs
121 struct dinode zino[MAXBSIZE / sizeof(struct dinode)];
124 static fsnode_t copyroot;
125 static fsnode_t copyhlinks;
131 static int charsperline();
132 void clrblock(struct fs *, unsigned char *, int);
134 void initcg(int, time_t);
135 int isblock(struct fs *, unsigned char *, int);
136 void iput(struct dinode *, ino_t);
137 int makedir(struct direct *, int);
138 void rdfs(daddr_t, int, char *);
139 void setblock(struct fs *, unsigned char *, int);
140 void wtfs(daddr_t, int, char *);
141 void wtfsflush(void);
144 void get_memleft(void);
145 void raise_data_limit(void);
148 char * calloc(u_long, u_long);
149 caddr_t malloc(u_long);
150 caddr_t realloc(char *, u_long);
154 int parentready_signalled;
157 mkfs(struct partition *pp, char *fsys, int fi, int fo, const char *mfscopy)
159 register long i, mincpc, mincpg, inospercg;
160 long cylno, rpos, blk, j, warn = 0;
161 long used, mincpgcnt, bpcg;
163 long mapcramped, inodecramped;
164 long postblsize, rotblsize, totalsbsize;
171 char tmpbuf[100]; /* XXX this will break in about 2,500 years */
186 (void) signal(SIGUSR1, parentready);
191 copyroot = FSCopy(©hlinks, mfscopy);
192 (void) signal(SIGUSR1, started);
194 if (waitpid(i, &status, 0) != -1 && WIFEXITED(status))
195 exit(WEXITSTATUS(status));
199 omask = sigblock(1 << SIGUSR1);
200 while (parentready_signalled == 0)
201 sigpause(1 << SIGUSR1);
209 unsigned char buf[BUFSIZ];
211 fd = open(filename,O_RDWR|O_TRUNC|O_CREAT,0644);
213 err(12, "%s", filename);
214 for(l=0;l< fssize * sectorsize;l += l1) {
215 l1 = fssize * sectorsize;
218 if (l1 != write(fd,buf,l1))
219 err(12, "%s", filename);
224 PROT_READ|PROT_WRITE,
228 if(membase == MAP_FAILED)
235 if (fssize * sectorsize > (memleft - 131072))
236 fssize = (memleft - 131072) / sectorsize;
237 if ((membase = malloc(fssize * sectorsize)) == NULL)
238 errx(13, "malloc failed");
244 sblock.fs_inodefmt = FS_42INODEFMT;
245 sblock.fs_maxsymlinklen = 0;
247 sblock.fs_inodefmt = FS_44INODEFMT;
248 sblock.fs_maxsymlinklen = MAXSYMLINKLEN;
251 sblock.fs_flags |= FS_DOSOFTDEP;
253 * Validate the given file system size.
254 * Verify that its last block can actually be accessed.
257 printf("preposterous size %d\n", fssize), exit(13);
258 wtfs(fssize - (realsectorsize / DEV_BSIZE), realsectorsize,
261 * collect and verify the sector and track info
263 sblock.fs_nsect = nsectors;
264 sblock.fs_ntrak = ntracks;
265 if (sblock.fs_ntrak <= 0)
266 printf("preposterous ntrak %d\n", sblock.fs_ntrak), exit(14);
267 if (sblock.fs_nsect <= 0)
268 printf("preposterous nsect %d\n", sblock.fs_nsect), exit(15);
270 * collect and verify the filesystem density info
272 sblock.fs_avgfilesize = avgfilesize;
273 sblock.fs_avgfpdir = avgfilesperdir;
274 if (sblock.fs_avgfilesize <= 0)
275 printf("illegal expected average file size %d\n",
276 sblock.fs_avgfilesize), exit(14);
277 if (sblock.fs_avgfpdir <= 0)
278 printf("illegal expected number of files per directory %d\n",
279 sblock.fs_avgfpdir), exit(15);
281 * collect and verify the block and fragment sizes
283 sblock.fs_bsize = bsize;
284 sblock.fs_fsize = fsize;
285 if (!POWEROF2(sblock.fs_bsize)) {
286 printf("block size must be a power of 2, not %d\n",
290 if (!POWEROF2(sblock.fs_fsize)) {
291 printf("fragment size must be a power of 2, not %d\n",
295 if (sblock.fs_fsize < sectorsize) {
296 printf("fragment size %d is too small, minimum is %d\n",
297 sblock.fs_fsize, sectorsize);
300 if (sblock.fs_bsize < MINBSIZE) {
301 printf("block size %d is too small, minimum is %d\n",
302 sblock.fs_bsize, MINBSIZE);
305 if (sblock.fs_bsize < sblock.fs_fsize) {
306 printf("block size (%d) cannot be smaller than fragment size (%d)\n",
307 sblock.fs_bsize, sblock.fs_fsize);
310 sblock.fs_bmask = ~(sblock.fs_bsize - 1);
311 sblock.fs_fmask = ~(sblock.fs_fsize - 1);
312 sblock.fs_qbmask = ~sblock.fs_bmask;
313 sblock.fs_qfmask = ~sblock.fs_fmask;
314 for (sblock.fs_bshift = 0, i = sblock.fs_bsize; i > 1; i >>= 1)
316 for (sblock.fs_fshift = 0, i = sblock.fs_fsize; i > 1; i >>= 1)
318 sblock.fs_frag = numfrags(&sblock, sblock.fs_bsize);
319 for (sblock.fs_fragshift = 0, i = sblock.fs_frag; i > 1; i >>= 1)
320 sblock.fs_fragshift++;
321 if (sblock.fs_frag > MAXFRAG) {
322 printf("fragment size %d is too small, minimum with block size %d is %d\n",
323 sblock.fs_fsize, sblock.fs_bsize,
324 sblock.fs_bsize / MAXFRAG);
327 sblock.fs_nrpos = nrpos;
328 sblock.fs_nindir = sblock.fs_bsize / sizeof(daddr_t);
329 sblock.fs_inopb = sblock.fs_bsize / sizeof(struct dinode);
330 sblock.fs_nspf = sblock.fs_fsize / sectorsize;
331 for (sblock.fs_fsbtodb = 0, i = NSPF(&sblock); i > 1; i >>= 1)
334 roundup(howmany(bbsize + sbsize, sblock.fs_fsize), sblock.fs_frag);
335 sblock.fs_cblkno = (daddr_t)(sblock.fs_sblkno +
336 roundup(howmany(sbsize, sblock.fs_fsize), sblock.fs_frag));
337 sblock.fs_iblkno = sblock.fs_cblkno + sblock.fs_frag;
338 sblock.fs_cgoffset = roundup(
339 howmany(sblock.fs_nsect, NSPF(&sblock)), sblock.fs_frag);
340 for (sblock.fs_cgmask = 0xffffffff, i = sblock.fs_ntrak; i > 1; i >>= 1)
341 sblock.fs_cgmask <<= 1;
342 if (!POWEROF2(sblock.fs_ntrak))
343 sblock.fs_cgmask <<= 1;
344 sblock.fs_maxfilesize = sblock.fs_bsize * NDADDR - 1;
345 for (sizepb = sblock.fs_bsize, i = 0; i < NIADDR; i++) {
346 sizepb *= NINDIR(&sblock);
347 sblock.fs_maxfilesize += sizepb;
350 * Validate specified/determined secpercyl
351 * and calculate minimum cylinders per group.
353 sblock.fs_spc = secpercyl;
354 for (sblock.fs_cpc = NSPB(&sblock), i = sblock.fs_spc;
355 sblock.fs_cpc > 1 && (i & 1) == 0;
356 sblock.fs_cpc >>= 1, i >>= 1)
358 mincpc = sblock.fs_cpc;
359 bpcg = sblock.fs_spc * sectorsize;
360 inospercg = roundup(bpcg / sizeof(struct dinode), INOPB(&sblock));
361 if (inospercg > MAXIPG(&sblock))
362 inospercg = MAXIPG(&sblock);
363 used = (sblock.fs_iblkno + inospercg / INOPF(&sblock)) * NSPF(&sblock);
364 mincpgcnt = howmany(sblock.fs_cgoffset * (~sblock.fs_cgmask) + used,
366 mincpg = roundup(mincpgcnt, mincpc);
368 * Ensure that cylinder group with mincpg has enough space
371 sblock.fs_cpg = mincpg;
372 sblock.fs_ipg = inospercg;
374 sblock.fs_contigsumsize = MIN(maxcontig, FS_MAXCONTIG);
376 while (CGSIZE(&sblock) > sblock.fs_bsize) {
378 if (sblock.fs_bsize < MAXBSIZE) {
379 sblock.fs_bsize <<= 1;
385 mincpg = roundup(mincpgcnt, mincpc);
386 sblock.fs_cpg = mincpg;
388 sblock.fs_frag <<= 1;
389 sblock.fs_fragshift += 1;
390 if (sblock.fs_frag <= MAXFRAG)
393 if (sblock.fs_fsize == sblock.fs_bsize) {
394 printf("There is no block size that");
395 printf(" can support this disk\n");
398 sblock.fs_frag >>= 1;
399 sblock.fs_fragshift -= 1;
400 sblock.fs_fsize <<= 1;
401 sblock.fs_nspf <<= 1;
404 * Ensure that cylinder group with mincpg has enough space for inodes.
407 inospercg = calcipg(mincpg, bpcg, &usedb);
408 sblock.fs_ipg = inospercg;
409 while (inospercg > MAXIPG(&sblock)) {
411 if (mincpc == 1 || sblock.fs_frag == 1 ||
412 sblock.fs_bsize == MINBSIZE)
414 printf("With a block size of %d %s %d\n", sblock.fs_bsize,
415 "minimum bytes per inode is",
416 (int)((mincpg * (off_t)bpcg - usedb)
417 / MAXIPG(&sblock) + 1));
418 sblock.fs_bsize >>= 1;
419 sblock.fs_frag >>= 1;
420 sblock.fs_fragshift -= 1;
422 sblock.fs_cpg = roundup(mincpgcnt, mincpc);
423 if (CGSIZE(&sblock) > sblock.fs_bsize) {
424 sblock.fs_bsize <<= 1;
427 mincpg = sblock.fs_cpg;
428 inospercg = calcipg(mincpg, bpcg, &usedb);
429 sblock.fs_ipg = inospercg;
432 if (inospercg > MAXIPG(&sblock)) {
433 printf("Minimum bytes per inode is %d\n",
434 (int)((mincpg * (off_t)bpcg - usedb)
435 / MAXIPG(&sblock) + 1));
436 } else if (!mapcramped) {
437 printf("With %d bytes per inode, ", density);
438 printf("minimum cylinders per group is %ld\n", mincpg);
442 printf("With %d sectors per cylinder, ", sblock.fs_spc);
443 printf("minimum cylinders per group is %ld\n", mincpg);
445 if (inodecramped || mapcramped) {
446 if (sblock.fs_bsize != bsize)
447 printf("%s to be changed from %d to %d\n",
448 "This requires the block size",
449 bsize, sblock.fs_bsize);
450 if (sblock.fs_fsize != fsize)
451 printf("\t%s to be changed from %d to %d\n",
452 "and the fragment size",
453 fsize, sblock.fs_fsize);
457 * Calculate the number of cylinders per group
460 if (sblock.fs_cpg % mincpc != 0) {
461 printf("%s groups must have a multiple of %ld cylinders\n",
462 cpgflg ? "Cylinder" : "Warning: cylinder", mincpc);
463 sblock.fs_cpg = roundup(sblock.fs_cpg, mincpc);
468 * Must ensure there is enough space for inodes.
470 sblock.fs_ipg = calcipg(sblock.fs_cpg, bpcg, &usedb);
471 while (sblock.fs_ipg > MAXIPG(&sblock)) {
473 sblock.fs_cpg -= mincpc;
474 sblock.fs_ipg = calcipg(sblock.fs_cpg, bpcg, &usedb);
477 * Must ensure there is enough space to hold block map.
479 while (CGSIZE(&sblock) > sblock.fs_bsize) {
481 sblock.fs_cpg -= mincpc;
482 sblock.fs_ipg = calcipg(sblock.fs_cpg, bpcg, &usedb);
484 sblock.fs_fpg = (sblock.fs_cpg * sblock.fs_spc) / NSPF(&sblock);
485 if ((sblock.fs_cpg * sblock.fs_spc) % NSPB(&sblock) != 0) {
486 printf("panic (fs_cpg * fs_spc) %% NSPF != 0");
489 if (sblock.fs_cpg < mincpg) {
490 printf("cylinder groups must have at least %ld cylinders\n",
493 } else if (sblock.fs_cpg != cpg) {
496 else if (!mapcramped && !inodecramped)
498 if (mapcramped && inodecramped)
499 printf("Block size and bytes per inode restrict");
501 printf("Block size restricts");
503 printf("Bytes per inode restrict");
504 printf(" cylinders per group to %d.\n", sblock.fs_cpg);
508 sblock.fs_cgsize = fragroundup(&sblock, CGSIZE(&sblock));
510 * Now have size for file system and nsect and ntrak.
511 * Determine number of cylinders and blocks in the file system.
513 sblock.fs_size = fssize = dbtofsb(&sblock, fssize);
514 sblock.fs_ncyl = fssize * NSPF(&sblock) / sblock.fs_spc;
515 if (fssize * NSPF(&sblock) > sblock.fs_ncyl * sblock.fs_spc) {
519 if (sblock.fs_ncyl < 1) {
520 printf("file systems must have at least one cylinder\n");
524 * Determine feasability/values of rotational layout tables.
526 * The size of the rotational layout tables is limited by the
527 * size of the superblock, SBSIZE. The amount of space available
528 * for tables is calculated as (SBSIZE - sizeof (struct fs)).
529 * The size of these tables is inversely proportional to the block
530 * size of the file system. The size increases if sectors per track
531 * are not powers of two, because more cylinders must be described
532 * by the tables before the rotational pattern repeats (fs_cpc).
534 sblock.fs_interleave = interleave;
535 sblock.fs_trackskew = trackskew;
536 sblock.fs_npsect = nphyssectors;
537 sblock.fs_postblformat = FS_DYNAMICPOSTBLFMT;
538 sblock.fs_sbsize = fragroundup(&sblock, sizeof(struct fs));
539 if (sblock.fs_sbsize > SBSIZE)
540 sblock.fs_sbsize = SBSIZE;
541 if (sblock.fs_ntrak == 1) {
545 postblsize = sblock.fs_nrpos * sblock.fs_cpc * sizeof(int16_t);
546 rotblsize = sblock.fs_cpc * sblock.fs_spc / NSPB(&sblock);
547 totalsbsize = sizeof(struct fs) + rotblsize;
548 if (sblock.fs_nrpos == 8 && sblock.fs_cpc <= 16) {
549 /* use old static table space */
550 sblock.fs_postbloff = (char *)(&sblock.fs_opostbl[0][0]) -
551 (char *)(&sblock.fs_firstfield);
552 sblock.fs_rotbloff = &sblock.fs_space[0] -
553 (u_char *)(&sblock.fs_firstfield);
555 /* use dynamic table space */
556 sblock.fs_postbloff = &sblock.fs_space[0] -
557 (u_char *)(&sblock.fs_firstfield);
558 sblock.fs_rotbloff = sblock.fs_postbloff + postblsize;
559 totalsbsize += postblsize;
561 if (totalsbsize > SBSIZE ||
562 sblock.fs_nsect > (1 << NBBY) * NSPB(&sblock)) {
563 printf("%s %s %d %s %d.%s",
564 "Warning: insufficient space in super block for\n",
565 "rotational layout tables with nsect", sblock.fs_nsect,
566 "and ntrak", sblock.fs_ntrak,
567 "\nFile system performance may be impaired.\n");
571 sblock.fs_sbsize = fragroundup(&sblock, totalsbsize);
572 if (sblock.fs_sbsize > SBSIZE)
573 sblock.fs_sbsize = SBSIZE;
575 * calculate the available blocks for each rotational position
577 for (cylno = 0; cylno < sblock.fs_cpc; cylno++)
578 for (rpos = 0; rpos < sblock.fs_nrpos; rpos++)
579 fs_postbl(&sblock, cylno)[rpos] = -1;
580 for (i = (rotblsize - 1) * sblock.fs_frag;
581 i >= 0; i -= sblock.fs_frag) {
582 cylno = cbtocylno(&sblock, i);
583 rpos = cbtorpos(&sblock, i);
584 blk = fragstoblks(&sblock, i);
585 if (fs_postbl(&sblock, cylno)[rpos] == -1)
586 fs_rotbl(&sblock)[blk] = 0;
588 fs_rotbl(&sblock)[blk] =
589 fs_postbl(&sblock, cylno)[rpos] - blk;
590 fs_postbl(&sblock, cylno)[rpos] = blk;
594 * Compute/validate number of cylinder groups.
596 sblock.fs_ncg = sblock.fs_ncyl / sblock.fs_cpg;
597 if (sblock.fs_ncyl % sblock.fs_cpg)
599 sblock.fs_dblkno = sblock.fs_iblkno + sblock.fs_ipg / INOPF(&sblock);
600 i = MIN(~sblock.fs_cgmask, sblock.fs_ncg - 1);
601 if (cgdmin(&sblock, i) - cgbase(&sblock, i) >= sblock.fs_fpg) {
602 printf("inode blocks/cyl group (%ld) >= data blocks (%ld)\n",
603 cgdmin(&sblock, i) - cgbase(&sblock, i) / sblock.fs_frag,
604 (long)(sblock.fs_fpg / sblock.fs_frag));
605 printf("number of cylinders per cylinder group (%d) %s.\n",
606 sblock.fs_cpg, "must be increased");
609 j = sblock.fs_ncg - 1;
610 if ((i = fssize - j * sblock.fs_fpg) < sblock.fs_fpg &&
611 cgdmin(&sblock, j) - cgbase(&sblock, j) > i) {
613 printf("Filesystem must have at least %d sectors\n",
615 (cgdmin(&sblock, 0) + 3 * sblock.fs_frag));
619 "Warning: inode blocks/cyl group (%ld) >= data blocks (%ld) in last\n",
620 (cgdmin(&sblock, j) - cgbase(&sblock, j)) / sblock.fs_frag,
623 " cylinder group. This implies %ld sector(s) cannot be allocated.\n",
626 sblock.fs_ncyl -= sblock.fs_ncyl % sblock.fs_cpg;
627 sblock.fs_size = fssize = sblock.fs_ncyl * sblock.fs_spc /
632 printf("Warning: %d sector(s) in last cylinder unallocated\n",
634 (fssize * NSPF(&sblock) - (sblock.fs_ncyl - 1)
638 * fill in remaining fields of the super block
640 sblock.fs_csaddr = cgdmin(&sblock, 0);
642 fragroundup(&sblock, sblock.fs_ncg * sizeof(struct csum));
644 * The superblock fields 'fs_csmask' and 'fs_csshift' are no
645 * longer used. However, we still initialise them so that the
646 * filesystem remains compatible with old kernels.
648 i = sblock.fs_bsize / sizeof(struct csum);
649 sblock.fs_csmask = ~(i - 1);
650 for (sblock.fs_csshift = 0; i > 1; i >>= 1)
652 fscs = (struct csum *)calloc(1, sblock.fs_cssize);
654 errx(31, "calloc failed");
655 sblock.fs_magic = FS_MAGIC;
656 sblock.fs_rotdelay = rotdelay;
657 sblock.fs_minfree = minfree;
658 sblock.fs_maxcontig = maxcontig;
659 sblock.fs_maxbpg = maxbpg;
660 sblock.fs_rps = rpm / 60;
661 sblock.fs_optim = opt;
662 sblock.fs_cgrotor = 0;
663 sblock.fs_cstotal.cs_ndir = 0;
664 sblock.fs_cstotal.cs_nbfree = 0;
665 sblock.fs_cstotal.cs_nifree = 0;
666 sblock.fs_cstotal.cs_nffree = 0;
671 sblock.fs_id[0] = (long)utime;
672 sblock.fs_id[1] = random();
676 * Dump out summary information about file system.
679 printf("%s:\t%d sectors in %d %s of %d tracks, %d sectors\n",
680 fsys, sblock.fs_size * NSPF(&sblock), sblock.fs_ncyl,
681 "cylinders", sblock.fs_ntrak, sblock.fs_nsect);
682 #define B2MBFACTOR (1 / (1024.0 * 1024.0))
683 printf("\t%.1fMB in %d cyl groups (%d c/g, %.2fMB/g, %d i/g)%s\n",
684 (float)sblock.fs_size * sblock.fs_fsize * B2MBFACTOR,
685 sblock.fs_ncg, sblock.fs_cpg,
686 (float)sblock.fs_fpg * sblock.fs_fsize * B2MBFACTOR,
688 sblock.fs_flags & FS_DOSOFTDEP ? " SOFTUPDATES" : "");
692 * Now build the cylinders group blocks and
693 * then print out indices of cylinder groups.
696 printf("super-block backups (for fsck -b #) at:\n");
698 width = charsperline();
699 for (cylno = 0; cylno < sblock.fs_ncg; cylno++) {
700 initcg(cylno, utime);
703 j = snprintf(tmpbuf, sizeof(tmpbuf), " %ld%s",
704 fsbtodb(&sblock, cgsblock(&sblock, cylno)),
705 cylno < (sblock.fs_ncg-1) ? "," : "" );
706 if (i + j >= width) {
711 printf("%s", tmpbuf);
719 * Now construct the initial file system,
720 * then write out the super-block.
723 sblock.fs_time = utime;
724 wtfs((int)SBOFF / sectorsize, sbsize, (char *)&sblock);
725 for (i = 0; i < sblock.fs_cssize; i += sblock.fs_bsize)
726 wtfs(fsbtodb(&sblock, sblock.fs_csaddr + numfrags(&sblock, i)),
727 sblock.fs_cssize - i < sblock.fs_bsize ?
728 sblock.fs_cssize - i : sblock.fs_bsize,
731 * Write out the duplicate super blocks
733 for (cylno = 0; cylno < sblock.fs_ncg; cylno++)
734 wtfs(fsbtodb(&sblock, cgsblock(&sblock, cylno)),
735 sbsize, (char *)&sblock);
738 * Update information about this partion in pack
739 * label, to that it may be updated on disk.
741 pp->p_fstype = FS_BSDFFS;
742 pp->p_fsize = sblock.fs_fsize;
743 pp->p_frag = sblock.fs_frag;
744 pp->p_cpg = sblock.fs_cpg;
746 * Notify parent process of success.
747 * Dissociate from session and tty.
750 kill(mfs_ppid, SIGUSR1);
760 * Initialize a cylinder group.
763 initcg(int cylno, time_t utime)
765 daddr_t cbase, d, dlower, dupper, dmax, blkno;
767 register struct csum *cs;
773 * Determine block bounds for cylinder group.
774 * Allow space for super block summary information in first
777 cbase = cgbase(&sblock, cylno);
778 dmax = cbase + sblock.fs_fpg;
779 if (dmax > sblock.fs_size)
780 dmax = sblock.fs_size;
781 dlower = cgsblock(&sblock, cylno) - cbase;
782 dupper = cgdmin(&sblock, cylno) - cbase;
784 dupper += howmany(sblock.fs_cssize, sblock.fs_fsize);
786 memset(&acg, 0, sblock.fs_cgsize);
788 acg.cg_magic = CG_MAGIC;
790 if (cylno == sblock.fs_ncg - 1)
791 acg.cg_ncyl = sblock.fs_ncyl % sblock.fs_cpg;
793 acg.cg_ncyl = sblock.fs_cpg;
794 acg.cg_niblk = sblock.fs_ipg;
795 acg.cg_ndblk = dmax - cbase;
796 if (sblock.fs_contigsumsize > 0)
797 acg.cg_nclusterblks = acg.cg_ndblk / sblock.fs_frag;
798 acg.cg_btotoff = &acg.cg_space[0] - (u_char *)(&acg.cg_firstfield);
799 acg.cg_boff = acg.cg_btotoff + sblock.fs_cpg * sizeof(int32_t);
800 acg.cg_iusedoff = acg.cg_boff +
801 sblock.fs_cpg * sblock.fs_nrpos * sizeof(u_int16_t);
802 acg.cg_freeoff = acg.cg_iusedoff + howmany(sblock.fs_ipg, NBBY);
803 if (sblock.fs_contigsumsize <= 0) {
804 acg.cg_nextfreeoff = acg.cg_freeoff +
805 howmany(sblock.fs_cpg * sblock.fs_spc / NSPF(&sblock), NBBY);
807 acg.cg_clustersumoff = acg.cg_freeoff + howmany
808 (sblock.fs_cpg * sblock.fs_spc / NSPF(&sblock), NBBY) -
810 acg.cg_clustersumoff =
811 roundup(acg.cg_clustersumoff, sizeof(u_int32_t));
812 acg.cg_clusteroff = acg.cg_clustersumoff +
813 (sblock.fs_contigsumsize + 1) * sizeof(u_int32_t);
814 acg.cg_nextfreeoff = acg.cg_clusteroff + howmany
815 (sblock.fs_cpg * sblock.fs_spc / NSPB(&sblock), NBBY);
817 if (acg.cg_nextfreeoff - (long)(&acg.cg_firstfield) > sblock.fs_cgsize) {
818 printf("Panic: cylinder group too big\n");
821 acg.cg_cs.cs_nifree += sblock.fs_ipg;
823 for (i = 0; i < ROOTINO; i++) {
824 setbit(cg_inosused(&acg), i);
825 acg.cg_cs.cs_nifree--;
827 for (i = 0; i < sblock.fs_ipg / INOPF(&sblock); i += sblock.fs_frag) {
829 for (j = 0; j < sblock.fs_bsize / sizeof(struct dinode); j++)
830 zino[j].di_gen = random();
832 wtfs(fsbtodb(&sblock, cgimin(&sblock, cylno) + i),
833 sblock.fs_bsize, (char *)zino);
837 * In cylno 0, beginning space is reserved
838 * for boot and super blocks.
840 for (d = 0; d < dlower; d += sblock.fs_frag) {
841 blkno = d / sblock.fs_frag;
842 setblock(&sblock, cg_blksfree(&acg), blkno);
843 if (sblock.fs_contigsumsize > 0)
844 setbit(cg_clustersfree(&acg), blkno);
845 acg.cg_cs.cs_nbfree++;
846 cg_blktot(&acg)[cbtocylno(&sblock, d)]++;
847 cg_blks(&sblock, &acg, cbtocylno(&sblock, d))
848 [cbtorpos(&sblock, d)]++;
850 sblock.fs_dsize += dlower;
852 sblock.fs_dsize += acg.cg_ndblk - dupper;
853 if ((i = dupper % sblock.fs_frag)) {
854 acg.cg_frsum[sblock.fs_frag - i]++;
855 for (d = dupper + sblock.fs_frag - i; dupper < d; dupper++) {
856 setbit(cg_blksfree(&acg), dupper);
857 acg.cg_cs.cs_nffree++;
860 for (d = dupper; d + sblock.fs_frag <= dmax - cbase; ) {
861 blkno = d / sblock.fs_frag;
862 setblock(&sblock, cg_blksfree(&acg), blkno);
863 if (sblock.fs_contigsumsize > 0)
864 setbit(cg_clustersfree(&acg), blkno);
865 acg.cg_cs.cs_nbfree++;
866 cg_blktot(&acg)[cbtocylno(&sblock, d)]++;
867 cg_blks(&sblock, &acg, cbtocylno(&sblock, d))
868 [cbtorpos(&sblock, d)]++;
871 if (d < dmax - cbase) {
872 acg.cg_frsum[dmax - cbase - d]++;
873 for (; d < dmax - cbase; d++) {
874 setbit(cg_blksfree(&acg), d);
875 acg.cg_cs.cs_nffree++;
878 if (sblock.fs_contigsumsize > 0) {
879 int32_t *sump = cg_clustersum(&acg);
880 u_char *mapp = cg_clustersfree(&acg);
885 for (i = 0; i < acg.cg_nclusterblks; i++) {
886 if ((map & bit) != 0) {
888 } else if (run != 0) {
889 if (run > sblock.fs_contigsumsize)
890 run = sblock.fs_contigsumsize;
894 if ((i & (NBBY - 1)) != (NBBY - 1)) {
902 if (run > sblock.fs_contigsumsize)
903 run = sblock.fs_contigsumsize;
907 sblock.fs_cstotal.cs_ndir += acg.cg_cs.cs_ndir;
908 sblock.fs_cstotal.cs_nffree += acg.cg_cs.cs_nffree;
909 sblock.fs_cstotal.cs_nbfree += acg.cg_cs.cs_nbfree;
910 sblock.fs_cstotal.cs_nifree += acg.cg_cs.cs_nifree;
912 wtfs(fsbtodb(&sblock, cgtod(&sblock, cylno)),
913 sblock.fs_bsize, (char *)&acg);
917 * initialize the file system
927 struct direct root_dir[] = {
928 { ROOTINO, sizeof(struct direct), DT_DIR, 1, "." },
929 { ROOTINO, sizeof(struct direct), DT_DIR, 2, ".." },
931 { LOSTFOUNDINO, sizeof(struct direct), DT_DIR, 10, "lost+found" },
938 u_char d_name[MAXNAMLEN + 1];
940 { ROOTINO, sizeof(struct direct), 1, "." },
941 { ROOTINO, sizeof(struct direct), 2, ".." },
943 { LOSTFOUNDINO, sizeof(struct direct), 10, "lost+found" },
947 struct direct lost_found_dir[] = {
948 { LOSTFOUNDINO, sizeof(struct direct), DT_DIR, 1, "." },
949 { ROOTINO, sizeof(struct direct), DT_DIR, 2, ".." },
950 { 0, DIRBLKSIZ, 0, 0, 0 },
952 struct odirect olost_found_dir[] = {
953 { LOSTFOUNDINO, sizeof(struct direct), 1, "." },
954 { ROOTINO, sizeof(struct direct), 2, ".." },
955 { 0, DIRBLKSIZ, 0, 0 },
968 * initialize the node
970 node.di_atime = utime;
971 node.di_mtime = utime;
972 node.di_ctime = utime;
975 * create the lost+found directory
978 (void)makedir((struct direct *)olost_found_dir, 2);
979 for (i = DIRBLKSIZ; i < sblock.fs_bsize; i += DIRBLKSIZ)
980 memmove(&buf[i], &olost_found_dir[2],
981 DIRSIZ(0, &olost_found_dir[2]));
983 (void)makedir(lost_found_dir, 2);
984 for (i = DIRBLKSIZ; i < sblock.fs_bsize; i += DIRBLKSIZ)
985 memmove(&buf[i], &lost_found_dir[2],
986 DIRSIZ(0, &lost_found_dir[2]));
988 node.di_mode = IFDIR | UMASK;
990 node.di_size = sblock.fs_bsize;
991 node.di_db[0] = alloc(node.di_size, node.di_mode);
992 node.di_blocks = btodb(fragroundup(&sblock, node.di_size));
993 wtfs(fsbtodb(&sblock, node.di_db[0]), node.di_size, buf);
994 iput(&node, LOSTFOUNDINO);
997 * create the root directory
1000 node.di_mode = IFDIR | 01777;
1002 node.di_mode = IFDIR | UMASK;
1003 node.di_nlink = PREDEFDIR;
1005 node.di_size = makedir((struct direct *)oroot_dir, PREDEFDIR);
1007 node.di_size = makedir(root_dir, PREDEFDIR);
1008 node.di_db[0] = alloc(sblock.fs_fsize, node.di_mode);
1009 node.di_blocks = btodb(fragroundup(&sblock, node.di_size));
1010 wtfs(fsbtodb(&sblock, node.di_db[0]), sblock.fs_fsize, buf);
1011 iput(&node, ROOTINO);
1015 * construct a set of directory entries in "buf".
1016 * return size of directory.
1019 makedir(register struct direct *protodir, int entries)
1024 spcleft = DIRBLKSIZ;
1025 for (cp = buf, i = 0; i < entries - 1; i++) {
1026 protodir[i].d_reclen = DIRSIZ(0, &protodir[i]);
1027 memmove(cp, &protodir[i], protodir[i].d_reclen);
1028 cp += protodir[i].d_reclen;
1029 spcleft -= protodir[i].d_reclen;
1031 protodir[i].d_reclen = spcleft;
1032 memmove(cp, &protodir[i], DIRSIZ(0, &protodir[i]));
1037 * allocate a block or frag
1040 alloc(int size, int mode)
1045 rdfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize,
1047 if (acg.cg_magic != CG_MAGIC) {
1048 printf("cg 0: bad magic number\n");
1051 if (acg.cg_cs.cs_nbfree == 0) {
1052 printf("first cylinder group ran out of space\n");
1055 for (d = 0; d < acg.cg_ndblk; d += sblock.fs_frag)
1056 if (isblock(&sblock, cg_blksfree(&acg), d / sblock.fs_frag))
1058 printf("internal error: can't find block in cyl 0\n");
1061 blkno = fragstoblks(&sblock, d);
1062 clrblock(&sblock, cg_blksfree(&acg), blkno);
1063 if (sblock.fs_contigsumsize > 0)
1064 clrbit(cg_clustersfree(&acg), blkno);
1065 acg.cg_cs.cs_nbfree--;
1066 sblock.fs_cstotal.cs_nbfree--;
1067 fscs[0].cs_nbfree--;
1069 acg.cg_cs.cs_ndir++;
1070 sblock.fs_cstotal.cs_ndir++;
1073 cg_blktot(&acg)[cbtocylno(&sblock, d)]--;
1074 cg_blks(&sblock, &acg, cbtocylno(&sblock, d))[cbtorpos(&sblock, d)]--;
1075 if (size != sblock.fs_bsize) {
1076 frag = howmany(size, sblock.fs_fsize);
1077 fscs[0].cs_nffree += sblock.fs_frag - frag;
1078 sblock.fs_cstotal.cs_nffree += sblock.fs_frag - frag;
1079 acg.cg_cs.cs_nffree += sblock.fs_frag - frag;
1080 acg.cg_frsum[sblock.fs_frag - frag]++;
1081 for (i = frag; i < sblock.fs_frag; i++)
1082 setbit(cg_blksfree(&acg), d + i);
1084 wtfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize,
1090 * Calculate number of inodes per group.
1093 calcipg(long cpg, long bpcg, off_t *usedbp)
1096 long ipg, new_ipg, ncg, ncyl;
1100 * Prepare to scale by fssize / (number of sectors in cylinder groups).
1101 * Note that fssize is still in sectors, not filesystem blocks.
1103 ncyl = howmany(fssize, (u_int)secpercyl);
1104 ncg = howmany(ncyl, cpg);
1106 * Iterate a few times to allow for ipg depending on itself.
1109 for (i = 0; i < 10; i++) {
1110 usedb = (sblock.fs_iblkno + ipg / INOPF(&sblock))
1111 * NSPF(&sblock) * (off_t)sectorsize;
1112 new_ipg = (cpg * (quad_t)bpcg - usedb) / density * fssize
1113 / ncg / secpercyl / cpg;
1114 new_ipg = roundup(new_ipg, INOPB(&sblock));
1124 * Allocate an inode on the disk
1127 iput(register struct dinode *ip, register ino_t ino)
1129 struct dinode buf[MAXINOPB];
1134 ip->di_gen = random();
1136 c = ino_to_cg(&sblock, ino);
1137 rdfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize,
1139 if (acg.cg_magic != CG_MAGIC) {
1140 printf("cg 0: bad magic number\n");
1143 acg.cg_cs.cs_nifree--;
1144 setbit(cg_inosused(&acg), ino);
1145 wtfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize,
1147 sblock.fs_cstotal.cs_nifree--;
1148 fscs[0].cs_nifree--;
1149 if (ino >= sblock.fs_ipg * sblock.fs_ncg) {
1150 printf("fsinit: inode value out of range (%d).\n", ino);
1153 d = fsbtodb(&sblock, ino_to_fsba(&sblock, ino));
1154 rdfs(d, sblock.fs_bsize, (char *)buf);
1155 buf[ino_to_fsbo(&sblock, ino)] = *ip;
1156 wtfs(d, sblock.fs_bsize, (char *)buf);
1160 * Parent notifies child that it can proceed with the newfs and mount
1161 * operation (occurs after parent has copied the underlying filesystem
1162 * if the -C option was specified (for MFS), or immediately after the
1163 * parent forked the child otherwise).
1168 parentready_signalled = 1;
1172 * Notify parent process that the filesystem has created itself successfully.
1174 * We have to wait until the mount has actually completed!
1179 int retry = 100; /* 10 seconds, 100ms */
1181 while (mfs_ppid && retry) {
1185 stat(mfs_mtpt, &st) < 0 ||
1186 st.st_dev != mfs_mtstat.st_dev
1194 fatal("mfs mount failed waiting for mount to go active");
1195 } else if (copyroot) {
1196 FSPaste(mfs_mtpt, copyroot, copyhlinks);
1203 * Replace libc function with one suited to our needs.
1206 malloc(register u_long size)
1214 pgsz = getpagesize() - 1;
1215 i = (char *)((u_long)(base + pgsz) &~ pgsz);
1216 base = sbrk(i - base);
1217 if (getrlimit(RLIMIT_DATA, &rlp) < 0)
1219 rlp.rlim_cur = rlp.rlim_max;
1220 if (setrlimit(RLIMIT_DATA, &rlp) < 0)
1222 memleft = rlp.rlim_max - (u_long)base;
1224 size = (size + pgsz) &~ pgsz;
1230 return ((caddr_t)sbrk(size));
1234 * Replace libc function with one suited to our needs.
1237 realloc(char *ptr, u_long size)
1241 if ((p = malloc(size)) == NULL)
1243 memmove(p, ptr, size);
1249 * Replace libc function with one suited to our needs.
1252 calloc(u_long size, u_long numelm)
1257 if ((base = malloc(size)) == NULL)
1259 memset(base, 0, size);
1264 * Replace libc function with one suited to our needs.
1270 /* do not worry about it for now */
1273 #else /* !STANDALONE */
1276 raise_data_limit(void)
1280 if (getrlimit(RLIMIT_DATA, &rlp) < 0)
1282 rlp.rlim_cur = rlp.rlim_max;
1283 if (setrlimit(RLIMIT_DATA, &rlp) < 0)
1288 extern char *_etext;
1289 #define etext _etext
1303 pgsz = getpagesize() - 1;
1304 dstart = ((u_long)&etext) &~ pgsz;
1305 freestart = ((u_long)(sbrk(0) + pgsz) &~ pgsz);
1306 if (getrlimit(RLIMIT_DATA, &rlp) < 0)
1308 memused = freestart - dstart;
1309 memleft = rlp.rlim_cur - memused;
1311 #endif /* STANDALONE */
1314 * read a block from the file system
1317 rdfs(daddr_t bno, int size, char *bf)
1323 memmove(bf, membase + bno * sectorsize, size);
1326 if (lseek(fsi, (off_t)bno * sectorsize, 0) < 0) {
1327 printf("seek error: %ld\n", (long)bno);
1330 n = read(fsi, bf, size);
1332 printf("read error: %ld\n", (long)bno);
1337 #define WCSIZE (128 * 1024)
1338 daddr_t wc_sect; /* units of sectorsize */
1339 int wc_end; /* bytes */
1340 static char wc[WCSIZE]; /* bytes */
1343 * Flush dirty write behind buffer.
1350 if (lseek(fso, (off_t)wc_sect * sectorsize, SEEK_SET) < 0) {
1351 printf("seek error: %ld\n", (long)wc_sect);
1352 err(35, "wtfs - writecombine");
1354 n = write(fso, wc, wc_end);
1356 printf("write error: %ld\n", (long)wc_sect);
1357 err(36, "wtfs - writecombine");
1364 * write a block to the file system
1367 wtfs(daddr_t bno, int size, char *bf)
1373 memmove(membase + bno * sectorsize, bf, size);
1379 if (wc_end == 0 && size <= WCSIZE) {
1381 bcopy(bf, wc, size);
1383 if (wc_end < WCSIZE)
1387 if ((off_t)wc_sect * sectorsize + wc_end == (off_t)bno * sectorsize &&
1388 wc_end + size <= WCSIZE) {
1389 bcopy(bf, wc + wc_end, size);
1391 if (wc_end < WCSIZE)
1398 if (lseek(fso, (off_t)bno * sectorsize, SEEK_SET) < 0) {
1399 printf("seek error: %ld\n", (long)bno);
1402 n = write(fso, bf, size);
1404 printf("write error: %ld\n", (long)bno);
1410 * check if a block is available
1413 isblock(struct fs *fs, unsigned char *cp, int h)
1417 switch (fs->fs_frag) {
1419 return (cp[h] == 0xff);
1421 mask = 0x0f << ((h & 0x1) << 2);
1422 return ((cp[h >> 1] & mask) == mask);
1424 mask = 0x03 << ((h & 0x3) << 1);
1425 return ((cp[h >> 2] & mask) == mask);
1427 mask = 0x01 << (h & 0x7);
1428 return ((cp[h >> 3] & mask) == mask);
1431 printf("isblock bad fs_frag %d\n", fs->fs_frag);
1433 fprintf(stderr, "isblock bad fs_frag %d\n", fs->fs_frag);
1440 * take a block out of the map
1443 clrblock(struct fs *fs, unsigned char *cp, int h)
1445 switch ((fs)->fs_frag) {
1450 cp[h >> 1] &= ~(0x0f << ((h & 0x1) << 2));
1453 cp[h >> 2] &= ~(0x03 << ((h & 0x3) << 1));
1456 cp[h >> 3] &= ~(0x01 << (h & 0x7));
1460 printf("clrblock bad fs_frag %d\n", fs->fs_frag);
1462 fprintf(stderr, "clrblock bad fs_frag %d\n", fs->fs_frag);
1469 * put a block into the map
1472 setblock(struct fs *fs, unsigned char *cp, int h)
1474 switch (fs->fs_frag) {
1479 cp[h >> 1] |= (0x0f << ((h & 0x1) << 2));
1482 cp[h >> 2] |= (0x03 << ((h & 0x3) << 1));
1485 cp[h >> 3] |= (0x01 << (h & 0x7));
1489 printf("setblock bad fs_frag %d\n", fs->fs_frag);
1491 fprintf(stderr, "setblock bad fs_frag %d\n", fs->fs_frag);
1498 * Determine the number of characters in a
1510 if (ioctl(0, TIOCGWINSZ, &ws) != -1)
1511 columns = ws.ws_col;
1512 if (columns == 0 && (cp = getenv("COLUMNS")))
1515 columns = 80; /* last resort */