2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright (c) 1989, 1993, 1995
5 * The Regents of the University of California. All rights reserved.
7 * This code is derived from software contributed to Berkeley by
8 * Poul-Henning Kamp of the FreeBSD Project.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * @(#)vfs_cache.c 8.5 (Berkeley) 3/22/95
37 #include <sys/cdefs.h>
38 __FBSDID("$FreeBSD$");
41 #include "opt_ktrace.h"
43 #include <sys/param.h>
44 #include <sys/systm.h>
45 #include <sys/capsicum.h>
46 #include <sys/counter.h>
47 #include <sys/filedesc.h>
48 #include <sys/fnv_hash.h>
49 #include <sys/kernel.h>
52 #include <sys/malloc.h>
53 #include <sys/fcntl.h>
55 #include <sys/mount.h>
56 #include <sys/namei.h>
62 #include <sys/syscallsubr.h>
63 #include <sys/sysctl.h>
64 #include <sys/sysproto.h>
65 #include <sys/vnode.h>
68 #include <sys/ktrace.h>
71 #include <machine/_inttypes.h>
74 #include <sys/capsicum.h>
76 #include <security/audit/audit.h>
77 #include <security/mac/mac_framework.h>
86 * High level overview of name caching in the VFS layer.
88 * Originally caching was implemented as part of UFS, later extracted to allow
89 * use by other filesystems. A decision was made to make it optional and
90 * completely detached from the rest of the kernel, which comes with limitations
91 * outlined near the end of this comment block.
93 * This fundamental choice needs to be revisited. In the meantime, the current
94 * state is described below. Significance of all notable routines is explained
95 * in comments placed above their implementation. Scattered thoroughout the
96 * file are TODO comments indicating shortcomings which can be fixed without
97 * reworking everything (most of the fixes will likely be reusable). Various
98 * details are omitted from this explanation to not clutter the overview, they
99 * have to be checked by reading the code and associated commentary.
101 * Keep in mind that it's individual path components which are cached, not full
102 * paths. That is, for a fully cached path "foo/bar/baz" there are 3 entries,
105 * I. Data organization
107 * Entries are described by "struct namecache" objects and stored in a hash
108 * table. See cache_get_hash for more information.
110 * "struct vnode" contains pointers to source entries (names which can be found
111 * when traversing through said vnode), destination entries (names of that
112 * vnode (see "Limitations" for a breakdown on the subject) and a pointer to
115 * The (directory vnode; name) tuple reliably determines the target entry if
118 * Since there are no small locks at this time (all are 32 bytes in size on
119 * LP64), the code works around the problem by introducing lock arrays to
120 * protect hash buckets and vnode lists.
122 * II. Filesystem integration
124 * Filesystems participating in name caching do the following:
125 * - set vop_lookup routine to vfs_cache_lookup
126 * - set vop_cachedlookup to whatever can perform the lookup if the above fails
127 * - if they support lockless lookup (see below), vop_fplookup_vexec and
128 * vop_fplookup_symlink are set along with the MNTK_FPLOOKUP flag on the
130 * - call cache_purge or cache_vop_* routines to eliminate stale entries as
132 * - call cache_enter to add entries depending on the MAKEENTRY flag
134 * With the above in mind, there are 2 entry points when doing lookups:
135 * - ... -> namei -> cache_fplookup -- this is the default
136 * - ... -> VOP_LOOKUP -> vfs_cache_lookup -- normally only called by namei
137 * should the above fail
139 * Example code flow how an entry is added:
140 * ... -> namei -> cache_fplookup -> cache_fplookup_noentry -> VOP_LOOKUP ->
141 * vfs_cache_lookup -> VOP_CACHEDLOOKUP -> ufs_lookup_ino -> cache_enter
143 * III. Performance considerations
145 * For lockless case forward lookup avoids any writes to shared areas apart
146 * from the terminal path component. In other words non-modifying lookups of
147 * different files don't suffer any scalability problems in the namecache.
148 * Looking up the same file is limited by VFS and goes beyond the scope of this
151 * At least on amd64 the single-threaded bottleneck for long paths is hashing
152 * (see cache_get_hash). There are cases where the code issues acquire fence
153 * multiple times, they can be combined on architectures which suffer from it.
155 * For locked case each encountered vnode has to be referenced and locked in
156 * order to be handed out to the caller (normally that's namei). This
157 * introduces significant hit single-threaded and serialization multi-threaded.
159 * Reverse lookup (e.g., "getcwd") fully scales provided it is fully cached --
160 * avoids any writes to shared areas to any components.
162 * Unrelated insertions are partially serialized on updating the global entry
163 * counter and possibly serialized on colliding bucket or vnode locks.
167 * Note not everything has an explicit dtrace probe nor it should have, thus
168 * some of the one-liners below depend on implementation details.
172 * # Check what lookups failed to be handled in a lockless manner. Column 1 is
173 * # line number, column 2 is status code (see cache_fpl_status)
174 * dtrace -n 'vfs:fplookup:lookup:done { @[arg1, arg2] = count(); }'
176 * # Lengths of names added by binary name
177 * dtrace -n 'fbt::cache_enter_time:entry { @[execname] = quantize(args[2]->cn_namelen); }'
179 * # Same as above but only those which exceed 64 characters
180 * dtrace -n 'fbt::cache_enter_time:entry /args[2]->cn_namelen > 64/ { @[execname] = quantize(args[2]->cn_namelen); }'
182 * # Who is performing lookups with spurious slashes (e.g., "foo//bar") and what
184 * dtrace -n 'fbt::cache_fplookup_skip_slashes:entry { @[execname, stringof(args[0]->cnp->cn_pnbuf)] = count(); }'
186 * V. Limitations and implementation defects
188 * - since it is possible there is no entry for an open file, tools like
189 * "procstat" may fail to resolve fd -> vnode -> path to anything
190 * - even if a filesystem adds an entry, it may get purged (e.g., due to memory
191 * shortage) in which case the above problem applies
192 * - hardlinks are not tracked, thus if a vnode is reachable in more than one
193 * way, resolving a name may return a different path than the one used to
194 * open it (even if said path is still valid)
195 * - by default entries are not added for newly created files
196 * - adding an entry may need to evict negative entry first, which happens in 2
197 * distinct places (evicting on lookup, adding in a later VOP) making it
198 * impossible to simply reuse it
199 * - there is a simple scheme to evict negative entries as the cache is approaching
200 * its capacity, but it is very unclear if doing so is a good idea to begin with
201 * - vnodes are subject to being recycled even if target inode is left in memory,
202 * which loses the name cache entries when it perhaps should not. in case of tmpfs
203 * names get duplicated -- kept by filesystem itself and namecache separately
204 * - struct namecache has a fixed size and comes in 2 variants, often wasting space.
205 * now hard to replace with malloc due to dependence on SMR.
206 * - lack of better integration with the kernel also turns nullfs into a layered
207 * filesystem instead of something which can take advantage of caching
210 static SYSCTL_NODE(_vfs, OID_AUTO, cache, CTLFLAG_RW | CTLFLAG_MPSAFE, 0,
213 SDT_PROVIDER_DECLARE(vfs);
214 SDT_PROBE_DEFINE3(vfs, namecache, enter, done, "struct vnode *", "char *",
216 SDT_PROBE_DEFINE3(vfs, namecache, enter, duplicate, "struct vnode *", "char *",
218 SDT_PROBE_DEFINE2(vfs, namecache, enter_negative, done, "struct vnode *",
220 SDT_PROBE_DEFINE2(vfs, namecache, fullpath_smr, hit, "struct vnode *",
222 SDT_PROBE_DEFINE4(vfs, namecache, fullpath_smr, miss, "struct vnode *",
223 "struct namecache *", "int", "int");
224 SDT_PROBE_DEFINE1(vfs, namecache, fullpath, entry, "struct vnode *");
225 SDT_PROBE_DEFINE3(vfs, namecache, fullpath, hit, "struct vnode *",
226 "char *", "struct vnode *");
227 SDT_PROBE_DEFINE1(vfs, namecache, fullpath, miss, "struct vnode *");
228 SDT_PROBE_DEFINE3(vfs, namecache, fullpath, return, "int",
229 "struct vnode *", "char *");
230 SDT_PROBE_DEFINE3(vfs, namecache, lookup, hit, "struct vnode *", "char *",
232 SDT_PROBE_DEFINE2(vfs, namecache, lookup, hit__negative,
233 "struct vnode *", "char *");
234 SDT_PROBE_DEFINE2(vfs, namecache, lookup, miss, "struct vnode *",
236 SDT_PROBE_DEFINE2(vfs, namecache, removecnp, hit, "struct vnode *",
237 "struct componentname *");
238 SDT_PROBE_DEFINE2(vfs, namecache, removecnp, miss, "struct vnode *",
239 "struct componentname *");
240 SDT_PROBE_DEFINE1(vfs, namecache, purge, done, "struct vnode *");
241 SDT_PROBE_DEFINE1(vfs, namecache, purge, batch, "int");
242 SDT_PROBE_DEFINE1(vfs, namecache, purge_negative, done, "struct vnode *");
243 SDT_PROBE_DEFINE1(vfs, namecache, purgevfs, done, "struct mount *");
244 SDT_PROBE_DEFINE3(vfs, namecache, zap, done, "struct vnode *", "char *",
246 SDT_PROBE_DEFINE2(vfs, namecache, zap_negative, done, "struct vnode *",
248 SDT_PROBE_DEFINE2(vfs, namecache, evict_negative, done, "struct vnode *",
250 SDT_PROBE_DEFINE1(vfs, namecache, symlink, alloc__fail, "size_t");
252 SDT_PROBE_DEFINE3(vfs, fplookup, lookup, done, "struct nameidata", "int", "bool");
253 SDT_PROBE_DECLARE(vfs, namei, lookup, entry);
254 SDT_PROBE_DECLARE(vfs, namei, lookup, return);
257 * This structure describes the elements in the cache of recent
258 * names looked up by namei.
264 _Static_assert(sizeof(struct negstate) <= sizeof(struct vnode *),
265 "the state must fit in a union with a pointer without growing it");
268 LIST_ENTRY(namecache) nc_src; /* source vnode list */
269 TAILQ_ENTRY(namecache) nc_dst; /* destination vnode list */
270 CK_SLIST_ENTRY(namecache) nc_hash;/* hash chain */
271 struct vnode *nc_dvp; /* vnode of parent of name */
273 struct vnode *nu_vp; /* vnode the name refers to */
274 struct negstate nu_neg;/* negative entry state */
276 u_char nc_flag; /* flag bits */
277 u_char nc_nlen; /* length of name */
278 char nc_name[0]; /* segment name + nul */
282 * struct namecache_ts repeats struct namecache layout up to the
284 * struct namecache_ts is used in place of struct namecache when time(s) need
285 * to be stored. The nc_dotdottime field is used when a cache entry is mapping
286 * both a non-dotdot directory name plus dotdot for the directory's
289 * See below for alignment requirement.
291 struct namecache_ts {
292 struct timespec nc_time; /* timespec provided by fs */
293 struct timespec nc_dotdottime; /* dotdot timespec provided by fs */
294 int nc_ticks; /* ticks value when entry was added */
296 struct namecache nc_nc;
299 TAILQ_HEAD(cache_freebatch, namecache);
302 * At least mips n32 performs 64-bit accesses to timespec as found
303 * in namecache_ts and requires them to be aligned. Since others
304 * may be in the same spot suffer a little bit and enforce the
305 * alignment for everyone. Note this is a nop for 64-bit platforms.
307 #define CACHE_ZONE_ALIGNMENT UMA_ALIGNOF(time_t)
310 * TODO: the initial value of CACHE_PATH_CUTOFF was inherited from the
311 * 4.4 BSD codebase. Later on struct namecache was tweaked to become
312 * smaller and the value was bumped to retain the total size, but it
313 * was never re-evaluated for suitability. A simple test counting
314 * lengths during package building shows that the value of 45 covers
315 * about 86% of all added entries, reaching 99% at 65.
317 * Regardless of the above, use of dedicated zones instead of malloc may be
318 * inducing additional waste. This may be hard to address as said zones are
319 * tied to VFS SMR. Even if retaining them, the current split should be
323 #define CACHE_PATH_CUTOFF 45
324 #define CACHE_LARGE_PAD 6
326 #define CACHE_PATH_CUTOFF 41
327 #define CACHE_LARGE_PAD 2
330 #define CACHE_ZONE_SMALL_SIZE (offsetof(struct namecache, nc_name) + CACHE_PATH_CUTOFF + 1)
331 #define CACHE_ZONE_SMALL_TS_SIZE (offsetof(struct namecache_ts, nc_nc) + CACHE_ZONE_SMALL_SIZE)
332 #define CACHE_ZONE_LARGE_SIZE (offsetof(struct namecache, nc_name) + NAME_MAX + 1 + CACHE_LARGE_PAD)
333 #define CACHE_ZONE_LARGE_TS_SIZE (offsetof(struct namecache_ts, nc_nc) + CACHE_ZONE_LARGE_SIZE)
335 _Static_assert((CACHE_ZONE_SMALL_SIZE % (CACHE_ZONE_ALIGNMENT + 1)) == 0, "bad zone size");
336 _Static_assert((CACHE_ZONE_SMALL_TS_SIZE % (CACHE_ZONE_ALIGNMENT + 1)) == 0, "bad zone size");
337 _Static_assert((CACHE_ZONE_LARGE_SIZE % (CACHE_ZONE_ALIGNMENT + 1)) == 0, "bad zone size");
338 _Static_assert((CACHE_ZONE_LARGE_TS_SIZE % (CACHE_ZONE_ALIGNMENT + 1)) == 0, "bad zone size");
340 #define nc_vp n_un.nu_vp
341 #define nc_neg n_un.nu_neg
344 * Flags in namecache.nc_flag
346 #define NCF_WHITE 0x01
347 #define NCF_ISDOTDOT 0x02
350 #define NCF_DVDROP 0x10
351 #define NCF_NEGATIVE 0x20
352 #define NCF_INVALID 0x40
356 * Flags in negstate.neg_flag
360 static bool cache_neg_evict_cond(u_long lnumcache);
363 * Mark an entry as invalid.
365 * This is called before it starts getting deconstructed.
368 cache_ncp_invalidate(struct namecache *ncp)
371 KASSERT((ncp->nc_flag & NCF_INVALID) == 0,
372 ("%s: entry %p already invalid", __func__, ncp));
373 atomic_store_char(&ncp->nc_flag, ncp->nc_flag | NCF_INVALID);
374 atomic_thread_fence_rel();
378 * Check whether the entry can be safely used.
380 * All places which elide locks are supposed to call this after they are
381 * done with reading from an entry.
383 #define cache_ncp_canuse(ncp) ({ \
384 struct namecache *_ncp = (ncp); \
387 atomic_thread_fence_acq(); \
388 _nc_flag = atomic_load_char(&_ncp->nc_flag); \
389 __predict_true((_nc_flag & (NCF_INVALID | NCF_WIP)) == 0); \
393 * Like the above but also checks NCF_WHITE.
395 #define cache_fpl_neg_ncp_canuse(ncp) ({ \
396 struct namecache *_ncp = (ncp); \
399 atomic_thread_fence_acq(); \
400 _nc_flag = atomic_load_char(&_ncp->nc_flag); \
401 __predict_true((_nc_flag & (NCF_INVALID | NCF_WIP | NCF_WHITE)) == 0); \
406 static SYSCTL_NODE(_vfs_cache, OID_AUTO, param, CTLFLAG_RW | CTLFLAG_MPSAFE, 0,
407 "Name cache parameters");
409 static u_int __read_mostly ncsize; /* the size as computed on creation or resizing */
410 SYSCTL_UINT(_vfs_cache_param, OID_AUTO, size, CTLFLAG_RW, &ncsize, 0,
411 "Total namecache capacity");
413 u_int ncsizefactor = 2;
414 SYSCTL_UINT(_vfs_cache_param, OID_AUTO, sizefactor, CTLFLAG_RW, &ncsizefactor, 0,
415 "Size factor for namecache");
417 static u_long __read_mostly ncnegfactor = 5; /* ratio of negative entries */
418 SYSCTL_ULONG(_vfs_cache_param, OID_AUTO, negfactor, CTLFLAG_RW, &ncnegfactor, 0,
419 "Ratio of negative namecache entries");
422 * Negative entry % of namecache capacity above which automatic eviction is allowed.
424 * Check cache_neg_evict_cond for details.
426 static u_int ncnegminpct = 3;
428 static u_int __read_mostly neg_min; /* the above recomputed against ncsize */
429 SYSCTL_UINT(_vfs_cache_param, OID_AUTO, negmin, CTLFLAG_RD, &neg_min, 0,
430 "Negative entry count above which automatic eviction is allowed");
433 * Structures associated with name caching.
435 #define NCHHASH(hash) \
436 (&nchashtbl[(hash) & nchash])
437 static __read_mostly CK_SLIST_HEAD(nchashhead, namecache) *nchashtbl;/* Hash Table */
438 static u_long __read_mostly nchash; /* size of hash table */
439 SYSCTL_ULONG(_debug, OID_AUTO, nchash, CTLFLAG_RD, &nchash, 0,
440 "Size of namecache hash table");
441 static u_long __exclusive_cache_line numneg; /* number of negative entries allocated */
442 static u_long __exclusive_cache_line numcache;/* number of cache entries allocated */
444 struct nchstats nchstats; /* cache effectiveness statistics */
446 static bool __read_frequently cache_fast_revlookup = true;
447 SYSCTL_BOOL(_vfs, OID_AUTO, cache_fast_revlookup, CTLFLAG_RW,
448 &cache_fast_revlookup, 0, "");
450 static bool __read_mostly cache_rename_add = true;
451 SYSCTL_BOOL(_vfs, OID_AUTO, cache_rename_add, CTLFLAG_RW,
452 &cache_rename_add, 0, "");
454 static u_int __exclusive_cache_line neg_cycle;
457 #define numneglists (ncneghash + 1)
460 struct mtx nl_evict_lock;
461 struct mtx nl_lock __aligned(CACHE_LINE_SIZE);
462 TAILQ_HEAD(, namecache) nl_list;
463 TAILQ_HEAD(, namecache) nl_hotlist;
465 } __aligned(CACHE_LINE_SIZE);
467 static struct neglist neglists[numneglists];
469 static inline struct neglist *
470 NCP2NEGLIST(struct namecache *ncp)
473 return (&neglists[(((uintptr_t)(ncp) >> 8) & ncneghash)]);
476 static inline struct negstate *
477 NCP2NEGSTATE(struct namecache *ncp)
480 MPASS(atomic_load_char(&ncp->nc_flag) & NCF_NEGATIVE);
481 return (&ncp->nc_neg);
484 #define numbucketlocks (ncbuckethash + 1)
485 static u_int __read_mostly ncbuckethash;
486 static struct mtx_padalign __read_mostly *bucketlocks;
487 #define HASH2BUCKETLOCK(hash) \
488 ((struct mtx *)(&bucketlocks[((hash) & ncbuckethash)]))
490 #define numvnodelocks (ncvnodehash + 1)
491 static u_int __read_mostly ncvnodehash;
492 static struct mtx __read_mostly *vnodelocks;
493 static inline struct mtx *
494 VP2VNODELOCK(struct vnode *vp)
497 return (&vnodelocks[(((uintptr_t)(vp) >> 8) & ncvnodehash)]);
501 cache_out_ts(struct namecache *ncp, struct timespec *tsp, int *ticksp)
503 struct namecache_ts *ncp_ts;
505 KASSERT((ncp->nc_flag & NCF_TS) != 0 ||
506 (tsp == NULL && ticksp == NULL),
512 ncp_ts = __containerof(ncp, struct namecache_ts, nc_nc);
513 *tsp = ncp_ts->nc_time;
514 *ticksp = ncp_ts->nc_ticks;
518 static int __read_mostly doingcache = 1; /* 1 => enable the cache */
519 SYSCTL_INT(_debug, OID_AUTO, vfscache, CTLFLAG_RW, &doingcache, 0,
520 "VFS namecache enabled");
523 /* Export size information to userland */
524 SYSCTL_INT(_debug_sizeof, OID_AUTO, namecache, CTLFLAG_RD, SYSCTL_NULL_INT_PTR,
525 sizeof(struct namecache), "sizeof(struct namecache)");
528 * The new name cache statistics
530 static SYSCTL_NODE(_vfs_cache, OID_AUTO, stats, CTLFLAG_RW | CTLFLAG_MPSAFE, 0,
531 "Name cache statistics");
533 #define STATNODE_ULONG(name, varname, descr) \
534 SYSCTL_ULONG(_vfs_cache_stats, OID_AUTO, name, CTLFLAG_RD, &varname, 0, descr);
535 #define STATNODE_COUNTER(name, varname, descr) \
536 static COUNTER_U64_DEFINE_EARLY(varname); \
537 SYSCTL_COUNTER_U64(_vfs_cache_stats, OID_AUTO, name, CTLFLAG_RD, &varname, \
539 STATNODE_ULONG(neg, numneg, "Number of negative cache entries");
540 STATNODE_ULONG(count, numcache, "Number of cache entries");
541 STATNODE_COUNTER(heldvnodes, numcachehv, "Number of namecache entries with vnodes held");
542 STATNODE_COUNTER(drops, numdrops, "Number of dropped entries due to reaching the limit");
543 STATNODE_COUNTER(dothits, dothits, "Number of '.' hits");
544 STATNODE_COUNTER(dotdothis, dotdothits, "Number of '..' hits");
545 STATNODE_COUNTER(miss, nummiss, "Number of cache misses");
546 STATNODE_COUNTER(misszap, nummisszap, "Number of cache misses we do not want to cache");
547 STATNODE_COUNTER(posszaps, numposzaps,
548 "Number of cache hits (positive) we do not want to cache");
549 STATNODE_COUNTER(poshits, numposhits, "Number of cache hits (positive)");
550 STATNODE_COUNTER(negzaps, numnegzaps,
551 "Number of cache hits (negative) we do not want to cache");
552 STATNODE_COUNTER(neghits, numneghits, "Number of cache hits (negative)");
553 /* These count for vn_getcwd(), too. */
554 STATNODE_COUNTER(fullpathcalls, numfullpathcalls, "Number of fullpath search calls");
555 STATNODE_COUNTER(fullpathfail1, numfullpathfail1, "Number of fullpath search errors (ENOTDIR)");
556 STATNODE_COUNTER(fullpathfail2, numfullpathfail2,
557 "Number of fullpath search errors (VOP_VPTOCNP failures)");
558 STATNODE_COUNTER(fullpathfail4, numfullpathfail4, "Number of fullpath search errors (ENOMEM)");
559 STATNODE_COUNTER(fullpathfound, numfullpathfound, "Number of successful fullpath calls");
560 STATNODE_COUNTER(symlinktoobig, symlinktoobig, "Number of times symlink did not fit the cache");
563 * Debug or developer statistics.
565 static SYSCTL_NODE(_vfs_cache, OID_AUTO, debug, CTLFLAG_RW | CTLFLAG_MPSAFE, 0,
566 "Name cache debugging");
567 #define DEBUGNODE_ULONG(name, varname, descr) \
568 SYSCTL_ULONG(_vfs_cache_debug, OID_AUTO, name, CTLFLAG_RD, &varname, 0, descr);
569 #define DEBUGNODE_COUNTER(name, varname, descr) \
570 static COUNTER_U64_DEFINE_EARLY(varname); \
571 SYSCTL_COUNTER_U64(_vfs_cache_debug, OID_AUTO, name, CTLFLAG_RD, &varname, \
573 DEBUGNODE_COUNTER(zap_bucket_relock_success, zap_bucket_relock_success,
574 "Number of successful removals after relocking");
575 static long zap_bucket_fail;
576 DEBUGNODE_ULONG(zap_bucket_fail, zap_bucket_fail, "");
577 static long zap_bucket_fail2;
578 DEBUGNODE_ULONG(zap_bucket_fail2, zap_bucket_fail2, "");
579 static long cache_lock_vnodes_cel_3_failures;
580 DEBUGNODE_ULONG(vnodes_cel_3_failures, cache_lock_vnodes_cel_3_failures,
581 "Number of times 3-way vnode locking failed");
583 static void cache_zap_locked(struct namecache *ncp);
584 static int vn_fullpath_hardlink(struct nameidata *ndp, char **retbuf,
585 char **freebuf, size_t *buflen);
586 static int vn_fullpath_any_smr(struct vnode *vp, struct vnode *rdir, char *buf,
587 char **retbuf, size_t *buflen, size_t addend);
588 static int vn_fullpath_any(struct vnode *vp, struct vnode *rdir, char *buf,
589 char **retbuf, size_t *buflen);
590 static int vn_fullpath_dir(struct vnode *vp, struct vnode *rdir, char *buf,
591 char **retbuf, size_t *len, size_t addend);
593 static MALLOC_DEFINE(M_VFSCACHE, "vfscache", "VFS name cache entries");
596 cache_assert_vlp_locked(struct mtx *vlp)
600 mtx_assert(vlp, MA_OWNED);
604 cache_assert_vnode_locked(struct vnode *vp)
608 vlp = VP2VNODELOCK(vp);
609 cache_assert_vlp_locked(vlp);
613 * Directory vnodes with entries are held for two reasons:
614 * 1. make them less of a target for reclamation in vnlru
615 * 2. suffer smaller performance penalty in locked lookup as requeieing is avoided
617 * It will be feasible to stop doing it altogether if all filesystems start
618 * supporting lockless lookup.
621 cache_hold_vnode(struct vnode *vp)
624 cache_assert_vnode_locked(vp);
625 VNPASS(LIST_EMPTY(&vp->v_cache_src), vp);
627 counter_u64_add(numcachehv, 1);
631 cache_drop_vnode(struct vnode *vp)
635 * Called after all locks are dropped, meaning we can't assert
636 * on the state of v_cache_src.
639 counter_u64_add(numcachehv, -1);
645 static uma_zone_t __read_mostly cache_zone_small;
646 static uma_zone_t __read_mostly cache_zone_small_ts;
647 static uma_zone_t __read_mostly cache_zone_large;
648 static uma_zone_t __read_mostly cache_zone_large_ts;
651 cache_symlink_alloc(size_t size, int flags)
654 if (size < CACHE_ZONE_SMALL_SIZE) {
655 return (uma_zalloc_smr(cache_zone_small, flags));
657 if (size < CACHE_ZONE_LARGE_SIZE) {
658 return (uma_zalloc_smr(cache_zone_large, flags));
660 counter_u64_add(symlinktoobig, 1);
661 SDT_PROBE1(vfs, namecache, symlink, alloc__fail, size);
666 cache_symlink_free(char *string, size_t size)
669 MPASS(string != NULL);
670 KASSERT(size < CACHE_ZONE_LARGE_SIZE,
671 ("%s: size %zu too big", __func__, size));
673 if (size < CACHE_ZONE_SMALL_SIZE) {
674 uma_zfree_smr(cache_zone_small, string);
677 if (size < CACHE_ZONE_LARGE_SIZE) {
678 uma_zfree_smr(cache_zone_large, string);
681 __assert_unreachable();
684 static struct namecache *
685 cache_alloc_uma(int len, bool ts)
687 struct namecache_ts *ncp_ts;
688 struct namecache *ncp;
690 if (__predict_false(ts)) {
691 if (len <= CACHE_PATH_CUTOFF)
692 ncp_ts = uma_zalloc_smr(cache_zone_small_ts, M_WAITOK);
694 ncp_ts = uma_zalloc_smr(cache_zone_large_ts, M_WAITOK);
695 ncp = &ncp_ts->nc_nc;
697 if (len <= CACHE_PATH_CUTOFF)
698 ncp = uma_zalloc_smr(cache_zone_small, M_WAITOK);
700 ncp = uma_zalloc_smr(cache_zone_large, M_WAITOK);
706 cache_free_uma(struct namecache *ncp)
708 struct namecache_ts *ncp_ts;
710 if (__predict_false(ncp->nc_flag & NCF_TS)) {
711 ncp_ts = __containerof(ncp, struct namecache_ts, nc_nc);
712 if (ncp->nc_nlen <= CACHE_PATH_CUTOFF)
713 uma_zfree_smr(cache_zone_small_ts, ncp_ts);
715 uma_zfree_smr(cache_zone_large_ts, ncp_ts);
717 if (ncp->nc_nlen <= CACHE_PATH_CUTOFF)
718 uma_zfree_smr(cache_zone_small, ncp);
720 uma_zfree_smr(cache_zone_large, ncp);
724 static struct namecache *
725 cache_alloc(int len, bool ts)
730 * Avoid blowout in namecache entries.
733 * 1. filesystems may end up trying to add an already existing entry
734 * (for example this can happen after a cache miss during concurrent
735 * lookup), in which case we will call cache_neg_evict despite not
737 * 2. the routine may fail to free anything and no provisions are made
738 * to make it try harder (see the inside for failure modes)
739 * 3. it only ever looks at negative entries.
741 lnumcache = atomic_fetchadd_long(&numcache, 1) + 1;
742 if (cache_neg_evict_cond(lnumcache)) {
743 lnumcache = atomic_load_long(&numcache);
745 if (__predict_false(lnumcache >= ncsize)) {
746 atomic_subtract_long(&numcache, 1);
747 counter_u64_add(numdrops, 1);
750 return (cache_alloc_uma(len, ts));
754 cache_free(struct namecache *ncp)
758 if ((ncp->nc_flag & NCF_DVDROP) != 0) {
759 cache_drop_vnode(ncp->nc_dvp);
762 atomic_subtract_long(&numcache, 1);
766 cache_free_batch(struct cache_freebatch *batch)
768 struct namecache *ncp, *nnp;
772 if (TAILQ_EMPTY(batch))
774 TAILQ_FOREACH_SAFE(ncp, batch, nc_dst, nnp) {
775 if ((ncp->nc_flag & NCF_DVDROP) != 0) {
776 cache_drop_vnode(ncp->nc_dvp);
781 atomic_subtract_long(&numcache, i);
783 SDT_PROBE1(vfs, namecache, purge, batch, i);
789 * The code was made to use FNV in 2001 and this choice needs to be revisited.
791 * Short summary of the difficulty:
792 * The longest name which can be inserted is NAME_MAX characters in length (or
793 * 255 at the time of writing this comment), while majority of names used in
794 * practice are significantly shorter (mostly below 10). More importantly
795 * majority of lookups performed find names are even shorter than that.
797 * This poses a problem where hashes which do better than FNV past word size
798 * (or so) tend to come with additional overhead when finalizing the result,
799 * making them noticeably slower for the most commonly used range.
801 * Consider a path like: /usr/obj/usr/src/sys/amd64/GENERIC/vnode_if.c
803 * When looking it up the most time consuming part by a large margin (at least
804 * on amd64) is hashing. Replacing FNV with something which pessimizes short
805 * input would make the slowest part stand out even more.
809 * TODO: With the value stored we can do better than computing the hash based
813 cache_prehash(struct vnode *vp)
816 vp->v_nchash = fnv_32_buf(&vp, sizeof(vp), FNV1_32_INIT);
820 cache_get_hash(char *name, u_char len, struct vnode *dvp)
823 return (fnv_32_buf(name, len, dvp->v_nchash));
827 cache_get_hash_iter_start(struct vnode *dvp)
830 return (dvp->v_nchash);
834 cache_get_hash_iter(char c, uint32_t hash)
837 return (fnv_32_buf(&c, 1, hash));
841 cache_get_hash_iter_finish(uint32_t hash)
847 static inline struct nchashhead *
848 NCP2BUCKET(struct namecache *ncp)
852 hash = cache_get_hash(ncp->nc_name, ncp->nc_nlen, ncp->nc_dvp);
853 return (NCHHASH(hash));
856 static inline struct mtx *
857 NCP2BUCKETLOCK(struct namecache *ncp)
861 hash = cache_get_hash(ncp->nc_name, ncp->nc_nlen, ncp->nc_dvp);
862 return (HASH2BUCKETLOCK(hash));
867 cache_assert_bucket_locked(struct namecache *ncp)
871 blp = NCP2BUCKETLOCK(ncp);
872 mtx_assert(blp, MA_OWNED);
876 cache_assert_bucket_unlocked(struct namecache *ncp)
880 blp = NCP2BUCKETLOCK(ncp);
881 mtx_assert(blp, MA_NOTOWNED);
884 #define cache_assert_bucket_locked(x) do { } while (0)
885 #define cache_assert_bucket_unlocked(x) do { } while (0)
888 #define cache_sort_vnodes(x, y) _cache_sort_vnodes((void **)(x), (void **)(y))
890 _cache_sort_vnodes(void **p1, void **p2)
894 MPASS(*p1 != NULL || *p2 != NULL);
904 cache_lock_all_buckets(void)
908 for (i = 0; i < numbucketlocks; i++)
909 mtx_lock(&bucketlocks[i]);
913 cache_unlock_all_buckets(void)
917 for (i = 0; i < numbucketlocks; i++)
918 mtx_unlock(&bucketlocks[i]);
922 cache_lock_all_vnodes(void)
926 for (i = 0; i < numvnodelocks; i++)
927 mtx_lock(&vnodelocks[i]);
931 cache_unlock_all_vnodes(void)
935 for (i = 0; i < numvnodelocks; i++)
936 mtx_unlock(&vnodelocks[i]);
940 cache_trylock_vnodes(struct mtx *vlp1, struct mtx *vlp2)
943 cache_sort_vnodes(&vlp1, &vlp2);
946 if (!mtx_trylock(vlp1))
949 if (!mtx_trylock(vlp2)) {
959 cache_lock_vnodes(struct mtx *vlp1, struct mtx *vlp2)
962 MPASS(vlp1 != NULL || vlp2 != NULL);
972 cache_unlock_vnodes(struct mtx *vlp1, struct mtx *vlp2)
975 MPASS(vlp1 != NULL || vlp2 != NULL);
984 sysctl_nchstats(SYSCTL_HANDLER_ARGS)
986 struct nchstats snap;
988 if (req->oldptr == NULL)
989 return (SYSCTL_OUT(req, 0, sizeof(snap)));
992 snap.ncs_goodhits = counter_u64_fetch(numposhits);
993 snap.ncs_neghits = counter_u64_fetch(numneghits);
994 snap.ncs_badhits = counter_u64_fetch(numposzaps) +
995 counter_u64_fetch(numnegzaps);
996 snap.ncs_miss = counter_u64_fetch(nummisszap) +
997 counter_u64_fetch(nummiss);
999 return (SYSCTL_OUT(req, &snap, sizeof(snap)));
1001 SYSCTL_PROC(_vfs_cache, OID_AUTO, nchstats, CTLTYPE_OPAQUE | CTLFLAG_RD |
1002 CTLFLAG_MPSAFE, 0, 0, sysctl_nchstats, "LU",
1003 "VFS cache effectiveness statistics");
1006 cache_recalc_neg_min(u_int val)
1009 neg_min = (ncsize * val) / 100;
1013 sysctl_negminpct(SYSCTL_HANDLER_ARGS)
1019 error = sysctl_handle_int(oidp, &val, 0, req);
1020 if (error != 0 || req->newptr == NULL)
1023 if (val == ncnegminpct)
1025 if (val < 0 || val > 99)
1028 cache_recalc_neg_min(val);
1032 SYSCTL_PROC(_vfs_cache_param, OID_AUTO, negminpct,
1033 CTLTYPE_INT | CTLFLAG_MPSAFE | CTLFLAG_RW, NULL, 0, sysctl_negminpct,
1034 "I", "Negative entry \% of namecache capacity above which automatic eviction is allowed");
1038 * Grab an atomic snapshot of the name cache hash chain lengths
1040 static SYSCTL_NODE(_debug, OID_AUTO, hashstat,
1041 CTLFLAG_RW | CTLFLAG_MPSAFE, NULL,
1042 "hash table stats");
1045 sysctl_debug_hashstat_rawnchash(SYSCTL_HANDLER_ARGS)
1047 struct nchashhead *ncpp;
1048 struct namecache *ncp;
1049 int i, error, n_nchash, *cntbuf;
1052 n_nchash = nchash + 1; /* nchash is max index, not count */
1053 if (req->oldptr == NULL)
1054 return SYSCTL_OUT(req, 0, n_nchash * sizeof(int));
1055 cntbuf = malloc(n_nchash * sizeof(int), M_TEMP, M_ZERO | M_WAITOK);
1056 cache_lock_all_buckets();
1057 if (n_nchash != nchash + 1) {
1058 cache_unlock_all_buckets();
1059 free(cntbuf, M_TEMP);
1062 /* Scan hash tables counting entries */
1063 for (ncpp = nchashtbl, i = 0; i < n_nchash; ncpp++, i++)
1064 CK_SLIST_FOREACH(ncp, ncpp, nc_hash)
1066 cache_unlock_all_buckets();
1067 for (error = 0, i = 0; i < n_nchash; i++)
1068 if ((error = SYSCTL_OUT(req, &cntbuf[i], sizeof(int))) != 0)
1070 free(cntbuf, M_TEMP);
1073 SYSCTL_PROC(_debug_hashstat, OID_AUTO, rawnchash, CTLTYPE_INT|CTLFLAG_RD|
1074 CTLFLAG_MPSAFE, 0, 0, sysctl_debug_hashstat_rawnchash, "S,int",
1075 "nchash chain lengths");
1078 sysctl_debug_hashstat_nchash(SYSCTL_HANDLER_ARGS)
1081 struct nchashhead *ncpp;
1082 struct namecache *ncp;
1084 int count, maxlength, used, pct;
1087 return SYSCTL_OUT(req, 0, 4 * sizeof(int));
1089 cache_lock_all_buckets();
1090 n_nchash = nchash + 1; /* nchash is max index, not count */
1094 /* Scan hash tables for applicable entries */
1095 for (ncpp = nchashtbl; n_nchash > 0; n_nchash--, ncpp++) {
1097 CK_SLIST_FOREACH(ncp, ncpp, nc_hash) {
1102 if (maxlength < count)
1105 n_nchash = nchash + 1;
1106 cache_unlock_all_buckets();
1107 pct = (used * 100) / (n_nchash / 100);
1108 error = SYSCTL_OUT(req, &n_nchash, sizeof(n_nchash));
1111 error = SYSCTL_OUT(req, &used, sizeof(used));
1114 error = SYSCTL_OUT(req, &maxlength, sizeof(maxlength));
1117 error = SYSCTL_OUT(req, &pct, sizeof(pct));
1122 SYSCTL_PROC(_debug_hashstat, OID_AUTO, nchash, CTLTYPE_INT|CTLFLAG_RD|
1123 CTLFLAG_MPSAFE, 0, 0, sysctl_debug_hashstat_nchash, "I",
1124 "nchash statistics (number of total/used buckets, maximum chain length, usage percentage)");
1128 * Negative entries management
1130 * Various workloads create plenty of negative entries and barely use them
1131 * afterwards. Moreover malicious users can keep performing bogus lookups
1132 * adding even more entries. For example "make tinderbox" as of writing this
1133 * comment ends up with 2.6M namecache entries in total, 1.2M of which are
1136 * As such, a rather aggressive eviction method is needed. The currently
1137 * employed method is a placeholder.
1139 * Entries are split over numneglists separate lists, each of which is further
1140 * split into hot and cold entries. Entries get promoted after getting a hit.
1141 * Eviction happens on addition of new entry.
1143 static SYSCTL_NODE(_vfs_cache, OID_AUTO, neg, CTLFLAG_RW | CTLFLAG_MPSAFE, 0,
1144 "Name cache negative entry statistics");
1146 SYSCTL_ULONG(_vfs_cache_neg, OID_AUTO, count, CTLFLAG_RD, &numneg, 0,
1147 "Number of negative cache entries");
1149 static COUNTER_U64_DEFINE_EARLY(neg_created);
1150 SYSCTL_COUNTER_U64(_vfs_cache_neg, OID_AUTO, created, CTLFLAG_RD, &neg_created,
1151 "Number of created negative entries");
1153 static COUNTER_U64_DEFINE_EARLY(neg_evicted);
1154 SYSCTL_COUNTER_U64(_vfs_cache_neg, OID_AUTO, evicted, CTLFLAG_RD, &neg_evicted,
1155 "Number of evicted negative entries");
1157 static COUNTER_U64_DEFINE_EARLY(neg_evict_skipped_empty);
1158 SYSCTL_COUNTER_U64(_vfs_cache_neg, OID_AUTO, evict_skipped_empty, CTLFLAG_RD,
1159 &neg_evict_skipped_empty,
1160 "Number of times evicting failed due to lack of entries");
1162 static COUNTER_U64_DEFINE_EARLY(neg_evict_skipped_missed);
1163 SYSCTL_COUNTER_U64(_vfs_cache_neg, OID_AUTO, evict_skipped_missed, CTLFLAG_RD,
1164 &neg_evict_skipped_missed,
1165 "Number of times evicting failed due to target entry disappearing");
1167 static COUNTER_U64_DEFINE_EARLY(neg_evict_skipped_contended);
1168 SYSCTL_COUNTER_U64(_vfs_cache_neg, OID_AUTO, evict_skipped_contended, CTLFLAG_RD,
1169 &neg_evict_skipped_contended,
1170 "Number of times evicting failed due to contention");
1172 SYSCTL_COUNTER_U64(_vfs_cache_neg, OID_AUTO, hits, CTLFLAG_RD, &numneghits,
1173 "Number of cache hits (negative)");
1176 sysctl_neg_hot(SYSCTL_HANDLER_ARGS)
1181 for (i = 0; i < numneglists; i++)
1182 out += neglists[i].nl_hotnum;
1184 return (SYSCTL_OUT(req, &out, sizeof(out)));
1186 SYSCTL_PROC(_vfs_cache_neg, OID_AUTO, hot, CTLTYPE_INT | CTLFLAG_RD |
1187 CTLFLAG_MPSAFE, 0, 0, sysctl_neg_hot, "I",
1188 "Number of hot negative entries");
1191 cache_neg_init(struct namecache *ncp)
1193 struct negstate *ns;
1195 ncp->nc_flag |= NCF_NEGATIVE;
1196 ns = NCP2NEGSTATE(ncp);
1199 counter_u64_add(neg_created, 1);
1202 #define CACHE_NEG_PROMOTION_THRESH 2
1205 cache_neg_hit_prep(struct namecache *ncp)
1207 struct negstate *ns;
1210 ns = NCP2NEGSTATE(ncp);
1211 n = atomic_load_char(&ns->neg_hit);
1213 if (n >= CACHE_NEG_PROMOTION_THRESH)
1215 if (atomic_fcmpset_8(&ns->neg_hit, &n, n + 1))
1218 return (n + 1 == CACHE_NEG_PROMOTION_THRESH);
1222 * Nothing to do here but it is provided for completeness as some
1223 * cache_neg_hit_prep callers may end up returning without even
1224 * trying to promote.
1226 #define cache_neg_hit_abort(ncp) do { } while (0)
1229 cache_neg_hit_finish(struct namecache *ncp)
1232 SDT_PROBE2(vfs, namecache, lookup, hit__negative, ncp->nc_dvp, ncp->nc_name);
1233 counter_u64_add(numneghits, 1);
1237 * Move a negative entry to the hot list.
1240 cache_neg_promote_locked(struct namecache *ncp)
1243 struct negstate *ns;
1245 ns = NCP2NEGSTATE(ncp);
1246 nl = NCP2NEGLIST(ncp);
1247 mtx_assert(&nl->nl_lock, MA_OWNED);
1248 if ((ns->neg_flag & NEG_HOT) == 0) {
1249 TAILQ_REMOVE(&nl->nl_list, ncp, nc_dst);
1250 TAILQ_INSERT_TAIL(&nl->nl_hotlist, ncp, nc_dst);
1252 ns->neg_flag |= NEG_HOT;
1257 * Move a hot negative entry to the cold list.
1260 cache_neg_demote_locked(struct namecache *ncp)
1263 struct negstate *ns;
1265 ns = NCP2NEGSTATE(ncp);
1266 nl = NCP2NEGLIST(ncp);
1267 mtx_assert(&nl->nl_lock, MA_OWNED);
1268 MPASS(ns->neg_flag & NEG_HOT);
1269 TAILQ_REMOVE(&nl->nl_hotlist, ncp, nc_dst);
1270 TAILQ_INSERT_TAIL(&nl->nl_list, ncp, nc_dst);
1272 ns->neg_flag &= ~NEG_HOT;
1273 atomic_store_char(&ns->neg_hit, 0);
1277 * Move a negative entry to the hot list if it matches the lookup.
1279 * We have to take locks, but they may be contended and in the worst
1280 * case we may need to go off CPU. We don't want to spin within the
1281 * smr section and we can't block with it. Exiting the section means
1282 * the found entry could have been evicted. We are going to look it
1286 cache_neg_promote_cond(struct vnode *dvp, struct componentname *cnp,
1287 struct namecache *oncp, uint32_t hash)
1289 struct namecache *ncp;
1293 nl = NCP2NEGLIST(oncp);
1295 mtx_lock(&nl->nl_lock);
1297 * For hash iteration.
1302 * Avoid all surprises by only succeeding if we got the same entry and
1303 * bailing completely otherwise.
1304 * XXX There are no provisions to keep the vnode around, meaning we may
1305 * end up promoting a negative entry for a *new* vnode and returning
1306 * ENOENT on its account. This is the error we want to return anyway
1307 * and promotion is harmless.
1309 * In particular at this point there can be a new ncp which matches the
1310 * search but hashes to a different neglist.
1312 CK_SLIST_FOREACH(ncp, (NCHHASH(hash)), nc_hash) {
1318 * No match to begin with.
1320 if (__predict_false(ncp == NULL)) {
1325 * The newly found entry may be something different...
1327 if (!(ncp->nc_dvp == dvp && ncp->nc_nlen == cnp->cn_namelen &&
1328 !bcmp(ncp->nc_name, cnp->cn_nameptr, ncp->nc_nlen))) {
1333 * ... and not even negative.
1335 nc_flag = atomic_load_char(&ncp->nc_flag);
1336 if ((nc_flag & NCF_NEGATIVE) == 0) {
1340 if (!cache_ncp_canuse(ncp)) {
1344 cache_neg_promote_locked(ncp);
1345 cache_neg_hit_finish(ncp);
1347 mtx_unlock(&nl->nl_lock);
1351 mtx_unlock(&nl->nl_lock);
1356 cache_neg_promote(struct namecache *ncp)
1360 nl = NCP2NEGLIST(ncp);
1361 mtx_lock(&nl->nl_lock);
1362 cache_neg_promote_locked(ncp);
1363 mtx_unlock(&nl->nl_lock);
1367 cache_neg_insert(struct namecache *ncp)
1371 MPASS(ncp->nc_flag & NCF_NEGATIVE);
1372 cache_assert_bucket_locked(ncp);
1373 nl = NCP2NEGLIST(ncp);
1374 mtx_lock(&nl->nl_lock);
1375 TAILQ_INSERT_TAIL(&nl->nl_list, ncp, nc_dst);
1376 mtx_unlock(&nl->nl_lock);
1377 atomic_add_long(&numneg, 1);
1381 cache_neg_remove(struct namecache *ncp)
1384 struct negstate *ns;
1386 cache_assert_bucket_locked(ncp);
1387 nl = NCP2NEGLIST(ncp);
1388 ns = NCP2NEGSTATE(ncp);
1389 mtx_lock(&nl->nl_lock);
1390 if ((ns->neg_flag & NEG_HOT) != 0) {
1391 TAILQ_REMOVE(&nl->nl_hotlist, ncp, nc_dst);
1394 TAILQ_REMOVE(&nl->nl_list, ncp, nc_dst);
1396 mtx_unlock(&nl->nl_lock);
1397 atomic_subtract_long(&numneg, 1);
1400 static struct neglist *
1401 cache_neg_evict_select_list(void)
1406 c = atomic_fetchadd_int(&neg_cycle, 1) + 1;
1407 nl = &neglists[c % numneglists];
1408 if (!mtx_trylock(&nl->nl_evict_lock)) {
1409 counter_u64_add(neg_evict_skipped_contended, 1);
1415 static struct namecache *
1416 cache_neg_evict_select_entry(struct neglist *nl)
1418 struct namecache *ncp, *lncp;
1419 struct negstate *ns, *lns;
1422 mtx_assert(&nl->nl_evict_lock, MA_OWNED);
1423 mtx_assert(&nl->nl_lock, MA_OWNED);
1424 ncp = TAILQ_FIRST(&nl->nl_list);
1428 lns = NCP2NEGSTATE(lncp);
1429 for (i = 1; i < 4; i++) {
1430 ncp = TAILQ_NEXT(ncp, nc_dst);
1433 ns = NCP2NEGSTATE(ncp);
1434 if (ns->neg_hit < lns->neg_hit) {
1443 cache_neg_evict(void)
1445 struct namecache *ncp, *ncp2;
1454 nl = cache_neg_evict_select_list();
1459 mtx_lock(&nl->nl_lock);
1460 ncp = TAILQ_FIRST(&nl->nl_hotlist);
1462 cache_neg_demote_locked(ncp);
1464 ncp = cache_neg_evict_select_entry(nl);
1466 counter_u64_add(neg_evict_skipped_empty, 1);
1467 mtx_unlock(&nl->nl_lock);
1468 mtx_unlock(&nl->nl_evict_lock);
1471 nlen = ncp->nc_nlen;
1473 hash = cache_get_hash(ncp->nc_name, nlen, dvp);
1474 dvlp = VP2VNODELOCK(dvp);
1475 blp = HASH2BUCKETLOCK(hash);
1476 mtx_unlock(&nl->nl_lock);
1477 mtx_unlock(&nl->nl_evict_lock);
1481 * Note that since all locks were dropped above, the entry may be
1482 * gone or reallocated to be something else.
1484 CK_SLIST_FOREACH(ncp2, (NCHHASH(hash)), nc_hash) {
1485 if (ncp2 == ncp && ncp2->nc_dvp == dvp &&
1486 ncp2->nc_nlen == nlen && (ncp2->nc_flag & NCF_NEGATIVE) != 0)
1490 counter_u64_add(neg_evict_skipped_missed, 1);
1494 MPASS(dvlp == VP2VNODELOCK(ncp->nc_dvp));
1495 MPASS(blp == NCP2BUCKETLOCK(ncp));
1496 SDT_PROBE2(vfs, namecache, evict_negative, done, ncp->nc_dvp,
1498 cache_zap_locked(ncp);
1499 counter_u64_add(neg_evicted, 1);
1510 * Maybe evict a negative entry to create more room.
1512 * The ncnegfactor parameter limits what fraction of the total count
1513 * can comprise of negative entries. However, if the cache is just
1514 * warming up this leads to excessive evictions. As such, ncnegminpct
1515 * (recomputed to neg_min) dictates whether the above should be
1518 * Try evicting if the cache is close to full capacity regardless of
1519 * other considerations.
1522 cache_neg_evict_cond(u_long lnumcache)
1526 if (ncsize - 1000 < lnumcache)
1528 lnumneg = atomic_load_long(&numneg);
1529 if (lnumneg < neg_min)
1531 if (lnumneg * ncnegfactor < lnumcache)
1534 return (cache_neg_evict());
1538 * cache_zap_locked():
1540 * Removes a namecache entry from cache, whether it contains an actual
1541 * pointer to a vnode or if it is just a negative cache entry.
1544 cache_zap_locked(struct namecache *ncp)
1546 struct nchashhead *ncpp;
1547 struct vnode *dvp, *vp;
1552 if (!(ncp->nc_flag & NCF_NEGATIVE))
1553 cache_assert_vnode_locked(vp);
1554 cache_assert_vnode_locked(dvp);
1555 cache_assert_bucket_locked(ncp);
1557 cache_ncp_invalidate(ncp);
1559 ncpp = NCP2BUCKET(ncp);
1560 CK_SLIST_REMOVE(ncpp, ncp, namecache, nc_hash);
1561 if (!(ncp->nc_flag & NCF_NEGATIVE)) {
1562 SDT_PROBE3(vfs, namecache, zap, done, dvp, ncp->nc_name, vp);
1563 TAILQ_REMOVE(&vp->v_cache_dst, ncp, nc_dst);
1564 if (ncp == vp->v_cache_dd) {
1565 atomic_store_ptr(&vp->v_cache_dd, NULL);
1568 SDT_PROBE2(vfs, namecache, zap_negative, done, dvp, ncp->nc_name);
1569 cache_neg_remove(ncp);
1571 if (ncp->nc_flag & NCF_ISDOTDOT) {
1572 if (ncp == dvp->v_cache_dd) {
1573 atomic_store_ptr(&dvp->v_cache_dd, NULL);
1576 LIST_REMOVE(ncp, nc_src);
1577 if (LIST_EMPTY(&dvp->v_cache_src)) {
1578 ncp->nc_flag |= NCF_DVDROP;
1584 cache_zap_negative_locked_vnode_kl(struct namecache *ncp, struct vnode *vp)
1588 MPASS(ncp->nc_dvp == vp);
1589 MPASS(ncp->nc_flag & NCF_NEGATIVE);
1590 cache_assert_vnode_locked(vp);
1592 blp = NCP2BUCKETLOCK(ncp);
1594 cache_zap_locked(ncp);
1599 cache_zap_locked_vnode_kl2(struct namecache *ncp, struct vnode *vp,
1602 struct mtx *pvlp, *vlp1, *vlp2, *to_unlock;
1605 MPASS(vp == ncp->nc_dvp || vp == ncp->nc_vp);
1606 cache_assert_vnode_locked(vp);
1608 if (ncp->nc_flag & NCF_NEGATIVE) {
1609 if (*vlpp != NULL) {
1613 cache_zap_negative_locked_vnode_kl(ncp, vp);
1617 pvlp = VP2VNODELOCK(vp);
1618 blp = NCP2BUCKETLOCK(ncp);
1619 vlp1 = VP2VNODELOCK(ncp->nc_dvp);
1620 vlp2 = VP2VNODELOCK(ncp->nc_vp);
1622 if (*vlpp == vlp1 || *vlpp == vlp2) {
1626 if (*vlpp != NULL) {
1630 cache_sort_vnodes(&vlp1, &vlp2);
1635 if (!mtx_trylock(vlp1))
1641 cache_zap_locked(ncp);
1643 if (to_unlock != NULL)
1644 mtx_unlock(to_unlock);
1651 MPASS(*vlpp == NULL);
1657 * If trylocking failed we can get here. We know enough to take all needed locks
1658 * in the right order and re-lookup the entry.
1661 cache_zap_unlocked_bucket(struct namecache *ncp, struct componentname *cnp,
1662 struct vnode *dvp, struct mtx *dvlp, struct mtx *vlp, uint32_t hash,
1665 struct namecache *rncp;
1667 cache_assert_bucket_unlocked(ncp);
1669 cache_sort_vnodes(&dvlp, &vlp);
1670 cache_lock_vnodes(dvlp, vlp);
1672 CK_SLIST_FOREACH(rncp, (NCHHASH(hash)), nc_hash) {
1673 if (rncp == ncp && rncp->nc_dvp == dvp &&
1674 rncp->nc_nlen == cnp->cn_namelen &&
1675 !bcmp(rncp->nc_name, cnp->cn_nameptr, rncp->nc_nlen))
1679 cache_zap_locked(rncp);
1681 cache_unlock_vnodes(dvlp, vlp);
1682 counter_u64_add(zap_bucket_relock_success, 1);
1687 cache_unlock_vnodes(dvlp, vlp);
1691 static int __noinline
1692 cache_zap_locked_bucket(struct namecache *ncp, struct componentname *cnp,
1693 uint32_t hash, struct mtx *blp)
1695 struct mtx *dvlp, *vlp;
1698 cache_assert_bucket_locked(ncp);
1700 dvlp = VP2VNODELOCK(ncp->nc_dvp);
1702 if (!(ncp->nc_flag & NCF_NEGATIVE))
1703 vlp = VP2VNODELOCK(ncp->nc_vp);
1704 if (cache_trylock_vnodes(dvlp, vlp) == 0) {
1705 cache_zap_locked(ncp);
1707 cache_unlock_vnodes(dvlp, vlp);
1713 return (cache_zap_unlocked_bucket(ncp, cnp, dvp, dvlp, vlp, hash, blp));
1716 static __noinline int
1717 cache_remove_cnp(struct vnode *dvp, struct componentname *cnp)
1719 struct namecache *ncp;
1721 struct mtx *dvlp, *dvlp2;
1725 if (cnp->cn_namelen == 2 &&
1726 cnp->cn_nameptr[0] == '.' && cnp->cn_nameptr[1] == '.') {
1727 dvlp = VP2VNODELOCK(dvp);
1731 ncp = dvp->v_cache_dd;
1736 SDT_PROBE2(vfs, namecache, removecnp, miss, dvp, cnp);
1739 if ((ncp->nc_flag & NCF_ISDOTDOT) != 0) {
1740 if (!cache_zap_locked_vnode_kl2(ncp, dvp, &dvlp2))
1742 MPASS(dvp->v_cache_dd == NULL);
1748 atomic_store_ptr(&dvp->v_cache_dd, NULL);
1753 SDT_PROBE2(vfs, namecache, removecnp, hit, dvp, cnp);
1757 hash = cache_get_hash(cnp->cn_nameptr, cnp->cn_namelen, dvp);
1758 blp = HASH2BUCKETLOCK(hash);
1760 if (CK_SLIST_EMPTY(NCHHASH(hash)))
1765 CK_SLIST_FOREACH(ncp, (NCHHASH(hash)), nc_hash) {
1766 if (ncp->nc_dvp == dvp && ncp->nc_nlen == cnp->cn_namelen &&
1767 !bcmp(ncp->nc_name, cnp->cn_nameptr, ncp->nc_nlen))
1776 error = cache_zap_locked_bucket(ncp, cnp, hash, blp);
1777 if (__predict_false(error != 0)) {
1781 counter_u64_add(numposzaps, 1);
1782 SDT_PROBE2(vfs, namecache, removecnp, hit, dvp, cnp);
1786 counter_u64_add(nummisszap, 1);
1787 SDT_PROBE2(vfs, namecache, removecnp, miss, dvp, cnp);
1791 static int __noinline
1792 cache_lookup_dot(struct vnode *dvp, struct vnode **vpp, struct componentname *cnp,
1793 struct timespec *tsp, int *ticksp)
1798 counter_u64_add(dothits, 1);
1799 SDT_PROBE3(vfs, namecache, lookup, hit, dvp, ".", *vpp);
1806 * When we lookup "." we still can be asked to lock it
1809 ltype = cnp->cn_lkflags & LK_TYPE_MASK;
1810 if (ltype != VOP_ISLOCKED(*vpp)) {
1811 if (ltype == LK_EXCLUSIVE) {
1812 vn_lock(*vpp, LK_UPGRADE | LK_RETRY);
1813 if (VN_IS_DOOMED((*vpp))) {
1814 /* forced unmount */
1820 vn_lock(*vpp, LK_DOWNGRADE | LK_RETRY);
1825 static int __noinline
1826 cache_lookup_dotdot(struct vnode *dvp, struct vnode **vpp, struct componentname *cnp,
1827 struct timespec *tsp, int *ticksp)
1829 struct namecache_ts *ncp_ts;
1830 struct namecache *ncp;
1836 MPASS((cnp->cn_flags & ISDOTDOT) != 0);
1838 if ((cnp->cn_flags & MAKEENTRY) == 0) {
1839 cache_remove_cnp(dvp, cnp);
1843 counter_u64_add(dotdothits, 1);
1845 dvlp = VP2VNODELOCK(dvp);
1847 ncp = dvp->v_cache_dd;
1849 SDT_PROBE2(vfs, namecache, lookup, miss, dvp, "..");
1853 if ((ncp->nc_flag & NCF_ISDOTDOT) != 0) {
1854 if (ncp->nc_flag & NCF_NEGATIVE)
1861 goto negative_success;
1862 SDT_PROBE3(vfs, namecache, lookup, hit, dvp, "..", *vpp);
1863 cache_out_ts(ncp, tsp, ticksp);
1864 if ((ncp->nc_flag & (NCF_ISDOTDOT | NCF_DTS)) ==
1865 NCF_DTS && tsp != NULL) {
1866 ncp_ts = __containerof(ncp, struct namecache_ts, nc_nc);
1867 *tsp = ncp_ts->nc_dotdottime;
1871 ltype = VOP_ISLOCKED(dvp);
1873 vs = vget_prep(*vpp);
1875 error = vget_finish(*vpp, cnp->cn_lkflags, vs);
1876 vn_lock(dvp, ltype | LK_RETRY);
1877 if (VN_IS_DOOMED(dvp)) {
1889 if (__predict_false(cnp->cn_nameiop == CREATE)) {
1890 if (cnp->cn_flags & ISLASTCN) {
1891 counter_u64_add(numnegzaps, 1);
1892 cache_zap_negative_locked_vnode_kl(ncp, dvp);
1899 whiteout = (ncp->nc_flag & NCF_WHITE);
1900 cache_out_ts(ncp, tsp, ticksp);
1901 if (cache_neg_hit_prep(ncp))
1902 cache_neg_promote(ncp);
1904 cache_neg_hit_finish(ncp);
1907 cnp->cn_flags |= ISWHITEOUT;
1912 * Lookup a name in the name cache
1916 * - dvp: Parent directory in which to search.
1917 * - vpp: Return argument. Will contain desired vnode on cache hit.
1918 * - cnp: Parameters of the name search. The most interesting bits of
1919 * the cn_flags field have the following meanings:
1920 * - MAKEENTRY: If clear, free an entry from the cache rather than look
1922 * - ISDOTDOT: Must be set if and only if cn_nameptr == ".."
1923 * - tsp: Return storage for cache timestamp. On a successful (positive
1924 * or negative) lookup, tsp will be filled with any timespec that
1925 * was stored when this cache entry was created. However, it will
1926 * be clear for "." entries.
1927 * - ticks: Return storage for alternate cache timestamp. On a successful
1928 * (positive or negative) lookup, it will contain the ticks value
1929 * that was current when the cache entry was created, unless cnp
1932 * Either both tsp and ticks have to be provided or neither of them.
1936 * - -1: A positive cache hit. vpp will contain the desired vnode.
1937 * - ENOENT: A negative cache hit, or dvp was recycled out from under us due
1938 * to a forced unmount. vpp will not be modified. If the entry
1939 * is a whiteout, then the ISWHITEOUT flag will be set in
1941 * - 0: A cache miss. vpp will not be modified.
1945 * On a cache hit, vpp will be returned locked and ref'd. If we're looking up
1946 * .., dvp is unlocked. If we're looking up . an extra ref is taken, but the
1947 * lock is not recursively acquired.
1949 static int __noinline
1950 cache_lookup_fallback(struct vnode *dvp, struct vnode **vpp, struct componentname *cnp,
1951 struct timespec *tsp, int *ticksp)
1953 struct namecache *ncp;
1960 MPASS((cnp->cn_flags & ISDOTDOT) == 0);
1961 MPASS((cnp->cn_flags & (MAKEENTRY | NC_KEEPPOSENTRY)) != 0);
1964 hash = cache_get_hash(cnp->cn_nameptr, cnp->cn_namelen, dvp);
1965 blp = HASH2BUCKETLOCK(hash);
1968 CK_SLIST_FOREACH(ncp, (NCHHASH(hash)), nc_hash) {
1969 if (ncp->nc_dvp == dvp && ncp->nc_nlen == cnp->cn_namelen &&
1970 !bcmp(ncp->nc_name, cnp->cn_nameptr, ncp->nc_nlen))
1974 if (__predict_false(ncp == NULL)) {
1976 SDT_PROBE2(vfs, namecache, lookup, miss, dvp, cnp->cn_nameptr);
1977 counter_u64_add(nummiss, 1);
1981 if (ncp->nc_flag & NCF_NEGATIVE)
1982 goto negative_success;
1984 counter_u64_add(numposhits, 1);
1986 SDT_PROBE3(vfs, namecache, lookup, hit, dvp, ncp->nc_name, *vpp);
1987 cache_out_ts(ncp, tsp, ticksp);
1989 vs = vget_prep(*vpp);
1991 error = vget_finish(*vpp, cnp->cn_lkflags, vs);
1999 * We don't get here with regular lookup apart from corner cases.
2001 if (__predict_true(cnp->cn_nameiop == CREATE)) {
2002 if (cnp->cn_flags & ISLASTCN) {
2003 counter_u64_add(numnegzaps, 1);
2004 error = cache_zap_locked_bucket(ncp, cnp, hash, blp);
2005 if (__predict_false(error != 0)) {
2014 whiteout = (ncp->nc_flag & NCF_WHITE);
2015 cache_out_ts(ncp, tsp, ticksp);
2016 if (cache_neg_hit_prep(ncp))
2017 cache_neg_promote(ncp);
2019 cache_neg_hit_finish(ncp);
2022 cnp->cn_flags |= ISWHITEOUT;
2027 cache_lookup(struct vnode *dvp, struct vnode **vpp, struct componentname *cnp,
2028 struct timespec *tsp, int *ticksp)
2030 struct namecache *ncp;
2034 bool whiteout, neg_promote;
2037 MPASS((tsp == NULL && ticksp == NULL) || (tsp != NULL && ticksp != NULL));
2040 if (__predict_false(!doingcache)) {
2041 cnp->cn_flags &= ~MAKEENTRY;
2046 if (__predict_false(cnp->cn_nameptr[0] == '.')) {
2047 if (cnp->cn_namelen == 1)
2048 return (cache_lookup_dot(dvp, vpp, cnp, tsp, ticksp));
2049 if (cnp->cn_namelen == 2 && cnp->cn_nameptr[1] == '.')
2050 return (cache_lookup_dotdot(dvp, vpp, cnp, tsp, ticksp));
2053 MPASS((cnp->cn_flags & ISDOTDOT) == 0);
2055 if ((cnp->cn_flags & (MAKEENTRY | NC_KEEPPOSENTRY)) == 0) {
2056 cache_remove_cnp(dvp, cnp);
2060 hash = cache_get_hash(cnp->cn_nameptr, cnp->cn_namelen, dvp);
2063 CK_SLIST_FOREACH(ncp, (NCHHASH(hash)), nc_hash) {
2064 if (ncp->nc_dvp == dvp && ncp->nc_nlen == cnp->cn_namelen &&
2065 !bcmp(ncp->nc_name, cnp->cn_nameptr, ncp->nc_nlen))
2069 if (__predict_false(ncp == NULL)) {
2071 SDT_PROBE2(vfs, namecache, lookup, miss, dvp, cnp->cn_nameptr);
2072 counter_u64_add(nummiss, 1);
2076 nc_flag = atomic_load_char(&ncp->nc_flag);
2077 if (nc_flag & NCF_NEGATIVE)
2078 goto negative_success;
2080 counter_u64_add(numposhits, 1);
2082 SDT_PROBE3(vfs, namecache, lookup, hit, dvp, ncp->nc_name, *vpp);
2083 cache_out_ts(ncp, tsp, ticksp);
2085 if (!cache_ncp_canuse(ncp)) {
2090 vs = vget_prep_smr(*vpp);
2092 if (__predict_false(vs == VGET_NONE)) {
2096 error = vget_finish(*vpp, cnp->cn_lkflags, vs);
2103 if (cnp->cn_nameiop == CREATE) {
2104 if (cnp->cn_flags & ISLASTCN) {
2110 cache_out_ts(ncp, tsp, ticksp);
2111 whiteout = (atomic_load_char(&ncp->nc_flag) & NCF_WHITE);
2112 neg_promote = cache_neg_hit_prep(ncp);
2113 if (!cache_ncp_canuse(ncp)) {
2114 cache_neg_hit_abort(ncp);
2120 if (!cache_neg_promote_cond(dvp, cnp, ncp, hash))
2123 cache_neg_hit_finish(ncp);
2127 cnp->cn_flags |= ISWHITEOUT;
2130 return (cache_lookup_fallback(dvp, vpp, cnp, tsp, ticksp));
2133 struct celockstate {
2137 CTASSERT((nitems(((struct celockstate *)0)->vlp) == 3));
2138 CTASSERT((nitems(((struct celockstate *)0)->blp) == 2));
2141 cache_celockstate_init(struct celockstate *cel)
2144 bzero(cel, sizeof(*cel));
2148 cache_lock_vnodes_cel(struct celockstate *cel, struct vnode *vp,
2151 struct mtx *vlp1, *vlp2;
2153 MPASS(cel->vlp[0] == NULL);
2154 MPASS(cel->vlp[1] == NULL);
2155 MPASS(cel->vlp[2] == NULL);
2157 MPASS(vp != NULL || dvp != NULL);
2159 vlp1 = VP2VNODELOCK(vp);
2160 vlp2 = VP2VNODELOCK(dvp);
2161 cache_sort_vnodes(&vlp1, &vlp2);
2172 cache_unlock_vnodes_cel(struct celockstate *cel)
2175 MPASS(cel->vlp[0] != NULL || cel->vlp[1] != NULL);
2177 if (cel->vlp[0] != NULL)
2178 mtx_unlock(cel->vlp[0]);
2179 if (cel->vlp[1] != NULL)
2180 mtx_unlock(cel->vlp[1]);
2181 if (cel->vlp[2] != NULL)
2182 mtx_unlock(cel->vlp[2]);
2186 cache_lock_vnodes_cel_3(struct celockstate *cel, struct vnode *vp)
2191 cache_assert_vlp_locked(cel->vlp[0]);
2192 cache_assert_vlp_locked(cel->vlp[1]);
2193 MPASS(cel->vlp[2] == NULL);
2196 vlp = VP2VNODELOCK(vp);
2199 if (vlp >= cel->vlp[1]) {
2202 if (mtx_trylock(vlp))
2204 cache_lock_vnodes_cel_3_failures++;
2205 cache_unlock_vnodes_cel(cel);
2206 if (vlp < cel->vlp[0]) {
2208 mtx_lock(cel->vlp[0]);
2209 mtx_lock(cel->vlp[1]);
2211 if (cel->vlp[0] != NULL)
2212 mtx_lock(cel->vlp[0]);
2214 mtx_lock(cel->vlp[1]);
2224 cache_lock_buckets_cel(struct celockstate *cel, struct mtx *blp1,
2228 MPASS(cel->blp[0] == NULL);
2229 MPASS(cel->blp[1] == NULL);
2231 cache_sort_vnodes(&blp1, &blp2);
2242 cache_unlock_buckets_cel(struct celockstate *cel)
2245 if (cel->blp[0] != NULL)
2246 mtx_unlock(cel->blp[0]);
2247 mtx_unlock(cel->blp[1]);
2251 * Lock part of the cache affected by the insertion.
2253 * This means vnodelocks for dvp, vp and the relevant bucketlock.
2254 * However, insertion can result in removal of an old entry. In this
2255 * case we have an additional vnode and bucketlock pair to lock.
2257 * That is, in the worst case we have to lock 3 vnodes and 2 bucketlocks, while
2258 * preserving the locking order (smaller address first).
2261 cache_enter_lock(struct celockstate *cel, struct vnode *dvp, struct vnode *vp,
2264 struct namecache *ncp;
2265 struct mtx *blps[2];
2268 blps[0] = HASH2BUCKETLOCK(hash);
2271 cache_lock_vnodes_cel(cel, dvp, vp);
2272 if (vp == NULL || vp->v_type != VDIR)
2274 ncp = atomic_load_consume_ptr(&vp->v_cache_dd);
2277 nc_flag = atomic_load_char(&ncp->nc_flag);
2278 if ((nc_flag & NCF_ISDOTDOT) == 0)
2280 MPASS(ncp->nc_dvp == vp);
2281 blps[1] = NCP2BUCKETLOCK(ncp);
2282 if ((nc_flag & NCF_NEGATIVE) != 0)
2284 if (cache_lock_vnodes_cel_3(cel, ncp->nc_vp))
2287 * All vnodes got re-locked. Re-validate the state and if
2288 * nothing changed we are done. Otherwise restart.
2290 if (ncp == vp->v_cache_dd &&
2291 (ncp->nc_flag & NCF_ISDOTDOT) != 0 &&
2292 blps[1] == NCP2BUCKETLOCK(ncp) &&
2293 VP2VNODELOCK(ncp->nc_vp) == cel->vlp[2])
2295 cache_unlock_vnodes_cel(cel);
2300 cache_lock_buckets_cel(cel, blps[0], blps[1]);
2304 cache_enter_lock_dd(struct celockstate *cel, struct vnode *dvp, struct vnode *vp,
2307 struct namecache *ncp;
2308 struct mtx *blps[2];
2311 blps[0] = HASH2BUCKETLOCK(hash);
2314 cache_lock_vnodes_cel(cel, dvp, vp);
2315 ncp = atomic_load_consume_ptr(&dvp->v_cache_dd);
2318 nc_flag = atomic_load_char(&ncp->nc_flag);
2319 if ((nc_flag & NCF_ISDOTDOT) == 0)
2321 MPASS(ncp->nc_dvp == dvp);
2322 blps[1] = NCP2BUCKETLOCK(ncp);
2323 if ((nc_flag & NCF_NEGATIVE) != 0)
2325 if (cache_lock_vnodes_cel_3(cel, ncp->nc_vp))
2327 if (ncp == dvp->v_cache_dd &&
2328 (ncp->nc_flag & NCF_ISDOTDOT) != 0 &&
2329 blps[1] == NCP2BUCKETLOCK(ncp) &&
2330 VP2VNODELOCK(ncp->nc_vp) == cel->vlp[2])
2332 cache_unlock_vnodes_cel(cel);
2337 cache_lock_buckets_cel(cel, blps[0], blps[1]);
2341 cache_enter_unlock(struct celockstate *cel)
2344 cache_unlock_buckets_cel(cel);
2345 cache_unlock_vnodes_cel(cel);
2348 static void __noinline
2349 cache_enter_dotdot_prep(struct vnode *dvp, struct vnode *vp,
2350 struct componentname *cnp)
2352 struct celockstate cel;
2353 struct namecache *ncp;
2357 if (atomic_load_ptr(&dvp->v_cache_dd) == NULL)
2359 len = cnp->cn_namelen;
2360 cache_celockstate_init(&cel);
2361 hash = cache_get_hash(cnp->cn_nameptr, len, dvp);
2362 cache_enter_lock_dd(&cel, dvp, vp, hash);
2363 ncp = dvp->v_cache_dd;
2364 if (ncp != NULL && (ncp->nc_flag & NCF_ISDOTDOT)) {
2365 KASSERT(ncp->nc_dvp == dvp, ("wrong isdotdot parent"));
2366 cache_zap_locked(ncp);
2370 atomic_store_ptr(&dvp->v_cache_dd, NULL);
2371 cache_enter_unlock(&cel);
2377 * Add an entry to the cache.
2380 cache_enter_time(struct vnode *dvp, struct vnode *vp, struct componentname *cnp,
2381 struct timespec *tsp, struct timespec *dtsp)
2383 struct celockstate cel;
2384 struct namecache *ncp, *n2, *ndd;
2385 struct namecache_ts *ncp_ts;
2386 struct nchashhead *ncpp;
2391 KASSERT(cnp->cn_namelen <= NAME_MAX,
2392 ("%s: passed len %ld exceeds NAME_MAX (%d)", __func__, cnp->cn_namelen,
2396 * Not everything doing this is weeded out yet.
2398 VNPASS(dvp != vp, dvp);
2400 VNPASS(!VN_IS_DOOMED(dvp), dvp);
2401 VNPASS(dvp->v_type != VNON, dvp);
2403 VNPASS(!VN_IS_DOOMED(vp), vp);
2404 VNPASS(vp->v_type != VNON, vp);
2408 if (__predict_false(!doingcache))
2413 if (__predict_false(cnp->cn_nameptr[0] == '.')) {
2414 if (cnp->cn_namelen == 1)
2416 if (cnp->cn_namelen == 2 && cnp->cn_nameptr[1] == '.') {
2417 cache_enter_dotdot_prep(dvp, vp, cnp);
2418 flag = NCF_ISDOTDOT;
2422 ncp = cache_alloc(cnp->cn_namelen, tsp != NULL);
2426 cache_celockstate_init(&cel);
2431 * Calculate the hash key and setup as much of the new
2432 * namecache entry as possible before acquiring the lock.
2434 ncp->nc_flag = flag | NCF_WIP;
2437 cache_neg_init(ncp);
2440 ncp_ts = __containerof(ncp, struct namecache_ts, nc_nc);
2441 ncp_ts->nc_time = *tsp;
2442 ncp_ts->nc_ticks = ticks;
2443 ncp_ts->nc_nc.nc_flag |= NCF_TS;
2445 ncp_ts->nc_dotdottime = *dtsp;
2446 ncp_ts->nc_nc.nc_flag |= NCF_DTS;
2449 len = ncp->nc_nlen = cnp->cn_namelen;
2450 hash = cache_get_hash(cnp->cn_nameptr, len, dvp);
2451 memcpy(ncp->nc_name, cnp->cn_nameptr, len);
2452 ncp->nc_name[len] = '\0';
2453 cache_enter_lock(&cel, dvp, vp, hash);
2456 * See if this vnode or negative entry is already in the cache
2457 * with this name. This can happen with concurrent lookups of
2458 * the same path name.
2460 ncpp = NCHHASH(hash);
2461 CK_SLIST_FOREACH(n2, ncpp, nc_hash) {
2462 if (n2->nc_dvp == dvp &&
2463 n2->nc_nlen == cnp->cn_namelen &&
2464 !bcmp(n2->nc_name, cnp->cn_nameptr, n2->nc_nlen)) {
2465 MPASS(cache_ncp_canuse(n2));
2466 if ((n2->nc_flag & NCF_NEGATIVE) != 0)
2468 ("%s: found entry pointing to a different vnode (%p != %p) ; name [%s]",
2469 __func__, NULL, vp, cnp->cn_nameptr));
2471 KASSERT(n2->nc_vp == vp,
2472 ("%s: found entry pointing to a different vnode (%p != %p) ; name [%s]",
2473 __func__, n2->nc_vp, vp, cnp->cn_nameptr));
2475 * Entries are supposed to be immutable unless in the
2476 * process of getting destroyed. Accommodating for
2477 * changing timestamps is possible but not worth it.
2478 * This should be harmless in terms of correctness, in
2479 * the worst case resulting in an earlier expiration.
2480 * Alternatively, the found entry can be replaced
2483 MPASS((n2->nc_flag & (NCF_TS | NCF_DTS)) == (ncp->nc_flag & (NCF_TS | NCF_DTS)));
2486 KASSERT((n2->nc_flag & NCF_TS) != 0,
2488 n2_ts = __containerof(n2, struct namecache_ts, nc_nc);
2489 n2_ts->nc_time = ncp_ts->nc_time;
2490 n2_ts->nc_ticks = ncp_ts->nc_ticks;
2492 n2_ts->nc_dotdottime = ncp_ts->nc_dotdottime;
2493 n2_ts->nc_nc.nc_flag |= NCF_DTS;
2497 SDT_PROBE3(vfs, namecache, enter, duplicate, dvp, ncp->nc_name,
2499 goto out_unlock_free;
2503 if (flag == NCF_ISDOTDOT) {
2505 * See if we are trying to add .. entry, but some other lookup
2506 * has populated v_cache_dd pointer already.
2508 if (dvp->v_cache_dd != NULL)
2509 goto out_unlock_free;
2510 KASSERT(vp == NULL || vp->v_type == VDIR,
2511 ("wrong vnode type %p", vp));
2512 atomic_thread_fence_rel();
2513 atomic_store_ptr(&dvp->v_cache_dd, ncp);
2517 if (flag != NCF_ISDOTDOT) {
2519 * For this case, the cache entry maps both the
2520 * directory name in it and the name ".." for the
2521 * directory's parent.
2523 if ((ndd = vp->v_cache_dd) != NULL) {
2524 if ((ndd->nc_flag & NCF_ISDOTDOT) != 0)
2525 cache_zap_locked(ndd);
2529 atomic_thread_fence_rel();
2530 atomic_store_ptr(&vp->v_cache_dd, ncp);
2531 } else if (vp->v_type != VDIR) {
2532 if (vp->v_cache_dd != NULL) {
2533 atomic_store_ptr(&vp->v_cache_dd, NULL);
2538 if (flag != NCF_ISDOTDOT) {
2539 if (LIST_EMPTY(&dvp->v_cache_src)) {
2540 cache_hold_vnode(dvp);
2542 LIST_INSERT_HEAD(&dvp->v_cache_src, ncp, nc_src);
2546 * If the entry is "negative", we place it into the
2547 * "negative" cache queue, otherwise, we place it into the
2548 * destination vnode's cache entries queue.
2551 TAILQ_INSERT_HEAD(&vp->v_cache_dst, ncp, nc_dst);
2552 SDT_PROBE3(vfs, namecache, enter, done, dvp, ncp->nc_name,
2555 if (cnp->cn_flags & ISWHITEOUT)
2556 atomic_store_char(&ncp->nc_flag, ncp->nc_flag | NCF_WHITE);
2557 cache_neg_insert(ncp);
2558 SDT_PROBE2(vfs, namecache, enter_negative, done, dvp,
2563 * Insert the new namecache entry into the appropriate chain
2564 * within the cache entries table.
2566 CK_SLIST_INSERT_HEAD(ncpp, ncp, nc_hash);
2568 atomic_thread_fence_rel();
2570 * Mark the entry as fully constructed.
2571 * It is immutable past this point until its removal.
2573 atomic_store_char(&ncp->nc_flag, ncp->nc_flag & ~NCF_WIP);
2575 cache_enter_unlock(&cel);
2580 cache_enter_unlock(&cel);
2586 cache_roundup_2(u_int val)
2590 for (res = 1; res <= val; res <<= 1)
2596 static struct nchashhead *
2597 nchinittbl(u_long elements, u_long *hashmask)
2599 struct nchashhead *hashtbl;
2602 hashsize = cache_roundup_2(elements) / 2;
2604 hashtbl = malloc((u_long)hashsize * sizeof(*hashtbl), M_VFSCACHE, M_WAITOK);
2605 for (i = 0; i < hashsize; i++)
2606 CK_SLIST_INIT(&hashtbl[i]);
2607 *hashmask = hashsize - 1;
2612 ncfreetbl(struct nchashhead *hashtbl)
2615 free(hashtbl, M_VFSCACHE);
2619 * Name cache initialization, from vfs_init() when we are booting
2622 nchinit(void *dummy __unused)
2626 cache_zone_small = uma_zcreate("S VFS Cache", CACHE_ZONE_SMALL_SIZE,
2627 NULL, NULL, NULL, NULL, CACHE_ZONE_ALIGNMENT, UMA_ZONE_ZINIT);
2628 cache_zone_small_ts = uma_zcreate("STS VFS Cache", CACHE_ZONE_SMALL_TS_SIZE,
2629 NULL, NULL, NULL, NULL, CACHE_ZONE_ALIGNMENT, UMA_ZONE_ZINIT);
2630 cache_zone_large = uma_zcreate("L VFS Cache", CACHE_ZONE_LARGE_SIZE,
2631 NULL, NULL, NULL, NULL, CACHE_ZONE_ALIGNMENT, UMA_ZONE_ZINIT);
2632 cache_zone_large_ts = uma_zcreate("LTS VFS Cache", CACHE_ZONE_LARGE_TS_SIZE,
2633 NULL, NULL, NULL, NULL, CACHE_ZONE_ALIGNMENT, UMA_ZONE_ZINIT);
2635 VFS_SMR_ZONE_SET(cache_zone_small);
2636 VFS_SMR_ZONE_SET(cache_zone_small_ts);
2637 VFS_SMR_ZONE_SET(cache_zone_large);
2638 VFS_SMR_ZONE_SET(cache_zone_large_ts);
2640 ncsize = desiredvnodes * ncsizefactor;
2641 cache_recalc_neg_min(ncnegminpct);
2642 nchashtbl = nchinittbl(desiredvnodes * 2, &nchash);
2643 ncbuckethash = cache_roundup_2(mp_ncpus * mp_ncpus) - 1;
2644 if (ncbuckethash < 7) /* arbitrarily chosen to avoid having one lock */
2646 if (ncbuckethash > nchash)
2647 ncbuckethash = nchash;
2648 bucketlocks = malloc(sizeof(*bucketlocks) * numbucketlocks, M_VFSCACHE,
2650 for (i = 0; i < numbucketlocks; i++)
2651 mtx_init(&bucketlocks[i], "ncbuc", NULL, MTX_DUPOK | MTX_RECURSE);
2652 ncvnodehash = ncbuckethash;
2653 vnodelocks = malloc(sizeof(*vnodelocks) * numvnodelocks, M_VFSCACHE,
2655 for (i = 0; i < numvnodelocks; i++)
2656 mtx_init(&vnodelocks[i], "ncvn", NULL, MTX_DUPOK | MTX_RECURSE);
2658 for (i = 0; i < numneglists; i++) {
2659 mtx_init(&neglists[i].nl_evict_lock, "ncnege", NULL, MTX_DEF);
2660 mtx_init(&neglists[i].nl_lock, "ncnegl", NULL, MTX_DEF);
2661 TAILQ_INIT(&neglists[i].nl_list);
2662 TAILQ_INIT(&neglists[i].nl_hotlist);
2665 SYSINIT(vfs, SI_SUB_VFS, SI_ORDER_SECOND, nchinit, NULL);
2668 cache_vnode_init(struct vnode *vp)
2671 LIST_INIT(&vp->v_cache_src);
2672 TAILQ_INIT(&vp->v_cache_dst);
2673 vp->v_cache_dd = NULL;
2678 * Induce transient cache misses for lockless operation in cache_lookup() by
2679 * using a temporary hash table.
2681 * This will force a fs lookup.
2683 * Synchronisation is done in 2 steps, calling vfs_smr_synchronize each time
2684 * to observe all CPUs not performing the lookup.
2687 cache_changesize_set_temp(struct nchashhead *temptbl, u_long temphash)
2690 MPASS(temphash < nchash);
2692 * Change the size. The new size is smaller and can safely be used
2693 * against the existing table. All lookups which now hash wrong will
2694 * result in a cache miss, which all callers are supposed to know how
2697 atomic_store_long(&nchash, temphash);
2698 atomic_thread_fence_rel();
2699 vfs_smr_synchronize();
2701 * At this point everyone sees the updated hash value, but they still
2702 * see the old table.
2704 atomic_store_ptr(&nchashtbl, temptbl);
2705 atomic_thread_fence_rel();
2706 vfs_smr_synchronize();
2708 * At this point everyone sees the updated table pointer and size pair.
2713 * Set the new hash table.
2715 * Similarly to cache_changesize_set_temp(), this has to synchronize against
2716 * lockless operation in cache_lookup().
2719 cache_changesize_set_new(struct nchashhead *new_tbl, u_long new_hash)
2722 MPASS(nchash < new_hash);
2724 * Change the pointer first. This wont result in out of bounds access
2725 * since the temporary table is guaranteed to be smaller.
2727 atomic_store_ptr(&nchashtbl, new_tbl);
2728 atomic_thread_fence_rel();
2729 vfs_smr_synchronize();
2731 * At this point everyone sees the updated pointer value, but they
2732 * still see the old size.
2734 atomic_store_long(&nchash, new_hash);
2735 atomic_thread_fence_rel();
2736 vfs_smr_synchronize();
2738 * At this point everyone sees the updated table pointer and size pair.
2743 cache_changesize(u_long newmaxvnodes)
2745 struct nchashhead *new_nchashtbl, *old_nchashtbl, *temptbl;
2746 u_long new_nchash, old_nchash, temphash;
2747 struct namecache *ncp;
2752 newncsize = newmaxvnodes * ncsizefactor;
2753 newmaxvnodes = cache_roundup_2(newmaxvnodes * 2);
2754 if (newmaxvnodes < numbucketlocks)
2755 newmaxvnodes = numbucketlocks;
2757 new_nchashtbl = nchinittbl(newmaxvnodes, &new_nchash);
2758 /* If same hash table size, nothing to do */
2759 if (nchash == new_nchash) {
2760 ncfreetbl(new_nchashtbl);
2764 temptbl = nchinittbl(1, &temphash);
2767 * Move everything from the old hash table to the new table.
2768 * None of the namecache entries in the table can be removed
2769 * because to do so, they have to be removed from the hash table.
2771 cache_lock_all_vnodes();
2772 cache_lock_all_buckets();
2773 old_nchashtbl = nchashtbl;
2774 old_nchash = nchash;
2775 cache_changesize_set_temp(temptbl, temphash);
2776 for (i = 0; i <= old_nchash; i++) {
2777 while ((ncp = CK_SLIST_FIRST(&old_nchashtbl[i])) != NULL) {
2778 hash = cache_get_hash(ncp->nc_name, ncp->nc_nlen,
2780 CK_SLIST_REMOVE(&old_nchashtbl[i], ncp, namecache, nc_hash);
2781 CK_SLIST_INSERT_HEAD(&new_nchashtbl[hash & new_nchash], ncp, nc_hash);
2785 cache_recalc_neg_min(ncnegminpct);
2786 cache_changesize_set_new(new_nchashtbl, new_nchash);
2787 cache_unlock_all_buckets();
2788 cache_unlock_all_vnodes();
2789 ncfreetbl(old_nchashtbl);
2794 * Remove all entries from and to a particular vnode.
2797 cache_purge_impl(struct vnode *vp)
2799 struct cache_freebatch batch;
2800 struct namecache *ncp;
2801 struct mtx *vlp, *vlp2;
2804 vlp = VP2VNODELOCK(vp);
2808 while (!LIST_EMPTY(&vp->v_cache_src)) {
2809 ncp = LIST_FIRST(&vp->v_cache_src);
2810 if (!cache_zap_locked_vnode_kl2(ncp, vp, &vlp2))
2812 TAILQ_INSERT_TAIL(&batch, ncp, nc_dst);
2814 while (!TAILQ_EMPTY(&vp->v_cache_dst)) {
2815 ncp = TAILQ_FIRST(&vp->v_cache_dst);
2816 if (!cache_zap_locked_vnode_kl2(ncp, vp, &vlp2))
2818 TAILQ_INSERT_TAIL(&batch, ncp, nc_dst);
2820 ncp = vp->v_cache_dd;
2822 KASSERT(ncp->nc_flag & NCF_ISDOTDOT,
2823 ("lost dotdot link"));
2824 if (!cache_zap_locked_vnode_kl2(ncp, vp, &vlp2))
2826 TAILQ_INSERT_TAIL(&batch, ncp, nc_dst);
2828 KASSERT(vp->v_cache_dd == NULL, ("incomplete purge"));
2832 cache_free_batch(&batch);
2836 * Opportunistic check to see if there is anything to do.
2839 cache_has_entries(struct vnode *vp)
2842 if (LIST_EMPTY(&vp->v_cache_src) && TAILQ_EMPTY(&vp->v_cache_dst) &&
2843 atomic_load_ptr(&vp->v_cache_dd) == NULL)
2849 cache_purge(struct vnode *vp)
2852 SDT_PROBE1(vfs, namecache, purge, done, vp);
2853 if (!cache_has_entries(vp))
2855 cache_purge_impl(vp);
2859 * Only to be used by vgone.
2862 cache_purge_vgone(struct vnode *vp)
2866 VNPASS(VN_IS_DOOMED(vp), vp);
2867 if (cache_has_entries(vp)) {
2868 cache_purge_impl(vp);
2873 * Serialize against a potential thread doing cache_purge.
2875 vlp = VP2VNODELOCK(vp);
2876 mtx_wait_unlocked(vlp);
2877 if (cache_has_entries(vp)) {
2878 cache_purge_impl(vp);
2885 * Remove all negative entries for a particular directory vnode.
2888 cache_purge_negative(struct vnode *vp)
2890 struct cache_freebatch batch;
2891 struct namecache *ncp, *nnp;
2894 SDT_PROBE1(vfs, namecache, purge_negative, done, vp);
2895 if (LIST_EMPTY(&vp->v_cache_src))
2898 vlp = VP2VNODELOCK(vp);
2900 LIST_FOREACH_SAFE(ncp, &vp->v_cache_src, nc_src, nnp) {
2901 if (!(ncp->nc_flag & NCF_NEGATIVE))
2903 cache_zap_negative_locked_vnode_kl(ncp, vp);
2904 TAILQ_INSERT_TAIL(&batch, ncp, nc_dst);
2907 cache_free_batch(&batch);
2911 * Entry points for modifying VOP operations.
2914 cache_vop_rename(struct vnode *fdvp, struct vnode *fvp, struct vnode *tdvp,
2915 struct vnode *tvp, struct componentname *fcnp, struct componentname *tcnp)
2918 ASSERT_VOP_IN_SEQC(fdvp);
2919 ASSERT_VOP_IN_SEQC(fvp);
2920 ASSERT_VOP_IN_SEQC(tdvp);
2922 ASSERT_VOP_IN_SEQC(tvp);
2927 KASSERT(!cache_remove_cnp(tdvp, tcnp),
2928 ("%s: lingering negative entry", __func__));
2930 cache_remove_cnp(tdvp, tcnp);
2936 * Historically renaming was always purging all revelang entries,
2937 * but that's quite wasteful. In particular turns out that in many cases
2938 * the target file is immediately accessed after rename, inducing a cache
2941 * Recode this to reduce relocking and reuse the existing entry (if any)
2942 * instead of just removing it above and allocating a new one here.
2944 if (cache_rename_add) {
2945 cache_enter(tdvp, fvp, tcnp);
2950 cache_vop_rmdir(struct vnode *dvp, struct vnode *vp)
2953 ASSERT_VOP_IN_SEQC(dvp);
2954 ASSERT_VOP_IN_SEQC(vp);
2960 * Validate that if an entry exists it matches.
2963 cache_validate(struct vnode *dvp, struct vnode *vp, struct componentname *cnp)
2965 struct namecache *ncp;
2969 hash = cache_get_hash(cnp->cn_nameptr, cnp->cn_namelen, dvp);
2970 if (CK_SLIST_EMPTY(NCHHASH(hash)))
2972 blp = HASH2BUCKETLOCK(hash);
2974 CK_SLIST_FOREACH(ncp, (NCHHASH(hash)), nc_hash) {
2975 if (ncp->nc_dvp == dvp && ncp->nc_nlen == cnp->cn_namelen &&
2976 !bcmp(ncp->nc_name, cnp->cn_nameptr, ncp->nc_nlen)) {
2977 if (ncp->nc_vp != vp)
2978 panic("%s: mismatch (%p != %p); ncp %p [%s] dvp %p\n",
2979 __func__, vp, ncp->nc_vp, ncp, ncp->nc_name, ncp->nc_dvp);
2987 * Flush all entries referencing a particular filesystem.
2990 cache_purgevfs(struct mount *mp)
2992 struct vnode *vp, *mvp;
2994 SDT_PROBE1(vfs, namecache, purgevfs, done, mp);
2996 * Somewhat wasteful iteration over all vnodes. Would be better to
2997 * support filtering and avoid the interlock to begin with.
2999 MNT_VNODE_FOREACH_ALL(vp, mp, mvp) {
3000 if (!cache_has_entries(vp)) {
3012 * Perform canonical checks and cache lookup and pass on to filesystem
3013 * through the vop_cachedlookup only if needed.
3017 vfs_cache_lookup(struct vop_lookup_args *ap)
3021 struct vnode **vpp = ap->a_vpp;
3022 struct componentname *cnp = ap->a_cnp;
3023 int flags = cnp->cn_flags;
3028 if (dvp->v_type != VDIR)
3031 if ((flags & ISLASTCN) && (dvp->v_mount->mnt_flag & MNT_RDONLY) &&
3032 (cnp->cn_nameiop == DELETE || cnp->cn_nameiop == RENAME))
3035 error = vn_dir_check_exec(dvp, cnp);
3039 error = cache_lookup(dvp, vpp, cnp, NULL, NULL);
3041 return (VOP_CACHEDLOOKUP(dvp, vpp, cnp));
3047 /* Implementation of the getcwd syscall. */
3049 sys___getcwd(struct thread *td, struct __getcwd_args *uap)
3055 buflen = uap->buflen;
3056 if (__predict_false(buflen < 2))
3058 if (buflen > MAXPATHLEN)
3059 buflen = MAXPATHLEN;
3061 buf = uma_zalloc(namei_zone, M_WAITOK);
3062 error = vn_getcwd(buf, &retbuf, &buflen);
3064 error = copyout(retbuf, uap->buf, buflen);
3065 uma_zfree(namei_zone, buf);
3070 vn_getcwd(char *buf, char **retbuf, size_t *buflen)
3076 pwd = pwd_get_smr();
3077 error = vn_fullpath_any_smr(pwd->pwd_cdir, pwd->pwd_rdir, buf, retbuf,
3079 VFS_SMR_ASSERT_NOT_ENTERED();
3081 pwd = pwd_hold(curthread);
3082 error = vn_fullpath_any(pwd->pwd_cdir, pwd->pwd_rdir, buf,
3088 if (KTRPOINT(curthread, KTR_NAMEI) && error == 0)
3095 kern___realpathat(struct thread *td, int fd, const char *path, char *buf,
3096 size_t size, int flags, enum uio_seg pathseg)
3098 struct nameidata nd;
3099 char *retbuf, *freebuf;
3104 NDINIT_ATRIGHTS(&nd, LOOKUP, FOLLOW | SAVENAME | WANTPARENT | AUDITVNODE1,
3105 pathseg, path, fd, &cap_fstat_rights, td);
3106 if ((error = namei(&nd)) != 0)
3108 error = vn_fullpath_hardlink(&nd, &retbuf, &freebuf, &size);
3110 error = copyout(retbuf, buf, size);
3111 free(freebuf, M_TEMP);
3118 sys___realpathat(struct thread *td, struct __realpathat_args *uap)
3121 return (kern___realpathat(td, uap->fd, uap->path, uap->buf, uap->size,
3122 uap->flags, UIO_USERSPACE));
3126 * Retrieve the full filesystem path that correspond to a vnode from the name
3127 * cache (if available)
3130 vn_fullpath(struct vnode *vp, char **retbuf, char **freebuf)
3137 if (__predict_false(vp == NULL))
3140 buflen = MAXPATHLEN;
3141 buf = malloc(buflen, M_TEMP, M_WAITOK);
3143 pwd = pwd_get_smr();
3144 error = vn_fullpath_any_smr(vp, pwd->pwd_rdir, buf, retbuf, &buflen, 0);
3145 VFS_SMR_ASSERT_NOT_ENTERED();
3147 pwd = pwd_hold(curthread);
3148 error = vn_fullpath_any(vp, pwd->pwd_rdir, buf, retbuf, &buflen);
3159 * This function is similar to vn_fullpath, but it attempts to lookup the
3160 * pathname relative to the global root mount point. This is required for the
3161 * auditing sub-system, as audited pathnames must be absolute, relative to the
3162 * global root mount point.
3165 vn_fullpath_global(struct vnode *vp, char **retbuf, char **freebuf)
3171 if (__predict_false(vp == NULL))
3173 buflen = MAXPATHLEN;
3174 buf = malloc(buflen, M_TEMP, M_WAITOK);
3176 error = vn_fullpath_any_smr(vp, rootvnode, buf, retbuf, &buflen, 0);
3177 VFS_SMR_ASSERT_NOT_ENTERED();
3179 error = vn_fullpath_any(vp, rootvnode, buf, retbuf, &buflen);
3188 static struct namecache *
3189 vn_dd_from_dst(struct vnode *vp)
3191 struct namecache *ncp;
3193 cache_assert_vnode_locked(vp);
3194 TAILQ_FOREACH(ncp, &vp->v_cache_dst, nc_dst) {
3195 if ((ncp->nc_flag & NCF_ISDOTDOT) == 0)
3202 vn_vptocnp(struct vnode **vp, char *buf, size_t *buflen)
3205 struct namecache *ncp;
3209 vlp = VP2VNODELOCK(*vp);
3211 ncp = (*vp)->v_cache_dd;
3212 if (ncp != NULL && (ncp->nc_flag & NCF_ISDOTDOT) == 0) {
3213 KASSERT(ncp == vn_dd_from_dst(*vp),
3214 ("%s: mismatch for dd entry (%p != %p)", __func__,
3215 ncp, vn_dd_from_dst(*vp)));
3217 ncp = vn_dd_from_dst(*vp);
3220 if (*buflen < ncp->nc_nlen) {
3223 counter_u64_add(numfullpathfail4, 1);
3225 SDT_PROBE3(vfs, namecache, fullpath, return, error,
3229 *buflen -= ncp->nc_nlen;
3230 memcpy(buf + *buflen, ncp->nc_name, ncp->nc_nlen);
3231 SDT_PROBE3(vfs, namecache, fullpath, hit, ncp->nc_dvp,
3240 SDT_PROBE1(vfs, namecache, fullpath, miss, vp);
3243 vn_lock(*vp, LK_SHARED | LK_RETRY);
3244 error = VOP_VPTOCNP(*vp, &dvp, buf, buflen);
3247 counter_u64_add(numfullpathfail2, 1);
3248 SDT_PROBE3(vfs, namecache, fullpath, return, error, vp, NULL);
3253 if (VN_IS_DOOMED(dvp)) {
3254 /* forced unmount */
3257 SDT_PROBE3(vfs, namecache, fullpath, return, error, vp, NULL);
3261 * *vp has its use count incremented still.
3268 * Resolve a directory to a pathname.
3270 * The name of the directory can always be found in the namecache or fetched
3271 * from the filesystem. There is also guaranteed to be only one parent, meaning
3272 * we can just follow vnodes up until we find the root.
3274 * The vnode must be referenced.
3277 vn_fullpath_dir(struct vnode *vp, struct vnode *rdir, char *buf, char **retbuf,
3278 size_t *len, size_t addend)
3280 #ifdef KDTRACE_HOOKS
3281 struct vnode *startvp = vp;
3286 bool slash_prefixed;
3288 VNPASS(vp->v_type == VDIR || VN_IS_DOOMED(vp), vp);
3289 VNPASS(vp->v_usecount > 0, vp);
3293 slash_prefixed = true;
3298 slash_prefixed = false;
3303 SDT_PROBE1(vfs, namecache, fullpath, entry, vp);
3304 counter_u64_add(numfullpathcalls, 1);
3305 while (vp != rdir && vp != rootvnode) {
3307 * The vp vnode must be already fully constructed,
3308 * since it is either found in namecache or obtained
3309 * from VOP_VPTOCNP(). We may test for VV_ROOT safely
3310 * without obtaining the vnode lock.
3312 if ((vp->v_vflag & VV_ROOT) != 0) {
3313 vn_lock(vp, LK_RETRY | LK_SHARED);
3316 * With the vnode locked, check for races with
3317 * unmount, forced or not. Note that we
3318 * already verified that vp is not equal to
3319 * the root vnode, which means that
3320 * mnt_vnodecovered can be NULL only for the
3323 if (VN_IS_DOOMED(vp) ||
3324 (vp1 = vp->v_mount->mnt_vnodecovered) == NULL ||
3325 vp1->v_mountedhere != vp->v_mount) {
3328 SDT_PROBE3(vfs, namecache, fullpath, return,
3338 if (vp->v_type != VDIR) {
3340 counter_u64_add(numfullpathfail1, 1);
3342 SDT_PROBE3(vfs, namecache, fullpath, return,
3346 error = vn_vptocnp(&vp, buf, &buflen);
3352 SDT_PROBE3(vfs, namecache, fullpath, return, error,
3356 buf[--buflen] = '/';
3357 slash_prefixed = true;
3361 if (!slash_prefixed) {
3364 counter_u64_add(numfullpathfail4, 1);
3365 SDT_PROBE3(vfs, namecache, fullpath, return, ENOMEM,
3369 buf[--buflen] = '/';
3371 counter_u64_add(numfullpathfound, 1);
3374 *retbuf = buf + buflen;
3375 SDT_PROBE3(vfs, namecache, fullpath, return, 0, startvp, *retbuf);
3382 * Resolve an arbitrary vnode to a pathname.
3385 * - hardlinks are not tracked, thus if the vnode is not a directory this can
3386 * resolve to a different path than the one used to find it
3387 * - namecache is not mandatory, meaning names are not guaranteed to be added
3388 * (in which case resolving fails)
3390 static void __inline
3391 cache_rev_failed_impl(int *reason, int line)
3396 #define cache_rev_failed(var) cache_rev_failed_impl((var), __LINE__)
3399 vn_fullpath_any_smr(struct vnode *vp, struct vnode *rdir, char *buf,
3400 char **retbuf, size_t *buflen, size_t addend)
3402 #ifdef KDTRACE_HOOKS
3403 struct vnode *startvp = vp;
3407 struct namecache *ncp;
3411 #ifdef KDTRACE_HOOKS
3414 seqc_t vp_seqc, tvp_seqc;
3417 VFS_SMR_ASSERT_ENTERED();
3419 if (!cache_fast_revlookup) {
3424 orig_buflen = *buflen;
3427 MPASS(*buflen >= 2);
3429 buf[*buflen] = '\0';
3432 if (vp == rdir || vp == rootvnode) {
3440 #ifdef KDTRACE_HOOKS
3444 ncp = NULL; /* for sdt probe down below */
3445 vp_seqc = vn_seqc_read_any(vp);
3446 if (seqc_in_modify(vp_seqc)) {
3447 cache_rev_failed(&reason);
3452 #ifdef KDTRACE_HOOKS
3455 if ((vp->v_vflag & VV_ROOT) != 0) {
3456 mp = atomic_load_ptr(&vp->v_mount);
3458 cache_rev_failed(&reason);
3461 tvp = atomic_load_ptr(&mp->mnt_vnodecovered);
3462 tvp_seqc = vn_seqc_read_any(tvp);
3463 if (seqc_in_modify(tvp_seqc)) {
3464 cache_rev_failed(&reason);
3467 if (!vn_seqc_consistent(vp, vp_seqc)) {
3468 cache_rev_failed(&reason);
3475 ncp = atomic_load_consume_ptr(&vp->v_cache_dd);
3477 cache_rev_failed(&reason);
3480 nc_flag = atomic_load_char(&ncp->nc_flag);
3481 if ((nc_flag & NCF_ISDOTDOT) != 0) {
3482 cache_rev_failed(&reason);
3485 if (ncp->nc_nlen >= *buflen) {
3486 cache_rev_failed(&reason);
3490 *buflen -= ncp->nc_nlen;
3491 memcpy(buf + *buflen, ncp->nc_name, ncp->nc_nlen);
3495 tvp_seqc = vn_seqc_read_any(tvp);
3496 if (seqc_in_modify(tvp_seqc)) {
3497 cache_rev_failed(&reason);
3500 if (!vn_seqc_consistent(vp, vp_seqc)) {
3501 cache_rev_failed(&reason);
3505 * Acquire fence provided by vn_seqc_read_any above.
3507 if (__predict_false(atomic_load_ptr(&vp->v_cache_dd) != ncp)) {
3508 cache_rev_failed(&reason);
3511 if (!cache_ncp_canuse(ncp)) {
3512 cache_rev_failed(&reason);
3517 if (vp == rdir || vp == rootvnode)
3522 *retbuf = buf + *buflen;
3523 *buflen = orig_buflen - *buflen + addend;
3524 SDT_PROBE2(vfs, namecache, fullpath_smr, hit, startvp, *retbuf);
3528 *buflen = orig_buflen;
3529 SDT_PROBE4(vfs, namecache, fullpath_smr, miss, startvp, ncp, reason, i);
3535 vn_fullpath_any(struct vnode *vp, struct vnode *rdir, char *buf, char **retbuf,
3538 size_t orig_buflen, addend;
3544 orig_buflen = *buflen;
3548 if (vp->v_type != VDIR) {
3550 buf[*buflen] = '\0';
3551 error = vn_vptocnp(&vp, buf, buflen);
3560 addend = orig_buflen - *buflen;
3563 return (vn_fullpath_dir(vp, rdir, buf, retbuf, buflen, addend));
3567 * Resolve an arbitrary vnode to a pathname (taking care of hardlinks).
3569 * Since the namecache does not track hardlinks, the caller is expected to first
3570 * look up the target vnode with SAVENAME | WANTPARENT flags passed to namei.
3572 * Then we have 2 cases:
3573 * - if the found vnode is a directory, the path can be constructed just by
3574 * following names up the chain
3575 * - otherwise we populate the buffer with the saved name and start resolving
3579 vn_fullpath_hardlink(struct nameidata *ndp, char **retbuf, char **freebuf,
3584 struct componentname *cnp;
3592 if (*buflen > MAXPATHLEN)
3593 *buflen = MAXPATHLEN;
3595 buf = malloc(*buflen, M_TEMP, M_WAITOK);
3600 * Check for VBAD to work around the vp_crossmp bug in lookup().
3602 * For example consider tmpfs on /tmp and realpath /tmp. ni_vp will be
3603 * set to mount point's root vnode while ni_dvp will be vp_crossmp.
3604 * If the type is VDIR (like in this very case) we can skip looking
3605 * at ni_dvp in the first place. However, since vnodes get passed here
3606 * unlocked the target may transition to doomed state (type == VBAD)
3607 * before we get to evaluate the condition. If this happens, we will
3608 * populate part of the buffer and descend to vn_fullpath_dir with
3609 * vp == vp_crossmp. Prevent the problem by checking for VBAD.
3611 * This should be atomic_load(&vp->v_type) but it is illegal to take
3612 * an address of a bit field, even if said field is sized to char.
3613 * Work around the problem by reading the value into a full-sized enum
3614 * and then re-reading it with atomic_load which will still prevent
3615 * the compiler from re-reading down the road.
3618 type = atomic_load_int(&type);
3625 addend = cnp->cn_namelen + 2;
3626 if (*buflen < addend) {
3631 tmpbuf = buf + *buflen;
3633 memcpy(&tmpbuf[1], cnp->cn_nameptr, cnp->cn_namelen);
3634 tmpbuf[addend - 1] = '\0';
3639 pwd = pwd_get_smr();
3640 error = vn_fullpath_any_smr(vp, pwd->pwd_rdir, buf, retbuf, buflen,
3642 VFS_SMR_ASSERT_NOT_ENTERED();
3644 pwd = pwd_hold(curthread);
3646 error = vn_fullpath_dir(vp, pwd->pwd_rdir, buf, retbuf, buflen,
3662 vn_dir_dd_ino(struct vnode *vp)
3664 struct namecache *ncp;
3669 ASSERT_VOP_LOCKED(vp, "vn_dir_dd_ino");
3670 vlp = VP2VNODELOCK(vp);
3672 TAILQ_FOREACH(ncp, &(vp->v_cache_dst), nc_dst) {
3673 if ((ncp->nc_flag & NCF_ISDOTDOT) != 0)
3676 vs = vget_prep(ddvp);
3678 if (vget_finish(ddvp, LK_SHARED | LK_NOWAIT, vs))
3687 vn_commname(struct vnode *vp, char *buf, u_int buflen)
3689 struct namecache *ncp;
3693 vlp = VP2VNODELOCK(vp);
3695 TAILQ_FOREACH(ncp, &vp->v_cache_dst, nc_dst)
3696 if ((ncp->nc_flag & NCF_ISDOTDOT) == 0)
3702 l = min(ncp->nc_nlen, buflen - 1);
3703 memcpy(buf, ncp->nc_name, l);
3710 * This function updates path string to vnode's full global path
3711 * and checks the size of the new path string against the pathlen argument.
3713 * Requires a locked, referenced vnode.
3714 * Vnode is re-locked on success or ENODEV, otherwise unlocked.
3716 * If vp is a directory, the call to vn_fullpath_global() always succeeds
3717 * because it falls back to the ".." lookup if the namecache lookup fails.
3720 vn_path_to_global_path(struct thread *td, struct vnode *vp, char *path,
3723 struct nameidata nd;
3728 ASSERT_VOP_ELOCKED(vp, __func__);
3730 /* Construct global filesystem path from vp. */
3732 error = vn_fullpath_global(vp, &rpath, &fbuf);
3739 if (strlen(rpath) >= pathlen) {
3741 error = ENAMETOOLONG;
3746 * Re-lookup the vnode by path to detect a possible rename.
3747 * As a side effect, the vnode is relocked.
3748 * If vnode was renamed, return ENOENT.
3750 NDINIT(&nd, LOOKUP, FOLLOW | LOCKLEAF | AUDITVNODE1,
3751 UIO_SYSSPACE, path, td);
3757 NDFREE(&nd, NDF_ONLY_PNBUF);
3761 strcpy(path, rpath);
3774 db_print_vpath(struct vnode *vp)
3777 while (vp != NULL) {
3778 db_printf("%p: ", vp);
3779 if (vp == rootvnode) {
3783 if (vp->v_vflag & VV_ROOT) {
3784 db_printf("<mount point>");
3785 vp = vp->v_mount->mnt_vnodecovered;
3787 struct namecache *ncp;
3791 ncp = TAILQ_FIRST(&vp->v_cache_dst);
3794 for (i = 0; i < ncp->nc_nlen; i++)
3795 db_printf("%c", *ncn++);
3808 DB_SHOW_COMMAND(vpath, db_show_vpath)
3813 db_printf("usage: show vpath <struct vnode *>\n");
3817 vp = (struct vnode *)addr;
3823 static int cache_fast_lookup = 1;
3824 static char __read_frequently cache_fast_lookup_enabled = true;
3826 #define CACHE_FPL_FAILED -2020
3829 cache_fast_lookup_enabled_recalc(void)
3835 mac_on = mac_vnode_check_lookup_enabled();
3836 mac_on |= mac_vnode_check_readlink_enabled();
3841 lookup_flag = atomic_load_int(&cache_fast_lookup);
3842 if (lookup_flag && !mac_on) {
3843 atomic_store_char(&cache_fast_lookup_enabled, true);
3845 atomic_store_char(&cache_fast_lookup_enabled, false);
3850 syscal_vfs_cache_fast_lookup(SYSCTL_HANDLER_ARGS)
3854 old = atomic_load_int(&cache_fast_lookup);
3855 error = sysctl_handle_int(oidp, arg1, arg2, req);
3856 if (error == 0 && req->newptr && old != atomic_load_int(&cache_fast_lookup))
3857 cache_fast_lookup_enabled_recalc();
3860 SYSCTL_PROC(_vfs, OID_AUTO, cache_fast_lookup, CTLTYPE_INT|CTLFLAG_RW|CTLFLAG_MPSAFE,
3861 &cache_fast_lookup, 0, syscal_vfs_cache_fast_lookup, "IU", "");
3864 * Components of nameidata (or objects it can point to) which may
3865 * need restoring in case fast path lookup fails.
3867 struct nameidata_outer {
3872 struct nameidata_saved {
3880 struct cache_fpl_debug {
3886 struct nameidata *ndp;
3887 struct componentname *cnp;
3894 struct nameidata_saved snd;
3895 struct nameidata_outer snd_outer;
3897 enum cache_fpl_status status:8;
3903 struct cache_fpl_debug debug;
3907 static bool cache_fplookup_mp_supported(struct mount *mp);
3908 static bool cache_fplookup_is_mp(struct cache_fpl *fpl);
3909 static int cache_fplookup_cross_mount(struct cache_fpl *fpl);
3910 static int cache_fplookup_partial_setup(struct cache_fpl *fpl);
3911 static int cache_fplookup_skip_slashes(struct cache_fpl *fpl);
3912 static int cache_fplookup_trailingslash(struct cache_fpl *fpl);
3913 static void cache_fpl_pathlen_dec(struct cache_fpl *fpl);
3914 static void cache_fpl_pathlen_inc(struct cache_fpl *fpl);
3915 static void cache_fpl_pathlen_add(struct cache_fpl *fpl, size_t n);
3916 static void cache_fpl_pathlen_sub(struct cache_fpl *fpl, size_t n);
3919 cache_fpl_cleanup_cnp(struct componentname *cnp)
3922 uma_zfree(namei_zone, cnp->cn_pnbuf);
3924 cnp->cn_pnbuf = NULL;
3925 cnp->cn_nameptr = NULL;
3929 static struct vnode *
3930 cache_fpl_handle_root(struct cache_fpl *fpl)
3932 struct nameidata *ndp;
3933 struct componentname *cnp;
3938 MPASS(*(cnp->cn_nameptr) == '/');
3940 cache_fpl_pathlen_dec(fpl);
3942 if (__predict_false(*(cnp->cn_nameptr) == '/')) {
3945 cache_fpl_pathlen_dec(fpl);
3946 } while (*(cnp->cn_nameptr) == '/');
3949 return (ndp->ni_rootdir);
3953 cache_fpl_checkpoint_outer(struct cache_fpl *fpl)
3956 fpl->snd_outer.ni_pathlen = fpl->ndp->ni_pathlen;
3957 fpl->snd_outer.cn_flags = fpl->ndp->ni_cnd.cn_flags;
3961 cache_fpl_checkpoint(struct cache_fpl *fpl)
3965 fpl->snd.cn_nameptr = fpl->ndp->ni_cnd.cn_nameptr;
3966 fpl->snd.ni_pathlen = fpl->debug.ni_pathlen;
3971 cache_fpl_restore_partial(struct cache_fpl *fpl)
3974 fpl->ndp->ni_cnd.cn_flags = fpl->snd_outer.cn_flags;
3976 fpl->debug.ni_pathlen = fpl->snd.ni_pathlen;
3981 cache_fpl_restore_abort(struct cache_fpl *fpl)
3984 cache_fpl_restore_partial(fpl);
3986 * It is 0 on entry by API contract.
3988 fpl->ndp->ni_resflags = 0;
3989 fpl->ndp->ni_cnd.cn_nameptr = fpl->ndp->ni_cnd.cn_pnbuf;
3990 fpl->ndp->ni_pathlen = fpl->snd_outer.ni_pathlen;
3994 #define cache_fpl_smr_assert_entered(fpl) ({ \
3995 struct cache_fpl *_fpl = (fpl); \
3996 MPASS(_fpl->in_smr == true); \
3997 VFS_SMR_ASSERT_ENTERED(); \
3999 #define cache_fpl_smr_assert_not_entered(fpl) ({ \
4000 struct cache_fpl *_fpl = (fpl); \
4001 MPASS(_fpl->in_smr == false); \
4002 VFS_SMR_ASSERT_NOT_ENTERED(); \
4005 cache_fpl_assert_status(struct cache_fpl *fpl)
4008 switch (fpl->status) {
4009 case CACHE_FPL_STATUS_UNSET:
4010 __assert_unreachable();
4012 case CACHE_FPL_STATUS_DESTROYED:
4013 case CACHE_FPL_STATUS_ABORTED:
4014 case CACHE_FPL_STATUS_PARTIAL:
4015 case CACHE_FPL_STATUS_HANDLED:
4020 #define cache_fpl_smr_assert_entered(fpl) do { } while (0)
4021 #define cache_fpl_smr_assert_not_entered(fpl) do { } while (0)
4022 #define cache_fpl_assert_status(fpl) do { } while (0)
4025 #define cache_fpl_smr_enter_initial(fpl) ({ \
4026 struct cache_fpl *_fpl = (fpl); \
4028 _fpl->in_smr = true; \
4031 #define cache_fpl_smr_enter(fpl) ({ \
4032 struct cache_fpl *_fpl = (fpl); \
4033 MPASS(_fpl->in_smr == false); \
4035 _fpl->in_smr = true; \
4038 #define cache_fpl_smr_exit(fpl) ({ \
4039 struct cache_fpl *_fpl = (fpl); \
4040 MPASS(_fpl->in_smr == true); \
4042 _fpl->in_smr = false; \
4046 cache_fpl_aborted_early_impl(struct cache_fpl *fpl, int line)
4049 if (fpl->status != CACHE_FPL_STATUS_UNSET) {
4050 KASSERT(fpl->status == CACHE_FPL_STATUS_PARTIAL,
4051 ("%s: converting to abort from %d at %d, set at %d\n",
4052 __func__, fpl->status, line, fpl->line));
4054 cache_fpl_smr_assert_not_entered(fpl);
4055 fpl->status = CACHE_FPL_STATUS_ABORTED;
4057 return (CACHE_FPL_FAILED);
4060 #define cache_fpl_aborted_early(x) cache_fpl_aborted_early_impl((x), __LINE__)
4062 static int __noinline
4063 cache_fpl_aborted_impl(struct cache_fpl *fpl, int line)
4065 struct nameidata *ndp;
4066 struct componentname *cnp;
4071 if (fpl->status != CACHE_FPL_STATUS_UNSET) {
4072 KASSERT(fpl->status == CACHE_FPL_STATUS_PARTIAL,
4073 ("%s: converting to abort from %d at %d, set at %d\n",
4074 __func__, fpl->status, line, fpl->line));
4076 fpl->status = CACHE_FPL_STATUS_ABORTED;
4079 cache_fpl_smr_exit(fpl);
4080 cache_fpl_restore_abort(fpl);
4082 * Resolving symlinks overwrites data passed by the caller.
4085 if (ndp->ni_loopcnt > 0) {
4086 fpl->status = CACHE_FPL_STATUS_DESTROYED;
4087 cache_fpl_cleanup_cnp(cnp);
4089 return (CACHE_FPL_FAILED);
4092 #define cache_fpl_aborted(x) cache_fpl_aborted_impl((x), __LINE__)
4094 static int __noinline
4095 cache_fpl_partial_impl(struct cache_fpl *fpl, int line)
4098 KASSERT(fpl->status == CACHE_FPL_STATUS_UNSET,
4099 ("%s: setting to partial at %d, but already set to %d at %d\n",
4100 __func__, line, fpl->status, fpl->line));
4101 cache_fpl_smr_assert_entered(fpl);
4102 fpl->status = CACHE_FPL_STATUS_PARTIAL;
4104 return (cache_fplookup_partial_setup(fpl));
4107 #define cache_fpl_partial(x) cache_fpl_partial_impl((x), __LINE__)
4110 cache_fpl_handled_impl(struct cache_fpl *fpl, int line)
4113 KASSERT(fpl->status == CACHE_FPL_STATUS_UNSET,
4114 ("%s: setting to handled at %d, but already set to %d at %d\n",
4115 __func__, line, fpl->status, fpl->line));
4116 cache_fpl_smr_assert_not_entered(fpl);
4117 fpl->status = CACHE_FPL_STATUS_HANDLED;
4122 #define cache_fpl_handled(x) cache_fpl_handled_impl((x), __LINE__)
4125 cache_fpl_handled_error_impl(struct cache_fpl *fpl, int error, int line)
4128 KASSERT(fpl->status == CACHE_FPL_STATUS_UNSET,
4129 ("%s: setting to handled at %d, but already set to %d at %d\n",
4130 __func__, line, fpl->status, fpl->line));
4132 MPASS(error != CACHE_FPL_FAILED);
4133 cache_fpl_smr_assert_not_entered(fpl);
4134 fpl->status = CACHE_FPL_STATUS_HANDLED;
4138 fpl->savename = false;
4142 #define cache_fpl_handled_error(x, e) cache_fpl_handled_error_impl((x), (e), __LINE__)
4145 cache_fpl_terminated(struct cache_fpl *fpl)
4148 return (fpl->status != CACHE_FPL_STATUS_UNSET);
4151 #define CACHE_FPL_SUPPORTED_CN_FLAGS \
4152 (NC_NOMAKEENTRY | NC_KEEPPOSENTRY | LOCKLEAF | LOCKPARENT | WANTPARENT | \
4153 FAILIFEXISTS | FOLLOW | LOCKSHARED | SAVENAME | SAVESTART | WILLBEDIR | \
4154 ISOPEN | NOMACCHECK | AUDITVNODE1 | AUDITVNODE2 | NOCAPCHECK)
4156 #define CACHE_FPL_INTERNAL_CN_FLAGS \
4157 (ISDOTDOT | MAKEENTRY | ISLASTCN)
4159 _Static_assert((CACHE_FPL_SUPPORTED_CN_FLAGS & CACHE_FPL_INTERNAL_CN_FLAGS) == 0,
4160 "supported and internal flags overlap");
4163 cache_fpl_islastcn(struct nameidata *ndp)
4166 return (*ndp->ni_next == 0);
4170 cache_fpl_istrailingslash(struct cache_fpl *fpl)
4173 return (*(fpl->nulchar - 1) == '/');
4177 cache_fpl_isdotdot(struct componentname *cnp)
4180 if (cnp->cn_namelen == 2 &&
4181 cnp->cn_nameptr[1] == '.' && cnp->cn_nameptr[0] == '.')
4187 cache_can_fplookup(struct cache_fpl *fpl)
4189 struct nameidata *ndp;
4190 struct componentname *cnp;
4195 td = cnp->cn_thread;
4197 if (!atomic_load_char(&cache_fast_lookup_enabled)) {
4198 cache_fpl_aborted_early(fpl);
4201 if ((cnp->cn_flags & ~CACHE_FPL_SUPPORTED_CN_FLAGS) != 0) {
4202 cache_fpl_aborted_early(fpl);
4205 if (IN_CAPABILITY_MODE(td)) {
4206 cache_fpl_aborted_early(fpl);
4209 if (AUDITING_TD(td)) {
4210 cache_fpl_aborted_early(fpl);
4213 if (ndp->ni_startdir != NULL) {
4214 cache_fpl_aborted_early(fpl);
4221 cache_fplookup_dirfd(struct cache_fpl *fpl, struct vnode **vpp)
4223 struct nameidata *ndp;
4228 error = fgetvp_lookup_smr(ndp->ni_dirfd, ndp, vpp, &fsearch);
4229 if (__predict_false(error != 0)) {
4230 return (cache_fpl_aborted(fpl));
4232 fpl->fsearch = fsearch;
4236 static int __noinline
4237 cache_fplookup_negative_promote(struct cache_fpl *fpl, struct namecache *oncp,
4240 struct componentname *cnp;
4246 cache_fpl_smr_exit(fpl);
4247 if (cache_neg_promote_cond(dvp, cnp, oncp, hash))
4248 return (cache_fpl_handled_error(fpl, ENOENT));
4250 return (cache_fpl_aborted(fpl));
4254 * The target vnode is not supported, prepare for the slow path to take over.
4256 static int __noinline
4257 cache_fplookup_partial_setup(struct cache_fpl *fpl)
4259 struct nameidata *ndp;
4260 struct componentname *cnp;
4270 dvp_seqc = fpl->dvp_seqc;
4272 if (!pwd_hold_smr(pwd)) {
4273 return (cache_fpl_aborted(fpl));
4277 * Note that seqc is checked before the vnode is locked, so by
4278 * the time regular lookup gets to it it may have moved.
4280 * Ultimately this does not affect correctness, any lookup errors
4281 * are userspace racing with itself. It is guaranteed that any
4282 * path which ultimately gets found could also have been found
4283 * by regular lookup going all the way in absence of concurrent
4286 dvs = vget_prep_smr(dvp);
4287 cache_fpl_smr_exit(fpl);
4288 if (__predict_false(dvs == VGET_NONE)) {
4290 return (cache_fpl_aborted(fpl));
4293 vget_finish_ref(dvp, dvs);
4294 if (!vn_seqc_consistent(dvp, dvp_seqc)) {
4297 return (cache_fpl_aborted(fpl));
4300 cache_fpl_restore_partial(fpl);
4302 if (cnp->cn_nameptr != fpl->snd.cn_nameptr) {
4303 panic("%s: cn_nameptr mismatch (%p != %p) full [%s]\n", __func__,
4304 cnp->cn_nameptr, fpl->snd.cn_nameptr, cnp->cn_pnbuf);
4308 ndp->ni_startdir = dvp;
4309 cnp->cn_flags |= MAKEENTRY;
4310 if (cache_fpl_islastcn(ndp))
4311 cnp->cn_flags |= ISLASTCN;
4312 if (cache_fpl_isdotdot(cnp))
4313 cnp->cn_flags |= ISDOTDOT;
4316 * Skip potential extra slashes parsing did not take care of.
4317 * cache_fplookup_skip_slashes explains the mechanism.
4319 if (__predict_false(*(cnp->cn_nameptr) == '/')) {
4322 cache_fpl_pathlen_dec(fpl);
4323 } while (*(cnp->cn_nameptr) == '/');
4326 ndp->ni_pathlen = fpl->nulchar - cnp->cn_nameptr + 1;
4328 if (ndp->ni_pathlen != fpl->debug.ni_pathlen) {
4329 panic("%s: mismatch (%zu != %zu) nulchar %p nameptr %p [%s] ; full string [%s]\n",
4330 __func__, ndp->ni_pathlen, fpl->debug.ni_pathlen, fpl->nulchar,
4331 cnp->cn_nameptr, cnp->cn_nameptr, cnp->cn_pnbuf);
4338 cache_fplookup_final_child(struct cache_fpl *fpl, enum vgetstate tvs)
4340 struct componentname *cnp;
4347 tvp_seqc = fpl->tvp_seqc;
4349 if ((cnp->cn_flags & LOCKLEAF) != 0) {
4350 lkflags = LK_SHARED;
4351 if ((cnp->cn_flags & LOCKSHARED) == 0)
4352 lkflags = LK_EXCLUSIVE;
4353 error = vget_finish(tvp, lkflags, tvs);
4354 if (__predict_false(error != 0)) {
4355 return (cache_fpl_aborted(fpl));
4358 vget_finish_ref(tvp, tvs);
4361 if (!vn_seqc_consistent(tvp, tvp_seqc)) {
4362 if ((cnp->cn_flags & LOCKLEAF) != 0)
4366 return (cache_fpl_aborted(fpl));
4369 return (cache_fpl_handled(fpl));
4373 * They want to possibly modify the state of the namecache.
4375 static int __noinline
4376 cache_fplookup_final_modifying(struct cache_fpl *fpl)
4378 struct nameidata *ndp;
4379 struct componentname *cnp;
4381 struct vnode *dvp, *tvp;
4390 dvp_seqc = fpl->dvp_seqc;
4392 MPASS(*(cnp->cn_nameptr) != '/');
4393 MPASS(cache_fpl_islastcn(ndp));
4394 if ((cnp->cn_flags & LOCKPARENT) == 0)
4395 MPASS((cnp->cn_flags & WANTPARENT) != 0);
4396 MPASS((cnp->cn_flags & TRAILINGSLASH) == 0);
4397 MPASS(cnp->cn_nameiop == CREATE || cnp->cn_nameiop == DELETE ||
4398 cnp->cn_nameiop == RENAME);
4399 MPASS((cnp->cn_flags & MAKEENTRY) == 0);
4400 MPASS((cnp->cn_flags & ISDOTDOT) == 0);
4402 docache = (cnp->cn_flags & NOCACHE) ^ NOCACHE;
4403 if (cnp->cn_nameiop == DELETE || cnp->cn_nameiop == RENAME)
4407 * Regular lookup nulifies the slash, which we don't do here.
4408 * Don't take chances with filesystem routines seeing it for
4411 if (cache_fpl_istrailingslash(fpl)) {
4412 return (cache_fpl_partial(fpl));
4415 mp = atomic_load_ptr(&dvp->v_mount);
4416 if (__predict_false(mp == NULL)) {
4417 return (cache_fpl_aborted(fpl));
4420 if (__predict_false(mp->mnt_flag & MNT_RDONLY)) {
4421 cache_fpl_smr_exit(fpl);
4423 * Original code keeps not checking for CREATE which
4424 * might be a bug. For now let the old lookup decide.
4426 if (cnp->cn_nameiop == CREATE) {
4427 return (cache_fpl_aborted(fpl));
4429 return (cache_fpl_handled_error(fpl, EROFS));
4432 if (fpl->tvp != NULL && (cnp->cn_flags & FAILIFEXISTS) != 0) {
4433 cache_fpl_smr_exit(fpl);
4434 return (cache_fpl_handled_error(fpl, EEXIST));
4438 * Secure access to dvp; check cache_fplookup_partial_setup for
4441 * XXX At least UFS requires its lookup routine to be called for
4442 * the last path component, which leads to some level of complication
4444 * - the target routine always locks the target vnode, but our caller
4445 * may not need it locked
4446 * - some of the VOP machinery asserts that the parent is locked, which
4447 * once more may be not required
4449 * TODO: add a flag for filesystems which don't need this.
4451 dvs = vget_prep_smr(dvp);
4452 cache_fpl_smr_exit(fpl);
4453 if (__predict_false(dvs == VGET_NONE)) {
4454 return (cache_fpl_aborted(fpl));
4457 vget_finish_ref(dvp, dvs);
4458 if (!vn_seqc_consistent(dvp, dvp_seqc)) {
4460 return (cache_fpl_aborted(fpl));
4463 error = vn_lock(dvp, LK_EXCLUSIVE);
4464 if (__predict_false(error != 0)) {
4466 return (cache_fpl_aborted(fpl));
4470 cnp->cn_flags |= ISLASTCN;
4472 cnp->cn_flags |= MAKEENTRY;
4473 if (cache_fpl_isdotdot(cnp))
4474 cnp->cn_flags |= ISDOTDOT;
4475 cnp->cn_lkflags = LK_EXCLUSIVE;
4476 error = VOP_LOOKUP(dvp, &tvp, cnp);
4484 return (cache_fpl_handled_error(fpl, error));
4487 return (cache_fpl_aborted(fpl));
4491 fpl->savename = (cnp->cn_flags & SAVENAME) != 0;
4494 if ((cnp->cn_flags & SAVESTART) != 0) {
4495 ndp->ni_startdir = dvp;
4496 vrefact(ndp->ni_startdir);
4497 cnp->cn_flags |= SAVENAME;
4498 fpl->savename = true;
4500 MPASS(error == EJUSTRETURN);
4501 if ((cnp->cn_flags & LOCKPARENT) == 0) {
4504 return (cache_fpl_handled(fpl));
4508 * There are very hairy corner cases concerning various flag combinations
4509 * and locking state. In particular here we only hold one lock instead of
4512 * Skip the complexity as it is of no significance for normal workloads.
4514 if (__predict_false(tvp == dvp)) {
4517 return (cache_fpl_aborted(fpl));
4521 * If they want the symlink itself we are fine, but if they want to
4522 * follow it regular lookup has to be engaged.
4524 if (tvp->v_type == VLNK) {
4525 if ((cnp->cn_flags & FOLLOW) != 0) {
4528 return (cache_fpl_aborted(fpl));
4533 * Since we expect this to be the terminal vnode it should almost never
4536 if (__predict_false(cache_fplookup_is_mp(fpl))) {
4539 return (cache_fpl_aborted(fpl));
4542 if ((cnp->cn_flags & FAILIFEXISTS) != 0) {
4545 return (cache_fpl_handled_error(fpl, EEXIST));
4548 if ((cnp->cn_flags & LOCKLEAF) == 0) {
4552 if ((cnp->cn_flags & LOCKPARENT) == 0) {
4556 if ((cnp->cn_flags & SAVESTART) != 0) {
4557 ndp->ni_startdir = dvp;
4558 vrefact(ndp->ni_startdir);
4559 cnp->cn_flags |= SAVENAME;
4560 fpl->savename = true;
4563 return (cache_fpl_handled(fpl));
4566 static int __noinline
4567 cache_fplookup_modifying(struct cache_fpl *fpl)
4569 struct nameidata *ndp;
4573 if (!cache_fpl_islastcn(ndp)) {
4574 return (cache_fpl_partial(fpl));
4576 return (cache_fplookup_final_modifying(fpl));
4579 static int __noinline
4580 cache_fplookup_final_withparent(struct cache_fpl *fpl)
4582 struct componentname *cnp;
4583 enum vgetstate dvs, tvs;
4584 struct vnode *dvp, *tvp;
4590 dvp_seqc = fpl->dvp_seqc;
4593 MPASS((cnp->cn_flags & (LOCKPARENT|WANTPARENT)) != 0);
4596 * This is less efficient than it can be for simplicity.
4598 dvs = vget_prep_smr(dvp);
4599 if (__predict_false(dvs == VGET_NONE)) {
4600 return (cache_fpl_aborted(fpl));
4602 tvs = vget_prep_smr(tvp);
4603 if (__predict_false(tvs == VGET_NONE)) {
4604 cache_fpl_smr_exit(fpl);
4605 vget_abort(dvp, dvs);
4606 return (cache_fpl_aborted(fpl));
4609 cache_fpl_smr_exit(fpl);
4611 if ((cnp->cn_flags & LOCKPARENT) != 0) {
4612 error = vget_finish(dvp, LK_EXCLUSIVE, dvs);
4613 if (__predict_false(error != 0)) {
4614 vget_abort(tvp, tvs);
4615 return (cache_fpl_aborted(fpl));
4618 vget_finish_ref(dvp, dvs);
4621 if (!vn_seqc_consistent(dvp, dvp_seqc)) {
4622 vget_abort(tvp, tvs);
4623 if ((cnp->cn_flags & LOCKPARENT) != 0)
4627 return (cache_fpl_aborted(fpl));
4630 error = cache_fplookup_final_child(fpl, tvs);
4631 if (__predict_false(error != 0)) {
4632 MPASS(fpl->status == CACHE_FPL_STATUS_ABORTED ||
4633 fpl->status == CACHE_FPL_STATUS_DESTROYED);
4634 if ((cnp->cn_flags & LOCKPARENT) != 0)
4641 MPASS(fpl->status == CACHE_FPL_STATUS_HANDLED);
4646 cache_fplookup_final(struct cache_fpl *fpl)
4648 struct componentname *cnp;
4650 struct vnode *dvp, *tvp;
4655 dvp_seqc = fpl->dvp_seqc;
4658 MPASS(*(cnp->cn_nameptr) != '/');
4660 if (cnp->cn_nameiop != LOOKUP) {
4661 return (cache_fplookup_final_modifying(fpl));
4664 if ((cnp->cn_flags & (LOCKPARENT|WANTPARENT)) != 0)
4665 return (cache_fplookup_final_withparent(fpl));
4667 tvs = vget_prep_smr(tvp);
4668 if (__predict_false(tvs == VGET_NONE)) {
4669 return (cache_fpl_partial(fpl));
4672 if (!vn_seqc_consistent(dvp, dvp_seqc)) {
4673 cache_fpl_smr_exit(fpl);
4674 vget_abort(tvp, tvs);
4675 return (cache_fpl_aborted(fpl));
4678 cache_fpl_smr_exit(fpl);
4679 return (cache_fplookup_final_child(fpl, tvs));
4683 * Comment from locked lookup:
4684 * Check for degenerate name (e.g. / or "") which is a way of talking about a
4685 * directory, e.g. like "/." or ".".
4687 static int __noinline
4688 cache_fplookup_degenerate(struct cache_fpl *fpl)
4690 struct componentname *cnp;
4698 fpl->tvp = fpl->dvp;
4699 fpl->tvp_seqc = fpl->dvp_seqc;
4705 for (cp = cnp->cn_pnbuf; *cp != '\0'; cp++) {
4707 ("%s: encountered non-slash; string [%s]\n", __func__,
4712 if (__predict_false(cnp->cn_nameiop != LOOKUP)) {
4713 cache_fpl_smr_exit(fpl);
4714 return (cache_fpl_handled_error(fpl, EISDIR));
4717 MPASS((cnp->cn_flags & SAVESTART) == 0);
4719 if ((cnp->cn_flags & (LOCKPARENT|WANTPARENT)) != 0) {
4720 return (cache_fplookup_final_withparent(fpl));
4723 dvs = vget_prep_smr(dvp);
4724 cache_fpl_smr_exit(fpl);
4725 if (__predict_false(dvs == VGET_NONE)) {
4726 return (cache_fpl_aborted(fpl));
4729 if ((cnp->cn_flags & LOCKLEAF) != 0) {
4730 lkflags = LK_SHARED;
4731 if ((cnp->cn_flags & LOCKSHARED) == 0)
4732 lkflags = LK_EXCLUSIVE;
4733 error = vget_finish(dvp, lkflags, dvs);
4734 if (__predict_false(error != 0)) {
4735 return (cache_fpl_aborted(fpl));
4738 vget_finish_ref(dvp, dvs);
4740 return (cache_fpl_handled(fpl));
4743 static int __noinline
4744 cache_fplookup_noentry(struct cache_fpl *fpl)
4746 struct nameidata *ndp;
4747 struct componentname *cnp;
4749 struct vnode *dvp, *tvp;
4757 dvp_seqc = fpl->dvp_seqc;
4759 MPASS((cnp->cn_flags & MAKEENTRY) == 0);
4760 MPASS((cnp->cn_flags & ISDOTDOT) == 0);
4761 MPASS(!cache_fpl_isdotdot(cnp));
4764 * Hack: delayed name len checking.
4766 if (__predict_false(cnp->cn_namelen > NAME_MAX)) {
4767 cache_fpl_smr_exit(fpl);
4768 return (cache_fpl_handled_error(fpl, ENAMETOOLONG));
4771 if (cnp->cn_nameptr[0] == '/') {
4772 return (cache_fplookup_skip_slashes(fpl));
4775 if (cnp->cn_nameptr[0] == '\0') {
4776 if (fpl->tvp == NULL) {
4777 return (cache_fplookup_degenerate(fpl));
4779 return (cache_fplookup_trailingslash(fpl));
4782 if (cnp->cn_nameiop != LOOKUP) {
4784 return (cache_fplookup_modifying(fpl));
4787 MPASS((cnp->cn_flags & SAVESTART) == 0);
4790 * Only try to fill in the component if it is the last one,
4791 * otherwise not only there may be several to handle but the
4792 * walk may be complicated.
4794 if (!cache_fpl_islastcn(ndp)) {
4795 return (cache_fpl_partial(fpl));
4799 * Regular lookup nulifies the slash, which we don't do here.
4800 * Don't take chances with filesystem routines seeing it for
4803 if (cache_fpl_istrailingslash(fpl)) {
4804 return (cache_fpl_partial(fpl));
4808 * Secure access to dvp; check cache_fplookup_partial_setup for
4811 dvs = vget_prep_smr(dvp);
4812 cache_fpl_smr_exit(fpl);
4813 if (__predict_false(dvs == VGET_NONE)) {
4814 return (cache_fpl_aborted(fpl));
4817 vget_finish_ref(dvp, dvs);
4818 if (!vn_seqc_consistent(dvp, dvp_seqc)) {
4820 return (cache_fpl_aborted(fpl));
4823 error = vn_lock(dvp, LK_SHARED);
4824 if (__predict_false(error != 0)) {
4826 return (cache_fpl_aborted(fpl));
4831 * TODO: provide variants which don't require locking either vnode.
4833 cnp->cn_flags |= ISLASTCN;
4834 docache = (cnp->cn_flags & NOCACHE) ^ NOCACHE;
4836 cnp->cn_flags |= MAKEENTRY;
4837 cnp->cn_lkflags = LK_SHARED;
4838 if ((cnp->cn_flags & LOCKSHARED) == 0) {
4839 cnp->cn_lkflags = LK_EXCLUSIVE;
4841 error = VOP_LOOKUP(dvp, &tvp, cnp);
4849 return (cache_fpl_handled_error(fpl, error));
4852 return (cache_fpl_aborted(fpl));
4856 if (!fpl->savename) {
4857 MPASS((cnp->cn_flags & SAVENAME) == 0);
4861 MPASS(error == EJUSTRETURN);
4862 if ((cnp->cn_flags & (WANTPARENT | LOCKPARENT)) == 0) {
4864 } else if ((cnp->cn_flags & LOCKPARENT) == 0) {
4867 return (cache_fpl_handled(fpl));
4870 if (tvp->v_type == VLNK) {
4871 if ((cnp->cn_flags & FOLLOW) != 0) {
4874 return (cache_fpl_aborted(fpl));
4878 if (__predict_false(cache_fplookup_is_mp(fpl))) {
4881 return (cache_fpl_aborted(fpl));
4884 if ((cnp->cn_flags & LOCKLEAF) == 0) {
4888 if ((cnp->cn_flags & (WANTPARENT | LOCKPARENT)) == 0) {
4890 } else if ((cnp->cn_flags & LOCKPARENT) == 0) {
4893 return (cache_fpl_handled(fpl));
4896 static int __noinline
4897 cache_fplookup_dot(struct cache_fpl *fpl)
4901 MPASS(!seqc_in_modify(fpl->dvp_seqc));
4903 * Just re-assign the value. seqc will be checked later for the first
4904 * non-dot path component in line and/or before deciding to return the
4907 fpl->tvp = fpl->dvp;
4908 fpl->tvp_seqc = fpl->dvp_seqc;
4910 counter_u64_add(dothits, 1);
4911 SDT_PROBE3(vfs, namecache, lookup, hit, fpl->dvp, ".", fpl->dvp);
4914 if (cache_fplookup_is_mp(fpl)) {
4915 error = cache_fplookup_cross_mount(fpl);
4920 static int __noinline
4921 cache_fplookup_dotdot(struct cache_fpl *fpl)
4923 struct nameidata *ndp;
4924 struct componentname *cnp;
4925 struct namecache *ncp;
4934 MPASS(cache_fpl_isdotdot(cnp));
4937 * XXX this is racy the same way regular lookup is
4939 for (pr = cnp->cn_cred->cr_prison; pr != NULL;
4941 if (dvp == pr->pr_root)
4944 if (dvp == ndp->ni_rootdir ||
4945 dvp == ndp->ni_topdir ||
4949 fpl->tvp_seqc = vn_seqc_read_any(dvp);
4950 if (seqc_in_modify(fpl->tvp_seqc)) {
4951 return (cache_fpl_aborted(fpl));
4956 if ((dvp->v_vflag & VV_ROOT) != 0) {
4959 * The opposite of climb mount is needed here.
4961 return (cache_fpl_partial(fpl));
4964 ncp = atomic_load_consume_ptr(&dvp->v_cache_dd);
4966 return (cache_fpl_aborted(fpl));
4969 nc_flag = atomic_load_char(&ncp->nc_flag);
4970 if ((nc_flag & NCF_ISDOTDOT) != 0) {
4971 if ((nc_flag & NCF_NEGATIVE) != 0)
4972 return (cache_fpl_aborted(fpl));
4973 fpl->tvp = ncp->nc_vp;
4975 fpl->tvp = ncp->nc_dvp;
4978 fpl->tvp_seqc = vn_seqc_read_any(fpl->tvp);
4979 if (seqc_in_modify(fpl->tvp_seqc)) {
4980 return (cache_fpl_partial(fpl));
4984 * Acquire fence provided by vn_seqc_read_any above.
4986 if (__predict_false(atomic_load_ptr(&dvp->v_cache_dd) != ncp)) {
4987 return (cache_fpl_aborted(fpl));
4990 if (!cache_ncp_canuse(ncp)) {
4991 return (cache_fpl_aborted(fpl));
4994 counter_u64_add(dotdothits, 1);
4998 static int __noinline
4999 cache_fplookup_neg(struct cache_fpl *fpl, struct namecache *ncp, uint32_t hash)
5004 nc_flag = atomic_load_char(&ncp->nc_flag);
5005 MPASS((nc_flag & NCF_NEGATIVE) != 0);
5007 * If they want to create an entry we need to replace this one.
5009 if (__predict_false(fpl->cnp->cn_nameiop != LOOKUP)) {
5011 return (cache_fplookup_modifying(fpl));
5013 neg_promote = cache_neg_hit_prep(ncp);
5014 if (!cache_fpl_neg_ncp_canuse(ncp)) {
5015 cache_neg_hit_abort(ncp);
5016 return (cache_fpl_partial(fpl));
5019 return (cache_fplookup_negative_promote(fpl, ncp, hash));
5021 cache_neg_hit_finish(ncp);
5022 cache_fpl_smr_exit(fpl);
5023 return (cache_fpl_handled_error(fpl, ENOENT));
5027 * Resolve a symlink. Called by filesystem-specific routines.
5030 * ... -> cache_fplookup_symlink -> VOP_FPLOOKUP_SYMLINK -> cache_symlink_resolve
5033 cache_symlink_resolve(struct cache_fpl *fpl, const char *string, size_t len)
5035 struct nameidata *ndp;
5036 struct componentname *cnp;
5042 if (__predict_false(len == 0)) {
5046 if (__predict_false(len > MAXPATHLEN - 2)) {
5047 if (cache_fpl_istrailingslash(fpl)) {
5052 ndp->ni_pathlen = fpl->nulchar - cnp->cn_nameptr - cnp->cn_namelen + 1;
5054 if (ndp->ni_pathlen != fpl->debug.ni_pathlen) {
5055 panic("%s: mismatch (%zu != %zu) nulchar %p nameptr %p [%s] ; full string [%s]\n",
5056 __func__, ndp->ni_pathlen, fpl->debug.ni_pathlen, fpl->nulchar,
5057 cnp->cn_nameptr, cnp->cn_nameptr, cnp->cn_pnbuf);
5061 if (__predict_false(len + ndp->ni_pathlen > MAXPATHLEN)) {
5062 return (ENAMETOOLONG);
5065 if (__predict_false(ndp->ni_loopcnt++ >= MAXSYMLINKS)) {
5070 if (ndp->ni_pathlen > 1) {
5071 bcopy(ndp->ni_next, cnp->cn_pnbuf + len, ndp->ni_pathlen);
5073 if (cache_fpl_istrailingslash(fpl)) {
5075 cnp->cn_pnbuf[len] = '/';
5076 cnp->cn_pnbuf[len + 1] = '\0';
5078 cnp->cn_pnbuf[len] = '\0';
5081 bcopy(string, cnp->cn_pnbuf, len);
5083 ndp->ni_pathlen += adjust;
5084 cache_fpl_pathlen_add(fpl, adjust);
5085 cnp->cn_nameptr = cnp->cn_pnbuf;
5086 fpl->nulchar = &cnp->cn_nameptr[ndp->ni_pathlen - 1];
5091 static int __noinline
5092 cache_fplookup_symlink(struct cache_fpl *fpl)
5095 struct nameidata *ndp;
5096 struct componentname *cnp;
5097 struct vnode *dvp, *tvp;
5105 if (cache_fpl_islastcn(ndp)) {
5106 if ((cnp->cn_flags & FOLLOW) == 0) {
5107 return (cache_fplookup_final(fpl));
5111 mp = atomic_load_ptr(&dvp->v_mount);
5112 if (__predict_false(mp == NULL)) {
5113 return (cache_fpl_aborted(fpl));
5117 * Note this check races against setting the flag just like regular
5120 if (__predict_false((mp->mnt_flag & MNT_NOSYMFOLLOW) != 0)) {
5121 cache_fpl_smr_exit(fpl);
5122 return (cache_fpl_handled_error(fpl, EACCES));
5125 error = VOP_FPLOOKUP_SYMLINK(tvp, fpl);
5126 if (__predict_false(error != 0)) {
5129 return (cache_fpl_partial(fpl));
5133 cache_fpl_smr_exit(fpl);
5134 return (cache_fpl_handled_error(fpl, error));
5136 return (cache_fpl_aborted(fpl));
5140 if (*(cnp->cn_nameptr) == '/') {
5141 fpl->dvp = cache_fpl_handle_root(fpl);
5142 fpl->dvp_seqc = vn_seqc_read_any(fpl->dvp);
5143 if (seqc_in_modify(fpl->dvp_seqc)) {
5144 return (cache_fpl_aborted(fpl));
5147 * The main loop assumes that ->dvp points to a vnode belonging
5148 * to a filesystem which can do lockless lookup, but the absolute
5149 * symlink can be wandering off to one which does not.
5151 mp = atomic_load_ptr(&fpl->dvp->v_mount);
5152 if (__predict_false(mp == NULL)) {
5153 return (cache_fpl_aborted(fpl));
5155 if (!cache_fplookup_mp_supported(mp)) {
5156 cache_fpl_checkpoint(fpl);
5157 return (cache_fpl_partial(fpl));
5164 cache_fplookup_next(struct cache_fpl *fpl)
5166 struct componentname *cnp;
5167 struct namecache *ncp;
5168 struct vnode *dvp, *tvp;
5177 if (__predict_false(cnp->cn_nameptr[0] == '.')) {
5178 if (cnp->cn_namelen == 1) {
5179 return (cache_fplookup_dot(fpl));
5181 if (cnp->cn_namelen == 2 && cnp->cn_nameptr[1] == '.') {
5182 return (cache_fplookup_dotdot(fpl));
5186 MPASS(!cache_fpl_isdotdot(cnp));
5188 CK_SLIST_FOREACH(ncp, (NCHHASH(hash)), nc_hash) {
5189 if (ncp->nc_dvp == dvp && ncp->nc_nlen == cnp->cn_namelen &&
5190 !bcmp(ncp->nc_name, cnp->cn_nameptr, ncp->nc_nlen))
5194 if (__predict_false(ncp == NULL)) {
5195 return (cache_fplookup_noentry(fpl));
5198 tvp = atomic_load_ptr(&ncp->nc_vp);
5199 nc_flag = atomic_load_char(&ncp->nc_flag);
5200 if ((nc_flag & NCF_NEGATIVE) != 0) {
5201 return (cache_fplookup_neg(fpl, ncp, hash));
5204 if (!cache_ncp_canuse(ncp)) {
5205 return (cache_fpl_partial(fpl));
5209 fpl->tvp_seqc = vn_seqc_read_any(tvp);
5210 if (seqc_in_modify(fpl->tvp_seqc)) {
5211 return (cache_fpl_partial(fpl));
5214 counter_u64_add(numposhits, 1);
5215 SDT_PROBE3(vfs, namecache, lookup, hit, dvp, ncp->nc_name, tvp);
5218 if (cache_fplookup_is_mp(fpl)) {
5219 error = cache_fplookup_cross_mount(fpl);
5225 cache_fplookup_mp_supported(struct mount *mp)
5229 if ((mp->mnt_kern_flag & MNTK_FPLOOKUP) == 0)
5235 * Walk up the mount stack (if any).
5237 * Correctness is provided in the following ways:
5238 * - all vnodes are protected from freeing with SMR
5239 * - struct mount objects are type stable making them always safe to access
5240 * - stability of the particular mount is provided by busying it
5241 * - relationship between the vnode which is mounted on and the mount is
5242 * verified with the vnode sequence counter after busying
5243 * - association between root vnode of the mount and the mount is protected
5246 * From that point on we can read the sequence counter of the root vnode
5247 * and get the next mount on the stack (if any) using the same protection.
5249 * By the end of successful walk we are guaranteed the reached state was
5250 * indeed present at least at some point which matches the regular lookup.
5252 static int __noinline
5253 cache_fplookup_climb_mount(struct cache_fpl *fpl)
5255 struct mount *mp, *prev_mp;
5256 struct mount_pcpu *mpcpu, *prev_mpcpu;
5261 vp_seqc = fpl->tvp_seqc;
5263 VNPASS(vp->v_type == VDIR || vp->v_type == VBAD, vp);
5264 mp = atomic_load_ptr(&vp->v_mountedhere);
5265 if (__predict_false(mp == NULL)) {
5271 if (!vfs_op_thread_enter_crit(mp, mpcpu)) {
5272 if (prev_mp != NULL)
5273 vfs_op_thread_exit_crit(prev_mp, prev_mpcpu);
5274 return (cache_fpl_partial(fpl));
5276 if (prev_mp != NULL)
5277 vfs_op_thread_exit_crit(prev_mp, prev_mpcpu);
5278 if (!vn_seqc_consistent(vp, vp_seqc)) {
5279 vfs_op_thread_exit_crit(mp, mpcpu);
5280 return (cache_fpl_partial(fpl));
5282 if (!cache_fplookup_mp_supported(mp)) {
5283 vfs_op_thread_exit_crit(mp, mpcpu);
5284 return (cache_fpl_partial(fpl));
5286 vp = atomic_load_ptr(&mp->mnt_rootvnode);
5288 vfs_op_thread_exit_crit(mp, mpcpu);
5289 return (cache_fpl_partial(fpl));
5291 vp_seqc = vn_seqc_read_any(vp);
5292 if (seqc_in_modify(vp_seqc)) {
5293 vfs_op_thread_exit_crit(mp, mpcpu);
5294 return (cache_fpl_partial(fpl));
5298 mp = atomic_load_ptr(&vp->v_mountedhere);
5303 vfs_op_thread_exit_crit(prev_mp, prev_mpcpu);
5305 fpl->tvp_seqc = vp_seqc;
5309 static int __noinline
5310 cache_fplookup_cross_mount(struct cache_fpl *fpl)
5313 struct mount_pcpu *mpcpu;
5318 vp_seqc = fpl->tvp_seqc;
5320 VNPASS(vp->v_type == VDIR || vp->v_type == VBAD, vp);
5321 mp = atomic_load_ptr(&vp->v_mountedhere);
5322 if (__predict_false(mp == NULL)) {
5326 if (!vfs_op_thread_enter_crit(mp, mpcpu)) {
5327 return (cache_fpl_partial(fpl));
5329 if (!vn_seqc_consistent(vp, vp_seqc)) {
5330 vfs_op_thread_exit_crit(mp, mpcpu);
5331 return (cache_fpl_partial(fpl));
5333 if (!cache_fplookup_mp_supported(mp)) {
5334 vfs_op_thread_exit_crit(mp, mpcpu);
5335 return (cache_fpl_partial(fpl));
5337 vp = atomic_load_ptr(&mp->mnt_rootvnode);
5338 if (__predict_false(vp == NULL)) {
5339 vfs_op_thread_exit_crit(mp, mpcpu);
5340 return (cache_fpl_partial(fpl));
5342 vp_seqc = vn_seqc_read_any(vp);
5343 vfs_op_thread_exit_crit(mp, mpcpu);
5344 if (seqc_in_modify(vp_seqc)) {
5345 return (cache_fpl_partial(fpl));
5347 mp = atomic_load_ptr(&vp->v_mountedhere);
5348 if (__predict_false(mp != NULL)) {
5350 * There are possibly more mount points on top.
5351 * Normally this does not happen so for simplicity just start
5354 return (cache_fplookup_climb_mount(fpl));
5358 fpl->tvp_seqc = vp_seqc;
5363 * Check if a vnode is mounted on.
5366 cache_fplookup_is_mp(struct cache_fpl *fpl)
5371 return ((vn_irflag_read(vp) & VIRF_MOUNTPOINT) != 0);
5377 * The code was originally copy-pasted from regular lookup and despite
5378 * clean ups leaves performance on the table. Any modifications here
5379 * must take into account that in case off fallback the resulting
5380 * nameidata state has to be compatible with the original.
5384 * Debug ni_pathlen tracking.
5388 cache_fpl_pathlen_add(struct cache_fpl *fpl, size_t n)
5391 fpl->debug.ni_pathlen += n;
5392 KASSERT(fpl->debug.ni_pathlen <= PATH_MAX,
5393 ("%s: pathlen overflow to %zd\n", __func__, fpl->debug.ni_pathlen));
5397 cache_fpl_pathlen_sub(struct cache_fpl *fpl, size_t n)
5400 fpl->debug.ni_pathlen -= n;
5401 KASSERT(fpl->debug.ni_pathlen <= PATH_MAX,
5402 ("%s: pathlen underflow to %zd\n", __func__, fpl->debug.ni_pathlen));
5406 cache_fpl_pathlen_inc(struct cache_fpl *fpl)
5409 cache_fpl_pathlen_add(fpl, 1);
5413 cache_fpl_pathlen_dec(struct cache_fpl *fpl)
5416 cache_fpl_pathlen_sub(fpl, 1);
5420 cache_fpl_pathlen_add(struct cache_fpl *fpl, size_t n)
5425 cache_fpl_pathlen_sub(struct cache_fpl *fpl, size_t n)
5430 cache_fpl_pathlen_inc(struct cache_fpl *fpl)
5435 cache_fpl_pathlen_dec(struct cache_fpl *fpl)
5441 cache_fplookup_parse(struct cache_fpl *fpl)
5443 struct nameidata *ndp;
5444 struct componentname *cnp;
5454 * Find the end of this path component, it is either / or nul.
5456 * Store / as a temporary sentinel so that we only have one character
5457 * to test for. Pathnames tend to be short so this should not be
5458 * resulting in cache misses.
5460 * TODO: fix this to be word-sized.
5462 KASSERT(&cnp->cn_nameptr[fpl->debug.ni_pathlen - 1] == fpl->nulchar,
5463 ("%s: mismatch between pathlen (%zu) and nulchar (%p != %p), string [%s]\n",
5464 __func__, fpl->debug.ni_pathlen, &cnp->cn_nameptr[fpl->debug.ni_pathlen - 1],
5465 fpl->nulchar, cnp->cn_pnbuf));
5466 KASSERT(*fpl->nulchar == '\0',
5467 ("%s: expected nul at %p; string [%s]\n", __func__, fpl->nulchar,
5469 hash = cache_get_hash_iter_start(dvp);
5470 *fpl->nulchar = '/';
5471 for (cp = cnp->cn_nameptr; *cp != '/'; cp++) {
5472 KASSERT(*cp != '\0',
5473 ("%s: encountered unexpected nul; string [%s]\n", __func__,
5475 hash = cache_get_hash_iter(*cp, hash);
5478 *fpl->nulchar = '\0';
5479 fpl->hash = cache_get_hash_iter_finish(hash);
5481 cnp->cn_namelen = cp - cnp->cn_nameptr;
5482 cache_fpl_pathlen_sub(fpl, cnp->cn_namelen);
5486 * cache_get_hash only accepts lengths up to NAME_MAX. This is fine since
5487 * we are going to fail this lookup with ENAMETOOLONG (see below).
5489 if (cnp->cn_namelen <= NAME_MAX) {
5490 if (fpl->hash != cache_get_hash(cnp->cn_nameptr, cnp->cn_namelen, dvp)) {
5491 panic("%s: mismatched hash for [%s] len %ld", __func__,
5492 cnp->cn_nameptr, cnp->cn_namelen);
5498 * Hack: we have to check if the found path component's length exceeds
5499 * NAME_MAX. However, the condition is very rarely true and check can
5500 * be elided in the common case -- if an entry was found in the cache,
5501 * then it could not have been too long to begin with.
5507 cache_fplookup_parse_advance(struct cache_fpl *fpl)
5509 struct nameidata *ndp;
5510 struct componentname *cnp;
5515 cnp->cn_nameptr = ndp->ni_next;
5516 KASSERT(*(cnp->cn_nameptr) == '/',
5517 ("%s: should have seen slash at %p ; buf %p [%s]\n", __func__,
5518 cnp->cn_nameptr, cnp->cn_pnbuf, cnp->cn_pnbuf));
5520 cache_fpl_pathlen_dec(fpl);
5524 * Skip spurious slashes in a pathname (e.g., "foo///bar") and retry.
5526 * Lockless lookup tries to elide checking for spurious slashes and should they
5527 * be present is guaranteed to fail to find an entry. In this case the caller
5528 * must check if the name starts with a slash and call this routine. It is
5529 * going to fast forward across the spurious slashes and set the state up for
5532 static int __noinline
5533 cache_fplookup_skip_slashes(struct cache_fpl *fpl)
5535 struct nameidata *ndp;
5536 struct componentname *cnp;
5541 MPASS(*(cnp->cn_nameptr) == '/');
5544 cache_fpl_pathlen_dec(fpl);
5545 } while (*(cnp->cn_nameptr) == '/');
5548 * Go back to one slash so that cache_fplookup_parse_advance has
5549 * something to skip.
5552 cache_fpl_pathlen_inc(fpl);
5555 * cache_fplookup_parse_advance starts from ndp->ni_next
5557 ndp->ni_next = cnp->cn_nameptr;
5560 * See cache_fplookup_dot.
5562 fpl->tvp = fpl->dvp;
5563 fpl->tvp_seqc = fpl->dvp_seqc;
5569 * Handle trailing slashes (e.g., "foo/").
5571 * If a trailing slash is found the terminal vnode must be a directory.
5572 * Regular lookup shortens the path by nulifying the first trailing slash and
5573 * sets the TRAILINGSLASH flag to denote this took place. There are several
5574 * checks on it performed later.
5576 * Similarly to spurious slashes, lockless lookup handles this in a speculative
5577 * manner relying on an invariant that a non-directory vnode will get a miss.
5578 * In this case cn_nameptr[0] == '\0' and cn_namelen == 0.
5580 * Thus for a path like "foo/bar/" the code unwinds the state back to "bar/"
5581 * and denotes this is the last path component, which avoids looping back.
5583 * Only plain lookups are supported for now to restrict corner cases to handle.
5585 static int __noinline
5586 cache_fplookup_trailingslash(struct cache_fpl *fpl)
5591 struct nameidata *ndp;
5592 struct componentname *cnp;
5593 struct namecache *ncp;
5595 char *cn_nameptr_orig, *cn_nameptr_slash;
5602 tvp_seqc = fpl->tvp_seqc;
5604 MPASS(fpl->dvp == fpl->tvp);
5605 KASSERT(cache_fpl_istrailingslash(fpl),
5606 ("%s: expected trailing slash at %p; string [%s]\n", __func__, fpl->nulchar - 1,
5608 KASSERT(cnp->cn_nameptr[0] == '\0',
5609 ("%s: expected nul char at %p; string [%s]\n", __func__, &cnp->cn_nameptr[0],
5611 KASSERT(cnp->cn_namelen == 0,
5612 ("%s: namelen 0 but got %ld; string [%s]\n", __func__, cnp->cn_namelen,
5614 MPASS(cnp->cn_nameptr > cnp->cn_pnbuf);
5616 if (cnp->cn_nameiop != LOOKUP) {
5617 return (cache_fpl_aborted(fpl));
5620 if (__predict_false(tvp->v_type != VDIR)) {
5621 if (!vn_seqc_consistent(tvp, tvp_seqc)) {
5622 return (cache_fpl_aborted(fpl));
5624 cache_fpl_smr_exit(fpl);
5625 return (cache_fpl_handled_error(fpl, ENOTDIR));
5629 * Denote the last component.
5631 ndp->ni_next = &cnp->cn_nameptr[0];
5632 MPASS(cache_fpl_islastcn(ndp));
5635 * Unwind trailing slashes.
5637 cn_nameptr_orig = cnp->cn_nameptr;
5638 while (cnp->cn_nameptr >= cnp->cn_pnbuf) {
5640 if (cnp->cn_nameptr[0] != '/') {
5646 * Unwind to the beginning of the path component.
5648 * Note the path may or may not have started with a slash.
5650 cn_nameptr_slash = cnp->cn_nameptr;
5651 while (cnp->cn_nameptr > cnp->cn_pnbuf) {
5653 if (cnp->cn_nameptr[0] == '/') {
5657 if (cnp->cn_nameptr[0] == '/') {
5661 cnp->cn_namelen = cn_nameptr_slash - cnp->cn_nameptr + 1;
5662 cache_fpl_pathlen_add(fpl, cn_nameptr_orig - cnp->cn_nameptr);
5663 cache_fpl_checkpoint(fpl);
5666 ni_pathlen = fpl->nulchar - cnp->cn_nameptr + 1;
5667 if (ni_pathlen != fpl->debug.ni_pathlen) {
5668 panic("%s: mismatch (%zu != %zu) nulchar %p nameptr %p [%s] ; full string [%s]\n",
5669 __func__, ni_pathlen, fpl->debug.ni_pathlen, fpl->nulchar,
5670 cnp->cn_nameptr, cnp->cn_nameptr, cnp->cn_pnbuf);
5675 * If this was a "./" lookup the parent directory is already correct.
5677 if (cnp->cn_nameptr[0] == '.' && cnp->cn_namelen == 1) {
5682 * Otherwise we need to look it up.
5685 ncp = atomic_load_consume_ptr(&tvp->v_cache_dd);
5686 if (__predict_false(ncp == NULL)) {
5687 return (cache_fpl_aborted(fpl));
5689 nc_flag = atomic_load_char(&ncp->nc_flag);
5690 if ((nc_flag & NCF_ISDOTDOT) != 0) {
5691 return (cache_fpl_aborted(fpl));
5693 fpl->dvp = ncp->nc_dvp;
5694 fpl->dvp_seqc = vn_seqc_read_any(fpl->dvp);
5695 if (seqc_in_modify(fpl->dvp_seqc)) {
5696 return (cache_fpl_aborted(fpl));
5702 * See the API contract for VOP_FPLOOKUP_VEXEC.
5704 static int __noinline
5705 cache_fplookup_failed_vexec(struct cache_fpl *fpl, int error)
5707 struct componentname *cnp;
5713 dvp_seqc = fpl->dvp_seqc;
5716 * TODO: Due to ignoring trailing slashes lookup will perform a
5717 * permission check on the last dir when it should not be doing it. It
5718 * may fail, but said failure should be ignored. It is possible to fix
5719 * it up fully without resorting to regular lookup, but for now just
5722 if (cache_fpl_istrailingslash(fpl)) {
5723 return (cache_fpl_aborted(fpl));
5727 * Hack: delayed degenerate path checking.
5729 if (cnp->cn_nameptr[0] == '\0' && fpl->tvp == NULL) {
5730 return (cache_fplookup_degenerate(fpl));
5734 * Hack: delayed name len checking.
5736 if (__predict_false(cnp->cn_namelen > NAME_MAX)) {
5737 cache_fpl_smr_exit(fpl);
5738 return (cache_fpl_handled_error(fpl, ENAMETOOLONG));
5742 * Hack: they may be looking up foo/bar, where foo is not a directory.
5743 * In such a case we need to return ENOTDIR, but we may happen to get
5744 * here with a different error.
5746 if (dvp->v_type != VDIR) {
5751 * Hack: handle O_SEARCH.
5753 * Open Group Base Specifications Issue 7, 2018 edition states:
5755 * If the access mode of the open file description associated with the
5756 * file descriptor is not O_SEARCH, the function shall check whether
5757 * directory searches are permitted using the current permissions of
5758 * the directory underlying the file descriptor. If the access mode is
5759 * O_SEARCH, the function shall not perform the check.
5762 * Regular lookup tests for the NOEXECCHECK flag for every path
5763 * component to decide whether to do the permission check. However,
5764 * since most lookups never have the flag (and when they do it is only
5765 * present for the first path component), lockless lookup only acts on
5766 * it if there is a permission problem. Here the flag is represented
5767 * with a boolean so that we don't have to clear it on the way out.
5769 * For simplicity this always aborts.
5770 * TODO: check if this is the first lookup and ignore the permission
5771 * problem. Note the flag has to survive fallback (if it happens to be
5775 return (cache_fpl_aborted(fpl));
5780 if (!vn_seqc_consistent(dvp, dvp_seqc)) {
5781 error = cache_fpl_aborted(fpl);
5783 cache_fpl_partial(fpl);
5787 if (!vn_seqc_consistent(dvp, dvp_seqc)) {
5788 error = cache_fpl_aborted(fpl);
5790 cache_fpl_smr_exit(fpl);
5791 cache_fpl_handled_error(fpl, error);
5799 cache_fplookup_impl(struct vnode *dvp, struct cache_fpl *fpl)
5801 struct nameidata *ndp;
5802 struct componentname *cnp;
5809 cache_fpl_checkpoint(fpl);
5812 * The vnode at hand is almost always stable, skip checking for it.
5813 * Worst case this postpones the check towards the end of the iteration
5817 fpl->dvp_seqc = vn_seqc_read_notmodify(fpl->dvp);
5819 mp = atomic_load_ptr(&dvp->v_mount);
5820 if (__predict_false(mp == NULL || !cache_fplookup_mp_supported(mp))) {
5821 return (cache_fpl_aborted(fpl));
5824 MPASS(fpl->tvp == NULL);
5827 cache_fplookup_parse(fpl);
5829 error = VOP_FPLOOKUP_VEXEC(fpl->dvp, cnp->cn_cred);
5830 if (__predict_false(error != 0)) {
5831 error = cache_fplookup_failed_vexec(fpl, error);
5835 error = cache_fplookup_next(fpl);
5836 if (__predict_false(cache_fpl_terminated(fpl))) {
5840 VNPASS(!seqc_in_modify(fpl->tvp_seqc), fpl->tvp);
5842 if (fpl->tvp->v_type == VLNK) {
5843 error = cache_fplookup_symlink(fpl);
5844 if (cache_fpl_terminated(fpl)) {
5848 if (cache_fpl_islastcn(ndp)) {
5849 error = cache_fplookup_final(fpl);
5853 if (!vn_seqc_consistent(fpl->dvp, fpl->dvp_seqc)) {
5854 error = cache_fpl_aborted(fpl);
5858 fpl->dvp = fpl->tvp;
5859 fpl->dvp_seqc = fpl->tvp_seqc;
5860 cache_fplookup_parse_advance(fpl);
5863 cache_fpl_checkpoint(fpl);
5870 * Fast path lookup protected with SMR and sequence counters.
5872 * Note: all VOP_FPLOOKUP_VEXEC routines have a comment referencing this one.
5874 * Filesystems can opt in by setting the MNTK_FPLOOKUP flag and meeting criteria
5877 * Traditional vnode lookup conceptually looks like this:
5883 * vn_unlock(current);
5890 * Each jump to the next vnode is safe memory-wise and atomic with respect to
5891 * any modifications thanks to holding respective locks.
5893 * The same guarantee can be provided with a combination of safe memory
5894 * reclamation and sequence counters instead. If all operations which affect
5895 * the relationship between the current vnode and the one we are looking for
5896 * also modify the counter, we can verify whether all the conditions held as
5897 * we made the jump. This includes things like permissions, mount points etc.
5898 * Counter modification is provided by enclosing relevant places in
5899 * vn_seqc_write_begin()/end() calls.
5901 * Thus this translates to:
5904 * dvp_seqc = seqc_read_any(dvp);
5905 * if (seqc_in_modify(dvp_seqc)) // someone is altering the vnode
5909 * tvp_seqc = seqc_read_any(tvp);
5910 * if (seqc_in_modify(tvp_seqc)) // someone is altering the target vnode
5912 * if (!seqc_consistent(dvp, dvp_seqc) // someone is altering the vnode
5914 * dvp = tvp; // we know nothing of importance has changed
5915 * dvp_seqc = tvp_seqc; // store the counter for the tvp iteration
5919 * vget(); // secure the vnode
5920 * if (!seqc_consistent(tvp, tvp_seqc) // final check
5922 * // at this point we know nothing has changed for any parent<->child pair
5923 * // as they were crossed during the lookup, meaning we matched the guarantee
5924 * // of the locked variant
5927 * The API contract for VOP_FPLOOKUP_VEXEC routines is as follows:
5928 * - they are called while within vfs_smr protection which they must never exit
5929 * - EAGAIN can be returned to denote checking could not be performed, it is
5930 * always valid to return it
5931 * - if the sequence counter has not changed the result must be valid
5932 * - if the sequence counter has changed both false positives and false negatives
5933 * are permitted (since the result will be rejected later)
5934 * - for simple cases of unix permission checks vaccess_vexec_smr can be used
5936 * Caveats to watch out for:
5937 * - vnodes are passed unlocked and unreferenced with nothing stopping
5938 * VOP_RECLAIM, in turn meaning that ->v_data can become NULL. It is advised
5939 * to use atomic_load_ptr to fetch it.
5940 * - the aforementioned object can also get freed, meaning absent other means it
5941 * should be protected with vfs_smr
5942 * - either safely checking permissions as they are modified or guaranteeing
5943 * their stability is left to the routine
5946 cache_fplookup(struct nameidata *ndp, enum cache_fpl_status *status,
5949 struct cache_fpl fpl;
5952 struct componentname *cnp;
5955 fpl.status = CACHE_FPL_STATUS_UNSET;
5958 fpl.cnp = cnp = &ndp->ni_cnd;
5959 MPASS(ndp->ni_lcf == 0);
5960 MPASS(curthread == cnp->cn_thread);
5961 KASSERT ((cnp->cn_flags & CACHE_FPL_INTERNAL_CN_FLAGS) == 0,
5962 ("%s: internal flags found in cn_flags %" PRIx64, __func__,
5964 if ((cnp->cn_flags & SAVESTART) != 0) {
5965 MPASS(cnp->cn_nameiop != LOOKUP);
5967 MPASS(cnp->cn_nameptr == cnp->cn_pnbuf);
5969 if (__predict_false(!cache_can_fplookup(&fpl))) {
5970 *status = fpl.status;
5971 SDT_PROBE3(vfs, fplookup, lookup, done, ndp, fpl.line, fpl.status);
5972 return (EOPNOTSUPP);
5975 cache_fpl_checkpoint_outer(&fpl);
5977 cache_fpl_smr_enter_initial(&fpl);
5979 fpl.debug.ni_pathlen = ndp->ni_pathlen;
5981 fpl.nulchar = &cnp->cn_nameptr[ndp->ni_pathlen - 1];
5982 fpl.fsearch = false;
5983 fpl.savename = (cnp->cn_flags & SAVENAME) != 0;
5984 fpl.tvp = NULL; /* for degenerate path handling */
5986 pwd = pwd_get_smr();
5988 ndp->ni_rootdir = pwd->pwd_rdir;
5989 ndp->ni_topdir = pwd->pwd_jdir;
5991 if (cnp->cn_pnbuf[0] == '/') {
5992 dvp = cache_fpl_handle_root(&fpl);
5993 MPASS(ndp->ni_resflags == 0);
5994 ndp->ni_resflags = NIRES_ABS;
5996 if (ndp->ni_dirfd == AT_FDCWD) {
5997 dvp = pwd->pwd_cdir;
5999 error = cache_fplookup_dirfd(&fpl, &dvp);
6000 if (__predict_false(error != 0)) {
6006 SDT_PROBE4(vfs, namei, lookup, entry, dvp, cnp->cn_pnbuf, cnp->cn_flags, true);
6007 error = cache_fplookup_impl(dvp, &fpl);
6009 cache_fpl_smr_assert_not_entered(&fpl);
6010 cache_fpl_assert_status(&fpl);
6011 *status = fpl.status;
6012 if (SDT_PROBES_ENABLED()) {
6013 SDT_PROBE3(vfs, fplookup, lookup, done, ndp, fpl.line, fpl.status);
6014 if (fpl.status == CACHE_FPL_STATUS_HANDLED)
6015 SDT_PROBE4(vfs, namei, lookup, return, error, ndp->ni_vp, true,
6019 if (__predict_true(fpl.status == CACHE_FPL_STATUS_HANDLED)) {
6020 MPASS(error != CACHE_FPL_FAILED);
6022 MPASS(fpl.dvp == NULL);
6023 MPASS(fpl.tvp == NULL);
6024 MPASS(fpl.savename == false);
6026 ndp->ni_dvp = fpl.dvp;
6027 ndp->ni_vp = fpl.tvp;
6029 cnp->cn_flags |= HASBUF;
6031 cache_fpl_cleanup_cnp(cnp);