23 		      int data_size, int extend);
2754 				      int data_size, int empty,  in __push_leaf_right()  argument
2780 		push_space += data_size;  in __push_leaf_right()
2799 			push_space += data_size;  in __push_leaf_right()
2903 			   int min_data_size, int data_size,  in push_leaf_right()  argument
2935 	if (free_space < data_size)  in push_leaf_right()
2945 	if (free_space < data_size)  in push_leaf_right()
2988 static noinline int __push_leaf_left(struct btrfs_path *path, int data_size,  in __push_leaf_left()  argument
3027 			push_space += data_size;  in __push_leaf_left()
3142 			  int data_size, int empty, u32 max_slot)  in push_leaf_left()  argument
3174 	if (free_space < data_size) {  in push_leaf_left()
3191 	if (free_space < data_size) {  in push_leaf_left()
3286 					  int data_size)  in push_for_double_split()  argument
3292 	int space_needed = data_size;  in push_for_double_split()
3317 	if (btrfs_leaf_free_space(path->nodes[0]) >= data_size)  in push_for_double_split()
3322 	space_needed = data_size;  in push_for_double_split()
3346 			       struct btrfs_path *path, int data_size,  in split_leaf()  argument
3364 	if (extend && data_size + btrfs_item_size_nr(l, slot) +  in split_leaf()
3369 	if (data_size && path->nodes[1]) {  in split_leaf()
3370 		int space_needed = data_size;  in split_leaf()
3380 			space_needed = data_size;  in split_leaf()
3391 		if (btrfs_leaf_free_space(l) >= data_size)  in split_leaf()
3409 		    leaf_space_used(l, mid, nritems - mid) + data_size >  in split_leaf()
3417 				    data_size > BTRFS_LEAF_DATA_SIZE(fs_info)) {  in split_leaf()
3418 					if (data_size && !tried_avoid_double)  in split_leaf()
3425 		if (leaf_space_used(l, 0, mid) + data_size >  in split_leaf()
3427 			if (!extend && data_size && slot == 0) {  in split_leaf()
3429 			} else if ((extend || !data_size) && slot == 0) {  in split_leaf()
3435 				    data_size > BTRFS_LEAF_DATA_SIZE(fs_info)) {  in split_leaf()
3436 					if (data_size && !tried_avoid_double)  in split_leaf()
3506 	push_for_double_split(trans, root, path, data_size);  in split_leaf()
3508 	if (btrfs_leaf_free_space(path->nodes[0]) >= data_size)  in split_leaf()
3813 void btrfs_extend_item(struct btrfs_path *path, u32 data_size)  in btrfs_extend_item()  argument
3830 	if (btrfs_leaf_free_space(leaf) < data_size) {  in btrfs_extend_item()
3855 		btrfs_set_token_item_offset(&token, item, ioff - data_size);  in btrfs_extend_item()
3860 		      data_end - data_size, BTRFS_LEAF_DATA_OFFSET +  in btrfs_extend_item()
3866 	btrfs_set_item_size(leaf, item, old_size + data_size);  in btrfs_extend_item()
3887 			    const struct btrfs_key *cpu_key, u32 *data_size,  in setup_items_for_insert()  argument
3903 		total_data += data_size[i];  in setup_items_for_insert()
3965 		data_end -= data_size[i];  in setup_items_for_insert()
3967 		btrfs_set_token_item_size(&token, item, data_size[i]);  in setup_items_for_insert()
3986 			    const struct btrfs_key *cpu_key, u32 *data_size,  in btrfs_insert_empty_items()  argument
3996 		total_data += data_size[i];  in btrfs_insert_empty_items()
4008 	setup_items_for_insert(root, path, cpu_key, data_size, nr);  in btrfs_insert_empty_items()
4018 		      u32 data_size)  in btrfs_insert_item()  argument
4028 	ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size);  in btrfs_insert_item()
4032 		write_extent_buffer(leaf, data, ptr, data_size);  in btrfs_insert_item()