26 static struct rb_root_cached root = RB_ROOT_CACHED;  variable
31 static void insert(struct test_node *node, struct rb_root_cached *root)  in insert()  argument
33 	struct rb_node **new = &root->rb_root.rb_node, *parent = NULL;  in insert()
45 	rb_insert_color(&node->rb, &root->rb_root);  in insert()
48 static void insert_cached(struct test_node *node, struct rb_root_cached *root)  in insert_cached()  argument
50 	struct rb_node **new = &root->rb_root.rb_node, *parent = NULL;  in insert_cached()
65 	rb_insert_color_cached(&node->rb, root, leftmost);  in insert_cached()
68 static inline void erase(struct test_node *node, struct rb_root_cached *root)  in erase()  argument
70 	rb_erase(&node->rb, &root->rb_root);  in erase()
73 static inline void erase_cached(struct test_node *node, struct rb_root_cached *root)  in erase_cached()  argument
75 	rb_erase_cached(&node->rb, root);  in erase_cached()
101 			     struct rb_root_cached *root)  in RB_DECLARE_CALLBACKS()
103 	struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL;  in RB_DECLARE_CALLBACKS()
121 	rb_insert_augmented(&node->rb, &root->rb_root, &augment_callbacks);  in RB_DECLARE_CALLBACKS()
125 				    struct rb_root_cached *root)  in insert_augmented_cached()  argument
127 	struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL;  in insert_augmented_cached()
148 	rb_insert_augmented_cached(&node->rb, root,  in insert_augmented_cached()
153 static void erase_augmented(struct test_node *node, struct rb_root_cached *root)  in erase_augmented()  argument
155 	rb_erase_augmented(&node->rb, &root->rb_root, &augment_callbacks);  in erase_augmented()
159 				   struct rb_root_cached *root)  in erase_augmented_cached()  argument
161 	rb_erase_augmented_cached(&node->rb, root, &augment_callbacks);  in erase_augmented_cached()
190 	rbtree_postorder_for_each_entry_safe(cur, n, &root.rb_root, rb)  in check_postorder_foreach()
200 	for (rb = rb_first_postorder(&root.rb_root); rb; rb = rb_next_postorder(rb))  in check_postorder()
212 	for (rb = rb_first(&root.rb_root); rb; rb = rb_next(rb)) {  in check()
227 	WARN_ON_ONCE(count < (1 << black_path_count(rb_last(&root.rb_root))) - 1);  in check()
238 	for (rb = rb_first(&root.rb_root); rb; rb = rb_next(rb)) {  in check_augmented()
263 			insert(nodes + j, &root);  in rbtree_test_init()
265 			erase(nodes + j, &root);  in rbtree_test_init()
279 			insert_cached(nodes + j, &root);  in rbtree_test_init()
281 			erase_cached(nodes + j, &root);  in rbtree_test_init()
292 		insert(nodes + i, &root);  in rbtree_test_init()
297 		for (node = rb_first(&root.rb_root); node; node = rb_next(node))  in rbtree_test_init()
311 		node = rb_first(&root.rb_root);  in rbtree_test_init()
323 		node = rb_first_cached(&root);  in rbtree_test_init()
332 		erase(nodes + i, &root);  in rbtree_test_init()
339 			insert(nodes + j, &root);  in rbtree_test_init()
343 			erase(nodes + j, &root);  in rbtree_test_init()
356 			insert_augmented(nodes + j, &root);  in rbtree_test_init()
358 			erase_augmented(nodes + j, &root);  in rbtree_test_init()
371 			insert_augmented_cached(nodes + j, &root);  in rbtree_test_init()
373 			erase_augmented_cached(nodes + j, &root);  in rbtree_test_init()
386 			insert_augmented(nodes + j, &root);  in rbtree_test_init()
390 			erase_augmented(nodes + j, &root);  in rbtree_test_init()