Lines Matching refs:PI

16 inheritance (PI) algorithm that is used, as well as reasons for the
17 decisions that were made to implement PI in the manner that was done.
57 Priority Inheritance (PI)
61 for this document.  Here we only discuss PI.
63 PI is where a process inherits the priority of another process if the other
76 the design that is used to implement PI.
78 PI chain - The PI chain is an ordered series of locks and processes that cause
84            PI and spin locks that are used in the PI code, from now on
85            the PI locks will be called a mutex.
88            referring to spin locks that are used to protect parts of the PI
118 PI chain
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
186 Before I go further and talk about how the PI chain is stored through lists
214 Task PI List
217 To keep track of the PI chains, each process has its own PI list.  This is
222 The top of the task's PI list is always the highest priority task that
233 Depth of the PI Chain
236 The maximum depth of the PI chain is not dynamic, and could actually be
297 This gives us a PI depth of 4 (four processes), but looking at any of the
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.
361 The implementation of the PI code in rtmutex.c has several places that a
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
413 rt_mutex_adjust_prio_chain is called with a task to be checked for PI
432 A loop is entered, where task is the owner to be checked for PI changes that
439 the top of the PI chain.
446 or timeout and has left the PI chain.  In either case, the loop is exited, since
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
531 The PI code is to help with real-time processes, and to let the highest
614   is never blocked on a mutex.  So there is no PI chain to worry about.  It also