Lines Matching refs:waiter

100 waiter
101          - A waiter is a struct that is stored on the stack of a blocked
102            process.  Since the scope of the waiter is within the code for
104            the waiter on the process's stack (local variable).  This
110            waiter is sometimes used in reference to the task that is waiting
111            on a mutex. This is the same as waiter->task.
116 top waiter
119 top pi waiter
360 pi waiter to its own normal/deadline priority and take the higher one.
377 by the task, so we only need to compare the priority of that top pi waiter
395 check for deadlocking, the mutex that the task owns, a pointer to a waiter
396 that is the process's waiter struct that is blocked on the mutex (although this
398 is blocked, and a top_task as the top waiter of the mutex.
408 should be at, but the rbtree nodes of the task's waiter have not been updated
431 The slow path function is where the task's waiter structure is created on
432 the stack.  This is because the waiter structure is only needed for the
433 scope of this function.  The waiter structure holds the nodes to store
465 the lock's waiter tree and propagate the pi chain of the lock as well
472 The accounting of a mutex and process is done with the waiter structure of
474 to the mutex.  The rbtree node of waiter are initialized to the processes
478 add the waiter to the task waiter tree.  If the current process is the
480 previous top waiter process (if it exists) from the pi_waiters of the owner,
490 mutex (waiter "task" field is not NULL), then we go to sleep (call schedule).
532 determine if a waiter needs to be awoken or not.  On architectures that
534 in the slow path too.  If a waiter of a mutex woke up because of a signal
544 waiter of the lock is found and removed from the waiters tree of the mutex