Searched refs:next_task (Results 1 – 2 of 2) sorted by relevance
1446 struct task_struct *next_task; in push_dl_task() local1452 next_task = pick_next_pushable_dl_task(rq); in push_dl_task()1453 if (!next_task) in push_dl_task()1457 if (unlikely(next_task == rq->curr)) { in push_dl_task()1468 dl_time_before(next_task->dl.deadline, rq->curr->dl.deadline) && in push_dl_task()1475 get_task_struct(next_task); in push_dl_task()1478 later_rq = find_lock_later_rq(next_task, rq); in push_dl_task()1488 if (task_cpu(next_task) == rq->cpu && task == next_task) { in push_dl_task()1493 dequeue_pushable_dl_task(rq, next_task); in push_dl_task()1501 put_task_struct(next_task); in push_dl_task()[all …]
1777 struct task_struct *next_task; in push_rt_task() local1784 next_task = pick_next_pushable_task(rq); in push_rt_task()1785 if (!next_task) in push_rt_task()1789 if (unlikely(next_task == rq->curr)) { in push_rt_task()1799 if (unlikely(next_task->prio < rq->curr->prio)) { in push_rt_task()1805 get_task_struct(next_task); in push_rt_task()1808 lowest_rq = find_lock_lowest_rq(next_task, rq); in push_rt_task()1820 if (task_cpu(next_task) == rq->cpu && task == next_task) { in push_rt_task()1837 put_task_struct(next_task); in push_rt_task()1838 next_task = task; in push_rt_task()[all …]