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()
50 	struct rb_node **new = &root->rb_root.rb_node, *parent = NULL;  in insert_cached()
70 	rb_erase(&node->rb, &root->rb_root);  in erase()
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()
127 	struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL;  in insert_augmented_cached()
155 	rb_erase_augmented(&node->rb, &root->rb_root, &augment_callbacks);  in erase_augmented()
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()
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()