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.4 2003/09/28 14:39:20 hmp Exp $
43 #include <sys/param.h>
45 #include <sys/types.h>
47 #include <sys/resource.h>
49 #include <vfs/ufs/dinode.h>
50 #include <vfs/ufs/dir.h>
51 #include <vfs/ufs/fs.h>
52 #include <sys/disklabel.h>
55 #include <sys/ioctl.h>
60 extern int atoi __P((char *));
61 extern char * getenv __P((char *));
65 extern long random __P((void));
66 extern void srandomdev __P((void));
70 * make file system for cylinder-group style file systems
74 * We limit the size of the inode map to be no more than a
75 * third of the cylinder group space, since we must leave at
76 * least an equal amount of space for the block map.
78 * N.B.: MAXIPG must be a multiple of INOPB(fs).
80 #define MAXIPG(fs) roundup((fs)->fs_bsize * NBBY / 3, INOPB(fs))
83 #define MAXINOPB (MAXBSIZE / sizeof(struct dinode))
84 #define POWEROF2(num) (((num) & ((num) - 1)) == 0)
87 * variables set up by front end.
89 extern int mfs; /* run as the memory based filesystem */
90 extern char *mfs_mtpt; /* mount point for mfs */
91 extern struct stat mfs_mtstat; /* stat prior to mount */
92 extern int Nflag; /* run mkfs without writing file system */
93 extern int Oflag; /* format as an 4.3BSD file system */
94 extern int Uflag; /* enable soft updates for file system */
95 extern int fssize; /* file system size */
96 extern int ntracks; /* # tracks/cylinder */
97 extern int nsectors; /* # sectors/track */
98 extern int nphyssectors; /* # sectors/track including spares */
99 extern int secpercyl; /* sectors per cylinder */
100 extern int sectorsize; /* bytes/sector */
101 extern int realsectorsize; /* bytes/sector in hardware*/
102 extern int rpm; /* revolutions/minute of drive */
103 extern int interleave; /* hardware sector interleave */
104 extern int trackskew; /* sector 0 skew, per track */
105 extern int fsize; /* fragment size */
106 extern int bsize; /* block size */
107 extern int cpg; /* cylinders/cylinder group */
108 extern int cpgflg; /* cylinders/cylinder group flag was given */
109 extern int minfree; /* free space threshold */
110 extern int opt; /* optimization preference (space or time) */
111 extern int density; /* number of bytes per inode */
112 extern int maxcontig; /* max contiguous blocks to allocate */
113 extern int rotdelay; /* rotational delay between blocks */
114 extern int maxbpg; /* maximum blocks per file in a cyl group */
115 extern int nrpos; /* # of distinguished rotational positions */
116 extern int bbsize; /* boot block size */
117 extern int sbsize; /* superblock size */
118 extern int avgfilesize; /* expected average file size */
119 extern int avgfilesperdir; /* expected number of files per directory */
120 extern u_long memleft; /* virtual memory available */
121 extern caddr_t membase; /* start address of memory based filesystem */
122 extern char * filename;
128 #define sblock fsun.fs
137 struct dinode zino[MAXBSIZE / sizeof(struct dinode)];
145 static int charsperline();
146 void clrblock __P((struct fs *, unsigned char *, int));
147 void fsinit __P((time_t));
148 void initcg __P((int, time_t));
149 int isblock __P((struct fs *, unsigned char *, int));
150 void iput __P((struct dinode *, ino_t));
151 int makedir __P((struct direct *, int));
152 void rdfs __P((daddr_t, int, char *));
153 void setblock __P((struct fs *, unsigned char *, int));
154 void wtfs __P((daddr_t, int, char *));
155 void wtfsflush __P((void));
158 void get_memleft __P((void));
159 void raise_data_limit __P((void));
161 void free __P((char *));
162 char * calloc __P((u_long, u_long));
163 caddr_t malloc __P((u_long));
164 caddr_t realloc __P((char *, u_long));
170 mkfs(struct partition *pp, char *fsys, int fi, int fo)
172 register long i, mincpc, mincpg, inospercg;
173 long cylno, rpos, blk, j, warn = 0;
174 long used, mincpgcnt, bpcg;
176 long mapcramped, inodecramped;
177 long postblsize, rotblsize, totalsbsize;
183 char tmpbuf[100]; /* XXX this will break in about 2,500 years */
196 (void) signal(SIGUSR1, started);
200 if (waitpid(i, &status, 0) != -1 && WIFEXITED(status))
201 exit(WEXITSTATUS(status));
211 unsigned char buf[BUFSIZ];
213 fd = open(filename,O_RDWR|O_TRUNC|O_CREAT,0644);
215 err(12, "%s", filename);
216 for(l=0;l< fssize * sectorsize;l += l1) {
217 l1 = fssize * sectorsize;
220 if (l1 != write(fd,buf,l1))
221 err(12, "%s", filename);
226 PROT_READ|PROT_WRITE,
230 if(membase == MAP_FAILED)
237 if (fssize * sectorsize > (memleft - 131072))
238 fssize = (memleft - 131072) / sectorsize;
239 if ((membase = malloc(fssize * sectorsize)) == NULL)
240 errx(13, "malloc failed");
246 sblock.fs_inodefmt = FS_42INODEFMT;
247 sblock.fs_maxsymlinklen = 0;
249 sblock.fs_inodefmt = FS_44INODEFMT;
250 sblock.fs_maxsymlinklen = MAXSYMLINKLEN;
253 sblock.fs_flags |= FS_DOSOFTDEP;
255 * Validate the given file system size.
256 * Verify that its last block can actually be accessed.
259 printf("preposterous size %d\n", fssize), exit(13);
260 wtfs(fssize - (realsectorsize / DEV_BSIZE), realsectorsize,
263 * collect and verify the sector and track info
265 sblock.fs_nsect = nsectors;
266 sblock.fs_ntrak = ntracks;
267 if (sblock.fs_ntrak <= 0)
268 printf("preposterous ntrak %d\n", sblock.fs_ntrak), exit(14);
269 if (sblock.fs_nsect <= 0)
270 printf("preposterous nsect %d\n", sblock.fs_nsect), exit(15);
272 * collect and verify the filesystem density info
274 sblock.fs_avgfilesize = avgfilesize;
275 sblock.fs_avgfpdir = avgfilesperdir;
276 if (sblock.fs_avgfilesize <= 0)
277 printf("illegal expected average file size %d\n",
278 sblock.fs_avgfilesize), exit(14);
279 if (sblock.fs_avgfpdir <= 0)
280 printf("illegal expected number of files per directory %d\n",
281 sblock.fs_avgfpdir), exit(15);
283 * collect and verify the block and fragment sizes
285 sblock.fs_bsize = bsize;
286 sblock.fs_fsize = fsize;
287 if (!POWEROF2(sblock.fs_bsize)) {
288 printf("block size must be a power of 2, not %d\n",
292 if (!POWEROF2(sblock.fs_fsize)) {
293 printf("fragment size must be a power of 2, not %d\n",
297 if (sblock.fs_fsize < sectorsize) {
298 printf("fragment size %d is too small, minimum is %d\n",
299 sblock.fs_fsize, sectorsize);
302 if (sblock.fs_bsize < MINBSIZE) {
303 printf("block size %d is too small, minimum is %d\n",
304 sblock.fs_bsize, MINBSIZE);
307 if (sblock.fs_bsize < sblock.fs_fsize) {
308 printf("block size (%d) cannot be smaller than fragment size (%d)\n",
309 sblock.fs_bsize, sblock.fs_fsize);
312 sblock.fs_bmask = ~(sblock.fs_bsize - 1);
313 sblock.fs_fmask = ~(sblock.fs_fsize - 1);
314 sblock.fs_qbmask = ~sblock.fs_bmask;
315 sblock.fs_qfmask = ~sblock.fs_fmask;
316 for (sblock.fs_bshift = 0, i = sblock.fs_bsize; i > 1; i >>= 1)
318 for (sblock.fs_fshift = 0, i = sblock.fs_fsize; i > 1; i >>= 1)
320 sblock.fs_frag = numfrags(&sblock, sblock.fs_bsize);
321 for (sblock.fs_fragshift = 0, i = sblock.fs_frag; i > 1; i >>= 1)
322 sblock.fs_fragshift++;
323 if (sblock.fs_frag > MAXFRAG) {
324 printf("fragment size %d is too small, minimum with block size %d is %d\n",
325 sblock.fs_fsize, sblock.fs_bsize,
326 sblock.fs_bsize / MAXFRAG);
329 sblock.fs_nrpos = nrpos;
330 sblock.fs_nindir = sblock.fs_bsize / sizeof(daddr_t);
331 sblock.fs_inopb = sblock.fs_bsize / sizeof(struct dinode);
332 sblock.fs_nspf = sblock.fs_fsize / sectorsize;
333 for (sblock.fs_fsbtodb = 0, i = NSPF(&sblock); i > 1; i >>= 1)
336 roundup(howmany(bbsize + sbsize, sblock.fs_fsize), sblock.fs_frag);
337 sblock.fs_cblkno = (daddr_t)(sblock.fs_sblkno +
338 roundup(howmany(sbsize, sblock.fs_fsize), sblock.fs_frag));
339 sblock.fs_iblkno = sblock.fs_cblkno + sblock.fs_frag;
340 sblock.fs_cgoffset = roundup(
341 howmany(sblock.fs_nsect, NSPF(&sblock)), sblock.fs_frag);
342 for (sblock.fs_cgmask = 0xffffffff, i = sblock.fs_ntrak; i > 1; i >>= 1)
343 sblock.fs_cgmask <<= 1;
344 if (!POWEROF2(sblock.fs_ntrak))
345 sblock.fs_cgmask <<= 1;
346 sblock.fs_maxfilesize = sblock.fs_bsize * NDADDR - 1;
347 for (sizepb = sblock.fs_bsize, i = 0; i < NIADDR; i++) {
348 sizepb *= NINDIR(&sblock);
349 sblock.fs_maxfilesize += sizepb;
352 * Validate specified/determined secpercyl
353 * and calculate minimum cylinders per group.
355 sblock.fs_spc = secpercyl;
356 for (sblock.fs_cpc = NSPB(&sblock), i = sblock.fs_spc;
357 sblock.fs_cpc > 1 && (i & 1) == 0;
358 sblock.fs_cpc >>= 1, i >>= 1)
360 mincpc = sblock.fs_cpc;
361 bpcg = sblock.fs_spc * sectorsize;
362 inospercg = roundup(bpcg / sizeof(struct dinode), INOPB(&sblock));
363 if (inospercg > MAXIPG(&sblock))
364 inospercg = MAXIPG(&sblock);
365 used = (sblock.fs_iblkno + inospercg / INOPF(&sblock)) * NSPF(&sblock);
366 mincpgcnt = howmany(sblock.fs_cgoffset * (~sblock.fs_cgmask) + used,
368 mincpg = roundup(mincpgcnt, mincpc);
370 * Ensure that cylinder group with mincpg has enough space
373 sblock.fs_cpg = mincpg;
374 sblock.fs_ipg = inospercg;
376 sblock.fs_contigsumsize = MIN(maxcontig, FS_MAXCONTIG);
378 while (CGSIZE(&sblock) > sblock.fs_bsize) {
380 if (sblock.fs_bsize < MAXBSIZE) {
381 sblock.fs_bsize <<= 1;
387 mincpg = roundup(mincpgcnt, mincpc);
388 sblock.fs_cpg = mincpg;
390 sblock.fs_frag <<= 1;
391 sblock.fs_fragshift += 1;
392 if (sblock.fs_frag <= MAXFRAG)
395 if (sblock.fs_fsize == sblock.fs_bsize) {
396 printf("There is no block size that");
397 printf(" can support this disk\n");
400 sblock.fs_frag >>= 1;
401 sblock.fs_fragshift -= 1;
402 sblock.fs_fsize <<= 1;
403 sblock.fs_nspf <<= 1;
406 * Ensure that cylinder group with mincpg has enough space for inodes.
409 inospercg = calcipg(mincpg, bpcg, &usedb);
410 sblock.fs_ipg = inospercg;
411 while (inospercg > MAXIPG(&sblock)) {
413 if (mincpc == 1 || sblock.fs_frag == 1 ||
414 sblock.fs_bsize == MINBSIZE)
416 printf("With a block size of %d %s %d\n", sblock.fs_bsize,
417 "minimum bytes per inode is",
418 (int)((mincpg * (off_t)bpcg - usedb)
419 / MAXIPG(&sblock) + 1));
420 sblock.fs_bsize >>= 1;
421 sblock.fs_frag >>= 1;
422 sblock.fs_fragshift -= 1;
424 sblock.fs_cpg = roundup(mincpgcnt, mincpc);
425 if (CGSIZE(&sblock) > sblock.fs_bsize) {
426 sblock.fs_bsize <<= 1;
429 mincpg = sblock.fs_cpg;
430 inospercg = calcipg(mincpg, bpcg, &usedb);
431 sblock.fs_ipg = inospercg;
434 if (inospercg > MAXIPG(&sblock)) {
435 printf("Minimum bytes per inode is %d\n",
436 (int)((mincpg * (off_t)bpcg - usedb)
437 / MAXIPG(&sblock) + 1));
438 } else if (!mapcramped) {
439 printf("With %d bytes per inode, ", density);
440 printf("minimum cylinders per group is %ld\n", mincpg);
444 printf("With %d sectors per cylinder, ", sblock.fs_spc);
445 printf("minimum cylinders per group is %ld\n", mincpg);
447 if (inodecramped || mapcramped) {
448 if (sblock.fs_bsize != bsize)
449 printf("%s to be changed from %d to %d\n",
450 "This requires the block size",
451 bsize, sblock.fs_bsize);
452 if (sblock.fs_fsize != fsize)
453 printf("\t%s to be changed from %d to %d\n",
454 "and the fragment size",
455 fsize, sblock.fs_fsize);
459 * Calculate the number of cylinders per group
462 if (sblock.fs_cpg % mincpc != 0) {
463 printf("%s groups must have a multiple of %ld cylinders\n",
464 cpgflg ? "Cylinder" : "Warning: cylinder", mincpc);
465 sblock.fs_cpg = roundup(sblock.fs_cpg, mincpc);
470 * Must ensure there is enough space for inodes.
472 sblock.fs_ipg = calcipg(sblock.fs_cpg, bpcg, &usedb);
473 while (sblock.fs_ipg > MAXIPG(&sblock)) {
475 sblock.fs_cpg -= mincpc;
476 sblock.fs_ipg = calcipg(sblock.fs_cpg, bpcg, &usedb);
479 * Must ensure there is enough space to hold block map.
481 while (CGSIZE(&sblock) > sblock.fs_bsize) {
483 sblock.fs_cpg -= mincpc;
484 sblock.fs_ipg = calcipg(sblock.fs_cpg, bpcg, &usedb);
486 sblock.fs_fpg = (sblock.fs_cpg * sblock.fs_spc) / NSPF(&sblock);
487 if ((sblock.fs_cpg * sblock.fs_spc) % NSPB(&sblock) != 0) {
488 printf("panic (fs_cpg * fs_spc) %% NSPF != 0");
491 if (sblock.fs_cpg < mincpg) {
492 printf("cylinder groups must have at least %ld cylinders\n",
495 } else if (sblock.fs_cpg != cpg) {
498 else if (!mapcramped && !inodecramped)
500 if (mapcramped && inodecramped)
501 printf("Block size and bytes per inode restrict");
503 printf("Block size restricts");
505 printf("Bytes per inode restrict");
506 printf(" cylinders per group to %d.\n", sblock.fs_cpg);
510 sblock.fs_cgsize = fragroundup(&sblock, CGSIZE(&sblock));
512 * Now have size for file system and nsect and ntrak.
513 * Determine number of cylinders and blocks in the file system.
515 sblock.fs_size = fssize = dbtofsb(&sblock, fssize);
516 sblock.fs_ncyl = fssize * NSPF(&sblock) / sblock.fs_spc;
517 if (fssize * NSPF(&sblock) > sblock.fs_ncyl * sblock.fs_spc) {
521 if (sblock.fs_ncyl < 1) {
522 printf("file systems must have at least one cylinder\n");
526 * Determine feasability/values of rotational layout tables.
528 * The size of the rotational layout tables is limited by the
529 * size of the superblock, SBSIZE. The amount of space available
530 * for tables is calculated as (SBSIZE - sizeof (struct fs)).
531 * The size of these tables is inversely proportional to the block
532 * size of the file system. The size increases if sectors per track
533 * are not powers of two, because more cylinders must be described
534 * by the tables before the rotational pattern repeats (fs_cpc).
536 sblock.fs_interleave = interleave;
537 sblock.fs_trackskew = trackskew;
538 sblock.fs_npsect = nphyssectors;
539 sblock.fs_postblformat = FS_DYNAMICPOSTBLFMT;
540 sblock.fs_sbsize = fragroundup(&sblock, sizeof(struct fs));
541 if (sblock.fs_sbsize > SBSIZE)
542 sblock.fs_sbsize = SBSIZE;
543 if (sblock.fs_ntrak == 1) {
547 postblsize = sblock.fs_nrpos * sblock.fs_cpc * sizeof(int16_t);
548 rotblsize = sblock.fs_cpc * sblock.fs_spc / NSPB(&sblock);
549 totalsbsize = sizeof(struct fs) + rotblsize;
550 if (sblock.fs_nrpos == 8 && sblock.fs_cpc <= 16) {
551 /* use old static table space */
552 sblock.fs_postbloff = (char *)(&sblock.fs_opostbl[0][0]) -
553 (char *)(&sblock.fs_firstfield);
554 sblock.fs_rotbloff = &sblock.fs_space[0] -
555 (u_char *)(&sblock.fs_firstfield);
557 /* use dynamic table space */
558 sblock.fs_postbloff = &sblock.fs_space[0] -
559 (u_char *)(&sblock.fs_firstfield);
560 sblock.fs_rotbloff = sblock.fs_postbloff + postblsize;
561 totalsbsize += postblsize;
563 if (totalsbsize > SBSIZE ||
564 sblock.fs_nsect > (1 << NBBY) * NSPB(&sblock)) {
565 printf("%s %s %d %s %d.%s",
566 "Warning: insufficient space in super block for\n",
567 "rotational layout tables with nsect", sblock.fs_nsect,
568 "and ntrak", sblock.fs_ntrak,
569 "\nFile system performance may be impaired.\n");
573 sblock.fs_sbsize = fragroundup(&sblock, totalsbsize);
574 if (sblock.fs_sbsize > SBSIZE)
575 sblock.fs_sbsize = SBSIZE;
577 * calculate the available blocks for each rotational position
579 for (cylno = 0; cylno < sblock.fs_cpc; cylno++)
580 for (rpos = 0; rpos < sblock.fs_nrpos; rpos++)
581 fs_postbl(&sblock, cylno)[rpos] = -1;
582 for (i = (rotblsize - 1) * sblock.fs_frag;
583 i >= 0; i -= sblock.fs_frag) {
584 cylno = cbtocylno(&sblock, i);
585 rpos = cbtorpos(&sblock, i);
586 blk = fragstoblks(&sblock, i);
587 if (fs_postbl(&sblock, cylno)[rpos] == -1)
588 fs_rotbl(&sblock)[blk] = 0;
590 fs_rotbl(&sblock)[blk] =
591 fs_postbl(&sblock, cylno)[rpos] - blk;
592 fs_postbl(&sblock, cylno)[rpos] = blk;
596 * Compute/validate number of cylinder groups.
598 sblock.fs_ncg = sblock.fs_ncyl / sblock.fs_cpg;
599 if (sblock.fs_ncyl % sblock.fs_cpg)
601 sblock.fs_dblkno = sblock.fs_iblkno + sblock.fs_ipg / INOPF(&sblock);
602 i = MIN(~sblock.fs_cgmask, sblock.fs_ncg - 1);
603 if (cgdmin(&sblock, i) - cgbase(&sblock, i) >= sblock.fs_fpg) {
604 printf("inode blocks/cyl group (%ld) >= data blocks (%ld)\n",
605 cgdmin(&sblock, i) - cgbase(&sblock, i) / sblock.fs_frag,
606 (long)(sblock.fs_fpg / sblock.fs_frag));
607 printf("number of cylinders per cylinder group (%d) %s.\n",
608 sblock.fs_cpg, "must be increased");
611 j = sblock.fs_ncg - 1;
612 if ((i = fssize - j * sblock.fs_fpg) < sblock.fs_fpg &&
613 cgdmin(&sblock, j) - cgbase(&sblock, j) > i) {
615 printf("Filesystem must have at least %d sectors\n",
617 (cgdmin(&sblock, 0) + 3 * sblock.fs_frag));
621 "Warning: inode blocks/cyl group (%ld) >= data blocks (%ld) in last\n",
622 (cgdmin(&sblock, j) - cgbase(&sblock, j)) / sblock.fs_frag,
625 " cylinder group. This implies %ld sector(s) cannot be allocated.\n",
628 sblock.fs_ncyl -= sblock.fs_ncyl % sblock.fs_cpg;
629 sblock.fs_size = fssize = sblock.fs_ncyl * sblock.fs_spc /
634 printf("Warning: %d sector(s) in last cylinder unallocated\n",
636 (fssize * NSPF(&sblock) - (sblock.fs_ncyl - 1)
640 * fill in remaining fields of the super block
642 sblock.fs_csaddr = cgdmin(&sblock, 0);
644 fragroundup(&sblock, sblock.fs_ncg * sizeof(struct csum));
646 * The superblock fields 'fs_csmask' and 'fs_csshift' are no
647 * longer used. However, we still initialise them so that the
648 * filesystem remains compatible with old kernels.
650 i = sblock.fs_bsize / sizeof(struct csum);
651 sblock.fs_csmask = ~(i - 1);
652 for (sblock.fs_csshift = 0; i > 1; i >>= 1)
654 fscs = (struct csum *)calloc(1, sblock.fs_cssize);
656 errx(31, "calloc failed");
657 sblock.fs_magic = FS_MAGIC;
658 sblock.fs_rotdelay = rotdelay;
659 sblock.fs_minfree = minfree;
660 sblock.fs_maxcontig = maxcontig;
661 sblock.fs_maxbpg = maxbpg;
662 sblock.fs_rps = rpm / 60;
663 sblock.fs_optim = opt;
664 sblock.fs_cgrotor = 0;
665 sblock.fs_cstotal.cs_ndir = 0;
666 sblock.fs_cstotal.cs_nbfree = 0;
667 sblock.fs_cstotal.cs_nifree = 0;
668 sblock.fs_cstotal.cs_nffree = 0;
673 sblock.fs_id[0] = (long)utime;
674 sblock.fs_id[1] = random();
678 * Dump out summary information about file system.
681 printf("%s:\t%d sectors in %d %s of %d tracks, %d sectors\n",
682 fsys, sblock.fs_size * NSPF(&sblock), sblock.fs_ncyl,
683 "cylinders", sblock.fs_ntrak, sblock.fs_nsect);
684 #define B2MBFACTOR (1 / (1024.0 * 1024.0))
685 printf("\t%.1fMB in %d cyl groups (%d c/g, %.2fMB/g, %d i/g)%s\n",
686 (float)sblock.fs_size * sblock.fs_fsize * B2MBFACTOR,
687 sblock.fs_ncg, sblock.fs_cpg,
688 (float)sblock.fs_fpg * sblock.fs_fsize * B2MBFACTOR,
690 sblock.fs_flags & FS_DOSOFTDEP ? " SOFTUPDATES" : "");
694 * Now build the cylinders group blocks and
695 * then print out indices of cylinder groups.
698 printf("super-block backups (for fsck -b #) at:\n");
700 width = charsperline();
701 for (cylno = 0; cylno < sblock.fs_ncg; cylno++) {
702 initcg(cylno, utime);
705 j = snprintf(tmpbuf, sizeof(tmpbuf), " %ld%s",
706 fsbtodb(&sblock, cgsblock(&sblock, cylno)),
707 cylno < (sblock.fs_ncg-1) ? "," : "" );
708 if (i + j >= width) {
713 printf("%s", tmpbuf);
721 * Now construct the initial file system,
722 * then write out the super-block.
725 sblock.fs_time = utime;
726 wtfs((int)SBOFF / sectorsize, sbsize, (char *)&sblock);
727 for (i = 0; i < sblock.fs_cssize; i += sblock.fs_bsize)
728 wtfs(fsbtodb(&sblock, sblock.fs_csaddr + numfrags(&sblock, i)),
729 sblock.fs_cssize - i < sblock.fs_bsize ?
730 sblock.fs_cssize - i : sblock.fs_bsize,
733 * Write out the duplicate super blocks
735 for (cylno = 0; cylno < sblock.fs_ncg; cylno++)
736 wtfs(fsbtodb(&sblock, cgsblock(&sblock, cylno)),
737 sbsize, (char *)&sblock);
740 * Update information about this partion in pack
741 * label, to that it may be updated on disk.
743 pp->p_fstype = FS_BSDFFS;
744 pp->p_fsize = sblock.fs_fsize;
745 pp->p_frag = sblock.fs_frag;
746 pp->p_cpg = sblock.fs_cpg;
748 * Notify parent process of success.
749 * Dissociate from session and tty.
752 kill(mfs_ppid, SIGUSR1);
762 * Initialize a cylinder group.
765 initcg(int cylno, time_t utime)
767 daddr_t cbase, d, dlower, dupper, dmax, blkno;
769 register struct csum *cs;
775 * Determine block bounds for cylinder group.
776 * Allow space for super block summary information in first
779 cbase = cgbase(&sblock, cylno);
780 dmax = cbase + sblock.fs_fpg;
781 if (dmax > sblock.fs_size)
782 dmax = sblock.fs_size;
783 dlower = cgsblock(&sblock, cylno) - cbase;
784 dupper = cgdmin(&sblock, cylno) - cbase;
786 dupper += howmany(sblock.fs_cssize, sblock.fs_fsize);
788 memset(&acg, 0, sblock.fs_cgsize);
790 acg.cg_magic = CG_MAGIC;
792 if (cylno == sblock.fs_ncg - 1)
793 acg.cg_ncyl = sblock.fs_ncyl % sblock.fs_cpg;
795 acg.cg_ncyl = sblock.fs_cpg;
796 acg.cg_niblk = sblock.fs_ipg;
797 acg.cg_ndblk = dmax - cbase;
798 if (sblock.fs_contigsumsize > 0)
799 acg.cg_nclusterblks = acg.cg_ndblk / sblock.fs_frag;
800 acg.cg_btotoff = &acg.cg_space[0] - (u_char *)(&acg.cg_firstfield);
801 acg.cg_boff = acg.cg_btotoff + sblock.fs_cpg * sizeof(int32_t);
802 acg.cg_iusedoff = acg.cg_boff +
803 sblock.fs_cpg * sblock.fs_nrpos * sizeof(u_int16_t);
804 acg.cg_freeoff = acg.cg_iusedoff + howmany(sblock.fs_ipg, NBBY);
805 if (sblock.fs_contigsumsize <= 0) {
806 acg.cg_nextfreeoff = acg.cg_freeoff +
807 howmany(sblock.fs_cpg * sblock.fs_spc / NSPF(&sblock), NBBY);
809 acg.cg_clustersumoff = acg.cg_freeoff + howmany
810 (sblock.fs_cpg * sblock.fs_spc / NSPF(&sblock), NBBY) -
812 acg.cg_clustersumoff =
813 roundup(acg.cg_clustersumoff, sizeof(u_int32_t));
814 acg.cg_clusteroff = acg.cg_clustersumoff +
815 (sblock.fs_contigsumsize + 1) * sizeof(u_int32_t);
816 acg.cg_nextfreeoff = acg.cg_clusteroff + howmany
817 (sblock.fs_cpg * sblock.fs_spc / NSPB(&sblock), NBBY);
819 if (acg.cg_nextfreeoff - (long)(&acg.cg_firstfield) > sblock.fs_cgsize) {
820 printf("Panic: cylinder group too big\n");
823 acg.cg_cs.cs_nifree += sblock.fs_ipg;
825 for (i = 0; i < ROOTINO; i++) {
826 setbit(cg_inosused(&acg), i);
827 acg.cg_cs.cs_nifree--;
829 for (i = 0; i < sblock.fs_ipg / INOPF(&sblock); i += sblock.fs_frag) {
831 for (j = 0; j < sblock.fs_bsize / sizeof(struct dinode); j++)
832 zino[j].di_gen = random();
834 wtfs(fsbtodb(&sblock, cgimin(&sblock, cylno) + i),
835 sblock.fs_bsize, (char *)zino);
839 * In cylno 0, beginning space is reserved
840 * for boot and super blocks.
842 for (d = 0; d < dlower; d += sblock.fs_frag) {
843 blkno = d / sblock.fs_frag;
844 setblock(&sblock, cg_blksfree(&acg), blkno);
845 if (sblock.fs_contigsumsize > 0)
846 setbit(cg_clustersfree(&acg), blkno);
847 acg.cg_cs.cs_nbfree++;
848 cg_blktot(&acg)[cbtocylno(&sblock, d)]++;
849 cg_blks(&sblock, &acg, cbtocylno(&sblock, d))
850 [cbtorpos(&sblock, d)]++;
852 sblock.fs_dsize += dlower;
854 sblock.fs_dsize += acg.cg_ndblk - dupper;
855 if ((i = dupper % sblock.fs_frag)) {
856 acg.cg_frsum[sblock.fs_frag - i]++;
857 for (d = dupper + sblock.fs_frag - i; dupper < d; dupper++) {
858 setbit(cg_blksfree(&acg), dupper);
859 acg.cg_cs.cs_nffree++;
862 for (d = dupper; d + sblock.fs_frag <= dmax - cbase; ) {
863 blkno = d / sblock.fs_frag;
864 setblock(&sblock, cg_blksfree(&acg), blkno);
865 if (sblock.fs_contigsumsize > 0)
866 setbit(cg_clustersfree(&acg), blkno);
867 acg.cg_cs.cs_nbfree++;
868 cg_blktot(&acg)[cbtocylno(&sblock, d)]++;
869 cg_blks(&sblock, &acg, cbtocylno(&sblock, d))
870 [cbtorpos(&sblock, d)]++;
873 if (d < dmax - cbase) {
874 acg.cg_frsum[dmax - cbase - d]++;
875 for (; d < dmax - cbase; d++) {
876 setbit(cg_blksfree(&acg), d);
877 acg.cg_cs.cs_nffree++;
880 if (sblock.fs_contigsumsize > 0) {
881 int32_t *sump = cg_clustersum(&acg);
882 u_char *mapp = cg_clustersfree(&acg);
887 for (i = 0; i < acg.cg_nclusterblks; i++) {
888 if ((map & bit) != 0) {
890 } else if (run != 0) {
891 if (run > sblock.fs_contigsumsize)
892 run = sblock.fs_contigsumsize;
896 if ((i & (NBBY - 1)) != (NBBY - 1)) {
904 if (run > sblock.fs_contigsumsize)
905 run = sblock.fs_contigsumsize;
909 sblock.fs_cstotal.cs_ndir += acg.cg_cs.cs_ndir;
910 sblock.fs_cstotal.cs_nffree += acg.cg_cs.cs_nffree;
911 sblock.fs_cstotal.cs_nbfree += acg.cg_cs.cs_nbfree;
912 sblock.fs_cstotal.cs_nifree += acg.cg_cs.cs_nifree;
914 wtfs(fsbtodb(&sblock, cgtod(&sblock, cylno)),
915 sblock.fs_bsize, (char *)&acg);
919 * initialize the file system
929 struct direct root_dir[] = {
930 { ROOTINO, sizeof(struct direct), DT_DIR, 1, "." },
931 { ROOTINO, sizeof(struct direct), DT_DIR, 2, ".." },
933 { LOSTFOUNDINO, sizeof(struct direct), DT_DIR, 10, "lost+found" },
940 u_char d_name[MAXNAMLEN + 1];
942 { ROOTINO, sizeof(struct direct), 1, "." },
943 { ROOTINO, sizeof(struct direct), 2, ".." },
945 { LOSTFOUNDINO, sizeof(struct direct), 10, "lost+found" },
949 struct direct lost_found_dir[] = {
950 { LOSTFOUNDINO, sizeof(struct direct), DT_DIR, 1, "." },
951 { ROOTINO, sizeof(struct direct), DT_DIR, 2, ".." },
952 { 0, DIRBLKSIZ, 0, 0, 0 },
954 struct odirect olost_found_dir[] = {
955 { LOSTFOUNDINO, sizeof(struct direct), 1, "." },
956 { ROOTINO, sizeof(struct direct), 2, ".." },
957 { 0, DIRBLKSIZ, 0, 0 },
970 * initialize the node
972 node.di_atime = utime;
973 node.di_mtime = utime;
974 node.di_ctime = utime;
977 * create the lost+found directory
980 (void)makedir((struct direct *)olost_found_dir, 2);
981 for (i = DIRBLKSIZ; i < sblock.fs_bsize; i += DIRBLKSIZ)
982 memmove(&buf[i], &olost_found_dir[2],
983 DIRSIZ(0, &olost_found_dir[2]));
985 (void)makedir(lost_found_dir, 2);
986 for (i = DIRBLKSIZ; i < sblock.fs_bsize; i += DIRBLKSIZ)
987 memmove(&buf[i], &lost_found_dir[2],
988 DIRSIZ(0, &lost_found_dir[2]));
990 node.di_mode = IFDIR | UMASK;
992 node.di_size = sblock.fs_bsize;
993 node.di_db[0] = alloc(node.di_size, node.di_mode);
994 node.di_blocks = btodb(fragroundup(&sblock, node.di_size));
995 wtfs(fsbtodb(&sblock, node.di_db[0]), node.di_size, buf);
996 iput(&node, LOSTFOUNDINO);
999 * create the root directory
1002 node.di_mode = IFDIR | 01777;
1004 node.di_mode = IFDIR | UMASK;
1005 node.di_nlink = PREDEFDIR;
1007 node.di_size = makedir((struct direct *)oroot_dir, PREDEFDIR);
1009 node.di_size = makedir(root_dir, PREDEFDIR);
1010 node.di_db[0] = alloc(sblock.fs_fsize, node.di_mode);
1011 node.di_blocks = btodb(fragroundup(&sblock, node.di_size));
1012 wtfs(fsbtodb(&sblock, node.di_db[0]), sblock.fs_fsize, buf);
1013 iput(&node, ROOTINO);
1017 * construct a set of directory entries in "buf".
1018 * return size of directory.
1021 makedir(register struct direct *protodir, int entries)
1026 spcleft = DIRBLKSIZ;
1027 for (cp = buf, i = 0; i < entries - 1; i++) {
1028 protodir[i].d_reclen = DIRSIZ(0, &protodir[i]);
1029 memmove(cp, &protodir[i], protodir[i].d_reclen);
1030 cp += protodir[i].d_reclen;
1031 spcleft -= protodir[i].d_reclen;
1033 protodir[i].d_reclen = spcleft;
1034 memmove(cp, &protodir[i], DIRSIZ(0, &protodir[i]));
1039 * allocate a block or frag
1042 alloc(int size, int mode)
1047 rdfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize,
1049 if (acg.cg_magic != CG_MAGIC) {
1050 printf("cg 0: bad magic number\n");
1053 if (acg.cg_cs.cs_nbfree == 0) {
1054 printf("first cylinder group ran out of space\n");
1057 for (d = 0; d < acg.cg_ndblk; d += sblock.fs_frag)
1058 if (isblock(&sblock, cg_blksfree(&acg), d / sblock.fs_frag))
1060 printf("internal error: can't find block in cyl 0\n");
1063 blkno = fragstoblks(&sblock, d);
1064 clrblock(&sblock, cg_blksfree(&acg), blkno);
1065 if (sblock.fs_contigsumsize > 0)
1066 clrbit(cg_clustersfree(&acg), blkno);
1067 acg.cg_cs.cs_nbfree--;
1068 sblock.fs_cstotal.cs_nbfree--;
1069 fscs[0].cs_nbfree--;
1071 acg.cg_cs.cs_ndir++;
1072 sblock.fs_cstotal.cs_ndir++;
1075 cg_blktot(&acg)[cbtocylno(&sblock, d)]--;
1076 cg_blks(&sblock, &acg, cbtocylno(&sblock, d))[cbtorpos(&sblock, d)]--;
1077 if (size != sblock.fs_bsize) {
1078 frag = howmany(size, sblock.fs_fsize);
1079 fscs[0].cs_nffree += sblock.fs_frag - frag;
1080 sblock.fs_cstotal.cs_nffree += sblock.fs_frag - frag;
1081 acg.cg_cs.cs_nffree += sblock.fs_frag - frag;
1082 acg.cg_frsum[sblock.fs_frag - frag]++;
1083 for (i = frag; i < sblock.fs_frag; i++)
1084 setbit(cg_blksfree(&acg), d + i);
1086 wtfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize,
1092 * Calculate number of inodes per group.
1095 calcipg(long cpg, long bpcg, off_t *usedbp)
1098 long ipg, new_ipg, ncg, ncyl;
1102 * Prepare to scale by fssize / (number of sectors in cylinder groups).
1103 * Note that fssize is still in sectors, not filesystem blocks.
1105 ncyl = howmany(fssize, (u_int)secpercyl);
1106 ncg = howmany(ncyl, cpg);
1108 * Iterate a few times to allow for ipg depending on itself.
1111 for (i = 0; i < 10; i++) {
1112 usedb = (sblock.fs_iblkno + ipg / INOPF(&sblock))
1113 * NSPF(&sblock) * (off_t)sectorsize;
1114 new_ipg = (cpg * (quad_t)bpcg - usedb) / density * fssize
1115 / ncg / secpercyl / cpg;
1116 new_ipg = roundup(new_ipg, INOPB(&sblock));
1126 * Allocate an inode on the disk
1129 iput(register struct dinode *ip, register ino_t ino)
1131 struct dinode buf[MAXINOPB];
1136 ip->di_gen = random();
1138 c = ino_to_cg(&sblock, ino);
1139 rdfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize,
1141 if (acg.cg_magic != CG_MAGIC) {
1142 printf("cg 0: bad magic number\n");
1145 acg.cg_cs.cs_nifree--;
1146 setbit(cg_inosused(&acg), ino);
1147 wtfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize,
1149 sblock.fs_cstotal.cs_nifree--;
1150 fscs[0].cs_nifree--;
1151 if (ino >= sblock.fs_ipg * sblock.fs_ncg) {
1152 printf("fsinit: inode value out of range (%d).\n", ino);
1155 d = fsbtodb(&sblock, ino_to_fsba(&sblock, ino));
1156 rdfs(d, sblock.fs_bsize, (char *)buf);
1157 buf[ino_to_fsbo(&sblock, ino)] = *ip;
1158 wtfs(d, sblock.fs_bsize, (char *)buf);
1162 * Notify parent process that the filesystem has created itself successfully.
1164 * We have to wait until the mount has actually completed!
1169 int retry = 100; /* 10 seconds, 100ms */
1171 while (mfs_ppid && retry) {
1175 stat(mfs_mtpt, &st) < 0 ||
1176 st.st_dev != mfs_mtstat.st_dev
1184 fatal("mfs mount failed waiting for mount to go active");
1191 * Replace libc function with one suited to our needs.
1194 malloc(register u_long size)
1202 pgsz = getpagesize() - 1;
1203 i = (char *)((u_long)(base + pgsz) &~ pgsz);
1204 base = sbrk(i - base);
1205 if (getrlimit(RLIMIT_DATA, &rlp) < 0)
1207 rlp.rlim_cur = rlp.rlim_max;
1208 if (setrlimit(RLIMIT_DATA, &rlp) < 0)
1210 memleft = rlp.rlim_max - (u_long)base;
1212 size = (size + pgsz) &~ pgsz;
1218 return ((caddr_t)sbrk(size));
1222 * Replace libc function with one suited to our needs.
1225 realloc(char *ptr, u_long size)
1229 if ((p = malloc(size)) == NULL)
1231 memmove(p, ptr, size);
1237 * Replace libc function with one suited to our needs.
1240 calloc(u_long size, u_long numelm)
1245 if ((base = malloc(size)) == NULL)
1247 memset(base, 0, size);
1252 * Replace libc function with one suited to our needs.
1258 /* do not worry about it for now */
1261 #else /* !STANDALONE */
1264 raise_data_limit(void)
1268 if (getrlimit(RLIMIT_DATA, &rlp) < 0)
1270 rlp.rlim_cur = rlp.rlim_max;
1271 if (setrlimit(RLIMIT_DATA, &rlp) < 0)
1276 extern char *_etext;
1277 #define etext _etext
1291 pgsz = getpagesize() - 1;
1292 dstart = ((u_long)&etext) &~ pgsz;
1293 freestart = ((u_long)(sbrk(0) + pgsz) &~ pgsz);
1294 if (getrlimit(RLIMIT_DATA, &rlp) < 0)
1296 memused = freestart - dstart;
1297 memleft = rlp.rlim_cur - memused;
1299 #endif /* STANDALONE */
1302 * read a block from the file system
1305 rdfs(daddr_t bno, int size, char *bf)
1311 memmove(bf, membase + bno * sectorsize, size);
1314 if (lseek(fsi, (off_t)bno * sectorsize, 0) < 0) {
1315 printf("seek error: %ld\n", (long)bno);
1318 n = read(fsi, bf, size);
1320 printf("read error: %ld\n", (long)bno);
1325 #define WCSIZE (128 * 1024)
1326 daddr_t wc_sect; /* units of sectorsize */
1327 int wc_end; /* bytes */
1328 static char wc[WCSIZE]; /* bytes */
1331 * Flush dirty write behind buffer.
1338 if (lseek(fso, (off_t)wc_sect * sectorsize, SEEK_SET) < 0) {
1339 printf("seek error: %ld\n", (long)wc_sect);
1340 err(35, "wtfs - writecombine");
1342 n = write(fso, wc, wc_end);
1344 printf("write error: %ld\n", (long)wc_sect);
1345 err(36, "wtfs - writecombine");
1352 * write a block to the file system
1355 wtfs(daddr_t bno, int size, char *bf)
1361 memmove(membase + bno * sectorsize, bf, size);
1367 if (wc_end == 0 && size <= WCSIZE) {
1369 bcopy(bf, wc, size);
1371 if (wc_end < WCSIZE)
1375 if ((off_t)wc_sect * sectorsize + wc_end == (off_t)bno * sectorsize &&
1376 wc_end + size <= WCSIZE) {
1377 bcopy(bf, wc + wc_end, size);
1379 if (wc_end < WCSIZE)
1386 if (lseek(fso, (off_t)bno * sectorsize, SEEK_SET) < 0) {
1387 printf("seek error: %ld\n", (long)bno);
1390 n = write(fso, bf, size);
1392 printf("write error: %ld\n", (long)bno);
1398 * check if a block is available
1401 isblock(struct fs *fs, unsigned char *cp, int h)
1405 switch (fs->fs_frag) {
1407 return (cp[h] == 0xff);
1409 mask = 0x0f << ((h & 0x1) << 2);
1410 return ((cp[h >> 1] & mask) == mask);
1412 mask = 0x03 << ((h & 0x3) << 1);
1413 return ((cp[h >> 2] & mask) == mask);
1415 mask = 0x01 << (h & 0x7);
1416 return ((cp[h >> 3] & mask) == mask);
1419 printf("isblock bad fs_frag %d\n", fs->fs_frag);
1421 fprintf(stderr, "isblock bad fs_frag %d\n", fs->fs_frag);
1428 * take a block out of the map
1431 clrblock(struct fs *fs, unsigned char *cp, int h)
1433 switch ((fs)->fs_frag) {
1438 cp[h >> 1] &= ~(0x0f << ((h & 0x1) << 2));
1441 cp[h >> 2] &= ~(0x03 << ((h & 0x3) << 1));
1444 cp[h >> 3] &= ~(0x01 << (h & 0x7));
1448 printf("clrblock bad fs_frag %d\n", fs->fs_frag);
1450 fprintf(stderr, "clrblock bad fs_frag %d\n", fs->fs_frag);
1457 * put a block into the map
1460 setblock(struct fs *fs, unsigned char *cp, int h)
1462 switch (fs->fs_frag) {
1467 cp[h >> 1] |= (0x0f << ((h & 0x1) << 2));
1470 cp[h >> 2] |= (0x03 << ((h & 0x3) << 1));
1473 cp[h >> 3] |= (0x01 << (h & 0x7));
1477 printf("setblock bad fs_frag %d\n", fs->fs_frag);
1479 fprintf(stderr, "setblock bad fs_frag %d\n", fs->fs_frag);
1486 * Determine the number of characters in a
1498 if (ioctl(0, TIOCGWINSZ, &ws) != -1)
1499 columns = ws.ws_col;
1500 if (columns == 0 && (cp = getenv("COLUMNS")))
1503 columns = 80; /* last resort */