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 * 4. Neither the name of the University nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * @(#)nfs_node.c 8.6 (Berkeley) 5/22/95
35 #include <sys/cdefs.h>
36 __FBSDID("$FreeBSD$");
38 #include <sys/param.h>
39 #include <sys/systm.h>
40 #include <sys/fnv_hash.h>
42 #include <sys/malloc.h>
43 #include <sys/mount.h>
44 #include <sys/namei.h>
46 #include <sys/socket.h>
47 #include <sys/sysctl.h>
48 #include <sys/vnode.h>
52 #include <rpc/rpcclnt.h>
54 #include <nfs/rpcv2.h>
55 #include <nfs/nfsproto.h>
56 #include <nfsclient/nfs.h>
57 #include <nfsclient/nfsnode.h>
58 #include <nfsclient/nfsmount.h>
60 static uma_zone_t nfsnode_zone;
69 nfsnode_zone = uma_zcreate("NFSNODE", sizeof(struct nfsnode), NULL,
70 NULL, NULL, NULL, UMA_ALIGN_PTR, 0);
76 uma_zdestroy(nfsnode_zone);
85 nfs_vncmpf(struct vnode *vp, void *arg)
92 return (bcmp(a->fh, np->n_fhp, a->fhsize));
96 * Look up a vnode/nfsnode by file handle.
97 * Callers must check for mount points!!
98 * In all cases, a pointer to a
99 * nfsnode structure is returned.
102 nfs_nget(struct mount *mntp, nfsfh_t *fhp, int fhsize, struct nfsnode **npp, int flags)
104 struct thread *td = curthread; /* XXX */
110 struct nfsmount *nmp;
111 struct nfs_vncmp ncmp;
113 nmp = VFSTONFS(mntp);
116 hash = fnv_32_buf(fhp->fh_bytes, fhsize, FNV1_32_INIT);
117 ncmp.fhsize = fhsize;
120 error = vfs_hash_get(mntp, hash, flags,
121 td, &nvp, nfs_vncmpf, &ncmp);
130 * Allocate before getnewvnode since doing so afterward
131 * might cause a bogus v_data pointer to get dereferenced
132 * elsewhere if zalloc should block.
134 np = uma_zalloc(nfsnode_zone, M_WAITOK | M_ZERO);
136 if (nmp->nm_flag & NFSMNT_NFSV4)
137 error = getnewvnode("nfs4", mntp, &nfs4_vnodeops, &nvp);
139 error = getnewvnode("nfs", mntp, &nfs_vnodeops, &nvp);
141 uma_zfree(nfsnode_zone, np);
145 if (nmp->nm_flag & NFSMNT_NFSV4)
146 vp->v_bufobj.bo_ops = &buf_ops_nfs4;
148 vp->v_bufobj.bo_ops = &buf_ops_nfs;
152 * Initialize the mutex even if the vnode is going to be a loser.
153 * This simplifies the logic in reclaim, which can then unconditionally
154 * destroy the mutex (in the case of the loser, or if hash_insert happened
155 * to return an error no special casing is needed).
157 mtx_init(&np->n_mtx, "NFSnode lock", NULL, MTX_DEF);
159 * NFS supports recursive and shared locking.
161 vp->v_vnlock->lk_flags |= LK_CANRECURSE;
162 vp->v_vnlock->lk_flags &= ~LK_NOSHARE;
163 if (fhsize > NFS_SMALLFH) {
164 MALLOC(np->n_fhp, nfsfh_t *, fhsize, M_NFSBIGFH, M_WAITOK);
166 np->n_fhp = &np->n_fh;
167 bcopy((caddr_t)fhp, (caddr_t)np->n_fhp, fhsize);
168 np->n_fhsize = fhsize;
169 lockmgr(vp->v_vnlock, LK_EXCLUSIVE, NULL, td);
170 error = insmntque(vp, mntp);
173 if (np->n_fhsize > NFS_SMALLFH) {
174 FREE((caddr_t)np->n_fhp, M_NFSBIGFH);
176 mtx_destroy(&np->n_mtx);
177 uma_zfree(nfsnode_zone, np);
180 error = vfs_hash_insert(vp, hash, flags,
181 td, &nvp, nfs_vncmpf, &ncmp);
186 /* vfs_hash_insert() vput()'s the losing vnode */
195 nfs_inactive(struct vop_inactive_args *ap)
198 struct sillyrename *sp;
199 struct thread *td = curthread; /* XXX */
201 np = VTONFS(ap->a_vp);
202 if (prtactive && vrefcnt(ap->a_vp) != 0)
203 vprint("nfs_inactive: pushing active", ap->a_vp);
204 if (ap->a_vp->v_type != VDIR) {
205 sp = np->n_sillyrename;
206 np->n_sillyrename = NULL;
210 (void)nfs_vinvalbuf(ap->a_vp, 0, td, 1);
212 * Remove the silly file that was rename'd earlier
214 (sp->s_removeit)(sp);
217 FREE((caddr_t)sp, M_NFSREQ);
219 np->n_flag &= NMODIFIED;
224 * Reclaim an nfsnode so that it can be used for other purposes.
227 nfs_reclaim(struct vop_reclaim_args *ap)
229 struct vnode *vp = ap->a_vp;
230 struct nfsnode *np = VTONFS(vp);
231 struct nfsdmap *dp, *dp2;
233 if (prtactive && vrefcnt(vp) != 0)
234 vprint("nfs_reclaim: pushing active", vp);
237 * If the NLM is running, give it a chance to abort pending
244 * Destroy the vm object and flush associated pages.
246 vnode_destroy_vobject(vp);
251 * Free up any directory cookie structures and
252 * large file handle structures that might be associated with
255 if (vp->v_type == VDIR) {
256 dp = LIST_FIRST(&np->n_cookies);
259 dp = LIST_NEXT(dp, ndm_list);
260 FREE((caddr_t)dp2, M_NFSDIROFF);
263 if (np->n_fhsize > NFS_SMALLFH) {
264 FREE((caddr_t)np->n_fhp, M_NFSBIGFH);
266 mtx_destroy(&np->n_mtx);
267 uma_zfree(nfsnode_zone, vp->v_data);