2005-05-30 01:25:24 +04:00
|
|
|
/* $NetBSD: ext2fs_vfsops.c,v 1.85 2005/05/29 21:25:24 christos Exp $ */
|
1997-06-11 13:33:37 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Copyright (c) 1989, 1991, 1993, 1994
|
|
|
|
* 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
|
1998-09-13 19:14:40 +04:00
|
|
|
* notice, this list of conditions and the following disclaimer.
|
1997-06-11 13:33:37 +04:00
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
1998-09-13 19:14:40 +04:00
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
2003-08-07 20:26:28 +04:00
|
|
|
* 3. 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.
|
|
|
|
*
|
|
|
|
* @(#)ffs_vfsops.c 8.14 (Berkeley) 11/28/94
|
|
|
|
* Modified for ext2fs by Manuel Bouyer.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Copyright (c) 1997 Manuel Bouyer.
|
|
|
|
*
|
|
|
|
* 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.
|
1997-06-11 13:33:37 +04:00
|
|
|
* 3. All advertising materials mentioning features or use of this software
|
1998-09-13 19:14:40 +04:00
|
|
|
* must display the following acknowledgement:
|
2003-10-05 21:48:49 +04:00
|
|
|
* This product includes software developed by Manuel Bouyer.
|
|
|
|
* 4. The name of the author may not be used to endorse or promote products
|
|
|
|
* derived from this software without specific prior written permission.
|
1997-06-11 13:33:37 +04:00
|
|
|
*
|
2004-03-22 22:23:08 +03:00
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
|
|
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|
|
|
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
1997-06-11 13:33:37 +04:00
|
|
|
*
|
|
|
|
* @(#)ffs_vfsops.c 8.14 (Berkeley) 11/28/94
|
|
|
|
* Modified for ext2fs by Manuel Bouyer.
|
|
|
|
*/
|
|
|
|
|
2001-11-08 05:39:06 +03:00
|
|
|
#include <sys/cdefs.h>
|
2005-05-30 01:25:24 +04:00
|
|
|
__KERNEL_RCSID(0, "$NetBSD: ext2fs_vfsops.c,v 1.85 2005/05/29 21:25:24 christos Exp $");
|
2001-11-08 05:39:06 +03:00
|
|
|
|
2001-05-30 15:57:16 +04:00
|
|
|
#if defined(_KERNEL_OPT)
|
1998-07-05 12:49:30 +04:00
|
|
|
#include "opt_compat_netbsd.h"
|
|
|
|
#endif
|
|
|
|
|
1997-06-11 13:33:37 +04:00
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/systm.h>
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
#include <sys/sysctl.h>
|
1997-06-11 13:33:37 +04:00
|
|
|
#include <sys/namei.h>
|
|
|
|
#include <sys/proc.h>
|
|
|
|
#include <sys/kernel.h>
|
|
|
|
#include <sys/vnode.h>
|
|
|
|
#include <sys/socket.h>
|
|
|
|
#include <sys/mount.h>
|
|
|
|
#include <sys/buf.h>
|
|
|
|
#include <sys/device.h>
|
|
|
|
#include <sys/mbuf.h>
|
|
|
|
#include <sys/file.h>
|
|
|
|
#include <sys/disklabel.h>
|
|
|
|
#include <sys/ioctl.h>
|
|
|
|
#include <sys/errno.h>
|
|
|
|
#include <sys/malloc.h>
|
1998-09-01 07:20:46 +04:00
|
|
|
#include <sys/pool.h>
|
1997-07-17 20:56:44 +04:00
|
|
|
#include <sys/lock.h>
|
2002-09-06 17:18:43 +04:00
|
|
|
#include <sys/conf.h>
|
1997-06-11 13:33:37 +04:00
|
|
|
|
|
|
|
#include <miscfs/specfs/specdev.h>
|
|
|
|
|
|
|
|
#include <ufs/ufs/quota.h>
|
|
|
|
#include <ufs/ufs/ufsmount.h>
|
|
|
|
#include <ufs/ufs/inode.h>
|
|
|
|
#include <ufs/ufs/dir.h>
|
|
|
|
#include <ufs/ufs/ufs_extern.h>
|
|
|
|
|
|
|
|
#include <ufs/ext2fs/ext2fs.h>
|
|
|
|
#include <ufs/ext2fs/ext2fs_extern.h>
|
|
|
|
|
1997-07-17 20:56:44 +04:00
|
|
|
extern struct lock ufs_hashlock;
|
|
|
|
|
1997-06-11 13:33:37 +04:00
|
|
|
int ext2fs_sbupdate __P((struct ufsmount *, int));
|
2000-01-26 19:21:31 +03:00
|
|
|
static int ext2fs_checksb __P((struct ext2fs *, int));
|
1997-06-11 13:33:37 +04:00
|
|
|
|
2001-01-22 15:17:35 +03:00
|
|
|
extern const struct vnodeopv_desc ext2fs_vnodeop_opv_desc;
|
|
|
|
extern const struct vnodeopv_desc ext2fs_specop_opv_desc;
|
|
|
|
extern const struct vnodeopv_desc ext2fs_fifoop_opv_desc;
|
1998-02-18 10:05:47 +03:00
|
|
|
|
2001-01-22 15:17:35 +03:00
|
|
|
const struct vnodeopv_desc * const ext2fs_vnodeopv_descs[] = {
|
1998-02-18 10:05:47 +03:00
|
|
|
&ext2fs_vnodeop_opv_desc,
|
|
|
|
&ext2fs_specop_opv_desc,
|
|
|
|
&ext2fs_fifoop_opv_desc,
|
|
|
|
NULL,
|
|
|
|
};
|
|
|
|
|
1997-06-11 13:33:37 +04:00
|
|
|
struct vfsops ext2fs_vfsops = {
|
|
|
|
MOUNT_EXT2FS,
|
|
|
|
ext2fs_mount,
|
|
|
|
ufs_start,
|
|
|
|
ext2fs_unmount,
|
|
|
|
ufs_root,
|
|
|
|
ufs_quotactl,
|
2004-04-21 05:05:31 +04:00
|
|
|
ext2fs_statvfs,
|
1997-06-11 13:33:37 +04:00
|
|
|
ext2fs_sync,
|
|
|
|
ext2fs_vget,
|
|
|
|
ext2fs_fhtovp,
|
|
|
|
ext2fs_vptofh,
|
|
|
|
ext2fs_init,
|
2001-09-15 20:12:54 +04:00
|
|
|
ext2fs_reinit,
|
2000-03-16 21:08:17 +03:00
|
|
|
ext2fs_done,
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL,
|
1997-06-11 13:33:37 +04:00
|
|
|
ext2fs_mountroot,
|
1999-02-27 02:44:43 +03:00
|
|
|
ufs_check_export,
|
2004-05-25 18:54:55 +04:00
|
|
|
(int (*)(struct mount *, struct vnode *, struct timespec *)) eopnotsupp,
|
2005-01-02 19:08:28 +03:00
|
|
|
vfs_stdextattrctl,
|
1998-02-18 20:02:20 +03:00
|
|
|
ext2fs_vnodeopv_descs,
|
1997-06-11 13:33:37 +04:00
|
|
|
};
|
2005-03-29 06:41:05 +04:00
|
|
|
VFS_ATTACH(ext2fs_vfsops);
|
1997-06-11 13:33:37 +04:00
|
|
|
|
a whole bunch of changes to improve performance and robustness under load:
- remove special treatment of pager_map mappings in pmaps. this is
required now, since I've removed the globals that expose the address range.
pager_map now uses pmap_kenter_pa() instead of pmap_enter(), so there's
no longer any need to special-case it.
- eliminate struct uvm_vnode by moving its fields into struct vnode.
- rewrite the pageout path. the pager is now responsible for handling the
high-level requests instead of only getting control after a bunch of work
has already been done on its behalf. this will allow us to UBCify LFS,
which needs tighter control over its pages than other filesystems do.
writing a page to disk no longer requires making it read-only, which
allows us to write wired pages without causing all kinds of havoc.
- use a new PG_PAGEOUT flag to indicate that a page should be freed
on behalf of the pagedaemon when it's unlocked. this flag is very similar
to PG_RELEASED, but unlike PG_RELEASED, PG_PAGEOUT can be cleared if the
pageout fails due to eg. an indirect-block buffer being locked.
this allows us to remove the "version" field from struct vm_page,
and together with shrinking "loan_count" from 32 bits to 16,
struct vm_page is now 4 bytes smaller.
- no longer use PG_RELEASED for swap-backed pages. if the page is busy
because it's being paged out, we can't release the swap slot to be
reallocated until that write is complete, but unlike with vnodes we
don't keep a count of in-progress writes so there's no good way to
know when the write is done. instead, when we need to free a busy
swap-backed page, just sleep until we can get it busy ourselves.
- implement a fast-path for extending writes which allows us to avoid
zeroing new pages. this substantially reduces cpu usage.
- encapsulate the data used by the genfs code in a struct genfs_node,
which must be the first element of the filesystem-specific vnode data
for filesystems which use genfs_{get,put}pages().
- eliminate many of the UVM pagerops, since they aren't needed anymore
now that the pager "put" operation is a higher-level operation.
- enhance the genfs code to allow NFS to use the genfs_{get,put}pages
instead of a modified copy.
- clean up struct vnode by removing all the fields that used to be used by
the vfs_cluster.c code (which we don't use anymore with UBC).
- remove kmem_object and mb_object since they were useless.
instead of allocating pages to these objects, we now just allocate
pages with no object. such pages are mapped in the kernel until they
are freed, so we can use the mapping to find the page to free it.
this allows us to remove splvm() protection in several places.
The sum of all these changes improves write throughput on my
decstation 5000/200 to within 1% of the rate of NetBSD 1.5
and reduces the elapsed time for "make release" of a NetBSD 1.5
source tree on my 128MB pc to 10% less than a 1.5 kernel took.
2001-09-16 00:36:31 +04:00
|
|
|
struct genfs_ops ext2fs_genfsops = {
|
|
|
|
genfs_size,
|
|
|
|
ext2fs_gop_alloc,
|
|
|
|
genfs_gop_write,
|
|
|
|
};
|
|
|
|
|
2004-04-25 20:42:40 +04:00
|
|
|
/*
|
|
|
|
* XXX Same structure as FFS inodes? Should we share a common pool?
|
|
|
|
*/
|
|
|
|
POOL_INIT(ext2fs_inode_pool, sizeof(struct inode), 0, 0, 0, "ext2fsinopl",
|
|
|
|
&pool_allocator_nointr);
|
|
|
|
POOL_INIT(ext2fs_dinode_pool, sizeof(struct ext2fs_dinode), 0, 0, 0,
|
|
|
|
"ext2dinopl", &pool_allocator_nointr);
|
1998-09-01 07:20:46 +04:00
|
|
|
|
1997-06-11 13:33:37 +04:00
|
|
|
extern u_long ext2gennumber;
|
|
|
|
|
1998-03-01 05:20:01 +03:00
|
|
|
void
|
|
|
|
ext2fs_init()
|
|
|
|
{
|
2004-05-20 09:39:34 +04:00
|
|
|
#ifdef _LKM
|
|
|
|
pool_init(&ext2fs_inode_pool, sizeof(struct inode), 0, 0, 0,
|
|
|
|
"ext2fsinopl", &pool_allocator_nointr);
|
|
|
|
pool_init(&ext2fs_dinode_pool, sizeof(struct ext2fs_dinode), 0, 0, 0,
|
2005-02-27 01:31:44 +03:00
|
|
|
"ext2dinopl", &pool_allocator_nointr);
|
2004-05-20 09:39:34 +04:00
|
|
|
#endif
|
1998-09-29 14:24:57 +04:00
|
|
|
ufs_init();
|
1998-03-01 05:20:01 +03:00
|
|
|
}
|
|
|
|
|
2001-09-15 20:12:54 +04:00
|
|
|
void
|
|
|
|
ext2fs_reinit()
|
|
|
|
{
|
|
|
|
ufs_reinit();
|
|
|
|
}
|
|
|
|
|
2000-03-16 21:08:17 +03:00
|
|
|
void
|
|
|
|
ext2fs_done()
|
|
|
|
{
|
|
|
|
ufs_done();
|
2004-05-20 09:39:34 +04:00
|
|
|
#ifdef _LKM
|
2000-03-16 21:08:17 +03:00
|
|
|
pool_destroy(&ext2fs_inode_pool);
|
2004-05-20 09:39:34 +04:00
|
|
|
pool_destroy(&ext2fs_dinode_pool);
|
|
|
|
#endif
|
2000-03-16 21:08:17 +03:00
|
|
|
}
|
1997-06-11 13:33:37 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Called by main() when ext2fs is going to be mounted as root.
|
|
|
|
*
|
|
|
|
* Name is updated by mount(8) after booting.
|
|
|
|
*/
|
|
|
|
#define ROOTNAME "root_device"
|
|
|
|
|
|
|
|
int
|
|
|
|
ext2fs_mountroot()
|
|
|
|
{
|
|
|
|
extern struct vnode *rootvp;
|
1998-03-01 05:20:01 +03:00
|
|
|
struct m_ext2fs *fs;
|
|
|
|
struct mount *mp;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *p = curproc; /* XXX */
|
1997-06-11 13:33:37 +04:00
|
|
|
struct ufsmount *ump;
|
|
|
|
int error;
|
|
|
|
|
|
|
|
if (root_device->dv_class != DV_DISK)
|
|
|
|
return (ENODEV);
|
2005-02-27 01:31:44 +03:00
|
|
|
|
1999-07-17 05:08:28 +04:00
|
|
|
if ((error = vfs_rootmountalloc(MOUNT_EXT2FS, "root_device", &mp))) {
|
|
|
|
vrele(rootvp);
|
1997-06-11 13:33:37 +04:00
|
|
|
return (error);
|
1999-07-17 05:08:28 +04:00
|
|
|
}
|
1998-03-01 05:20:01 +03:00
|
|
|
|
2003-06-30 02:28:00 +04:00
|
|
|
if ((error = ext2fs_mountfs(rootvp, mp, p)) != 0) {
|
1998-03-01 05:20:01 +03:00
|
|
|
mp->mnt_op->vfs_refcount--;
|
|
|
|
vfs_unbusy(mp);
|
1997-06-11 13:33:37 +04:00
|
|
|
free(mp, M_MOUNT);
|
|
|
|
return (error);
|
|
|
|
}
|
1998-03-01 05:20:01 +03:00
|
|
|
simple_lock(&mountlist_slock);
|
1997-06-11 13:33:37 +04:00
|
|
|
CIRCLEQ_INSERT_TAIL(&mountlist, mp, mnt_list);
|
1998-03-01 05:20:01 +03:00
|
|
|
simple_unlock(&mountlist_slock);
|
1997-06-11 13:33:37 +04:00
|
|
|
ump = VFSTOUFS(mp);
|
|
|
|
fs = ump->um_e2fs;
|
1998-08-10 00:15:38 +04:00
|
|
|
memset(fs->e2fs_fsmnt, 0, sizeof(fs->e2fs_fsmnt));
|
1998-03-01 05:20:01 +03:00
|
|
|
(void) copystr(mp->mnt_stat.f_mntonname, fs->e2fs_fsmnt,
|
2000-01-26 19:21:31 +03:00
|
|
|
sizeof(fs->e2fs_fsmnt) - 1, 0);
|
|
|
|
if (fs->e2fs.e2fs_rev > E2FS_REV0) {
|
|
|
|
memset(fs->e2fs.e2fs_fsmnt, 0, sizeof(fs->e2fs.e2fs_fsmnt));
|
|
|
|
(void) copystr(mp->mnt_stat.f_mntonname, fs->e2fs.e2fs_fsmnt,
|
|
|
|
sizeof(fs->e2fs.e2fs_fsmnt) - 1, 0);
|
|
|
|
}
|
2004-04-21 05:05:31 +04:00
|
|
|
(void)ext2fs_statvfs(mp, &mp->mnt_stat, p);
|
1998-03-01 05:20:01 +03:00
|
|
|
vfs_unbusy(mp);
|
2004-07-05 11:28:45 +04:00
|
|
|
setrootfstime((time_t)fs->e2fs.e2fs_wtime);
|
1997-06-11 13:33:37 +04:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* VFS Operations.
|
|
|
|
*
|
|
|
|
* mount system call
|
|
|
|
*/
|
|
|
|
int
|
2003-06-30 02:28:00 +04:00
|
|
|
ext2fs_mount(mp, path, data, ndp, p)
|
2000-03-30 16:41:09 +04:00
|
|
|
struct mount *mp;
|
1997-06-11 13:33:37 +04:00
|
|
|
const char *path;
|
|
|
|
void * data;
|
|
|
|
struct nameidata *ndp;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *p;
|
1997-06-11 13:33:37 +04:00
|
|
|
{
|
|
|
|
struct vnode *devvp;
|
|
|
|
struct ufs_args args;
|
|
|
|
struct ufsmount *ump = NULL;
|
2000-03-30 16:41:09 +04:00
|
|
|
struct m_ext2fs *fs;
|
1997-06-11 13:33:37 +04:00
|
|
|
size_t size;
|
2005-01-09 12:27:17 +03:00
|
|
|
int error, flags, update;
|
1997-06-11 13:33:37 +04:00
|
|
|
mode_t accessmode;
|
|
|
|
|
2002-09-21 22:10:34 +04:00
|
|
|
if (mp->mnt_flag & MNT_GETARGS) {
|
|
|
|
ump = VFSTOUFS(mp);
|
|
|
|
if (ump == NULL)
|
|
|
|
return EIO;
|
|
|
|
args.fspec = NULL;
|
|
|
|
vfs_showexport(mp, &args.export, &ump->um_export);
|
|
|
|
return copyout(&args, data, sizeof(args));
|
|
|
|
}
|
2003-03-22 02:11:19 +03:00
|
|
|
error = copyin(data, &args, sizeof (struct ufs_args));
|
1997-06-11 13:33:37 +04:00
|
|
|
if (error)
|
|
|
|
return (error);
|
2005-01-09 12:27:17 +03:00
|
|
|
|
|
|
|
update = mp->mnt_flag & MNT_UPDATE;
|
|
|
|
|
2005-01-11 03:19:36 +03:00
|
|
|
/* Check arguments */
|
2005-01-09 12:27:17 +03:00
|
|
|
if (args.fspec != NULL) {
|
|
|
|
/*
|
|
|
|
* Look up the name and verify that it's sane.
|
|
|
|
*/
|
|
|
|
NDINIT(ndp, LOOKUP, FOLLOW, UIO_USERSPACE, args.fspec, p);
|
|
|
|
if ((error = namei(ndp)) != 0)
|
|
|
|
return (error);
|
|
|
|
devvp = ndp->ni_vp;
|
|
|
|
|
|
|
|
if (!update) {
|
|
|
|
/*
|
|
|
|
* Be sure this is a valid block device
|
|
|
|
*/
|
|
|
|
if (devvp->v_type != VBLK)
|
|
|
|
error = ENOTBLK;
|
|
|
|
else if (bdevsw_lookup(devvp->v_rdev) == NULL)
|
|
|
|
error = ENXIO;
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* Be sure we're still naming the same device
|
|
|
|
* used for our initial mount
|
|
|
|
*/
|
2005-01-11 03:19:36 +03:00
|
|
|
ump = VFSTOUFS(mp);
|
2005-01-09 12:27:17 +03:00
|
|
|
if (devvp != ump->um_devvp)
|
|
|
|
error = EINVAL;
|
|
|
|
}
|
2005-01-11 03:19:36 +03:00
|
|
|
} else {
|
|
|
|
if (!update) {
|
|
|
|
/* New mounts must have a filename for the device */
|
|
|
|
return (EINVAL);
|
|
|
|
} else {
|
|
|
|
ump = VFSTOUFS(mp);
|
|
|
|
devvp = ump->um_devvp;
|
|
|
|
vref(devvp);
|
|
|
|
}
|
2005-01-09 12:27:17 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If mount by non-root, then verify that user has necessary
|
|
|
|
* permissions on the device.
|
|
|
|
*/
|
|
|
|
if (error == 0 && p->p_ucred->cr_uid != 0) {
|
|
|
|
accessmode = VREAD;
|
|
|
|
if (update ?
|
|
|
|
(mp->mnt_iflag & IMNT_WANTRDWR) != 0 :
|
|
|
|
(mp->mnt_flag & MNT_RDONLY) == 0)
|
|
|
|
accessmode |= VWRITE;
|
|
|
|
vn_lock(devvp, LK_EXCLUSIVE | LK_RETRY);
|
|
|
|
error = VOP_ACCESS(devvp, accessmode, p->p_ucred, p);
|
|
|
|
VOP_UNLOCK(devvp, 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (error) {
|
|
|
|
vrele(devvp);
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!update) {
|
2005-05-30 01:25:24 +04:00
|
|
|
int xflags;
|
2005-01-09 12:27:17 +03:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Disallow multiple mounts of the same device.
|
|
|
|
* Disallow mounting of a device that is currently in use
|
|
|
|
* (except for root, which might share swap device for
|
|
|
|
* miniroot).
|
|
|
|
*/
|
|
|
|
error = vfs_mountedon(devvp);
|
|
|
|
if (error)
|
|
|
|
goto fail;
|
|
|
|
if (vcount(devvp) > 1 && devvp != rootvp) {
|
|
|
|
error = EBUSY;
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
if (mp->mnt_flag & MNT_RDONLY)
|
2005-05-30 01:25:24 +04:00
|
|
|
xflags = FREAD;
|
2005-01-09 12:27:17 +03:00
|
|
|
else
|
2005-05-30 01:25:24 +04:00
|
|
|
xflags = FREAD|FWRITE;
|
|
|
|
error = VOP_OPEN(devvp, xflags, FSCRED, p);
|
2005-01-09 12:27:17 +03:00
|
|
|
if (error)
|
|
|
|
goto fail;
|
|
|
|
error = ext2fs_mountfs(devvp, mp, p);
|
|
|
|
if (error) {
|
|
|
|
vn_lock(devvp, LK_EXCLUSIVE | LK_RETRY);
|
2005-05-30 01:25:24 +04:00
|
|
|
(void)VOP_CLOSE(devvp, xflags, NOCRED, p);
|
2005-01-09 12:27:17 +03:00
|
|
|
VOP_UNLOCK(devvp, 0);
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
|
1997-06-11 13:33:37 +04:00
|
|
|
ump = VFSTOUFS(mp);
|
|
|
|
fs = ump->um_e2fs;
|
2005-01-09 12:27:17 +03:00
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* Update the mount.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The initial mount got a reference on this
|
|
|
|
* device, so drop the one obtained via
|
|
|
|
* namei(), above.
|
|
|
|
*/
|
|
|
|
vrele(devvp);
|
|
|
|
|
2005-01-11 03:19:36 +03:00
|
|
|
ump = VFSTOUFS(mp);
|
2005-01-09 12:27:17 +03:00
|
|
|
fs = ump->um_e2fs;
|
1997-06-11 13:33:37 +04:00
|
|
|
if (fs->e2fs_ronly == 0 && (mp->mnt_flag & MNT_RDONLY)) {
|
2005-01-09 12:27:17 +03:00
|
|
|
/*
|
|
|
|
* Changing from r/w to r/o
|
|
|
|
*/
|
1997-06-11 13:33:37 +04:00
|
|
|
flags = WRITECLOSE;
|
|
|
|
if (mp->mnt_flag & MNT_FORCE)
|
|
|
|
flags |= FORCECLOSE;
|
2003-06-30 02:28:00 +04:00
|
|
|
error = ext2fs_flushfiles(mp, flags, p);
|
1997-06-11 13:33:37 +04:00
|
|
|
if (error == 0 &&
|
2005-01-09 12:27:17 +03:00
|
|
|
ext2fs_cgupdate(ump, MNT_WAIT) == 0 &&
|
|
|
|
(fs->e2fs.e2fs_state & E2FS_ERRORS) == 0) {
|
1997-06-11 13:33:37 +04:00
|
|
|
fs->e2fs.e2fs_state = E2FS_ISCLEAN;
|
|
|
|
(void) ext2fs_sbupdate(ump, MNT_WAIT);
|
|
|
|
}
|
|
|
|
if (error)
|
|
|
|
return (error);
|
|
|
|
fs->e2fs_ronly = 1;
|
|
|
|
}
|
2005-01-09 12:27:17 +03:00
|
|
|
|
1997-06-11 13:33:37 +04:00
|
|
|
if (mp->mnt_flag & MNT_RELOAD) {
|
2003-06-30 02:28:00 +04:00
|
|
|
error = ext2fs_reload(mp, ndp->ni_cnd.cn_cred, p);
|
1997-06-11 13:33:37 +04:00
|
|
|
if (error)
|
|
|
|
return (error);
|
|
|
|
}
|
2005-01-09 12:27:17 +03:00
|
|
|
|
2003-10-14 18:02:56 +04:00
|
|
|
if (fs->e2fs_ronly && (mp->mnt_iflag & IMNT_WANTRDWR)) {
|
1997-06-11 13:33:37 +04:00
|
|
|
/*
|
2005-01-09 12:27:17 +03:00
|
|
|
* Changing from read-only to read/write
|
1997-06-11 13:33:37 +04:00
|
|
|
*/
|
|
|
|
fs->e2fs_ronly = 0;
|
|
|
|
if (fs->e2fs.e2fs_state == E2FS_ISCLEAN)
|
|
|
|
fs->e2fs.e2fs_state = 0;
|
|
|
|
else
|
|
|
|
fs->e2fs.e2fs_state = E2FS_ERRORS;
|
|
|
|
fs->e2fs_fmod = 1;
|
|
|
|
}
|
|
|
|
if (args.fspec == 0) {
|
|
|
|
/*
|
|
|
|
* Process export requests.
|
|
|
|
*/
|
|
|
|
return (vfs_export(mp, &ump->um_export, &args.export));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2004-04-21 05:05:31 +04:00
|
|
|
error = set_statvfs_info(path, UIO_USERSPACE, args.fspec,
|
2003-06-30 02:28:00 +04:00
|
|
|
UIO_USERSPACE, mp, p);
|
2003-04-17 01:44:18 +04:00
|
|
|
(void) copystr(mp->mnt_stat.f_mntonname, fs->e2fs_fsmnt,
|
|
|
|
sizeof(fs->e2fs_fsmnt) - 1, &size);
|
1998-08-10 00:15:38 +04:00
|
|
|
memset(fs->e2fs_fsmnt + size, 0, sizeof(fs->e2fs_fsmnt) - size);
|
2000-01-26 19:21:31 +03:00
|
|
|
if (fs->e2fs.e2fs_rev > E2FS_REV0) {
|
|
|
|
(void) copystr(mp->mnt_stat.f_mntonname, fs->e2fs.e2fs_fsmnt,
|
|
|
|
sizeof(fs->e2fs.e2fs_fsmnt) - 1, &size);
|
|
|
|
memset(fs->e2fs.e2fs_fsmnt, 0,
|
|
|
|
sizeof(fs->e2fs.e2fs_fsmnt) - size);
|
|
|
|
}
|
1997-06-11 13:33:37 +04:00
|
|
|
if (fs->e2fs_fmod != 0) { /* XXX */
|
|
|
|
fs->e2fs_fmod = 0;
|
|
|
|
if (fs->e2fs.e2fs_state == 0)
|
|
|
|
fs->e2fs.e2fs_wtime = time.tv_sec;
|
|
|
|
else
|
|
|
|
printf("%s: file system not clean; please fsck(8)\n",
|
|
|
|
mp->mnt_stat.f_mntfromname);
|
|
|
|
(void) ext2fs_cgupdate(ump, MNT_WAIT);
|
|
|
|
}
|
2005-01-09 12:27:17 +03:00
|
|
|
return (error);
|
|
|
|
|
|
|
|
fail:
|
|
|
|
vrele(devvp);
|
|
|
|
return (error);
|
1997-06-11 13:33:37 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Reload all incore data for a filesystem (used after running fsck on
|
|
|
|
* the root filesystem and finding things to fix). The filesystem must
|
|
|
|
* be mounted read-only.
|
|
|
|
*
|
|
|
|
* Things to do to update the mount:
|
|
|
|
* 1) invalidate all cached meta-data.
|
|
|
|
* 2) re-read superblock from disk.
|
|
|
|
* 3) re-read summary information from disk.
|
|
|
|
* 4) invalidate all inactive vnodes.
|
|
|
|
* 5) invalidate all cached file data.
|
|
|
|
* 6) re-read inode data for all active vnodes.
|
|
|
|
*/
|
|
|
|
int
|
2003-06-30 02:28:00 +04:00
|
|
|
ext2fs_reload(mountp, cred, p)
|
2000-03-30 16:41:09 +04:00
|
|
|
struct mount *mountp;
|
1997-06-11 13:33:37 +04:00
|
|
|
struct ucred *cred;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *p;
|
1997-06-11 13:33:37 +04:00
|
|
|
{
|
2000-03-30 16:41:09 +04:00
|
|
|
struct vnode *vp, *nvp, *devvp;
|
1997-06-11 13:33:37 +04:00
|
|
|
struct inode *ip;
|
|
|
|
struct buf *bp;
|
|
|
|
struct m_ext2fs *fs;
|
|
|
|
struct ext2fs *newfs;
|
|
|
|
struct partinfo dpart;
|
|
|
|
int i, size, error;
|
1998-10-23 04:33:23 +04:00
|
|
|
caddr_t cp;
|
1997-06-11 13:33:37 +04:00
|
|
|
|
|
|
|
if ((mountp->mnt_flag & MNT_RDONLY) == 0)
|
|
|
|
return (EINVAL);
|
|
|
|
/*
|
|
|
|
* Step 1: invalidate all cached meta-data.
|
|
|
|
*/
|
|
|
|
devvp = VFSTOUFS(mountp)->um_devvp;
|
2000-07-22 18:49:17 +04:00
|
|
|
vn_lock(devvp, LK_EXCLUSIVE | LK_RETRY);
|
2003-06-30 02:28:00 +04:00
|
|
|
error = vinvalbuf(devvp, 0, cred, p, 0, 0);
|
2000-07-22 18:49:17 +04:00
|
|
|
VOP_UNLOCK(devvp, 0);
|
|
|
|
if (error)
|
1997-06-11 13:33:37 +04:00
|
|
|
panic("ext2fs_reload: dirty1");
|
|
|
|
/*
|
|
|
|
* Step 2: re-read superblock from disk.
|
|
|
|
*/
|
2003-06-30 02:28:00 +04:00
|
|
|
if (VOP_IOCTL(devvp, DIOCGPART, &dpart, FREAD, NOCRED, p) != 0)
|
1997-06-11 13:33:37 +04:00
|
|
|
size = DEV_BSIZE;
|
|
|
|
else
|
|
|
|
size = dpart.disklab->d_secsize;
|
2003-01-25 00:55:02 +03:00
|
|
|
error = bread(devvp, (daddr_t)(SBOFF / size), SBSIZE, NOCRED, &bp);
|
1999-02-10 16:14:08 +03:00
|
|
|
if (error) {
|
|
|
|
brelse(bp);
|
1997-06-11 13:33:37 +04:00
|
|
|
return (error);
|
1999-02-10 16:14:08 +03:00
|
|
|
}
|
1997-06-11 13:33:37 +04:00
|
|
|
newfs = (struct ext2fs *)bp->b_data;
|
2000-01-26 19:21:31 +03:00
|
|
|
error = ext2fs_checksb(newfs, (mountp->mnt_flag & MNT_RDONLY) != 0);
|
|
|
|
if (error) {
|
1997-06-11 13:33:37 +04:00
|
|
|
brelse(bp);
|
2000-01-26 19:21:31 +03:00
|
|
|
return (error);
|
1997-06-11 13:33:37 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
fs = VFSTOUFS(mountp)->um_e2fs;
|
2005-02-27 01:31:44 +03:00
|
|
|
/*
|
1997-06-11 13:33:37 +04:00
|
|
|
* copy in new superblock, and compute in-memory values
|
|
|
|
*/
|
1997-10-09 19:42:19 +04:00
|
|
|
e2fs_sbload(newfs, &fs->e2fs);
|
1999-02-10 16:14:08 +03:00
|
|
|
fs->e2fs_ncg =
|
|
|
|
howmany(fs->e2fs.e2fs_bcount - fs->e2fs.e2fs_first_dblock,
|
|
|
|
fs->e2fs.e2fs_bpg);
|
1997-06-11 13:33:37 +04:00
|
|
|
/* XXX assume hw bsize = 512 */
|
|
|
|
fs->e2fs_fsbtodb = fs->e2fs.e2fs_log_bsize + 1;
|
|
|
|
fs->e2fs_bsize = 1024 << fs->e2fs.e2fs_log_bsize;
|
|
|
|
fs->e2fs_bshift = LOG_MINBSIZE + fs->e2fs.e2fs_log_bsize;
|
|
|
|
fs->e2fs_qbmask = fs->e2fs_bsize - 1;
|
|
|
|
fs->e2fs_bmask = ~fs->e2fs_qbmask;
|
|
|
|
fs->e2fs_ngdb = howmany(fs->e2fs_ncg,
|
|
|
|
fs->e2fs_bsize / sizeof(struct ext2_gd));
|
1998-10-23 04:33:23 +04:00
|
|
|
fs->e2fs_ipb = fs->e2fs_bsize / EXT2_DINODE_SIZE;
|
1997-06-11 13:33:37 +04:00
|
|
|
fs->e2fs_itpg = fs->e2fs.e2fs_ipg/fs->e2fs_ipb;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Step 3: re-read summary information from disk.
|
|
|
|
*/
|
|
|
|
|
|
|
|
for (i=0; i < fs->e2fs_ngdb; i++) {
|
1999-02-10 16:14:08 +03:00
|
|
|
error = bread(devvp ,
|
|
|
|
fsbtodb(fs, ((fs->e2fs_bsize>1024)? 0 : 1) + i + 1),
|
|
|
|
fs->e2fs_bsize, NOCRED, &bp);
|
|
|
|
if (error) {
|
|
|
|
brelse(bp);
|
1997-06-11 13:33:37 +04:00
|
|
|
return (error);
|
1999-02-10 16:14:08 +03:00
|
|
|
}
|
1997-10-09 19:42:19 +04:00
|
|
|
e2fs_cgload((struct ext2_gd*)bp->b_data,
|
1999-02-10 16:14:08 +03:00
|
|
|
&fs->e2fs_gd[i* fs->e2fs_bsize / sizeof(struct ext2_gd)],
|
|
|
|
fs->e2fs_bsize);
|
1997-06-11 13:33:37 +04:00
|
|
|
brelse(bp);
|
|
|
|
}
|
2005-02-27 01:31:44 +03:00
|
|
|
|
1997-06-11 13:33:37 +04:00
|
|
|
loop:
|
1998-03-01 05:20:01 +03:00
|
|
|
simple_lock(&mntvnode_slock);
|
1997-06-11 13:33:37 +04:00
|
|
|
for (vp = mountp->mnt_vnodelist.lh_first; vp != NULL; vp = nvp) {
|
1998-03-01 05:20:01 +03:00
|
|
|
if (vp->v_mount != mountp) {
|
|
|
|
simple_unlock(&mntvnode_slock);
|
|
|
|
goto loop;
|
|
|
|
}
|
1997-06-11 13:33:37 +04:00
|
|
|
nvp = vp->v_mntvnodes.le_next;
|
|
|
|
/*
|
|
|
|
* Step 4: invalidate all inactive vnodes.
|
|
|
|
*/
|
2003-06-30 02:28:00 +04:00
|
|
|
if (vrecycle(vp, &mntvnode_slock, p))
|
1998-03-01 05:20:01 +03:00
|
|
|
goto loop;
|
1997-06-11 13:33:37 +04:00
|
|
|
/*
|
|
|
|
* Step 5: invalidate all cached file data.
|
|
|
|
*/
|
1998-03-01 05:20:01 +03:00
|
|
|
simple_lock(&vp->v_interlock);
|
|
|
|
simple_unlock(&mntvnode_slock);
|
2003-06-29 22:43:21 +04:00
|
|
|
if (vget(vp, LK_EXCLUSIVE | LK_INTERLOCK))
|
1997-06-11 13:33:37 +04:00
|
|
|
goto loop;
|
2003-06-30 02:28:00 +04:00
|
|
|
if (vinvalbuf(vp, 0, cred, p, 0, 0))
|
1997-06-11 13:33:37 +04:00
|
|
|
panic("ext2fs_reload: dirty2");
|
|
|
|
/*
|
|
|
|
* Step 6: re-read inode data for all active vnodes.
|
|
|
|
*/
|
|
|
|
ip = VTOI(vp);
|
|
|
|
error = bread(devvp, fsbtodb(fs, ino_to_fsba(fs, ip->i_number)),
|
|
|
|
(int)fs->e2fs_bsize, NOCRED, &bp);
|
|
|
|
if (error) {
|
|
|
|
vput(vp);
|
|
|
|
return (error);
|
|
|
|
}
|
1998-10-23 04:33:23 +04:00
|
|
|
cp = (caddr_t)bp->b_data +
|
|
|
|
(ino_to_fsbo(fs, ip->i_number) * EXT2_DINODE_SIZE);
|
2003-04-02 14:39:19 +04:00
|
|
|
e2fs_iload((struct ext2fs_dinode *)cp, ip->i_din.e2fs_din);
|
1997-06-11 13:33:37 +04:00
|
|
|
brelse(bp);
|
|
|
|
vput(vp);
|
1998-03-01 05:20:01 +03:00
|
|
|
simple_lock(&mntvnode_slock);
|
1997-06-11 13:33:37 +04:00
|
|
|
}
|
1998-03-01 05:20:01 +03:00
|
|
|
simple_unlock(&mntvnode_slock);
|
1997-06-11 13:33:37 +04:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Common code for mount and mountroot
|
|
|
|
*/
|
|
|
|
int
|
2003-06-30 02:28:00 +04:00
|
|
|
ext2fs_mountfs(devvp, mp, p)
|
2000-03-30 16:41:09 +04:00
|
|
|
struct vnode *devvp;
|
1997-06-11 13:33:37 +04:00
|
|
|
struct mount *mp;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *p;
|
1997-06-11 13:33:37 +04:00
|
|
|
{
|
2000-03-30 16:41:09 +04:00
|
|
|
struct ufsmount *ump;
|
1997-06-11 13:33:37 +04:00
|
|
|
struct buf *bp;
|
2000-03-30 16:41:09 +04:00
|
|
|
struct ext2fs *fs;
|
|
|
|
struct m_ext2fs *m_fs;
|
1997-06-11 13:33:37 +04:00
|
|
|
dev_t dev;
|
|
|
|
struct partinfo dpart;
|
|
|
|
int error, i, size, ronly;
|
|
|
|
struct ucred *cred;
|
|
|
|
|
|
|
|
dev = devvp->v_rdev;
|
|
|
|
cred = p ? p->p_ucred : NOCRED;
|
2005-01-09 12:27:17 +03:00
|
|
|
|
|
|
|
/* Flush out any old buffers remaining from a previous use. */
|
2000-07-22 18:49:17 +04:00
|
|
|
vn_lock(devvp, LK_EXCLUSIVE | LK_RETRY);
|
2003-06-30 02:28:00 +04:00
|
|
|
error = vinvalbuf(devvp, V_SAVE, cred, p, 0, 0);
|
2000-07-22 18:49:17 +04:00
|
|
|
VOP_UNLOCK(devvp, 0);
|
|
|
|
if (error)
|
1997-06-11 13:33:37 +04:00
|
|
|
return (error);
|
|
|
|
|
|
|
|
ronly = (mp->mnt_flag & MNT_RDONLY) != 0;
|
2003-06-30 02:28:00 +04:00
|
|
|
if (VOP_IOCTL(devvp, DIOCGPART, &dpart, FREAD, cred, p) != 0)
|
1997-06-11 13:33:37 +04:00
|
|
|
size = DEV_BSIZE;
|
|
|
|
else
|
|
|
|
size = dpart.disklab->d_secsize;
|
|
|
|
|
|
|
|
bp = NULL;
|
|
|
|
ump = NULL;
|
|
|
|
|
|
|
|
#ifdef DEBUG_EXT2
|
|
|
|
printf("sb size: %d ino size %d\n", sizeof(struct ext2fs),
|
1998-10-23 04:33:23 +04:00
|
|
|
EXT2_DINODE_SIZE);
|
1997-06-11 13:33:37 +04:00
|
|
|
#endif
|
2001-11-06 10:09:39 +03:00
|
|
|
error = bread(devvp, (SBOFF / size), SBSIZE, cred, &bp);
|
1997-06-11 13:33:37 +04:00
|
|
|
if (error)
|
|
|
|
goto out;
|
|
|
|
fs = (struct ext2fs *)bp->b_data;
|
2000-01-26 19:21:31 +03:00
|
|
|
error = ext2fs_checksb(fs, ronly);
|
|
|
|
if (error)
|
1997-06-11 13:33:37 +04:00
|
|
|
goto out;
|
|
|
|
ump = malloc(sizeof *ump, M_UFSMNT, M_WAITOK);
|
2003-03-22 02:11:19 +03:00
|
|
|
memset(ump, 0, sizeof *ump);
|
2003-04-02 14:39:19 +04:00
|
|
|
ump->um_fstype = UFS1;
|
1997-06-11 13:33:37 +04:00
|
|
|
ump->um_e2fs = malloc(sizeof(struct m_ext2fs), M_UFSMNT, M_WAITOK);
|
2003-03-22 02:11:19 +03:00
|
|
|
memset(ump->um_e2fs, 0, sizeof(struct m_ext2fs));
|
1997-10-09 19:42:19 +04:00
|
|
|
e2fs_sbload((struct ext2fs*)bp->b_data, &ump->um_e2fs->e2fs);
|
1997-06-11 13:33:37 +04:00
|
|
|
brelse(bp);
|
|
|
|
bp = NULL;
|
|
|
|
m_fs = ump->um_e2fs;
|
|
|
|
m_fs->e2fs_ronly = ronly;
|
|
|
|
if (ronly == 0) {
|
|
|
|
if (m_fs->e2fs.e2fs_state == E2FS_ISCLEAN)
|
|
|
|
m_fs->e2fs.e2fs_state = 0;
|
|
|
|
else
|
|
|
|
m_fs->e2fs.e2fs_state = E2FS_ERRORS;
|
|
|
|
m_fs->e2fs_fmod = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* compute dynamic sb infos */
|
|
|
|
m_fs->e2fs_ncg =
|
|
|
|
howmany(m_fs->e2fs.e2fs_bcount - m_fs->e2fs.e2fs_first_dblock,
|
|
|
|
m_fs->e2fs.e2fs_bpg);
|
|
|
|
/* XXX assume hw bsize = 512 */
|
|
|
|
m_fs->e2fs_fsbtodb = m_fs->e2fs.e2fs_log_bsize + 1;
|
|
|
|
m_fs->e2fs_bsize = 1024 << m_fs->e2fs.e2fs_log_bsize;
|
|
|
|
m_fs->e2fs_bshift = LOG_MINBSIZE + m_fs->e2fs.e2fs_log_bsize;
|
|
|
|
m_fs->e2fs_qbmask = m_fs->e2fs_bsize - 1;
|
|
|
|
m_fs->e2fs_bmask = ~m_fs->e2fs_qbmask;
|
|
|
|
m_fs->e2fs_ngdb = howmany(m_fs->e2fs_ncg,
|
|
|
|
m_fs->e2fs_bsize / sizeof(struct ext2_gd));
|
1998-10-23 04:33:23 +04:00
|
|
|
m_fs->e2fs_ipb = m_fs->e2fs_bsize / EXT2_DINODE_SIZE;
|
1997-06-11 13:33:37 +04:00
|
|
|
m_fs->e2fs_itpg = m_fs->e2fs.e2fs_ipg/m_fs->e2fs_ipb;
|
|
|
|
|
|
|
|
m_fs->e2fs_gd = malloc(m_fs->e2fs_ngdb * m_fs->e2fs_bsize,
|
|
|
|
M_UFSMNT, M_WAITOK);
|
|
|
|
for (i=0; i < m_fs->e2fs_ngdb; i++) {
|
1999-02-10 16:14:08 +03:00
|
|
|
error = bread(devvp ,
|
|
|
|
fsbtodb(m_fs, ((m_fs->e2fs_bsize>1024)? 0 : 1) + i + 1),
|
|
|
|
m_fs->e2fs_bsize, NOCRED, &bp);
|
1997-06-11 13:33:37 +04:00
|
|
|
if (error) {
|
|
|
|
free(m_fs->e2fs_gd, M_UFSMNT);
|
|
|
|
goto out;
|
|
|
|
}
|
1997-10-09 19:42:19 +04:00
|
|
|
e2fs_cgload((struct ext2_gd*)bp->b_data,
|
1999-02-10 16:14:08 +03:00
|
|
|
&m_fs->e2fs_gd[
|
|
|
|
i * m_fs->e2fs_bsize / sizeof(struct ext2_gd)],
|
|
|
|
m_fs->e2fs_bsize);
|
1997-06-11 13:33:37 +04:00
|
|
|
brelse(bp);
|
|
|
|
bp = NULL;
|
|
|
|
}
|
|
|
|
|
2002-07-30 11:40:07 +04:00
|
|
|
mp->mnt_data = ump;
|
2004-04-21 05:05:31 +04:00
|
|
|
mp->mnt_stat.f_fsidx.__fsid_val[0] = (long)dev;
|
|
|
|
mp->mnt_stat.f_fsidx.__fsid_val[1] = makefstype(MOUNT_EXT2FS);
|
|
|
|
mp->mnt_stat.f_fsid = mp->mnt_stat.f_fsidx.__fsid_val[0];
|
|
|
|
mp->mnt_stat.f_namemax = MAXNAMLEN;
|
1997-06-11 13:33:37 +04:00
|
|
|
mp->mnt_flag |= MNT_LOCAL;
|
2000-11-27 11:39:39 +03:00
|
|
|
mp->mnt_dev_bshift = DEV_BSHIFT; /* XXX */
|
|
|
|
mp->mnt_fs_bshift = m_fs->e2fs_bshift;
|
Fixing age old cruft:
* Rather than using mnt_maxsymlinklen to indicate that a file systems returns
d_type fields(!), add a new internal flag, IMNT_DTYPE.
Add 3 new elements to ufsmount:
* um_maxsymlinklen, replaces mnt_maxsymlinklen (which never should have existed
in the first place).
* um_dirblksiz, which tracks the current directory block size, eliminating the
FS-specific checks littered throughout the code. This may be used later to
make the block size variable.
* um_maxfilesize, which is the maximum file size, possibly adjusted lower due
to implementation issues.
Sync some bug fixes from FFS into ext2fs, particularly:
* ffs_lookup.c 1.21, 1.28, 1.33, 1.48
* ffs_inode.c 1.43, 1.44, 1.45, 1.66, 1.67
* ffs_vnops.c 1.84, 1.85, 1.86
Clean up some crappy pointer frobnication.
2004-08-15 11:19:54 +04:00
|
|
|
mp->mnt_iflag |= IMNT_DTYPE;
|
1998-03-18 18:57:26 +03:00
|
|
|
ump->um_flags = 0;
|
1997-06-11 13:33:37 +04:00
|
|
|
ump->um_mountp = mp;
|
|
|
|
ump->um_dev = dev;
|
|
|
|
ump->um_devvp = devvp;
|
|
|
|
ump->um_nindir = NINDIR(m_fs);
|
2000-11-27 11:39:39 +03:00
|
|
|
ump->um_lognindir = ffs(NINDIR(m_fs)) - 1;
|
1997-06-11 13:33:37 +04:00
|
|
|
ump->um_bptrtodb = m_fs->e2fs_fsbtodb;
|
|
|
|
ump->um_seqinc = 1; /* no frags */
|
Fixing age old cruft:
* Rather than using mnt_maxsymlinklen to indicate that a file systems returns
d_type fields(!), add a new internal flag, IMNT_DTYPE.
Add 3 new elements to ufsmount:
* um_maxsymlinklen, replaces mnt_maxsymlinklen (which never should have existed
in the first place).
* um_dirblksiz, which tracks the current directory block size, eliminating the
FS-specific checks littered throughout the code. This may be used later to
make the block size variable.
* um_maxfilesize, which is the maximum file size, possibly adjusted lower due
to implementation issues.
Sync some bug fixes from FFS into ext2fs, particularly:
* ffs_lookup.c 1.21, 1.28, 1.33, 1.48
* ffs_inode.c 1.43, 1.44, 1.45, 1.66, 1.67
* ffs_vnops.c 1.84, 1.85, 1.86
Clean up some crappy pointer frobnication.
2004-08-15 11:19:54 +04:00
|
|
|
ump->um_maxsymlinklen = EXT2_MAXSYMLINKLEN;
|
|
|
|
ump->um_dirblksiz = m_fs->e2fs_bsize;
|
|
|
|
ump->um_maxfilesize = ((u_int64_t)0x80000000 * m_fs->e2fs_bsize - 1);
|
1999-11-15 21:49:07 +03:00
|
|
|
devvp->v_specmountpoint = mp;
|
1997-06-11 13:33:37 +04:00
|
|
|
return (0);
|
2000-11-27 11:39:39 +03:00
|
|
|
|
1997-06-11 13:33:37 +04:00
|
|
|
out:
|
|
|
|
if (bp)
|
|
|
|
brelse(bp);
|
|
|
|
if (ump) {
|
|
|
|
free(ump->um_e2fs, M_UFSMNT);
|
|
|
|
free(ump, M_UFSMNT);
|
2002-07-30 11:40:07 +04:00
|
|
|
mp->mnt_data = NULL;
|
1997-06-11 13:33:37 +04:00
|
|
|
}
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* unmount system call
|
|
|
|
*/
|
|
|
|
int
|
2003-06-30 02:28:00 +04:00
|
|
|
ext2fs_unmount(mp, mntflags, p)
|
1997-06-11 13:33:37 +04:00
|
|
|
struct mount *mp;
|
|
|
|
int mntflags;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *p;
|
1997-06-11 13:33:37 +04:00
|
|
|
{
|
2000-03-30 16:41:09 +04:00
|
|
|
struct ufsmount *ump;
|
|
|
|
struct m_ext2fs *fs;
|
1997-06-11 13:33:37 +04:00
|
|
|
int error, flags;
|
|
|
|
|
|
|
|
flags = 0;
|
|
|
|
if (mntflags & MNT_FORCE)
|
|
|
|
flags |= FORCECLOSE;
|
2003-06-30 02:28:00 +04:00
|
|
|
if ((error = ext2fs_flushfiles(mp, flags, p)) != 0)
|
1997-06-11 13:33:37 +04:00
|
|
|
return (error);
|
|
|
|
ump = VFSTOUFS(mp);
|
|
|
|
fs = ump->um_e2fs;
|
|
|
|
if (fs->e2fs_ronly == 0 &&
|
|
|
|
ext2fs_cgupdate(ump, MNT_WAIT) == 0 &&
|
|
|
|
(fs->e2fs.e2fs_state & E2FS_ERRORS) == 0) {
|
|
|
|
fs->e2fs.e2fs_state = E2FS_ISCLEAN;
|
|
|
|
(void) ext2fs_sbupdate(ump, MNT_WAIT);
|
|
|
|
}
|
1999-10-20 18:32:09 +04:00
|
|
|
if (ump->um_devvp->v_type != VBAD)
|
1999-11-15 21:49:07 +03:00
|
|
|
ump->um_devvp->v_specmountpoint = NULL;
|
1999-10-17 03:53:26 +04:00
|
|
|
vn_lock(ump->um_devvp, LK_EXCLUSIVE | LK_RETRY);
|
1997-06-11 13:33:37 +04:00
|
|
|
error = VOP_CLOSE(ump->um_devvp, fs->e2fs_ronly ? FREAD : FREAD|FWRITE,
|
2003-06-30 02:28:00 +04:00
|
|
|
NOCRED, p);
|
1999-10-17 03:53:26 +04:00
|
|
|
vput(ump->um_devvp);
|
1997-06-11 13:33:37 +04:00
|
|
|
free(fs->e2fs_gd, M_UFSMNT);
|
|
|
|
free(fs, M_UFSMNT);
|
|
|
|
free(ump, M_UFSMNT);
|
2002-07-30 11:40:07 +04:00
|
|
|
mp->mnt_data = NULL;
|
1997-06-11 13:33:37 +04:00
|
|
|
mp->mnt_flag &= ~MNT_LOCAL;
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Flush out all the files in a filesystem.
|
|
|
|
*/
|
|
|
|
int
|
2003-06-30 02:28:00 +04:00
|
|
|
ext2fs_flushfiles(mp, flags, p)
|
2000-03-30 16:41:09 +04:00
|
|
|
struct mount *mp;
|
1997-06-11 13:33:37 +04:00
|
|
|
int flags;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *p;
|
1997-06-11 13:33:37 +04:00
|
|
|
{
|
|
|
|
extern int doforce;
|
|
|
|
int error;
|
|
|
|
|
|
|
|
if (!doforce)
|
|
|
|
flags &= ~FORCECLOSE;
|
|
|
|
error = vflush(mp, NULLVP, flags);
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Get file system statistics.
|
|
|
|
*/
|
|
|
|
int
|
2004-04-21 05:05:31 +04:00
|
|
|
ext2fs_statvfs(mp, sbp, p)
|
1997-06-11 13:33:37 +04:00
|
|
|
struct mount *mp;
|
2004-04-21 05:05:31 +04:00
|
|
|
struct statvfs *sbp;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *p;
|
1997-06-11 13:33:37 +04:00
|
|
|
{
|
2000-03-30 16:41:09 +04:00
|
|
|
struct ufsmount *ump;
|
|
|
|
struct m_ext2fs *fs;
|
1997-06-11 13:33:37 +04:00
|
|
|
u_int32_t overhead, overhead_per_group;
|
2000-01-28 19:00:23 +03:00
|
|
|
int i, ngroups;
|
1997-06-11 13:33:37 +04:00
|
|
|
|
|
|
|
ump = VFSTOUFS(mp);
|
|
|
|
fs = ump->um_e2fs;
|
|
|
|
if (fs->e2fs.e2fs_magic != E2FS_MAGIC)
|
2004-04-21 05:05:31 +04:00
|
|
|
panic("ext2fs_statvfs");
|
1997-06-11 13:33:37 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Compute the overhead (FS structures)
|
|
|
|
*/
|
2000-01-28 19:00:23 +03:00
|
|
|
overhead_per_group = 1 /* block bitmap */ +
|
|
|
|
1 /* inode bitmap */ +
|
|
|
|
fs->e2fs_itpg;
|
1997-06-11 13:33:37 +04:00
|
|
|
overhead = fs->e2fs.e2fs_first_dblock +
|
|
|
|
fs->e2fs_ncg * overhead_per_group;
|
2000-01-28 19:00:23 +03:00
|
|
|
if (fs->e2fs.e2fs_rev > E2FS_REV0 &&
|
|
|
|
fs->e2fs.e2fs_features_rocompat & EXT2F_ROCOMPAT_SPARSESUPER) {
|
|
|
|
for (i = 0, ngroups = 0; i < fs->e2fs_ncg; i++) {
|
|
|
|
if (cg_has_sb(i))
|
|
|
|
ngroups++;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
ngroups = fs->e2fs_ncg;
|
|
|
|
}
|
|
|
|
overhead += ngroups * (1 + fs->e2fs_ngdb);
|
1997-06-11 13:33:37 +04:00
|
|
|
|
|
|
|
sbp->f_bsize = fs->e2fs_bsize;
|
2004-11-11 04:32:12 +03:00
|
|
|
sbp->f_frsize = 1024 << fs->e2fs.e2fs_fsize;
|
1997-06-11 13:33:37 +04:00
|
|
|
sbp->f_iosize = fs->e2fs_bsize;
|
|
|
|
sbp->f_blocks = fs->e2fs.e2fs_bcount - overhead;
|
|
|
|
sbp->f_bfree = fs->e2fs.e2fs_fbcount;
|
2004-04-21 05:05:31 +04:00
|
|
|
sbp->f_bresvd = fs->e2fs.e2fs_rbcount;
|
|
|
|
if (sbp->f_bfree > sbp->f_bresvd)
|
|
|
|
sbp->f_bavail = sbp->f_bfree - sbp->f_bresvd;
|
|
|
|
else
|
|
|
|
sbp->f_bavail = 0;
|
1997-06-11 13:33:37 +04:00
|
|
|
sbp->f_files = fs->e2fs.e2fs_icount;
|
|
|
|
sbp->f_ffree = fs->e2fs.e2fs_ficount;
|
2004-04-21 05:05:31 +04:00
|
|
|
sbp->f_favail = fs->e2fs.e2fs_ficount;
|
|
|
|
sbp->f_fresvd = 0;
|
|
|
|
copy_statvfs_info(sbp, mp);
|
1997-06-11 13:33:37 +04:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Go through the disk queues to initiate sandbagged IO;
|
|
|
|
* go through the inodes to write those that have been modified;
|
|
|
|
* initiate the writing of the super block if it has been modified.
|
|
|
|
*
|
|
|
|
* Note: we are always called with the filesystem marked `MPBUSY'.
|
|
|
|
*/
|
|
|
|
int
|
2003-06-30 02:28:00 +04:00
|
|
|
ext2fs_sync(mp, waitfor, cred, p)
|
1997-06-11 13:33:37 +04:00
|
|
|
struct mount *mp;
|
|
|
|
int waitfor;
|
|
|
|
struct ucred *cred;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *p;
|
1997-06-11 13:33:37 +04:00
|
|
|
{
|
1998-03-01 05:20:01 +03:00
|
|
|
struct vnode *vp, *nvp;
|
|
|
|
struct inode *ip;
|
|
|
|
struct ufsmount *ump = VFSTOUFS(mp);
|
|
|
|
struct m_ext2fs *fs;
|
1997-06-11 13:33:37 +04:00
|
|
|
int error, allerror = 0;
|
|
|
|
|
|
|
|
fs = ump->um_e2fs;
|
2000-05-29 22:34:36 +04:00
|
|
|
if (fs->e2fs_fmod != 0 && fs->e2fs_ronly != 0) { /* XXX */
|
1998-03-01 05:20:01 +03:00
|
|
|
printf("fs = %s\n", fs->e2fs_fsmnt);
|
|
|
|
panic("update: rofs mod");
|
1997-06-11 13:33:37 +04:00
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Write back each (modified) inode.
|
|
|
|
*/
|
1998-03-01 05:20:01 +03:00
|
|
|
simple_lock(&mntvnode_slock);
|
1997-06-11 13:33:37 +04:00
|
|
|
loop:
|
2000-05-29 22:34:36 +04:00
|
|
|
for (vp = LIST_FIRST(&mp->mnt_vnodelist); vp != NULL; vp = nvp) {
|
1997-06-11 13:33:37 +04:00
|
|
|
/*
|
|
|
|
* If the vnode that we are about to sync is no longer
|
|
|
|
* associated with this mount point, start over.
|
|
|
|
*/
|
|
|
|
if (vp->v_mount != mp)
|
|
|
|
goto loop;
|
1998-03-01 05:20:01 +03:00
|
|
|
simple_lock(&vp->v_interlock);
|
2000-05-29 22:34:36 +04:00
|
|
|
nvp = LIST_NEXT(vp, v_mntvnodes);
|
1997-06-11 13:33:37 +04:00
|
|
|
ip = VTOI(vp);
|
2004-08-14 05:08:02 +04:00
|
|
|
if (vp->v_type == VNON ||
|
2000-05-29 22:34:36 +04:00
|
|
|
((ip->i_flag &
|
2004-08-14 05:08:02 +04:00
|
|
|
(IN_CHANGE | IN_UPDATE | IN_MODIFIED)) == 0 &&
|
2000-12-10 22:36:31 +03:00
|
|
|
LIST_EMPTY(&vp->v_dirtyblkhd) &&
|
a whole bunch of changes to improve performance and robustness under load:
- remove special treatment of pager_map mappings in pmaps. this is
required now, since I've removed the globals that expose the address range.
pager_map now uses pmap_kenter_pa() instead of pmap_enter(), so there's
no longer any need to special-case it.
- eliminate struct uvm_vnode by moving its fields into struct vnode.
- rewrite the pageout path. the pager is now responsible for handling the
high-level requests instead of only getting control after a bunch of work
has already been done on its behalf. this will allow us to UBCify LFS,
which needs tighter control over its pages than other filesystems do.
writing a page to disk no longer requires making it read-only, which
allows us to write wired pages without causing all kinds of havoc.
- use a new PG_PAGEOUT flag to indicate that a page should be freed
on behalf of the pagedaemon when it's unlocked. this flag is very similar
to PG_RELEASED, but unlike PG_RELEASED, PG_PAGEOUT can be cleared if the
pageout fails due to eg. an indirect-block buffer being locked.
this allows us to remove the "version" field from struct vm_page,
and together with shrinking "loan_count" from 32 bits to 16,
struct vm_page is now 4 bytes smaller.
- no longer use PG_RELEASED for swap-backed pages. if the page is busy
because it's being paged out, we can't release the swap slot to be
reallocated until that write is complete, but unlike with vnodes we
don't keep a count of in-progress writes so there's no good way to
know when the write is done. instead, when we need to free a busy
swap-backed page, just sleep until we can get it busy ourselves.
- implement a fast-path for extending writes which allows us to avoid
zeroing new pages. this substantially reduces cpu usage.
- encapsulate the data used by the genfs code in a struct genfs_node,
which must be the first element of the filesystem-specific vnode data
for filesystems which use genfs_{get,put}pages().
- eliminate many of the UVM pagerops, since they aren't needed anymore
now that the pager "put" operation is a higher-level operation.
- enhance the genfs code to allow NFS to use the genfs_{get,put}pages
instead of a modified copy.
- clean up struct vnode by removing all the fields that used to be used by
the vfs_cluster.c code (which we don't use anymore with UBC).
- remove kmem_object and mb_object since they were useless.
instead of allocating pages to these objects, we now just allocate
pages with no object. such pages are mapped in the kernel until they
are freed, so we can use the mapping to find the page to free it.
this allows us to remove splvm() protection in several places.
The sum of all these changes improves write throughput on my
decstation 5000/200 to within 1% of the rate of NetBSD 1.5
and reduces the elapsed time for "make release" of a NetBSD 1.5
source tree on my 128MB pc to 10% less than a 1.5 kernel took.
2001-09-16 00:36:31 +04:00
|
|
|
vp->v_uobj.uo_npages == 0))
|
2005-02-27 01:31:44 +03:00
|
|
|
{
|
1998-03-01 05:20:01 +03:00
|
|
|
simple_unlock(&vp->v_interlock);
|
1997-06-11 13:33:37 +04:00
|
|
|
continue;
|
1998-03-01 05:20:01 +03:00
|
|
|
}
|
|
|
|
simple_unlock(&mntvnode_slock);
|
2003-06-29 22:43:21 +04:00
|
|
|
error = vget(vp, LK_EXCLUSIVE | LK_NOWAIT | LK_INTERLOCK);
|
1998-03-01 05:20:01 +03:00
|
|
|
if (error) {
|
|
|
|
simple_lock(&mntvnode_slock);
|
|
|
|
if (error == ENOENT)
|
|
|
|
goto loop;
|
1998-12-01 17:37:44 +03:00
|
|
|
continue;
|
1998-03-01 05:20:01 +03:00
|
|
|
}
|
2004-08-14 05:08:02 +04:00
|
|
|
if (vp->v_type == VREG && waitfor == MNT_LAZY)
|
|
|
|
error = VOP_UPDATE(vp, NULL, NULL, 0);
|
|
|
|
else
|
|
|
|
error = VOP_FSYNC(vp, cred,
|
|
|
|
waitfor == MNT_WAIT ? FSYNC_WAIT : 0, 0, 0, p);
|
|
|
|
if (error)
|
1997-06-11 13:33:37 +04:00
|
|
|
allerror = error;
|
1998-12-02 13:44:52 +03:00
|
|
|
vput(vp);
|
1998-03-01 05:20:01 +03:00
|
|
|
simple_lock(&mntvnode_slock);
|
1997-06-11 13:33:37 +04:00
|
|
|
}
|
1998-03-01 05:20:01 +03:00
|
|
|
simple_unlock(&mntvnode_slock);
|
1997-06-11 13:33:37 +04:00
|
|
|
/*
|
|
|
|
* Force stale file system control information to be flushed.
|
|
|
|
*/
|
2000-05-29 22:34:36 +04:00
|
|
|
if (waitfor != MNT_LAZY) {
|
|
|
|
vn_lock(ump->um_devvp, LK_EXCLUSIVE | LK_RETRY);
|
|
|
|
if ((error = VOP_FSYNC(ump->um_devvp, cred,
|
2003-06-30 02:28:00 +04:00
|
|
|
waitfor == MNT_WAIT ? FSYNC_WAIT : 0, 0, 0, p)) != 0)
|
2000-05-29 22:34:36 +04:00
|
|
|
allerror = error;
|
|
|
|
VOP_UNLOCK(ump->um_devvp, 0);
|
|
|
|
}
|
1998-03-01 05:20:01 +03:00
|
|
|
/*
|
|
|
|
* Write back modified superblock.
|
|
|
|
*/
|
|
|
|
if (fs->e2fs_fmod != 0) {
|
|
|
|
fs->e2fs_fmod = 0;
|
|
|
|
fs->e2fs.e2fs_wtime = time.tv_sec;
|
|
|
|
if ((error = ext2fs_cgupdate(ump, waitfor)))
|
|
|
|
allerror = error;
|
|
|
|
}
|
1997-06-11 13:33:37 +04:00
|
|
|
return (allerror);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Look up a EXT2FS dinode number to find its incore vnode, otherwise read it
|
|
|
|
* in from disk. If it is in core, wait for the lock bit to clear, then
|
|
|
|
* return the inode locked. Detection and handling of mount points must be
|
|
|
|
* done by the calling routine.
|
|
|
|
*/
|
|
|
|
int
|
2003-06-29 22:43:21 +04:00
|
|
|
ext2fs_vget(mp, ino, vpp)
|
1997-06-11 13:33:37 +04:00
|
|
|
struct mount *mp;
|
|
|
|
ino_t ino;
|
|
|
|
struct vnode **vpp;
|
|
|
|
{
|
1998-03-01 05:20:01 +03:00
|
|
|
struct m_ext2fs *fs;
|
|
|
|
struct inode *ip;
|
1997-06-11 13:33:37 +04:00
|
|
|
struct ufsmount *ump;
|
|
|
|
struct buf *bp;
|
|
|
|
struct vnode *vp;
|
|
|
|
dev_t dev;
|
|
|
|
int error;
|
1998-10-23 04:33:23 +04:00
|
|
|
caddr_t cp;
|
1997-06-11 13:33:37 +04:00
|
|
|
|
|
|
|
ump = VFSTOUFS(mp);
|
|
|
|
dev = ump->um_dev;
|
2000-07-01 00:45:38 +04:00
|
|
|
|
2003-06-29 22:43:21 +04:00
|
|
|
if ((*vpp = ufs_ihashget(dev, ino, LK_EXCLUSIVE)) != NULL)
|
2000-07-01 00:45:38 +04:00
|
|
|
return (0);
|
1997-06-11 13:33:37 +04:00
|
|
|
|
|
|
|
/* Allocate a new vnode/inode. */
|
|
|
|
if ((error = getnewvnode(VT_EXT2FS, mp, ext2fs_vnodeop_p, &vp)) != 0) {
|
|
|
|
*vpp = NULL;
|
|
|
|
return (error);
|
|
|
|
}
|
2000-07-01 00:45:38 +04:00
|
|
|
|
|
|
|
do {
|
2003-06-29 22:43:21 +04:00
|
|
|
if ((*vpp = ufs_ihashget(dev, ino, LK_EXCLUSIVE)) != NULL) {
|
2000-07-01 00:45:38 +04:00
|
|
|
ungetnewvnode(vp);
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
} while (lockmgr(&ufs_hashlock, LK_EXCLUSIVE|LK_SLEEPFAIL, 0));
|
|
|
|
|
2004-09-21 07:10:35 +04:00
|
|
|
vp->v_flag |= VLOCKSWORK;
|
|
|
|
|
1998-09-01 07:20:46 +04:00
|
|
|
ip = pool_get(&ext2fs_inode_pool, PR_WAITOK);
|
a whole bunch of changes to improve performance and robustness under load:
- remove special treatment of pager_map mappings in pmaps. this is
required now, since I've removed the globals that expose the address range.
pager_map now uses pmap_kenter_pa() instead of pmap_enter(), so there's
no longer any need to special-case it.
- eliminate struct uvm_vnode by moving its fields into struct vnode.
- rewrite the pageout path. the pager is now responsible for handling the
high-level requests instead of only getting control after a bunch of work
has already been done on its behalf. this will allow us to UBCify LFS,
which needs tighter control over its pages than other filesystems do.
writing a page to disk no longer requires making it read-only, which
allows us to write wired pages without causing all kinds of havoc.
- use a new PG_PAGEOUT flag to indicate that a page should be freed
on behalf of the pagedaemon when it's unlocked. this flag is very similar
to PG_RELEASED, but unlike PG_RELEASED, PG_PAGEOUT can be cleared if the
pageout fails due to eg. an indirect-block buffer being locked.
this allows us to remove the "version" field from struct vm_page,
and together with shrinking "loan_count" from 32 bits to 16,
struct vm_page is now 4 bytes smaller.
- no longer use PG_RELEASED for swap-backed pages. if the page is busy
because it's being paged out, we can't release the swap slot to be
reallocated until that write is complete, but unlike with vnodes we
don't keep a count of in-progress writes so there's no good way to
know when the write is done. instead, when we need to free a busy
swap-backed page, just sleep until we can get it busy ourselves.
- implement a fast-path for extending writes which allows us to avoid
zeroing new pages. this substantially reduces cpu usage.
- encapsulate the data used by the genfs code in a struct genfs_node,
which must be the first element of the filesystem-specific vnode data
for filesystems which use genfs_{get,put}pages().
- eliminate many of the UVM pagerops, since they aren't needed anymore
now that the pager "put" operation is a higher-level operation.
- enhance the genfs code to allow NFS to use the genfs_{get,put}pages
instead of a modified copy.
- clean up struct vnode by removing all the fields that used to be used by
the vfs_cluster.c code (which we don't use anymore with UBC).
- remove kmem_object and mb_object since they were useless.
instead of allocating pages to these objects, we now just allocate
pages with no object. such pages are mapped in the kernel until they
are freed, so we can use the mapping to find the page to free it.
this allows us to remove splvm() protection in several places.
The sum of all these changes improves write throughput on my
decstation 5000/200 to within 1% of the rate of NetBSD 1.5
and reduces the elapsed time for "make release" of a NetBSD 1.5
source tree on my 128MB pc to 10% less than a 1.5 kernel took.
2001-09-16 00:36:31 +04:00
|
|
|
memset(ip, 0, sizeof(struct inode));
|
1997-06-11 13:33:37 +04:00
|
|
|
vp->v_data = ip;
|
|
|
|
ip->i_vnode = vp;
|
2003-04-02 14:39:19 +04:00
|
|
|
ip->i_ump = ump;
|
1997-06-11 13:33:37 +04:00
|
|
|
ip->i_e2fs = fs = ump->um_e2fs;
|
|
|
|
ip->i_dev = dev;
|
|
|
|
ip->i_number = ino;
|
|
|
|
ip->i_e2fs_last_lblk = 0;
|
|
|
|
ip->i_e2fs_last_blk = 0;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Put it onto its hash chain and lock it so that other requests for
|
|
|
|
* this inode will block if they arrive while we are sleeping waiting
|
|
|
|
* for old data structures to be purged or for the contents of the
|
|
|
|
* disk portion of this inode to be read.
|
|
|
|
*/
|
a whole bunch of changes to improve performance and robustness under load:
- remove special treatment of pager_map mappings in pmaps. this is
required now, since I've removed the globals that expose the address range.
pager_map now uses pmap_kenter_pa() instead of pmap_enter(), so there's
no longer any need to special-case it.
- eliminate struct uvm_vnode by moving its fields into struct vnode.
- rewrite the pageout path. the pager is now responsible for handling the
high-level requests instead of only getting control after a bunch of work
has already been done on its behalf. this will allow us to UBCify LFS,
which needs tighter control over its pages than other filesystems do.
writing a page to disk no longer requires making it read-only, which
allows us to write wired pages without causing all kinds of havoc.
- use a new PG_PAGEOUT flag to indicate that a page should be freed
on behalf of the pagedaemon when it's unlocked. this flag is very similar
to PG_RELEASED, but unlike PG_RELEASED, PG_PAGEOUT can be cleared if the
pageout fails due to eg. an indirect-block buffer being locked.
this allows us to remove the "version" field from struct vm_page,
and together with shrinking "loan_count" from 32 bits to 16,
struct vm_page is now 4 bytes smaller.
- no longer use PG_RELEASED for swap-backed pages. if the page is busy
because it's being paged out, we can't release the swap slot to be
reallocated until that write is complete, but unlike with vnodes we
don't keep a count of in-progress writes so there's no good way to
know when the write is done. instead, when we need to free a busy
swap-backed page, just sleep until we can get it busy ourselves.
- implement a fast-path for extending writes which allows us to avoid
zeroing new pages. this substantially reduces cpu usage.
- encapsulate the data used by the genfs code in a struct genfs_node,
which must be the first element of the filesystem-specific vnode data
for filesystems which use genfs_{get,put}pages().
- eliminate many of the UVM pagerops, since they aren't needed anymore
now that the pager "put" operation is a higher-level operation.
- enhance the genfs code to allow NFS to use the genfs_{get,put}pages
instead of a modified copy.
- clean up struct vnode by removing all the fields that used to be used by
the vfs_cluster.c code (which we don't use anymore with UBC).
- remove kmem_object and mb_object since they were useless.
instead of allocating pages to these objects, we now just allocate
pages with no object. such pages are mapped in the kernel until they
are freed, so we can use the mapping to find the page to free it.
this allows us to remove splvm() protection in several places.
The sum of all these changes improves write throughput on my
decstation 5000/200 to within 1% of the rate of NetBSD 1.5
and reduces the elapsed time for "make release" of a NetBSD 1.5
source tree on my 128MB pc to 10% less than a 1.5 kernel took.
2001-09-16 00:36:31 +04:00
|
|
|
|
1997-06-11 13:33:37 +04:00
|
|
|
ufs_ihashins(ip);
|
1998-03-01 05:20:01 +03:00
|
|
|
lockmgr(&ufs_hashlock, LK_RELEASE, 0);
|
1997-06-11 13:33:37 +04:00
|
|
|
|
|
|
|
/* Read in the disk contents for the inode, copy into the inode. */
|
|
|
|
error = bread(ump->um_devvp, fsbtodb(fs, ino_to_fsba(fs, ino)),
|
|
|
|
(int)fs->e2fs_bsize, NOCRED, &bp);
|
|
|
|
if (error) {
|
a whole bunch of changes to improve performance and robustness under load:
- remove special treatment of pager_map mappings in pmaps. this is
required now, since I've removed the globals that expose the address range.
pager_map now uses pmap_kenter_pa() instead of pmap_enter(), so there's
no longer any need to special-case it.
- eliminate struct uvm_vnode by moving its fields into struct vnode.
- rewrite the pageout path. the pager is now responsible for handling the
high-level requests instead of only getting control after a bunch of work
has already been done on its behalf. this will allow us to UBCify LFS,
which needs tighter control over its pages than other filesystems do.
writing a page to disk no longer requires making it read-only, which
allows us to write wired pages without causing all kinds of havoc.
- use a new PG_PAGEOUT flag to indicate that a page should be freed
on behalf of the pagedaemon when it's unlocked. this flag is very similar
to PG_RELEASED, but unlike PG_RELEASED, PG_PAGEOUT can be cleared if the
pageout fails due to eg. an indirect-block buffer being locked.
this allows us to remove the "version" field from struct vm_page,
and together with shrinking "loan_count" from 32 bits to 16,
struct vm_page is now 4 bytes smaller.
- no longer use PG_RELEASED for swap-backed pages. if the page is busy
because it's being paged out, we can't release the swap slot to be
reallocated until that write is complete, but unlike with vnodes we
don't keep a count of in-progress writes so there's no good way to
know when the write is done. instead, when we need to free a busy
swap-backed page, just sleep until we can get it busy ourselves.
- implement a fast-path for extending writes which allows us to avoid
zeroing new pages. this substantially reduces cpu usage.
- encapsulate the data used by the genfs code in a struct genfs_node,
which must be the first element of the filesystem-specific vnode data
for filesystems which use genfs_{get,put}pages().
- eliminate many of the UVM pagerops, since they aren't needed anymore
now that the pager "put" operation is a higher-level operation.
- enhance the genfs code to allow NFS to use the genfs_{get,put}pages
instead of a modified copy.
- clean up struct vnode by removing all the fields that used to be used by
the vfs_cluster.c code (which we don't use anymore with UBC).
- remove kmem_object and mb_object since they were useless.
instead of allocating pages to these objects, we now just allocate
pages with no object. such pages are mapped in the kernel until they
are freed, so we can use the mapping to find the page to free it.
this allows us to remove splvm() protection in several places.
The sum of all these changes improves write throughput on my
decstation 5000/200 to within 1% of the rate of NetBSD 1.5
and reduces the elapsed time for "make release" of a NetBSD 1.5
source tree on my 128MB pc to 10% less than a 1.5 kernel took.
2001-09-16 00:36:31 +04:00
|
|
|
|
1997-06-11 13:33:37 +04:00
|
|
|
/*
|
|
|
|
* The inode does not contain anything useful, so it would
|
|
|
|
* be misleading to leave it on its hash chain. With mode
|
|
|
|
* still zero, it will be unlinked and returned to the free
|
|
|
|
* list by vput().
|
|
|
|
*/
|
a whole bunch of changes to improve performance and robustness under load:
- remove special treatment of pager_map mappings in pmaps. this is
required now, since I've removed the globals that expose the address range.
pager_map now uses pmap_kenter_pa() instead of pmap_enter(), so there's
no longer any need to special-case it.
- eliminate struct uvm_vnode by moving its fields into struct vnode.
- rewrite the pageout path. the pager is now responsible for handling the
high-level requests instead of only getting control after a bunch of work
has already been done on its behalf. this will allow us to UBCify LFS,
which needs tighter control over its pages than other filesystems do.
writing a page to disk no longer requires making it read-only, which
allows us to write wired pages without causing all kinds of havoc.
- use a new PG_PAGEOUT flag to indicate that a page should be freed
on behalf of the pagedaemon when it's unlocked. this flag is very similar
to PG_RELEASED, but unlike PG_RELEASED, PG_PAGEOUT can be cleared if the
pageout fails due to eg. an indirect-block buffer being locked.
this allows us to remove the "version" field from struct vm_page,
and together with shrinking "loan_count" from 32 bits to 16,
struct vm_page is now 4 bytes smaller.
- no longer use PG_RELEASED for swap-backed pages. if the page is busy
because it's being paged out, we can't release the swap slot to be
reallocated until that write is complete, but unlike with vnodes we
don't keep a count of in-progress writes so there's no good way to
know when the write is done. instead, when we need to free a busy
swap-backed page, just sleep until we can get it busy ourselves.
- implement a fast-path for extending writes which allows us to avoid
zeroing new pages. this substantially reduces cpu usage.
- encapsulate the data used by the genfs code in a struct genfs_node,
which must be the first element of the filesystem-specific vnode data
for filesystems which use genfs_{get,put}pages().
- eliminate many of the UVM pagerops, since they aren't needed anymore
now that the pager "put" operation is a higher-level operation.
- enhance the genfs code to allow NFS to use the genfs_{get,put}pages
instead of a modified copy.
- clean up struct vnode by removing all the fields that used to be used by
the vfs_cluster.c code (which we don't use anymore with UBC).
- remove kmem_object and mb_object since they were useless.
instead of allocating pages to these objects, we now just allocate
pages with no object. such pages are mapped in the kernel until they
are freed, so we can use the mapping to find the page to free it.
this allows us to remove splvm() protection in several places.
The sum of all these changes improves write throughput on my
decstation 5000/200 to within 1% of the rate of NetBSD 1.5
and reduces the elapsed time for "make release" of a NetBSD 1.5
source tree on my 128MB pc to 10% less than a 1.5 kernel took.
2001-09-16 00:36:31 +04:00
|
|
|
|
1997-06-11 13:33:37 +04:00
|
|
|
vput(vp);
|
|
|
|
brelse(bp);
|
|
|
|
*vpp = NULL;
|
|
|
|
return (error);
|
|
|
|
}
|
1998-10-23 04:33:23 +04:00
|
|
|
cp = (caddr_t)bp->b_data +
|
|
|
|
(ino_to_fsbo(fs, ino) * EXT2_DINODE_SIZE);
|
2003-04-05 18:01:56 +04:00
|
|
|
ip->i_din.e2fs_din = pool_get(&ext2fs_dinode_pool, PR_WAITOK);
|
2003-04-02 14:39:19 +04:00
|
|
|
e2fs_iload((struct ext2fs_dinode *)cp, ip->i_din.e2fs_din);
|
1997-06-11 13:33:37 +04:00
|
|
|
brelse(bp);
|
|
|
|
|
1997-10-23 15:41:16 +04:00
|
|
|
/* If the inode was deleted, reset all fields */
|
|
|
|
if (ip->i_e2fs_dtime != 0) {
|
2005-02-10 02:02:10 +03:00
|
|
|
ip->i_e2fs_mode = ip->i_e2fs_nblock = 0;
|
|
|
|
(void)ext2fs_setsize(ip, 0);
|
1998-08-10 00:15:38 +04:00
|
|
|
memset(ip->i_e2fs_blocks, 0, sizeof(ip->i_e2fs_blocks));
|
1997-10-23 15:41:16 +04:00
|
|
|
}
|
|
|
|
|
1997-06-11 13:33:37 +04:00
|
|
|
/*
|
|
|
|
* Initialize the vnode from the inode, check for aliases.
|
|
|
|
* Note that the underlying vnode may have changed.
|
|
|
|
*/
|
a whole bunch of changes to improve performance and robustness under load:
- remove special treatment of pager_map mappings in pmaps. this is
required now, since I've removed the globals that expose the address range.
pager_map now uses pmap_kenter_pa() instead of pmap_enter(), so there's
no longer any need to special-case it.
- eliminate struct uvm_vnode by moving its fields into struct vnode.
- rewrite the pageout path. the pager is now responsible for handling the
high-level requests instead of only getting control after a bunch of work
has already been done on its behalf. this will allow us to UBCify LFS,
which needs tighter control over its pages than other filesystems do.
writing a page to disk no longer requires making it read-only, which
allows us to write wired pages without causing all kinds of havoc.
- use a new PG_PAGEOUT flag to indicate that a page should be freed
on behalf of the pagedaemon when it's unlocked. this flag is very similar
to PG_RELEASED, but unlike PG_RELEASED, PG_PAGEOUT can be cleared if the
pageout fails due to eg. an indirect-block buffer being locked.
this allows us to remove the "version" field from struct vm_page,
and together with shrinking "loan_count" from 32 bits to 16,
struct vm_page is now 4 bytes smaller.
- no longer use PG_RELEASED for swap-backed pages. if the page is busy
because it's being paged out, we can't release the swap slot to be
reallocated until that write is complete, but unlike with vnodes we
don't keep a count of in-progress writes so there's no good way to
know when the write is done. instead, when we need to free a busy
swap-backed page, just sleep until we can get it busy ourselves.
- implement a fast-path for extending writes which allows us to avoid
zeroing new pages. this substantially reduces cpu usage.
- encapsulate the data used by the genfs code in a struct genfs_node,
which must be the first element of the filesystem-specific vnode data
for filesystems which use genfs_{get,put}pages().
- eliminate many of the UVM pagerops, since they aren't needed anymore
now that the pager "put" operation is a higher-level operation.
- enhance the genfs code to allow NFS to use the genfs_{get,put}pages
instead of a modified copy.
- clean up struct vnode by removing all the fields that used to be used by
the vfs_cluster.c code (which we don't use anymore with UBC).
- remove kmem_object and mb_object since they were useless.
instead of allocating pages to these objects, we now just allocate
pages with no object. such pages are mapped in the kernel until they
are freed, so we can use the mapping to find the page to free it.
this allows us to remove splvm() protection in several places.
The sum of all these changes improves write throughput on my
decstation 5000/200 to within 1% of the rate of NetBSD 1.5
and reduces the elapsed time for "make release" of a NetBSD 1.5
source tree on my 128MB pc to 10% less than a 1.5 kernel took.
2001-09-16 00:36:31 +04:00
|
|
|
|
1998-06-25 00:58:44 +04:00
|
|
|
error = ext2fs_vinit(mp, ext2fs_specop_p, ext2fs_fifoop_p, &vp);
|
1997-06-11 13:33:37 +04:00
|
|
|
if (error) {
|
|
|
|
vput(vp);
|
|
|
|
*vpp = NULL;
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Finish inode initialization now that aliasing has been resolved.
|
|
|
|
*/
|
a whole bunch of changes to improve performance and robustness under load:
- remove special treatment of pager_map mappings in pmaps. this is
required now, since I've removed the globals that expose the address range.
pager_map now uses pmap_kenter_pa() instead of pmap_enter(), so there's
no longer any need to special-case it.
- eliminate struct uvm_vnode by moving its fields into struct vnode.
- rewrite the pageout path. the pager is now responsible for handling the
high-level requests instead of only getting control after a bunch of work
has already been done on its behalf. this will allow us to UBCify LFS,
which needs tighter control over its pages than other filesystems do.
writing a page to disk no longer requires making it read-only, which
allows us to write wired pages without causing all kinds of havoc.
- use a new PG_PAGEOUT flag to indicate that a page should be freed
on behalf of the pagedaemon when it's unlocked. this flag is very similar
to PG_RELEASED, but unlike PG_RELEASED, PG_PAGEOUT can be cleared if the
pageout fails due to eg. an indirect-block buffer being locked.
this allows us to remove the "version" field from struct vm_page,
and together with shrinking "loan_count" from 32 bits to 16,
struct vm_page is now 4 bytes smaller.
- no longer use PG_RELEASED for swap-backed pages. if the page is busy
because it's being paged out, we can't release the swap slot to be
reallocated until that write is complete, but unlike with vnodes we
don't keep a count of in-progress writes so there's no good way to
know when the write is done. instead, when we need to free a busy
swap-backed page, just sleep until we can get it busy ourselves.
- implement a fast-path for extending writes which allows us to avoid
zeroing new pages. this substantially reduces cpu usage.
- encapsulate the data used by the genfs code in a struct genfs_node,
which must be the first element of the filesystem-specific vnode data
for filesystems which use genfs_{get,put}pages().
- eliminate many of the UVM pagerops, since they aren't needed anymore
now that the pager "put" operation is a higher-level operation.
- enhance the genfs code to allow NFS to use the genfs_{get,put}pages
instead of a modified copy.
- clean up struct vnode by removing all the fields that used to be used by
the vfs_cluster.c code (which we don't use anymore with UBC).
- remove kmem_object and mb_object since they were useless.
instead of allocating pages to these objects, we now just allocate
pages with no object. such pages are mapped in the kernel until they
are freed, so we can use the mapping to find the page to free it.
this allows us to remove splvm() protection in several places.
The sum of all these changes improves write throughput on my
decstation 5000/200 to within 1% of the rate of NetBSD 1.5
and reduces the elapsed time for "make release" of a NetBSD 1.5
source tree on my 128MB pc to 10% less than a 1.5 kernel took.
2001-09-16 00:36:31 +04:00
|
|
|
|
|
|
|
genfs_node_init(vp, &ext2fs_genfsops);
|
1997-06-11 13:33:37 +04:00
|
|
|
ip->i_devvp = ump->um_devvp;
|
|
|
|
VREF(ip->i_devvp);
|
a whole bunch of changes to improve performance and robustness under load:
- remove special treatment of pager_map mappings in pmaps. this is
required now, since I've removed the globals that expose the address range.
pager_map now uses pmap_kenter_pa() instead of pmap_enter(), so there's
no longer any need to special-case it.
- eliminate struct uvm_vnode by moving its fields into struct vnode.
- rewrite the pageout path. the pager is now responsible for handling the
high-level requests instead of only getting control after a bunch of work
has already been done on its behalf. this will allow us to UBCify LFS,
which needs tighter control over its pages than other filesystems do.
writing a page to disk no longer requires making it read-only, which
allows us to write wired pages without causing all kinds of havoc.
- use a new PG_PAGEOUT flag to indicate that a page should be freed
on behalf of the pagedaemon when it's unlocked. this flag is very similar
to PG_RELEASED, but unlike PG_RELEASED, PG_PAGEOUT can be cleared if the
pageout fails due to eg. an indirect-block buffer being locked.
this allows us to remove the "version" field from struct vm_page,
and together with shrinking "loan_count" from 32 bits to 16,
struct vm_page is now 4 bytes smaller.
- no longer use PG_RELEASED for swap-backed pages. if the page is busy
because it's being paged out, we can't release the swap slot to be
reallocated until that write is complete, but unlike with vnodes we
don't keep a count of in-progress writes so there's no good way to
know when the write is done. instead, when we need to free a busy
swap-backed page, just sleep until we can get it busy ourselves.
- implement a fast-path for extending writes which allows us to avoid
zeroing new pages. this substantially reduces cpu usage.
- encapsulate the data used by the genfs code in a struct genfs_node,
which must be the first element of the filesystem-specific vnode data
for filesystems which use genfs_{get,put}pages().
- eliminate many of the UVM pagerops, since they aren't needed anymore
now that the pager "put" operation is a higher-level operation.
- enhance the genfs code to allow NFS to use the genfs_{get,put}pages
instead of a modified copy.
- clean up struct vnode by removing all the fields that used to be used by
the vfs_cluster.c code (which we don't use anymore with UBC).
- remove kmem_object and mb_object since they were useless.
instead of allocating pages to these objects, we now just allocate
pages with no object. such pages are mapped in the kernel until they
are freed, so we can use the mapping to find the page to free it.
this allows us to remove splvm() protection in several places.
The sum of all these changes improves write throughput on my
decstation 5000/200 to within 1% of the rate of NetBSD 1.5
and reduces the elapsed time for "make release" of a NetBSD 1.5
source tree on my 128MB pc to 10% less than a 1.5 kernel took.
2001-09-16 00:36:31 +04:00
|
|
|
|
1997-06-11 13:33:37 +04:00
|
|
|
/*
|
|
|
|
* Set up a generation number for this inode if it does not
|
|
|
|
* already have one. This should only happen on old filesystems.
|
|
|
|
*/
|
a whole bunch of changes to improve performance and robustness under load:
- remove special treatment of pager_map mappings in pmaps. this is
required now, since I've removed the globals that expose the address range.
pager_map now uses pmap_kenter_pa() instead of pmap_enter(), so there's
no longer any need to special-case it.
- eliminate struct uvm_vnode by moving its fields into struct vnode.
- rewrite the pageout path. the pager is now responsible for handling the
high-level requests instead of only getting control after a bunch of work
has already been done on its behalf. this will allow us to UBCify LFS,
which needs tighter control over its pages than other filesystems do.
writing a page to disk no longer requires making it read-only, which
allows us to write wired pages without causing all kinds of havoc.
- use a new PG_PAGEOUT flag to indicate that a page should be freed
on behalf of the pagedaemon when it's unlocked. this flag is very similar
to PG_RELEASED, but unlike PG_RELEASED, PG_PAGEOUT can be cleared if the
pageout fails due to eg. an indirect-block buffer being locked.
this allows us to remove the "version" field from struct vm_page,
and together with shrinking "loan_count" from 32 bits to 16,
struct vm_page is now 4 bytes smaller.
- no longer use PG_RELEASED for swap-backed pages. if the page is busy
because it's being paged out, we can't release the swap slot to be
reallocated until that write is complete, but unlike with vnodes we
don't keep a count of in-progress writes so there's no good way to
know when the write is done. instead, when we need to free a busy
swap-backed page, just sleep until we can get it busy ourselves.
- implement a fast-path for extending writes which allows us to avoid
zeroing new pages. this substantially reduces cpu usage.
- encapsulate the data used by the genfs code in a struct genfs_node,
which must be the first element of the filesystem-specific vnode data
for filesystems which use genfs_{get,put}pages().
- eliminate many of the UVM pagerops, since they aren't needed anymore
now that the pager "put" operation is a higher-level operation.
- enhance the genfs code to allow NFS to use the genfs_{get,put}pages
instead of a modified copy.
- clean up struct vnode by removing all the fields that used to be used by
the vfs_cluster.c code (which we don't use anymore with UBC).
- remove kmem_object and mb_object since they were useless.
instead of allocating pages to these objects, we now just allocate
pages with no object. such pages are mapped in the kernel until they
are freed, so we can use the mapping to find the page to free it.
this allows us to remove splvm() protection in several places.
The sum of all these changes improves write throughput on my
decstation 5000/200 to within 1% of the rate of NetBSD 1.5
and reduces the elapsed time for "make release" of a NetBSD 1.5
source tree on my 128MB pc to 10% less than a 1.5 kernel took.
2001-09-16 00:36:31 +04:00
|
|
|
|
1997-06-11 13:33:37 +04:00
|
|
|
if (ip->i_e2fs_gen == 0) {
|
|
|
|
if (++ext2gennumber < (u_long)time.tv_sec)
|
|
|
|
ext2gennumber = time.tv_sec;
|
|
|
|
ip->i_e2fs_gen = ext2gennumber;
|
|
|
|
if ((vp->v_mount->mnt_flag & MNT_RDONLY) == 0)
|
|
|
|
ip->i_flag |= IN_MODIFIED;
|
|
|
|
}
|
2005-02-10 02:02:10 +03:00
|
|
|
vp->v_size = ext2fs_size(ip);
|
1997-06-11 13:33:37 +04:00
|
|
|
*vpp = vp;
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* File handle to vnode
|
|
|
|
*
|
|
|
|
* Have to be really careful about stale file handles:
|
|
|
|
* - check that the inode number is valid
|
|
|
|
* - call ext2fs_vget() to get the locked inode
|
|
|
|
* - check for an unallocated inode (i_mode == 0)
|
|
|
|
*/
|
|
|
|
int
|
2003-06-29 22:43:21 +04:00
|
|
|
ext2fs_fhtovp(mp, fhp, vpp)
|
2000-03-30 16:41:09 +04:00
|
|
|
struct mount *mp;
|
1997-06-11 13:33:37 +04:00
|
|
|
struct fid *fhp;
|
|
|
|
struct vnode **vpp;
|
|
|
|
{
|
2000-03-30 16:41:09 +04:00
|
|
|
struct inode *ip;
|
1999-02-27 02:44:43 +03:00
|
|
|
struct vnode *nvp;
|
|
|
|
int error;
|
2000-03-30 16:41:09 +04:00
|
|
|
struct ufid *ufhp;
|
1997-06-11 13:33:37 +04:00
|
|
|
struct m_ext2fs *fs;
|
|
|
|
|
|
|
|
ufhp = (struct ufid *)fhp;
|
|
|
|
fs = VFSTOUFS(mp)->um_e2fs;
|
|
|
|
if ((ufhp->ufid_ino < EXT2_FIRSTINO && ufhp->ufid_ino != EXT2_ROOTINO) ||
|
|
|
|
ufhp->ufid_ino >= fs->e2fs_ncg * fs->e2fs.e2fs_ipg)
|
|
|
|
return (ESTALE);
|
1999-02-27 02:44:43 +03:00
|
|
|
|
2003-06-29 22:43:21 +04:00
|
|
|
if ((error = VFS_VGET(mp, ufhp->ufid_ino, &nvp)) != 0) {
|
1999-02-27 02:44:43 +03:00
|
|
|
*vpp = NULLVP;
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
ip = VTOI(nvp);
|
2005-02-27 01:31:44 +03:00
|
|
|
if (ip->i_e2fs_mode == 0 || ip->i_e2fs_dtime != 0 ||
|
1999-02-27 02:44:43 +03:00
|
|
|
ip->i_e2fs_gen != ufhp->ufid_gen) {
|
|
|
|
vput(nvp);
|
|
|
|
*vpp = NULLVP;
|
|
|
|
return (ESTALE);
|
|
|
|
}
|
|
|
|
*vpp = nvp;
|
|
|
|
return (0);
|
1997-06-11 13:33:37 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Vnode pointer to File handle
|
|
|
|
*/
|
|
|
|
/* ARGSUSED */
|
|
|
|
int
|
|
|
|
ext2fs_vptofh(vp, fhp)
|
|
|
|
struct vnode *vp;
|
|
|
|
struct fid *fhp;
|
|
|
|
{
|
2000-03-30 16:41:09 +04:00
|
|
|
struct inode *ip;
|
|
|
|
struct ufid *ufhp;
|
1997-06-11 13:33:37 +04:00
|
|
|
|
|
|
|
ip = VTOI(vp);
|
|
|
|
ufhp = (struct ufid *)fhp;
|
|
|
|
ufhp->ufid_len = sizeof(struct ufid);
|
|
|
|
ufhp->ufid_ino = ip->i_number;
|
|
|
|
ufhp->ufid_gen = ip->i_e2fs_gen;
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
SYSCTL_SETUP(sysctl_vfs_ext2fs_setup, "sysctl vfs.ext2fs subtree setup")
|
1998-03-01 05:20:01 +03:00
|
|
|
{
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
CTLTYPE_NODE, "vfs", NULL,
|
|
|
|
NULL, 0, NULL, 0,
|
|
|
|
CTL_VFS, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
2004-05-25 08:44:43 +04:00
|
|
|
CTLTYPE_NODE, "ext2fs",
|
|
|
|
SYSCTL_DESCR("Linux EXT2FS file system"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, NULL, 0,
|
|
|
|
CTL_VFS, 17, CTL_EOL);
|
|
|
|
/*
|
|
|
|
* XXX the "17" above could be dynamic, thereby eliminating
|
|
|
|
* one more instance of the "number to vfs" mapping problem,
|
|
|
|
* but "17" is the order as taken from sys/mount.h
|
|
|
|
*/
|
1998-03-01 05:20:01 +03:00
|
|
|
}
|
|
|
|
|
1997-06-11 13:33:37 +04:00
|
|
|
/*
|
|
|
|
* Write a superblock and associated information back to disk.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
ext2fs_sbupdate(mp, waitfor)
|
|
|
|
struct ufsmount *mp;
|
|
|
|
int waitfor;
|
|
|
|
{
|
2000-03-30 16:41:09 +04:00
|
|
|
struct m_ext2fs *fs = mp->um_e2fs;
|
|
|
|
struct buf *bp;
|
1997-06-11 13:33:37 +04:00
|
|
|
int error = 0;
|
|
|
|
|
|
|
|
bp = getblk(mp->um_devvp, SBLOCK, SBSIZE, 0, 0);
|
1997-10-09 19:42:19 +04:00
|
|
|
e2fs_sbsave(&fs->e2fs, (struct ext2fs*)bp->b_data);
|
1997-06-11 13:33:37 +04:00
|
|
|
if (waitfor == MNT_WAIT)
|
|
|
|
error = bwrite(bp);
|
|
|
|
else
|
|
|
|
bawrite(bp);
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
ext2fs_cgupdate(mp, waitfor)
|
|
|
|
struct ufsmount *mp;
|
|
|
|
int waitfor;
|
|
|
|
{
|
2000-03-30 16:41:09 +04:00
|
|
|
struct m_ext2fs *fs = mp->um_e2fs;
|
|
|
|
struct buf *bp;
|
1997-06-11 13:33:37 +04:00
|
|
|
int i, error = 0, allerror = 0;
|
|
|
|
|
|
|
|
allerror = ext2fs_sbupdate(mp, waitfor);
|
|
|
|
for (i = 0; i < fs->e2fs_ngdb; i++) {
|
|
|
|
bp = getblk(mp->um_devvp, fsbtodb(fs, ((fs->e2fs_bsize>1024)?0:1)+i+1),
|
|
|
|
fs->e2fs_bsize, 0, 0);
|
1997-10-09 19:42:19 +04:00
|
|
|
e2fs_cgsave(&fs->e2fs_gd[i* fs->e2fs_bsize / sizeof(struct ext2_gd)],
|
|
|
|
(struct ext2_gd*)bp->b_data, fs->e2fs_bsize);
|
1997-06-11 13:33:37 +04:00
|
|
|
if (waitfor == MNT_WAIT)
|
|
|
|
error = bwrite(bp);
|
|
|
|
else
|
|
|
|
bawrite(bp);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!allerror && error)
|
|
|
|
allerror = error;
|
|
|
|
return (allerror);
|
|
|
|
}
|
2000-01-26 19:21:31 +03:00
|
|
|
|
|
|
|
static int
|
|
|
|
ext2fs_checksb(fs, ronly)
|
|
|
|
struct ext2fs *fs;
|
|
|
|
int ronly;
|
|
|
|
{
|
|
|
|
if (fs2h16(fs->e2fs_magic) != E2FS_MAGIC) {
|
2005-01-09 12:27:17 +03:00
|
|
|
return (EINVAL); /* XXX needs translation */
|
2000-01-26 19:21:31 +03:00
|
|
|
}
|
|
|
|
if (fs2h32(fs->e2fs_rev) > E2FS_REV1) {
|
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
printf("Ext2 fs: unsupported revision number: %x\n",
|
|
|
|
fs2h32(fs->e2fs_rev));
|
|
|
|
#endif
|
2005-01-09 12:27:17 +03:00
|
|
|
return (EINVAL); /* XXX needs translation */
|
2000-01-26 19:21:31 +03:00
|
|
|
}
|
|
|
|
if (fs2h32(fs->e2fs_log_bsize) > 2) { /* block size = 1024|2048|4096 */
|
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
printf("Ext2 fs: bad block size: %d (expected <=2 for ext2 fs)\n",
|
|
|
|
fs2h32(fs->e2fs_log_bsize));
|
|
|
|
#endif
|
2005-01-09 12:27:17 +03:00
|
|
|
return (EINVAL); /* XXX needs translation */
|
2000-01-26 19:21:31 +03:00
|
|
|
}
|
|
|
|
if (fs2h32(fs->e2fs_rev) > E2FS_REV0) {
|
2000-01-31 14:34:55 +03:00
|
|
|
if (fs2h32(fs->e2fs_first_ino) != EXT2_FIRSTINO ||
|
|
|
|
fs2h16(fs->e2fs_inode_size) != EXT2_DINODE_SIZE) {
|
|
|
|
printf("Ext2 fs: unsupported inode size\n");
|
|
|
|
return (EINVAL); /* XXX needs translation */
|
|
|
|
}
|
2000-01-26 19:21:31 +03:00
|
|
|
if (fs2h32(fs->e2fs_features_incompat) &
|
|
|
|
~EXT2F_INCOMPAT_SUPP) {
|
2004-05-02 10:59:20 +04:00
|
|
|
printf("Ext2 fs: unsupported optional feature\n");
|
2000-01-31 14:34:55 +03:00
|
|
|
return (EINVAL); /* XXX needs translation */
|
2000-01-26 19:21:31 +03:00
|
|
|
}
|
|
|
|
if (!ronly && fs2h32(fs->e2fs_features_rocompat) &
|
|
|
|
~EXT2F_ROCOMPAT_SUPP) {
|
|
|
|
return (EROFS); /* XXX needs translation */
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return (0);
|
|
|
|
}
|