1 /* $NetBSD: nfs_node.c,v 1.43 2001/04/20 11:19:16 fvdl 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 "opt_nfs.h" 42 43 #include <sys/param.h> 44 #include <sys/systm.h> 45 #include <sys/proc.h> 46 #include <sys/mount.h> 47 #include <sys/namei.h> 48 #include <sys/vnode.h> 49 #include <sys/kernel.h> 50 #include <sys/malloc.h> 51 #include <sys/pool.h> 52 #include <sys/lock.h> 53 54 #include <nfs/rpcv2.h> 55 #include <nfs/nfsproto.h> 56 #include <nfs/nfs.h> 57 #include <nfs/nfsnode.h> 58 #include <nfs/nfsmount.h> 59 #include <nfs/nqnfs.h> 60 #include <nfs/nfs_var.h> 61 62 LIST_HEAD(nfsnodehashhead, nfsnode) *nfsnodehashtbl; 63 u_long nfsnodehash; 64 struct lock nfs_hashlock; 65 66 struct pool nfs_node_pool; /* memory pool for nfs nodes */ 67 struct pool nfs_vattr_pool; /* memory pool for nfs vattrs */ 68 69 extern int prtactive; 70 71 #define TRUE 1 72 #define FALSE 0 73 74 /* 75 * Initialize hash links for nfsnodes 76 * and build nfsnode free list. 77 */ 78 void 79 nfs_nhinit() 80 { 81 82 nfsnodehashtbl = hashinit(desiredvnodes, HASH_LIST, M_NFSNODE, 83 M_WAITOK, &nfsnodehash); 84 lockinit(&nfs_hashlock, PINOD, "nfs_hashlock", 0, 0); 85 86 pool_init(&nfs_node_pool, sizeof(struct nfsnode), 0, 0, 0, "nfsnodepl", 87 0, pool_page_alloc_nointr, pool_page_free_nointr, M_NFSNODE); 88 pool_init(&nfs_vattr_pool, sizeof(struct vattr), 0, 0, 0, "nfsvapl", 89 0, pool_page_alloc_nointr, pool_page_free_nointr, M_NFSNODE); 90 } 91 92 /* 93 * Free resources previoslu allocated in nfs_nhinit(). 94 */ 95 void 96 nfs_nhdone() 97 { 98 hashdone(nfsnodehashtbl, M_NFSNODE); 99 pool_destroy(&nfs_node_pool); 100 pool_destroy(&nfs_vattr_pool); 101 } 102 103 /* 104 * Compute an entry in the NFS hash table structure 105 */ 106 u_long 107 nfs_hash(fhp, fhsize) 108 nfsfh_t *fhp; 109 int fhsize; 110 { 111 u_char *fhpp; 112 u_long fhsum; 113 int i; 114 115 fhpp = &fhp->fh_bytes[0]; 116 fhsum = 0; 117 for (i = 0; i < fhsize; i++) 118 fhsum += *fhpp++; 119 return (fhsum); 120 } 121 122 /* 123 * Look up a vnode/nfsnode by file handle. 124 * Callers must check for mount points!! 125 * In all cases, a pointer to a 126 * nfsnode structure is returned. 127 */ 128 int 129 nfs_nget(mntp, fhp, fhsize, npp) 130 struct mount *mntp; 131 nfsfh_t *fhp; 132 int fhsize; 133 struct nfsnode **npp; 134 { 135 struct nfsnode *np; 136 struct nfsnodehashhead *nhpp; 137 struct vnode *vp; 138 struct vnode *nvp; 139 int error; 140 141 nhpp = NFSNOHASH(nfs_hash(fhp, fhsize)); 142 loop: 143 for (np = nhpp->lh_first; np != 0; np = np->n_hash.le_next) { 144 if (mntp != NFSTOV(np)->v_mount || np->n_fhsize != fhsize || 145 memcmp(fhp, np->n_fhp, fhsize)) 146 continue; 147 vp = NFSTOV(np); 148 if (vget(vp, LK_EXCLUSIVE)) 149 goto loop; 150 *npp = np; 151 return(0); 152 } 153 if (lockmgr(&nfs_hashlock, LK_EXCLUSIVE|LK_SLEEPFAIL, 0)) 154 goto loop; 155 error = getnewvnode(VT_NFS, mntp, nfsv2_vnodeop_p, &nvp); 156 if (error) { 157 *npp = 0; 158 lockmgr(&nfs_hashlock, LK_RELEASE, 0); 159 return (error); 160 } 161 vp = nvp; 162 np = pool_get(&nfs_node_pool, PR_WAITOK); 163 memset(np, 0, sizeof *np); 164 lockinit(&np->n_commitlock, PINOD, "nfsclock", 0, 0); 165 vp->v_data = np; 166 np->n_vnode = vp; 167 168 /* 169 * Insert the nfsnode in the hash queue for its new file handle 170 */ 171 LIST_INSERT_HEAD(nhpp, np, n_hash); 172 if (fhsize > NFS_SMALLFH) { 173 np->n_fhp = malloc(fhsize, M_NFSBIGFH, M_WAITOK); 174 } else 175 np->n_fhp = &np->n_fh; 176 memcpy(np->n_fhp, fhp, fhsize); 177 np->n_fhsize = fhsize; 178 np->n_accstamp = -1; 179 np->n_vattr = pool_get(&nfs_vattr_pool, PR_WAITOK); 180 181 lockmgr(&vp->v_lock, LK_EXCLUSIVE, (struct simplelock *)0); 182 183 /* 184 * XXXUBC doing this while holding the nfs_hashlock is bad, 185 * but there's no alternative at the moment. 186 */ 187 error = VOP_GETATTR(vp, np->n_vattr, curproc->p_ucred, curproc); 188 if (error) { 189 lockmgr(&vp->v_lock, LK_RELEASE, 0); 190 lockmgr(&nfs_hashlock, LK_RELEASE, 0); 191 vgone(vp); 192 return error; 193 } 194 uvm_vnp_setsize(vp, np->n_vattr->va_size); 195 196 lockmgr(&nfs_hashlock, LK_RELEASE, 0); 197 *npp = np; 198 return (0); 199 } 200 201 int 202 nfs_inactive(v) 203 void *v; 204 { 205 struct vop_inactive_args /* { 206 struct vnode *a_vp; 207 struct proc *a_p; 208 } */ *ap = v; 209 struct nfsnode *np; 210 struct sillyrename *sp; 211 struct proc *p = ap->a_p; 212 struct vnode *vp = ap->a_vp; 213 214 np = VTONFS(vp); 215 if (prtactive && vp->v_usecount != 0) 216 vprint("nfs_inactive: pushing active", vp); 217 if (vp->v_type != VDIR) { 218 sp = np->n_sillyrename; 219 np->n_sillyrename = (struct sillyrename *)0; 220 } else 221 sp = (struct sillyrename *)0; 222 if (sp) { 223 nfs_vinvalbuf(vp, 0, sp->s_cred, p, 1); 224 225 /* 226 * Remove the silly file that was rename'd earlier 227 */ 228 229 vn_lock(sp->s_dvp, LK_EXCLUSIVE | LK_RETRY); 230 nfs_removeit(sp); 231 crfree(sp->s_cred); 232 vput(sp->s_dvp); 233 FREE(sp, M_NFSREQ); 234 } 235 np->n_flag &= (NMODIFIED | NFLUSHINPROG | NFLUSHWANT | NQNFSEVICTED | 236 NQNFSNONCACHE | NQNFSWRITE); 237 VOP_UNLOCK(vp, 0); 238 return (0); 239 } 240 241 /* 242 * Reclaim an nfsnode so that it can be used for other purposes. 243 */ 244 int 245 nfs_reclaim(v) 246 void *v; 247 { 248 struct vop_reclaim_args /* { 249 struct vnode *a_vp; 250 } */ *ap = v; 251 struct vnode *vp = ap->a_vp; 252 struct nfsnode *np = VTONFS(vp); 253 struct nfsmount *nmp = VFSTONFS(vp->v_mount); 254 255 if (prtactive && vp->v_usecount != 0) 256 vprint("nfs_reclaim: pushing active", vp); 257 258 LIST_REMOVE(np, n_hash); 259 260 /* 261 * For nqnfs, take it off the timer queue as required. 262 */ 263 if ((nmp->nm_flag & NFSMNT_NQNFS) && np->n_timer.cqe_next != 0) { 264 CIRCLEQ_REMOVE(&nmp->nm_timerhead, np, n_timer); 265 } 266 267 /* 268 * Free up any directory cookie structures and 269 * large file handle structures that might be associated with 270 * this nfs node. 271 */ 272 if (vp->v_type == VDIR && np->n_dircache) { 273 nfs_invaldircache(vp, 1); 274 FREE(np->n_dircache, M_NFSDIROFF); 275 } 276 if (np->n_fhsize > NFS_SMALLFH) { 277 free(np->n_fhp, M_NFSBIGFH); 278 } 279 280 pool_put(&nfs_vattr_pool, np->n_vattr); 281 if (np->n_rcred) { 282 crfree(np->n_rcred); 283 } 284 if (np->n_wcred) { 285 crfree(np->n_wcred); 286 } 287 cache_purge(vp); 288 pool_put(&nfs_node_pool, vp->v_data); 289 vp->v_data = NULL; 290 return (0); 291 } 292