Lines Matching full:have
56 * if the parents don't have a common ancestor, fail the operation.
74 operations on directory trees, but we obviously do not have the full
75 picture of those - especially for network filesystems. What we have
86 For a lot of reasons we want to have the same directory present in dcache
106 if two dentries have been found to have a common ancestor after taking
111 parents have a common ancestor.
149 For example, if we have NFS filesystem caching on a local one, we have
174 In other words, we have a cycle of threads, T1,..., Tn,
185 Each operation in the minimal cycle must have locked at least
193 we would have Dn a parent of D1, which is a parent of D2, which is
195 have changed since the moment directory locks had been acquired,
197 we would have a loop.
204 In other words, we have a cross-directory rename that locked
209 has acquired filesystem lock and verified that directories involved have
215 Dn and D1 would have to be among those, with Dn locked before D1.
221 of another - otherwise the operation would not have progressed past
226 would have to be a descendent of its child.
242 parent of source, then try to lock the parent of target, only to have
244 descendent of the parent of target. At that point we have cross-directory
248 the locks) and voila - we have a deadlock.
260 Since the operation has succeeded, neither source nor target could have
262 in the parent of source could not have passed through the target and
264 not have passed through the node itself, or we would've had a loop before
273 ancestors of that parent. But as we have just shown, that chain must
283 Notice that "directory" in the above == "anything that might have