2005-01-02 19:08:28 +03:00
|
|
|
/* $NetBSD: fdesc_vfsops.c,v 1.53 2005/01/02 16:08:29 thorpej Exp $ */
|
1994-06-29 10:29:24 +04:00
|
|
|
|
1993-03-24 02:56:31 +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.
|
1993-03-24 02:56:31 +03:00
|
|
|
*
|
1994-01-05 12:00:57 +03:00
|
|
|
* This code is derived from software donated to Berkeley by
|
1993-03-24 02:56:31 +03:00
|
|
|
* Jan-Simon Pendry.
|
|
|
|
*
|
changed copyright notice thanks to following statement:
Return-Path: jsp@compnews.co.uk
Received: from ben.uknet.ac.uk by postgres.Berkeley.EDU (5.61/1.29)
id AA25983; Thu, 25 Mar 93 05:37:37 -0800
Received: from fennel.compnews.co.uk by ben.uknet.ac.uk via UKIP with SMTP (PP)
id <g.05640-0@ben.uknet.ac.uk>; Thu, 25 Mar 1993 13:37:19 +0000
Received: from sage.compnews.co.uk by fennel.compnews.co.uk;
Thu, 25 Mar 93 13:37:08 GMT
Message-Id: <28109.9303251337@sage.compnews.co.uk>
From: jsp@compnews.co.uk (Jan-Simon Pendry)
Date: Thu, 25 Mar 1993 13:37:05 +0100
In-Reply-To: cgd@postgres.berkeley.edu's message as of Mar 25, 5:32am.
Phone-Number-1: +44 430 432450
Phone-Number-2: +44 430 432480 x20
Fax-Number: +44 430 432022
X-Mailer: Mail User's Shell (7.2.5 10/14/92)
To: cgd@postgres.berkeley.edu
Subject: Re: fdesc/kernfs/etc code...
You may put this copyright message on the source code:
/*
* Copyright (c) 1990, 1992 Jan-Simon Pendry
* All rights reserved.
*
* 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.
* 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.
*
*/
1993-03-25 09:00:17 +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.
|
2003-08-07 20:26:28 +04:00
|
|
|
* 3. Neither the name of the University nor the names of its contributors
|
changed copyright notice thanks to following statement:
Return-Path: jsp@compnews.co.uk
Received: from ben.uknet.ac.uk by postgres.Berkeley.EDU (5.61/1.29)
id AA25983; Thu, 25 Mar 93 05:37:37 -0800
Received: from fennel.compnews.co.uk by ben.uknet.ac.uk via UKIP with SMTP (PP)
id <g.05640-0@ben.uknet.ac.uk>; Thu, 25 Mar 1993 13:37:19 +0000
Received: from sage.compnews.co.uk by fennel.compnews.co.uk;
Thu, 25 Mar 93 13:37:08 GMT
Message-Id: <28109.9303251337@sage.compnews.co.uk>
From: jsp@compnews.co.uk (Jan-Simon Pendry)
Date: Thu, 25 Mar 1993 13:37:05 +0100
In-Reply-To: cgd@postgres.berkeley.edu's message as of Mar 25, 5:32am.
Phone-Number-1: +44 430 432450
Phone-Number-2: +44 430 432480 x20
Fax-Number: +44 430 432022
X-Mailer: Mail User's Shell (7.2.5 10/14/92)
To: cgd@postgres.berkeley.edu
Subject: Re: fdesc/kernfs/etc code...
You may put this copyright message on the source code:
/*
* Copyright (c) 1990, 1992 Jan-Simon Pendry
* All rights reserved.
*
* 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.
* 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.
*
*/
1993-03-25 09:00:17 +03:00
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
1993-03-24 02:56:31 +03:00
|
|
|
*
|
changed copyright notice thanks to following statement:
Return-Path: jsp@compnews.co.uk
Received: from ben.uknet.ac.uk by postgres.Berkeley.EDU (5.61/1.29)
id AA25983; Thu, 25 Mar 93 05:37:37 -0800
Received: from fennel.compnews.co.uk by ben.uknet.ac.uk via UKIP with SMTP (PP)
id <g.05640-0@ben.uknet.ac.uk>; Thu, 25 Mar 1993 13:37:19 +0000
Received: from sage.compnews.co.uk by fennel.compnews.co.uk;
Thu, 25 Mar 93 13:37:08 GMT
Message-Id: <28109.9303251337@sage.compnews.co.uk>
From: jsp@compnews.co.uk (Jan-Simon Pendry)
Date: Thu, 25 Mar 1993 13:37:05 +0100
In-Reply-To: cgd@postgres.berkeley.edu's message as of Mar 25, 5:32am.
Phone-Number-1: +44 430 432450
Phone-Number-2: +44 430 432480 x20
Fax-Number: +44 430 432022
X-Mailer: Mail User's Shell (7.2.5 10/14/92)
To: cgd@postgres.berkeley.edu
Subject: Re: fdesc/kernfs/etc code...
You may put this copyright message on the source code:
/*
* Copyright (c) 1990, 1992 Jan-Simon Pendry
* All rights reserved.
*
* 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.
* 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.
*
*/
1993-03-25 09:00:17 +03:00
|
|
|
* 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-03-24 02:56:31 +03:00
|
|
|
*
|
1998-03-01 05:20:01 +03:00
|
|
|
* @(#)fdesc_vfsops.c 8.10 (Berkeley) 5/14/95
|
1994-12-13 12:58:11 +03:00
|
|
|
*
|
|
|
|
* #Id: fdesc_vfsops.c,v 1.9 1993/04/06 15:28:33 jsp Exp #
|
1993-03-24 02:56:31 +03:00
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* /dev/fd Filesystem
|
|
|
|
*/
|
|
|
|
|
2001-11-10 16:33:40 +03:00
|
|
|
#include <sys/cdefs.h>
|
2005-01-02 19:08:28 +03:00
|
|
|
__KERNEL_RCSID(0, "$NetBSD: fdesc_vfsops.c,v 1.53 2005/01/02 16:08:29 thorpej 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 12:00:57 +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 12:00:57 +03:00
|
|
|
#include <sys/time.h>
|
|
|
|
#include <sys/proc.h>
|
|
|
|
#include <sys/resourcevar.h>
|
|
|
|
#include <sys/filedesc.h>
|
|
|
|
#include <sys/vnode.h>
|
|
|
|
#include <sys/mount.h>
|
2004-04-21 06:38:16 +04:00
|
|
|
#include <sys/dirent.h>
|
1994-01-05 12:00:57 +03:00
|
|
|
#include <sys/namei.h>
|
|
|
|
#include <sys/malloc.h>
|
|
|
|
#include <miscfs/fdesc/fdesc.h>
|
|
|
|
|
1996-12-22 13:10:12 +03:00
|
|
|
int fdesc_mount __P((struct mount *, const char *, void *,
|
2003-06-30 02:28:00 +04:00
|
|
|
struct nameidata *, struct proc *));
|
|
|
|
int fdesc_start __P((struct mount *, int, struct proc *));
|
|
|
|
int fdesc_unmount __P((struct mount *, int, struct proc *));
|
2004-04-27 21:37:30 +04:00
|
|
|
int fdesc_quotactl __P((struct mount *, int, uid_t, void *,
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *));
|
2004-04-21 05:05:31 +04:00
|
|
|
int fdesc_statvfs __P((struct mount *, struct statvfs *, struct proc *));
|
2003-06-30 02:28:00 +04:00
|
|
|
int fdesc_sync __P((struct mount *, int, struct ucred *, struct proc *));
|
2003-06-29 22:43:21 +04:00
|
|
|
int fdesc_vget __P((struct mount *, ino_t, struct vnode **));
|
|
|
|
int fdesc_fhtovp __P((struct mount *, struct fid *, struct vnode **));
|
1999-02-27 02:44:43 +03:00
|
|
|
int fdesc_checkexp __P((struct mount *, struct mbuf *, int *,
|
|
|
|
struct ucred **));
|
1996-02-10 01:39:56 +03:00
|
|
|
int fdesc_vptofh __P((struct vnode *, struct fid *));
|
|
|
|
|
1993-03-24 02:56:31 +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
|
|
|
fdesc_mount(mp, path, data, ndp, p)
|
1993-03-24 02:56:31 +03:00
|
|
|
struct mount *mp;
|
1996-12-22 13:10:12 +03:00
|
|
|
const char *path;
|
|
|
|
void *data;
|
1993-03-24 02:56:31 +03:00
|
|
|
struct nameidata *ndp;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *p;
|
1993-03-24 02:56:31 +03:00
|
|
|
{
|
|
|
|
int error = 0;
|
|
|
|
struct fdescmount *fmp;
|
|
|
|
struct vnode *rvp;
|
|
|
|
|
2002-09-21 22:08:27 +04:00
|
|
|
if (mp->mnt_flag & MNT_GETARGS)
|
|
|
|
return 0;
|
1993-03-24 02:56:31 +03:00
|
|
|
/*
|
|
|
|
* Update is a no-op
|
|
|
|
*/
|
|
|
|
if (mp->mnt_flag & MNT_UPDATE)
|
|
|
|
return (EOPNOTSUPP);
|
|
|
|
|
1994-01-05 12:00:57 +03:00
|
|
|
error = fdesc_allocvp(Froot, FD_ROOT, mp, &rvp);
|
1993-03-24 02:56:31 +03:00
|
|
|
if (error)
|
|
|
|
return (error);
|
|
|
|
|
1994-01-05 12:00:57 +03:00
|
|
|
MALLOC(fmp, struct fdescmount *, sizeof(struct fdescmount),
|
1994-06-08 15:33:09 +04:00
|
|
|
M_UFSMNT, M_WAITOK); /* XXX */
|
1993-03-24 02:56:31 +03:00
|
|
|
rvp->v_type = VDIR;
|
|
|
|
rvp->v_flag |= VROOT;
|
|
|
|
fmp->f_root = rvp;
|
2004-09-13 23:19:44 +04:00
|
|
|
mp->mnt_stat.f_namemax = MAXNAMLEN;
|
1994-09-15 07:42:37 +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);
|
1993-03-24 02:56:31 +03:00
|
|
|
|
2004-04-21 05:05:31 +04:00
|
|
|
error = set_statvfs_info(path, UIO_USERSPACE, "fdesc", UIO_SYSSPACE,
|
2003-06-30 02:28:00 +04:00
|
|
|
mp, p);
|
1999-07-08 05:26:21 +04:00
|
|
|
VOP_UNLOCK(rvp, 0);
|
2003-04-17 01:44:18 +04:00
|
|
|
return error;
|
1993-03-24 02:56:31 +03:00
|
|
|
}
|
|
|
|
|
1994-06-08 15:33:09 +04:00
|
|
|
int
|
2003-06-30 02:28:00 +04:00
|
|
|
fdesc_start(mp, flags, p)
|
1993-03-24 02:56:31 +03:00
|
|
|
struct mount *mp;
|
|
|
|
int flags;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *p;
|
1993-03-24 02:56:31 +03:00
|
|
|
{
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
1994-06-08 15:33:09 +04:00
|
|
|
int
|
2003-06-30 02:28:00 +04:00
|
|
|
fdesc_unmount(mp, mntflags, p)
|
1993-03-24 02:56:31 +03:00
|
|
|
struct mount *mp;
|
|
|
|
int mntflags;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *p;
|
1993-03-24 02:56:31 +03:00
|
|
|
{
|
|
|
|
int error;
|
|
|
|
int flags = 0;
|
|
|
|
struct vnode *rootvp = VFSTOFDESC(mp)->f_root;
|
|
|
|
|
1998-03-01 05:20:01 +03:00
|
|
|
if (mntflags & MNT_FORCE)
|
1993-03-24 02:56:31 +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...
|
|
|
|
*/
|
|
|
|
if (rootvp->v_usecount > 1)
|
|
|
|
return (EBUSY);
|
1996-02-10 01:39:56 +03:00
|
|
|
if ((error = vflush(mp, rootvp, flags)) != 0)
|
1993-03-24 02:56:31 +03:00
|
|
|
return (error);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Release reference on underlying root vnode
|
|
|
|
*/
|
|
|
|
vrele(rootvp);
|
|
|
|
/*
|
|
|
|
* And blow it away for future re-use
|
|
|
|
*/
|
|
|
|
vgone(rootvp);
|
|
|
|
/*
|
|
|
|
* Finally, throw away the fdescmount structure
|
|
|
|
*/
|
1994-06-08 15:33:09 +04:00
|
|
|
free(mp->mnt_data, M_UFSMNT); /* XXX */
|
1993-03-24 02:56:31 +03:00
|
|
|
mp->mnt_data = 0;
|
1994-06-08 15:33:09 +04:00
|
|
|
|
|
|
|
return (0);
|
1993-03-24 02:56:31 +03:00
|
|
|
}
|
|
|
|
|
1994-06-08 15:33:09 +04:00
|
|
|
int
|
2003-06-29 22:43:21 +04:00
|
|
|
fdesc_root(mp, vpp)
|
1993-03-24 02:56:31 +03:00
|
|
|
struct mount *mp;
|
|
|
|
struct vnode **vpp;
|
|
|
|
{
|
|
|
|
struct vnode *vp;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Return locked reference to root.
|
|
|
|
*/
|
|
|
|
vp = VFSTOFDESC(mp)->f_root;
|
|
|
|
VREF(vp);
|
1998-03-01 05:20:01 +03:00
|
|
|
vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
|
1993-03-24 02:56:31 +03:00
|
|
|
*vpp = vp;
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
1994-06-08 15:33:09 +04:00
|
|
|
int
|
2003-06-30 02:28:00 +04:00
|
|
|
fdesc_quotactl(mp, cmd, uid, arg, p)
|
1993-03-24 02:56:31 +03:00
|
|
|
struct mount *mp;
|
|
|
|
int cmd;
|
|
|
|
uid_t uid;
|
2004-04-27 21:37:30 +04:00
|
|
|
void *arg;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *p;
|
1993-03-24 02:56:31 +03:00
|
|
|
{
|
1994-06-08 15:33:09 +04:00
|
|
|
|
1993-03-24 02:56:31 +03:00
|
|
|
return (EOPNOTSUPP);
|
|
|
|
}
|
|
|
|
|
1994-06-08 15:33:09 +04:00
|
|
|
int
|
2004-04-21 05:05:31 +04:00
|
|
|
fdesc_statvfs(mp, sbp, p)
|
1993-03-24 02:56:31 +03:00
|
|
|
struct mount *mp;
|
2004-04-21 05:05:31 +04:00
|
|
|
struct statvfs *sbp;
|
2003-06-30 02:28:00 +04:00
|
|
|
struct proc *p;
|
1993-03-24 02:56:31 +03:00
|
|
|
{
|
|
|
|
struct filedesc *fdp;
|
|
|
|
int lim;
|
|
|
|
int i;
|
|
|
|
int last;
|
|
|
|
int freefd;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Compute number of free file descriptors.
|
|
|
|
* [ Strange results will ensue if the open file
|
|
|
|
* limit is ever reduced below the current number
|
|
|
|
* of open files... ]
|
|
|
|
*/
|
1993-08-23 20:01:56 +04:00
|
|
|
lim = p->p_rlimit[RLIMIT_NOFILE].rlim_cur;
|
1993-03-24 02:56:31 +03:00
|
|
|
fdp = p->p_fd;
|
|
|
|
last = min(fdp->fd_nfiles, lim);
|
|
|
|
freefd = 0;
|
|
|
|
for (i = fdp->fd_freefile; i < last; i++)
|
|
|
|
if (fdp->fd_ofiles[i] == NULL)
|
|
|
|
freefd++;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Adjust for the fact that the fdesc array may not
|
|
|
|
* have been fully allocated yet.
|
|
|
|
*/
|
|
|
|
if (fdp->fd_nfiles < lim)
|
|
|
|
freefd += (lim - fdp->fd_nfiles);
|
|
|
|
|
|
|
|
sbp->f_bsize = DEV_BSIZE;
|
2004-04-21 05:05:31 +04:00
|
|
|
sbp->f_frsize = DEV_BSIZE;
|
1994-04-21 11:47:31 +04:00
|
|
|
sbp->f_iosize = DEV_BSIZE;
|
1993-03-24 02:56:31 +03:00
|
|
|
sbp->f_blocks = 2; /* 1K to keep df happy */
|
|
|
|
sbp->f_bfree = 0;
|
|
|
|
sbp->f_bavail = 0;
|
2004-04-21 05:05:31 +04:00
|
|
|
sbp->f_bresvd = 0;
|
1993-03-24 02:56:31 +03:00
|
|
|
sbp->f_files = lim + 1; /* Allow for "." */
|
|
|
|
sbp->f_ffree = freefd; /* See comments above */
|
2004-04-21 05:05:31 +04:00
|
|
|
sbp->f_favail = freefd; /* See comments above */
|
|
|
|
sbp->f_fresvd = 0;
|
|
|
|
copy_statvfs_info(sbp, mp);
|
1993-03-24 02:56:31 +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
|
|
|
fdesc_sync(mp, waitfor, uc, p)
|
1993-03-24 02:56:31 +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;
|
1993-03-24 02:56:31 +03:00
|
|
|
{
|
1994-06-08 15:33:09 +04:00
|
|
|
|
1993-03-24 02:56:31 +03:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
1994-06-08 15:33:09 +04:00
|
|
|
/*
|
|
|
|
* Fdesc flat namespace lookup.
|
|
|
|
* Currently unsupported.
|
|
|
|
*/
|
|
|
|
int
|
2003-06-29 22:43:21 +04:00
|
|
|
fdesc_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*/
|
1994-06-08 15:33:09 +04:00
|
|
|
int
|
2003-06-29 22:43:21 +04:00
|
|
|
fdesc_fhtovp(mp, fhp, vpp)
|
1993-03-24 02:56:31 +03:00
|
|
|
struct mount *mp;
|
|
|
|
struct fid *fhp;
|
|
|
|
struct vnode **vpp;
|
1999-02-27 02:44:43 +03:00
|
|
|
{
|
|
|
|
|
|
|
|
return (EOPNOTSUPP);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*ARGSUSED*/
|
|
|
|
int
|
|
|
|
fdesc_checkexp(mp, nam, exflagsp, credanonp)
|
|
|
|
struct mount *mp;
|
|
|
|
struct mbuf *nam;
|
1996-02-10 01:39:56 +03:00
|
|
|
int *exflagsp;
|
|
|
|
struct ucred **credanonp;
|
1993-03-24 02:56:31 +03:00
|
|
|
{
|
1996-02-10 01:39:56 +03:00
|
|
|
|
1993-03-24 02:56:31 +03:00
|
|
|
return (EOPNOTSUPP);
|
|
|
|
}
|
|
|
|
|
1996-02-10 01:39:56 +03:00
|
|
|
/*ARGSUSED*/
|
1994-06-08 15:33:09 +04:00
|
|
|
int
|
1993-03-24 02:56:31 +03:00
|
|
|
fdesc_vptofh(vp, fhp)
|
|
|
|
struct vnode *vp;
|
|
|
|
struct fid *fhp;
|
|
|
|
{
|
|
|
|
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_fdesc_setup, "sysctl vfs.fdesc 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
|
|
|
|
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, "fdesc",
|
|
|
|
SYSCTL_DESCR("File-descriptor 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, 7, CTL_EOL);
|
|
|
|
/*
|
|
|
|
* XXX the "7" above could be dynamic, thereby eliminating one
|
|
|
|
* more instance of the "number to vfs" mapping problem, but
|
|
|
|
* "7" 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 fdesc_vnodeop_opv_desc;
|
1998-02-18 10:26:57 +03:00
|
|
|
|
2001-01-22 15:17:35 +03:00
|
|
|
const struct vnodeopv_desc * const fdesc_vnodeopv_descs[] = {
|
1998-02-18 10:26:57 +03:00
|
|
|
&fdesc_vnodeop_opv_desc,
|
|
|
|
NULL,
|
|
|
|
};
|
|
|
|
|
1993-03-24 02:56:31 +03:00
|
|
|
struct vfsops fdesc_vfsops = {
|
1994-04-14 08:05:45 +04:00
|
|
|
MOUNT_FDESC,
|
1993-03-24 02:56:31 +03:00
|
|
|
fdesc_mount,
|
|
|
|
fdesc_start,
|
|
|
|
fdesc_unmount,
|
|
|
|
fdesc_root,
|
|
|
|
fdesc_quotactl,
|
2004-04-21 05:05:31 +04:00
|
|
|
fdesc_statvfs,
|
1993-03-24 02:56:31 +03:00
|
|
|
fdesc_sync,
|
1994-06-08 15:33:09 +04:00
|
|
|
fdesc_vget,
|
1993-03-24 02:56:31 +03:00
|
|
|
fdesc_fhtovp,
|
|
|
|
fdesc_vptofh,
|
|
|
|
fdesc_init,
|
2001-09-15 20:12:54 +04:00
|
|
|
NULL,
|
2000-03-16 21:08:17 +03:00
|
|
|
fdesc_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:26:57 +03:00
|
|
|
NULL, /* vfs_mountroot */
|
1999-02-27 02:44:43 +03:00
|
|
|
fdesc_checkexp,
|
2004-05-25 18:54:55 +04:00
|
|
|
(int (*)(struct mount *, struct vnode *, struct timespec *)) eopnotsupp,
|
2005-01-02 19:08:28 +03:00
|
|
|
vfs_stdextattrctl,
|
1998-02-18 10:26:57 +03:00
|
|
|
fdesc_vnodeopv_descs,
|
1993-03-24 02:56:31 +03:00
|
|
|
};
|