Searched refs:bc_nlevels (Results 1 – 7 of 7) sorted by relevance
317 for (i = 0; i < cur->bc_nlevels; i++) { in xfs_btree_del_cursor()367 for (i = 0; i < new->bc_nlevels; i++) { in xfs_btree_dup_cursor()550 (level == cur->bc_nlevels - 1)) { in xfs_btree_get_block()848 (lev == cur->bc_nlevels - 1)) in xfs_btree_readahead()1461 ASSERT(level < cur->bc_nlevels); in xfs_btree_increment()1490 for (lev = level + 1; lev < cur->bc_nlevels; lev++) { in xfs_btree_increment()1510 if (lev == cur->bc_nlevels) { in xfs_btree_increment()1517 ASSERT(lev < cur->bc_nlevels); in xfs_btree_increment()1569 ASSERT(level < cur->bc_nlevels); in xfs_btree_decrement()1598 for (lev = level + 1; lev < cur->bc_nlevels; lev++) { in xfs_btree_decrement()[all …]
543 if (level == cur->bc_nlevels - 1) { in xfs_bmbt_get_minrecs()561 if (level == cur->bc_nlevels - 1) { in xfs_bmbt_get_maxrecs()589 if (level != cur->bc_nlevels - 1) in xfs_bmbt_get_dmaxrecs()792 cur->bc_nlevels = be16_to_cpu(ifp->if_broot->bb_level) + 1; in xfs_bmbt_init_cursor()
398 cur->bc_nlevels = be32_to_cpu(agi->agi_level); in xfs_inobt_init_cursor()401 cur->bc_nlevels = be32_to_cpu(agi->agi_free_level); in xfs_inobt_init_cursor()
475 cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_CNT]); in xfs_allocbt_init_cursor()478 cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_BNO]); in xfs_allocbt_init_cursor()
215 __uint8_t bc_nlevels; /* number of levels in the tree */ member
370 if (bno_cur->bc_nlevels == 1 && cnt_cur->bc_nlevels == 1) { in xfs_alloc_fixup_trees()
211 if (cur->bc_nlevels == 1) { in xfs_check_agi_freecount()