179 	head->height = 0;  in __btree_init()
210 	int height = head->height;  in btree_last()  local
213 	if (height == 0)  in btree_last()
216 	for ( ; height > 1; height--)  in btree_last()
244 	int i, height = head->height;  in btree_lookup()  local
247 	if (height == 0)  in btree_lookup()
250 	for ( ; height > 1; height--) {  in btree_lookup()
274 	int i, height = head->height;  in btree_update()  local
277 	if (height == 0)  in btree_update()
280 	for ( ; height > 1; height--) {  in btree_update()
314 	int i, height;  in btree_get_prev()  local
321 	if (head->height == 0)  in btree_get_prev()
328 	for (height = head->height ; height > 1; height--) {  in btree_get_prev()
392 	int i, height;  in find_level()  local
394 	for (height = head->height; height > level; height--) {  in find_level()
428 	head->height++;  in btree_grow()
437 	if (head->height <= 1)  in btree_shrink()
444 	head->height--;  in btree_shrink()
456 	if (head->height < level) {  in btree_insert_level()
598 	if (level > head->height) {  in btree_remove_level()
600 		head->height = 0;  in btree_remove_level()
620 		if (level < head->height)  in btree_remove_level()
632 	if (head->height == 0)  in btree_remove()
652 		target->height = victim->height;  in btree_merge()
681 			       void *func2, int reap, int height, size_t count)  in __btree_for_each()  argument
690 		if (height > 1)  in __btree_for_each()
692 					func, func2, reap, height - 1, count);  in __btree_for_each()
759 				func2, 0, head->height, 0);  in btree_visitor()
777 				func2, 1, head->height, 0);  in btree_grim_visitor()