Lines Matching refs:earliest_dl
557 dl_rq->earliest_dl.curr = dl_rq->earliest_dl.next = 0; in init_dl_rq()
629 rq->dl.earliest_dl.next = p->dl.deadline; in enqueue_pushable_dl_task()
648 dl_rq->earliest_dl.next = __node_2_pdl(leftmost)->dl.deadline; in dequeue_pushable_dl_task()
1853 if (dl_rq->earliest_dl.curr == 0 || in inc_dl_deadline()
1854 dl_time_before(deadline, dl_rq->earliest_dl.curr)) { in inc_dl_deadline()
1855 if (dl_rq->earliest_dl.curr == 0) in inc_dl_deadline()
1857 dl_rq->earliest_dl.curr = deadline; in inc_dl_deadline()
1871 dl_rq->earliest_dl.curr = 0; in dec_dl_deadline()
1872 dl_rq->earliest_dl.next = 0; in dec_dl_deadline()
1879 dl_rq->earliest_dl.curr = entry->deadline; in dec_dl_deadline()
2224 rq->dl.earliest_dl.curr)); in dl_task_is_earliest_deadline()
2809 dl_time_before(this_rq->dl.earliest_dl.curr, in pull_dl_task()
2810 src_rq->dl.earliest_dl.next)) in pull_dl_task()
2928 cpudl_set(&rq->rd->cpudl, rq->cpu, rq->dl.earliest_dl.curr); in rq_online_dl()
3111 if (dl_time_before(rq->dl.earliest_dl.curr, p->dl.deadline)) in prio_changed_dl()