filecore_node.c revision 1.11 1 /* $NetBSD: filecore_node.c,v 1.11 2007/09/24 00:42:12 rumble 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.11 2007/09/24 00:42:12 rumble 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
109 malloc_type_attach(M_FILECOREMNT);
110 malloc_type_attach(M_FILECORETMP);
111 pool_init(&filecore_node_pool, sizeof(struct filecore_node), 0, 0, 0,
112 "filecrnopl", &pool_allocator_nointr, IPL_NONE);
113 filecorehashtbl = hashinit(desiredvnodes, HASH_LIST, M_FILECOREMNT,
114 M_WAITOK, &filecorehash);
115 simple_lock_init(&filecore_ihash_slock);
116 }
117
118 /*
119 * Reinitialize inode hash table.
120 */
121 void
122 filecore_reinit()
123 {
124 struct filecore_node *ip;
125 struct ihashhead *oldhash, *hash;
126 u_long oldmask, mask, val;
127 int i;
128
129 hash = hashinit(desiredvnodes, HASH_LIST, M_FILECOREMNT, M_WAITOK,
130 &mask);
131
132 simple_lock(&filecore_ihash_slock);
133 oldhash = filecorehashtbl;
134 oldmask = filecorehash;
135 filecorehashtbl = hash;
136 filecorehash = mask;
137 for (i = 0; i <= oldmask; i++) {
138 while ((ip = LIST_FIRST(&oldhash[i])) != NULL) {
139 LIST_REMOVE(ip, i_hash);
140 val = INOHASH(ip->i_dev, ip->i_number);
141 LIST_INSERT_HEAD(&hash[val], ip, i_hash);
142 }
143 }
144 simple_unlock(&filecore_ihash_slock);
145 hashdone(oldhash, M_FILECOREMNT);
146 }
147
148 /*
149 * Destroy node pool and hash table.
150 */
151 void
152 filecore_done()
153 {
154 hashdone(filecorehashtbl, M_FILECOREMNT);
155 pool_destroy(&filecore_node_pool);
156 malloc_type_detach(M_FILECORETMP);
157 malloc_type_detach(M_FILECOREMNT);
158 }
159
160 /*
161 * Use the device/inum pair to find the incore inode, and return a pointer
162 * to it. If it is in core, but locked, wait for it.
163 */
164 struct vnode *
165 filecore_ihashget(dev, inum)
166 dev_t dev;
167 ino_t inum;
168 {
169 struct filecore_node *ip;
170 struct vnode *vp;
171
172 loop:
173 simple_lock(&filecore_ihash_slock);
174 LIST_FOREACH(ip, &filecorehashtbl[INOHASH(dev, inum)], i_hash) {
175 if (inum == ip->i_number && dev == ip->i_dev) {
176 vp = ITOV(ip);
177 simple_lock(&vp->v_interlock);
178 simple_unlock(&filecore_ihash_slock);
179 if (vget(vp, LK_EXCLUSIVE | LK_INTERLOCK))
180 goto loop;
181 return (vp);
182 }
183 }
184 simple_unlock(&filecore_ihash_slock);
185 return (NULL);
186 }
187
188 /*
189 * Insert the inode into the hash table, and return it locked.
190 */
191 void
192 filecore_ihashins(ip)
193 struct filecore_node *ip;
194 {
195 struct ihashhead *ipp;
196 struct vnode *vp;
197
198 simple_lock(&filecore_ihash_slock);
199 ipp = &filecorehashtbl[INOHASH(ip->i_dev, ip->i_number)];
200 LIST_INSERT_HEAD(ipp, ip, i_hash);
201 simple_unlock(&filecore_ihash_slock);
202
203 vp = ip->i_vnode;
204 lockmgr(&vp->v_lock, LK_EXCLUSIVE, &vp->v_interlock);
205 }
206
207 /*
208 * Remove the inode from the hash table.
209 */
210 void
211 filecore_ihashrem(ip)
212 struct filecore_node *ip;
213 {
214 simple_lock(&filecore_ihash_slock);
215 LIST_REMOVE(ip, i_hash);
216 simple_unlock(&filecore_ihash_slock);
217 }
218
219 /*
220 * Last reference to an inode, write the inode out and if necessary,
221 * truncate and deallocate the file.
222 */
223 int
224 filecore_inactive(v)
225 void *v;
226 {
227 struct vop_inactive_args /* {
228 struct vnode *a_vp;
229 struct lwp *a_l;
230 } */ *ap = v;
231 struct vnode *vp = ap->a_vp;
232 struct lwp *l = ap->a_l;
233 struct filecore_node *ip = VTOI(vp);
234 int error = 0;
235
236 if (prtactive && vp->v_usecount != 0)
237 vprint("filecore_inactive: pushing active", vp);
238
239 ip->i_flag = 0;
240 VOP_UNLOCK(vp, 0);
241 /*
242 * If we are done with the inode, reclaim it
243 * so that it can be reused immediately.
244 */
245 if (filecore_staleinode(ip))
246 vrecycle(vp, (struct simplelock *)0, l);
247 return error;
248 }
249
250 /*
251 * Reclaim an inode so that it can be used for other purposes.
252 */
253 int
254 filecore_reclaim(v)
255 void *v;
256 {
257 struct vop_reclaim_args /* {
258 struct vnode *a_vp;
259 struct lwp *a_l;
260 } */ *ap = v;
261 struct vnode *vp = ap->a_vp;
262 struct filecore_node *ip = VTOI(vp);
263
264 if (prtactive && vp->v_usecount != 0)
265 vprint("filecore_reclaim: pushing active", vp);
266 /*
267 * Remove the inode from its hash chain.
268 */
269 filecore_ihashrem(ip);
270 /*
271 * Purge old data structures associated with the inode.
272 */
273 cache_purge(vp);
274 if (ip->i_devvp) {
275 vrele(ip->i_devvp);
276 ip->i_devvp = 0;
277 }
278 genfs_node_destroy(vp);
279 pool_put(&filecore_node_pool, vp->v_data);
280 vp->v_data = NULL;
281 return (0);
282 }
283