Searched refs:bc_nlevels (Results 1 – 16 of 16) 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()380 level == cur->bc_nlevels - 1) { in xfs_btree_bload_prep_block()521 if (level == cur->bc_nlevels - 1 && cur->bc_ops->get_dmaxrecs) in xfs_btree_bload_max_npb()546 if (level == cur->bc_nlevels - 1) in xfs_btree_bload_desired_npb()660 cur->bc_nlevels = XFS_BTREE_MAXLEVELS - 1; in xfs_btree_bload_compute_geometry()665 for (cur->bc_nlevels = 1; cur->bc_nlevels < XFS_BTREE_MAXLEVELS;) { in xfs_btree_bload_compute_geometry()668 unsigned int level = cur->bc_nlevels - 1; in xfs_btree_bload_compute_geometry()705 cur->bc_nlevels++; in xfs_btree_bload_compute_geometry()720 cur->bc_nlevels++; in xfs_btree_bload_compute_geometry()[all …]
369 for (i = 0; i < cur->bc_nlevels; i++) { in xfs_btree_del_cursor()417 for (i = 0; i < new->bc_nlevels; i++) { in xfs_btree_dup_cursor()679 (level == cur->bc_nlevels - 1)) { in xfs_btree_get_block()922 (lev == cur->bc_nlevels - 1)) in xfs_btree_readahead()1536 ASSERT(level < cur->bc_nlevels); in xfs_btree_increment()1565 for (lev = level + 1; lev < cur->bc_nlevels; lev++) { in xfs_btree_increment()1585 if (lev == cur->bc_nlevels) { in xfs_btree_increment()1592 ASSERT(lev < cur->bc_nlevels); in xfs_btree_increment()1638 ASSERT(level < cur->bc_nlevels); in xfs_btree_decrement()1667 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()
523 cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_CNT]); in xfs_allocbt_init_cursor()525 cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_BNO]); in xfs_allocbt_init_cursor()
472 cur->bc_nlevels = be32_to_cpu(agi->agi_level); in xfs_inobt_init_cursor()474 cur->bc_nlevels = be32_to_cpu(agi->agi_free_level); in xfs_inobt_init_cursor()
231 uint8_t bc_nlevels; /* number of levels in the tree */ member
356 cur->bc_nlevels = be32_to_cpu(agf->agf_refcount_level); in xfs_refcountbt_init_cursor()
483 cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_RMAP]); in xfs_rmapbt_init_cursor()
487 if (bno_cur->bc_nlevels == 1 && cnt_cur->bc_nlevels == 1) { in xfs_alloc_fixup_trees()
221 if (cur->bc_nlevels == 1) { in xfs_check_agi_freecount()
149 if (cur->bc_nlevels == 1) in xchk_btree_rec()197 if (level + 1 >= cur->bc_nlevels) in xchk_btree_key()230 level == bs->cur->bc_nlevels) in xchk_btree_ptr_ok()324 if (level == cur->bc_nlevels - 1) { in xchk_btree_block_check_siblings()482 unsigned int root_level = cur->bc_nlevels - 1; in xchk_btree_check_minrecs()497 level == cur->bc_nlevels - 2) { in xchk_btree_check_minrecs()591 if (level >= cur->bc_nlevels - 1) in xchk_btree_block_keys()655 if (cur->bc_nlevels > XFS_BTREE_MAXLEVELS) { in xchk_btree()664 level = cur->bc_nlevels - 1; in xchk_btree()666 if (!xchk_btree_ptr_ok(&bs, cur->bc_nlevels, &ptr)) in xchk_btree()[all …]
24 if (level < cur->bc_nlevels && cur->bc_bufs[level]) in xchk_btree_cur_fsbno()27 if (level == cur->bc_nlevels - 1 && cur->bc_flags & XFS_BTREE_LONG_PTRS) in xchk_btree_cur_fsbno()
259 for (i = 0; i < cur->bc_nlevels && cur->bc_ptrs[i] == 1; i++) { in xbitmap_set_btcur_path()
406 for (i = 0; i < bs->cur->bc_nlevels - 1; i++) { in xchk_bmapbt_rec()
513 __entry->nlevels = cur->bc_nlevels;
2478 __entry->nlevels = cur->bc_nlevels;3921 __entry->nlevels = cur->bc_nlevels;
