2003-02-01 09:23:35 +03:00
|
|
|
/* $NetBSD: lfs_segment.c,v 1.99 2003/02/01 06:23:53 thorpej Exp $ */
|
1994-06-29 10:39:25 +04:00
|
|
|
|
1999-03-10 03:20:00 +03:00
|
|
|
/*-
|
Various bug-fixes to LFS, to wit:
Kernel:
* Add runtime quantity lfs_ravail, the number of disk-blocks reserved
for writing. Writes to the filesystem first reserve a maximum amount
of blocks before their write is allowed to proceed; after the blocks
are allocated the reserved total is reduced by a corresponding amount.
If the lfs_reserve function cannot immediately reserve the requested
number of blocks, the inode is unlocked, and the thread sleeps until
the cleaner has made enough space available for the blocks to be
reserved. In this way large files can be written to the filesystem
(or, smaller files can be written to a nearly-full but thoroughly
clean filesystem) and the cleaner can still function properly.
* Remove explicit switching on dlfs_minfreeseg from the kernel code; it
is now merely a fs-creation parameter used to compute dlfs_avail and
dlfs_bfree (and used by fsck_lfs(8) to check their accuracy). Its
former role is better assumed by a properly computed dlfs_avail.
* Bounds-check inode numbers submitted through lfs_bmapv and lfs_markv.
This prevents a panic, but, if the cleaner is feeding the filesystem
the wrong data, you are still in a world of hurt.
* Cleanup: remove explicit references of DEV_BSIZE in favor of
btodb()/dbtob().
lfs_cleanerd:
* Make -n mean "send N segments' blocks through a single call to
lfs_markv". Previously it had meant "clean N segments though N calls
to lfs_markv, before looking again to see if more need to be cleaned".
The new behavior gives better packing of direct data on disk with as
little metadata as possible, largely alleviating the problem that the
cleaner can consume more disk through inefficient use of metadata than
it frees by moving dirty data away from clean "holes" to produce
entirely clean segments.
* Make -b mean "read as many segments as necessary to write N segments
of dirty data back to disk", rather than its former meaning of "read
as many segments as necessary to free N segments worth of space". The
new meaning, combined with the new -n behavior described above,
further aids in cleaning storage efficiency as entire segments can be
written at once, using as few blocks as possible for segment summaries
and inode blocks.
* Make the cleaner take note of segments which could not be cleaned due
to error, and not attempt to clean them until they are entirely free
of dirty blocks. This prevents the case in which a cleanerd running
with -n 1 and without -b (formerly the default) would spin trying
repeatedly to clean a corrupt segment, while the remaining space
filled and deadlocked the filesystem.
* Update the lfs_cleanerd manual page to describe all the options,
including the changes mentioned here (in particular, the -b and -n
flags were previously undocumented).
fsck_lfs:
* Check, and optionally fix, lfs_avail (to an exact figure) and
lfs_bfree (within a margin of error) in pass 5.
newfs_lfs:
* Reduce the default dlfs_minfreeseg to 1/20 of the total segments.
* Add a warning if the sgs disklabel field is 16 (the default for FFS'
cpg, but not usually desirable for LFS' sgs: 5--8 is a better range).
* Change the calculation of lfs_avail and lfs_bfree, corresponding to
the kernel changes mentioned above.
mount_lfs:
* Add -N and -b options to pass corresponding -n and -b options to
lfs_cleanerd.
* Default to calling lfs_cleanerd with "-b -n 4".
[All of these changes were largely tested in the 1.5 branch, with the
idea that they (along with previous un-pulled-up work) could be applied
to the branch while it was still in ALPHA2; however my test system has
experienced corruption on another filesystem (/dev/console has gone
missing :^), and, while I believe this unrelated to the LFS changes, I
cannot with good conscience request that the changes be pulled up.]
2000-09-09 08:49:54 +04:00
|
|
|
* Copyright (c) 1999, 2000 The NetBSD Foundation, Inc.
|
1999-03-10 03:20:00 +03:00
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* This code is derived from software contributed to The NetBSD Foundation
|
|
|
|
* by Konrad E. Schroder <perseant@hhhh.org>.
|
|
|
|
*
|
|
|
|
* 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 NetBSD
|
|
|
|
* Foundation, Inc. and its contributors.
|
|
|
|
* 4. Neither the name of The NetBSD Foundation 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 NETBSD FOUNDATION, INC. 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 FOUNDATION 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.
|
|
|
|
*/
|
1994-06-08 15:41:58 +04:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1991, 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.
|
|
|
|
*
|
1998-03-01 05:20:01 +03:00
|
|
|
* @(#)lfs_segment.c 8.10 (Berkeley) 6/10/95
|
1994-06-08 15:41:58 +04:00
|
|
|
*/
|
|
|
|
|
2001-11-08 05:39:06 +03:00
|
|
|
#include <sys/cdefs.h>
|
2003-02-01 09:23:35 +03:00
|
|
|
__KERNEL_RCSID(0, "$NetBSD: lfs_segment.c,v 1.99 2003/02/01 06:23:53 thorpej Exp $");
|
2001-11-08 05:39:06 +03:00
|
|
|
|
1999-03-26 00:39:18 +03:00
|
|
|
#define ivndebug(vp,str) printf("ino %d: %s\n",VTOI(vp)->i_number,(str))
|
|
|
|
|
2001-05-30 15:57:16 +04:00
|
|
|
#if defined(_KERNEL_OPT)
|
1999-09-04 02:48:51 +04:00
|
|
|
#include "opt_ddb.h"
|
2000-11-30 18:59:47 +03:00
|
|
|
#endif
|
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/systm.h>
|
|
|
|
#include <sys/namei.h>
|
|
|
|
#include <sys/kernel.h>
|
|
|
|
#include <sys/resourcevar.h>
|
|
|
|
#include <sys/file.h>
|
|
|
|
#include <sys/stat.h>
|
|
|
|
#include <sys/buf.h>
|
|
|
|
#include <sys/proc.h>
|
|
|
|
#include <sys/vnode.h>
|
|
|
|
#include <sys/malloc.h>
|
|
|
|
#include <sys/mount.h>
|
|
|
|
|
|
|
|
#include <miscfs/specfs/specdev.h>
|
|
|
|
#include <miscfs/fifofs/fifo.h>
|
|
|
|
|
|
|
|
#include <ufs/ufs/inode.h>
|
|
|
|
#include <ufs/ufs/dir.h>
|
|
|
|
#include <ufs/ufs/ufsmount.h>
|
|
|
|
#include <ufs/ufs/ufs_extern.h>
|
|
|
|
|
|
|
|
#include <ufs/lfs/lfs.h>
|
|
|
|
#include <ufs/lfs/lfs_extern.h>
|
|
|
|
|
For synchronous writes, keep separate i/o counters for each write, so
processes don't have to wait for one another to finish (e.g., nfsd seems
to be a little happier now, though I haven't measured the difference).
Synchronous checkpoints, however, must always wait for all i/o to finish.
Take the contents of the callback functions and have them run in thread
context instead (aiodoned thread). lfs_iocount no longer has to be
protected in splbio(), and quite a bit less of the segment construction
loop needs to be in splbio() as well.
If lfs_markv is handed a block that is not the correct size according to
the inode, refuse to process it. (Formerly it was extended to the "correct"
size.) This is possibly more prone to deadlock, but less prone to corruption.
lfs_segclean now outright refuses to clean segments that appear to have live
bytes in them. Again this may be more prone to deadlock but avoids
corruption.
Replace ufsspec_close and ufsfifo_close with LFS equivalents; this means
that no UFS functions need to know about LFS_ITIMES any more. Remove
the reference from ufs/inode.h.
Tested on i386, test-compiled on alpha.
2002-06-16 04:13:15 +04:00
|
|
|
#include <uvm/uvm.h>
|
2002-05-15 00:03:53 +04:00
|
|
|
#include <uvm/uvm_extern.h>
|
|
|
|
|
2003-02-01 09:23:35 +03:00
|
|
|
MALLOC_DEFINE(M_SEGMENT, "LFS segment", "Segment for LFS");
|
|
|
|
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
extern int count_lock_queue(void);
|
1998-03-01 05:20:01 +03:00
|
|
|
extern struct simplelock vnode_free_list_slock; /* XXX */
|
1994-06-08 15:41:58 +04:00
|
|
|
|
For synchronous writes, keep separate i/o counters for each write, so
processes don't have to wait for one another to finish (e.g., nfsd seems
to be a little happier now, though I haven't measured the difference).
Synchronous checkpoints, however, must always wait for all i/o to finish.
Take the contents of the callback functions and have them run in thread
context instead (aiodoned thread). lfs_iocount no longer has to be
protected in splbio(), and quite a bit less of the segment construction
loop needs to be in splbio() as well.
If lfs_markv is handed a block that is not the correct size according to
the inode, refuse to process it. (Formerly it was extended to the "correct"
size.) This is possibly more prone to deadlock, but less prone to corruption.
lfs_segclean now outright refuses to clean segments that appear to have live
bytes in them. Again this may be more prone to deadlock but avoids
corruption.
Replace ufsspec_close and ufsfifo_close with LFS equivalents; this means
that no UFS functions need to know about LFS_ITIMES any more. Remove
the reference from ufs/inode.h.
Tested on i386, test-compiled on alpha.
2002-06-16 04:13:15 +04:00
|
|
|
static void lfs_generic_callback(struct buf *, void (*)(struct buf *));
|
|
|
|
static void lfs_super_aiodone(struct buf *);
|
|
|
|
static void lfs_cluster_aiodone(struct buf *);
|
2002-05-15 00:03:53 +04:00
|
|
|
static void lfs_cluster_callback(struct buf *);
|
|
|
|
static struct buf **lookahead_pagemove(struct buf **, int, size_t *);
|
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/*
|
|
|
|
* Determine if it's OK to start a partial in this segment, or if we need
|
|
|
|
* to go on to a new segment.
|
|
|
|
*/
|
|
|
|
#define LFS_PARTIAL_FITS(fs) \
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
((fs)->lfs_fsbpseg - ((fs)->lfs_offset - (fs)->lfs_curseg) > \
|
|
|
|
fragstofsb((fs), (fs)->lfs_frag))
|
|
|
|
|
|
|
|
void lfs_callback(struct buf *);
|
|
|
|
int lfs_gather(struct lfs *, struct segment *,
|
|
|
|
struct vnode *, int (*)(struct lfs *, struct buf *));
|
|
|
|
int lfs_gatherblock(struct segment *, struct buf *, int *);
|
2003-01-25 00:55:02 +03:00
|
|
|
void lfs_iset(struct inode *, daddr_t, time_t);
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
int lfs_match_fake(struct lfs *, struct buf *);
|
|
|
|
int lfs_match_data(struct lfs *, struct buf *);
|
|
|
|
int lfs_match_dindir(struct lfs *, struct buf *);
|
|
|
|
int lfs_match_indir(struct lfs *, struct buf *);
|
|
|
|
int lfs_match_tindir(struct lfs *, struct buf *);
|
|
|
|
void lfs_newseg(struct lfs *);
|
2003-01-25 00:55:02 +03:00
|
|
|
/* XXX ondisk32 */
|
|
|
|
void lfs_shellsort(struct buf **, int32_t *, int);
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
void lfs_supercallback(struct buf *);
|
|
|
|
void lfs_updatemeta(struct segment *);
|
|
|
|
int lfs_vref(struct vnode *);
|
|
|
|
void lfs_vunref(struct vnode *);
|
|
|
|
void lfs_writefile(struct lfs *, struct segment *, struct vnode *);
|
|
|
|
int lfs_writeinode(struct lfs *, struct segment *, struct inode *);
|
|
|
|
int lfs_writeseg(struct lfs *, struct segment *);
|
|
|
|
void lfs_writesuper(struct lfs *, daddr_t);
|
|
|
|
int lfs_writevnodes(struct lfs *fs, struct mount *mp,
|
|
|
|
struct segment *sp, int dirops);
|
1994-06-08 15:41:58 +04:00
|
|
|
|
|
|
|
int lfs_allclean_wakeup; /* Cleaner wakeup address. */
|
1999-03-10 03:20:00 +03:00
|
|
|
int lfs_writeindir = 1; /* whether to flush indir on non-ckp */
|
1999-04-12 04:11:01 +04:00
|
|
|
int lfs_clean_vnhead = 0; /* Allow freeing to head of vn list */
|
1999-11-06 23:33:05 +03:00
|
|
|
int lfs_dirvcount = 0; /* # active dirops */
|
1994-06-08 15:41:58 +04:00
|
|
|
|
|
|
|
/* Statistics Counters */
|
1999-03-10 03:20:00 +03:00
|
|
|
int lfs_dostats = 1;
|
1994-06-08 15:41:58 +04:00
|
|
|
struct lfs_stats lfs_stats;
|
|
|
|
|
2000-11-17 22:14:41 +03:00
|
|
|
extern int locked_queue_count;
|
|
|
|
extern long locked_queue_bytes;
|
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/* op values to lfs_writevnodes */
|
1999-03-10 03:20:00 +03:00
|
|
|
#define VN_REG 0
|
1994-06-08 15:41:58 +04:00
|
|
|
#define VN_DIROP 1
|
|
|
|
#define VN_EMPTY 2
|
1999-03-10 03:20:00 +03:00
|
|
|
#define VN_CLEAN 3
|
|
|
|
|
|
|
|
#define LFS_MAX_ACTIVE 10
|
|
|
|
|
|
|
|
/*
|
|
|
|
* XXX KS - Set modification time on the Ifile, so the cleaner can
|
|
|
|
* read the fs mod time off of it. We don't set IN_UPDATE here,
|
|
|
|
* since we don't really need this to be flushed to disk (and in any
|
|
|
|
* case that wouldn't happen to the Ifile until we checkpoint).
|
|
|
|
*/
|
|
|
|
void
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
lfs_imtime(struct lfs *fs)
|
1999-03-10 03:20:00 +03:00
|
|
|
{
|
|
|
|
struct timespec ts;
|
|
|
|
struct inode *ip;
|
|
|
|
|
|
|
|
TIMEVAL_TO_TIMESPEC(&time, &ts);
|
|
|
|
ip = VTOI(fs->lfs_ivnode);
|
|
|
|
ip->i_ffs_mtime = ts.tv_sec;
|
|
|
|
ip->i_ffs_mtimensec = ts.tv_nsec;
|
|
|
|
}
|
1994-06-08 15:41:58 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Ifile and meta data blocks are not marked busy, so segment writes MUST be
|
|
|
|
* single threaded. Currently, there are two paths into lfs_segwrite, sync()
|
|
|
|
* and getnewbuf(). They both mark the file system busy. Lfs_vflush()
|
|
|
|
* explicitly marks the file system busy. So lfs_segwrite is safe. I think.
|
|
|
|
*/
|
|
|
|
|
1999-03-10 03:20:00 +03:00
|
|
|
#define SET_FLUSHING(fs,vp) (fs)->lfs_flushvp = (vp)
|
|
|
|
#define IS_FLUSHING(fs,vp) ((fs)->lfs_flushvp == (vp))
|
|
|
|
#define CLR_FLUSHING(fs,vp) (fs)->lfs_flushvp = NULL
|
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
int
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
lfs_vflush(struct vnode *vp)
|
1994-06-08 15:41:58 +04:00
|
|
|
{
|
|
|
|
struct inode *ip;
|
|
|
|
struct lfs *fs;
|
|
|
|
struct segment *sp;
|
2000-01-15 00:38:46 +03:00
|
|
|
struct buf *bp, *nbp, *tbp, *tnbp;
|
1999-09-04 02:48:51 +04:00
|
|
|
int error, s;
|
1999-03-26 01:26:52 +03:00
|
|
|
|
1999-03-30 20:03:16 +04:00
|
|
|
ip = VTOI(vp);
|
|
|
|
fs = VFSTOUFS(vp->v_mount)->um_lfs;
|
|
|
|
|
2001-11-24 00:44:25 +03:00
|
|
|
if (ip->i_flag & IN_CLEANING) {
|
1999-03-26 01:26:52 +03:00
|
|
|
#ifdef DEBUG_LFS
|
|
|
|
ivndebug(vp,"vflush/in_cleaning");
|
|
|
|
#endif
|
2000-07-06 02:25:43 +04:00
|
|
|
LFS_CLR_UINO(ip, IN_CLEANING);
|
|
|
|
LFS_SET_UINO(ip, IN_MODIFIED);
|
|
|
|
|
2000-01-15 00:38:46 +03:00
|
|
|
/*
|
|
|
|
* Toss any cleaning buffers that have real counterparts
|
|
|
|
* to avoid losing new data
|
|
|
|
*/
|
|
|
|
s = splbio();
|
2002-05-18 01:42:38 +04:00
|
|
|
for (bp = LIST_FIRST(&vp->v_dirtyblkhd); bp; bp = nbp) {
|
|
|
|
nbp = LIST_NEXT(bp, b_vnbufs);
|
2001-11-24 00:44:25 +03:00
|
|
|
if (bp->b_flags & B_CALL) {
|
2002-05-18 01:42:38 +04:00
|
|
|
for (tbp = LIST_FIRST(&vp->v_dirtyblkhd); tbp;
|
2001-11-24 00:44:25 +03:00
|
|
|
tbp = tnbp)
|
2000-01-15 00:38:46 +03:00
|
|
|
{
|
2002-05-18 01:42:38 +04:00
|
|
|
tnbp = LIST_NEXT(tbp, b_vnbufs);
|
2001-11-24 00:44:25 +03:00
|
|
|
if (tbp->b_vp == bp->b_vp
|
2000-01-15 00:38:46 +03:00
|
|
|
&& tbp->b_lblkno == bp->b_lblkno
|
|
|
|
&& tbp != bp)
|
|
|
|
{
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
fs->lfs_avail += btofsb(fs, bp->b_bcount);
|
2000-11-17 22:14:41 +03:00
|
|
|
wakeup(&fs->lfs_avail);
|
2000-01-15 00:38:46 +03:00
|
|
|
lfs_freebuf(bp);
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
bp = NULL;
|
|
|
|
break;
|
2000-01-15 00:38:46 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
splx(s);
|
1999-03-26 01:26:52 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
/* If the node is being written, wait until that is done */
|
2002-05-15 00:03:53 +04:00
|
|
|
s = splbio();
|
2001-11-24 00:44:25 +03:00
|
|
|
if (WRITEINPROG(vp)) {
|
1999-03-26 01:26:52 +03:00
|
|
|
#ifdef DEBUG_LFS
|
|
|
|
ivndebug(vp,"vflush/writeinprog");
|
|
|
|
#endif
|
|
|
|
tsleep(vp, PRIBIO+1, "lfs_vw", 0);
|
|
|
|
}
|
2002-05-15 00:03:53 +04:00
|
|
|
splx(s);
|
1994-06-08 15:41:58 +04:00
|
|
|
|
1999-03-10 03:20:00 +03:00
|
|
|
/* Protect against VXLOCK deadlock in vinvalbuf() */
|
1994-06-08 15:41:58 +04:00
|
|
|
lfs_seglock(fs, SEGM_SYNC);
|
1999-09-04 02:48:51 +04:00
|
|
|
|
|
|
|
/* If we're supposed to flush a freed inode, just toss it */
|
|
|
|
/* XXX - seglock, so these buffers can't be gathered, right? */
|
2001-11-24 00:44:25 +03:00
|
|
|
if (ip->i_ffs_mode == 0) {
|
1999-09-04 02:48:51 +04:00
|
|
|
printf("lfs_vflush: ino %d is freed, not flushing\n",
|
|
|
|
ip->i_number);
|
|
|
|
s = splbio();
|
2002-05-18 01:42:38 +04:00
|
|
|
for (bp = LIST_FIRST(&vp->v_dirtyblkhd); bp; bp = nbp) {
|
|
|
|
nbp = LIST_NEXT(bp, b_vnbufs);
|
2000-11-17 22:14:41 +03:00
|
|
|
if (bp->b_flags & B_DELWRI) { /* XXX always true? */
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
fs->lfs_avail += btofsb(fs, bp->b_bcount);
|
2000-11-17 22:14:41 +03:00
|
|
|
wakeup(&fs->lfs_avail);
|
|
|
|
}
|
1999-09-04 02:48:51 +04:00
|
|
|
/* Copied from lfs_writeseg */
|
|
|
|
if (bp->b_flags & B_CALL) {
|
|
|
|
/* if B_CALL, it was created with newbuf */
|
|
|
|
lfs_freebuf(bp);
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
bp = NULL;
|
1999-09-04 02:48:51 +04:00
|
|
|
} else {
|
|
|
|
bremfree(bp);
|
2000-11-17 22:14:41 +03:00
|
|
|
LFS_UNLOCK_BUF(bp);
|
1999-09-04 02:48:51 +04:00
|
|
|
bp->b_flags &= ~(B_ERROR | B_READ | B_DELWRI |
|
2000-11-17 22:14:41 +03:00
|
|
|
B_GATHERED);
|
1999-09-04 02:48:51 +04:00
|
|
|
bp->b_flags |= B_DONE;
|
|
|
|
reassignbuf(bp, vp);
|
|
|
|
brelse(bp);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
splx(s);
|
2000-07-06 02:25:43 +04:00
|
|
|
LFS_CLR_UINO(ip, IN_CLEANING);
|
|
|
|
LFS_CLR_UINO(ip, IN_MODIFIED | IN_ACCESSED);
|
2000-05-31 05:40:01 +04:00
|
|
|
ip->i_flag &= ~IN_ALLMOD;
|
1999-09-04 02:48:51 +04:00
|
|
|
printf("lfs_vflush: done not flushing ino %d\n",
|
|
|
|
ip->i_number);
|
|
|
|
lfs_segunlock(fs);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
1999-03-10 03:20:00 +03:00
|
|
|
SET_FLUSHING(fs,vp);
|
For synchronous writes, keep separate i/o counters for each write, so
processes don't have to wait for one another to finish (e.g., nfsd seems
to be a little happier now, though I haven't measured the difference).
Synchronous checkpoints, however, must always wait for all i/o to finish.
Take the contents of the callback functions and have them run in thread
context instead (aiodoned thread). lfs_iocount no longer has to be
protected in splbio(), and quite a bit less of the segment construction
loop needs to be in splbio() as well.
If lfs_markv is handed a block that is not the correct size according to
the inode, refuse to process it. (Formerly it was extended to the "correct"
size.) This is possibly more prone to deadlock, but less prone to corruption.
lfs_segclean now outright refuses to clean segments that appear to have live
bytes in them. Again this may be more prone to deadlock but avoids
corruption.
Replace ufsspec_close and ufsfifo_close with LFS equivalents; this means
that no UFS functions need to know about LFS_ITIMES any more. Remove
the reference from ufs/inode.h.
Tested on i386, test-compiled on alpha.
2002-06-16 04:13:15 +04:00
|
|
|
if (fs->lfs_nactive > LFS_MAX_ACTIVE ||
|
|
|
|
(fs->lfs_sp->seg_flags & SEGM_CKP)) {
|
|
|
|
error = lfs_segwrite(vp->v_mount, SEGM_CKP | SEGM_SYNC);
|
1999-03-10 03:20:00 +03:00
|
|
|
CLR_FLUSHING(fs,vp);
|
|
|
|
lfs_segunlock(fs);
|
|
|
|
return error;
|
|
|
|
}
|
1994-06-08 15:41:58 +04:00
|
|
|
sp = fs->lfs_sp;
|
|
|
|
|
2002-05-18 01:42:38 +04:00
|
|
|
if (LIST_FIRST(&vp->v_dirtyblkhd) == NULL) {
|
1994-06-08 15:41:58 +04:00
|
|
|
lfs_writevnodes(fs, vp->v_mount, sp, VN_EMPTY);
|
2001-11-24 00:44:25 +03:00
|
|
|
} else if ((ip->i_flag & IN_CLEANING) &&
|
Various bug-fixes to LFS, to wit:
Kernel:
* Add runtime quantity lfs_ravail, the number of disk-blocks reserved
for writing. Writes to the filesystem first reserve a maximum amount
of blocks before their write is allowed to proceed; after the blocks
are allocated the reserved total is reduced by a corresponding amount.
If the lfs_reserve function cannot immediately reserve the requested
number of blocks, the inode is unlocked, and the thread sleeps until
the cleaner has made enough space available for the blocks to be
reserved. In this way large files can be written to the filesystem
(or, smaller files can be written to a nearly-full but thoroughly
clean filesystem) and the cleaner can still function properly.
* Remove explicit switching on dlfs_minfreeseg from the kernel code; it
is now merely a fs-creation parameter used to compute dlfs_avail and
dlfs_bfree (and used by fsck_lfs(8) to check their accuracy). Its
former role is better assumed by a properly computed dlfs_avail.
* Bounds-check inode numbers submitted through lfs_bmapv and lfs_markv.
This prevents a panic, but, if the cleaner is feeding the filesystem
the wrong data, you are still in a world of hurt.
* Cleanup: remove explicit references of DEV_BSIZE in favor of
btodb()/dbtob().
lfs_cleanerd:
* Make -n mean "send N segments' blocks through a single call to
lfs_markv". Previously it had meant "clean N segments though N calls
to lfs_markv, before looking again to see if more need to be cleaned".
The new behavior gives better packing of direct data on disk with as
little metadata as possible, largely alleviating the problem that the
cleaner can consume more disk through inefficient use of metadata than
it frees by moving dirty data away from clean "holes" to produce
entirely clean segments.
* Make -b mean "read as many segments as necessary to write N segments
of dirty data back to disk", rather than its former meaning of "read
as many segments as necessary to free N segments worth of space". The
new meaning, combined with the new -n behavior described above,
further aids in cleaning storage efficiency as entire segments can be
written at once, using as few blocks as possible for segment summaries
and inode blocks.
* Make the cleaner take note of segments which could not be cleaned due
to error, and not attempt to clean them until they are entirely free
of dirty blocks. This prevents the case in which a cleanerd running
with -n 1 and without -b (formerly the default) would spin trying
repeatedly to clean a corrupt segment, while the remaining space
filled and deadlocked the filesystem.
* Update the lfs_cleanerd manual page to describe all the options,
including the changes mentioned here (in particular, the -b and -n
flags were previously undocumented).
fsck_lfs:
* Check, and optionally fix, lfs_avail (to an exact figure) and
lfs_bfree (within a margin of error) in pass 5.
newfs_lfs:
* Reduce the default dlfs_minfreeseg to 1/20 of the total segments.
* Add a warning if the sgs disklabel field is 16 (the default for FFS'
cpg, but not usually desirable for LFS' sgs: 5--8 is a better range).
* Change the calculation of lfs_avail and lfs_bfree, corresponding to
the kernel changes mentioned above.
mount_lfs:
* Add -N and -b options to pass corresponding -n and -b options to
lfs_cleanerd.
* Default to calling lfs_cleanerd with "-b -n 4".
[All of these changes were largely tested in the 1.5 branch, with the
idea that they (along with previous un-pulled-up work) could be applied
to the branch while it was still in ALPHA2; however my test system has
experienced corruption on another filesystem (/dev/console has gone
missing :^), and, while I believe this unrelated to the LFS changes, I
cannot with good conscience request that the changes be pulled up.]
2000-09-09 08:49:54 +04:00
|
|
|
(fs->lfs_sp->seg_flags & SEGM_CLEAN)) {
|
1999-03-26 01:26:52 +03:00
|
|
|
#ifdef DEBUG_LFS
|
|
|
|
ivndebug(vp,"vflush/clean");
|
|
|
|
#endif
|
|
|
|
lfs_writevnodes(fs, vp->v_mount, sp, VN_CLEAN);
|
2002-05-15 00:03:53 +04:00
|
|
|
} else if (lfs_dostats) {
|
2002-05-18 01:42:38 +04:00
|
|
|
if (LIST_FIRST(&vp->v_dirtyblkhd) || (VTOI(vp)->i_flag & IN_ALLMOD))
|
1999-03-10 03:20:00 +03:00
|
|
|
++lfs_stats.vflush_invoked;
|
|
|
|
#ifdef DEBUG_LFS
|
1999-03-26 01:26:52 +03:00
|
|
|
ivndebug(vp,"vflush");
|
1999-03-10 03:20:00 +03:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
1999-03-26 01:26:52 +03:00
|
|
|
#ifdef DIAGNOSTIC
|
1999-03-30 01:51:38 +04:00
|
|
|
/* XXX KS This actually can happen right now, though it shouldn't(?) */
|
2001-11-24 00:44:25 +03:00
|
|
|
if (vp->v_flag & VDIROP) {
|
1999-03-30 01:51:38 +04:00
|
|
|
printf("lfs_vflush: flushing VDIROP, this shouldn\'t be\n");
|
|
|
|
/* panic("VDIROP being flushed...this can\'t happen"); */
|
1999-03-10 03:20:00 +03:00
|
|
|
}
|
2001-11-24 00:44:25 +03:00
|
|
|
if (vp->v_usecount < 0) {
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
printf("usecount=%ld\n", (long)vp->v_usecount);
|
1999-03-26 01:26:52 +03:00
|
|
|
panic("lfs_vflush: usecount<0");
|
|
|
|
}
|
|
|
|
#endif
|
1994-06-08 15:41:58 +04:00
|
|
|
|
|
|
|
do {
|
|
|
|
do {
|
2002-05-18 01:42:38 +04:00
|
|
|
if (LIST_FIRST(&vp->v_dirtyblkhd) != NULL)
|
1994-06-08 15:41:58 +04:00
|
|
|
lfs_writefile(fs, sp, vp);
|
|
|
|
} while (lfs_writeinode(fs, sp, ip));
|
|
|
|
} while (lfs_writeseg(fs, sp) && ip->i_number == LFS_IFILE_INUM);
|
1999-03-10 03:20:00 +03:00
|
|
|
|
2001-11-24 00:44:25 +03:00
|
|
|
if (lfs_dostats) {
|
1999-03-10 03:20:00 +03:00
|
|
|
++lfs_stats.nwrites;
|
|
|
|
if (sp->seg_flags & SEGM_SYNC)
|
|
|
|
++lfs_stats.nsync_writes;
|
|
|
|
if (sp->seg_flags & SEGM_CKP)
|
|
|
|
++lfs_stats.ncheckpoints;
|
|
|
|
}
|
2002-05-15 00:03:53 +04:00
|
|
|
/*
|
|
|
|
* If we were called from somewhere that has already held the seglock
|
|
|
|
* (e.g., lfs_markv()), the lfs_segunlock will not wait for
|
|
|
|
* the write to complete because we are still locked.
|
|
|
|
* Since lfs_vflush() must return the vnode with no dirty buffers,
|
|
|
|
* we must explicitly wait, if that is the case.
|
|
|
|
*
|
|
|
|
* We compare the iocount against 1, not 0, because it is
|
|
|
|
* artificially incremented by lfs_seglock().
|
|
|
|
*/
|
|
|
|
if (fs->lfs_seglock > 1) {
|
|
|
|
while (fs->lfs_iocount > 1)
|
|
|
|
(void)tsleep(&fs->lfs_iocount, PRIBIO + 1,
|
|
|
|
"lfs_vflush", 0);
|
|
|
|
}
|
1994-06-08 15:41:58 +04:00
|
|
|
lfs_segunlock(fs);
|
1999-03-10 03:20:00 +03:00
|
|
|
|
|
|
|
CLR_FLUSHING(fs,vp);
|
1994-06-08 15:41:58 +04:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
1999-03-26 00:39:18 +03:00
|
|
|
#ifdef DEBUG_LFS_VERBOSE
|
2001-11-24 00:44:25 +03:00
|
|
|
# define vndebug(vp,str) if (VTOI(vp)->i_flag & IN_CLEANING) printf("not writing ino %d because %s (op %d)\n",VTOI(vp)->i_number,(str),op)
|
1999-03-26 00:39:18 +03:00
|
|
|
#else
|
|
|
|
# define vndebug(vp,str)
|
|
|
|
#endif
|
1999-03-10 03:20:00 +03:00
|
|
|
|
|
|
|
int
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
lfs_writevnodes(struct lfs *fs, struct mount *mp, struct segment *sp, int op)
|
1994-06-08 15:41:58 +04:00
|
|
|
{
|
|
|
|
struct inode *ip;
|
2002-05-24 03:05:25 +04:00
|
|
|
struct vnode *vp, *nvp;
|
2001-11-24 00:44:25 +03:00
|
|
|
int inodes_written = 0, only_cleaning;
|
1994-06-08 15:41:58 +04:00
|
|
|
|
1999-03-10 03:20:00 +03:00
|
|
|
#ifndef LFS_NO_BACKVP_HACK
|
|
|
|
/* BEGIN HACK */
|
2002-05-18 01:42:38 +04:00
|
|
|
#define VN_OFFSET (((caddr_t)&LIST_NEXT(vp, v_mntvnodes)) - (caddr_t)vp)
|
|
|
|
#define BACK_VP(VP) ((struct vnode *)(((caddr_t)(VP)->v_mntvnodes.le_prev) - VN_OFFSET))
|
|
|
|
#define BEG_OF_VLIST ((struct vnode *)(((caddr_t)&(LIST_FIRST(&mp->mnt_vnodelist))) - VN_OFFSET))
|
1999-03-10 03:20:00 +03:00
|
|
|
|
|
|
|
/* Find last vnode. */
|
2002-05-18 01:42:38 +04:00
|
|
|
loop: for (vp = LIST_FIRST(&mp->mnt_vnodelist);
|
|
|
|
vp && LIST_NEXT(vp, v_mntvnodes) != NULL;
|
|
|
|
vp = LIST_NEXT(vp, v_mntvnodes));
|
2002-05-24 03:05:25 +04:00
|
|
|
for (; vp && vp != BEG_OF_VLIST; vp = nvp) {
|
|
|
|
nvp = BACK_VP(vp);
|
1999-03-10 03:20:00 +03:00
|
|
|
#else
|
|
|
|
loop:
|
2002-05-24 03:05:25 +04:00
|
|
|
for (vp = LIST_FIRST(&mp->mnt_vnodelist); vp; vp = nvp) {
|
|
|
|
nvp = LIST_NEXT(vp, v_mntvnodes);
|
1999-03-10 03:20:00 +03:00
|
|
|
#endif
|
1994-06-08 15:41:58 +04:00
|
|
|
/*
|
|
|
|
* If the vnode that we are about to sync is no longer
|
|
|
|
* associated with this mount point, start over.
|
|
|
|
*/
|
Various bug-fixes to LFS, to wit:
Kernel:
* Add runtime quantity lfs_ravail, the number of disk-blocks reserved
for writing. Writes to the filesystem first reserve a maximum amount
of blocks before their write is allowed to proceed; after the blocks
are allocated the reserved total is reduced by a corresponding amount.
If the lfs_reserve function cannot immediately reserve the requested
number of blocks, the inode is unlocked, and the thread sleeps until
the cleaner has made enough space available for the blocks to be
reserved. In this way large files can be written to the filesystem
(or, smaller files can be written to a nearly-full but thoroughly
clean filesystem) and the cleaner can still function properly.
* Remove explicit switching on dlfs_minfreeseg from the kernel code; it
is now merely a fs-creation parameter used to compute dlfs_avail and
dlfs_bfree (and used by fsck_lfs(8) to check their accuracy). Its
former role is better assumed by a properly computed dlfs_avail.
* Bounds-check inode numbers submitted through lfs_bmapv and lfs_markv.
This prevents a panic, but, if the cleaner is feeding the filesystem
the wrong data, you are still in a world of hurt.
* Cleanup: remove explicit references of DEV_BSIZE in favor of
btodb()/dbtob().
lfs_cleanerd:
* Make -n mean "send N segments' blocks through a single call to
lfs_markv". Previously it had meant "clean N segments though N calls
to lfs_markv, before looking again to see if more need to be cleaned".
The new behavior gives better packing of direct data on disk with as
little metadata as possible, largely alleviating the problem that the
cleaner can consume more disk through inefficient use of metadata than
it frees by moving dirty data away from clean "holes" to produce
entirely clean segments.
* Make -b mean "read as many segments as necessary to write N segments
of dirty data back to disk", rather than its former meaning of "read
as many segments as necessary to free N segments worth of space". The
new meaning, combined with the new -n behavior described above,
further aids in cleaning storage efficiency as entire segments can be
written at once, using as few blocks as possible for segment summaries
and inode blocks.
* Make the cleaner take note of segments which could not be cleaned due
to error, and not attempt to clean them until they are entirely free
of dirty blocks. This prevents the case in which a cleanerd running
with -n 1 and without -b (formerly the default) would spin trying
repeatedly to clean a corrupt segment, while the remaining space
filled and deadlocked the filesystem.
* Update the lfs_cleanerd manual page to describe all the options,
including the changes mentioned here (in particular, the -b and -n
flags were previously undocumented).
fsck_lfs:
* Check, and optionally fix, lfs_avail (to an exact figure) and
lfs_bfree (within a margin of error) in pass 5.
newfs_lfs:
* Reduce the default dlfs_minfreeseg to 1/20 of the total segments.
* Add a warning if the sgs disklabel field is 16 (the default for FFS'
cpg, but not usually desirable for LFS' sgs: 5--8 is a better range).
* Change the calculation of lfs_avail and lfs_bfree, corresponding to
the kernel changes mentioned above.
mount_lfs:
* Add -N and -b options to pass corresponding -n and -b options to
lfs_cleanerd.
* Default to calling lfs_cleanerd with "-b -n 4".
[All of these changes were largely tested in the 1.5 branch, with the
idea that they (along with previous un-pulled-up work) could be applied
to the branch while it was still in ALPHA2; however my test system has
experienced corruption on another filesystem (/dev/console has gone
missing :^), and, while I believe this unrelated to the LFS changes, I
cannot with good conscience request that the changes be pulled up.]
2000-09-09 08:49:54 +04:00
|
|
|
if (vp->v_mount != mp) {
|
|
|
|
printf("lfs_writevnodes: starting over\n");
|
1994-06-08 15:41:58 +04:00
|
|
|
goto loop;
|
Various bug-fixes to LFS, to wit:
Kernel:
* Add runtime quantity lfs_ravail, the number of disk-blocks reserved
for writing. Writes to the filesystem first reserve a maximum amount
of blocks before their write is allowed to proceed; after the blocks
are allocated the reserved total is reduced by a corresponding amount.
If the lfs_reserve function cannot immediately reserve the requested
number of blocks, the inode is unlocked, and the thread sleeps until
the cleaner has made enough space available for the blocks to be
reserved. In this way large files can be written to the filesystem
(or, smaller files can be written to a nearly-full but thoroughly
clean filesystem) and the cleaner can still function properly.
* Remove explicit switching on dlfs_minfreeseg from the kernel code; it
is now merely a fs-creation parameter used to compute dlfs_avail and
dlfs_bfree (and used by fsck_lfs(8) to check their accuracy). Its
former role is better assumed by a properly computed dlfs_avail.
* Bounds-check inode numbers submitted through lfs_bmapv and lfs_markv.
This prevents a panic, but, if the cleaner is feeding the filesystem
the wrong data, you are still in a world of hurt.
* Cleanup: remove explicit references of DEV_BSIZE in favor of
btodb()/dbtob().
lfs_cleanerd:
* Make -n mean "send N segments' blocks through a single call to
lfs_markv". Previously it had meant "clean N segments though N calls
to lfs_markv, before looking again to see if more need to be cleaned".
The new behavior gives better packing of direct data on disk with as
little metadata as possible, largely alleviating the problem that the
cleaner can consume more disk through inefficient use of metadata than
it frees by moving dirty data away from clean "holes" to produce
entirely clean segments.
* Make -b mean "read as many segments as necessary to write N segments
of dirty data back to disk", rather than its former meaning of "read
as many segments as necessary to free N segments worth of space". The
new meaning, combined with the new -n behavior described above,
further aids in cleaning storage efficiency as entire segments can be
written at once, using as few blocks as possible for segment summaries
and inode blocks.
* Make the cleaner take note of segments which could not be cleaned due
to error, and not attempt to clean them until they are entirely free
of dirty blocks. This prevents the case in which a cleanerd running
with -n 1 and without -b (formerly the default) would spin trying
repeatedly to clean a corrupt segment, while the remaining space
filled and deadlocked the filesystem.
* Update the lfs_cleanerd manual page to describe all the options,
including the changes mentioned here (in particular, the -b and -n
flags were previously undocumented).
fsck_lfs:
* Check, and optionally fix, lfs_avail (to an exact figure) and
lfs_bfree (within a margin of error) in pass 5.
newfs_lfs:
* Reduce the default dlfs_minfreeseg to 1/20 of the total segments.
* Add a warning if the sgs disklabel field is 16 (the default for FFS'
cpg, but not usually desirable for LFS' sgs: 5--8 is a better range).
* Change the calculation of lfs_avail and lfs_bfree, corresponding to
the kernel changes mentioned above.
mount_lfs:
* Add -N and -b options to pass corresponding -n and -b options to
lfs_cleanerd.
* Default to calling lfs_cleanerd with "-b -n 4".
[All of these changes were largely tested in the 1.5 branch, with the
idea that they (along with previous un-pulled-up work) could be applied
to the branch while it was still in ALPHA2; however my test system has
experienced corruption on another filesystem (/dev/console has gone
missing :^), and, while I believe this unrelated to the LFS changes, I
cannot with good conscience request that the changes be pulled up.]
2000-09-09 08:49:54 +04:00
|
|
|
}
|
2002-12-14 14:54:47 +03:00
|
|
|
|
|
|
|
if (vp->v_type == VNON) {
|
|
|
|
continue;
|
|
|
|
}
|
1994-06-08 15:41:58 +04:00
|
|
|
|
1999-03-10 03:20:00 +03:00
|
|
|
ip = VTOI(vp);
|
|
|
|
if ((op == VN_DIROP && !(vp->v_flag & VDIROP)) ||
|
|
|
|
(op != VN_DIROP && op != VN_CLEAN && (vp->v_flag & VDIROP))) {
|
|
|
|
vndebug(vp,"dirop");
|
1994-06-08 15:41:58 +04:00
|
|
|
continue;
|
1999-03-10 03:20:00 +03:00
|
|
|
}
|
|
|
|
|
2002-05-18 01:42:38 +04:00
|
|
|
if (op == VN_EMPTY && LIST_FIRST(&vp->v_dirtyblkhd)) {
|
1999-03-10 03:20:00 +03:00
|
|
|
vndebug(vp,"empty");
|
1994-06-08 15:41:58 +04:00
|
|
|
continue;
|
1999-03-10 03:20:00 +03:00
|
|
|
}
|
1994-06-08 15:41:58 +04:00
|
|
|
|
2001-11-24 00:44:25 +03:00
|
|
|
if (op == VN_CLEAN && ip->i_number != LFS_IFILE_INUM
|
2000-01-15 00:38:46 +03:00
|
|
|
&& vp != fs->lfs_flushvp
|
1999-03-10 03:20:00 +03:00
|
|
|
&& !(ip->i_flag & IN_CLEANING)) {
|
|
|
|
vndebug(vp,"cleaning");
|
1994-06-08 15:41:58 +04:00
|
|
|
continue;
|
1999-03-10 03:20:00 +03:00
|
|
|
}
|
1994-06-08 15:41:58 +04:00
|
|
|
|
1999-03-10 03:20:00 +03:00
|
|
|
if (lfs_vref(vp)) {
|
|
|
|
vndebug(vp,"vref");
|
1994-06-08 15:41:58 +04:00
|
|
|
continue;
|
1999-03-10 03:20:00 +03:00
|
|
|
}
|
|
|
|
|
1999-03-30 20:11:43 +04:00
|
|
|
only_cleaning = 0;
|
1994-06-08 15:41:58 +04:00
|
|
|
/*
|
2000-07-05 02:30:37 +04:00
|
|
|
* Write the inode/file if dirty and it's not the IFILE.
|
1994-06-08 15:41:58 +04:00
|
|
|
*/
|
2000-05-31 05:40:01 +04:00
|
|
|
if ((ip->i_flag & IN_ALLMOD) ||
|
2002-05-18 01:42:38 +04:00
|
|
|
(LIST_FIRST(&vp->v_dirtyblkhd) != NULL))
|
1999-03-10 03:20:00 +03:00
|
|
|
{
|
2001-11-24 00:44:25 +03:00
|
|
|
only_cleaning = ((ip->i_flag & IN_ALLMOD) == IN_CLEANING);
|
1999-03-26 01:38:28 +03:00
|
|
|
|
2001-11-24 00:44:25 +03:00
|
|
|
if (ip->i_number != LFS_IFILE_INUM
|
2002-05-18 01:42:38 +04:00
|
|
|
&& LIST_FIRST(&vp->v_dirtyblkhd) != NULL)
|
1999-03-10 03:20:00 +03:00
|
|
|
{
|
1994-06-08 15:41:58 +04:00
|
|
|
lfs_writefile(fs, sp, vp);
|
1999-03-10 03:20:00 +03:00
|
|
|
}
|
2002-05-18 01:42:38 +04:00
|
|
|
if (LIST_FIRST(&vp->v_dirtyblkhd) != NULL) {
|
2001-11-24 00:44:25 +03:00
|
|
|
if (WRITEINPROG(vp)) {
|
1999-03-10 03:20:00 +03:00
|
|
|
#ifdef DEBUG_LFS
|
1999-03-26 00:39:18 +03:00
|
|
|
ivndebug(vp,"writevnodes/write2");
|
1999-03-10 03:20:00 +03:00
|
|
|
#endif
|
2001-11-24 00:44:25 +03:00
|
|
|
} else if (!(ip->i_flag & IN_ALLMOD)) {
|
1999-03-10 03:20:00 +03:00
|
|
|
#ifdef DEBUG_LFS
|
|
|
|
printf("<%d>",ip->i_number);
|
|
|
|
#endif
|
2000-07-06 02:25:43 +04:00
|
|
|
LFS_SET_UINO(ip, IN_MODIFIED);
|
1999-03-10 03:20:00 +03:00
|
|
|
}
|
|
|
|
}
|
1994-06-08 15:41:58 +04:00
|
|
|
(void) lfs_writeinode(fs, sp, ip);
|
1999-03-10 03:20:00 +03:00
|
|
|
inodes_written++;
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
1999-03-10 03:20:00 +03:00
|
|
|
|
2000-06-28 00:57:11 +04:00
|
|
|
if (lfs_clean_vnhead && only_cleaning)
|
1999-03-26 01:38:28 +03:00
|
|
|
lfs_vunref_head(vp);
|
|
|
|
else
|
|
|
|
lfs_vunref(vp);
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
1999-03-10 03:20:00 +03:00
|
|
|
return inodes_written;
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
|
|
|
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
/*
|
|
|
|
* Do a checkpoint.
|
|
|
|
*/
|
1994-06-08 15:41:58 +04:00
|
|
|
int
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
lfs_segwrite(struct mount *mp, int flags)
|
1994-06-08 15:41:58 +04:00
|
|
|
{
|
|
|
|
struct buf *bp;
|
|
|
|
struct inode *ip;
|
|
|
|
struct lfs *fs;
|
|
|
|
struct segment *sp;
|
|
|
|
struct vnode *vp;
|
|
|
|
SEGUSE *segusep;
|
2003-01-25 00:55:02 +03:00
|
|
|
daddr_t ibno;
|
2000-11-12 10:58:36 +03:00
|
|
|
int do_ckp, did_ckp, error, i;
|
1999-03-10 03:20:00 +03:00
|
|
|
int writer_set = 0;
|
2000-11-12 10:58:36 +03:00
|
|
|
int dirty;
|
2002-05-15 00:03:53 +04:00
|
|
|
int redo;
|
1999-03-10 03:20:00 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
fs = VFSTOUFS(mp)->um_lfs;
|
|
|
|
|
2000-07-03 05:45:46 +04:00
|
|
|
if (fs->lfs_ronly)
|
|
|
|
return EROFS;
|
|
|
|
|
1999-03-10 03:20:00 +03:00
|
|
|
lfs_imtime(fs);
|
Various bug-fixes to LFS, to wit:
Kernel:
* Add runtime quantity lfs_ravail, the number of disk-blocks reserved
for writing. Writes to the filesystem first reserve a maximum amount
of blocks before their write is allowed to proceed; after the blocks
are allocated the reserved total is reduced by a corresponding amount.
If the lfs_reserve function cannot immediately reserve the requested
number of blocks, the inode is unlocked, and the thread sleeps until
the cleaner has made enough space available for the blocks to be
reserved. In this way large files can be written to the filesystem
(or, smaller files can be written to a nearly-full but thoroughly
clean filesystem) and the cleaner can still function properly.
* Remove explicit switching on dlfs_minfreeseg from the kernel code; it
is now merely a fs-creation parameter used to compute dlfs_avail and
dlfs_bfree (and used by fsck_lfs(8) to check their accuracy). Its
former role is better assumed by a properly computed dlfs_avail.
* Bounds-check inode numbers submitted through lfs_bmapv and lfs_markv.
This prevents a panic, but, if the cleaner is feeding the filesystem
the wrong data, you are still in a world of hurt.
* Cleanup: remove explicit references of DEV_BSIZE in favor of
btodb()/dbtob().
lfs_cleanerd:
* Make -n mean "send N segments' blocks through a single call to
lfs_markv". Previously it had meant "clean N segments though N calls
to lfs_markv, before looking again to see if more need to be cleaned".
The new behavior gives better packing of direct data on disk with as
little metadata as possible, largely alleviating the problem that the
cleaner can consume more disk through inefficient use of metadata than
it frees by moving dirty data away from clean "holes" to produce
entirely clean segments.
* Make -b mean "read as many segments as necessary to write N segments
of dirty data back to disk", rather than its former meaning of "read
as many segments as necessary to free N segments worth of space". The
new meaning, combined with the new -n behavior described above,
further aids in cleaning storage efficiency as entire segments can be
written at once, using as few blocks as possible for segment summaries
and inode blocks.
* Make the cleaner take note of segments which could not be cleaned due
to error, and not attempt to clean them until they are entirely free
of dirty blocks. This prevents the case in which a cleanerd running
with -n 1 and without -b (formerly the default) would spin trying
repeatedly to clean a corrupt segment, while the remaining space
filled and deadlocked the filesystem.
* Update the lfs_cleanerd manual page to describe all the options,
including the changes mentioned here (in particular, the -b and -n
flags were previously undocumented).
fsck_lfs:
* Check, and optionally fix, lfs_avail (to an exact figure) and
lfs_bfree (within a margin of error) in pass 5.
newfs_lfs:
* Reduce the default dlfs_minfreeseg to 1/20 of the total segments.
* Add a warning if the sgs disklabel field is 16 (the default for FFS'
cpg, but not usually desirable for LFS' sgs: 5--8 is a better range).
* Change the calculation of lfs_avail and lfs_bfree, corresponding to
the kernel changes mentioned above.
mount_lfs:
* Add -N and -b options to pass corresponding -n and -b options to
lfs_cleanerd.
* Default to calling lfs_cleanerd with "-b -n 4".
[All of these changes were largely tested in the 1.5 branch, with the
idea that they (along with previous un-pulled-up work) could be applied
to the branch while it was still in ALPHA2; however my test system has
experienced corruption on another filesystem (/dev/console has gone
missing :^), and, while I believe this unrelated to the LFS changes, I
cannot with good conscience request that the changes be pulled up.]
2000-09-09 08:49:54 +04:00
|
|
|
|
2000-11-12 10:58:36 +03:00
|
|
|
/* printf("lfs_segwrite: ifile flags are 0x%lx\n",
|
|
|
|
(long)(VTOI(fs->lfs_ivnode)->i_flag)); */
|
|
|
|
|
Various bug-fixes to LFS, to wit:
Kernel:
* Add runtime quantity lfs_ravail, the number of disk-blocks reserved
for writing. Writes to the filesystem first reserve a maximum amount
of blocks before their write is allowed to proceed; after the blocks
are allocated the reserved total is reduced by a corresponding amount.
If the lfs_reserve function cannot immediately reserve the requested
number of blocks, the inode is unlocked, and the thread sleeps until
the cleaner has made enough space available for the blocks to be
reserved. In this way large files can be written to the filesystem
(or, smaller files can be written to a nearly-full but thoroughly
clean filesystem) and the cleaner can still function properly.
* Remove explicit switching on dlfs_minfreeseg from the kernel code; it
is now merely a fs-creation parameter used to compute dlfs_avail and
dlfs_bfree (and used by fsck_lfs(8) to check their accuracy). Its
former role is better assumed by a properly computed dlfs_avail.
* Bounds-check inode numbers submitted through lfs_bmapv and lfs_markv.
This prevents a panic, but, if the cleaner is feeding the filesystem
the wrong data, you are still in a world of hurt.
* Cleanup: remove explicit references of DEV_BSIZE in favor of
btodb()/dbtob().
lfs_cleanerd:
* Make -n mean "send N segments' blocks through a single call to
lfs_markv". Previously it had meant "clean N segments though N calls
to lfs_markv, before looking again to see if more need to be cleaned".
The new behavior gives better packing of direct data on disk with as
little metadata as possible, largely alleviating the problem that the
cleaner can consume more disk through inefficient use of metadata than
it frees by moving dirty data away from clean "holes" to produce
entirely clean segments.
* Make -b mean "read as many segments as necessary to write N segments
of dirty data back to disk", rather than its former meaning of "read
as many segments as necessary to free N segments worth of space". The
new meaning, combined with the new -n behavior described above,
further aids in cleaning storage efficiency as entire segments can be
written at once, using as few blocks as possible for segment summaries
and inode blocks.
* Make the cleaner take note of segments which could not be cleaned due
to error, and not attempt to clean them until they are entirely free
of dirty blocks. This prevents the case in which a cleanerd running
with -n 1 and without -b (formerly the default) would spin trying
repeatedly to clean a corrupt segment, while the remaining space
filled and deadlocked the filesystem.
* Update the lfs_cleanerd manual page to describe all the options,
including the changes mentioned here (in particular, the -b and -n
flags were previously undocumented).
fsck_lfs:
* Check, and optionally fix, lfs_avail (to an exact figure) and
lfs_bfree (within a margin of error) in pass 5.
newfs_lfs:
* Reduce the default dlfs_minfreeseg to 1/20 of the total segments.
* Add a warning if the sgs disklabel field is 16 (the default for FFS'
cpg, but not usually desirable for LFS' sgs: 5--8 is a better range).
* Change the calculation of lfs_avail and lfs_bfree, corresponding to
the kernel changes mentioned above.
mount_lfs:
* Add -N and -b options to pass corresponding -n and -b options to
lfs_cleanerd.
* Default to calling lfs_cleanerd with "-b -n 4".
[All of these changes were largely tested in the 1.5 branch, with the
idea that they (along with previous un-pulled-up work) could be applied
to the branch while it was still in ALPHA2; however my test system has
experienced corruption on another filesystem (/dev/console has gone
missing :^), and, while I believe this unrelated to the LFS changes, I
cannot with good conscience request that the changes be pulled up.]
2000-09-09 08:49:54 +04:00
|
|
|
#if 0
|
1999-03-10 03:20:00 +03:00
|
|
|
/*
|
Various bug-fixes to LFS, to wit:
Kernel:
* Add runtime quantity lfs_ravail, the number of disk-blocks reserved
for writing. Writes to the filesystem first reserve a maximum amount
of blocks before their write is allowed to proceed; after the blocks
are allocated the reserved total is reduced by a corresponding amount.
If the lfs_reserve function cannot immediately reserve the requested
number of blocks, the inode is unlocked, and the thread sleeps until
the cleaner has made enough space available for the blocks to be
reserved. In this way large files can be written to the filesystem
(or, smaller files can be written to a nearly-full but thoroughly
clean filesystem) and the cleaner can still function properly.
* Remove explicit switching on dlfs_minfreeseg from the kernel code; it
is now merely a fs-creation parameter used to compute dlfs_avail and
dlfs_bfree (and used by fsck_lfs(8) to check their accuracy). Its
former role is better assumed by a properly computed dlfs_avail.
* Bounds-check inode numbers submitted through lfs_bmapv and lfs_markv.
This prevents a panic, but, if the cleaner is feeding the filesystem
the wrong data, you are still in a world of hurt.
* Cleanup: remove explicit references of DEV_BSIZE in favor of
btodb()/dbtob().
lfs_cleanerd:
* Make -n mean "send N segments' blocks through a single call to
lfs_markv". Previously it had meant "clean N segments though N calls
to lfs_markv, before looking again to see if more need to be cleaned".
The new behavior gives better packing of direct data on disk with as
little metadata as possible, largely alleviating the problem that the
cleaner can consume more disk through inefficient use of metadata than
it frees by moving dirty data away from clean "holes" to produce
entirely clean segments.
* Make -b mean "read as many segments as necessary to write N segments
of dirty data back to disk", rather than its former meaning of "read
as many segments as necessary to free N segments worth of space". The
new meaning, combined with the new -n behavior described above,
further aids in cleaning storage efficiency as entire segments can be
written at once, using as few blocks as possible for segment summaries
and inode blocks.
* Make the cleaner take note of segments which could not be cleaned due
to error, and not attempt to clean them until they are entirely free
of dirty blocks. This prevents the case in which a cleanerd running
with -n 1 and without -b (formerly the default) would spin trying
repeatedly to clean a corrupt segment, while the remaining space
filled and deadlocked the filesystem.
* Update the lfs_cleanerd manual page to describe all the options,
including the changes mentioned here (in particular, the -b and -n
flags were previously undocumented).
fsck_lfs:
* Check, and optionally fix, lfs_avail (to an exact figure) and
lfs_bfree (within a margin of error) in pass 5.
newfs_lfs:
* Reduce the default dlfs_minfreeseg to 1/20 of the total segments.
* Add a warning if the sgs disklabel field is 16 (the default for FFS'
cpg, but not usually desirable for LFS' sgs: 5--8 is a better range).
* Change the calculation of lfs_avail and lfs_bfree, corresponding to
the kernel changes mentioned above.
mount_lfs:
* Add -N and -b options to pass corresponding -n and -b options to
lfs_cleanerd.
* Default to calling lfs_cleanerd with "-b -n 4".
[All of these changes were largely tested in the 1.5 branch, with the
idea that they (along with previous un-pulled-up work) could be applied
to the branch while it was still in ALPHA2; however my test system has
experienced corruption on another filesystem (/dev/console has gone
missing :^), and, while I believe this unrelated to the LFS changes, I
cannot with good conscience request that the changes be pulled up.]
2000-09-09 08:49:54 +04:00
|
|
|
* If we are not the cleaner, and there is no space available,
|
|
|
|
* wait until cleaner writes.
|
1999-03-10 03:20:00 +03:00
|
|
|
*/
|
2001-11-24 00:44:25 +03:00
|
|
|
if (!(flags & SEGM_CLEAN) && !(fs->lfs_seglock && fs->lfs_sp &&
|
2000-11-12 10:58:36 +03:00
|
|
|
(fs->lfs_sp->seg_flags & SEGM_CLEAN)))
|
1999-03-10 03:20:00 +03:00
|
|
|
{
|
Various bug-fixes to LFS, to wit:
Kernel:
* Add runtime quantity lfs_ravail, the number of disk-blocks reserved
for writing. Writes to the filesystem first reserve a maximum amount
of blocks before their write is allowed to proceed; after the blocks
are allocated the reserved total is reduced by a corresponding amount.
If the lfs_reserve function cannot immediately reserve the requested
number of blocks, the inode is unlocked, and the thread sleeps until
the cleaner has made enough space available for the blocks to be
reserved. In this way large files can be written to the filesystem
(or, smaller files can be written to a nearly-full but thoroughly
clean filesystem) and the cleaner can still function properly.
* Remove explicit switching on dlfs_minfreeseg from the kernel code; it
is now merely a fs-creation parameter used to compute dlfs_avail and
dlfs_bfree (and used by fsck_lfs(8) to check their accuracy). Its
former role is better assumed by a properly computed dlfs_avail.
* Bounds-check inode numbers submitted through lfs_bmapv and lfs_markv.
This prevents a panic, but, if the cleaner is feeding the filesystem
the wrong data, you are still in a world of hurt.
* Cleanup: remove explicit references of DEV_BSIZE in favor of
btodb()/dbtob().
lfs_cleanerd:
* Make -n mean "send N segments' blocks through a single call to
lfs_markv". Previously it had meant "clean N segments though N calls
to lfs_markv, before looking again to see if more need to be cleaned".
The new behavior gives better packing of direct data on disk with as
little metadata as possible, largely alleviating the problem that the
cleaner can consume more disk through inefficient use of metadata than
it frees by moving dirty data away from clean "holes" to produce
entirely clean segments.
* Make -b mean "read as many segments as necessary to write N segments
of dirty data back to disk", rather than its former meaning of "read
as many segments as necessary to free N segments worth of space". The
new meaning, combined with the new -n behavior described above,
further aids in cleaning storage efficiency as entire segments can be
written at once, using as few blocks as possible for segment summaries
and inode blocks.
* Make the cleaner take note of segments which could not be cleaned due
to error, and not attempt to clean them until they are entirely free
of dirty blocks. This prevents the case in which a cleanerd running
with -n 1 and without -b (formerly the default) would spin trying
repeatedly to clean a corrupt segment, while the remaining space
filled and deadlocked the filesystem.
* Update the lfs_cleanerd manual page to describe all the options,
including the changes mentioned here (in particular, the -b and -n
flags were previously undocumented).
fsck_lfs:
* Check, and optionally fix, lfs_avail (to an exact figure) and
lfs_bfree (within a margin of error) in pass 5.
newfs_lfs:
* Reduce the default dlfs_minfreeseg to 1/20 of the total segments.
* Add a warning if the sgs disklabel field is 16 (the default for FFS'
cpg, but not usually desirable for LFS' sgs: 5--8 is a better range).
* Change the calculation of lfs_avail and lfs_bfree, corresponding to
the kernel changes mentioned above.
mount_lfs:
* Add -N and -b options to pass corresponding -n and -b options to
lfs_cleanerd.
* Default to calling lfs_cleanerd with "-b -n 4".
[All of these changes were largely tested in the 1.5 branch, with the
idea that they (along with previous un-pulled-up work) could be applied
to the branch while it was still in ALPHA2; however my test system has
experienced corruption on another filesystem (/dev/console has gone
missing :^), and, while I believe this unrelated to the LFS changes, I
cannot with good conscience request that the changes be pulled up.]
2000-09-09 08:49:54 +04:00
|
|
|
while (fs->lfs_avail <= 0) {
|
2000-11-12 10:58:36 +03:00
|
|
|
LFS_CLEANERINFO(cip, fs, bp);
|
|
|
|
LFS_SYNC_CLEANERINFO(cip, fs, bp, 0);
|
|
|
|
|
Various bug-fixes to LFS, to wit:
Kernel:
* Add runtime quantity lfs_ravail, the number of disk-blocks reserved
for writing. Writes to the filesystem first reserve a maximum amount
of blocks before their write is allowed to proceed; after the blocks
are allocated the reserved total is reduced by a corresponding amount.
If the lfs_reserve function cannot immediately reserve the requested
number of blocks, the inode is unlocked, and the thread sleeps until
the cleaner has made enough space available for the blocks to be
reserved. In this way large files can be written to the filesystem
(or, smaller files can be written to a nearly-full but thoroughly
clean filesystem) and the cleaner can still function properly.
* Remove explicit switching on dlfs_minfreeseg from the kernel code; it
is now merely a fs-creation parameter used to compute dlfs_avail and
dlfs_bfree (and used by fsck_lfs(8) to check their accuracy). Its
former role is better assumed by a properly computed dlfs_avail.
* Bounds-check inode numbers submitted through lfs_bmapv and lfs_markv.
This prevents a panic, but, if the cleaner is feeding the filesystem
the wrong data, you are still in a world of hurt.
* Cleanup: remove explicit references of DEV_BSIZE in favor of
btodb()/dbtob().
lfs_cleanerd:
* Make -n mean "send N segments' blocks through a single call to
lfs_markv". Previously it had meant "clean N segments though N calls
to lfs_markv, before looking again to see if more need to be cleaned".
The new behavior gives better packing of direct data on disk with as
little metadata as possible, largely alleviating the problem that the
cleaner can consume more disk through inefficient use of metadata than
it frees by moving dirty data away from clean "holes" to produce
entirely clean segments.
* Make -b mean "read as many segments as necessary to write N segments
of dirty data back to disk", rather than its former meaning of "read
as many segments as necessary to free N segments worth of space". The
new meaning, combined with the new -n behavior described above,
further aids in cleaning storage efficiency as entire segments can be
written at once, using as few blocks as possible for segment summaries
and inode blocks.
* Make the cleaner take note of segments which could not be cleaned due
to error, and not attempt to clean them until they are entirely free
of dirty blocks. This prevents the case in which a cleanerd running
with -n 1 and without -b (formerly the default) would spin trying
repeatedly to clean a corrupt segment, while the remaining space
filled and deadlocked the filesystem.
* Update the lfs_cleanerd manual page to describe all the options,
including the changes mentioned here (in particular, the -b and -n
flags were previously undocumented).
fsck_lfs:
* Check, and optionally fix, lfs_avail (to an exact figure) and
lfs_bfree (within a margin of error) in pass 5.
newfs_lfs:
* Reduce the default dlfs_minfreeseg to 1/20 of the total segments.
* Add a warning if the sgs disklabel field is 16 (the default for FFS'
cpg, but not usually desirable for LFS' sgs: 5--8 is a better range).
* Change the calculation of lfs_avail and lfs_bfree, corresponding to
the kernel changes mentioned above.
mount_lfs:
* Add -N and -b options to pass corresponding -n and -b options to
lfs_cleanerd.
* Default to calling lfs_cleanerd with "-b -n 4".
[All of these changes were largely tested in the 1.5 branch, with the
idea that they (along with previous un-pulled-up work) could be applied
to the branch while it was still in ALPHA2; however my test system has
experienced corruption on another filesystem (/dev/console has gone
missing :^), and, while I believe this unrelated to the LFS changes, I
cannot with good conscience request that the changes be pulled up.]
2000-09-09 08:49:54 +04:00
|
|
|
wakeup(&lfs_allclean_wakeup);
|
|
|
|
wakeup(&fs->lfs_nextseg);
|
|
|
|
error = tsleep(&fs->lfs_avail, PRIBIO + 1, "lfs_av2",
|
|
|
|
0);
|
|
|
|
if (error) {
|
|
|
|
return (error);
|
1999-03-10 03:20:00 +03:00
|
|
|
}
|
Various bug-fixes to LFS, to wit:
Kernel:
* Add runtime quantity lfs_ravail, the number of disk-blocks reserved
for writing. Writes to the filesystem first reserve a maximum amount
of blocks before their write is allowed to proceed; after the blocks
are allocated the reserved total is reduced by a corresponding amount.
If the lfs_reserve function cannot immediately reserve the requested
number of blocks, the inode is unlocked, and the thread sleeps until
the cleaner has made enough space available for the blocks to be
reserved. In this way large files can be written to the filesystem
(or, smaller files can be written to a nearly-full but thoroughly
clean filesystem) and the cleaner can still function properly.
* Remove explicit switching on dlfs_minfreeseg from the kernel code; it
is now merely a fs-creation parameter used to compute dlfs_avail and
dlfs_bfree (and used by fsck_lfs(8) to check their accuracy). Its
former role is better assumed by a properly computed dlfs_avail.
* Bounds-check inode numbers submitted through lfs_bmapv and lfs_markv.
This prevents a panic, but, if the cleaner is feeding the filesystem
the wrong data, you are still in a world of hurt.
* Cleanup: remove explicit references of DEV_BSIZE in favor of
btodb()/dbtob().
lfs_cleanerd:
* Make -n mean "send N segments' blocks through a single call to
lfs_markv". Previously it had meant "clean N segments though N calls
to lfs_markv, before looking again to see if more need to be cleaned".
The new behavior gives better packing of direct data on disk with as
little metadata as possible, largely alleviating the problem that the
cleaner can consume more disk through inefficient use of metadata than
it frees by moving dirty data away from clean "holes" to produce
entirely clean segments.
* Make -b mean "read as many segments as necessary to write N segments
of dirty data back to disk", rather than its former meaning of "read
as many segments as necessary to free N segments worth of space". The
new meaning, combined with the new -n behavior described above,
further aids in cleaning storage efficiency as entire segments can be
written at once, using as few blocks as possible for segment summaries
and inode blocks.
* Make the cleaner take note of segments which could not be cleaned due
to error, and not attempt to clean them until they are entirely free
of dirty blocks. This prevents the case in which a cleanerd running
with -n 1 and without -b (formerly the default) would spin trying
repeatedly to clean a corrupt segment, while the remaining space
filled and deadlocked the filesystem.
* Update the lfs_cleanerd manual page to describe all the options,
including the changes mentioned here (in particular, the -b and -n
flags were previously undocumented).
fsck_lfs:
* Check, and optionally fix, lfs_avail (to an exact figure) and
lfs_bfree (within a margin of error) in pass 5.
newfs_lfs:
* Reduce the default dlfs_minfreeseg to 1/20 of the total segments.
* Add a warning if the sgs disklabel field is 16 (the default for FFS'
cpg, but not usually desirable for LFS' sgs: 5--8 is a better range).
* Change the calculation of lfs_avail and lfs_bfree, corresponding to
the kernel changes mentioned above.
mount_lfs:
* Add -N and -b options to pass corresponding -n and -b options to
lfs_cleanerd.
* Default to calling lfs_cleanerd with "-b -n 4".
[All of these changes were largely tested in the 1.5 branch, with the
idea that they (along with previous un-pulled-up work) could be applied
to the branch while it was still in ALPHA2; however my test system has
experienced corruption on another filesystem (/dev/console has gone
missing :^), and, while I believe this unrelated to the LFS changes, I
cannot with good conscience request that the changes be pulled up.]
2000-09-09 08:49:54 +04:00
|
|
|
}
|
1999-03-10 03:20:00 +03:00
|
|
|
}
|
Various bug-fixes to LFS, to wit:
Kernel:
* Add runtime quantity lfs_ravail, the number of disk-blocks reserved
for writing. Writes to the filesystem first reserve a maximum amount
of blocks before their write is allowed to proceed; after the blocks
are allocated the reserved total is reduced by a corresponding amount.
If the lfs_reserve function cannot immediately reserve the requested
number of blocks, the inode is unlocked, and the thread sleeps until
the cleaner has made enough space available for the blocks to be
reserved. In this way large files can be written to the filesystem
(or, smaller files can be written to a nearly-full but thoroughly
clean filesystem) and the cleaner can still function properly.
* Remove explicit switching on dlfs_minfreeseg from the kernel code; it
is now merely a fs-creation parameter used to compute dlfs_avail and
dlfs_bfree (and used by fsck_lfs(8) to check their accuracy). Its
former role is better assumed by a properly computed dlfs_avail.
* Bounds-check inode numbers submitted through lfs_bmapv and lfs_markv.
This prevents a panic, but, if the cleaner is feeding the filesystem
the wrong data, you are still in a world of hurt.
* Cleanup: remove explicit references of DEV_BSIZE in favor of
btodb()/dbtob().
lfs_cleanerd:
* Make -n mean "send N segments' blocks through a single call to
lfs_markv". Previously it had meant "clean N segments though N calls
to lfs_markv, before looking again to see if more need to be cleaned".
The new behavior gives better packing of direct data on disk with as
little metadata as possible, largely alleviating the problem that the
cleaner can consume more disk through inefficient use of metadata than
it frees by moving dirty data away from clean "holes" to produce
entirely clean segments.
* Make -b mean "read as many segments as necessary to write N segments
of dirty data back to disk", rather than its former meaning of "read
as many segments as necessary to free N segments worth of space". The
new meaning, combined with the new -n behavior described above,
further aids in cleaning storage efficiency as entire segments can be
written at once, using as few blocks as possible for segment summaries
and inode blocks.
* Make the cleaner take note of segments which could not be cleaned due
to error, and not attempt to clean them until they are entirely free
of dirty blocks. This prevents the case in which a cleanerd running
with -n 1 and without -b (formerly the default) would spin trying
repeatedly to clean a corrupt segment, while the remaining space
filled and deadlocked the filesystem.
* Update the lfs_cleanerd manual page to describe all the options,
including the changes mentioned here (in particular, the -b and -n
flags were previously undocumented).
fsck_lfs:
* Check, and optionally fix, lfs_avail (to an exact figure) and
lfs_bfree (within a margin of error) in pass 5.
newfs_lfs:
* Reduce the default dlfs_minfreeseg to 1/20 of the total segments.
* Add a warning if the sgs disklabel field is 16 (the default for FFS'
cpg, but not usually desirable for LFS' sgs: 5--8 is a better range).
* Change the calculation of lfs_avail and lfs_bfree, corresponding to
the kernel changes mentioned above.
mount_lfs:
* Add -N and -b options to pass corresponding -n and -b options to
lfs_cleanerd.
* Default to calling lfs_cleanerd with "-b -n 4".
[All of these changes were largely tested in the 1.5 branch, with the
idea that they (along with previous un-pulled-up work) could be applied
to the branch while it was still in ALPHA2; however my test system has
experienced corruption on another filesystem (/dev/console has gone
missing :^), and, while I believe this unrelated to the LFS changes, I
cannot with good conscience request that the changes be pulled up.]
2000-09-09 08:49:54 +04:00
|
|
|
#endif
|
1994-06-08 15:41:58 +04:00
|
|
|
/*
|
|
|
|
* Allocate a segment structure and enough space to hold pointers to
|
|
|
|
* the maximum possible number of buffers which can be described in a
|
|
|
|
* single summary block.
|
|
|
|
*/
|
1999-03-10 03:20:00 +03:00
|
|
|
do_ckp = (flags & SEGM_CKP) || fs->lfs_nactive > LFS_MAX_ACTIVE;
|
1994-06-08 15:41:58 +04:00
|
|
|
lfs_seglock(fs, flags | (do_ckp ? SEGM_CKP : 0));
|
|
|
|
sp = fs->lfs_sp;
|
|
|
|
|
1999-03-10 03:20:00 +03:00
|
|
|
/*
|
1999-03-26 00:39:18 +03:00
|
|
|
* If lfs_flushvp is non-NULL, we are called from lfs_vflush,
|
|
|
|
* in which case we have to flush *all* buffers off of this vnode.
|
1999-12-04 00:47:44 +03:00
|
|
|
* We don't care about other nodes, but write any non-dirop nodes
|
|
|
|
* anyway in anticipation of another getnewvnode().
|
|
|
|
*
|
|
|
|
* If we're cleaning we only write cleaning and ifile blocks, and
|
|
|
|
* no dirops, since otherwise we'd risk corruption in a crash.
|
1999-03-10 03:20:00 +03:00
|
|
|
*/
|
2001-11-24 00:44:25 +03:00
|
|
|
if (sp->seg_flags & SEGM_CLEAN)
|
1999-03-10 03:20:00 +03:00
|
|
|
lfs_writevnodes(fs, mp, sp, VN_CLEAN);
|
|
|
|
else {
|
|
|
|
lfs_writevnodes(fs, mp, sp, VN_REG);
|
2001-11-24 00:44:25 +03:00
|
|
|
if (!fs->lfs_dirops || !fs->lfs_flushvp) {
|
|
|
|
while (fs->lfs_dirops)
|
|
|
|
if ((error = tsleep(&fs->lfs_writer, PRIBIO + 1,
|
2000-01-15 00:38:46 +03:00
|
|
|
"lfs writer", 0)))
|
|
|
|
{
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
/* XXX why not segunlock? */
|
2000-01-15 00:38:46 +03:00
|
|
|
free(sp->bpp, M_SEGMENT);
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
sp->bpp = NULL;
|
2000-01-15 00:38:46 +03:00
|
|
|
free(sp, M_SEGMENT);
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
fs->lfs_sp = NULL;
|
2000-01-15 00:38:46 +03:00
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
fs->lfs_writer++;
|
2001-11-24 00:44:25 +03:00
|
|
|
writer_set = 1;
|
2000-01-15 00:38:46 +03:00
|
|
|
lfs_writevnodes(fs, mp, sp, VN_DIROP);
|
|
|
|
((SEGSUM *)(sp->segsum))->ss_flags &= ~(SS_CONT);
|
|
|
|
}
|
1999-03-10 03:20:00 +03:00
|
|
|
}
|
1994-06-08 15:41:58 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* If we are doing a checkpoint, mark everything since the
|
|
|
|
* last checkpoint as no longer ACTIVE.
|
|
|
|
*/
|
1999-03-10 03:20:00 +03:00
|
|
|
if (do_ckp) {
|
1994-06-08 15:41:58 +04:00
|
|
|
for (ibno = fs->lfs_cleansz + fs->lfs_segtabsz;
|
|
|
|
--ibno >= fs->lfs_cleansz; ) {
|
2000-11-12 10:58:36 +03:00
|
|
|
dirty = 0;
|
1999-03-10 03:20:00 +03:00
|
|
|
if (bread(fs->lfs_ivnode, ibno, fs->lfs_bsize, NOCRED, &bp))
|
1994-06-08 15:41:58 +04:00
|
|
|
|
1999-03-10 03:20:00 +03:00
|
|
|
panic("lfs_segwrite: ifile read");
|
1994-06-08 15:41:58 +04:00
|
|
|
segusep = (SEGUSE *)bp->b_data;
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
for (i = fs->lfs_sepb; i--;) {
|
2000-11-12 10:58:36 +03:00
|
|
|
if (segusep->su_flags & SEGUSE_ACTIVE) {
|
|
|
|
segusep->su_flags &= ~SEGUSE_ACTIVE;
|
|
|
|
++dirty;
|
|
|
|
}
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
if (fs->lfs_version > 1)
|
|
|
|
++segusep;
|
|
|
|
else
|
|
|
|
segusep = (SEGUSE *)
|
|
|
|
((SEGUSE_V1 *)segusep + 1);
|
2000-11-12 10:58:36 +03:00
|
|
|
}
|
1994-06-08 15:41:58 +04:00
|
|
|
|
1999-03-10 03:20:00 +03:00
|
|
|
/* But the current segment is still ACTIVE */
|
2000-06-28 00:00:03 +04:00
|
|
|
segusep = (SEGUSE *)bp->b_data;
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
if (dtosn(fs, fs->lfs_curseg) / fs->lfs_sepb ==
|
2000-11-12 10:58:36 +03:00
|
|
|
(ibno-fs->lfs_cleansz)) {
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
if (fs->lfs_version > 1)
|
|
|
|
segusep[dtosn(fs, fs->lfs_curseg) %
|
|
|
|
fs->lfs_sepb].su_flags |=
|
|
|
|
SEGUSE_ACTIVE;
|
|
|
|
else
|
|
|
|
((SEGUSE *)
|
|
|
|
((SEGUSE_V1 *)(bp->b_data) +
|
|
|
|
(dtosn(fs, fs->lfs_curseg) %
|
|
|
|
fs->lfs_sepb)))->su_flags
|
|
|
|
|= SEGUSE_ACTIVE;
|
2000-11-12 10:58:36 +03:00
|
|
|
--dirty;
|
|
|
|
}
|
|
|
|
if (dirty)
|
2002-05-15 00:03:53 +04:00
|
|
|
error = LFS_BWRITE_LOG(bp); /* Ifile */
|
2000-11-12 10:58:36 +03:00
|
|
|
else
|
|
|
|
brelse(bp);
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
1999-03-10 03:20:00 +03:00
|
|
|
}
|
2000-11-12 10:58:36 +03:00
|
|
|
|
|
|
|
did_ckp = 0;
|
1994-06-08 15:41:58 +04:00
|
|
|
if (do_ckp || fs->lfs_doifile) {
|
2000-11-27 06:33:57 +03:00
|
|
|
do {
|
|
|
|
vp = fs->lfs_ivnode;
|
2000-07-05 02:30:37 +04:00
|
|
|
|
2000-11-27 06:33:57 +03:00
|
|
|
vget(vp, LK_EXCLUSIVE | LK_CANRECURSE | LK_RETRY);
|
2002-05-15 00:03:53 +04:00
|
|
|
#ifdef DEBUG
|
|
|
|
LFS_ENTER_LOG("pretend", __FILE__, __LINE__, 0, 0);
|
|
|
|
#endif
|
|
|
|
fs->lfs_flags &= ~LFS_IFDIRTY;
|
1999-03-10 03:20:00 +03:00
|
|
|
|
2000-11-27 06:33:57 +03:00
|
|
|
ip = VTOI(vp);
|
2002-12-31 17:54:32 +03:00
|
|
|
if (LIST_FIRST(&vp->v_dirtyblkhd) != NULL)
|
2000-11-27 06:33:57 +03:00
|
|
|
lfs_writefile(fs, sp, vp);
|
|
|
|
if (ip->i_flag & IN_ALLMOD)
|
|
|
|
++did_ckp;
|
2002-05-15 00:03:53 +04:00
|
|
|
redo = lfs_writeinode(fs, sp, ip);
|
2002-12-13 17:40:02 +03:00
|
|
|
|
2000-11-27 06:33:57 +03:00
|
|
|
vput(vp);
|
2002-12-13 17:40:02 +03:00
|
|
|
/*
|
|
|
|
* if we know we'll redo, no need to writeseg here.
|
|
|
|
*/
|
|
|
|
if (!(redo && do_ckp)) {
|
|
|
|
redo += lfs_writeseg(fs, sp);
|
|
|
|
}
|
2002-05-15 00:03:53 +04:00
|
|
|
redo += (fs->lfs_flags & LFS_IFDIRTY);
|
|
|
|
} while (redo && do_ckp);
|
1999-03-10 03:20:00 +03:00
|
|
|
|
2000-11-12 10:58:36 +03:00
|
|
|
/* The ifile should now be all clear */
|
2002-05-18 01:42:38 +04:00
|
|
|
if (do_ckp && LIST_FIRST(&vp->v_dirtyblkhd)) {
|
2002-05-15 00:03:53 +04:00
|
|
|
struct buf *bp;
|
|
|
|
int s, warned = 0, dopanic = 0;
|
|
|
|
s = splbio();
|
2002-05-18 01:42:38 +04:00
|
|
|
for (bp = LIST_FIRST(&vp->v_dirtyblkhd); bp; bp = LIST_NEXT(bp, b_vnbufs)) {
|
2002-05-15 00:03:53 +04:00
|
|
|
if (!(bp->b_flags & B_GATHERED)) {
|
|
|
|
if (!warned)
|
|
|
|
printf("lfs_segwrite: ifile still has dirty blocks?!\n");
|
|
|
|
++dopanic;
|
|
|
|
++warned;
|
2003-01-25 21:12:31 +03:00
|
|
|
printf("bp=%p, lbn %" PRId64 ", "
|
|
|
|
"flags 0x%lx\n",
|
2003-01-28 00:45:52 +03:00
|
|
|
bp, bp->b_lblkno,
|
2003-01-25 00:55:02 +03:00
|
|
|
bp->b_flags);
|
2002-05-15 00:03:53 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
if (dopanic)
|
|
|
|
panic("dirty blocks");
|
|
|
|
splx(s);
|
|
|
|
}
|
2000-11-12 10:58:36 +03:00
|
|
|
LFS_CLR_UINO(ip, IN_ALLMOD);
|
1999-03-10 03:20:00 +03:00
|
|
|
} else {
|
1994-06-08 15:41:58 +04:00
|
|
|
(void) lfs_writeseg(fs, sp);
|
1999-03-10 03:20:00 +03:00
|
|
|
}
|
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/*
|
1999-03-10 03:20:00 +03:00
|
|
|
* If the I/O count is non-zero, sleep until it reaches zero.
|
|
|
|
* At the moment, the user's process hangs around so we can
|
|
|
|
* sleep.
|
1994-06-08 15:41:58 +04:00
|
|
|
*/
|
|
|
|
fs->lfs_doifile = 0;
|
2001-11-24 00:44:25 +03:00
|
|
|
if (writer_set && --fs->lfs_writer == 0)
|
1999-03-10 03:20:00 +03:00
|
|
|
wakeup(&fs->lfs_dirops);
|
2000-11-12 10:58:36 +03:00
|
|
|
|
|
|
|
/*
|
|
|
|
* If we didn't write the Ifile, we didn't really do anything.
|
|
|
|
* That means that (1) there is a checkpoint on disk and (2)
|
|
|
|
* nothing has changed since it was written.
|
|
|
|
*
|
|
|
|
* Take the flags off of the segment so that lfs_segunlock
|
|
|
|
* doesn't have to write the superblock either.
|
|
|
|
*/
|
For synchronous writes, keep separate i/o counters for each write, so
processes don't have to wait for one another to finish (e.g., nfsd seems
to be a little happier now, though I haven't measured the difference).
Synchronous checkpoints, however, must always wait for all i/o to finish.
Take the contents of the callback functions and have them run in thread
context instead (aiodoned thread). lfs_iocount no longer has to be
protected in splbio(), and quite a bit less of the segment construction
loop needs to be in splbio() as well.
If lfs_markv is handed a block that is not the correct size according to
the inode, refuse to process it. (Formerly it was extended to the "correct"
size.) This is possibly more prone to deadlock, but less prone to corruption.
lfs_segclean now outright refuses to clean segments that appear to have live
bytes in them. Again this may be more prone to deadlock but avoids
corruption.
Replace ufsspec_close and ufsfifo_close with LFS equivalents; this means
that no UFS functions need to know about LFS_ITIMES any more. Remove
the reference from ufs/inode.h.
Tested on i386, test-compiled on alpha.
2002-06-16 04:13:15 +04:00
|
|
|
if (do_ckp && !did_ckp) {
|
|
|
|
sp->seg_flags &= ~SEGM_CKP;
|
2001-11-24 00:44:25 +03:00
|
|
|
/* if (do_ckp) printf("lfs_segwrite: no checkpoint\n"); */
|
2000-11-12 10:58:36 +03:00
|
|
|
}
|
|
|
|
|
2001-11-24 00:44:25 +03:00
|
|
|
if (lfs_dostats) {
|
1999-03-10 03:20:00 +03:00
|
|
|
++lfs_stats.nwrites;
|
|
|
|
if (sp->seg_flags & SEGM_SYNC)
|
|
|
|
++lfs_stats.nsync_writes;
|
|
|
|
if (sp->seg_flags & SEGM_CKP)
|
|
|
|
++lfs_stats.ncheckpoints;
|
|
|
|
}
|
1994-06-08 15:41:58 +04:00
|
|
|
lfs_segunlock(fs);
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Write the dirty blocks associated with a vnode.
|
|
|
|
*/
|
|
|
|
void
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
lfs_writefile(struct lfs *fs, struct segment *sp, struct vnode *vp)
|
1994-06-08 15:41:58 +04:00
|
|
|
{
|
|
|
|
struct buf *bp;
|
|
|
|
struct finfo *fip;
|
2002-07-06 05:30:11 +04:00
|
|
|
struct inode *ip;
|
1994-06-08 15:41:58 +04:00
|
|
|
IFILE *ifp;
|
2002-07-06 05:30:11 +04:00
|
|
|
int i, frag;
|
1999-03-10 03:20:00 +03:00
|
|
|
|
2002-07-06 05:30:11 +04:00
|
|
|
ip = VTOI(vp);
|
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
if (sp->seg_bytes_left < fs->lfs_bsize ||
|
|
|
|
sp->sum_bytes_left < sizeof(struct finfo))
|
|
|
|
(void) lfs_writeseg(fs, sp);
|
1999-03-10 03:20:00 +03:00
|
|
|
|
2003-01-29 16:14:33 +03:00
|
|
|
sp->sum_bytes_left -= FINFOSIZE;
|
1994-06-08 15:41:58 +04:00
|
|
|
++((SEGSUM *)(sp->segsum))->ss_nfinfo;
|
|
|
|
|
2001-11-24 00:44:25 +03:00
|
|
|
if (vp->v_flag & VDIROP)
|
1999-03-10 03:20:00 +03:00
|
|
|
((SEGSUM *)(sp->segsum))->ss_flags |= (SS_DIROP|SS_CONT);
|
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
fip = sp->fip;
|
|
|
|
fip->fi_nblocks = 0;
|
2002-07-06 05:30:11 +04:00
|
|
|
fip->fi_ino = ip->i_number;
|
1994-06-08 15:41:58 +04:00
|
|
|
LFS_IENTRY(ifp, fs, fip->fi_ino, bp);
|
|
|
|
fip->fi_version = ifp->if_version;
|
|
|
|
brelse(bp);
|
1999-03-10 03:20:00 +03:00
|
|
|
|
2002-05-15 00:03:53 +04:00
|
|
|
if (sp->seg_flags & SEGM_CLEAN) {
|
2000-01-15 00:38:46 +03:00
|
|
|
lfs_gather(fs, sp, vp, lfs_match_fake);
|
|
|
|
/*
|
|
|
|
* For a file being flushed, we need to write *all* blocks.
|
|
|
|
* This means writing the cleaning blocks first, and then
|
|
|
|
* immediately following with any non-cleaning blocks.
|
|
|
|
* The same is true of the Ifile since checkpoints assume
|
|
|
|
* that all valid Ifile blocks are written.
|
|
|
|
*/
|
2002-07-06 05:30:11 +04:00
|
|
|
if (IS_FLUSHING(fs,vp) || vp == fs->lfs_ivnode)
|
2000-01-15 00:38:46 +03:00
|
|
|
lfs_gather(fs, sp, vp, lfs_match_data);
|
|
|
|
} else
|
|
|
|
lfs_gather(fs, sp, vp, lfs_match_data);
|
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/*
|
|
|
|
* It may not be necessary to write the meta-data blocks at this point,
|
|
|
|
* as the roll-forward recovery code should be able to reconstruct the
|
|
|
|
* list.
|
1999-03-10 03:20:00 +03:00
|
|
|
*
|
|
|
|
* We have to write them anyway, though, under two conditions: (1) the
|
|
|
|
* vnode is being flushed (for reuse by vinvalbuf); or (2) we are
|
|
|
|
* checkpointing.
|
2002-07-06 05:30:11 +04:00
|
|
|
*
|
|
|
|
* BUT if we are cleaning, we might have indirect blocks that refer to
|
|
|
|
* new blocks not being written yet, in addition to fragments being
|
|
|
|
* moved out of a cleaned segment. If that is the case, don't
|
|
|
|
* write the indirect blocks, or the finfo will have a small block
|
|
|
|
* in the middle of it!
|
|
|
|
* XXX in this case isn't the inode size wrong too?
|
1994-06-08 15:41:58 +04:00
|
|
|
*/
|
2002-07-06 05:30:11 +04:00
|
|
|
frag = 0;
|
|
|
|
if (sp->seg_flags & SEGM_CLEAN) {
|
|
|
|
for (i = 0; i < NDADDR; i++)
|
|
|
|
if (ip->i_lfs_fragsize[i] > 0 &&
|
|
|
|
ip->i_lfs_fragsize[i] < fs->lfs_bsize)
|
|
|
|
++frag;
|
|
|
|
}
|
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
if (frag > 1)
|
|
|
|
panic("lfs_writefile: more than one fragment!");
|
|
|
|
#endif
|
|
|
|
if (IS_FLUSHING(fs, vp) ||
|
|
|
|
(frag == 0 && (lfs_writeindir || (sp->seg_flags & SEGM_CKP)))) {
|
1999-03-10 03:20:00 +03:00
|
|
|
lfs_gather(fs, sp, vp, lfs_match_indir);
|
|
|
|
lfs_gather(fs, sp, vp, lfs_match_dindir);
|
|
|
|
lfs_gather(fs, sp, vp, lfs_match_tindir);
|
|
|
|
}
|
1994-06-08 15:41:58 +04:00
|
|
|
fip = sp->fip;
|
|
|
|
if (fip->fi_nblocks != 0) {
|
2003-01-29 16:14:33 +03:00
|
|
|
sp->fip = (FINFO*)((caddr_t)fip + FINFOSIZE +
|
|
|
|
sizeof(int32_t) * (fip->fi_nblocks));
|
1994-06-08 15:41:58 +04:00
|
|
|
sp->start_lbp = &sp->fip->fi_blocks[0];
|
|
|
|
} else {
|
2003-01-29 16:14:33 +03:00
|
|
|
sp->sum_bytes_left += FINFOSIZE;
|
1994-06-08 15:41:58 +04:00
|
|
|
--((SEGSUM *)(sp->segsum))->ss_nfinfo;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
lfs_writeinode(struct lfs *fs, struct segment *sp, struct inode *ip)
|
1994-06-08 15:41:58 +04:00
|
|
|
{
|
|
|
|
struct buf *bp, *ibp;
|
2000-07-03 05:45:46 +04:00
|
|
|
struct dinode *cdp;
|
1994-06-08 15:41:58 +04:00
|
|
|
IFILE *ifp;
|
|
|
|
SEGUSE *sup;
|
2003-01-25 00:55:02 +03:00
|
|
|
daddr_t daddr;
|
|
|
|
int32_t *daddrp; /* XXX ondisk32 */
|
1994-06-08 15:41:58 +04:00
|
|
|
ino_t ino;
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
int error, i, ndx, fsb = 0;
|
1994-06-08 15:41:58 +04:00
|
|
|
int redo_ifile = 0;
|
1996-09-02 03:47:48 +04:00
|
|
|
struct timespec ts;
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
int gotblk = 0;
|
1999-03-10 03:20:00 +03:00
|
|
|
|
2000-05-31 05:40:01 +04:00
|
|
|
if (!(ip->i_flag & IN_ALLMOD))
|
2001-11-24 00:44:25 +03:00
|
|
|
return (0);
|
1999-03-10 03:20:00 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/* Allocate a new inode block if necessary. */
|
2001-11-24 00:44:25 +03:00
|
|
|
if ((ip->i_number != LFS_IFILE_INUM || sp->idp == NULL) && sp->ibp == NULL) {
|
1994-06-08 15:41:58 +04:00
|
|
|
/* Allocate a new segment if necessary. */
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
if (sp->seg_bytes_left < fs->lfs_ibsize ||
|
2003-01-29 16:14:33 +03:00
|
|
|
sp->sum_bytes_left < sizeof(int32_t))
|
1994-06-08 15:41:58 +04:00
|
|
|
(void) lfs_writeseg(fs, sp);
|
|
|
|
|
|
|
|
/* Get next inode block. */
|
|
|
|
daddr = fs->lfs_offset;
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
fs->lfs_offset += btofsb(fs, fs->lfs_ibsize);
|
1994-06-08 15:41:58 +04:00
|
|
|
sp->ibp = *sp->cbpp++ =
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
getblk(VTOI(fs->lfs_ivnode)->i_devvp, fsbtodb(fs, daddr),
|
|
|
|
fs->lfs_ibsize, 0, 0);
|
1999-04-12 04:04:21 +04:00
|
|
|
gotblk++;
|
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/* Zero out inode numbers */
|
|
|
|
for (i = 0; i < INOPB(fs); ++i)
|
|
|
|
((struct dinode *)sp->ibp->b_data)[i].di_inumber = 0;
|
1999-03-10 03:20:00 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
++sp->start_bpp;
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
fs->lfs_avail -= btofsb(fs, fs->lfs_ibsize);
|
1994-06-08 15:41:58 +04:00
|
|
|
/* Set remaining space counters. */
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
sp->seg_bytes_left -= fs->lfs_ibsize;
|
2003-01-29 16:14:33 +03:00
|
|
|
sp->sum_bytes_left -= sizeof(int32_t);
|
|
|
|
ndx = fs->lfs_sumsize / sizeof(int32_t) -
|
1999-03-10 03:20:00 +03:00
|
|
|
sp->ninodes / INOPB(fs) - 1;
|
2003-01-29 16:14:33 +03:00
|
|
|
((int32_t *)(sp->segsum))[ndx] = daddr;
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
1999-06-16 02:25:41 +04:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/* Update the inode times and copy the inode onto the inode page. */
|
1997-06-13 12:59:51 +04:00
|
|
|
TIMEVAL_TO_TIMESPEC(&time, &ts);
|
2002-05-15 00:03:53 +04:00
|
|
|
/* XXX kludge --- don't redirty the ifile just to put times on it */
|
|
|
|
if (ip->i_number != LFS_IFILE_INUM)
|
|
|
|
LFS_ITIMES(ip, &ts, &ts, &ts);
|
1999-03-26 00:39:18 +03:00
|
|
|
|
1999-06-16 02:25:41 +04:00
|
|
|
/*
|
|
|
|
* If this is the Ifile, and we've already written the Ifile in this
|
|
|
|
* partial segment, just overwrite it (it's not on disk yet) and
|
|
|
|
* continue.
|
|
|
|
*
|
|
|
|
* XXX we know that the bp that we get the second time around has
|
|
|
|
* already been gathered.
|
|
|
|
*/
|
2001-11-24 00:44:25 +03:00
|
|
|
if (ip->i_number == LFS_IFILE_INUM && sp->idp) {
|
1999-06-16 02:25:41 +04:00
|
|
|
*(sp->idp) = ip->i_din.ffs_din;
|
2002-07-06 05:30:11 +04:00
|
|
|
ip->i_lfs_osize = ip->i_ffs_size;
|
1999-06-16 02:25:41 +04:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
bp = sp->ibp;
|
2000-07-03 05:45:46 +04:00
|
|
|
cdp = ((struct dinode *)bp->b_data) + (sp->ninodes % INOPB(fs));
|
|
|
|
*cdp = ip->i_din.ffs_din;
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
#ifdef LFS_IFILE_FRAG_ADDRESSING
|
|
|
|
if (fs->lfs_version > 1)
|
|
|
|
fsb = (sp->ninodes % INOPB(fs)) / INOPF(fs);
|
|
|
|
#endif
|
2000-07-03 05:45:46 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* If we are cleaning, ensure that we don't write UNWRITTEN disk
|
2002-07-06 05:30:11 +04:00
|
|
|
* addresses to disk; possibly revert the inode size.
|
2000-07-03 05:45:46 +04:00
|
|
|
*/
|
|
|
|
if (ip->i_lfs_effnblks != ip->i_ffs_blocks) {
|
2002-07-06 05:30:11 +04:00
|
|
|
cdp->di_size = ip->i_lfs_osize;
|
2000-07-05 02:30:37 +04:00
|
|
|
#ifdef DEBUG_LFS
|
2000-07-03 05:45:46 +04:00
|
|
|
printf("lfs_writeinode: cleansing ino %d (%d != %d)\n",
|
|
|
|
ip->i_number, ip->i_lfs_effnblks, ip->i_ffs_blocks);
|
2000-07-05 02:30:37 +04:00
|
|
|
#endif
|
2000-07-03 05:45:46 +04:00
|
|
|
for (daddrp = cdp->di_db; daddrp < cdp->di_ib + NIADDR;
|
|
|
|
daddrp++) {
|
|
|
|
if (*daddrp == UNWRITTEN) {
|
2000-07-03 12:20:58 +04:00
|
|
|
#ifdef DEBUG_LFS
|
2000-07-03 05:45:46 +04:00
|
|
|
printf("lfs_writeinode: wiping UNWRITTEN\n");
|
|
|
|
#endif
|
|
|
|
*daddrp = 0;
|
|
|
|
}
|
|
|
|
}
|
2002-07-06 05:30:11 +04:00
|
|
|
} else {
|
|
|
|
/* If all blocks are goig to disk, update the "size on disk" */
|
|
|
|
ip->i_lfs_osize = ip->i_ffs_size;
|
2000-07-03 05:45:46 +04:00
|
|
|
}
|
1999-06-16 02:25:41 +04:00
|
|
|
|
2001-11-24 00:44:25 +03:00
|
|
|
if (ip->i_flag & IN_CLEANING)
|
2000-07-06 02:25:43 +04:00
|
|
|
LFS_CLR_UINO(ip, IN_CLEANING);
|
2000-07-05 02:30:37 +04:00
|
|
|
else {
|
2000-07-06 02:25:43 +04:00
|
|
|
/* XXX IN_ALLMOD */
|
|
|
|
LFS_CLR_UINO(ip, IN_ACCESSED | IN_ACCESS | IN_CHANGE |
|
|
|
|
IN_UPDATE);
|
|
|
|
if (ip->i_lfs_effnblks == ip->i_ffs_blocks)
|
|
|
|
LFS_CLR_UINO(ip, IN_MODIFIED);
|
2000-11-27 06:33:57 +03:00
|
|
|
#ifdef DEBUG_LFS
|
|
|
|
else
|
|
|
|
printf("lfs_writeinode: ino %d: real blks=%d, "
|
|
|
|
"eff=%d\n", ip->i_number, ip->i_ffs_blocks,
|
|
|
|
ip->i_lfs_effnblks);
|
|
|
|
#endif
|
2000-07-05 02:30:37 +04:00
|
|
|
}
|
|
|
|
|
2001-11-24 00:44:25 +03:00
|
|
|
if (ip->i_number == LFS_IFILE_INUM) /* We know sp->idp == NULL */
|
2000-07-03 05:45:46 +04:00
|
|
|
sp->idp = ((struct dinode *)bp->b_data) +
|
|
|
|
(sp->ninodes % INOPB(fs));
|
2001-11-24 00:44:25 +03:00
|
|
|
if (gotblk) {
|
2000-11-17 22:14:41 +03:00
|
|
|
LFS_LOCK_BUF(bp);
|
1999-04-12 04:04:21 +04:00
|
|
|
brelse(bp);
|
|
|
|
}
|
1999-03-10 03:20:00 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/* Increment inode count in segment summary block. */
|
|
|
|
++((SEGSUM *)(sp->segsum))->ss_ninos;
|
1999-03-10 03:20:00 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/* If this page is full, set flag to allocate a new page. */
|
|
|
|
if (++sp->ninodes % INOPB(fs) == 0)
|
|
|
|
sp->ibp = NULL;
|
1999-03-10 03:20:00 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/*
|
|
|
|
* If updating the ifile, update the super-block. Update the disk
|
|
|
|
* address and access times for this inode in the ifile.
|
|
|
|
*/
|
|
|
|
ino = ip->i_number;
|
|
|
|
if (ino == LFS_IFILE_INUM) {
|
|
|
|
daddr = fs->lfs_idaddr;
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
fs->lfs_idaddr = dbtofsb(fs, bp->b_blkno);
|
1994-06-08 15:41:58 +04:00
|
|
|
} else {
|
|
|
|
LFS_IENTRY(ifp, fs, ino, ibp);
|
|
|
|
daddr = ifp->if_daddr;
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
ifp->if_daddr = dbtofsb(fs, bp->b_blkno) + fsb;
|
1999-09-04 02:48:51 +04:00
|
|
|
#ifdef LFS_DEBUG_NEXTFREE
|
2001-11-24 00:44:25 +03:00
|
|
|
if (ino > 3 && ifp->if_nextfree) {
|
1999-09-04 02:48:51 +04:00
|
|
|
vprint("lfs_writeinode",ITOV(ip));
|
|
|
|
printf("lfs_writeinode: updating free ino %d\n",
|
|
|
|
ip->i_number);
|
|
|
|
}
|
|
|
|
#endif
|
2002-05-15 00:03:53 +04:00
|
|
|
error = LFS_BWRITE_LOG(ibp); /* Ifile */
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
1999-03-10 03:20:00 +03:00
|
|
|
|
2000-11-12 05:13:51 +03:00
|
|
|
/*
|
|
|
|
* The inode's last address should not be in the current partial
|
|
|
|
* segment, except under exceptional circumstances (lfs_writevnodes
|
|
|
|
* had to start over, and in the meantime more blocks were written
|
2002-07-06 05:30:11 +04:00
|
|
|
* to a vnode). Both inodes will be accounted to this segment
|
|
|
|
* in lfs_writeseg so we need to subtract the earlier version
|
|
|
|
* here anyway. The segment count can temporarily dip below
|
|
|
|
* zero here; keep track of how many duplicates we have in
|
|
|
|
* "dupino" so we don't panic below.
|
2000-11-12 05:13:51 +03:00
|
|
|
*/
|
2002-07-06 05:30:11 +04:00
|
|
|
if (daddr >= fs->lfs_lastpseg && daddr <= dbtofsb(fs, bp->b_blkno)) {
|
|
|
|
++sp->ndupino;
|
2000-06-07 00:19:14 +04:00
|
|
|
printf("lfs_writeinode: last inode addr in current pseg "
|
2003-01-25 00:55:02 +03:00
|
|
|
"(ino %d daddr 0x%llx) ndupino=%d\n", ino,
|
|
|
|
(long long)daddr, sp->ndupino);
|
2002-07-06 05:30:11 +04:00
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Account the inode: it no longer belongs to its former segment,
|
|
|
|
* though it will not belong to the new segment until that segment
|
|
|
|
* is actually written.
|
|
|
|
*/
|
2000-06-07 00:19:14 +04:00
|
|
|
if (daddr != LFS_UNUSED_DADDR) {
|
2002-12-12 15:28:13 +03:00
|
|
|
u_int32_t oldsn = dtosn(fs, daddr);
|
1994-06-08 15:41:58 +04:00
|
|
|
#ifdef DIAGNOSTIC
|
2002-12-12 15:28:13 +03:00
|
|
|
int ndupino = (sp->seg_number == oldsn) ? sp->ndupino : 0;
|
|
|
|
#endif
|
|
|
|
LFS_SEGENTRY(sup, fs, oldsn, bp);
|
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
if (sup->su_nbytes + DINODE_SIZE * ndupino < DINODE_SIZE) {
|
2000-07-03 05:45:46 +04:00
|
|
|
printf("lfs_writeinode: negative bytes "
|
2003-01-28 02:17:56 +03:00
|
|
|
"(segment %" PRIu32 " short by %d, "
|
|
|
|
"oldsn=%" PRIu32 ", cursn=%" PRIu32
|
|
|
|
", daddr=%" PRId64 ", su_nbytes=%u, "
|
2002-12-12 15:28:13 +03:00
|
|
|
"ndupino=%d)\n",
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
dtosn(fs, daddr),
|
2002-12-12 15:28:13 +03:00
|
|
|
(int)DINODE_SIZE * (1 - sp->ndupino)
|
|
|
|
- sup->su_nbytes,
|
2003-01-28 02:17:56 +03:00
|
|
|
oldsn, sp->seg_number, daddr,
|
2002-12-12 15:28:13 +03:00
|
|
|
(unsigned int)sup->su_nbytes,
|
|
|
|
sp->ndupino);
|
1999-06-16 02:25:41 +04:00
|
|
|
panic("lfs_writeinode: negative bytes");
|
|
|
|
sup->su_nbytes = DINODE_SIZE;
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
#endif
|
|
|
|
#ifdef DEBUG_SU_NBYTES
|
|
|
|
printf("seg %d -= %d for ino %d inode\n",
|
|
|
|
dtosn(fs, daddr), DINODE_SIZE, ino);
|
1994-06-08 15:41:58 +04:00
|
|
|
#endif
|
1998-10-23 04:32:35 +04:00
|
|
|
sup->su_nbytes -= DINODE_SIZE;
|
1994-06-08 15:41:58 +04:00
|
|
|
redo_ifile =
|
1999-03-10 03:20:00 +03:00
|
|
|
(ino == LFS_IFILE_INUM && !(bp->b_flags & B_GATHERED));
|
2002-05-15 00:03:53 +04:00
|
|
|
if (redo_ifile)
|
|
|
|
fs->lfs_flags |= LFS_IFDIRTY;
|
|
|
|
error = LFS_BWRITE_LOG(bp); /* Ifile */
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
|
|
|
return (redo_ifile);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
lfs_gatherblock(struct segment *sp, struct buf *bp, int *sptr)
|
1994-06-08 15:41:58 +04:00
|
|
|
{
|
|
|
|
struct lfs *fs;
|
|
|
|
int version;
|
1999-03-10 03:20:00 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/*
|
|
|
|
* If full, finish this segment. We may be doing I/O, so
|
|
|
|
* release and reacquire the splbio().
|
|
|
|
*/
|
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
if (sp->vp == NULL)
|
|
|
|
panic ("lfs_gatherblock: Null vp in segment");
|
|
|
|
#endif
|
|
|
|
fs = sp->fs;
|
2003-01-29 16:14:33 +03:00
|
|
|
if (sp->sum_bytes_left < sizeof(int32_t) ||
|
1998-03-01 05:20:01 +03:00
|
|
|
sp->seg_bytes_left < bp->b_bcount) {
|
1994-06-08 15:41:58 +04:00
|
|
|
if (sptr)
|
|
|
|
splx(*sptr);
|
|
|
|
lfs_updatemeta(sp);
|
1999-03-10 03:20:00 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
version = sp->fip->fi_version;
|
|
|
|
(void) lfs_writeseg(fs, sp);
|
1999-03-10 03:20:00 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
sp->fip->fi_version = version;
|
|
|
|
sp->fip->fi_ino = VTOI(sp->vp)->i_number;
|
|
|
|
/* Add the current file to the segment summary. */
|
|
|
|
++((SEGSUM *)(sp->segsum))->ss_nfinfo;
|
2003-01-29 16:14:33 +03:00
|
|
|
sp->sum_bytes_left -= FINFOSIZE;
|
1999-03-10 03:20:00 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
if (sptr)
|
|
|
|
*sptr = splbio();
|
2001-11-24 00:44:25 +03:00
|
|
|
return (1);
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
1999-03-10 03:20:00 +03:00
|
|
|
|
|
|
|
#ifdef DEBUG
|
2001-11-24 00:44:25 +03:00
|
|
|
if (bp->b_flags & B_GATHERED) {
|
2003-01-26 02:00:09 +03:00
|
|
|
printf("lfs_gatherblock: already gathered! Ino %d,"
|
|
|
|
" lbn %" PRId64 "\n",
|
1999-03-10 03:20:00 +03:00
|
|
|
sp->fip->fi_ino, bp->b_lblkno);
|
2001-11-24 00:44:25 +03:00
|
|
|
return (0);
|
1999-03-10 03:20:00 +03:00
|
|
|
}
|
|
|
|
#endif
|
1994-06-08 15:41:58 +04:00
|
|
|
/* Insert into the buffer list, update the FINFO block. */
|
|
|
|
bp->b_flags |= B_GATHERED;
|
2002-05-15 00:03:53 +04:00
|
|
|
bp->b_flags &= ~B_DONE;
|
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
*sp->cbpp++ = bp;
|
|
|
|
sp->fip->fi_blocks[sp->fip->fi_nblocks++] = bp->b_lblkno;
|
1999-03-10 03:20:00 +03:00
|
|
|
|
2003-01-29 16:14:33 +03:00
|
|
|
sp->sum_bytes_left -= sizeof(int32_t);
|
1998-03-01 05:20:01 +03:00
|
|
|
sp->seg_bytes_left -= bp->b_bcount;
|
2001-11-24 00:44:25 +03:00
|
|
|
return (0);
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
|
|
|
|
1999-03-10 03:20:00 +03:00
|
|
|
int
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
lfs_gather(struct lfs *fs, struct segment *sp, struct vnode *vp, int (*match)(struct lfs *, struct buf *))
|
1994-06-08 15:41:58 +04:00
|
|
|
{
|
2002-05-24 03:05:25 +04:00
|
|
|
struct buf *bp, *nbp;
|
2001-11-24 00:44:25 +03:00
|
|
|
int s, count = 0;
|
1999-03-10 03:20:00 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
sp->vp = vp;
|
|
|
|
s = splbio();
|
1998-03-01 05:20:01 +03:00
|
|
|
|
1999-03-10 03:20:00 +03:00
|
|
|
#ifndef LFS_NO_BACKBUF_HACK
|
|
|
|
/* This is a hack to see if ordering the blocks in LFS makes a difference. */
|
2002-05-18 01:42:38 +04:00
|
|
|
# define BUF_OFFSET (((caddr_t)&LIST_NEXT(bp, b_vnbufs)) - (caddr_t)bp)
|
|
|
|
# define BACK_BUF(BP) ((struct buf *)(((caddr_t)(BP)->b_vnbufs.le_prev) - BUF_OFFSET))
|
|
|
|
# define BEG_OF_LIST ((struct buf *)(((caddr_t)&LIST_FIRST(&vp->v_dirtyblkhd)) - BUF_OFFSET))
|
1998-03-01 05:20:01 +03:00
|
|
|
/* Find last buffer. */
|
2002-05-18 01:42:38 +04:00
|
|
|
loop: for (bp = LIST_FIRST(&vp->v_dirtyblkhd); bp && LIST_NEXT(bp, b_vnbufs) != NULL;
|
|
|
|
bp = LIST_NEXT(bp, b_vnbufs));
|
2002-05-24 03:05:25 +04:00
|
|
|
for (; bp && bp != BEG_OF_LIST; bp = nbp) {
|
|
|
|
nbp = BACK_BUF(bp);
|
|
|
|
#else /* LFS_NO_BACKBUF_HACK */
|
|
|
|
loop: for (bp = LIST_FIRST(&vp->v_dirtyblkhd); bp; bp = nbp) {
|
|
|
|
nbp = LIST_NEXT(bp, b_vnbufs);
|
1999-03-10 03:20:00 +03:00
|
|
|
#endif /* LFS_NO_BACKBUF_HACK */
|
2002-05-15 00:03:53 +04:00
|
|
|
if ((bp->b_flags & (B_BUSY|B_GATHERED)) || !match(fs, bp)) {
|
|
|
|
#ifdef DEBUG_LFS
|
|
|
|
if (vp == fs->lfs_ivnode && (bp->b_flags & (B_BUSY|B_GATHERED)) == B_BUSY)
|
2003-01-28 02:17:56 +03:00
|
|
|
printf("(%" PRId64 ":%lx)", bp->b_lblkno, bp->b_flags);
|
2002-05-15 00:03:53 +04:00
|
|
|
#endif
|
1994-06-08 15:41:58 +04:00
|
|
|
continue;
|
2002-05-15 00:03:53 +04:00
|
|
|
}
|
2001-11-24 00:44:25 +03:00
|
|
|
if (vp->v_type == VBLK) {
|
1999-09-04 02:48:51 +04:00
|
|
|
/* For block devices, just write the blocks. */
|
|
|
|
/* XXX Do we really need to even do this? */
|
|
|
|
#ifdef DEBUG_LFS
|
2001-11-24 00:44:25 +03:00
|
|
|
if (count == 0)
|
1999-09-04 02:48:51 +04:00
|
|
|
printf("BLK(");
|
|
|
|
printf(".");
|
|
|
|
#endif
|
|
|
|
/* Get the block before bwrite, so we don't corrupt the free list */
|
|
|
|
bp->b_flags |= B_BUSY;
|
|
|
|
bremfree(bp);
|
|
|
|
bwrite(bp);
|
|
|
|
} else {
|
1994-06-08 15:41:58 +04:00
|
|
|
#ifdef DIAGNOSTIC
|
2001-11-24 00:44:25 +03:00
|
|
|
if ((bp->b_flags & (B_CALL|B_INVAL)) == B_INVAL) {
|
2003-01-25 21:12:31 +03:00
|
|
|
printf("lfs_gather: lbn %" PRId64 " is "
|
|
|
|
"B_INVAL\n", bp->b_lblkno);
|
2000-05-06 00:59:20 +04:00
|
|
|
VOP_PRINT(bp->b_vp);
|
|
|
|
}
|
1999-09-04 02:48:51 +04:00
|
|
|
if (!(bp->b_flags & B_DELWRI))
|
|
|
|
panic("lfs_gather: bp not B_DELWRI");
|
|
|
|
if (!(bp->b_flags & B_LOCKED)) {
|
2003-01-25 21:12:31 +03:00
|
|
|
printf("lfs_gather: lbn %" PRId64 " blk "
|
|
|
|
"%" PRId64 " not B_LOCKED\n",
|
|
|
|
bp->b_lblkno,
|
|
|
|
dbtofsb(fs, bp->b_blkno));
|
1999-09-04 02:48:51 +04:00
|
|
|
VOP_PRINT(bp->b_vp);
|
|
|
|
panic("lfs_gather: bp not B_LOCKED");
|
|
|
|
}
|
1994-06-08 15:41:58 +04:00
|
|
|
#endif
|
1999-09-04 02:48:51 +04:00
|
|
|
if (lfs_gatherblock(sp, bp, &s)) {
|
|
|
|
goto loop;
|
|
|
|
}
|
1999-03-10 03:20:00 +03:00
|
|
|
}
|
1999-09-04 02:48:51 +04:00
|
|
|
count++;
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
|
|
|
splx(s);
|
1999-09-04 02:48:51 +04:00
|
|
|
#ifdef DEBUG_LFS
|
2001-11-24 00:44:25 +03:00
|
|
|
if (vp->v_type == VBLK && count)
|
1999-09-04 02:48:51 +04:00
|
|
|
printf(")\n");
|
|
|
|
#endif
|
1994-06-08 15:41:58 +04:00
|
|
|
lfs_updatemeta(sp);
|
|
|
|
sp->vp = NULL;
|
1999-03-10 03:20:00 +03:00
|
|
|
return count;
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Update the metadata that points to the blocks listed in the FINFO
|
|
|
|
* array.
|
|
|
|
*/
|
|
|
|
void
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
lfs_updatemeta(struct segment *sp)
|
1994-06-08 15:41:58 +04:00
|
|
|
{
|
|
|
|
SEGUSE *sup;
|
2002-07-06 05:30:11 +04:00
|
|
|
struct buf *bp, *sbp;
|
1994-06-08 15:41:58 +04:00
|
|
|
struct lfs *fs;
|
|
|
|
struct vnode *vp;
|
|
|
|
struct indir a[NIADDR + 2], *ap;
|
|
|
|
struct inode *ip;
|
2003-01-25 00:55:02 +03:00
|
|
|
daddr_t daddr, lbn, off;
|
2000-05-06 00:59:20 +04:00
|
|
|
daddr_t ooff;
|
1998-03-01 05:20:01 +03:00
|
|
|
int error, i, nblocks, num;
|
2002-07-06 05:30:11 +04:00
|
|
|
int bb, osize, obb;
|
1999-03-10 03:20:00 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
vp = sp->vp;
|
|
|
|
nblocks = &sp->fip->fi_blocks[sp->fip->fi_nblocks] - sp->start_lbp;
|
1998-03-01 05:20:01 +03:00
|
|
|
if (nblocks < 0)
|
2002-09-27 19:35:29 +04:00
|
|
|
panic("This is a bad thing");
|
1994-06-08 15:41:58 +04:00
|
|
|
if (vp == NULL || nblocks == 0)
|
|
|
|
return;
|
1999-03-10 03:20:00 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/* Sort the blocks. */
|
1999-03-10 03:20:00 +03:00
|
|
|
/*
|
|
|
|
* XXX KS - We have to sort even if the blocks come from the
|
|
|
|
* cleaner, because there might be other pending blocks on the
|
|
|
|
* same inode...and if we don't sort, and there are fragments
|
|
|
|
* present, blocks may be written in the wrong place.
|
|
|
|
*/
|
|
|
|
/* if (!(sp->seg_flags & SEGM_CLEAN)) */
|
|
|
|
lfs_shellsort(sp->start_bpp, sp->start_lbp, nblocks);
|
|
|
|
|
1998-03-01 05:20:01 +03:00
|
|
|
/*
|
|
|
|
* Record the length of the last block in case it's a fragment.
|
|
|
|
* If there are indirect blocks present, they sort last. An
|
|
|
|
* indirect block will be lfs_bsize and its presence indicates
|
|
|
|
* that you cannot have fragments.
|
2002-07-06 05:30:11 +04:00
|
|
|
*
|
|
|
|
* XXX This last is a lie. A cleaned fragment can coexist with
|
|
|
|
* XXX a later indirect block. This will continue to be
|
|
|
|
* XXX true until lfs_markv is fixed to do everything with
|
|
|
|
* XXX fake blocks (including fake inodes and fake indirect blocks).
|
1998-03-01 05:20:01 +03:00
|
|
|
*/
|
|
|
|
sp->fip->fi_lastlength = sp->start_bpp[nblocks - 1]->b_bcount;
|
1999-03-10 03:20:00 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/*
|
|
|
|
* Assign disk addresses, and update references to the logical
|
|
|
|
* block and the segment usage information.
|
|
|
|
*/
|
|
|
|
fs = sp->fs;
|
|
|
|
for (i = nblocks; i--; ++sp->start_bpp) {
|
|
|
|
lbn = *sp->start_lbp++;
|
2002-07-06 05:30:11 +04:00
|
|
|
sbp = *sp->start_bpp;
|
1999-03-10 03:20:00 +03:00
|
|
|
|
2002-07-06 05:30:11 +04:00
|
|
|
sbp->b_blkno = fsbtodb(fs, fs->lfs_offset);
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
off = fs->lfs_offset;
|
2002-07-06 05:30:11 +04:00
|
|
|
if (sbp->b_blkno == sbp->b_lblkno) {
|
2003-01-25 21:12:31 +03:00
|
|
|
printf("lfs_updatemeta: ino %d blk %" PRId64
|
Various bug-fixes to LFS, to wit:
Kernel:
* Add runtime quantity lfs_ravail, the number of disk-blocks reserved
for writing. Writes to the filesystem first reserve a maximum amount
of blocks before their write is allowed to proceed; after the blocks
are allocated the reserved total is reduced by a corresponding amount.
If the lfs_reserve function cannot immediately reserve the requested
number of blocks, the inode is unlocked, and the thread sleeps until
the cleaner has made enough space available for the blocks to be
reserved. In this way large files can be written to the filesystem
(or, smaller files can be written to a nearly-full but thoroughly
clean filesystem) and the cleaner can still function properly.
* Remove explicit switching on dlfs_minfreeseg from the kernel code; it
is now merely a fs-creation parameter used to compute dlfs_avail and
dlfs_bfree (and used by fsck_lfs(8) to check their accuracy). Its
former role is better assumed by a properly computed dlfs_avail.
* Bounds-check inode numbers submitted through lfs_bmapv and lfs_markv.
This prevents a panic, but, if the cleaner is feeding the filesystem
the wrong data, you are still in a world of hurt.
* Cleanup: remove explicit references of DEV_BSIZE in favor of
btodb()/dbtob().
lfs_cleanerd:
* Make -n mean "send N segments' blocks through a single call to
lfs_markv". Previously it had meant "clean N segments though N calls
to lfs_markv, before looking again to see if more need to be cleaned".
The new behavior gives better packing of direct data on disk with as
little metadata as possible, largely alleviating the problem that the
cleaner can consume more disk through inefficient use of metadata than
it frees by moving dirty data away from clean "holes" to produce
entirely clean segments.
* Make -b mean "read as many segments as necessary to write N segments
of dirty data back to disk", rather than its former meaning of "read
as many segments as necessary to free N segments worth of space". The
new meaning, combined with the new -n behavior described above,
further aids in cleaning storage efficiency as entire segments can be
written at once, using as few blocks as possible for segment summaries
and inode blocks.
* Make the cleaner take note of segments which could not be cleaned due
to error, and not attempt to clean them until they are entirely free
of dirty blocks. This prevents the case in which a cleanerd running
with -n 1 and without -b (formerly the default) would spin trying
repeatedly to clean a corrupt segment, while the remaining space
filled and deadlocked the filesystem.
* Update the lfs_cleanerd manual page to describe all the options,
including the changes mentioned here (in particular, the -b and -n
flags were previously undocumented).
fsck_lfs:
* Check, and optionally fix, lfs_avail (to an exact figure) and
lfs_bfree (within a margin of error) in pass 5.
newfs_lfs:
* Reduce the default dlfs_minfreeseg to 1/20 of the total segments.
* Add a warning if the sgs disklabel field is 16 (the default for FFS'
cpg, but not usually desirable for LFS' sgs: 5--8 is a better range).
* Change the calculation of lfs_avail and lfs_bfree, corresponding to
the kernel changes mentioned above.
mount_lfs:
* Add -N and -b options to pass corresponding -n and -b options to
lfs_cleanerd.
* Default to calling lfs_cleanerd with "-b -n 4".
[All of these changes were largely tested in the 1.5 branch, with the
idea that they (along with previous un-pulled-up work) could be applied
to the branch while it was still in ALPHA2; however my test system has
experienced corruption on another filesystem (/dev/console has gone
missing :^), and, while I believe this unrelated to the LFS changes, I
cannot with good conscience request that the changes be pulled up.]
2000-09-09 08:49:54 +04:00
|
|
|
" has same lbn and daddr\n",
|
2003-01-28 00:45:52 +03:00
|
|
|
VTOI(vp)->i_number, off);
|
1999-03-26 00:54:10 +03:00
|
|
|
}
|
2002-07-06 05:30:11 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* If we write a frag in the wrong place, the cleaner won't
|
|
|
|
* be able to correctly identify its size later, and the
|
|
|
|
* segment will be uncleanable. (Even worse, it will assume
|
|
|
|
* that the indirect block that actually ends the list
|
|
|
|
* is of a smaller size!)
|
|
|
|
*/
|
|
|
|
if (sbp->b_bcount < fs->lfs_bsize && i != 0)
|
2002-09-27 19:35:29 +04:00
|
|
|
panic("lfs_updatemeta: fragment is not last block");
|
2002-07-06 05:30:11 +04:00
|
|
|
|
|
|
|
bb = fragstofsb(fs, numfrags(fs, sbp->b_bcount));
|
2000-07-03 05:45:46 +04:00
|
|
|
fs->lfs_offset += bb;
|
1996-02-10 01:28:45 +03:00
|
|
|
error = ufs_bmaparray(vp, lbn, &daddr, a, &num, NULL);
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
if (daddr > 0)
|
|
|
|
daddr = dbtofsb(fs, daddr);
|
1996-02-10 01:28:45 +03:00
|
|
|
if (error)
|
1994-06-08 15:41:58 +04:00
|
|
|
panic("lfs_updatemeta: ufs_bmaparray %d", error);
|
|
|
|
ip = VTOI(vp);
|
|
|
|
switch (num) {
|
|
|
|
case 0:
|
2000-05-06 00:59:20 +04:00
|
|
|
ooff = ip->i_ffs_db[lbn];
|
2000-07-05 02:30:37 +04:00
|
|
|
#ifdef DEBUG
|
|
|
|
if (ooff == 0) {
|
2000-07-03 05:45:46 +04:00
|
|
|
printf("lfs_updatemeta[1]: warning: writing "
|
2003-01-26 02:00:09 +03:00
|
|
|
"ino %d lbn %" PRId64 " at 0x%" PRIx64
|
|
|
|
", was 0x0\n", ip->i_number, lbn, off);
|
2000-07-03 05:45:46 +04:00
|
|
|
}
|
2000-07-05 02:30:37 +04:00
|
|
|
#endif
|
|
|
|
if (ooff == UNWRITTEN)
|
|
|
|
ip->i_ffs_blocks += bb;
|
2002-07-06 05:30:11 +04:00
|
|
|
else {
|
|
|
|
/* possible fragment truncation or extension */
|
|
|
|
obb = btofsb(fs, ip->i_lfs_fragsize[lbn]);
|
|
|
|
ip->i_ffs_blocks += (bb - obb);
|
|
|
|
}
|
2000-07-05 02:30:37 +04:00
|
|
|
ip->i_ffs_db[lbn] = off;
|
1994-06-08 15:41:58 +04:00
|
|
|
break;
|
|
|
|
case 1:
|
2000-05-06 00:59:20 +04:00
|
|
|
ooff = ip->i_ffs_ib[a[0].in_off];
|
2000-07-05 02:30:37 +04:00
|
|
|
#ifdef DEBUG
|
|
|
|
if (ooff == 0) {
|
2000-07-03 05:45:46 +04:00
|
|
|
printf("lfs_updatemeta[2]: warning: writing "
|
2003-01-26 02:00:09 +03:00
|
|
|
"ino %d lbn %" PRId64 " at 0x%" PRIx64
|
|
|
|
", was 0x0\n", ip->i_number, lbn, off);
|
2000-07-03 05:45:46 +04:00
|
|
|
}
|
2000-07-05 02:30:37 +04:00
|
|
|
#endif
|
|
|
|
if (ooff == UNWRITTEN)
|
|
|
|
ip->i_ffs_blocks += bb;
|
|
|
|
ip->i_ffs_ib[a[0].in_off] = off;
|
1994-06-08 15:41:58 +04:00
|
|
|
break;
|
|
|
|
default:
|
|
|
|
ap = &a[num - 1];
|
|
|
|
if (bread(vp, ap->in_lbn, fs->lfs_bsize, NOCRED, &bp))
|
2003-01-25 21:12:31 +03:00
|
|
|
panic("lfs_updatemeta: bread bno %" PRId64,
|
2003-01-28 00:45:52 +03:00
|
|
|
ap->in_lbn);
|
2000-07-05 02:30:37 +04:00
|
|
|
|
2003-01-25 00:55:02 +03:00
|
|
|
/* XXX ondisk32 */
|
|
|
|
ooff = ((int32_t *)bp->b_data)[ap->in_off];
|
2000-07-05 02:30:37 +04:00
|
|
|
#if DEBUG
|
|
|
|
if (ooff == 0) {
|
2000-07-03 05:45:46 +04:00
|
|
|
printf("lfs_updatemeta[3]: warning: writing "
|
2003-01-26 02:00:09 +03:00
|
|
|
"ino %d lbn %" PRId64 " at 0x%" PRIx64
|
|
|
|
", was 0x0\n", ip->i_number, lbn, off);
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
2000-07-05 02:30:37 +04:00
|
|
|
#endif
|
|
|
|
if (ooff == UNWRITTEN)
|
|
|
|
ip->i_ffs_blocks += bb;
|
2003-01-25 00:55:02 +03:00
|
|
|
/* XXX ondisk32 */
|
|
|
|
((int32_t *)bp->b_data)[ap->in_off] = off;
|
Various bug-fixes to LFS, to wit:
Kernel:
* Add runtime quantity lfs_ravail, the number of disk-blocks reserved
for writing. Writes to the filesystem first reserve a maximum amount
of blocks before their write is allowed to proceed; after the blocks
are allocated the reserved total is reduced by a corresponding amount.
If the lfs_reserve function cannot immediately reserve the requested
number of blocks, the inode is unlocked, and the thread sleeps until
the cleaner has made enough space available for the blocks to be
reserved. In this way large files can be written to the filesystem
(or, smaller files can be written to a nearly-full but thoroughly
clean filesystem) and the cleaner can still function properly.
* Remove explicit switching on dlfs_minfreeseg from the kernel code; it
is now merely a fs-creation parameter used to compute dlfs_avail and
dlfs_bfree (and used by fsck_lfs(8) to check their accuracy). Its
former role is better assumed by a properly computed dlfs_avail.
* Bounds-check inode numbers submitted through lfs_bmapv and lfs_markv.
This prevents a panic, but, if the cleaner is feeding the filesystem
the wrong data, you are still in a world of hurt.
* Cleanup: remove explicit references of DEV_BSIZE in favor of
btodb()/dbtob().
lfs_cleanerd:
* Make -n mean "send N segments' blocks through a single call to
lfs_markv". Previously it had meant "clean N segments though N calls
to lfs_markv, before looking again to see if more need to be cleaned".
The new behavior gives better packing of direct data on disk with as
little metadata as possible, largely alleviating the problem that the
cleaner can consume more disk through inefficient use of metadata than
it frees by moving dirty data away from clean "holes" to produce
entirely clean segments.
* Make -b mean "read as many segments as necessary to write N segments
of dirty data back to disk", rather than its former meaning of "read
as many segments as necessary to free N segments worth of space". The
new meaning, combined with the new -n behavior described above,
further aids in cleaning storage efficiency as entire segments can be
written at once, using as few blocks as possible for segment summaries
and inode blocks.
* Make the cleaner take note of segments which could not be cleaned due
to error, and not attempt to clean them until they are entirely free
of dirty blocks. This prevents the case in which a cleanerd running
with -n 1 and without -b (formerly the default) would spin trying
repeatedly to clean a corrupt segment, while the remaining space
filled and deadlocked the filesystem.
* Update the lfs_cleanerd manual page to describe all the options,
including the changes mentioned here (in particular, the -b and -n
flags were previously undocumented).
fsck_lfs:
* Check, and optionally fix, lfs_avail (to an exact figure) and
lfs_bfree (within a margin of error) in pass 5.
newfs_lfs:
* Reduce the default dlfs_minfreeseg to 1/20 of the total segments.
* Add a warning if the sgs disklabel field is 16 (the default for FFS'
cpg, but not usually desirable for LFS' sgs: 5--8 is a better range).
* Change the calculation of lfs_avail and lfs_bfree, corresponding to
the kernel changes mentioned above.
mount_lfs:
* Add -N and -b options to pass corresponding -n and -b options to
lfs_cleanerd.
* Default to calling lfs_cleanerd with "-b -n 4".
[All of these changes were largely tested in the 1.5 branch, with the
idea that they (along with previous un-pulled-up work) could be applied
to the branch while it was still in ALPHA2; however my test system has
experienced corruption on another filesystem (/dev/console has gone
missing :^), and, while I believe this unrelated to the LFS changes, I
cannot with good conscience request that the changes be pulled up.]
2000-09-09 08:49:54 +04:00
|
|
|
(void) VOP_BWRITE(bp);
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
2000-07-05 02:30:37 +04:00
|
|
|
#ifdef DEBUG
|
2000-06-07 00:19:14 +04:00
|
|
|
if (daddr >= fs->lfs_lastpseg && daddr <= off) {
|
2003-01-25 21:12:31 +03:00
|
|
|
printf("lfs_updatemeta: ino %d, lbn %" PRId64 ", "
|
2003-01-26 02:00:09 +03:00
|
|
|
"addr = %" PRIx64 " in same pseg\n",
|
2003-01-25 21:12:31 +03:00
|
|
|
VTOI(sp->vp)->i_number, sbp->b_lblkno, daddr);
|
2000-06-07 00:19:14 +04:00
|
|
|
}
|
2000-07-05 02:30:37 +04:00
|
|
|
#endif
|
2002-07-06 05:30:11 +04:00
|
|
|
/*
|
|
|
|
* Update segment usage information, based on old size
|
|
|
|
* and location.
|
|
|
|
*/
|
2000-06-07 00:19:14 +04:00
|
|
|
if (daddr > 0) {
|
2002-12-12 15:28:13 +03:00
|
|
|
u_int32_t oldsn = dtosn(fs, daddr);
|
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
int ndupino = (sp->seg_number == oldsn) ?
|
|
|
|
sp->ndupino : 0;
|
|
|
|
#endif
|
2002-07-06 05:30:11 +04:00
|
|
|
if (lbn >= 0 && lbn < NDADDR)
|
|
|
|
osize = ip->i_lfs_fragsize[lbn];
|
|
|
|
else
|
|
|
|
osize = fs->lfs_bsize;
|
2002-12-12 15:28:13 +03:00
|
|
|
LFS_SEGENTRY(sup, fs, oldsn, bp);
|
1994-06-08 15:41:58 +04:00
|
|
|
#ifdef DIAGNOSTIC
|
2002-12-12 15:28:13 +03:00
|
|
|
if (sup->su_nbytes + DINODE_SIZE * ndupino < osize) {
|
2000-07-05 02:30:37 +04:00
|
|
|
printf("lfs_updatemeta: negative bytes "
|
2003-01-28 02:17:56 +03:00
|
|
|
"(segment %" PRIu32 " short by %d)\n",
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
dtosn(fs, daddr),
|
2002-07-06 05:30:11 +04:00
|
|
|
osize - sup->su_nbytes);
|
2003-01-25 21:12:31 +03:00
|
|
|
printf("lfs_updatemeta: ino %d, lbn %" PRId64
|
2003-01-28 00:45:52 +03:00
|
|
|
", addr = 0x%" PRIx64 "\n",
|
2003-01-25 15:50:38 +03:00
|
|
|
VTOI(sp->vp)->i_number, lbn, daddr);
|
2002-12-12 15:28:13 +03:00
|
|
|
printf("lfs_updatemeta: ndupino=%d\n", ndupino);
|
1999-06-16 02:25:41 +04:00
|
|
|
panic("lfs_updatemeta: negative bytes");
|
2002-12-12 15:28:13 +03:00
|
|
|
sup->su_nbytes = osize;
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
#endif
|
|
|
|
#ifdef DEBUG_SU_NBYTES
|
2003-01-28 02:17:56 +03:00
|
|
|
printf("seg %" PRIu32 " -= %d for ino %d lbn %" PRId64
|
|
|
|
" db 0x%" PRIx64 "\n",
|
2003-01-25 21:12:31 +03:00
|
|
|
dtosn(fs, daddr), osize,
|
|
|
|
VTOI(sp->vp)->i_number, lbn, daddr);
|
1994-06-08 15:41:58 +04:00
|
|
|
#endif
|
2002-07-06 05:30:11 +04:00
|
|
|
sup->su_nbytes -= osize;
|
2002-05-15 00:03:53 +04:00
|
|
|
if (!(bp->b_flags & B_GATHERED))
|
|
|
|
fs->lfs_flags |= LFS_IFDIRTY;
|
|
|
|
error = LFS_BWRITE_LOG(bp); /* Ifile */
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
2002-07-06 05:30:11 +04:00
|
|
|
/*
|
|
|
|
* Now that this block has a new address, and its old
|
|
|
|
* segment no longer owns it, we can forget about its
|
|
|
|
* old size.
|
|
|
|
*/
|
|
|
|
if (lbn >= 0 && lbn < NDADDR)
|
|
|
|
ip->i_lfs_fragsize[lbn] = sbp->b_bcount;
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Start a new segment.
|
|
|
|
*/
|
|
|
|
int
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
lfs_initseg(struct lfs *fs)
|
1994-06-08 15:41:58 +04:00
|
|
|
{
|
|
|
|
struct segment *sp;
|
|
|
|
SEGUSE *sup;
|
|
|
|
SEGSUM *ssp;
|
2002-05-15 00:03:53 +04:00
|
|
|
struct buf *bp, *sbp;
|
1994-06-08 15:41:58 +04:00
|
|
|
int repeat;
|
1999-03-10 03:20:00 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
sp = fs->lfs_sp;
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
repeat = 0;
|
|
|
|
/* Advance to the next segment. */
|
|
|
|
if (!LFS_PARTIAL_FITS(fs)) {
|
2000-07-05 02:30:37 +04:00
|
|
|
/* lfs_avail eats the remaining space */
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
fs->lfs_avail -= fs->lfs_fsbpseg - (fs->lfs_offset -
|
2000-07-05 02:30:37 +04:00
|
|
|
fs->lfs_curseg);
|
1994-06-08 15:41:58 +04:00
|
|
|
/* Wake up any cleaning procs waiting on this file system. */
|
|
|
|
wakeup(&lfs_allclean_wakeup);
|
1998-03-01 05:20:01 +03:00
|
|
|
wakeup(&fs->lfs_nextseg);
|
1994-06-08 15:41:58 +04:00
|
|
|
lfs_newseg(fs);
|
|
|
|
repeat = 1;
|
|
|
|
fs->lfs_offset = fs->lfs_curseg;
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
sp->seg_number = dtosn(fs, fs->lfs_curseg);
|
|
|
|
sp->seg_bytes_left = fsbtob(fs, fs->lfs_fsbpseg);
|
1994-06-08 15:41:58 +04:00
|
|
|
/*
|
|
|
|
* If the segment contains a superblock, update the offset
|
|
|
|
* and summary address to skip over it.
|
|
|
|
*/
|
|
|
|
LFS_SEGENTRY(sup, fs, sp->seg_number, bp);
|
|
|
|
if (sup->su_flags & SEGUSE_SUPERBLOCK) {
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
fs->lfs_offset += btofsb(fs, LFS_SBPAD);
|
1994-06-08 15:41:58 +04:00
|
|
|
sp->seg_bytes_left -= LFS_SBPAD;
|
|
|
|
}
|
|
|
|
brelse(bp);
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
/* Segment zero could also contain the labelpad */
|
|
|
|
if (fs->lfs_version > 1 && sp->seg_number == 0 &&
|
|
|
|
fs->lfs_start < btofsb(fs, LFS_LABELPAD)) {
|
|
|
|
fs->lfs_offset += btofsb(fs, LFS_LABELPAD) - fs->lfs_start;
|
|
|
|
sp->seg_bytes_left -= LFS_LABELPAD - fsbtob(fs, fs->lfs_start);
|
|
|
|
}
|
1994-06-08 15:41:58 +04:00
|
|
|
} else {
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
sp->seg_number = dtosn(fs, fs->lfs_curseg);
|
|
|
|
sp->seg_bytes_left = fsbtob(fs, fs->lfs_fsbpseg -
|
Various bug-fixes to LFS, to wit:
Kernel:
* Add runtime quantity lfs_ravail, the number of disk-blocks reserved
for writing. Writes to the filesystem first reserve a maximum amount
of blocks before their write is allowed to proceed; after the blocks
are allocated the reserved total is reduced by a corresponding amount.
If the lfs_reserve function cannot immediately reserve the requested
number of blocks, the inode is unlocked, and the thread sleeps until
the cleaner has made enough space available for the blocks to be
reserved. In this way large files can be written to the filesystem
(or, smaller files can be written to a nearly-full but thoroughly
clean filesystem) and the cleaner can still function properly.
* Remove explicit switching on dlfs_minfreeseg from the kernel code; it
is now merely a fs-creation parameter used to compute dlfs_avail and
dlfs_bfree (and used by fsck_lfs(8) to check their accuracy). Its
former role is better assumed by a properly computed dlfs_avail.
* Bounds-check inode numbers submitted through lfs_bmapv and lfs_markv.
This prevents a panic, but, if the cleaner is feeding the filesystem
the wrong data, you are still in a world of hurt.
* Cleanup: remove explicit references of DEV_BSIZE in favor of
btodb()/dbtob().
lfs_cleanerd:
* Make -n mean "send N segments' blocks through a single call to
lfs_markv". Previously it had meant "clean N segments though N calls
to lfs_markv, before looking again to see if more need to be cleaned".
The new behavior gives better packing of direct data on disk with as
little metadata as possible, largely alleviating the problem that the
cleaner can consume more disk through inefficient use of metadata than
it frees by moving dirty data away from clean "holes" to produce
entirely clean segments.
* Make -b mean "read as many segments as necessary to write N segments
of dirty data back to disk", rather than its former meaning of "read
as many segments as necessary to free N segments worth of space". The
new meaning, combined with the new -n behavior described above,
further aids in cleaning storage efficiency as entire segments can be
written at once, using as few blocks as possible for segment summaries
and inode blocks.
* Make the cleaner take note of segments which could not be cleaned due
to error, and not attempt to clean them until they are entirely free
of dirty blocks. This prevents the case in which a cleanerd running
with -n 1 and without -b (formerly the default) would spin trying
repeatedly to clean a corrupt segment, while the remaining space
filled and deadlocked the filesystem.
* Update the lfs_cleanerd manual page to describe all the options,
including the changes mentioned here (in particular, the -b and -n
flags were previously undocumented).
fsck_lfs:
* Check, and optionally fix, lfs_avail (to an exact figure) and
lfs_bfree (within a margin of error) in pass 5.
newfs_lfs:
* Reduce the default dlfs_minfreeseg to 1/20 of the total segments.
* Add a warning if the sgs disklabel field is 16 (the default for FFS'
cpg, but not usually desirable for LFS' sgs: 5--8 is a better range).
* Change the calculation of lfs_avail and lfs_bfree, corresponding to
the kernel changes mentioned above.
mount_lfs:
* Add -N and -b options to pass corresponding -n and -b options to
lfs_cleanerd.
* Default to calling lfs_cleanerd with "-b -n 4".
[All of these changes were largely tested in the 1.5 branch, with the
idea that they (along with previous un-pulled-up work) could be applied
to the branch while it was still in ALPHA2; however my test system has
experienced corruption on another filesystem (/dev/console has gone
missing :^), and, while I believe this unrelated to the LFS changes, I
cannot with good conscience request that the changes be pulled up.]
2000-09-09 08:49:54 +04:00
|
|
|
(fs->lfs_offset - fs->lfs_curseg));
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
|
|
|
fs->lfs_lastpseg = fs->lfs_offset;
|
1999-03-10 03:20:00 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
sp->fs = fs;
|
|
|
|
sp->ibp = NULL;
|
1999-06-16 02:25:41 +04:00
|
|
|
sp->idp = NULL;
|
1994-06-08 15:41:58 +04:00
|
|
|
sp->ninodes = 0;
|
2002-07-06 05:30:11 +04:00
|
|
|
sp->ndupino = 0;
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/* Get a new buffer for SEGSUM and enter it into the buffer list. */
|
|
|
|
sp->cbpp = sp->bpp;
|
2002-05-15 00:03:53 +04:00
|
|
|
#ifdef LFS_MALLOC_SUMMARY
|
|
|
|
sbp = *sp->cbpp = lfs_newbuf(fs, VTOI(fs->lfs_ivnode)->i_devvp,
|
|
|
|
fsbtodb(fs, fs->lfs_offset), fs->lfs_sumsize);
|
|
|
|
sp->segsum = (*sp->cbpp)->b_data;
|
|
|
|
#else
|
|
|
|
sbp = *sp->cbpp = getblk(VTOI(fs->lfs_ivnode)->i_devvp,
|
|
|
|
fsbtodb(fs, fs->lfs_offset), NBPG, 0, 0);
|
|
|
|
memset(sbp->b_data, 0x5a, NBPG);
|
|
|
|
sp->segsum = (*sp->cbpp)->b_data + NBPG - fs->lfs_sumsize;
|
|
|
|
#endif
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
bzero(sp->segsum, fs->lfs_sumsize);
|
1994-06-08 15:41:58 +04:00
|
|
|
sp->start_bpp = ++sp->cbpp;
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
fs->lfs_offset += btofsb(fs, fs->lfs_sumsize);
|
1999-03-10 03:20:00 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/* Set point to SEGSUM, initialize it. */
|
|
|
|
ssp = sp->segsum;
|
|
|
|
ssp->ss_next = fs->lfs_nextseg;
|
|
|
|
ssp->ss_nfinfo = ssp->ss_ninos = 0;
|
1998-03-01 05:20:01 +03:00
|
|
|
ssp->ss_magic = SS_MAGIC;
|
1994-06-08 15:41:58 +04:00
|
|
|
|
|
|
|
/* Set pointer to first FINFO, initialize it. */
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
sp->fip = (struct finfo *)((caddr_t)sp->segsum + SEGSUM_SIZE(fs));
|
1994-06-08 15:41:58 +04:00
|
|
|
sp->fip->fi_nblocks = 0;
|
|
|
|
sp->start_lbp = &sp->fip->fi_blocks[0];
|
1998-03-01 05:20:01 +03:00
|
|
|
sp->fip->fi_lastlength = 0;
|
1999-03-10 03:20:00 +03:00
|
|
|
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
sp->seg_bytes_left -= fs->lfs_sumsize;
|
|
|
|
sp->sum_bytes_left = fs->lfs_sumsize - SEGSUM_SIZE(fs);
|
1999-03-10 03:20:00 +03:00
|
|
|
|
2002-05-15 00:03:53 +04:00
|
|
|
#ifndef LFS_MALLOC_SUMMARY
|
|
|
|
LFS_LOCK_BUF(sbp);
|
|
|
|
brelse(sbp);
|
|
|
|
#endif
|
2001-11-24 00:44:25 +03:00
|
|
|
return (repeat);
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Return the next segment to write.
|
|
|
|
*/
|
|
|
|
void
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
lfs_newseg(struct lfs *fs)
|
1994-06-08 15:41:58 +04:00
|
|
|
{
|
|
|
|
CLEANERINFO *cip;
|
|
|
|
SEGUSE *sup;
|
|
|
|
struct buf *bp;
|
|
|
|
int curseg, isdirty, sn;
|
1999-03-10 03:20:00 +03:00
|
|
|
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
LFS_SEGENTRY(sup, fs, dtosn(fs, fs->lfs_nextseg), bp);
|
|
|
|
#ifdef DEBUG_SU_NBYTES
|
|
|
|
printf("lfs_newseg: seg %d := 0 in newseg\n", /* XXXDEBUG */
|
|
|
|
dtosn(fs, fs->lfs_nextseg)); /* XXXDEBUG */
|
|
|
|
#endif
|
1999-03-10 03:20:00 +03:00
|
|
|
sup->su_flags |= SEGUSE_DIRTY | SEGUSE_ACTIVE;
|
1994-06-08 15:41:58 +04:00
|
|
|
sup->su_nbytes = 0;
|
|
|
|
sup->su_nsums = 0;
|
|
|
|
sup->su_ninos = 0;
|
2002-05-15 00:03:53 +04:00
|
|
|
(void) LFS_BWRITE_LOG(bp); /* Ifile */
|
1994-06-08 15:41:58 +04:00
|
|
|
|
|
|
|
LFS_CLEANERINFO(cip, fs, bp);
|
|
|
|
--cip->clean;
|
|
|
|
++cip->dirty;
|
1999-03-10 03:20:00 +03:00
|
|
|
fs->lfs_nclean = cip->clean;
|
2000-11-12 10:58:36 +03:00
|
|
|
LFS_SYNC_CLEANERINFO(cip, fs, bp, 1);
|
1999-03-10 03:20:00 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
fs->lfs_lastseg = fs->lfs_curseg;
|
|
|
|
fs->lfs_curseg = fs->lfs_nextseg;
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
for (sn = curseg = dtosn(fs, fs->lfs_curseg) + fs->lfs_interleave;;) {
|
1994-06-08 15:41:58 +04:00
|
|
|
sn = (sn + 1) % fs->lfs_nseg;
|
|
|
|
if (sn == curseg)
|
|
|
|
panic("lfs_nextseg: no clean segments");
|
|
|
|
LFS_SEGENTRY(sup, fs, sn, bp);
|
|
|
|
isdirty = sup->su_flags & SEGUSE_DIRTY;
|
|
|
|
brelse(bp);
|
|
|
|
if (!isdirty)
|
|
|
|
break;
|
|
|
|
}
|
1999-03-10 03:20:00 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
++fs->lfs_nactive;
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
fs->lfs_nextseg = sntod(fs, sn);
|
2001-11-24 00:44:25 +03:00
|
|
|
if (lfs_dostats) {
|
1999-03-10 03:20:00 +03:00
|
|
|
++lfs_stats.segsused;
|
|
|
|
}
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
|
|
|
|
2002-05-15 00:03:53 +04:00
|
|
|
static struct buf **
|
|
|
|
lookahead_pagemove(struct buf **bpp, int nblocks, size_t *size)
|
|
|
|
{
|
|
|
|
size_t maxsize;
|
|
|
|
#ifndef LFS_NO_PAGEMOVE
|
|
|
|
struct buf *bp;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
maxsize = *size;
|
|
|
|
*size = 0;
|
|
|
|
#ifdef LFS_NO_PAGEMOVE
|
|
|
|
return bpp;
|
|
|
|
#else
|
|
|
|
while((bp = *bpp) != NULL && *size < maxsize && nblocks--) {
|
|
|
|
if(bp->b_flags & B_CALL)
|
|
|
|
return bpp;
|
|
|
|
if(bp->b_bcount % NBPG)
|
|
|
|
return bpp;
|
|
|
|
*size += bp->b_bcount;
|
|
|
|
++bpp;
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
#define BQUEUES 4 /* XXX */
|
|
|
|
#define BQ_EMPTY 3 /* XXX */
|
|
|
|
extern TAILQ_HEAD(bqueues, buf) bufqueues[BQUEUES];
|
|
|
|
|
|
|
|
#define BUFHASH(dvp, lbn) \
|
|
|
|
(&bufhashtbl[((long)(dvp) / sizeof(*(dvp)) + (int)(lbn)) & bufhash])
|
|
|
|
extern LIST_HEAD(bufhashhdr, buf) invalhash;
|
|
|
|
/*
|
|
|
|
* Insq/Remq for the buffer hash lists.
|
|
|
|
*/
|
|
|
|
#define binshash(bp, dp) LIST_INSERT_HEAD(dp, bp, b_hash)
|
|
|
|
#define bremhash(bp) LIST_REMOVE(bp, b_hash)
|
|
|
|
|
|
|
|
static struct buf *
|
|
|
|
lfs_newclusterbuf(struct lfs *fs, struct vnode *vp, daddr_t addr, int n)
|
|
|
|
{
|
|
|
|
struct lfs_cluster *cl;
|
|
|
|
struct buf **bpp, *bp;
|
|
|
|
int s;
|
|
|
|
|
|
|
|
cl = (struct lfs_cluster *)malloc(sizeof(*cl), M_SEGMENT, M_WAITOK);
|
|
|
|
bpp = (struct buf **)malloc(n*sizeof(*bpp), M_SEGMENT, M_WAITOK);
|
For synchronous writes, keep separate i/o counters for each write, so
processes don't have to wait for one another to finish (e.g., nfsd seems
to be a little happier now, though I haven't measured the difference).
Synchronous checkpoints, however, must always wait for all i/o to finish.
Take the contents of the callback functions and have them run in thread
context instead (aiodoned thread). lfs_iocount no longer has to be
protected in splbio(), and quite a bit less of the segment construction
loop needs to be in splbio() as well.
If lfs_markv is handed a block that is not the correct size according to
the inode, refuse to process it. (Formerly it was extended to the "correct"
size.) This is possibly more prone to deadlock, but less prone to corruption.
lfs_segclean now outright refuses to clean segments that appear to have live
bytes in them. Again this may be more prone to deadlock but avoids
corruption.
Replace ufsspec_close and ufsfifo_close with LFS equivalents; this means
that no UFS functions need to know about LFS_ITIMES any more. Remove
the reference from ufs/inode.h.
Tested on i386, test-compiled on alpha.
2002-06-16 04:13:15 +04:00
|
|
|
memset(cl, 0, sizeof(*cl));
|
2002-05-15 00:03:53 +04:00
|
|
|
cl->fs = fs;
|
|
|
|
cl->bpp = bpp;
|
|
|
|
cl->bufcount = 0;
|
|
|
|
cl->bufsize = 0;
|
|
|
|
|
For synchronous writes, keep separate i/o counters for each write, so
processes don't have to wait for one another to finish (e.g., nfsd seems
to be a little happier now, though I haven't measured the difference).
Synchronous checkpoints, however, must always wait for all i/o to finish.
Take the contents of the callback functions and have them run in thread
context instead (aiodoned thread). lfs_iocount no longer has to be
protected in splbio(), and quite a bit less of the segment construction
loop needs to be in splbio() as well.
If lfs_markv is handed a block that is not the correct size according to
the inode, refuse to process it. (Formerly it was extended to the "correct"
size.) This is possibly more prone to deadlock, but less prone to corruption.
lfs_segclean now outright refuses to clean segments that appear to have live
bytes in them. Again this may be more prone to deadlock but avoids
corruption.
Replace ufsspec_close and ufsfifo_close with LFS equivalents; this means
that no UFS functions need to know about LFS_ITIMES any more. Remove
the reference from ufs/inode.h.
Tested on i386, test-compiled on alpha.
2002-06-16 04:13:15 +04:00
|
|
|
/* If this segment is being written synchronously, note that */
|
|
|
|
if (fs->lfs_sp->seg_flags & SEGM_SYNC) {
|
|
|
|
cl->flags |= LFS_CL_SYNC;
|
|
|
|
cl->seg = fs->lfs_sp;
|
|
|
|
++cl->seg->seg_iocount;
|
|
|
|
/* printf("+ %x => %d\n", cl->seg, cl->seg->seg_iocount); */
|
|
|
|
}
|
|
|
|
|
2002-05-15 00:03:53 +04:00
|
|
|
/* Get an empty buffer header, or maybe one with something on it */
|
|
|
|
s = splbio();
|
|
|
|
if((bp = bufqueues[BQ_EMPTY].tqh_first) != NULL) {
|
|
|
|
bremfree(bp);
|
|
|
|
/* clear out various other fields */
|
|
|
|
bp->b_flags = B_BUSY;
|
|
|
|
bp->b_dev = NODEV;
|
|
|
|
bp->b_blkno = bp->b_lblkno = 0;
|
|
|
|
bp->b_error = 0;
|
|
|
|
bp->b_resid = 0;
|
|
|
|
bp->b_bcount = 0;
|
|
|
|
|
|
|
|
/* nuke any credentials we were holding */
|
|
|
|
/* XXXXXX */
|
|
|
|
|
|
|
|
bremhash(bp);
|
|
|
|
|
|
|
|
/* disassociate us from our vnode, if we had one... */
|
|
|
|
if (bp->b_vp)
|
|
|
|
brelvp(bp);
|
|
|
|
}
|
|
|
|
splx(s);
|
|
|
|
while (!bp)
|
|
|
|
bp = getnewbuf(0, 0);
|
|
|
|
s = splbio();
|
|
|
|
bgetvp(vp, bp);
|
|
|
|
binshash(bp,&invalhash);
|
|
|
|
splx(s);
|
|
|
|
bp->b_bcount = 0;
|
|
|
|
bp->b_blkno = bp->b_lblkno = addr;
|
|
|
|
|
|
|
|
bp->b_flags |= B_CALL;
|
|
|
|
bp->b_iodone = lfs_cluster_callback;
|
|
|
|
cl->saveaddr = bp->b_saveaddr; /* XXX is this ever used? */
|
|
|
|
bp->b_saveaddr = (caddr_t)cl;
|
|
|
|
|
|
|
|
return bp;
|
|
|
|
}
|
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
int
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
lfs_writeseg(struct lfs *fs, struct segment *sp)
|
1994-06-08 15:41:58 +04:00
|
|
|
{
|
2002-05-15 00:03:53 +04:00
|
|
|
struct buf **bpp, *bp, *cbp, *newbp, **pmlastbpp;
|
1994-06-08 15:41:58 +04:00
|
|
|
SEGUSE *sup;
|
|
|
|
SEGSUM *ssp;
|
|
|
|
dev_t i_dev;
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
char *datap, *dp;
|
2001-07-27 00:20:15 +04:00
|
|
|
int do_again, i, nblocks, s;
|
|
|
|
size_t el_size;
|
2002-05-15 00:03:53 +04:00
|
|
|
struct lfs_cluster *cl;
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
int (*strategy)(void *);
|
1994-06-08 15:41:58 +04:00
|
|
|
struct vop_strategy_args vop_strategy_a;
|
|
|
|
u_short ninos;
|
1999-03-10 03:20:00 +03:00
|
|
|
struct vnode *devvp;
|
1994-06-08 15:41:58 +04:00
|
|
|
char *p;
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
struct vnode *vp;
|
1999-04-12 04:25:13 +04:00
|
|
|
struct inode *ip;
|
2002-05-15 00:03:53 +04:00
|
|
|
size_t pmsize;
|
|
|
|
int use_pagemove;
|
2003-01-25 00:55:02 +03:00
|
|
|
int32_t *daddrp; /* XXX ondisk32 */
|
2000-07-05 02:30:37 +04:00
|
|
|
int changed;
|
1999-03-10 03:20:00 +03:00
|
|
|
#if defined(DEBUG) && defined(LFS_PROPELLER)
|
|
|
|
static int propeller;
|
|
|
|
char propstring[4] = "-\\|/";
|
|
|
|
|
|
|
|
printf("%c\b",propstring[propeller++]);
|
2001-11-24 00:44:25 +03:00
|
|
|
if (propeller == 4)
|
1999-03-10 03:20:00 +03:00
|
|
|
propeller = 0;
|
|
|
|
#endif
|
2002-05-15 00:03:53 +04:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/*
|
|
|
|
* If there are no buffers other than the segment summary to write
|
|
|
|
* and it is not a checkpoint, don't do anything. On a checkpoint,
|
|
|
|
* even if there aren't any buffers, you need to write the superblock.
|
|
|
|
*/
|
|
|
|
if ((nblocks = sp->cbpp - sp->bpp) == 1)
|
|
|
|
return (0);
|
1999-03-10 03:20:00 +03:00
|
|
|
|
1999-06-16 02:25:41 +04:00
|
|
|
i_dev = VTOI(fs->lfs_ivnode)->i_dev;
|
|
|
|
devvp = VTOI(fs->lfs_ivnode)->i_devvp;
|
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/* Update the segment usage information. */
|
|
|
|
LFS_SEGENTRY(sup, fs, sp->seg_number, bp);
|
1999-03-10 03:20:00 +03:00
|
|
|
|
1998-03-01 05:20:01 +03:00
|
|
|
/* Loop through all blocks, except the segment summary. */
|
1999-06-16 02:25:41 +04:00
|
|
|
for (bpp = sp->bpp; ++bpp < sp->cbpp; ) {
|
2001-11-24 00:44:25 +03:00
|
|
|
if ((*bpp)->b_vp != devvp) {
|
1999-06-16 02:25:41 +04:00
|
|
|
sup->su_nbytes += (*bpp)->b_bcount;
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
#ifdef DEBUG_SU_NBYTES
|
2003-01-28 02:17:56 +03:00
|
|
|
printf("seg %" PRIu32 " += %ld for ino %d lbn %" PRId64
|
|
|
|
" db 0x%" PRIx64 "\n", sp->seg_number, (*bpp)->b_bcount,
|
|
|
|
VTOI((*bpp)->b_vp)->i_number, (*bpp)->b_lblkno,
|
|
|
|
(*bpp)->b_blkno);
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
#endif
|
|
|
|
}
|
1999-06-16 02:25:41 +04:00
|
|
|
}
|
1999-03-10 03:20:00 +03:00
|
|
|
|
1998-03-01 05:20:01 +03:00
|
|
|
ssp = (SEGSUM *)sp->segsum;
|
1999-03-10 03:20:00 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
ninos = (ssp->ss_ninos + INOPB(fs) - 1) / INOPB(fs);
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
#ifdef DEBUG_SU_NBYTES
|
|
|
|
printf("seg %d += %d for %d inodes\n", /* XXXDEBUG */
|
|
|
|
sp->seg_number, ssp->ss_ninos * DINODE_SIZE,
|
|
|
|
ssp->ss_ninos);
|
|
|
|
#endif
|
1999-06-16 02:25:41 +04:00
|
|
|
sup->su_nbytes += ssp->ss_ninos * DINODE_SIZE;
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
/* sup->su_nbytes += fs->lfs_sumsize; */
|
|
|
|
if (fs->lfs_version == 1)
|
|
|
|
sup->su_olastmod = time.tv_sec;
|
|
|
|
else
|
|
|
|
sup->su_lastmod = time.tv_sec;
|
1994-06-08 15:41:58 +04:00
|
|
|
sup->su_ninos += ninos;
|
|
|
|
++sup->su_nsums;
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
fs->lfs_dmeta += (btofsb(fs, fs->lfs_sumsize) + btofsb(fs, ninos *
|
|
|
|
fs->lfs_ibsize));
|
|
|
|
fs->lfs_avail -= btofsb(fs, fs->lfs_sumsize);
|
1999-03-10 03:20:00 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
do_again = !(bp->b_flags & B_GATHERED);
|
2002-05-15 00:03:53 +04:00
|
|
|
(void)LFS_BWRITE_LOG(bp); /* Ifile */
|
2000-07-03 05:45:46 +04:00
|
|
|
/*
|
|
|
|
* Mark blocks B_BUSY, to prevent then from being changed between
|
|
|
|
* the checksum computation and the actual write.
|
|
|
|
*
|
|
|
|
* If we are cleaning, check indirect blocks for UNWRITTEN, and if
|
|
|
|
* there are any, replace them with copies that have UNASSIGNED
|
|
|
|
* instead.
|
|
|
|
*/
|
|
|
|
for (bpp = sp->bpp, i = nblocks - 1; i--;) {
|
|
|
|
++bpp;
|
2001-11-24 00:44:25 +03:00
|
|
|
if ((*bpp)->b_flags & B_CALL)
|
2000-07-03 05:45:46 +04:00
|
|
|
continue;
|
|
|
|
bp = *bpp;
|
|
|
|
again:
|
|
|
|
s = splbio();
|
2001-11-24 00:44:25 +03:00
|
|
|
if (bp->b_flags & B_BUSY) {
|
2000-07-03 05:45:46 +04:00
|
|
|
#ifdef DEBUG
|
2003-01-25 21:12:31 +03:00
|
|
|
printf("lfs_writeseg: avoiding potential data summary "
|
|
|
|
"corruption for ino %d, lbn %" PRId64 "\n",
|
2000-07-03 05:45:46 +04:00
|
|
|
VTOI(bp->b_vp)->i_number, bp->b_lblkno);
|
|
|
|
#endif
|
|
|
|
bp->b_flags |= B_WANTED;
|
|
|
|
tsleep(bp, (PRIBIO + 1), "lfs_writeseg", 0);
|
|
|
|
splx(s);
|
|
|
|
goto again;
|
|
|
|
}
|
|
|
|
bp->b_flags |= B_BUSY;
|
|
|
|
splx(s);
|
|
|
|
/* Check and replace indirect block UNWRITTEN bogosity */
|
2001-11-24 00:44:25 +03:00
|
|
|
if (bp->b_lblkno < 0 && bp->b_vp != devvp && bp->b_vp &&
|
2000-07-03 05:45:46 +04:00
|
|
|
VTOI(bp->b_vp)->i_ffs_blocks !=
|
|
|
|
VTOI(bp->b_vp)->i_lfs_effnblks) {
|
2000-07-03 12:20:58 +04:00
|
|
|
#ifdef DEBUG_LFS
|
2000-07-03 05:45:46 +04:00
|
|
|
printf("lfs_writeseg: cleansing ino %d (%d != %d)\n",
|
|
|
|
VTOI(bp->b_vp)->i_number,
|
|
|
|
VTOI(bp->b_vp)->i_lfs_effnblks,
|
|
|
|
VTOI(bp->b_vp)->i_ffs_blocks);
|
2000-07-03 12:20:58 +04:00
|
|
|
#endif
|
2000-07-03 05:45:46 +04:00
|
|
|
/* Make a copy we'll make changes to */
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
newbp = lfs_newbuf(fs, bp->b_vp, bp->b_lblkno,
|
2000-07-03 05:45:46 +04:00
|
|
|
bp->b_bcount);
|
|
|
|
newbp->b_blkno = bp->b_blkno;
|
|
|
|
memcpy(newbp->b_data, bp->b_data,
|
|
|
|
newbp->b_bcount);
|
|
|
|
*bpp = newbp;
|
|
|
|
|
2000-07-05 02:30:37 +04:00
|
|
|
changed = 0;
|
2003-01-25 00:55:02 +03:00
|
|
|
/* XXX ondisk32 */
|
|
|
|
for (daddrp = (int32_t *)(newbp->b_data);
|
|
|
|
daddrp < (int32_t *)(newbp->b_data +
|
2000-07-03 05:45:46 +04:00
|
|
|
newbp->b_bcount); daddrp++) {
|
|
|
|
if (*daddrp == UNWRITTEN) {
|
2000-07-05 02:30:37 +04:00
|
|
|
++changed;
|
2000-07-03 12:20:58 +04:00
|
|
|
#ifdef DEBUG_LFS
|
|
|
|
printf("lfs_writeseg: replacing UNWRITTEN\n");
|
2000-07-03 05:45:46 +04:00
|
|
|
#endif
|
|
|
|
*daddrp = 0;
|
|
|
|
}
|
|
|
|
}
|
2000-07-05 02:30:37 +04:00
|
|
|
/*
|
|
|
|
* Get rid of the old buffer. Don't mark it clean,
|
|
|
|
* though, if it still has dirty data on it.
|
|
|
|
*/
|
|
|
|
if (changed) {
|
|
|
|
bp->b_flags &= ~(B_ERROR | B_GATHERED);
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
if (bp->b_flags & B_CALL) {
|
2000-07-05 02:30:37 +04:00
|
|
|
lfs_freebuf(bp);
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
bp = NULL;
|
|
|
|
} else {
|
2000-09-09 08:13:43 +04:00
|
|
|
/* Still on free list, leave it there */
|
|
|
|
s = splbio();
|
|
|
|
bp->b_flags &= ~B_BUSY;
|
|
|
|
if (bp->b_flags & B_WANTED)
|
|
|
|
wakeup(bp);
|
|
|
|
splx(s);
|
2000-11-17 22:14:41 +03:00
|
|
|
/*
|
|
|
|
* We have to re-decrement lfs_avail
|
|
|
|
* since this block is going to come
|
|
|
|
* back around to us in the next
|
|
|
|
* segment.
|
|
|
|
*/
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
fs->lfs_avail -= btofsb(fs, bp->b_bcount);
|
2000-09-09 08:13:43 +04:00
|
|
|
}
|
2000-07-05 02:30:37 +04:00
|
|
|
} else {
|
|
|
|
bp->b_flags &= ~(B_ERROR | B_READ | B_DELWRI |
|
2000-11-17 22:14:41 +03:00
|
|
|
B_GATHERED);
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
if (bp->b_flags & B_CALL) {
|
2000-07-05 02:30:37 +04:00
|
|
|
lfs_freebuf(bp);
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
bp = NULL;
|
|
|
|
} else {
|
2000-07-05 02:30:37 +04:00
|
|
|
bremfree(bp);
|
|
|
|
bp->b_flags |= B_DONE;
|
2002-05-25 02:13:57 +04:00
|
|
|
s = splbio();
|
2000-07-05 02:30:37 +04:00
|
|
|
reassignbuf(bp, bp->b_vp);
|
2002-05-25 02:13:57 +04:00
|
|
|
splx(s);
|
2002-05-15 00:03:53 +04:00
|
|
|
LFS_UNLOCK_BUF(bp);
|
2000-07-05 02:30:37 +04:00
|
|
|
brelse(bp);
|
|
|
|
}
|
|
|
|
}
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
|
2000-07-03 05:45:46 +04:00
|
|
|
}
|
|
|
|
}
|
1994-06-08 15:41:58 +04:00
|
|
|
/*
|
|
|
|
* Compute checksum across data and then across summary; the first
|
|
|
|
* block (the summary block) is skipped. Set the create time here
|
|
|
|
* so that it's guaranteed to be later than the inode mod times.
|
|
|
|
*
|
|
|
|
* XXX
|
|
|
|
* Fix this to do it inline, instead of malloc/copy.
|
|
|
|
*/
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
if (fs->lfs_version == 1)
|
|
|
|
el_size = sizeof(u_long);
|
|
|
|
else
|
|
|
|
el_size = sizeof(u_int32_t);
|
|
|
|
datap = dp = malloc(nblocks * el_size, M_SEGMENT, M_WAITOK);
|
1994-06-08 15:41:58 +04:00
|
|
|
for (bpp = sp->bpp, i = nblocks - 1; i--;) {
|
1999-03-10 03:20:00 +03:00
|
|
|
if (((*++bpp)->b_flags & (B_CALL|B_INVAL)) == (B_CALL|B_INVAL)) {
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
if (copyin((*bpp)->b_saveaddr, dp, el_size))
|
2000-07-03 05:45:46 +04:00
|
|
|
panic("lfs_writeseg: copyin failed [1]: "
|
2003-01-25 21:12:31 +03:00
|
|
|
"ino %d blk %" PRId64,
|
2000-07-03 05:45:46 +04:00
|
|
|
VTOI((*bpp)->b_vp)->i_number,
|
2003-01-28 00:45:52 +03:00
|
|
|
(*bpp)->b_lblkno);
|
2000-07-03 05:45:46 +04:00
|
|
|
} else
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
memcpy(dp, (*bpp)->b_data, el_size);
|
|
|
|
dp += el_size;
|
|
|
|
}
|
|
|
|
if (fs->lfs_version == 1)
|
|
|
|
ssp->ss_ocreate = time.tv_sec;
|
|
|
|
else {
|
|
|
|
ssp->ss_create = time.tv_sec;
|
|
|
|
ssp->ss_serial = ++fs->lfs_serial;
|
|
|
|
ssp->ss_ident = fs->lfs_ident;
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
2002-05-15 00:03:53 +04:00
|
|
|
#ifndef LFS_MALLOC_SUMMARY
|
|
|
|
/* Set the summary block busy too */
|
|
|
|
(*(sp->bpp))->b_flags |= B_BUSY;
|
|
|
|
#endif
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
ssp->ss_datasum = cksum(datap, (nblocks - 1) * el_size);
|
1994-06-08 15:41:58 +04:00
|
|
|
ssp->ss_sumsum =
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
cksum(&ssp->ss_datasum, fs->lfs_sumsize - sizeof(ssp->ss_sumsum));
|
1994-06-08 15:41:58 +04:00
|
|
|
free(datap, M_SEGMENT);
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
datap = dp = NULL;
|
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
if (fs->lfs_bfree < btofsb(fs, ninos * fs->lfs_ibsize) + btofsb(fs, fs->lfs_sumsize))
|
|
|
|
panic("lfs_writeseg: No diskspace for summary");
|
|
|
|
#endif
|
|
|
|
fs->lfs_bfree -= (btofsb(fs, ninos * fs->lfs_ibsize) +
|
|
|
|
btofsb(fs, fs->lfs_sumsize));
|
1994-06-08 15:41:58 +04:00
|
|
|
|
1999-03-10 03:20:00 +03:00
|
|
|
strategy = devvp->v_op[VOFFSET(vop_strategy)];
|
1994-06-08 15:41:58 +04:00
|
|
|
|
|
|
|
/*
|
2002-05-15 00:03:53 +04:00
|
|
|
* When we simply write the blocks we lose a rotation for every block
|
|
|
|
* written. To avoid this problem, we use pagemove to cluster
|
|
|
|
* the buffers into a chunk and write the chunk. CHUNKSIZE is the
|
|
|
|
* largest size I/O devices can handle.
|
|
|
|
*
|
|
|
|
* XXX - right now MAXPHYS is only 64k; could it be larger?
|
1994-06-08 15:41:58 +04:00
|
|
|
*/
|
1999-03-10 03:20:00 +03:00
|
|
|
|
|
|
|
#define CHUNKSIZE MAXPHYS
|
|
|
|
|
2001-11-24 00:44:25 +03:00
|
|
|
if (devvp == NULL)
|
1999-03-10 03:20:00 +03:00
|
|
|
panic("devvp is NULL");
|
2002-05-15 00:03:53 +04:00
|
|
|
for (bpp = sp->bpp, i = nblocks; i;) {
|
|
|
|
cbp = lfs_newclusterbuf(fs, devvp, (*bpp)->b_blkno, i);
|
|
|
|
cl = (struct lfs_cluster *)cbp->b_saveaddr;
|
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
cbp->b_dev = i_dev;
|
|
|
|
cbp->b_flags |= B_ASYNC | B_BUSY;
|
1998-03-01 05:20:01 +03:00
|
|
|
cbp->b_bcount = 0;
|
1994-06-08 15:41:58 +04:00
|
|
|
|
2002-05-15 00:03:53 +04:00
|
|
|
/*
|
|
|
|
* Find out if we can use pagemove to build the cluster,
|
|
|
|
* or if we are stuck using malloc/copy. If this is the
|
|
|
|
* first cluster, set the shift flag (see below).
|
|
|
|
*/
|
|
|
|
pmsize = CHUNKSIZE;
|
|
|
|
use_pagemove = 0;
|
|
|
|
if(bpp == sp->bpp) {
|
|
|
|
/* Summary blocks have to get special treatment */
|
|
|
|
pmlastbpp = lookahead_pagemove(bpp + 1, i - 1, &pmsize);
|
|
|
|
if(pmsize >= CHUNKSIZE - fs->lfs_sumsize ||
|
|
|
|
pmlastbpp == NULL) {
|
|
|
|
use_pagemove = 1;
|
|
|
|
cl->flags |= LFS_CL_SHIFT;
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* If we're not using pagemove, we have
|
|
|
|
* to copy the summary down to the bottom
|
|
|
|
* end of the block.
|
|
|
|
*/
|
|
|
|
#ifndef LFS_MALLOC_SUMMARY
|
|
|
|
memcpy((*bpp)->b_data, (*bpp)->b_data +
|
|
|
|
NBPG - fs->lfs_sumsize,
|
|
|
|
fs->lfs_sumsize);
|
|
|
|
#endif /* LFS_MALLOC_SUMMARY */
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
pmlastbpp = lookahead_pagemove(bpp, i, &pmsize);
|
|
|
|
if(pmsize >= CHUNKSIZE || pmlastbpp == NULL) {
|
|
|
|
use_pagemove = 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if(use_pagemove == 0) {
|
|
|
|
cl->flags |= LFS_CL_MALLOC;
|
|
|
|
cl->olddata = cbp->b_data;
|
|
|
|
cbp->b_data = malloc(CHUNKSIZE, M_SEGMENT, M_WAITOK);
|
|
|
|
}
|
|
|
|
#if defined(DEBUG) && defined(DIAGNOSTIC)
|
|
|
|
if(dtosn(fs, dbtofsb(fs, (*bpp)->b_blkno + btodb((*bpp)->b_bcount - 1))) !=
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
dtosn(fs, dbtofsb(fs, cbp->b_blkno))) {
|
2003-01-28 02:17:56 +03:00
|
|
|
printf("block at %" PRId64 " (%" PRIu32 "), "
|
|
|
|
"cbp at %" PRId64 " (%" PRIu32 ")\n",
|
2002-05-15 00:03:53 +04:00
|
|
|
(*bpp)->b_blkno, dtosn(fs, dbtofsb(fs, (*bpp)->b_blkno)),
|
|
|
|
cbp->b_blkno, dtosn(fs, dbtofsb(fs, cbp->b_blkno)));
|
1999-03-26 00:54:10 +03:00
|
|
|
panic("lfs_writeseg: Segment overwrite");
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2002-05-15 00:03:53 +04:00
|
|
|
/*
|
|
|
|
* Construct the cluster.
|
|
|
|
*/
|
|
|
|
while (fs->lfs_iocount >= LFS_THROTTLE) {
|
|
|
|
#ifdef DEBUG_LFS
|
|
|
|
printf("[%d]", fs->lfs_iocount);
|
|
|
|
#endif
|
|
|
|
tsleep(&fs->lfs_iocount, PRIBIO+1, "lfs_throttle", 0);
|
1999-03-10 03:20:00 +03:00
|
|
|
}
|
1994-06-08 15:41:58 +04:00
|
|
|
++fs->lfs_iocount;
|
2002-05-15 00:03:53 +04:00
|
|
|
|
1999-03-10 03:20:00 +03:00
|
|
|
for (p = cbp->b_data; i && cbp->b_bcount < CHUNKSIZE; i--) {
|
1998-03-01 05:20:01 +03:00
|
|
|
bp = *bpp;
|
1999-03-10 03:20:00 +03:00
|
|
|
|
|
|
|
if (bp->b_bcount > (CHUNKSIZE - cbp->b_bcount))
|
1998-03-01 05:20:01 +03:00
|
|
|
break;
|
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/*
|
|
|
|
* Fake buffers from the cleaner are marked as B_INVAL.
|
|
|
|
* We need to copy the data from user space rather than
|
|
|
|
* from the buffer indicated.
|
|
|
|
* XXX == what do I do on an error?
|
|
|
|
*/
|
1999-03-10 03:20:00 +03:00
|
|
|
if ((bp->b_flags & (B_CALL|B_INVAL)) == (B_CALL|B_INVAL)) {
|
1994-06-08 15:41:58 +04:00
|
|
|
if (copyin(bp->b_saveaddr, p, bp->b_bcount))
|
1999-03-10 03:20:00 +03:00
|
|
|
panic("lfs_writeseg: copyin failed [2]");
|
2002-05-15 00:03:53 +04:00
|
|
|
} else if (use_pagemove) {
|
|
|
|
pagemove(bp->b_data, p, bp->b_bcount);
|
|
|
|
cbp->b_bufsize += bp->b_bcount;
|
|
|
|
bp->b_bufsize -= bp->b_bcount;
|
|
|
|
} else {
|
1994-06-08 15:41:58 +04:00
|
|
|
bcopy(bp->b_data, p, bp->b_bcount);
|
2002-05-15 00:03:53 +04:00
|
|
|
/* printf("copy in %p\n", bp->b_data); */
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* XXX If we are *not* shifting, the summary
|
|
|
|
* block is only fs->lfs_sumsize. Otherwise,
|
|
|
|
* it is NBPG but shifted.
|
|
|
|
*/
|
|
|
|
if(bpp == sp->bpp && !(cl->flags & LFS_CL_SHIFT)) {
|
|
|
|
p += fs->lfs_sumsize;
|
|
|
|
cbp->b_bcount += fs->lfs_sumsize;
|
|
|
|
cl->bufsize += fs->lfs_sumsize;
|
1994-06-08 15:41:58 +04:00
|
|
|
} else {
|
2002-05-15 00:03:53 +04:00
|
|
|
p += bp->b_bcount;
|
|
|
|
cbp->b_bcount += bp->b_bcount;
|
|
|
|
cl->bufsize += bp->b_bcount;
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
2002-05-15 00:03:53 +04:00
|
|
|
bp->b_flags &= ~(B_ERROR | B_READ | B_DELWRI | B_DONE);
|
|
|
|
cl->bpp[cl->bufcount++] = bp;
|
|
|
|
vp = bp->b_vp;
|
For synchronous writes, keep separate i/o counters for each write, so
processes don't have to wait for one another to finish (e.g., nfsd seems
to be a little happier now, though I haven't measured the difference).
Synchronous checkpoints, however, must always wait for all i/o to finish.
Take the contents of the callback functions and have them run in thread
context instead (aiodoned thread). lfs_iocount no longer has to be
protected in splbio(), and quite a bit less of the segment construction
loop needs to be in splbio() as well.
If lfs_markv is handed a block that is not the correct size according to
the inode, refuse to process it. (Formerly it was extended to the "correct"
size.) This is possibly more prone to deadlock, but less prone to corruption.
lfs_segclean now outright refuses to clean segments that appear to have live
bytes in them. Again this may be more prone to deadlock but avoids
corruption.
Replace ufsspec_close and ufsfifo_close with LFS equivalents; this means
that no UFS functions need to know about LFS_ITIMES any more. Remove
the reference from ufs/inode.h.
Tested on i386, test-compiled on alpha.
2002-06-16 04:13:15 +04:00
|
|
|
s = splbio();
|
2002-05-15 00:03:53 +04:00
|
|
|
++vp->v_numoutput;
|
For synchronous writes, keep separate i/o counters for each write, so
processes don't have to wait for one another to finish (e.g., nfsd seems
to be a little happier now, though I haven't measured the difference).
Synchronous checkpoints, however, must always wait for all i/o to finish.
Take the contents of the callback functions and have them run in thread
context instead (aiodoned thread). lfs_iocount no longer has to be
protected in splbio(), and quite a bit less of the segment construction
loop needs to be in splbio() as well.
If lfs_markv is handed a block that is not the correct size according to
the inode, refuse to process it. (Formerly it was extended to the "correct"
size.) This is possibly more prone to deadlock, but less prone to corruption.
lfs_segclean now outright refuses to clean segments that appear to have live
bytes in them. Again this may be more prone to deadlock but avoids
corruption.
Replace ufsspec_close and ufsfifo_close with LFS equivalents; this means
that no UFS functions need to know about LFS_ITIMES any more. Remove
the reference from ufs/inode.h.
Tested on i386, test-compiled on alpha.
2002-06-16 04:13:15 +04:00
|
|
|
splx(s);
|
1999-04-12 04:25:13 +04:00
|
|
|
|
2002-05-15 00:03:53 +04:00
|
|
|
/*
|
|
|
|
* Although it cannot be freed for reuse before the
|
|
|
|
* cluster is written to disk, this buffer does not
|
|
|
|
* need to be held busy. Therefore we unbusy it,
|
|
|
|
* while leaving it on the locked list. It will
|
|
|
|
* be freed or requeued by the callback depending
|
|
|
|
* on whether it has had B_DELWRI set again in the
|
|
|
|
* meantime.
|
|
|
|
*
|
|
|
|
* If we are using pagemove, we have to hold the block
|
|
|
|
* busy to prevent its contents from changing before
|
|
|
|
* it hits the disk, and invalidating the checksum.
|
|
|
|
*/
|
|
|
|
bp->b_flags &= ~(B_DELWRI | B_READ | B_ERROR);
|
|
|
|
#ifdef LFS_MNOBUSY
|
|
|
|
if (cl->flags & LFS_CL_MALLOC) {
|
|
|
|
if (!(bp->b_flags & B_CALL))
|
|
|
|
brelse(bp); /* Still B_LOCKED */
|
|
|
|
}
|
|
|
|
#endif
|
1999-04-12 04:25:13 +04:00
|
|
|
bpp++;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If this is the last block for this vnode, but
|
|
|
|
* there are other blocks on its dirty list,
|
|
|
|
* set IN_MODIFIED/IN_CLEANING depending on what
|
|
|
|
* sort of block. Only do this for our mount point,
|
|
|
|
* not for, e.g., inode blocks that are attached to
|
|
|
|
* the devvp.
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
* XXX KS - Shouldn't we set *both* if both types
|
|
|
|
* of blocks are present (traverse the dirty list?)
|
1999-04-12 04:25:13 +04:00
|
|
|
*/
|
For synchronous writes, keep separate i/o counters for each write, so
processes don't have to wait for one another to finish (e.g., nfsd seems
to be a little happier now, though I haven't measured the difference).
Synchronous checkpoints, however, must always wait for all i/o to finish.
Take the contents of the callback functions and have them run in thread
context instead (aiodoned thread). lfs_iocount no longer has to be
protected in splbio(), and quite a bit less of the segment construction
loop needs to be in splbio() as well.
If lfs_markv is handed a block that is not the correct size according to
the inode, refuse to process it. (Formerly it was extended to the "correct"
size.) This is possibly more prone to deadlock, but less prone to corruption.
lfs_segclean now outright refuses to clean segments that appear to have live
bytes in them. Again this may be more prone to deadlock but avoids
corruption.
Replace ufsspec_close and ufsfifo_close with LFS equivalents; this means
that no UFS functions need to know about LFS_ITIMES any more. Remove
the reference from ufs/inode.h.
Tested on i386, test-compiled on alpha.
2002-06-16 04:13:15 +04:00
|
|
|
s = splbio();
|
2001-11-24 00:44:25 +03:00
|
|
|
if ((i == 1 ||
|
2002-05-15 00:03:53 +04:00
|
|
|
(i > 1 && vp && *bpp && (*bpp)->b_vp != vp)) &&
|
2002-05-18 01:42:38 +04:00
|
|
|
(bp = LIST_FIRST(&vp->v_dirtyblkhd)) != NULL &&
|
2002-05-15 00:03:53 +04:00
|
|
|
vp->v_mount == fs->lfs_ivnode->v_mount)
|
|
|
|
{
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
ip = VTOI(vp);
|
1999-04-12 04:25:13 +04:00
|
|
|
#ifdef DEBUG_LFS
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
printf("lfs_writeseg: marking ino %d\n",
|
|
|
|
ip->i_number);
|
1999-04-12 04:25:13 +04:00
|
|
|
#endif
|
2001-11-24 00:44:25 +03:00
|
|
|
if (bp->b_flags & B_CALL)
|
2000-07-06 02:25:43 +04:00
|
|
|
LFS_SET_UINO(ip, IN_CLEANING);
|
|
|
|
else
|
|
|
|
LFS_SET_UINO(ip, IN_MODIFIED);
|
1999-04-12 04:25:13 +04:00
|
|
|
}
|
For synchronous writes, keep separate i/o counters for each write, so
processes don't have to wait for one another to finish (e.g., nfsd seems
to be a little happier now, though I haven't measured the difference).
Synchronous checkpoints, however, must always wait for all i/o to finish.
Take the contents of the callback functions and have them run in thread
context instead (aiodoned thread). lfs_iocount no longer has to be
protected in splbio(), and quite a bit less of the segment construction
loop needs to be in splbio() as well.
If lfs_markv is handed a block that is not the correct size according to
the inode, refuse to process it. (Formerly it was extended to the "correct"
size.) This is possibly more prone to deadlock, but less prone to corruption.
lfs_segclean now outright refuses to clean segments that appear to have live
bytes in them. Again this may be more prone to deadlock but avoids
corruption.
Replace ufsspec_close and ufsfifo_close with LFS equivalents; this means
that no UFS functions need to know about LFS_ITIMES any more. Remove
the reference from ufs/inode.h.
Tested on i386, test-compiled on alpha.
2002-06-16 04:13:15 +04:00
|
|
|
splx(s);
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
wakeup(vp);
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
For synchronous writes, keep separate i/o counters for each write, so
processes don't have to wait for one another to finish (e.g., nfsd seems
to be a little happier now, though I haven't measured the difference).
Synchronous checkpoints, however, must always wait for all i/o to finish.
Take the contents of the callback functions and have them run in thread
context instead (aiodoned thread). lfs_iocount no longer has to be
protected in splbio(), and quite a bit less of the segment construction
loop needs to be in splbio() as well.
If lfs_markv is handed a block that is not the correct size according to
the inode, refuse to process it. (Formerly it was extended to the "correct"
size.) This is possibly more prone to deadlock, but less prone to corruption.
lfs_segclean now outright refuses to clean segments that appear to have live
bytes in them. Again this may be more prone to deadlock but avoids
corruption.
Replace ufsspec_close and ufsfifo_close with LFS equivalents; this means
that no UFS functions need to know about LFS_ITIMES any more. Remove
the reference from ufs/inode.h.
Tested on i386, test-compiled on alpha.
2002-06-16 04:13:15 +04:00
|
|
|
s = splbio();
|
1994-06-08 15:41:58 +04:00
|
|
|
++cbp->b_vp->v_numoutput;
|
|
|
|
splx(s);
|
|
|
|
/*
|
2002-05-15 00:03:53 +04:00
|
|
|
* In order to include the summary in a clustered block,
|
|
|
|
* it may be necessary to shift the block forward (since
|
|
|
|
* summary blocks are in generay smaller than can be
|
|
|
|
* addressed by pagemove(). After the write, the block
|
|
|
|
* will be corrected before disassembly.
|
1994-06-08 15:41:58 +04:00
|
|
|
*/
|
2002-05-15 00:03:53 +04:00
|
|
|
if(cl->flags & LFS_CL_SHIFT) {
|
|
|
|
cbp->b_data += (NBPG - fs->lfs_sumsize);
|
|
|
|
cbp->b_bcount -= (NBPG - fs->lfs_sumsize);
|
|
|
|
}
|
1994-06-08 15:41:58 +04:00
|
|
|
vop_strategy_a.a_desc = VDESC(vop_strategy);
|
|
|
|
vop_strategy_a.a_bp = cbp;
|
|
|
|
(strategy)(&vop_strategy_a);
|
|
|
|
}
|
2002-05-15 00:03:53 +04:00
|
|
|
|
2001-11-24 00:44:25 +03:00
|
|
|
if (lfs_dostats) {
|
1999-03-10 03:20:00 +03:00
|
|
|
++lfs_stats.psegwrites;
|
|
|
|
lfs_stats.blocktot += nblocks - 1;
|
|
|
|
if (fs->lfs_sp->seg_flags & SEGM_SYNC)
|
|
|
|
++lfs_stats.psyncwrites;
|
|
|
|
if (fs->lfs_sp->seg_flags & SEGM_CLEAN) {
|
|
|
|
++lfs_stats.pcleanwrites;
|
|
|
|
lfs_stats.cleanblocks += nblocks - 1;
|
|
|
|
}
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
|
|
|
return (lfs_initseg(fs) || do_again);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
lfs_writesuper(struct lfs *fs, daddr_t daddr)
|
1994-06-08 15:41:58 +04:00
|
|
|
{
|
|
|
|
struct buf *bp;
|
|
|
|
dev_t i_dev;
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
int (*strategy)(void *);
|
1994-06-08 15:41:58 +04:00
|
|
|
int s;
|
|
|
|
struct vop_strategy_args vop_strategy_a;
|
|
|
|
|
1999-03-10 03:20:00 +03:00
|
|
|
/*
|
|
|
|
* If we can write one superblock while another is in
|
|
|
|
* progress, we risk not having a complete checkpoint if we crash.
|
|
|
|
* So, block here if a superblock write is in progress.
|
|
|
|
*/
|
1999-11-17 23:08:30 +03:00
|
|
|
s = splbio();
|
2001-11-24 00:44:25 +03:00
|
|
|
while (fs->lfs_sbactive) {
|
1999-03-10 03:20:00 +03:00
|
|
|
tsleep(&fs->lfs_sbactive, PRIBIO+1, "lfs sb", 0);
|
|
|
|
}
|
|
|
|
fs->lfs_sbactive = daddr;
|
1999-11-17 23:08:30 +03:00
|
|
|
splx(s);
|
1994-06-08 15:41:58 +04:00
|
|
|
i_dev = VTOI(fs->lfs_ivnode)->i_dev;
|
|
|
|
strategy = VTOI(fs->lfs_ivnode)->i_devvp->v_op[VOFFSET(vop_strategy)];
|
|
|
|
|
1999-03-10 03:20:00 +03:00
|
|
|
/* Set timestamp of this version of the superblock */
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
if (fs->lfs_version == 1)
|
|
|
|
fs->lfs_otstamp = time.tv_sec;
|
1999-03-10 03:20:00 +03:00
|
|
|
fs->lfs_tstamp = time.tv_sec;
|
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/* Checksum the superblock and copy it into a buffer. */
|
1998-09-12 01:27:12 +04:00
|
|
|
fs->lfs_cksum = lfs_sb_cksum(&(fs->lfs_dlfs));
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
bp = lfs_newbuf(fs, VTOI(fs->lfs_ivnode)->i_devvp, fsbtodb(fs, daddr), LFS_SBPAD);
|
1998-09-12 01:27:12 +04:00
|
|
|
*(struct dlfs *)bp->b_data = fs->lfs_dlfs;
|
1999-03-10 03:20:00 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
bp->b_dev = i_dev;
|
|
|
|
bp->b_flags |= B_BUSY | B_CALL | B_ASYNC;
|
|
|
|
bp->b_flags &= ~(B_DONE | B_ERROR | B_READ | B_DELWRI);
|
|
|
|
bp->b_iodone = lfs_supercallback;
|
1999-03-10 03:20:00 +03:00
|
|
|
/* XXX KS - same nasty hack as above */
|
|
|
|
bp->b_saveaddr = (caddr_t)fs;
|
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
vop_strategy_a.a_desc = VDESC(vop_strategy);
|
|
|
|
vop_strategy_a.a_bp = bp;
|
|
|
|
s = splbio();
|
|
|
|
++bp->b_vp->v_numoutput;
|
|
|
|
splx(s);
|
For synchronous writes, keep separate i/o counters for each write, so
processes don't have to wait for one another to finish (e.g., nfsd seems
to be a little happier now, though I haven't measured the difference).
Synchronous checkpoints, however, must always wait for all i/o to finish.
Take the contents of the callback functions and have them run in thread
context instead (aiodoned thread). lfs_iocount no longer has to be
protected in splbio(), and quite a bit less of the segment construction
loop needs to be in splbio() as well.
If lfs_markv is handed a block that is not the correct size according to
the inode, refuse to process it. (Formerly it was extended to the "correct"
size.) This is possibly more prone to deadlock, but less prone to corruption.
lfs_segclean now outright refuses to clean segments that appear to have live
bytes in them. Again this may be more prone to deadlock but avoids
corruption.
Replace ufsspec_close and ufsfifo_close with LFS equivalents; this means
that no UFS functions need to know about LFS_ITIMES any more. Remove
the reference from ufs/inode.h.
Tested on i386, test-compiled on alpha.
2002-06-16 04:13:15 +04:00
|
|
|
++fs->lfs_iocount;
|
1994-06-08 15:41:58 +04:00
|
|
|
(strategy)(&vop_strategy_a);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Logical block number match routines used when traversing the dirty block
|
|
|
|
* chain.
|
|
|
|
*/
|
1999-03-10 03:20:00 +03:00
|
|
|
int
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
lfs_match_fake(struct lfs *fs, struct buf *bp)
|
1999-03-10 03:20:00 +03:00
|
|
|
{
|
1999-03-26 01:26:52 +03:00
|
|
|
return (bp->b_flags & B_CALL);
|
1999-03-10 03:20:00 +03:00
|
|
|
}
|
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
int
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
lfs_match_data(struct lfs *fs, struct buf *bp)
|
1994-06-08 15:41:58 +04:00
|
|
|
{
|
|
|
|
return (bp->b_lblkno >= 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
lfs_match_indir(struct lfs *fs, struct buf *bp)
|
1994-06-08 15:41:58 +04:00
|
|
|
{
|
2003-01-25 00:55:02 +03:00
|
|
|
daddr_t lbn;
|
1994-06-08 15:41:58 +04:00
|
|
|
|
|
|
|
lbn = bp->b_lblkno;
|
|
|
|
return (lbn < 0 && (-lbn - NDADDR) % NINDIR(fs) == 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
lfs_match_dindir(struct lfs *fs, struct buf *bp)
|
1994-06-08 15:41:58 +04:00
|
|
|
{
|
2003-01-25 00:55:02 +03:00
|
|
|
daddr_t lbn;
|
1994-06-08 15:41:58 +04:00
|
|
|
|
|
|
|
lbn = bp->b_lblkno;
|
|
|
|
return (lbn < 0 && (-lbn - NDADDR) % NINDIR(fs) == 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
lfs_match_tindir(struct lfs *fs, struct buf *bp)
|
1994-06-08 15:41:58 +04:00
|
|
|
{
|
2003-01-25 00:55:02 +03:00
|
|
|
daddr_t lbn;
|
1994-06-08 15:41:58 +04:00
|
|
|
|
|
|
|
lbn = bp->b_lblkno;
|
|
|
|
return (lbn < 0 && (-lbn - NDADDR) % NINDIR(fs) == 2);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
1999-03-10 03:20:00 +03:00
|
|
|
* XXX - The only buffers that are going to hit these functions are the
|
|
|
|
* segment write blocks, or the segment summaries, or the superblocks.
|
|
|
|
*
|
|
|
|
* All of the above are created by lfs_newbuf, and so do not need to be
|
|
|
|
* released via brelse.
|
1994-06-08 15:41:58 +04:00
|
|
|
*/
|
|
|
|
void
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
lfs_callback(struct buf *bp)
|
1994-06-08 15:41:58 +04:00
|
|
|
{
|
2002-05-15 00:03:53 +04:00
|
|
|
/* struct lfs *fs; */
|
|
|
|
/* fs = (struct lfs *)bp->b_saveaddr; */
|
1999-03-10 03:20:00 +03:00
|
|
|
lfs_freebuf(bp);
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
|
|
|
|
For synchronous writes, keep separate i/o counters for each write, so
processes don't have to wait for one another to finish (e.g., nfsd seems
to be a little happier now, though I haven't measured the difference).
Synchronous checkpoints, however, must always wait for all i/o to finish.
Take the contents of the callback functions and have them run in thread
context instead (aiodoned thread). lfs_iocount no longer has to be
protected in splbio(), and quite a bit less of the segment construction
loop needs to be in splbio() as well.
If lfs_markv is handed a block that is not the correct size according to
the inode, refuse to process it. (Formerly it was extended to the "correct"
size.) This is possibly more prone to deadlock, but less prone to corruption.
lfs_segclean now outright refuses to clean segments that appear to have live
bytes in them. Again this may be more prone to deadlock but avoids
corruption.
Replace ufsspec_close and ufsfifo_close with LFS equivalents; this means
that no UFS functions need to know about LFS_ITIMES any more. Remove
the reference from ufs/inode.h.
Tested on i386, test-compiled on alpha.
2002-06-16 04:13:15 +04:00
|
|
|
static void
|
|
|
|
lfs_super_aiodone(struct buf *bp)
|
1994-06-08 15:41:58 +04:00
|
|
|
{
|
1999-03-10 03:20:00 +03:00
|
|
|
struct lfs *fs;
|
|
|
|
|
|
|
|
fs = (struct lfs *)bp->b_saveaddr;
|
2000-05-19 08:34:39 +04:00
|
|
|
fs->lfs_sbactive = 0;
|
1999-03-10 03:20:00 +03:00
|
|
|
wakeup(&fs->lfs_sbactive);
|
2000-06-28 00:57:11 +04:00
|
|
|
if (--fs->lfs_iocount < LFS_THROTTLE)
|
|
|
|
wakeup(&fs->lfs_iocount);
|
1999-03-10 03:20:00 +03:00
|
|
|
lfs_freebuf(bp);
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
|
|
|
|
2002-05-15 00:03:53 +04:00
|
|
|
static void
|
For synchronous writes, keep separate i/o counters for each write, so
processes don't have to wait for one another to finish (e.g., nfsd seems
to be a little happier now, though I haven't measured the difference).
Synchronous checkpoints, however, must always wait for all i/o to finish.
Take the contents of the callback functions and have them run in thread
context instead (aiodoned thread). lfs_iocount no longer has to be
protected in splbio(), and quite a bit less of the segment construction
loop needs to be in splbio() as well.
If lfs_markv is handed a block that is not the correct size according to
the inode, refuse to process it. (Formerly it was extended to the "correct"
size.) This is possibly more prone to deadlock, but less prone to corruption.
lfs_segclean now outright refuses to clean segments that appear to have live
bytes in them. Again this may be more prone to deadlock but avoids
corruption.
Replace ufsspec_close and ufsfifo_close with LFS equivalents; this means
that no UFS functions need to know about LFS_ITIMES any more. Remove
the reference from ufs/inode.h.
Tested on i386, test-compiled on alpha.
2002-06-16 04:13:15 +04:00
|
|
|
lfs_cluster_aiodone(struct buf *bp)
|
2002-05-15 00:03:53 +04:00
|
|
|
{
|
|
|
|
struct lfs_cluster *cl;
|
|
|
|
struct lfs *fs;
|
|
|
|
struct buf *tbp;
|
|
|
|
struct vnode *vp;
|
For synchronous writes, keep separate i/o counters for each write, so
processes don't have to wait for one another to finish (e.g., nfsd seems
to be a little happier now, though I haven't measured the difference).
Synchronous checkpoints, however, must always wait for all i/o to finish.
Take the contents of the callback functions and have them run in thread
context instead (aiodoned thread). lfs_iocount no longer has to be
protected in splbio(), and quite a bit less of the segment construction
loop needs to be in splbio() as well.
If lfs_markv is handed a block that is not the correct size according to
the inode, refuse to process it. (Formerly it was extended to the "correct"
size.) This is possibly more prone to deadlock, but less prone to corruption.
lfs_segclean now outright refuses to clean segments that appear to have live
bytes in them. Again this may be more prone to deadlock but avoids
corruption.
Replace ufsspec_close and ufsfifo_close with LFS equivalents; this means
that no UFS functions need to know about LFS_ITIMES any more. Remove
the reference from ufs/inode.h.
Tested on i386, test-compiled on alpha.
2002-06-16 04:13:15 +04:00
|
|
|
int s, error=0;
|
2002-05-15 00:03:53 +04:00
|
|
|
char *cp;
|
|
|
|
extern int locked_queue_count;
|
|
|
|
extern long locked_queue_bytes;
|
|
|
|
|
|
|
|
if(bp->b_flags & B_ERROR)
|
|
|
|
error = bp->b_error;
|
|
|
|
|
|
|
|
cl = (struct lfs_cluster *)bp->b_saveaddr;
|
|
|
|
fs = cl->fs;
|
|
|
|
bp->b_saveaddr = cl->saveaddr;
|
|
|
|
|
|
|
|
/* If shifted, shift back now */
|
|
|
|
if(cl->flags & LFS_CL_SHIFT) {
|
|
|
|
bp->b_data -= (NBPG - fs->lfs_sumsize);
|
|
|
|
bp->b_bcount += (NBPG - fs->lfs_sumsize);
|
|
|
|
}
|
|
|
|
|
|
|
|
cp = (char *)bp->b_data + cl->bufsize;
|
|
|
|
/* Put the pages back, and release the buffer */
|
|
|
|
while(cl->bufcount--) {
|
|
|
|
tbp = cl->bpp[cl->bufcount];
|
|
|
|
if(!(cl->flags & LFS_CL_MALLOC)) {
|
|
|
|
cp -= tbp->b_bcount;
|
|
|
|
printf("pm(%p,%p,%lx)",cp,tbp->b_data,tbp->b_bcount);
|
|
|
|
pagemove(cp, tbp->b_data, tbp->b_bcount);
|
|
|
|
bp->b_bufsize -= tbp->b_bcount;
|
|
|
|
tbp->b_bufsize += tbp->b_bcount;
|
|
|
|
}
|
|
|
|
if(error) {
|
|
|
|
tbp->b_flags |= B_ERROR;
|
|
|
|
tbp->b_error = error;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We're done with tbp. If it has not been re-dirtied since
|
|
|
|
* the cluster was written, free it. Otherwise, keep it on
|
|
|
|
* the locked list to be written again.
|
|
|
|
*/
|
|
|
|
if ((tbp->b_flags & (B_LOCKED | B_DELWRI)) == B_LOCKED)
|
|
|
|
LFS_UNLOCK_BUF(tbp);
|
|
|
|
tbp->b_flags &= ~B_GATHERED;
|
|
|
|
|
|
|
|
LFS_BCLEAN_LOG(fs, tbp);
|
|
|
|
|
|
|
|
vp = tbp->b_vp;
|
|
|
|
/* Segment summary for a shifted cluster */
|
|
|
|
if(!cl->bufcount && (cl->flags & LFS_CL_SHIFT))
|
|
|
|
tbp->b_flags |= B_INVAL;
|
|
|
|
if(!(tbp->b_flags & B_CALL)) {
|
|
|
|
bremfree(tbp);
|
For synchronous writes, keep separate i/o counters for each write, so
processes don't have to wait for one another to finish (e.g., nfsd seems
to be a little happier now, though I haven't measured the difference).
Synchronous checkpoints, however, must always wait for all i/o to finish.
Take the contents of the callback functions and have them run in thread
context instead (aiodoned thread). lfs_iocount no longer has to be
protected in splbio(), and quite a bit less of the segment construction
loop needs to be in splbio() as well.
If lfs_markv is handed a block that is not the correct size according to
the inode, refuse to process it. (Formerly it was extended to the "correct"
size.) This is possibly more prone to deadlock, but less prone to corruption.
lfs_segclean now outright refuses to clean segments that appear to have live
bytes in them. Again this may be more prone to deadlock but avoids
corruption.
Replace ufsspec_close and ufsfifo_close with LFS equivalents; this means
that no UFS functions need to know about LFS_ITIMES any more. Remove
the reference from ufs/inode.h.
Tested on i386, test-compiled on alpha.
2002-06-16 04:13:15 +04:00
|
|
|
s = splbio();
|
2002-05-15 00:03:53 +04:00
|
|
|
if(vp)
|
|
|
|
reassignbuf(tbp, vp);
|
For synchronous writes, keep separate i/o counters for each write, so
processes don't have to wait for one another to finish (e.g., nfsd seems
to be a little happier now, though I haven't measured the difference).
Synchronous checkpoints, however, must always wait for all i/o to finish.
Take the contents of the callback functions and have them run in thread
context instead (aiodoned thread). lfs_iocount no longer has to be
protected in splbio(), and quite a bit less of the segment construction
loop needs to be in splbio() as well.
If lfs_markv is handed a block that is not the correct size according to
the inode, refuse to process it. (Formerly it was extended to the "correct"
size.) This is possibly more prone to deadlock, but less prone to corruption.
lfs_segclean now outright refuses to clean segments that appear to have live
bytes in them. Again this may be more prone to deadlock but avoids
corruption.
Replace ufsspec_close and ufsfifo_close with LFS equivalents; this means
that no UFS functions need to know about LFS_ITIMES any more. Remove
the reference from ufs/inode.h.
Tested on i386, test-compiled on alpha.
2002-06-16 04:13:15 +04:00
|
|
|
splx(s);
|
2002-05-15 00:03:53 +04:00
|
|
|
tbp->b_flags |= B_ASYNC; /* for biodone */
|
|
|
|
}
|
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
if (tbp->b_flags & B_DONE) {
|
|
|
|
printf("blk %d biodone already (flags %lx)\n",
|
|
|
|
cl->bufcount, (long)tbp->b_flags);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
if (tbp->b_flags & (B_BUSY | B_CALL)) {
|
|
|
|
biodone(tbp);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Fix up the cluster buffer, and release it */
|
|
|
|
if(!(cl->flags & LFS_CL_MALLOC) && bp->b_bufsize) {
|
|
|
|
printf("PM(%p,%p,%lx)", (char *)bp->b_data + bp->b_bcount,
|
|
|
|
(char *)bp->b_data, bp->b_bufsize);
|
|
|
|
pagemove((char *)bp->b_data + bp->b_bcount,
|
|
|
|
(char *)bp->b_data, bp->b_bufsize);
|
|
|
|
}
|
|
|
|
if(cl->flags & LFS_CL_MALLOC) {
|
|
|
|
free(bp->b_data, M_SEGMENT);
|
|
|
|
bp->b_data = cl->olddata;
|
|
|
|
}
|
|
|
|
bp->b_bcount = 0;
|
|
|
|
bp->b_iodone = NULL;
|
|
|
|
bp->b_flags &= ~B_DELWRI;
|
|
|
|
bp->b_flags |= B_DONE;
|
For synchronous writes, keep separate i/o counters for each write, so
processes don't have to wait for one another to finish (e.g., nfsd seems
to be a little happier now, though I haven't measured the difference).
Synchronous checkpoints, however, must always wait for all i/o to finish.
Take the contents of the callback functions and have them run in thread
context instead (aiodoned thread). lfs_iocount no longer has to be
protected in splbio(), and quite a bit less of the segment construction
loop needs to be in splbio() as well.
If lfs_markv is handed a block that is not the correct size according to
the inode, refuse to process it. (Formerly it was extended to the "correct"
size.) This is possibly more prone to deadlock, but less prone to corruption.
lfs_segclean now outright refuses to clean segments that appear to have live
bytes in them. Again this may be more prone to deadlock but avoids
corruption.
Replace ufsspec_close and ufsfifo_close with LFS equivalents; this means
that no UFS functions need to know about LFS_ITIMES any more. Remove
the reference from ufs/inode.h.
Tested on i386, test-compiled on alpha.
2002-06-16 04:13:15 +04:00
|
|
|
s = splbio();
|
2002-05-15 00:03:53 +04:00
|
|
|
reassignbuf(bp, bp->b_vp);
|
For synchronous writes, keep separate i/o counters for each write, so
processes don't have to wait for one another to finish (e.g., nfsd seems
to be a little happier now, though I haven't measured the difference).
Synchronous checkpoints, however, must always wait for all i/o to finish.
Take the contents of the callback functions and have them run in thread
context instead (aiodoned thread). lfs_iocount no longer has to be
protected in splbio(), and quite a bit less of the segment construction
loop needs to be in splbio() as well.
If lfs_markv is handed a block that is not the correct size according to
the inode, refuse to process it. (Formerly it was extended to the "correct"
size.) This is possibly more prone to deadlock, but less prone to corruption.
lfs_segclean now outright refuses to clean segments that appear to have live
bytes in them. Again this may be more prone to deadlock but avoids
corruption.
Replace ufsspec_close and ufsfifo_close with LFS equivalents; this means
that no UFS functions need to know about LFS_ITIMES any more. Remove
the reference from ufs/inode.h.
Tested on i386, test-compiled on alpha.
2002-06-16 04:13:15 +04:00
|
|
|
splx(s);
|
2002-05-15 00:03:53 +04:00
|
|
|
brelse(bp);
|
|
|
|
|
For synchronous writes, keep separate i/o counters for each write, so
processes don't have to wait for one another to finish (e.g., nfsd seems
to be a little happier now, though I haven't measured the difference).
Synchronous checkpoints, however, must always wait for all i/o to finish.
Take the contents of the callback functions and have them run in thread
context instead (aiodoned thread). lfs_iocount no longer has to be
protected in splbio(), and quite a bit less of the segment construction
loop needs to be in splbio() as well.
If lfs_markv is handed a block that is not the correct size according to
the inode, refuse to process it. (Formerly it was extended to the "correct"
size.) This is possibly more prone to deadlock, but less prone to corruption.
lfs_segclean now outright refuses to clean segments that appear to have live
bytes in them. Again this may be more prone to deadlock but avoids
corruption.
Replace ufsspec_close and ufsfifo_close with LFS equivalents; this means
that no UFS functions need to know about LFS_ITIMES any more. Remove
the reference from ufs/inode.h.
Tested on i386, test-compiled on alpha.
2002-06-16 04:13:15 +04:00
|
|
|
/* Note i/o done */
|
|
|
|
if (cl->flags & LFS_CL_SYNC) {
|
|
|
|
if (--cl->seg->seg_iocount == 0)
|
|
|
|
wakeup(&cl->seg->seg_iocount);
|
|
|
|
/* printf("- %x => %d\n", cl->seg, cl->seg->seg_iocount); */
|
|
|
|
}
|
2002-05-15 00:03:53 +04:00
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
if (fs->lfs_iocount == 0)
|
2002-09-27 19:35:29 +04:00
|
|
|
panic("lfs_cluster_aiodone: zero iocount");
|
2002-05-15 00:03:53 +04:00
|
|
|
#endif
|
|
|
|
if (--fs->lfs_iocount < LFS_THROTTLE)
|
|
|
|
wakeup(&fs->lfs_iocount);
|
|
|
|
#if 0
|
|
|
|
if (fs->lfs_iocount == 0) {
|
|
|
|
/*
|
|
|
|
* Vinvalbuf can move locked buffers off the locked queue
|
|
|
|
* and we have no way of knowing about this. So, after
|
|
|
|
* doing a big write, we recalculate how many buffers are
|
|
|
|
* really still left on the locked queue.
|
|
|
|
*/
|
|
|
|
lfs_countlocked(&locked_queue_count, &locked_queue_bytes, "lfs_cluster_callback");
|
|
|
|
wakeup(&locked_queue_count);
|
|
|
|
}
|
|
|
|
#endif
|
For synchronous writes, keep separate i/o counters for each write, so
processes don't have to wait for one another to finish (e.g., nfsd seems
to be a little happier now, though I haven't measured the difference).
Synchronous checkpoints, however, must always wait for all i/o to finish.
Take the contents of the callback functions and have them run in thread
context instead (aiodoned thread). lfs_iocount no longer has to be
protected in splbio(), and quite a bit less of the segment construction
loop needs to be in splbio() as well.
If lfs_markv is handed a block that is not the correct size according to
the inode, refuse to process it. (Formerly it was extended to the "correct"
size.) This is possibly more prone to deadlock, but less prone to corruption.
lfs_segclean now outright refuses to clean segments that appear to have live
bytes in them. Again this may be more prone to deadlock but avoids
corruption.
Replace ufsspec_close and ufsfifo_close with LFS equivalents; this means
that no UFS functions need to know about LFS_ITIMES any more. Remove
the reference from ufs/inode.h.
Tested on i386, test-compiled on alpha.
2002-06-16 04:13:15 +04:00
|
|
|
|
|
|
|
free(cl->bpp, M_SEGMENT);
|
|
|
|
free(cl, M_SEGMENT);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
lfs_generic_callback(struct buf *bp, void (*aiodone)(struct buf *))
|
|
|
|
{
|
|
|
|
/* reset b_iodone for when this is a single-buf i/o. */
|
|
|
|
bp->b_iodone = aiodone;
|
|
|
|
|
|
|
|
simple_lock(&uvm.aiodoned_lock); /* locks uvm.aio_done */
|
|
|
|
TAILQ_INSERT_TAIL(&uvm.aio_done, bp, b_freelist);
|
|
|
|
wakeup(&uvm.aiodoned);
|
|
|
|
simple_unlock(&uvm.aiodoned_lock);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
lfs_cluster_callback(struct buf *bp)
|
|
|
|
{
|
|
|
|
lfs_generic_callback(bp, lfs_cluster_aiodone);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
lfs_supercallback(struct buf *bp)
|
|
|
|
{
|
|
|
|
lfs_generic_callback(bp, lfs_super_aiodone);
|
2002-05-15 00:03:53 +04:00
|
|
|
}
|
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/*
|
|
|
|
* Shellsort (diminishing increment sort) from Data Structures and
|
|
|
|
* Algorithms, Aho, Hopcraft and Ullman, 1983 Edition, page 290;
|
|
|
|
* see also Knuth Vol. 3, page 84. The increments are selected from
|
|
|
|
* formula (8), page 95. Roughly O(N^3/2).
|
|
|
|
*/
|
|
|
|
/*
|
|
|
|
* This is our own private copy of shellsort because we want to sort
|
|
|
|
* two parallel arrays (the array of buffer pointers and the array of
|
|
|
|
* logical block numbers) simultaneously. Note that we cast the array
|
|
|
|
* of logical block numbers to a unsigned in this routine so that the
|
|
|
|
* negative block numbers (meta data blocks) sort AFTER the data blocks.
|
|
|
|
*/
|
1999-03-10 03:20:00 +03:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
void
|
2003-01-25 00:55:02 +03:00
|
|
|
lfs_shellsort(struct buf **bp_array, int32_t *lb_array, int nmemb)
|
1994-06-08 15:41:58 +04:00
|
|
|
{
|
|
|
|
static int __rsshell_increments[] = { 4, 1, 0 };
|
2000-03-30 16:41:09 +04:00
|
|
|
int incr, *incrp, t1, t2;
|
1994-06-08 15:41:58 +04:00
|
|
|
struct buf *bp_temp;
|
|
|
|
u_long lb_temp;
|
|
|
|
|
1996-02-10 01:28:45 +03:00
|
|
|
for (incrp = __rsshell_increments; (incr = *incrp++) != 0;)
|
1994-06-08 15:41:58 +04:00
|
|
|
for (t1 = incr; t1 < nmemb; ++t1)
|
|
|
|
for (t2 = t1 - incr; t2 >= 0;)
|
|
|
|
if (lb_array[t2] > lb_array[t2 + incr]) {
|
|
|
|
lb_temp = lb_array[t2];
|
|
|
|
lb_array[t2] = lb_array[t2 + incr];
|
|
|
|
lb_array[t2 + incr] = lb_temp;
|
|
|
|
bp_temp = bp_array[t2];
|
|
|
|
bp_array[t2] = bp_array[t2 + incr];
|
|
|
|
bp_array[t2 + incr] = bp_temp;
|
|
|
|
t2 -= incr;
|
|
|
|
} else
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Check VXLOCK. Return 1 if the vnode is locked. Otherwise, vget it.
|
|
|
|
*/
|
1996-02-10 01:28:45 +03:00
|
|
|
int
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
lfs_vref(struct vnode *vp)
|
1994-06-08 15:41:58 +04:00
|
|
|
{
|
1999-03-10 03:20:00 +03:00
|
|
|
/*
|
|
|
|
* If we return 1 here during a flush, we risk vinvalbuf() not
|
|
|
|
* being able to flush all of the pages from this vnode, which
|
|
|
|
* will cause it to panic. So, return 0 if a flush is in progress.
|
|
|
|
*/
|
|
|
|
if (vp->v_flag & VXLOCK) {
|
2001-11-24 00:44:25 +03:00
|
|
|
if (IS_FLUSHING(VTOI(vp)->i_lfs,vp)) {
|
1999-03-10 03:20:00 +03:00
|
|
|
return 0;
|
|
|
|
}
|
2001-11-24 00:44:25 +03:00
|
|
|
return (1);
|
1999-03-10 03:20:00 +03:00
|
|
|
}
|
1994-06-08 15:41:58 +04:00
|
|
|
return (vget(vp, 0));
|
|
|
|
}
|
|
|
|
|
1998-03-01 05:20:01 +03:00
|
|
|
/*
|
|
|
|
* This is vrele except that we do not want to VOP_INACTIVE this vnode. We
|
|
|
|
* inline vrele here to avoid the vn_lock and VOP_INACTIVE call at the end.
|
|
|
|
*/
|
1994-06-08 15:41:58 +04:00
|
|
|
void
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
lfs_vunref(struct vnode *vp)
|
1994-06-08 15:41:58 +04:00
|
|
|
{
|
1999-03-26 00:54:10 +03:00
|
|
|
/*
|
|
|
|
* Analogous to lfs_vref, if the node is flushing, fake it.
|
|
|
|
*/
|
2001-11-24 00:44:25 +03:00
|
|
|
if ((vp->v_flag & VXLOCK) && IS_FLUSHING(VTOI(vp)->i_lfs,vp)) {
|
1999-03-26 00:54:10 +03:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
1998-03-01 05:20:01 +03:00
|
|
|
simple_lock(&vp->v_interlock);
|
1999-03-10 03:20:00 +03:00
|
|
|
#ifdef DIAGNOSTIC
|
2001-11-24 00:44:25 +03:00
|
|
|
if (vp->v_usecount <= 0) {
|
2000-06-28 00:57:11 +04:00
|
|
|
printf("lfs_vunref: inum is %d\n", VTOI(vp)->i_number);
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
printf("lfs_vunref: flags are 0x%lx\n", (u_long)vp->v_flag);
|
|
|
|
printf("lfs_vunref: usecount = %ld\n", (long)vp->v_usecount);
|
1999-03-10 03:20:00 +03:00
|
|
|
panic("lfs_vunref: v_usecount<0");
|
|
|
|
}
|
|
|
|
#endif
|
1998-03-01 05:20:01 +03:00
|
|
|
vp->v_usecount--;
|
|
|
|
if (vp->v_usecount > 0) {
|
|
|
|
simple_unlock(&vp->v_interlock);
|
|
|
|
return;
|
|
|
|
}
|
1994-06-08 15:41:58 +04:00
|
|
|
/*
|
1998-03-01 05:20:01 +03:00
|
|
|
* insert at tail of LRU list
|
1994-06-08 15:41:58 +04:00
|
|
|
*/
|
1998-03-01 05:20:01 +03:00
|
|
|
simple_lock(&vnode_free_list_slock);
|
2000-01-19 03:03:04 +03:00
|
|
|
if (vp->v_holdcnt > 0)
|
|
|
|
TAILQ_INSERT_TAIL(&vnode_hold_list, vp, v_freelist);
|
|
|
|
else
|
|
|
|
TAILQ_INSERT_TAIL(&vnode_free_list, vp, v_freelist);
|
1998-03-01 05:20:01 +03:00
|
|
|
simple_unlock(&vnode_free_list_slock);
|
|
|
|
simple_unlock(&vp->v_interlock);
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
1999-03-10 03:20:00 +03:00
|
|
|
|
|
|
|
/*
|
|
|
|
* We use this when we have vnodes that were loaded in solely for cleaning.
|
|
|
|
* There is no reason to believe that these vnodes will be referenced again
|
|
|
|
* soon, since the cleaning process is unrelated to normal filesystem
|
|
|
|
* activity. Putting cleaned vnodes at the tail of the list has the effect
|
|
|
|
* of flushing the vnode LRU. So, put vnodes that were loaded only for
|
|
|
|
* cleaning at the head of the list, instead.
|
|
|
|
*/
|
|
|
|
void
|
Merge the short-lived perseant-lfsv2 branch into the trunk.
Kernels and tools understand both v1 and v2 filesystems; newfs_lfs
generates v2 by default. Changes for the v2 layout include:
- Segments of non-PO2 size and arbitrary block offset, so these can be
matched to convenient physical characteristics of the partition (e.g.,
stripe or track size and offset).
- Address by fragment instead of by disk sector, paving the way for
non-512-byte-sector devices. In theory fragments can be as large
as you like, though in reality they must be smaller than MAXBSIZE in size.
- Use serial number and filesystem identifier to ensure that roll-forward
doesn't get old data and think it's new. Roll-forward is enabled for
v2 filesystems, though not for v1 filesystems by default.
- The inode free list is now a tailq, paving the way for undelete (undelete
is not yet implemented, but can be without further non-backwards-compatible
changes to disk structures).
- Inode atime information is kept in the Ifile, instead of on the inode;
that is, the inode is never written *just* because atime was changed.
Because of this the inodes remain near the file data on the disk, rather
than wandering all over as the disk is read repeatedly. This speeds up
repeated reads by a small but noticeable amount.
Other changes of note include:
- The ifile written by newfs_lfs can now be of arbitrary length, it is no
longer restricted to a single indirect block.
- Fixed an old bug where ctime was changed every time a vnode was created.
I need to look more closely to make sure that the times are only updated
during write(2) and friends, not after-the-fact during a segment write,
and certainly not by the cleaner.
2001-07-14 00:30:18 +04:00
|
|
|
lfs_vunref_head(struct vnode *vp)
|
1999-03-10 03:20:00 +03:00
|
|
|
{
|
|
|
|
simple_lock(&vp->v_interlock);
|
|
|
|
#ifdef DIAGNOSTIC
|
2001-11-24 00:44:25 +03:00
|
|
|
if (vp->v_usecount == 0) {
|
1999-03-10 03:20:00 +03:00
|
|
|
panic("lfs_vunref: v_usecount<0");
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
vp->v_usecount--;
|
|
|
|
if (vp->v_usecount > 0) {
|
|
|
|
simple_unlock(&vp->v_interlock);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* insert at head of LRU list
|
|
|
|
*/
|
|
|
|
simple_lock(&vnode_free_list_slock);
|
2002-05-24 03:05:25 +04:00
|
|
|
if (vp->v_holdcnt > 0)
|
|
|
|
TAILQ_INSERT_TAIL(&vnode_hold_list, vp, v_freelist);
|
|
|
|
else
|
|
|
|
TAILQ_INSERT_HEAD(&vnode_free_list, vp, v_freelist);
|
1999-03-10 03:20:00 +03:00
|
|
|
simple_unlock(&vnode_free_list_slock);
|
|
|
|
simple_unlock(&vp->v_interlock);
|
|
|
|
}
|
|
|
|
|