Re: [PATCH 09/14] rtmutex: turn the plist into an rb-tree.

2013-11-20 Thread Steven Rostedt
On Thu, 7 Nov 2013 14:43:43 +0100 Juri Lelli wrote: > From: Peter Zijlstra > > Turn the pi-chains from plist to rb-tree, in the rt_mutex code, > and provide a proper comparison function for -deadline and > -priority tasks. > > This is done mainly because: > - classical prio field of the plis

[PATCH 09/14] rtmutex: turn the plist into an rb-tree.

2013-11-07 Thread Juri Lelli
From: Peter Zijlstra Turn the pi-chains from plist to rb-tree, in the rt_mutex code, and provide a proper comparison function for -deadline and -priority tasks. This is done mainly because: - classical prio field of the plist is just an int, which might not be enough for representing a deadl

[PATCH 09/14] rtmutex: turn the plist into an rb-tree.

2013-10-14 Thread Juri Lelli
From: Peter Zijlstra Turn the pi-chains from plist to rb-tree, in the rt_mutex code, and provide a proper comparison function for -deadline and -priority tasks. This is done mainly because: - classical prio field of the plist is just an int, which might not be enough for representing a deadl

[PATCH 09/14] rtmutex: turn the plist into an rb-tree.

2013-02-11 Thread Juri Lelli
From: Peter Zijlstra Turn the pi-chains from plist to rb-tree, in the rt_mutex code, and provide a proper comparison function for -deadline and -priority tasks. This is done mainly because: - classical prio field of the plist is just an int, which might not be enough for representing a deadl