Lines Matching refs:validator

1 Runtime locking correctness validator
11 The basic object the validator operates upon is a 'class' of locks.
19 The validator tracks the 'usage state' of lock-classes, and it tracks
25 dependency just means the order ever happened. The validator maintains a
27 the validator will shoot a splat if incorrect.
41 The validator tracks lock-class usage history and divides the usage into
134 The validator detects and reports lock usage that violates these
151 validator will find such dependency circle in arbitrary complexity,
153 operations; the validator will still find whether these locks can be
169 kernel: when acquiring a new lock, the validator checks whether there is
206 lock, the lock ordering is fully correct. The validator does not
210 In order to teach the validator about this correct usage model, new
227 The validator treats a lock that is taken in such a nested fashion as a
284 The validator achieves perfect, mathematical 'closure' (proof of locking
287 kernel, the validator proves it with a 100% certainty that no
294 task/context) for the validator to be able to prove correctness. (For
310     assuming that the validator itself is 100% correct, and no other
311     part of the system corrupts the state of the validator in any way.
314     with the validator. We also assume that the 64-bit 'chain hash'
339 The validator tracks a maximum of MAX_LOCKDEP_KEYS number of lock classes.
349 1.	Repeated module loading and unloading while running the validator
371 One might argue that the validator should be modified to allow