Lines Matching refs:block
37 * all other block types (i.e. metadata) are inserted when an extent is
47 * The tree is ordered by [ag block, owner, offset]. This is a large key size,
48 * but it is the only way to enforce unique keys when a block can be owned by
51 * reverse lookups will be to find the owner(s) of a particular block, or to
94 /* Allocate the new block from the freelist. If we can't, give up. */
319 struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp);
336 if (!xfs_verify_magic(bp, block->bb_magic))
345 level = be16_to_cpu(block->bb_level);
559 * Validate an in-memory rmap btree block. Callers are allowed to generate an
566 struct xfs_btree_block *block = XFS_BUF_TO_BLOCK(bp);
571 if (!xfs_verify_magic(bp, block->bb_magic))
578 level = be16_to_cpu(block->bb_level);
714 /* Calculate number of records in a reverse mapping btree block. */
727 * Calculate number of records in an rmap btree block.
753 * On a reflink filesystem, each AG block can have up to 2^32 (per the
780 * On a reflink filesystem, each AG block can have up to 2^32
793 * If there's no block sharing, compute the maximum rmapbt
794 * height assuming one rmap record per AG block.
863 /* Reserve 1% of the AG or enough for 1 block per record. */