2004-05-30 03:48:08 +04:00
|
|
|
/* $NetBSD: umap_vfsops.c,v 1.48 2004/05/29 23:48:08 wrstuden Exp $ */
|
1994-06-29 10:29:24 +04:00
|
|
|
|
1994-06-08 15:33:09 +04:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1992, 1993
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
*
|
|
|
|
* This code is derived from software donated to Berkeley by
|
|
|
|
* the UCLA Ficus project.
|
|
|
|
*
|
|
|
|
* 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
|
1994-06-08 15:33:09 +04: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: @(#)null_vfsops.c 1.5 (Berkeley) 7/10/92
|
1998-03-01 05:20:01 +03:00
|
|
|
* @(#)umap_vfsops.c 8.8 (Berkeley) 5/14/95
|
1994-06-08 15:33:09 +04:00
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Umap Layer
|
|
|
|
* (See mount_umap(8) for a description of this layer.)
|
|
|
|
*/
|
|
|
|
|
2001-11-10 16:33:40 +03:00
|
|
|
#include <sys/cdefs.h>
|
2004-05-30 03:48:08 +04:00
|
|
|
__KERNEL_RCSID(0, "$NetBSD: umap_vfsops.c,v 1.48 2004/05/29 23:48:08 wrstuden Exp $");
|
2001-11-10 16:33:40 +03:00
|
|
|
|
1994-06-08 15:33:09 +04:00
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/systm.h>
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
#include <sys/sysctl.h>
|
1998-03-01 05:20:01 +03:00
|
|
|
#include <sys/proc.h>
|
1994-06-08 15:33:09 +04:00
|
|
|
#include <sys/time.h>
|
|
|
|
#include <sys/vnode.h>
|
|
|
|
#include <sys/mount.h>
|
|
|
|
#include <sys/namei.h>
|
|
|
|
#include <sys/malloc.h>
|
|
|
|
#include <miscfs/umapfs/umap.h>
|
1999-07-08 05:18:59 +04:00
|
|
|
#include <miscfs/genfs/layer_extern.h>
|
1994-06-08 15:33:09 +04:00
|
|
|
|
1996-12-22 13:10:12 +03:00
|
|
|
int umapfs_mount __P((struct mount *, const char *, void *,
|
2003-06-30 02:28:00 +04:00
|
|
|
struct nameidata *, struct proc *));
|
|
|
|
int umapfs_unmount __P((struct mount *, int, struct proc *));
|
1996-02-10 01:39:56 +03:00
|
|
|
|
1994-06-08 15:33:09 +04:00
|
|
|
/*
|
|
|
|
* Mount umap layer
|
|
|
|
*/
|
|
|
|
int
|
2003-06-30 02:28:00 +04:00
|
|
|
umapfs_mount(mp, path, data, ndp, p)
|
1994-06-08 15:33:09 +04:00
|
|
|
struct mount *mp;
|
1996-12-22 13:10:12 +03:00
|
|
|
const char *path;
|
|
|
|
void *data;
|
1994-06-08 15:33:09 +04:00
|
|
|
struct nameidata *ndp;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *p;
|
1994-06-08 15:33:09 +04:00
|
|
|
{
|
|
|
|
struct umap_args args;
|
|
|
|
struct vnode *lowerrootvp, *vp;
|
|
|
|
struct umap_mount *amp;
|
|
|
|
int error;
|
1999-03-20 00:46:25 +03:00
|
|
|
#ifdef UMAPFS_DIAGNOSTIC
|
|
|
|
int i;
|
|
|
|
#endif
|
2002-09-21 22:08:27 +04:00
|
|
|
if (mp->mnt_flag & MNT_GETARGS) {
|
|
|
|
amp = MOUNTTOUMAPMOUNT(mp);
|
|
|
|
if (amp == NULL)
|
|
|
|
return EIO;
|
|
|
|
args.la.target = NULL;
|
|
|
|
vfs_showexport(mp, &args.la.export, &->umapm_export);
|
|
|
|
args.nentries = amp->info_nentries;
|
|
|
|
args.gnentries = amp->info_gnentries;
|
|
|
|
return copyout(&args, data, sizeof(args));
|
|
|
|
}
|
1994-06-08 15:33:09 +04:00
|
|
|
|
1999-03-12 21:16:44 +03:00
|
|
|
/* only for root */
|
|
|
|
if ((error = suser(p->p_ucred, &p->p_acflag)) != 0)
|
|
|
|
return error;
|
|
|
|
|
1994-06-08 15:33:09 +04:00
|
|
|
#ifdef UMAPFS_DIAGNOSTIC
|
1997-09-10 17:44:20 +04:00
|
|
|
printf("umapfs_mount(mp = %p)\n", mp);
|
1994-06-08 15:33:09 +04:00
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Get argument
|
|
|
|
*/
|
2004-04-29 20:10:54 +04:00
|
|
|
error = copyin(data, &args, sizeof(struct umap_args));
|
1996-02-10 01:39:56 +03:00
|
|
|
if (error)
|
1994-06-08 15:33:09 +04:00
|
|
|
return (error);
|
|
|
|
|
1999-07-08 05:18:59 +04:00
|
|
|
/*
|
|
|
|
* Update only does export updating.
|
|
|
|
*/
|
|
|
|
if (mp->mnt_flag & MNT_UPDATE) {
|
|
|
|
amp = MOUNTTOUMAPMOUNT(mp);
|
|
|
|
if (args.umap_target == 0)
|
|
|
|
return (vfs_export(mp, &->umapm_export,
|
|
|
|
&args.umap_export));
|
|
|
|
else
|
|
|
|
return (EOPNOTSUPP);
|
|
|
|
}
|
|
|
|
|
1994-06-08 15:33:09 +04:00
|
|
|
/*
|
|
|
|
* Find lower node
|
|
|
|
*/
|
2001-08-03 02:40:58 +04:00
|
|
|
NDINIT(ndp, LOOKUP, FOLLOW|LOCKLEAF,
|
2003-06-30 02:28:00 +04:00
|
|
|
UIO_USERSPACE, args.umap_target, p);
|
1996-02-10 01:39:56 +03:00
|
|
|
if ((error = namei(ndp)) != 0)
|
1994-06-08 15:33:09 +04:00
|
|
|
return (error);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Sanity check on lower vnode
|
|
|
|
*/
|
|
|
|
lowerrootvp = ndp->ni_vp;
|
|
|
|
#ifdef UMAPFS_DIAGNOSTIC
|
1997-09-10 17:44:20 +04:00
|
|
|
printf("vp = %p, check for VDIR...\n", lowerrootvp);
|
1994-06-08 15:33:09 +04:00
|
|
|
#endif
|
|
|
|
|
|
|
|
if (lowerrootvp->v_type != VDIR) {
|
|
|
|
vput(lowerrootvp);
|
|
|
|
return (EINVAL);
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef UMAPFS_DIAGNOSTIC
|
1997-09-10 17:44:20 +04:00
|
|
|
printf("mp = %p\n", mp);
|
1994-06-08 15:33:09 +04:00
|
|
|
#endif
|
|
|
|
|
|
|
|
amp = (struct umap_mount *) malloc(sizeof(struct umap_mount),
|
|
|
|
M_UFSMNT, M_WAITOK); /* XXX */
|
2004-04-29 20:10:54 +04:00
|
|
|
memset(amp, 0, sizeof(struct umap_mount));
|
1994-06-08 15:33:09 +04:00
|
|
|
|
2002-07-30 11:40:07 +04:00
|
|
|
mp->mnt_data = amp;
|
1994-06-08 15:33:09 +04:00
|
|
|
amp->umapm_vfs = lowerrootvp->v_mount;
|
1999-07-08 05:18:59 +04:00
|
|
|
if (amp->umapm_vfs->mnt_flag & MNT_LOCAL)
|
|
|
|
mp->mnt_flag |= MNT_LOCAL;
|
1994-06-08 15:33:09 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Now copy in the number of entries and maps for umap mapping.
|
|
|
|
*/
|
2001-08-16 19:37:06 +04:00
|
|
|
if (args.nentries > MAPFILEENTRIES || args.gnentries > GMAPFILEENTRIES) {
|
2001-08-03 10:00:13 +04:00
|
|
|
vput(lowerrootvp);
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
1994-06-08 15:33:09 +04:00
|
|
|
amp->info_nentries = args.nentries;
|
|
|
|
amp->info_gnentries = args.gnentries;
|
2004-04-29 20:10:54 +04:00
|
|
|
error = copyin(args.mapdata, amp->info_mapdata,
|
1994-06-08 15:33:09 +04:00
|
|
|
2*sizeof(u_long)*args.nentries);
|
1999-07-08 05:18:59 +04:00
|
|
|
if (error) {
|
|
|
|
vput(lowerrootvp);
|
1994-06-08 15:33:09 +04:00
|
|
|
return (error);
|
1999-07-08 05:18:59 +04:00
|
|
|
}
|
1994-06-08 15:33:09 +04:00
|
|
|
|
1999-03-20 00:46:25 +03:00
|
|
|
#ifdef UMAPFS_DIAGNOSTIC
|
1996-10-13 06:21:25 +04:00
|
|
|
printf("umap_mount:nentries %d\n",args.nentries);
|
1994-06-08 15:33:09 +04:00
|
|
|
for (i = 0; i < args.nentries; i++)
|
1999-03-20 00:46:25 +03:00
|
|
|
printf(" %ld maps to %ld\n", amp->info_mapdata[i][0],
|
1994-06-08 15:33:09 +04:00
|
|
|
amp->info_mapdata[i][1]);
|
|
|
|
#endif
|
|
|
|
|
2004-04-29 20:10:54 +04:00
|
|
|
error = copyin(args.gmapdata, amp->info_gmapdata,
|
1997-02-20 08:04:05 +03:00
|
|
|
2*sizeof(u_long)*args.gnentries);
|
1999-07-08 05:18:59 +04:00
|
|
|
if (error) {
|
|
|
|
vput(lowerrootvp);
|
1994-06-08 15:33:09 +04:00
|
|
|
return (error);
|
1999-07-08 05:18:59 +04:00
|
|
|
}
|
1994-06-08 15:33:09 +04:00
|
|
|
|
1999-03-20 00:46:25 +03:00
|
|
|
#ifdef UMAPFS_DIAGNOSTIC
|
1996-10-13 06:21:25 +04:00
|
|
|
printf("umap_mount:gnentries %d\n",args.gnentries);
|
1994-06-08 15:33:09 +04:00
|
|
|
for (i = 0; i < args.gnentries; i++)
|
1999-03-20 00:46:25 +03:00
|
|
|
printf("\tgroup %ld maps to %ld\n",
|
1994-06-08 15:33:09 +04:00
|
|
|
amp->info_gmapdata[i][0],
|
|
|
|
amp->info_gmapdata[i][1]);
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
1999-07-08 05:18:59 +04:00
|
|
|
* Make sure the mount point's sufficiently initialized
|
|
|
|
* that the node create call will work.
|
1994-06-08 15:33:09 +04:00
|
|
|
*/
|
2000-06-10 22:27:01 +04:00
|
|
|
vfs_getnewfsid(mp);
|
1999-07-08 05:18:59 +04:00
|
|
|
amp->umapm_size = sizeof(struct umap_node);
|
|
|
|
amp->umapm_tag = VT_UMAP;
|
|
|
|
amp->umapm_bypass = umap_bypass;
|
|
|
|
amp->umapm_alloc = layer_node_alloc; /* the default alloc is fine */
|
|
|
|
amp->umapm_vnodeop_p = umap_vnodeop_p;
|
|
|
|
simple_lock_init(&->umapm_hashlock);
|
2000-11-08 17:28:12 +03:00
|
|
|
amp->umapm_node_hashtbl = hashinit(NUMAPNODECACHE, HASH_LIST, M_CACHE,
|
|
|
|
M_WAITOK, &->umapm_node_hash);
|
1999-07-08 05:18:59 +04:00
|
|
|
|
|
|
|
|
1994-06-08 15:33:09 +04:00
|
|
|
/*
|
1999-07-08 05:18:59 +04:00
|
|
|
* fix up umap node for root vnode.
|
1994-06-08 15:33:09 +04:00
|
|
|
*/
|
1999-07-08 05:18:59 +04:00
|
|
|
error = layer_node_create(mp, lowerrootvp, &vp);
|
1994-06-08 15:33:09 +04:00
|
|
|
/*
|
|
|
|
* Make sure the node alias worked
|
|
|
|
*/
|
|
|
|
if (error) {
|
1999-07-08 05:18:59 +04:00
|
|
|
vput(lowerrootvp);
|
1994-06-08 15:33:09 +04:00
|
|
|
free(amp, M_UFSMNT); /* XXX */
|
|
|
|
return (error);
|
|
|
|
}
|
1999-07-08 05:18:59 +04:00
|
|
|
/*
|
|
|
|
* Unlock the node (either the lower or the alias)
|
|
|
|
*/
|
|
|
|
VOP_UNLOCK(vp, 0);
|
1994-06-08 15:33:09 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Keep a held reference to the root vnode.
|
|
|
|
* It is vrele'd in umapfs_unmount.
|
|
|
|
*/
|
1999-07-08 05:18:59 +04:00
|
|
|
vp->v_flag |= VROOT;
|
|
|
|
amp->umapm_rootvp = vp;
|
1994-06-08 15:33:09 +04:00
|
|
|
|
2004-04-21 05:05:31 +04:00
|
|
|
error = set_statvfs_info(path, UIO_USERSPACE, args.umap_target,
|
2003-06-30 02:28:00 +04:00
|
|
|
UIO_USERSPACE, mp, p);
|
1994-06-08 15:33:09 +04:00
|
|
|
#ifdef UMAPFS_DIAGNOSTIC
|
1996-10-13 06:21:25 +04:00
|
|
|
printf("umapfs_mount: lower %s, alias at %s\n",
|
1994-06-08 15:33:09 +04:00
|
|
|
mp->mnt_stat.f_mntfromname, mp->mnt_stat.f_mntonname);
|
|
|
|
#endif
|
2003-04-17 01:44:18 +04:00
|
|
|
return error;
|
1994-06-08 15:33:09 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Free reference to umap layer
|
|
|
|
*/
|
|
|
|
int
|
2003-06-30 02:28:00 +04:00
|
|
|
umapfs_unmount(mp, mntflags, p)
|
1994-06-08 15:33:09 +04:00
|
|
|
struct mount *mp;
|
|
|
|
int mntflags;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *p;
|
1994-06-08 15:33:09 +04:00
|
|
|
{
|
1999-07-08 05:18:59 +04:00
|
|
|
struct vnode *rootvp = MOUNTTOUMAPMOUNT(mp)->umapm_rootvp;
|
1994-06-08 15:33:09 +04:00
|
|
|
int error;
|
|
|
|
int flags = 0;
|
|
|
|
|
|
|
|
#ifdef UMAPFS_DIAGNOSTIC
|
1997-09-10 17:44:20 +04:00
|
|
|
printf("umapfs_unmount(mp = %p)\n", mp);
|
1994-06-08 15:33:09 +04:00
|
|
|
#endif
|
|
|
|
|
1998-03-01 05:20:01 +03:00
|
|
|
if (mntflags & MNT_FORCE)
|
1994-06-08 15:33:09 +04:00
|
|
|
flags |= FORCECLOSE;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Clear out buffer cache. I don't think we
|
|
|
|
* ever get anything cached at this level at the
|
|
|
|
* moment, but who knows...
|
|
|
|
*/
|
|
|
|
#ifdef notyet
|
|
|
|
mntflushbuf(mp, 0);
|
|
|
|
if (mntinvalbuf(mp, 1))
|
|
|
|
return (EBUSY);
|
|
|
|
#endif
|
1999-07-08 05:18:59 +04:00
|
|
|
if (rootvp->v_usecount > 1)
|
1994-06-08 15:33:09 +04:00
|
|
|
return (EBUSY);
|
1999-07-08 05:18:59 +04:00
|
|
|
if ((error = vflush(mp, rootvp, flags)) != 0)
|
1994-06-08 15:33:09 +04:00
|
|
|
return (error);
|
|
|
|
|
|
|
|
#ifdef UMAPFS_DIAGNOSTIC
|
1999-07-08 05:18:59 +04:00
|
|
|
vprint("alias root of lower", rootvp);
|
1994-06-08 15:33:09 +04:00
|
|
|
#endif
|
|
|
|
/*
|
|
|
|
* Release reference on underlying root vnode
|
|
|
|
*/
|
1999-07-08 05:18:59 +04:00
|
|
|
vrele(rootvp);
|
1994-06-08 15:33:09 +04:00
|
|
|
/*
|
|
|
|
* And blow it away for future re-use
|
|
|
|
*/
|
1999-07-08 05:18:59 +04:00
|
|
|
vgone(rootvp);
|
1994-06-08 15:33:09 +04:00
|
|
|
/*
|
|
|
|
* Finally, throw away the umap_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_umap_setup, "sysctl vfs.umap subtree setup")
|
|
|
|
{
|
|
|
|
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
CTLTYPE_NODE, "vfs", NULL,
|
|
|
|
NULL, 0, NULL, 0,
|
|
|
|
CTL_VFS, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
2004-05-25 08:44:43 +04:00
|
|
|
CTLTYPE_NODE, "umap",
|
|
|
|
SYSCTL_DESCR("UID/GID remapping file system"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, NULL, 0,
|
|
|
|
CTL_VFS, 10, CTL_EOL);
|
|
|
|
/*
|
|
|
|
* XXX the "10" above could be dynamic, thereby eliminating
|
|
|
|
* one more instance of the "number to vfs" mapping problem,
|
|
|
|
* but "10" is the order as taken from sys/mount.h
|
|
|
|
*/
|
|
|
|
}
|
|
|
|
|
2001-01-22 15:17:35 +03:00
|
|
|
extern const struct vnodeopv_desc umapfs_vnodeop_opv_desc;
|
1998-02-18 10:05:47 +03:00
|
|
|
|
2001-01-22 15:17:35 +03:00
|
|
|
const struct vnodeopv_desc * const umapfs_vnodeopv_descs[] = {
|
1998-02-18 10:05:47 +03:00
|
|
|
&umapfs_vnodeop_opv_desc,
|
|
|
|
NULL,
|
|
|
|
};
|
|
|
|
|
1997-10-06 13:32:31 +04:00
|
|
|
struct vfsops umapfs_vfsops = {
|
1994-06-08 15:33:09 +04:00
|
|
|
MOUNT_UMAP,
|
|
|
|
umapfs_mount,
|
1999-07-08 05:18:59 +04:00
|
|
|
layerfs_start,
|
1994-06-08 15:33:09 +04:00
|
|
|
umapfs_unmount,
|
1999-07-08 05:18:59 +04:00
|
|
|
layerfs_root,
|
|
|
|
layerfs_quotactl,
|
2004-04-21 05:05:31 +04:00
|
|
|
layerfs_statvfs,
|
1999-07-08 05:18:59 +04:00
|
|
|
layerfs_sync,
|
|
|
|
layerfs_vget,
|
|
|
|
layerfs_fhtovp,
|
|
|
|
layerfs_vptofh,
|
|
|
|
layerfs_init,
|
2001-09-15 20:12:54 +04:00
|
|
|
NULL,
|
2000-03-16 22:00:26 +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,
|
1998-02-18 10:05:47 +03:00
|
|
|
NULL, /* vfs_mountroot */
|
1999-07-08 05:18:59 +04:00
|
|
|
layerfs_checkexp,
|
2004-05-30 03:48:08 +04:00
|
|
|
layerfs_snapshot,
|
1998-02-18 10:05:47 +03:00
|
|
|
umapfs_vnodeopv_descs,
|
1994-06-08 15:33:09 +04:00
|
|
|
};
|