24 static void insert(struct test_node *node, struct rb_root *root)  in insert()  argument
27 	u32 key = node->key;  in insert()
37 	rb_link_node(&node->rb, parent, new);  in insert()
38 	rb_insert_color(&node->rb, root);  in insert()
41 static inline void erase(struct test_node *node, struct rb_root *root)  in erase()  argument
43 	rb_erase(&node->rb, root);  in erase()
46 static inline u32 augment_recompute(struct test_node *node)  in augment_recompute()  argument
48 	u32 max = node->val, child_augmented;  in augment_recompute()
49 	if (node->rb.rb_left) {  in augment_recompute()
50 		child_augmented = rb_entry(node->rb.rb_left, struct test_node,  in augment_recompute()
55 	if (node->rb.rb_right) {  in augment_recompute()
56 		child_augmented = rb_entry(node->rb.rb_right, struct test_node,  in augment_recompute()
67 static void insert_augmented(struct test_node *node, struct rb_root *root)  in RB_DECLARE_CALLBACKS()
70 	u32 key = node->key;  in RB_DECLARE_CALLBACKS()
71 	u32 val = node->val;  in RB_DECLARE_CALLBACKS()
85 	node->augmented = val;  in RB_DECLARE_CALLBACKS()
86 	rb_link_node(&node->rb, rb_parent, new);  in RB_DECLARE_CALLBACKS()
87 	rb_insert_augmented(&node->rb, root, &augment_callbacks);  in RB_DECLARE_CALLBACKS()
90 static void erase_augmented(struct test_node *node, struct rb_root *root)  in erase_augmented()  argument
92 	rb_erase_augmented(&node->rb, root, &augment_callbacks);  in erase_augmented()
144 		struct test_node *node = rb_entry(rb, struct test_node, rb);  in check()  local
145 		WARN_ON_ONCE(node->key < prev_key);  in check()
153 		prev_key = node->key;  in check()
170 		struct test_node *node = rb_entry(rb, struct test_node, rb);  in check_augmented()  local
171 		WARN_ON_ONCE(node->augmented != augment_recompute(node));  in check_augmented()