Skip to content
Snippets Groups Projects
Commit 2de0b463 authored by Gregory Haskins's avatar Gregory Haskins Committed by Ingo Molnar
Browse files

sched: RT balancing: include current CPU


It doesn't hurt if we allow the current CPU to be included in the
search.  We will just simply skip it later if the current CPU turns out
to be the lowest.

We will use this later in the series

Signed-off-by: default avatarGregory Haskins <ghaskins@novell.com>
Signed-off-by: default avatarSteven Rostedt <srostedt@redhat.com>
Signed-off-by: default avatarIngo Molnar <mingo@elte.hu>
parent 07b4032c
No related branches found
No related tags found
No related merge requests found
...@@ -277,9 +277,6 @@ static int find_lowest_rq(struct task_struct *task) ...@@ -277,9 +277,6 @@ static int find_lowest_rq(struct task_struct *task)
for_each_cpu_mask(cpu, *cpu_mask) { for_each_cpu_mask(cpu, *cpu_mask) {
struct rq *rq = cpu_rq(cpu); struct rq *rq = cpu_rq(cpu);
if (cpu == rq->cpu)
continue;
/* We look for lowest RT prio or non-rt CPU */ /* We look for lowest RT prio or non-rt CPU */
if (rq->rt.highest_prio >= MAX_RT_PRIO) { if (rq->rt.highest_prio >= MAX_RT_PRIO) {
lowest_rq = rq; lowest_rq = rq;
...@@ -307,7 +304,7 @@ static struct rq *find_lock_lowest_rq(struct task_struct *task, ...@@ -307,7 +304,7 @@ static struct rq *find_lock_lowest_rq(struct task_struct *task,
for (tries = 0; tries < RT_MAX_TRIES; tries++) { for (tries = 0; tries < RT_MAX_TRIES; tries++) {
cpu = find_lowest_rq(task); cpu = find_lowest_rq(task);
if (cpu == -1) if ((cpu == -1) || (cpu == rq->cpu))
break; break;
lowest_rq = cpu_rq(cpu); lowest_rq = cpu_rq(cpu);
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment