Lines Matching refs:locking

1 Runtime locking correctness validator
14 respect to locking rules, even if the locks may have multiple (possibly
50 where the n STATEs are coded in kernel/locking/lockdep_states.h and as of
58 When locking rules are violated, these usage bits are presented in the
59 locking error messages, inside curlies, with a total of 2 * n STATEs bits.
149 i.e., there can be any other locking sequence between the acquire-lock
165 The above rules are enforced for any locking sequence that occurs in the
189 Exception: Nested data dependencies leading to nested locking
199 An example of such an object hierarchy that results in "nested locking"
204 automatically detect this natural ordering, as the locking rule behind
208 versions of the various locking primitives were added that allow you to
221 In this case the locking is done on a bdev object that is known to be a
273 While comments about locking requirements might provide useful information,
275 locking problems and they carry the same level of details when inspecting
281 The validator achieves perfect, mathematical 'closure' (proof of locking
283 locking sequence that occurred at least once during the lifetime of the
285 combination and timing of these locking sequences can cause any class of
288 I.e. complex multi-CPU and multi-task locking scenarios do not have to
290 locking chains have to occur at least once (anytime, in any
297 This radically decreases the complexity of locking related QA of the
299 single-task locking dependencies in the kernel as possible, at least
300 once, to prove locking correctness - instead of having to trigger every
301 possible combination of locking interaction between CPUs, combined with
324 This problem is solved by checking any given 'locking scenario' (unique
330 locking chain occurs again later on, the hash table tells us that we