commit | 58d6c2d72f8628f39e8689fbde8aa177fcf00a37 | [log] [tgz] |
---|---|---|
author | Peter Zijlstra <a.p.zijlstra@chello.nl> | Sat Apr 19 19:45:00 2008 +0200 |
committer | Ingo Molnar <mingo@elte.hu> | Sat Apr 19 19:45:00 2008 +0200 |
tree | 0be40bd788856b3cabb99ff258561b15a574f2f3 | |
parent | d19ca30874f2ad343d054e0b5c0576744afeecd4 [diff] |
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>