Searched refs:deadline (Results 1 – 8 of 8) sorted by relevance
/kernel/sched/ |
D | deadline.c | 412 zerolag_time = dl_se->deadline - in task_non_contending() 618 rq->dl.earliest_dl.next = p->dl.deadline; in enqueue_pushable_dl_task() 632 dl_rq->earliest_dl.next = __node_2_pdl(leftmost)->dl.deadline; in dequeue_pushable_dl_task() 779 dl_se->deadline = rq_clock(rq) + pi_of(dl_se)->dl_deadline; in replenish_dl_new_period() 801 WARN_ON(dl_time_before(rq_clock(rq), dl_se->deadline)); in setup_new_dl_entity() 861 dl_se->deadline += pi_of(dl_se)->dl_period; in replenish_dl_entity() 874 if (dl_time_before(dl_se->deadline, rq_clock(rq))) { in replenish_dl_entity() 932 right = ((dl_se->deadline - t) >> DL_SCALE) * in dl_entity_overflow() 959 u64 laxity = dl_se->deadline - rq_clock(rq); in update_dl_revised_wakeup() 967 WARN_ON(dl_time_before(dl_se->deadline, rq_clock(rq))); in update_dl_revised_wakeup() [all …]
|
D | cpudeadline.c | 154 dl_time_before(dl_se->deadline, cp->elements[0].dl)) { in cpudl_find()
|
D | sched.h | 270 dl_time_before(a->deadline, b->deadline); in dl_entity_preempt()
|
D | debug.c | 1050 P(dl.deadline); in proc_sched_show_task()
|
D | core.c | 204 return !dl_time_before(a->dl.deadline, b->dl.deadline); in prio_less()
|
/kernel/locking/ |
D | ww_mutex.h | 251 if (dl_time_before(b->task->dl.deadline, in __ww_ctx_less() 252 a->task->dl.deadline)) in __ww_ctx_less() 255 if (dl_time_before(a->task->dl.deadline, in __ww_ctx_less() 256 b->task->dl.deadline)) in __ww_ctx_less()
|
D | rtmutex.c | 346 waiter->deadline = task->dl.deadline; in waiter_update_prio() 353 &(struct rt_mutex_waiter){ .prio = __waiter_prio(p), .deadline = (p)->dl.deadline } 368 return dl_time_before(left->deadline, right->deadline); in rt_mutex_waiter_less() 386 return left->deadline == right->deadline; in rt_mutex_waiter_equal()
|
D | rtmutex_common.h | 40 u64 deadline; member
|