Home
last modified time | relevance | path

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

/linux/fs/xfs/libxfs/
A Dxfs_btree_staging.c151 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()
546 if (level == cur->bc_nlevels - 1) in xfs_btree_bload_desired_npb()
660 cur->bc_nlevels = cur->bc_maxlevels - 1; in xfs_btree_bload_compute_geometry()
665 for (cur->bc_nlevels = 1; cur->bc_nlevels <= cur->bc_maxlevels;) { in xfs_btree_bload_compute_geometry()
705 cur->bc_nlevels++; in xfs_btree_bload_compute_geometry()
721 cur->bc_nlevels++; in xfs_btree_bload_compute_geometry()
729 if (cur->bc_nlevels > cur->bc_maxlevels) in xfs_btree_bload_compute_geometry()
732 bbl->btree_height = cur->bc_nlevels; in xfs_btree_bload_compute_geometry()
[all …]
A Dxfs_btree.c1585 if (lev == cur->bc_nlevels) { in xfs_btree_increment()
1678 if (lev == cur->bc_nlevels) { in xfs_btree_decrement()
2905 level = cur->bc_nlevels - 1; in xfs_btree_new_iroot()
2939 cur->bc_nlevels++; in xfs_btree_new_iroot()
3103 cur->bc_nlevels++; in xfs_btree_new_root()
3452 cur->bc_nlevels = pcur->bc_nlevels; in xfs_btree_insert()
3500 ASSERT(cur->bc_nlevels > 1); in xfs_btree_kill_iroot()
3506 level = cur->bc_nlevels - 1; in xfs_btree_kill_iroot()
3570 cur->bc_nlevels--; in xfs_btree_kill_iroot()
3601 cur->bc_nlevels--; in xfs_btree_kill_root()
[all …]
A Dxfs_bmap_btree.c304 if (level == cur->bc_nlevels - 1) { in xfs_bmbt_get_minrecs()
322 if (level == cur->bc_nlevels - 1) { in xfs_bmbt_get_maxrecs()
350 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()
A Dxfs_alloc_btree.c520 cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_CNT]); in xfs_allocbt_init_cursor()
522 cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_BNO]); in xfs_allocbt_init_cursor()
A Dxfs_ialloc_btree.c470 cur->bc_nlevels = be32_to_cpu(agi->agi_level); in xfs_inobt_init_cursor()
472 cur->bc_nlevels = be32_to_cpu(agi->agi_free_level); in xfs_inobt_init_cursor()
A Dxfs_btree.h237 uint8_t bc_nlevels; /* number of levels in the tree */ member
A Dxfs_refcount_btree.c355 cur->bc_nlevels = be32_to_cpu(agf->agf_refcount_level); in xfs_refcountbt_init_cursor()
A Dxfs_rmap_btree.c482 cur->bc_nlevels = be32_to_cpu(agf->agf_levels[XFS_BTNUM_RMAP]); in xfs_rmapbt_init_cursor()
A Dxfs_alloc.c487 if (bno_cur->bc_nlevels == 1 && cnt_cur->bc_nlevels == 1) { in xfs_alloc_fixup_trees()
A Dxfs_ialloc.c221 if (cur->bc_nlevels == 1) { in xfs_check_agi_freecount()
/linux/fs/xfs/scrub/
A Dbtree.c149 if (cur->bc_nlevels == 1) in xchk_btree_rec()
196 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()
497 level == cur->bc_nlevels - 2) { in xchk_btree_check_minrecs()
591 if (level >= cur->bc_nlevels - 1) in xchk_btree_block_keys()
647 cur_sz = xchk_btree_sizeof(cur->bc_nlevels); in xchk_btree()
668 level = cur->bc_nlevels - 1; in xchk_btree()
678 while (level < cur->bc_nlevels) { in xchk_btree()
686 if (level < cur->bc_nlevels - 1) in xchk_btree()
[all …]
A Dtrace.c24 if (level < cur->bc_nlevels && cur->bc_levels[level].bp) in xchk_btree_cur_fsbno()
28 if (level == cur->bc_nlevels - 1 && in xchk_btree_cur_fsbno()
A Dbitmap.c259 for (i = 0; i < cur->bc_nlevels && cur->bc_levels[i].ptr == 1; i++) { in xbitmap_set_btcur_path()
A Dbmap.c406 for (i = 0; i < bs->cur->bc_nlevels - 1; i++) { in xchk_bmapbt_rec()
A Dtrace.h513 __entry->nlevels = cur->bc_nlevels;
/linux/fs/xfs/
A Dxfs_trace.h2478 __entry->nlevels = cur->bc_nlevels;
3921 __entry->nlevels = cur->bc_nlevels;

Completed in 41 milliseconds