2 * Copyright (c) 1989, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
6 * Rick Macklem at The University of Guelph.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * @(#)nfs_node.c 8.6 (Berkeley) 5/22/95
37 * $FreeBSD: src/sys/nfs/nfs_node.c,v 1.36.2.3 2002/01/05 22:25:04 dillon Exp $
38 * $DragonFly: src/sys/vfs/nfs/nfs_node.c,v 1.19 2005/03/17 17:28:46 dillon Exp $
42 #include <sys/param.h>
43 #include <sys/systm.h>
45 #include <sys/mount.h>
46 #include <sys/namei.h>
47 #include <sys/vnode.h>
48 #include <sys/malloc.h>
49 #include <sys/fnv_hash.h>
51 #include <vm/vm_zone.h>
59 static vm_zone_t nfsnode_zone;
60 static LIST_HEAD(nfsnodehashhead, nfsnode) *nfsnodehashtbl;
61 static u_long nfsnodehash;
67 * Initialize hash links for nfsnodes
68 * and build nfsnode free list.
73 nfsnode_zone = zinit("NFSNODE", sizeof(struct nfsnode), 0, 0, 1);
74 nfsnodehashtbl = hashinit(desiredvnodes, M_NFSHASH, &nfsnodehash);
78 * Look up a vnode/nfsnode by file handle.
79 * Callers must check for mount points!!
80 * In all cases, a pointer to a
81 * nfsnode structure is returned.
83 static int nfs_node_hash_lock;
86 nfs_nget(struct mount *mntp, nfsfh_t *fhp, int fhsize, struct nfsnode **npp)
88 struct thread *td = curthread; /* XXX */
89 struct nfsnode *np, *np2;
90 struct nfsnodehashhead *nhpp;
98 * Calculate nfs mount point and figure out whether the rslock should
99 * be interruptable or not.
101 nmp = VFSTONFS(mntp);
102 if (nmp->nm_flag & NFSMNT_INT)
108 nhpp = NFSNOHASH(fnv_32_buf(fhp->fh_bytes, fhsize, FNV1_32_INIT));
110 for (np = nhpp->lh_first; np; np = np->n_hash.le_next) {
111 if (mntp != NFSTOV(np)->v_mount || np->n_fhsize != fhsize ||
112 bcmp((caddr_t)fhp, (caddr_t)np->n_fhp, fhsize)) {
116 if (vget(vp, LK_EXCLUSIVE, td))
118 for (np = nhpp->lh_first; np; np = np->n_hash.le_next) {
119 if (mntp == NFSTOV(np)->v_mount &&
120 np->n_fhsize == fhsize &&
121 bcmp((caddr_t)fhp, (caddr_t)np->n_fhp, fhsize) == 0
126 if (np == NULL || NFSTOV(np) != vp) {
134 * Obtain a lock to prevent a race condition if the getnewvnode()
135 * or MALLOC() below happens to block.
137 if (nfs_node_hash_lock) {
138 while (nfs_node_hash_lock) {
139 nfs_node_hash_lock = -1;
140 tsleep(&nfs_node_hash_lock, 0, "nfsngt", 0);
144 nfs_node_hash_lock = 1;
147 * Allocate before getnewvnode since doing so afterward
148 * might cause a bogus v_data pointer to get dereferenced
149 * elsewhere if zalloc should block.
151 np = zalloc(nfsnode_zone);
153 error = getnewvnode(VT_NFS, mntp, &nvp, 0, LK_NOPAUSE);
155 if (nfs_node_hash_lock < 0)
156 wakeup(&nfs_node_hash_lock);
157 nfs_node_hash_lock = 0;
159 zfree(nfsnode_zone, np);
163 bzero((caddr_t)np, sizeof *np);
167 * Insert the nfsnode in the hash queue for its new file handle
169 for (np2 = nhpp->lh_first; np2 != 0; np2 = np2->n_hash.le_next) {
170 if (mntp != NFSTOV(np2)->v_mount || np2->n_fhsize != fhsize ||
171 bcmp((caddr_t)fhp, (caddr_t)np2->n_fhp, fhsize))
174 if (nfs_node_hash_lock < 0)
175 wakeup(&nfs_node_hash_lock);
176 nfs_node_hash_lock = 0;
177 zfree(nfsnode_zone, np);
180 LIST_INSERT_HEAD(nhpp, np, n_hash);
181 if (fhsize > NFS_SMALLFH) {
182 MALLOC(np->n_fhp, nfsfh_t *, fhsize, M_NFSBIGFH, M_WAITOK);
184 np->n_fhp = &np->n_fh;
185 bcopy((caddr_t)fhp, (caddr_t)np->n_fhp, fhsize);
186 np->n_fhsize = fhsize;
187 lockinit(&np->n_rslock, rsflags, "nfrslk", 0, LK_NOPAUSE);
190 * nvp is locked & refd so effectively so is np.
194 if (nfs_node_hash_lock < 0)
195 wakeup(&nfs_node_hash_lock);
196 nfs_node_hash_lock = 0;
202 * nfs_inactive(struct vnode *a_vp, struct thread *a_td)
204 * NOTE: the passed vnode is locked but not referenced. On return the
205 * vnode must be unlocked and not referenced.
208 nfs_inactive(struct vop_inactive_args *ap)
211 struct sillyrename *sp;
213 np = VTONFS(ap->a_vp);
214 if (prtactive && ap->a_vp->v_usecount != 0)
215 vprint("nfs_inactive: pushing active", ap->a_vp);
216 if (ap->a_vp->v_type != VDIR) {
217 sp = np->n_sillyrename;
218 np->n_sillyrename = NULL;
224 * We need a reference to keep the vnode from being
225 * recycled by getnewvnode while we do the I/O
226 * associated with discarding the buffers. The vnode
229 nfs_vinvalbuf(ap->a_vp, 0, ap->a_td, 1);
232 * Either we have the only ref or we were vgone()'d via
233 * revoke and might have more.
235 KKASSERT(ap->a_vp->v_usecount == 1 ||
236 (ap->a_vp->v_flag & VRECLAIMED));
239 * Remove the silly file that was rename'd earlier
244 FREE((caddr_t)sp, M_NFSREQ);
247 np->n_flag &= ~(NWRITEERR | NACC | NUPD | NCHG | NLOCKED | NWANTED);
253 * Reclaim an nfsnode so that it can be used for other purposes.
255 * nfs_reclaim(struct vnode *a_vp)
258 nfs_reclaim(struct vop_reclaim_args *ap)
260 struct vnode *vp = ap->a_vp;
261 struct nfsnode *np = VTONFS(vp);
262 struct nfsmount *nmp = VFSTONFS(vp->v_mount);
263 struct nfsdmap *dp, *dp2;
265 if (prtactive && vp->v_usecount != 0)
266 vprint("nfs_reclaim: pushing active", vp);
268 if (np->n_hash.le_prev != NULL)
269 LIST_REMOVE(np, n_hash);
272 * For nqnfs, take it off the timer queue as required.
274 if ((nmp->nm_flag & NFSMNT_NQNFS) && np->n_timer.cqe_next != 0) {
275 CIRCLEQ_REMOVE(&nmp->nm_timerhead, np, n_timer);
279 * Free up any directory cookie structures and
280 * large file handle structures that might be associated with
283 if (vp->v_type == VDIR) {
284 dp = np->n_cookies.lh_first;
287 dp = dp->ndm_list.le_next;
288 FREE((caddr_t)dp2, M_NFSDIROFF);
291 if (np->n_fhsize > NFS_SMALLFH) {
292 FREE((caddr_t)np->n_fhp, M_NFSBIGFH);
295 crfree(np->n_rucred);
299 crfree(np->n_wucred);
304 zfree(nfsnode_zone, np);
312 * nfs_lock(struct vnode *a_vp)
315 nfs_lock(struct vop_lock_args *ap)
317 struct vnode *vp = ap->a_vp;
320 * Ugh, another place where interruptible mounts will get hung.
321 * If you make this sleep interruptible, then you have to fix all
322 * the VOP_LOCK() calls to expect interruptibility.
324 while (vp->v_flag & VXLOCK) {
325 vp->v_flag |= VXWANT;
326 (void) tsleep((caddr_t)vp, 0, "nfslck", 0);
328 if (vp->v_tag == VT_NON)
333 * Only lock regular files. If a server crashed while we were
334 * holding a directory lock, we could easily end up sleeping
335 * until the server rebooted while holding a lock on the root.
336 * Locks are only needed for protecting critical sections in
337 * VMIO at the moment.
338 * New vnodes will have type VNON but they should be locked
339 * since they may become VREG. This is checked in loadattrcache
340 * and unwanted locks are released there.
342 if (vp->v_type == VREG || vp->v_type == VNON) {
343 while (np->n_flag & NLOCKED) {
344 np->n_flag |= NWANTED;
345 (void) tsleep((caddr_t) np, 0, "nfslck2", 0);
347 * If the vnode has transmuted into a VDIR while we
348 * were asleep, then skip the lock.
350 if (vp->v_type != VREG && vp->v_type != VNON)
353 np->n_flag |= NLOCKED;
363 * nfs_unlock(struct vnode *a_vp)
366 nfs_unlock(struct vop_unlock_args *ap)
369 struct vnode* vp = ap->a_vp;
370 struct nfsnode* np = VTONFS(vp);
372 if (vp->v_type == VREG || vp->v_type == VNON) {
373 if (!(np->n_flag & NLOCKED))
374 panic("nfs_unlock: nfsnode not locked");
375 np->n_flag &= ~NLOCKED;
376 if (np->n_flag & NWANTED) {
377 np->n_flag &= ~NWANTED;
378 wakeup((caddr_t) np);
387 * Check for a locked nfsnode
389 * nfs_islocked(struct vnode *a_vp, struct thread *a_td)
392 nfs_islocked(struct vop_islocked_args *ap)
394 return VTONFS(ap->a_vp)->n_flag & NLOCKED ? 1 : 0;