82 rb_node_minimum(struct rb_node *node)  in rb_node_minimum()
90 rb_node_maximum(struct rb_node *node)  in rb_node_maximum()
162                             struct rb_node *node, bool insert_left,  in rb_augmented_tree_insert_at()
163                             void (*update)(struct rb_node *node))  in rb_augmented_tree_insert_at()
371 rb_node_next(struct rb_node *node)  in rb_node_next()
393 rb_node_prev(struct rb_node *node)  in rb_node_prev()
419 rb_node_min_intersecting(struct rb_node *node, void *interval,  in rb_node_min_intersecting()
420                          int (*cmp_interval)(const struct rb_node *node,  in rb_node_min_intersecting()
422                          bool (*cmp_max)(const struct rb_node *node,   in rb_node_min_intersecting()
500 rb_node_next_intersecting(struct rb_node *node,  in rb_node_next_intersecting()
502                           int (*cmp_interval)(const struct rb_node *node,  in rb_node_next_intersecting()
504                           bool (*cmp_max)(const struct rb_node *node,  in rb_node_next_intersecting()
570     const struct uinterval_node *node = rb_node_data(struct uinterval_node, _node, node);  in uinterval_search_cmp()  local
579     const struct uinterval_node *node = rb_node_data(struct uinterval_node, _node, node);  in uinterval_max_cmp()  local
588     struct uinterval_node *node = rb_node_data(struct uinterval_node, _node, node);  in uinterval_update_max()  local
601 uinterval_tree_insert(struct rb_tree *tree, struct uinterval_node *node)  in uinterval_tree_insert()
608 uinterval_tree_remove(struct rb_tree *tree, struct uinterval_node *node)  in uinterval_tree_remove()
619     struct rb_node *node =  in uinterval_tree_first()  local
627 uinterval_node_next(struct uinterval_node *node,  in uinterval_node_next()