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