32 		      struct btrfs_path *path, int data_size, int extend);
3595 				      int data_size, int empty,  in __push_leaf_right()  argument
3622 		push_space += data_size;  in __push_leaf_right()
3640 			push_space += data_size;  in __push_leaf_right()
3743 			   int min_data_size, int data_size,  in push_leaf_right()  argument
3772 	if (free_space < data_size)  in push_leaf_right()
3782 	if (free_space < data_size)  in push_leaf_right()
3820 				     struct btrfs_path *path, int data_size,  in __push_leaf_left()  argument
3859 			push_space += data_size;  in __push_leaf_left()
3973 			  int data_size, int empty, u32 max_slot)  in push_leaf_left()  argument
4002 	if (free_space < data_size) {  in push_leaf_left()
4018 	if (free_space < data_size) {  in push_leaf_left()
4112 					  int data_size)  in push_for_double_split()  argument
4118 	int space_needed = data_size;  in push_for_double_split()
4143 	if (btrfs_leaf_free_space(root, path->nodes[0]) >= data_size)  in push_for_double_split()
4169 			       struct btrfs_path *path, int data_size,  in split_leaf()  argument
4187 	if (extend && data_size + btrfs_item_size_nr(l, slot) +  in split_leaf()
4192 	if (data_size && path->nodes[1]) {  in split_leaf()
4193 		int space_needed = data_size;  in split_leaf()
4211 		if (btrfs_leaf_free_space(root, l) >= data_size)  in split_leaf()
4229 		    leaf_space_used(l, mid, nritems - mid) + data_size >  in split_leaf()
4237 				    data_size > BTRFS_LEAF_DATA_SIZE(root)) {  in split_leaf()
4238 					if (data_size && !tried_avoid_double)  in split_leaf()
4245 		if (leaf_space_used(l, 0, mid) + data_size >  in split_leaf()
4247 			if (!extend && data_size && slot == 0) {  in split_leaf()
4249 			} else if ((extend || !data_size) && slot == 0) {  in split_leaf()
4255 				    data_size > BTRFS_LEAF_DATA_SIZE(root)) {  in split_leaf()
4256 					if (data_size && !tried_avoid_double)  in split_leaf()
4325 	push_for_double_split(trans, root, path, data_size);  in split_leaf()
4327 	if (btrfs_leaf_free_space(root, path->nodes[0]) >= data_size)  in split_leaf()
4643 		       u32 data_size)  in btrfs_extend_item()  argument
4662 	if (btrfs_leaf_free_space(root, leaf) < data_size) {  in btrfs_extend_item()
4687 					    ioff - data_size, &token);  in btrfs_extend_item()
4692 		      data_end - data_size, btrfs_leaf_data(leaf) +  in btrfs_extend_item()
4698 	btrfs_set_item_size(leaf, item, old_size + data_size);  in btrfs_extend_item()
4713 			    struct btrfs_key *cpu_key, u32 *data_size,  in setup_items_for_insert()  argument
4785 					    data_end - data_size[i], &token);  in setup_items_for_insert()
4786 		data_end -= data_size[i];  in setup_items_for_insert()
4787 		btrfs_set_token_item_size(leaf, item, data_size[i], &token);  in setup_items_for_insert()
4806 			    struct btrfs_key *cpu_key, u32 *data_size,  in btrfs_insert_empty_items()  argument
4816 		total_data += data_size[i];  in btrfs_insert_empty_items()
4828 	setup_items_for_insert(root, path, cpu_key, data_size,  in btrfs_insert_empty_items()
4839 		      data_size)  in btrfs_insert_item()  argument
4849 	ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size);  in btrfs_insert_item()
4853 		write_extent_buffer(leaf, data, ptr, data_size);  in btrfs_insert_item()