linux-master/lib/rbtree_test.c

34 	struct rb_node **new = &root->rb_root.rb_node, *parent = NULL;
46 	rb_insert_color(&node->rb, &root->rb_root);
51 	struct rb_node **new = &root->rb_root.rb_node, *parent = NULL;
71 	rb_erase(&node->rb, &root->rb_root);
88 	struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL;
106 	rb_insert_augmented(&node->rb, &root->rb_root, &augment_callbacks);
112 	struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL;
140 	rb_erase_augmented(&node->rb, &root->rb_root, &augment_callbacks);
175 	rbtree_postorder_for_each_entry_safe(cur, n, &root.rb_root, rb)
185 	for (rb = rb_first_postorder(&root.rb_root); rb; rb = rb_next_postorder(rb))
197 	for (rb = rb_first(&root.rb_root); rb; rb = rb_next(rb)) {
212 	WARN_ON_ONCE(count < (1 << black_path_count(rb_last(&root.rb_root))) - 1);
223 	for (rb = rb_first(&root.rb_root); rb; rb = rb_next(rb)) {
295 		for (node = rb_first(&root.rb_root); node; node = rb_next(node))
309 		node = rb_first(&root.rb_root);