2 * Copyright (c) 2000-2005 Apple Computer, Inc. All rights reserved.
4 * @APPLE_OSREFERENCE_LICENSE_HEADER_START@
6 * This file contains Original Code and/or Modifications of Original Code
7 * as defined in and that are subject to the Apple Public Source License
8 * Version 2.0 (the 'License'). You may not use this file except in
9 * compliance with the License. The rights granted to you under the License
10 * may not be used to create, or enable the creation or redistribution of,
11 * unlawful or unlicensed copies of an Apple operating system, or to
12 * circumvent, violate, or enable the circumvention or violation of, any
13 * terms of an Apple operating system software license agreement.
15 * Please obtain a copy of the License at
16 * http://www.opensource.apple.com/apsl/ and read it before using this file.
18 * The Original Code and all software distributed under the License are
19 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
20 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
21 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
22 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
23 * Please see the License for the specific language governing rights and
24 * limitations under the License.
26 * @APPLE_OSREFERENCE_LICENSE_HEADER_END@
28 /* Copyright (c) 1995 NeXT Computer, Inc. All Rights Reserved */
30 * Copyright (c) 1989, 1993
31 * The Regents of the University of California. All rights reserved.
33 * This code is derived from software contributed to Berkeley by
34 * Rick Macklem at The University of Guelph.
36 * Redistribution and use in source and binary forms, with or without
37 * modification, are permitted provided that the following conditions
39 * 1. Redistributions of source code must retain the above copyright
40 * notice, this list of conditions and the following disclaimer.
41 * 2. Redistributions in binary form must reproduce the above copyright
42 * notice, this list of conditions and the following disclaimer in the
43 * documentation and/or other materials provided with the distribution.
44 * 3. All advertising materials mentioning features or use of this software
45 * must display the following acknowledgement:
46 * This product includes software developed by the University of
47 * California, Berkeley and its contributors.
48 * 4. Neither the name of the University nor the names of its contributors
49 * may be used to endorse or promote products derived from this software
50 * without specific prior written permission.
52 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
53 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
54 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
55 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
56 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
57 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
58 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
59 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
60 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
61 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
64 * @(#)nfs_node.c 8.6 (Berkeley) 5/22/95
65 * FreeBSD-Id: nfs_node.c,v 1.22 1997/10/28 14:06:20 bde Exp $
69 #include <sys/param.h>
70 #include <sys/systm.h>
72 #include <sys/kauth.h>
73 #include <sys/mount_internal.h>
74 #include <sys/vnode.h>
76 #include <sys/malloc.h>
78 #include <nfs/rpcv2.h>
79 #include <nfs/nfsproto.h>
81 #include <nfs/nfsnode.h>
82 #include <nfs/nfsmount.h>
84 LIST_HEAD(nfsnodehashhead
, nfsnode
) *nfsnodehashtbl
;
87 lck_grp_t
* nfs_node_hash_lck_grp
;
88 lck_grp_attr_t
* nfs_node_hash_lck_grp_attr
;
89 lck_attr_t
* nfs_node_hash_lck_attr
;
90 lck_mtx_t
*nfs_node_hash_mutex
;
93 * Initialize hash links for nfsnodes
94 * and build nfsnode free list.
99 nfsnodehashtbl
= hashinit(desiredvnodes
, M_NFSNODE
, &nfsnodehash
);
101 nfs_node_hash_lck_grp_attr
= lck_grp_attr_alloc_init();
102 lck_grp_attr_setstat(nfs_node_hash_lck_grp_attr
);
103 nfs_node_hash_lck_grp
= lck_grp_alloc_init("nfs_node_hash", nfs_node_hash_lck_grp_attr
);
105 nfs_node_hash_lck_attr
= lck_attr_alloc_init();
107 nfs_node_hash_mutex
= lck_mtx_alloc_init(nfs_node_hash_lck_grp
, nfs_node_hash_lck_attr
);
111 * Compute an entry in the NFS hash table structure
114 nfs_hash(u_char
*fhp
, int fhsize
)
120 for (i
= 0; i
< fhsize
; i
++)
126 * Look up a vnode/nfsnode by file handle.
127 * Callers must check for mount points!!
128 * In all cases, a pointer to a
129 * nfsnode structure is returned.
135 struct componentname
*cnp
,
138 struct nfs_vattr
*nvap
,
141 struct nfsnode
**npp
)
144 struct nfsnodehashhead
*nhpp
;
148 struct vnode_fsparam vfsp
;
151 /* Check for unmount in progress */
152 if (!mntp
|| (mntp
->mnt_kern_flag
& MNTK_UNMOUNT
)) {
154 return (!mntp
? ENXIO
: EPERM
);
157 nhpp
= NFSNOHASH(nfs_hash(fhp
, fhsize
));
159 lck_mtx_lock(nfs_node_hash_mutex
);
160 for (np
= nhpp
->lh_first
; np
!= 0; np
= np
->n_hash
.le_next
) {
161 mp
= (np
->n_flag
& NINIT
) ? np
->n_mount
: vnode_mount(NFSTOV(np
));
162 if (mntp
!= mp
|| np
->n_fhsize
!= fhsize
||
163 bcmp(fhp
, np
->n_fhp
, fhsize
))
165 /* if the node is still being initialized, sleep on it */
166 if (np
->n_flag
& NINIT
) {
167 np
->n_flag
|= NWINIT
;
168 msleep(np
, nfs_node_hash_mutex
, PDROP
| PINOD
, "nfs_nget", 0);
173 lck_mtx_unlock(nfs_node_hash_mutex
);
174 if ((error
= vnode_getwithvid(vp
, vid
))) {
176 * If vnode is being reclaimed or has already
177 * changed identity, no need to wait.
181 /* update attributes */
182 error
= nfs_loadattrcache(np
, nvap
, xidp
, 0);
186 if (dvp
&& cnp
&& (flags
& NG_MAKEENTRY
))
187 cache_enter(dvp
, vp
, cnp
);
194 * allocate and initialize nfsnode and stick it in the hash
195 * before calling getnewvnode(). Anyone finding it in the
196 * hash before initialization is complete will wait for it.
198 MALLOC_ZONE(np
, struct nfsnode
*, sizeof *np
, M_NFSNODE
, M_WAITOK
);
200 lck_mtx_unlock(nfs_node_hash_mutex
);
204 bzero((caddr_t
)np
, sizeof *np
);
208 /* setup node's file handle */
209 if (fhsize
> NFS_SMALLFH
) {
210 MALLOC_ZONE(np
->n_fhp
, u_char
*,
211 fhsize
, M_NFSBIGFH
, M_WAITOK
);
213 lck_mtx_unlock(nfs_node_hash_mutex
);
214 FREE_ZONE(np
, sizeof *np
, M_NFSNODE
);
219 np
->n_fhp
= &np
->n_fh
[0];
221 bcopy(fhp
, np
->n_fhp
, fhsize
);
222 np
->n_fhsize
= fhsize
;
224 /* Insert the nfsnode in the hash queue for its new file handle */
225 np
->n_flag
|= NHASHED
;
226 LIST_INSERT_HEAD(nhpp
, np
, n_hash
);
228 /* release lock on hash table */
229 lck_mtx_unlock(nfs_node_hash_mutex
);
231 /* do initial loading of attributes */
232 error
= nfs_loadattrcache(np
, nvap
, xidp
, 1);
234 lck_mtx_lock(nfs_node_hash_mutex
);
235 LIST_REMOVE(np
, n_hash
);
236 np
->n_flag
&= ~(NHASHED
|NINIT
);
237 if (np
->n_flag
& NWINIT
) {
238 np
->n_flag
&= ~NWINIT
;
241 lck_mtx_unlock(nfs_node_hash_mutex
);
242 if (np
->n_fhsize
> NFS_SMALLFH
)
243 FREE_ZONE(np
->n_fhp
, np
->n_fhsize
, M_NFSBIGFH
);
244 FREE_ZONE(np
, sizeof *np
, M_NFSNODE
);
248 np
->n_mtime
= nvap
->nva_mtime
;
249 if (nvap
->nva_type
== VDIR
)
250 np
->n_ncmtime
= nvap
->nva_mtime
;
253 /* now, attempt to get a new vnode */
255 vfsp
.vnfs_vtype
= nvap
->nva_type
;
256 vfsp
.vnfs_str
= "nfs";
258 vfsp
.vnfs_fsnode
= np
;
259 if (nvap
->nva_type
== VFIFO
)
260 vfsp
.vnfs_vops
= fifo_nfsv2nodeop_p
;
261 else if (nvap
->nva_type
== VBLK
|| nvap
->nva_type
== VCHR
)
262 vfsp
.vnfs_vops
= spec_nfsv2nodeop_p
;
264 vfsp
.vnfs_vops
= nfsv2_vnodeop_p
;
265 vfsp
.vnfs_markroot
= (flags
& NG_MARKROOT
) ? 1 : 0;
266 vfsp
.vnfs_marksystem
= 0;
268 vfsp
.vnfs_filesize
= nvap
->nva_size
;
270 if (dvp
&& cnp
&& (flags
& NG_MAKEENTRY
))
273 vfsp
.vnfs_flags
= VNFS_NOCACHE
;
274 error
= vnode_create(VNCREATE_FLAVOR
, VCREATESIZE
, &vfsp
, &nvp
);
276 lck_mtx_lock(nfs_node_hash_mutex
);
277 LIST_REMOVE(np
, n_hash
);
278 np
->n_flag
&= ~(NHASHED
|NINIT
);
279 if (np
->n_flag
& NWINIT
) {
280 np
->n_flag
&= ~NWINIT
;
283 lck_mtx_unlock(nfs_node_hash_mutex
);
284 if (np
->n_fhsize
> NFS_SMALLFH
)
285 FREE_ZONE(np
->n_fhp
, np
->n_fhsize
, M_NFSBIGFH
);
286 FREE_ZONE(np
, sizeof *np
, M_NFSNODE
);
293 vnode_settag(vp
, VT_NFS
); // XXX shouldn't this be a vnode_create() parameter?
295 /* node is now initialized */
297 /* check if anyone's waiting on this node */
298 lck_mtx_lock(nfs_node_hash_mutex
);
299 np
->n_flag
&= ~NINIT
;
300 if (np
->n_flag
& NWINIT
) {
301 np
->n_flag
&= ~NWINIT
;
304 lck_mtx_unlock(nfs_node_hash_mutex
);
312 struct vnop_inactive_args
/* {
313 struct vnodeop_desc *a_desc;
315 vfs_context_t a_context;
318 register struct nfsnode
*np
;
319 register struct sillyrename
*sp
;
322 np
= VTONFS(ap
->a_vp
);
323 if (vnode_vtype(ap
->a_vp
) != VDIR
) {
324 sp
= np
->n_sillyrename
;
325 np
->n_sillyrename
= (struct sillyrename
*)0;
327 sp
= (struct sillyrename
*)0;
331 * Remove the silly file that was rename'd earlier
334 kprintf("nfs_inactive removing %s, dvp=%x, a_vp=%x, ap=%x, np=%x, sp=%x\n",
335 &sp
->s_name
[0], (unsigned)sp
->s_dvp
, (unsigned)ap
->a_vp
, (unsigned)ap
,
336 (unsigned)np
, (unsigned)sp
);
338 nfs_vinvalbuf(ap
->a_vp
, 0, sp
->s_cred
, vfs_context_proc(ap
->a_context
), 1);
340 ubc_setsize(ap
->a_vp
, (off_t
)0);
343 * remove nfsnode from hash now so we can't accidentally find it
344 * again if another object gets created with the same filehandle
345 * before this vnode gets reclaimed
347 lck_mtx_lock(nfs_node_hash_mutex
);
348 LIST_REMOVE(np
, n_hash
);
349 np
->n_flag
&= ~NHASHED
;
350 lck_mtx_unlock(nfs_node_hash_mutex
);
352 if (cred
!= NOCRED
) {
354 kauth_cred_rele(cred
);
356 vnode_rele(sp
->s_dvp
);
357 FREE_ZONE((caddr_t
)sp
, sizeof (struct sillyrename
), M_NFSREQ
);
358 vnode_recycle(ap
->a_vp
);
360 /* clear all flags other than these */
361 np
->n_flag
&= (NMODIFIED
| NFLUSHINPROG
| NFLUSHWANT
| NHASHED
);
366 * Reclaim an nfsnode so that it can be used for other purposes.
370 struct vnop_reclaim_args
/* {
371 struct vnodeop_desc *a_desc;
373 vfs_context_t a_context;
376 vnode_t vp
= ap
->a_vp
;
377 struct nfsnode
*np
= VTONFS(vp
);
378 struct nfsdmap
*dp
, *dp2
;
380 vnode_removefsref(vp
);
382 if (np
->n_flag
& NHASHED
) {
383 lck_mtx_lock(nfs_node_hash_mutex
);
384 LIST_REMOVE(np
, n_hash
);
385 np
->n_flag
&= ~NHASHED
;
386 lck_mtx_unlock(nfs_node_hash_mutex
);
390 * Free up any directory cookie structures and
391 * large file handle structures that might be associated with
394 if (vnode_vtype(vp
) == VDIR
) {
395 dp
= np
->n_cookies
.lh_first
;
398 dp
= dp
->ndm_list
.le_next
;
399 FREE_ZONE((caddr_t
)dp2
,
400 sizeof (struct nfsdmap
), M_NFSDIROFF
);
403 if (np
->n_fhsize
> NFS_SMALLFH
) {
404 FREE_ZONE(np
->n_fhp
, np
->n_fhsize
, M_NFSBIGFH
);
406 vnode_clearfsnode(vp
);
408 FREE_ZONE(np
, sizeof(struct nfsnode
), M_NFSNODE
);