1 /* $NetBSD: vfs_cache.c,v 1.10 1994/12/13 09:14:34 mycroft Exp $ */ 2 3 /* 4 * Copyright (c) 1989, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. All advertising materials mentioning features or use of this software 16 * must display the following acknowledgement: 17 * This product includes software developed by the University of 18 * California, Berkeley and its contributors. 19 * 4. Neither the name of the University nor the names of its contributors 20 * may be used to endorse or promote products derived from this software 21 * without specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 * 35 * @(#)vfs_cache.c 8.3 (Berkeley) 8/22/94 36 */ 37 38 #include <sys/param.h> 39 #include <sys/systm.h> 40 #include <sys/time.h> 41 #include <sys/mount.h> 42 #include <sys/vnode.h> 43 #include <sys/namei.h> 44 #include <sys/errno.h> 45 #include <sys/malloc.h> 46 47 /* 48 * Name caching works as follows: 49 * 50 * Names found by directory scans are retained in a cache 51 * for future reference. It is managed LRU, so frequently 52 * used names will hang around. Cache is indexed by hash value 53 * obtained from (vp, name) where vp refers to the directory 54 * containing name. 55 * 56 * For simplicity (and economy of storage), names longer than 57 * a maximum length of NCHNAMLEN are not cached; they occur 58 * infrequently in any case, and are almost never of interest. 59 * 60 * Upon reaching the last segment of a path, if the reference 61 * is for DELETE, or NOCACHE is set (rewrite), and the 62 * name is located in the cache, it will be dropped. 63 */ 64 65 /* 66 * Structures associated with name cacheing. 67 */ 68 LIST_HEAD(nchashhead, namecache) *nchashtbl; 69 u_long nchash; /* size of hash table - 1 */ 70 long numcache; /* number of cache entries allocated */ 71 TAILQ_HEAD(, namecache) nclruhead; /* LRU chain */ 72 struct nchstats nchstats; /* cache effectiveness statistics */ 73 74 int doingcache = 1; /* 1 => enable the cache */ 75 76 /* 77 * Look for a the name in the cache. We don't do this 78 * if the segment name is long, simply so the cache can avoid 79 * holding long names (which would either waste space, or 80 * add greatly to the complexity). 81 * 82 * Lookup is called with ni_dvp pointing to the directory to search, 83 * ni_ptr pointing to the name of the entry being sought, ni_namelen 84 * tells the length of the name, and ni_hash contains a hash of 85 * the name. If the lookup succeeds, the vnode is returned in ni_vp 86 * and a status of -1 is returned. If the lookup determines that 87 * the name does not exist (negative cacheing), a status of ENOENT 88 * is returned. If the lookup fails, a status of zero is returned. 89 */ 90 int 91 cache_lookup(dvp, vpp, cnp) 92 struct vnode *dvp; 93 struct vnode **vpp; 94 struct componentname *cnp; 95 { 96 register struct namecache *ncp; 97 register struct nchashhead *ncpp; 98 99 if (!doingcache) { 100 cnp->cn_flags &= ~MAKEENTRY; 101 return (0); 102 } 103 if (cnp->cn_namelen > NCHNAMLEN) { 104 nchstats.ncs_long++; 105 cnp->cn_flags &= ~MAKEENTRY; 106 return (0); 107 } 108 ncpp = &nchashtbl[cnp->cn_hash & nchash]; 109 for (ncp = ncpp->lh_first; ncp != 0; ncp = ncp->nc_hash.le_next) { 110 if (ncp->nc_dvp == dvp && 111 ncp->nc_dvpid == dvp->v_id && 112 ncp->nc_nlen == cnp->cn_namelen && 113 !bcmp(ncp->nc_name, cnp->cn_nameptr, (u_int)ncp->nc_nlen)) 114 break; 115 } 116 if (ncp == 0) { 117 nchstats.ncs_miss++; 118 return (0); 119 } 120 if ((cnp->cn_flags & MAKEENTRY) == 0) { 121 nchstats.ncs_badhits++; 122 } else if (ncp->nc_vp == NULL) { 123 if (cnp->cn_nameiop != CREATE) { 124 nchstats.ncs_neghits++; 125 /* 126 * Move this slot to end of LRU chain, 127 * if not already there. 128 */ 129 if (ncp->nc_lru.tqe_next != 0) { 130 TAILQ_REMOVE(&nclruhead, ncp, nc_lru); 131 TAILQ_INSERT_TAIL(&nclruhead, ncp, nc_lru); 132 } 133 return (ENOENT); 134 } 135 } else if (ncp->nc_vpid != ncp->nc_vp->v_id) { 136 nchstats.ncs_falsehits++; 137 } else { 138 nchstats.ncs_goodhits++; 139 /* 140 * move this slot to end of LRU chain, if not already there 141 */ 142 if (ncp->nc_lru.tqe_next != 0) { 143 TAILQ_REMOVE(&nclruhead, ncp, nc_lru); 144 TAILQ_INSERT_TAIL(&nclruhead, ncp, nc_lru); 145 } 146 *vpp = ncp->nc_vp; 147 return (-1); 148 } 149 150 /* 151 * Last component and we are renaming or deleting, 152 * the cache entry is invalid, or otherwise don't 153 * want cache entry to exist. 154 */ 155 TAILQ_REMOVE(&nclruhead, ncp, nc_lru); 156 LIST_REMOVE(ncp, nc_hash); 157 ncp->nc_hash.le_prev = 0; 158 TAILQ_INSERT_HEAD(&nclruhead, ncp, nc_lru); 159 return (0); 160 } 161 162 /* 163 * Add an entry to the cache 164 */ 165 cache_enter(dvp, vp, cnp) 166 struct vnode *dvp; 167 struct vnode *vp; 168 struct componentname *cnp; 169 { 170 register struct namecache *ncp; 171 register struct nchashhead *ncpp; 172 173 #ifdef DIAGNOSTIC 174 if (cnp->cn_namelen > NCHNAMLEN) 175 panic("cache_enter: name too long"); 176 #endif 177 if (!doingcache) 178 return; 179 /* 180 * Free the cache slot at head of lru chain. 181 */ 182 if (numcache < desiredvnodes) { 183 ncp = (struct namecache *) 184 malloc((u_long)sizeof *ncp, M_CACHE, M_WAITOK); 185 bzero((char *)ncp, sizeof *ncp); 186 numcache++; 187 } else if (ncp = nclruhead.tqh_first) { 188 TAILQ_REMOVE(&nclruhead, ncp, nc_lru); 189 if (ncp->nc_hash.le_prev != 0) { 190 LIST_REMOVE(ncp, nc_hash); 191 ncp->nc_hash.le_prev = 0; 192 } 193 } else 194 return; 195 /* grab the vnode we just found */ 196 ncp->nc_vp = vp; 197 if (vp) 198 ncp->nc_vpid = vp->v_id; 199 else 200 ncp->nc_vpid = 0; 201 /* fill in cache info */ 202 ncp->nc_dvp = dvp; 203 ncp->nc_dvpid = dvp->v_id; 204 ncp->nc_nlen = cnp->cn_namelen; 205 bcopy(cnp->cn_nameptr, ncp->nc_name, (unsigned)ncp->nc_nlen); 206 TAILQ_INSERT_TAIL(&nclruhead, ncp, nc_lru); 207 ncpp = &nchashtbl[cnp->cn_hash & nchash]; 208 LIST_INSERT_HEAD(ncpp, ncp, nc_hash); 209 } 210 211 /* 212 * Name cache initialization, from vfs_init() when we are booting 213 */ 214 nchinit() 215 { 216 217 TAILQ_INIT(&nclruhead); 218 nchashtbl = hashinit(desiredvnodes, M_CACHE, &nchash); 219 } 220 221 /* 222 * Cache flush, a particular vnode; called when a vnode is renamed to 223 * hide entries that would now be invalid 224 */ 225 cache_purge(vp) 226 struct vnode *vp; 227 { 228 struct namecache *ncp; 229 struct nchashhead *ncpp; 230 231 vp->v_id = ++nextvnodeid; 232 if (nextvnodeid != 0) 233 return; 234 for (ncpp = &nchashtbl[nchash]; ncpp >= nchashtbl; ncpp--) { 235 for (ncp = ncpp->lh_first; ncp != 0; ncp = ncp->nc_hash.le_next) { 236 ncp->nc_vpid = 0; 237 ncp->nc_dvpid = 0; 238 } 239 } 240 vp->v_id = ++nextvnodeid; 241 } 242 243 /* 244 * Cache flush, a whole filesystem; called when filesys is umounted to 245 * remove entries that would now be invalid 246 * 247 * The line "nxtcp = nchhead" near the end is to avoid potential problems 248 * if the cache lru chain is modified while we are dumping the 249 * inode. This makes the algorithm O(n^2), but do you think I care? 250 */ 251 cache_purgevfs(mp) 252 struct mount *mp; 253 { 254 register struct namecache *ncp, *nxtcp; 255 256 for (ncp = nclruhead.tqh_first; ncp != 0; ncp = nxtcp) { 257 if (ncp->nc_dvp == NULL || ncp->nc_dvp->v_mount != mp) { 258 nxtcp = ncp->nc_lru.tqe_next; 259 continue; 260 } 261 /* free the resources we had */ 262 ncp->nc_vp = NULL; 263 ncp->nc_dvp = NULL; 264 TAILQ_REMOVE(&nclruhead, ncp, nc_lru); 265 if (ncp->nc_hash.le_prev != 0) { 266 LIST_REMOVE(ncp, nc_hash); 267 ncp->nc_hash.le_prev = 0; 268 } 269 /* cause rescan of list, it may have altered */ 270 nxtcp = nclruhead.tqh_first; 271 TAILQ_INSERT_HEAD(&nclruhead, ncp, nc_lru); 272 } 273 } 274