Searched refs:bc_nlevels (Results 1 – 15 of 15) sorted by relevance
148 if (cur->bc_nlevels == 1) in xchk_btree_rec()196 if (level + 1 >= cur->bc_nlevels) in xchk_btree_key()229 level == bs->cur->bc_nlevels) in xchk_btree_ptr_ok()323 if (level == cur->bc_nlevels - 1) { in xchk_btree_block_check_siblings()474 ok_level = bs->cur->bc_nlevels - 1; in xchk_btree_check_minrecs()555 if (level >= cur->bc_nlevels - 1) in xchk_btree_block_keys()619 if (cur->bc_nlevels > XFS_BTREE_MAXLEVELS) { in xchk_btree()628 level = cur->bc_nlevels - 1; in xchk_btree()630 if (!xchk_btree_ptr_ok(&bs, cur->bc_nlevels, &ptr)) in xchk_btree()638 while (level < cur->bc_nlevels) { in xchk_btree()[all …]
23 if (level < cur->bc_nlevels && cur->bc_bufs[level]) in xchk_btree_cur_fsbno()25 else if (level == cur->bc_nlevels - 1 && in xchk_btree_cur_fsbno()
259 for (i = 0; i < cur->bc_nlevels && cur->bc_ptrs[i] == 1; i++) { in xfs_bitmap_set_btcur_path()
390 for (i = 0; i < bs->cur->bc_nlevels - 1; i++) { in xchk_bmapbt_rec()
507 __entry->nlevels = cur->bc_nlevels;
372 for (i = 0; i < cur->bc_nlevels; i++) { in xfs_btree_del_cursor()422 for (i = 0; i < new->bc_nlevels; i++) { in xfs_btree_dup_cursor()674 (level == cur->bc_nlevels - 1)) { in xfs_btree_get_block()972 (lev == cur->bc_nlevels - 1)) in xfs_btree_readahead()1587 ASSERT(level < cur->bc_nlevels); in xfs_btree_increment()1616 for (lev = level + 1; lev < cur->bc_nlevels; lev++) { in xfs_btree_increment()1636 if (lev == cur->bc_nlevels) { in xfs_btree_increment()1643 ASSERT(lev < cur->bc_nlevels); in xfs_btree_increment()1689 ASSERT(level < cur->bc_nlevels); in xfs_btree_decrement()1718 for (lev = level + 1; lev < cur->bc_nlevels; lev++) { in xfs_btree_decrement()[all …]
302 if (level == cur->bc_nlevels - 1) { in xfs_bmbt_get_minrecs()320 if (level == cur->bc_nlevels - 1) { in xfs_bmbt_get_maxrecs()348 if (level != cur->bc_nlevels - 1) in xfs_bmbt_get_dmaxrecs()559 cur->bc_nlevels = be16_to_cpu(ifp->if_broot->bb_level) + 1; in xfs_bmbt_init_cursor()
500 cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_CNT]); in xfs_allocbt_init_cursor()505 cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_BNO]); in xfs_allocbt_init_cursor()
422 cur->bc_nlevels = be32_to_cpu(agi->agi_level); in xfs_inobt_init_cursor()426 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
337 cur->bc_nlevels = be32_to_cpu(agf->agf_refcount_level); in xfs_refcountbt_init_cursor()
472 cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_RMAP]); in xfs_rmapbt_init_cursor()
461 if (bno_cur->bc_nlevels == 1 && cnt_cur->bc_nlevels == 1) { in xfs_alloc_fixup_trees()
223 if (cur->bc_nlevels == 1) { in xfs_check_agi_freecount()
2219 __entry->nlevels = cur->bc_nlevels;
