663 	int maxlevel = nilfs_btree_height(btree) - 1;  in nilfs_btree_get_next_key()  local
668 	for (level = minlevel; level <= maxlevel; level++) {  in nilfs_btree_get_next_key()
669 		if (level == maxlevel)  in nilfs_btree_get_next_key()
713 	int ret, cnt, index, maxlevel, ncmax;  in nilfs_btree_lookup_contig()  local
735 	maxlevel = nilfs_btree_height(btree) - 1;  in nilfs_btree_lookup_contig()
754 		if (level == maxlevel)  in nilfs_btree_lookup_contig()
1213 				      int maxlevel, __u64 key, __u64 ptr)  in nilfs_btree_commit_insert()  argument
1225 	for (level = NILFS_BTREE_LEVEL_NODE_MIN; level <= maxlevel; level++) {  in nilfs_btree_commit_insert()
1572 				      int maxlevel, struct inode *dat)  in nilfs_btree_commit_delete()  argument
1576 	for (level = NILFS_BTREE_LEVEL_NODE_MIN; level <= maxlevel; level++) {  in nilfs_btree_commit_delete()
2024 					   int minlevel, int maxlevel,  in nilfs_btree_commit_propagate_v()  argument
2033 	for (level = minlevel + 1; level <= maxlevel; level++)  in nilfs_btree_commit_propagate_v()
2041 	int maxlevel = 0, ret;  in nilfs_btree_propagate_v()  local
2049 	ret = nilfs_btree_prepare_propagate_v(btree, path, level, &maxlevel,  in nilfs_btree_propagate_v()
2064 	nilfs_btree_commit_propagate_v(btree, path, level, maxlevel, bh, dat);  in nilfs_btree_propagate_v()