dl_time_before
return dl_time_before(left->deadline, right->deadline);
if (dl_time_before(b->task->dl.deadline,
if (dl_time_before(a->task->dl.deadline,
return !dl_time_before(a_dl->deadline, b_dl->deadline);
dl_time_before(dl_se->deadline, cp->elements[0].dl)) {
if ((l < cp->size) && dl_time_before(orig_dl,
if ((r < cp->size) && dl_time_before(largest_dl,
if (dl_time_before(orig_dl, cp->elements[p].dl))
if (idx > 0 && dl_time_before(cp->elements[parent(idx)].dl,
if (dl_time_before(dl_se->deadline, rq_clock(rq)) ||
!dl_time_before(dl_se->deadline, rq_clock(rq)) &&
if (dl_time_before(rq_clock(dl_se->rq),
if (dl_time_before(dl_se->deadline, rq_clock(rq)) &&
dl_time_before(rq_clock(rq), dl_next_period(dl_se))) {
dl_time_before(deadline, dl_rq->earliest_dl.curr)) {
return dl_time_before(__node_2_dle(a)->deadline, __node_2_dle(b)->deadline);
dl_time_before(dl_se->deadline, rq_clock(rq_of_dl_se(dl_se)))) {
dl_time_before(p->dl.deadline,
dl_time_before(next_task->dl.deadline, rq->donor->dl.deadline) &&
dl_time_before(this_rq->dl.earliest_dl.curr,
if (p && dl_time_before(p->dl.deadline, dmin) &&
if (dl_time_before(p->dl.deadline,
if (dl_time_before(old_deadline, p->dl.deadline))
if (dl_time_before(rq->dl.earliest_dl.curr, p->dl.deadline))
dl_time_before(p->dl.deadline, rq->curr->dl.deadline))
WARN_ON(dl_time_before(rq_clock(rq), dl_se->deadline));
if (dl_time_before(dl_se->deadline, rq_clock(rq))) {
dl_time_before(rq_clock(dl_se->rq), dl_se->deadline - dl_se->runtime)) {
return dl_time_before(right, left);
WARN_ON(dl_time_before(dl_se->deadline, rq_clock(rq)));
dl_time_before(a->deadline, b->deadline);