17 struct test_node {  struct
27 static struct test_node *nodes = NULL;  argument
31 static void insert(struct test_node *node, struct rb_root_cached *root)  in insert()
38 		if (key < rb_entry(parent, struct test_node, rb)->key)  in insert()
48 static void insert_cached(struct test_node *node, struct rb_root_cached *root)  in insert_cached()
56 		if (key < rb_entry(parent, struct test_node, rb)->key)  in insert_cached()
68 static inline void erase(struct test_node *node, struct rb_root_cached *root)  in erase()
73 static inline void erase_cached(struct test_node *node, struct rb_root_cached *root)  in erase_cached()
79 static inline u32 augment_recompute(struct test_node *node)  in augment_recompute()
83 		child_augmented = rb_entry(node->rb.rb_left, struct test_node,  in augment_recompute()
89 		child_augmented = rb_entry(node->rb.rb_right, struct test_node,  in augment_recompute()
97 RB_DECLARE_CALLBACKS(static, augment_callbacks, struct test_node, rb,  in RB_DECLARE_CALLBACKS()  argument
100 static void insert_augmented(struct test_node *node,  in RB_DECLARE_CALLBACKS()
106 	struct test_node *parent;  in RB_DECLARE_CALLBACKS()
110 		parent = rb_entry(rb_parent, struct test_node, rb);  in RB_DECLARE_CALLBACKS()
124 static void insert_augmented_cached(struct test_node *node,  in insert_augmented_cached()
130 	struct test_node *parent;  in insert_augmented_cached()
135 		parent = rb_entry(rb_parent, struct test_node, rb);  in insert_augmented_cached()
153 static void erase_augmented(struct test_node *node, struct rb_root_cached *root)  in erase_augmented()
158 static void erase_augmented_cached(struct test_node *node,  in erase_augmented_cached()
188 	struct test_node *cur, *n;  in check_postorder_foreach()
213 		struct test_node *node = rb_entry(rb, struct test_node, rb);  in check()
239 		struct test_node *node = rb_entry(rb, struct test_node, rb);  in check_augmented()