Lines Matching refs:root
71 #define RB_EMPTY_ROOT(root) ((root)->rb_node == NULL) argument
75 #define rb_insert_color(node, root) do { \ argument
77 linux_root_RB_INSERT_COLOR((struct linux_root *)(root), \
80 #define rb_erase(node, root) \ argument
81 linux_root_RB_REMOVE((struct linux_root *)(root), (node))
84 #define rb_first(root) RB_MIN(linux_root, (struct linux_root *)(root)) argument
85 #define rb_last(root) RB_MAX(linux_root, (struct linux_root *)(root)) argument
86 #define rb_first_cached(root) (root)->rb_leftmost argument
133 struct rb_root *root) in rb_replace_node() argument
136 RB_SWAP_CHILD((struct linux_root *)root, rb_parent(victim), in rb_replace_node()
146 rb_insert_color_cached(struct rb_node *node, struct rb_root_cached *root, in rb_insert_color_cached() argument
150 linux_root_RB_INSERT_COLOR((struct linux_root *)&root->rb_root, in rb_insert_color_cached()
153 root->rb_leftmost = node; in rb_insert_color_cached()
157 rb_erase_cached(struct rb_node *node, struct rb_root_cached *root) in rb_erase_cached() argument
161 if (node == root->rb_leftmost) in rb_erase_cached()
162 retval = root->rb_leftmost = linux_root_RB_NEXT(node); in rb_erase_cached()
165 linux_root_RB_REMOVE((struct linux_root *)&root->rb_root, node); in rb_erase_cached()
171 struct rb_root_cached *root) in rb_replace_node_cached() argument
173 rb_replace_node(old, new, &root->rb_root); in rb_replace_node_cached()
174 if (root->rb_leftmost == old) in rb_replace_node_cached()
175 root->rb_leftmost = new; in rb_replace_node_cached()