Lines Matching refs:rb_root
34 struct rb_node **new = &root->rb_root.rb_node, *parent = NULL; in insert()
46 rb_insert_color(&node->rb, &root->rb_root); in insert()
51 struct rb_node **new = &root->rb_root.rb_node, *parent = NULL; in insert_cached()
71 rb_erase(&node->rb, &root->rb_root); in erase()
88 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; in RB_DECLARE_CALLBACKS_MAX()
106 rb_insert_augmented(&node->rb, &root->rb_root, &augment_callbacks); in RB_DECLARE_CALLBACKS_MAX()
112 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; in insert_augmented_cached()
140 rb_erase_augmented(&node->rb, &root->rb_root, &augment_callbacks); in erase_augmented()
175 rbtree_postorder_for_each_entry_safe(cur, n, &root.rb_root, rb) in check_postorder_foreach()
185 for (rb = rb_first_postorder(&root.rb_root); rb; rb = rb_next_postorder(rb)) in check_postorder()
197 for (rb = rb_first(&root.rb_root); rb; rb = rb_next(rb)) { in check()
212 WARN_ON_ONCE(count < (1 << black_path_count(rb_last(&root.rb_root))) - 1); in check()
223 for (rb = rb_first(&root.rb_root); rb; rb = rb_next(rb)) { in check_augmented()
295 for (node = rb_first(&root.rb_root); node; node = rb_next(node)) in rbtree_test_init()
309 node = rb_first(&root.rb_root); in rbtree_test_init()