389 		unsigned long *key, int level)  in find_level()  argument
394 	for (height = head->height; height > level; height--) {  in find_level()
449 			      unsigned long *key, void *val, int level,  in btree_insert_level()  argument
456 	if (head->height < level) {  in btree_insert_level()
463 	node = find_level(head, geo, key, level);  in btree_insert_level()
478 				new, level + 1, gfp);  in btree_insert_level()
519 		unsigned long *key, int level);
520 static void merge(struct btree_head *head, struct btree_geo *geo, int level,  in merge()  argument
536 	btree_remove_level(head, geo, bkey(geo, parent, lpos), level + 1);  in merge()
541 		unsigned long *key, int level, unsigned long *child, int fill)  in rebalance()  argument
551 		btree_remove_level(head, geo, key, level + 1);  in rebalance()
556 	parent = find_level(head, geo, key, level + 1);  in rebalance()
564 			merge(head, geo, level,  in rebalance()
575 			merge(head, geo, level,  in rebalance()
592 		unsigned long *key, int level)  in btree_remove_level()  argument
598 	if (level > head->height) {  in btree_remove_level()
605 	node = find_level(head, geo, key, level);  in btree_remove_level()
608 	if ((level == 1) && (keycmp(geo, node, pos, key) != 0))  in btree_remove_level()
620 		if (level < head->height)  in btree_remove_level()
621 			rebalance(head, geo, key, level, node, fill - 1);  in btree_remove_level()