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: procfs_vfsops.c,v 1.51 2003/12/04 19:38:24 atatat Exp $ */
|
1994-06-29 10:29:24 +04:00
|
|
|
|
1993-08-24 16:59:09 +04:00
|
|
|
/*
|
1994-06-08 15:33:09 +04:00
|
|
|
* Copyright (c) 1993
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
1993-08-24 20:25:07 +04:00
|
|
|
*
|
1994-01-05 10:51:08 +03:00
|
|
|
* This code is derived from software contributed to Berkeley by
|
|
|
|
* Jan-Simon Pendry.
|
|
|
|
*
|
1993-08-24 20:25:07 +04: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.
|
2003-08-07 20:26:28 +04:00
|
|
|
* 3. 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.
|
|
|
|
*
|
|
|
|
* @(#)procfs_vfsops.c 8.7 (Berkeley) 5/10/95
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Copyright (c) 1993 Jan-Simon Pendry
|
|
|
|
*
|
|
|
|
* This code is derived from software contributed 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.
|
1993-08-24 20:25:07 +04:00
|
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
|
|
* must display the following acknowledgement:
|
1994-01-05 10:51:08 +03:00
|
|
|
* 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.
|
1993-08-24 20:25:07 +04:00
|
|
|
*
|
1998-03-01 05:20:01 +03:00
|
|
|
* @(#)procfs_vfsops.c 8.7 (Berkeley) 5/10/95
|
1993-08-24 20:25:07 +04:00
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
1994-01-05 10:51:08 +03:00
|
|
|
* procfs VFS interface
|
1993-08-24 16:59:09 +04:00
|
|
|
*/
|
|
|
|
|
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: procfs_vfsops.c,v 1.51 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
|
|
|
|
|
1993-12-18 06:48:27 +03:00
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/time.h>
|
|
|
|
#include <sys/kernel.h>
|
1996-02-10 01:39:56 +03:00
|
|
|
#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>
|
1993-12-18 06:48:27 +03:00
|
|
|
#include <sys/proc.h>
|
|
|
|
#include <sys/buf.h>
|
1994-01-05 10:51:08 +03:00
|
|
|
#include <sys/syslog.h>
|
1993-12-18 06:48:27 +03:00
|
|
|
#include <sys/mount.h>
|
|
|
|
#include <sys/signalvar.h>
|
|
|
|
#include <sys/vnode.h>
|
2000-01-26 00:52:04 +03:00
|
|
|
#include <sys/malloc.h>
|
2000-06-28 06:44:06 +04:00
|
|
|
|
1994-01-05 10:51:08 +03:00
|
|
|
#include <miscfs/procfs/procfs.h>
|
2000-06-28 06:44:06 +04:00
|
|
|
|
|
|
|
#include <uvm/uvm_extern.h> /* for PAGE_SIZE */
|
1993-08-24 16:59:09 +04:00
|
|
|
|
1998-03-01 05:20:01 +03:00
|
|
|
void procfs_init __P((void));
|
2001-09-15 20:12:54 +04:00
|
|
|
void procfs_reinit __P((void));
|
2000-03-16 21:08:17 +03:00
|
|
|
void procfs_done __P((void));
|
1996-12-22 13:10:12 +03:00
|
|
|
int procfs_mount __P((struct mount *, const char *, void *,
|
2003-06-30 02:28:00 +04:00
|
|
|
struct nameidata *, struct proc *));
|
|
|
|
int procfs_start __P((struct mount *, int, struct proc *));
|
|
|
|
int procfs_unmount __P((struct mount *, int, struct proc *));
|
1996-02-10 01:39:56 +03:00
|
|
|
int procfs_quotactl __P((struct mount *, int, uid_t, caddr_t,
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *));
|
|
|
|
int procfs_statfs __P((struct mount *, struct statfs *, struct proc *));
|
|
|
|
int procfs_sync __P((struct mount *, int, struct ucred *, struct proc *));
|
2003-06-29 22:43:21 +04:00
|
|
|
int procfs_vget __P((struct mount *, ino_t, struct vnode **));
|
|
|
|
int procfs_fhtovp __P((struct mount *, struct fid *, struct vnode **));
|
1999-02-27 02:44:43 +03:00
|
|
|
int procfs_checkexp __P((struct mount *, struct mbuf *, int *,
|
|
|
|
struct ucred **));
|
1996-02-10 01:39:56 +03:00
|
|
|
int procfs_vptofh __P((struct vnode *, struct fid *));
|
1993-08-24 16:59:09 +04:00
|
|
|
/*
|
|
|
|
* VFS Operations.
|
|
|
|
*
|
|
|
|
* mount system call
|
|
|
|
*/
|
|
|
|
/* ARGSUSED */
|
1996-02-10 01:39:56 +03:00
|
|
|
int
|
2003-06-30 02:28:00 +04:00
|
|
|
procfs_mount(mp, path, data, ndp, p)
|
1994-01-05 10:51:08 +03:00
|
|
|
struct mount *mp;
|
1996-12-22 13:10:12 +03:00
|
|
|
const char *path;
|
|
|
|
void *data;
|
1993-08-24 16:59:09 +04:00
|
|
|
struct nameidata *ndp;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *p;
|
1993-08-24 16:59:09 +04:00
|
|
|
{
|
2000-01-26 00:52:04 +03:00
|
|
|
struct procfsmount *pmnt;
|
2001-01-17 03:09:07 +03:00
|
|
|
struct procfs_args args;
|
|
|
|
int error;
|
1993-08-24 16:59:09 +04:00
|
|
|
|
1994-01-05 10:51:08 +03:00
|
|
|
if (UIO_MX & (UIO_MX-1)) {
|
|
|
|
log(LOG_ERR, "procfs: invalid directory entry size");
|
|
|
|
return (EINVAL);
|
1993-08-24 16:59:09 +04:00
|
|
|
}
|
|
|
|
|
2002-09-21 22:08:27 +04:00
|
|
|
if (mp->mnt_flag & MNT_GETARGS) {
|
|
|
|
pmnt = VFSTOPROC(mp);
|
|
|
|
if (pmnt == NULL)
|
|
|
|
return EIO;
|
|
|
|
args.version = PROCFS_ARGSVERSION;
|
|
|
|
args.flags = pmnt->pmnt_flags;
|
|
|
|
return copyout(&args, data, sizeof(args));
|
|
|
|
}
|
|
|
|
|
1994-01-05 10:51:08 +03:00
|
|
|
if (mp->mnt_flag & MNT_UPDATE)
|
|
|
|
return (EOPNOTSUPP);
|
|
|
|
|
2001-01-17 03:09:07 +03:00
|
|
|
if (data != NULL) {
|
|
|
|
error = copyin(data, &args, sizeof args);
|
|
|
|
if (error != 0)
|
|
|
|
return error;
|
|
|
|
|
|
|
|
if (args.version != PROCFS_ARGSVERSION)
|
|
|
|
return EINVAL;
|
|
|
|
} else
|
|
|
|
args.flags = 0;
|
|
|
|
|
1994-06-08 15:33:09 +04:00
|
|
|
mp->mnt_flag |= MNT_LOCAL;
|
2000-01-26 00:52:04 +03:00
|
|
|
pmnt = (struct procfsmount *) malloc(sizeof(struct procfsmount),
|
|
|
|
M_UFSMNT, M_WAITOK); /* XXX need new malloc type */
|
|
|
|
|
2002-07-30 11:40:07 +04:00
|
|
|
mp->mnt_data = pmnt;
|
2000-06-10 22:27:01 +04:00
|
|
|
vfs_getnewfsid(mp);
|
1994-01-05 10:51:08 +03:00
|
|
|
|
2003-04-17 01:44:18 +04:00
|
|
|
error = set_statfs_info(path, UIO_USERSPACE, "procfs", UIO_SYSSPACE,
|
2003-06-30 02:28:00 +04:00
|
|
|
mp, p);
|
2000-01-26 00:52:04 +03:00
|
|
|
pmnt->pmnt_exechook = exechook_establish(procfs_revoke_vnodes, mp);
|
2001-01-17 03:09:07 +03:00
|
|
|
pmnt->pmnt_flags = args.flags;
|
2000-01-26 00:52:04 +03:00
|
|
|
|
2003-04-17 01:44:18 +04:00
|
|
|
return error;
|
1993-08-24 16:59:09 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* unmount system call
|
|
|
|
*/
|
1996-02-10 01:39:56 +03:00
|
|
|
int
|
2003-06-30 02:28:00 +04:00
|
|
|
procfs_unmount(mp, mntflags, p)
|
1993-08-24 16:59:09 +04:00
|
|
|
struct mount *mp;
|
|
|
|
int mntflags;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *p;
|
1993-08-24 16:59:09 +04:00
|
|
|
{
|
1994-01-05 10:51:08 +03:00
|
|
|
int error;
|
|
|
|
int flags = 0;
|
|
|
|
|
1998-03-01 05:20:01 +03:00
|
|
|
if (mntflags & MNT_FORCE)
|
1994-01-05 10:51:08 +03:00
|
|
|
flags |= FORCECLOSE;
|
|
|
|
|
1996-02-10 01:39:56 +03:00
|
|
|
if ((error = vflush(mp, 0, flags)) != 0)
|
1994-01-05 10:51:08 +03:00
|
|
|
return (error);
|
|
|
|
|
2000-01-26 00:52:04 +03:00
|
|
|
exechook_disestablish(VFSTOPROC(mp)->pmnt_exechook);
|
|
|
|
|
|
|
|
free(mp->mnt_data, M_UFSMNT);
|
|
|
|
mp->mnt_data = 0;
|
|
|
|
|
1993-08-24 16:59:09 +04:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
1996-02-10 01:39:56 +03:00
|
|
|
int
|
2003-06-29 22:43:21 +04:00
|
|
|
procfs_root(mp, vpp)
|
1993-08-24 16:59:09 +04:00
|
|
|
struct mount *mp;
|
|
|
|
struct vnode **vpp;
|
|
|
|
{
|
|
|
|
|
2003-09-27 17:29:02 +04:00
|
|
|
return (procfs_allocvp(mp, vpp, 0, PFSroot, -1));
|
1993-08-24 16:59:09 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/* ARGSUSED */
|
1996-02-10 01:39:56 +03:00
|
|
|
int
|
2003-06-30 02:28:00 +04:00
|
|
|
procfs_start(mp, flags, p)
|
1993-08-24 16:59:09 +04:00
|
|
|
struct mount *mp;
|
|
|
|
int flags;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *p;
|
1993-08-24 16:59:09 +04:00
|
|
|
{
|
1994-01-05 10:51:08 +03:00
|
|
|
|
|
|
|
return (0);
|
1993-08-24 16:59:09 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Get file system statistics.
|
|
|
|
*/
|
1996-02-10 01:39:56 +03:00
|
|
|
int
|
2003-06-30 02:28:00 +04:00
|
|
|
procfs_statfs(mp, sbp, p)
|
1993-08-24 16:59:09 +04:00
|
|
|
struct mount *mp;
|
|
|
|
struct statfs *sbp;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *p;
|
1993-08-24 16:59:09 +04:00
|
|
|
{
|
1994-06-08 15:33:09 +04:00
|
|
|
|
|
|
|
sbp->f_bsize = PAGE_SIZE;
|
1994-04-21 11:47:31 +04:00
|
|
|
sbp->f_iosize = PAGE_SIZE;
|
1994-01-05 10:51:08 +03:00
|
|
|
sbp->f_blocks = 1; /* avoid divide by zero in some df's */
|
1993-08-24 21:49:16 +04:00
|
|
|
sbp->f_bfree = 0;
|
1993-08-24 16:59:09 +04:00
|
|
|
sbp->f_bavail = 0;
|
1994-01-05 10:51:08 +03:00
|
|
|
sbp->f_files = maxproc; /* approx */
|
|
|
|
sbp->f_ffree = maxproc - nprocs; /* approx */
|
1998-03-01 05:20:01 +03:00
|
|
|
#ifdef COMPAT_09
|
|
|
|
sbp->f_type = 10;
|
|
|
|
#else
|
|
|
|
sbp->f_type = 0;
|
|
|
|
#endif
|
2003-04-17 01:44:18 +04:00
|
|
|
copy_statfs_info(sbp, mp);
|
1994-01-05 10:51:08 +03:00
|
|
|
return (0);
|
1993-08-24 16:59:09 +04:00
|
|
|
}
|
|
|
|
|
1996-02-10 01:39:56 +03:00
|
|
|
/*ARGSUSED*/
|
|
|
|
int
|
2003-06-30 02:28:00 +04:00
|
|
|
procfs_quotactl(mp, cmds, uid, arg, p)
|
1993-08-24 16:59:09 +04:00
|
|
|
struct mount *mp;
|
|
|
|
int cmds;
|
|
|
|
uid_t uid;
|
|
|
|
caddr_t arg;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *p;
|
1993-08-24 16:59:09 +04:00
|
|
|
{
|
1994-01-05 10:51:08 +03:00
|
|
|
|
|
|
|
return (EOPNOTSUPP);
|
1993-08-24 16:59:09 +04:00
|
|
|
}
|
|
|
|
|
1996-02-10 01:39:56 +03:00
|
|
|
/*ARGSUSED*/
|
|
|
|
int
|
2003-06-30 02:28:00 +04:00
|
|
|
procfs_sync(mp, waitfor, uc, p)
|
1993-08-24 16:59:09 +04: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;
|
1993-08-24 16:59:09 +04:00
|
|
|
{
|
1994-01-05 10:51:08 +03:00
|
|
|
|
|
|
|
return (0);
|
1993-08-24 16:59:09 +04:00
|
|
|
}
|
|
|
|
|
1996-02-10 01:39:56 +03:00
|
|
|
/*ARGSUSED*/
|
|
|
|
int
|
2003-06-29 22:43:21 +04:00
|
|
|
procfs_vget(mp, ino, vpp)
|
1994-06-08 15:33:09 +04:00
|
|
|
struct mount *mp;
|
|
|
|
ino_t ino;
|
|
|
|
struct vnode **vpp;
|
|
|
|
{
|
|
|
|
return (EOPNOTSUPP);
|
|
|
|
}
|
|
|
|
|
1996-02-10 01:39:56 +03:00
|
|
|
/*ARGSUSED*/
|
|
|
|
int
|
2003-06-29 22:43:21 +04:00
|
|
|
procfs_fhtovp(mp, fhp, vpp)
|
1994-01-05 10:51:08 +03:00
|
|
|
struct mount *mp;
|
1993-08-24 16:59:09 +04:00
|
|
|
struct fid *fhp;
|
|
|
|
struct vnode **vpp;
|
1999-02-27 02:44:43 +03:00
|
|
|
{
|
|
|
|
|
|
|
|
return (EINVAL);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*ARGSUSED*/
|
|
|
|
int
|
|
|
|
procfs_checkexp(mp, mb, what, anon)
|
|
|
|
struct mount *mp;
|
|
|
|
struct mbuf *mb;
|
1996-02-10 01:39:56 +03:00
|
|
|
int *what;
|
|
|
|
struct ucred **anon;
|
1993-08-24 16:59:09 +04:00
|
|
|
{
|
1994-06-08 15:33:09 +04:00
|
|
|
|
|
|
|
return (EINVAL);
|
1993-08-24 16:59:09 +04:00
|
|
|
}
|
|
|
|
|
1996-02-10 01:39:56 +03:00
|
|
|
/*ARGSUSED*/
|
|
|
|
int
|
1994-01-05 10:51:08 +03:00
|
|
|
procfs_vptofh(vp, fhp)
|
1993-08-24 16:59:09 +04:00
|
|
|
struct vnode *vp;
|
|
|
|
struct fid *fhp;
|
|
|
|
{
|
1994-06-08 15:33:09 +04:00
|
|
|
|
|
|
|
return (EINVAL);
|
1993-08-24 16:59:09 +04:00
|
|
|
}
|
|
|
|
|
1996-02-10 01:39:56 +03:00
|
|
|
void
|
1994-01-05 10:51:08 +03:00
|
|
|
procfs_init()
|
1993-08-24 16:59:09 +04:00
|
|
|
{
|
2000-01-26 00:52:04 +03:00
|
|
|
procfs_hashinit();
|
1993-08-24 16:59:09 +04:00
|
|
|
}
|
1994-01-05 10:51:08 +03:00
|
|
|
|
2001-09-15 20:12:54 +04:00
|
|
|
void
|
|
|
|
procfs_reinit()
|
|
|
|
{
|
|
|
|
procfs_hashreinit();
|
|
|
|
}
|
|
|
|
|
2000-03-16 21:08:17 +03:00
|
|
|
void
|
|
|
|
procfs_done()
|
|
|
|
{
|
|
|
|
procfs_hashdone();
|
|
|
|
}
|
|
|
|
|
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_procfs_setup, "sysctl vfs.procfs 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, "procfs", NULL,
|
|
|
|
NULL, 0, NULL, 0,
|
|
|
|
CTL_VFS, 12, CTL_EOL);
|
|
|
|
/*
|
|
|
|
* XXX the "12" above could be dynamic, thereby eliminating
|
|
|
|
* one more instance of the "number to vfs" mapping problem,
|
|
|
|
* but "12" 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 procfs_vnodeop_opv_desc;
|
1998-02-18 10:05:47 +03:00
|
|
|
|
2001-01-22 15:17:35 +03:00
|
|
|
const struct vnodeopv_desc * const procfs_vnodeopv_descs[] = {
|
1998-02-18 10:05:47 +03:00
|
|
|
&procfs_vnodeop_opv_desc,
|
|
|
|
NULL,
|
|
|
|
};
|
|
|
|
|
1994-01-05 10:51:08 +03:00
|
|
|
struct vfsops procfs_vfsops = {
|
1994-04-14 08:05:45 +04:00
|
|
|
MOUNT_PROCFS,
|
1994-01-05 10:51:08 +03:00
|
|
|
procfs_mount,
|
|
|
|
procfs_start,
|
|
|
|
procfs_unmount,
|
|
|
|
procfs_root,
|
|
|
|
procfs_quotactl,
|
|
|
|
procfs_statfs,
|
|
|
|
procfs_sync,
|
1994-06-08 15:33:09 +04:00
|
|
|
procfs_vget,
|
1994-01-05 10:51:08 +03:00
|
|
|
procfs_fhtovp,
|
|
|
|
procfs_vptofh,
|
|
|
|
procfs_init,
|
2001-09-15 20:12:54 +04:00
|
|
|
procfs_reinit,
|
2000-03-16 21:08:17 +03:00
|
|
|
procfs_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
|
|
|
procfs_checkexp,
|
1998-02-18 10:05:47 +03:00
|
|
|
procfs_vnodeopv_descs,
|
1994-01-05 10:51:08 +03:00
|
|
|
};
|