Home
last modified time | relevance | path

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

/linux/fs/xfs/scrub/
H A Dbtree.c163 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 …]
H 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()
H A Dtrace.h742 __entry->nlevels = cur->bc_nlevels;
/linux/fs/xfs/libxfs/
H 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()
H A Dxfs_ialloc.c255 if (cur->bc_nlevels == 1) { in xfs_check_agi_freecount()