16 typedef struct node_s node_t;  typedef
21 	rb_node(node_t) link;
26 node_cmp(const node_t *a, const node_t *b) {  in node_cmp()
44 typedef rb_tree(node_t) tree_t;
45 rb_gen(static, tree_, tree_t, node_t, link, node_cmp);
49 	node_t key;  in TEST_BEGIN()
72 tree_recurse(node_t *node, unsigned black_height, unsigned black_depth) {  in tree_recurse()
74 	node_t *left_node;  in tree_recurse()
75 	node_t *right_node;  in tree_recurse()
81 	left_node = rbtn_left_get(node_t, link, node);  in tree_recurse()
82 	right_node = rbtn_right_get(node_t, link, node);  in tree_recurse()
84 	if (!rbtn_red_get(node_t, link, node)) {  in tree_recurse()
89 	if (rbtn_red_get(node_t, link, node)) {  in tree_recurse()
91 			assert_false(rbtn_red_get(node_t, link, left_node),  in tree_recurse()
95 			assert_false(rbtn_red_get(node_t, link, right_node),  in tree_recurse()
120 static node_t *
121 tree_iterate_cb(tree_t *tree, node_t *node, void *data) {  in tree_iterate_cb()
123 	node_t *search_node;  in tree_iterate_cb()
168 node_remove(tree_t *tree, node_t *node, unsigned nnodes) {  in node_remove()
169 	node_t *search_node;  in node_remove()
190 	rbtn_black_height(node_t, link, tree, black_height);  in node_remove()
199 static node_t *
200 remove_iterate_cb(tree_t *tree, node_t *node, void *data) {  in remove_iterate_cb()
202 	node_t *ret = tree_next(tree, node);  in remove_iterate_cb()
209 static node_t *
210 remove_reverse_iterate_cb(tree_t *tree, node_t *node, void *data) {  in remove_reverse_iterate_cb()
212 	node_t *ret = tree_prev(tree, node);  in remove_reverse_iterate_cb()
220 destroy_cb(node_t *node, void *data) {  in destroy_cb()
234 	node_t nodes[NNODES];  in TEST_BEGIN()
270 				rbtn_black_height(node_t, link, &tree,  in TEST_BEGIN()
306 				node_t *start;  in TEST_BEGIN()
319 				node_t *start;  in TEST_BEGIN()