Lines Matching defs:data_size
33 int data_size, int extend);
3235 int data_size, int empty,
3260 push_space += data_size;
3277 push_space += data_size;
3363 * least data_size bytes. returns zero if the push worked, nonzero otherwise
3373 int min_data_size, int data_size,
3401 if (free_space < data_size)
3443 * least data_size bytes. returns zero if the push worked, nonzero otherwise
3450 struct btrfs_path *path, int data_size,
3486 push_space += data_size;
3581 * least data_size bytes. returns zero if the push worked, nonzero otherwise
3589 int data_size, int empty, u32 max_slot)
3617 if (free_space < data_size) {
3646 * split the path's leaf in two, making sure there is at least data_size
3721 int data_size)
3727 int space_needed = data_size;
3752 if (btrfs_leaf_free_space(path->nodes[0]) >= data_size)
3757 space_needed = data_size;
3773 * split the path's leaf in two, making sure there is at least data_size
3781 struct btrfs_path *path, int data_size,
3799 if (extend && data_size + btrfs_item_size(l, slot) +
3804 if (data_size && path->nodes[1]) {
3805 int space_needed = data_size;
3815 space_needed = data_size;
3826 if (btrfs_leaf_free_space(l) >= data_size)
3844 leaf_space_used(l, mid, nritems - mid) + data_size >
3852 data_size > BTRFS_LEAF_DATA_SIZE(fs_info)) {
3853 if (data_size && !tried_avoid_double)
3860 if (leaf_space_used(l, 0, mid) + data_size >
3862 if (!extend && data_size && slot == 0) {
3864 } else if ((extend || !data_size) && slot == 0) {
3870 data_size > BTRFS_LEAF_DATA_SIZE(fs_info)) {
3871 if (data_size && !tried_avoid_double)
3956 push_for_double_split(trans, root, path, data_size);
3958 if (btrfs_leaf_free_space(path->nodes[0]) >= data_size)
4223 * make the item pointed to by the path bigger, data_size is the added size.
4226 struct btrfs_path *path, u32 data_size)
4242 if (btrfs_leaf_free_space(leaf) < data_size) {
4266 btrfs_set_token_item_offset(&token, i, ioff - data_size);
4270 memmove_leaf_data(leaf, data_end - data_size, data_end,
4275 btrfs_set_item_size(leaf, slot, old_size + data_size);
4390 * @data_size: The size of the data associated with the new key.
4396 u32 data_size)
4401 batch.data_sizes = &data_size;
4402 batch.total_data_size = data_size;
4441 u32 data_size)
4451 ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size);
4455 write_extent_buffer(leaf, data, ptr, data_size);