Lines Matching defs:data_size
22 int data_size, int extend);
3676 int data_size, int empty,
3702 push_space += data_size;
3721 push_space += data_size;
3815 * least data_size bytes. returns zero if the push worked, nonzero otherwise
3825 int min_data_size, int data_size,
3858 if (free_space < data_size)
3868 if (free_space < data_size)
3905 * least data_size bytes. returns zero if the push worked, nonzero otherwise
3911 static noinline int __push_leaf_left(struct btrfs_path *path, int data_size,
3950 push_space += data_size;
4057 * least data_size bytes. returns zero if the push worked, nonzero otherwise
4065 int data_size, int empty, u32 max_slot)
4098 if (free_space < data_size) {
4115 if (free_space < data_size) {
4135 * split the path's leaf in two, making sure there is at least data_size
4210 int data_size)
4216 int space_needed = data_size;
4241 if (btrfs_leaf_free_space(path->nodes[0]) >= data_size)
4246 space_needed = data_size;
4262 * split the path's leaf in two, making sure there is at least data_size
4270 struct btrfs_path *path, int data_size,
4288 if (extend && data_size + btrfs_item_size_nr(l, slot) +
4293 if (data_size && path->nodes[1]) {
4294 int space_needed = data_size;
4304 space_needed = data_size;
4315 if (btrfs_leaf_free_space(l) >= data_size)
4333 leaf_space_used(l, mid, nritems - mid) + data_size >
4341 data_size > BTRFS_LEAF_DATA_SIZE(fs_info)) {
4342 if (data_size && !tried_avoid_double)
4349 if (leaf_space_used(l, 0, mid) + data_size >
4351 if (!extend && data_size && slot == 0) {
4353 } else if ((extend || !data_size) && slot == 0) {
4359 data_size > BTRFS_LEAF_DATA_SIZE(fs_info)) {
4360 if (data_size && !tried_avoid_double)
4430 push_for_double_split(trans, root, path, data_size);
4432 if (btrfs_leaf_free_space(path->nodes[0]) >= data_size)
4738 * make the item pointed to by the path bigger, data_size is the added size.
4740 void btrfs_extend_item(struct btrfs_path *path, u32 data_size)
4757 if (btrfs_leaf_free_space(leaf) < data_size) {
4782 btrfs_set_token_item_offset(&token, item, ioff - data_size);
4787 data_end - data_size, BTRFS_LEAF_DATA_OFFSET +
4793 btrfs_set_item_size(leaf, item, old_size + data_size);
4810 * @data_size: size of the body of each item we are going to insert
4811 * @nr: size of @cpu_key/@data_size arrays
4814 const struct btrfs_key *cpu_key, u32 *data_size,
4830 total_data += data_size[i];
4892 data_end -= data_size[i];
4894 btrfs_set_token_item_size(&token, item, data_size[i]);
4913 const struct btrfs_key *cpu_key, u32 *data_size,
4923 total_data += data_size[i];
4935 setup_items_for_insert(root, path, cpu_key, data_size, nr);
4945 u32 data_size)
4955 ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size);
4959 write_extent_buffer(leaf, data, ptr, data_size);