Lines Matching refs:walking
1 Path walking and name lookup locking
6 will be resolved. Paths are resolved by walking the namespace tree, starting
15 Path walking synchronisation history:
18 algorithm changed this by holding the dcache_lock at the beginning and walking
26 dentry that was looked up, so that may be used as the basis for walking the
37 path walking.
39 Path walking overview
60 name in the name string, and require some recursive path walking. Mount points
64 exact path walking flags.
66 Path walking then must, broadly, do several particular things:
84 The hash lists are RCU protected, so list walking is not serialised with
118 There is no fundamental problem with walking down the wrong list, because the
182 As explained above, we would like to do path walking without taking locks or
209 RCU-walk path walking design
212 Path walking code now has two distinct modes, ref-walk and rcu-walk. ref-walk
216 walking is operating on each dentry. rcu-walk uses seqcount based dentry
327 "store-free" path walking is not strictly store free. We take vfsmount lock