Home
last modified time | relevance | path

Searched refs:next_task (Results 1 - 2 of 2) sorted by relevance

/device/soc/rockchip/common/sdk_linux/kernel/sched/
H A Drt.c2129 struct task_struct *next_task = pick_next_pushable_task(rq); in find_lock_lowest_rq() local
2130 if (unlikely(next_task != task || !cpumask_test_cpu(lowest_rq->cpu, task->cpus_ptr))) { in find_lock_lowest_rq()
2157 struct task_struct *next_task; in push_rt_task() local
2165 next_task = pick_next_pushable_task(rq); in push_rt_task()
2166 if (!next_task) { in push_rt_task()
2171 if (WARN_ON(next_task == rq->curr)) { in push_rt_task()
2176 * It's possible that the next_task slipped in of in push_rt_task()
2180 if (unlikely(next_task->prio < rq->curr->prio)) { in push_rt_task()
2186 get_task_struct(next_task); in push_rt_task()
2189 lowest_rq = find_lock_lowest_rq(next_task, r in push_rt_task()
2741 struct task_struct *next_task = busiest_rq->rt_push_task; rt_active_load_balance_cpu_stop() local
[all...]
/device/soc/rockchip/common/sdk_linux/include/linux/sched/
H A Dsignal.h604 #define next_task(p) list_entry_rcu((p)->tasks.next, struct task_struct, tasks) macro
606 #define for_each_process(p) for ((p) = &init_task; ((p) = next_task(p)) != &init_task;)
615 for ((g) = (t) = &init_task; ((g) = (t) = next_task(g)) != &init_task;) \

Completed in 6 milliseconds