2003-02-25 13:34:36 +03:00
|
|
|
.\" $NetBSD: tunefs.8,v 1.31 2003/02/25 10:35:11 wiz Exp $
|
1995-03-18 17:54:19 +03:00
|
|
|
.\"
|
1994-06-08 23:33:47 +04:00
|
|
|
.\" Copyright (c) 1983, 1991, 1993
|
|
|
|
|
.\" The Regents of the University of California. All rights reserved.
|
1993-03-21 12:45:37 +03:00
|
|
|
.\"
|
|
|
|
|
.\" 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.
|
|
|
|
|
.\"
|
1997-09-16 16:54:42 +04:00
|
|
|
.\" @(#)tunefs.8 8.3 (Berkeley) 5/3/95
|
1993-03-22 11:04:00 +03:00
|
|
|
.\"
|
2001-11-09 12:05:51 +03:00
|
|
|
.Dd November 9, 2001
|
1993-03-21 12:45:37 +03:00
|
|
|
.Dt TUNEFS 8
|
2001-06-05 15:22:41 +04:00
|
|
|
.Os
|
1993-03-21 12:45:37 +03:00
|
|
|
.Sh NAME
|
|
|
|
|
.Nm tunefs
|
|
|
|
|
.Nd tune up an existing file system
|
|
|
|
|
.Sh SYNOPSIS
|
2003-02-25 13:34:36 +03:00
|
|
|
.Nm
|
2001-08-19 13:39:24 +04:00
|
|
|
.Op Fl AFN
|
1993-03-21 12:45:37 +03:00
|
|
|
.Op Fl a Ar maxcontig
|
|
|
|
|
.Op Fl d Ar rotdelay
|
|
|
|
|
.Op Fl e Ar maxbpg
|
Incorporate the enhanced ffs_dirpref() by Grigoriy Orlov, as found in
FreeBSD (three commits; the initial work, man page updates, and a fix
to ffs_reload()), with the following differences:
- Be consistent between newfs(8) and tunefs(8) as to the options which
set and control the tuning parameters for this work (avgfilesize & avgfpdir)
- Use u_int16_t instead of u_int8_t to keep track of the number of
contiguous directories (suggested by Chuck Silvers)
- Work within our FFS_EI framework
- Ensure that fs->fs_maxclusters and fs->fs_contigdirs don't point to
the same area of memory
The new algorithm has a marked performance increase, especially when
performing tasks such as untarring pkgsrc.tar.gz, etc.
The original FreeBSD commit messages are attached:
=====
mckusick 2001/04/10 01:39:00 PDT
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>
=====
=====
iedowse 2001/04/23 17:37:17 PDT
Pre-dirpref versions of fsck may zero out the new superblock fields
fs_contigdirs, fs_avgfilesize and fs_avgfpdir. This could cause
panics if these fields were zeroed while a filesystem was mounted
read-only, and then remounted read-write.
Add code to ffs_reload() which copies the fs_contigdirs pointer
from the previous superblock, and reinitialises fs_avgf* if necessary.
Reviewed by: mckusick
=====
=====
nik 2001/04/10 03:36:44 PDT
Add information about the new options to newfs and tunefs which set the
expected average file size and number of files per directory. Could do
with some fleshing out.
=====
2001-09-06 06:16:00 +04:00
|
|
|
.Op Fl g Ar avgfilesize
|
|
|
|
|
.Op Fl h Ar avgfpdir
|
2001-09-03 19:04:39 +04:00
|
|
|
.Op Fl k Ar trackskew
|
1993-03-21 12:45:37 +03:00
|
|
|
.Op Fl m Ar minfree
|
|
|
|
|
.Bk -words
|
2000-06-16 02:37:17 +04:00
|
|
|
.\" .Op Fl n Ar soft_dependency_enabling
|
1993-03-21 12:45:37 +03:00
|
|
|
.Op Fl o Ar optimize_preference
|
|
|
|
|
.Ek
|
2001-08-19 13:39:24 +04:00
|
|
|
.Ar special | Ar filesys
|
1993-03-21 12:45:37 +03:00
|
|
|
.Sh DESCRIPTION
|
1997-09-15 15:27:12 +04:00
|
|
|
.Nm
|
1993-03-21 12:45:37 +03:00
|
|
|
is designed to change the dynamic parameters of a file system
|
|
|
|
|
which affect the layout policies.
|
2001-08-19 13:39:24 +04:00
|
|
|
.Pp
|
|
|
|
|
The following options are supported by
|
2003-02-25 13:34:36 +03:00
|
|
|
.Nm :
|
2001-08-19 13:39:24 +04:00
|
|
|
.Bl -tag -width Ds
|
|
|
|
|
.It Fl A
|
|
|
|
|
Cause the values to be updated in all the alternate
|
1997-09-16 16:54:42 +04:00
|
|
|
superblocks instead of just the standard superblock.
|
|
|
|
|
If this option is not used,
|
|
|
|
|
then use of a backup superblock by
|
|
|
|
|
.Xr fsck 8
|
|
|
|
|
will lose anything changed by
|
2003-02-25 13:34:36 +03:00
|
|
|
.Nm .
|
1997-09-16 16:54:42 +04:00
|
|
|
.Fl A
|
2001-08-19 13:39:24 +04:00
|
|
|
is ignored when
|
1997-09-16 16:54:42 +04:00
|
|
|
.Fl N
|
2001-08-19 13:39:24 +04:00
|
|
|
is specified.
|
|
|
|
|
.It Fl F
|
|
|
|
|
Indicates that
|
|
|
|
|
.Ar special
|
2001-11-09 12:05:51 +03:00
|
|
|
is a file system image, rather than a device name or file system mount point.
|
|
|
|
|
.Ar special
|
|
|
|
|
will be accessed
|
|
|
|
|
.Sq as-is .
|
2001-08-19 13:39:24 +04:00
|
|
|
.It Fl N
|
|
|
|
|
Display all the settable options
|
|
|
|
|
(after any changes from the tuning options)
|
|
|
|
|
but do not cause any of them to be changed.
|
1993-03-21 12:45:37 +03:00
|
|
|
.It Fl a Ar maxcontig
|
|
|
|
|
This specifies the maximum number of contiguous blocks that will
|
|
|
|
|
be laid out before forcing a rotational delay (see
|
|
|
|
|
.Fl d
|
|
|
|
|
below).
|
|
|
|
|
The default value is one, since most device drivers require
|
|
|
|
|
an interrupt per disk transfer.
|
|
|
|
|
Device drivers that can chain several buffers together in a single
|
|
|
|
|
transfer should set this to the maximum chain length.
|
|
|
|
|
.It Fl d Ar rotdelay
|
|
|
|
|
This specifies the expected time (in milliseconds)
|
|
|
|
|
to service a transfer completion
|
|
|
|
|
interrupt and initiate a new transfer on the same disk.
|
|
|
|
|
It is used to decide how much rotational spacing to place between
|
|
|
|
|
successive blocks in a file.
|
|
|
|
|
.It Fl e Ar maxbpg
|
|
|
|
|
This indicates the maximum number of blocks any single file can
|
|
|
|
|
allocate out of a cylinder group before it is forced to begin
|
|
|
|
|
allocating blocks from another cylinder group.
|
|
|
|
|
Typically this value is set to about one quarter of the total blocks
|
|
|
|
|
in a cylinder group.
|
|
|
|
|
The intent is to prevent any single file from using up all the
|
|
|
|
|
blocks in a single cylinder group,
|
|
|
|
|
thus degrading access times for all files subsequently allocated
|
|
|
|
|
in that cylinder group.
|
|
|
|
|
The effect of this limit is to cause big files to do long seeks
|
|
|
|
|
more frequently than if they were allowed to allocate all the blocks
|
|
|
|
|
in a cylinder group before seeking elsewhere.
|
|
|
|
|
For file systems with exclusively large files,
|
|
|
|
|
this parameter should be set higher.
|
Incorporate the enhanced ffs_dirpref() by Grigoriy Orlov, as found in
FreeBSD (three commits; the initial work, man page updates, and a fix
to ffs_reload()), with the following differences:
- Be consistent between newfs(8) and tunefs(8) as to the options which
set and control the tuning parameters for this work (avgfilesize & avgfpdir)
- Use u_int16_t instead of u_int8_t to keep track of the number of
contiguous directories (suggested by Chuck Silvers)
- Work within our FFS_EI framework
- Ensure that fs->fs_maxclusters and fs->fs_contigdirs don't point to
the same area of memory
The new algorithm has a marked performance increase, especially when
performing tasks such as untarring pkgsrc.tar.gz, etc.
The original FreeBSD commit messages are attached:
=====
mckusick 2001/04/10 01:39:00 PDT
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>
=====
=====
iedowse 2001/04/23 17:37:17 PDT
Pre-dirpref versions of fsck may zero out the new superblock fields
fs_contigdirs, fs_avgfilesize and fs_avgfpdir. This could cause
panics if these fields were zeroed while a filesystem was mounted
read-only, and then remounted read-write.
Add code to ffs_reload() which copies the fs_contigdirs pointer
from the previous superblock, and reinitialises fs_avgf* if necessary.
Reviewed by: mckusick
=====
=====
nik 2001/04/10 03:36:44 PDT
Add information about the new options to newfs and tunefs which set the
expected average file size and number of files per directory. Could do
with some fleshing out.
=====
2001-09-06 06:16:00 +04:00
|
|
|
.It Fl g Ar avgfilesize
|
|
|
|
|
This specifies the expected average file size.
|
|
|
|
|
.It Fl h Ar avgfpdir
|
|
|
|
|
This specifies the expected number of files per directory.
|
2001-09-03 19:04:39 +04:00
|
|
|
.It Fl k Ar trackskew
|
|
|
|
|
This specifies the skew in sectors from one track to the next in a cylinder.
|
|
|
|
|
The default value is zero, indicating that each track in a cylinder begins at
|
|
|
|
|
the same rotational position.
|
1993-03-21 12:45:37 +03:00
|
|
|
.It Fl m Ar minfree
|
|
|
|
|
This value specifies the percentage of space held back
|
|
|
|
|
from normal users; the minimum free space threshold.
|
1994-04-20 07:56:03 +04:00
|
|
|
The default value used is 10%.
|
1993-03-21 12:45:37 +03:00
|
|
|
This value can be set to zero, however up to a factor of three
|
1994-04-20 07:56:03 +04:00
|
|
|
in throughput will be lost over the performance obtained at a 10%
|
1993-03-21 12:45:37 +03:00
|
|
|
threshold.
|
|
|
|
|
Note that if the value is raised above the current usage level,
|
|
|
|
|
users will be unable to allocate files until enough files have
|
|
|
|
|
been deleted to get under the higher threshold.
|
2001-09-03 20:30:02 +04:00
|
|
|
.\"
|
|
|
|
|
.\" comment out -n, since softdeps are now a mount option
|
2001-09-03 19:04:39 +04:00
|
|
|
.ig
|
|
|
|
|
.It Fl n Ar soft_dependency_enabling
|
|
|
|
|
The soft dependency code allows most file system I/O to be done
|
2002-12-21 15:50:54 +03:00
|
|
|
asynchronously by reordering dependent writes to ensure that the
|
2001-11-16 13:25:42 +03:00
|
|
|
on-disk metadata is self-consistent even when updates are deferred.
|
|
|
|
|
Additionally, metadata updates are aggregated, reducing the total
|
2001-09-03 19:04:39 +04:00
|
|
|
number of writes performed.
|
|
|
|
|
Use of this facility does not require any changes to the file system,
|
|
|
|
|
so it can be enabled or disabled any time that the file system is unmounted.
|
|
|
|
|
This experimental facility is turned off by default.
|
|
|
|
|
It is turned on by using
|
|
|
|
|
.Fl n
|
|
|
|
|
enable;
|
|
|
|
|
it is turned off by using
|
|
|
|
|
.Fl n
|
|
|
|
|
disable.
|
|
|
|
|
..
|
2000-01-28 22:51:34 +03:00
|
|
|
.It Fl o Ar optimize_preference
|
|
|
|
|
The file system can either try to minimize the time spent
|
|
|
|
|
allocating blocks, or it can attempt to minimize the space
|
|
|
|
|
fragmentation on the disk.
|
|
|
|
|
If the value of minfree (see above) is less than 10%,
|
|
|
|
|
then the file system should optimize for space to avoid
|
|
|
|
|
running out of full sized blocks.
|
|
|
|
|
For values of minfree greater than or equal to 10%,
|
|
|
|
|
fragmentation is unlikely to be problematical, and
|
|
|
|
|
the file system can be optimized for time.
|
2000-03-30 14:43:46 +04:00
|
|
|
.Pp
|
|
|
|
|
.Ar optimize_preference
|
|
|
|
|
can be specified as either
|
|
|
|
|
.Li space
|
|
|
|
|
or
|
|
|
|
|
.Li time .
|
1993-03-21 12:45:37 +03:00
|
|
|
.El
|
|
|
|
|
.Sh SEE ALSO
|
|
|
|
|
.Xr fs 5 ,
|
1994-06-08 23:33:47 +04:00
|
|
|
.Xr dumpfs 8 ,
|
1997-09-16 16:54:42 +04:00
|
|
|
.Xr fsck_ffs 8 ,
|
1996-12-27 08:53:53 +03:00
|
|
|
.Xr newfs 8
|
1993-03-21 12:45:37 +03:00
|
|
|
.Rs
|
|
|
|
|
.%A M. McKusick
|
|
|
|
|
.%A W. Joy
|
|
|
|
|
.%A S. Leffler
|
|
|
|
|
.%A R. Fabry
|
|
|
|
|
.%T "A Fast File System for UNIX"
|
|
|
|
|
.%J "ACM Transactions on Computer Systems 2"
|
|
|
|
|
.%N 3
|
|
|
|
|
.%P pp 181-197
|
|
|
|
|
.%D August 1984
|
1994-06-08 23:33:47 +04:00
|
|
|
.%O "(reprinted in the BSD System Manager's Manual, SMM:5)"
|
1993-03-21 12:45:37 +03:00
|
|
|
.Re
|
2001-11-16 14:21:37 +03:00
|
|
|
.Sh HISTORY
|
|
|
|
|
The
|
|
|
|
|
.Nm
|
|
|
|
|
command appeared in
|
|
|
|
|
.Bx 4.2 .
|
1993-03-21 12:45:37 +03:00
|
|
|
.Sh BUGS
|
|
|
|
|
This program should work on mounted and active file systems.
|
|
|
|
|
Because the super-block is not kept in the buffer cache,
|
|
|
|
|
the changes will only take effect if the program
|
2001-08-19 13:39:24 +04:00
|
|
|
is run on unmounted file systems.
|
1993-03-21 12:45:37 +03:00
|
|
|
To change the root file system, the system must be rebooted
|
|
|
|
|
after the file system is tuned.
|
|
|
|
|
.Pp
|
|
|
|
|
You can tune a file system, but you can't tune a fish.
|