2 * Copyright (c) 1982, 1986, 1989, 1991, 1993, 1995
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * @(#)ufs_ihash.c 8.7 (Berkeley) 5/17/95
34 * $FreeBSD: src/sys/ufs/ufs/ufs_ihash.c,v 1.20 1999/08/28 00:52:29 peter Exp $
35 * $DragonFly: src/sys/vfs/ufs/ufs_ihash.c,v 1.20 2006/10/14 16:26:40 dillon Exp $
38 #include <sys/param.h>
39 #include <sys/systm.h>
40 #include <sys/kernel.h>
42 #include <sys/vnode.h>
43 #include <sys/malloc.h>
48 #include "ufs_extern.h"
50 static MALLOC_DEFINE(M_UFSIHASH
, "UFS ihash", "UFS Inode hash tables");
52 * Structures associated with inode cacheing.
54 static struct inode
**ihashtbl
;
55 static u_long ihash
; /* size of hash table - 1 */
56 static struct lwkt_token ufs_ihash_token
;
58 #define INOHASH(device, inum) (&ihashtbl[(minor(device) + (inum)) & ihash])
61 * Initialize inode hash table.
67 while (ihash
< desiredvnodes
)
69 ihashtbl
= kmalloc(sizeof(void *) * ihash
, M_UFSIHASH
, M_WAITOK
|M_ZERO
);
71 lwkt_token_init(&ufs_ihash_token
);
75 ufs_uninit(struct vfsconf
*vfc
)
79 lwkt_gettoken(&ilock
, &ufs_ihash_token
);
81 kfree(ihashtbl
, M_UFSIHASH
);
82 lwkt_reltoken(&ilock
);
87 * Use the device/inum pair to find the incore inode, and return a pointer
88 * to it. If it is in core, return it, even if it is locked.
91 ufs_ihashlookup(cdev_t dev
, ino_t inum
)
96 lwkt_gettoken(&ilock
, &ufs_ihash_token
);
97 for (ip
= *INOHASH(dev
, inum
); ip
; ip
= ip
->i_next
) {
98 if (inum
== ip
->i_number
&& dev
== ip
->i_dev
)
101 lwkt_reltoken(&ilock
);
108 * Use the device/inum pair to find the incore inode, and return a pointer
109 * to it. If it is in core, but locked, wait for it.
111 * Note that the serializing tokens do not prevent other processes from
112 * playing with the data structure being protected while we are blocked.
113 * They do protect us from preemptive interrupts which might try to
114 * play with the protected data structure.
117 ufs_ihashget(cdev_t dev
, ino_t inum
)
123 lwkt_gettoken(&ilock
, &ufs_ihash_token
);
125 for (ip
= *INOHASH(dev
, inum
); ip
; ip
= ip
->i_next
) {
126 if (inum
!= ip
->i_number
|| dev
!= ip
->i_dev
)
129 if (vget(vp
, LK_EXCLUSIVE
))
132 * We must check to see if the inode has been ripped
133 * out from under us after blocking.
135 for (ip
= *INOHASH(dev
, inum
); ip
; ip
= ip
->i_next
) {
136 if (inum
== ip
->i_number
&& dev
== ip
->i_dev
)
139 if (ip
== NULL
|| ITOV(ip
) != vp
) {
143 lwkt_reltoken(&ilock
);
146 lwkt_reltoken(&ilock
);
151 * Check to see if an inode is in the hash table. This is used to interlock
152 * file free operations to ensure that the vnode is not reused due to a
153 * reallocate of its inode number before we have had a chance to recycle it.
156 ufs_ihashcheck(cdev_t dev
, ino_t inum
)
161 lwkt_gettoken(&ilock
, &ufs_ihash_token
);
162 for (ip
= *INOHASH(dev
, inum
); ip
; ip
= ip
->i_next
) {
163 if (inum
== ip
->i_number
&& dev
== ip
->i_dev
)
166 lwkt_reltoken(&ilock
);
171 * Insert the inode into the hash table, and return it locked.
174 ufs_ihashins(struct inode
*ip
)
180 KKASSERT((ip
->i_flag
& IN_HASHED
) == 0);
181 lwkt_gettoken(&ilock
, &ufs_ihash_token
);
182 ipp
= INOHASH(ip
->i_dev
, ip
->i_number
);
183 while ((iq
= *ipp
) != NULL
) {
184 if (ip
->i_dev
== iq
->i_dev
&& ip
->i_number
== iq
->i_number
) {
185 lwkt_reltoken(&ilock
);
192 ip
->i_flag
|= IN_HASHED
;
193 lwkt_reltoken(&ilock
);
198 * Remove the inode from the hash table.
201 ufs_ihashrem(struct inode
*ip
)
207 lwkt_gettoken(&ilock
, &ufs_ihash_token
);
208 if (ip
->i_flag
& IN_HASHED
) {
209 ipp
= INOHASH(ip
->i_dev
, ip
->i_number
);
210 while ((iq
= *ipp
) != NULL
) {
218 ip
->i_flag
&= ~IN_HASHED
;
220 lwkt_reltoken(&ilock
);