nfs_node.c revision 1.101.10.1
1 /* $NetBSD: nfs_node.c,v 1.101.10.1 2008/04/27 12:52:49 yamt 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. Neither the name of the University nor the names of its contributors 19 * may be used to endorse or promote products derived from this software 20 * without specific prior written permission. 21 * 22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 32 * SUCH DAMAGE. 33 * 34 * @(#)nfs_node.c 8.6 (Berkeley) 5/22/95 35 */ 36 37 #include <sys/cdefs.h> 38 __KERNEL_RCSID(0, "$NetBSD: nfs_node.c,v 1.101.10.1 2008/04/27 12:52:49 yamt Exp $"); 39 40 #include "opt_nfs.h" 41 42 #include <sys/param.h> 43 #include <sys/systm.h> 44 #include <sys/proc.h> 45 #include <sys/mount.h> 46 #include <sys/namei.h> 47 #include <sys/vnode.h> 48 #include <sys/kernel.h> 49 #include <sys/malloc.h> 50 #include <sys/pool.h> 51 #include <sys/lock.h> 52 #include <sys/hash.h> 53 #include <sys/kauth.h> 54 55 #include <nfs/rpcv2.h> 56 #include <nfs/nfsproto.h> 57 #include <nfs/nfs.h> 58 #include <nfs/nfsnode.h> 59 #include <nfs/nfsmount.h> 60 #include <nfs/nfs_var.h> 61 62 struct nfsnodehashhead *nfsnodehashtbl; 63 u_long nfsnodehash; 64 static kmutex_t nfs_hashlock; 65 66 POOL_INIT(nfs_node_pool, sizeof(struct nfsnode), 0, 0, 0, "nfsnodepl", 67 &pool_allocator_nointr, IPL_NONE); 68 POOL_INIT(nfs_vattr_pool, sizeof(struct vattr), 0, 0, 0, "nfsvapl", 69 &pool_allocator_nointr, IPL_NONE); 70 71 MALLOC_DEFINE(M_NFSNODE, "NFS node", "NFS vnode private part"); 72 73 extern int prtactive; 74 75 #define nfs_hash(x,y) hash32_buf((x), (y), HASH32_BUF_INIT) 76 77 void nfs_gop_size(struct vnode *, off_t, off_t *, int); 78 int nfs_gop_alloc(struct vnode *, off_t, off_t, int, kauth_cred_t); 79 int nfs_gop_write(struct vnode *, struct vm_page **, int, int); 80 81 static const struct genfs_ops nfs_genfsops = { 82 .gop_size = nfs_gop_size, 83 .gop_alloc = nfs_gop_alloc, 84 .gop_write = nfs_gop_write, 85 }; 86 87 /* 88 * Initialize hash links for nfsnodes 89 * and build nfsnode free list. 90 */ 91 void 92 nfs_nhinit() 93 { 94 95 nfsnodehashtbl = hashinit(desiredvnodes, HASH_LIST, M_NFSNODE, 96 M_WAITOK, &nfsnodehash); 97 mutex_init(&nfs_hashlock, MUTEX_DEFAULT, IPL_NONE); 98 } 99 100 /* 101 * Reinitialize inode hash table. 102 */ 103 104 void 105 nfs_nhreinit() 106 { 107 struct nfsnode *np; 108 struct nfsnodehashhead *oldhash, *hash; 109 u_long oldmask, mask, val; 110 int i; 111 112 hash = hashinit(desiredvnodes, HASH_LIST, M_NFSNODE, M_WAITOK, 113 &mask); 114 115 mutex_enter(&nfs_hashlock); 116 oldhash = nfsnodehashtbl; 117 oldmask = nfsnodehash; 118 nfsnodehashtbl = hash; 119 nfsnodehash = mask; 120 for (i = 0; i <= oldmask; i++) { 121 while ((np = LIST_FIRST(&oldhash[i])) != NULL) { 122 LIST_REMOVE(np, n_hash); 123 val = NFSNOHASH(nfs_hash(np->n_fhp, np->n_fhsize)); 124 LIST_INSERT_HEAD(&hash[val], np, n_hash); 125 } 126 } 127 mutex_exit(&nfs_hashlock); 128 hashdone(oldhash, M_NFSNODE); 129 } 130 131 /* 132 * Free resources previoslu allocated in nfs_nhinit(). 133 */ 134 void 135 nfs_nhdone() 136 { 137 hashdone(nfsnodehashtbl, M_NFSNODE); 138 pool_destroy(&nfs_node_pool); 139 pool_destroy(&nfs_vattr_pool); 140 mutex_destroy(&nfs_hashlock); 141 } 142 143 /* 144 * Look up a vnode/nfsnode by file handle. 145 * Callers must check for mount points!! 146 * In all cases, a pointer to a 147 * nfsnode structure is returned. 148 */ 149 int 150 nfs_nget1(mntp, fhp, fhsize, npp, lkflags) 151 struct mount *mntp; 152 nfsfh_t *fhp; 153 int fhsize; 154 struct nfsnode **npp; 155 int lkflags; 156 { 157 struct nfsnode *np, *np2; 158 struct nfsnodehashhead *nhpp; 159 struct vnode *vp; 160 int error; 161 162 nhpp = &nfsnodehashtbl[NFSNOHASH(nfs_hash(fhp, fhsize))]; 163 loop: 164 mutex_enter(&nfs_hashlock); 165 LIST_FOREACH(np, nhpp, n_hash) { 166 if (mntp != NFSTOV(np)->v_mount || np->n_fhsize != fhsize || 167 memcmp(fhp, np->n_fhp, fhsize)) 168 continue; 169 vp = NFSTOV(np); 170 mutex_enter(&vp->v_interlock); 171 mutex_exit(&nfs_hashlock); 172 error = vget(vp, LK_EXCLUSIVE | LK_INTERLOCK | lkflags); 173 if (error == EBUSY) 174 return error; 175 if (error) 176 goto loop; 177 *npp = np; 178 return(0); 179 } 180 mutex_exit(&nfs_hashlock); 181 182 error = getnewvnode(VT_NFS, mntp, nfsv2_vnodeop_p, &vp); 183 if (error) { 184 *npp = 0; 185 return (error); 186 } 187 np = pool_get(&nfs_node_pool, PR_WAITOK); 188 memset(np, 0, sizeof *np); 189 np->n_vnode = vp; 190 191 /* 192 * Insert the nfsnode in the hash queue for its new file handle 193 */ 194 195 if (fhsize > NFS_SMALLFH) { 196 np->n_fhp = kmem_alloc(fhsize, KM_SLEEP); 197 } else 198 np->n_fhp = &np->n_fh; 199 memcpy(np->n_fhp, fhp, fhsize); 200 np->n_fhsize = fhsize; 201 np->n_accstamp = -1; 202 np->n_vattr = pool_get(&nfs_vattr_pool, PR_WAITOK); 203 204 mutex_enter(&nfs_hashlock); 205 LIST_FOREACH(np2, nhpp, n_hash) { 206 if (mntp != NFSTOV(np2)->v_mount || np2->n_fhsize != fhsize || 207 memcmp(fhp, np2->n_fhp, fhsize)) 208 continue; 209 mutex_exit(&nfs_hashlock); 210 if (fhsize > NFS_SMALLFH) { 211 kmem_free(np->n_fhp, fhsize); 212 } 213 pool_put(&nfs_vattr_pool, np->n_vattr); 214 pool_put(&nfs_node_pool, np); 215 ungetnewvnode(vp); 216 goto loop; 217 } 218 mutex_init(&np->n_attrlock, MUTEX_DEFAULT, IPL_NONE); 219 vp->v_data = np; 220 genfs_node_init(vp, &nfs_genfsops); 221 /* 222 * Initalize read/write creds to useful values. VOP_OPEN will 223 * overwrite these. 224 */ 225 np->n_rcred = curlwp->l_cred; 226 kauth_cred_hold(np->n_rcred); 227 np->n_wcred = curlwp->l_cred; 228 kauth_cred_hold(np->n_wcred); 229 vlockmgr(&vp->v_lock, LK_EXCLUSIVE); 230 NFS_INVALIDATE_ATTRCACHE(np); 231 uvm_vnp_setsize(vp, 0); 232 LIST_INSERT_HEAD(nhpp, np, n_hash); 233 mutex_exit(&nfs_hashlock); 234 235 *npp = np; 236 return (0); 237 } 238 239 int 240 nfs_inactive(v) 241 void *v; 242 { 243 struct vop_inactive_args /* { 244 struct vnode *a_vp; 245 bool *a_recycle; 246 } */ *ap = v; 247 struct nfsnode *np; 248 struct sillyrename *sp; 249 struct vnode *vp = ap->a_vp; 250 251 np = VTONFS(vp); 252 if (vp->v_type != VDIR) { 253 sp = np->n_sillyrename; 254 np->n_sillyrename = (struct sillyrename *)0; 255 } else 256 sp = NULL; 257 if (sp != NULL) 258 nfs_vinvalbuf(vp, 0, sp->s_cred, curlwp, 1); 259 *ap->a_recycle = (np->n_flag & NREMOVED) != 0; 260 np->n_flag &= 261 (NMODIFIED | NFLUSHINPROG | NFLUSHWANT | NEOFVALID | NTRUNCDELAYED); 262 263 if (vp->v_type == VDIR && np->n_dircache) 264 nfs_invaldircache(vp, 265 NFS_INVALDIRCACHE_FORCE | NFS_INVALDIRCACHE_KEEPEOF); 266 267 VOP_UNLOCK(vp, 0); 268 269 if (sp != NULL) { 270 int error; 271 272 /* 273 * Remove the silly file that was rename'd earlier 274 * 275 * Just in case our thread also has the parent node locked, 276 * we use LK_CANRECURSE. 277 */ 278 279 error = vn_lock(sp->s_dvp, LK_EXCLUSIVE | LK_CANRECURSE); 280 if (error || sp->s_dvp->v_data == NULL) { 281 /* XXX should recover */ 282 printf("%s: vp=%p error=%d\n", 283 __func__, sp->s_dvp, error); 284 } else { 285 nfs_removeit(sp); 286 } 287 kauth_cred_free(sp->s_cred); 288 vput(sp->s_dvp); 289 kmem_free(sp, sizeof(*sp)); 290 } 291 292 return (0); 293 } 294 295 /* 296 * Reclaim an nfsnode so that it can be used for other purposes. 297 */ 298 int 299 nfs_reclaim(v) 300 void *v; 301 { 302 struct vop_reclaim_args /* { 303 struct vnode *a_vp; 304 } */ *ap = v; 305 struct vnode *vp = ap->a_vp; 306 struct nfsnode *np = VTONFS(vp); 307 308 if (prtactive && vp->v_usecount > 1) 309 vprint("nfs_reclaim: pushing active", vp); 310 311 mutex_enter(&nfs_hashlock); 312 LIST_REMOVE(np, n_hash); 313 mutex_exit(&nfs_hashlock); 314 315 /* 316 * Free up any directory cookie structures and 317 * large file handle structures that might be associated with 318 * this nfs node. 319 */ 320 if (vp->v_type == VDIR && np->n_dircache) 321 hashdone(np->n_dircache, M_NFSDIROFF); 322 KASSERT(np->n_dirgens == NULL); 323 324 if (np->n_fhsize > NFS_SMALLFH) 325 kmem_free(np->n_fhp, np->n_fhsize); 326 327 pool_put(&nfs_vattr_pool, np->n_vattr); 328 if (np->n_rcred) 329 kauth_cred_free(np->n_rcred); 330 331 if (np->n_wcred) 332 kauth_cred_free(np->n_wcred); 333 334 cache_purge(vp); 335 if (vp->v_type == VREG) { 336 mutex_destroy(&np->n_commitlock); 337 } 338 mutex_destroy(&np->n_attrlock); 339 genfs_node_destroy(vp); 340 pool_put(&nfs_node_pool, np); 341 vp->v_data = NULL; 342 return (0); 343 } 344 345 void 346 nfs_gop_size(struct vnode *vp, off_t size, off_t *eobp, int flags) 347 { 348 349 *eobp = MAX(size, vp->v_size); 350 } 351 352 int 353 nfs_gop_alloc(struct vnode *vp, off_t off, off_t len, int flags, 354 kauth_cred_t cred) 355 { 356 357 return 0; 358 } 359 360 int 361 nfs_gop_write(struct vnode *vp, struct vm_page **pgs, int npages, int flags) 362 { 363 int i; 364 365 for (i = 0; i < npages; i++) { 366 pmap_page_protect(pgs[i], VM_PROT_READ); 367 } 368 return genfs_gop_write(vp, pgs, npages, flags); 369 } 370
Indexes created Tue Sep 30 11:09:46 GMT 2025