Searched refs:leftmost (Results 1 – 3 of 3) sorted by relevance
106 struct rb_node *leftmost = rb_first_cached(&lock->waiters); in rt_mutex_waiter_is_top_waiter() local108 return rb_entry(leftmost, struct rt_mutex_waiter, tree_entry) == waiter; in rt_mutex_waiter_is_top_waiter()113 struct rb_node *leftmost = rb_first_cached(&lock->waiters); in rt_mutex_top_waiter() local116 if (leftmost) { in rt_mutex_top_waiter()117 w = rb_entry(leftmost, struct rt_mutex_waiter, tree_entry); in rt_mutex_top_waiter()
536 struct rb_node *leftmost; in enqueue_pushable_dl_task() local540 leftmost = rb_add_cached(&p->pushable_dl_tasks, in enqueue_pushable_dl_task()543 if (leftmost) in enqueue_pushable_dl_task()551 struct rb_node *leftmost; in dequeue_pushable_dl_task() local556 leftmost = rb_erase_cached(&p->pushable_dl_tasks, root); in dequeue_pushable_dl_task()557 if (leftmost) in dequeue_pushable_dl_task()558 dl_rq->earliest_dl.next = __node_2_pdl(leftmost)->dl.deadline; in dequeue_pushable_dl_task()1425 struct rb_node *leftmost = dl_rq->root.rb_leftmost; in dec_dl_deadline() local1428 entry = rb_entry(leftmost, struct sched_dl_entity, rb_node); in dec_dl_deadline()
547 struct rb_node *leftmost = rb_first_cached(&cfs_rq->tasks_timeline); in update_min_vruntime() local558 if (leftmost) { /* non-empty tree */ in update_min_vruntime()559 struct sched_entity *se = __node_2_se(leftmost); in update_min_vruntime()