Searched refs:next_task (Results 1 – 2 of 2) sorted by relevance
2130 struct task_struct *next_task; in push_dl_task() local2137 next_task = pick_next_pushable_dl_task(rq); in push_dl_task()2138 if (!next_task) in push_dl_task()2142 if (WARN_ON(next_task == rq->curr)) in push_dl_task()2151 dl_time_before(next_task->dl.deadline, rq->curr->dl.deadline) && in push_dl_task()2158 get_task_struct(next_task); in push_dl_task()2161 later_rq = find_lock_later_rq(next_task, rq); in push_dl_task()2171 if (task == next_task) { in push_dl_task()2183 put_task_struct(next_task); in push_dl_task()2184 next_task = task; in push_dl_task()[all …]
1974 struct task_struct *next_task; in push_rt_task() local1981 next_task = pick_next_pushable_task(rq); in push_rt_task()1982 if (!next_task) in push_rt_task()1986 if (WARN_ON(next_task == rq->curr)) in push_rt_task()1994 if (unlikely(next_task->prio < rq->curr->prio)) { in push_rt_task()2000 get_task_struct(next_task); in push_rt_task()2003 lowest_rq = find_lock_lowest_rq(next_task, rq); in push_rt_task()2015 if (task == next_task) { in push_rt_task()2032 put_task_struct(next_task); in push_rt_task()2033 next_task = task; in push_rt_task()[all …]