Home
last modified time | relevance | path

Searched refs:deadline (Results 1 – 9 of 9) sorted by relevance

/kernel/sched/
Ddeadline.c412 zerolag_time = dl_se->deadline - in task_non_contending()
611 rq->dl.earliest_dl.next = p->dl.deadline; in enqueue_pushable_dl_task()
625 dl_rq->earliest_dl.next = __node_2_pdl(leftmost)->dl.deadline; in dequeue_pushable_dl_task()
772 dl_se->deadline = rq_clock(rq) + pi_of(dl_se)->dl_deadline; in replenish_dl_new_period()
794 WARN_ON(dl_time_before(rq_clock(rq), dl_se->deadline)); in setup_new_dl_entity()
854 dl_se->deadline += pi_of(dl_se)->dl_period; in replenish_dl_entity()
867 if (dl_time_before(dl_se->deadline, rq_clock(rq))) { in replenish_dl_entity()
925 right = ((dl_se->deadline - t) >> DL_SCALE) * in dl_entity_overflow()
952 u64 laxity = dl_se->deadline - rq_clock(rq); in update_dl_revised_wakeup()
960 WARN_ON(dl_time_before(dl_se->deadline, rq_clock(rq))); in update_dl_revised_wakeup()
[all …]
Ddebug.c588 SPLIT_NS(p->se.deadline), in print_task()
654 left_deadline = first->deadline; in print_cfs_rq()
1097 P(dl.deadline); in proc_sched_show_task()
Dcpudeadline.c154 dl_time_before(dl_se->deadline, cp->elements[0].dl)) { in cpudl_find()
Dfair.c594 return (s64)(a->deadline - b->deadline) < 0; in entity_before()
943 if (sched_feat(RUN_TO_PARITY) && curr && curr->vlag == curr->deadline) in pick_eevdf()
1030 if ((s64)(se->vruntime - se->deadline) < 0) in update_deadline()
1043 se->deadline = se->vruntime + calc_delta_fair(se->slice, se); in update_deadline()
3742 vslice = (s64)(se->deadline - avruntime); in reweight_eevdf()
3744 se->deadline = avruntime + vslice; in reweight_eevdf()
5200 se->deadline = se->vruntime + vslice; in place_entity()
5367 se->vlag = se->deadline; in set_next_entity()
8573 se->deadline += calc_delta_fair(se->slice, se); in yield_task_fair()
Dsched.h271 dl_time_before(a->deadline, b->deadline); in dl_entity_preempt()
Dcore.c209 return !dl_time_before(a->dl.deadline, b->dl.deadline); in prio_less()
/kernel/locking/
Drtmutex.c348 waiter->tree.deadline = task->dl.deadline; in waiter_update_prio()
362 waiter->pi_tree.deadline = waiter->tree.deadline; in waiter_clone_prio()
369 &(struct rt_waiter_node){ .prio = __waiter_prio(p), .deadline = (p)->dl.deadline }
386 return dl_time_before(left->deadline, right->deadline); in rt_waiter_node_less()
404 return left->deadline == right->deadline; in rt_waiter_node_equal()
Dww_mutex.h251 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()
Drtmutex_common.h35 u64 deadline; member