Drop GCC < 1 support, simplify inline assembly and use proper #error for
[dragonfly.git] / sys / vfs / ufs / ufs_ihash.c
CommitLineData
984263bc
MD
1/*
2 * Copyright (c) 1982, 1986, 1989, 1991, 1993, 1995
3 * The Regents of the University of California. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
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.
20 *
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
31 * SUCH DAMAGE.
32 *
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 $
b1f7dd27 35 * $DragonFly: src/sys/vfs/ufs/ufs_ihash.c,v 1.15 2005/01/20 18:08:54 dillon Exp $
984263bc
MD
36 */
37
38#include <sys/param.h>
39#include <sys/systm.h>
40#include <sys/kernel.h>
41#include <sys/lock.h>
42#include <sys/vnode.h>
43#include <sys/malloc.h>
44#include <sys/proc.h>
45
1f2de5d4
MD
46#include "quota.h"
47#include "inode.h"
48#include "ufs_extern.h"
984263bc
MD
49
50static MALLOC_DEFINE(M_UFSIHASH, "UFS ihash", "UFS Inode hash tables");
51/*
52 * Structures associated with inode cacheing.
53 */
3446c007 54static struct inode **ihashtbl;
984263bc 55static u_long ihash; /* size of hash table - 1 */
8a8d5d85 56static struct lwkt_token ufs_ihash_token;
984263bc 57
3446c007
MD
58#define INOHASH(device, inum) (&ihashtbl[(minor(device) + (inum)) & ihash])
59
984263bc
MD
60/*
61 * Initialize inode hash table.
62 */
63void
0973c589 64ufs_ihashinit(void)
984263bc 65{
3446c007
MD
66 ihash = 16;
67 while (ihash < desiredvnodes)
68 ihash <<= 1;
69 ihashtbl = malloc(sizeof(void *) * ihash, M_UFSIHASH, M_WAITOK|M_ZERO);
70 --ihash;
41a01a4d 71 lwkt_token_init(&ufs_ihash_token);
984263bc
MD
72}
73
74/*
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.
77 */
78struct vnode *
0973c589 79ufs_ihashlookup(dev_t dev, ino_t inum)
984263bc
MD
80{
81 struct inode *ip;
41a01a4d 82 lwkt_tokref ilock;
984263bc 83
41a01a4d 84 lwkt_gettoken(&ilock, &ufs_ihash_token);
3446c007 85 for (ip = *INOHASH(dev, inum); ip; ip = ip->i_next) {
984263bc
MD
86 if (inum == ip->i_number && dev == ip->i_dev)
87 break;
1bfd75da 88 }
41a01a4d 89 lwkt_reltoken(&ilock);
984263bc
MD
90 if (ip)
91 return (ITOV(ip));
92 return (NULLVP);
93}
94
95/*
96 * Use the device/inum pair to find the incore inode, and return a pointer
97 * to it. If it is in core, but locked, wait for it.
4954c633 98 *
41a01a4d
MD
99 * Note that the serializing tokens do not prevent other processes from
100 * playing with the data structure being protected while we are blocked.
101 * They do protect us from preemptive interrupts which might try to
102 * play with the protected data structure.
984263bc
MD
103 */
104struct vnode *
dadab5e9 105ufs_ihashget(dev_t dev, ino_t inum)
984263bc 106{
dadab5e9 107 struct thread *td = curthread; /* XXX */
41a01a4d 108 lwkt_tokref ilock;
984263bc
MD
109 struct inode *ip;
110 struct vnode *vp;
111
41a01a4d 112 lwkt_gettoken(&ilock, &ufs_ihash_token);
984263bc 113loop:
3446c007 114 for (ip = *INOHASH(dev, inum); ip; ip = ip->i_next) {
41a01a4d
MD
115 if (inum != ip->i_number || dev != ip->i_dev)
116 continue;
117 vp = ITOV(ip);
5fd012e0
MD
118 if (vget(vp, LK_EXCLUSIVE, td))
119 goto loop;
41a01a4d
MD
120 /*
121 * We must check to see if the inode has been ripped
122 * out from under us after blocking.
123 */
3446c007 124 for (ip = *INOHASH(dev, inum); ip; ip = ip->i_next) {
41a01a4d
MD
125 if (inum == ip->i_number && dev == ip->i_dev)
126 break;
984263bc 127 }
41a01a4d 128 if (ip == NULL || ITOV(ip) != vp) {
5fd012e0 129 vput(vp);
41a01a4d
MD
130 goto loop;
131 }
41a01a4d
MD
132 lwkt_reltoken(&ilock);
133 return (vp);
984263bc 134 }
41a01a4d 135 lwkt_reltoken(&ilock);
984263bc
MD
136 return (NULL);
137}
138
b1f7dd27
MD
139/*
140 * Check to see if an inode is in the hash table. This is used to interlock
141 * file free operations to ensure that the vnode is not reused due to a
142 * reallocate of its inode number before we have had a chance to recycle it.
143 */
144int
145ufs_ihashcheck(dev_t dev, ino_t inum)
146{
147 lwkt_tokref ilock;
148 struct inode *ip;
149
150 lwkt_gettoken(&ilock, &ufs_ihash_token);
151 for (ip = *INOHASH(dev, inum); ip; ip = ip->i_next) {
152 if (inum == ip->i_number && dev == ip->i_dev) {
153 if (ip->i_vnode) {
154 printf("conflict with vnode %p", ip->i_vnode);
155 if (TAILQ_FIRST(&ip->i_vnode->v_namecache))
156 printf(" ncp %s", TAILQ_FIRST(&ip->i_vnode->v_namecache)->nc_name);
157 printf("\n");
158 }
159 break;
160 }
161 }
162 lwkt_reltoken(&ilock);
163 return(ip ? 1 : 0);
164}
165
984263bc
MD
166/*
167 * Insert the inode into the hash table, and return it locked.
168 */
3446c007 169int
dadab5e9 170ufs_ihashins(struct inode *ip)
984263bc 171{
3446c007
MD
172 struct inode **ipp;
173 struct inode *iq;
41a01a4d 174 lwkt_tokref ilock;
984263bc 175
3446c007 176 KKASSERT((ip->i_flag & IN_HASHED) == 0);
41a01a4d 177 lwkt_gettoken(&ilock, &ufs_ihash_token);
984263bc 178 ipp = INOHASH(ip->i_dev, ip->i_number);
3446c007
MD
179 while ((iq = *ipp) != NULL) {
180 if (ip->i_dev == iq->i_dev && ip->i_number == iq->i_number) {
181 lwkt_reltoken(&ilock);
182 return(EBUSY);
183 }
184 ipp = &iq->i_next;
185 }
186 ip->i_next = NULL;
187 *ipp = ip;
984263bc 188 ip->i_flag |= IN_HASHED;
41a01a4d 189 lwkt_reltoken(&ilock);
3446c007 190 return(0);
984263bc
MD
191}
192
193/*
194 * Remove the inode from the hash table.
195 */
196void
0973c589 197ufs_ihashrem(struct inode *ip)
984263bc 198{
41a01a4d 199 lwkt_tokref ilock;
3446c007
MD
200 struct inode **ipp;
201 struct inode *iq;
41a01a4d
MD
202
203 lwkt_gettoken(&ilock, &ufs_ihash_token);
984263bc 204 if (ip->i_flag & IN_HASHED) {
3446c007
MD
205 ipp = INOHASH(ip->i_dev, ip->i_number);
206 while ((iq = *ipp) != NULL) {
207 if (ip == iq)
208 break;
209 ipp = &iq->i_next;
210 }
211 KKASSERT(ip == iq);
212 *ipp = ip->i_next;
213 ip->i_next = NULL;
984263bc 214 ip->i_flag &= ~IN_HASHED;
984263bc 215 }
41a01a4d 216 lwkt_reltoken(&ilock);
984263bc 217}
3446c007 218