Lines Matching refs:chain

78 PI chain - The PI chain is an ordered series of locks and processes that cause
118 PI chain
121 The PI chain is a list of processes and mutexes that may cause priority
122 inheritance to take place.  Multiple chains may converge, but a chain
140 The chain would be:
147 The chain for F would be:
163 also call it the Top of the chain) must be equal to or higher in priority
164 than the processes to the left or below in the chain.
186 Before I go further and talk about how the PI chain is stored through lists
236 The maximum depth of the PI chain is not dynamic, and could actually be
295 And thus we have the chain A->L1->B->L2->C->L3->D.
304 PI chain, and have the code holding spin locks while looking at a large
307 time, as it walks the PI chain.  More about this below.
401 High level overview of the PI chain walk
404 The PI chain walk is implemented by the function rt_mutex_adjust_prio_chain.
407 with what we believe is the best.  It walks the PI chain by only grabbing
439 the top of the PI chain.
446 or timeout and has left the PI chain.  In either case, the loop is exited, since
448 task that owns a mutex that this current task is waiting on.  A priority chain
491       become the task that is being processed in the PI chain, since
497       end of the PI chain is when the task isn't blocked on anything or the
506       task and continue the loop, doing the end of PI chain check again.
511       after the check for end of the PI chain and the grabbing of the
513       but never give up the wait_lock.  So the PI chain loop is guaranteed to
614   is never blocked on a mutex.  So there is no PI chain to worry about.  It also