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
|
|
|
/* $NetBSD: portal_vfsops.c,v 1.39 2003/12/04 19:38:24 atatat Exp $ */
|
1994-06-29 10:29:24 +04:00
|
|
|
|
1994-01-05 17:23:21 +03:00
|
|
|
/*
|
1998-03-01 05:20:01 +03:00
|
|
|
* Copyright (c) 1992, 1993, 1995
|
1994-06-08 15:33:09 +04:00
|
|
|
* The Regents of the University of California. All rights reserved.
|
1994-01-05 17:23:21 +03:00
|
|
|
*
|
|
|
|
* 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
|
1994-01-05 17:23:21 +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.
|
|
|
|
*
|
1994-06-08 15:33:09 +04:00
|
|
|
* from: Id: portal_vfsops.c,v 1.5 1992/05/30 10:25:27 jsp Exp
|
1998-03-01 05:20:01 +03:00
|
|
|
* @(#)portal_vfsops.c 8.11 (Berkeley) 5/14/95
|
1994-01-05 17:23:21 +03:00
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Portal Filesystem
|
|
|
|
*/
|
|
|
|
|
2001-11-10 16:33:40 +03:00
|
|
|
#include <sys/cdefs.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
|
|
|
__KERNEL_RCSID(0, "$NetBSD: portal_vfsops.c,v 1.39 2003/12/04 19:38:24 atatat Exp $");
|
2001-11-10 16:33:40 +03:00
|
|
|
|
2001-05-30 15:57:16 +04:00
|
|
|
#if defined(_KERNEL_OPT)
|
1998-07-05 12:49:30 +04:00
|
|
|
#include "opt_compat_netbsd.h"
|
|
|
|
#endif
|
|
|
|
|
1994-01-05 17:23:21 +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>
|
1994-01-05 17:23:21 +03:00
|
|
|
#include <sys/time.h>
|
|
|
|
#include <sys/proc.h>
|
|
|
|
#include <sys/filedesc.h>
|
|
|
|
#include <sys/file.h>
|
|
|
|
#include <sys/vnode.h>
|
|
|
|
#include <sys/mount.h>
|
|
|
|
#include <sys/namei.h>
|
|
|
|
#include <sys/malloc.h>
|
|
|
|
#include <sys/mbuf.h>
|
|
|
|
#include <sys/socket.h>
|
|
|
|
#include <sys/socketvar.h>
|
|
|
|
#include <sys/protosw.h>
|
|
|
|
#include <sys/domain.h>
|
|
|
|
#include <sys/un.h>
|
|
|
|
#include <miscfs/portal/portal.h>
|
|
|
|
|
1996-02-10 01:39:56 +03:00
|
|
|
void portal_init __P((void));
|
2000-03-16 21:08:17 +03:00
|
|
|
void portal_done __P((void));
|
1996-12-22 13:10:12 +03:00
|
|
|
int portal_mount __P((struct mount *, const char *, void *,
|
2003-06-30 02:28:00 +04:00
|
|
|
struct nameidata *, struct proc *));
|
|
|
|
int portal_start __P((struct mount *, int, struct proc *));
|
|
|
|
int portal_unmount __P((struct mount *, int, struct proc *));
|
2003-06-29 22:43:21 +04:00
|
|
|
int portal_root __P((struct mount *, struct vnode **));
|
1996-02-10 01:39:56 +03:00
|
|
|
int portal_quotactl __P((struct mount *, int, uid_t, caddr_t,
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *));
|
|
|
|
int portal_statfs __P((struct mount *, struct statfs *, struct proc *));
|
|
|
|
int portal_sync __P((struct mount *, int, struct ucred *, struct proc *));
|
2003-06-29 22:43:21 +04:00
|
|
|
int portal_vget __P((struct mount *, ino_t, struct vnode **));
|
|
|
|
int portal_fhtovp __P((struct mount *, struct fid *, struct vnode **));
|
1999-02-27 02:44:43 +03:00
|
|
|
int portal_checkexp __P((struct mount *, struct mbuf *, int *,
|
|
|
|
struct ucred **));
|
1996-02-10 01:39:56 +03:00
|
|
|
int portal_vptofh __P((struct vnode *, struct fid *));
|
|
|
|
|
|
|
|
void
|
1994-06-08 15:33:09 +04:00
|
|
|
portal_init()
|
1994-01-05 17:23:21 +03:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2000-03-16 21:08:17 +03:00
|
|
|
void
|
|
|
|
portal_done()
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
1994-01-05 17:23:21 +03:00
|
|
|
/*
|
|
|
|
* Mount the per-process file descriptors (/dev/fd)
|
|
|
|
*/
|
1994-06-08 15:33:09 +04:00
|
|
|
int
|
2003-06-30 02:28:00 +04:00
|
|
|
portal_mount(mp, path, data, ndp, p)
|
1994-01-05 17:23:21 +03:00
|
|
|
struct mount *mp;
|
1996-12-22 13:10:12 +03:00
|
|
|
const char *path;
|
|
|
|
void *data;
|
1994-01-05 17:23:21 +03:00
|
|
|
struct nameidata *ndp;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *p;
|
1994-01-05 17:23:21 +03:00
|
|
|
{
|
1994-06-08 15:33:09 +04:00
|
|
|
struct file *fp;
|
1994-01-05 17:23:21 +03:00
|
|
|
struct portal_args args;
|
|
|
|
struct portalmount *fmp;
|
|
|
|
struct socket *so;
|
1994-06-08 15:33:09 +04:00
|
|
|
struct vnode *rvp;
|
|
|
|
int error;
|
1994-01-05 17:23:21 +03:00
|
|
|
|
2002-09-21 22:08:27 +04:00
|
|
|
if (mp->mnt_flag & MNT_GETARGS) {
|
|
|
|
fmp = VFSTOPORTAL(mp);
|
|
|
|
if (fmp == NULL)
|
|
|
|
return EIO;
|
|
|
|
args.pa_config = NULL;
|
|
|
|
args.pa_socket = 0; /* XXX */
|
|
|
|
return copyout(&args, data, sizeof(args));
|
|
|
|
}
|
1994-01-05 17:23:21 +03:00
|
|
|
/*
|
|
|
|
* Update is a no-op
|
|
|
|
*/
|
|
|
|
if (mp->mnt_flag & MNT_UPDATE)
|
|
|
|
return (EOPNOTSUPP);
|
|
|
|
|
1996-02-10 01:39:56 +03:00
|
|
|
error = copyin(data, (caddr_t) &args, sizeof(struct portal_args));
|
|
|
|
if (error)
|
1994-01-05 17:23:21 +03:00
|
|
|
return (error);
|
|
|
|
|
1999-05-06 00:01:01 +04:00
|
|
|
/* getsock() will use the descriptor for us */
|
1996-02-10 01:39:56 +03:00
|
|
|
if ((error = getsock(p->p_fd, args.pa_socket, &fp)) != 0)
|
1994-01-05 17:23:21 +03:00
|
|
|
return (error);
|
|
|
|
so = (struct socket *) fp->f_data;
|
1999-05-06 00:01:01 +04:00
|
|
|
FILE_UNUSE(fp, NULL);
|
1998-07-18 09:04:35 +04:00
|
|
|
if (so->so_proto->pr_domain->dom_family != AF_LOCAL)
|
1994-01-05 17:23:21 +03:00
|
|
|
return (ESOCKTNOSUPPORT);
|
|
|
|
|
1994-06-08 15:33:09 +04:00
|
|
|
error = getnewvnode(VT_PORTAL, mp, portal_vnodeop_p, &rvp); /* XXX */
|
1994-01-05 17:23:21 +03:00
|
|
|
if (error)
|
|
|
|
return (error);
|
1994-06-08 15:33:09 +04:00
|
|
|
MALLOC(rvp->v_data, void *, sizeof(struct portalnode),
|
|
|
|
M_TEMP, M_WAITOK);
|
1994-01-05 17:23:21 +03:00
|
|
|
|
|
|
|
fmp = (struct portalmount *) malloc(sizeof(struct portalmount),
|
|
|
|
M_UFSMNT, M_WAITOK); /* XXX */
|
|
|
|
rvp->v_type = VDIR;
|
|
|
|
rvp->v_flag |= VROOT;
|
|
|
|
VTOPORTAL(rvp)->pt_arg = 0;
|
|
|
|
VTOPORTAL(rvp)->pt_size = 0;
|
|
|
|
VTOPORTAL(rvp)->pt_fileid = PORTAL_ROOTFILEID;
|
|
|
|
fmp->pm_root = rvp;
|
2003-02-23 17:37:32 +03:00
|
|
|
fmp->pm_server = fp;
|
|
|
|
simple_lock(&fp->f_slock);
|
|
|
|
fp->f_count++;
|
|
|
|
simple_unlock(&fp->f_slock);
|
1994-01-05 17:23:21 +03:00
|
|
|
|
1994-06-08 15:33:09 +04:00
|
|
|
mp->mnt_flag |= MNT_LOCAL;
|
2002-07-30 11:40:07 +04:00
|
|
|
mp->mnt_data = fmp;
|
2000-06-10 22:27:01 +04:00
|
|
|
vfs_getnewfsid(mp);
|
1994-01-05 17:23:21 +03:00
|
|
|
|
2003-04-17 01:44:18 +04:00
|
|
|
return set_statfs_info(path, UIO_USERSPACE, args.pa_config,
|
2003-06-30 02:28:00 +04:00
|
|
|
UIO_USERSPACE, mp, p);
|
1994-01-05 17:23:21 +03:00
|
|
|
}
|
|
|
|
|
1994-06-08 15:33:09 +04:00
|
|
|
int
|
2003-06-30 02:28:00 +04:00
|
|
|
portal_start(mp, flags, p)
|
1994-01-05 17:23:21 +03:00
|
|
|
struct mount *mp;
|
|
|
|
int flags;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *p;
|
1994-01-05 17:23:21 +03:00
|
|
|
{
|
1994-06-08 15:33:09 +04:00
|
|
|
|
1994-01-05 17:23:21 +03:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
1994-06-08 15:33:09 +04:00
|
|
|
int
|
2003-06-30 02:28:00 +04:00
|
|
|
portal_unmount(mp, mntflags, p)
|
1994-01-05 17:23:21 +03:00
|
|
|
struct mount *mp;
|
|
|
|
int mntflags;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *p;
|
1994-01-05 17:23:21 +03:00
|
|
|
{
|
|
|
|
struct vnode *rootvp = VFSTOPORTAL(mp)->pm_root;
|
1994-06-08 15:33:09 +04:00
|
|
|
int error, flags = 0;
|
1994-01-05 17:23:21 +03:00
|
|
|
|
1998-03-01 05:20:01 +03:00
|
|
|
if (mntflags & MNT_FORCE)
|
1994-01-05 17:23:21 +03: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...
|
|
|
|
*/
|
1994-06-08 15:33:09 +04:00
|
|
|
#ifdef notyet
|
1994-01-05 17:23:21 +03:00
|
|
|
mntflushbuf(mp, 0);
|
|
|
|
if (mntinvalbuf(mp, 1))
|
|
|
|
return (EBUSY);
|
1994-06-08 15:33:09 +04:00
|
|
|
#endif
|
1994-01-05 17:23:21 +03:00
|
|
|
if (rootvp->v_usecount > 1)
|
|
|
|
return (EBUSY);
|
1996-02-10 01:39:56 +03:00
|
|
|
if ((error = vflush(mp, rootvp, flags)) != 0)
|
1994-01-05 17:23:21 +03:00
|
|
|
return (error);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Release reference on underlying root vnode
|
|
|
|
*/
|
|
|
|
vrele(rootvp);
|
|
|
|
/*
|
|
|
|
* And blow it away for future re-use
|
|
|
|
*/
|
|
|
|
vgone(rootvp);
|
|
|
|
/*
|
|
|
|
* Shutdown the socket. This will cause the select in the
|
|
|
|
* daemon to wake up, and then the accept will get ECONNABORTED
|
|
|
|
* which it interprets as a request to go and bury itself.
|
|
|
|
*/
|
2003-02-23 17:37:32 +03:00
|
|
|
simple_lock(&VFSTOPORTAL(mp)->pm_server->f_slock);
|
1999-05-06 00:01:01 +04:00
|
|
|
FILE_USE(VFSTOPORTAL(mp)->pm_server);
|
1994-01-05 17:23:21 +03:00
|
|
|
soshutdown((struct socket *) VFSTOPORTAL(mp)->pm_server->f_data, 2);
|
|
|
|
/*
|
|
|
|
* Discard reference to underlying file. Must call closef because
|
|
|
|
* this may be the last reference.
|
|
|
|
*/
|
2003-06-30 02:28:00 +04:00
|
|
|
closef(VFSTOPORTAL(mp)->pm_server, (struct proc *) 0);
|
1994-01-05 17:23:21 +03:00
|
|
|
/*
|
|
|
|
* Finally, throw away the portalmount structure
|
|
|
|
*/
|
|
|
|
free(mp->mnt_data, M_UFSMNT); /* XXX */
|
|
|
|
mp->mnt_data = 0;
|
1994-06-08 15:33:09 +04:00
|
|
|
return (0);
|
1994-01-05 17:23:21 +03:00
|
|
|
}
|
|
|
|
|
1994-06-08 15:33:09 +04:00
|
|
|
int
|
2003-06-29 22:43:21 +04:00
|
|
|
portal_root(mp, vpp)
|
1994-01-05 17:23:21 +03:00
|
|
|
struct mount *mp;
|
|
|
|
struct vnode **vpp;
|
|
|
|
{
|
|
|
|
struct vnode *vp;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Return locked reference to root.
|
|
|
|
*/
|
|
|
|
vp = VFSTOPORTAL(mp)->pm_root;
|
|
|
|
VREF(vp);
|
1998-03-01 05:20:01 +03:00
|
|
|
vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
|
1994-01-05 17:23:21 +03:00
|
|
|
*vpp = vp;
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
1994-06-08 15:33:09 +04:00
|
|
|
int
|
2003-06-30 02:28:00 +04:00
|
|
|
portal_quotactl(mp, cmd, uid, arg, p)
|
1994-01-05 17:23:21 +03:00
|
|
|
struct mount *mp;
|
|
|
|
int cmd;
|
|
|
|
uid_t uid;
|
|
|
|
caddr_t arg;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *p;
|
1994-01-05 17:23:21 +03:00
|
|
|
{
|
1994-06-08 15:33:09 +04:00
|
|
|
|
1994-01-05 17:23:21 +03:00
|
|
|
return (EOPNOTSUPP);
|
|
|
|
}
|
|
|
|
|
1994-06-08 15:33:09 +04:00
|
|
|
int
|
2003-06-30 02:28:00 +04:00
|
|
|
portal_statfs(mp, sbp, p)
|
1994-01-05 17:23:21 +03:00
|
|
|
struct mount *mp;
|
|
|
|
struct statfs *sbp;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *p;
|
1994-01-05 17:23:21 +03:00
|
|
|
{
|
|
|
|
|
|
|
|
sbp->f_bsize = DEV_BSIZE;
|
1994-04-21 11:47:31 +04:00
|
|
|
sbp->f_iosize = DEV_BSIZE;
|
1994-01-05 17:23:21 +03:00
|
|
|
sbp->f_blocks = 2; /* 1K to keep df happy */
|
|
|
|
sbp->f_bfree = 0;
|
|
|
|
sbp->f_bavail = 0;
|
|
|
|
sbp->f_files = 1; /* Allow for "." */
|
|
|
|
sbp->f_ffree = 0; /* See comments above */
|
1998-03-01 05:20:01 +03:00
|
|
|
#ifdef COMPAT_09
|
|
|
|
sbp->f_type = 12;
|
|
|
|
#else
|
|
|
|
sbp->f_type = 0;
|
|
|
|
#endif
|
2003-04-17 01:44:18 +04:00
|
|
|
copy_statfs_info(sbp, mp);
|
1994-01-05 17:23:21 +03:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
1996-02-10 01:39:56 +03:00
|
|
|
/*ARGSUSED*/
|
1994-06-08 15:33:09 +04:00
|
|
|
int
|
2003-06-30 02:28:00 +04:00
|
|
|
portal_sync(mp, waitfor, uc, p)
|
1994-01-05 17:23:21 +03:00
|
|
|
struct mount *mp;
|
|
|
|
int waitfor;
|
1996-02-10 01:39:56 +03:00
|
|
|
struct ucred *uc;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *p;
|
1994-01-05 17:23:21 +03:00
|
|
|
{
|
1994-06-08 15:33:09 +04:00
|
|
|
|
1994-01-05 17:23:21 +03:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
1994-06-08 15:33:09 +04:00
|
|
|
int
|
2003-06-29 22:43:21 +04:00
|
|
|
portal_vget(mp, ino, vpp)
|
1994-06-08 15:33:09 +04:00
|
|
|
struct mount *mp;
|
|
|
|
ino_t ino;
|
|
|
|
struct vnode **vpp;
|
|
|
|
{
|
|
|
|
|
|
|
|
return (EOPNOTSUPP);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
2003-06-29 22:43:21 +04:00
|
|
|
portal_fhtovp(mp, fhp, vpp)
|
1994-01-05 17:23:21 +03:00
|
|
|
struct mount *mp;
|
|
|
|
struct fid *fhp;
|
|
|
|
struct vnode **vpp;
|
1999-02-27 02:44:43 +03:00
|
|
|
{
|
|
|
|
|
|
|
|
return (EOPNOTSUPP);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
portal_checkexp(mp, mb, what, anon)
|
|
|
|
struct mount *mp;
|
|
|
|
struct mbuf *mb;
|
1996-02-10 01:39:56 +03:00
|
|
|
int *what;
|
|
|
|
struct ucred **anon;
|
1994-01-05 17:23:21 +03:00
|
|
|
{
|
1994-06-08 15:33:09 +04:00
|
|
|
|
1994-01-05 17:23:21 +03:00
|
|
|
return (EOPNOTSUPP);
|
|
|
|
}
|
|
|
|
|
1994-06-08 15:33:09 +04:00
|
|
|
int
|
1994-01-05 17:23:21 +03:00
|
|
|
portal_vptofh(vp, fhp)
|
|
|
|
struct vnode *vp;
|
|
|
|
struct fid *fhp;
|
|
|
|
{
|
1994-06-08 15:33:09 +04:00
|
|
|
|
1994-01-05 17:23:21 +03:00
|
|
|
return (EOPNOTSUPP);
|
|
|
|
}
|
|
|
|
|
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_portal_setup, "sysctl vfs.portal subtree setup")
|
1998-03-01 05:20:01 +03:00
|
|
|
{
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
|
|
|
|
sysctl_createv(SYSCTL_PERMANENT,
|
|
|
|
CTLTYPE_NODE, "vfs", NULL,
|
|
|
|
NULL, 0, NULL, 0,
|
|
|
|
CTL_VFS, CTL_EOL);
|
|
|
|
sysctl_createv(SYSCTL_PERMANENT,
|
|
|
|
CTLTYPE_NODE, "portal", NULL,
|
|
|
|
NULL, 0, NULL, 0,
|
|
|
|
CTL_VFS, 8, CTL_EOL);
|
|
|
|
/*
|
|
|
|
* XXX the "8" above could be dynamic, thereby eliminating one
|
|
|
|
* more instance of the "number to vfs" mapping problem, but
|
|
|
|
* "8" is the order as taken from sys/mount.h
|
|
|
|
*/
|
1998-03-01 05:20:01 +03:00
|
|
|
}
|
|
|
|
|
2001-01-22 15:17:35 +03:00
|
|
|
extern const struct vnodeopv_desc portal_vnodeop_opv_desc;
|
1998-02-18 10:05:47 +03:00
|
|
|
|
2001-01-22 15:17:35 +03:00
|
|
|
const struct vnodeopv_desc * const portal_vnodeopv_descs[] = {
|
1998-02-18 10:05:47 +03:00
|
|
|
&portal_vnodeop_opv_desc,
|
|
|
|
NULL,
|
|
|
|
};
|
|
|
|
|
1994-01-05 17:23:21 +03:00
|
|
|
struct vfsops portal_vfsops = {
|
1994-04-14 08:05:45 +04:00
|
|
|
MOUNT_PORTAL,
|
1994-01-05 17:23:21 +03:00
|
|
|
portal_mount,
|
|
|
|
portal_start,
|
|
|
|
portal_unmount,
|
|
|
|
portal_root,
|
|
|
|
portal_quotactl,
|
|
|
|
portal_statfs,
|
|
|
|
portal_sync,
|
1994-06-08 15:33:09 +04:00
|
|
|
portal_vget,
|
1994-01-05 17:23:21 +03:00
|
|
|
portal_fhtovp,
|
|
|
|
portal_vptofh,
|
|
|
|
portal_init,
|
2001-09-15 20:12:54 +04:00
|
|
|
NULL,
|
2000-03-16 21:08:17 +03:00
|
|
|
portal_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-02-27 02:44:43 +03:00
|
|
|
portal_checkexp,
|
1998-02-18 10:05:47 +03:00
|
|
|
portal_vnodeopv_descs,
|
1994-01-05 17:23:21 +03:00
|
|
|
};
|