sys/fs/filecorefs/filecore_node.c

   1 /*      $NetBSD: filecore_node.c,v 1.18 2009/03/14 15:36:21 dsl 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.18 2009/03/14 15:36:21 dsl 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 #include <sys/simplelock.h>
  85
  86 #include <fs/filecorefs/filecore.h>
  87 #include <fs/filecorefs/filecore_extern.h>
  88 #include <fs/filecorefs/filecore_node.h>
  89 #include <fs/filecorefs/filecore_mount.h>
  90
  91 /*
  92  * Structures associated with filecore_node caching.
  93  */
  94 LIST_HEAD(ihashhead, filecore_node) *filecorehashtbl;
  95 u_long filecorehash;
  96 #define INOHASH(device, inum)   (((device) + ((inum)>>12)) & filecorehash)
  97 struct simplelock filecore_ihash_slock;
  98
  99 struct pool filecore_node_pool;
 100
 101 extern int prtactive;   /* 1 => print out reclaim of active vnodes */
 102
 103 /*
 104  * Initialize hash links for inodes and dnodes.
 105  */
 106 void
 107 filecore_init(void)
 108 {
 109
 110         malloc_type_attach(M_FILECOREMNT);
 111         malloc_type_attach(M_FILECORETMP);
 112         pool_init(&filecore_node_pool, sizeof(struct filecore_node), 0, 0, 0,
 113             "filecrnopl", &pool_allocator_nointr, IPL_NONE);
 114         filecorehashtbl = hashinit(desiredvnodes, HASH_LIST, true,
 115             &filecorehash);
 116         simple_lock_init(&filecore_ihash_slock);
 117 }
 118
 119 /*
 120  * Reinitialize inode hash table.
 121  */
 122 void
 123 filecore_reinit(void)
 124 {
 125         struct filecore_node *ip;
 126         struct ihashhead *oldhash, *hash;
 127         u_long oldmask, mask, val;
 128         int i;
 129
 130         hash = hashinit(desiredvnodes, HASH_LIST, true, &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, HASH_LIST, oldmask);
 146 }
 147
 148 /*
 149  * Destroy node pool and hash table.
 150  */
 151 void
 152 filecore_done(void)
 153 {
 154         hashdone(filecorehashtbl, HASH_LIST, filecorehash);
 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_t dev, 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                         mutex_enter(&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(struct filecore_node *ip)
 191 {
 192         struct ihashhead *ipp;
 193         struct vnode *vp;
 194
 195         simple_lock(&filecore_ihash_slock);
 196         ipp = &filecorehashtbl[INOHASH(ip->i_dev, ip->i_number)];
 197         LIST_INSERT_HEAD(ipp, ip, i_hash);
 198         simple_unlock(&filecore_ihash_slock);
 199
 200         vp = ip->i_vnode;
 201         vlockmgr(&vp->v_lock, LK_EXCLUSIVE);
 202 }
 203
 204 /*
 205  * Remove the inode from the hash table.
 206  */
 207 void
 208 filecore_ihashrem(struct filecore_node *ip)
 209 {
 210         simple_lock(&filecore_ihash_slock);
 211         LIST_REMOVE(ip, i_hash);
 212         simple_unlock(&filecore_ihash_slock);
 213 }
 214
 215 /*
 216  * Last reference to an inode, write the inode out and if necessary,
 217  * truncate and deallocate the file.
 218  */
 219 int
 220 filecore_inactive(void *v)
 221 {
 222         struct vop_inactive_args /* {
 223                 struct vnode *a_vp;
 224                 bool *a_recycle;
 225         } */ *ap = v;
 226         struct vnode *vp = ap->a_vp;
 227         struct filecore_node *ip = VTOI(vp);
 228         int error = 0;
 229
 230         /*
 231          * If we are done with the inode, reclaim it
 232          * so that it can be reused immediately.
 233          */
 234         ip->i_flag = 0;
 235         *ap->a_recycle = (filecore_staleinode(ip) != 0);
 236         VOP_UNLOCK(vp, 0);
 237         return error;
 238 }
 239
 240 /*
 241  * Reclaim an inode so that it can be used for other purposes.
 242  */
 243 int
 244 filecore_reclaim(void *v)
 245 {
 246         struct vop_reclaim_args /* {
 247                 struct vnode *a_vp;
 248                 struct lwp *a_l;
 249         } */ *ap = v;
 250         struct vnode *vp = ap->a_vp;
 251         struct filecore_node *ip = VTOI(vp);
 252
 253         if (prtactive && vp->v_usecount > 1)
 254                 vprint("filecore_reclaim: pushing active", vp);
 255         /*
 256          * Remove the inode from its hash chain.
 257          */
 258         filecore_ihashrem(ip);
 259         /*
 260          * Purge old data structures associated with the inode.
 261          */
 262         cache_purge(vp);
 263         if (ip->i_devvp) {
 264                 vrele(ip->i_devvp);
 265                 ip->i_devvp = 0;
 266         }
 267         genfs_node_destroy(vp);
 268         pool_put(&filecore_node_pool, vp->v_data);
 269         vp->v_data = NULL;
 270         return (0);
 271 }