32 		      struct btrfs_path *path, int data_size, int extend);
3408 				      int data_size, int empty,  in __push_leaf_right()  argument
3435 		push_space += data_size;  in __push_leaf_right()
3453 			push_space += data_size;  in __push_leaf_right()
3556 			   int min_data_size, int data_size,  in push_leaf_right()  argument
3585 	if (free_space < data_size)  in push_leaf_right()
3595 	if (free_space < data_size)  in push_leaf_right()
3620 				     struct btrfs_path *path, int data_size,  in __push_leaf_left()  argument
3659 			push_space += data_size;  in __push_leaf_left()
3774 			  int data_size, int empty, u32 max_slot)  in push_leaf_left()  argument
3803 	if (free_space < data_size) {  in push_leaf_left()
3819 	if (free_space < data_size) {  in push_leaf_left()
3913 					  int data_size)  in push_for_double_split()  argument
3926 	ret = push_leaf_right(trans, root, path, 1, data_size, 0, slot);  in push_for_double_split()
3941 	if (btrfs_leaf_free_space(root, path->nodes[0]) >= data_size)  in push_for_double_split()
3946 	ret = push_leaf_left(trans, root, path, 1, data_size, 0, slot);  in push_for_double_split()
3967 			       struct btrfs_path *path, int data_size,  in split_leaf()  argument
3984 	if (extend && data_size + btrfs_item_size_nr(l, slot) +  in split_leaf()
3989 	if (data_size) {  in split_leaf()
3990 		wret = push_leaf_right(trans, root, path, data_size,  in split_leaf()
3991 				       data_size, 0, 0);  in split_leaf()
3995 			wret = push_leaf_left(trans, root, path, data_size,  in split_leaf()
3996 					      data_size, 0, (u32)-1);  in split_leaf()
4003 		if (btrfs_leaf_free_space(root, l) >= data_size)  in split_leaf()
4021 		    leaf_space_used(l, mid, nritems - mid) + data_size >  in split_leaf()
4029 				    data_size > BTRFS_LEAF_DATA_SIZE(root)) {  in split_leaf()
4030 					if (data_size && !tried_avoid_double)  in split_leaf()
4037 		if (leaf_space_used(l, 0, mid) + data_size >  in split_leaf()
4039 			if (!extend && data_size && slot == 0) {  in split_leaf()
4041 			} else if ((extend || !data_size) && slot == 0) {  in split_leaf()
4047 				    data_size > BTRFS_LEAF_DATA_SIZE(root)) {  in split_leaf()
4048 					if (data_size && !tried_avoid_double)  in split_leaf()
4119 	push_for_double_split(trans, root, path, data_size);  in split_leaf()
4121 	if (btrfs_leaf_free_space(root, path->nodes[0]) >= data_size)  in split_leaf()
4436 		       u32 data_size)  in btrfs_extend_item()  argument
4455 	if (btrfs_leaf_free_space(root, leaf) < data_size) {  in btrfs_extend_item()
4480 					    ioff - data_size, &token);  in btrfs_extend_item()
4485 		      data_end - data_size, btrfs_leaf_data(leaf) +  in btrfs_extend_item()
4491 	btrfs_set_item_size(leaf, item, old_size + data_size);  in btrfs_extend_item()
4506 			    struct btrfs_key *cpu_key, u32 *data_size,  in setup_items_for_insert()  argument
4572 					    data_end - data_size[i], &token);  in setup_items_for_insert()
4573 		data_end -= data_size[i];  in setup_items_for_insert()
4574 		btrfs_set_token_item_size(leaf, item, data_size[i], &token);  in setup_items_for_insert()
4599 			    struct btrfs_key *cpu_key, u32 *data_size,  in btrfs_insert_empty_items()  argument
4609 		total_data += data_size[i];  in btrfs_insert_empty_items()
4621 	setup_items_for_insert(root, path, cpu_key, data_size,  in btrfs_insert_empty_items()
4632 		      data_size)  in btrfs_insert_item()  argument
4642 	ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size);  in btrfs_insert_item()
4646 		write_extent_buffer(leaf, data, ptr, data_size);  in btrfs_insert_item()