Lines Matching refs:node
32 static void insert(struct test_node *node, struct rb_root_cached *root)
35 u32 key = node->key;
45 rb_link_node(&node->rb, parent, new);
46 rb_insert_color(&node->rb, &root->rb_root);
49 static void insert_cached(struct test_node *node, struct rb_root_cached *root)
52 u32 key = node->key;
65 rb_link_node(&node->rb, parent, new);
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);
80 #define NODE_VAL(node) ((node)->val)
85 static void insert_augmented(struct test_node *node,
89 u32 key = node->key;
90 u32 val = node->val;
104 node->augmented = val;
105 rb_link_node(&node->rb, rb_parent, new);
106 rb_insert_augmented(&node->rb, &root->rb_root, &augment_callbacks);
109 static void insert_augmented_cached(struct test_node *node,
113 u32 key = node->key;
114 u32 val = node->val;
131 node->augmented = val;
132 rb_link_node(&node->rb, rb_parent, new);
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);
143 static void erase_augmented_cached(struct test_node *node,
146 rb_erase_augmented_cached(&node->rb, root, &augment_callbacks);
198 struct test_node *node = rb_entry(rb, struct test_node, rb);
199 WARN_ON_ONCE(node->key < prev_key);
207 prev_key = node->key;
224 struct test_node *node = rb_entry(rb, struct test_node, rb);
225 u32 subtree, max = node->val;
226 if (node->rb.rb_left) {
227 subtree = rb_entry(node->rb.rb_left, struct test_node,
232 if (node->rb.rb_right) {
233 subtree = rb_entry(node->rb.rb_right, struct test_node,
238 WARN_ON_ONCE(node->augmented != max);
246 struct rb_node *node;
295 for (node = rb_first(&root.rb_root); node; node = rb_next(node))
309 node = rb_first(&root.rb_root);
315 printk(" -> test 4 (latency to fetch first node)\n");
321 node = rb_first_cached(&root);