nfs_node.c revision 1.99
1 /* $NetBSD: nfs_node.c,v 1.99 2008/01/17 10:27:43 ad 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.99 2008/01/17 10:27:43 ad 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 struct lock 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 lockinit(&nfs_hashlock, PINOD, "nfs_hashlock", 0, 0); 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 lockmgr(&nfs_hashlock, LK_EXCLUSIVE, NULL); 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 lockmgr(&nfs_hashlock, LK_RELEASE, NULL); 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 } 141 142 /* 143 * Look up a vnode/nfsnode by file handle. 144 * Callers must check for mount points!! 145 * In all cases, a pointer to a 146 * nfsnode structure is returned. 147 */ 148 int 149 nfs_nget1(mntp, fhp, fhsize, npp, lkflags) 150 struct mount *mntp; 151 nfsfh_t *fhp; 152 int fhsize; 153 struct nfsnode **npp; 154 int lkflags; 155 { 156 struct nfsnode *np; 157 struct nfsnodehashhead *nhpp; 158 struct vnode *vp; 159 int error; 160 161 nhpp = &nfsnodehashtbl[NFSNOHASH(nfs_hash(fhp, fhsize))]; 162 loop: 163 LIST_FOREACH(np, nhpp, n_hash) { 164 if (mntp != NFSTOV(np)->v_mount || np->n_fhsize != fhsize || 165 memcmp(fhp, np->n_fhp, fhsize)) 166 continue; 167 vp = NFSTOV(np); 168 error = vget(vp, LK_EXCLUSIVE | lkflags); 169 if (error == EBUSY) 170 return error; 171 if (error) 172 goto loop; 173 *npp = np; 174 return(0); 175 } 176 if (lockmgr(&nfs_hashlock, LK_EXCLUSIVE|LK_SLEEPFAIL, 0)) 177 goto loop; 178 error = getnewvnode(VT_NFS, mntp, nfsv2_vnodeop_p, &vp); 179 if (error) { 180 *npp = 0; 181 lockmgr(&nfs_hashlock, LK_RELEASE, 0); 182 return (error); 183 } 184 np = pool_get(&nfs_node_pool, PR_WAITOK); 185 memset(np, 0, sizeof *np); 186 vp->v_data = np; 187 np->n_vnode = vp; 188 genfs_node_init(vp, &nfs_genfsops); 189 190 /* 191 * Insert the nfsnode in the hash queue for its new file handle 192 */ 193 194 LIST_INSERT_HEAD(nhpp, np, n_hash); 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 /* 205 * Initalize read/write creds to useful values. VOP_OPEN will 206 * overwrite these. 207 */ 208 np->n_rcred = curlwp->l_cred; 209 kauth_cred_hold(np->n_rcred); 210 np->n_wcred = curlwp->l_cred; 211 kauth_cred_hold(np->n_wcred); 212 lockmgr(&vp->v_lock, LK_EXCLUSIVE, NULL); 213 lockmgr(&nfs_hashlock, LK_RELEASE, NULL); 214 NFS_INVALIDATE_ATTRCACHE(np); 215 uvm_vnp_setsize(vp, 0); 216 *npp = np; 217 return (0); 218 } 219 220 int 221 nfs_inactive(v) 222 void *v; 223 { 224 struct vop_inactive_args /* { 225 struct vnode *a_vp; 226 bool *a_recycle; 227 } */ *ap = v; 228 struct nfsnode *np; 229 struct sillyrename *sp; 230 struct vnode *vp = ap->a_vp; 231 232 np = VTONFS(vp); 233 if (vp->v_type != VDIR) { 234 sp = np->n_sillyrename; 235 np->n_sillyrename = (struct sillyrename *)0; 236 } else 237 sp = NULL; 238 if (sp != NULL) 239 nfs_vinvalbuf(vp, 0, sp->s_cred, curlwp, 1); 240 *ap->a_recycle = (np->n_flag & NREMOVED) != 0; 241 np->n_flag &= 242 (NMODIFIED | NFLUSHINPROG | NFLUSHWANT | NEOFVALID | NTRUNCDELAYED); 243 244 if (vp->v_type == VDIR && np->n_dircache) 245 nfs_invaldircache(vp, 246 NFS_INVALDIRCACHE_FORCE | NFS_INVALDIRCACHE_KEEPEOF); 247 248 VOP_UNLOCK(vp, 0); 249 250 if (sp != NULL) { 251 int error; 252 253 /* 254 * Remove the silly file that was rename'd earlier 255 * 256 * Just in case our thread also has the parent node locked, 257 * we use LK_CANRECURSE. 258 */ 259 260 error = vn_lock(sp->s_dvp, LK_EXCLUSIVE | LK_CANRECURSE); 261 if (error || sp->s_dvp->v_data == NULL) { 262 /* XXX should recover */ 263 printf("%s: vp=%p error=%d\n", 264 __func__, sp->s_dvp, error); 265 } else { 266 nfs_removeit(sp); 267 } 268 kauth_cred_free(sp->s_cred); 269 vput(sp->s_dvp); 270 kmem_free(sp, sizeof(*sp)); 271 } 272 273 return (0); 274 } 275 276 /* 277 * Reclaim an nfsnode so that it can be used for other purposes. 278 */ 279 int 280 nfs_reclaim(v) 281 void *v; 282 { 283 struct vop_reclaim_args /* { 284 struct vnode *a_vp; 285 } */ *ap = v; 286 struct vnode *vp = ap->a_vp; 287 struct nfsnode *np = VTONFS(vp); 288 289 if (prtactive && vp->v_usecount > 1) 290 vprint("nfs_reclaim: pushing active", vp); 291 292 LIST_REMOVE(np, n_hash); 293 294 /* 295 * Free up any directory cookie structures and 296 * large file handle structures that might be associated with 297 * this nfs node. 298 */ 299 if (vp->v_type == VDIR && np->n_dircache) 300 hashdone(np->n_dircache, M_NFSDIROFF); 301 KASSERT(np->n_dirgens == NULL); 302 303 if (np->n_fhsize > NFS_SMALLFH) 304 kmem_free(np->n_fhp, np->n_fhsize); 305 306 pool_put(&nfs_vattr_pool, np->n_vattr); 307 if (np->n_rcred) 308 kauth_cred_free(np->n_rcred); 309 310 if (np->n_wcred) 311 kauth_cred_free(np->n_wcred); 312 313 cache_purge(vp); 314 if (vp->v_type == VREG) { 315 mutex_destroy(&np->n_commitlock); 316 } 317 genfs_node_destroy(vp); 318 pool_put(&nfs_node_pool, np); 319 vp->v_data = NULL; 320 return (0); 321 } 322 323 void 324 nfs_gop_size(struct vnode *vp, off_t size, off_t *eobp, int flags) 325 { 326 327 *eobp = MAX(size, vp->v_size); 328 } 329 330 int 331 nfs_gop_alloc(struct vnode *vp, off_t off, off_t len, int flags, 332 kauth_cred_t cred) 333 { 334 335 return 0; 336 } 337 338 int 339 nfs_gop_write(struct vnode *vp, struct vm_page **pgs, int npages, int flags) 340 { 341 int i; 342 343 for (i = 0; i < npages; i++) { 344 pmap_page_protect(pgs[i], VM_PROT_READ); 345 } 346 return genfs_gop_write(vp, pgs, npages, flags); 347 } 348
Indexes created Thu Sep 25 16:09:42 GMT 2025