rt-mutex-design.rst - OpenGrok cross reference for /linux/Documentation/locking/rt-mutex-design.rst

Lines Matching refs:PI
17 inheritance (PI) algorithm that is used, as well as reasons for the
18 decisions that were made to implement PI in the manner that was done.
58 Priority Inheritance (PI)
62 for this document.  Here we only discuss PI.
64 PI is where a process inherits the priority of another process if the other
77 the design that is used to implement PI.
79 PI chain
80          - The PI chain is an ordered series of locks and processes that cause
87            PI and spin locks that are used in the PI code, from now on
88            the PI locks will be called a mutex.
92            referring to spin locks that are used to protect parts of the PI
128 PI chain
131 The PI chain is a list of processes and mutexes that may cause priority
172 For PI to work, the processes at the right end of these chains (or we may
205 Task PI Tree
208 To keep track of the PI chains, each process has its own PI rbtree.  This is
213 The top of the task's PI tree is always the highest priority task that
224 Depth of the PI Chain
227 The maximum depth of the PI chain is not dynamic, and could actually be
288 This gives us a PI depth of 4 (four processes), but looking at any of the
295 PI chain, and have the code holding spin locks while looking at a large
298 time, as it walks the PI chain.  More about this below.
349 The implementation of the PI code in rtmutex.c has several places that a
381 High level overview of the PI chain walk
384 The PI chain walk is implemented by the function rt_mutex_adjust_prio_chain.
387 with what we believe is the best.  It walks the PI chain by only grabbing
393 rt_mutex_adjust_prio_chain is called with a task to be checked for PI