1995-11-05 23:25:12 +00:00
|
|
|
/*
|
|
|
|
* modified for EXT2FS support in Lites 1.1
|
|
|
|
*
|
|
|
|
* Aug 1995, Godmar Back (gback@cs.utah.edu)
|
|
|
|
* University of Utah, Department of Computer Science
|
|
|
|
*/
|
|
|
|
/*
|
|
|
|
* 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
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
* @(#)ffs_vfsops.c 8.8 (Berkeley) 4/18/94
|
2002-03-23 13:48:10 +00:00
|
|
|
* $FreeBSD$
|
1995-11-05 23:25:12 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/systm.h>
|
|
|
|
#include <sys/namei.h>
|
|
|
|
#include <sys/proc.h>
|
|
|
|
#include <sys/kernel.h>
|
|
|
|
#include <sys/vnode.h>
|
|
|
|
#include <sys/mount.h>
|
2000-05-05 09:59:14 +00:00
|
|
|
#include <sys/bio.h>
|
1995-11-05 23:25:12 +00:00
|
|
|
#include <sys/buf.h>
|
1997-09-28 02:23:10 +00:00
|
|
|
#include <sys/conf.h>
|
1997-03-23 03:37:54 +00:00
|
|
|
#include <sys/fcntl.h>
|
1995-11-05 23:25:12 +00:00
|
|
|
#include <sys/malloc.h>
|
|
|
|
#include <sys/stat.h>
|
2001-01-24 12:35:55 +00:00
|
|
|
#include <sys/mutex.h>
|
2000-10-04 01:29:17 +00:00
|
|
|
|
2002-05-16 19:08:03 +00:00
|
|
|
#include <gnu/ext2fs/ext2_mount.h>
|
|
|
|
#include <gnu/ext2fs/inode.h>
|
1999-12-15 23:02:35 +00:00
|
|
|
|
1995-11-05 23:25:12 +00:00
|
|
|
#include <gnu/ext2fs/fs.h>
|
|
|
|
#include <gnu/ext2fs/ext2_extern.h>
|
|
|
|
#include <gnu/ext2fs/ext2_fs.h>
|
|
|
|
#include <gnu/ext2fs/ext2_fs_sb.h>
|
|
|
|
|
2002-03-19 22:40:48 +00:00
|
|
|
static int ext2_fhtovp(struct mount *, struct fid *, struct vnode **);
|
|
|
|
static int ext2_flushfiles(struct mount *mp, int flags, struct thread *td);
|
2002-05-16 19:08:03 +00:00
|
|
|
static int ext2_init(struct vfsconf *);
|
2002-05-24 17:38:01 +00:00
|
|
|
static int ext2_mount(struct mount *, struct nameidata *, struct thread *);
|
2002-03-19 22:40:48 +00:00
|
|
|
static int ext2_mountfs(struct vnode *, struct mount *, struct thread *);
|
|
|
|
static int ext2_reload(struct mount *mountp, struct ucred *cred,
|
|
|
|
struct thread *td);
|
2002-05-16 19:08:03 +00:00
|
|
|
static int ext2_root(struct mount *, struct vnode **vpp);
|
|
|
|
static int ext2_sbupdate(struct ext2mount *, int);
|
2002-03-19 22:40:48 +00:00
|
|
|
static int ext2_statfs(struct mount *, struct statfs *, struct thread *);
|
|
|
|
static int ext2_sync(struct mount *, int, struct ucred *, struct thread *);
|
2002-05-18 22:18:17 +00:00
|
|
|
static int ext2_uninit(struct vfsconf *);
|
2002-03-19 22:40:48 +00:00
|
|
|
static int ext2_unmount(struct mount *, int, struct thread *);
|
|
|
|
static int ext2_vget(struct mount *, ino_t, int, struct vnode **);
|
|
|
|
static int ext2_vptofh(struct vnode *, struct fid *);
|
1995-11-05 23:25:12 +00:00
|
|
|
|
2002-05-16 19:08:03 +00:00
|
|
|
MALLOC_DEFINE(M_EXT2NODE, "EXT2 node", "EXT2 vnode private part");
|
|
|
|
static MALLOC_DEFINE(M_EXT2MNT, "EXT2 mount", "EXT2 mount structure");
|
1997-10-10 18:13:06 +00:00
|
|
|
|
1995-12-17 21:14:36 +00:00
|
|
|
static struct vfsops ext2fs_vfsops = {
|
2002-05-24 17:38:01 +00:00
|
|
|
NULL,
|
2002-05-16 19:08:03 +00:00
|
|
|
vfs_stdstart,
|
1995-11-05 23:25:12 +00:00
|
|
|
ext2_unmount,
|
2002-05-16 19:08:03 +00:00
|
|
|
ext2_root, /* root inode via vget */
|
|
|
|
vfs_stdquotactl,
|
1995-11-05 23:25:12 +00:00
|
|
|
ext2_statfs,
|
|
|
|
ext2_sync,
|
|
|
|
ext2_vget,
|
|
|
|
ext2_fhtovp,
|
2001-04-25 07:07:52 +00:00
|
|
|
vfs_stdcheckexp,
|
1995-11-05 23:25:12 +00:00
|
|
|
ext2_vptofh,
|
|
|
|
ext2_init,
|
2002-05-18 22:18:17 +00:00
|
|
|
ext2_uninit,
|
1999-12-19 06:08:07 +00:00
|
|
|
vfs_stdextattrctl,
|
2002-05-24 17:38:01 +00:00
|
|
|
ext2_mount,
|
1995-11-05 23:25:12 +00:00
|
|
|
};
|
|
|
|
|
1998-09-07 13:17:06 +00:00
|
|
|
VFS_SET(ext2fs_vfsops, ext2fs, 0);
|
1995-11-05 23:25:12 +00:00
|
|
|
#define bsd_malloc malloc
|
|
|
|
#define bsd_free free
|
|
|
|
|
1995-12-17 21:14:36 +00:00
|
|
|
static int ext2fs_inode_hash_lock;
|
1995-11-05 23:25:12 +00:00
|
|
|
|
2002-03-23 13:10:13 +00:00
|
|
|
static int ext2_check_sb_compat(struct ext2_super_block *es, dev_t dev,
|
|
|
|
int ronly);
|
2002-03-19 22:40:48 +00:00
|
|
|
static int compute_sb_data(struct vnode * devvp,
|
2002-03-23 13:10:13 +00:00
|
|
|
struct ext2_super_block * es, struct ext2_sb_info * fs);
|
1996-06-12 05:11:41 +00:00
|
|
|
|
|
|
|
#ifdef notyet
|
2002-03-19 22:40:48 +00:00
|
|
|
static int ext2_mountroot(void);
|
1996-06-12 05:11:41 +00:00
|
|
|
|
1995-11-05 23:25:12 +00:00
|
|
|
/*
|
1996-06-12 05:11:41 +00:00
|
|
|
* Called by main() when ext2fs is going to be mounted as root.
|
1995-11-05 23:25:12 +00:00
|
|
|
*
|
|
|
|
* Name is updated by mount(8) after booting.
|
|
|
|
*/
|
|
|
|
#define ROOTNAME "root_device"
|
|
|
|
|
1995-12-17 21:14:36 +00:00
|
|
|
static int
|
1995-11-05 23:25:12 +00:00
|
|
|
ext2_mountroot()
|
|
|
|
{
|
2002-05-16 19:43:28 +00:00
|
|
|
struct ext2_sb_info *fs;
|
|
|
|
struct mount *mp;
|
2001-09-12 08:38:13 +00:00
|
|
|
struct thread *td = curthread;
|
2002-05-16 19:08:03 +00:00
|
|
|
struct ext2mount *ump;
|
1995-11-05 23:25:12 +00:00
|
|
|
u_int size;
|
|
|
|
int error;
|
|
|
|
|
1997-09-07 16:21:11 +00:00
|
|
|
if ((error = bdevvp(rootdev, &rootvp))) {
|
1999-11-01 23:57:28 +00:00
|
|
|
printf("ext2_mountroot: can't find rootvp\n");
|
1997-09-07 16:21:11 +00:00
|
|
|
return (error);
|
|
|
|
}
|
2003-02-19 05:47:46 +00:00
|
|
|
mp = bsd_malloc((u_long)sizeof(struct mount), M_MOUNT, M_WAITOK);
|
1995-11-05 23:25:12 +00:00
|
|
|
bzero((char *)mp, (u_long)sizeof(struct mount));
|
2001-10-23 01:21:29 +00:00
|
|
|
TAILQ_INIT(&mp->mnt_nvnodelist);
|
2001-11-04 18:55:42 +00:00
|
|
|
TAILQ_INIT(&mp->mnt_reservedvnlist);
|
1995-11-05 23:25:12 +00:00
|
|
|
mp->mnt_op = &ext2fs_vfsops;
|
|
|
|
mp->mnt_flag = MNT_RDONLY;
|
2001-09-12 08:38:13 +00:00
|
|
|
if (error = ext2_mountfs(rootvp, mp, td)) {
|
1995-11-05 23:25:12 +00:00
|
|
|
bsd_free(mp, M_MOUNT);
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
if (error = vfs_lock(mp)) {
|
2001-09-12 08:38:13 +00:00
|
|
|
(void)ext2_unmount(mp, 0, td);
|
1995-11-05 23:25:12 +00:00
|
|
|
bsd_free(mp, M_MOUNT);
|
|
|
|
return (error);
|
|
|
|
}
|
1999-11-20 10:00:46 +00:00
|
|
|
TAILQ_INSERT_HEAD(&mountlist, mp, mnt_list);
|
1995-11-05 23:25:12 +00:00
|
|
|
mp->mnt_flag |= MNT_ROOTFS;
|
|
|
|
mp->mnt_vnodecovered = NULLVP;
|
2002-05-16 19:08:03 +00:00
|
|
|
ump = VFSTOEXT2(mp);
|
1995-11-05 23:25:12 +00:00
|
|
|
fs = ump->um_e2fs;
|
|
|
|
bzero(fs->fs_fsmnt, sizeof(fs->fs_fsmnt));
|
|
|
|
fs->fs_fsmnt[0] = '/';
|
|
|
|
bcopy((caddr_t)fs->fs_fsmnt, (caddr_t)mp->mnt_stat.f_mntonname,
|
|
|
|
MNAMELEN);
|
|
|
|
(void) copystr(ROOTNAME, mp->mnt_stat.f_mntfromname, MNAMELEN - 1,
|
|
|
|
&size);
|
|
|
|
bzero(mp->mnt_stat.f_mntfromname + size, MNAMELEN - size);
|
2001-09-12 08:38:13 +00:00
|
|
|
(void)ext2_statfs(mp, &mp->mnt_stat, td);
|
1995-11-05 23:25:12 +00:00
|
|
|
vfs_unlock(mp);
|
|
|
|
inittodr(fs->s_es->s_wtime); /* this helps to set the time */
|
|
|
|
return (0);
|
|
|
|
}
|
1996-06-12 05:11:41 +00:00
|
|
|
#endif
|
1995-11-05 23:25:12 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* VFS Operations.
|
|
|
|
*
|
|
|
|
* mount system call
|
|
|
|
*/
|
1995-12-17 21:14:36 +00:00
|
|
|
static int
|
2002-05-24 17:38:01 +00:00
|
|
|
ext2_mount(mp, ndp, td)
|
2002-05-16 19:43:28 +00:00
|
|
|
struct mount *mp;
|
1995-11-05 23:25:12 +00:00
|
|
|
struct nameidata *ndp;
|
2001-09-12 08:38:13 +00:00
|
|
|
struct thread *td;
|
1995-11-05 23:25:12 +00:00
|
|
|
{
|
2002-05-24 17:38:01 +00:00
|
|
|
struct export_args *export;
|
|
|
|
struct vfsoptlist *opts;
|
1995-11-05 23:25:12 +00:00
|
|
|
struct vnode *devvp;
|
2002-05-16 19:08:03 +00:00
|
|
|
struct ext2mount *ump = 0;
|
2002-05-16 19:43:28 +00:00
|
|
|
struct ext2_sb_info *fs;
|
2002-05-24 17:38:01 +00:00
|
|
|
char *path, *fspec;
|
2000-12-09 22:31:34 +00:00
|
|
|
size_t size;
|
2002-05-24 17:38:01 +00:00
|
|
|
int error, flags, len;
|
1998-09-09 20:21:18 +00:00
|
|
|
mode_t accessmode;
|
1995-11-05 23:25:12 +00:00
|
|
|
|
2002-05-24 17:38:01 +00:00
|
|
|
opts = mp->mnt_optnew;
|
|
|
|
|
|
|
|
vfs_getopt(opts, "fspath", (void **)&path, NULL);
|
2001-03-01 21:00:17 +00:00
|
|
|
/* Double-check the length of path.. */
|
|
|
|
if (strlen(path) >= MAXMNTLEN - 1)
|
|
|
|
return (ENAMETOOLONG);
|
2002-05-24 17:38:01 +00:00
|
|
|
|
|
|
|
fspec = NULL;
|
|
|
|
error = vfs_getopt(opts, "from", (void **)&fspec, &len);
|
|
|
|
if (!error && fspec[len - 1] != '\0')
|
|
|
|
return (EINVAL);
|
|
|
|
|
1995-11-05 23:25:12 +00:00
|
|
|
/*
|
|
|
|
* If updating, check whether changing from read-only to
|
|
|
|
* read/write; if there is no device name, that's all we do.
|
|
|
|
*/
|
|
|
|
if (mp->mnt_flag & MNT_UPDATE) {
|
2002-05-16 19:08:03 +00:00
|
|
|
ump = VFSTOEXT2(mp);
|
1995-11-05 23:25:12 +00:00
|
|
|
fs = ump->um_e2fs;
|
|
|
|
error = 0;
|
|
|
|
if (fs->s_rd_only == 0 && (mp->mnt_flag & MNT_RDONLY)) {
|
|
|
|
flags = WRITECLOSE;
|
|
|
|
if (mp->mnt_flag & MNT_FORCE)
|
|
|
|
flags |= FORCECLOSE;
|
2001-09-12 08:38:13 +00:00
|
|
|
if (vfs_busy(mp, LK_NOWAIT, 0, td))
|
1995-11-05 23:25:12 +00:00
|
|
|
return (EBUSY);
|
2001-09-12 08:38:13 +00:00
|
|
|
error = ext2_flushfiles(mp, flags, td);
|
|
|
|
vfs_unbusy(mp, td);
|
1998-09-26 06:18:59 +00:00
|
|
|
if (!error && fs->s_wasvalid) {
|
|
|
|
fs->s_es->s_state |= EXT2_VALID_FS;
|
|
|
|
ext2_sbupdate(ump, MNT_WAIT);
|
|
|
|
}
|
|
|
|
fs->s_rd_only = 1;
|
1995-11-05 23:25:12 +00:00
|
|
|
}
|
|
|
|
if (!error && (mp->mnt_flag & MNT_RELOAD))
|
2001-09-12 08:38:13 +00:00
|
|
|
error = ext2_reload(mp, ndp->ni_cnd.cn_cred, td);
|
1995-11-05 23:25:12 +00:00
|
|
|
if (error)
|
|
|
|
return (error);
|
2000-03-09 05:21:10 +00:00
|
|
|
devvp = ump->um_devvp;
|
|
|
|
if (ext2_check_sb_compat(fs->s_es, devvp->v_rdev,
|
|
|
|
(mp->mnt_kern_flag & MNTK_WANTRDWR) == 0) != 0)
|
|
|
|
return (EPERM);
|
1998-09-09 20:21:18 +00:00
|
|
|
if (fs->s_rd_only && (mp->mnt_kern_flag & MNTK_WANTRDWR)) {
|
|
|
|
/*
|
|
|
|
* If upgrade to read-write by non-root, then verify
|
|
|
|
* that user has necessary permissions on the device.
|
|
|
|
*/
|
2002-04-01 21:31:13 +00:00
|
|
|
if (suser(td)) {
|
2001-09-12 08:38:13 +00:00
|
|
|
vn_lock(devvp, LK_EXCLUSIVE | LK_RETRY, td);
|
1999-01-27 21:50:00 +00:00
|
|
|
if ((error = VOP_ACCESS(devvp, VREAD | VWRITE,
|
2002-02-27 18:32:23 +00:00
|
|
|
td->td_ucred, td)) != 0) {
|
2001-09-12 08:38:13 +00:00
|
|
|
VOP_UNLOCK(devvp, 0, td);
|
1998-09-09 20:21:18 +00:00
|
|
|
return (error);
|
|
|
|
}
|
2001-09-12 08:38:13 +00:00
|
|
|
VOP_UNLOCK(devvp, 0, td);
|
1998-09-09 20:21:18 +00:00
|
|
|
}
|
|
|
|
|
1998-09-26 06:18:59 +00:00
|
|
|
if ((fs->s_es->s_state & EXT2_VALID_FS) == 0 ||
|
|
|
|
(fs->s_es->s_state & EXT2_ERROR_FS)) {
|
|
|
|
if (mp->mnt_flag & MNT_FORCE) {
|
|
|
|
printf(
|
|
|
|
"WARNING: %s was not properly dismounted\n",
|
|
|
|
fs->fs_fsmnt);
|
|
|
|
} else {
|
|
|
|
printf(
|
|
|
|
"WARNING: R/W mount of %s denied. Filesystem is not clean - run fsck\n",
|
|
|
|
fs->fs_fsmnt);
|
|
|
|
return (EPERM);
|
|
|
|
}
|
|
|
|
}
|
1995-11-05 23:25:12 +00:00
|
|
|
fs->s_es->s_state &= ~EXT2_VALID_FS;
|
|
|
|
ext2_sbupdate(ump, MNT_WAIT);
|
1998-09-26 06:18:59 +00:00
|
|
|
fs->s_rd_only = 0;
|
1995-11-05 23:25:12 +00:00
|
|
|
}
|
2002-05-24 17:38:01 +00:00
|
|
|
if (fspec == NULL) {
|
|
|
|
error = vfs_getopt(opts, "export", (void **)&export,
|
|
|
|
&len);
|
|
|
|
if (error || len != sizeof(struct export_args))
|
|
|
|
return (EINVAL);
|
|
|
|
/* Process export requests. */
|
|
|
|
return (vfs_export(mp, export));
|
1995-11-05 23:25:12 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Not an update, or updating the name: look up the name
|
|
|
|
* and verify that it refers to a sensible block device.
|
|
|
|
*/
|
2002-05-24 17:38:01 +00:00
|
|
|
if (fspec == NULL)
|
|
|
|
return (EINVAL);
|
|
|
|
NDINIT(ndp, LOOKUP, FOLLOW, UIO_SYSSPACE, fspec, td);
|
1999-01-27 21:50:00 +00:00
|
|
|
if ((error = namei(ndp)) != 0)
|
1995-11-05 23:25:12 +00:00
|
|
|
return (error);
|
1999-12-15 23:02:35 +00:00
|
|
|
NDFREE(ndp, NDF_ONLY_PNBUF);
|
1995-11-05 23:25:12 +00:00
|
|
|
devvp = ndp->ni_vp;
|
|
|
|
|
2000-01-10 12:04:27 +00:00
|
|
|
if (!vn_isdisk(devvp, &error)) {
|
1995-11-05 23:25:12 +00:00
|
|
|
vrele(devvp);
|
2000-01-10 12:04:27 +00:00
|
|
|
return (error);
|
1995-11-05 23:25:12 +00:00
|
|
|
}
|
1998-09-09 20:21:18 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* If mount by non-root, then verify that user has necessary
|
|
|
|
* permissions on the device.
|
|
|
|
*/
|
2002-04-01 21:31:13 +00:00
|
|
|
if (suser(td)) {
|
1998-09-09 20:21:18 +00:00
|
|
|
accessmode = VREAD;
|
|
|
|
if ((mp->mnt_flag & MNT_RDONLY) == 0)
|
|
|
|
accessmode |= VWRITE;
|
2001-09-12 08:38:13 +00:00
|
|
|
vn_lock(devvp, LK_EXCLUSIVE | LK_RETRY, td);
|
2002-02-27 18:32:23 +00:00
|
|
|
if ((error = VOP_ACCESS(devvp, accessmode, td->td_ucred, td)) != 0) {
|
1998-09-09 20:21:18 +00:00
|
|
|
vput(devvp);
|
|
|
|
return (error);
|
|
|
|
}
|
2001-09-12 08:38:13 +00:00
|
|
|
VOP_UNLOCK(devvp, 0, td);
|
1998-09-09 20:21:18 +00:00
|
|
|
}
|
|
|
|
|
1997-09-27 13:40:20 +00:00
|
|
|
if ((mp->mnt_flag & MNT_UPDATE) == 0) {
|
2001-09-12 08:38:13 +00:00
|
|
|
error = ext2_mountfs(devvp, mp, td);
|
1997-09-27 13:40:20 +00:00
|
|
|
} else {
|
1995-11-05 23:25:12 +00:00
|
|
|
if (devvp != ump->um_devvp)
|
|
|
|
error = EINVAL; /* needs translation */
|
|
|
|
else
|
|
|
|
vrele(devvp);
|
|
|
|
}
|
|
|
|
if (error) {
|
|
|
|
vrele(devvp);
|
|
|
|
return (error);
|
|
|
|
}
|
2002-05-16 19:08:03 +00:00
|
|
|
ump = VFSTOEXT2(mp);
|
1995-11-05 23:25:12 +00:00
|
|
|
fs = ump->um_e2fs;
|
2001-03-01 21:00:17 +00:00
|
|
|
/*
|
|
|
|
* Note that this strncpy() is ok because of a check at the start
|
|
|
|
* of ext2_mount().
|
|
|
|
*/
|
|
|
|
strncpy(fs->fs_fsmnt, path, MAXMNTLEN);
|
|
|
|
fs->fs_fsmnt[MAXMNTLEN - 1] = '\0';
|
2002-05-24 17:38:01 +00:00
|
|
|
(void)copystr(fspec, mp->mnt_stat.f_mntfromname, MNAMELEN - 1, &size);
|
1995-11-05 23:25:12 +00:00
|
|
|
bzero(mp->mnt_stat.f_mntfromname + size, MNAMELEN - size);
|
2001-09-12 08:38:13 +00:00
|
|
|
(void)ext2_statfs(mp, &mp->mnt_stat, td);
|
1995-11-05 23:25:12 +00:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* checks that the data in the descriptor blocks make sense
|
|
|
|
* this is taken from ext2/super.c
|
|
|
|
*/
|
|
|
|
static int ext2_check_descriptors (struct ext2_sb_info * sb)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
int desc_block = 0;
|
|
|
|
unsigned long block = sb->s_es->s_first_data_block;
|
|
|
|
struct ext2_group_desc * gdp = NULL;
|
|
|
|
|
|
|
|
/* ext2_debug ("Checking group descriptors"); */
|
|
|
|
|
|
|
|
for (i = 0; i < sb->s_groups_count; i++)
|
|
|
|
{
|
|
|
|
/* examine next descriptor block */
|
|
|
|
if ((i % EXT2_DESC_PER_BLOCK(sb)) == 0)
|
|
|
|
gdp = (struct ext2_group_desc *)
|
|
|
|
sb->s_group_desc[desc_block++]->b_data;
|
|
|
|
if (gdp->bg_block_bitmap < block ||
|
|
|
|
gdp->bg_block_bitmap >= block + EXT2_BLOCKS_PER_GROUP(sb))
|
|
|
|
{
|
|
|
|
printf ("ext2_check_descriptors: "
|
|
|
|
"Block bitmap for group %d"
|
1998-09-26 07:16:41 +00:00
|
|
|
" not in group (block %lu)!\n",
|
1995-11-05 23:25:12 +00:00
|
|
|
i, (unsigned long) gdp->bg_block_bitmap);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
if (gdp->bg_inode_bitmap < block ||
|
|
|
|
gdp->bg_inode_bitmap >= block + EXT2_BLOCKS_PER_GROUP(sb))
|
|
|
|
{
|
|
|
|
printf ("ext2_check_descriptors: "
|
|
|
|
"Inode bitmap for group %d"
|
1998-09-26 07:16:41 +00:00
|
|
|
" not in group (block %lu)!\n",
|
1995-11-05 23:25:12 +00:00
|
|
|
i, (unsigned long) gdp->bg_inode_bitmap);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
if (gdp->bg_inode_table < block ||
|
|
|
|
gdp->bg_inode_table + sb->s_itb_per_group >=
|
|
|
|
block + EXT2_BLOCKS_PER_GROUP(sb))
|
|
|
|
{
|
|
|
|
printf ("ext2_check_descriptors: "
|
|
|
|
"Inode table for group %d"
|
1998-09-26 07:16:41 +00:00
|
|
|
" not in group (block %lu)!\n",
|
1995-11-05 23:25:12 +00:00
|
|
|
i, (unsigned long) gdp->bg_inode_table);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
block += EXT2_BLOCKS_PER_GROUP(sb);
|
|
|
|
gdp++;
|
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2000-01-02 17:40:02 +00:00
|
|
|
static int
|
|
|
|
ext2_check_sb_compat(es, dev, ronly)
|
|
|
|
struct ext2_super_block *es;
|
|
|
|
dev_t dev;
|
|
|
|
int ronly;
|
|
|
|
{
|
|
|
|
|
|
|
|
if (es->s_magic != EXT2_SUPER_MAGIC) {
|
|
|
|
printf("ext2fs: %s: wrong magic number %#x (expected %#x)\n",
|
|
|
|
devtoname(dev), es->s_magic, EXT2_SUPER_MAGIC);
|
|
|
|
return (1);
|
|
|
|
}
|
|
|
|
if (es->s_rev_level > EXT2_GOOD_OLD_REV) {
|
|
|
|
if (es->s_feature_incompat & ~EXT2_FEATURE_INCOMPAT_SUPP) {
|
|
|
|
printf(
|
|
|
|
"WARNING: mount of %s denied due to unsupported optional features\n",
|
|
|
|
devtoname(dev));
|
|
|
|
return (1);
|
|
|
|
}
|
|
|
|
if (!ronly &&
|
|
|
|
(es->s_feature_ro_compat & ~EXT2_FEATURE_RO_COMPAT_SUPP)) {
|
|
|
|
printf(
|
|
|
|
"WARNING: R/W mount of %s denied due to unsupported optional features\n",
|
|
|
|
devtoname(dev));
|
|
|
|
return (1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
1995-11-05 23:25:12 +00:00
|
|
|
/*
|
|
|
|
* this computes the fields of the ext2_sb_info structure from the
|
|
|
|
* data in the ext2_super_block structure read in
|
|
|
|
*/
|
|
|
|
static int compute_sb_data(devvp, es, fs)
|
|
|
|
struct vnode * devvp;
|
|
|
|
struct ext2_super_block * es;
|
|
|
|
struct ext2_sb_info * fs;
|
|
|
|
{
|
|
|
|
int db_count, error;
|
|
|
|
int i, j;
|
|
|
|
int logic_sb_block = 1; /* XXX for now */
|
|
|
|
|
|
|
|
#if 1
|
|
|
|
#define V(v)
|
|
|
|
#else
|
|
|
|
#define V(v) printf(#v"= %d\n", fs->v);
|
|
|
|
#endif
|
|
|
|
|
|
|
|
fs->s_blocksize = EXT2_MIN_BLOCK_SIZE << es->s_log_block_size;
|
|
|
|
V(s_blocksize)
|
|
|
|
fs->s_bshift = EXT2_MIN_BLOCK_LOG_SIZE + es->s_log_block_size;
|
|
|
|
V(s_bshift)
|
|
|
|
fs->s_fsbtodb = es->s_log_block_size + 1;
|
|
|
|
V(s_fsbtodb)
|
|
|
|
fs->s_qbmask = fs->s_blocksize - 1;
|
|
|
|
V(s_bmask)
|
|
|
|
fs->s_blocksize_bits = EXT2_BLOCK_SIZE_BITS(es);
|
|
|
|
V(s_blocksize_bits)
|
|
|
|
fs->s_frag_size = EXT2_MIN_FRAG_SIZE << es->s_log_frag_size;
|
|
|
|
V(s_frag_size)
|
|
|
|
if (fs->s_frag_size)
|
|
|
|
fs->s_frags_per_block = fs->s_blocksize / fs->s_frag_size;
|
|
|
|
V(s_frags_per_block)
|
|
|
|
fs->s_blocks_per_group = es->s_blocks_per_group;
|
|
|
|
V(s_blocks_per_group)
|
|
|
|
fs->s_frags_per_group = es->s_frags_per_group;
|
|
|
|
V(s_frags_per_group)
|
|
|
|
fs->s_inodes_per_group = es->s_inodes_per_group;
|
|
|
|
V(s_inodes_per_group)
|
|
|
|
fs->s_inodes_per_block = fs->s_blocksize / EXT2_INODE_SIZE;
|
|
|
|
V(s_inodes_per_block)
|
|
|
|
fs->s_itb_per_group = fs->s_inodes_per_group /fs->s_inodes_per_block;
|
|
|
|
V(s_itb_per_group)
|
|
|
|
fs->s_desc_per_block = fs->s_blocksize / sizeof (struct ext2_group_desc);
|
|
|
|
V(s_desc_per_block)
|
|
|
|
/* s_resuid / s_resgid ? */
|
|
|
|
fs->s_groups_count = (es->s_blocks_count -
|
|
|
|
es->s_first_data_block +
|
|
|
|
EXT2_BLOCKS_PER_GROUP(fs) - 1) /
|
|
|
|
EXT2_BLOCKS_PER_GROUP(fs);
|
|
|
|
V(s_groups_count)
|
|
|
|
db_count = (fs->s_groups_count + EXT2_DESC_PER_BLOCK(fs) - 1) /
|
|
|
|
EXT2_DESC_PER_BLOCK(fs);
|
|
|
|
fs->s_db_per_group = db_count;
|
|
|
|
V(s_db_per_group)
|
|
|
|
|
|
|
|
fs->s_group_desc = bsd_malloc(db_count * sizeof (struct buf *),
|
2003-02-19 05:47:46 +00:00
|
|
|
M_EXT2MNT, M_WAITOK);
|
1995-11-05 23:25:12 +00:00
|
|
|
|
|
|
|
/* adjust logic_sb_block */
|
|
|
|
if(fs->s_blocksize > SBSIZE)
|
|
|
|
/* Godmar thinks: if the blocksize is greater than 1024, then
|
|
|
|
the superblock is logically part of block zero.
|
|
|
|
*/
|
|
|
|
logic_sb_block = 0;
|
|
|
|
|
|
|
|
for (i = 0; i < db_count; i++) {
|
|
|
|
error = bread(devvp , fsbtodb(fs, logic_sb_block + i + 1),
|
|
|
|
fs->s_blocksize, NOCRED, &fs->s_group_desc[i]);
|
|
|
|
if(error) {
|
|
|
|
for (j = 0; j < i; j++)
|
|
|
|
brelse(fs->s_group_desc[j]);
|
2002-05-16 19:08:03 +00:00
|
|
|
bsd_free(fs->s_group_desc, M_EXT2MNT);
|
1995-11-05 23:25:12 +00:00
|
|
|
printf("EXT2-fs: unable to read group descriptors (%d)\n", error);
|
|
|
|
return EIO;
|
|
|
|
}
|
1997-08-04 05:10:31 +00:00
|
|
|
/* Set the B_LOCKED flag on the buffer, then brelse() it */
|
|
|
|
LCK_BUF(fs->s_group_desc[i])
|
1995-11-05 23:25:12 +00:00
|
|
|
}
|
|
|
|
if(!ext2_check_descriptors(fs)) {
|
|
|
|
for (j = 0; j < db_count; j++)
|
1997-08-04 05:10:31 +00:00
|
|
|
ULCK_BUF(fs->s_group_desc[j])
|
2002-05-16 19:08:03 +00:00
|
|
|
bsd_free(fs->s_group_desc, M_EXT2MNT);
|
1995-11-05 23:25:12 +00:00
|
|
|
printf("EXT2-fs: (ext2_check_descriptors failure) "
|
|
|
|
"unable to read group descriptors\n");
|
|
|
|
return EIO;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < EXT2_MAX_GROUP_LOADED; i++) {
|
|
|
|
fs->s_inode_bitmap_number[i] = 0;
|
|
|
|
fs->s_inode_bitmap[i] = NULL;
|
|
|
|
fs->s_block_bitmap_number[i] = 0;
|
|
|
|
fs->s_block_bitmap[i] = NULL;
|
|
|
|
}
|
|
|
|
fs->s_loaded_inode_bitmaps = 0;
|
|
|
|
fs->s_loaded_block_bitmaps = 0;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* 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.
|
|
|
|
*/
|
1995-12-17 21:14:36 +00:00
|
|
|
static int
|
2001-09-12 08:38:13 +00:00
|
|
|
ext2_reload(mountp, cred, td)
|
2002-05-16 19:43:28 +00:00
|
|
|
struct mount *mountp;
|
1995-11-05 23:25:12 +00:00
|
|
|
struct ucred *cred;
|
2001-09-12 08:38:13 +00:00
|
|
|
struct thread *td;
|
1995-11-05 23:25:12 +00:00
|
|
|
{
|
2002-05-16 19:43:28 +00:00
|
|
|
struct vnode *vp, *nvp, *devvp;
|
1995-11-05 23:25:12 +00:00
|
|
|
struct inode *ip;
|
|
|
|
struct buf *bp;
|
|
|
|
struct ext2_super_block * es;
|
|
|
|
struct ext2_sb_info *fs;
|
1995-11-08 04:50:00 +00:00
|
|
|
int error;
|
1995-11-05 23:25:12 +00:00
|
|
|
|
|
|
|
if ((mountp->mnt_flag & MNT_RDONLY) == 0)
|
|
|
|
return (EINVAL);
|
|
|
|
/*
|
|
|
|
* Step 1: invalidate all cached meta-data.
|
|
|
|
*/
|
2002-05-16 19:08:03 +00:00
|
|
|
devvp = VFSTOEXT2(mountp)->um_devvp;
|
2001-09-12 08:38:13 +00:00
|
|
|
if (vinvalbuf(devvp, 0, cred, td, 0, 0))
|
1995-11-05 23:25:12 +00:00
|
|
|
panic("ext2_reload: dirty1");
|
|
|
|
/*
|
|
|
|
* Step 2: re-read superblock from disk.
|
|
|
|
* constants have been adjusted for ext2
|
|
|
|
*/
|
1999-01-27 21:50:00 +00:00
|
|
|
if ((error = bread(devvp, SBLOCK, SBSIZE, NOCRED, &bp)) != 0)
|
1995-11-05 23:25:12 +00:00
|
|
|
return (error);
|
|
|
|
es = (struct ext2_super_block *)bp->b_data;
|
2000-01-02 17:40:02 +00:00
|
|
|
if (ext2_check_sb_compat(es, devvp->v_rdev, 0) != 0) {
|
1995-11-05 23:25:12 +00:00
|
|
|
brelse(bp);
|
|
|
|
return (EIO); /* XXX needs translation */
|
|
|
|
}
|
2002-05-16 19:08:03 +00:00
|
|
|
fs = VFSTOEXT2(mountp)->um_e2fs;
|
1995-11-05 23:25:12 +00:00
|
|
|
bcopy(bp->b_data, fs->s_es, sizeof(struct ext2_super_block));
|
|
|
|
|
1999-01-27 21:50:00 +00:00
|
|
|
if((error = compute_sb_data(devvp, es, fs)) != 0) {
|
1995-11-05 23:25:12 +00:00
|
|
|
brelse(bp);
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
#ifdef UNKLAR
|
|
|
|
if (fs->fs_sbsize < SBSIZE)
|
|
|
|
bp->b_flags |= B_INVAL;
|
|
|
|
#endif
|
|
|
|
brelse(bp);
|
|
|
|
|
|
|
|
loop:
|
Change and clean the mutex lock interface.
mtx_enter(lock, type) becomes:
mtx_lock(lock) for sleep locks (MTX_DEF-initialized locks)
mtx_lock_spin(lock) for spin locks (MTX_SPIN-initialized)
similarily, for releasing a lock, we now have:
mtx_unlock(lock) for MTX_DEF and mtx_unlock_spin(lock) for MTX_SPIN.
We change the caller interface for the two different types of locks
because the semantics are entirely different for each case, and this
makes it explicitly clear and, at the same time, it rids us of the
extra `type' argument.
The enter->lock and exit->unlock change has been made with the idea
that we're "locking data" and not "entering locked code" in mind.
Further, remove all additional "flags" previously passed to the
lock acquire/release routines with the exception of two:
MTX_QUIET and MTX_NOSWITCH
The functionality of these flags is preserved and they can be passed
to the lock/unlock routines by calling the corresponding wrappers:
mtx_{lock, unlock}_flags(lock, flag(s)) and
mtx_{lock, unlock}_spin_flags(lock, flag(s)) for MTX_DEF and MTX_SPIN
locks, respectively.
Re-inline some lock acq/rel code; in the sleep lock case, we only
inline the _obtain_lock()s in order to ensure that the inlined code
fits into a cache line. In the spin lock case, we inline recursion and
actually only perform a function call if we need to spin. This change
has been made with the idea that we generally tend to avoid spin locks
and that also the spin locks that we do have and are heavily used
(i.e. sched_lock) do recurse, and therefore in an effort to reduce
function call overhead for some architectures (such as alpha), we
inline recursion for this case.
Create a new malloc type for the witness code and retire from using
the M_DEV type. The new type is called M_WITNESS and is only declared
if WITNESS is enabled.
Begin cleaning up some machdep/mutex.h code - specifically updated the
"optimized" inlined code in alpha/mutex.h and wrote MTX_LOCK_SPIN
and MTX_UNLOCK_SPIN asm macros for the i386/mutex.h as we presently
need those.
Finally, caught up to the interface changes in all sys code.
Contributors: jake, jhb, jasone (in no particular order)
2001-02-09 06:11:45 +00:00
|
|
|
mtx_lock(&mntvnode_mtx);
|
2001-10-23 01:21:29 +00:00
|
|
|
for (vp = TAILQ_FIRST(&mountp->mnt_nvnodelist); vp != NULL; vp = nvp) {
|
1998-09-26 12:42:17 +00:00
|
|
|
if (vp->v_mount != mountp) {
|
Change and clean the mutex lock interface.
mtx_enter(lock, type) becomes:
mtx_lock(lock) for sleep locks (MTX_DEF-initialized locks)
mtx_lock_spin(lock) for spin locks (MTX_SPIN-initialized)
similarily, for releasing a lock, we now have:
mtx_unlock(lock) for MTX_DEF and mtx_unlock_spin(lock) for MTX_SPIN.
We change the caller interface for the two different types of locks
because the semantics are entirely different for each case, and this
makes it explicitly clear and, at the same time, it rids us of the
extra `type' argument.
The enter->lock and exit->unlock change has been made with the idea
that we're "locking data" and not "entering locked code" in mind.
Further, remove all additional "flags" previously passed to the
lock acquire/release routines with the exception of two:
MTX_QUIET and MTX_NOSWITCH
The functionality of these flags is preserved and they can be passed
to the lock/unlock routines by calling the corresponding wrappers:
mtx_{lock, unlock}_flags(lock, flag(s)) and
mtx_{lock, unlock}_spin_flags(lock, flag(s)) for MTX_DEF and MTX_SPIN
locks, respectively.
Re-inline some lock acq/rel code; in the sleep lock case, we only
inline the _obtain_lock()s in order to ensure that the inlined code
fits into a cache line. In the spin lock case, we inline recursion and
actually only perform a function call if we need to spin. This change
has been made with the idea that we generally tend to avoid spin locks
and that also the spin locks that we do have and are heavily used
(i.e. sched_lock) do recurse, and therefore in an effort to reduce
function call overhead for some architectures (such as alpha), we
inline recursion for this case.
Create a new malloc type for the witness code and retire from using
the M_DEV type. The new type is called M_WITNESS and is only declared
if WITNESS is enabled.
Begin cleaning up some machdep/mutex.h code - specifically updated the
"optimized" inlined code in alpha/mutex.h and wrote MTX_LOCK_SPIN
and MTX_UNLOCK_SPIN asm macros for the i386/mutex.h as we presently
need those.
Finally, caught up to the interface changes in all sys code.
Contributors: jake, jhb, jasone (in no particular order)
2001-02-09 06:11:45 +00:00
|
|
|
mtx_unlock(&mntvnode_mtx);
|
1998-09-26 12:42:17 +00:00
|
|
|
goto loop;
|
|
|
|
}
|
2001-10-23 01:21:29 +00:00
|
|
|
nvp = TAILQ_NEXT(vp, v_nmntvnodes);
|
2001-06-28 22:21:33 +00:00
|
|
|
mtx_unlock(&mntvnode_mtx);
|
1995-11-05 23:25:12 +00:00
|
|
|
/*
|
|
|
|
* Step 4: invalidate all inactive vnodes.
|
|
|
|
*/
|
2001-09-12 08:38:13 +00:00
|
|
|
if (vrecycle(vp, NULL, td))
|
1998-09-26 12:42:17 +00:00
|
|
|
goto loop;
|
1995-11-05 23:25:12 +00:00
|
|
|
/*
|
|
|
|
* Step 5: invalidate all cached file data.
|
|
|
|
*/
|
2001-06-28 03:52:04 +00:00
|
|
|
mtx_lock(&vp->v_interlock);
|
2001-09-12 08:38:13 +00:00
|
|
|
if (vget(vp, LK_EXCLUSIVE | LK_INTERLOCK, td)) {
|
1995-11-05 23:25:12 +00:00
|
|
|
goto loop;
|
1998-09-26 12:42:17 +00:00
|
|
|
}
|
2001-09-12 08:38:13 +00:00
|
|
|
if (vinvalbuf(vp, 0, cred, td, 0, 0))
|
1995-11-05 23:25:12 +00:00
|
|
|
panic("ext2_reload: dirty2");
|
|
|
|
/*
|
|
|
|
* Step 6: re-read inode data for all active vnodes.
|
|
|
|
*/
|
|
|
|
ip = VTOI(vp);
|
1998-09-26 12:42:17 +00:00
|
|
|
error =
|
1995-11-05 23:25:12 +00:00
|
|
|
bread(devvp, fsbtodb(fs, ino_to_fsba(fs, ip->i_number)),
|
1998-09-26 12:42:17 +00:00
|
|
|
(int)fs->s_blocksize, NOCRED, &bp);
|
|
|
|
if (error) {
|
1995-11-05 23:25:12 +00:00
|
|
|
vput(vp);
|
|
|
|
return (error);
|
|
|
|
}
|
2002-05-16 19:08:03 +00:00
|
|
|
ext2_ei2i((struct ext2_inode *) ((char *)bp->b_data +
|
|
|
|
EXT2_INODE_SIZE * ino_to_fsbo(fs, ip->i_number)), ip);
|
1995-11-05 23:25:12 +00:00
|
|
|
brelse(bp);
|
|
|
|
vput(vp);
|
Change and clean the mutex lock interface.
mtx_enter(lock, type) becomes:
mtx_lock(lock) for sleep locks (MTX_DEF-initialized locks)
mtx_lock_spin(lock) for spin locks (MTX_SPIN-initialized)
similarily, for releasing a lock, we now have:
mtx_unlock(lock) for MTX_DEF and mtx_unlock_spin(lock) for MTX_SPIN.
We change the caller interface for the two different types of locks
because the semantics are entirely different for each case, and this
makes it explicitly clear and, at the same time, it rids us of the
extra `type' argument.
The enter->lock and exit->unlock change has been made with the idea
that we're "locking data" and not "entering locked code" in mind.
Further, remove all additional "flags" previously passed to the
lock acquire/release routines with the exception of two:
MTX_QUIET and MTX_NOSWITCH
The functionality of these flags is preserved and they can be passed
to the lock/unlock routines by calling the corresponding wrappers:
mtx_{lock, unlock}_flags(lock, flag(s)) and
mtx_{lock, unlock}_spin_flags(lock, flag(s)) for MTX_DEF and MTX_SPIN
locks, respectively.
Re-inline some lock acq/rel code; in the sleep lock case, we only
inline the _obtain_lock()s in order to ensure that the inlined code
fits into a cache line. In the spin lock case, we inline recursion and
actually only perform a function call if we need to spin. This change
has been made with the idea that we generally tend to avoid spin locks
and that also the spin locks that we do have and are heavily used
(i.e. sched_lock) do recurse, and therefore in an effort to reduce
function call overhead for some architectures (such as alpha), we
inline recursion for this case.
Create a new malloc type for the witness code and retire from using
the M_DEV type. The new type is called M_WITNESS and is only declared
if WITNESS is enabled.
Begin cleaning up some machdep/mutex.h code - specifically updated the
"optimized" inlined code in alpha/mutex.h and wrote MTX_LOCK_SPIN
and MTX_UNLOCK_SPIN asm macros for the i386/mutex.h as we presently
need those.
Finally, caught up to the interface changes in all sys code.
Contributors: jake, jhb, jasone (in no particular order)
2001-02-09 06:11:45 +00:00
|
|
|
mtx_lock(&mntvnode_mtx);
|
1995-11-05 23:25:12 +00:00
|
|
|
}
|
Change and clean the mutex lock interface.
mtx_enter(lock, type) becomes:
mtx_lock(lock) for sleep locks (MTX_DEF-initialized locks)
mtx_lock_spin(lock) for spin locks (MTX_SPIN-initialized)
similarily, for releasing a lock, we now have:
mtx_unlock(lock) for MTX_DEF and mtx_unlock_spin(lock) for MTX_SPIN.
We change the caller interface for the two different types of locks
because the semantics are entirely different for each case, and this
makes it explicitly clear and, at the same time, it rids us of the
extra `type' argument.
The enter->lock and exit->unlock change has been made with the idea
that we're "locking data" and not "entering locked code" in mind.
Further, remove all additional "flags" previously passed to the
lock acquire/release routines with the exception of two:
MTX_QUIET and MTX_NOSWITCH
The functionality of these flags is preserved and they can be passed
to the lock/unlock routines by calling the corresponding wrappers:
mtx_{lock, unlock}_flags(lock, flag(s)) and
mtx_{lock, unlock}_spin_flags(lock, flag(s)) for MTX_DEF and MTX_SPIN
locks, respectively.
Re-inline some lock acq/rel code; in the sleep lock case, we only
inline the _obtain_lock()s in order to ensure that the inlined code
fits into a cache line. In the spin lock case, we inline recursion and
actually only perform a function call if we need to spin. This change
has been made with the idea that we generally tend to avoid spin locks
and that also the spin locks that we do have and are heavily used
(i.e. sched_lock) do recurse, and therefore in an effort to reduce
function call overhead for some architectures (such as alpha), we
inline recursion for this case.
Create a new malloc type for the witness code and retire from using
the M_DEV type. The new type is called M_WITNESS and is only declared
if WITNESS is enabled.
Begin cleaning up some machdep/mutex.h code - specifically updated the
"optimized" inlined code in alpha/mutex.h and wrote MTX_LOCK_SPIN
and MTX_UNLOCK_SPIN asm macros for the i386/mutex.h as we presently
need those.
Finally, caught up to the interface changes in all sys code.
Contributors: jake, jhb, jasone (in no particular order)
2001-02-09 06:11:45 +00:00
|
|
|
mtx_unlock(&mntvnode_mtx);
|
1995-11-05 23:25:12 +00:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Common code for mount and mountroot
|
|
|
|
*/
|
1995-12-17 21:14:36 +00:00
|
|
|
static int
|
2001-09-12 08:38:13 +00:00
|
|
|
ext2_mountfs(devvp, mp, td)
|
2002-05-16 19:43:28 +00:00
|
|
|
struct vnode *devvp;
|
1995-11-05 23:25:12 +00:00
|
|
|
struct mount *mp;
|
2001-09-12 08:38:13 +00:00
|
|
|
struct thread *td;
|
1995-11-05 23:25:12 +00:00
|
|
|
{
|
2002-05-16 19:43:28 +00:00
|
|
|
struct ext2mount *ump;
|
1995-11-05 23:25:12 +00:00
|
|
|
struct buf *bp;
|
2002-05-16 19:43:28 +00:00
|
|
|
struct ext2_sb_info *fs;
|
1995-11-05 23:25:12 +00:00
|
|
|
struct ext2_super_block * es;
|
|
|
|
dev_t dev = devvp->v_rdev;
|
2002-05-16 19:08:03 +00:00
|
|
|
int error;
|
1995-11-05 23:25:12 +00:00
|
|
|
int ronly;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* 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).
|
|
|
|
* Flush out any old buffers remaining from a previous use.
|
|
|
|
*/
|
1999-01-27 21:50:00 +00:00
|
|
|
if ((error = vfs_mountedon(devvp)) != 0)
|
1995-11-05 23:25:12 +00:00
|
|
|
return (error);
|
|
|
|
if (vcount(devvp) > 1 && devvp != rootvp)
|
|
|
|
return (EBUSY);
|
2002-02-27 18:32:23 +00:00
|
|
|
if ((error = vinvalbuf(devvp, V_SAVE, td->td_ucred, td, 0, 0)) != 0)
|
1995-11-05 23:25:12 +00:00
|
|
|
return (error);
|
|
|
|
#ifdef READONLY
|
|
|
|
/* turn on this to force it to be read-only */
|
|
|
|
mp->mnt_flag |= MNT_RDONLY;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
ronly = (mp->mnt_flag & MNT_RDONLY) != 0;
|
2001-09-12 08:38:13 +00:00
|
|
|
vn_lock(devvp, LK_EXCLUSIVE | LK_RETRY, td);
|
|
|
|
error = VOP_OPEN(devvp, ronly ? FREAD : FREAD|FWRITE, FSCRED, td);
|
|
|
|
VOP_UNLOCK(devvp, 0, td);
|
1999-11-09 14:15:33 +00:00
|
|
|
if (error)
|
1995-11-05 23:25:12 +00:00
|
|
|
return (error);
|
2002-03-30 15:12:57 +00:00
|
|
|
if (devvp->v_rdev->si_iosize_max != 0)
|
|
|
|
mp->mnt_iosize_max = devvp->v_rdev->si_iosize_max;
|
|
|
|
if (mp->mnt_iosize_max > MAXPHYS)
|
|
|
|
mp->mnt_iosize_max = MAXPHYS;
|
|
|
|
|
1995-11-05 23:25:12 +00:00
|
|
|
bp = NULL;
|
|
|
|
ump = NULL;
|
1999-01-27 21:50:00 +00:00
|
|
|
if ((error = bread(devvp, SBLOCK, SBSIZE, NOCRED, &bp)) != 0)
|
1995-11-05 23:25:12 +00:00
|
|
|
goto out;
|
|
|
|
es = (struct ext2_super_block *)bp->b_data;
|
2000-01-02 17:40:02 +00:00
|
|
|
if (ext2_check_sb_compat(es, dev, ronly) != 0) {
|
1995-11-05 23:25:12 +00:00
|
|
|
error = EINVAL; /* XXX needs translation */
|
|
|
|
goto out;
|
|
|
|
}
|
1998-09-26 06:18:59 +00:00
|
|
|
if ((es->s_state & EXT2_VALID_FS) == 0 ||
|
|
|
|
(es->s_state & EXT2_ERROR_FS)) {
|
|
|
|
if (ronly || (mp->mnt_flag & MNT_FORCE)) {
|
|
|
|
printf(
|
|
|
|
"WARNING: Filesystem was not properly dismounted\n");
|
|
|
|
} else {
|
|
|
|
printf(
|
|
|
|
"WARNING: R/W mount denied. Filesystem is not clean - run fsck\n");
|
|
|
|
error = EPERM;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
}
|
2003-02-19 05:47:46 +00:00
|
|
|
ump = bsd_malloc(sizeof *ump, M_EXT2MNT, M_WAITOK);
|
1995-11-05 23:25:12 +00:00
|
|
|
bzero((caddr_t)ump, sizeof *ump);
|
|
|
|
/* I don't know whether this is the right strategy. Note that
|
2003-01-01 18:49:04 +00:00
|
|
|
we dynamically allocate both an ext2_sb_info and an ext2_super_block
|
1995-11-05 23:25:12 +00:00
|
|
|
while Linux keeps the super block in a locked buffer
|
|
|
|
*/
|
|
|
|
ump->um_e2fs = bsd_malloc(sizeof(struct ext2_sb_info),
|
2003-02-19 05:47:46 +00:00
|
|
|
M_EXT2MNT, M_WAITOK);
|
1995-11-05 23:25:12 +00:00
|
|
|
ump->um_e2fs->s_es = bsd_malloc(sizeof(struct ext2_super_block),
|
2003-02-19 05:47:46 +00:00
|
|
|
M_EXT2MNT, M_WAITOK);
|
1995-11-05 23:25:12 +00:00
|
|
|
bcopy(es, ump->um_e2fs->s_es, (u_int)sizeof(struct ext2_super_block));
|
1998-09-26 07:16:41 +00:00
|
|
|
if ((error = compute_sb_data(devvp, ump->um_e2fs->s_es, ump->um_e2fs)))
|
|
|
|
goto out;
|
|
|
|
/*
|
|
|
|
* We don't free the group descriptors allocated by compute_sb_data()
|
|
|
|
* until ext2_unmount(). This is OK since the mount will succeed.
|
|
|
|
*/
|
1995-11-05 23:25:12 +00:00
|
|
|
brelse(bp);
|
|
|
|
bp = NULL;
|
|
|
|
fs = ump->um_e2fs;
|
|
|
|
fs->s_rd_only = ronly; /* ronly is set according to mnt_flags */
|
|
|
|
/* if the fs is not mounted read-only, make sure the super block is
|
|
|
|
always written back on a sync()
|
|
|
|
*/
|
1998-09-26 06:18:59 +00:00
|
|
|
fs->s_wasvalid = fs->s_es->s_state & EXT2_VALID_FS ? 1 : 0;
|
1995-11-05 23:25:12 +00:00
|
|
|
if (ronly == 0) {
|
|
|
|
fs->s_dirt = 1; /* mark it modified */
|
|
|
|
fs->s_es->s_state &= ~EXT2_VALID_FS; /* set fs invalid */
|
|
|
|
}
|
|
|
|
mp->mnt_data = (qaddr_t)ump;
|
1999-08-23 21:07:13 +00:00
|
|
|
mp->mnt_stat.f_fsid.val[0] = dev2udev(dev);
|
1998-09-07 13:17:06 +00:00
|
|
|
mp->mnt_stat.f_fsid.val[1] = mp->mnt_vfc->vfc_typenum;
|
1995-11-05 23:25:12 +00:00
|
|
|
mp->mnt_maxsymlinklen = EXT2_MAXSYMLINKLEN;
|
|
|
|
mp->mnt_flag |= MNT_LOCAL;
|
|
|
|
ump->um_mountp = mp;
|
|
|
|
ump->um_dev = dev;
|
|
|
|
ump->um_devvp = devvp;
|
2002-05-16 19:08:03 +00:00
|
|
|
/* setting those two parameters allowed us to use
|
1995-11-05 23:25:12 +00:00
|
|
|
ufs_bmap w/o changse !
|
|
|
|
*/
|
|
|
|
ump->um_nindir = EXT2_ADDR_PER_BLOCK(fs);
|
|
|
|
ump->um_bptrtodb = fs->s_es->s_log_block_size + 1;
|
|
|
|
ump->um_seqinc = EXT2_FRAGS_PER_BLOCK(fs);
|
2000-10-09 17:31:39 +00:00
|
|
|
devvp->v_rdev->si_mountpoint = mp;
|
1998-03-09 14:46:57 +00:00
|
|
|
if (ronly == 0)
|
|
|
|
ext2_sbupdate(ump, MNT_WAIT);
|
1995-11-05 23:25:12 +00:00
|
|
|
return (0);
|
|
|
|
out:
|
|
|
|
if (bp)
|
|
|
|
brelse(bp);
|
2001-09-12 08:38:13 +00:00
|
|
|
(void)VOP_CLOSE(devvp, ronly ? FREAD : FREAD|FWRITE, NOCRED, td);
|
1995-11-05 23:25:12 +00:00
|
|
|
if (ump) {
|
2002-05-16 19:08:03 +00:00
|
|
|
bsd_free(ump->um_e2fs->s_es, M_EXT2MNT);
|
|
|
|
bsd_free(ump->um_e2fs, M_EXT2MNT);
|
|
|
|
bsd_free(ump, M_EXT2MNT);
|
1995-11-05 23:25:12 +00:00
|
|
|
mp->mnt_data = (qaddr_t)0;
|
|
|
|
}
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* unmount system call
|
|
|
|
*/
|
1995-12-17 21:14:36 +00:00
|
|
|
static int
|
2001-09-12 08:38:13 +00:00
|
|
|
ext2_unmount(mp, mntflags, td)
|
1995-11-05 23:25:12 +00:00
|
|
|
struct mount *mp;
|
|
|
|
int mntflags;
|
2001-09-12 08:38:13 +00:00
|
|
|
struct thread *td;
|
1995-11-05 23:25:12 +00:00
|
|
|
{
|
2002-05-16 19:43:28 +00:00
|
|
|
struct ext2mount *ump;
|
|
|
|
struct ext2_sb_info *fs;
|
1995-11-05 23:25:12 +00:00
|
|
|
int error, flags, ronly, i;
|
|
|
|
|
|
|
|
flags = 0;
|
|
|
|
if (mntflags & MNT_FORCE) {
|
|
|
|
if (mp->mnt_flag & MNT_ROOTFS)
|
|
|
|
return (EINVAL);
|
|
|
|
flags |= FORCECLOSE;
|
|
|
|
}
|
2001-09-12 08:38:13 +00:00
|
|
|
if ((error = ext2_flushfiles(mp, flags, td)) != 0)
|
1995-11-05 23:25:12 +00:00
|
|
|
return (error);
|
2002-05-16 19:08:03 +00:00
|
|
|
ump = VFSTOEXT2(mp);
|
1995-11-05 23:25:12 +00:00
|
|
|
fs = ump->um_e2fs;
|
|
|
|
ronly = fs->s_rd_only;
|
1998-09-26 06:18:59 +00:00
|
|
|
if (ronly == 0) {
|
|
|
|
if (fs->s_wasvalid)
|
|
|
|
fs->s_es->s_state |= EXT2_VALID_FS;
|
1995-11-05 23:25:12 +00:00
|
|
|
ext2_sbupdate(ump, MNT_WAIT);
|
|
|
|
}
|
1997-08-04 05:10:31 +00:00
|
|
|
|
1995-11-05 23:25:12 +00:00
|
|
|
/* release buffers containing group descriptors */
|
|
|
|
for(i = 0; i < fs->s_db_per_group; i++)
|
1997-08-04 05:10:31 +00:00
|
|
|
ULCK_BUF(fs->s_group_desc[i])
|
2002-05-16 19:08:03 +00:00
|
|
|
bsd_free(fs->s_group_desc, M_EXT2MNT);
|
1997-08-04 05:10:31 +00:00
|
|
|
|
1995-11-05 23:25:12 +00:00
|
|
|
/* release cached inode/block bitmaps */
|
|
|
|
for (i = 0; i < EXT2_MAX_GROUP_LOADED; i++)
|
|
|
|
if (fs->s_inode_bitmap[i])
|
1997-08-04 05:10:31 +00:00
|
|
|
ULCK_BUF(fs->s_inode_bitmap[i])
|
|
|
|
|
1995-11-05 23:25:12 +00:00
|
|
|
for (i = 0; i < EXT2_MAX_GROUP_LOADED; i++)
|
|
|
|
if (fs->s_block_bitmap[i])
|
1997-08-04 05:10:31 +00:00
|
|
|
ULCK_BUF(fs->s_block_bitmap[i])
|
1995-11-05 23:25:12 +00:00
|
|
|
|
2000-10-09 17:31:39 +00:00
|
|
|
ump->um_devvp->v_rdev->si_mountpoint = NULL;
|
1995-11-05 23:25:12 +00:00
|
|
|
error = VOP_CLOSE(ump->um_devvp, ronly ? FREAD : FREAD|FWRITE,
|
2001-09-12 08:38:13 +00:00
|
|
|
NOCRED, td);
|
1995-11-05 23:25:12 +00:00
|
|
|
vrele(ump->um_devvp);
|
2002-05-16 19:08:03 +00:00
|
|
|
bsd_free(fs->s_es, M_EXT2MNT);
|
|
|
|
bsd_free(fs, M_EXT2MNT);
|
|
|
|
bsd_free(ump, M_EXT2MNT);
|
1995-11-05 23:25:12 +00:00
|
|
|
mp->mnt_data = (qaddr_t)0;
|
|
|
|
mp->mnt_flag &= ~MNT_LOCAL;
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Flush out all the files in a filesystem.
|
|
|
|
*/
|
1995-12-17 21:14:36 +00:00
|
|
|
static int
|
2001-09-12 08:38:13 +00:00
|
|
|
ext2_flushfiles(mp, flags, td)
|
2002-05-16 19:43:28 +00:00
|
|
|
struct mount *mp;
|
1995-11-05 23:25:12 +00:00
|
|
|
int flags;
|
2001-09-12 08:38:13 +00:00
|
|
|
struct thread *td;
|
1995-11-05 23:25:12 +00:00
|
|
|
{
|
1995-11-08 04:50:00 +00:00
|
|
|
int error;
|
1995-11-05 23:25:12 +00:00
|
|
|
|
2001-05-16 18:04:37 +00:00
|
|
|
error = vflush(mp, 0, flags);
|
1995-11-05 23:25:12 +00:00
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Get file system statistics.
|
|
|
|
* taken from ext2/super.c ext2_statfs
|
|
|
|
*/
|
1995-12-17 21:14:36 +00:00
|
|
|
static int
|
2001-09-12 08:38:13 +00:00
|
|
|
ext2_statfs(mp, sbp, td)
|
1995-11-05 23:25:12 +00:00
|
|
|
struct mount *mp;
|
2002-05-16 19:43:28 +00:00
|
|
|
struct statfs *sbp;
|
2001-09-12 08:38:13 +00:00
|
|
|
struct thread *td;
|
1995-11-05 23:25:12 +00:00
|
|
|
{
|
|
|
|
unsigned long overhead;
|
2002-05-16 19:43:28 +00:00
|
|
|
struct ext2mount *ump;
|
|
|
|
struct ext2_sb_info *fs;
|
|
|
|
struct ext2_super_block *es;
|
2000-11-03 16:41:48 +00:00
|
|
|
int i, nsb;
|
1995-11-05 23:25:12 +00:00
|
|
|
|
2002-05-16 19:08:03 +00:00
|
|
|
ump = VFSTOEXT2(mp);
|
1995-11-05 23:25:12 +00:00
|
|
|
fs = ump->um_e2fs;
|
|
|
|
es = fs->s_es;
|
|
|
|
|
|
|
|
if (es->s_magic != EXT2_SUPER_MAGIC)
|
|
|
|
panic("ext2_statfs - magic number spoiled");
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Compute the overhead (FS structures)
|
|
|
|
*/
|
2000-11-03 16:41:48 +00:00
|
|
|
if (es->s_feature_ro_compat & EXT2_FEATURE_RO_COMPAT_SPARSE_SUPER) {
|
|
|
|
nsb = 0;
|
|
|
|
for (i = 0 ; i < fs->s_groups_count; i++)
|
|
|
|
if (ext2_group_sparse(i))
|
|
|
|
nsb++;
|
|
|
|
} else
|
|
|
|
nsb = fs->s_groups_count;
|
1995-11-05 23:25:12 +00:00
|
|
|
overhead = es->s_first_data_block +
|
2000-11-03 16:41:48 +00:00
|
|
|
/* Superblocks and block group descriptors: */
|
|
|
|
nsb * (1 + fs->s_db_per_group) +
|
|
|
|
/* Inode bitmap, block bitmap, and inode table: */
|
|
|
|
fs->s_groups_count * (1 + 1 + fs->s_itb_per_group);
|
1995-11-05 23:25:12 +00:00
|
|
|
|
|
|
|
sbp->f_bsize = EXT2_FRAG_SIZE(fs);
|
|
|
|
sbp->f_iosize = EXT2_BLOCK_SIZE(fs);
|
|
|
|
sbp->f_blocks = es->s_blocks_count - overhead;
|
|
|
|
sbp->f_bfree = es->s_free_blocks_count;
|
|
|
|
sbp->f_bavail = sbp->f_bfree - es->s_r_blocks_count;
|
|
|
|
sbp->f_files = es->s_inodes_count;
|
|
|
|
sbp->f_ffree = es->s_free_inodes_count;
|
|
|
|
if (sbp != &mp->mnt_stat) {
|
1998-09-07 13:17:06 +00:00
|
|
|
sbp->f_type = mp->mnt_vfc->vfc_typenum;
|
1995-11-05 23:25:12 +00:00
|
|
|
bcopy((caddr_t)mp->mnt_stat.f_mntonname,
|
|
|
|
(caddr_t)&sbp->f_mntonname[0], MNAMELEN);
|
|
|
|
bcopy((caddr_t)mp->mnt_stat.f_mntfromname,
|
|
|
|
(caddr_t)&sbp->f_mntfromname[0], MNAMELEN);
|
|
|
|
}
|
|
|
|
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'.
|
|
|
|
*/
|
1995-12-17 21:14:36 +00:00
|
|
|
static int
|
2001-09-12 08:38:13 +00:00
|
|
|
ext2_sync(mp, waitfor, cred, td)
|
1995-11-05 23:25:12 +00:00
|
|
|
struct mount *mp;
|
|
|
|
int waitfor;
|
|
|
|
struct ucred *cred;
|
2001-09-12 08:38:13 +00:00
|
|
|
struct thread *td;
|
1995-11-05 23:25:12 +00:00
|
|
|
{
|
1998-09-26 12:42:17 +00:00
|
|
|
struct vnode *nvp, *vp;
|
|
|
|
struct inode *ip;
|
2002-05-16 19:08:03 +00:00
|
|
|
struct ext2mount *ump = VFSTOEXT2(mp);
|
1998-09-26 12:42:17 +00:00
|
|
|
struct ext2_sb_info *fs;
|
1995-11-05 23:25:12 +00:00
|
|
|
int error, allerror = 0;
|
|
|
|
|
|
|
|
fs = ump->um_e2fs;
|
1998-09-26 12:42:17 +00:00
|
|
|
if (fs->s_dirt != 0 && fs->s_rd_only != 0) { /* XXX */
|
|
|
|
printf("fs = %s\n", fs->fs_fsmnt);
|
|
|
|
panic("ext2_sync: rofs mod");
|
1995-11-05 23:25:12 +00:00
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Write back each (modified) inode.
|
|
|
|
*/
|
Change and clean the mutex lock interface.
mtx_enter(lock, type) becomes:
mtx_lock(lock) for sleep locks (MTX_DEF-initialized locks)
mtx_lock_spin(lock) for spin locks (MTX_SPIN-initialized)
similarily, for releasing a lock, we now have:
mtx_unlock(lock) for MTX_DEF and mtx_unlock_spin(lock) for MTX_SPIN.
We change the caller interface for the two different types of locks
because the semantics are entirely different for each case, and this
makes it explicitly clear and, at the same time, it rids us of the
extra `type' argument.
The enter->lock and exit->unlock change has been made with the idea
that we're "locking data" and not "entering locked code" in mind.
Further, remove all additional "flags" previously passed to the
lock acquire/release routines with the exception of two:
MTX_QUIET and MTX_NOSWITCH
The functionality of these flags is preserved and they can be passed
to the lock/unlock routines by calling the corresponding wrappers:
mtx_{lock, unlock}_flags(lock, flag(s)) and
mtx_{lock, unlock}_spin_flags(lock, flag(s)) for MTX_DEF and MTX_SPIN
locks, respectively.
Re-inline some lock acq/rel code; in the sleep lock case, we only
inline the _obtain_lock()s in order to ensure that the inlined code
fits into a cache line. In the spin lock case, we inline recursion and
actually only perform a function call if we need to spin. This change
has been made with the idea that we generally tend to avoid spin locks
and that also the spin locks that we do have and are heavily used
(i.e. sched_lock) do recurse, and therefore in an effort to reduce
function call overhead for some architectures (such as alpha), we
inline recursion for this case.
Create a new malloc type for the witness code and retire from using
the M_DEV type. The new type is called M_WITNESS and is only declared
if WITNESS is enabled.
Begin cleaning up some machdep/mutex.h code - specifically updated the
"optimized" inlined code in alpha/mutex.h and wrote MTX_LOCK_SPIN
and MTX_UNLOCK_SPIN asm macros for the i386/mutex.h as we presently
need those.
Finally, caught up to the interface changes in all sys code.
Contributors: jake, jhb, jasone (in no particular order)
2001-02-09 06:11:45 +00:00
|
|
|
mtx_lock(&mntvnode_mtx);
|
1995-11-05 23:25:12 +00:00
|
|
|
loop:
|
2001-10-23 01:21:29 +00:00
|
|
|
for (vp = TAILQ_FIRST(&mp->mnt_nvnodelist); vp != NULL; vp = nvp) {
|
1995-11-05 23:25:12 +00: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;
|
2001-10-23 01:21:29 +00:00
|
|
|
nvp = TAILQ_NEXT(vp, v_nmntvnodes);
|
2001-06-28 03:52:04 +00:00
|
|
|
mtx_unlock(&mntvnode_mtx);
|
2002-09-25 02:34:56 +00:00
|
|
|
VI_LOCK(vp);
|
1995-11-05 23:25:12 +00:00
|
|
|
ip = VTOI(vp);
|
1998-09-26 12:42:17 +00:00
|
|
|
if (vp->v_type == VNON ||
|
1999-01-27 23:45:44 +00:00
|
|
|
((ip->i_flag &
|
1995-11-05 23:25:12 +00:00
|
|
|
(IN_ACCESS | IN_CHANGE | IN_MODIFIED | IN_UPDATE)) == 0 &&
|
1999-01-29 15:36:05 +00:00
|
|
|
(TAILQ_EMPTY(&vp->v_dirtyblkhd) || waitfor == MNT_LAZY))) {
|
2002-09-25 02:34:56 +00:00
|
|
|
VI_UNLOCK(vp);
|
2001-06-28 03:52:04 +00:00
|
|
|
mtx_lock(&mntvnode_mtx);
|
1995-11-05 23:25:12 +00:00
|
|
|
continue;
|
1998-09-26 12:42:17 +00:00
|
|
|
}
|
2001-09-12 08:38:13 +00:00
|
|
|
error = vget(vp, LK_EXCLUSIVE | LK_NOWAIT | LK_INTERLOCK, td);
|
1998-09-26 12:42:17 +00:00
|
|
|
if (error) {
|
Change and clean the mutex lock interface.
mtx_enter(lock, type) becomes:
mtx_lock(lock) for sleep locks (MTX_DEF-initialized locks)
mtx_lock_spin(lock) for spin locks (MTX_SPIN-initialized)
similarily, for releasing a lock, we now have:
mtx_unlock(lock) for MTX_DEF and mtx_unlock_spin(lock) for MTX_SPIN.
We change the caller interface for the two different types of locks
because the semantics are entirely different for each case, and this
makes it explicitly clear and, at the same time, it rids us of the
extra `type' argument.
The enter->lock and exit->unlock change has been made with the idea
that we're "locking data" and not "entering locked code" in mind.
Further, remove all additional "flags" previously passed to the
lock acquire/release routines with the exception of two:
MTX_QUIET and MTX_NOSWITCH
The functionality of these flags is preserved and they can be passed
to the lock/unlock routines by calling the corresponding wrappers:
mtx_{lock, unlock}_flags(lock, flag(s)) and
mtx_{lock, unlock}_spin_flags(lock, flag(s)) for MTX_DEF and MTX_SPIN
locks, respectively.
Re-inline some lock acq/rel code; in the sleep lock case, we only
inline the _obtain_lock()s in order to ensure that the inlined code
fits into a cache line. In the spin lock case, we inline recursion and
actually only perform a function call if we need to spin. This change
has been made with the idea that we generally tend to avoid spin locks
and that also the spin locks that we do have and are heavily used
(i.e. sched_lock) do recurse, and therefore in an effort to reduce
function call overhead for some architectures (such as alpha), we
inline recursion for this case.
Create a new malloc type for the witness code and retire from using
the M_DEV type. The new type is called M_WITNESS and is only declared
if WITNESS is enabled.
Begin cleaning up some machdep/mutex.h code - specifically updated the
"optimized" inlined code in alpha/mutex.h and wrote MTX_LOCK_SPIN
and MTX_UNLOCK_SPIN asm macros for the i386/mutex.h as we presently
need those.
Finally, caught up to the interface changes in all sys code.
Contributors: jake, jhb, jasone (in no particular order)
2001-02-09 06:11:45 +00:00
|
|
|
mtx_lock(&mntvnode_mtx);
|
1998-09-26 12:42:17 +00:00
|
|
|
if (error == ENOENT)
|
|
|
|
goto loop;
|
|
|
|
continue;
|
|
|
|
}
|
2001-09-12 08:38:13 +00:00
|
|
|
if ((error = VOP_FSYNC(vp, cred, waitfor, td)) != 0)
|
1995-11-05 23:25:12 +00:00
|
|
|
allerror = error;
|
2001-09-12 08:38:13 +00:00
|
|
|
VOP_UNLOCK(vp, 0, td);
|
1998-09-26 12:42:17 +00:00
|
|
|
vrele(vp);
|
Change and clean the mutex lock interface.
mtx_enter(lock, type) becomes:
mtx_lock(lock) for sleep locks (MTX_DEF-initialized locks)
mtx_lock_spin(lock) for spin locks (MTX_SPIN-initialized)
similarily, for releasing a lock, we now have:
mtx_unlock(lock) for MTX_DEF and mtx_unlock_spin(lock) for MTX_SPIN.
We change the caller interface for the two different types of locks
because the semantics are entirely different for each case, and this
makes it explicitly clear and, at the same time, it rids us of the
extra `type' argument.
The enter->lock and exit->unlock change has been made with the idea
that we're "locking data" and not "entering locked code" in mind.
Further, remove all additional "flags" previously passed to the
lock acquire/release routines with the exception of two:
MTX_QUIET and MTX_NOSWITCH
The functionality of these flags is preserved and they can be passed
to the lock/unlock routines by calling the corresponding wrappers:
mtx_{lock, unlock}_flags(lock, flag(s)) and
mtx_{lock, unlock}_spin_flags(lock, flag(s)) for MTX_DEF and MTX_SPIN
locks, respectively.
Re-inline some lock acq/rel code; in the sleep lock case, we only
inline the _obtain_lock()s in order to ensure that the inlined code
fits into a cache line. In the spin lock case, we inline recursion and
actually only perform a function call if we need to spin. This change
has been made with the idea that we generally tend to avoid spin locks
and that also the spin locks that we do have and are heavily used
(i.e. sched_lock) do recurse, and therefore in an effort to reduce
function call overhead for some architectures (such as alpha), we
inline recursion for this case.
Create a new malloc type for the witness code and retire from using
the M_DEV type. The new type is called M_WITNESS and is only declared
if WITNESS is enabled.
Begin cleaning up some machdep/mutex.h code - specifically updated the
"optimized" inlined code in alpha/mutex.h and wrote MTX_LOCK_SPIN
and MTX_UNLOCK_SPIN asm macros for the i386/mutex.h as we presently
need those.
Finally, caught up to the interface changes in all sys code.
Contributors: jake, jhb, jasone (in no particular order)
2001-02-09 06:11:45 +00:00
|
|
|
mtx_lock(&mntvnode_mtx);
|
1995-11-05 23:25:12 +00:00
|
|
|
}
|
Change and clean the mutex lock interface.
mtx_enter(lock, type) becomes:
mtx_lock(lock) for sleep locks (MTX_DEF-initialized locks)
mtx_lock_spin(lock) for spin locks (MTX_SPIN-initialized)
similarily, for releasing a lock, we now have:
mtx_unlock(lock) for MTX_DEF and mtx_unlock_spin(lock) for MTX_SPIN.
We change the caller interface for the two different types of locks
because the semantics are entirely different for each case, and this
makes it explicitly clear and, at the same time, it rids us of the
extra `type' argument.
The enter->lock and exit->unlock change has been made with the idea
that we're "locking data" and not "entering locked code" in mind.
Further, remove all additional "flags" previously passed to the
lock acquire/release routines with the exception of two:
MTX_QUIET and MTX_NOSWITCH
The functionality of these flags is preserved and they can be passed
to the lock/unlock routines by calling the corresponding wrappers:
mtx_{lock, unlock}_flags(lock, flag(s)) and
mtx_{lock, unlock}_spin_flags(lock, flag(s)) for MTX_DEF and MTX_SPIN
locks, respectively.
Re-inline some lock acq/rel code; in the sleep lock case, we only
inline the _obtain_lock()s in order to ensure that the inlined code
fits into a cache line. In the spin lock case, we inline recursion and
actually only perform a function call if we need to spin. This change
has been made with the idea that we generally tend to avoid spin locks
and that also the spin locks that we do have and are heavily used
(i.e. sched_lock) do recurse, and therefore in an effort to reduce
function call overhead for some architectures (such as alpha), we
inline recursion for this case.
Create a new malloc type for the witness code and retire from using
the M_DEV type. The new type is called M_WITNESS and is only declared
if WITNESS is enabled.
Begin cleaning up some machdep/mutex.h code - specifically updated the
"optimized" inlined code in alpha/mutex.h and wrote MTX_LOCK_SPIN
and MTX_UNLOCK_SPIN asm macros for the i386/mutex.h as we presently
need those.
Finally, caught up to the interface changes in all sys code.
Contributors: jake, jhb, jasone (in no particular order)
2001-02-09 06:11:45 +00:00
|
|
|
mtx_unlock(&mntvnode_mtx);
|
1995-11-05 23:25:12 +00:00
|
|
|
/*
|
|
|
|
* Force stale file system control information to be flushed.
|
|
|
|
*/
|
1998-09-26 12:42:17 +00:00
|
|
|
if (waitfor != MNT_LAZY) {
|
2001-09-12 08:38:13 +00:00
|
|
|
vn_lock(ump->um_devvp, LK_EXCLUSIVE | LK_RETRY, td);
|
|
|
|
if ((error = VOP_FSYNC(ump->um_devvp, cred, waitfor, td)) != 0)
|
1998-09-26 12:42:17 +00:00
|
|
|
allerror = error;
|
2001-09-12 08:38:13 +00:00
|
|
|
VOP_UNLOCK(ump->um_devvp, 0, td);
|
1998-09-26 12:42:17 +00:00
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Write back modified superblock.
|
|
|
|
*/
|
|
|
|
if (fs->s_dirt != 0) {
|
|
|
|
fs->s_dirt = 0;
|
|
|
|
fs->s_es->s_wtime = time_second;
|
|
|
|
if ((error = ext2_sbupdate(ump, waitfor)) != 0)
|
|
|
|
allerror = error;
|
|
|
|
}
|
1995-11-05 23:25:12 +00:00
|
|
|
return (allerror);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2003-01-01 18:49:04 +00:00
|
|
|
* Look up an EXT2FS dinode number to find its incore vnode, otherwise read it
|
1995-11-05 23:25:12 +00:00
|
|
|
* 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.
|
|
|
|
*/
|
1995-12-17 21:14:36 +00:00
|
|
|
static int
|
2002-03-17 01:25:47 +00:00
|
|
|
ext2_vget(mp, ino, flags, vpp)
|
1995-11-05 23:25:12 +00:00
|
|
|
struct mount *mp;
|
|
|
|
ino_t ino;
|
2002-03-17 01:25:47 +00:00
|
|
|
int flags;
|
1995-11-05 23:25:12 +00:00
|
|
|
struct vnode **vpp;
|
|
|
|
{
|
2002-05-16 19:43:28 +00:00
|
|
|
struct ext2_sb_info *fs;
|
|
|
|
struct inode *ip;
|
2002-05-16 19:08:03 +00:00
|
|
|
struct ext2mount *ump;
|
1995-11-05 23:25:12 +00:00
|
|
|
struct buf *bp;
|
|
|
|
struct vnode *vp;
|
|
|
|
dev_t dev;
|
1997-10-10 18:13:06 +00:00
|
|
|
int i, error;
|
1995-11-05 23:25:12 +00:00
|
|
|
int used_blocks;
|
|
|
|
|
2002-05-16 19:08:03 +00:00
|
|
|
ump = VFSTOEXT2(mp);
|
1995-11-05 23:25:12 +00:00
|
|
|
dev = ump->um_dev;
|
1995-11-19 20:24:15 +00:00
|
|
|
restart:
|
2002-05-16 19:08:03 +00:00
|
|
|
if ((error = ext2_ihashget(dev, ino, flags, vpp)) != 0)
|
2002-03-17 01:25:47 +00:00
|
|
|
return (error);
|
|
|
|
if (*vpp != NULL)
|
1995-11-05 23:25:12 +00:00
|
|
|
return (0);
|
|
|
|
|
1995-11-19 20:24:15 +00:00
|
|
|
/*
|
|
|
|
* Lock out the creation of new entries in the FFS hash table in
|
|
|
|
* case getnewvnode() or MALLOC() blocks, otherwise a duplicate
|
|
|
|
* may occur!
|
|
|
|
*/
|
|
|
|
if (ext2fs_inode_hash_lock) {
|
|
|
|
while (ext2fs_inode_hash_lock) {
|
|
|
|
ext2fs_inode_hash_lock = -1;
|
1998-05-16 17:47:44 +00:00
|
|
|
tsleep(&ext2fs_inode_hash_lock, PVM, "e2vget", 0);
|
1995-11-19 20:24:15 +00:00
|
|
|
}
|
|
|
|
goto restart;
|
|
|
|
}
|
|
|
|
ext2fs_inode_hash_lock = 1;
|
|
|
|
|
1998-05-16 17:47:44 +00:00
|
|
|
/*
|
|
|
|
* If this MALLOC() is performed after the getnewvnode()
|
|
|
|
* it might block, leaving a vnode with a NULL v_data to be
|
|
|
|
* found by ext2_sync() if a sync happens to fire right then,
|
|
|
|
* which will cause a panic because ext2_sync() blindly
|
|
|
|
* dereferences vp->v_data (as well it should).
|
|
|
|
*/
|
2003-02-19 05:47:46 +00:00
|
|
|
MALLOC(ip, struct inode *, sizeof(struct inode), M_EXT2NODE, M_WAITOK);
|
1998-05-16 17:47:44 +00:00
|
|
|
|
1995-11-05 23:25:12 +00:00
|
|
|
/* Allocate a new vnode/inode. */
|
2002-09-14 09:02:28 +00:00
|
|
|
if ((error = getnewvnode("ext2fs", mp, ext2_vnodeop_p, &vp)) != 0) {
|
1998-05-16 17:47:44 +00:00
|
|
|
if (ext2fs_inode_hash_lock < 0)
|
|
|
|
wakeup(&ext2fs_inode_hash_lock);
|
|
|
|
ext2fs_inode_hash_lock = 0;
|
1995-11-05 23:25:12 +00:00
|
|
|
*vpp = NULL;
|
1998-05-16 17:47:44 +00:00
|
|
|
FREE(ip, M_EXT2NODE);
|
1995-11-05 23:25:12 +00:00
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
bzero((caddr_t)ip, sizeof(struct inode));
|
|
|
|
vp->v_data = ip;
|
|
|
|
ip->i_vnode = vp;
|
|
|
|
ip->i_e2fs = fs = ump->um_e2fs;
|
|
|
|
ip->i_dev = dev;
|
|
|
|
ip->i_number = ino;
|
|
|
|
/*
|
|
|
|
* 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.
|
|
|
|
*/
|
2002-05-16 19:08:03 +00:00
|
|
|
ext2_ihashins(ip);
|
1995-11-05 23:25:12 +00:00
|
|
|
|
1995-11-19 20:24:15 +00:00
|
|
|
if (ext2fs_inode_hash_lock < 0)
|
|
|
|
wakeup(&ext2fs_inode_hash_lock);
|
|
|
|
ext2fs_inode_hash_lock = 0;
|
|
|
|
|
|
|
|
/* Read in the disk contents for the inode, copy into the inode. */
|
1995-11-05 23:25:12 +00:00
|
|
|
#if 0
|
|
|
|
printf("ext2_vget(%d) dbn= %d ", ino, fsbtodb(fs, ino_to_fsba(fs, ino)));
|
|
|
|
#endif
|
1999-01-27 21:50:00 +00:00
|
|
|
if ((error = bread(ump->um_devvp, fsbtodb(fs, ino_to_fsba(fs, ino)),
|
|
|
|
(int)fs->s_blocksize, NOCRED, &bp)) != 0) {
|
1995-11-05 23:25:12 +00: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().
|
|
|
|
*/
|
|
|
|
vput(vp);
|
|
|
|
brelse(bp);
|
|
|
|
*vpp = NULL;
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
/* convert ext2 inode to dinode */
|
2002-05-16 19:08:03 +00:00
|
|
|
ext2_ei2i((struct ext2_inode *) ((char *)bp->b_data + EXT2_INODE_SIZE *
|
|
|
|
ino_to_fsbo(fs, ino)), ip);
|
1995-11-05 23:25:12 +00:00
|
|
|
ip->i_block_group = ino_to_cg(fs, ino);
|
|
|
|
ip->i_next_alloc_block = 0;
|
|
|
|
ip->i_next_alloc_goal = 0;
|
|
|
|
ip->i_prealloc_count = 0;
|
|
|
|
ip->i_prealloc_block = 0;
|
|
|
|
/* now we want to make sure that block pointers for unused
|
|
|
|
blocks are zeroed out - ext2_balloc depends on this
|
|
|
|
although for regular files and directories only
|
|
|
|
*/
|
|
|
|
if(S_ISDIR(ip->i_mode) || S_ISREG(ip->i_mode)) {
|
|
|
|
used_blocks = (ip->i_size+fs->s_blocksize-1) / fs->s_blocksize;
|
|
|
|
for(i = used_blocks; i < EXT2_NDIR_BLOCKS; i++)
|
|
|
|
ip->i_db[i] = 0;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
ext2_print_inode(ip);
|
|
|
|
*/
|
|
|
|
brelse(bp);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Initialize the vnode from the inode, check for aliases.
|
|
|
|
* Note that the underlying vnode may have changed.
|
|
|
|
*/
|
2002-05-16 19:08:03 +00:00
|
|
|
if ((error = ext2_vinit(mp, ext2_specop_p, ext2_fifoop_p, &vp)) != 0) {
|
1995-11-05 23:25:12 +00:00
|
|
|
vput(vp);
|
|
|
|
*vpp = NULL;
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Finish inode initialization now that aliasing has been resolved.
|
|
|
|
*/
|
|
|
|
ip->i_devvp = ump->um_devvp;
|
|
|
|
VREF(ip->i_devvp);
|
|
|
|
/*
|
|
|
|
* Set up a generation number for this inode if it does not
|
|
|
|
* already have one. This should only happen on old filesystems.
|
|
|
|
*/
|
|
|
|
if (ip->i_gen == 0) {
|
1997-12-02 11:42:28 +00:00
|
|
|
ip->i_gen = random() / 2 + 1;
|
1995-11-05 23:25:12 +00:00
|
|
|
if ((vp->v_mount->mnt_flag & MNT_RDONLY) == 0)
|
|
|
|
ip->i_flag |= IN_MODIFIED;
|
|
|
|
}
|
|
|
|
*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 ext2_vget() to get the locked inode
|
|
|
|
* - check for an unallocated inode (i_mode == 0)
|
|
|
|
* - check that the given client host has export rights and return
|
|
|
|
* those rights via. exflagsp and credanonp
|
|
|
|
*/
|
1995-12-17 21:14:36 +00:00
|
|
|
static int
|
1999-09-11 00:46:08 +00:00
|
|
|
ext2_fhtovp(mp, fhp, vpp)
|
2002-05-16 19:43:28 +00:00
|
|
|
struct mount *mp;
|
1995-11-05 23:25:12 +00:00
|
|
|
struct fid *fhp;
|
|
|
|
struct vnode **vpp;
|
|
|
|
{
|
2002-05-16 19:08:03 +00:00
|
|
|
struct inode *ip;
|
2002-05-16 19:43:28 +00:00
|
|
|
struct ufid *ufhp;
|
2002-05-16 19:08:03 +00:00
|
|
|
struct vnode *nvp;
|
1995-11-05 23:25:12 +00:00
|
|
|
struct ext2_sb_info *fs;
|
2002-05-16 19:08:03 +00:00
|
|
|
int error;
|
1995-11-05 23:25:12 +00:00
|
|
|
|
|
|
|
ufhp = (struct ufid *)fhp;
|
2002-05-16 19:08:03 +00:00
|
|
|
fs = VFSTOEXT2(mp)->um_e2fs;
|
1995-11-05 23:25:12 +00:00
|
|
|
if (ufhp->ufid_ino < ROOTINO ||
|
2002-05-18 21:33:07 +00:00
|
|
|
ufhp->ufid_ino > fs->s_groups_count * fs->s_es->s_inodes_per_group)
|
1995-11-05 23:25:12 +00:00
|
|
|
return (ESTALE);
|
2002-05-16 19:08:03 +00:00
|
|
|
|
|
|
|
error = VFS_VGET(mp, ufhp->ufid_ino, LK_EXCLUSIVE, &nvp);
|
|
|
|
if (error) {
|
|
|
|
*vpp = NULLVP;
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
ip = VTOI(nvp);
|
|
|
|
if (ip->i_mode == 0 ||
|
|
|
|
ip->i_gen != ufhp->ufid_gen || ip->i_nlink <= 0) {
|
|
|
|
vput(nvp);
|
|
|
|
*vpp = NULLVP;
|
|
|
|
return (ESTALE);
|
|
|
|
}
|
|
|
|
*vpp = nvp;
|
|
|
|
return (0);
|
1995-11-05 23:25:12 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Vnode pointer to File handle
|
|
|
|
*/
|
|
|
|
/* ARGSUSED */
|
1995-12-17 21:14:36 +00:00
|
|
|
static int
|
1995-11-05 23:25:12 +00:00
|
|
|
ext2_vptofh(vp, fhp)
|
|
|
|
struct vnode *vp;
|
|
|
|
struct fid *fhp;
|
|
|
|
{
|
2002-05-16 19:43:28 +00:00
|
|
|
struct inode *ip;
|
|
|
|
struct ufid *ufhp;
|
1995-11-05 23:25:12 +00: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_gen;
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Write a superblock and associated information back to disk.
|
|
|
|
*/
|
1995-12-17 21:14:36 +00:00
|
|
|
static int
|
1995-11-05 23:25:12 +00:00
|
|
|
ext2_sbupdate(mp, waitfor)
|
2002-05-16 19:08:03 +00:00
|
|
|
struct ext2mount *mp;
|
1995-11-05 23:25:12 +00:00
|
|
|
int waitfor;
|
|
|
|
{
|
2002-05-16 19:43:28 +00:00
|
|
|
struct ext2_sb_info *fs = mp->um_e2fs;
|
|
|
|
struct ext2_super_block *es = fs->s_es;
|
|
|
|
struct buf *bp;
|
1998-12-07 21:58:50 +00:00
|
|
|
int error = 0;
|
1995-11-05 23:25:12 +00:00
|
|
|
/*
|
|
|
|
printf("\nupdating superblock, waitfor=%s\n", waitfor == MNT_WAIT ? "yes":"no");
|
|
|
|
*/
|
|
|
|
bp = getblk(mp->um_devvp, SBLOCK, SBSIZE, 0, 0);
|
|
|
|
bcopy((caddr_t)es, bp->b_data, (u_int)sizeof(struct ext2_super_block));
|
|
|
|
if (waitfor == MNT_WAIT)
|
|
|
|
error = bwrite(bp);
|
|
|
|
else
|
|
|
|
bawrite(bp);
|
|
|
|
|
1997-08-04 05:10:31 +00:00
|
|
|
/*
|
|
|
|
* The buffers for group descriptors, inode bitmaps and block bitmaps
|
|
|
|
* are not busy at this point and are (hopefully) written by the
|
|
|
|
* usual sync mechanism. No need to write them here
|
1995-11-05 23:25:12 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
return (error);
|
|
|
|
}
|
2002-05-16 19:08:03 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Return the root of a filesystem.
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
ext2_root(mp, vpp)
|
|
|
|
struct mount *mp;
|
|
|
|
struct vnode **vpp;
|
|
|
|
{
|
|
|
|
struct vnode *nvp;
|
|
|
|
int error;
|
|
|
|
|
|
|
|
error = VFS_VGET(mp, (ino_t)ROOTINO, LK_EXCLUSIVE, &nvp);
|
|
|
|
if (error)
|
|
|
|
return (error);
|
|
|
|
*vpp = nvp;
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
ext2_init(struct vfsconf *vfsp)
|
|
|
|
{
|
|
|
|
|
|
|
|
ext2_ihashinit();
|
2002-05-18 22:18:17 +00:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
ext2_uninit(struct vfsconf *vfsp)
|
|
|
|
{
|
2002-05-16 19:08:03 +00:00
|
|
|
|
2002-05-18 22:18:17 +00:00
|
|
|
ext2_ihashuninit();
|
2002-05-16 19:08:03 +00:00
|
|
|
return (0);
|
|
|
|
}
|