Lines Matching refs:nilfs_btree_height
428 static int nilfs_btree_height(const struct nilfs_bmap *btree) in nilfs_btree_height() function
440 if (level == nilfs_btree_height(btree) - 1) { in nilfs_btree_get_node()
662 int maxlevel = nilfs_btree_height(btree) - 1; in nilfs_btree_get_next_key()
734 maxlevel = nilfs_btree_height(btree) - 1; in nilfs_btree_lookup_contig()
795 if (level < nilfs_btree_height(btree) - 1) { in nilfs_btree_promote_key()
803 (++level < nilfs_btree_height(btree) - 1)); in nilfs_btree_promote_key()
807 if (level == nilfs_btree_height(btree) - 1) { in nilfs_btree_promote_key()
820 if (level < nilfs_btree_height(btree) - 1) { in nilfs_btree_do_insert()
1032 if (level <= nilfs_btree_height(btree) - 1) { in nilfs_btree_find_near()
1089 level < nilfs_btree_height(btree) - 1; in nilfs_btree_prepare_insert()
1270 if (level < nilfs_btree_height(btree) - 1) { in nilfs_btree_do_delete()
1451 level < nilfs_btree_height(btree) - 1; in nilfs_btree_prepare_delete()
1521 WARN_ON(level != nilfs_btree_height(btree) - 2); in nilfs_btree_prepare_delete()
1665 switch (nilfs_btree_height(btree)) { in nilfs_btree_check_delete()
1704 switch (nilfs_btree_height(btree)) { in nilfs_btree_gather_data()
1917 while ((++level < nilfs_btree_height(btree) - 1) && in nilfs_btree_propagate_p()
2008 while ((++level < nilfs_btree_height(btree) - 1) && in nilfs_btree_prepare_propagate_v()