Lines Matching full:would

193 we would have Dn a parent of D1, which is a parent of D2, which is
196 so they would all hold simultaneously at the deadlock time and
197 we would have a loop.
215 Dn and D1 would have to be among those, with Dn locked before D1.
219 it would be the first parent to be locked.  Therefore at least one of the
221 of another - otherwise the operation would not have progressed past
224 It can't be a parent and its child; otherwise we would've had
226 would have to be a descendent of its child.
229 Otherwise the child of the parent in question would've been a descendent
240 rename is crucial - without it a deadlock would be possible.  Indeed,
241 suppose the parents are initially in different trees; we would lock the
247 in between (all of those would fail with -ENOTEMPTY, had they ever gotten
264 not have passed through the node itself, or we would've had a loop before
271 source or target; the next node in the loop would be the ex-parent of
272 target or source resp.  After that the loop would follow the chain of
280 also preserved by all operations (cross-directory rename on a tree that would
286 in is_subdir() that would make it work even in presence of such beasts.