14 typedef struct node_s node_t;  typedef
19 	rb_node(node_t) link;
24 node_cmp(node_t *a, node_t *b) {  in node_cmp()
42 typedef rb_tree(node_t) tree_t;
43 rb_gen(static, tree_, tree_t, node_t, link, node_cmp);
48 	node_t key;  in TEST_BEGIN()
71 tree_recurse(node_t *node, unsigned black_height, unsigned black_depth,  in tree_recurse()
72     node_t *nil)  in tree_recurse()
75 	node_t *left_node = rbtn_left_get(node_t, link, node);  in tree_recurse()
76 	node_t *right_node = rbtn_right_get(node_t, link, node);  in tree_recurse()
78 	if (!rbtn_red_get(node_t, link, node))  in tree_recurse()
82 	if (rbtn_red_get(node_t, link, node)) {  in tree_recurse()
83 		assert_false(rbtn_red_get(node_t, link, left_node),  in tree_recurse()
85 		assert_false(rbtn_red_get(node_t, link, right_node),  in tree_recurse()
109 static node_t *
110 tree_iterate_cb(tree_t *tree, node_t *node, void *data)  in tree_iterate_cb()
113 	node_t *search_node;  in tree_iterate_cb()
160 node_remove(tree_t *tree, node_t *node, unsigned nnodes)  in node_remove()
162 	node_t *search_node;  in node_remove()
183 	rbtn_black_height(node_t, link, tree, black_height);  in node_remove()
193 static node_t *
194 remove_iterate_cb(tree_t *tree, node_t *node, void *data)  in remove_iterate_cb()
197 	node_t *ret = tree_next(tree, node);  in remove_iterate_cb()
204 static node_t *
205 remove_reverse_iterate_cb(tree_t *tree, node_t *node, void *data)  in remove_reverse_iterate_cb()
208 	node_t *ret = tree_prev(tree, node);  in remove_reverse_iterate_cb()
223 	node_t nodes[NNODES];  in TEST_BEGIN()
257 				rbtn_black_height(node_t, link, &tree,  in TEST_BEGIN()
291 				node_t *start;  in TEST_BEGIN()
304 				node_t *start;  in TEST_BEGIN()