1 /*-
2 * Copyright (c) 1989, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * This code is derived from software contributed to Berkeley by
6 * Rick Macklem at The University of Guelph.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
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.
19 *
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
30 * SUCH DAMAGE.
31 *
32 * @(#)nfs_node.c 8.6 (Berkeley) 5/22/95
33 */
34
35 #include <sys/cdefs.h>
36 __FBSDID("$FreeBSD: releng/6.2/sys/nfsclient/nfs_node.c 162290 2006-09-13 19:25:44Z mohans $");
37
38 #include <sys/param.h>
39 #include <sys/systm.h>
40 #include <sys/fnv_hash.h>
41 #include <sys/lock.h>
42 #include <sys/malloc.h>
43 #include <sys/mount.h>
44 #include <sys/namei.h>
45 #include <sys/proc.h>
46 #include <sys/socket.h>
47 #include <sys/sysctl.h>
48 #include <sys/vnode.h>
49
50 #include <vm/uma.h>
51
52 #include <rpc/rpcclnt.h>
53
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>
59
60 static uma_zone_t nfsnode_zone;
61
62 #define TRUE 1
63 #define FALSE 0
64
65 void
66 nfs_nhinit(void)
67 {
68
69 nfsnode_zone = uma_zcreate("NFSNODE", sizeof(struct nfsnode), NULL,
70 NULL, NULL, NULL, UMA_ALIGN_PTR, 0);
71 }
72
73 void
74 nfs_nhuninit(void)
75 {
76 uma_zdestroy(nfsnode_zone);
77 }
78
79 struct nfs_vncmp {
80 int fhsize;
81 void *fh;
82 };
83
84 static int
85 nfs_vncmpf(struct vnode *vp, void *arg)
86 {
87 struct nfs_vncmp *a;
88 struct nfsnode *np;
89
90 a = arg;
91 np = VTONFS(vp);
92 return (bcmp(a->fh, np->n_fhp, a->fhsize));
93 }
94
95 /*
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.
100 */
101 int
102 nfs_nget(struct mount *mntp, nfsfh_t *fhp, int fhsize, struct nfsnode **npp)
103 {
104 struct thread *td = curthread; /* XXX */
105 struct nfsnode *np;
106 struct vnode *vp;
107 struct vnode *nvp;
108 int error;
109 u_int hash;
110 int rsflags;
111 struct nfsmount *nmp;
112 struct nfs_vncmp ncmp;
113
114 /*
115 * Calculate nfs mount point and figure out whether the rslock should
116 * be interruptible or not.
117 */
118 nmp = VFSTONFS(mntp);
119 if (nmp->nm_flag & NFSMNT_INT)
120 rsflags = PCATCH;
121 else
122 rsflags = 0;
123
124 *npp = NULL;
125
126 hash = fnv_32_buf(fhp->fh_bytes, fhsize, FNV1_32_INIT);
127 ncmp.fhsize = fhsize;
128 ncmp.fh = fhp;
129
130 error = vfs_hash_get(mntp, hash, LK_EXCLUSIVE,
131 td, &nvp, nfs_vncmpf, &ncmp);
132 if (error)
133 return (error);
134 if (nvp != NULL) {
135 *npp = VTONFS(nvp);
136 return (0);
137 }
138
139 /*
140 * Allocate before getnewvnode since doing so afterward
141 * might cause a bogus v_data pointer to get dereferenced
142 * elsewhere if zalloc should block.
143 */
144 np = uma_zalloc(nfsnode_zone, M_WAITOK | M_ZERO);
145
146 if (nmp->nm_flag & NFSMNT_NFSV4)
147 error = getnewvnode("nfs4", mntp, &nfs4_vnodeops, &nvp);
148 else
149 error = getnewvnode("nfs", mntp, &nfs_vnodeops, &nvp);
150 if (error) {
151 uma_zfree(nfsnode_zone, np);
152 return (error);
153 }
154 vp = nvp;
155 if (nmp->nm_flag & NFSMNT_NFSV4)
156 vp->v_bufobj.bo_ops = &buf_ops_nfs4;
157 else
158 vp->v_bufobj.bo_ops = &buf_ops_nfs;
159 vp->v_data = np;
160 np->n_vnode = vp;
161 /*
162 * NFS supports recursive and shared locking.
163 */
164 vp->v_vnlock->lk_flags |= LK_CANRECURSE;
165 vp->v_vnlock->lk_flags &= ~LK_NOSHARE;
166 error = vfs_hash_insert(vp, hash, LK_EXCLUSIVE,
167 td, &nvp, nfs_vncmpf, &ncmp);
168 if (error)
169 return (error);
170 if (nvp != NULL) {
171 *npp = VTONFS(nvp);
172 /* vrele() the duplicate allocated here, to get it recycled */
173 vrele(vp);
174 return (0);
175 }
176 if (fhsize > NFS_SMALLFH) {
177 MALLOC(np->n_fhp, nfsfh_t *, fhsize, M_NFSBIGFH, M_WAITOK);
178 } else
179 np->n_fhp = &np->n_fh;
180 bcopy((caddr_t)fhp, (caddr_t)np->n_fhp, fhsize);
181 np->n_fhsize = fhsize;
182 lockinit(&np->n_rslock, PVFS | rsflags, "nfrslk", 0, 0);
183 *npp = np;
184
185 return (0);
186 }
187
188 int
189 nfs_inactive(struct vop_inactive_args *ap)
190 {
191 struct nfsnode *np;
192 struct sillyrename *sp;
193 struct thread *td = curthread; /* XXX */
194
195 np = VTONFS(ap->a_vp);
196 if (prtactive && vrefcnt(ap->a_vp) != 0)
197 vprint("nfs_inactive: pushing active", ap->a_vp);
198 if (ap->a_vp->v_type != VDIR) {
199 sp = np->n_sillyrename;
200 np->n_sillyrename = NULL;
201 } else
202 sp = NULL;
203 if (sp) {
204 (void)nfs_vinvalbuf(ap->a_vp, 0, td, 1);
205 /*
206 * Remove the silly file that was rename'd earlier
207 */
208 (sp->s_removeit)(sp);
209 crfree(sp->s_cred);
210 vrele(sp->s_dvp);
211 FREE((caddr_t)sp, M_NFSREQ);
212 }
213 np->n_flag &= NMODIFIED;
214 return (0);
215 }
216
217 /*
218 * Reclaim an nfsnode so that it can be used for other purposes.
219 */
220 int
221 nfs_reclaim(struct vop_reclaim_args *ap)
222 {
223 struct vnode *vp = ap->a_vp;
224 struct nfsnode *np = VTONFS(vp);
225 struct nfsdmap *dp, *dp2;
226
227 if (prtactive && vrefcnt(vp) != 0)
228 vprint("nfs_reclaim: pushing active", vp);
229
230 /*
231 * Destroy the vm object and flush associated pages.
232 */
233 vnode_destroy_vobject(vp);
234
235 vfs_hash_remove(vp);
236
237 /*
238 * Free up any directory cookie structures and
239 * large file handle structures that might be associated with
240 * this nfs node.
241 */
242 if (vp->v_type == VDIR) {
243 dp = LIST_FIRST(&np->n_cookies);
244 while (dp) {
245 dp2 = dp;
246 dp = LIST_NEXT(dp, ndm_list);
247 FREE((caddr_t)dp2, M_NFSDIROFF);
248 }
249 }
250 if (np->n_fhsize > NFS_SMALLFH) {
251 FREE((caddr_t)np->n_fhp, M_NFSBIGFH);
252 }
253
254 lockdestroy(&np->n_rslock);
255 uma_zfree(nfsnode_zone, vp->v_data);
256 vp->v_data = NULL;
257 return (0);
258 }
Cache object: 2e85b6741809e912394c98538807af5f
|