Lines Matching refs:processes

34 processes, let's call them processes A, B, and C, where A is the highest
65 to understand, let's use the previous example, with processes A, B, and C again.
78 PI chain - The PI chain is an ordered series of locks and processes that cause
79            processes to inherit priorities from a previous process that is
107 waiters  - A list of processes that are blocked on a mutex.
115        differentiate between two processes that are being described together.
121 The PI chain is a list of processes and mutexes that may cause priority
162 For PI to work, the processes at the right end of these chains (or we may
164 than the processes to the left or below in the chain.
187 on both mutexes and processes, I'll explain the plist.  This is similar to
195 highest priority item in the list.  Obviously this is useful to store processes
283 Now we add 4 processes that run each of these functions separately.
297 This gives us a PI depth of 4 (four processes), but looking at any of the
454 task adjusted, but the plist nodes that hold the task in other processes
531 The PI code is to help with real-time processes, and to let the highest
616   to update the pending owner's pi_list, since we only worry about processes
668 to the mutex.  The plist nodes are initialized to the processes current
750 as the "Has Waiters" bit if there still are other processes blocked on the