427 static int nilfs_btree_height(const struct nilfs_bmap *btree)  in nilfs_btree_height()  function
439 	if (level == nilfs_btree_height(btree) - 1) {  in nilfs_btree_get_node()
662 	int maxlevel = nilfs_btree_height(btree) - 1;  in nilfs_btree_get_next_key()
734 	maxlevel = nilfs_btree_height(btree) - 1;  in nilfs_btree_lookup_contig()
791 	if (level < nilfs_btree_height(btree) - 1) {  in nilfs_btree_promote_key()
799 			 (++level < nilfs_btree_height(btree) - 1));  in nilfs_btree_promote_key()
803 	if (level == nilfs_btree_height(btree) - 1) {  in nilfs_btree_promote_key()
816 	if (level < nilfs_btree_height(btree) - 1) {  in nilfs_btree_do_insert()
1028 	if (level <= nilfs_btree_height(btree) - 1) {  in nilfs_btree_find_near()
1085 	     level < nilfs_btree_height(btree) - 1;  in nilfs_btree_prepare_insert()
1266 	if (level < nilfs_btree_height(btree) - 1) {  in nilfs_btree_do_delete()
1447 	     level < nilfs_btree_height(btree) - 1;  in nilfs_btree_prepare_delete()
1517 			WARN_ON(level != nilfs_btree_height(btree) - 2);  in nilfs_btree_prepare_delete()
1657 	switch (nilfs_btree_height(btree)) {  in nilfs_btree_check_delete()
1698 	switch (nilfs_btree_height(btree)) {  in nilfs_btree_gather_data()
1903 	while ((++level < nilfs_btree_height(btree) - 1) &&  in nilfs_btree_propagate_p()
1994 	while ((++level < nilfs_btree_height(btree) - 1) &&  in nilfs_btree_prepare_propagate_v()