19 struct test_node {  struct
29 static struct test_node *nodes = NULL;  argument
33 static void insert(struct test_node *node, struct rb_root_cached *root)  in insert()
40 		if (key < rb_entry(parent, struct test_node, rb)->key)  in insert()
50 static void insert_cached(struct test_node *node, struct rb_root_cached *root)  in insert_cached()
58 		if (key < rb_entry(parent, struct test_node, rb)->key)  in insert_cached()
70 static inline void erase(struct test_node *node, struct rb_root_cached *root)  in erase()
75 static inline void erase_cached(struct test_node *node, struct rb_root_cached *root)  in erase_cached()
84 			 struct test_node, rb, u32, augmented, NODE_VAL)  in RB_DECLARE_CALLBACKS_MAX()  argument
86 static void insert_augmented(struct test_node *node,  in RB_DECLARE_CALLBACKS_MAX()
92 	struct test_node *parent;  in RB_DECLARE_CALLBACKS_MAX()
96 		parent = rb_entry(rb_parent, struct test_node, rb);  in RB_DECLARE_CALLBACKS_MAX()
110 static void insert_augmented_cached(struct test_node *node,  in insert_augmented_cached()
116 	struct test_node *parent;  in insert_augmented_cached()
121 		parent = rb_entry(rb_parent, struct test_node, rb);  in insert_augmented_cached()
139 static void erase_augmented(struct test_node *node, struct rb_root_cached *root)  in erase_augmented()
144 static void erase_augmented_cached(struct test_node *node,  in erase_augmented_cached()
174 	struct test_node *cur, *n;  in check_postorder_foreach()
199 		struct test_node *node = rb_entry(rb, struct test_node, rb);  in check()
225 		struct test_node *node = rb_entry(rb, struct test_node, rb);  in check_augmented()
228 			subtree = rb_entry(node->rb.rb_left, struct test_node,  in check_augmented()
234 			subtree = rb_entry(node->rb.rb_right, struct test_node,  in check_augmented()