1/*- 2 * Copyright (c) 1989, 1993, 1995 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This code is derived from software contributed to Berkeley by 6 * Poul-Henning Kamp of the FreeBSD Project. 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 * 4. 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 * @(#)vfs_cache.c 8.5 (Berkeley) 3/22/95 33 */ 34 35#include <sys/cdefs.h> 36__FBSDID("$FreeBSD$"); 37 38#include "opt_kdtrace.h" 39#include "opt_ktrace.h" 40 41#include <sys/param.h> 42#include <sys/systm.h> 43#include <sys/filedesc.h> 44#include <sys/fnv_hash.h> 45#include <sys/kernel.h> 46#include <sys/lock.h> 47#include <sys/malloc.h> 48#include <sys/fcntl.h> 49#include <sys/mount.h> 50#include <sys/namei.h> 51#include <sys/proc.h> 52#include <sys/rwlock.h> 53#include <sys/sdt.h> 54#include <sys/syscallsubr.h> 55#include <sys/sysctl.h> 56#include <sys/sysproto.h> 57#include <sys/vnode.h> 58#ifdef KTRACE 59#include <sys/ktrace.h> 60#endif 61 62#include <vm/uma.h> 63 64SDT_PROVIDER_DECLARE(vfs); 65SDT_PROBE_DEFINE3(vfs, namecache, enter, done, "struct vnode *", "char *", 66 "struct vnode *"); 67SDT_PROBE_DEFINE2(vfs, namecache, enter_negative, done, "struct vnode *", 68 "char *"); 69SDT_PROBE_DEFINE1(vfs, namecache, fullpath, entry, "struct vnode *"); 70SDT_PROBE_DEFINE3(vfs, namecache, fullpath, hit, "struct vnode *", 71 "char *", "struct vnode *"); 72SDT_PROBE_DEFINE1(vfs, namecache, fullpath, miss, "struct vnode *"); 73SDT_PROBE_DEFINE3(vfs, namecache, fullpath, return, "int", 74 "struct vnode *", "char *"); 75SDT_PROBE_DEFINE3(vfs, namecache, lookup, hit, "struct vnode *", "char *", 76 "struct vnode *"); 77SDT_PROBE_DEFINE2(vfs, namecache, lookup, hit__negative, 78 "struct vnode *", "char *"); 79SDT_PROBE_DEFINE2(vfs, namecache, lookup, miss, "struct vnode *", 80 "char *"); 81SDT_PROBE_DEFINE1(vfs, namecache, purge, done, "struct vnode *"); 82SDT_PROBE_DEFINE1(vfs, namecache, purge_negative, done, "struct vnode *"); 83SDT_PROBE_DEFINE1(vfs, namecache, purgevfs, done, "struct mount *"); 84SDT_PROBE_DEFINE3(vfs, namecache, zap, done, "struct vnode *", "char *", 85 "struct vnode *"); 86SDT_PROBE_DEFINE2(vfs, namecache, zap_negative, done, "struct vnode *", 87 "char *"); 88 89/* 90 * This structure describes the elements in the cache of recent 91 * names looked up by namei. 92 */ 93 94struct namecache { 95 LIST_ENTRY(namecache) nc_hash; /* hash chain */ 96 LIST_ENTRY(namecache) nc_src; /* source vnode list */ 97 TAILQ_ENTRY(namecache) nc_dst; /* destination vnode list */ 98 struct vnode *nc_dvp; /* vnode of parent of name */ 99 struct vnode *nc_vp; /* vnode the name refers to */ 100 u_char nc_flag; /* flag bits */ 101 u_char nc_nlen; /* length of name */ 102 char nc_name[0]; /* segment name + nul */ 103}; 104 105/* 106 * struct namecache_ts repeats struct namecache layout up to the 107 * nc_nlen member. 108 * struct namecache_ts is used in place of struct namecache when time(s) need 109 * to be stored. The nc_dotdottime field is used when a cache entry is mapping 110 * both a non-dotdot directory name plus dotdot for the directory's 111 * parent. 112 */ 113struct namecache_ts { 114 LIST_ENTRY(namecache) nc_hash; /* hash chain */ 115 LIST_ENTRY(namecache) nc_src; /* source vnode list */ 116 TAILQ_ENTRY(namecache) nc_dst; /* destination vnode list */ 117 struct vnode *nc_dvp; /* vnode of parent of name */ 118 struct vnode *nc_vp; /* vnode the name refers to */ 119 u_char nc_flag; /* flag bits */ 120 u_char nc_nlen; /* length of name */ 121 struct timespec nc_time; /* timespec provided by fs */ 122 struct timespec nc_dotdottime; /* dotdot timespec provided by fs */ 123 int nc_ticks; /* ticks value when entry was added */ 124 char nc_name[0]; /* segment name + nul */ 125}; 126 127/* 128 * Flags in namecache.nc_flag 129 */ 130#define NCF_WHITE 0x01 131#define NCF_ISDOTDOT 0x02 132#define NCF_TS 0x04 133#define NCF_DTS 0x08 134 135/* 136 * Name caching works as follows: 137 * 138 * Names found by directory scans are retained in a cache 139 * for future reference. It is managed LRU, so frequently 140 * used names will hang around. Cache is indexed by hash value 141 * obtained from (vp, name) where vp refers to the directory 142 * containing name. 143 * 144 * If it is a "negative" entry, (i.e. for a name that is known NOT to 145 * exist) the vnode pointer will be NULL. 146 * 147 * Upon reaching the last segment of a path, if the reference 148 * is for DELETE, or NOCACHE is set (rewrite), and the 149 * name is located in the cache, it will be dropped. 150 */ 151 152/* 153 * Structures associated with name cacheing. 154 */ 155#define NCHHASH(hash) \ 156 (&nchashtbl[(hash) & nchash]) 157static LIST_HEAD(nchashhead, namecache) *nchashtbl; /* Hash Table */ 158static TAILQ_HEAD(, namecache) ncneg; /* Hash Table */ 159static u_long nchash; /* size of hash table */ 160SYSCTL_ULONG(_debug, OID_AUTO, nchash, CTLFLAG_RD, &nchash, 0, 161 "Size of namecache hash table"); 162static u_long ncnegfactor = 16; /* ratio of negative entries */ 163SYSCTL_ULONG(_vfs, OID_AUTO, ncnegfactor, CTLFLAG_RW, &ncnegfactor, 0, 164 "Ratio of negative namecache entries"); 165static u_long numneg; /* number of negative entries allocated */ 166SYSCTL_ULONG(_debug, OID_AUTO, numneg, CTLFLAG_RD, &numneg, 0, 167 "Number of negative entries in namecache"); 168static u_long numcache; /* number of cache entries allocated */ 169SYSCTL_ULONG(_debug, OID_AUTO, numcache, CTLFLAG_RD, &numcache, 0, 170 "Number of namecache entries"); 171static u_long numcachehv; /* number of cache entries with vnodes held */ 172SYSCTL_ULONG(_debug, OID_AUTO, numcachehv, CTLFLAG_RD, &numcachehv, 0, 173 "Number of namecache entries with vnodes held"); 174static u_int ncsizefactor = 2; 175SYSCTL_UINT(_vfs, OID_AUTO, ncsizefactor, CTLFLAG_RW, &ncsizefactor, 0, 176 "Size factor for namecache"); 177 178struct nchstats nchstats; /* cache effectiveness statistics */ 179 180static struct rwlock cache_lock; 181RW_SYSINIT(vfscache, &cache_lock, "Name Cache"); 182 183#define CACHE_UPGRADE_LOCK() rw_try_upgrade(&cache_lock) 184#define CACHE_RLOCK() rw_rlock(&cache_lock) 185#define CACHE_RUNLOCK() rw_runlock(&cache_lock) 186#define CACHE_WLOCK() rw_wlock(&cache_lock) 187#define CACHE_WUNLOCK() rw_wunlock(&cache_lock) 188 189/* 190 * UMA zones for the VFS cache. 191 * 192 * The small cache is used for entries with short names, which are the 193 * most common. The large cache is used for entries which are too big to 194 * fit in the small cache. 195 */ 196static uma_zone_t cache_zone_small; 197static uma_zone_t cache_zone_small_ts; 198static uma_zone_t cache_zone_large; 199static uma_zone_t cache_zone_large_ts; 200 201#define CACHE_PATH_CUTOFF 35 202 203static struct namecache * 204cache_alloc(int len, int ts) 205{ 206 207 if (len > CACHE_PATH_CUTOFF) { 208 if (ts) 209 return (uma_zalloc(cache_zone_large_ts, M_WAITOK)); 210 else 211 return (uma_zalloc(cache_zone_large, M_WAITOK)); 212 } 213 if (ts) 214 return (uma_zalloc(cache_zone_small_ts, M_WAITOK)); 215 else 216 return (uma_zalloc(cache_zone_small, M_WAITOK)); 217} 218 219static void 220cache_free(struct namecache *ncp) 221{ 222 int ts; 223 224 if (ncp == NULL) 225 return; 226 ts = ncp->nc_flag & NCF_TS; 227 if (ncp->nc_nlen <= CACHE_PATH_CUTOFF) { 228 if (ts) 229 uma_zfree(cache_zone_small_ts, ncp); 230 else 231 uma_zfree(cache_zone_small, ncp); 232 } else if (ts) 233 uma_zfree(cache_zone_large_ts, ncp); 234 else 235 uma_zfree(cache_zone_large, ncp); 236} 237 238static char * 239nc_get_name(struct namecache *ncp) 240{ 241 struct namecache_ts *ncp_ts; 242 243 if ((ncp->nc_flag & NCF_TS) == 0) 244 return (ncp->nc_name); 245 ncp_ts = (struct namecache_ts *)ncp; 246 return (ncp_ts->nc_name); 247} 248 249static void 250cache_out_ts(struct namecache *ncp, struct timespec *tsp, int *ticksp) 251{ 252 253 KASSERT((ncp->nc_flag & NCF_TS) != 0 || 254 (tsp == NULL && ticksp == NULL), 255 ("No NCF_TS")); 256 257 if (tsp != NULL) 258 *tsp = ((struct namecache_ts *)ncp)->nc_time; 259 if (ticksp != NULL) 260 *ticksp = ((struct namecache_ts *)ncp)->nc_ticks; 261} 262 263static int doingcache = 1; /* 1 => enable the cache */ 264SYSCTL_INT(_debug, OID_AUTO, vfscache, CTLFLAG_RW, &doingcache, 0, 265 "VFS namecache enabled"); 266 267/* Export size information to userland */ 268SYSCTL_INT(_debug_sizeof, OID_AUTO, namecache, CTLFLAG_RD, 0, 269 sizeof(struct namecache), "sizeof(struct namecache)"); 270 271/* 272 * The new name cache statistics 273 */ 274static SYSCTL_NODE(_vfs, OID_AUTO, cache, CTLFLAG_RW, 0, 275 "Name cache statistics"); 276#define STATNODE(mode, name, var, descr) \ 277 SYSCTL_ULONG(_vfs_cache, OID_AUTO, name, mode, var, 0, descr); 278STATNODE(CTLFLAG_RD, numneg, &numneg, "Number of negative cache entries"); 279STATNODE(CTLFLAG_RD, numcache, &numcache, "Number of cache entries"); 280static u_long numcalls; STATNODE(CTLFLAG_RD, numcalls, &numcalls, 281 "Number of cache lookups"); 282static u_long dothits; STATNODE(CTLFLAG_RD, dothits, &dothits, 283 "Number of '.' hits"); 284static u_long dotdothits; STATNODE(CTLFLAG_RD, dotdothits, &dotdothits, 285 "Number of '..' hits"); 286static u_long numchecks; STATNODE(CTLFLAG_RD, numchecks, &numchecks, 287 "Number of checks in lookup"); 288static u_long nummiss; STATNODE(CTLFLAG_RD, nummiss, &nummiss, 289 "Number of cache misses"); 290static u_long nummisszap; STATNODE(CTLFLAG_RD, nummisszap, &nummisszap, 291 "Number of cache misses we do not want to cache"); 292static u_long numposzaps; STATNODE(CTLFLAG_RD, numposzaps, &numposzaps, 293 "Number of cache hits (positive) we do not want to cache"); 294static u_long numposhits; STATNODE(CTLFLAG_RD, numposhits, &numposhits, 295 "Number of cache hits (positive)"); 296static u_long numnegzaps; STATNODE(CTLFLAG_RD, numnegzaps, &numnegzaps, 297 "Number of cache hits (negative) we do not want to cache"); 298static u_long numneghits; STATNODE(CTLFLAG_RD, numneghits, &numneghits, 299 "Number of cache hits (negative)"); 300static u_long numupgrades; STATNODE(CTLFLAG_RD, numupgrades, &numupgrades, 301 "Number of updates of the cache after lookup (write lock + retry)"); 302 303SYSCTL_OPAQUE(_vfs_cache, OID_AUTO, nchstats, CTLFLAG_RD | CTLFLAG_MPSAFE, 304 &nchstats, sizeof(nchstats), "LU", 305 "VFS cache effectiveness statistics"); 306 307 308 309static void cache_zap(struct namecache *ncp); 310static int vn_vptocnp_locked(struct vnode **vp, struct ucred *cred, char *buf, 311 u_int *buflen); 312static int vn_fullpath1(struct thread *td, struct vnode *vp, struct vnode *rdir, 313 char *buf, char **retbuf, u_int buflen); 314 315static MALLOC_DEFINE(M_VFSCACHE, "vfscache", "VFS name cache entries"); 316 317#ifdef DIAGNOSTIC 318/* 319 * Grab an atomic snapshot of the name cache hash chain lengths 320 */ 321static SYSCTL_NODE(_debug, OID_AUTO, hashstat, CTLFLAG_RW, NULL, 322 "hash table stats"); 323 324static int 325sysctl_debug_hashstat_rawnchash(SYSCTL_HANDLER_ARGS) 326{ 327 int error; 328 struct nchashhead *ncpp; 329 struct namecache *ncp; 330 int n_nchash; 331 int count; 332 333 n_nchash = nchash + 1; /* nchash is max index, not count */ 334 if (!req->oldptr) 335 return SYSCTL_OUT(req, 0, n_nchash * sizeof(int)); 336 337 /* Scan hash tables for applicable entries */ 338 for (ncpp = nchashtbl; n_nchash > 0; n_nchash--, ncpp++) { 339 CACHE_RLOCK(); 340 count = 0; 341 LIST_FOREACH(ncp, ncpp, nc_hash) { 342 count++; 343 } 344 CACHE_RUNLOCK(); 345 error = SYSCTL_OUT(req, &count, sizeof(count)); 346 if (error) 347 return (error); 348 } 349 return (0); 350} 351SYSCTL_PROC(_debug_hashstat, OID_AUTO, rawnchash, CTLTYPE_INT|CTLFLAG_RD| 352 CTLFLAG_MPSAFE, 0, 0, sysctl_debug_hashstat_rawnchash, "S,int", 353 "nchash chain lengths"); 354 355static int 356sysctl_debug_hashstat_nchash(SYSCTL_HANDLER_ARGS) 357{ 358 int error; 359 struct nchashhead *ncpp; 360 struct namecache *ncp; 361 int n_nchash; 362 int count, maxlength, used, pct; 363 364 if (!req->oldptr) 365 return SYSCTL_OUT(req, 0, 4 * sizeof(int)); 366 367 n_nchash = nchash + 1; /* nchash is max index, not count */ 368 used = 0; 369 maxlength = 0; 370 371 /* Scan hash tables for applicable entries */ 372 for (ncpp = nchashtbl; n_nchash > 0; n_nchash--, ncpp++) { 373 count = 0; 374 CACHE_RLOCK(); 375 LIST_FOREACH(ncp, ncpp, nc_hash) { 376 count++; 377 } 378 CACHE_RUNLOCK(); 379 if (count) 380 used++; 381 if (maxlength < count) 382 maxlength = count; 383 } 384 n_nchash = nchash + 1; 385 pct = (used * 100) / (n_nchash / 100); 386 error = SYSCTL_OUT(req, &n_nchash, sizeof(n_nchash)); 387 if (error) 388 return (error); 389 error = SYSCTL_OUT(req, &used, sizeof(used)); 390 if (error) 391 return (error); 392 error = SYSCTL_OUT(req, &maxlength, sizeof(maxlength)); 393 if (error) 394 return (error); 395 error = SYSCTL_OUT(req, &pct, sizeof(pct)); 396 if (error) 397 return (error); 398 return (0); 399} 400SYSCTL_PROC(_debug_hashstat, OID_AUTO, nchash, CTLTYPE_INT|CTLFLAG_RD| 401 CTLFLAG_MPSAFE, 0, 0, sysctl_debug_hashstat_nchash, "I", 402 "nchash statistics (number of total/used buckets, maximum chain length, usage percentage)"); 403#endif 404 405/* 406 * cache_zap(): 407 * 408 * Removes a namecache entry from cache, whether it contains an actual 409 * pointer to a vnode or if it is just a negative cache entry. 410 */ 411static void 412cache_zap(ncp) 413 struct namecache *ncp; 414{ 415 struct vnode *vp; 416 417 rw_assert(&cache_lock, RA_WLOCKED); 418 CTR2(KTR_VFS, "cache_zap(%p) vp %p", ncp, ncp->nc_vp); 419#ifdef KDTRACE_HOOKS 420 if (ncp->nc_vp != NULL) { 421 SDT_PROBE(vfs, namecache, zap, done, ncp->nc_dvp, 422 nc_get_name(ncp), ncp->nc_vp, 0, 0); 423 } else { 424 SDT_PROBE(vfs, namecache, zap_negative, done, ncp->nc_dvp, 425 nc_get_name(ncp), 0, 0, 0); 426 } 427#endif 428 vp = NULL; 429 LIST_REMOVE(ncp, nc_hash); 430 if (ncp->nc_flag & NCF_ISDOTDOT) { 431 if (ncp == ncp->nc_dvp->v_cache_dd) 432 ncp->nc_dvp->v_cache_dd = NULL; 433 } else { 434 LIST_REMOVE(ncp, nc_src); 435 if (LIST_EMPTY(&ncp->nc_dvp->v_cache_src)) { 436 vp = ncp->nc_dvp; 437 numcachehv--; 438 } 439 } 440 if (ncp->nc_vp) { 441 TAILQ_REMOVE(&ncp->nc_vp->v_cache_dst, ncp, nc_dst); 442 if (ncp == ncp->nc_vp->v_cache_dd) 443 ncp->nc_vp->v_cache_dd = NULL; 444 } else { 445 TAILQ_REMOVE(&ncneg, ncp, nc_dst); 446 numneg--; 447 } 448 numcache--; 449 cache_free(ncp); 450 if (vp) 451 vdrop(vp); 452} 453 454/* 455 * Lookup an entry in the cache 456 * 457 * Lookup is called with dvp pointing to the directory to search, 458 * cnp pointing to the name of the entry being sought. If the lookup 459 * succeeds, the vnode is returned in *vpp, and a status of -1 is 460 * returned. If the lookup determines that the name does not exist 461 * (negative cacheing), a status of ENOENT is returned. If the lookup 462 * fails, a status of zero is returned. If the directory vnode is 463 * recycled out from under us due to a forced unmount, a status of 464 * ENOENT is returned. 465 * 466 * vpp is locked and ref'd on return. If we're looking up DOTDOT, dvp is 467 * unlocked. If we're looking up . an extra ref is taken, but the lock is 468 * not recursively acquired. 469 */ 470 471int 472cache_lookup(dvp, vpp, cnp, tsp, ticksp) 473 struct vnode *dvp; 474 struct vnode **vpp; 475 struct componentname *cnp; 476 struct timespec *tsp; 477 int *ticksp; 478{ 479 struct namecache *ncp; 480 uint32_t hash; 481 int error, ltype, wlocked; 482 483 if (!doingcache) { 484 cnp->cn_flags &= ~MAKEENTRY; 485 return (0); 486 } 487retry: 488 CACHE_RLOCK(); 489 wlocked = 0; 490 numcalls++; 491 error = 0; 492 493retry_wlocked: 494 if (cnp->cn_nameptr[0] == '.') { 495 if (cnp->cn_namelen == 1) { 496 *vpp = dvp; 497 CTR2(KTR_VFS, "cache_lookup(%p, %s) found via .", 498 dvp, cnp->cn_nameptr); 499 dothits++; 500 SDT_PROBE(vfs, namecache, lookup, hit, dvp, ".", 501 *vpp, 0, 0); 502 if (tsp != NULL) 503 timespecclear(tsp); 504 if (ticksp != NULL) 505 *ticksp = ticks; 506 goto success; 507 } 508 if (cnp->cn_namelen == 2 && cnp->cn_nameptr[1] == '.') { 509 dotdothits++; 510 if (dvp->v_cache_dd == NULL) { 511 SDT_PROBE(vfs, namecache, lookup, miss, dvp, 512 "..", NULL, 0, 0); 513 goto unlock; 514 } 515 if ((cnp->cn_flags & MAKEENTRY) == 0) { 516 if (!wlocked && !CACHE_UPGRADE_LOCK()) 517 goto wlock; 518 if (dvp->v_cache_dd->nc_flag & NCF_ISDOTDOT) 519 cache_zap(dvp->v_cache_dd); 520 dvp->v_cache_dd = NULL; 521 CACHE_WUNLOCK(); 522 return (0); 523 } 524 ncp = dvp->v_cache_dd; 525 if (ncp->nc_flag & NCF_ISDOTDOT) 526 *vpp = ncp->nc_vp; 527 else 528 *vpp = ncp->nc_dvp; 529 /* Return failure if negative entry was found. */ 530 if (*vpp == NULL) 531 goto negative_success; 532 CTR3(KTR_VFS, "cache_lookup(%p, %s) found %p via ..", 533 dvp, cnp->cn_nameptr, *vpp); 534 SDT_PROBE(vfs, namecache, lookup, hit, dvp, "..", 535 *vpp, 0, 0); 536 cache_out_ts(ncp, tsp, ticksp); 537 if ((ncp->nc_flag & (NCF_ISDOTDOT | NCF_DTS)) == 538 NCF_DTS && tsp != NULL) 539 *tsp = ((struct namecache_ts *)ncp)-> 540 nc_dotdottime; 541 goto success; 542 } 543 } 544 545 hash = fnv_32_buf(cnp->cn_nameptr, cnp->cn_namelen, FNV1_32_INIT); 546 hash = fnv_32_buf(&dvp, sizeof(dvp), hash); 547 LIST_FOREACH(ncp, (NCHHASH(hash)), nc_hash) { 548 numchecks++; 549 if (ncp->nc_dvp == dvp && ncp->nc_nlen == cnp->cn_namelen && 550 !bcmp(nc_get_name(ncp), cnp->cn_nameptr, ncp->nc_nlen)) 551 break; 552 } 553 554 /* We failed to find an entry */ 555 if (ncp == NULL) { 556 SDT_PROBE(vfs, namecache, lookup, miss, dvp, cnp->cn_nameptr, 557 NULL, 0, 0); 558 if ((cnp->cn_flags & MAKEENTRY) == 0) { 559 nummisszap++; 560 } else { 561 nummiss++; 562 } 563 nchstats.ncs_miss++; 564 goto unlock; 565 } 566 567 /* We don't want to have an entry, so dump it */ 568 if ((cnp->cn_flags & MAKEENTRY) == 0) { 569 numposzaps++; 570 nchstats.ncs_badhits++; 571 if (!wlocked && !CACHE_UPGRADE_LOCK()) 572 goto wlock; 573 cache_zap(ncp); 574 CACHE_WUNLOCK(); 575 return (0); 576 } 577 578 /* We found a "positive" match, return the vnode */ 579 if (ncp->nc_vp) { 580 numposhits++; 581 nchstats.ncs_goodhits++; 582 *vpp = ncp->nc_vp; 583 CTR4(KTR_VFS, "cache_lookup(%p, %s) found %p via ncp %p", 584 dvp, cnp->cn_nameptr, *vpp, ncp); 585 SDT_PROBE(vfs, namecache, lookup, hit, dvp, nc_get_name(ncp), 586 *vpp, 0, 0); 587 cache_out_ts(ncp, tsp, ticksp); 588 goto success; 589 } 590 591negative_success: 592 /* We found a negative match, and want to create it, so purge */ 593 if (cnp->cn_nameiop == CREATE) { 594 numnegzaps++; 595 nchstats.ncs_badhits++; 596 if (!wlocked && !CACHE_UPGRADE_LOCK()) 597 goto wlock; 598 cache_zap(ncp); 599 CACHE_WUNLOCK(); 600 return (0); 601 } 602 603 if (!wlocked && !CACHE_UPGRADE_LOCK()) 604 goto wlock; 605 numneghits++; 606 /* 607 * We found a "negative" match, so we shift it to the end of 608 * the "negative" cache entries queue to satisfy LRU. Also, 609 * check to see if the entry is a whiteout; indicate this to 610 * the componentname, if so. 611 */ 612 TAILQ_REMOVE(&ncneg, ncp, nc_dst); 613 TAILQ_INSERT_TAIL(&ncneg, ncp, nc_dst); 614 nchstats.ncs_neghits++; 615 if (ncp->nc_flag & NCF_WHITE) 616 cnp->cn_flags |= ISWHITEOUT; 617 SDT_PROBE(vfs, namecache, lookup, hit__negative, dvp, nc_get_name(ncp), 618 0, 0, 0); 619 cache_out_ts(ncp, tsp, ticksp); 620 CACHE_WUNLOCK(); 621 return (ENOENT); 622 623wlock: 624 /* 625 * We need to update the cache after our lookup, so upgrade to 626 * a write lock and retry the operation. 627 */ 628 CACHE_RUNLOCK(); 629 CACHE_WLOCK(); 630 numupgrades++; 631 wlocked = 1; 632 goto retry_wlocked; 633 634success: 635 /* 636 * On success we return a locked and ref'd vnode as per the lookup 637 * protocol. 638 */ 639 if (dvp == *vpp) { /* lookup on "." */ 640 VREF(*vpp); 641 if (wlocked) 642 CACHE_WUNLOCK(); 643 else 644 CACHE_RUNLOCK(); 645 /* 646 * When we lookup "." we still can be asked to lock it 647 * differently... 648 */ 649 ltype = cnp->cn_lkflags & LK_TYPE_MASK; 650 if (ltype != VOP_ISLOCKED(*vpp)) { 651 if (ltype == LK_EXCLUSIVE) { 652 vn_lock(*vpp, LK_UPGRADE | LK_RETRY); 653 if ((*vpp)->v_iflag & VI_DOOMED) { 654 /* forced unmount */ 655 vrele(*vpp); 656 *vpp = NULL; 657 return (ENOENT); 658 } 659 } else 660 vn_lock(*vpp, LK_DOWNGRADE | LK_RETRY); 661 } 662 return (-1); 663 } 664 ltype = 0; /* silence gcc warning */ 665 if (cnp->cn_flags & ISDOTDOT) { 666 ltype = VOP_ISLOCKED(dvp); 667 VOP_UNLOCK(dvp, 0); 668 } 669 VI_LOCK(*vpp); 670 if (wlocked) 671 CACHE_WUNLOCK(); 672 else 673 CACHE_RUNLOCK(); 674 error = vget(*vpp, cnp->cn_lkflags | LK_INTERLOCK, cnp->cn_thread); 675 if (cnp->cn_flags & ISDOTDOT) { 676 vn_lock(dvp, ltype | LK_RETRY); 677 if (dvp->v_iflag & VI_DOOMED) { 678 if (error == 0) 679 vput(*vpp); 680 *vpp = NULL; 681 return (ENOENT); 682 } 683 } 684 if (error) { 685 *vpp = NULL; 686 goto retry; 687 } 688 if ((cnp->cn_flags & ISLASTCN) && 689 (cnp->cn_lkflags & LK_TYPE_MASK) == LK_EXCLUSIVE) { 690 ASSERT_VOP_ELOCKED(*vpp, "cache_lookup"); 691 } 692 return (-1); 693 694unlock: 695 if (wlocked) 696 CACHE_WUNLOCK(); 697 else 698 CACHE_RUNLOCK(); 699 return (0); 700} 701 702/* 703 * Add an entry to the cache. 704 */ 705void 706cache_enter_time(dvp, vp, cnp, tsp, dtsp) 707 struct vnode *dvp; 708 struct vnode *vp; 709 struct componentname *cnp; 710 struct timespec *tsp; 711 struct timespec *dtsp; 712{ 713 struct namecache *ncp, *n2; 714 struct namecache_ts *n3; 715 struct nchashhead *ncpp; 716 uint32_t hash; 717 int flag; 718 int hold; 719 int zap; 720 int len; 721 722 CTR3(KTR_VFS, "cache_enter(%p, %p, %s)", dvp, vp, cnp->cn_nameptr); 723 VNASSERT(vp == NULL || (vp->v_iflag & VI_DOOMED) == 0, vp, 724 ("cache_enter: Adding a doomed vnode")); 725 VNASSERT(dvp == NULL || (dvp->v_iflag & VI_DOOMED) == 0, dvp, 726 ("cache_enter: Doomed vnode used as src")); 727 728 if (!doingcache) 729 return; 730 731 /* 732 * Avoid blowout in namecache entries. 733 */ 734 if (numcache >= desiredvnodes * ncsizefactor) 735 return; 736 737 flag = 0; 738 if (cnp->cn_nameptr[0] == '.') { 739 if (cnp->cn_namelen == 1) 740 return; 741 if (cnp->cn_namelen == 2 && cnp->cn_nameptr[1] == '.') { 742 CACHE_WLOCK(); 743 /* 744 * If dotdot entry already exists, just retarget it 745 * to new parent vnode, otherwise continue with new 746 * namecache entry allocation. 747 */ 748 if ((ncp = dvp->v_cache_dd) != NULL && 749 ncp->nc_flag & NCF_ISDOTDOT) { 750 KASSERT(ncp->nc_dvp == dvp, 751 ("wrong isdotdot parent")); 752 if (ncp->nc_vp != NULL) { 753 TAILQ_REMOVE(&ncp->nc_vp->v_cache_dst, 754 ncp, nc_dst); 755 } else { 756 TAILQ_REMOVE(&ncneg, ncp, nc_dst); 757 numneg--; 758 } 759 if (vp != NULL) { 760 TAILQ_INSERT_HEAD(&vp->v_cache_dst, 761 ncp, nc_dst); 762 } else { 763 TAILQ_INSERT_TAIL(&ncneg, ncp, nc_dst); 764 numneg++; 765 } 766 ncp->nc_vp = vp; 767 CACHE_WUNLOCK(); 768 return; 769 } 770 dvp->v_cache_dd = NULL; 771 SDT_PROBE(vfs, namecache, enter, done, dvp, "..", vp, 772 0, 0); 773 CACHE_WUNLOCK(); 774 flag = NCF_ISDOTDOT; 775 } 776 } 777 778 hold = 0; 779 zap = 0; 780 781 /* 782 * Calculate the hash key and setup as much of the new 783 * namecache entry as possible before acquiring the lock. 784 */ 785 ncp = cache_alloc(cnp->cn_namelen, tsp != NULL); 786 ncp->nc_vp = vp; 787 ncp->nc_dvp = dvp; 788 ncp->nc_flag = flag; 789 if (tsp != NULL) { 790 n3 = (struct namecache_ts *)ncp; 791 n3->nc_time = *tsp; 792 n3->nc_ticks = ticks; 793 n3->nc_flag |= NCF_TS; 794 if (dtsp != NULL) { 795 n3->nc_dotdottime = *dtsp; 796 n3->nc_flag |= NCF_DTS; 797 } 798 } 799 len = ncp->nc_nlen = cnp->cn_namelen; 800 hash = fnv_32_buf(cnp->cn_nameptr, len, FNV1_32_INIT); 801 strlcpy(nc_get_name(ncp), cnp->cn_nameptr, len + 1); 802 hash = fnv_32_buf(&dvp, sizeof(dvp), hash); 803 CACHE_WLOCK(); 804 805 /* 806 * See if this vnode or negative entry is already in the cache 807 * with this name. This can happen with concurrent lookups of 808 * the same path name. 809 */ 810 ncpp = NCHHASH(hash); 811 LIST_FOREACH(n2, ncpp, nc_hash) { 812 if (n2->nc_dvp == dvp && 813 n2->nc_nlen == cnp->cn_namelen && 814 !bcmp(nc_get_name(n2), cnp->cn_nameptr, n2->nc_nlen)) { 815 if (tsp != NULL) { 816 KASSERT((n2->nc_flag & NCF_TS) != 0, 817 ("no NCF_TS")); 818 n3 = (struct namecache_ts *)n2; 819 n3->nc_time = 820 ((struct namecache_ts *)ncp)->nc_time; 821 n3->nc_ticks = 822 ((struct namecache_ts *)ncp)->nc_ticks; 823 if (dtsp != NULL) { 824 n3->nc_dotdottime = 825 ((struct namecache_ts *)ncp)-> 826 nc_dotdottime; 827 n3->nc_flag |= NCF_DTS; 828 } 829 } 830 CACHE_WUNLOCK(); 831 cache_free(ncp); 832 return; 833 } 834 } 835 836 if (flag == NCF_ISDOTDOT) { 837 /* 838 * See if we are trying to add .. entry, but some other lookup 839 * has populated v_cache_dd pointer already. 840 */ 841 if (dvp->v_cache_dd != NULL) { 842 CACHE_WUNLOCK(); 843 cache_free(ncp); 844 return; 845 } 846 KASSERT(vp == NULL || vp->v_type == VDIR, 847 ("wrong vnode type %p", vp)); 848 dvp->v_cache_dd = ncp; 849 } 850 851 numcache++; 852 if (!vp) { 853 numneg++; 854 if (cnp->cn_flags & ISWHITEOUT) 855 ncp->nc_flag |= NCF_WHITE; 856 } else if (vp->v_type == VDIR) { 857 if (flag != NCF_ISDOTDOT) { 858 /* 859 * For this case, the cache entry maps both the 860 * directory name in it and the name ".." for the 861 * directory's parent. 862 */ 863 if ((n2 = vp->v_cache_dd) != NULL && 864 (n2->nc_flag & NCF_ISDOTDOT) != 0) 865 cache_zap(n2); 866 vp->v_cache_dd = ncp; 867 } 868 } else { 869 vp->v_cache_dd = NULL; 870 } 871 872 /* 873 * Insert the new namecache entry into the appropriate chain 874 * within the cache entries table. 875 */ 876 LIST_INSERT_HEAD(ncpp, ncp, nc_hash); 877 if (flag != NCF_ISDOTDOT) { 878 if (LIST_EMPTY(&dvp->v_cache_src)) { 879 hold = 1; 880 numcachehv++; 881 } 882 LIST_INSERT_HEAD(&dvp->v_cache_src, ncp, nc_src); 883 } 884 885 /* 886 * If the entry is "negative", we place it into the 887 * "negative" cache queue, otherwise, we place it into the 888 * destination vnode's cache entries queue. 889 */ 890 if (vp) { 891 TAILQ_INSERT_HEAD(&vp->v_cache_dst, ncp, nc_dst); 892 SDT_PROBE(vfs, namecache, enter, done, dvp, nc_get_name(ncp), 893 vp, 0, 0); 894 } else { 895 TAILQ_INSERT_TAIL(&ncneg, ncp, nc_dst); 896 SDT_PROBE(vfs, namecache, enter_negative, done, dvp, 897 nc_get_name(ncp), 0, 0, 0); 898 } 899 if (numneg * ncnegfactor > numcache) { 900 ncp = TAILQ_FIRST(&ncneg); 901 KASSERT(ncp->nc_vp == NULL, ("ncp %p vp %p on ncneg", 902 ncp, ncp->nc_vp)); 903 zap = 1; 904 } 905 if (hold) 906 vhold(dvp); 907 if (zap) 908 cache_zap(ncp); 909 CACHE_WUNLOCK(); 910} 911 912/* 913 * Name cache initialization, from vfs_init() when we are booting 914 */ 915static void 916nchinit(void *dummy __unused) 917{ 918 919 TAILQ_INIT(&ncneg); 920 921 cache_zone_small = uma_zcreate("S VFS Cache", 922 sizeof(struct namecache) + CACHE_PATH_CUTOFF + 1, 923 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR, UMA_ZONE_ZINIT); 924 cache_zone_small_ts = uma_zcreate("STS VFS Cache", 925 sizeof(struct namecache_ts) + CACHE_PATH_CUTOFF + 1, 926 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR, UMA_ZONE_ZINIT); 927 cache_zone_large = uma_zcreate("L VFS Cache", 928 sizeof(struct namecache) + NAME_MAX + 1, 929 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR, UMA_ZONE_ZINIT); 930 cache_zone_large_ts = uma_zcreate("LTS VFS Cache", 931 sizeof(struct namecache_ts) + NAME_MAX + 1, 932 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR, UMA_ZONE_ZINIT); 933 934 nchashtbl = hashinit(desiredvnodes * 2, M_VFSCACHE, &nchash); 935} 936SYSINIT(vfs, SI_SUB_VFS, SI_ORDER_SECOND, nchinit, NULL); 937 938 939/* 940 * Invalidate all entries to a particular vnode. 941 */ 942void 943cache_purge(vp) 944 struct vnode *vp; 945{ 946 947 CTR1(KTR_VFS, "cache_purge(%p)", vp); 948 SDT_PROBE(vfs, namecache, purge, done, vp, 0, 0, 0, 0); 949 CACHE_WLOCK(); 950 while (!LIST_EMPTY(&vp->v_cache_src)) 951 cache_zap(LIST_FIRST(&vp->v_cache_src)); 952 while (!TAILQ_EMPTY(&vp->v_cache_dst)) 953 cache_zap(TAILQ_FIRST(&vp->v_cache_dst)); 954 if (vp->v_cache_dd != NULL) { 955 KASSERT(vp->v_cache_dd->nc_flag & NCF_ISDOTDOT, 956 ("lost dotdot link")); 957 cache_zap(vp->v_cache_dd); 958 } 959 KASSERT(vp->v_cache_dd == NULL, ("incomplete purge")); 960 CACHE_WUNLOCK(); 961} 962 963/* 964 * Invalidate all negative entries for a particular directory vnode. 965 */ 966void 967cache_purge_negative(vp) 968 struct vnode *vp; 969{ 970 struct namecache *cp, *ncp; 971 972 CTR1(KTR_VFS, "cache_purge_negative(%p)", vp); 973 SDT_PROBE(vfs, namecache, purge_negative, done, vp, 0, 0, 0, 0); 974 CACHE_WLOCK(); 975 LIST_FOREACH_SAFE(cp, &vp->v_cache_src, nc_src, ncp) { 976 if (cp->nc_vp == NULL) 977 cache_zap(cp); 978 } 979 CACHE_WUNLOCK(); 980} 981 982/* 983 * Flush all entries referencing a particular filesystem. 984 */ 985void 986cache_purgevfs(mp) 987 struct mount *mp; 988{ 989 struct nchashhead *ncpp; 990 struct namecache *ncp, *nnp; 991 992 /* Scan hash tables for applicable entries */ 993 SDT_PROBE(vfs, namecache, purgevfs, done, mp, 0, 0, 0, 0); 994 CACHE_WLOCK(); 995 for (ncpp = &nchashtbl[nchash]; ncpp >= nchashtbl; ncpp--) { 996 LIST_FOREACH_SAFE(ncp, ncpp, nc_hash, nnp) { 997 if (ncp->nc_dvp->v_mount == mp) 998 cache_zap(ncp); 999 } 1000 } 1001 CACHE_WUNLOCK(); 1002} 1003 1004/* 1005 * Perform canonical checks and cache lookup and pass on to filesystem 1006 * through the vop_cachedlookup only if needed. 1007 */ 1008 1009int 1010vfs_cache_lookup(ap) 1011 struct vop_lookup_args /* { 1012 struct vnode *a_dvp; 1013 struct vnode **a_vpp; 1014 struct componentname *a_cnp; 1015 } */ *ap; 1016{ 1017 struct vnode *dvp; 1018 int error; 1019 struct vnode **vpp = ap->a_vpp; 1020 struct componentname *cnp = ap->a_cnp; 1021 struct ucred *cred = cnp->cn_cred; 1022 int flags = cnp->cn_flags; 1023 struct thread *td = cnp->cn_thread; 1024 1025 *vpp = NULL; 1026 dvp = ap->a_dvp; 1027 1028 if (dvp->v_type != VDIR) 1029 return (ENOTDIR); 1030 1031 if ((flags & ISLASTCN) && (dvp->v_mount->mnt_flag & MNT_RDONLY) && 1032 (cnp->cn_nameiop == DELETE || cnp->cn_nameiop == RENAME)) 1033 return (EROFS); 1034 1035 error = VOP_ACCESS(dvp, VEXEC, cred, td); 1036 if (error) 1037 return (error); 1038 1039 error = cache_lookup(dvp, vpp, cnp, NULL, NULL); 1040 if (error == 0) 1041 return (VOP_CACHEDLOOKUP(dvp, vpp, cnp)); 1042 if (error == -1) 1043 return (0); 1044 return (error); 1045} 1046 1047 1048#ifndef _SYS_SYSPROTO_H_ 1049struct __getcwd_args { 1050 u_char *buf; 1051 u_int buflen; 1052}; 1053#endif 1054 1055/* 1056 * XXX All of these sysctls would probably be more productive dead. 1057 */ 1058static int disablecwd; 1059SYSCTL_INT(_debug, OID_AUTO, disablecwd, CTLFLAG_RW, &disablecwd, 0, 1060 "Disable the getcwd syscall"); 1061 1062/* Implementation of the getcwd syscall. */ 1063int 1064sys___getcwd(td, uap) 1065 struct thread *td; 1066 struct __getcwd_args *uap; 1067{ 1068 1069 return (kern___getcwd(td, uap->buf, UIO_USERSPACE, uap->buflen)); 1070} 1071 1072int 1073kern___getcwd(struct thread *td, u_char *buf, enum uio_seg bufseg, u_int buflen) 1074{ 1075 char *bp, *tmpbuf; 1076 struct filedesc *fdp; 1077 struct vnode *cdir, *rdir; 1078 int error; 1079 1080 if (disablecwd) 1081 return (ENODEV); 1082 if (buflen < 2) 1083 return (EINVAL); 1084 if (buflen > MAXPATHLEN) 1085 buflen = MAXPATHLEN; 1086 1087 tmpbuf = malloc(buflen, M_TEMP, M_WAITOK); 1088 fdp = td->td_proc->p_fd; 1089 FILEDESC_SLOCK(fdp); 1090 cdir = fdp->fd_cdir; 1091 VREF(cdir); 1092 rdir = fdp->fd_rdir; 1093 VREF(rdir); 1094 FILEDESC_SUNLOCK(fdp); 1095 error = vn_fullpath1(td, cdir, rdir, tmpbuf, &bp, buflen); 1096 vrele(rdir); 1097 vrele(cdir); 1098 1099 if (!error) { 1100 if (bufseg == UIO_SYSSPACE) 1101 bcopy(bp, buf, strlen(bp) + 1); 1102 else 1103 error = copyout(bp, buf, strlen(bp) + 1); 1104#ifdef KTRACE 1105 if (KTRPOINT(curthread, KTR_NAMEI)) 1106 ktrnamei(bp); 1107#endif 1108 } 1109 free(tmpbuf, M_TEMP); 1110 return (error); 1111} 1112 1113/* 1114 * Thus begins the fullpath magic. 1115 */ 1116 1117#undef STATNODE 1118#define STATNODE(name, descr) \ 1119 static u_int name; \ 1120 SYSCTL_UINT(_vfs_cache, OID_AUTO, name, CTLFLAG_RD, &name, 0, descr) 1121 1122static int disablefullpath; 1123SYSCTL_INT(_debug, OID_AUTO, disablefullpath, CTLFLAG_RW, &disablefullpath, 0, 1124 "Disable the vn_fullpath function"); 1125 1126/* These count for kern___getcwd(), too. */ 1127STATNODE(numfullpathcalls, "Number of fullpath search calls"); 1128STATNODE(numfullpathfail1, "Number of fullpath search errors (ENOTDIR)"); 1129STATNODE(numfullpathfail2, 1130 "Number of fullpath search errors (VOP_VPTOCNP failures)"); 1131STATNODE(numfullpathfail4, "Number of fullpath search errors (ENOMEM)"); 1132STATNODE(numfullpathfound, "Number of successful fullpath calls"); 1133 1134/* 1135 * Retrieve the full filesystem path that correspond to a vnode from the name 1136 * cache (if available) 1137 */ 1138int 1139vn_fullpath(struct thread *td, struct vnode *vn, char **retbuf, char **freebuf) 1140{ 1141 char *buf; 1142 struct filedesc *fdp; 1143 struct vnode *rdir; 1144 int error; 1145 1146 if (disablefullpath) 1147 return (ENODEV); 1148 if (vn == NULL) 1149 return (EINVAL); 1150 1151 buf = malloc(MAXPATHLEN, M_TEMP, M_WAITOK); 1152 fdp = td->td_proc->p_fd; 1153 FILEDESC_SLOCK(fdp); 1154 rdir = fdp->fd_rdir; 1155 VREF(rdir); 1156 FILEDESC_SUNLOCK(fdp); 1157 error = vn_fullpath1(td, vn, rdir, buf, retbuf, MAXPATHLEN); 1158 vrele(rdir); 1159 1160 if (!error) 1161 *freebuf = buf; 1162 else 1163 free(buf, M_TEMP); 1164 return (error); 1165} 1166 1167/* 1168 * This function is similar to vn_fullpath, but it attempts to lookup the 1169 * pathname relative to the global root mount point. This is required for the 1170 * auditing sub-system, as audited pathnames must be absolute, relative to the 1171 * global root mount point. 1172 */ 1173int 1174vn_fullpath_global(struct thread *td, struct vnode *vn, 1175 char **retbuf, char **freebuf) 1176{ 1177 char *buf; 1178 int error; 1179 1180 if (disablefullpath) 1181 return (ENODEV); 1182 if (vn == NULL) 1183 return (EINVAL); 1184 buf = malloc(MAXPATHLEN, M_TEMP, M_WAITOK); 1185 error = vn_fullpath1(td, vn, rootvnode, buf, retbuf, MAXPATHLEN); 1186 if (!error) 1187 *freebuf = buf; 1188 else 1189 free(buf, M_TEMP); 1190 return (error); 1191} 1192 1193int 1194vn_vptocnp(struct vnode **vp, struct ucred *cred, char *buf, u_int *buflen) 1195{ 1196 int error; 1197 1198 CACHE_RLOCK(); 1199 error = vn_vptocnp_locked(vp, cred, buf, buflen); 1200 if (error == 0) 1201 CACHE_RUNLOCK(); 1202 return (error); 1203} 1204 1205static int 1206vn_vptocnp_locked(struct vnode **vp, struct ucred *cred, char *buf, 1207 u_int *buflen) 1208{ 1209 struct vnode *dvp; 1210 struct namecache *ncp; 1211 int error; 1212 1213 TAILQ_FOREACH(ncp, &((*vp)->v_cache_dst), nc_dst) { 1214 if ((ncp->nc_flag & NCF_ISDOTDOT) == 0) 1215 break; 1216 } 1217 if (ncp != NULL) { 1218 if (*buflen < ncp->nc_nlen) { 1219 CACHE_RUNLOCK(); 1220 vrele(*vp); 1221 numfullpathfail4++; 1222 error = ENOMEM; 1223 SDT_PROBE(vfs, namecache, fullpath, return, error, 1224 vp, NULL, 0, 0); 1225 return (error); 1226 } 1227 *buflen -= ncp->nc_nlen; 1228 memcpy(buf + *buflen, nc_get_name(ncp), ncp->nc_nlen); 1229 SDT_PROBE(vfs, namecache, fullpath, hit, ncp->nc_dvp, 1230 nc_get_name(ncp), vp, 0, 0); 1231 dvp = *vp; 1232 *vp = ncp->nc_dvp; 1233 vref(*vp); 1234 CACHE_RUNLOCK(); 1235 vrele(dvp); 1236 CACHE_RLOCK(); 1237 return (0); 1238 } 1239 SDT_PROBE(vfs, namecache, fullpath, miss, vp, 0, 0, 0, 0); 1240 1241 CACHE_RUNLOCK(); 1242 vn_lock(*vp, LK_SHARED | LK_RETRY); 1243 error = VOP_VPTOCNP(*vp, &dvp, cred, buf, buflen); 1244 vput(*vp); 1245 if (error) { 1246 numfullpathfail2++; 1247 SDT_PROBE(vfs, namecache, fullpath, return, error, vp, 1248 NULL, 0, 0); 1249 return (error); 1250 } 1251 1252 *vp = dvp; 1253 CACHE_RLOCK(); 1254 if (dvp->v_iflag & VI_DOOMED) { 1255 /* forced unmount */ 1256 CACHE_RUNLOCK(); 1257 vrele(dvp); 1258 error = ENOENT; 1259 SDT_PROBE(vfs, namecache, fullpath, return, error, vp, 1260 NULL, 0, 0); 1261 return (error); 1262 } 1263 /* 1264 * *vp has its use count incremented still. 1265 */ 1266 1267 return (0); 1268} 1269 1270/* 1271 * The magic behind kern___getcwd() and vn_fullpath(). 1272 */ 1273static int 1274vn_fullpath1(struct thread *td, struct vnode *vp, struct vnode *rdir, 1275 char *buf, char **retbuf, u_int buflen) 1276{ 1277 int error, slash_prefixed; 1278#ifdef KDTRACE_HOOKS 1279 struct vnode *startvp = vp; 1280#endif 1281 struct vnode *vp1; 1282 1283 buflen--; 1284 buf[buflen] = '\0'; 1285 error = 0; 1286 slash_prefixed = 0; 1287 1288 SDT_PROBE(vfs, namecache, fullpath, entry, vp, 0, 0, 0, 0); 1289 numfullpathcalls++; 1290 vref(vp); 1291 CACHE_RLOCK(); 1292 if (vp->v_type != VDIR) { 1293 error = vn_vptocnp_locked(&vp, td->td_ucred, buf, &buflen); 1294 if (error) 1295 return (error); 1296 if (buflen == 0) { 1297 CACHE_RUNLOCK(); 1298 vrele(vp); 1299 return (ENOMEM); 1300 } 1301 buf[--buflen] = '/'; 1302 slash_prefixed = 1; 1303 } 1304 while (vp != rdir && vp != rootvnode) { 1305 if (vp->v_vflag & VV_ROOT) { 1306 if (vp->v_iflag & VI_DOOMED) { /* forced unmount */ 1307 CACHE_RUNLOCK(); 1308 vrele(vp); 1309 error = ENOENT; 1310 SDT_PROBE(vfs, namecache, fullpath, return, 1311 error, vp, NULL, 0, 0); 1312 break; 1313 } 1314 vp1 = vp->v_mount->mnt_vnodecovered; 1315 vref(vp1); 1316 CACHE_RUNLOCK(); 1317 vrele(vp); 1318 vp = vp1; 1319 CACHE_RLOCK(); 1320 continue; 1321 } 1322 if (vp->v_type != VDIR) { 1323 CACHE_RUNLOCK(); 1324 vrele(vp); 1325 numfullpathfail1++; 1326 error = ENOTDIR; 1327 SDT_PROBE(vfs, namecache, fullpath, return, 1328 error, vp, NULL, 0, 0); 1329 break; 1330 } 1331 error = vn_vptocnp_locked(&vp, td->td_ucred, buf, &buflen); 1332 if (error) 1333 break; 1334 if (buflen == 0) { 1335 CACHE_RUNLOCK(); 1336 vrele(vp); 1337 error = ENOMEM; 1338 SDT_PROBE(vfs, namecache, fullpath, return, error, 1339 startvp, NULL, 0, 0); 1340 break; 1341 } 1342 buf[--buflen] = '/'; 1343 slash_prefixed = 1; 1344 } 1345 if (error) 1346 return (error); 1347 if (!slash_prefixed) { 1348 if (buflen == 0) { 1349 CACHE_RUNLOCK(); 1350 vrele(vp); 1351 numfullpathfail4++; 1352 SDT_PROBE(vfs, namecache, fullpath, return, ENOMEM, 1353 startvp, NULL, 0, 0); 1354 return (ENOMEM); 1355 } 1356 buf[--buflen] = '/'; 1357 } 1358 numfullpathfound++; 1359 CACHE_RUNLOCK(); 1360 vrele(vp); 1361 1362 SDT_PROBE(vfs, namecache, fullpath, return, 0, startvp, buf + buflen, 1363 0, 0); 1364 *retbuf = buf + buflen; 1365 return (0); 1366} 1367 1368struct vnode * 1369vn_dir_dd_ino(struct vnode *vp) 1370{ 1371 struct namecache *ncp; 1372 struct vnode *ddvp; 1373 1374 ASSERT_VOP_LOCKED(vp, "vn_dir_dd_ino"); 1375 CACHE_RLOCK(); 1376 TAILQ_FOREACH(ncp, &(vp->v_cache_dst), nc_dst) { 1377 if ((ncp->nc_flag & NCF_ISDOTDOT) != 0) 1378 continue; 1379 ddvp = ncp->nc_dvp; 1380 VI_LOCK(ddvp); 1381 CACHE_RUNLOCK(); 1382 if (vget(ddvp, LK_INTERLOCK | LK_SHARED | LK_NOWAIT, curthread)) 1383 return (NULL); 1384 return (ddvp); 1385 } 1386 CACHE_RUNLOCK(); 1387 return (NULL); 1388} 1389 1390int 1391vn_commname(struct vnode *vp, char *buf, u_int buflen) 1392{ 1393 struct namecache *ncp; 1394 int l; 1395 1396 CACHE_RLOCK(); 1397 TAILQ_FOREACH(ncp, &vp->v_cache_dst, nc_dst) 1398 if ((ncp->nc_flag & NCF_ISDOTDOT) == 0) 1399 break; 1400 if (ncp == NULL) { 1401 CACHE_RUNLOCK(); 1402 return (ENOENT); 1403 } 1404 l = min(ncp->nc_nlen, buflen - 1); 1405 memcpy(buf, nc_get_name(ncp), l); 1406 CACHE_RUNLOCK(); 1407 buf[l] = '\0'; 1408 return (0); 1409} 1410 1411/* ABI compat shims for old kernel modules. */ 1412#undef cache_enter 1413 1414void cache_enter(struct vnode *dvp, struct vnode *vp, 1415 struct componentname *cnp); 1416 1417void 1418cache_enter(struct vnode *dvp, struct vnode *vp, struct componentname *cnp) 1419{ 1420 1421 cache_enter_time(dvp, vp, cnp, NULL, NULL); 1422} 1423 1424/* 1425 * This function updates path string to vnode's full global path 1426 * and checks the size of the new path string against the pathlen argument. 1427 * 1428 * Requires a locked, referenced vnode and GIANT lock held. 1429 * Vnode is re-locked on success or ENODEV, otherwise unlocked. 1430 * 1431 * If sysctl debug.disablefullpath is set, ENODEV is returned, 1432 * vnode is left locked and path remain untouched. 1433 * 1434 * If vp is a directory, the call to vn_fullpath_global() always succeeds 1435 * because it falls back to the ".." lookup if the namecache lookup fails. 1436 */ 1437int 1438vn_path_to_global_path(struct thread *td, struct vnode *vp, char *path, 1439 u_int pathlen) 1440{ 1441 struct nameidata nd; 1442 struct vnode *vp1; 1443 char *rpath, *fbuf; 1444 int error; 1445 1446 ASSERT_VOP_ELOCKED(vp, __func__); 1447 1448 /* Return ENODEV if sysctl debug.disablefullpath==1 */ 1449 if (disablefullpath) 1450 return (ENODEV); 1451 1452 /* Construct global filesystem path from vp. */ 1453 VOP_UNLOCK(vp, 0); 1454 error = vn_fullpath_global(td, vp, &rpath, &fbuf); 1455 1456 if (error != 0) { 1457 vrele(vp); 1458 return (error); 1459 } 1460 1461 if (strlen(rpath) >= pathlen) { 1462 vrele(vp); 1463 error = ENAMETOOLONG; 1464 goto out; 1465 } 1466 1467 /* 1468 * Re-lookup the vnode by path to detect a possible rename. 1469 * As a side effect, the vnode is relocked. 1470 * If vnode was renamed, return ENOENT. 1471 */ 1472 NDINIT(&nd, LOOKUP, FOLLOW | LOCKLEAF | AUDITVNODE1, 1473 UIO_SYSSPACE, path, td); 1474 error = namei(&nd); 1475 if (error != 0) { 1476 vrele(vp); 1477 goto out; 1478 } 1479 NDFREE(&nd, NDF_ONLY_PNBUF); 1480 vp1 = nd.ni_vp; 1481 vrele(vp); 1482 if (vp1 == vp) 1483 strcpy(path, rpath); 1484 else { 1485 vput(vp1); 1486 error = ENOENT; 1487 } 1488 1489out: 1490 free(fbuf, M_TEMP); 1491 return (error); 1492} 1493