2000-05-16 21:20:23 +04:00
|
|
|
/* $NetBSD: mfs_vnops.c,v 1.22 2000/05/16 17:20:23 thorpej Exp $ */
|
|
|
|
|
|
|
|
/*-
|
|
|
|
* Copyright (c) 2000 The NetBSD Foundation, Inc.
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* This code is derived from software contributed to The NetBSD Foundation
|
|
|
|
* by Jason R. Thorpe of Zembu Labs, Inc.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
|
|
* must display the following acknowledgement:
|
|
|
|
* This product includes software developed by the NetBSD
|
|
|
|
* Foundation, Inc. and its contributors.
|
|
|
|
* 4. Neither the name of The NetBSD Foundation nor the names of its
|
|
|
|
* contributors may be used to endorse or promote products derived
|
|
|
|
* from this software without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
|
|
|
|
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
|
|
|
|
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
|
|
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
|
|
|
|
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
1994-06-29 10:39:25 +04:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1989, 1993
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
|
|
* must display the following acknowledgement:
|
|
|
|
* This product includes software developed by the University of
|
|
|
|
* California, Berkeley and its contributors.
|
|
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*
|
1998-03-01 05:20:01 +03:00
|
|
|
* @(#)mfs_vnops.c 8.11 (Berkeley) 5/22/95
|
1994-06-08 15:41:58 +04:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/systm.h>
|
|
|
|
#include <sys/time.h>
|
|
|
|
#include <sys/kernel.h>
|
|
|
|
#include <sys/proc.h>
|
|
|
|
#include <sys/buf.h>
|
|
|
|
#include <sys/map.h>
|
|
|
|
#include <sys/vnode.h>
|
|
|
|
#include <sys/malloc.h>
|
2000-05-16 21:20:23 +04:00
|
|
|
#include <sys/uio.h>
|
|
|
|
|
|
|
|
#include <vm/vm.h>
|
|
|
|
#include <uvm/uvm_extern.h>
|
1994-06-08 15:41:58 +04:00
|
|
|
|
1996-09-02 03:47:48 +04:00
|
|
|
#include <miscfs/genfs/genfs.h>
|
1994-06-08 15:41:58 +04:00
|
|
|
#include <miscfs/specfs/specdev.h>
|
|
|
|
|
|
|
|
#include <ufs/mfs/mfsnode.h>
|
|
|
|
#include <ufs/mfs/mfs_extern.h>
|
|
|
|
|
|
|
|
/*
|
|
|
|
* mfs vnode operations.
|
|
|
|
*/
|
1996-02-10 01:31:27 +03:00
|
|
|
int (**mfs_vnodeop_p) __P((void *));
|
1994-06-08 15:41:58 +04:00
|
|
|
struct vnodeopv_entry_desc mfs_vnodeop_entries[] = {
|
|
|
|
{ &vop_default_desc, vn_default_error },
|
|
|
|
{ &vop_lookup_desc, mfs_lookup }, /* lookup */
|
|
|
|
{ &vop_create_desc, mfs_create }, /* create */
|
|
|
|
{ &vop_mknod_desc, mfs_mknod }, /* mknod */
|
|
|
|
{ &vop_open_desc, mfs_open }, /* open */
|
|
|
|
{ &vop_close_desc, mfs_close }, /* close */
|
|
|
|
{ &vop_access_desc, mfs_access }, /* access */
|
|
|
|
{ &vop_getattr_desc, mfs_getattr }, /* getattr */
|
|
|
|
{ &vop_setattr_desc, mfs_setattr }, /* setattr */
|
|
|
|
{ &vop_read_desc, mfs_read }, /* read */
|
|
|
|
{ &vop_write_desc, mfs_write }, /* write */
|
|
|
|
{ &vop_ioctl_desc, mfs_ioctl }, /* ioctl */
|
1996-09-07 16:40:22 +04:00
|
|
|
{ &vop_poll_desc, mfs_poll }, /* poll */
|
1998-03-01 05:20:01 +03:00
|
|
|
{ &vop_revoke_desc, mfs_revoke }, /* revoke */
|
1994-06-08 15:41:58 +04:00
|
|
|
{ &vop_mmap_desc, mfs_mmap }, /* mmap */
|
|
|
|
{ &vop_fsync_desc, spec_fsync }, /* fsync */
|
|
|
|
{ &vop_seek_desc, mfs_seek }, /* seek */
|
|
|
|
{ &vop_remove_desc, mfs_remove }, /* remove */
|
|
|
|
{ &vop_link_desc, mfs_link }, /* link */
|
|
|
|
{ &vop_rename_desc, mfs_rename }, /* rename */
|
|
|
|
{ &vop_mkdir_desc, mfs_mkdir }, /* mkdir */
|
|
|
|
{ &vop_rmdir_desc, mfs_rmdir }, /* rmdir */
|
|
|
|
{ &vop_symlink_desc, mfs_symlink }, /* symlink */
|
|
|
|
{ &vop_readdir_desc, mfs_readdir }, /* readdir */
|
|
|
|
{ &vop_readlink_desc, mfs_readlink }, /* readlink */
|
|
|
|
{ &vop_abortop_desc, mfs_abortop }, /* abortop */
|
|
|
|
{ &vop_inactive_desc, mfs_inactive }, /* inactive */
|
|
|
|
{ &vop_reclaim_desc, mfs_reclaim }, /* reclaim */
|
|
|
|
{ &vop_lock_desc, mfs_lock }, /* lock */
|
|
|
|
{ &vop_unlock_desc, mfs_unlock }, /* unlock */
|
|
|
|
{ &vop_bmap_desc, mfs_bmap }, /* bmap */
|
|
|
|
{ &vop_strategy_desc, mfs_strategy }, /* strategy */
|
|
|
|
{ &vop_print_desc, mfs_print }, /* print */
|
|
|
|
{ &vop_islocked_desc, mfs_islocked }, /* islocked */
|
|
|
|
{ &vop_pathconf_desc, mfs_pathconf }, /* pathconf */
|
|
|
|
{ &vop_advlock_desc, mfs_advlock }, /* advlock */
|
|
|
|
{ &vop_blkatoff_desc, mfs_blkatoff }, /* blkatoff */
|
|
|
|
{ &vop_valloc_desc, mfs_valloc }, /* valloc */
|
|
|
|
{ &vop_vfree_desc, mfs_vfree }, /* vfree */
|
|
|
|
{ &vop_truncate_desc, mfs_truncate }, /* truncate */
|
|
|
|
{ &vop_update_desc, mfs_update }, /* update */
|
|
|
|
{ &vop_bwrite_desc, mfs_bwrite }, /* bwrite */
|
1996-02-10 01:31:27 +03:00
|
|
|
{ (struct vnodeop_desc*)NULL, (int(*) __P((void *)))NULL }
|
1994-06-08 15:41:58 +04:00
|
|
|
};
|
|
|
|
struct vnodeopv_desc mfs_vnodeop_opv_desc =
|
|
|
|
{ &mfs_vnodeop_p, mfs_vnodeop_entries };
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Vnode Operations.
|
|
|
|
*
|
|
|
|
* Open called to allow memory filesystem to initialize and
|
|
|
|
* validate before actual IO. Record our process identifier
|
|
|
|
* so we can tell when we are doing I/O to ourself.
|
|
|
|
*/
|
|
|
|
/* ARGSUSED */
|
|
|
|
int
|
1996-02-10 01:31:27 +03:00
|
|
|
mfs_open(v)
|
|
|
|
void *v;
|
|
|
|
{
|
1994-06-08 15:41:58 +04:00
|
|
|
struct vop_open_args /* {
|
|
|
|
struct vnode *a_vp;
|
|
|
|
int a_mode;
|
|
|
|
struct ucred *a_cred;
|
|
|
|
struct proc *a_p;
|
1996-02-10 01:31:27 +03:00
|
|
|
} */ *ap = v;
|
1994-06-08 15:41:58 +04:00
|
|
|
|
|
|
|
if (ap->a_vp->v_type != VBLK) {
|
|
|
|
panic("mfs_ioctl not VBLK");
|
|
|
|
/* NOTREACHED */
|
|
|
|
}
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Pass I/O requests to the memory filesystem process.
|
|
|
|
*/
|
|
|
|
int
|
1996-02-10 01:31:27 +03:00
|
|
|
mfs_strategy(v)
|
|
|
|
void *v;
|
|
|
|
{
|
1994-06-08 15:41:58 +04:00
|
|
|
struct vop_strategy_args /* {
|
|
|
|
struct buf *a_bp;
|
1996-02-10 01:31:27 +03:00
|
|
|
} */ *ap = v;
|
2000-03-30 16:41:09 +04:00
|
|
|
struct buf *bp = ap->a_bp;
|
|
|
|
struct mfsnode *mfsp;
|
1994-06-08 15:41:58 +04:00
|
|
|
struct vnode *vp;
|
2000-05-16 21:20:23 +04:00
|
|
|
struct proc *p;
|
|
|
|
struct uio auio;
|
|
|
|
struct iovec aiov;
|
|
|
|
caddr_t base;
|
1994-06-08 15:41:58 +04:00
|
|
|
|
|
|
|
if (!vfinddev(bp->b_dev, VBLK, &vp) || vp->v_usecount == 0)
|
|
|
|
panic("mfs_strategy: bad dev");
|
2000-05-16 21:20:23 +04:00
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
mfsp = VTOMFS(vp);
|
2000-05-16 21:20:23 +04:00
|
|
|
p = mfsp->mfs_proc;
|
|
|
|
|
|
|
|
bp->b_error = 0;
|
|
|
|
|
|
|
|
base = mfsp->mfs_baseoff + (bp->b_blkno << DEV_BSHIFT);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We have to preserve order, so what we do here is put
|
|
|
|
* ourselves on the end of the queue and then wait for
|
|
|
|
* our buffer to bubble to the front. This is necessary
|
|
|
|
* in case we sleep faulting in the pages for the I/O
|
|
|
|
* and another process comes in to do I/O while we're
|
|
|
|
* sleeping.
|
|
|
|
*
|
|
|
|
* The fact that our buffer is still at the front of
|
|
|
|
* the queue while we process the I/O serves as a
|
|
|
|
* mutex.
|
|
|
|
*/
|
|
|
|
BUFQ_INSERT_TAIL(&mfsp->mfs_buflist, bp);
|
|
|
|
while (BUFQ_FIRST(&mfsp->mfs_buflist) != bp)
|
|
|
|
(void) tsleep(&mfsp->mfs_buflist, PRIBIO,
|
|
|
|
"mfsio", 0);
|
1994-06-08 15:41:58 +04:00
|
|
|
|
2000-05-16 21:20:23 +04:00
|
|
|
if (mfsp->mfs_proc == NULL) {
|
|
|
|
/*
|
|
|
|
* Access to kernel-space miniroot.
|
|
|
|
*/
|
1994-06-08 15:41:58 +04:00
|
|
|
if (bp->b_flags & B_READ)
|
1998-08-10 00:15:38 +04:00
|
|
|
memcpy(bp->b_data, base, bp->b_bcount);
|
1994-06-08 15:41:58 +04:00
|
|
|
else
|
1998-08-10 00:15:38 +04:00
|
|
|
memcpy(base, bp->b_data, bp->b_bcount);
|
2000-05-16 21:20:23 +04:00
|
|
|
} else if (mfsp->mfs_proc == curproc) {
|
|
|
|
/*
|
|
|
|
* The MFS server process is doing the I/O itself
|
|
|
|
* (possibly unmounting the file system). Do the
|
|
|
|
* I/O to the address space directly.
|
|
|
|
*/
|
|
|
|
if (bp->b_flags & B_READ)
|
|
|
|
bp->b_error = copyin(base, bp->b_data, bp->b_bcount);
|
|
|
|
else
|
|
|
|
bp->b_error = copyout(bp->b_data, base, bp->b_bcount);
|
1994-06-08 15:41:58 +04:00
|
|
|
} else {
|
2000-05-16 21:20:23 +04:00
|
|
|
aiov.iov_base = bp->b_data;
|
|
|
|
aiov.iov_len = bp->b_bcount;
|
1994-06-08 15:41:58 +04:00
|
|
|
|
2000-05-16 21:20:23 +04:00
|
|
|
auio.uio_iov = &aiov;
|
|
|
|
auio.uio_iovcnt = 1;
|
|
|
|
auio.uio_offset = (vaddr_t)base;
|
|
|
|
auio.uio_resid = bp->b_bcount;
|
|
|
|
auio.uio_segflg = UIO_SYSSPACE;
|
|
|
|
auio.uio_rw = (bp->b_flags & B_READ) ? UIO_READ : UIO_WRITE;
|
|
|
|
auio.uio_procp = p;
|
|
|
|
|
|
|
|
/* XXXCDC: how should locking work here? */
|
|
|
|
if ((p->p_flag & P_WEXIT) || (p->p_vmspace->vm_refcnt < 1)) {
|
|
|
|
bp->b_error = EFAULT;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* XXX I don't think PHOLD()/PRELE() is really necessary,
|
|
|
|
* XXX here. --thorpej
|
|
|
|
*/
|
|
|
|
|
|
|
|
PHOLD(p); /* XXX */
|
|
|
|
p->p_vmspace->vm_refcnt++; /* XXX */
|
|
|
|
bp->b_error = uvm_io(&p->p_vmspace->vm_map, &auio);
|
|
|
|
PRELE(p); /* XXX */
|
|
|
|
p->p_vmspace->vm_refcnt--; /* XXX */
|
|
|
|
}
|
|
|
|
out:
|
|
|
|
if (bp->b_error != 0)
|
1994-06-08 15:41:58 +04:00
|
|
|
bp->b_flags |= B_ERROR;
|
1999-03-15 03:18:24 +03:00
|
|
|
else
|
|
|
|
bp->b_resid = 0;
|
2000-05-16 21:20:23 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Pull our buffer off the front of the queue, thereby releasing
|
|
|
|
* the mutex, and awaken any threads waiting to do I/O.
|
|
|
|
*/
|
|
|
|
BUFQ_REMOVE(&mfsp->mfs_buflist, bp);
|
|
|
|
if (BUFQ_FIRST(&mfsp->mfs_buflist) != NULL)
|
|
|
|
wakeup(&mfsp->mfs_buflist);
|
|
|
|
|
1994-06-08 15:41:58 +04:00
|
|
|
biodone(bp);
|
2000-05-16 21:20:23 +04:00
|
|
|
return (0);
|
1994-06-08 15:41:58 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This is a noop, simply returning what one has been given.
|
|
|
|
*/
|
|
|
|
int
|
1996-02-10 01:31:27 +03:00
|
|
|
mfs_bmap(v)
|
|
|
|
void *v;
|
|
|
|
{
|
1994-06-08 15:41:58 +04:00
|
|
|
struct vop_bmap_args /* {
|
|
|
|
struct vnode *a_vp;
|
|
|
|
daddr_t a_bn;
|
|
|
|
struct vnode **a_vpp;
|
|
|
|
daddr_t *a_bnp;
|
|
|
|
int *a_runp;
|
1996-02-10 01:31:27 +03:00
|
|
|
} */ *ap = v;
|
1994-06-08 15:41:58 +04:00
|
|
|
|
|
|
|
if (ap->a_vpp != NULL)
|
|
|
|
*ap->a_vpp = ap->a_vp;
|
|
|
|
if (ap->a_bnp != NULL)
|
|
|
|
*ap->a_bnp = ap->a_bn;
|
1998-03-01 05:20:01 +03:00
|
|
|
if (ap->a_runp != NULL)
|
|
|
|
*ap->a_runp = 0;
|
1994-06-08 15:41:58 +04:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Memory filesystem close routine
|
|
|
|
*/
|
|
|
|
/* ARGSUSED */
|
|
|
|
int
|
1996-02-10 01:31:27 +03:00
|
|
|
mfs_close(v)
|
|
|
|
void *v;
|
|
|
|
{
|
1994-06-08 15:41:58 +04:00
|
|
|
struct vop_close_args /* {
|
|
|
|
struct vnode *a_vp;
|
|
|
|
int a_fflag;
|
|
|
|
struct ucred *a_cred;
|
|
|
|
struct proc *a_p;
|
1996-02-10 01:31:27 +03:00
|
|
|
} */ *ap = v;
|
2000-03-30 16:41:09 +04:00
|
|
|
struct vnode *vp = ap->a_vp;
|
|
|
|
struct mfsnode *mfsp = VTOMFS(vp);
|
1994-06-08 15:41:58 +04:00
|
|
|
int error;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* On last close of a memory filesystem
|
|
|
|
* we must invalidate any in core blocks, so that
|
|
|
|
* we can, free up its vnode.
|
|
|
|
*/
|
1996-02-10 01:31:27 +03:00
|
|
|
if ((error = vinvalbuf(vp, 1, ap->a_cred, ap->a_p, 0, 0)) != 0)
|
1994-06-08 15:41:58 +04:00
|
|
|
return (error);
|
|
|
|
/*
|
|
|
|
* There should be no way to have any more uses of this
|
|
|
|
* vnode, so if we find any other uses, it is a panic.
|
|
|
|
*/
|
|
|
|
if (vp->v_usecount > 1)
|
1999-10-02 02:07:42 +04:00
|
|
|
printf("mfs_close: ref count %ld > 1\n", vp->v_usecount);
|
2000-01-22 02:43:10 +03:00
|
|
|
if (vp->v_usecount > 1 || BUFQ_FIRST(&mfsp->mfs_buflist) != NULL)
|
1994-06-08 15:41:58 +04:00
|
|
|
panic("mfs_close");
|
|
|
|
/*
|
|
|
|
* Send a request to the filesystem server to exit.
|
|
|
|
*/
|
2000-05-16 21:20:23 +04:00
|
|
|
mfsp->mfs_alive = 0;
|
|
|
|
wakeup((void *)&mfsp->mfs_alive);
|
1994-06-08 15:41:58 +04:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Memory filesystem inactive routine
|
|
|
|
*/
|
|
|
|
/* ARGSUSED */
|
|
|
|
int
|
1996-02-10 01:31:27 +03:00
|
|
|
mfs_inactive(v)
|
|
|
|
void *v;
|
|
|
|
{
|
1994-06-08 15:41:58 +04:00
|
|
|
struct vop_inactive_args /* {
|
|
|
|
struct vnode *a_vp;
|
1998-03-01 05:20:01 +03:00
|
|
|
struct proc *a_p;
|
1996-02-10 01:31:27 +03:00
|
|
|
} */ *ap = v;
|
1998-03-01 05:20:01 +03:00
|
|
|
struct vnode *vp = ap->a_vp;
|
|
|
|
struct mfsnode *mfsp = VTOMFS(vp);
|
1994-06-08 15:41:58 +04:00
|
|
|
|
2000-05-16 21:20:23 +04:00
|
|
|
if (BUFQ_FIRST(&mfsp->mfs_buflist) != NULL)
|
1996-03-17 05:16:18 +03:00
|
|
|
panic("mfs_inactive: not inactive (mfs_buflist %p)",
|
2000-01-22 02:43:10 +03:00
|
|
|
BUFQ_FIRST(&mfsp->mfs_buflist));
|
1998-03-01 05:20:01 +03:00
|
|
|
VOP_UNLOCK(vp, 0);
|
1994-06-08 15:41:58 +04:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Reclaim a memory filesystem devvp so that it can be reused.
|
|
|
|
*/
|
|
|
|
int
|
1996-02-10 01:31:27 +03:00
|
|
|
mfs_reclaim(v)
|
|
|
|
void *v;
|
|
|
|
{
|
1994-06-08 15:41:58 +04:00
|
|
|
struct vop_reclaim_args /* {
|
|
|
|
struct vnode *a_vp;
|
1996-02-10 01:31:27 +03:00
|
|
|
} */ *ap = v;
|
2000-03-30 16:41:09 +04:00
|
|
|
struct vnode *vp = ap->a_vp;
|
1994-06-08 15:41:58 +04:00
|
|
|
|
|
|
|
FREE(vp->v_data, M_MFSNODE);
|
|
|
|
vp->v_data = NULL;
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Print out the contents of an mfsnode.
|
|
|
|
*/
|
|
|
|
int
|
1996-02-10 01:31:27 +03:00
|
|
|
mfs_print(v)
|
|
|
|
void *v;
|
|
|
|
{
|
1994-06-08 15:41:58 +04:00
|
|
|
struct vop_print_args /* {
|
|
|
|
struct vnode *a_vp;
|
1996-02-10 01:31:27 +03:00
|
|
|
} */ *ap = v;
|
2000-03-30 16:41:09 +04:00
|
|
|
struct mfsnode *mfsp = VTOMFS(ap->a_vp);
|
1994-06-08 15:41:58 +04:00
|
|
|
|
2000-05-16 04:24:08 +04:00
|
|
|
printf("tag VT_MFS, pid %d, base %p, size %ld\n",
|
|
|
|
(mfsp->mfs_proc != NULL) ? mfsp->mfs_proc->p_pid : 0,
|
1996-03-17 05:16:18 +03:00
|
|
|
mfsp->mfs_baseoff, mfsp->mfs_size);
|
1994-06-08 15:41:58 +04:00
|
|
|
return (0);
|
|
|
|
}
|