Searched refs:bc_nlevels (Results 1 – 19 of 19) sorted by relevance
68 cur->bc_nlevels = afake->af_levels; in xfs_btree_stage_afakeroot()135 cur->bc_nlevels = ifake->if_levels; in xfs_btree_stage_ifakeroot()442 if (level == cur->bc_nlevels - 1 && cur->bc_ops->get_dmaxrecs) in xfs_btree_bload_max_npb()467 if (level == cur->bc_nlevels - 1) in xfs_btree_bload_desired_npb()588 cur->bc_nlevels = cur->bc_maxlevels - 1; in xfs_btree_bload_compute_geometry()593 for (cur->bc_nlevels = 1; cur->bc_nlevels <= cur->bc_maxlevels;) { in xfs_btree_bload_compute_geometry()596 unsigned int level = cur->bc_nlevels - 1; in xfs_btree_bload_compute_geometry()633 cur->bc_nlevels++; in xfs_btree_bload_compute_geometry()634 ASSERT(cur->bc_nlevels <= cur->bc_maxlevels); in xfs_btree_bload_compute_geometry()649 cur->bc_nlevels++; in xfs_btree_bload_compute_geometry()[all …]
510 for (i = 0; i < cur->bc_nlevels; i++) { in xfs_btree_del_cursor()601 for (i = 0; i < new->bc_nlevels; i++) { in xfs_btree_dup_cursor()1670 ASSERT(level < cur->bc_nlevels); in xfs_btree_increment()1699 for (lev = level + 1; lev < cur->bc_nlevels; lev++) { in xfs_btree_increment()1719 if (lev == cur->bc_nlevels) { in xfs_btree_increment()1727 ASSERT(lev < cur->bc_nlevels); in xfs_btree_increment()1773 ASSERT(level < cur->bc_nlevels); in xfs_btree_decrement()1802 for (lev = level + 1; lev < cur->bc_nlevels; lev++) { in xfs_btree_decrement()1813 if (lev == cur->bc_nlevels) { in xfs_btree_decrement()1821 ASSERT(lev < cur->bc_nlevels); in xfs_btree_decrement()[all …]
300 if (level == cur->bc_nlevels - 1) { in xfs_bmbt_get_minrecs()315 if (level == cur->bc_nlevels - 1) { in xfs_bmbt_get_maxrecs()340 if (level != cur->bc_nlevels - 1) in xfs_bmbt_get_dmaxrecs()585 cur->bc_nlevels = be16_to_cpu(ifp->if_broot->bb_level) + 1; in xfs_bmbt_init_cursor()
58 ncur->bc_nlevels = cur->bc_nlevels; in xfbtree_dup_cursor()
255 uint8_t bc_nlevels; /* number of levels in the tree */ member688 level == cur->bc_nlevels - 1; in xfs_btree_at_iroot()
500 cur->bc_nlevels = be32_to_cpu(agf->agf_bno_level); in xfs_bnobt_init_cursor()526 cur->bc_nlevels = be32_to_cpu(agf->agf_cnt_level); in xfs_cntbt_init_cursor()
491 cur->bc_nlevels = be32_to_cpu(agi->agi_level); in xfs_inobt_init_cursor()517 cur->bc_nlevels = be32_to_cpu(agi->agi_free_level); in xfs_finobt_init_cursor()
546 cur->bc_nlevels = be32_to_cpu(agf->agf_rmap_level); in xfs_rmapbt_init_cursor()655 cur->bc_nlevels = xfbt->nlevels; in xfs_rmapbt_mem_cursor()
376 cur->bc_nlevels = be32_to_cpu(agf->agf_refcount_level); in xfs_refcountbt_init_cursor()
636 if (bno_cur->bc_nlevels == 1 && cnt_cur->bc_nlevels == 1) { in xfs_alloc_fixup_trees()
255 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()241 level == bs->cur->bc_nlevels) in xchk_btree_ptr_ok()333 if (level == cur->bc_nlevels - 1) { in xchk_btree_block_check_siblings()496 unsigned int root_level = cur->bc_nlevels - 1; in xchk_btree_check_minrecs()511 level == cur->bc_nlevels - 2) { in xchk_btree_check_minrecs()550 if (level == cur->bc_nlevels - 1) in xchk_btree_block_check_keys()645 if (level >= cur->bc_nlevels - 1) in xchk_btree_block_keys()701 cur_sz = xchk_btree_sizeof(cur->bc_nlevels); in xchk_btree()722 level = cur->bc_nlevels - 1; in xchk_btree()[all …]
42 if (level < cur->bc_nlevels && cur->bc_levels[level].bp) in xchk_btree_cur_fsbno()46 if (level == cur->bc_nlevels - 1 && in xchk_btree_cur_fsbno()
96 for (i = 0; i < cur->bc_nlevels && cur->bc_levels[i].ptr == 1; i++) { in xagb_bitmap_set_btcur_path()
159 for (level = 1; level < cur->bc_nlevels; level++) { in xchk_rmapbt_check_unwritten_in_keyflags()498 sc->sa.rmap_cur->bc_nlevels - 1, &error); in xchk_rmapbt_walk_ag_metadata()521 level = cur->bc_nlevels - 1; in xchk_rmapbt_check_bitmaps()
224 cur->bc_nlevels = xfbtree->nlevels; in rcbagbt_mem_cursor()
483 for (i = 0; i < bs->cur->bc_nlevels - 1; i++) { in xchk_bmapbt_rec()
730 __entry->nlevels = cur->bc_nlevels;
2505 __entry->nlevels = cur->bc_nlevels;4403 __entry->nlevels = cur->bc_nlevels;4843 __entry->nlevels = cur->bc_nlevels;