537 				 __u64 key, __u64 *ptrp, int minlevel,  in nilfs_btree_do_lookup()  argument
547 	if (level < minlevel || nilfs_btree_node_get_nchildren(node) <= 0)  in nilfs_btree_do_lookup()
558 	while (--level >= minlevel) {  in nilfs_btree_do_lookup()
648 				    int minlevel, __u64 *nextkey)  in nilfs_btree_get_next_key()  argument
656 	for (level = minlevel; level <= maxlevel; level++) {  in nilfs_btree_get_next_key()
1603 	const int minlevel = NILFS_BTREE_LEVEL_NODE_MIN;  in nilfs_btree_seek_key()  local
1610 	ret = nilfs_btree_do_lookup(btree, path, start, NULL, minlevel, 0);  in nilfs_btree_seek_key()
1614 		ret = nilfs_btree_get_next_key(btree, path, minlevel, keyp);  in nilfs_btree_seek_key()
1967 					   int minlevel, int *maxlevelp,  in nilfs_btree_prepare_propagate_v()  argument
1972 	level = minlevel;  in nilfs_btree_prepare_propagate_v()
1993 	while (--level > minlevel)  in nilfs_btree_prepare_propagate_v()
2002 					   int minlevel, int maxlevel,  in nilfs_btree_commit_propagate_v()  argument
2008 	if (!buffer_nilfs_volatile(path[minlevel].bp_bh))  in nilfs_btree_commit_propagate_v()
2009 		nilfs_btree_commit_update_v(btree, path, minlevel, dat);  in nilfs_btree_commit_propagate_v()
2011 	for (level = minlevel + 1; level <= maxlevel; level++)  in nilfs_btree_commit_propagate_v()