nfs_node.c revision 1.57
1 /* $NetBSD: nfs_node.c,v 1.57 2003/02/01 06:23:49 thorpej Exp $ */ 2 3 /* 4 * Copyright (c) 1989, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * This code is derived from software contributed to Berkeley by 8 * Rick Macklem at The University of Guelph. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the University of 21 * California, Berkeley and its contributors. 22 * 4. Neither the name of the University nor the names of its contributors 23 * may be used to endorse or promote products derived from this software 24 * without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 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 * @(#)nfs_node.c 8.6 (Berkeley) 5/22/95 39 */ 40 41 #include <sys/cdefs.h> 42 __KERNEL_RCSID(0, "$NetBSD: nfs_node.c,v 1.57 2003/02/01 06:23:49 thorpej Exp $"); 43 44 #include "opt_nfs.h" 45 46 #include <sys/param.h> 47 #include <sys/systm.h> 48 #include <sys/proc.h> 49 #include <sys/mount.h> 50 #include <sys/namei.h> 51 #include <sys/vnode.h> 52 #include <sys/kernel.h> 53 #include <sys/malloc.h> 54 #include <sys/pool.h> 55 #include <sys/lock.h> 56 #include <sys/hash.h> 57 58 #include <nfs/rpcv2.h> 59 #include <nfs/nfsproto.h> 60 #include <nfs/nfs.h> 61 #include <nfs/nfsnode.h> 62 #include <nfs/nfsmount.h> 63 #include <nfs/nqnfs.h> 64 #include <nfs/nfs_var.h> 65 66 struct nfsnodehashhead *nfsnodehashtbl; 67 u_long nfsnodehash; 68 struct lock nfs_hashlock; 69 70 struct pool nfs_node_pool; /* memory pool for nfs nodes */ 71 struct pool nfs_vattr_pool; /* memory pool for nfs vattrs */ 72 73 MALLOC_DEFINE(M_NFSBIGFH, "NFS bigfh", "NFS big filehandle"); 74 MALLOC_DEFINE(M_NFSDIROFF, "NFS diroff", "NFS directory cookies"); 75 MALLOC_DEFINE(M_NFSNODE, "NFS node", "NFS vnode private part"); 76 77 extern int prtactive; 78 79 #define TRUE 1 80 #define FALSE 0 81 82 #define nfs_hash(x,y) hash32_buf((x), (y), HASH32_BUF_INIT) 83 84 void nfs_gop_size(struct vnode *, off_t, off_t *); 85 int nfs_gop_alloc(struct vnode *, off_t, off_t, int, struct ucred *); 86 int nfs_gop_write(struct vnode *, struct vm_page **, int, int); 87 88 struct genfs_ops nfs_genfsops = { 89 nfs_gop_size, 90 nfs_gop_alloc, 91 nfs_gop_write, 92 }; 93 94 /* 95 * Initialize hash links for nfsnodes 96 * and build nfsnode free list. 97 */ 98 void 99 nfs_nhinit() 100 { 101 102 nfsnodehashtbl = hashinit(desiredvnodes, HASH_LIST, M_NFSNODE, 103 M_WAITOK, &nfsnodehash); 104 lockinit(&nfs_hashlock, PINOD, "nfs_hashlock", 0, 0); 105 106 pool_init(&nfs_node_pool, sizeof(struct nfsnode), 0, 0, 0, "nfsnodepl", 107 &pool_allocator_nointr); 108 pool_init(&nfs_vattr_pool, sizeof(struct vattr), 0, 0, 0, "nfsvapl", 109 &pool_allocator_nointr); 110 } 111 112 /* 113 * Reinitialize inode hash table. 114 */ 115 116 void 117 nfs_nhreinit() 118 { 119 struct nfsnode *np; 120 struct nfsnodehashhead *oldhash, *hash; 121 u_long oldmask, mask, val; 122 int i; 123 124 hash = hashinit(desiredvnodes, HASH_LIST, M_NFSNODE, M_WAITOK, 125 &mask); 126 127 lockmgr(&nfs_hashlock, LK_EXCLUSIVE, NULL); 128 oldhash = nfsnodehashtbl; 129 oldmask = nfsnodehash; 130 nfsnodehashtbl = hash; 131 nfsnodehash = mask; 132 for (i = 0; i <= oldmask; i++) { 133 while ((np = LIST_FIRST(&oldhash[i])) != NULL) { 134 LIST_REMOVE(np, n_hash); 135 val = NFSNOHASH(nfs_hash(np->n_fhp, np->n_fhsize)); 136 LIST_INSERT_HEAD(&hash[val], np, n_hash); 137 } 138 } 139 lockmgr(&nfs_hashlock, LK_RELEASE, NULL); 140 hashdone(oldhash, M_NFSNODE); 141 } 142 143 /* 144 * Free resources previoslu allocated in nfs_nhinit(). 145 */ 146 void 147 nfs_nhdone() 148 { 149 hashdone(nfsnodehashtbl, M_NFSNODE); 150 pool_destroy(&nfs_node_pool); 151 pool_destroy(&nfs_vattr_pool); 152 } 153 154 /* 155 * Look up a vnode/nfsnode by file handle. 156 * Callers must check for mount points!! 157 * In all cases, a pointer to a 158 * nfsnode structure is returned. 159 */ 160 int 161 nfs_nget(mntp, fhp, fhsize, npp) 162 struct mount *mntp; 163 nfsfh_t *fhp; 164 int fhsize; 165 struct nfsnode **npp; 166 { 167 struct nfsnode *np; 168 struct nfsnodehashhead *nhpp; 169 struct vnode *vp; 170 struct vnode *nvp; 171 int error; 172 173 nhpp = &nfsnodehashtbl[NFSNOHASH(nfs_hash(fhp, fhsize))]; 174 loop: 175 LIST_FOREACH(np, nhpp, n_hash) { 176 if (mntp != NFSTOV(np)->v_mount || np->n_fhsize != fhsize || 177 memcmp(fhp, np->n_fhp, fhsize)) 178 continue; 179 vp = NFSTOV(np); 180 if (vget(vp, LK_EXCLUSIVE)) 181 goto loop; 182 *npp = np; 183 return(0); 184 } 185 if (lockmgr(&nfs_hashlock, LK_EXCLUSIVE|LK_SLEEPFAIL, 0)) 186 goto loop; 187 error = getnewvnode(VT_NFS, mntp, nfsv2_vnodeop_p, &nvp); 188 if (error) { 189 *npp = 0; 190 lockmgr(&nfs_hashlock, LK_RELEASE, 0); 191 return (error); 192 } 193 vp = nvp; 194 np = pool_get(&nfs_node_pool, PR_WAITOK); 195 memset(np, 0, sizeof *np); 196 lockinit(&np->n_commitlock, PINOD, "nfsclock", 0, 0); 197 vp->v_data = np; 198 np->n_vnode = vp; 199 genfs_node_init(vp, &nfs_genfsops); 200 201 /* 202 * Insert the nfsnode in the hash queue for its new file handle 203 */ 204 205 LIST_INSERT_HEAD(nhpp, np, n_hash); 206 if (fhsize > NFS_SMALLFH) { 207 np->n_fhp = malloc(fhsize, M_NFSBIGFH, M_WAITOK); 208 } else 209 np->n_fhp = &np->n_fh; 210 memcpy(np->n_fhp, fhp, fhsize); 211 np->n_fhsize = fhsize; 212 np->n_accstamp = -1; 213 np->n_vattr = pool_get(&nfs_vattr_pool, PR_WAITOK); 214 lockmgr(&vp->v_lock, LK_EXCLUSIVE, NULL); 215 lockmgr(&nfs_hashlock, LK_RELEASE, NULL); 216 error = VOP_GETATTR(vp, np->n_vattr, curproc->p_ucred, curproc); 217 if (error) { 218 vput(vp); 219 return error; 220 } 221 uvm_vnp_setsize(vp, np->n_vattr->va_size); 222 *npp = np; 223 return (0); 224 } 225 226 int 227 nfs_inactive(v) 228 void *v; 229 { 230 struct vop_inactive_args /* { 231 struct vnode *a_vp; 232 struct proc *a_p; 233 } */ *ap = v; 234 struct nfsnode *np; 235 struct sillyrename *sp; 236 struct proc *p = ap->a_p; 237 struct vnode *vp = ap->a_vp; 238 239 np = VTONFS(vp); 240 if (prtactive && vp->v_usecount != 0) 241 vprint("nfs_inactive: pushing active", vp); 242 if (vp->v_type != VDIR) { 243 sp = np->n_sillyrename; 244 np->n_sillyrename = (struct sillyrename *)0; 245 } else 246 sp = NULL; 247 if (sp != NULL) 248 nfs_vinvalbuf(vp, 0, sp->s_cred, p, 1); 249 np->n_flag &= (NMODIFIED | NFLUSHINPROG | NFLUSHWANT | NQNFSEVICTED | 250 NQNFSNONCACHE | NQNFSWRITE); 251 VOP_UNLOCK(vp, 0); 252 if (sp != NULL) { 253 254 /* 255 * Remove the silly file that was rename'd earlier 256 */ 257 258 vn_lock(sp->s_dvp, LK_EXCLUSIVE | LK_RETRY); 259 nfs_removeit(sp); 260 crfree(sp->s_cred); 261 vput(sp->s_dvp); 262 FREE(sp, M_NFSREQ); 263 } 264 return (0); 265 } 266 267 /* 268 * Reclaim an nfsnode so that it can be used for other purposes. 269 */ 270 int 271 nfs_reclaim(v) 272 void *v; 273 { 274 struct vop_reclaim_args /* { 275 struct vnode *a_vp; 276 } */ *ap = v; 277 struct vnode *vp = ap->a_vp; 278 struct nfsnode *np = VTONFS(vp); 279 struct nfsmount *nmp = VFSTONFS(vp->v_mount); 280 281 if (prtactive && vp->v_usecount != 0) 282 vprint("nfs_reclaim: pushing active", vp); 283 284 LIST_REMOVE(np, n_hash); 285 286 if ((nmp->nm_flag & NFSMNT_NQNFS) && np->n_timer.cqe_next != 0) { 287 CIRCLEQ_REMOVE(&nmp->nm_timerhead, np, n_timer); 288 } 289 290 /* 291 * Free up any directory cookie structures and 292 * large file handle structures that might be associated with 293 * this nfs node. 294 */ 295 if (vp->v_type == VDIR && np->n_dircache) { 296 nfs_invaldircache(vp, 1); 297 FREE(np->n_dircache, M_NFSDIROFF); 298 } 299 if (np->n_fhsize > NFS_SMALLFH) { 300 free(np->n_fhp, M_NFSBIGFH); 301 } 302 303 pool_put(&nfs_vattr_pool, np->n_vattr); 304 if (np->n_rcred) { 305 crfree(np->n_rcred); 306 } 307 if (np->n_wcred) { 308 crfree(np->n_wcred); 309 } 310 cache_purge(vp); 311 pool_put(&nfs_node_pool, vp->v_data); 312 vp->v_data = NULL; 313 return (0); 314 } 315 316 void 317 nfs_gop_size(struct vnode *vp, off_t size, off_t *eobp) 318 { 319 *eobp = MAX(size, vp->v_size); 320 } 321 322 int 323 nfs_gop_alloc(struct vnode *vp, off_t off, off_t len, int flags, 324 struct ucred *cred) 325 { 326 return 0; 327 } 328 329 int 330 nfs_gop_write(struct vnode *vp, struct vm_page **pgs, int npages, int flags) 331 { 332 int i; 333 334 for (i = 0; i < npages; i++) { 335 pmap_page_protect(pgs[i], VM_PROT_READ); 336 } 337 return genfs_gop_write(vp, pgs, npages, flags); 338 } 339
Indexes created Thu Sep 25 08:09:54 GMT 2025