aboutsummaryrefslogtreecommitdiffstats
path: root/kernel/sched_rt.c
diff options
context:
space:
mode:
authorGregory Haskins <ghaskins@novell.com>2009-07-30 10:57:23 -0400
committerIngo Molnar <mingo@elte.hu>2009-08-02 08:26:12 -0400
commit00aec93d10a051ea64f83eff75d4065a19508ea6 (patch)
tree010148caeaf4d4b36188ba15828343aa6c74efc9 /kernel/sched_rt.c
parent3f029d3c6d62068d59301d90c18dbde8ee402107 (diff)
sched: Fully integrate cpus_active_map and root-domain code
Reflect "active" cpus in the rq->rd->online field, instead of the online_map. The motivation is that things that use the root-domain code (such as cpupri) only care about cpus classified as "active" anyway. By synchronizing the root-domain state with the active map, we allow several optimizations. For instance, we can remove an extra cpumask_and from the scheduler hotpath by utilizing rq->rd->online (since it is now a cached version of cpu_active_map & rq->rd->span). Signed-off-by: Gregory Haskins <ghaskins@novell.com> Acked-by: Peter Zijlstra <peterz@infradead.org> Acked-by: Max Krasnyansky <maxk@qualcomm.com> Signed-off-by: Peter Zijlstra <a.p.zijlstra@chello.nl> LKML-Reference: <20090730145723.25226.24493.stgit@dev.haskins.net> Signed-off-by: Ingo Molnar <mingo@elte.hu>
Diffstat (limited to 'kernel/sched_rt.c')
-rw-r--r--kernel/sched_rt.c7
1 files changed, 0 insertions, 7 deletions
diff --git a/kernel/sched_rt.c b/kernel/sched_rt.c
index a8f89bc3e5eb..13f728ef5b38 100644
--- a/kernel/sched_rt.c
+++ b/kernel/sched_rt.c
@@ -1173,13 +1173,6 @@ static int find_lowest_rq(struct task_struct *task)
1173 return -1; /* No targets found */ 1173 return -1; /* No targets found */
1174 1174
1175 /* 1175 /*
1176 * Only consider CPUs that are usable for migration.
1177 * I guess we might want to change cpupri_find() to ignore those
1178 * in the first place.
1179 */
1180 cpumask_and(lowest_mask, lowest_mask, cpu_active_mask);
1181
1182 /*
1183 * At this point we have built a mask of cpus representing the 1176 * At this point we have built a mask of cpus representing the
1184 * lowest priority tasks in the system. Now we want to elect 1177 * lowest priority tasks in the system. Now we want to elect
1185 * the best one based on our affinity and topology. 1178 * the best one based on our affinity and topology.