22 		      int data_size, int extend);
3634 				      int data_size, int empty,  in __push_leaf_right()  argument
3660 		push_space += data_size;  in __push_leaf_right()
3679 			push_space += data_size;  in __push_leaf_right()
3783 			   int min_data_size, int data_size,  in push_leaf_right()  argument
3816 	if (free_space < data_size)  in push_leaf_right()
3826 	if (free_space < data_size)  in push_leaf_right()
3862 static noinline int __push_leaf_left(struct btrfs_path *path, int data_size,  in __push_leaf_left()  argument
3901 			push_space += data_size;  in __push_leaf_left()
4018 			  int data_size, int empty, u32 max_slot)  in push_leaf_left()  argument
4051 	if (free_space < data_size) {  in push_leaf_left()
4067 	if (free_space < data_size) {  in push_leaf_left()
4158 					  int data_size)  in push_for_double_split()  argument
4164 	int space_needed = data_size;  in push_for_double_split()
4189 	if (btrfs_leaf_free_space(path->nodes[0]) >= data_size)  in push_for_double_split()
4194 	space_needed = data_size;  in push_for_double_split()
4218 			       struct btrfs_path *path, int data_size,  in split_leaf()  argument
4236 	if (extend && data_size + btrfs_item_size_nr(l, slot) +  in split_leaf()
4241 	if (data_size && path->nodes[1]) {  in split_leaf()
4242 		int space_needed = data_size;  in split_leaf()
4252 			space_needed = data_size;  in split_leaf()
4263 		if (btrfs_leaf_free_space(l) >= data_size)  in split_leaf()
4281 		    leaf_space_used(l, mid, nritems - mid) + data_size >  in split_leaf()
4289 				    data_size > BTRFS_LEAF_DATA_SIZE(fs_info)) {  in split_leaf()
4290 					if (data_size && !tried_avoid_double)  in split_leaf()
4297 		if (leaf_space_used(l, 0, mid) + data_size >  in split_leaf()
4299 			if (!extend && data_size && slot == 0) {  in split_leaf()
4301 			} else if ((extend || !data_size) && slot == 0) {  in split_leaf()
4307 				    data_size > BTRFS_LEAF_DATA_SIZE(fs_info)) {  in split_leaf()
4308 					if (data_size && !tried_avoid_double)  in split_leaf()
4368 	push_for_double_split(trans, root, path, data_size);  in split_leaf()
4370 	if (btrfs_leaf_free_space(path->nodes[0]) >= data_size)  in split_leaf()
4681 void btrfs_extend_item(struct btrfs_path *path, u32 data_size)  in btrfs_extend_item()  argument
4698 	if (btrfs_leaf_free_space(leaf) < data_size) {  in btrfs_extend_item()
4724 					    ioff - data_size, &token);  in btrfs_extend_item()
4729 		      data_end - data_size, BTRFS_LEAF_DATA_OFFSET +  in btrfs_extend_item()
4735 	btrfs_set_item_size(leaf, item, old_size + data_size);  in btrfs_extend_item()
4750 			    const struct btrfs_key *cpu_key, u32 *data_size,  in setup_items_for_insert()  argument
4822 					    data_end - data_size[i], &token);  in setup_items_for_insert()
4823 		data_end -= data_size[i];  in setup_items_for_insert()
4824 		btrfs_set_token_item_size(leaf, item, data_size[i], &token);  in setup_items_for_insert()
4843 			    const struct btrfs_key *cpu_key, u32 *data_size,  in btrfs_insert_empty_items()  argument
4853 		total_data += data_size[i];  in btrfs_insert_empty_items()
4865 	setup_items_for_insert(root, path, cpu_key, data_size,  in btrfs_insert_empty_items()
4876 		      u32 data_size)  in btrfs_insert_item()  argument
4886 	ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size);  in btrfs_insert_item()
4890 		write_extent_buffer(leaf, data, ptr, data_size);  in btrfs_insert_item()