32 		      struct btrfs_path *path, int data_size, int extend);
3589 				      int data_size, int empty,  in __push_leaf_right()  argument
3616 		push_space += data_size;  in __push_leaf_right()
3634 			push_space += data_size;  in __push_leaf_right()
3737 			   int min_data_size, int data_size,  in push_leaf_right()  argument
3766 	if (free_space < data_size)  in push_leaf_right()
3776 	if (free_space < data_size)  in push_leaf_right()
3814 				     struct btrfs_path *path, int data_size,  in __push_leaf_left()  argument
3853 			push_space += data_size;  in __push_leaf_left()
3967 			  int data_size, int empty, u32 max_slot)  in push_leaf_left()  argument
3996 	if (free_space < data_size) {  in push_leaf_left()
4012 	if (free_space < data_size) {  in push_leaf_left()
4106 					  int data_size)  in push_for_double_split()  argument
4112 	int space_needed = data_size;  in push_for_double_split()
4137 	if (btrfs_leaf_free_space(root, path->nodes[0]) >= data_size)  in push_for_double_split()
4163 			       struct btrfs_path *path, int data_size,  in split_leaf()  argument
4181 	if (extend && data_size + btrfs_item_size_nr(l, slot) +  in split_leaf()
4186 	if (data_size && path->nodes[1]) {  in split_leaf()
4187 		int space_needed = data_size;  in split_leaf()
4205 		if (btrfs_leaf_free_space(root, l) >= data_size)  in split_leaf()
4223 		    leaf_space_used(l, mid, nritems - mid) + data_size >  in split_leaf()
4231 				    data_size > BTRFS_LEAF_DATA_SIZE(root)) {  in split_leaf()
4232 					if (data_size && !tried_avoid_double)  in split_leaf()
4239 		if (leaf_space_used(l, 0, mid) + data_size >  in split_leaf()
4241 			if (!extend && data_size && slot == 0) {  in split_leaf()
4243 			} else if ((extend || !data_size) && slot == 0) {  in split_leaf()
4249 				    data_size > BTRFS_LEAF_DATA_SIZE(root)) {  in split_leaf()
4250 					if (data_size && !tried_avoid_double)  in split_leaf()
4319 	push_for_double_split(trans, root, path, data_size);  in split_leaf()
4321 	if (btrfs_leaf_free_space(root, path->nodes[0]) >= data_size)  in split_leaf()
4637 		       u32 data_size)  in btrfs_extend_item()  argument
4656 	if (btrfs_leaf_free_space(root, leaf) < data_size) {  in btrfs_extend_item()
4681 					    ioff - data_size, &token);  in btrfs_extend_item()
4686 		      data_end - data_size, btrfs_leaf_data(leaf) +  in btrfs_extend_item()
4692 	btrfs_set_item_size(leaf, item, old_size + data_size);  in btrfs_extend_item()
4707 			    struct btrfs_key *cpu_key, u32 *data_size,  in setup_items_for_insert()  argument
4779 					    data_end - data_size[i], &token);  in setup_items_for_insert()
4780 		data_end -= data_size[i];  in setup_items_for_insert()
4781 		btrfs_set_token_item_size(leaf, item, data_size[i], &token);  in setup_items_for_insert()
4800 			    struct btrfs_key *cpu_key, u32 *data_size,  in btrfs_insert_empty_items()  argument
4810 		total_data += data_size[i];  in btrfs_insert_empty_items()
4822 	setup_items_for_insert(root, path, cpu_key, data_size,  in btrfs_insert_empty_items()
4833 		      data_size)  in btrfs_insert_item()  argument
4843 	ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size);  in btrfs_insert_item()
4847 		write_extent_buffer(leaf, data, ptr, data_size);  in btrfs_insert_item()