2005-01-02 19:08:28 +03:00
|
|
|
/* $NetBSD: overlay_vfsops.c,v 1.28 2005/01/02 16:08:30 thorpej Exp $ */
|
2000-01-20 22:06:13 +03:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Copyright (c) 1999, 2000 National Aeronautics & Space Administration
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* This software was written by William Studenmund of the
|
2001-06-07 17:44:46 +04:00
|
|
|
* Numerical Aerospace Simulation Facility, NASA Ames Research Center.
|
2000-01-20 22:06:13 +03:00
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
2000-03-14 02:52:25 +03:00
|
|
|
* 3. Neither the name of the National Aeronautics & Space Administration
|
2000-01-20 22:06:13 +03:00
|
|
|
* 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 NATIONAL AERONAUTICS & SPACE ADMINISTRATION
|
|
|
|
* ``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 ADMINISTRATION OR CONTRIB-
|
|
|
|
* UTORS 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.
|
|
|
|
*/
|
|
|
|
/*
|
|
|
|
* Copyright (c) 1992, 1993, 1995
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
*
|
|
|
|
* This code is derived from software donated to Berkeley by
|
|
|
|
* Jan-Simon Pendry.
|
|
|
|
*
|
|
|
|
* 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.
|
2003-08-07 20:26:28 +04:00
|
|
|
* 3. Neither the name of the University nor the names of its contributors
|
2000-01-20 22:06:13 +03:00
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
* from: Id: lofs_vfsops.c,v 1.9 1992/05/30 10:26:24 jsp Exp
|
|
|
|
* from: @(#)lofs_vfsops.c 1.2 (Berkeley) 6/18/92
|
|
|
|
* @(#)null_vfsops.c 8.7 (Berkeley) 5/14/95
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
2001-06-07 17:44:46 +04:00
|
|
|
* Overlay Layer
|
|
|
|
* (See overlay_vnops.c for a description of what this does.)
|
2000-01-20 22:06:13 +03:00
|
|
|
*/
|
|
|
|
|
2001-11-10 16:33:40 +03:00
|
|
|
#include <sys/cdefs.h>
|
2005-01-02 19:08:28 +03:00
|
|
|
__KERNEL_RCSID(0, "$NetBSD: overlay_vfsops.c,v 1.28 2005/01/02 16:08:30 thorpej Exp $");
|
2001-11-10 16:33:40 +03:00
|
|
|
|
2000-01-20 22:06:13 +03: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>
|
2000-01-20 22:06:13 +03:00
|
|
|
#include <sys/time.h>
|
|
|
|
#include <sys/proc.h>
|
|
|
|
#include <sys/vnode.h>
|
|
|
|
#include <sys/mount.h>
|
|
|
|
#include <sys/namei.h>
|
|
|
|
#include <sys/malloc.h>
|
|
|
|
#include <miscfs/overlay/overlay.h>
|
|
|
|
#include <miscfs/genfs/layer_extern.h>
|
|
|
|
|
|
|
|
int ov_mount __P((struct mount *, const char *, void *,
|
2003-06-30 02:28:00 +04:00
|
|
|
struct nameidata *, struct proc *));
|
|
|
|
int ov_unmount __P((struct mount *, int, struct proc *));
|
2000-01-20 22:06:13 +03:00
|
|
|
|
|
|
|
#define NOVERLAYNODECACHE 16
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Mount overlay layer
|
|
|
|
*/
|
|
|
|
int
|
2003-06-30 02:28:00 +04:00
|
|
|
ov_mount(mp, path, data, ndp, p)
|
2000-01-20 22:06:13 +03:00
|
|
|
struct mount *mp;
|
|
|
|
const char *path;
|
|
|
|
void *data;
|
|
|
|
struct nameidata *ndp;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *p;
|
2000-01-20 22:06:13 +03:00
|
|
|
{
|
|
|
|
int error = 0;
|
|
|
|
struct overlay_args args;
|
|
|
|
struct vnode *lowerrootvp, *vp;
|
|
|
|
struct overlay_mount *nmp;
|
|
|
|
struct layer_mount *lmp;
|
|
|
|
|
|
|
|
#ifdef OVERLAYFS_DIAGNOSTIC
|
|
|
|
printf("ov_mount(mp = %p)\n", mp);
|
|
|
|
#endif
|
|
|
|
|
2002-09-21 22:08:27 +04:00
|
|
|
if (mp->mnt_flag & MNT_GETARGS) {
|
|
|
|
lmp = MOUNTTOLAYERMOUNT(mp);
|
|
|
|
if (lmp == NULL)
|
|
|
|
return EIO;
|
|
|
|
args.la.target = NULL;
|
|
|
|
vfs_showexport(mp, &args.la.export, &lmp->layerm_export);
|
|
|
|
return copyout(&args, data, sizeof(args));
|
|
|
|
}
|
2000-01-20 22:06:13 +03:00
|
|
|
/*
|
|
|
|
* Get argument
|
|
|
|
*/
|
2004-04-29 20:10:54 +04:00
|
|
|
error = copyin(data, &args, sizeof(struct overlay_args));
|
2000-01-20 22:06:13 +03:00
|
|
|
if (error)
|
|
|
|
return (error);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Update only does export updating.
|
|
|
|
*/
|
|
|
|
if (mp->mnt_flag & MNT_UPDATE) {
|
|
|
|
lmp = MOUNTTOLAYERMOUNT(mp);
|
|
|
|
if (args.ova_target == 0)
|
|
|
|
return (vfs_export(mp, &lmp->layerm_export,
|
|
|
|
&args.la.export));
|
|
|
|
else
|
|
|
|
return (EOPNOTSUPP);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Find lower node
|
|
|
|
*/
|
|
|
|
lowerrootvp = mp->mnt_vnodecovered;
|
2003-06-29 22:43:21 +04:00
|
|
|
if ((error = vget(lowerrootvp, LK_EXCLUSIVE | LK_RETRY)))
|
2000-01-20 22:06:13 +03:00
|
|
|
return (error);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* First cut at fixing up upper mount point
|
|
|
|
*/
|
|
|
|
nmp = (struct overlay_mount *) malloc(sizeof(struct overlay_mount),
|
|
|
|
M_UFSMNT, M_WAITOK); /* XXX */
|
2004-04-29 20:10:54 +04:00
|
|
|
memset(nmp, 0, sizeof(struct overlay_mount));
|
2000-01-20 22:06:13 +03:00
|
|
|
|
2002-07-30 11:40:07 +04:00
|
|
|
mp->mnt_data = nmp;
|
2004-07-01 14:03:29 +04:00
|
|
|
mp->mnt_leaf = lowerrootvp->v_mount->mnt_leaf;
|
2000-01-20 22:06:13 +03:00
|
|
|
nmp->ovm_vfs = lowerrootvp->v_mount;
|
|
|
|
if (nmp->ovm_vfs->mnt_flag & MNT_LOCAL)
|
|
|
|
mp->mnt_flag |= MNT_LOCAL;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Make sure that the mount point is sufficiently initialized
|
|
|
|
* that the node create call will work.
|
|
|
|
*/
|
2000-06-10 22:27:01 +04:00
|
|
|
vfs_getnewfsid(mp);
|
2000-01-20 22:06:13 +03:00
|
|
|
|
|
|
|
nmp->ovm_size = sizeof (struct overlay_node);
|
|
|
|
nmp->ovm_tag = VT_OVERLAY;
|
|
|
|
nmp->ovm_bypass = layer_bypass;
|
|
|
|
nmp->ovm_alloc = layer_node_alloc; /* the default alloc is fine */
|
|
|
|
nmp->ovm_vnodeop_p = overlay_vnodeop_p;
|
|
|
|
simple_lock_init(&nmp->ovm_hashlock);
|
2000-11-08 17:28:12 +03:00
|
|
|
nmp->ovm_node_hashtbl = hashinit(NOVERLAYNODECACHE, HASH_LIST, M_CACHE,
|
|
|
|
M_WAITOK, &nmp->ovm_node_hash);
|
2000-01-20 22:06:13 +03:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Fix up overlay node for root vnode
|
|
|
|
*/
|
|
|
|
error = layer_node_create(mp, lowerrootvp, &vp);
|
|
|
|
/*
|
|
|
|
* Make sure the fixup worked
|
|
|
|
*/
|
|
|
|
if (error) {
|
|
|
|
vput(lowerrootvp);
|
|
|
|
free(nmp, M_UFSMNT); /* XXX */
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Unlock the node
|
|
|
|
*/
|
|
|
|
VOP_UNLOCK(vp, 0);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Keep a held reference to the root vnode.
|
|
|
|
* It is vrele'd in ov_unmount.
|
|
|
|
*/
|
|
|
|
vp->v_flag |= VROOT;
|
|
|
|
nmp->ovm_rootvp = vp;
|
|
|
|
|
2004-04-21 05:05:31 +04:00
|
|
|
error = set_statvfs_info(path, UIO_USERSPACE, args.la.target,
|
2003-06-30 02:28:00 +04:00
|
|
|
UIO_USERSPACE, mp, p);
|
2000-01-20 22:06:13 +03:00
|
|
|
#ifdef OVERLAYFS_DIAGNOSTIC
|
|
|
|
printf("ov_mount: lower %s, alias at %s\n",
|
|
|
|
mp->mnt_stat.f_mntfromname, mp->mnt_stat.f_mntonname);
|
|
|
|
#endif
|
2003-04-17 01:44:18 +04:00
|
|
|
return error;
|
2000-01-20 22:06:13 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Free reference to overlay layer
|
|
|
|
*/
|
|
|
|
int
|
2003-06-30 02:28:00 +04:00
|
|
|
ov_unmount(mp, mntflags, p)
|
2000-01-20 22:06:13 +03:00
|
|
|
struct mount *mp;
|
|
|
|
int mntflags;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *p;
|
2000-01-20 22:06:13 +03:00
|
|
|
{
|
|
|
|
struct vnode *overlay_rootvp = MOUNTTOOVERLAYMOUNT(mp)->ovm_rootvp;
|
|
|
|
int error;
|
|
|
|
int flags = 0;
|
|
|
|
|
|
|
|
#ifdef OVERLAYFS_DIAGNOSTIC
|
|
|
|
printf("ov_unmount(mp = %p)\n", mp);
|
|
|
|
#endif
|
|
|
|
|
|
|
|
if (mntflags & MNT_FORCE)
|
|
|
|
flags |= FORCECLOSE;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Clear out buffer cache. I don't think we
|
|
|
|
* ever get anything cached at this level at the
|
|
|
|
* moment, but who knows...
|
|
|
|
*/
|
|
|
|
#if 0
|
|
|
|
mntflushbuf(mp, 0);
|
|
|
|
if (mntinvalbuf(mp, 1))
|
|
|
|
return (EBUSY);
|
|
|
|
#endif
|
|
|
|
if (overlay_rootvp->v_usecount > 1)
|
|
|
|
return (EBUSY);
|
|
|
|
if ((error = vflush(mp, overlay_rootvp, flags)) != 0)
|
|
|
|
return (error);
|
|
|
|
|
|
|
|
#ifdef OVERLAYFS_DIAGNOSTIC
|
|
|
|
vprint("alias root of lower", overlay_rootvp);
|
|
|
|
#endif
|
|
|
|
/*
|
|
|
|
* Release reference on underlying root vnode
|
|
|
|
*/
|
|
|
|
vrele(overlay_rootvp);
|
|
|
|
/*
|
|
|
|
* And blow it away for future re-use
|
|
|
|
*/
|
|
|
|
vgone(overlay_rootvp);
|
|
|
|
/*
|
|
|
|
* Finally, throw away the overlay_mount structure
|
|
|
|
*/
|
|
|
|
free(mp->mnt_data, M_UFSMNT); /* XXX */
|
|
|
|
mp->mnt_data = 0;
|
|
|
|
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_overlay_setup, "sysctl vfs.overlay subtree setup")
|
|
|
|
{
|
|
|
|
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT, CTLTYPE_NODE, "vfs", NULL,
|
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, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
2004-05-25 08:44:43 +04:00
|
|
|
CTLFLAG_PERMANENT, CTLTYPE_NODE, "overlay",
|
|
|
|
SYSCTL_DESCR("Overlay 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,
|
2004-03-09 06:16:08 +03:00
|
|
|
CTL_VFS, CTL_CREATE, CTL_EOL);
|
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
|
|
|
}
|
|
|
|
|
2001-01-22 15:17:35 +03:00
|
|
|
extern const struct vnodeopv_desc overlay_vnodeop_opv_desc;
|
2000-01-20 22:06:13 +03:00
|
|
|
|
2001-01-22 15:17:35 +03:00
|
|
|
const struct vnodeopv_desc * const ov_vnodeopv_descs[] = {
|
2000-01-20 22:06:13 +03:00
|
|
|
&overlay_vnodeop_opv_desc,
|
|
|
|
NULL,
|
|
|
|
};
|
|
|
|
|
|
|
|
struct vfsops overlay_vfsops = {
|
|
|
|
MOUNT_OVERLAY,
|
|
|
|
ov_mount,
|
|
|
|
layerfs_start,
|
|
|
|
ov_unmount,
|
|
|
|
layerfs_root,
|
|
|
|
layerfs_quotactl,
|
2004-04-21 05:05:31 +04:00
|
|
|
layerfs_statvfs,
|
2000-01-20 22:06:13 +03:00
|
|
|
layerfs_sync,
|
|
|
|
layerfs_vget,
|
|
|
|
layerfs_fhtovp,
|
|
|
|
layerfs_vptofh,
|
|
|
|
layerfs_init,
|
2001-09-15 20:12:54 +04:00
|
|
|
NULL,
|
2000-03-16 21:08:17 +03:00
|
|
|
layerfs_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,
|
2000-01-20 22:06:13 +03:00
|
|
|
NULL, /* vfs_mountroot */
|
|
|
|
layerfs_checkexp,
|
2004-05-30 03:48:08 +04:00
|
|
|
layerfs_snapshot,
|
2005-01-02 19:08:28 +03:00
|
|
|
vfs_stdextattrctl,
|
2000-01-20 22:06:13 +03:00
|
|
|
ov_vnodeopv_descs,
|
|
|
|
};
|