Lines Matching refs:waiters
107 place the task in the waiters rbtree of a mutex as well as the
113 waiters
199 Every mutex keeps track of all the waiters that are blocked on itself. The
200 mutex has a rbtree to store these waiters by priority. This tree is protected
209 a tree of all top waiters of the mutexes that are owned by the process.
210 Note that this tree only holds the top waiters and not all waiters that are
309 flag. It's set whenever there are waiters on a mutex.
358 the pi_waiters of a task holds an order by priority of all the top waiters
410 in the pi_waiters and waiters trees that the task is blocked on. This function
434 the task on the waiters tree of the mutex, and if need be, the pi_waiters
456 waiters of the lock
459 owner of the lock, and if the lock still has waiters, the top_waiter
500 does, then it will take itself off the waiters tree and set itself back
521 waiters, the owner field of the mutex would equal the current process and
530 A check is made to see if the mutex has waiters or not. On architectures that
536 the grabbing of the wait_lock, the mutex may not have any waiters, thus the
537 owner still needs to make this check. If there are no waiters then the mutex
541 If there are waiters, then we need to wake one up.
544 waiter of the lock is found and removed from the waiters tree of the mutex