19 static struct rb_root root = RB_ROOT;  variable
24 static void insert(struct test_node *node, struct rb_root *root)  in insert()  argument
26 	struct rb_node **new = &root->rb_node, *parent = NULL;  in insert()
38 	rb_insert_color(&node->rb, root);  in insert()
41 static inline void erase(struct test_node *node, struct rb_root *root)  in erase()  argument
43 	rb_erase(&node->rb, root);  in erase()
67 static void insert_augmented(struct test_node *node, struct rb_root *root)  in RB_DECLARE_CALLBACKS()
69 	struct rb_node **new = &root->rb_node, *rb_parent = NULL;  in RB_DECLARE_CALLBACKS()
87 	rb_insert_augmented(&node->rb, root, &augment_callbacks);  in RB_DECLARE_CALLBACKS()
90 static void erase_augmented(struct test_node *node, struct rb_root *root)  in erase_augmented()  argument
92 	rb_erase_augmented(&node->rb, root, &augment_callbacks);  in erase_augmented()
123 	for (rb = rb_first(&root); rb; rb = rb_next(rb)) {  in check()
138 	WARN_ON_ONCE(count < (1 << black_path_count(rb_last(&root))) - 1);  in check()
146 	for (rb = rb_first(&root); rb; rb = rb_next(rb)) {  in check_augmented()
166 			insert(nodes + j, &root);  in rbtree_test_init()
168 			erase(nodes + j, &root);  in rbtree_test_init()
181 			insert(nodes + j, &root);  in rbtree_test_init()
185 			erase(nodes + j, &root);  in rbtree_test_init()
198 			insert_augmented(nodes + j, &root);  in rbtree_test_init()
200 			erase_augmented(nodes + j, &root);  in rbtree_test_init()
213 			insert_augmented(nodes + j, &root);  in rbtree_test_init()
217 			erase_augmented(nodes + j, &root);  in rbtree_test_init()