Searched refs:XFS_BTREE_MAXLEVELS (Results 1 – 11 of 11) sorted by relevance
43 union xfs_btree_key lastkey[XFS_BTREE_MAXLEVELS];44 bool firstkey[XFS_BTREE_MAXLEVELS];
545 if (level <= 0 || level > XFS_BTREE_MAXLEVELS) in xchk_agf()549 if (level <= 0 || level > XFS_BTREE_MAXLEVELS) in xchk_agf()558 if (level <= 0 || level > XFS_BTREE_MAXLEVELS) in xchk_agf()568 if (level <= 0 || level > XFS_BTREE_MAXLEVELS) in xchk_agf()850 if (level <= 0 || level > XFS_BTREE_MAXLEVELS) in xchk_agi()859 if (level <= 0 || level > XFS_BTREE_MAXLEVELS) in xchk_agi()
614 for (i = 0; i < XFS_BTREE_MAXLEVELS; i++) in xchk_btree()619 if (cur->bc_nlevels > XFS_BTREE_MAXLEVELS) { in xchk_btree()
124 fab->height <= XFS_BTREE_MAXLEVELS; in xrep_check_btree_root()
93 #define XFS_BTREE_MAXLEVELS 9 /* max of all btrees */ macro199 struct xfs_buf *bc_bufs[XFS_BTREE_MAXLEVELS]; /* buf ptr per level */200 int bc_ptrs[XFS_BTREE_MAXLEVELS]; /* key/record # */201 uint8_t bc_ra[XFS_BTREE_MAXLEVELS]; /* readahead bits */
92 return XFS_TEST_ERROR(avail < orig / 10 || avail < XFS_BTREE_MAXLEVELS, in xfs_ag_resv_critical()
518 mp->m_rmap_maxlevels = XFS_BTREE_MAXLEVELS; in xfs_rmapbt_compute_maxlevels()
295 level == 0 || level > XFS_BTREE_MAXLEVELS) { in xfs_iformat_btree()
2603 be32_to_cpu(agf->agf_levels[XFS_BTNUM_BNO]) > XFS_BTREE_MAXLEVELS || in xfs_agf_verify()2604 be32_to_cpu(agf->agf_levels[XFS_BTNUM_CNT]) > XFS_BTREE_MAXLEVELS) in xfs_agf_verify()2609 be32_to_cpu(agf->agf_levels[XFS_BTNUM_RMAP]) > XFS_BTREE_MAXLEVELS)) in xfs_agf_verify()2627 be32_to_cpu(agf->agf_refcount_level) > XFS_BTREE_MAXLEVELS)) in xfs_agf_verify()
2491 be32_to_cpu(agi->agi_level) > XFS_BTREE_MAXLEVELS) in xfs_agi_verify()2496 be32_to_cpu(agi->agi_free_level) > XFS_BTREE_MAXLEVELS)) in xfs_agi_verify()
238 for (i = 0; i < XFS_BTREE_MAXLEVELS; i++) { in xfs_bmap_get_bp()
