Lines Matching defs:tree
73 validate_tree_order(struct rb_tree *tree, unsigned expected_count)
78 rb_tree_foreach(struct rb_test_node, n, tree, node) {
99 rb_tree_foreach_safe(struct rb_test_node, n, tree, node) {
120 rb_tree_foreach_rev(struct rb_test_node, n, tree, node) {
141 rb_tree_foreach_rev_safe(struct rb_test_node, n, tree, node) {
161 validate_search(struct rb_tree *tree, int first_number,
169 n = rb_tree_search(tree, &test_numbers[i], rb_test_node_cmp_void);
173 n = rb_tree_search_sloppy(tree, &test_numbers[i],
180 n = rb_tree_search(tree, &missing_key, rb_test_node_cmp_void);
183 n = rb_tree_search_sloppy(tree, &missing_key, rb_test_node_cmp_void);
184 if (rb_tree_is_empty(tree)) {
211 struct rb_tree tree;
213 rb_tree_init(&tree);
217 rb_tree_insert(&tree, &nodes[i].node, rb_test_node_cmp);
218 rb_tree_validate(&tree);
219 validate_tree_order(&tree, i + 1);
220 validate_search(&tree, 0, i);
224 rb_tree_remove(&tree, &nodes[i].node);
225 rb_tree_validate(&tree);
226 validate_tree_order(&tree, ARRAY_SIZE(test_numbers) - i - 1);
227 validate_search(&tree, i + 1, ARRAY_SIZE(test_numbers) - 1);