Searched refs:rb_leftmost (Results 1 – 7 of 7) sorted by relevance
121 struct rb_node *rb_leftmost; member127 #define rb_first_cached(root) (root)->rb_leftmost134 root->rb_leftmost = node; in rb_insert_color_cached()141 if (root->rb_leftmost == node) in rb_erase_cached()142 root->rb_leftmost = rb_next(node); in rb_erase_cached()150 if (root->rb_leftmost == victim) in rb_replace_node_cached()151 root->rb_leftmost = new; in rb_replace_node_cached()
61 root->rb_leftmost = node; in rb_insert_augmented_cached()303 if (root->rb_leftmost == node) in rb_erase_augmented_cached()304 root->rb_leftmost = rb_next(node); in rb_erase_augmented_cached()
127 struct rb_node *rb_leftmost; member133 #define rb_first_cached(root) (root)->rb_leftmost140 root->rb_leftmost = node; in rb_insert_color_cached()147 if (root->rb_leftmost == node) in rb_erase_cached()148 root->rb_leftmost = rb_next(node); in rb_erase_cached()156 if (root->rb_leftmost == victim) in rb_replace_node_cached()157 root->rb_leftmost = new; in rb_replace_node_cached()
59 root->rb_leftmost = node; in rb_insert_augmented_cached()312 if (root->rb_leftmost == node) in rb_erase_augmented_cached()313 root->rb_leftmost = rb_next(node); in rb_erase_augmented_cached()
144 leftmost = rb_entry(root->rb_leftmost, ITSTRUCT, ITRB); \
73 return rb_entry(p->pi_waiters.rb_leftmost, in task_top_pi_waiter()
395 return dl_rq->root.rb_leftmost == &dl_se->rb_node; in is_leftmost()545 if (dl_rq->pushable_dl_tasks_root.rb_leftmost == &p->pushable_dl_tasks) { in dequeue_pushable_dl_task()1418 struct rb_node *leftmost = dl_rq->root.rb_leftmost; in dec_dl_deadline()1932 struct rb_node *next_node = rq->dl.pushable_dl_tasks_root.rb_leftmost; in pick_earliest_pushable_dl_task()2106 p = rb_entry(rq->dl.pushable_dl_tasks_root.rb_leftmost, in pick_next_pushable_dl_task()
