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 $
37 #include <sys/param.h>
38 #include <sys/systm.h>
39 #include <sys/kernel.h>
41 #include <sys/vnode.h>
42 #include <sys/malloc.h>
44 #include <sys/mount.h>
48 #include "ufs_extern.h"
51 static MALLOC_DEFINE(M_UFSIHASH, "UFS ihash", "UFS Inode hash tables");
53 #define INOHASH(ump, inum) \
54 (&ump->um_ihashtbl[inum & ump->um_ihash])
57 * Initialize inode hash table.
60 ufs_ihashinit(struct ufsmount *ump)
62 u_long target = desiredvnodes / 4 + 1;
65 while (ump->um_ihash < target)
67 ump->um_ihashtbl = kmalloc(sizeof(void *) * ump->um_ihash, M_UFSIHASH,
73 ufs_ihashuninit(struct ufsmount *ump)
75 if (ump->um_ihashtbl) {
76 kfree(ump->um_ihashtbl, M_UFSIHASH);
77 ump->um_ihashtbl = NULL;
82 * Use the device/inum pair to find the incore inode, and return a pointer
83 * to it. If it is in core, return it, even if it is locked.
86 ufs_ihashlookup(struct ufsmount *ump, cdev_t dev, ino_t inum)
88 struct inode *ip = NULL;
90 for (ip = *INOHASH(ump, inum); ip; ip = ip->i_next) {
91 if (inum == ip->i_number && dev == ip->i_dev)
100 * Use the device/inum pair to find the incore inode, and return a pointer
101 * to it. If it is in core, but locked, wait for it.
103 * This subroutine may block.
106 ufs_ihashget(struct ufsmount *ump, cdev_t dev, ino_t inum)
112 for (ip = *INOHASH(ump, inum); ip; ip = ip->i_next) {
113 if (inum != ip->i_number || dev != ip->i_dev)
116 if (vget(vp, LK_EXCLUSIVE))
119 * We must check to see if the inode has been ripped
120 * out from under us after blocking.
122 for (ip = *INOHASH(ump, inum); ip; ip = ip->i_next) {
123 if (inum == ip->i_number && dev == ip->i_dev)
126 if (ip == NULL || ITOV(ip) != vp) {
136 * Check to see if an inode is in the hash table. This is used to interlock
137 * file free operations to ensure that the vnode is not reused due to a
138 * reallocate of its inode number before we have had a chance to recycle it.
141 ufs_ihashcheck(struct ufsmount *ump, cdev_t dev, ino_t inum)
145 for (ip = *INOHASH(ump, inum); ip; ip = ip->i_next) {
146 if (inum == ip->i_number && dev == ip->i_dev)
153 * Insert the inode into the hash table, and return it locked.
156 ufs_ihashins(struct ufsmount *ump, struct inode *ip)
161 KKASSERT((ip->i_flag & IN_HASHED) == 0);
162 ipp = INOHASH(ump, ip->i_number);
163 while ((iq = *ipp) != NULL) {
164 if (ip->i_dev == iq->i_dev && ip->i_number == iq->i_number) {
171 ip->i_flag |= IN_HASHED;
176 * Remove the inode from the hash table.
179 ufs_ihashrem(struct ufsmount *ump, struct inode *ip)
184 if (ip->i_flag & IN_HASHED) {
185 ipp = INOHASH(ump, ip->i_number);
186 while ((iq = *ipp) != NULL) {
194 ip->i_flag &= ~IN_HASHED;