1994-05-26 06:35:07 +00:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1980, 1989, 1993
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
* 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
|
1998-07-15 06:28:05 +00:00
|
|
|
#if 0
|
1997-03-11 12:48:17 +00:00
|
|
|
static char sccsid[] = "@(#)mkfs.c 8.11 (Berkeley) 5/3/95";
|
1998-07-15 06:28:05 +00:00
|
|
|
#endif
|
|
|
|
static const char rcsid[] =
|
1999-08-28 00:22:10 +00:00
|
|
|
"$FreeBSD$";
|
1994-05-26 06:35:07 +00:00
|
|
|
#endif /* not lint */
|
|
|
|
|
1998-07-15 06:28:05 +00:00
|
|
|
#include <err.h>
|
|
|
|
#include <signal.h>
|
2002-03-19 16:47:20 +00:00
|
|
|
#include <stdlib.h>
|
1998-07-15 06:28:05 +00:00
|
|
|
#include <string.h>
|
|
|
|
#include <stdio.h>
|
1994-05-26 06:35:07 +00:00
|
|
|
#include <unistd.h>
|
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/time.h>
|
1998-07-15 06:28:05 +00:00
|
|
|
#include <sys/types.h>
|
1994-05-26 06:35:07 +00:00
|
|
|
#include <sys/wait.h>
|
|
|
|
#include <sys/resource.h>
|
1999-02-09 17:19:19 +00:00
|
|
|
#include <sys/stat.h>
|
1994-05-26 06:35:07 +00:00
|
|
|
#include <ufs/ufs/dinode.h>
|
|
|
|
#include <ufs/ufs/dir.h>
|
|
|
|
#include <ufs/ffs/fs.h>
|
|
|
|
#include <sys/disklabel.h>
|
1994-10-12 22:04:36 +00:00
|
|
|
#include <sys/file.h>
|
|
|
|
#include <sys/mman.h>
|
1996-01-25 23:44:32 +00:00
|
|
|
#include <sys/ioctl.h>
|
1994-05-26 06:35:07 +00:00
|
|
|
|
1998-07-15 06:28:05 +00:00
|
|
|
#ifdef FSIRAND
|
2002-03-17 09:01:41 +00:00
|
|
|
extern long random (void);
|
|
|
|
extern void srandomdev (void);
|
1994-05-26 06:35:07 +00:00
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* make file system for cylinder-group style file systems
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* 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 Nflag; /* run mkfs without writing file system */
|
|
|
|
extern int Oflag; /* format as an 4.3BSD file system */
|
2001-04-02 01:25:55 +00:00
|
|
|
extern int Uflag; /* enable soft updates for file system */
|
1994-05-26 06:35:07 +00:00
|
|
|
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 */
|
1996-12-01 11:25:38 +00:00
|
|
|
extern int realsectorsize; /* bytes/sector in hardware*/
|
1994-05-26 06:35:07 +00:00
|
|
|
extern int rpm; /* revolutions/minute of drive */
|
|
|
|
extern int interleave; /* hardware sector interleave */
|
|
|
|
extern int trackskew; /* sector 0 skew, per track */
|
|
|
|
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 */
|
Directory layout preference improvements from Grigoriy Orlov <gluk@ptci.ru>.
His description of the problem and solution follow. My own tests show
speedups on typical filesystem intensive workloads of 5% to 12% which
is very impressive considering the small amount of code change involved.
------
One day I noticed that some file operations run much faster on
small file systems then on big ones. I've looked at the ffs
algorithms, thought about them, and redesigned the dirpref algorithm.
First I want to describe the results of my tests. These results are old
and I have improved the algorithm after these tests were done. Nevertheless
they show how big the perfomance speedup may be. I have done two file/directory
intensive tests on a two OpenBSD systems with old and new dirpref algorithm.
The first test is "tar -xzf ports.tar.gz", the second is "rm -rf ports".
The ports.tar.gz file is the ports collection from the OpenBSD 2.8 release.
It contains 6596 directories and 13868 files. The test systems are:
1. Celeron-450, 128Mb, two IDE drives, the system at wd0, file system for
test is at wd1. Size of test file system is 8 Gb, number of cg=991,
size of cg is 8m, block size = 8k, fragment size = 1k OpenBSD-current
from Dec 2000 with BUFCACHEPERCENT=35
2. PIII-600, 128Mb, two IBM DTLA-307045 IDE drives at i815e, the system
at wd0, file system for test is at wd1. Size of test file system is 40 Gb,
number of cg=5324, size of cg is 8m, block size = 8k, fragment size = 1k
OpenBSD-current from Dec 2000 with BUFCACHEPERCENT=50
You can get more info about the test systems and methods at:
http://www.ptci.ru/gluk/dirpref/old/dirpref.html
Test Results
tar -xzf ports.tar.gz rm -rf ports
mode old dirpref new dirpref speedup old dirprefnew dirpref speedup
First system
normal 667 472 1.41 477 331 1.44
async 285 144 1.98 130 14 9.29
sync 768 616 1.25 477 334 1.43
softdep 413 252 1.64 241 38 6.34
Second system
normal 329 81 4.06 263.5 93.5 2.81
async 302 25.7 11.75 112 2.26 49.56
sync 281 57.0 4.93 263 90.5 2.9
softdep 341 40.6 8.4 284 4.76 59.66
"old dirpref" and "new dirpref" columns give a test time in seconds.
speedup - speed increasement in times, ie. old dirpref / new dirpref.
------
Algorithm description
The old dirpref algorithm is described in comments:
/*
* Find a cylinder to place a directory.
*
* The policy implemented by this algorithm is to select from
* among those cylinder groups with above the average number of
* free inodes, the one with the smallest number of directories.
*/
A new directory is allocated in a different cylinder groups than its
parent directory resulting in a directory tree that is spreaded across
all the cylinder groups. This spreading out results in a non-optimal
access to the directories and files. When we have a small filesystem
it is not a problem but when the filesystem is big then perfomance
degradation becomes very apparent.
What I mean by a big file system ?
1. A big filesystem is a filesystem which occupy 20-30 or more percent
of total drive space, i.e. first and last cylinder are physically
located relatively far from each other.
2. It has a relatively large number of cylinder groups, for example
more cylinder groups than 50% of the buffers in the buffer cache.
The first results in long access times, while the second results in
many buffers being used by metadata operations. Such operations use
cylinder group blocks and on-disk inode blocks. The cylinder group
block (fs->fs_cblkno) contains struct cg, inode and block bit maps.
It is 2k in size for the default filesystem parameters. If new and
parent directories are located in different cylinder groups then the
system performs more input/output operations and uses more buffers.
On filesystems with many cylinder groups, lots of cache buffers are
used for metadata operations.
My solution for this problem is very simple. I allocate many directories
in one cylinder group. I also do some things, so that the new allocation
method does not cause excessive fragmentation and all directory inodes
will not be located at a location far from its file's inodes and data.
The algorithm is:
/*
* Find a cylinder group to place a directory.
*
* The policy implemented by this algorithm is to allocate a
* directory inode in the same cylinder group as its parent
* directory, but also to reserve space for its files inodes
* and data. Restrict the number of directories which may be
* allocated one after another in the same cylinder group
* without intervening allocation of files.
*
* If we allocate a first level directory then force allocation
* in another cylinder group.
*/
My early versions of dirpref give me a good results for a wide range of
file operations and different filesystem capacities except one case:
those applications that create their entire directory structure first
and only later fill this structure with files.
My solution for such and similar cases is to limit a number of
directories which may be created one after another in the same cylinder
group without intervening file creations. For this purpose, I allocate
an array of counters at mount time. This array is linked to the superblock
fs->fs_contigdirs[cg]. Each time a directory is created the counter
increases and each time a file is created the counter decreases. A 60Gb
filesystem with 8mb/cg requires 10kb of memory for the counters array.
The maxcontigdirs is a maximum number of directories which may be created
without an intervening file creation. I found in my tests that the best
performance occurs when I restrict the number of directories in one cylinder
group such that all its files may be located in the same cylinder group.
There may be some deterioration in performance if all the file inodes
are in the same cylinder group as its containing directory, but their
data partially resides in a different cylinder group. The maxcontigdirs
value is calculated to try to prevent this condition. Since there is
no way to know how many files and directories will be allocated later
I added two optimization parameters in superblock/tunefs. They are:
int32_t fs_avgfilesize; /* expected average file size */
int32_t fs_avgfpdir; /* expected # of files per directory */
These parameters have reasonable defaults but may be tweeked for special
uses of a filesystem. They are only necessary in rare cases like better
tuning a filesystem being used to store a squid cache.
I have been using this algorithm for about 3 months. I have done
a lot of testing on filesystems with different capacities, average
filesize, average number of files per directory, and so on. I think
this algorithm has no negative impact on filesystem perfomance. It
works better than the default one in all cases. The new dirpref
will greatly improve untarring/removing/coping of big directories,
decrease load on cvs servers and much more. The new dirpref doesn't
speedup a compilation process, but also doesn't slow it down.
Obtained from: Grigoriy Orlov <gluk@ptci.ru>
2001-04-10 08:38:59 +00:00
|
|
|
extern int avgfilesize; /* expected average file size */
|
|
|
|
extern int avgfilesperdir; /* expected number of files per directory */
|
1994-05-26 06:35:07 +00:00
|
|
|
|
|
|
|
union {
|
|
|
|
struct fs fs;
|
|
|
|
char pad[SBSIZE];
|
|
|
|
} fsun;
|
|
|
|
#define sblock fsun.fs
|
|
|
|
struct csum *fscs;
|
|
|
|
|
|
|
|
union {
|
|
|
|
struct cg cg;
|
|
|
|
char pad[MAXBSIZE];
|
|
|
|
} cgun;
|
|
|
|
#define acg cgun.cg
|
|
|
|
|
|
|
|
struct dinode zino[MAXBSIZE / sizeof(struct dinode)];
|
|
|
|
|
1997-03-24 15:43:36 +00:00
|
|
|
int fsi, fso;
|
1997-03-23 20:08:22 +00:00
|
|
|
#ifdef FSIRAND
|
1997-03-24 15:43:36 +00:00
|
|
|
int randinit;
|
1997-03-23 20:08:22 +00:00
|
|
|
#endif
|
1994-05-26 06:35:07 +00:00
|
|
|
daddr_t alloc();
|
1997-03-11 12:48:17 +00:00
|
|
|
long calcipg();
|
1997-07-13 15:13:07 +00:00
|
|
|
static int charsperline();
|
2002-03-17 09:01:41 +00:00
|
|
|
void clrblock (struct fs *, unsigned char *, int);
|
|
|
|
void fsinit (time_t);
|
|
|
|
void initcg (int, time_t);
|
|
|
|
int isblock (struct fs *, unsigned char *, int);
|
|
|
|
void iput (struct dinode *, ino_t);
|
|
|
|
int makedir (struct direct *, int);
|
|
|
|
void rdfs (daddr_t, int, char *);
|
|
|
|
void setblock (struct fs *, unsigned char *, int);
|
|
|
|
void wtfs (daddr_t, int, char *);
|
|
|
|
void wtfsflush (void);
|
1994-05-26 06:35:07 +00:00
|
|
|
|
1998-07-15 06:28:05 +00:00
|
|
|
void
|
1994-05-26 06:35:07 +00:00
|
|
|
mkfs(pp, fsys, fi, fo)
|
|
|
|
struct partition *pp;
|
|
|
|
char *fsys;
|
|
|
|
int fi, fo;
|
|
|
|
{
|
2002-03-17 09:01:41 +00:00
|
|
|
long i, mincpc, mincpg, inospercg;
|
1994-05-26 06:35:07 +00:00
|
|
|
long cylno, rpos, blk, j, warn = 0;
|
|
|
|
long used, mincpgcnt, bpcg;
|
1997-03-11 12:48:17 +00:00
|
|
|
off_t usedb;
|
1994-05-26 06:35:07 +00:00
|
|
|
long mapcramped, inodecramped;
|
|
|
|
long postblsize, rotblsize, totalsbsize;
|
|
|
|
time_t utime;
|
|
|
|
quad_t sizepb;
|
1996-01-30 23:14:34 +00:00
|
|
|
int width;
|
|
|
|
char tmpbuf[100]; /* XXX this will break in about 2,500 years */
|
1994-05-26 06:35:07 +00:00
|
|
|
|
|
|
|
time(&utime);
|
1997-03-24 15:43:36 +00:00
|
|
|
#ifdef FSIRAND
|
|
|
|
if (!randinit) {
|
|
|
|
randinit = 1;
|
1997-06-14 00:17:53 +00:00
|
|
|
srandomdev();
|
1997-03-24 15:43:36 +00:00
|
|
|
}
|
1994-05-26 06:35:07 +00:00
|
|
|
#endif
|
|
|
|
fsi = fi;
|
|
|
|
fso = fo;
|
|
|
|
if (Oflag) {
|
|
|
|
sblock.fs_inodefmt = FS_42INODEFMT;
|
|
|
|
sblock.fs_maxsymlinklen = 0;
|
|
|
|
} else {
|
|
|
|
sblock.fs_inodefmt = FS_44INODEFMT;
|
|
|
|
sblock.fs_maxsymlinklen = MAXSYMLINKLEN;
|
|
|
|
}
|
2001-04-03 09:35:36 +00:00
|
|
|
if (Uflag)
|
2001-04-02 01:25:55 +00:00
|
|
|
sblock.fs_flags |= FS_DOSOFTDEP;
|
1994-05-26 06:35:07 +00:00
|
|
|
/*
|
|
|
|
* 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(13);
|
1996-12-01 11:25:38 +00:00
|
|
|
wtfs(fssize - (realsectorsize / DEV_BSIZE), realsectorsize,
|
2002-03-18 02:43:14 +00:00
|
|
|
(char *)&sblock);
|
1994-05-26 06:35:07 +00:00
|
|
|
/*
|
|
|
|
* collect and verify the sector and track info
|
|
|
|
*/
|
|
|
|
sblock.fs_nsect = nsectors;
|
|
|
|
sblock.fs_ntrak = ntracks;
|
|
|
|
if (sblock.fs_ntrak <= 0)
|
|
|
|
printf("preposterous ntrak %d\n", sblock.fs_ntrak), exit(14);
|
|
|
|
if (sblock.fs_nsect <= 0)
|
|
|
|
printf("preposterous nsect %d\n", sblock.fs_nsect), exit(15);
|
Directory layout preference improvements from Grigoriy Orlov <gluk@ptci.ru>.
His description of the problem and solution follow. My own tests show
speedups on typical filesystem intensive workloads of 5% to 12% which
is very impressive considering the small amount of code change involved.
------
One day I noticed that some file operations run much faster on
small file systems then on big ones. I've looked at the ffs
algorithms, thought about them, and redesigned the dirpref algorithm.
First I want to describe the results of my tests. These results are old
and I have improved the algorithm after these tests were done. Nevertheless
they show how big the perfomance speedup may be. I have done two file/directory
intensive tests on a two OpenBSD systems with old and new dirpref algorithm.
The first test is "tar -xzf ports.tar.gz", the second is "rm -rf ports".
The ports.tar.gz file is the ports collection from the OpenBSD 2.8 release.
It contains 6596 directories and 13868 files. The test systems are:
1. Celeron-450, 128Mb, two IDE drives, the system at wd0, file system for
test is at wd1. Size of test file system is 8 Gb, number of cg=991,
size of cg is 8m, block size = 8k, fragment size = 1k OpenBSD-current
from Dec 2000 with BUFCACHEPERCENT=35
2. PIII-600, 128Mb, two IBM DTLA-307045 IDE drives at i815e, the system
at wd0, file system for test is at wd1. Size of test file system is 40 Gb,
number of cg=5324, size of cg is 8m, block size = 8k, fragment size = 1k
OpenBSD-current from Dec 2000 with BUFCACHEPERCENT=50
You can get more info about the test systems and methods at:
http://www.ptci.ru/gluk/dirpref/old/dirpref.html
Test Results
tar -xzf ports.tar.gz rm -rf ports
mode old dirpref new dirpref speedup old dirprefnew dirpref speedup
First system
normal 667 472 1.41 477 331 1.44
async 285 144 1.98 130 14 9.29
sync 768 616 1.25 477 334 1.43
softdep 413 252 1.64 241 38 6.34
Second system
normal 329 81 4.06 263.5 93.5 2.81
async 302 25.7 11.75 112 2.26 49.56
sync 281 57.0 4.93 263 90.5 2.9
softdep 341 40.6 8.4 284 4.76 59.66
"old dirpref" and "new dirpref" columns give a test time in seconds.
speedup - speed increasement in times, ie. old dirpref / new dirpref.
------
Algorithm description
The old dirpref algorithm is described in comments:
/*
* Find a cylinder to place a directory.
*
* The policy implemented by this algorithm is to select from
* among those cylinder groups with above the average number of
* free inodes, the one with the smallest number of directories.
*/
A new directory is allocated in a different cylinder groups than its
parent directory resulting in a directory tree that is spreaded across
all the cylinder groups. This spreading out results in a non-optimal
access to the directories and files. When we have a small filesystem
it is not a problem but when the filesystem is big then perfomance
degradation becomes very apparent.
What I mean by a big file system ?
1. A big filesystem is a filesystem which occupy 20-30 or more percent
of total drive space, i.e. first and last cylinder are physically
located relatively far from each other.
2. It has a relatively large number of cylinder groups, for example
more cylinder groups than 50% of the buffers in the buffer cache.
The first results in long access times, while the second results in
many buffers being used by metadata operations. Such operations use
cylinder group blocks and on-disk inode blocks. The cylinder group
block (fs->fs_cblkno) contains struct cg, inode and block bit maps.
It is 2k in size for the default filesystem parameters. If new and
parent directories are located in different cylinder groups then the
system performs more input/output operations and uses more buffers.
On filesystems with many cylinder groups, lots of cache buffers are
used for metadata operations.
My solution for this problem is very simple. I allocate many directories
in one cylinder group. I also do some things, so that the new allocation
method does not cause excessive fragmentation and all directory inodes
will not be located at a location far from its file's inodes and data.
The algorithm is:
/*
* Find a cylinder group to place a directory.
*
* The policy implemented by this algorithm is to allocate a
* directory inode in the same cylinder group as its parent
* directory, but also to reserve space for its files inodes
* and data. Restrict the number of directories which may be
* allocated one after another in the same cylinder group
* without intervening allocation of files.
*
* If we allocate a first level directory then force allocation
* in another cylinder group.
*/
My early versions of dirpref give me a good results for a wide range of
file operations and different filesystem capacities except one case:
those applications that create their entire directory structure first
and only later fill this structure with files.
My solution for such and similar cases is to limit a number of
directories which may be created one after another in the same cylinder
group without intervening file creations. For this purpose, I allocate
an array of counters at mount time. This array is linked to the superblock
fs->fs_contigdirs[cg]. Each time a directory is created the counter
increases and each time a file is created the counter decreases. A 60Gb
filesystem with 8mb/cg requires 10kb of memory for the counters array.
The maxcontigdirs is a maximum number of directories which may be created
without an intervening file creation. I found in my tests that the best
performance occurs when I restrict the number of directories in one cylinder
group such that all its files may be located in the same cylinder group.
There may be some deterioration in performance if all the file inodes
are in the same cylinder group as its containing directory, but their
data partially resides in a different cylinder group. The maxcontigdirs
value is calculated to try to prevent this condition. Since there is
no way to know how many files and directories will be allocated later
I added two optimization parameters in superblock/tunefs. They are:
int32_t fs_avgfilesize; /* expected average file size */
int32_t fs_avgfpdir; /* expected # of files per directory */
These parameters have reasonable defaults but may be tweeked for special
uses of a filesystem. They are only necessary in rare cases like better
tuning a filesystem being used to store a squid cache.
I have been using this algorithm for about 3 months. I have done
a lot of testing on filesystems with different capacities, average
filesize, average number of files per directory, and so on. I think
this algorithm has no negative impact on filesystem perfomance. It
works better than the default one in all cases. The new dirpref
will greatly improve untarring/removing/coping of big directories,
decrease load on cvs servers and much more. The new dirpref doesn't
speedup a compilation process, but also doesn't slow it down.
Obtained from: Grigoriy Orlov <gluk@ptci.ru>
2001-04-10 08:38:59 +00:00
|
|
|
/*
|
|
|
|
* collect and verify the filesystem density info
|
|
|
|
*/
|
|
|
|
sblock.fs_avgfilesize = avgfilesize;
|
|
|
|
sblock.fs_avgfpdir = avgfilesperdir;
|
|
|
|
if (sblock.fs_avgfilesize <= 0)
|
|
|
|
printf("illegal expected average file size %d\n",
|
|
|
|
sblock.fs_avgfilesize), exit(14);
|
|
|
|
if (sblock.fs_avgfpdir <= 0)
|
|
|
|
printf("illegal expected number of files per directory %d\n",
|
|
|
|
sblock.fs_avgfpdir), exit(15);
|
1994-05-26 06:35:07 +00:00
|
|
|
/*
|
|
|
|
* collect and verify the block and fragment sizes
|
|
|
|
*/
|
|
|
|
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(16);
|
|
|
|
}
|
|
|
|
if (!POWEROF2(sblock.fs_fsize)) {
|
|
|
|
printf("fragment size must be a power of 2, not %d\n",
|
|
|
|
sblock.fs_fsize);
|
|
|
|
exit(17);
|
|
|
|
}
|
|
|
|
if (sblock.fs_fsize < sectorsize) {
|
|
|
|
printf("fragment size %d is too small, minimum is %d\n",
|
|
|
|
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(19);
|
|
|
|
}
|
|
|
|
if (sblock.fs_bsize < sblock.fs_fsize) {
|
2002-03-18 02:43:14 +00:00
|
|
|
printf(
|
|
|
|
"block size (%d) cannot be smaller than fragment size (%d)\n",
|
|
|
|
sblock.fs_bsize, sblock.fs_fsize);
|
1994-05-26 06:35:07 +00:00
|
|
|
exit(20);
|
|
|
|
}
|
|
|
|
sblock.fs_bmask = ~(sblock.fs_bsize - 1);
|
|
|
|
sblock.fs_fmask = ~(sblock.fs_fsize - 1);
|
|
|
|
sblock.fs_qbmask = ~sblock.fs_bmask;
|
|
|
|
sblock.fs_qfmask = ~sblock.fs_fmask;
|
|
|
|
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) {
|
2002-03-18 02:43:14 +00:00
|
|
|
printf(
|
|
|
|
"fragment size %d is too small, minimum with block size %d is %d\n",
|
|
|
|
sblock.fs_fsize, sblock.fs_bsize,
|
1994-05-26 06:35:07 +00:00
|
|
|
sblock.fs_bsize / MAXFRAG);
|
|
|
|
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);
|
|
|
|
sblock.fs_cblkno = (daddr_t)(sblock.fs_sblkno +
|
|
|
|
roundup(howmany(sbsize, sblock.fs_fsize), sblock.fs_frag));
|
|
|
|
sblock.fs_iblkno = sblock.fs_cblkno + sblock.fs_frag;
|
2001-11-02 09:23:34 +00:00
|
|
|
sblock.fs_cgoffset =
|
|
|
|
roundup(howmany(sblock.fs_nsect, NSPF(&sblock)), sblock.fs_frag);
|
1994-05-26 06:35:07 +00:00
|
|
|
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;
|
|
|
|
sblock.fs_maxfilesize = sblock.fs_bsize * NDADDR - 1;
|
|
|
|
for (sizepb = sblock.fs_bsize, i = 0; i < NIADDR; i++) {
|
|
|
|
sizepb *= NINDIR(&sblock);
|
|
|
|
sblock.fs_maxfilesize += sizepb;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* 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 */;
|
|
|
|
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);
|
|
|
|
/*
|
|
|
|
* Ensure that cylinder group with mincpg has enough space
|
|
|
|
* for block maps.
|
|
|
|
*/
|
|
|
|
sblock.fs_cpg = mincpg;
|
|
|
|
sblock.fs_ipg = inospercg;
|
|
|
|
if (maxcontig > 1)
|
|
|
|
sblock.fs_contigsumsize = MIN(maxcontig, FS_MAXCONTIG);
|
|
|
|
mapcramped = 0;
|
|
|
|
while (CGSIZE(&sblock) > sblock.fs_bsize) {
|
|
|
|
mapcramped = 1;
|
|
|
|
if (sblock.fs_bsize < MAXBSIZE) {
|
|
|
|
sblock.fs_bsize <<= 1;
|
2001-11-02 09:23:34 +00:00
|
|
|
if ((i & 1) == 0)
|
1994-05-26 06:35:07 +00:00
|
|
|
i >>= 1;
|
2001-11-02 09:23:34 +00:00
|
|
|
else {
|
1994-05-26 06:35:07 +00:00
|
|
|
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;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Ensure that cylinder group with mincpg has enough space for inodes.
|
|
|
|
*/
|
|
|
|
inodecramped = 0;
|
1997-03-11 12:48:17 +00:00
|
|
|
inospercg = calcipg(mincpg, bpcg, &usedb);
|
1994-05-26 06:35:07 +00:00
|
|
|
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,
|
2001-11-02 09:23:34 +00:00
|
|
|
"minimum bytes per inode is",
|
|
|
|
(int)((mincpg * (off_t)bpcg - usedb) /
|
|
|
|
MAXIPG(&sblock) + 1));
|
1994-05-26 06:35:07 +00:00
|
|
|
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;
|
1997-03-11 12:48:17 +00:00
|
|
|
inospercg = calcipg(mincpg, bpcg, &usedb);
|
1994-05-26 06:35:07 +00:00
|
|
|
sblock.fs_ipg = inospercg;
|
|
|
|
}
|
|
|
|
if (inodecramped) {
|
|
|
|
if (inospercg > MAXIPG(&sblock)) {
|
|
|
|
printf("Minimum bytes per inode is %d\n",
|
2001-11-02 09:23:34 +00:00
|
|
|
(int)((mincpg * (off_t)bpcg - usedb) /
|
|
|
|
MAXIPG(&sblock) + 1));
|
1994-05-26 06:35:07 +00:00
|
|
|
} else if (!mapcramped) {
|
|
|
|
printf("With %d bytes per inode, ", density);
|
1998-06-28 20:11:23 +00:00
|
|
|
printf("minimum cylinders per group is %ld\n", mincpg);
|
1994-05-26 06:35:07 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
if (mapcramped) {
|
|
|
|
printf("With %d sectors per cylinder, ", sblock.fs_spc);
|
1998-06-28 20:11:23 +00:00
|
|
|
printf("minimum cylinders per group is %ld\n", mincpg);
|
1994-05-26 06:35:07 +00:00
|
|
|
}
|
|
|
|
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",
|
2001-11-02 09:23:34 +00:00
|
|
|
"and the fragment size", fsize, sblock.fs_fsize);
|
1994-05-26 06:35:07 +00:00
|
|
|
exit(23);
|
|
|
|
}
|
1995-05-30 06:12:45 +00:00
|
|
|
/*
|
1994-05-26 06:35:07 +00:00
|
|
|
* Calculate the number of cylinders per group
|
|
|
|
*/
|
|
|
|
sblock.fs_cpg = cpg;
|
|
|
|
if (sblock.fs_cpg % mincpc != 0) {
|
1998-06-28 20:11:23 +00:00
|
|
|
printf("%s groups must have a multiple of %ld cylinders\n",
|
2001-11-02 09:23:34 +00:00
|
|
|
cpgflg ? "Cylinder" : "Warning: cylinder", mincpc);
|
1994-05-26 06:35:07 +00:00
|
|
|
sblock.fs_cpg = roundup(sblock.fs_cpg, mincpc);
|
|
|
|
if (!cpgflg)
|
|
|
|
cpg = sblock.fs_cpg;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Must ensure there is enough space for inodes.
|
|
|
|
*/
|
1997-03-11 12:48:17 +00:00
|
|
|
sblock.fs_ipg = calcipg(sblock.fs_cpg, bpcg, &usedb);
|
1994-05-26 06:35:07 +00:00
|
|
|
while (sblock.fs_ipg > MAXIPG(&sblock)) {
|
|
|
|
inodecramped = 1;
|
|
|
|
sblock.fs_cpg -= mincpc;
|
1997-03-11 12:48:17 +00:00
|
|
|
sblock.fs_ipg = calcipg(sblock.fs_cpg, bpcg, &usedb);
|
1994-05-26 06:35:07 +00:00
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Must ensure there is enough space to hold block map.
|
|
|
|
*/
|
|
|
|
while (CGSIZE(&sblock) > sblock.fs_bsize) {
|
|
|
|
mapcramped = 1;
|
|
|
|
sblock.fs_cpg -= mincpc;
|
1997-03-11 12:48:17 +00:00
|
|
|
sblock.fs_ipg = calcipg(sblock.fs_cpg, bpcg, &usedb);
|
1994-05-26 06:35:07 +00:00
|
|
|
}
|
|
|
|
sblock.fs_fpg = (sblock.fs_cpg * sblock.fs_spc) / NSPF(&sblock);
|
|
|
|
if ((sblock.fs_cpg * sblock.fs_spc) % NSPB(&sblock) != 0) {
|
1998-06-28 20:11:23 +00:00
|
|
|
printf("panic (fs_cpg * fs_spc) %% NSPF != 0");
|
1994-05-26 06:35:07 +00:00
|
|
|
exit(24);
|
|
|
|
}
|
|
|
|
if (sblock.fs_cpg < mincpg) {
|
1998-06-28 20:11:23 +00:00
|
|
|
printf("cylinder groups must have at least %ld cylinders\n",
|
1994-05-26 06:35:07 +00:00
|
|
|
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.
|
|
|
|
*/
|
|
|
|
sblock.fs_size = fssize = dbtofsb(&sblock, fssize);
|
|
|
|
sblock.fs_ncyl = fssize * NSPF(&sblock) / sblock.fs_spc;
|
|
|
|
if (fssize * NSPF(&sblock) > sblock.fs_ncyl * sblock.fs_spc) {
|
|
|
|
sblock.fs_ncyl++;
|
|
|
|
warn = 1;
|
|
|
|
}
|
|
|
|
if (sblock.fs_ncyl < 1) {
|
|
|
|
printf("file systems must have at least one cylinder\n");
|
|
|
|
exit(28);
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* 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));
|
1998-01-19 16:55:26 +00:00
|
|
|
if (sblock.fs_sbsize > SBSIZE)
|
|
|
|
sblock.fs_sbsize = SBSIZE;
|
1994-10-09 20:10:56 +00:00
|
|
|
if (sblock.fs_ntrak == 1) {
|
1994-05-26 06:35:07 +00:00
|
|
|
sblock.fs_cpc = 0;
|
|
|
|
goto next;
|
|
|
|
}
|
1998-08-27 07:38:33 +00:00
|
|
|
postblsize = sblock.fs_nrpos * sblock.fs_cpc * sizeof(int16_t);
|
1994-05-26 06:35:07 +00:00
|
|
|
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]) -
|
1997-03-11 12:48:17 +00:00
|
|
|
(char *)(&sblock.fs_firstfield);
|
1994-05-26 06:35:07 +00:00
|
|
|
sblock.fs_rotbloff = &sblock.fs_space[0] -
|
1997-03-11 12:48:17 +00:00
|
|
|
(u_char *)(&sblock.fs_firstfield);
|
1994-05-26 06:35:07 +00:00
|
|
|
} else {
|
|
|
|
/* use dynamic table space */
|
|
|
|
sblock.fs_postbloff = &sblock.fs_space[0] -
|
1997-03-11 12:48:17 +00:00
|
|
|
(u_char *)(&sblock.fs_firstfield);
|
1994-05-26 06:35:07 +00:00
|
|
|
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 impaired.\n");
|
|
|
|
sblock.fs_cpc = 0;
|
|
|
|
goto next;
|
|
|
|
}
|
|
|
|
sblock.fs_sbsize = fragroundup(&sblock, totalsbsize);
|
1998-01-19 16:55:26 +00:00
|
|
|
if (sblock.fs_sbsize > SBSIZE)
|
|
|
|
sblock.fs_sbsize = SBSIZE;
|
1994-05-26 06:35:07 +00:00
|
|
|
/*
|
|
|
|
* calculate the available blocks for each rotational position
|
|
|
|
*/
|
|
|
|
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 = fragstoblks(&sblock, i);
|
|
|
|
if (fs_postbl(&sblock, cylno)[rpos] == -1)
|
|
|
|
fs_rotbl(&sblock)[blk] = 0;
|
|
|
|
else
|
|
|
|
fs_rotbl(&sblock)[blk] =
|
|
|
|
fs_postbl(&sblock, cylno)[rpos] - blk;
|
|
|
|
fs_postbl(&sblock, cylno)[rpos] = blk;
|
|
|
|
}
|
|
|
|
next:
|
|
|
|
/*
|
|
|
|
* 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++;
|
|
|
|
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) {
|
1998-06-28 20:11:23 +00:00
|
|
|
printf("inode blocks/cyl group (%ld) >= data blocks (%ld)\n",
|
1994-05-26 06:35:07 +00:00
|
|
|
cgdmin(&sblock, i) - cgbase(&sblock, i) / sblock.fs_frag,
|
1998-06-28 20:11:23 +00:00
|
|
|
(long)(sblock.fs_fpg / sblock.fs_frag));
|
1994-05-26 06:35:07 +00:00
|
|
|
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);
|
|
|
|
}
|
2002-03-18 02:43:14 +00:00
|
|
|
printf(
|
|
|
|
"Warning: inode blocks/cyl group (%ld) >= data blocks (%ld) in last\n",
|
1994-05-26 06:35:07 +00:00
|
|
|
(cgdmin(&sblock, j) - cgbase(&sblock, j)) / sblock.fs_frag,
|
|
|
|
i / sblock.fs_frag);
|
2002-03-18 02:43:14 +00:00
|
|
|
printf(
|
|
|
|
" cylinder group. This implies %ld sector(s) cannot be allocated.\n",
|
|
|
|
i * NSPF(&sblock));
|
1994-05-26 06:35:07 +00:00
|
|
|
sblock.fs_ncg--;
|
|
|
|
sblock.fs_ncyl -= sblock.fs_ncyl % sblock.fs_cpg;
|
|
|
|
sblock.fs_size = fssize = sblock.fs_ncyl * sblock.fs_spc /
|
|
|
|
NSPF(&sblock);
|
|
|
|
warn = 0;
|
|
|
|
}
|
2001-05-29 19:40:39 +00:00
|
|
|
if (warn) {
|
1994-05-26 06:35:07 +00:00
|
|
|
printf("Warning: %d sector(s) in last cylinder unallocated\n",
|
|
|
|
sblock.fs_spc -
|
2001-11-02 09:23:34 +00:00
|
|
|
(fssize * NSPF(&sblock) - (sblock.fs_ncyl - 1) *
|
|
|
|
sblock.fs_spc));
|
1994-05-26 06:35:07 +00:00
|
|
|
}
|
|
|
|
/*
|
|
|
|
* fill in remaining fields of the super block
|
|
|
|
*/
|
|
|
|
sblock.fs_csaddr = cgdmin(&sblock, 0);
|
|
|
|
sblock.fs_cssize =
|
|
|
|
fragroundup(&sblock, sblock.fs_ncg * sizeof(struct csum));
|
2001-01-15 18:30:40 +00:00
|
|
|
/*
|
|
|
|
* The superblock fields 'fs_csmask' and 'fs_csshift' are no
|
|
|
|
* longer used. However, we still initialise them so that the
|
|
|
|
* filesystem remains compatible with old kernels.
|
|
|
|
*/
|
1994-05-26 06:35:07 +00:00
|
|
|
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);
|
1998-07-15 06:28:05 +00:00
|
|
|
if (fscs == NULL)
|
|
|
|
errx(31, "calloc failed");
|
1994-05-26 06:35:07 +00:00
|
|
|
sblock.fs_magic = FS_MAGIC;
|
|
|
|
sblock.fs_rotdelay = rotdelay;
|
|
|
|
sblock.fs_minfree = minfree;
|
|
|
|
sblock.fs_maxcontig = maxcontig;
|
|
|
|
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;
|
|
|
|
sblock.fs_cstotal.cs_nifree = 0;
|
|
|
|
sblock.fs_cstotal.cs_nffree = 0;
|
|
|
|
sblock.fs_fmod = 0;
|
|
|
|
sblock.fs_ronly = 0;
|
1994-08-26 10:41:13 +00:00
|
|
|
sblock.fs_clean = 1;
|
1997-03-23 20:08:22 +00:00
|
|
|
#ifdef FSIRAND
|
|
|
|
sblock.fs_id[0] = (long)utime;
|
1997-03-24 15:43:36 +00:00
|
|
|
sblock.fs_id[1] = random();
|
1997-03-23 20:08:22 +00:00
|
|
|
#endif
|
|
|
|
|
1994-05-26 06:35:07 +00:00
|
|
|
/*
|
|
|
|
* Dump out summary information about file system.
|
|
|
|
*/
|
2001-05-29 19:40:39 +00:00
|
|
|
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);
|
1994-05-26 06:35:07 +00:00
|
|
|
#define B2MBFACTOR (1 / (1024.0 * 1024.0))
|
2001-11-02 09:23:34 +00:00
|
|
|
printf("\t%.1fMB in %d cyl groups (%d c/g, %.2fMB/g, %d i/g)%s\n",
|
2001-05-29 19:40:39 +00:00
|
|
|
(float)sblock.fs_size * sblock.fs_fsize * B2MBFACTOR,
|
|
|
|
sblock.fs_ncg, sblock.fs_cpg,
|
|
|
|
(float)sblock.fs_fpg * sblock.fs_fsize * B2MBFACTOR,
|
|
|
|
sblock.fs_ipg,
|
|
|
|
sblock.fs_flags & FS_DOSOFTDEP ? " SOFTUPDATES" : "");
|
1994-05-26 06:35:07 +00:00
|
|
|
#undef B2MBFACTOR
|
|
|
|
/*
|
|
|
|
* Now build the cylinders group blocks and
|
|
|
|
* then print out indices of cylinder groups.
|
|
|
|
*/
|
2001-05-29 19:40:39 +00:00
|
|
|
printf("super-block backups (for fsck -b #) at:\n");
|
1996-01-30 23:14:34 +00:00
|
|
|
i = 0;
|
|
|
|
width = charsperline();
|
1994-05-26 06:35:07 +00:00
|
|
|
for (cylno = 0; cylno < sblock.fs_ncg; cylno++) {
|
|
|
|
initcg(cylno, utime);
|
2001-04-24 10:26:00 +00:00
|
|
|
j = snprintf(tmpbuf, sizeof(tmpbuf), " %ld%s",
|
1999-08-21 22:07:27 +00:00
|
|
|
fsbtodb(&sblock, cgsblock(&sblock, cylno)),
|
2001-11-02 09:23:34 +00:00
|
|
|
cylno < (sblock.fs_ncg-1) ? "," : "");
|
2001-08-20 14:53:05 +00:00
|
|
|
if (j < 0)
|
|
|
|
tmpbuf[j = 0] = '\0';
|
1998-06-28 20:11:23 +00:00
|
|
|
if (i + j >= width) {
|
1994-05-26 06:35:07 +00:00
|
|
|
printf("\n");
|
1996-01-30 23:14:34 +00:00
|
|
|
i = 0;
|
|
|
|
}
|
|
|
|
i += j;
|
|
|
|
printf("%s", tmpbuf);
|
1995-05-02 07:45:39 +00:00
|
|
|
fflush(stdout);
|
1994-05-26 06:35:07 +00:00
|
|
|
}
|
2001-05-29 19:40:39 +00:00
|
|
|
printf("\n");
|
|
|
|
if (Nflag)
|
1994-05-26 06:35:07 +00:00
|
|
|
exit(0);
|
|
|
|
/*
|
|
|
|
* Now construct the initial file system,
|
|
|
|
* then write out the super-block.
|
|
|
|
*/
|
|
|
|
fsinit(utime);
|
|
|
|
sblock.fs_time = utime;
|
|
|
|
wtfs((int)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 ?
|
2001-11-02 09:23:34 +00:00
|
|
|
sblock.fs_cssize - i : sblock.fs_bsize,
|
1994-05-26 06:35:07 +00:00
|
|
|
((char *)fscs) + i);
|
1995-05-30 06:12:45 +00:00
|
|
|
/*
|
1994-05-26 06:35:07 +00:00
|
|
|
* Write out the duplicate super blocks
|
|
|
|
*/
|
|
|
|
for (cylno = 0; cylno < sblock.fs_ncg; cylno++)
|
|
|
|
wtfs(fsbtodb(&sblock, cgsblock(&sblock, cylno)),
|
|
|
|
sbsize, (char *)&sblock);
|
2000-10-24 00:08:30 +00:00
|
|
|
wtfsflush();
|
1994-05-26 06:35:07 +00:00
|
|
|
/*
|
|
|
|
* 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;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Initialize a cylinder group.
|
|
|
|
*/
|
1998-07-15 06:28:05 +00:00
|
|
|
void
|
1994-05-26 06:35:07 +00:00
|
|
|
initcg(cylno, utime)
|
|
|
|
int cylno;
|
|
|
|
time_t utime;
|
|
|
|
{
|
|
|
|
daddr_t cbase, d, dlower, dupper, dmax, blkno;
|
1998-07-15 06:28:05 +00:00
|
|
|
long i;
|
2002-03-17 09:01:41 +00:00
|
|
|
struct csum *cs;
|
1998-07-15 06:28:05 +00:00
|
|
|
#ifdef FSIRAND
|
|
|
|
long j;
|
|
|
|
#endif
|
1994-05-26 06:35:07 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Determine block bounds for cylinder group.
|
|
|
|
* Allow space for super block summary information in first
|
|
|
|
* cylinder group.
|
|
|
|
*/
|
|
|
|
cbase = cgbase(&sblock, cylno);
|
|
|
|
dmax = cbase + sblock.fs_fpg;
|
|
|
|
if (dmax > sblock.fs_size)
|
|
|
|
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;
|
1997-03-11 12:48:17 +00:00
|
|
|
memset(&acg, 0, sblock.fs_cgsize);
|
1994-05-26 06:35:07 +00:00
|
|
|
acg.cg_time = utime;
|
|
|
|
acg.cg_magic = CG_MAGIC;
|
|
|
|
acg.cg_cgx = cylno;
|
|
|
|
if (cylno == sblock.fs_ncg - 1)
|
|
|
|
acg.cg_ncyl = sblock.fs_ncyl % sblock.fs_cpg;
|
|
|
|
else
|
|
|
|
acg.cg_ncyl = sblock.fs_cpg;
|
|
|
|
acg.cg_niblk = sblock.fs_ipg;
|
|
|
|
acg.cg_ndblk = dmax - cbase;
|
|
|
|
if (sblock.fs_contigsumsize > 0)
|
|
|
|
acg.cg_nclusterblks = acg.cg_ndblk / sblock.fs_frag;
|
1997-03-11 12:48:17 +00:00
|
|
|
acg.cg_btotoff = &acg.cg_space[0] - (u_char *)(&acg.cg_firstfield);
|
1998-08-27 07:38:33 +00:00
|
|
|
acg.cg_boff = acg.cg_btotoff + sblock.fs_cpg * sizeof(int32_t);
|
1995-05-30 06:12:45 +00:00
|
|
|
acg.cg_iusedoff = acg.cg_boff +
|
1998-08-27 07:38:33 +00:00
|
|
|
sblock.fs_cpg * sblock.fs_nrpos * sizeof(u_int16_t);
|
1994-05-26 06:35:07 +00:00
|
|
|
acg.cg_freeoff = acg.cg_iusedoff + howmany(sblock.fs_ipg, NBBY);
|
|
|
|
if (sblock.fs_contigsumsize <= 0) {
|
|
|
|
acg.cg_nextfreeoff = acg.cg_freeoff +
|
2002-03-18 02:43:14 +00:00
|
|
|
howmany(sblock.fs_cpg * sblock.fs_spc / NSPF(&sblock),
|
|
|
|
NBBY);
|
1994-05-26 06:35:07 +00:00
|
|
|
} else {
|
|
|
|
acg.cg_clustersumoff = acg.cg_freeoff + howmany
|
|
|
|
(sblock.fs_cpg * sblock.fs_spc / NSPF(&sblock), NBBY) -
|
1998-08-27 07:38:33 +00:00
|
|
|
sizeof(u_int32_t);
|
1994-05-26 06:35:07 +00:00
|
|
|
acg.cg_clustersumoff =
|
1998-08-27 07:38:33 +00:00
|
|
|
roundup(acg.cg_clustersumoff, sizeof(u_int32_t));
|
1994-05-26 06:35:07 +00:00
|
|
|
acg.cg_clusteroff = acg.cg_clustersumoff +
|
1998-08-27 07:38:33 +00:00
|
|
|
(sblock.fs_contigsumsize + 1) * sizeof(u_int32_t);
|
1994-05-26 06:35:07 +00:00
|
|
|
acg.cg_nextfreeoff = acg.cg_clusteroff + howmany
|
|
|
|
(sblock.fs_cpg * sblock.fs_spc / NSPB(&sblock), NBBY);
|
|
|
|
}
|
2002-03-18 02:43:14 +00:00
|
|
|
if (acg.cg_nextfreeoff - (long)(&acg.cg_firstfield) >
|
|
|
|
sblock.fs_cgsize) {
|
1994-05-26 06:35:07 +00:00
|
|
|
printf("Panic: cylinder group too big\n");
|
|
|
|
exit(37);
|
|
|
|
}
|
|
|
|
acg.cg_cs.cs_nifree += sblock.fs_ipg;
|
|
|
|
if (cylno == 0)
|
|
|
|
for (i = 0; i < ROOTINO; i++) {
|
|
|
|
setbit(cg_inosused(&acg), i);
|
|
|
|
acg.cg_cs.cs_nifree--;
|
|
|
|
}
|
1997-03-23 20:08:22 +00:00
|
|
|
for (i = 0; i < sblock.fs_ipg / INOPF(&sblock); i += sblock.fs_frag) {
|
|
|
|
#ifdef FSIRAND
|
|
|
|
for (j = 0; j < sblock.fs_bsize / sizeof(struct dinode); j++)
|
1997-03-24 15:43:36 +00:00
|
|
|
zino[j].di_gen = random();
|
1997-03-23 20:08:22 +00:00
|
|
|
#endif
|
1994-05-26 06:35:07 +00:00
|
|
|
wtfs(fsbtodb(&sblock, cgimin(&sblock, cylno) + i),
|
|
|
|
sblock.fs_bsize, (char *)zino);
|
1997-03-23 20:08:22 +00:00
|
|
|
}
|
1994-05-26 06:35:07 +00:00
|
|
|
if (cylno > 0) {
|
|
|
|
/*
|
|
|
|
* In cylno 0, beginning space is reserved
|
|
|
|
* for boot and super blocks.
|
|
|
|
*/
|
|
|
|
for (d = 0; d < dlower; d += sblock.fs_frag) {
|
|
|
|
blkno = d / sblock.fs_frag;
|
|
|
|
setblock(&sblock, cg_blksfree(&acg), blkno);
|
|
|
|
if (sblock.fs_contigsumsize > 0)
|
|
|
|
setbit(cg_clustersfree(&acg), blkno);
|
|
|
|
acg.cg_cs.cs_nbfree++;
|
|
|
|
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;
|
1998-07-15 06:28:05 +00:00
|
|
|
if ((i = dupper % sblock.fs_frag)) {
|
1994-05-26 06:35:07 +00:00
|
|
|
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++;
|
|
|
|
}
|
|
|
|
}
|
2001-11-02 09:23:34 +00:00
|
|
|
for (d = dupper; d + sblock.fs_frag <= dmax - cbase;) {
|
1994-05-26 06:35:07 +00:00
|
|
|
blkno = d / sblock.fs_frag;
|
|
|
|
setblock(&sblock, cg_blksfree(&acg), blkno);
|
|
|
|
if (sblock.fs_contigsumsize > 0)
|
|
|
|
setbit(cg_clustersfree(&acg), blkno);
|
|
|
|
acg.cg_cs.cs_nbfree++;
|
|
|
|
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(cg_blksfree(&acg), d);
|
|
|
|
acg.cg_cs.cs_nffree++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (sblock.fs_contigsumsize > 0) {
|
1997-03-11 12:48:17 +00:00
|
|
|
int32_t *sump = cg_clustersum(&acg);
|
1994-05-26 06:35:07 +00:00
|
|
|
u_char *mapp = cg_clustersfree(&acg);
|
|
|
|
int map = *mapp++;
|
|
|
|
int bit = 1;
|
|
|
|
int run = 0;
|
|
|
|
|
|
|
|
for (i = 0; i < acg.cg_nclusterblks; i++) {
|
2001-11-02 09:23:34 +00:00
|
|
|
if ((map & bit) != 0)
|
1994-05-26 06:35:07 +00:00
|
|
|
run++;
|
2001-11-02 09:23:34 +00:00
|
|
|
else if (run != 0) {
|
1994-05-26 06:35:07 +00:00
|
|
|
if (run > sblock.fs_contigsumsize)
|
|
|
|
run = sblock.fs_contigsumsize;
|
|
|
|
sump[run]++;
|
|
|
|
run = 0;
|
|
|
|
}
|
2001-11-02 09:23:34 +00:00
|
|
|
if ((i & (NBBY - 1)) != NBBY - 1)
|
1994-05-26 06:35:07 +00:00
|
|
|
bit <<= 1;
|
2001-11-02 09:23:34 +00:00
|
|
|
else {
|
1994-05-26 06:35:07 +00:00
|
|
|
map = *mapp++;
|
|
|
|
bit = 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (run != 0) {
|
|
|
|
if (run > sblock.fs_contigsumsize)
|
|
|
|
run = sblock.fs_contigsumsize;
|
|
|
|
sump[run]++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
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;
|
|
|
|
sblock.fs_cstotal.cs_nifree += acg.cg_cs.cs_nifree;
|
|
|
|
*cs = acg.cg_cs;
|
|
|
|
wtfs(fsbtodb(&sblock, cgtod(&sblock, cylno)),
|
|
|
|
sblock.fs_bsize, (char *)&acg);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* initialize the file system
|
|
|
|
*/
|
|
|
|
struct dinode node;
|
|
|
|
|
|
|
|
#ifdef LOSTDIR
|
|
|
|
#define PREDEFDIR 3
|
|
|
|
#else
|
|
|
|
#define PREDEFDIR 2
|
|
|
|
#endif
|
|
|
|
|
|
|
|
struct direct root_dir[] = {
|
|
|
|
{ ROOTINO, sizeof(struct direct), DT_DIR, 1, "." },
|
|
|
|
{ ROOTINO, sizeof(struct direct), DT_DIR, 2, ".." },
|
|
|
|
#ifdef LOSTDIR
|
|
|
|
{ LOSTFOUNDINO, sizeof(struct direct), DT_DIR, 10, "lost+found" },
|
|
|
|
#endif
|
|
|
|
};
|
|
|
|
struct odirect {
|
|
|
|
u_long d_ino;
|
|
|
|
u_short d_reclen;
|
|
|
|
u_short d_namlen;
|
|
|
|
u_char d_name[MAXNAMLEN + 1];
|
|
|
|
} oroot_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), DT_DIR, 1, "." },
|
|
|
|
{ ROOTINO, sizeof(struct direct), DT_DIR, 2, ".." },
|
|
|
|
{ 0, DIRBLKSIZ, 0, 0, 0 },
|
|
|
|
};
|
|
|
|
struct odirect olost_found_dir[] = {
|
|
|
|
{ LOSTFOUNDINO, sizeof(struct direct), 1, "." },
|
|
|
|
{ ROOTINO, sizeof(struct direct), 2, ".." },
|
|
|
|
{ 0, DIRBLKSIZ, 0, 0 },
|
|
|
|
};
|
|
|
|
#endif
|
|
|
|
char buf[MAXBSIZE];
|
|
|
|
|
1998-07-15 06:28:05 +00:00
|
|
|
void
|
1994-05-26 06:35:07 +00:00
|
|
|
fsinit(utime)
|
|
|
|
time_t utime;
|
|
|
|
{
|
1998-07-15 06:28:05 +00:00
|
|
|
#ifdef LOSTDIR
|
1994-05-26 06:35:07 +00:00
|
|
|
int i;
|
1998-07-15 06:28:05 +00:00
|
|
|
#endif
|
1994-05-26 06:35:07 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* initialize the node
|
|
|
|
*/
|
1997-03-11 12:48:17 +00:00
|
|
|
node.di_atime = utime;
|
|
|
|
node.di_mtime = utime;
|
|
|
|
node.di_ctime = utime;
|
1994-05-26 06:35:07 +00:00
|
|
|
#ifdef LOSTDIR
|
|
|
|
/*
|
|
|
|
* create the lost+found directory
|
|
|
|
*/
|
|
|
|
if (Oflag) {
|
|
|
|
(void)makedir((struct direct *)olost_found_dir, 2);
|
|
|
|
for (i = DIRBLKSIZ; i < sblock.fs_bsize; i += DIRBLKSIZ)
|
1997-03-11 12:48:17 +00:00
|
|
|
memmove(&buf[i], &olost_found_dir[2],
|
1994-05-26 06:35:07 +00:00
|
|
|
DIRSIZ(0, &olost_found_dir[2]));
|
|
|
|
} else {
|
|
|
|
(void)makedir(lost_found_dir, 2);
|
|
|
|
for (i = DIRBLKSIZ; i < sblock.fs_bsize; i += DIRBLKSIZ)
|
1997-03-11 12:48:17 +00:00
|
|
|
memmove(&buf[i], &lost_found_dir[2],
|
1994-05-26 06:35:07 +00:00
|
|
|
DIRSIZ(0, &lost_found_dir[2]));
|
|
|
|
}
|
|
|
|
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
|
|
|
|
*/
|
2001-05-29 19:40:39 +00:00
|
|
|
node.di_mode = IFDIR | UMASK;
|
1994-05-26 06:35:07 +00:00
|
|
|
node.di_nlink = PREDEFDIR;
|
|
|
|
if (Oflag)
|
|
|
|
node.di_size = makedir((struct direct *)oroot_dir, PREDEFDIR);
|
|
|
|
else
|
|
|
|
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);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* construct a set of directory entries in "buf".
|
|
|
|
* return size of directory.
|
|
|
|
*/
|
1998-07-15 06:28:05 +00:00
|
|
|
int
|
1994-05-26 06:35:07 +00:00
|
|
|
makedir(protodir, entries)
|
2002-03-17 09:01:41 +00:00
|
|
|
struct direct *protodir;
|
1994-05-26 06:35:07 +00:00
|
|
|
int entries;
|
|
|
|
{
|
|
|
|
char *cp;
|
|
|
|
int i, spcleft;
|
|
|
|
|
|
|
|
spcleft = DIRBLKSIZ;
|
|
|
|
for (cp = buf, i = 0; i < entries - 1; i++) {
|
|
|
|
protodir[i].d_reclen = DIRSIZ(0, &protodir[i]);
|
1997-03-11 12:48:17 +00:00
|
|
|
memmove(cp, &protodir[i], protodir[i].d_reclen);
|
1994-05-26 06:35:07 +00:00
|
|
|
cp += protodir[i].d_reclen;
|
|
|
|
spcleft -= protodir[i].d_reclen;
|
|
|
|
}
|
|
|
|
protodir[i].d_reclen = spcleft;
|
1997-03-11 12:48:17 +00:00
|
|
|
memmove(cp, &protodir[i], DIRSIZ(0, &protodir[i]));
|
1994-05-26 06:35:07 +00:00
|
|
|
return (DIRBLKSIZ);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* allocate a block or frag
|
|
|
|
*/
|
|
|
|
daddr_t
|
|
|
|
alloc(size, mode)
|
|
|
|
int size;
|
|
|
|
int mode;
|
|
|
|
{
|
|
|
|
int i, frag;
|
|
|
|
daddr_t d, blkno;
|
|
|
|
|
|
|
|
rdfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize,
|
|
|
|
(char *)&acg);
|
|
|
|
if (acg.cg_magic != CG_MAGIC) {
|
|
|
|
printf("cg 0: bad magic number\n");
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
if (acg.cg_cs.cs_nbfree == 0) {
|
|
|
|
printf("first cylinder group ran out of space\n");
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
for (d = 0; d < acg.cg_ndblk; 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:
|
|
|
|
blkno = fragstoblks(&sblock, d);
|
|
|
|
clrblock(&sblock, cg_blksfree(&acg), blkno);
|
1997-03-11 12:48:17 +00:00
|
|
|
if (sblock.fs_contigsumsize > 0)
|
|
|
|
clrbit(cg_clustersfree(&acg), blkno);
|
1994-05-26 06:35:07 +00:00
|
|
|
acg.cg_cs.cs_nbfree--;
|
|
|
|
sblock.fs_cstotal.cs_nbfree--;
|
|
|
|
fscs[0].cs_nbfree--;
|
|
|
|
if (mode & IFDIR) {
|
|
|
|
acg.cg_cs.cs_ndir++;
|
|
|
|
sblock.fs_cstotal.cs_ndir++;
|
|
|
|
fscs[0].cs_ndir++;
|
|
|
|
}
|
|
|
|
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;
|
|
|
|
sblock.fs_cstotal.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(cg_blksfree(&acg), d + i);
|
|
|
|
}
|
|
|
|
wtfs(fsbtodb(&sblock, cgtod(&sblock, 0)), sblock.fs_cgsize,
|
|
|
|
(char *)&acg);
|
|
|
|
return (d);
|
|
|
|
}
|
|
|
|
|
1997-03-11 12:48:17 +00:00
|
|
|
/*
|
|
|
|
* Calculate number of inodes per group.
|
|
|
|
*/
|
|
|
|
long
|
|
|
|
calcipg(cpg, bpcg, usedbp)
|
|
|
|
long cpg;
|
|
|
|
long bpcg;
|
|
|
|
off_t *usedbp;
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
long ipg, new_ipg, ncg, ncyl;
|
|
|
|
off_t usedb;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Prepare to scale by fssize / (number of sectors in cylinder groups).
|
|
|
|
* Note that fssize is still in sectors, not filesystem blocks.
|
|
|
|
*/
|
1998-05-31 12:21:50 +00:00
|
|
|
ncyl = howmany(fssize, (u_int)secpercyl);
|
1997-03-11 12:48:17 +00:00
|
|
|
ncg = howmany(ncyl, cpg);
|
|
|
|
/*
|
|
|
|
* Iterate a few times to allow for ipg depending on itself.
|
|
|
|
*/
|
|
|
|
ipg = 0;
|
|
|
|
for (i = 0; i < 10; i++) {
|
2001-11-02 09:23:34 +00:00
|
|
|
usedb = (sblock.fs_iblkno + ipg / INOPF(&sblock)) *
|
|
|
|
NSPF(&sblock) * (off_t)sectorsize;
|
|
|
|
new_ipg = (cpg * (quad_t)bpcg - usedb) / density *
|
|
|
|
fssize / ncg / secpercyl / cpg;
|
1997-03-11 12:48:17 +00:00
|
|
|
new_ipg = roundup(new_ipg, INOPB(&sblock));
|
|
|
|
if (new_ipg == ipg)
|
|
|
|
break;
|
|
|
|
ipg = new_ipg;
|
|
|
|
}
|
|
|
|
*usedbp = usedb;
|
|
|
|
return (ipg);
|
|
|
|
}
|
|
|
|
|
1994-05-26 06:35:07 +00:00
|
|
|
/*
|
|
|
|
* Allocate an inode on the disk
|
|
|
|
*/
|
1998-07-15 06:28:05 +00:00
|
|
|
void
|
1994-05-26 06:35:07 +00:00
|
|
|
iput(ip, ino)
|
2002-03-17 09:01:41 +00:00
|
|
|
struct dinode *ip;
|
|
|
|
ino_t ino;
|
1994-05-26 06:35:07 +00:00
|
|
|
{
|
|
|
|
struct dinode buf[MAXINOPB];
|
|
|
|
daddr_t d;
|
|
|
|
int c;
|
|
|
|
|
1997-03-23 20:08:22 +00:00
|
|
|
#ifdef FSIRAND
|
1997-03-24 15:43:36 +00:00
|
|
|
ip->di_gen = random();
|
1997-03-23 20:08:22 +00:00
|
|
|
#endif
|
1994-05-26 06:35:07 +00:00
|
|
|
c = ino_to_cg(&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(31);
|
|
|
|
}
|
|
|
|
acg.cg_cs.cs_nifree--;
|
|
|
|
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 (ino >= sblock.fs_ipg * sblock.fs_ncg) {
|
|
|
|
printf("fsinit: inode value out of range (%d).\n", ino);
|
|
|
|
exit(32);
|
|
|
|
}
|
|
|
|
d = fsbtodb(&sblock, ino_to_fsba(&sblock, ino));
|
1998-07-15 06:28:05 +00:00
|
|
|
rdfs(d, sblock.fs_bsize, (char *)buf);
|
1994-05-26 06:35:07 +00:00
|
|
|
buf[ino_to_fsbo(&sblock, ino)] = *ip;
|
1998-07-15 06:28:05 +00:00
|
|
|
wtfs(d, sblock.fs_bsize, (char *)buf);
|
1994-05-26 06:35:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* read a block from the file system
|
|
|
|
*/
|
1998-07-15 06:28:05 +00:00
|
|
|
void
|
1994-05-26 06:35:07 +00:00
|
|
|
rdfs(bno, size, bf)
|
|
|
|
daddr_t bno;
|
|
|
|
int size;
|
|
|
|
char *bf;
|
|
|
|
{
|
|
|
|
int n;
|
|
|
|
|
2000-10-24 00:08:30 +00:00
|
|
|
wtfsflush();
|
1994-05-26 06:35:07 +00:00
|
|
|
if (lseek(fsi, (off_t)bno * sectorsize, 0) < 0) {
|
1998-06-28 20:11:23 +00:00
|
|
|
printf("seek error: %ld\n", (long)bno);
|
1998-07-15 06:28:05 +00:00
|
|
|
err(33, "rdfs");
|
1994-05-26 06:35:07 +00:00
|
|
|
}
|
|
|
|
n = read(fsi, bf, size);
|
|
|
|
if (n != size) {
|
1998-06-28 20:11:23 +00:00
|
|
|
printf("read error: %ld\n", (long)bno);
|
1998-07-15 06:28:05 +00:00
|
|
|
err(34, "rdfs");
|
1994-05-26 06:35:07 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2000-10-17 00:41:36 +00:00
|
|
|
#define WCSIZE (128 * 1024)
|
|
|
|
daddr_t wc_sect; /* units of sectorsize */
|
|
|
|
int wc_end; /* bytes */
|
|
|
|
static char wc[WCSIZE]; /* bytes */
|
|
|
|
|
2000-10-24 00:08:30 +00:00
|
|
|
/*
|
|
|
|
* Flush dirty write behind buffer.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
wtfsflush()
|
|
|
|
{
|
|
|
|
int n;
|
|
|
|
if (wc_end) {
|
|
|
|
if (lseek(fso, (off_t)wc_sect * sectorsize, SEEK_SET) < 0) {
|
|
|
|
printf("seek error: %ld\n", (long)wc_sect);
|
|
|
|
err(35, "wtfs - writecombine");
|
|
|
|
}
|
|
|
|
n = write(fso, wc, wc_end);
|
|
|
|
if (n != wc_end) {
|
|
|
|
printf("write error: %ld\n", (long)wc_sect);
|
|
|
|
err(36, "wtfs - writecombine");
|
|
|
|
}
|
|
|
|
wc_end = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1994-05-26 06:35:07 +00:00
|
|
|
/*
|
|
|
|
* write a block to the file system
|
|
|
|
*/
|
1998-07-15 06:28:05 +00:00
|
|
|
void
|
1994-05-26 06:35:07 +00:00
|
|
|
wtfs(bno, size, bf)
|
|
|
|
daddr_t bno;
|
|
|
|
int size;
|
|
|
|
char *bf;
|
|
|
|
{
|
|
|
|
int n;
|
2000-10-17 00:41:36 +00:00
|
|
|
int done;
|
1994-05-26 06:35:07 +00:00
|
|
|
|
|
|
|
if (Nflag)
|
|
|
|
return;
|
2000-10-17 00:41:36 +00:00
|
|
|
done = 0;
|
|
|
|
if (wc_end == 0 && size <= WCSIZE) {
|
|
|
|
wc_sect = bno;
|
|
|
|
bcopy(bf, wc, size);
|
|
|
|
wc_end = size;
|
|
|
|
if (wc_end < WCSIZE)
|
|
|
|
return;
|
|
|
|
done = 1;
|
|
|
|
}
|
2000-10-24 03:28:59 +00:00
|
|
|
if ((off_t)wc_sect * sectorsize + wc_end == (off_t)bno * sectorsize &&
|
2000-10-17 00:41:36 +00:00
|
|
|
wc_end + size <= WCSIZE) {
|
|
|
|
bcopy(bf, wc + wc_end, size);
|
|
|
|
wc_end += size;
|
|
|
|
if (wc_end < WCSIZE)
|
|
|
|
return;
|
|
|
|
done = 1;
|
|
|
|
}
|
2000-10-24 00:08:30 +00:00
|
|
|
wtfsflush();
|
2000-10-17 00:41:36 +00:00
|
|
|
if (done)
|
|
|
|
return;
|
1994-05-26 06:35:07 +00:00
|
|
|
if (lseek(fso, (off_t)bno * sectorsize, SEEK_SET) < 0) {
|
1998-06-28 20:11:23 +00:00
|
|
|
printf("seek error: %ld\n", (long)bno);
|
1998-07-15 06:28:05 +00:00
|
|
|
err(35, "wtfs");
|
1994-05-26 06:35:07 +00:00
|
|
|
}
|
|
|
|
n = write(fso, bf, size);
|
|
|
|
if (n != size) {
|
1998-06-28 20:11:23 +00:00
|
|
|
printf("write error: %ld\n", (long)bno);
|
1998-07-15 06:28:05 +00:00
|
|
|
err(36, "wtfs");
|
1994-05-26 06:35:07 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* check if a block is available
|
|
|
|
*/
|
1998-07-15 06:28:05 +00:00
|
|
|
int
|
1994-05-26 06:35:07 +00:00
|
|
|
isblock(fs, cp, h)
|
|
|
|
struct fs *fs;
|
|
|
|
unsigned char *cp;
|
|
|
|
int h;
|
|
|
|
{
|
|
|
|
unsigned char mask;
|
|
|
|
|
|
|
|
switch (fs->fs_frag) {
|
|
|
|
case 8:
|
|
|
|
return (cp[h] == 0xff);
|
|
|
|
case 4:
|
|
|
|
mask = 0x0f << ((h & 0x1) << 2);
|
|
|
|
return ((cp[h >> 1] & mask) == mask);
|
|
|
|
case 2:
|
|
|
|
mask = 0x03 << ((h & 0x3) << 1);
|
|
|
|
return ((cp[h >> 2] & mask) == mask);
|
|
|
|
case 1:
|
|
|
|
mask = 0x01 << (h & 0x7);
|
|
|
|
return ((cp[h >> 3] & mask) == mask);
|
|
|
|
default:
|
|
|
|
fprintf(stderr, "isblock bad fs_frag %d\n", fs->fs_frag);
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* take a block out of the map
|
|
|
|
*/
|
1998-07-15 06:28:05 +00:00
|
|
|
void
|
1994-05-26 06:35:07 +00:00
|
|
|
clrblock(fs, cp, h)
|
|
|
|
struct fs *fs;
|
|
|
|
unsigned char *cp;
|
|
|
|
int h;
|
|
|
|
{
|
|
|
|
switch ((fs)->fs_frag) {
|
|
|
|
case 8:
|
|
|
|
cp[h] = 0;
|
|
|
|
return;
|
|
|
|
case 4:
|
|
|
|
cp[h >> 1] &= ~(0x0f << ((h & 0x1) << 2));
|
|
|
|
return;
|
|
|
|
case 2:
|
|
|
|
cp[h >> 2] &= ~(0x03 << ((h & 0x3) << 1));
|
|
|
|
return;
|
|
|
|
case 1:
|
|
|
|
cp[h >> 3] &= ~(0x01 << (h & 0x7));
|
|
|
|
return;
|
|
|
|
default:
|
|
|
|
fprintf(stderr, "clrblock bad fs_frag %d\n", fs->fs_frag);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* put a block into the map
|
|
|
|
*/
|
1998-07-15 06:28:05 +00:00
|
|
|
void
|
1994-05-26 06:35:07 +00:00
|
|
|
setblock(fs, cp, h)
|
|
|
|
struct fs *fs;
|
|
|
|
unsigned char *cp;
|
|
|
|
int h;
|
|
|
|
{
|
|
|
|
switch (fs->fs_frag) {
|
|
|
|
case 8:
|
|
|
|
cp[h] = 0xff;
|
|
|
|
return;
|
|
|
|
case 4:
|
|
|
|
cp[h >> 1] |= (0x0f << ((h & 0x1) << 2));
|
|
|
|
return;
|
|
|
|
case 2:
|
|
|
|
cp[h >> 2] |= (0x03 << ((h & 0x3) << 1));
|
|
|
|
return;
|
|
|
|
case 1:
|
|
|
|
cp[h >> 3] |= (0x01 << (h & 0x7));
|
|
|
|
return;
|
|
|
|
default:
|
|
|
|
fprintf(stderr, "setblock bad fs_frag %d\n", fs->fs_frag);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
1996-01-25 23:44:32 +00:00
|
|
|
|
|
|
|
/*
|
1996-01-30 23:14:34 +00:00
|
|
|
* Determine the number of characters in a
|
1996-01-25 23:44:32 +00:00
|
|
|
* single line.
|
|
|
|
*/
|
|
|
|
|
|
|
|
static int
|
1996-01-30 23:14:34 +00:00
|
|
|
charsperline()
|
1996-01-25 23:44:32 +00:00
|
|
|
{
|
1996-01-30 23:14:34 +00:00
|
|
|
int columns;
|
1996-01-25 23:44:32 +00:00
|
|
|
char *cp;
|
|
|
|
struct winsize ws;
|
|
|
|
|
|
|
|
columns = 0;
|
|
|
|
if (ioctl(0, TIOCGWINSZ, &ws) != -1)
|
|
|
|
columns = ws.ws_col;
|
|
|
|
if (columns == 0 && (cp = getenv("COLUMNS")))
|
|
|
|
columns = atoi(cp);
|
|
|
|
if (columns == 0)
|
|
|
|
columns = 80; /* last resort */
|
2001-11-02 09:23:34 +00:00
|
|
|
return (columns);
|
1996-01-25 23:44:32 +00:00
|
|
|
}
|