Searched refs:earliest_dl (Results 1 – 2 of 2) sorted by relevance
513 dl_rq->earliest_dl.curr = dl_rq->earliest_dl.next = 0; in init_dl_rq()614 rq->dl.earliest_dl.next = p->dl.deadline; in enqueue_pushable_dl_task()628 dl_rq->earliest_dl.next = __node_2_pdl(leftmost)->dl.deadline; in dequeue_pushable_dl_task()1452 if (dl_rq->earliest_dl.curr == 0 || in inc_dl_deadline()1453 dl_time_before(deadline, dl_rq->earliest_dl.curr)) { in inc_dl_deadline()1454 if (dl_rq->earliest_dl.curr == 0) in inc_dl_deadline()1456 dl_rq->earliest_dl.curr = deadline; in inc_dl_deadline()1470 dl_rq->earliest_dl.curr = 0; in dec_dl_deadline()1471 dl_rq->earliest_dl.next = 0; in dec_dl_deadline()1478 dl_rq->earliest_dl.curr = entry->deadline; in dec_dl_deadline()[all …]
722 } earliest_dl; member