10 struct test_node {  struct
20 static struct test_node nodes[NODES];  argument
24 static void insert(struct test_node *node, struct rb_root *root)  in insert()
31 		if (key < rb_entry(parent, struct test_node, rb)->key)  in insert()
41 static inline void erase(struct test_node *node, struct rb_root *root)  in erase()
46 static inline u32 augment_recompute(struct test_node *node)  in augment_recompute()
50 		child_augmented = rb_entry(node->rb.rb_left, struct test_node,  in augment_recompute()
56 		child_augmented = rb_entry(node->rb.rb_right, struct test_node,  in augment_recompute()
64 RB_DECLARE_CALLBACKS(static, augment_callbacks, struct test_node, rb,  in RB_DECLARE_CALLBACKS()  argument
67 static void insert_augmented(struct test_node *node, struct rb_root *root)  in RB_DECLARE_CALLBACKS()
72 	struct test_node *parent;  in RB_DECLARE_CALLBACKS()
76 		parent = rb_entry(rb_parent, struct test_node, rb);  in RB_DECLARE_CALLBACKS()
90 static void erase_augmented(struct test_node *node, struct rb_root *root)  in erase_augmented()
119 	struct test_node *cur, *n;  in check_postorder_foreach()
144 		struct test_node *node = rb_entry(rb, struct test_node, rb);  in check()
170 		struct test_node *node = rb_entry(rb, struct test_node, rb);  in check_augmented()