vfs_init.c (2112) | vfs_init.c (2946) |
---|---|
1/* 2 * Copyright (c) 1989, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This code is derived from software contributed 6 * to Berkeley by John Heidemann of the UCLA Ficus project. 7 * 8 * Source: * @(#)i405_init.c 2.10 92/04/27 UCLA Ficus project --- 22 unchanged lines hidden (view full) --- 31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 36 * SUCH DAMAGE. 37 * 38 * @(#)vfs_init.c 8.3 (Berkeley) 1/4/94 | 1/* 2 * Copyright (c) 1989, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This code is derived from software contributed 6 * to Berkeley by John Heidemann of the UCLA Ficus project. 7 * 8 * Source: * @(#)i405_init.c 2.10 92/04/27 UCLA Ficus project --- 22 unchanged lines hidden (view full) --- 31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 36 * SUCH DAMAGE. 37 * 38 * @(#)vfs_init.c 8.3 (Berkeley) 1/4/94 |
39 * $Id: vfs_init.c,v 1.3 1994/08/02 07:43:22 davidg Exp $ | 39 * $Id: vfs_init.c,v 1.4 1994/08/18 22:35:08 wollman Exp $ |
40 */ 41 42 43#include <sys/param.h> 44#include <sys/systm.h> | 40 */ 41 42 43#include <sys/param.h> 44#include <sys/systm.h> |
45#include <sys/kernel.h> |
|
45#include <sys/mount.h> 46#include <sys/time.h> 47#include <sys/vnode.h> 48#include <sys/stat.h> 49#include <sys/namei.h> 50#include <sys/ucred.h> 51#include <sys/buf.h> 52#include <sys/errno.h> 53#include <sys/malloc.h> | 46#include <sys/mount.h> 47#include <sys/time.h> 48#include <sys/vnode.h> 49#include <sys/stat.h> 50#include <sys/namei.h> 51#include <sys/ucred.h> 52#include <sys/buf.h> 53#include <sys/errno.h> 54#include <sys/malloc.h> |
55#include <sys/proc.h> 56#include <vm/vm.h> 57#include <sys/sysctl.h> |
|
54 55/* 56 * Sigh, such primitive tools are these... 57 */ 58#if 0 59#define DODEBUG(A) A 60#else 61#define DODEBUG(A) 62#endif 63 | 58 59/* 60 * Sigh, such primitive tools are these... 61 */ 62#if 0 63#define DODEBUG(A) A 64#else 65#define DODEBUG(A) 66#endif 67 |
64extern struct vnodeopv_desc *vfs_opv_descs[]; 65 /* a list of lists of vnodeops defns */ | 68struct vfsconf void_vfsconf; 69 70extern struct linker_set vfs_opv_descs_; 71#define vfs_opv_descs ((struct vnodeopv_desc **)vfs_opv_descs_.ls_items) 72 73extern struct linker_set vfs_set; 74struct vfsops *vfssw[MOUNT_MAXTYPE + 1]; 75struct vfsconf *vfsconf[MOUNT_MAXTYPE + 1]; 76 |
66extern struct vnodeop_desc *vfs_op_descs[]; 67 /* and the operations they perform */ 68/* 69 * This code doesn't work if the defn is **vnodop_defns with cc. 70 * The problem is because of the compiler sometimes putting in an 71 * extra level of indirection for arrays. It's an interesting 72 * "feature" of C. 73 */ 74int vfs_opv_numops; 75 | 77extern struct vnodeop_desc *vfs_op_descs[]; 78 /* and the operations they perform */ 79/* 80 * This code doesn't work if the defn is **vnodop_defns with cc. 81 * The problem is because of the compiler sometimes putting in an 82 * extra level of indirection for arrays. It's an interesting 83 * "feature" of C. 84 */ 85int vfs_opv_numops; 86 |
76typedef (*PFI)(); /* the standard Pointer to a Function returning an Int */ | 87typedef int (*PFI)(); /* the standard Pointer to a Function returning an Int */ |
77 78/* 79 * A miscellaneous routine. 80 * A generic "default" routine that just returns an error. 81 */ 82int 83vn_default_error() 84{ --- 13 unchanged lines hidden (view full) --- 98 * assume that NFS needed to be modified to support Ficus. NFS has an entry 99 * (probably nfs_vnopdeop_decls) declaring all the operations NFS supports by 100 * default. Ficus could add another entry (ficus_nfs_vnodeop_decl_entensions) 101 * listing those new operations Ficus adds to NFS, all without modifying the 102 * NFS code. (Of couse, the OTW NFS protocol still needs to be munged, but 103 * that is a(whole)nother story.) This is a feature. 104 */ 105void | 88 89/* 90 * A miscellaneous routine. 91 * A generic "default" routine that just returns an error. 92 */ 93int 94vn_default_error() 95{ --- 13 unchanged lines hidden (view full) --- 109 * assume that NFS needed to be modified to support Ficus. NFS has an entry 110 * (probably nfs_vnopdeop_decls) declaring all the operations NFS supports by 111 * default. Ficus could add another entry (ficus_nfs_vnodeop_decl_entensions) 112 * listing those new operations Ficus adds to NFS, all without modifying the 113 * NFS code. (Of couse, the OTW NFS protocol still needs to be munged, but 114 * that is a(whole)nother story.) This is a feature. 115 */ 116void |
106vfs_opv_init() | 117vfs_opv_init(struct vnodeopv_desc **them) |
107{ 108 int i, j, k; 109 int (***opv_desc_vector_p)(); 110 int (**opv_desc_vector)(); 111 struct vnodeopv_entry_desc *opve_descp; 112 113 /* 114 * Allocate the dynamic vectors and fill them in. 115 */ | 118{ 119 int i, j, k; 120 int (***opv_desc_vector_p)(); 121 int (**opv_desc_vector)(); 122 struct vnodeopv_entry_desc *opve_descp; 123 124 /* 125 * Allocate the dynamic vectors and fill them in. 126 */ |
116 for (i=0; vfs_opv_descs[i]; i++) { 117 opv_desc_vector_p = vfs_opv_descs[i]->opv_desc_vector_p; | 127 for (i=0; them[i]; i++) { 128 opv_desc_vector_p = them[i]->opv_desc_vector_p; |
118 /* 119 * Allocate and init the vector, if it needs it. 120 * Also handle backwards compatibility. 121 */ 122 if (*opv_desc_vector_p == NULL) { 123 /* XXX - shouldn't be M_VNODE */ 124 MALLOC(*opv_desc_vector_p, PFI*, 125 vfs_opv_numops*sizeof(PFI), M_VNODE, M_WAITOK); 126 bzero (*opv_desc_vector_p, vfs_opv_numops*sizeof(PFI)); 127 DODEBUG(printf("vector at %x allocated\n", 128 opv_desc_vector_p)); 129 } 130 opv_desc_vector = *opv_desc_vector_p; | 129 /* 130 * Allocate and init the vector, if it needs it. 131 * Also handle backwards compatibility. 132 */ 133 if (*opv_desc_vector_p == NULL) { 134 /* XXX - shouldn't be M_VNODE */ 135 MALLOC(*opv_desc_vector_p, PFI*, 136 vfs_opv_numops*sizeof(PFI), M_VNODE, M_WAITOK); 137 bzero (*opv_desc_vector_p, vfs_opv_numops*sizeof(PFI)); 138 DODEBUG(printf("vector at %x allocated\n", 139 opv_desc_vector_p)); 140 } 141 opv_desc_vector = *opv_desc_vector_p; |
131 for (j=0; vfs_opv_descs[i]->opv_desc_ops[j].opve_op; j++) { 132 opve_descp = &(vfs_opv_descs[i]->opv_desc_ops[j]); | 142 for (j=0; them[i]->opv_desc_ops[j].opve_op; j++) { 143 opve_descp = &(them[i]->opv_desc_ops[j]); |
133 134 /* 135 * Sanity check: is this operation listed 136 * in the list of operations? We check this 137 * by seeing if its offest is zero. Since 138 * the default routine should always be listed 139 * first, it should be the only one with a zero 140 * offset. Any other operation with a zero --- 22 unchanged lines hidden (view full) --- 163 opve_descp->opve_impl; 164 } 165 } 166 /* 167 * Finally, go back and replace unfilled routines 168 * with their default. (Sigh, an O(n^3) algorithm. I 169 * could make it better, but that'd be work, and n is small.) 170 */ | 144 145 /* 146 * Sanity check: is this operation listed 147 * in the list of operations? We check this 148 * by seeing if its offest is zero. Since 149 * the default routine should always be listed 150 * first, it should be the only one with a zero 151 * offset. Any other operation with a zero --- 22 unchanged lines hidden (view full) --- 174 opve_descp->opve_impl; 175 } 176 } 177 /* 178 * Finally, go back and replace unfilled routines 179 * with their default. (Sigh, an O(n^3) algorithm. I 180 * could make it better, but that'd be work, and n is small.) 181 */ |
171 for (i = 0; vfs_opv_descs[i]; i++) { 172 opv_desc_vector = *(vfs_opv_descs[i]->opv_desc_vector_p); | 182 for (i = 0; them[i]; i++) { 183 opv_desc_vector = *(them[i]->opv_desc_vector_p); |
173 /* 174 * Force every operations vector to have a default routine. 175 */ 176 if (opv_desc_vector[VOFFSET(vop_default)]==NULL) { 177 panic("vfs_opv_init: operation vector without default routine."); 178 } 179 for (k = 0; k<vfs_opv_numops; k++) 180 if (opv_desc_vector[k] == NULL) --- 37 unchanged lines hidden (view full) --- 218 219/* 220 * Initialize the vnode structures and initialize each file system type. 221 */ 222void 223vfsinit() 224{ 225 struct vfsops **vfsp; | 184 /* 185 * Force every operations vector to have a default routine. 186 */ 187 if (opv_desc_vector[VOFFSET(vop_default)]==NULL) { 188 panic("vfs_opv_init: operation vector without default routine."); 189 } 190 for (k = 0; k<vfs_opv_numops; k++) 191 if (opv_desc_vector[k] == NULL) --- 37 unchanged lines hidden (view full) --- 229 230/* 231 * Initialize the vnode structures and initialize each file system type. 232 */ 233void 234vfsinit() 235{ 236 struct vfsops **vfsp; |
237 struct vfsconf **vfc; 238 int i; |
|
226 227 /* | 239 240 /* |
241 * Initialize the VFS switch table 242 */ 243 for(i = 0; i < MOUNT_MAXTYPE + 1; i++) { 244 vfsconf[i] = &void_vfsconf; 245 } 246 247 vfc = (struct vfsconf **)vfs_set.ls_items; 248 while(*vfc) { 249 vfssw[(**vfc).vfc_index] = (**vfc).vfc_vfsops; 250 vfsconf[(**vfc).vfc_index] = *vfc; 251 vfc++; 252 } 253 254 /* |
|
228 * Initialize the vnode table 229 */ 230 vntblinit(); 231 /* 232 * Initialize the vnode name cache 233 */ 234 nchinit(); 235 /* 236 * Build vnode operation vectors. 237 */ 238 vfs_op_init(); | 255 * Initialize the vnode table 256 */ 257 vntblinit(); 258 /* 259 * Initialize the vnode name cache 260 */ 261 nchinit(); 262 /* 263 * Build vnode operation vectors. 264 */ 265 vfs_op_init(); |
239 vfs_opv_init(); /* finish the job */ | 266 vfs_opv_init(vfs_opv_descs); /* finish the job */ |
240 /* 241 * Initialize each file system type. 242 */ 243 vattr_null(&va_null); 244 for (vfsp = &vfssw[0]; vfsp <= &vfssw[MOUNT_MAXTYPE]; vfsp++) { 245 if (*vfsp == NULL) 246 continue; 247 (*(*vfsp)->vfs_init)(); 248 } 249} | 267 /* 268 * Initialize each file system type. 269 */ 270 vattr_null(&va_null); 271 for (vfsp = &vfssw[0]; vfsp <= &vfssw[MOUNT_MAXTYPE]; vfsp++) { 272 if (*vfsp == NULL) 273 continue; 274 (*(*vfsp)->vfs_init)(); 275 } 276} |
277 278/* 279 * kernel related system variables. 280 */ 281int 282fs_sysctl(name, namelen, oldp, oldlenp, newp, newlen, p) 283 int *name; 284 u_int namelen; 285 void *oldp; 286 size_t *oldlenp; 287 void *newp; 288 size_t newlen; 289 struct proc *p; 290{ 291 int i; 292 int error; 293 int buflen = *oldlenp; 294 caddr_t where = newp, start = newp; 295 296 switch (name[0]) { 297 case FS_VFSCONF: 298 if (namelen != 1) return ENOTDIR; 299 300 if (oldp == NULL) { 301 *oldlenp = (MOUNT_MAXTYPE+1) * sizeof(struct vfsconf); 302 return 0; 303 } 304 if (newp) { 305 return EINVAL; 306 } 307 308 for(i = 0; i < MOUNT_MAXTYPE + 1; i++) { 309 if(buflen < sizeof *vfsconf[i]) { 310 *oldlenp = where - start; 311 return ENOMEM; 312 } 313 314 if(error = copyout(vfsconf[i], where, 315 sizeof *vfsconf[i])) 316 return error; 317 where += sizeof *vfsconf[i]; 318 buflen -= sizeof *vfsconf[i]; 319 } 320 *oldlenp = where - start; 321 return 0; 322 323 default: 324 return (EOPNOTSUPP); 325 } 326 /* NOTREACHED */ 327} 328 |
|