Lines Matching refs:locks

11 The basic object the validator operates upon is a 'class' of locks.
13 A class of locks is a group of locks that are logically the same with
14 respect to locking rules, even if the locks may have multiple (possibly
24 perspective, the two locks (L1 and L2) are not necessarily related; that
111 Unused locks (e.g., mutexes) cannot be part of the cause of an error.
143 Furthermore, two locks can not be taken in inverse order::
149 deadlock - as attempts to acquire the two locks form a circle which
153 operations; the validator will still find whether these locks can be
170 any rule violation between the new lock and any of the held locks.
188 could interrupt _any_ of the irq-unsafe or hardirq-unsafe locks, which
200 locks in this fixed order on each of the objects.
237 Two constructs can be used to annotate and check where and if certain locks
328 sequence of locks taken after each other) only once. A simple stack of
329 held locks is maintained, and a lightweight 64-bit hash value is
347 initialize locks.  These two problems are illustrated below:
352 	that module's locks, but module unloading does not remove old
358 	locks that are not explicitly initialized.  For example,
366 	would place all 8192 locks into a single lock class.
369 	initialize your locks.
399 Recursive read locks:
468 acquired recursively. Unlike non-recursive read locks, recursive read locks
480 is not a deadlock for recursive read locks, as while the task B is waiting for
493 To be concise, we call that write locks and non-recursive read locks as
494 "non-recursive" locks and recursive read locks as "recursive" locks.
496 Recursive locks don't block each other, while non-recursive locks do (this is
497 even true for two non-recursive read locks). A non-recursive lock can block the
500 A deadlock case with recursive locks involved is as follow::
514 Lock dependencies record the orders of the acquisitions of a pair of locks, and
551 Note that given two locks, they may have multiple dependencies between them,
575 path (where X, Y, Z are locks), and the walk from X to Y is through a -(SR)-> or