filecore_node.c revision 1.2 1 /* $NetBSD: filecore_node.c,v 1.2 2003/08/07 16:31:37 agc Exp $ */
2
3 /*-
4 * Copyright (c) 1982, 1986, 1989, 1994
5 * The Regents of the University of California.
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the name of the University nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
19 *
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 * SUCH DAMAGE.
31 *
32 * filecore_node.c 1.0 1998/6/4
33 */
34
35 /*-
36 * Copyright (c) 1998 Andrew McMurry
37 *
38 * Redistribution and use in source and binary forms, with or without
39 * modification, are permitted provided that the following conditions
40 * are met:
41 * 1. Redistributions of source code must retain the above copyright
42 * notice, this list of conditions and the following disclaimer.
43 * 2. Redistributions in binary form must reproduce the above copyright
44 * notice, this list of conditions and the following disclaimer in the
45 * documentation and/or other materials provided with the distribution.
46 * 3. All advertising materials mentioning features or use of this software
47 * must display the following acknowledgement:
48 * This product includes software developed by the University of
49 * California, Berkeley and its contributors.
50 * 4. Neither the name of the University nor the names of its contributors
51 * may be used to endorse or promote products derived from this software
52 * without specific prior written permission.
53 *
54 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
55 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
56 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
57 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
58 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
59 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
60 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
61 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
62 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
63 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
64 * SUCH DAMAGE.
65 *
66 * filecore_node.c 1.0 1998/6/4
67 */
68
69 #include <sys/cdefs.h>
70 __KERNEL_RCSID(0, "$NetBSD: filecore_node.c,v 1.2 2003/08/07 16:31:37 agc Exp $");
71
72 #include <sys/param.h>
73 #include <sys/systm.h>
74 #include <sys/mount.h>
75 #include <sys/proc.h>
76 #include <sys/file.h>
77 #include <sys/buf.h>
78 #include <sys/vnode.h>
79 #include <sys/namei.h>
80 #include <sys/kernel.h>
81 #include <sys/malloc.h>
82 #include <sys/pool.h>
83 #include <sys/stat.h>
84
85 #include <fs/filecorefs/filecore.h>
86 #include <fs/filecorefs/filecore_extern.h>
87 #include <fs/filecorefs/filecore_node.h>
88 #include <fs/filecorefs/filecore_mount.h>
89
90 /*
91 * Structures associated with filecore_node caching.
92 */
93 LIST_HEAD(ihashhead, filecore_node) *filecorehashtbl;
94 u_long filecorehash;
95 #define INOHASH(device, inum) (((device) + ((inum)>>12)) & filecorehash)
96 struct simplelock filecore_ihash_slock;
97
98 struct pool filecore_node_pool;
99
100 extern int prtactive; /* 1 => print out reclaim of active vnodes */
101
102 /*
103 * Initialize hash links for inodes and dnodes.
104 */
105 void
106 filecore_init()
107 {
108 filecorehashtbl = hashinit(desiredvnodes, HASH_LIST, M_FILECOREMNT,
109 M_WAITOK, &filecorehash);
110 simple_lock_init(&filecore_ihash_slock);
111 pool_init(&filecore_node_pool, sizeof(struct filecore_node),
112 0, 0, 0, "filecrnopl", &pool_allocator_nointr);
113 }
114
115 /*
116 * Reinitialize inode hash table.
117 */
118 void
119 filecore_reinit()
120 {
121 struct filecore_node *ip;
122 struct ihashhead *oldhash, *hash;
123 u_long oldmask, mask, val;
124 int i;
125
126 hash = hashinit(desiredvnodes, HASH_LIST, M_FILECOREMNT, M_WAITOK,
127 &mask);
128
129 simple_lock(&filecore_ihash_slock);
130 oldhash = filecorehashtbl;
131 oldmask = filecorehash;
132 filecorehashtbl = hash;
133 filecorehash = mask;
134 for (i = 0; i <= oldmask; i++) {
135 while ((ip = LIST_FIRST(&oldhash[i])) != NULL) {
136 LIST_REMOVE(ip, i_hash);
137 val = INOHASH(ip->i_dev, ip->i_number);
138 LIST_INSERT_HEAD(&hash[val], ip, i_hash);
139 }
140 }
141 simple_unlock(&filecore_ihash_slock);
142 hashdone(oldhash, M_FILECOREMNT);
143 }
144
145 /*
146 * Destroy node pool and hash table.
147 */
148 void
149 filecore_done()
150 {
151 pool_destroy(&filecore_node_pool);
152 hashdone(filecorehashtbl, M_FILECOREMNT);
153 }
154
155 /*
156 * Use the device/inum pair to find the incore inode, and return a pointer
157 * to it. If it is in core, but locked, wait for it.
158 */
159 struct vnode *
160 filecore_ihashget(dev, inum)
161 dev_t dev;
162 ino_t inum;
163 {
164 struct filecore_node *ip;
165 struct vnode *vp;
166
167 loop:
168 simple_lock(&filecore_ihash_slock);
169 LIST_FOREACH(ip, &filecorehashtbl[INOHASH(dev, inum)], i_hash) {
170 if (inum == ip->i_number && dev == ip->i_dev) {
171 vp = ITOV(ip);
172 simple_lock(&vp->v_interlock);
173 simple_unlock(&filecore_ihash_slock);
174 if (vget(vp, LK_EXCLUSIVE | LK_INTERLOCK))
175 goto loop;
176 return (vp);
177 }
178 }
179 simple_unlock(&filecore_ihash_slock);
180 return (NULL);
181 }
182
183 /*
184 * Insert the inode into the hash table, and return it locked.
185 */
186 void
187 filecore_ihashins(ip)
188 struct filecore_node *ip;
189 {
190 struct ihashhead *ipp;
191 struct vnode *vp;
192
193 simple_lock(&filecore_ihash_slock);
194 ipp = &filecorehashtbl[INOHASH(ip->i_dev, ip->i_number)];
195 LIST_INSERT_HEAD(ipp, ip, i_hash);
196 simple_unlock(&filecore_ihash_slock);
197
198 vp = ip->i_vnode;
199 lockmgr(&vp->v_lock, LK_EXCLUSIVE, &vp->v_interlock);
200 }
201
202 /*
203 * Remove the inode from the hash table.
204 */
205 void
206 filecore_ihashrem(ip)
207 struct filecore_node *ip;
208 {
209 simple_lock(&filecore_ihash_slock);
210 LIST_REMOVE(ip, i_hash);
211 simple_unlock(&filecore_ihash_slock);
212 }
213
214 /*
215 * Last reference to an inode, write the inode out and if necessary,
216 * truncate and deallocate the file.
217 */
218 int
219 filecore_inactive(v)
220 void *v;
221 {
222 struct vop_inactive_args /* {
223 struct vnode *a_vp;
224 struct proc *a_p;
225 } */ *ap = v;
226 struct vnode *vp = ap->a_vp;
227 struct proc *p = ap->a_p;
228 struct filecore_node *ip = VTOI(vp);
229 int error = 0;
230
231 if (prtactive && vp->v_usecount != 0)
232 vprint("filecore_inactive: pushing active", vp);
233
234 ip->i_flag = 0;
235 VOP_UNLOCK(vp, 0);
236 /*
237 * If we are done with the inode, reclaim it
238 * so that it can be reused immediately.
239 */
240 if (filecore_staleinode(ip))
241 vrecycle(vp, (struct simplelock *)0, p);
242 return error;
243 }
244
245 /*
246 * Reclaim an inode so that it can be used for other purposes.
247 */
248 int
249 filecore_reclaim(v)
250 void *v;
251 {
252 struct vop_reclaim_args /* {
253 struct vnode *a_vp;
254 struct proc *a_p;
255 } */ *ap = v;
256 struct vnode *vp = ap->a_vp;
257 struct filecore_node *ip = VTOI(vp);
258
259 if (prtactive && vp->v_usecount != 0)
260 vprint("filecore_reclaim: pushing active", vp);
261 /*
262 * Remove the inode from its hash chain.
263 */
264 filecore_ihashrem(ip);
265 /*
266 * Purge old data structures associated with the inode.
267 */
268 cache_purge(vp);
269 if (ip->i_devvp) {
270 vrele(ip->i_devvp);
271 ip->i_devvp = 0;
272 }
273 pool_put(&filecore_node_pool, vp->v_data);
274 vp->v_data = NULL;
275 return (0);
276 }
277