Lines Matching defs:blocks
446 * If we are doing a BMBT update, the number of unaccounted blocks
516 * There are two types of blocks in the btree: leaf and non-leaf blocks.
521 * to the btree blocks at the previous level.
898 xfs_extlen_t count, /* count of filesystem blocks */
918 xfs_extlen_t count, /* count of filesystem blocks */
981 * Read-ahead btree blocks, at the given level.
1038 * Readahead @count btree blocks at the given @ptr location.
1186 /* owner is a 32 bit value on short blocks */
2921 * AGFs to allocate blocks. A task being run by the rescuer could attempt to
3013 * we can't just memcpy() the root in for CRC enabled btree blocks.
3115 * At the previous root level there are now two blocks: the old root,
3888 * tree balanced. Look at the left and right sibling blocks to
4221 * We combined blocks, so we have to update the parent keys if the
4270 * If we combined blocks as part of deleting the record, delrec won't
4365 * We only visit blocks once in this walk, so we have to avoid the
4442 * pointers so we can just walk all the blocks on each level from left to right
4647 * number of blocks needed to index the given number of leaf records.
4655 unsigned long long blocks = level_blocks;
4659 blocks += level_blocks;
4662 return blocks;
4666 * Given a number of available blocks for the btree to consume with records and
4672 * the number of blocks each node level consumes until we no longer have space
4674 * blocks in the space, and there's no more free space to split the tree any
4855 * up to the leaf level to find more record blocks.
4999 xfs_extlen_t *blocks = data;
5000 (*blocks)++;
5005 /* Count the blocks in a btree and return the result in *blocks. */
5009 xfs_extlen_t *blocks)
5011 *blocks = 0;
5013 XFS_BTREE_VISIT_ALL, blocks);
5170 /* There are more record blocks. */