Lines Matching refs:root
28 static struct rb_root_cached root = RB_ROOT_CACHED; variable
33 static void insert(struct test_node *node, struct rb_root_cached *root) in insert() argument
35 struct rb_node **new = &root->rb_root.rb_node, *parent = NULL; in insert()
47 rb_insert_color(&node->rb, &root->rb_root); in insert()
50 static void insert_cached(struct test_node *node, struct rb_root_cached *root) in insert_cached() argument
52 struct rb_node **new = &root->rb_root.rb_node, *parent = NULL; in insert_cached()
67 rb_insert_color_cached(&node->rb, root, leftmost); in insert_cached()
70 static inline void erase(struct test_node *node, struct rb_root_cached *root) in erase() argument
72 rb_erase(&node->rb, &root->rb_root); in erase()
75 static inline void erase_cached(struct test_node *node, struct rb_root_cached *root) in erase_cached() argument
77 rb_erase_cached(&node->rb, root); in erase_cached()
87 struct rb_root_cached *root) in RB_DECLARE_CALLBACKS_MAX()
89 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; in RB_DECLARE_CALLBACKS_MAX()
107 rb_insert_augmented(&node->rb, &root->rb_root, &augment_callbacks); in RB_DECLARE_CALLBACKS_MAX()
111 struct rb_root_cached *root) in insert_augmented_cached() argument
113 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; in insert_augmented_cached()
134 rb_insert_augmented_cached(&node->rb, root, in insert_augmented_cached()
139 static void erase_augmented(struct test_node *node, struct rb_root_cached *root) in erase_augmented() argument
141 rb_erase_augmented(&node->rb, &root->rb_root, &augment_callbacks); in erase_augmented()
145 struct rb_root_cached *root) in erase_augmented_cached() argument
147 rb_erase_augmented_cached(&node->rb, root, &augment_callbacks); in erase_augmented_cached()
176 rbtree_postorder_for_each_entry_safe(cur, n, &root.rb_root, rb) in check_postorder_foreach()
186 for (rb = rb_first_postorder(&root.rb_root); rb; rb = rb_next_postorder(rb)) in check_postorder()
198 for (rb = rb_first(&root.rb_root); rb; rb = rb_next(rb)) { in check()
213 WARN_ON_ONCE(count < (1 << black_path_count(rb_last(&root.rb_root))) - 1); in check()
224 for (rb = rb_first(&root.rb_root); rb; rb = rb_next(rb)) { in check_augmented()
257 insert(nodes + j, &root); in basic_check()
259 erase(nodes + j, &root); in basic_check()
273 insert_cached(nodes + j, &root); in basic_check()
275 erase_cached(nodes + j, &root); in basic_check()
286 insert(nodes + i, &root); in basic_check()
291 for (node = rb_first(&root.rb_root); node; node = rb_next(node)) in basic_check()
305 node = rb_first(&root.rb_root); in basic_check()
317 node = rb_first_cached(&root); in basic_check()
326 erase(nodes + i, &root); in basic_check()
333 insert(nodes + j, &root); in basic_check()
337 erase(nodes + j, &root); in basic_check()
358 insert_augmented(nodes + j, &root); in augmented_check()
360 erase_augmented(nodes + j, &root); in augmented_check()
373 insert_augmented_cached(nodes + j, &root); in augmented_check()
375 erase_augmented_cached(nodes + j, &root); in augmented_check()
388 insert_augmented(nodes + j, &root); in augmented_check()
392 erase_augmented(nodes + j, &root); in augmented_check()