2 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
4 * Copyright (c) 2005 Poul-Henning Kamp
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
16 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
17 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
20 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 #include <sys/cdefs.h>
31 __FBSDID("$FreeBSD$");
33 #include <sys/param.h>
34 #include <sys/systm.h>
35 #include <sys/kernel.h>
36 #include <sys/malloc.h>
37 #include <sys/mount.h>
38 #include <sys/rwlock.h>
39 #include <sys/vnode.h>
41 static MALLOC_DEFINE(M_VFS_HASH, "vfs_hash", "VFS hash table");
43 static LIST_HEAD(vfs_hash_head, vnode) *vfs_hash_tbl;
44 static LIST_HEAD(,vnode) vfs_hash_side;
45 static u_long vfs_hash_mask;
46 static struct rwlock __exclusive_cache_line vfs_hash_lock;
49 vfs_hashinit(void *dummy __unused)
52 vfs_hash_tbl = hashinit(desiredvnodes, M_VFS_HASH, &vfs_hash_mask);
53 rw_init(&vfs_hash_lock, "vfs hash");
54 LIST_INIT(&vfs_hash_side);
57 /* Must be SI_ORDER_SECOND so desiredvnodes is available */
58 SYSINIT(vfs_hash, SI_SUB_VFS, SI_ORDER_SECOND, vfs_hashinit, NULL);
61 vfs_hash_index(struct vnode *vp)
64 return (vp->v_hash + vp->v_mount->mnt_hashseed);
67 static struct vfs_hash_head *
68 vfs_hash_bucket(const struct mount *mp, u_int hash)
71 return (&vfs_hash_tbl[(hash + mp->mnt_hashseed) & vfs_hash_mask]);
75 vfs_hash_get(const struct mount *mp, u_int hash, int flags, struct thread *td,
76 struct vnode **vpp, vfs_hash_cmp_t *fn, void *arg)
83 rw_rlock(&vfs_hash_lock);
84 LIST_FOREACH(vp, vfs_hash_bucket(mp, hash), v_hashlist) {
85 if (vp->v_hash != hash)
87 if (vp->v_mount != mp)
89 if (fn != NULL && fn(vp, arg))
92 rw_runlock(&vfs_hash_lock);
93 error = vget_finish(vp, flags, vs);
94 if (error == ENOENT && (flags & LK_NOWAIT) == 0)
102 rw_runlock(&vfs_hash_lock);
110 vfs_hash_ref(const struct mount *mp, u_int hash, struct thread *td,
111 struct vnode **vpp, vfs_hash_cmp_t *fn, void *arg)
116 rw_rlock(&vfs_hash_lock);
117 LIST_FOREACH(vp, vfs_hash_bucket(mp, hash), v_hashlist) {
118 if (vp->v_hash != hash)
120 if (vp->v_mount != mp)
122 if (fn != NULL && fn(vp, arg))
125 rw_runlock(&vfs_hash_lock);
132 rw_runlock(&vfs_hash_lock);
140 vfs_hash_remove(struct vnode *vp)
143 rw_wlock(&vfs_hash_lock);
144 LIST_REMOVE(vp, v_hashlist);
145 rw_wunlock(&vfs_hash_lock);
149 vfs_hash_insert(struct vnode *vp, u_int hash, int flags, struct thread *td,
150 struct vnode **vpp, vfs_hash_cmp_t *fn, void *arg)
158 rw_wlock(&vfs_hash_lock);
160 vfs_hash_bucket(vp->v_mount, hash), v_hashlist) {
161 if (vp2->v_hash != hash)
163 if (vp2->v_mount != vp->v_mount)
165 if (fn != NULL && fn(vp2, arg))
168 rw_wunlock(&vfs_hash_lock);
169 error = vget_finish(vp2, flags, vs);
170 if (error == ENOENT && (flags & LK_NOWAIT) == 0)
172 rw_wlock(&vfs_hash_lock);
173 LIST_INSERT_HEAD(&vfs_hash_side, vp, v_hashlist);
174 rw_wunlock(&vfs_hash_lock);
184 LIST_INSERT_HEAD(vfs_hash_bucket(vp->v_mount, hash), vp, v_hashlist);
185 rw_wunlock(&vfs_hash_lock);
190 vfs_hash_rehash(struct vnode *vp, u_int hash)
193 rw_wlock(&vfs_hash_lock);
194 LIST_REMOVE(vp, v_hashlist);
195 LIST_INSERT_HEAD(vfs_hash_bucket(vp->v_mount, hash), vp, v_hashlist);
197 rw_wunlock(&vfs_hash_lock);
201 vfs_hash_changesize(u_long newmaxvnodes)
203 struct vfs_hash_head *vfs_hash_newtbl, *vfs_hash_oldtbl;
204 u_long vfs_hash_newmask, vfs_hash_oldmask;
208 vfs_hash_newtbl = hashinit(newmaxvnodes, M_VFS_HASH,
210 /* If same hash table size, nothing to do */
211 if (vfs_hash_mask == vfs_hash_newmask) {
212 free(vfs_hash_newtbl, M_VFS_HASH);
216 * Move everything from the old hash table to the new table.
217 * None of the vnodes in the table can be recycled because to
218 * do so, they have to be removed from the hash table.
220 rw_wlock(&vfs_hash_lock);
221 vfs_hash_oldtbl = vfs_hash_tbl;
222 vfs_hash_oldmask = vfs_hash_mask;
223 vfs_hash_tbl = vfs_hash_newtbl;
224 vfs_hash_mask = vfs_hash_newmask;
225 for (i = 0; i <= vfs_hash_oldmask; i++) {
226 while ((vp = LIST_FIRST(&vfs_hash_oldtbl[i])) != NULL) {
227 LIST_REMOVE(vp, v_hashlist);
229 vfs_hash_bucket(vp->v_mount, vp->v_hash),
233 rw_wunlock(&vfs_hash_lock);
234 free(vfs_hash_oldtbl, M_VFS_HASH);