71 tree_recurse(node_t *node, unsigned black_height, unsigned black_depth,  in tree_recurse()  argument
96 		ret += tree_recurse(left_node, black_height, black_depth, nil);  in tree_recurse()
98 		ret += (black_depth != black_height);  in tree_recurse()
102 		ret += tree_recurse(right_node, black_height, black_depth, nil);  in tree_recurse()
104 		ret += (black_depth != black_height);  in tree_recurse()
163 	unsigned black_height, imbalances;  in node_remove()  local
183 	rbtn_black_height(node_t, link, tree, black_height);  in node_remove()
184 	imbalances = tree_recurse(tree->rbt_root, black_height, 0,  in node_remove()
224 	unsigned i, j, k, black_height, imbalances;  in TEST_BEGIN()  local
258 				    black_height);  in TEST_BEGIN()
260 				    black_height, 0, &(tree.rbt_nil));  in TEST_BEGIN()