1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1989, 1993
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
*
|
|
|
|
* This code is derived from software contributed
|
|
|
|
* to Berkeley by John Heidemann of the UCLA Ficus project.
|
|
|
|
*
|
|
|
|
* Source: * @(#)i405_init.c 2.10 92/04/27 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.
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
* @(#)vfs_init.c 8.3 (Berkeley) 1/4/94
|
1998-11-04 03:18:10 +00:00
|
|
|
* $Id: vfs_init.c,v 1.37 1998/10/25 17:44:52 phk Exp $
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
#include <sys/param.h>
|
1994-08-18 22:36:09 +00:00
|
|
|
#include <sys/systm.h>
|
1994-09-21 03:47:43 +00:00
|
|
|
#include <sys/kernel.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <sys/mount.h>
|
1998-09-05 17:13:28 +00:00
|
|
|
#include <sys/sysctl.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <sys/vnode.h>
|
|
|
|
#include <sys/malloc.h>
|
1997-09-21 04:24:27 +00:00
|
|
|
#include <vm/vm_zone.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
|
1995-12-17 21:23:44 +00:00
|
|
|
static void vfs_op_init __P((void));
|
1995-12-02 18:58:56 +00:00
|
|
|
|
1995-09-09 18:10:37 +00:00
|
|
|
static void vfsinit __P((void *));
|
1995-08-28 09:19:25 +00:00
|
|
|
SYSINIT(vfs, SI_SUB_VFS, SI_ORDER_FIRST, vfsinit, NULL)
|
|
|
|
|
1997-10-12 20:26:33 +00:00
|
|
|
MALLOC_DEFINE(M_VNODE, "vnodes", "Dynamically allocated vnodes");
|
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* Sigh, such primitive tools are these...
|
|
|
|
*/
|
|
|
|
#if 0
|
|
|
|
#define DODEBUG(A) A
|
|
|
|
#else
|
|
|
|
#define DODEBUG(A)
|
|
|
|
#endif
|
|
|
|
|
|
|
|
extern struct vnodeop_desc *vfs_op_descs[];
|
|
|
|
/* and the operations they perform */
|
|
|
|
|
1998-10-16 03:55:01 +00:00
|
|
|
/*
|
|
|
|
* XXX this bloat just exands the sysctl__vfs linker set a little so that
|
|
|
|
* we can attach sysctls for VFS modules without expanding the linker set.
|
|
|
|
* Currently (1998/09/06), only one VFS uses sysctls, so 2 extra linker
|
|
|
|
* set slots are more than sufficient.
|
|
|
|
*/
|
|
|
|
extern struct linker_set sysctl__vfs;
|
|
|
|
static int mod_xx;
|
|
|
|
SYSCTL_INT(_vfs, OID_AUTO, mod0, CTLFLAG_RD, &mod_xx, 0, "");
|
|
|
|
SYSCTL_INT(_vfs, OID_AUTO, mod1, CTLFLAG_RD, &mod_xx, 0, "");
|
|
|
|
|
1997-09-21 04:24:27 +00:00
|
|
|
/*
|
|
|
|
* Zone for namei
|
|
|
|
*/
|
|
|
|
struct vm_zone *namei_zone;
|
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* vfs_init.c
|
|
|
|
*
|
|
|
|
* Allocate and fill in operations vectors.
|
|
|
|
*
|
|
|
|
* An undocumented feature of this approach to defining operations is that
|
|
|
|
* there can be multiple entries in vfs_opv_descs for the same operations
|
|
|
|
* vector. This allows third parties to extend the set of operations
|
|
|
|
* supported by another layer in a binary compatibile way. For example,
|
|
|
|
* assume that NFS needed to be modified to support Ficus. NFS has an entry
|
|
|
|
* (probably nfs_vnopdeop_decls) declaring all the operations NFS supports by
|
|
|
|
* default. Ficus could add another entry (ficus_nfs_vnodeop_decl_entensions)
|
|
|
|
* listing those new operations Ficus adds to NFS, all without modifying the
|
|
|
|
* NFS code. (Of couse, the OTW NFS protocol still needs to be munged, but
|
|
|
|
* that is a(whole)nother story.) This is a feature.
|
1997-09-10 20:11:02 +00:00
|
|
|
*
|
|
|
|
* Without an explicit reserve area, however, you must replace vnode_if.c
|
|
|
|
* and vnode_if.h when you do this, or you will be derefrencing of the
|
|
|
|
* end of vfs_op_descs[]. This is a flaw in the use of a structure
|
|
|
|
* pointer array rather than an agregate to define vfs_op_descs. So
|
|
|
|
* it's not a very dynamic "feature".
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
|
|
|
void
|
1998-10-16 03:55:01 +00:00
|
|
|
vfs_opv_init(struct vnodeopv_desc *opv)
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
1998-11-04 03:18:10 +00:00
|
|
|
int j;
|
1995-11-09 08:17:23 +00:00
|
|
|
vop_t ***opv_desc_vector_p;
|
|
|
|
vop_t **opv_desc_vector;
|
1994-05-24 10:09:53 +00:00
|
|
|
struct vnodeopv_entry_desc *opve_descp;
|
1998-11-04 03:18:10 +00:00
|
|
|
int default_vector;
|
1994-05-24 10:09:53 +00:00
|
|
|
|
1998-11-04 03:18:10 +00:00
|
|
|
default_vector = VOFFSET(vop_default);
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* Allocate the dynamic vectors and fill them in.
|
|
|
|
*/
|
1998-10-16 03:55:01 +00:00
|
|
|
opv_desc_vector_p = opv->opv_desc_vector_p;
|
|
|
|
/*
|
|
|
|
* Allocate and init the vector, if it needs it.
|
|
|
|
* Also handle backwards compatibility.
|
|
|
|
*/
|
|
|
|
if (*opv_desc_vector_p == NULL) {
|
|
|
|
/* XXX - shouldn't be M_VNODE */
|
|
|
|
MALLOC(*opv_desc_vector_p, vop_t **,
|
1998-11-04 03:18:10 +00:00
|
|
|
vfs_opv_numops * sizeof(vop_t *), M_VNODE, M_WAITOK);
|
1998-10-16 03:55:01 +00:00
|
|
|
bzero(*opv_desc_vector_p,
|
|
|
|
vfs_opv_numops * sizeof(vop_t *));
|
|
|
|
DODEBUG(printf("vector at %x allocated\n",
|
|
|
|
opv_desc_vector_p));
|
|
|
|
}
|
|
|
|
opv_desc_vector = *opv_desc_vector_p;
|
|
|
|
for (j = 0; opv->opv_desc_ops[j].opve_op; j++) {
|
|
|
|
opve_descp = &(opv->opv_desc_ops[j]);
|
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
1998-10-16 03:55:01 +00:00
|
|
|
* Sanity check: is this operation listed
|
|
|
|
* in the list of operations? We check this
|
|
|
|
* by seeing if its offest is zero. Since
|
|
|
|
* the default routine should always be listed
|
|
|
|
* first, it should be the only one with a zero
|
|
|
|
* offset. Any other operation with a zero
|
|
|
|
* offset is probably not listed in
|
|
|
|
* vfs_op_descs, and so is probably an error.
|
|
|
|
*
|
|
|
|
* A panic here means the layer programmer
|
|
|
|
* has committed the all-too common bug
|
|
|
|
* of adding a new operation to the layer's
|
|
|
|
* list of vnode operations but
|
|
|
|
* not adding the operation to the system-wide
|
|
|
|
* list of supported operations.
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
1998-10-16 03:55:01 +00:00
|
|
|
if (opve_descp->opve_op->vdesc_offset == 0 &&
|
1998-11-04 03:18:10 +00:00
|
|
|
opve_descp->opve_op->vdesc_offset != default_vector) {
|
|
|
|
printf("operation %s not listed in vfs_op_descs[].\n",
|
|
|
|
opve_descp->opve_op->vdesc_name);
|
1998-10-16 03:55:01 +00:00
|
|
|
panic ("vfs_opv_init: bad operation");
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
1998-10-16 03:55:01 +00:00
|
|
|
/*
|
|
|
|
* Fill in this entry.
|
|
|
|
*/
|
|
|
|
opv_desc_vector[opve_descp->opve_op->vdesc_offset] =
|
|
|
|
opve_descp->opve_impl;
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
/*
|
1998-11-04 03:18:10 +00:00
|
|
|
* Finally, go back and replace unfilled routines with their default.
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
1998-10-16 03:55:01 +00:00
|
|
|
opv_desc_vector = *(opv->opv_desc_vector_p);
|
1998-11-04 03:18:10 +00:00
|
|
|
if (opv_desc_vector[default_vector] == NULL)
|
|
|
|
panic("vfs_opv_init: operation vector without a default.");
|
|
|
|
for (j = 0; j < vfs_opv_numops; j++)
|
|
|
|
if (opv_desc_vector[j] == NULL)
|
|
|
|
opv_desc_vector[j] = opv_desc_vector[default_vector];
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Initialize known vnode operations vectors.
|
|
|
|
*/
|
1995-12-17 21:23:44 +00:00
|
|
|
static void
|
1994-05-24 10:09:53 +00:00
|
|
|
vfs_op_init()
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
DODEBUG(printf("Vnode_interface_init.\n"));
|
1997-09-10 20:11:02 +00:00
|
|
|
DODEBUG(printf ("vfs_opv_numops=%d\n", vfs_opv_numops));
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
1997-09-10 20:11:02 +00:00
|
|
|
* assign each op to its offset
|
|
|
|
*
|
|
|
|
* XXX This should not be needed, but is because the per
|
|
|
|
* XXX FS ops tables are not sorted according to the
|
|
|
|
* XXX vnodeop_desc's offset in vfs_op_descs. This
|
|
|
|
* XXX is the same reason we have to take the hit for
|
|
|
|
* XXX the static inline function calls instead of using
|
|
|
|
* XXX simple macro references.
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
1997-09-10 20:11:02 +00:00
|
|
|
for (i = 0; i < vfs_opv_numops; i++)
|
|
|
|
vfs_op_descs[i]->vdesc_offset = i;
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Routines having to do with the management of the vnode table.
|
|
|
|
*/
|
|
|
|
extern struct vnodeops dead_vnodeops;
|
|
|
|
extern struct vnodeops spec_vnodeops;
|
|
|
|
struct vattr va_null;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Initialize the vnode structures and initialize each file system type.
|
|
|
|
*/
|
1995-08-28 09:19:25 +00:00
|
|
|
/* ARGSUSED*/
|
|
|
|
static void
|
1995-12-02 17:11:20 +00:00
|
|
|
vfsinit(dummy)
|
|
|
|
void *dummy;
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
1995-05-30 08:16:23 +00:00
|
|
|
|
1997-09-21 04:24:27 +00:00
|
|
|
namei_zone = zinit("NAMEI", MAXPATHLEN, 0, 0, 2);
|
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* Initialize the vnode table
|
|
|
|
*/
|
|
|
|
vntblinit();
|
|
|
|
/*
|
|
|
|
* Initialize the vnode name cache
|
|
|
|
*/
|
|
|
|
nchinit();
|
|
|
|
/*
|
|
|
|
* Build vnode operation vectors.
|
|
|
|
*/
|
|
|
|
vfs_op_init();
|
|
|
|
/*
|
|
|
|
* Initialize each file system type.
|
1998-10-05 11:10:55 +00:00
|
|
|
* Vfs type numbers must be distinct from VFS_GENERIC (and VFS_VFSCONF).
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
|
|
|
vattr_null(&va_null);
|
1998-10-16 03:55:01 +00:00
|
|
|
maxvfsconf = VFS_GENERIC + 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
vfs_register(vfc)
|
|
|
|
struct vfsconf *vfc;
|
|
|
|
{
|
|
|
|
struct linker_set *l;
|
|
|
|
struct sysctl_oid **oidpp;
|
|
|
|
struct vfsconf *vfsp;
|
1998-10-25 17:44:59 +00:00
|
|
|
int i, exists;
|
1998-10-16 03:55:01 +00:00
|
|
|
|
|
|
|
vfsp = NULL;
|
|
|
|
l = &sysctl__vfs;
|
|
|
|
if (vfsconf)
|
|
|
|
for (vfsp = vfsconf; vfsp->vfc_next; vfsp = vfsp->vfc_next)
|
|
|
|
if (!strcmp(vfc->vfc_name, vfsp->vfc_name))
|
|
|
|
return EEXIST;
|
|
|
|
|
|
|
|
vfc->vfc_typenum = maxvfsconf++;
|
|
|
|
if (vfc->vfc_vfsops->vfs_oid != NULL) {
|
1998-10-25 10:52:34 +00:00
|
|
|
/*
|
|
|
|
* Attach the oid to the "vfs" node of the sysctl tree if
|
|
|
|
* it isn't already there (it will be there for statically
|
|
|
|
* configured vfs's).
|
|
|
|
*/
|
|
|
|
exists = 0;
|
|
|
|
for (i = l->ls_length,
|
|
|
|
oidpp = (struct sysctl_oid **)l->ls_items;
|
|
|
|
i-- != 0; oidpp++)
|
|
|
|
if (*oidpp == vfc->vfc_vfsops->vfs_oid) {
|
1998-10-16 03:55:01 +00:00
|
|
|
exists = 1;
|
|
|
|
break;
|
|
|
|
}
|
1998-10-25 10:52:34 +00:00
|
|
|
if (exists == 0)
|
|
|
|
for (i = l->ls_length,
|
|
|
|
oidpp = (struct sysctl_oid **)l->ls_items;
|
|
|
|
i-- != 0; oidpp++) {
|
|
|
|
if (*oidpp == NULL ||
|
|
|
|
*oidpp == &sysctl___vfs_mod0 ||
|
|
|
|
*oidpp == &sysctl___vfs_mod1) {
|
|
|
|
*oidpp = vfc->vfc_vfsops->vfs_oid;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
vfc->vfc_vfsops->vfs_oid->oid_number = vfc->vfc_typenum;
|
|
|
|
sysctl_order_all();
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
1998-10-16 03:55:01 +00:00
|
|
|
if (vfsp)
|
|
|
|
vfsp->vfc_next = vfc;
|
|
|
|
else
|
|
|
|
vfsconf = vfc;
|
|
|
|
vfc->vfc_next = NULL;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Call init function for this VFS...
|
|
|
|
*/
|
|
|
|
(*(vfc->vfc_vfsops->vfs_init))(vfc);
|
|
|
|
|
|
|
|
return 0;
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
1994-09-21 03:47:43 +00:00
|
|
|
|
1998-10-16 03:55:01 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* To be called at SI_SUB_VFS, SECOND, for each VFS before any are registered.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
vfs_mod_opv_init(handle)
|
|
|
|
void *handle;
|
|
|
|
{
|
|
|
|
struct vnodeopv_desc *opv;
|
|
|
|
|
|
|
|
opv = (struct vnodeopv_desc *)handle;
|
|
|
|
*(opv->opv_desc_vector_p) = NULL;
|
1998-11-04 03:18:10 +00:00
|
|
|
|
|
|
|
/* XXX there is a memory leak on unload here */
|
1998-10-16 03:55:01 +00:00
|
|
|
vfs_opv_init(opv);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
vfs_unregister(vfc)
|
|
|
|
struct vfsconf *vfc;
|
|
|
|
{
|
|
|
|
struct linker_set *l;
|
|
|
|
struct sysctl_oid **oidpp;
|
|
|
|
struct vfsconf *vfsp, *prev_vfsp;
|
|
|
|
int error, i, maxtypenum;
|
|
|
|
|
|
|
|
i = vfc->vfc_typenum;
|
|
|
|
|
|
|
|
prev_vfsp = NULL;
|
|
|
|
for (vfsp = vfsconf; vfsp;
|
|
|
|
prev_vfsp = vfsp, vfsp = vfsp->vfc_next) {
|
|
|
|
if (!strcmp(vfc->vfc_name, vfsp->vfc_name))
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (vfsp == NULL)
|
|
|
|
return EINVAL;
|
|
|
|
if (vfsp->vfc_refcount)
|
|
|
|
return EBUSY;
|
|
|
|
if (vfc->vfc_vfsops->vfs_uninit != NULL) {
|
|
|
|
error = (*vfc->vfc_vfsops->vfs_uninit)(vfsp);
|
|
|
|
if (error)
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
if (prev_vfsp)
|
|
|
|
prev_vfsp->vfc_next = vfsp->vfc_next;
|
|
|
|
else
|
|
|
|
vfsconf = vfsp->vfc_next;
|
|
|
|
if (vfsp->vfc_vfsops->vfs_oid != NULL) {
|
|
|
|
l = &sysctl__vfs;
|
|
|
|
for (i = l->ls_length,
|
|
|
|
oidpp = (struct sysctl_oid **)l->ls_items;
|
|
|
|
i--; oidpp++) {
|
|
|
|
if (*oidpp == vfsp->vfc_vfsops->vfs_oid) {
|
|
|
|
*oidpp = NULL;
|
|
|
|
sysctl_order_all();
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
maxtypenum = VFS_GENERIC;
|
|
|
|
for (vfsp = vfsconf; vfsp != NULL; vfsp = vfsp->vfc_next)
|
|
|
|
if (maxtypenum < vfsp->vfc_typenum)
|
|
|
|
maxtypenum = vfsp->vfc_typenum;
|
|
|
|
maxvfsconf = maxtypenum + 1;
|
|
|
|
return 0;
|
|
|
|
}
|