Lines Matching refs:ARCH_CONVERT
103 return (int)XFS_ALLOC_BLOCK_MAXRECS(INT_GET(block->bb_h.bb_level, ARCH_CONVERT), cur); in xfs_btree_maxrecs()
105 return (int)XFS_BMAP_BLOCK_IMAXRECS(INT_GET(block->bb_h.bb_level, ARCH_CONVERT), cur); in xfs_btree_maxrecs()
107 return (int)XFS_INOBT_BLOCK_MAXRECS(INT_GET(block->bb_h.bb_level, ARCH_CONVERT), cur); in xfs_btree_maxrecs()
153 ASSERT(INT_GET(k1->ar_startblock, ARCH_CONVERT) < INT_GET(k2->ar_startblock, ARCH_CONVERT)); in xfs_btree_check_key()
162 ASSERT(INT_GET(k1->ar_blockcount, ARCH_CONVERT) < INT_GET(k2->ar_blockcount, ARCH_CONVERT) || in xfs_btree_check_key()
163 (INT_GET(k1->ar_blockcount, ARCH_CONVERT) == INT_GET(k2->ar_blockcount, ARCH_CONVERT) && in xfs_btree_check_key()
164 INT_GET(k1->ar_startblock, ARCH_CONVERT) < INT_GET(k2->ar_startblock, ARCH_CONVERT))); in xfs_btree_check_key()
173 ASSERT(INT_GET(k1->br_startoff, ARCH_CONVERT) < INT_GET(k2->br_startoff, ARCH_CONVERT)); in xfs_btree_check_key()
182 ASSERT(INT_GET(k1->ir_startino, ARCH_CONVERT) < INT_GET(k2->ir_startino, ARCH_CONVERT)); in xfs_btree_check_key()
207 INT_GET(block->bb_magic, ARCH_CONVERT) == xfs_magics[cur->bc_btnum] && in xfs_btree_check_lblock()
208 INT_GET(block->bb_level, ARCH_CONVERT) == level && in xfs_btree_check_lblock()
209 INT_GET(block->bb_numrecs, ARCH_CONVERT) <= in xfs_btree_check_lblock()
211 !INT_ISZERO(block->bb_leftsib, ARCH_CONVERT) && in xfs_btree_check_lblock()
212 (INT_GET(block->bb_leftsib, ARCH_CONVERT) == NULLDFSBNO || in xfs_btree_check_lblock()
213 XFS_FSB_SANITY_CHECK(mp, INT_GET(block->bb_leftsib, ARCH_CONVERT))) && in xfs_btree_check_lblock()
214 !INT_ISZERO(block->bb_rightsib, ARCH_CONVERT) && in xfs_btree_check_lblock()
215 (INT_GET(block->bb_rightsib, ARCH_CONVERT) == NULLDFSBNO || in xfs_btree_check_lblock()
216 XFS_FSB_SANITY_CHECK(mp, INT_GET(block->bb_rightsib, ARCH_CONVERT))); in xfs_btree_check_lblock()
264 ASSERT(INT_GET(r1->ar_startblock, ARCH_CONVERT) + INT_GET(r1->ar_blockcount, ARCH_CONVERT) <= in xfs_btree_check_rec()
265 INT_GET(r2->ar_startblock, ARCH_CONVERT)); in xfs_btree_check_rec()
274 ASSERT(INT_GET(r1->ar_blockcount, ARCH_CONVERT) < INT_GET(r2->ar_blockcount, ARCH_CONVERT) || in xfs_btree_check_rec()
275 (INT_GET(r1->ar_blockcount, ARCH_CONVERT) == INT_GET(r2->ar_blockcount, ARCH_CONVERT) && in xfs_btree_check_rec()
276 INT_GET(r1->ar_startblock, ARCH_CONVERT) < INT_GET(r2->ar_startblock, ARCH_CONVERT))); in xfs_btree_check_rec()
296 ASSERT(INT_GET(r1->ir_startino, ARCH_CONVERT) + XFS_INODES_PER_CHUNK <= in xfs_btree_check_rec()
297 INT_GET(r2->ir_startino, ARCH_CONVERT)); in xfs_btree_check_rec()
324 agflen = INT_GET(agf->agf_length, ARCH_CONVERT); in xfs_btree_check_sblock()
326 INT_GET(block->bb_magic, ARCH_CONVERT) == xfs_magics[cur->bc_btnum] && in xfs_btree_check_sblock()
327 INT_GET(block->bb_level, ARCH_CONVERT) == level && in xfs_btree_check_sblock()
328 INT_GET(block->bb_numrecs, ARCH_CONVERT) <= in xfs_btree_check_sblock()
330 (INT_GET(block->bb_leftsib, ARCH_CONVERT) == NULLAGBLOCK || in xfs_btree_check_sblock()
331 INT_GET(block->bb_leftsib, ARCH_CONVERT) < agflen) && in xfs_btree_check_sblock()
332 !INT_ISZERO(block->bb_leftsib, ARCH_CONVERT) && in xfs_btree_check_sblock()
333 (INT_GET(block->bb_rightsib, ARCH_CONVERT) == NULLAGBLOCK || in xfs_btree_check_sblock()
334 INT_GET(block->bb_rightsib, ARCH_CONVERT) < agflen) && in xfs_btree_check_sblock()
335 !INT_ISZERO(block->bb_rightsib, ARCH_CONVERT); in xfs_btree_check_sblock()
365 ptr < INT_GET(agf->agf_length, ARCH_CONVERT)); in xfs_btree_check_sptr()
487 if (INT_ISZERO(block->bb_h.bb_numrecs, ARCH_CONVERT)) in xfs_btree_firstrec()
604 nlevels = INT_GET(agf->agf_levels[btnum], ARCH_CONVERT); in xfs_btree_init_cursor()
608 nlevels = INT_GET(ifp->if_broot->bb_level, ARCH_CONVERT) + 1; in xfs_btree_init_cursor()
612 nlevels = INT_GET(agi->agi_level, ARCH_CONVERT); in xfs_btree_init_cursor()
676 return INT_GET(block->bb_u.l.bb_rightsib, ARCH_CONVERT) == NULLDFSBNO; in xfs_btree_islastblock()
678 return INT_GET(block->bb_u.s.bb_rightsib, ARCH_CONVERT) == NULLAGBLOCK; in xfs_btree_islastblock()
701 if (INT_ISZERO(block->bb_h.bb_numrecs, ARCH_CONVERT)) in xfs_btree_lastrec()
706 cur->bc_ptrs[level] = INT_GET(block->bb_h.bb_numrecs, ARCH_CONVERT); in xfs_btree_lastrec()
876 if ((lr & XFS_BTCUR_LEFTRA) && INT_GET(a->bb_leftsib, ARCH_CONVERT) != NULLAGBLOCK) { in xfs_btree_readahead_core()
878 INT_GET(a->bb_leftsib, ARCH_CONVERT), 1); in xfs_btree_readahead_core()
881 if ((lr & XFS_BTCUR_RIGHTRA) && INT_GET(a->bb_rightsib, ARCH_CONVERT) != NULLAGBLOCK) { in xfs_btree_readahead_core()
883 INT_GET(a->bb_rightsib, ARCH_CONVERT), 1); in xfs_btree_readahead_core()
889 if ((lr & XFS_BTCUR_LEFTRA) && INT_GET(b->bb_leftsib, ARCH_CONVERT) != NULLDFSBNO) { in xfs_btree_readahead_core()
890 xfs_btree_reada_bufl(cur->bc_mp, INT_GET(b->bb_leftsib, ARCH_CONVERT), 1); in xfs_btree_readahead_core()
893 if ((lr & XFS_BTCUR_RIGHTRA) && INT_GET(b->bb_rightsib, ARCH_CONVERT) != NULLDFSBNO) { in xfs_btree_readahead_core()
894 xfs_btree_reada_bufl(cur->bc_mp, INT_GET(b->bb_rightsib, ARCH_CONVERT), 1); in xfs_btree_readahead_core()
900 if ((lr & XFS_BTCUR_LEFTRA) && INT_GET(i->bb_leftsib, ARCH_CONVERT) != NULLAGBLOCK) { in xfs_btree_readahead_core()
902 INT_GET(i->bb_leftsib, ARCH_CONVERT), 1); in xfs_btree_readahead_core()
905 if ((lr & XFS_BTCUR_RIGHTRA) && INT_GET(i->bb_rightsib, ARCH_CONVERT) != NULLAGBLOCK) { in xfs_btree_readahead_core()
907 INT_GET(i->bb_rightsib, ARCH_CONVERT), 1); in xfs_btree_readahead_core()
939 if (INT_GET(b->bb_u.l.bb_leftsib, ARCH_CONVERT) == NULLDFSBNO) in xfs_btree_setbuf()
941 if (INT_GET(b->bb_u.l.bb_rightsib, ARCH_CONVERT) == NULLDFSBNO) in xfs_btree_setbuf()
944 if (INT_GET(b->bb_u.s.bb_leftsib, ARCH_CONVERT) == NULLAGBLOCK) in xfs_btree_setbuf()
946 if (INT_GET(b->bb_u.s.bb_rightsib, ARCH_CONVERT) == NULLAGBLOCK) in xfs_btree_setbuf()