next_task
struct cmdq_task *next_task;
next_task = list_first_entry_or_null(&thread->task_busy_list,
if (next_task)
writel(next_task->pa_base >> cmdq->pdata->shift,
bcom_set_task_auto_start(int task, int next_task)
out_be16(tcr, (in_be16(tcr) & ~0xff) | 0x00c0 | next_task);
for (p = &init_task ; (p = next_task(p)) != &init_task ; )
kit->task = next_task(kit->task);
goto next_task;
goto next_task;
next_task:
struct task_struct *next_task;
next_task = pick_next_pushable_dl_task(rq);
if (!next_task)
dl_time_before(next_task->dl.deadline, rq->donor->dl.deadline) &&
if (is_migration_disabled(next_task))
if (WARN_ON(next_task == rq->curr))
get_task_struct(next_task);
later_rq = find_lock_later_rq(next_task, rq);
if (task == next_task) {
put_task_struct(next_task);
next_task = task;
move_queued_task_locked(rq, later_rq, next_task);
put_task_struct(next_task);
struct task_struct *next_task;
next_task = pick_next_pushable_task(rq);
if (!next_task)
if (unlikely(next_task->prio < rq->donor->prio)) {
if (is_migration_disabled(next_task)) {
if (WARN_ON(next_task == rq->curr))
get_task_struct(next_task);
lowest_rq = find_lock_lowest_rq(next_task, rq);
if (task == next_task) {
put_task_struct(next_task);
next_task = task;
move_queued_task_locked(rq, lowest_rq, next_task);
put_task_struct(next_task);