Lines Matching refs:maxlevel
662 int maxlevel = nilfs_btree_height(btree) - 1; in nilfs_btree_get_next_key() local
667 for (level = minlevel; level <= maxlevel; level++) { in nilfs_btree_get_next_key()
668 if (level == maxlevel) in nilfs_btree_get_next_key()
712 int ret, cnt, index, maxlevel, ncmax; in nilfs_btree_lookup_contig() local
734 maxlevel = nilfs_btree_height(btree) - 1; in nilfs_btree_lookup_contig()
753 if (level == maxlevel) in nilfs_btree_lookup_contig()
1207 int maxlevel, __u64 key, __u64 ptr) in nilfs_btree_commit_insert() argument
1219 for (level = NILFS_BTREE_LEVEL_NODE_MIN; level <= maxlevel; level++) { in nilfs_btree_commit_insert()
1566 int maxlevel, struct inode *dat) in nilfs_btree_commit_delete() argument
1570 for (level = NILFS_BTREE_LEVEL_NODE_MIN; level <= maxlevel; level++) { in nilfs_btree_commit_delete()
2015 int minlevel, int maxlevel, in nilfs_btree_commit_propagate_v() argument
2024 for (level = minlevel + 1; level <= maxlevel; level++) in nilfs_btree_commit_propagate_v()
2032 int maxlevel = 0, ret; in nilfs_btree_propagate_v() local
2040 ret = nilfs_btree_prepare_propagate_v(btree, path, level, &maxlevel, in nilfs_btree_propagate_v()
2055 nilfs_btree_commit_propagate_v(btree, path, level, maxlevel, bh, dat); in nilfs_btree_propagate_v()