Lines Matching refs:waiters

101            place the task in the waiters rbtree of a mutex as well as the
107 waiters  - A list of processes that are blocked on a mutex.
189 Every mutex keeps track of all the waiters that are blocked on itself. The
190 mutex has a rbtree to store these waiters by priority.  This tree is protected
199 a tree of all top waiters of the mutexes that are owned by the process.
200 Note that this tree only holds the top waiters and not all waiters that are
299 flag. It's set whenever there are waiters on a mutex.
348 the pi_waiters of a task holds an order by priority of all the top waiters
399 in the pi_waiters and waiters trees that the task is blocked on. This function
423 the task on the waiters tree of the mutex, and if need be, the pi_waiters
444       waiters of the lock
447 owner of the lock, and if the lock still has waiters, the top_waiter
488 does, then it will take itself off the waiters tree and set itself back
509 waiters, the owner field of the mutex would equal the current process and
518 A check is made to see if the mutex has waiters or not.  On architectures that
524 the grabbing of the wait_lock, the mutex may not have any waiters, thus the
525 owner still needs to make this check. If there are no waiters then the mutex
529 If there are waiters, then we need to wake one up.
532 waiter of the lock is found and removed from the waiters tree of the mutex