adulau/aha
1
0
Fork 0
mirror of https://github.com/adulau/aha.git synced 2024-12-28 03:36:19 +00:00
Code Issues Projects Releases Packages Wiki Activity

sched: remove leftover debugging

Browse source 
remove leftover debugging.

Signed-off-by: Ingo Molnar <mingo@elte.hu>
This commit is contained in:
Ingo Molnar 2008-01-25 21:08:16 +01:00
parent 6e1938d3ad
commit 00597c3ed7
1 changed files with 0 additions and 8 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

8
kernel/sched_rt.c
View file

@ -253,8 +253,6 @@ static struct task_struct *pick_next_highest_task_rt(struct rq *rq, int cpu)
struct list_head *queue;
int idx;
assert_spin_locked(&rq->lock);
if (likely(rq->rt.rt_nr_running < 2))
return NULL;
@ -500,8 +498,6 @@ static int push_rt_task(struct rq *rq)
int ret = 0;
int paranoid = RT_MAX_TRIES;
assert_spin_locked(&rq->lock);
if (!rq->rt.overloaded)
return 0;
@ -546,8 +542,6 @@ static int push_rt_task(struct rq *rq)
goto out;
}
assert_spin_locked(&lowest_rq->lock);
deactivate_task(rq, next_task, 0);
set_task_cpu(next_task, lowest_rq->cpu);
activate_task(lowest_rq, next_task, 0);
@ -589,8 +583,6 @@ static int pull_rt_task(struct rq *this_rq)
int cpu;
int ret = 0;
assert_spin_locked(&this_rq->lock);
/*
* If cpusets are used, and we have overlapping
* run queue cpusets, then this algorithm may not catch all.