|
@@ -2686,7 +2686,6 @@ select_task_rq_fair(struct task_struct *p, int sd_flag, int wake_flags)
|
|
|
int prev_cpu = task_cpu(p);
|
|
|
int new_cpu = cpu;
|
|
|
int want_affine = 0;
|
|
|
- int want_sd = 1;
|
|
|
int sync = wake_flags & WF_SYNC;
|
|
|
|
|
|
if (p->nr_cpus_allowed == 1)
|
|
@@ -2703,27 +2702,6 @@ select_task_rq_fair(struct task_struct *p, int sd_flag, int wake_flags)
|
|
|
if (!(tmp->flags & SD_LOAD_BALANCE))
|
|
|
continue;
|
|
|
|
|
|
- /*
|
|
|
- * If power savings logic is enabled for a domain, see if we
|
|
|
- * are not overloaded, if so, don't balance wider.
|
|
|
- */
|
|
|
- if (tmp->flags & (SD_PREFER_LOCAL)) {
|
|
|
- unsigned long power = 0;
|
|
|
- unsigned long nr_running = 0;
|
|
|
- unsigned long capacity;
|
|
|
- int i;
|
|
|
-
|
|
|
- for_each_cpu(i, sched_domain_span(tmp)) {
|
|
|
- power += power_of(i);
|
|
|
- nr_running += cpu_rq(i)->cfs.nr_running;
|
|
|
- }
|
|
|
-
|
|
|
- capacity = DIV_ROUND_CLOSEST(power, SCHED_POWER_SCALE);
|
|
|
-
|
|
|
- if (nr_running < capacity)
|
|
|
- want_sd = 0;
|
|
|
- }
|
|
|
-
|
|
|
/*
|
|
|
* If both cpu and prev_cpu are part of this domain,
|
|
|
* cpu is a valid SD_WAKE_AFFINE target.
|
|
@@ -2731,21 +2709,15 @@ select_task_rq_fair(struct task_struct *p, int sd_flag, int wake_flags)
|
|
|
if (want_affine && (tmp->flags & SD_WAKE_AFFINE) &&
|
|
|
cpumask_test_cpu(prev_cpu, sched_domain_span(tmp))) {
|
|
|
affine_sd = tmp;
|
|
|
- want_affine = 0;
|
|
|
- }
|
|
|
-
|
|
|
- if (!want_sd && !want_affine)
|
|
|
break;
|
|
|
+ }
|
|
|
|
|
|
- if (!(tmp->flags & sd_flag))
|
|
|
- continue;
|
|
|
-
|
|
|
- if (want_sd)
|
|
|
+ if (tmp->flags & sd_flag)
|
|
|
sd = tmp;
|
|
|
}
|
|
|
|
|
|
if (affine_sd) {
|
|
|
- if (cpu == prev_cpu || wake_affine(affine_sd, p, sync))
|
|
|
+ if (cpu != prev_cpu && wake_affine(affine_sd, p, sync))
|
|
|
prev_cpu = cpu;
|
|
|
|
|
|
new_cpu = select_idle_sibling(p, prev_cpu);
|