| commit | 7142d17e8f935fa842e9f6eece2281b6d41625d6 | |
| author | Hillf Danton <dhillf@gmail.com> | |
| Thu, 5 May 2011 12:53:20 +0000 (5 20:53 +0800) | ||
| committer | Ingo Molnar <mingo@elte.hu> | |
| Fri, 6 May 2011 07:13:05 +0000 (6 09:13 +0200) | ||
| tree | cf905dfa17b50e64d50f17cc5ea450117c91fad0 | treesnapshot (tar.gz zip) |
| parent | 4934a4d3d3fa775601a9f1b35cc0e2aa93f81355 | commitdiff |
sched: Shorten the construction of the span cpu mask of sched domain
For a given node, when constructing the cpumask for its
sched_domain to span, if there is no best node available after
searching, further efforts could be saved, based on small change
in the return value of find_next_best_node().
Signed-off-by: Hillf Danton <dhillf@gmail.com>
Cc: Peter Zijlstra <peterz@infradead.org>
Cc: Mike Galbraith <efault@gmx.de>
Cc: Yong Zhang <yong.zhang0@gmail.com>
Link: http://lkml.kernel.org/r/BANLkTi%3DqPWxRAa6%2BdT3ohEP6Z%3D0v%2Be4EXA@mail.gmail.com
Signed-off-by: Ingo Molnar <mingo@elte.hu>
For a given node, when constructing the cpumask for its
sched_domain to span, if there is no best node available after
searching, further efforts could be saved, based on small change
in the return value of find_next_best_node().
Signed-off-by: Hillf Danton <dhillf@gmail.com>
Cc: Peter Zijlstra <peterz@infradead.org>
Cc: Mike Galbraith <efault@gmx.de>
Cc: Yong Zhang <yong.zhang0@gmail.com>
Link: http://lkml.kernel.org/r/BANLkTi%3DqPWxRAa6%2BdT3ohEP6Z%3D0v%2Be4EXA@mail.gmail.com
Signed-off-by: Ingo Molnar <mingo@elte.hu>
| kernel/sched.c | diffblobblamehistory |