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