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. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * @(#)ufs_ihash.c 8.7 (Berkeley) 5/17/95
30 * $FreeBSD: src/sys/ufs/ufs/ufs_ihash.c,v 1.20 1999/08/28 00:52:29 peter Exp $
33 #include <sys/param.h>
34 #include <sys/systm.h>
35 #include <sys/kernel.h>
37 #include <sys/vnode.h>
38 #include <sys/malloc.h>
40 #include <sys/mount.h>
44 #include "ufs_extern.h"
47 static MALLOC_DEFINE(M_UFSIHASH, "UFS ihash", "UFS Inode hash tables");
49 #define INOHASH(ump, inum) \
50 (&ump->um_ihashtbl[inum & ump->um_ihash])
53 * Initialize inode hash table.
56 ufs_ihashinit(struct ufsmount *ump)
58 ump->um_ihash = vfs_inodehashsize();
59 ump->um_ihashtbl = kmalloc(sizeof(void *) * ump->um_ihash,
66 ufs_ihashuninit(struct ufsmount *ump)
68 if (ump->um_ihashtbl) {
69 kfree(ump->um_ihashtbl, M_UFSIHASH);
70 ump->um_ihashtbl = NULL;
75 * Use the device/inum pair to find the incore inode, and return a pointer
76 * to it. If it is in core, return it, even if it is locked.
79 ufs_ihashlookup(struct ufsmount *ump, cdev_t dev, ino_t inum)
81 struct inode *ip = NULL;
83 for (ip = *INOHASH(ump, inum); ip; ip = ip->i_next) {
84 if (inum == ip->i_number && dev == ip->i_dev)
93 * Use the device/inum pair to find the incore inode, and return a pointer
94 * to it. If it is in core, but locked, wait for it.
96 * This subroutine may block.
99 ufs_ihashget(struct ufsmount *ump, cdev_t dev, ino_t inum)
105 for (ip = *INOHASH(ump, inum); ip; ip = ip->i_next) {
106 if (inum != ip->i_number || dev != ip->i_dev)
109 if (vget(vp, LK_EXCLUSIVE))
112 * We must check to see if the inode has been ripped
113 * out from under us after blocking.
115 for (ip = *INOHASH(ump, inum); ip; ip = ip->i_next) {
116 if (inum == ip->i_number && dev == ip->i_dev)
119 if (ip == NULL || ITOV(ip) != vp) {
129 * Check to see if an inode is in the hash table. This is used to interlock
130 * file free operations to ensure that the vnode is not reused due to a
131 * reallocate of its inode number before we have had a chance to recycle it.
134 ufs_ihashcheck(struct ufsmount *ump, cdev_t dev, ino_t inum)
138 for (ip = *INOHASH(ump, inum); ip; ip = ip->i_next) {
139 if (inum == ip->i_number && dev == ip->i_dev)
146 * Insert the inode into the hash table, and return it locked.
149 ufs_ihashins(struct ufsmount *ump, struct inode *ip)
154 KKASSERT((ip->i_flag & IN_HASHED) == 0);
155 ipp = INOHASH(ump, ip->i_number);
156 while ((iq = *ipp) != NULL) {
157 if (ip->i_dev == iq->i_dev && ip->i_number == iq->i_number) {
164 ip->i_flag |= IN_HASHED;
169 * Remove the inode from the hash table.
172 ufs_ihashrem(struct ufsmount *ump, struct inode *ip)
177 if (ip->i_flag & IN_HASHED) {
178 ipp = INOHASH(ump, ip->i_number);
179 while ((iq = *ipp) != NULL) {
187 ip->i_flag &= ~IN_HASHED;