Lines Matching refs:root

27 static struct rb_root_cached root = RB_ROOT_CACHED;
32 static void insert(struct test_node *node, struct rb_root_cached *root)
34 struct rb_node **new = &root->rb_root.rb_node, *parent = NULL;
46 rb_insert_color(&node->rb, &root->rb_root);
49 static void insert_cached(struct test_node *node, struct rb_root_cached *root)
51 struct rb_node **new = &root->rb_root.rb_node, *parent = NULL;
66 rb_insert_color_cached(&node->rb, root, leftmost);
69 static inline void erase(struct test_node *node, struct rb_root_cached *root)
71 rb_erase(&node->rb, &root->rb_root);
74 static inline void erase_cached(struct test_node *node, struct rb_root_cached *root)
76 rb_erase_cached(&node->rb, root);
86 struct rb_root_cached *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);
110 struct rb_root_cached *root)
112 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL;
133 rb_insert_augmented_cached(&node->rb, root,
138 static void erase_augmented(struct test_node *node, struct rb_root_cached *root)
140 rb_erase_augmented(&node->rb, &root->rb_root, &augment_callbacks);
144 struct rb_root_cached *root)
146 rb_erase_augmented_cached(&node->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)) {
261 insert(nodes + j, &root);
263 erase(nodes + j, &root);
277 insert_cached(nodes + j, &root);
279 erase_cached(nodes + j, &root);
290 insert(nodes + i, &root);
295 for (node = rb_first(&root.rb_root); node; node = rb_next(node))
309 node = rb_first(&root.rb_root);
321 node = rb_first_cached(&root);
330 erase(nodes + i, &root);
337 insert(nodes + j, &root);
341 erase(nodes + j, &root);
354 insert_augmented(nodes + j, &root);
356 erase_augmented(nodes + j, &root);
369 insert_augmented_cached(nodes + j, &root);
371 erase_augmented_cached(nodes + j, &root);
384 insert_augmented(nodes + j, &root);
388 erase_augmented(nodes + j, &root);