Searched refs:bc_nlevels (Results 1 – 11 of 11) 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()444 if (level == cur->bc_nlevels - 1 && cur->bc_ops->get_dmaxrecs) in xfs_btree_bload_max_npb()469 if (level == cur->bc_nlevels - 1) in xfs_btree_bload_desired_npb()591 cur->bc_nlevels = cur->bc_maxlevels - 1; in xfs_btree_bload_compute_geometry()596 for (cur->bc_nlevels = 1; cur->bc_nlevels <= cur->bc_maxlevels;) { in xfs_btree_bload_compute_geometry()599 unsigned int level = cur->bc_nlevels - 1; in xfs_btree_bload_compute_geometry()638 cur->bc_nlevels++; in xfs_btree_bload_compute_geometry()639 ASSERT(cur->bc_nlevels <= cur->bc_maxlevels); in xfs_btree_bload_compute_geometry()654 cur->bc_nlevels++; in xfs_btree_bload_compute_geometry()[all …]
56 if (level == cur->bc_nlevels - 1) { in xfs_rtrefcountbt_get_minrecs()71 if (level == cur->bc_nlevels - 1) { in xfs_rtrefcountbt_get_maxrecs()111 if (level != cur->bc_nlevels - 1) in xfs_rtrefcountbt_get_dmaxrecs()312 const unsigned int level = cur->bc_nlevels - 1; in xfs_rtrefcountbt_broot_realloc()418 cur->bc_nlevels = be16_to_cpu(ip->i_df.if_broot->bb_level) + 1; in xfs_rtrefcountbt_init_cursor()
58 if (level == cur->bc_nlevels - 1) { in xfs_rtrmapbt_get_minrecs()73 if (level == cur->bc_nlevels - 1) { in xfs_rtrmapbt_get_maxrecs()111 if (level != cur->bc_nlevels - 1) in xfs_rtrmapbt_get_dmaxrecs()413 const unsigned int level = cur->bc_nlevels - 1; in xfs_rtrmapbt_broot_realloc()520 cur->bc_nlevels = be16_to_cpu(ip->i_df.if_broot->bb_level) + 1; in xfs_rtrmapbt_init_cursor()623 cur->bc_nlevels = xfbt->nlevels; in xfs_rtrmapbt_mem_cursor()
59 ncur->bc_nlevels = cur->bc_nlevels; in xfbtree_dup_cursor()
274 uint8_t bc_nlevels; /* number of levels in the tree */ member706 level == cur->bc_nlevels - 1; in xfs_btree_at_iroot()
635 if (bno_cur->bc_nlevels == 1 && cnt_cur->bc_nlevels == 1) { in xfs_alloc_fixup_trees()
163 if (cur->bc_nlevels == 1) in xchk_btree_rec()211 if (level + 1 >= cur->bc_nlevels) in xchk_btree_key()243 level == bs->cur->bc_nlevels) in xchk_btree_ptr_ok()335 if (level == cur->bc_nlevels - 1) { in xchk_btree_block_check_siblings()501 unsigned int root_level = cur->bc_nlevels - 1; in xchk_btree_check_minrecs()516 level == cur->bc_nlevels - 2) { in xchk_btree_check_minrecs()555 if (level == cur->bc_nlevels - 1) in xchk_btree_block_check_keys()650 if (level >= cur->bc_nlevels - 1) in xchk_btree_block_keys()706 cur_sz = xchk_btree_sizeof(cur->bc_nlevels); in xchk_btree()727 level = cur->bc_nlevels - 1; in xchk_btree()[all …]
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()528 level = cur->bc_nlevels - 1; in xchk_rmapbt_check_bitmaps()
543 for (i = 0; i < bs->cur->bc_nlevels - 1; i++) { in xchk_bmapbt_rec()
742 __entry->nlevels = cur->bc_nlevels;
2910 __entry->nlevels = cur->bc_nlevels;4809 __entry->nlevels = cur->bc_nlevels;5244 __entry->nlevels = cur->bc_nlevels;