Lines Matching refs:blocked

82            blocked on one of its locks.  This is described in more detail
101          - A waiter is a struct that is stored on the stack of a blocked
103            a process being blocked on the mutex, it is fine to allocate
106            the task is blocked on.  It also has rbtree node structures to
114          - A list of processes that are blocked on a mutex.
133 would never diverge, since a process can't be blocked on more than one
142            B blocked on L1
144                   C blocked on L2
146                          D blocked on L3
148                                 E blocked on L4
155 another mutex L5 where B owns L5 and F is blocked on mutex L5.
161 Since a process may own more than one mutex, but never be blocked on more than
176 Also since a mutex may have more than one process blocked on it, we can
178 blocked on mutex L2::
199 Every mutex keeps track of all the waiters that are blocked on itself. The
211 blocked on mutexes owned by the process.
280          C blocked on L3
282                 B blocked on L2
284                        A blocked on L1
372 process has just blocked on a mutex owned by the task, rt_mutex_adjust_prio
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.
410 in the pi_waiters and waiters trees that the task is blocked on. This function
485 If the owner is also blocked on a lock, and had its pi_waiters changed
489 Now all locks are released, and if the current process is still blocked on a