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