Lines Matching refs:minlevel
539 __u64 key, __u64 *ptrp, int minlevel, in nilfs_btree_do_lookup() argument
549 if (level < minlevel || nilfs_btree_node_get_nchildren(node) <= 0) in nilfs_btree_do_lookup()
560 while (--level >= minlevel) { in nilfs_btree_do_lookup()
650 int minlevel, __u64 *nextkey) in nilfs_btree_get_next_key() argument
658 for (level = minlevel; level <= maxlevel; level++) { in nilfs_btree_get_next_key()
1605 const int minlevel = NILFS_BTREE_LEVEL_NODE_MIN; in nilfs_btree_seek_key() local
1612 ret = nilfs_btree_do_lookup(btree, path, start, NULL, minlevel, 0); in nilfs_btree_seek_key()
1616 ret = nilfs_btree_get_next_key(btree, path, minlevel, keyp); in nilfs_btree_seek_key()
1971 int minlevel, int *maxlevelp, in nilfs_btree_prepare_propagate_v() argument
1976 level = minlevel; in nilfs_btree_prepare_propagate_v()
1997 while (--level > minlevel) in nilfs_btree_prepare_propagate_v()
2006 int minlevel, int maxlevel, in nilfs_btree_commit_propagate_v() argument
2012 if (!buffer_nilfs_volatile(path[minlevel].bp_bh)) in nilfs_btree_commit_propagate_v()
2013 nilfs_btree_commit_update_v(btree, path, minlevel, dat); in nilfs_btree_commit_propagate_v()
2015 for (level = minlevel + 1; level <= maxlevel; level++) in nilfs_btree_commit_propagate_v()