BTRFS_LEAF_DATA_SIZE
ret = BTRFS_LEAF_DATA_SIZE(fs_info) - leaf_space_used(leaf, 0, nritems);
(unsigned long) BTRFS_LEAF_DATA_SIZE(fs_info),
BTRFS_LEAF_DATA_SIZE(fs_info) - data_end);
copy_leaf_data(right, left, BTRFS_LEAF_DATA_SIZE(fs_info) - push_space,
push_space = BTRFS_LEAF_DATA_SIZE(fs_info);
push_space = BTRFS_LEAF_DATA_SIZE(fs_info) -
ioff - (BTRFS_LEAF_DATA_SIZE(fs_info) - old_left_item_size));
BTRFS_LEAF_DATA_SIZE(fs_info) - push_space,
push_space = BTRFS_LEAF_DATA_SIZE(fs_info);
copy_leaf_data(right, l, BTRFS_LEAF_DATA_SIZE(fs_info) - data_copy_size,
rt_data_off = BTRFS_LEAF_DATA_SIZE(fs_info) - btrfs_item_data_end(l, mid);
sizeof(struct btrfs_item) > BTRFS_LEAF_DATA_SIZE(fs_info))
BTRFS_LEAF_DATA_SIZE(fs_info)) {
data_size > BTRFS_LEAF_DATA_SIZE(fs_info)) {
BTRFS_LEAF_DATA_SIZE(fs_info)) {
data_size > BTRFS_LEAF_DATA_SIZE(fs_info)) {
if (used < BTRFS_LEAF_DATA_SIZE(fs_info) / 3) {
return BTRFS_LEAF_DATA_SIZE(leaf->fs_info);
return BTRFS_LEAF_DATA_SIZE(info) - sizeof(struct btrfs_item);
return BTRFS_LEAF_DATA_SIZE(info) / sizeof(struct btrfs_key_ptr);
const unsigned int leaf_data_size = BTRFS_LEAF_DATA_SIZE(fs_info);
const int max_size = BTRFS_LEAF_DATA_SIZE(fs_info);
sizeof(struct btrfs_item) > BTRFS_LEAF_DATA_SIZE(root->fs_info)) {
end += BTRFS_LEAF_DATA_SIZE(eb->fs_info);
#define __MAX_CSUM_ITEMS(r, size) ((unsigned long)(((BTRFS_LEAF_DATA_SIZE(r) - \
#define BTRFS_MAX_EXTENT_ITEM_SIZE(r) ((BTRFS_LEAF_DATA_SIZE(r->fs_info) >> 4) - \
max_items = BTRFS_LEAF_DATA_SIZE(trans->fs_info) / sizeof(struct btrfs_item);
BTRFS_LEAF_DATA_SIZE(fs_info));
BTRFS_LEAF_DATA_SIZE(fs_info));
sizeof(*iref), BTRFS_LEAF_DATA_SIZE(leaf->fs_info));
item_end_expected = BTRFS_LEAF_DATA_SIZE(fs_info);
if (unlikely(item_data_end > BTRFS_LEAF_DATA_SIZE(fs_info))) {
item_data_end, BTRFS_LEAF_DATA_SIZE(fs_info));
const int leaf_data_size = BTRFS_LEAF_DATA_SIZE(trans->fs_info);
BTRFS_LEAF_DATA_SIZE(fs_info))