Searched refs:bc_nlevels (Results 1 – 17 of 17) sorted by relevance
151 cur->bc_nlevels = afake->af_levels; in xfs_btree_stage_afakeroot()231 cur->bc_nlevels = ifake->if_levels; in xfs_btree_stage_ifakeroot()378 level == cur->bc_nlevels - 1) { in xfs_btree_bload_prep_block()519 if (level == cur->bc_nlevels - 1 && cur->bc_ops->get_dmaxrecs) in xfs_btree_bload_max_npb()544 if (level == cur->bc_nlevels - 1) in xfs_btree_bload_desired_npb()658 cur->bc_nlevels = cur->bc_maxlevels - 1; in xfs_btree_bload_compute_geometry()663 for (cur->bc_nlevels = 1; cur->bc_nlevels <= cur->bc_maxlevels;) { in xfs_btree_bload_compute_geometry()666 unsigned int level = cur->bc_nlevels - 1; in xfs_btree_bload_compute_geometry()703 cur->bc_nlevels++; in xfs_btree_bload_compute_geometry()704 ASSERT(cur->bc_nlevels <= cur->bc_maxlevels); in xfs_btree_bload_compute_geometry()[all …]
438 for (i = 0; i < cur->bc_nlevels; i++) { in xfs_btree_del_cursor()492 for (i = 0; i < new->bc_nlevels; i++) { in xfs_btree_dup_cursor()754 (level == cur->bc_nlevels - 1)) { in xfs_btree_get_block()997 (lev == cur->bc_nlevels - 1)) in xfs_btree_readahead()1611 ASSERT(level < cur->bc_nlevels); in xfs_btree_increment()1640 for (lev = level + 1; lev < cur->bc_nlevels; lev++) { in xfs_btree_increment()1660 if (lev == cur->bc_nlevels) { in xfs_btree_increment()1667 ASSERT(lev < cur->bc_nlevels); in xfs_btree_increment()1713 ASSERT(level < cur->bc_nlevels); in xfs_btree_decrement()1742 for (lev = level + 1; lev < cur->bc_nlevels; lev++) { in xfs_btree_decrement()[all …]
290 if (level == cur->bc_nlevels - 1) { in xfs_bmbt_get_minrecs()308 if (level == cur->bc_nlevels - 1) { in xfs_bmbt_get_maxrecs()336 if (level != cur->bc_nlevels - 1) in xfs_bmbt_get_dmaxrecs()562 cur->bc_nlevels = be16_to_cpu(ifp->if_broot->bb_level) + 1; in xfs_bmbt_init_cursor()
541 cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_CNT]); in xfs_allocbt_init_cursor()543 cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_BNO]); in xfs_allocbt_init_cursor()
487 cur->bc_nlevels = be32_to_cpu(agi->agi_level); in xfs_inobt_init_cursor()489 cur->bc_nlevels = be32_to_cpu(agi->agi_free_level); in xfs_inobt_init_cursor()
373 cur->bc_nlevels = be32_to_cpu(agf->agf_refcount_level); in xfs_refcountbt_init_cursor()
277 uint8_t bc_nlevels; /* number of levels in the tree */ member
532 cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_RMAP]); in xfs_rmapbt_init_cursor()
532 if (bno_cur->bc_nlevels == 1 && cnt_cur->bc_nlevels == 1) { in xfs_alloc_fixup_trees()
246 if (cur->bc_nlevels == 1) { in xfs_check_agi_freecount()
161 if (cur->bc_nlevels == 1) in xchk_btree_rec()209 if (level + 1 >= cur->bc_nlevels) in xchk_btree_key()243 level == bs->cur->bc_nlevels) in xchk_btree_ptr_ok()337 if (level == cur->bc_nlevels - 1) { in xchk_btree_block_check_siblings()502 unsigned int root_level = cur->bc_nlevels - 1; in xchk_btree_check_minrecs()517 level == cur->bc_nlevels - 2) { in xchk_btree_check_minrecs()556 if (level == cur->bc_nlevels - 1) in xchk_btree_block_check_keys()658 if (level >= cur->bc_nlevels - 1) in xchk_btree_block_keys()714 cur_sz = xchk_btree_sizeof(cur->bc_nlevels); in xchk_btree()735 level = cur->bc_nlevels - 1; in xchk_btree()[all …]
26 if (level < cur->bc_nlevels && cur->bc_levels[level].bp) in xchk_btree_cur_fsbno()30 if (level == cur->bc_nlevels - 1 && in xchk_btree_cur_fsbno()
149 for (level = 1; level < cur->bc_nlevels; level++) { in xchk_rmapbt_check_unwritten_in_keyflags()489 sc->sa.rmap_cur->bc_nlevels - 1, &error); in xchk_rmapbt_walk_ag_metadata()512 level = cur->bc_nlevels - 1; in xchk_rmapbt_check_bitmaps()
311 for (i = 0; i < cur->bc_nlevels && cur->bc_levels[i].ptr == 1; i++) { in xagb_bitmap_set_btcur_path()
459 for (i = 0; i < bs->cur->bc_nlevels - 1; i++) { in xchk_bmapbt_rec()
555 __entry->nlevels = cur->bc_nlevels;
2471 __entry->nlevels = cur->bc_nlevels;4155 __entry->nlevels = cur->bc_nlevels;