Home
last modified time | relevance | path

Searched refs:rb_leftmost (Results 1 – 4 of 4) sorted by relevance

/include/linux/
A Drbtree_types.h28 struct rb_node *rb_leftmost; member
A Drbtree.h106 #define rb_first_cached(root) (root)->rb_leftmost
113 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()
A Drbtree_augmented.h59 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()
A Dinterval_tree_generic.h140 leftmost = rb_entry(root->rb_leftmost, ITSTRUCT, ITRB); \

Completed in 7 milliseconds