Lines Matching refs:locking

1 Runtime locking correctness validator
14 respect to locking rules, even if the locks may have multiple (possibly
51 where the n STATEs are coded in kernel/locking/lockdep_states.h and as of
61 When locking rules are violated, these usage bits are presented in the
62 locking error messages, inside curlies, with a total of 2 * n STATEs bits.
152 i.e., there can be any other locking sequence between the acquire-lock
168 The above rules are enforced for any locking sequence that occurs in the
192 Exception: Nested data dependencies leading to nested locking
202 An example of such an object hierarchy that results in "nested locking"
207 automatically detect this natural ordering, as the locking rule behind
211 versions of the various locking primitives were added that allow you to
224 In this case the locking is done on a bdev object that is known to be a
276 While comments about locking requirements might provide useful information,
278 locking problems and they carry the same level of details when inspecting
284 The validator achieves perfect, mathematical 'closure' (proof of locking
286 locking sequence that occurred at least once during the lifetime of the
288 combination and timing of these locking sequences can cause any class of
291 I.e. complex multi-CPU and multi-task locking scenarios do not have to
293 locking chains have to occur at least once (anytime, in any
300 This radically decreases the complexity of locking related QA of the
302 single-task locking dependencies in the kernel as possible, at least
303 once, to prove locking correctness - instead of having to trigger every
304 possible combination of locking interaction between CPUs, combined with
327 This problem is solved by checking any given 'locking scenario' (unique
333 locking chain occurs again later on, the hash table tells us that we
589 combination of locking sequences that causes deadlock. I.e. a strong circle is
595 combination of locking sequences that could cause deadlock. I.e.  strong
618 We now can construct a combination of locking sequences that cause deadlock: