Peter Zijlstra 58d6c2d72f sched: rt-group: optimize dequeue_rt_stack
Now that the group hierarchy can have an arbitrary depth the O(n^2) nature
of RT task dequeues will really hurt. Optimize this by providing space to
store the tree path, so we can walk it the other way.

Signed-off-by: Peter Zijlstra <a.p.zijlstra@chello.nl>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
2008-04-19 19:45:00 +02:00
..
2008-02-14 21:13:33 -08:00
2008-04-19 09:59:43 +10:00
2007-10-18 14:37:24 -07:00
2008-03-30 14:18:41 -07:00
2008-03-30 14:18:41 -07:00
2008-04-17 12:22:31 +02:00
2008-01-25 21:08:29 +01:00
2007-07-16 09:05:50 -07:00
2008-04-19 19:44:58 +02:00
2008-04-02 15:28:19 -07:00
2008-02-08 09:22:31 -08:00
2008-02-08 09:22:31 -08:00
2008-01-25 21:08:24 +01:00
2008-02-13 16:21:18 -08:00
2008-01-25 21:08:24 +01:00
2007-07-16 09:05:50 -07:00
2008-04-17 10:43:01 -04:00
2008-04-18 08:17:57 -07:00
2008-01-30 13:31:20 +01:00
2008-02-06 10:41:02 -08:00
2008-02-05 09:44:07 -08:00
2008-02-08 09:22:29 -08:00
2008-02-08 09:22:39 -08:00
2008-04-17 12:22:31 +02:00
2008-02-08 09:22:31 -08:00