Lines Matching refs:nilfs_btree_height
427 static int nilfs_btree_height(const struct nilfs_bmap *btree) in nilfs_btree_height() function
439 if (level == nilfs_btree_height(btree) - 1) { in nilfs_btree_get_node()
653 int maxlevel = nilfs_btree_height(btree) - 1; in nilfs_btree_get_next_key()
725 maxlevel = nilfs_btree_height(btree) - 1; in nilfs_btree_lookup_contig()
781 if (level < nilfs_btree_height(btree) - 1) { in nilfs_btree_promote_key()
789 (++level < nilfs_btree_height(btree) - 1)); in nilfs_btree_promote_key()
793 if (level == nilfs_btree_height(btree) - 1) { in nilfs_btree_promote_key()
806 if (level < nilfs_btree_height(btree) - 1) { in nilfs_btree_do_insert()
1018 if (level <= nilfs_btree_height(btree) - 1) { in nilfs_btree_find_near()
1075 level < nilfs_btree_height(btree) - 1; in nilfs_btree_prepare_insert()
1256 if (level < nilfs_btree_height(btree) - 1) { in nilfs_btree_do_delete()
1437 level < nilfs_btree_height(btree) - 1; in nilfs_btree_prepare_delete()
1507 WARN_ON(level != nilfs_btree_height(btree) - 2); in nilfs_btree_prepare_delete()
1647 switch (nilfs_btree_height(btree)) { in nilfs_btree_check_delete()
1687 switch (nilfs_btree_height(btree)) { in nilfs_btree_gather_data()
1891 while ((++level < nilfs_btree_height(btree) - 1) && in nilfs_btree_propagate_p()
1982 while ((++level < nilfs_btree_height(btree) - 1) && in nilfs_btree_prepare_propagate_v()