On 04/15/2017 02:43 AM, Steven Rostedt wrote:
>> Yes, how about this?
>> +If the G process has highest priority in the chain, any rightside lock
>> owners
>> +in the tree branch need to increase its' priority as high as G.
>
> If task G is the highest priority task in the chain, then all the ta
On Fri, 14 Apr 2017 16:52:11 +0800
Alex Shi wrote:
> >> -Plist
> >> --
> >> -
> >> -Before I go further and talk about how the PI chain is stored through
> >> lists
> >> -on both mutexes and processes, I'll explain the plist. This is similar to
> >> -the struct list_head functionality that
On 04/13/2017 11:54 PM, Steven Rostedt wrote:
> On Thu, 13 Apr 2017 22:02:52 +0800
> Alex Shi wrote:
>
>> The rt-mutex documents didn't gotten meaningful update from its first
>> version. Even after owner's pending bit was removed in commit 8161239a8bcc
>> ("rtmutex: Simplify PI algorithm and m
On Thu, 13 Apr 2017 22:02:52 +0800
Alex Shi wrote:
> The rt-mutex documents didn't gotten meaningful update from its first
> version. Even after owner's pending bit was removed in commit 8161239a8bcc
> ("rtmutex: Simplify PI algorithm and make highest prio task get lock")
> and priority list 'pli
On Thu, 13 Apr 2017 22:02:52 +0800
Alex Shi wrote:
> The rt-mutex documents didn't gotten meaningful update from its first
> version. Even after owner's pending bit was removed in commit 8161239a8bcc
> ("rtmutex: Simplify PI algorithm and make highest prio task get lock")
> and priority list 'pli
