428 static int nilfs_btree_height(const struct nilfs_bmap *btree)  in nilfs_btree_height()  function
440 	if (level == nilfs_btree_height(btree) - 1) {  in nilfs_btree_get_node()
663 	int maxlevel = nilfs_btree_height(btree) - 1;  in nilfs_btree_get_next_key()
735 	maxlevel = nilfs_btree_height(btree) - 1;  in nilfs_btree_lookup_contig()
796 	if (level < nilfs_btree_height(btree) - 1) {  in nilfs_btree_promote_key()
804 			 (++level < nilfs_btree_height(btree) - 1));  in nilfs_btree_promote_key()
808 	if (level == nilfs_btree_height(btree) - 1) {  in nilfs_btree_promote_key()
821 	if (level < nilfs_btree_height(btree) - 1) {  in nilfs_btree_do_insert()
1033 	if (level <= nilfs_btree_height(btree) - 1) {  in nilfs_btree_find_near()
1090 	     level < nilfs_btree_height(btree) - 1;  in nilfs_btree_prepare_insert()
1271 	if (level < nilfs_btree_height(btree) - 1) {  in nilfs_btree_do_delete()
1452 	     level < nilfs_btree_height(btree) - 1;  in nilfs_btree_prepare_delete()
1522 			WARN_ON(level != nilfs_btree_height(btree) - 2);  in nilfs_btree_prepare_delete()
1666 	switch (nilfs_btree_height(btree)) {  in nilfs_btree_check_delete()
1705 	switch (nilfs_btree_height(btree)) {  in nilfs_btree_gather_data()
1918 	while ((++level < nilfs_btree_height(btree) - 1) &&  in nilfs_btree_propagate_p()
2009 	while ((++level < nilfs_btree_height(btree) - 1) &&  in nilfs_btree_prepare_propagate_v()