Lines Matching refs:nilfs_btree_height
426 static int nilfs_btree_height(const struct nilfs_bmap *btree) in nilfs_btree_height() function
438 if (level == nilfs_btree_height(btree) - 1) { in nilfs_btree_get_node()
651 int maxlevel = nilfs_btree_height(btree) - 1; in nilfs_btree_get_next_key()
723 maxlevel = nilfs_btree_height(btree) - 1; in nilfs_btree_lookup_contig()
780 if (level < nilfs_btree_height(btree) - 1) { in nilfs_btree_promote_key()
788 (++level < nilfs_btree_height(btree) - 1)); in nilfs_btree_promote_key()
792 if (level == nilfs_btree_height(btree) - 1) { in nilfs_btree_promote_key()
805 if (level < nilfs_btree_height(btree) - 1) { in nilfs_btree_do_insert()
1017 if (level <= nilfs_btree_height(btree) - 1) { in nilfs_btree_find_near()
1074 level < nilfs_btree_height(btree) - 1; in nilfs_btree_prepare_insert()
1255 if (level < nilfs_btree_height(btree) - 1) { in nilfs_btree_do_delete()
1436 level < nilfs_btree_height(btree) - 1; in nilfs_btree_prepare_delete()
1506 WARN_ON(level != nilfs_btree_height(btree) - 2); in nilfs_btree_prepare_delete()
1646 switch (nilfs_btree_height(btree)) { in nilfs_btree_check_delete()
1687 switch (nilfs_btree_height(btree)) { in nilfs_btree_gather_data()
1888 while ((++level < nilfs_btree_height(btree) - 1) && in nilfs_btree_propagate_p()
1979 while ((++level < nilfs_btree_height(btree) - 1) && in nilfs_btree_prepare_propagate_v()