178 	head->height = 0;  in __btree_init()
209 	int height = head->height;  in btree_last()  local
212 	if (height == 0)  in btree_last()
215 	for ( ; height > 1; height--)  in btree_last()
243 	int i, height = head->height;  in btree_lookup_node()  local
246 	if (height == 0)  in btree_lookup_node()
249 	for ( ; height > 1; height--) {  in btree_lookup_node()
309 	int i, height;  in btree_get_prev()  local
316 	if (head->height == 0)  in btree_get_prev()
323 	for (height = head->height ; height > 1; height--) {  in btree_get_prev()
387 	int i, height;  in find_level()  local
389 	for (height = head->height; height > level; height--) {  in find_level()
423 	head->height++;  in btree_grow()
432 	if (head->height <= 1)  in btree_shrink()
439 	head->height--;  in btree_shrink()
451 	if (head->height < level) {  in btree_insert_level()
593 	if (level > head->height) {  in btree_remove_level()
595 		head->height = 0;  in btree_remove_level()
615 		if (level < head->height)  in btree_remove_level()
627 	if (head->height == 0)  in btree_remove()
647 		target->height = victim->height;  in btree_merge()
676 			       void *func2, int reap, int height, size_t count)  in __btree_for_each()  argument
685 		if (height > 1)  in __btree_for_each()
687 					func, func2, reap, height - 1, count);  in __btree_for_each()
754 				func2, 0, head->height, 0);  in btree_visitor()
772 				func2, 1, head->height, 0);  in btree_grim_visitor()