Searched refs:XFS_BTREE_MAXLEVELS (Results 1 – 9 of 9) sorted by relevance
43 union xfs_btree_key lastkey[XFS_BTREE_MAXLEVELS];44 bool firstkey[XFS_BTREE_MAXLEVELS];
558 if (level <= 0 || level > XFS_BTREE_MAXLEVELS) in xchk_agf()562 if (level <= 0 || level > XFS_BTREE_MAXLEVELS) in xchk_agf()571 if (level <= 0 || level > XFS_BTREE_MAXLEVELS) in xchk_agf()581 if (level <= 0 || level > XFS_BTREE_MAXLEVELS) in xchk_agf()883 if (level <= 0 || level > XFS_BTREE_MAXLEVELS) in xchk_agi()892 if (level <= 0 || level > XFS_BTREE_MAXLEVELS) in xchk_agi()
650 for (i = 0; i < XFS_BTREE_MAXLEVELS; i++) in xchk_btree()655 if (cur->bc_nlevels > XFS_BTREE_MAXLEVELS) { in xchk_btree()
125 fab->height <= XFS_BTREE_MAXLEVELS; in xrep_check_btree_root()
95 #define XFS_BTREE_MAXLEVELS 9 /* max of all btrees */ macro226 struct xfs_buf *bc_bufs[XFS_BTREE_MAXLEVELS]; /* buf ptr per level */227 int bc_ptrs[XFS_BTREE_MAXLEVELS]; /* key/record # */228 uint8_t bc_ra[XFS_BTREE_MAXLEVELS]; /* readahead bits */
660 cur->bc_nlevels = XFS_BTREE_MAXLEVELS - 1; in xfs_btree_bload_compute_geometry()665 for (cur->bc_nlevels = 1; cur->bc_nlevels < XFS_BTREE_MAXLEVELS;) { in xfs_btree_bload_compute_geometry()727 if (cur->bc_nlevels == XFS_BTREE_MAXLEVELS) in xfs_btree_bload_compute_geometry()
94 return XFS_TEST_ERROR(avail < orig / 10 || avail < XFS_BTREE_MAXLEVELS, in xfs_ag_resv_critical()
562 mp->m_rmap_maxlevels = XFS_BTREE_MAXLEVELS; in xfs_rmapbt_compute_maxlevels()
242 for (i = 0; i < XFS_BTREE_MAXLEVELS; i++) { in xfs_bmap_get_bp()
