Lines Matching refs:test_node
18 struct test_node { struct
28 static struct test_node *nodes = NULL; argument
32 static void insert(struct test_node *node, struct rb_root_cached *root) in insert()
39 if (key < rb_entry(parent, struct test_node, rb)->key) in insert()
49 static void insert_cached(struct test_node *node, struct rb_root_cached *root) in insert_cached()
57 if (key < rb_entry(parent, struct test_node, rb)->key) in insert_cached()
69 static inline void erase(struct test_node *node, struct rb_root_cached *root) in erase()
74 static inline void erase_cached(struct test_node *node, struct rb_root_cached *root) in erase_cached()
83 struct test_node, rb, u32, augmented, NODE_VAL) in RB_DECLARE_CALLBACKS_MAX() argument
85 static void insert_augmented(struct test_node *node, in RB_DECLARE_CALLBACKS_MAX()
91 struct test_node *parent; in RB_DECLARE_CALLBACKS_MAX()
95 parent = rb_entry(rb_parent, struct test_node, rb); in RB_DECLARE_CALLBACKS_MAX()
109 static void insert_augmented_cached(struct test_node *node, in insert_augmented_cached()
115 struct test_node *parent; in insert_augmented_cached()
120 parent = rb_entry(rb_parent, struct test_node, rb); in insert_augmented_cached()
138 static void erase_augmented(struct test_node *node, struct rb_root_cached *root) in erase_augmented()
143 static void erase_augmented_cached(struct test_node *node, in erase_augmented_cached()
173 struct test_node *cur, *n; in check_postorder_foreach()
198 struct test_node *node = rb_entry(rb, struct test_node, rb); in check()
224 struct test_node *node = rb_entry(rb, struct test_node, rb); in check_augmented()
227 subtree = rb_entry(node->rb.rb_left, struct test_node, in check_augmented()
233 subtree = rb_entry(node->rb.rb_right, struct test_node, in check_augmented()