]>
git.saurik.com Git - apple/xnu.git/blob - bsd/miscfs/nullfs/null_subr.c
2 * Copyright (c) 2016 Apple Inc. All rights reserved.
4 * @APPLE_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. Please obtain a copy of the License at
10 * http://www.opensource.apple.com/apsl/ and read it before using this
13 * The Original Code and all software distributed under the License are
14 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
15 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
16 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
18 * Please see the License for the specific language governing rights and
19 * limitations under the License.
21 * @APPLE_LICENSE_HEADER_END@
25 * Portions Copyright (c) 1992, 1993
26 * The Regents of the University of California. All rights reserved.
28 * This code is derived from software donated to Berkeley by
31 * Redistribution and use in source and binary forms, with or without
32 * modification, are permitted provided that the following conditions
34 * 1. Redistributions of source code must retain the above copyright
35 * notice, this list of conditions and the following disclaimer.
36 * 2. Redistributions in binary form must reproduce the above copyright
37 * notice, this list of conditions and the following disclaimer in the
38 * documentation and/or other materials provided with the distribution.
39 * 4. Neither the name of the University nor the names of its contributors
40 * may be used to endorse or promote products derived from this software
41 * without specific prior written permission.
43 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
44 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
45 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
46 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
47 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
48 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
49 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
50 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
51 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
52 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
55 * @(#)null_subr.c 8.7 (Berkeley) 5/14/95
59 #include <sys/param.h>
60 #include <sys/systm.h>
61 #include <sys/kernel.h>
63 #include <sys/malloc.h>
64 #include <sys/mount.h>
66 #include <sys/vnode.h>
72 * Each cache entry holds a reference to the lower vnode
73 * along with a pointer to the alias vnode. When an
74 * entry is added the lower vnode is VREF'd. When the
75 * alias is removed the lower vnode is vrele'd.
78 #define NULL_HASH_SIZE (desiredvnodes / 10)
80 /* osx doesn't really have the functionality freebsd uses here..gonna try this
82 #define NULL_NHASH(vp) (&null_node_hashtbl[((((uintptr_t)vp) >> vnsz2log) + (uintptr_t)vnode_mount(vp)) & null_hash_mask])
84 static LIST_HEAD(null_node_hashhead
, null_node
) * null_node_hashtbl
;
85 static lck_mtx_t null_hashmtx
;
86 static lck_attr_t
* null_hashlck_attr
;
87 static lck_grp_t
* null_hashlck_grp
;
88 static lck_grp_attr_t
* null_hashlck_grp_attr
;
89 static u_long null_hash_mask
;
91 /* os x doesn't have hashes built into vnode. gonna try doing what freebsd does
93 * Don't want to create a dependency on vnode_internal.h and the real struct
95 * 9 is an eyeball of the log 2 size of vnode */
96 static int vnsz2log
= 9;
98 static int null_hashins(struct mount
*, struct null_node
*, struct vnode
**);
101 nullfs_init_lck(lck_mtx_t
* lck
)
104 if (lck
&& null_hashlck_grp
&& null_hashlck_attr
) {
105 lck_mtx_init(lck
, null_hashlck_grp
, null_hashlck_attr
);
112 nullfs_destroy_lck(lck_mtx_t
* lck
)
115 if (lck
&& null_hashlck_grp
) {
116 lck_mtx_destroy(lck
, null_hashlck_grp
);
123 * Initialise cache headers
126 nullfs_init(__unused
struct vfsconf
* vfsp
)
128 NULLFSDEBUG("%s\n", __FUNCTION__
);
130 /* assuming for now that this happens immediately and by default after fs
132 null_hashlck_grp_attr
= lck_grp_attr_alloc_init();
133 if (null_hashlck_grp_attr
== NULL
) {
136 null_hashlck_grp
= lck_grp_alloc_init("com.apple.filesystems.nullfs", null_hashlck_grp_attr
);
137 if (null_hashlck_grp
== NULL
) {
140 null_hashlck_attr
= lck_attr_alloc_init();
141 if (null_hashlck_attr
== NULL
) {
145 lck_mtx_init(&null_hashmtx
, null_hashlck_grp
, null_hashlck_attr
);
146 null_node_hashtbl
= hashinit(NULL_HASH_SIZE
, M_TEMP
, &null_hash_mask
);
147 NULLFSDEBUG("%s finished\n", __FUNCTION__
);
150 printf("NULLFS: failed to get lock element\n");
151 if (null_hashlck_grp_attr
) {
152 lck_grp_attr_free(null_hashlck_grp_attr
);
153 null_hashlck_grp_attr
= NULL
;
155 if (null_hashlck_grp
) {
156 lck_grp_free(null_hashlck_grp
);
157 null_hashlck_grp
= NULL
;
159 if (null_hashlck_attr
) {
160 lck_attr_free(null_hashlck_attr
);
161 null_hashlck_attr
= NULL
;
169 /* This gets called when the fs is uninstalled, there wasn't an exact
170 * equivalent in vfsops */
171 lck_mtx_destroy(&null_hashmtx
, null_hashlck_grp
);
172 hashdestroy(null_node_hashtbl
, M_TEMP
, null_hash_mask
);
173 if (null_hashlck_grp_attr
) {
174 lck_grp_attr_free(null_hashlck_grp_attr
);
175 null_hashlck_grp_attr
= NULL
;
177 if (null_hashlck_grp
) {
178 lck_grp_free(null_hashlck_grp
);
179 null_hashlck_grp
= NULL
;
181 if (null_hashlck_attr
) {
182 lck_attr_free(null_hashlck_attr
);
183 null_hashlck_attr
= NULL
;
189 * Find the nullfs vnode mapped to lowervp. Return it in *vpp with an iocount if found.
190 * Return 0 on success. On failure *vpp will be null and a non-zero error code will be returned.
193 null_hashget(struct mount
* mp
, struct vnode
* lowervp
, struct vnode
** vpp
)
195 struct null_node_hashhead
* hd
= NULL
;
196 struct null_node
* a
= NULL
;
197 struct vnode
* vp
= NULL
;
202 * Find hash base, and then search the (two-way) linked
203 * list looking for a null_node structure which is referencing
204 * the lower vnode. We only give up our reference at reclaim so
205 * just check whether the lowervp has gotten pulled from under us
207 hd
= NULL_NHASH(lowervp
);
208 // In the future we should consider using a per bucket lock
209 lck_mtx_lock(&null_hashmtx
);
210 LIST_FOREACH(a
, hd
, null_hash
)
212 if (a
->null_lowervp
== lowervp
&& vnode_mount(NULLTOV(a
)) == mp
) {
214 if (a
->null_lowervid
!= vnode_vid(lowervp
)) {
215 /*lowervp has reved */
219 vp_vid
= a
->null_myvid
;
221 // In the case of a succesful look-up we should consider moving the object to the top of the head
225 lck_mtx_unlock(&null_hashmtx
);
227 error
= vnode_getwithvid(vp
, vp_vid
);
236 * Act like null_hashget, but add passed null_node to hash if no existing
240 null_hashins(struct mount
* mp
, struct null_node
* xp
, struct vnode
** vpp
)
242 struct null_node_hashhead
* hd
= NULL
;
243 struct null_node
* oxp
= NULL
;
244 struct vnode
* ovp
= NULL
;
245 uint32_t oxp_vid
= 0;
248 hd
= NULL_NHASH(xp
->null_lowervp
);
249 lck_mtx_lock(&null_hashmtx
);
250 LIST_FOREACH(oxp
, hd
, null_hash
)
252 if (oxp
->null_lowervp
== xp
->null_lowervp
&& vnode_mount(NULLTOV(oxp
)) == mp
) {
254 * See null_hashget for a description of this
258 if (oxp
->null_lowervid
!= vnode_vid(oxp
->null_lowervp
)) {
259 /*vp doesn't exist so return null (not sure we are actually gonna catch
261 * This is an exceptional case right now, it suggests the vnode we are
262 * trying to add has been recycled
267 oxp_vid
= oxp
->null_myvid
;
272 /* if it wasn't in the hash map then the vnode pointed to by xp already has a
273 * iocount so don't bother */
274 LIST_INSERT_HEAD(hd
, xp
, null_hash
);
275 xp
->null_flags
|= NULL_FLAG_HASHED
;
277 lck_mtx_unlock(&null_hashmtx
);
279 /* if we found something in the hash map then grab an iocount */
280 error
= vnode_getwithvid(ovp
, oxp_vid
);
289 * Remove node from hash.
292 null_hashrem(struct null_node
* xp
)
294 lck_mtx_lock(&null_hashmtx
);
295 LIST_REMOVE(xp
, null_hash
);
296 lck_mtx_unlock(&null_hashmtx
);
299 static struct null_node
*
300 null_nodecreate(struct vnode
* lowervp
)
302 struct null_node
* xp
;
304 MALLOC(xp
, struct null_node
*, sizeof(struct null_node
), M_TEMP
, M_WAITOK
| M_ZERO
);
307 xp
->null_lowervp
= lowervp
;
308 xp
->null_lowervid
= vnode_vid(lowervp
);
314 /* assumption is that vnode has iocount on it after vnode create */
317 struct mount
* mp
, struct vnode
* lowervp
, struct vnode
* dvp
, struct vnode
** vpp
, struct componentname
* cnp
, int root
)
319 struct vnode_fsparam vnfs_param
;
321 enum vtype type
= VDIR
;
322 struct null_node
* xp
= null_nodecreate(lowervp
);
329 type
= vnode_vtype(lowervp
);
332 vnfs_param
.vnfs_mp
= mp
;
333 vnfs_param
.vnfs_vtype
= type
;
334 vnfs_param
.vnfs_str
= "nullfs";
335 vnfs_param
.vnfs_dvp
= dvp
;
336 vnfs_param
.vnfs_fsnode
= (void *)xp
;
337 vnfs_param
.vnfs_vops
= nullfs_vnodeop_p
;
338 vnfs_param
.vnfs_markroot
= root
;
339 vnfs_param
.vnfs_marksystem
= 0;
340 vnfs_param
.vnfs_rdev
= 0;
341 vnfs_param
.vnfs_filesize
= 0; // set this to 0 since we should only be shadowing non-regular files
342 vnfs_param
.vnfs_cnp
= cnp
;
343 vnfs_param
.vnfs_flags
= VNFS_ADDFSREF
;
345 error
= vnode_create(VNCREATE_FLAVOR
, VCREATESIZE
, &vnfs_param
, vpp
);
347 xp
->null_vnode
= *vpp
;
348 xp
->null_myvid
= vnode_vid(*vpp
);
349 vnode_settag(*vpp
, VT_NULL
);
357 * Make a new or get existing nullfs node.
358 * Vp is the alias vnode, lowervp is the lower vnode.
360 * lowervp is assumed to have an iocount on it from the caller
364 struct mount
* mp
, struct vnode
* lowervp
, struct vnode
* dvp
, struct vnode
** vpp
, struct componentname
* cnp
, int root
)
369 /* Lookup the hash firstly. */
370 error
= null_hashget(mp
, lowervp
, vpp
);
371 /* ENOENT means it wasn't found, EIO is a failure we should bail from, 0 is it
373 if (error
!= ENOENT
) {
374 /* null_hashget checked the vid, so if we got something here its legit to
375 * the best of our knowledge*/
376 /* if we found something then there is an iocount on vpp,
377 * if we didn't find something then vpp shouldn't be used by the caller */
382 * We do not serialize vnode creation, instead we will check for
383 * duplicates later, when adding new vnode to hash.
385 error
= vnode_ref(lowervp
); // take a ref on lowervp so we let the system know we care about it
387 // Failed to get a reference on the lower vp so bail. Lowervp may be gone already.
391 error
= null_getnewvnode(mp
, lowervp
, dvp
, &vp
, cnp
, root
);
399 * Atomically insert our new node into the hash or vget existing
400 * if someone else has beaten us to it.
402 error
= null_hashins(mp
, VTONULL(vp
), vpp
);
403 if (error
|| *vpp
!= NULL
) {
404 /* recycle will call reclaim which will get rid of the internals */
407 /* if we found vpp, then null_hashins put an iocount on it */
411 /* vp has an iocount from null_getnewvnode */