Lines Matching refs:locking

1 Runtime locking correctness validator
13 respect to locking rules, even if the locks may have multiple (possibly
44 When locking rules are violated, these state bits are presented in the
45 locking error messages, inside curlies. A contrived example:
91 other locking sequence between the acquire-lock operations, the
106 The above rules are enforced for any locking sequence that occurs in the
130 Exception: Nested data dependencies leading to nested locking
140 An example of such an object hierarchy that results in "nested locking"
145 automatically detect this natural ordering, as the locking rule behind
149 versions of the various locking primitives were added that allow you to
162 In this case the locking is done on a bdev object that is known to be a
175 The validator achieves perfect, mathematical 'closure' (proof of locking
177 locking sequence that occurred at least once during the lifetime of the
179 combination and timing of these locking sequences can cause any class of
182 I.e. complex multi-CPU and multi-task locking scenarios do not have to
184 locking chains have to occur at least once (anytime, in any
191 This radically decreases the complexity of locking related QA of the
193 single-task locking dependencies in the kernel as possible, at least
194 once, to prove locking correctness - instead of having to trigger every
195 possible combination of locking interaction between CPUs, combined with
216 This problem is solved by checking any given 'locking scenario' (unique
222 locking chain occurs again later on, the hash table tells us that we