Searched refs:earliest_dl (Results 1 – 2 of 2) sorted by relevance
441 dl_rq->earliest_dl.curr = dl_rq->earliest_dl.next = 0; in init_dl_rq()542 rq->dl.earliest_dl.next = p->dl.deadline; in enqueue_pushable_dl_task()1402 if (dl_rq->earliest_dl.curr == 0 || in inc_dl_deadline()1404 if (dl_rq->earliest_dl.curr == 0) in inc_dl_deadline()1406 dl_rq->earliest_dl.curr = deadline; in inc_dl_deadline()1420 dl_rq->earliest_dl.curr = 0; in dec_dl_deadline()1421 dl_rq->earliest_dl.next = 0; in dec_dl_deadline()2163 later_rq->dl.earliest_dl.curr)) { in find_lock_later_rq()2193 later_rq->dl.earliest_dl.curr)) in find_lock_later_rq()2349 src_rq->dl.earliest_dl.next)) in pull_dl_task()[all …]
698 } earliest_dl; member
Completed in 16 milliseconds