Searched refs:rb_leftmost (Results 1 – 11 of 11) 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()
144 leftmost = rb_entry(root->rb_leftmost, ITSTRUCT, ITRB); \
106 #define rb_first_cached(root) (root)->rb_leftmost113 root->rb_leftmost = node; in rb_insert_color_cached()123 if (root->rb_leftmost == node) in rb_erase_cached()124 leftmost = root->rb_leftmost = rb_next(node); in rb_erase_cached()135 if (root->rb_leftmost == victim) in rb_replace_node_cached()136 root->rb_leftmost = new; in rb_replace_node_cached()
59 root->rb_leftmost = node; in rb_insert_augmented_cached()338 if (root->rb_leftmost == node) in rb_erase_augmented_cached()339 root->rb_leftmost = rb_next(node); in rb_erase_augmented_cached()
28 struct rb_node *rb_leftmost; member
31 RBNode *rb_leftmost; member
34 g_assert(root.rb_leftmost == NULL); in test_empty()57 g_assert(root.rb_leftmost == NULL); in test_find_one_point()
343 root->rb_leftmost = node; in rb_insert_augmented_cached()636 if (root->rb_leftmost == node) { in rb_erase_augmented_cached()637 root->rb_leftmost = rb_next(node); in rb_erase_augmented_cached()822 leftmost = rb_to_itree(root->rb_leftmost); in interval_tree_iter_first()
151 return rb_entry(p->pi_waiters.rb_leftmost, struct rt_mutex_waiter, in task_top_pi_waiter()