提交 d4335581 编写于 作者: M Matt Fleming 提交者: Ingo Molnar

sched/fair: Add comments to explain select_idle_sibling()

It's not entirely obvious how the main loop in select_idle_sibling()
works on first glance. Sprinkle a few comments to explain the design
and intention behind the loop based on some conversations with Mike
and Peter.
Signed-off-by: NMatt Fleming <matt@codeblueprint.co.uk>
Signed-off-by: NPeter Zijlstra (Intel) <peterz@infradead.org>
Cc: Linus Torvalds <torvalds@linux-foundation.org>
Cc: Mel Gorman <mgorman@suse.com>
Cc: Mike Galbraith <mgalbraith@suse.de>
Cc: Peter Zijlstra <peterz@infradead.org>
Cc: Thomas Gleixner <tglx@linutronix.de>
Link: http://lkml.kernel.org/r/1457535548-15329-1-git-send-email-matt@codeblueprint.co.ukSigned-off-by: NIngo Molnar <mingo@kernel.org>
上级 3a47d512
...@@ -5055,7 +5055,19 @@ static int select_idle_sibling(struct task_struct *p, int target) ...@@ -5055,7 +5055,19 @@ static int select_idle_sibling(struct task_struct *p, int target)
return i; return i;
/* /*
* Otherwise, iterate the domains and find an elegible idle cpu. * Otherwise, iterate the domains and find an eligible idle cpu.
*
* A completely idle sched group at higher domains is more
* desirable than an idle group at a lower level, because lower
* domains have smaller groups and usually share hardware
* resources which causes tasks to contend on them, e.g. x86
* hyperthread siblings in the lowest domain (SMT) can contend
* on the shared cpu pipeline.
*
* However, while we prefer idle groups at higher domains
* finding an idle cpu at the lowest domain is still better than
* returning 'target', which we've already established, isn't
* idle.
*/ */
sd = rcu_dereference(per_cpu(sd_llc, target)); sd = rcu_dereference(per_cpu(sd_llc, target));
for_each_lower_domain(sd) { for_each_lower_domain(sd) {
...@@ -5065,11 +5077,16 @@ static int select_idle_sibling(struct task_struct *p, int target) ...@@ -5065,11 +5077,16 @@ static int select_idle_sibling(struct task_struct *p, int target)
tsk_cpus_allowed(p))) tsk_cpus_allowed(p)))
goto next; goto next;
/* Ensure the entire group is idle */
for_each_cpu(i, sched_group_cpus(sg)) { for_each_cpu(i, sched_group_cpus(sg)) {
if (i == target || !idle_cpu(i)) if (i == target || !idle_cpu(i))
goto next; goto next;
} }
/*
* It doesn't matter which cpu we pick, the
* whole group is idle.
*/
target = cpumask_first_and(sched_group_cpus(sg), target = cpumask_first_and(sched_group_cpus(sg),
tsk_cpus_allowed(p)); tsk_cpus_allowed(p));
goto done; goto done;
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册