summaryrefslogtreecommitdiff
path: root/include/linux/sched.h
diff options
context:
space:
mode:
authorRik van Riel <riel@redhat.com>2011-02-01 17:48:37 +0300
committerIngo Molnar <mingo@elte.hu>2011-02-03 16:20:32 +0300
commit2c13c919d9e9a3db9896143a501f83dcbbe1ced4 (patch)
tree4c326d2384ee0d09991cf5246baead5cfd08f3f9 /include/linux/sched.h
parent725e7580aaf98e9f7b22b8ccfc640ad0c09e2b08 (diff)
downloadlinux-2c13c919d9e9a3db9896143a501f83dcbbe1ced4.tar.xz
sched: Limit the scope of clear_buddies
The clear_buddies function does not seem to play well with the concept of hierarchical runqueues. In the following tree, task groups are represented by 'G', tasks by 'T', next by 'n' and last by 'l'. (nl) / \ G(nl) G / \ \ T(l) T(n) T This situation can arise when a task is woken up T(n), and the previously running task T(l) is marked last. When clear_buddies is called from either T(l) or T(n), the next and last buddies of the group G(nl) will be cleared. This is not the desired result, since we would like to be able to find the other type of buddy in many cases. This especially a worry when implementing yield_task_fair through the buddy system. The fix is simple: only clear the buddy type that the task itself is indicated to be. As an added bonus, we stop walking up the tree when the buddy has already been cleared or pointed elsewhere. Signed-off-by: Rik van Riel <riel@redhat.coM> Signed-off-by: Peter Zijlstra <a.p.zijlstra@chello.nl> LKML-Reference: <20110201094837.6b0962a9@annuminas.surriel.com> Signed-off-by: Ingo Molnar <mingo@elte.hu>
Diffstat (limited to 'include/linux/sched.h')
0 files changed, 0 insertions, 0 deletions