Home
last modified time | relevance | path

Searched refs:bc_nlevels (Results 1 – 21 of 21) sorted by relevance

/fs/xfs/libxfs/
A Dxfs_btree_staging.c68 cur->bc_nlevels = afake->af_levels; in xfs_btree_stage_afakeroot()
135 cur->bc_nlevels = ifake->if_levels; in xfs_btree_stage_ifakeroot()
468 if (level == cur->bc_nlevels - 1) in xfs_btree_bload_desired_npb()
590 cur->bc_nlevels = cur->bc_maxlevels - 1; in xfs_btree_bload_compute_geometry()
595 for (cur->bc_nlevels = 1; cur->bc_nlevels <= cur->bc_maxlevels;) { in xfs_btree_bload_compute_geometry()
598 unsigned int level = cur->bc_nlevels - 1; in xfs_btree_bload_compute_geometry()
637 cur->bc_nlevels++; in xfs_btree_bload_compute_geometry()
653 cur->bc_nlevels++; in xfs_btree_bload_compute_geometry()
661 if (cur->bc_nlevels > cur->bc_maxlevels) in xfs_btree_bload_compute_geometry()
664 bbl->btree_height = cur->bc_nlevels; in xfs_btree_bload_compute_geometry()
[all …]
A Dxfs_btree.c1717 if (lev == cur->bc_nlevels) { in xfs_btree_increment()
3123 cur->bc_nlevels++; in xfs_btree_promote_leaf_iroot()
3175 cur->bc_nlevels++; in xfs_btree_promote_node_iroot()
3239 level = cur->bc_nlevels - 1; in xfs_btree_new_iroot()
3426 cur->bc_nlevels++; in xfs_btree_new_root()
3786 cur->bc_nlevels = pcur->bc_nlevels; in xfs_btree_insert()
3822 cur->bc_nlevels--; in xfs_btree_demote_leaf_child()
3889 cur->bc_nlevels--; in xfs_btree_demote_node_child()
3918 cur->bc_nlevels > 1); in xfs_btree_kill_iroot()
3924 level = cur->bc_nlevels - 1; in xfs_btree_kill_iroot()
[all …]
A Dxfs_rtrefcount_btree.c56 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()
A Dxfs_rtrmap_btree.c58 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()
A Dxfs_btree_mem.c59 ncur->bc_nlevels = cur->bc_nlevels; in xfbtree_dup_cursor()
A Dxfs_bmap_btree.c300 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()
684 cur->bc_nlevels = be16_to_cpu(ifp->if_broot->bb_level) + 1; in xfs_bmbt_init_cursor()
A Dxfs_alloc_btree.c492 cur->bc_nlevels = be32_to_cpu(agf->agf_bno_level); in xfs_bnobt_init_cursor()
518 cur->bc_nlevels = be32_to_cpu(agf->agf_cnt_level); in xfs_cntbt_init_cursor()
A Dxfs_btree.h274 uint8_t bc_nlevels; /* number of levels in the tree */ member
706 level == cur->bc_nlevels - 1; in xfs_btree_at_iroot()
A Dxfs_ialloc_btree.c492 cur->bc_nlevels = be32_to_cpu(agi->agi_level); in xfs_inobt_init_cursor()
518 cur->bc_nlevels = be32_to_cpu(agi->agi_free_level); in xfs_finobt_init_cursor()
A Dxfs_rmap_btree.c526 cur->bc_nlevels = be32_to_cpu(agf->agf_rmap_level); in xfs_rmapbt_init_cursor()
634 cur->bc_nlevels = xfbt->nlevels; in xfs_rmapbt_mem_cursor()
A Dxfs_refcount_btree.c375 cur->bc_nlevels = be32_to_cpu(agf->agf_refcount_level); in xfs_refcountbt_init_cursor()
A Dxfs_alloc.c635 if (bno_cur->bc_nlevels == 1 && cnt_cur->bc_nlevels == 1) { in xfs_alloc_fixup_trees()
A Dxfs_ialloc.c255 if (cur->bc_nlevels == 1) { in xfs_check_agi_freecount()
/fs/xfs/scrub/
A Dbtree.c161 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()
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()
722 level = cur->bc_nlevels - 1; in xchk_btree()
732 while (level < cur->bc_nlevels) { in xchk_btree()
740 if (level < cur->bc_nlevels - 1) in xchk_btree()
[all …]
A Dtrace.c44 if (level < cur->bc_nlevels && cur->bc_levels[level].bp) in xchk_btree_cur_fsbno()
48 if (level == cur->bc_nlevels - 1 && in xchk_btree_cur_fsbno()
A Dagb_bitmap.c96 for (i = 0; i < cur->bc_nlevels && cur->bc_levels[i].ptr == 1; i++) { in xagb_bitmap_set_btcur_path()
A Drmap.c159 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()
A Drcbag_btree.c206 cur->bc_nlevels = xfbtree->nlevels; in rcbagbt_mem_cursor()
A Dbmap.c543 for (i = 0; i < bs->cur->bc_nlevels - 1; i++) { in xchk_bmapbt_rec()
A Dtrace.h742 __entry->nlevels = cur->bc_nlevels;
/fs/xfs/
A Dxfs_trace.h2878 __entry->nlevels = cur->bc_nlevels;
4780 __entry->nlevels = cur->bc_nlevels;
5222 __entry->nlevels = cur->bc_nlevels;

Completed in 61 milliseconds