Lines Matching refs:blocked

80            blocked on one of its locks.  This is described in more detail
95 waiter   - A waiter is a struct that is stored on the stack of a blocked
97            a process being blocked on the mutex, it is fine to allocate
100            the task is blocked on.  It also has rbtree node structures to
107 waiters  - A list of processes that are blocked on a mutex.
123 would never diverge, since a process can't be blocked on more than one
132            B blocked on L1
134                   C blocked on L2
136                          D blocked on L3
138                                 E blocked on L4
145 another mutex L5 where B owns L5 and F is blocked on mutex L5.
151 Since a process may own more than one mutex, but never be blocked on more than
166 Also since a mutex may have more than one process blocked on it, we can
168 blocked on mutex L2:
189 Every mutex keeps track of all the waiters that are blocked on itself. The
201 blocked on mutexes owned by the process.
270        C blocked on L3
272               B blocked on L2
274                      A blocked on L1
361 process has just blocked on a mutex owned by the task, rt_mutex_adjust_prio
385 that is the process's waiter struct that is blocked on the mutex (although this
387 is blocked, and a top_task as the top waiter of the mutex.
399 in the pi_waiters and waiters trees that the task is blocked on. This function
473 If the owner is also blocked on a lock, and had its pi_waiters changed
477 Now all locks are released, and if the current process is still blocked on a