nfs_node.c revision 1.25
1 /* $NetBSD: nfs_node.c,v 1.25 1998/02/07 02:44:58 chs 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/lock.h> 51 52 #include <nfs/rpcv2.h> 53 #include <nfs/nfsproto.h> 54 #include <nfs/nfs.h> 55 #include <nfs/nfsnode.h> 56 #include <nfs/nfsmount.h> 57 #include <nfs/nqnfs.h> 58 #include <nfs/nfs_var.h> 59 60 LIST_HEAD(nfsnodehashhead, nfsnode) *nfsnodehashtbl; 61 u_long nfsnodehash; 62 struct lock nfs_hashlock; 63 64 #define TRUE 1 65 #define FALSE 0 66 67 /* 68 * Initialize hash links for nfsnodes 69 * and build nfsnode free list. 70 */ 71 void 72 nfs_nhinit() 73 { 74 75 nfsnodehashtbl = hashinit(desiredvnodes, M_NFSNODE, M_WAITOK, &nfsnodehash); 76 lockinit(&nfs_hashlock, PINOD, "nfs_hashlock", 0, 0); 77 } 78 79 /* 80 * Compute an entry in the NFS hash table structure 81 */ 82 u_long 83 nfs_hash(fhp, fhsize) 84 register nfsfh_t *fhp; 85 int fhsize; 86 { 87 register u_char *fhpp; 88 register u_long fhsum; 89 register int i; 90 91 fhpp = &fhp->fh_bytes[0]; 92 fhsum = 0; 93 for (i = 0; i < fhsize; i++) 94 fhsum += *fhpp++; 95 return (fhsum); 96 } 97 98 /* 99 * Look up a vnode/nfsnode by file handle. 100 * Callers must check for mount points!! 101 * In all cases, a pointer to a 102 * nfsnode structure is returned. 103 */ 104 int 105 nfs_nget(mntp, fhp, fhsize, npp) 106 struct mount *mntp; 107 register nfsfh_t *fhp; 108 int fhsize; 109 struct nfsnode **npp; 110 { 111 struct proc *p = curproc; /* XXX */ 112 register struct nfsnode *np; 113 struct nfsnodehashhead *nhpp; 114 register struct vnode *vp; 115 extern int (**nfsv2_vnodeop_p)__P((void *)); 116 struct vnode *nvp; 117 int error; 118 119 nhpp = NFSNOHASH(nfs_hash(fhp, fhsize)); 120 loop: 121 for (np = nhpp->lh_first; np != 0; np = np->n_hash.le_next) { 122 if (mntp != NFSTOV(np)->v_mount || np->n_fhsize != fhsize || 123 bcmp((caddr_t)fhp, (caddr_t)np->n_fhp, fhsize)) 124 continue; 125 vp = NFSTOV(np); 126 #ifdef Lite2_integrated 127 if (vget(vp, LK_EXCLUSIVE, p)) 128 #else 129 if (vget(vp, 1)) 130 #endif 131 goto loop; 132 *npp = np; 133 return(0); 134 } 135 if (lockmgr(&nfs_hashlock, LK_EXCLUSIVE|LK_SLEEPFAIL, 0, p)) 136 goto loop; 137 error = getnewvnode(VT_NFS, mntp, nfsv2_vnodeop_p, &nvp); 138 if (error) { 139 *npp = 0; 140 lockmgr(&nfs_hashlock, LK_RELEASE, 0, p); 141 return (error); 142 } 143 vp = nvp; 144 MALLOC(np, struct nfsnode *, sizeof *np, M_NFSNODE, M_WAITOK); 145 bzero((caddr_t)np, sizeof *np); 146 vp->v_data = np; 147 np->n_vnode = vp; 148 /* 149 * Insert the nfsnode in the hash queue for its new file handle 150 */ 151 LIST_INSERT_HEAD(nhpp, np, n_hash); 152 if (fhsize > NFS_SMALLFH) { 153 MALLOC(np->n_fhp, nfsfh_t *, fhsize, M_NFSBIGFH, M_WAITOK); 154 } else 155 np->n_fhp = &np->n_fh; 156 bcopy((caddr_t)fhp, (caddr_t)np->n_fhp, fhsize); 157 np->n_fhsize = fhsize; 158 MALLOC(np->n_vattr, struct vattr *, sizeof (struct vattr), 159 M_NFSNODE, M_WAITOK); 160 bzero(np->n_vattr, sizeof (struct vattr)); 161 lockmgr(&nfs_hashlock, LK_RELEASE, 0, p); 162 *npp = np; 163 return (0); 164 } 165 166 int 167 nfs_inactive(v) 168 void *v; 169 { 170 struct vop_inactive_args /* { 171 struct vnode *a_vp; 172 #ifdef Lite2_integrated 173 struct proc *a_p; 174 #endif 175 } */ *ap = v; 176 register struct nfsnode *np; 177 register struct sillyrename *sp; 178 struct proc *p = curproc; /* XXX */ 179 extern int prtactive; 180 181 np = VTONFS(ap->a_vp); 182 if (prtactive && ap->a_vp->v_usecount != 0) 183 vprint("nfs_inactive: pushing active", ap->a_vp); 184 if (ap->a_vp->v_type != VDIR) { 185 sp = np->n_sillyrename; 186 np->n_sillyrename = (struct sillyrename *)0; 187 } else 188 sp = (struct sillyrename *)0; 189 #ifdef Lite2_integrated 190 VOP_UNLOCK(ap->a_vp, 0, ap->a_p); 191 #else 192 VOP_UNLOCK(ap->a_vp); 193 #endif 194 if (sp) { 195 /* 196 * If the usecount is greater than zero, then we are 197 * being inactivated by a forcible unmount and do not 198 * have to get our own reference. In the normal case, 199 * we need a reference to keep the vnode from being 200 * recycled by getnewvnode while we do the I/O 201 * associated with discarding the buffers. 202 */ 203 if (ap->a_vp->v_usecount > 0) 204 (void) nfs_vinvalbuf(ap->a_vp, 0, sp->s_cred, p, 1); 205 #ifdef Lite2_integrated 206 else if (vget(ap->a_vp, 0, p)) 207 #else 208 else if (vget(ap->a_vp, 0)) 209 #endif 210 panic("nfs_inactive: lost vnode"); 211 else { 212 (void) nfs_vinvalbuf(ap->a_vp, 0, sp->s_cred, p, 1); 213 vrele(ap->a_vp); 214 } 215 216 217 /* 218 * Remove the silly file that was rename'd earlier 219 */ 220 nfs_removeit(sp); 221 crfree(sp->s_cred); 222 vrele(sp->s_dvp); 223 FREE((caddr_t)sp, M_NFSREQ); 224 } 225 np->n_flag &= (NMODIFIED | NFLUSHINPROG | NFLUSHWANT | NQNFSEVICTED | 226 NQNFSNONCACHE | NQNFSWRITE); 227 return (0); 228 } 229 230 /* 231 * Reclaim an nfsnode so that it can be used for other purposes. 232 */ 233 int 234 nfs_reclaim(v) 235 void *v; 236 { 237 struct vop_reclaim_args /* { 238 struct vnode *a_vp; 239 } */ *ap = v; 240 register struct vnode *vp = ap->a_vp; 241 register struct nfsnode *np = VTONFS(vp); 242 register struct nfsmount *nmp = VFSTONFS(vp->v_mount); 243 extern int prtactive; 244 245 if (prtactive && vp->v_usecount != 0) 246 vprint("nfs_reclaim: pushing active", vp); 247 248 LIST_REMOVE(np, n_hash); 249 250 /* 251 * For nqnfs, take it off the timer queue as required. 252 */ 253 if ((nmp->nm_flag & NFSMNT_NQNFS) && np->n_timer.cqe_next != 0) { 254 CIRCLEQ_REMOVE(&nmp->nm_timerhead, np, n_timer); 255 } 256 257 /* 258 * Free up any directory cookie structures and 259 * large file handle structures that might be associated with 260 * this nfs node. 261 */ 262 if (vp->v_type == VDIR && np->n_dircache) { 263 nfs_invaldircache(vp, 1); 264 FREE(np->n_dircache, M_NFSDIROFF); 265 } 266 if (np->n_fhsize > NFS_SMALLFH) { 267 FREE((caddr_t)np->n_fhp, M_NFSBIGFH); 268 } 269 270 FREE(np->n_vattr, M_NFSNODE); 271 cache_purge(vp); 272 FREE(vp->v_data, M_NFSNODE); 273 vp->v_data = (void *)0; 274 return (0); 275 } 276 277 #ifndef Lite2_integrated 278 /* 279 * Lock an nfsnode 280 */ 281 int 282 nfs_lock(v) 283 void *v; 284 { 285 struct vop_lock_args /* { 286 struct vnode *a_vp; 287 } */ *ap = v; 288 register struct vnode *vp = ap->a_vp; 289 290 /* 291 * Ugh, another place where interruptible mounts will get hung. 292 * If you make this sleep interruptible, then you have to fix all 293 * the VOP_LOCK() calls to expect interruptibility. 294 */ 295 while (vp->v_flag & VXLOCK) { 296 vp->v_flag |= VXWANT; 297 (void) tsleep((caddr_t)vp, PINOD, "nfslck", 0); 298 } 299 if (vp->v_tag == VT_NON) 300 return (ENOENT); 301 return (0); 302 } 303 304 /* 305 * Unlock an nfsnode 306 */ 307 int 308 nfs_unlock(v) 309 void *v; 310 { 311 #if 0 312 struct vop_unlock_args /* { 313 struct vnode *a_vp; 314 } */ *ap = v; 315 #endif 316 return (0); 317 } 318 319 /* 320 * Check for a locked nfsnode 321 */ 322 int 323 nfs_islocked(v) 324 void *v; 325 { 326 #if 0 327 struct vop_islocked_args /* { 328 struct vnode *a_vp; 329 } */ *ap = v; 330 #endif 331 return (0); 332 } 333 #endif /* Lite2_integrated */ 334
Indexes created Wed Sep 24 15:09:51 GMT 2025