Searched refs:leftmost (Results 1 – 4 of 4) sorted by relevance
/kernel/locking/ |
D | rtmutex_common.h | 55 struct rb_node *leftmost = rb_first_cached(&lock->waiters); in rt_mutex_top_waiter() local 58 if (leftmost) { in rt_mutex_top_waiter() 59 w = rb_entry(leftmost, struct rt_mutex_waiter, tree_entry); in rt_mutex_top_waiter()
|
D | rtmutex.c | 278 bool leftmost = true; in rt_mutex_enqueue() local 287 leftmost = false; in rt_mutex_enqueue() 292 rb_insert_color_cached(&waiter->tree_entry, &lock->waiters, leftmost); in rt_mutex_enqueue() 311 bool leftmost = true; in rt_mutex_enqueue_pi() local 320 leftmost = false; in rt_mutex_enqueue_pi() 325 rb_insert_color_cached(&waiter->pi_tree_entry, &task->pi_waiters, leftmost); in rt_mutex_enqueue_pi()
|
/kernel/sched/ |
D | deadline.c | 451 bool leftmost = true; in enqueue_pushable_dl_task() local 463 leftmost = false; in enqueue_pushable_dl_task() 467 if (leftmost) in enqueue_pushable_dl_task() 472 &dl_rq->pushable_dl_tasks_root, leftmost); in enqueue_pushable_dl_task() 1358 struct rb_node *leftmost = dl_rq->root.rb_leftmost; in dec_dl_deadline() local 1361 entry = rb_entry(leftmost, struct sched_dl_entity, rb_node); in dec_dl_deadline() 1408 int leftmost = 1; in __enqueue_dl_entity() local 1419 leftmost = 0; in __enqueue_dl_entity() 1424 rb_insert_color_cached(&dl_se->rb_node, &dl_rq->root, leftmost); in __enqueue_dl_entity()
|
D | fair.c | 533 struct rb_node *leftmost = rb_first_cached(&cfs_rq->tasks_timeline); in update_min_vruntime() local 544 if (leftmost) { /* non-empty tree */ in update_min_vruntime() 546 se = rb_entry(leftmost, struct sched_entity, run_node); in update_min_vruntime() 570 bool leftmost = true; in __enqueue_entity() local 586 leftmost = false; in __enqueue_entity() 592 &cfs_rq->tasks_timeline, leftmost); in __enqueue_entity()
|