Lines Matching refs:lookups
30 are path-walk intensive tend to do path lookups starting from a common dentry
47 Name lookups will want to find a particular path that a name string refers to
69 - perform dcache hash name lookups on (parent, name element) tuples;
96 using d_seq for synchronisation (see seqcount based lookups, below).
175 Seqcount based lookups
177 In refcount based dcache lookups, d_lock is used to serialise access to
206 With this two parts of the puzzle, we can do path lookups without taking
213 is the traditional[*] way of performing dcache lookups using d_lock to
217 lookups, and can perform lookup of intermediate elements without any stores to
299 lookups, and to assume dentry mount points and mount roots are stable up and
304 * Dentry lookups (based on parent, candidate string tuple) recheck the parent
348 rcu-lookups restart nodentry link revalidate permission
355 What this shows is that failed rcu-walk lookups, ie. ones that are restarted