Searched refs:bc_nlevels (Results 1 – 15 of 15) sorted by relevance
155 if (cur->bc_nlevels == 1) in xchk_btree_rec()203 if (level + 1 >= cur->bc_nlevels) in xchk_btree_key()236 level == bs->cur->bc_nlevels) in xchk_btree_ptr_ok()330 if (level == cur->bc_nlevels - 1) { in xchk_btree_block_check_siblings()454 unsigned int root_level = cur->bc_nlevels - 1; in xchk_btree_check_minrecs()469 level == cur->bc_nlevels - 2) { in xchk_btree_check_minrecs()562 if (level >= cur->bc_nlevels - 1) in xchk_btree_block_keys()625 if (cur->bc_nlevels > XFS_BTREE_MAXLEVELS) { in xchk_btree()634 level = cur->bc_nlevels - 1; in xchk_btree()636 if (!xchk_btree_ptr_ok(&bs, cur->bc_nlevels, &ptr)) in xchk_btree()[all …]
29 if (level < cur->bc_nlevels && cur->bc_bufs[level]) in xchk_btree_cur_fsbno()31 else if (level == cur->bc_nlevels - 1 && in xchk_btree_cur_fsbno()
264 for (i = 0; i < cur->bc_nlevels && cur->bc_ptrs[i] == 1; i++) { in xfs_bitmap_set_btcur_path()
397 for (i = 0; i < bs->cur->bc_nlevels - 1; i++) { in xchk_bmapbt_rec()
439 __entry->nlevels = cur->bc_nlevels;
375 for (i = 0; i < cur->bc_nlevels; i++) { in xfs_btree_del_cursor()425 for (i = 0; i < new->bc_nlevels; i++) { in xfs_btree_dup_cursor()677 (level == cur->bc_nlevels - 1)) { in xfs_btree_get_block()978 (lev == cur->bc_nlevels - 1)) in xfs_btree_readahead()1598 ASSERT(level < cur->bc_nlevels); in xfs_btree_increment()1627 for (lev = level + 1; lev < cur->bc_nlevels; lev++) { in xfs_btree_increment()1647 if (lev == cur->bc_nlevels) { in xfs_btree_increment()1654 ASSERT(lev < cur->bc_nlevels); in xfs_btree_increment()1700 ASSERT(level < cur->bc_nlevels); in xfs_btree_decrement()1729 for (lev = level + 1; lev < cur->bc_nlevels; lev++) { in xfs_btree_decrement()[all …]
305 if (level == cur->bc_nlevels - 1) { in xfs_bmbt_get_minrecs()323 if (level == cur->bc_nlevels - 1) { in xfs_bmbt_get_maxrecs()351 if (level != cur->bc_nlevels - 1) in xfs_bmbt_get_dmaxrecs()551 cur->bc_nlevels = be16_to_cpu(ifp->if_broot->bb_level) + 1; in xfs_bmbt_init_cursor()
505 cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_CNT]); in xfs_allocbt_init_cursor()510 cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_BNO]); in xfs_allocbt_init_cursor()
421 cur->bc_nlevels = be32_to_cpu(agi->agi_level); in xfs_inobt_init_cursor()425 cur->bc_nlevels = be32_to_cpu(agi->agi_free_level); in xfs_inobt_init_cursor()
204 uint8_t bc_nlevels; /* number of levels in the tree */ member
340 cur->bc_nlevels = be32_to_cpu(agf->agf_refcount_level); in xfs_refcountbt_init_cursor()
475 cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_RMAP]); in xfs_rmapbt_init_cursor()
465 if (bno_cur->bc_nlevels == 1 && cnt_cur->bc_nlevels == 1) { in xfs_alloc_fixup_trees()
240 if (cur->bc_nlevels == 1) { in xfs_check_agi_freecount()
2193 __entry->nlevels = cur->bc_nlevels;