lkml.org 
[lkml]   [2011]   [Jun]   [3]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
Patch in this message
/
Date
Subject[PATCH] sched: find all lowest run-queues for RT task
From
When finding the lowest run-queue for a given RT task, as seen in cases such as
select_task_rq_rt() and find_lock_lowest_rq(), RQs with no RT tasks are also
eligible for both RR and FIFO RT tasks.

Minor change is added, when initializing cpupri, to record non-RT RQs which are
upated automatically, due to the cool design and implementation of cpupri, when
RT RQs are set and unset. Then they could be included in the selected CPUs by
cpupri_find().

A call for cpupri_set() is also added when a RQ has no RT task to run.

Signed-off-by: Hillf Danton <dhillf@gmail.com>
---
kernel/sched_cpupri.c | 4 +++-
kernel/sched_rt.c | 4 ++++
2 files changed, 7 insertions(+), 1 deletions(-)

diff --git a/kernel/sched_cpupri.c b/kernel/sched_cpupri.c
index 2722dc1..d4c0b46 100644
--- a/kernel/sched_cpupri.c
+++ b/kernel/sched_cpupri.c
@@ -181,8 +181,10 @@ int cpupri_init(struct cpupri *cp)
goto cleanup;
}

- for_each_possible_cpu(i)
+ for_each_possible_cpu(i) {
cp->cpu_to_pri[i] = CPUPRI_INVALID;
+ cpupri_set(cp, i, MAX_RT_PRIO);
+ }
return 0;

cleanup:
diff --git a/kernel/sched_rt.c b/kernel/sched_rt.c
index 88725c9..4dd6e45 100644
--- a/kernel/sched_rt.c
+++ b/kernel/sched_rt.c
@@ -1158,6 +1158,10 @@ static struct task_struct
*pick_next_task_rt(struct rq *rq)
* lock again later if there is no need to push
*/
rq->post_schedule = has_pushable_tasks(rq);
+
+ /* this CPU is no longer RT if no task picked to feed it */
+ if (! p)
+ cpupri_set(&rq->rd->cpupri, rq->cpu, MAX_RT_PRIO);
#endif

return p;

\
 
 \ /
  Last update: 2011-06-03 16:13    [W:0.044 / U:0.424 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site