-static char *sccsid = "@(#)mkfs.c 2.4 (Berkeley) %G%";
-
/*
- * make file system for cylinder-group style file systems
+ * Copyright (c) 1980, 1989 The Regents of the University of California.
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ * notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ * notice, this list of conditions and the following disclaimer in the
+ * documentation and/or other materials provided with the distribution.
+ * 3. All advertising materials mentioning features or use of this software
+ * must display the following acknowledgement:
+ * This product includes software developed by the University of
+ * California, Berkeley and its contributors.
+ * 4. Neither the name of the University nor the names of its contributors
+ * may be used to endorse or promote products derived from this software
+ * without specific prior written permission.
*
- * usage: mkfs special size [ nsect ntrak bsize fsize cpg ]
+ * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGE.
*/
+#ifndef lint
+static char sccsid[] = "@(#)mkfs.c 6.18 (Berkeley) 7/3/91";
+#endif /* not lint */
+
#ifndef STANDALONE
#include <stdio.h>
#include <a.out.h>
#endif
-#ifndef SIMFS
#include <sys/param.h>
-#include <sys/inode.h>
-#include <sys/fs.h>
-#else
-#include "../h/param.h"
-#include "../h/inode.h"
-#include "../h/fs.h"
-#endif
-#include <dir.h>
+#include <sys/time.h>
+#include <sys/wait.h>
+#include <sys/resource.h>
+#include <ufs/dinode.h>
+#include <ufs/fs.h>
+#include <ufs/dir.h>
+#include <sys/disklabel.h>
+#include <machine/endian.h>
+
+/*
+ * make file system for cylinder-group style file systems
+ */
+
+/*
+ * The size of a cylinder group is calculated by CGSIZE. The maximum size
+ * is limited by the fact that cylinder groups are at most one block.
+ * Its size is derived from the size of the maps maintained in the
+ * cylinder group and the (struct cg) size.
+ */
+#define CGSIZE(fs) \
+ /* base cg */ (sizeof(struct cg) + \
+ /* blktot size */ (fs)->fs_cpg * sizeof(long) + \
+ /* blks size */ (fs)->fs_cpg * (fs)->fs_nrpos * sizeof(short) + \
+ /* inode map */ howmany((fs)->fs_ipg, NBBY) + \
+ /* block map */ howmany((fs)->fs_cpg * (fs)->fs_spc / NSPF(fs), NBBY))
+
+/*
+ * We limit the size of the inode map to be no more than a
+ * third of the cylinder group space, since we must leave at
+ * least an equal amount of space for the block map.
+ *
+ * N.B.: MAXIPG must be a multiple of INOPB(fs).
+ */
+#define MAXIPG(fs) roundup((fs)->fs_bsize * NBBY / 3, INOPB(fs))
#define UMASK 0755
#define MAXINOPB (MAXBSIZE / sizeof(struct dinode))
#define POWEROF2(num) (((num) & ((num) - 1)) == 0)
+/*
+ * variables set up by front end.
+ */
+extern int mfs; /* run as the memory based filesystem */
+extern int Nflag; /* run mkfs without writing file system */
+extern int fssize; /* file system size */
+extern int ntracks; /* # tracks/cylinder */
+extern int nsectors; /* # sectors/track */
+extern int nphyssectors; /* # sectors/track including spares */
+extern int secpercyl; /* sectors per cylinder */
+extern int sectorsize; /* bytes/sector */
+extern int rpm; /* revolutions/minute of drive */
+extern int interleave; /* hardware sector interleave */
+extern int trackskew; /* sector 0 skew, per track */
+extern int headswitch; /* head switch time, usec */
+extern int trackseek; /* track-to-track seek, usec */
+extern int fsize; /* fragment size */
+extern int bsize; /* block size */
+extern int cpg; /* cylinders/cylinder group */
+extern int cpgflg; /* cylinders/cylinder group flag was given */
+extern int minfree; /* free space threshold */
+extern int opt; /* optimization preference (space or time) */
+extern int density; /* number of bytes per inode */
+extern int maxcontig; /* max contiguous blocks to allocate */
+extern int rotdelay; /* rotational delay between blocks */
+extern int maxbpg; /* maximum blocks per file in a cyl group */
+extern int nrpos; /* # of distinguished rotational positions */
+extern int bbsize; /* boot block size */
+extern int sbsize; /* superblock size */
+extern u_long memleft; /* virtual memory available */
+extern caddr_t membase; /* start address of memory based filesystem */
+extern caddr_t malloc(), calloc();
+
union {
struct fs fs;
- char pad[MAXBSIZE];
+ char pad[SBSIZE];
} fsun;
#define sblock fsun.fs
struct csum *fscs;
} cgun;
#define acg cgun.cg
-struct dinode zino[MAXIPG];
+struct dinode zino[MAXBSIZE / sizeof(struct dinode)];
-char *fsys;
-time_t utime;
-int fsi;
-int fso;
+int fsi, fso;
daddr_t alloc();
-main(argc, argv)
- int argc;
- char *argv[];
+mkfs(pp, fsys, fi, fo)
+ struct partition *pp;
+ char *fsys;
+ int fi, fo;
{
- long cylno, rpos, blk, i, j, inos, fssize, warn = 0;
+ register long i, mincpc, mincpg, inospercg;
+ long cylno, rpos, blk, j, warn = 0;
+ long used, mincpgcnt, bpcg;
+ long mapcramped, inodecramped;
+ long postblsize, rotblsize, totalsbsize;
+ int ppid, status;
+ time_t utime;
+ void started();
#ifndef STANDALONE
- argc--, argv++;
time(&utime);
- if (argc < 2) {
- printf("usage: mkfs special size [ nsect ntrak bsize fsize cpg ]\n");
- exit(1);
- }
- fsys = argv[0];
- fssize = atoi(argv[1]);
- fso = creat(fsys, 0666);
- if(fso < 0) {
- printf("%s: cannot create\n", fsys);
- exit(1);
- }
- fsi = open(fsys, 0);
- if(fsi < 0) {
- printf("%s: cannot open\n", fsys);
- exit(1);
- }
-#else
- {
- static char protos[60];
- char fsbuf[100];
-
- printf("file sys size: ");
- gets(protos);
- fssize = atoi(protos);
- do {
- printf("file system: ");
- gets(fsbuf);
- fso = open(fsbuf, 1);
- fsi = open(fsbuf, 0);
- } while (fso < 0 || fsi < 0);
- }
- argc = 0;
#endif
+ if (mfs) {
+ ppid = getpid();
+ (void) signal(SIGUSR1, started);
+ if (i = fork()) {
+ if (i == -1) {
+ perror("mfs");
+ exit(10);
+ }
+ if (waitpid(i, &status, 0) != -1 && WIFEXITED(status))
+ exit(WEXITSTATUS(status));
+ exit(11);
+ /* NOTREACHED */
+ }
+ (void)malloc(0);
+ if (fssize * sectorsize > memleft)
+ fssize = (memleft - 16384) / sectorsize;
+ if ((membase = malloc(fssize * sectorsize)) == 0)
+ exit(12);
+ }
+ fsi = fi;
+ fso = fo;
+ /*
+ * Validate the given file system size.
+ * Verify that its last block can actually be accessed.
+ */
if (fssize <= 0)
- printf("preposterous size %d\n", fssize), exit(1);
+ printf("preposterous size %d\n", fssize), exit(13);
+ wtfs(fssize - 1, sectorsize, (char *)&sblock);
/*
* collect and verify the sector and track info
*/
- if (argc > 2)
- sblock.fs_nsect = atoi(argv[2]);
- else
- sblock.fs_nsect = DFLNSECT;
- if (argc > 3)
- sblock.fs_ntrak = atoi(argv[3]);
- else
- sblock.fs_ntrak = DFLNTRAK;
+ sblock.fs_nsect = nsectors;
+ sblock.fs_ntrak = ntracks;
if (sblock.fs_ntrak <= 0)
- printf("preposterous ntrak %d\n", sblock.fs_ntrak), exit(1);
+ printf("preposterous ntrak %d\n", sblock.fs_ntrak), exit(14);
if (sblock.fs_nsect <= 0)
- printf("preposterous nsect %d\n", sblock.fs_nsect), exit(1);
- sblock.fs_spc = sblock.fs_ntrak * sblock.fs_nsect;
+ printf("preposterous nsect %d\n", sblock.fs_nsect), exit(15);
/*
* collect and verify the block and fragment sizes
*/
- if (argc > 4)
- sblock.fs_bsize = atoi(argv[4]);
- else
- sblock.fs_bsize = MAXBSIZE;
- if (argc > 5)
- sblock.fs_fsize = atoi(argv[5]);
- else
- sblock.fs_fsize = MAX(sblock.fs_bsize / DESFRAG, DEV_BSIZE);
+ sblock.fs_bsize = bsize;
+ sblock.fs_fsize = fsize;
if (!POWEROF2(sblock.fs_bsize)) {
printf("block size must be a power of 2, not %d\n",
sblock.fs_bsize);
- exit(1);
+ exit(16);
}
if (!POWEROF2(sblock.fs_fsize)) {
printf("fragment size must be a power of 2, not %d\n",
sblock.fs_fsize);
- exit(1);
+ exit(17);
}
- if (sblock.fs_fsize < DEV_BSIZE) {
+ if (sblock.fs_fsize < sectorsize) {
printf("fragment size %d is too small, minimum is %d\n",
- sblock.fs_fsize, DEV_BSIZE);
- exit(1);
+ sblock.fs_fsize, sectorsize);
+ exit(18);
}
if (sblock.fs_bsize < MINBSIZE) {
printf("block size %d is too small, minimum is %d\n",
sblock.fs_bsize, MINBSIZE);
- exit(1);
+ exit(19);
}
if (sblock.fs_bsize < sblock.fs_fsize) {
printf("block size (%d) cannot be smaller than fragment size (%d)\n",
sblock.fs_bsize, sblock.fs_fsize);
- exit(1);
+ exit(20);
}
sblock.fs_bmask = ~(sblock.fs_bsize - 1);
sblock.fs_fmask = ~(sblock.fs_fsize - 1);
+ /*
+ * Planning now for future expansion.
+ */
+# if (BYTE_ORDER == BIG_ENDIAN)
+ sblock.fs_qbmask.val[0] = 0;
+ sblock.fs_qbmask.val[1] = ~sblock.fs_bmask;
+ sblock.fs_qfmask.val[0] = 0;
+ sblock.fs_qfmask.val[1] = ~sblock.fs_fmask;
+# endif /* BIG_ENDIAN */
+# if (BYTE_ORDER == LITTLE_ENDIAN)
+ sblock.fs_qbmask.val[0] = ~sblock.fs_bmask;
+ sblock.fs_qbmask.val[1] = 0;
+ sblock.fs_qfmask.val[0] = ~sblock.fs_fmask;
+ sblock.fs_qfmask.val[1] = 0;
+# endif /* LITTLE_ENDIAN */
for (sblock.fs_bshift = 0, i = sblock.fs_bsize; i > 1; i >>= 1)
sblock.fs_bshift++;
for (sblock.fs_fshift = 0, i = sblock.fs_fsize; i > 1; i >>= 1)
sblock.fs_fshift++;
sblock.fs_frag = numfrags(&sblock, sblock.fs_bsize);
+ for (sblock.fs_fragshift = 0, i = sblock.fs_frag; i > 1; i >>= 1)
+ sblock.fs_fragshift++;
if (sblock.fs_frag > MAXFRAG) {
printf("fragment size %d is too small, minimum with block size %d is %d\n",
sblock.fs_fsize, sblock.fs_bsize,
sblock.fs_bsize / MAXFRAG);
- exit(1);
+ exit(21);
}
+ sblock.fs_nrpos = nrpos;
+ sblock.fs_nindir = sblock.fs_bsize / sizeof(daddr_t);
+ sblock.fs_inopb = sblock.fs_bsize / sizeof(struct dinode);
+ sblock.fs_nspf = sblock.fs_fsize / sectorsize;
+ for (sblock.fs_fsbtodb = 0, i = NSPF(&sblock); i > 1; i >>= 1)
+ sblock.fs_fsbtodb++;
sblock.fs_sblkno =
- roundup(howmany(BBSIZE + SBSIZE, sblock.fs_fsize), sblock.fs_frag);
+ roundup(howmany(bbsize + sbsize, sblock.fs_fsize), sblock.fs_frag);
sblock.fs_cblkno = (daddr_t)(sblock.fs_sblkno +
- roundup(howmany(SBSIZE, sblock.fs_fsize), sblock.fs_frag));
+ roundup(howmany(sbsize, sblock.fs_fsize), sblock.fs_frag));
sblock.fs_iblkno = sblock.fs_cblkno + sblock.fs_frag;
sblock.fs_cgoffset = roundup(
- howmany(sblock.fs_nsect, sblock.fs_fsize / DEV_BSIZE),
- sblock.fs_frag);
+ howmany(sblock.fs_nsect, NSPF(&sblock)), sblock.fs_frag);
for (sblock.fs_cgmask = 0xffffffff, i = sblock.fs_ntrak; i > 1; i >>= 1)
sblock.fs_cgmask <<= 1;
if (!POWEROF2(sblock.fs_ntrak))
sblock.fs_cgmask <<= 1;
+ /*
+ * Validate specified/determined secpercyl
+ * and calculate minimum cylinders per group.
+ */
+ sblock.fs_spc = secpercyl;
for (sblock.fs_cpc = NSPB(&sblock), i = sblock.fs_spc;
sblock.fs_cpc > 1 && (i & 1) == 0;
sblock.fs_cpc >>= 1, i >>= 1)
/* void */;
- if (sblock.fs_cpc > MAXCPG) {
- printf("maximum block size with nsect %d and ntrak %d is %d\n",
- sblock.fs_nsect, sblock.fs_ntrak,
- sblock.fs_bsize / (sblock.fs_cpc / MAXCPG));
- exit(1);
+ mincpc = sblock.fs_cpc;
+ bpcg = sblock.fs_spc * sectorsize;
+ inospercg = roundup(bpcg / sizeof(struct dinode), INOPB(&sblock));
+ if (inospercg > MAXIPG(&sblock))
+ inospercg = MAXIPG(&sblock);
+ used = (sblock.fs_iblkno + inospercg / INOPF(&sblock)) * NSPF(&sblock);
+ mincpgcnt = howmany(sblock.fs_cgoffset * (~sblock.fs_cgmask) + used,
+ sblock.fs_spc);
+ mincpg = roundup(mincpgcnt, mincpc);
+ /*
+ * Insure that cylinder group with mincpg has enough space
+ * for block maps
+ */
+ sblock.fs_cpg = mincpg;
+ sblock.fs_ipg = inospercg;
+ mapcramped = 0;
+ while (CGSIZE(&sblock) > sblock.fs_bsize) {
+ mapcramped = 1;
+ if (sblock.fs_bsize < MAXBSIZE) {
+ sblock.fs_bsize <<= 1;
+ if ((i & 1) == 0) {
+ i >>= 1;
+ } else {
+ sblock.fs_cpc <<= 1;
+ mincpc <<= 1;
+ mincpg = roundup(mincpgcnt, mincpc);
+ sblock.fs_cpg = mincpg;
+ }
+ sblock.fs_frag <<= 1;
+ sblock.fs_fragshift += 1;
+ if (sblock.fs_frag <= MAXFRAG)
+ continue;
+ }
+ if (sblock.fs_fsize == sblock.fs_bsize) {
+ printf("There is no block size that");
+ printf(" can support this disk\n");
+ exit(22);
+ }
+ sblock.fs_frag >>= 1;
+ sblock.fs_fragshift -= 1;
+ sblock.fs_fsize <<= 1;
+ sblock.fs_nspf <<= 1;
}
- /*
- * collect and verify the number of cylinders per group
+ /*
+ * Insure that cylinder group with mincpg has enough space for inodes
*/
- if (argc > 6) {
- sblock.fs_cpg = atoi(argv[6]);
- sblock.fs_fpg = (sblock.fs_cpg * sblock.fs_spc) / NSPF(&sblock);
- } else {
- sblock.fs_cpg = MAX(sblock.fs_cpc, DESCPG);
- sblock.fs_fpg = (sblock.fs_cpg * sblock.fs_spc) / NSPF(&sblock);
- while (sblock.fs_fpg / sblock.fs_frag > MAXBPG(&sblock) &&
- sblock.fs_cpg > sblock.fs_cpc) {
- sblock.fs_cpg -= sblock.fs_cpc;
- sblock.fs_fpg =
- (sblock.fs_cpg * sblock.fs_spc) / NSPF(&sblock);
+ inodecramped = 0;
+ used *= sectorsize;
+ inospercg = roundup((mincpg * bpcg - used) / density, INOPB(&sblock));
+ sblock.fs_ipg = inospercg;
+ while (inospercg > MAXIPG(&sblock)) {
+ inodecramped = 1;
+ if (mincpc == 1 || sblock.fs_frag == 1 ||
+ sblock.fs_bsize == MINBSIZE)
+ break;
+ printf("With a block size of %d %s %d\n", sblock.fs_bsize,
+ "minimum bytes per inode is",
+ (mincpg * bpcg - used) / MAXIPG(&sblock) + 1);
+ sblock.fs_bsize >>= 1;
+ sblock.fs_frag >>= 1;
+ sblock.fs_fragshift -= 1;
+ mincpc >>= 1;
+ sblock.fs_cpg = roundup(mincpgcnt, mincpc);
+ if (CGSIZE(&sblock) > sblock.fs_bsize) {
+ sblock.fs_bsize <<= 1;
+ break;
}
+ mincpg = sblock.fs_cpg;
+ inospercg =
+ roundup((mincpg * bpcg - used) / density, INOPB(&sblock));
+ sblock.fs_ipg = inospercg;
+ }
+ if (inodecramped) {
+ if (inospercg > MAXIPG(&sblock)) {
+ printf("Minimum bytes per inode is %d\n",
+ (mincpg * bpcg - used) / MAXIPG(&sblock) + 1);
+ } else if (!mapcramped) {
+ printf("With %d bytes per inode, ", density);
+ printf("minimum cylinders per group is %d\n", mincpg);
+ }
+ }
+ if (mapcramped) {
+ printf("With %d sectors per cylinder, ", sblock.fs_spc);
+ printf("minimum cylinders per group is %d\n", mincpg);
+ }
+ if (inodecramped || mapcramped) {
+ if (sblock.fs_bsize != bsize)
+ printf("%s to be changed from %d to %d\n",
+ "This requires the block size",
+ bsize, sblock.fs_bsize);
+ if (sblock.fs_fsize != fsize)
+ printf("\t%s to be changed from %d to %d\n",
+ "and the fragment size",
+ fsize, sblock.fs_fsize);
+ exit(23);
+ }
+ /*
+ * Calculate the number of cylinders per group
+ */
+ sblock.fs_cpg = cpg;
+ if (sblock.fs_cpg % mincpc != 0) {
+ printf("%s groups must have a multiple of %d cylinders\n",
+ cpgflg ? "Cylinder" : "Warning: cylinder", mincpc);
+ sblock.fs_cpg = roundup(sblock.fs_cpg, mincpc);
+ if (!cpgflg)
+ cpg = sblock.fs_cpg;
+ }
+ /*
+ * Must insure there is enough space for inodes
+ */
+ sblock.fs_ipg = roundup((sblock.fs_cpg * bpcg - used) / density,
+ INOPB(&sblock));
+ while (sblock.fs_ipg > MAXIPG(&sblock)) {
+ inodecramped = 1;
+ sblock.fs_cpg -= mincpc;
+ sblock.fs_ipg = roundup((sblock.fs_cpg * bpcg - used) / density,
+ INOPB(&sblock));
}
- if (sblock.fs_cpg < 1) {
- printf("cylinder groups must have at least 1 cylinder\n");
- exit(1);
+ /*
+ * Must insure there is enough space to hold block map
+ */
+ while (CGSIZE(&sblock) > sblock.fs_bsize) {
+ mapcramped = 1;
+ sblock.fs_cpg -= mincpc;
+ sblock.fs_ipg = roundup((sblock.fs_cpg * bpcg - used) / density,
+ INOPB(&sblock));
}
- if (sblock.fs_cpg > MAXCPG) {
- printf("cylinder groups are limited to %d cylinders\n", MAXCPG);
- exit(1);
+ sblock.fs_fpg = (sblock.fs_cpg * sblock.fs_spc) / NSPF(&sblock);
+ if ((sblock.fs_cpg * sblock.fs_spc) % NSPB(&sblock) != 0) {
+ printf("panic (fs_cpg * fs_spc) % NSPF != 0");
+ exit(24);
}
- if (sblock.fs_cpg % sblock.fs_cpc != 0) {
- printf("cylinder groups must have a multiple of %d cylinders\n",
- sblock.fs_cpc);
- exit(1);
+ if (sblock.fs_cpg < mincpg) {
+ printf("cylinder groups must have at least %d cylinders\n",
+ mincpg);
+ exit(25);
+ } else if (sblock.fs_cpg != cpg) {
+ if (!cpgflg)
+ printf("Warning: ");
+ else if (!mapcramped && !inodecramped)
+ exit(26);
+ if (mapcramped && inodecramped)
+ printf("Block size and bytes per inode restrict");
+ else if (mapcramped)
+ printf("Block size restricts");
+ else
+ printf("Bytes per inode restrict");
+ printf(" cylinders per group to %d.\n", sblock.fs_cpg);
+ if (cpgflg)
+ exit(27);
}
+ sblock.fs_cgsize = fragroundup(&sblock, CGSIZE(&sblock));
/*
* Now have size for file system and nsect and ntrak.
* Determine number of cylinders and blocks in the file system.
}
if (sblock.fs_ncyl < 1) {
printf("file systems must have at least one cylinder\n");
- exit(1);
+ exit(28);
}
/*
- * determine feasability/values of rotational layout tables
+ * Determine feasability/values of rotational layout tables.
+ *
+ * The size of the rotational layout tables is limited by the
+ * size of the superblock, SBSIZE. The amount of space available
+ * for tables is calculated as (SBSIZE - sizeof (struct fs)).
+ * The size of these tables is inversely proportional to the block
+ * size of the file system. The size increases if sectors per track
+ * are not powers of two, because more cylinders must be described
+ * by the tables before the rotational pattern repeats (fs_cpc).
*/
+ sblock.fs_interleave = interleave;
+ sblock.fs_trackskew = trackskew;
+ sblock.fs_npsect = nphyssectors;
+ sblock.fs_postblformat = FS_DYNAMICPOSTBLFMT;
+ sblock.fs_sbsize = fragroundup(&sblock, sizeof(struct fs));
if (sblock.fs_ntrak == 1) {
sblock.fs_cpc = 0;
goto next;
}
- if (sblock.fs_spc * sblock.fs_cpc > MAXBPC * NSPB(&sblock) ||
+ postblsize = sblock.fs_nrpos * sblock.fs_cpc * sizeof(short);
+ rotblsize = sblock.fs_cpc * sblock.fs_spc / NSPB(&sblock);
+ totalsbsize = sizeof(struct fs) + rotblsize;
+ if (sblock.fs_nrpos == 8 && sblock.fs_cpc <= 16) {
+ /* use old static table space */
+ sblock.fs_postbloff = (char *)(&sblock.fs_opostbl[0][0]) -
+ (char *)(&sblock.fs_link);
+ sblock.fs_rotbloff = &sblock.fs_space[0] -
+ (u_char *)(&sblock.fs_link);
+ } else {
+ /* use dynamic table space */
+ sblock.fs_postbloff = &sblock.fs_space[0] -
+ (u_char *)(&sblock.fs_link);
+ sblock.fs_rotbloff = sblock.fs_postbloff + postblsize;
+ totalsbsize += postblsize;
+ }
+ if (totalsbsize > SBSIZE ||
sblock.fs_nsect > (1 << NBBY) * NSPB(&sblock)) {
printf("%s %s %d %s %d.%s",
"Warning: insufficient space in super block for\n",
"rotational layout tables with nsect", sblock.fs_nsect,
"and ntrak", sblock.fs_ntrak,
- "\nFile system performance may be impared.\n");
+ "\nFile system performance may be impaired.\n");
sblock.fs_cpc = 0;
goto next;
}
+ sblock.fs_sbsize = fragroundup(&sblock, totalsbsize);
/*
* calculate the available blocks for each rotational position
*/
- for (cylno = 0; cylno < MAXCPG; cylno++)
- for (rpos = 0; rpos < NRPOS; rpos++)
- sblock.fs_postbl[cylno][rpos] = -1;
- blk = sblock.fs_spc * sblock.fs_cpc / NSPF(&sblock);
- for (i = 0; i < blk; i += sblock.fs_frag)
- /* void */;
- for (i -= sblock.fs_frag; i >= 0; i -= sblock.fs_frag) {
+ for (cylno = 0; cylno < sblock.fs_cpc; cylno++)
+ for (rpos = 0; rpos < sblock.fs_nrpos; rpos++)
+ fs_postbl(&sblock, cylno)[rpos] = -1;
+ for (i = (rotblsize - 1) * sblock.fs_frag;
+ i >= 0; i -= sblock.fs_frag) {
cylno = cbtocylno(&sblock, i);
rpos = cbtorpos(&sblock, i);
- blk = i / sblock.fs_frag;
- if (sblock.fs_postbl[cylno][rpos] == -1)
- sblock.fs_rotbl[blk] = 0;
+ blk = fragstoblks(&sblock, i);
+ if (fs_postbl(&sblock, cylno)[rpos] == -1)
+ fs_rotbl(&sblock)[blk] = 0;
else
- sblock.fs_rotbl[blk] =
- sblock.fs_postbl[cylno][rpos] - blk;
- sblock.fs_postbl[cylno][rpos] = blk;
+ fs_rotbl(&sblock)[blk] =
+ fs_postbl(&sblock, cylno)[rpos] - blk;
+ fs_postbl(&sblock, cylno)[rpos] = blk;
}
next:
- /*
- * Validate specified/determined cpg.
- */
- if (sblock.fs_spc > MAXBPG(&sblock) * NSPB(&sblock)) {
- printf("too many sectors per cylinder (%d sectors)\n",
- sblock.fs_spc);
- while(sblock.fs_spc > MAXBPG(&sblock) * NSPB(&sblock)) {
- sblock.fs_bsize <<= 1;
- if (sblock.fs_frag < MAXFRAG)
- sblock.fs_frag <<= 1;
- else
- sblock.fs_fsize <<= 1;
- }
- printf("nsect %d, and ntrak %d, requires block size of %d,\n",
- sblock.fs_nsect, sblock.fs_ntrak, sblock.fs_bsize);
- printf("\tand fragment size of %d\n", sblock.fs_fsize);
- exit(1);
- }
- if (sblock.fs_fpg > MAXBPG(&sblock) * sblock.fs_frag) {
- printf("cylinder group too large (%d cylinders); ",
- sblock.fs_cpg);
- printf("max: %d cylinders per group\n",
- MAXBPG(&sblock) * sblock.fs_frag /
- (sblock.fs_fpg / sblock.fs_cpg));
- exit(1);
- }
- sblock.fs_cgsize = fragroundup(&sblock,
- sizeof(struct cg) + howmany(sblock.fs_fpg, NBBY));
/*
* Compute/validate number of cylinder groups.
*/
sblock.fs_ncg = sblock.fs_ncyl / sblock.fs_cpg;
if (sblock.fs_ncyl % sblock.fs_cpg)
sblock.fs_ncg++;
- if ((sblock.fs_spc * sblock.fs_cpg) % NSPF(&sblock)) {
- printf("mkfs: nsect %d, ntrak %d, cpg %d is not tolerable\n",
- sblock.fs_nsect, sblock.fs_ntrak, sblock.fs_cpg);
- printf("as this would would have cyl groups whose size\n");
- printf("is not a multiple of %d; choke!\n", sblock.fs_fsize);
- exit(1);
- }
- /*
- * Compute number of inode blocks per cylinder group.
- * Start with one inode per NBPI bytes; adjust as necessary.
- */
- i = sblock.fs_iblkno + MAXIPG / INOPF(&sblock);
- inos = (fssize - sblock.fs_ncg * i) * sblock.fs_fsize /
- MAX(NBPI, sblock.fs_fsize) / INOPB(&sblock);
- if (inos <= 0)
- inos = 1;
- sblock.fs_ipg = ((inos / sblock.fs_ncg) + 1) * INOPB(&sblock);
- if (sblock.fs_ipg > MAXIPG)
- sblock.fs_ipg = MAXIPG;
sblock.fs_dblkno = sblock.fs_iblkno + sblock.fs_ipg / INOPF(&sblock);
i = MIN(~sblock.fs_cgmask, sblock.fs_ncg - 1);
if (cgdmin(&sblock, i) - cgbase(&sblock, i) >= sblock.fs_fpg) {
printf("inode blocks/cyl group (%d) >= data blocks (%d)\n",
cgdmin(&sblock, i) - cgbase(&sblock, i) / sblock.fs_frag,
sblock.fs_fpg / sblock.fs_frag);
- printf("number of cylinders per cylinder group must be increased\n");
- exit(1);
+ printf("number of cylinders per cylinder group (%d) %s.\n",
+ sblock.fs_cpg, "must be increased");
+ exit(29);
}
j = sblock.fs_ncg - 1;
if ((i = fssize - j * sblock.fs_fpg) < sblock.fs_fpg &&
cgdmin(&sblock, j) - cgbase(&sblock, j) > i) {
+ if (j == 0) {
+ printf("Filesystem must have at least %d sectors\n",
+ NSPF(&sblock) *
+ (cgdmin(&sblock, 0) + 3 * sblock.fs_frag));
+ exit(30);
+ }
printf("Warning: inode blocks/cyl group (%d) >= data blocks (%d) in last\n",
(cgdmin(&sblock, j) - cgbase(&sblock, j)) / sblock.fs_frag,
i / sblock.fs_frag);
NSPF(&sblock);
warn = 0;
}
- if (warn) {
+ if (warn && !mfs) {
printf("Warning: %d sector(s) in last cylinder unallocated\n",
sblock.fs_spc -
(fssize * NSPF(&sblock) - (sblock.fs_ncyl - 1)
sblock.fs_csaddr = cgdmin(&sblock, 0);
sblock.fs_cssize =
fragroundup(&sblock, sblock.fs_ncg * sizeof(struct csum));
+ i = sblock.fs_bsize / sizeof(struct csum);
+ sblock.fs_csmask = ~(i - 1);
+ for (sblock.fs_csshift = 0; i > 1; i >>= 1)
+ sblock.fs_csshift++;
fscs = (struct csum *)calloc(1, sblock.fs_cssize);
sblock.fs_magic = FS_MAGIC;
- sblock.fs_rotdelay = ROTDELAY;
- sblock.fs_minfree = MINFREE;
- sblock.fs_rps = 60; /* assume disk speed == 60 HZ */
+ sblock.fs_rotdelay = rotdelay;
+ sblock.fs_minfree = minfree;
+ sblock.fs_maxcontig = maxcontig;
+ sblock.fs_headswitch = headswitch;
+ sblock.fs_trkseek = trackseek;
+ sblock.fs_maxbpg = maxbpg;
+ sblock.fs_rps = rpm / 60;
+ sblock.fs_optim = opt;
sblock.fs_cgrotor = 0;
sblock.fs_cstotal.cs_ndir = 0;
sblock.fs_cstotal.cs_nbfree = 0;
/*
* Dump out summary information about file system.
*/
- printf("%s:\t%d sectors in %d cylinders of %d tracks, %d sectors\n",
- fsys, sblock.fs_size * NSPF(&sblock), sblock.fs_ncyl,
- sblock.fs_ntrak, sblock.fs_nsect);
- printf("\t%.1fMb in %d cyl groups (%d c/g, %.2fMb/g, %d i/g)\n",
- (float)sblock.fs_size * sblock.fs_fsize * 1e-6, sblock.fs_ncg,
- sblock.fs_cpg, (float)sblock.fs_fpg * sblock.fs_fsize * 1e-6,
- sblock.fs_ipg);
+ if (!mfs) {
+ printf("%s:\t%d sectors in %d %s of %d tracks, %d sectors\n",
+ fsys, sblock.fs_size * NSPF(&sblock), sblock.fs_ncyl,
+ "cylinders", sblock.fs_ntrak, sblock.fs_nsect);
+ printf("\t%.1fMB in %d cyl groups (%d c/g, %.2fMB/g, %d i/g)\n",
+ (float)sblock.fs_size * sblock.fs_fsize * 1e-6,
+ sblock.fs_ncg, sblock.fs_cpg,
+ (float)sblock.fs_fpg * sblock.fs_fsize * 1e-6,
+ sblock.fs_ipg);
+ }
/*
* Now build the cylinders group blocks and
* then print out indices of cylinder groups.
*/
- printf("super-block backups (for fsck -b#) at:");
+ if (!mfs)
+ printf("super-block backups (for fsck -b #) at:");
for (cylno = 0; cylno < sblock.fs_ncg; cylno++) {
- initcg(cylno);
- if (cylno % 10 == 0)
+ initcg(cylno, utime);
+ if (mfs)
+ continue;
+ if (cylno % 9 == 0)
printf("\n");
printf(" %d,", fsbtodb(&sblock, cgsblock(&sblock, cylno)));
}
- printf("\n%s\n%s\n",
- "WRITE THESE NUMBERS DOWN!!!",
- "fsck depends on them to recover this file system.");
+ if (!mfs)
+ printf("\n");
+ if (Nflag && !mfs)
+ exit(0);
/*
* Now construct the initial file system,
* then write out the super-block.
*/
- fsinit();
+ fsinit(utime);
sblock.fs_time = utime;
- wtfs(SBLOCK, SBSIZE, (char *)&sblock);
+ wtfs(SBOFF / sectorsize, sbsize, (char *)&sblock);
for (i = 0; i < sblock.fs_cssize; i += sblock.fs_bsize)
wtfs(fsbtodb(&sblock, sblock.fs_csaddr + numfrags(&sblock, i)),
sblock.fs_cssize - i < sblock.fs_bsize ?
/*
* Write out the duplicate super blocks
*/
- for (cylno = 1; cylno < sblock.fs_ncg; cylno++)
+ for (cylno = 0; cylno < sblock.fs_ncg; cylno++)
wtfs(fsbtodb(&sblock, cgsblock(&sblock, cylno)),
- SBSIZE, (char *)&sblock);
-#ifndef STANDALONE
- exit(0);
-#endif
+ sbsize, (char *)&sblock);
+ /*
+ * Update information about this partion in pack
+ * label, to that it may be updated on disk.
+ */
+ pp->p_fstype = FS_BSDFFS;
+ pp->p_fsize = sblock.fs_fsize;
+ pp->p_frag = sblock.fs_frag;
+ pp->p_cpg = sblock.fs_cpg;
+ /*
+ * Notify parent process of success.
+ * Dissociate from session and tty.
+ */
+ if (mfs) {
+ kill(ppid, SIGUSR1);
+ (void) setsid();
+ (void) close(0);
+ (void) close(1);
+ (void) close(2);
+ (void) chdir("/");
+ }
}
/*
* Initialize a cylinder group.
*/
-initcg(cylno)
+initcg(cylno, utime)
int cylno;
+ time_t utime;
{
daddr_t cbase, d, dlower, dupper, dmax;
long i, j, s;
dmax = sblock.fs_size;
dlower = cgsblock(&sblock, cylno) - cbase;
dupper = cgdmin(&sblock, cylno) - cbase;
+ if (cylno == 0)
+ dupper += howmany(sblock.fs_cssize, sblock.fs_fsize);
cs = fscs + cylno;
acg.cg_time = utime;
acg.cg_magic = CG_MAGIC;
acg.cg_rotor = 0;
acg.cg_frotor = 0;
acg.cg_irotor = 0;
+ acg.cg_btotoff = &acg.cg_space[0] - (u_char *)(&acg.cg_link);
+ acg.cg_boff = acg.cg_btotoff + sblock.fs_cpg * sizeof(long);
+ acg.cg_iusedoff = acg.cg_boff +
+ sblock.fs_cpg * sblock.fs_nrpos * sizeof(short);
+ acg.cg_freeoff = acg.cg_iusedoff + howmany(sblock.fs_ipg, NBBY);
+ acg.cg_nextfreeoff = acg.cg_freeoff +
+ howmany(sblock.fs_cpg * sblock.fs_spc / NSPF(&sblock), NBBY);
for (i = 0; i < sblock.fs_frag; i++) {
acg.cg_frsum[i] = 0;
}
- for (i = 0; i < sblock.fs_ipg; ) {
- for (j = INOPB(&sblock); j > 0; j--) {
- clrbit(acg.cg_iused, i);
- i++;
- }
- acg.cg_cs.cs_nifree += INOPB(&sblock);
- }
+ bzero((caddr_t)cg_inosused(&acg), acg.cg_freeoff - acg.cg_iusedoff);
+ acg.cg_cs.cs_nifree += sblock.fs_ipg;
if (cylno == 0)
for (i = 0; i < ROOTINO; i++) {
- setbit(acg.cg_iused, i);
+ setbit(cg_inosused(&acg), i);
acg.cg_cs.cs_nifree--;
}
- while (i < MAXIPG) {
- clrbit(acg.cg_iused, i);
- i++;
- }
- lseek(fso, fsbtodb(&sblock, cgimin(&sblock, cylno)) * DEV_BSIZE, 0);
- if (write(fso, (char *)zino, sblock.fs_ipg * sizeof (struct dinode)) !=
- sblock.fs_ipg * sizeof (struct dinode))
- printf("write error %D\n", numfrags(&sblock, tell(fso)));
- for (i = 0; i < MAXCPG; i++) {
- acg.cg_btot[i] = 0;
- for (j = 0; j < NRPOS; j++)
- acg.cg_b[i][j] = 0;
- }
- if (cylno == 0) {
+ for (i = 0; i < sblock.fs_ipg / INOPF(&sblock); i += sblock.fs_frag)
+ wtfs(fsbtodb(&sblock, cgimin(&sblock, cylno) + i),
+ sblock.fs_bsize, (char *)zino);
+ bzero((caddr_t)cg_blktot(&acg), acg.cg_boff - acg.cg_btotoff);
+ bzero((caddr_t)cg_blks(&sblock, &acg, 0),
+ acg.cg_iusedoff - acg.cg_boff);
+ bzero((caddr_t)cg_blksfree(&acg), acg.cg_nextfreeoff - acg.cg_freeoff);
+ if (cylno > 0) {
/*
- * reserve space for summary info and Boot block
+ * In cylno 0, beginning space is reserved
+ * for boot and super blocks.
*/
- dupper += howmany(sblock.fs_cssize, sblock.fs_fsize);
- for (d = 0; d < dlower; d += sblock.fs_frag)
- clrblock(&sblock, acg.cg_free, d/sblock.fs_frag);
- } else {
for (d = 0; d < dlower; d += sblock.fs_frag) {
- setblock(&sblock, acg.cg_free, d/sblock.fs_frag);
+ setblock(&sblock, cg_blksfree(&acg), d/sblock.fs_frag);
acg.cg_cs.cs_nbfree++;
- acg.cg_btot[cbtocylno(&sblock, d)]++;
- acg.cg_b[cbtocylno(&sblock, d)][cbtorpos(&sblock, d)]++;
+ cg_blktot(&acg)[cbtocylno(&sblock, d)]++;
+ cg_blks(&sblock, &acg, cbtocylno(&sblock, d))
+ [cbtorpos(&sblock, d)]++;
}
sblock.fs_dsize += dlower;
}
sblock.fs_dsize += acg.cg_ndblk - dupper;
- for (; d < dupper; d += sblock.fs_frag)
- clrblock(&sblock, acg.cg_free, d/sblock.fs_frag);
- if (d > dupper) {
- acg.cg_frsum[d - dupper]++;
- for (i = d - 1; i >= dupper; i--) {
- setbit(acg.cg_free, i);
+ if (i = dupper % sblock.fs_frag) {
+ acg.cg_frsum[sblock.fs_frag - i]++;
+ for (d = dupper + sblock.fs_frag - i; dupper < d; dupper++) {
+ setbit(cg_blksfree(&acg), dupper);
acg.cg_cs.cs_nffree++;
}
}
- while ((d + sblock.fs_frag) <= dmax - cbase) {
- setblock(&sblock, acg.cg_free, d/sblock.fs_frag);
+ for (d = dupper; d + sblock.fs_frag <= dmax - cbase; ) {
+ setblock(&sblock, cg_blksfree(&acg), d / sblock.fs_frag);
acg.cg_cs.cs_nbfree++;
- acg.cg_btot[cbtocylno(&sblock, d)]++;
- acg.cg_b[cbtocylno(&sblock, d)][cbtorpos(&sblock, d)]++;
+ cg_blktot(&acg)[cbtocylno(&sblock, d)]++;
+ cg_blks(&sblock, &acg, cbtocylno(&sblock, d))
+ [cbtorpos(&sblock, d)]++;
d += sblock.fs_frag;
}
if (d < dmax - cbase) {
acg.cg_frsum[dmax - cbase - d]++;
for (; d < dmax - cbase; d++) {
- setbit(acg.cg_free, d);
+ setbit(cg_blksfree(&acg), d);
acg.cg_cs.cs_nffree++;
}
- for (; d % sblock.fs_frag != 0; d++)
- clrbit(acg.cg_free, d);
}
- for (d /= sblock.fs_frag; d < MAXBPG(&sblock); d ++)
- clrblock(&sblock, acg.cg_free, d);
sblock.fs_cstotal.cs_ndir += acg.cg_cs.cs_ndir;
sblock.fs_cstotal.cs_nffree += acg.cg_cs.cs_nffree;
sblock.fs_cstotal.cs_nbfree += acg.cg_cs.cs_nbfree;
/*
* initialize the file system
*/
-struct inode node;
+struct dinode node;
+
+#ifdef LOSTDIR
#define PREDEFDIR 3
+#else
+#define PREDEFDIR 2
+#endif
+
struct direct root_dir[] = {
{ ROOTINO, sizeof(struct direct), 1, "." },
{ ROOTINO, sizeof(struct direct), 2, ".." },
+#ifdef LOSTDIR
{ LOSTFOUNDINO, sizeof(struct direct), 10, "lost+found" },
+#endif
};
+#ifdef LOSTDIR
struct direct lost_found_dir[] = {
{ LOSTFOUNDINO, sizeof(struct direct), 1, "." },
{ ROOTINO, sizeof(struct direct), 2, ".." },
{ 0, DIRBLKSIZ, 0, 0 },
};
+#endif
char buf[MAXBSIZE];
-fsinit()
+fsinit(utime)
+ time_t utime;
{
int i;
/*
* initialize the node
*/
- node.i_atime = utime;
- node.i_mtime = utime;
- node.i_ctime = utime;
+ node.di_atime = utime;
+ node.di_mtime = utime;
+ node.di_ctime = utime;
+#ifdef LOSTDIR
/*
* create the lost+found directory
*/
(void)makedir(lost_found_dir, 2);
for (i = DIRBLKSIZ; i < sblock.fs_bsize; i += DIRBLKSIZ)
bcopy(&lost_found_dir[2], &buf[i], DIRSIZ(&lost_found_dir[2]));
- node.i_number = LOSTFOUNDINO;
- node.i_mode = IFDIR | UMASK;
- node.i_nlink = 2;
- node.i_size = sblock.fs_bsize;
- node.i_db[0] = alloc(node.i_size, node.i_mode);
- wtfs(fsbtodb(&sblock, node.i_db[0]), node.i_size, buf);
- iput(&node);
+ node.di_mode = IFDIR | UMASK;
+ node.di_nlink = 2;
+ node.di_size = sblock.fs_bsize;
+ node.di_db[0] = alloc(node.di_size, node.di_mode);
+ node.di_blocks = btodb(fragroundup(&sblock, node.di_size));
+ wtfs(fsbtodb(&sblock, node.di_db[0]), node.di_size, buf);
+ iput(&node, LOSTFOUNDINO);
+#endif
/*
* create the root directory
*/
- node.i_number = ROOTINO;
- node.i_mode = IFDIR | UMASK;
- node.i_nlink = PREDEFDIR;
- node.i_size = makedir(root_dir, PREDEFDIR);
- node.i_db[0] = alloc(sblock.fs_fsize, node.i_mode);
- wtfs(fsbtodb(&sblock, node.i_db[0]), sblock.fs_fsize, buf);
- iput(&node);
+ if (mfs)
+ node.di_mode = IFDIR | 01777;
+ else
+ node.di_mode = IFDIR | UMASK;
+ node.di_nlink = PREDEFDIR;
+ node.di_size = makedir(root_dir, PREDEFDIR);
+ node.di_db[0] = alloc(sblock.fs_fsize, node.di_mode);
+ node.di_blocks = btodb(fragroundup(&sblock, node.di_size));
+ wtfs(fsbtodb(&sblock, node.di_db[0]), sblock.fs_fsize, buf);
+ iput(&node, ROOTINO);
}
/*
}
protodir[i].d_reclen = spcleft;
bcopy(&protodir[i], cp, DIRSIZ(&protodir[i]));
- cp += DIRSIZ(&protodir[i]);
- return (cp - buf);
+ return (DIRBLKSIZ);
}
/*
return (0);
}
for (d = 0; d < acg.cg_ndblk; d += sblock.fs_frag)
- if (isblock(&sblock, acg.cg_free, d / sblock.fs_frag))
+ if (isblock(&sblock, cg_blksfree(&acg), d / sblock.fs_frag))
goto goth;
printf("internal error: can't find block in cyl 0\n");
return (0);
goth:
- clrblock(&sblock, acg.cg_free, d / sblock.fs_frag);
+ clrblock(&sblock, cg_blksfree(&acg), d / sblock.fs_frag);
acg.cg_cs.cs_nbfree--;
sblock.fs_cstotal.cs_nbfree--;
fscs[0].cs_nbfree--;
sblock.fs_cstotal.cs_ndir++;
fscs[0].cs_ndir++;
}
- acg.cg_btot[cbtocylno(&sblock, d)]--;
- acg.cg_b[cbtocylno(&sblock, d)][cbtorpos(&sblock, d)]--;
+ cg_blktot(&acg)[cbtocylno(&sblock, d)]--;
+ cg_blks(&sblock, &acg, cbtocylno(&sblock, d))[cbtorpos(&sblock, d)]--;
if (size != sblock.fs_bsize) {
frag = howmany(size, sblock.fs_fsize);
fscs[0].cs_nffree += sblock.fs_frag - frag;
acg.cg_cs.cs_nffree += sblock.fs_frag - frag;
acg.cg_frsum[sblock.fs_frag - frag]++;
for (i = frag; i < sblock.fs_frag; i++)
- setbit(acg.cg_free, d + i);
+ setbit(cg_blksfree(&acg), d + i);
}
wtfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize,
(char *)&acg);
/*
* Allocate an inode on the disk
*/
-iput(ip)
- register struct inode *ip;
+iput(ip, ino)
+ register struct dinode *ip;
+ register ino_t ino;
{
struct dinode buf[MAXINOPB];
daddr_t d;
int c;
- c = itog(&sblock, ip->i_number);
+ c = itog(&sblock, ino);
rdfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize,
(char *)&acg);
if (acg.cg_magic != CG_MAGIC) {
printf("cg 0: bad magic number\n");
- exit(1);
+ exit(31);
}
acg.cg_cs.cs_nifree--;
- setbit(acg.cg_iused, ip->i_number);
+ setbit(cg_inosused(&acg), ino);
wtfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize,
(char *)&acg);
sblock.fs_cstotal.cs_nifree--;
fscs[0].cs_nifree--;
- if(ip->i_number >= sblock.fs_ipg * sblock.fs_ncg) {
- printf("fsinit: inode value out of range (%d).\n",
- ip->i_number);
- exit(1);
+ if (ino >= sblock.fs_ipg * sblock.fs_ncg) {
+ printf("fsinit: inode value out of range (%d).\n", ino);
+ exit(32);
}
- d = fsbtodb(&sblock, itod(&sblock, ip->i_number));
+ d = fsbtodb(&sblock, itod(&sblock, ino));
rdfs(d, sblock.fs_bsize, buf);
- buf[itoo(&sblock, ip->i_number)].di_ic = ip->i_ic;
+ buf[itoo(&sblock, ino)] = *ip;
wtfs(d, sblock.fs_bsize, buf);
}
+/*
+ * Notify parent process that the filesystem has created itself successfully.
+ */
+void
+started()
+{
+
+ exit(0);
+}
+
+/*
+ * Replace libc function with one suited to our needs.
+ */
+caddr_t
+malloc(size)
+ register u_long size;
+{
+ u_long base, i;
+ static u_long pgsz;
+ struct rlimit rlp;
+
+ if (pgsz == 0) {
+ base = sbrk(0);
+ pgsz = getpagesize() - 1;
+ i = (base + pgsz) &~ pgsz;
+ base = sbrk(i - base);
+ if (getrlimit(RLIMIT_DATA, &rlp) < 0)
+ perror("getrlimit");
+ rlp.rlim_cur = rlp.rlim_max;
+ if (setrlimit(RLIMIT_DATA, &rlp) < 0)
+ perror("setrlimit");
+ memleft = rlp.rlim_max - base;
+ }
+ size = (size + pgsz) &~ pgsz;
+ if (size > memleft)
+ size = memleft;
+ memleft -= size;
+ if (size == 0)
+ return (0);
+ return ((caddr_t)sbrk(size));
+}
+
+/*
+ * Replace libc function with one suited to our needs.
+ */
+caddr_t
+realloc(ptr, size)
+ char *ptr;
+ u_long size;
+{
+
+ /* always fail for now */
+ return ((caddr_t)0);
+}
+
+/*
+ * Replace libc function with one suited to our needs.
+ */
+char *
+calloc(size, numelm)
+ u_long size, numelm;
+{
+ caddr_t base;
+
+ size *= numelm;
+ base = malloc(size);
+ bzero(base, size);
+ return (base);
+}
+
+/*
+ * Replace libc function with one suited to our needs.
+ */
+free(ptr)
+ char *ptr;
+{
+
+ /* do not worry about it for now */
+}
+
/*
* read a block from the file system
*/
{
int n;
- if (lseek(fsi, bno * DEV_BSIZE, 0) < 0) {
+ if (mfs) {
+ bcopy(membase + bno * sectorsize, bf, size);
+ return;
+ }
+ if (lseek(fsi, bno * sectorsize, 0) < 0) {
printf("seek error: %ld\n", bno);
perror("rdfs");
- exit(1);
+ exit(33);
}
n = read(fsi, bf, size);
if(n != size) {
printf("read error: %ld\n", bno);
perror("rdfs");
- exit(1);
+ exit(34);
}
}
{
int n;
- lseek(fso, bno * DEV_BSIZE, 0);
- if (lseek(fso, bno * DEV_BSIZE, 0) < 0) {
+ if (mfs) {
+ bcopy(bf, membase + bno * sectorsize, size);
+ return;
+ }
+ if (Nflag)
+ return;
+ if (lseek(fso, bno * sectorsize, 0) < 0) {
printf("seek error: %ld\n", bno);
perror("wtfs");
- exit(1);
+ exit(35);
}
n = write(fso, bf, size);
if(n != size) {
- printf("write error: %D\n", bno);
+ printf("write error: %ld\n", bno);
perror("wtfs");
- exit(1);
+ exit(36);
}
}
-#ifndef STANDALONE
-/*
- * copy a block
- */
-bcopy(from, to, size)
- char *from, *to;
- int size;
-{
- asm(" movc3 12(ap),*4(ap),*8(ap)");
-}
-#endif
-
/*
* check if a block is available
*/
#else
fprintf(stderr, "isblock bad fs_frag %d\n", fs->fs_frag);
#endif
- return;
+ return (0);
}
}