Lines Matching refs:nilfs_btree_height
433 static int nilfs_btree_height(const struct nilfs_bmap *btree) in nilfs_btree_height() function
445 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()
722 maxlevel = nilfs_btree_height(btree) - 1; in nilfs_btree_lookup_contig()
779 if (level < nilfs_btree_height(btree) - 1) { in nilfs_btree_promote_key()
787 (++level < nilfs_btree_height(btree) - 1)); in nilfs_btree_promote_key()
791 if (level == nilfs_btree_height(btree) - 1) { in nilfs_btree_promote_key()
804 if (level < nilfs_btree_height(btree) - 1) { in nilfs_btree_do_insert()
1021 if (level <= nilfs_btree_height(btree) - 1) { in nilfs_btree_find_near()
1078 level < nilfs_btree_height(btree) - 1; in nilfs_btree_prepare_insert()
1259 if (level < nilfs_btree_height(btree) - 1) { in nilfs_btree_do_delete()
1440 level < nilfs_btree_height(btree) - 1; in nilfs_btree_prepare_delete()
1510 WARN_ON(level != nilfs_btree_height(btree) - 2); in nilfs_btree_prepare_delete()
1650 switch (nilfs_btree_height(btree)) { in nilfs_btree_check_delete()
1691 switch (nilfs_btree_height(btree)) { in nilfs_btree_gather_data()
1892 while ((++level < nilfs_btree_height(btree) - 1) && in nilfs_btree_propagate_p()
1983 while ((++level < nilfs_btree_height(btree) - 1) && in nilfs_btree_prepare_propagate_v()