Searched refs:earliest_dl (Results 1 – 2 of 2) sorted by relevance
362 dl_rq->earliest_dl.curr = dl_rq->earliest_dl.next = 0; in init_dl_rq()468 dl_rq->earliest_dl.next = p->dl.deadline; in enqueue_pushable_dl_task()487 dl_rq->earliest_dl.next = rb_entry(next_node, in dequeue_pushable_dl_task()1338 if (dl_rq->earliest_dl.curr == 0 || in inc_dl_deadline()1339 dl_time_before(deadline, dl_rq->earliest_dl.curr)) { in inc_dl_deadline()1340 dl_rq->earliest_dl.curr = deadline; in inc_dl_deadline()1354 dl_rq->earliest_dl.curr = 0; in dec_dl_deadline()1355 dl_rq->earliest_dl.next = 0; in dec_dl_deadline()1362 dl_rq->earliest_dl.curr = entry->deadline; in dec_dl_deadline()1632 cpu_rq(target)->dl.earliest_dl.curr) || in select_task_rq_dl()[all …]
650 } earliest_dl; member