gpio: rcar: Fix runtime PM imbalance on error
[linux/fpc-iii.git] / fs / btrfs / reflink.c
blobd1973141d3bb819ed90d7aaa43f67f470ef40e1e
1 // SPDX-License-Identifier: GPL-2.0
3 #include <linux/blkdev.h>
4 #include <linux/iversion.h>
5 #include "compression.h"
6 #include "ctree.h"
7 #include "delalloc-space.h"
8 #include "reflink.h"
9 #include "transaction.h"
11 #define BTRFS_MAX_DEDUPE_LEN SZ_16M
13 static int clone_finish_inode_update(struct btrfs_trans_handle *trans,
14 struct inode *inode,
15 u64 endoff,
16 const u64 destoff,
17 const u64 olen,
18 int no_time_update)
20 struct btrfs_root *root = BTRFS_I(inode)->root;
21 int ret;
23 inode_inc_iversion(inode);
24 if (!no_time_update)
25 inode->i_mtime = inode->i_ctime = current_time(inode);
27 * We round up to the block size at eof when determining which
28 * extents to clone above, but shouldn't round up the file size.
30 if (endoff > destoff + olen)
31 endoff = destoff + olen;
32 if (endoff > inode->i_size) {
33 i_size_write(inode, endoff);
34 btrfs_inode_safe_disk_i_size_write(inode, 0);
37 ret = btrfs_update_inode(trans, root, inode);
38 if (ret) {
39 btrfs_abort_transaction(trans, ret);
40 btrfs_end_transaction(trans);
41 goto out;
43 ret = btrfs_end_transaction(trans);
44 out:
45 return ret;
48 static int copy_inline_to_page(struct inode *inode,
49 const u64 file_offset,
50 char *inline_data,
51 const u64 size,
52 const u64 datal,
53 const u8 comp_type)
55 const u64 block_size = btrfs_inode_sectorsize(inode);
56 const u64 range_end = file_offset + block_size - 1;
57 const size_t inline_size = size - btrfs_file_extent_calc_inline_size(0);
58 char *data_start = inline_data + btrfs_file_extent_calc_inline_size(0);
59 struct extent_changeset *data_reserved = NULL;
60 struct page *page = NULL;
61 int ret;
63 ASSERT(IS_ALIGNED(file_offset, block_size));
66 * We have flushed and locked the ranges of the source and destination
67 * inodes, we also have locked the inodes, so we are safe to do a
68 * reservation here. Also we must not do the reservation while holding
69 * a transaction open, otherwise we would deadlock.
71 ret = btrfs_delalloc_reserve_space(inode, &data_reserved, file_offset,
72 block_size);
73 if (ret)
74 goto out;
76 page = find_or_create_page(inode->i_mapping, file_offset >> PAGE_SHIFT,
77 btrfs_alloc_write_mask(inode->i_mapping));
78 if (!page) {
79 ret = -ENOMEM;
80 goto out_unlock;
83 set_page_extent_mapped(page);
84 clear_extent_bit(&BTRFS_I(inode)->io_tree, file_offset, range_end,
85 EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING | EXTENT_DEFRAG,
86 0, 0, NULL);
87 ret = btrfs_set_extent_delalloc(inode, file_offset, range_end, 0, NULL);
88 if (ret)
89 goto out_unlock;
91 if (comp_type == BTRFS_COMPRESS_NONE) {
92 char *map;
94 map = kmap(page);
95 memcpy(map, data_start, datal);
96 flush_dcache_page(page);
97 kunmap(page);
98 } else {
99 ret = btrfs_decompress(comp_type, data_start, page, 0,
100 inline_size, datal);
101 if (ret)
102 goto out_unlock;
103 flush_dcache_page(page);
107 * If our inline data is smaller then the block/page size, then the
108 * remaining of the block/page is equivalent to zeroes. We had something
109 * like the following done:
111 * $ xfs_io -f -c "pwrite -S 0xab 0 500" file
112 * $ sync # (or fsync)
113 * $ xfs_io -c "falloc 0 4K" file
114 * $ xfs_io -c "pwrite -S 0xcd 4K 4K"
116 * So what's in the range [500, 4095] corresponds to zeroes.
118 if (datal < block_size) {
119 char *map;
121 map = kmap(page);
122 memset(map + datal, 0, block_size - datal);
123 flush_dcache_page(page);
124 kunmap(page);
127 SetPageUptodate(page);
128 ClearPageChecked(page);
129 set_page_dirty(page);
130 out_unlock:
131 if (page) {
132 unlock_page(page);
133 put_page(page);
135 if (ret)
136 btrfs_delalloc_release_space(inode, data_reserved, file_offset,
137 block_size, true);
138 btrfs_delalloc_release_extents(BTRFS_I(inode), block_size);
139 out:
140 extent_changeset_free(data_reserved);
142 return ret;
146 * Deal with cloning of inline extents. We try to copy the inline extent from
147 * the source inode to destination inode when possible. When not possible we
148 * copy the inline extent's data into the respective page of the inode.
150 static int clone_copy_inline_extent(struct inode *dst,
151 struct btrfs_path *path,
152 struct btrfs_key *new_key,
153 const u64 drop_start,
154 const u64 datal,
155 const u64 size,
156 const u8 comp_type,
157 char *inline_data,
158 struct btrfs_trans_handle **trans_out)
160 struct btrfs_fs_info *fs_info = btrfs_sb(dst->i_sb);
161 struct btrfs_root *root = BTRFS_I(dst)->root;
162 const u64 aligned_end = ALIGN(new_key->offset + datal,
163 fs_info->sectorsize);
164 struct btrfs_trans_handle *trans = NULL;
165 int ret;
166 struct btrfs_key key;
168 if (new_key->offset > 0) {
169 ret = copy_inline_to_page(dst, new_key->offset, inline_data,
170 size, datal, comp_type);
171 goto out;
174 key.objectid = btrfs_ino(BTRFS_I(dst));
175 key.type = BTRFS_EXTENT_DATA_KEY;
176 key.offset = 0;
177 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
178 if (ret < 0) {
179 return ret;
180 } else if (ret > 0) {
181 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) {
182 ret = btrfs_next_leaf(root, path);
183 if (ret < 0)
184 return ret;
185 else if (ret > 0)
186 goto copy_inline_extent;
188 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
189 if (key.objectid == btrfs_ino(BTRFS_I(dst)) &&
190 key.type == BTRFS_EXTENT_DATA_KEY) {
192 * There's an implicit hole at file offset 0, copy the
193 * inline extent's data to the page.
195 ASSERT(key.offset > 0);
196 ret = copy_inline_to_page(dst, new_key->offset,
197 inline_data, size, datal,
198 comp_type);
199 goto out;
201 } else if (i_size_read(dst) <= datal) {
202 struct btrfs_file_extent_item *ei;
204 ei = btrfs_item_ptr(path->nodes[0], path->slots[0],
205 struct btrfs_file_extent_item);
207 * If it's an inline extent replace it with the source inline
208 * extent, otherwise copy the source inline extent data into
209 * the respective page at the destination inode.
211 if (btrfs_file_extent_type(path->nodes[0], ei) ==
212 BTRFS_FILE_EXTENT_INLINE)
213 goto copy_inline_extent;
215 ret = copy_inline_to_page(dst, new_key->offset, inline_data,
216 size, datal, comp_type);
217 goto out;
220 copy_inline_extent:
221 ret = 0;
223 * We have no extent items, or we have an extent at offset 0 which may
224 * or may not be inlined. All these cases are dealt the same way.
226 if (i_size_read(dst) > datal) {
228 * At the destination offset 0 we have either a hole, a regular
229 * extent or an inline extent larger then the one we want to
230 * clone. Deal with all these cases by copying the inline extent
231 * data into the respective page at the destination inode.
233 ret = copy_inline_to_page(dst, new_key->offset, inline_data,
234 size, datal, comp_type);
235 goto out;
238 btrfs_release_path(path);
240 * If we end up here it means were copy the inline extent into a leaf
241 * of the destination inode. We know we will drop or adjust at most one
242 * extent item in the destination root.
244 * 1 unit - adjusting old extent (we may have to split it)
245 * 1 unit - add new extent
246 * 1 unit - inode update
248 trans = btrfs_start_transaction(root, 3);
249 if (IS_ERR(trans)) {
250 ret = PTR_ERR(trans);
251 trans = NULL;
252 goto out;
254 ret = btrfs_drop_extents(trans, root, dst, drop_start, aligned_end, 1);
255 if (ret)
256 goto out;
257 ret = btrfs_insert_empty_item(trans, root, path, new_key, size);
258 if (ret)
259 goto out;
261 write_extent_buffer(path->nodes[0], inline_data,
262 btrfs_item_ptr_offset(path->nodes[0],
263 path->slots[0]),
264 size);
265 inode_add_bytes(dst, datal);
266 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC, &BTRFS_I(dst)->runtime_flags);
267 out:
268 if (!ret && !trans) {
270 * No transaction here means we copied the inline extent into a
271 * page of the destination inode.
273 * 1 unit to update inode item
275 trans = btrfs_start_transaction(root, 1);
276 if (IS_ERR(trans)) {
277 ret = PTR_ERR(trans);
278 trans = NULL;
281 if (ret && trans) {
282 btrfs_abort_transaction(trans, ret);
283 btrfs_end_transaction(trans);
285 if (!ret)
286 *trans_out = trans;
288 return ret;
292 * btrfs_clone() - clone a range from inode file to another
294 * @src: Inode to clone from
295 * @inode: Inode to clone to
296 * @off: Offset within source to start clone from
297 * @olen: Original length, passed by user, of range to clone
298 * @olen_aligned: Block-aligned value of olen
299 * @destoff: Offset within @inode to start clone
300 * @no_time_update: Whether to update mtime/ctime on the target inode
302 static int btrfs_clone(struct inode *src, struct inode *inode,
303 const u64 off, const u64 olen, const u64 olen_aligned,
304 const u64 destoff, int no_time_update)
306 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
307 struct btrfs_path *path = NULL;
308 struct extent_buffer *leaf;
309 struct btrfs_trans_handle *trans;
310 char *buf = NULL;
311 struct btrfs_key key;
312 u32 nritems;
313 int slot;
314 int ret;
315 const u64 len = olen_aligned;
316 u64 last_dest_end = destoff;
318 ret = -ENOMEM;
319 buf = kvmalloc(fs_info->nodesize, GFP_KERNEL);
320 if (!buf)
321 return ret;
323 path = btrfs_alloc_path();
324 if (!path) {
325 kvfree(buf);
326 return ret;
329 path->reada = READA_FORWARD;
330 /* Clone data */
331 key.objectid = btrfs_ino(BTRFS_I(src));
332 key.type = BTRFS_EXTENT_DATA_KEY;
333 key.offset = off;
335 while (1) {
336 u64 next_key_min_offset = key.offset + 1;
337 struct btrfs_file_extent_item *extent;
338 int type;
339 u32 size;
340 struct btrfs_key new_key;
341 u64 disko = 0, diskl = 0;
342 u64 datao = 0, datal = 0;
343 u8 comp;
344 u64 drop_start;
346 /* Note the key will change type as we walk through the tree */
347 path->leave_spinning = 1;
348 ret = btrfs_search_slot(NULL, BTRFS_I(src)->root, &key, path,
349 0, 0);
350 if (ret < 0)
351 goto out;
353 * First search, if no extent item that starts at offset off was
354 * found but the previous item is an extent item, it's possible
355 * it might overlap our target range, therefore process it.
357 if (key.offset == off && ret > 0 && path->slots[0] > 0) {
358 btrfs_item_key_to_cpu(path->nodes[0], &key,
359 path->slots[0] - 1);
360 if (key.type == BTRFS_EXTENT_DATA_KEY)
361 path->slots[0]--;
364 nritems = btrfs_header_nritems(path->nodes[0]);
365 process_slot:
366 if (path->slots[0] >= nritems) {
367 ret = btrfs_next_leaf(BTRFS_I(src)->root, path);
368 if (ret < 0)
369 goto out;
370 if (ret > 0)
371 break;
372 nritems = btrfs_header_nritems(path->nodes[0]);
374 leaf = path->nodes[0];
375 slot = path->slots[0];
377 btrfs_item_key_to_cpu(leaf, &key, slot);
378 if (key.type > BTRFS_EXTENT_DATA_KEY ||
379 key.objectid != btrfs_ino(BTRFS_I(src)))
380 break;
382 ASSERT(key.type == BTRFS_EXTENT_DATA_KEY);
384 extent = btrfs_item_ptr(leaf, slot,
385 struct btrfs_file_extent_item);
386 comp = btrfs_file_extent_compression(leaf, extent);
387 type = btrfs_file_extent_type(leaf, extent);
388 if (type == BTRFS_FILE_EXTENT_REG ||
389 type == BTRFS_FILE_EXTENT_PREALLOC) {
390 disko = btrfs_file_extent_disk_bytenr(leaf, extent);
391 diskl = btrfs_file_extent_disk_num_bytes(leaf, extent);
392 datao = btrfs_file_extent_offset(leaf, extent);
393 datal = btrfs_file_extent_num_bytes(leaf, extent);
394 } else if (type == BTRFS_FILE_EXTENT_INLINE) {
395 /* Take upper bound, may be compressed */
396 datal = btrfs_file_extent_ram_bytes(leaf, extent);
400 * The first search might have left us at an extent item that
401 * ends before our target range's start, can happen if we have
402 * holes and NO_HOLES feature enabled.
404 if (key.offset + datal <= off) {
405 path->slots[0]++;
406 goto process_slot;
407 } else if (key.offset >= off + len) {
408 break;
410 next_key_min_offset = key.offset + datal;
411 size = btrfs_item_size_nr(leaf, slot);
412 read_extent_buffer(leaf, buf, btrfs_item_ptr_offset(leaf, slot),
413 size);
415 btrfs_release_path(path);
416 path->leave_spinning = 0;
418 memcpy(&new_key, &key, sizeof(new_key));
419 new_key.objectid = btrfs_ino(BTRFS_I(inode));
420 if (off <= key.offset)
421 new_key.offset = key.offset + destoff - off;
422 else
423 new_key.offset = destoff;
426 * Deal with a hole that doesn't have an extent item that
427 * represents it (NO_HOLES feature enabled).
428 * This hole is either in the middle of the cloning range or at
429 * the beginning (fully overlaps it or partially overlaps it).
431 if (new_key.offset != last_dest_end)
432 drop_start = last_dest_end;
433 else
434 drop_start = new_key.offset;
436 if (type == BTRFS_FILE_EXTENT_REG ||
437 type == BTRFS_FILE_EXTENT_PREALLOC) {
438 struct btrfs_clone_extent_info clone_info;
441 * a | --- range to clone ---| b
442 * | ------------- extent ------------- |
445 /* Subtract range b */
446 if (key.offset + datal > off + len)
447 datal = off + len - key.offset;
449 /* Subtract range a */
450 if (off > key.offset) {
451 datao += off - key.offset;
452 datal -= off - key.offset;
455 clone_info.disk_offset = disko;
456 clone_info.disk_len = diskl;
457 clone_info.data_offset = datao;
458 clone_info.data_len = datal;
459 clone_info.file_offset = new_key.offset;
460 clone_info.extent_buf = buf;
461 clone_info.item_size = size;
462 ret = btrfs_punch_hole_range(inode, path, drop_start,
463 new_key.offset + datal - 1, &clone_info,
464 &trans);
465 if (ret)
466 goto out;
467 } else if (type == BTRFS_FILE_EXTENT_INLINE) {
469 * Inline extents always have to start at file offset 0
470 * and can never be bigger then the sector size. We can
471 * never clone only parts of an inline extent, since all
472 * reflink operations must start at a sector size aligned
473 * offset, and the length must be aligned too or end at
474 * the i_size (which implies the whole inlined data).
476 ASSERT(key.offset == 0);
477 ASSERT(datal <= fs_info->sectorsize);
478 if (key.offset != 0 || datal > fs_info->sectorsize)
479 return -EUCLEAN;
481 ret = clone_copy_inline_extent(inode, path, &new_key,
482 drop_start, datal, size,
483 comp, buf, &trans);
484 if (ret)
485 goto out;
488 btrfs_release_path(path);
490 last_dest_end = ALIGN(new_key.offset + datal,
491 fs_info->sectorsize);
492 ret = clone_finish_inode_update(trans, inode, last_dest_end,
493 destoff, olen, no_time_update);
494 if (ret)
495 goto out;
496 if (new_key.offset + datal >= destoff + len)
497 break;
499 btrfs_release_path(path);
500 key.offset = next_key_min_offset;
502 if (fatal_signal_pending(current)) {
503 ret = -EINTR;
504 goto out;
507 ret = 0;
509 if (last_dest_end < destoff + len) {
511 * We have an implicit hole that fully or partially overlaps our
512 * cloning range at its end. This means that we either have the
513 * NO_HOLES feature enabled or the implicit hole happened due to
514 * mixing buffered and direct IO writes against this file.
516 btrfs_release_path(path);
517 path->leave_spinning = 0;
519 ret = btrfs_punch_hole_range(inode, path, last_dest_end,
520 destoff + len - 1, NULL, &trans);
521 if (ret)
522 goto out;
524 ret = clone_finish_inode_update(trans, inode, destoff + len,
525 destoff, olen, no_time_update);
528 out:
529 btrfs_free_path(path);
530 kvfree(buf);
531 return ret;
534 static void btrfs_double_extent_unlock(struct inode *inode1, u64 loff1,
535 struct inode *inode2, u64 loff2, u64 len)
537 unlock_extent(&BTRFS_I(inode1)->io_tree, loff1, loff1 + len - 1);
538 unlock_extent(&BTRFS_I(inode2)->io_tree, loff2, loff2 + len - 1);
541 static void btrfs_double_extent_lock(struct inode *inode1, u64 loff1,
542 struct inode *inode2, u64 loff2, u64 len)
544 if (inode1 < inode2) {
545 swap(inode1, inode2);
546 swap(loff1, loff2);
547 } else if (inode1 == inode2 && loff2 < loff1) {
548 swap(loff1, loff2);
550 lock_extent(&BTRFS_I(inode1)->io_tree, loff1, loff1 + len - 1);
551 lock_extent(&BTRFS_I(inode2)->io_tree, loff2, loff2 + len - 1);
554 static int btrfs_extent_same_range(struct inode *src, u64 loff, u64 len,
555 struct inode *dst, u64 dst_loff)
557 const u64 bs = BTRFS_I(src)->root->fs_info->sb->s_blocksize;
558 int ret;
561 * Lock destination range to serialize with concurrent readpages() and
562 * source range to serialize with relocation.
564 btrfs_double_extent_lock(src, loff, dst, dst_loff, len);
565 ret = btrfs_clone(src, dst, loff, len, ALIGN(len, bs), dst_loff, 1);
566 btrfs_double_extent_unlock(src, loff, dst, dst_loff, len);
568 return ret;
571 static int btrfs_extent_same(struct inode *src, u64 loff, u64 olen,
572 struct inode *dst, u64 dst_loff)
574 int ret;
575 u64 i, tail_len, chunk_count;
576 struct btrfs_root *root_dst = BTRFS_I(dst)->root;
578 spin_lock(&root_dst->root_item_lock);
579 if (root_dst->send_in_progress) {
580 btrfs_warn_rl(root_dst->fs_info,
581 "cannot deduplicate to root %llu while send operations are using it (%d in progress)",
582 root_dst->root_key.objectid,
583 root_dst->send_in_progress);
584 spin_unlock(&root_dst->root_item_lock);
585 return -EAGAIN;
587 root_dst->dedupe_in_progress++;
588 spin_unlock(&root_dst->root_item_lock);
590 tail_len = olen % BTRFS_MAX_DEDUPE_LEN;
591 chunk_count = div_u64(olen, BTRFS_MAX_DEDUPE_LEN);
593 for (i = 0; i < chunk_count; i++) {
594 ret = btrfs_extent_same_range(src, loff, BTRFS_MAX_DEDUPE_LEN,
595 dst, dst_loff);
596 if (ret)
597 goto out;
599 loff += BTRFS_MAX_DEDUPE_LEN;
600 dst_loff += BTRFS_MAX_DEDUPE_LEN;
603 if (tail_len > 0)
604 ret = btrfs_extent_same_range(src, loff, tail_len, dst, dst_loff);
605 out:
606 spin_lock(&root_dst->root_item_lock);
607 root_dst->dedupe_in_progress--;
608 spin_unlock(&root_dst->root_item_lock);
610 return ret;
613 static noinline int btrfs_clone_files(struct file *file, struct file *file_src,
614 u64 off, u64 olen, u64 destoff)
616 struct inode *inode = file_inode(file);
617 struct inode *src = file_inode(file_src);
618 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
619 int ret;
620 int wb_ret;
621 u64 len = olen;
622 u64 bs = fs_info->sb->s_blocksize;
625 * VFS's generic_remap_file_range_prep() protects us from cloning the
626 * eof block into the middle of a file, which would result in corruption
627 * if the file size is not blocksize aligned. So we don't need to check
628 * for that case here.
630 if (off + len == src->i_size)
631 len = ALIGN(src->i_size, bs) - off;
633 if (destoff > inode->i_size) {
634 const u64 wb_start = ALIGN_DOWN(inode->i_size, bs);
636 ret = btrfs_cont_expand(inode, inode->i_size, destoff);
637 if (ret)
638 return ret;
640 * We may have truncated the last block if the inode's size is
641 * not sector size aligned, so we need to wait for writeback to
642 * complete before proceeding further, otherwise we can race
643 * with cloning and attempt to increment a reference to an
644 * extent that no longer exists (writeback completed right after
645 * we found the previous extent covering eof and before we
646 * attempted to increment its reference count).
648 ret = btrfs_wait_ordered_range(inode, wb_start,
649 destoff - wb_start);
650 if (ret)
651 return ret;
655 * Lock destination range to serialize with concurrent readpages() and
656 * source range to serialize with relocation.
658 btrfs_double_extent_lock(src, off, inode, destoff, len);
659 ret = btrfs_clone(src, inode, off, olen, len, destoff, 0);
660 btrfs_double_extent_unlock(src, off, inode, destoff, len);
663 * We may have copied an inline extent into a page of the destination
664 * range, so wait for writeback to complete before truncating pages
665 * from the page cache. This is a rare case.
667 wb_ret = btrfs_wait_ordered_range(inode, destoff, len);
668 ret = ret ? ret : wb_ret;
670 * Truncate page cache pages so that future reads will see the cloned
671 * data immediately and not the previous data.
673 truncate_inode_pages_range(&inode->i_data,
674 round_down(destoff, PAGE_SIZE),
675 round_up(destoff + len, PAGE_SIZE) - 1);
677 return ret;
680 static int btrfs_remap_file_range_prep(struct file *file_in, loff_t pos_in,
681 struct file *file_out, loff_t pos_out,
682 loff_t *len, unsigned int remap_flags)
684 struct inode *inode_in = file_inode(file_in);
685 struct inode *inode_out = file_inode(file_out);
686 u64 bs = BTRFS_I(inode_out)->root->fs_info->sb->s_blocksize;
687 bool same_inode = inode_out == inode_in;
688 u64 wb_len;
689 int ret;
691 if (!(remap_flags & REMAP_FILE_DEDUP)) {
692 struct btrfs_root *root_out = BTRFS_I(inode_out)->root;
694 if (btrfs_root_readonly(root_out))
695 return -EROFS;
697 if (file_in->f_path.mnt != file_out->f_path.mnt ||
698 inode_in->i_sb != inode_out->i_sb)
699 return -EXDEV;
702 /* Don't make the dst file partly checksummed */
703 if ((BTRFS_I(inode_in)->flags & BTRFS_INODE_NODATASUM) !=
704 (BTRFS_I(inode_out)->flags & BTRFS_INODE_NODATASUM)) {
705 return -EINVAL;
709 * Now that the inodes are locked, we need to start writeback ourselves
710 * and can not rely on the writeback from the VFS's generic helper
711 * generic_remap_file_range_prep() because:
713 * 1) For compression we must call filemap_fdatawrite_range() range
714 * twice (btrfs_fdatawrite_range() does it for us), and the generic
715 * helper only calls it once;
717 * 2) filemap_fdatawrite_range(), called by the generic helper only
718 * waits for the writeback to complete, i.e. for IO to be done, and
719 * not for the ordered extents to complete. We need to wait for them
720 * to complete so that new file extent items are in the fs tree.
722 if (*len == 0 && !(remap_flags & REMAP_FILE_DEDUP))
723 wb_len = ALIGN(inode_in->i_size, bs) - ALIGN_DOWN(pos_in, bs);
724 else
725 wb_len = ALIGN(*len, bs);
728 * Since we don't lock ranges, wait for ongoing lockless dio writes (as
729 * any in progress could create its ordered extents after we wait for
730 * existing ordered extents below).
732 inode_dio_wait(inode_in);
733 if (!same_inode)
734 inode_dio_wait(inode_out);
737 * Workaround to make sure NOCOW buffered write reach disk as NOCOW.
739 * Btrfs' back references do not have a block level granularity, they
740 * work at the whole extent level.
741 * NOCOW buffered write without data space reserved may not be able
742 * to fall back to CoW due to lack of data space, thus could cause
743 * data loss.
745 * Here we take a shortcut by flushing the whole inode, so that all
746 * nocow write should reach disk as nocow before we increase the
747 * reference of the extent. We could do better by only flushing NOCOW
748 * data, but that needs extra accounting.
750 * Also we don't need to check ASYNC_EXTENT, as async extent will be
751 * CoWed anyway, not affecting nocow part.
753 ret = filemap_flush(inode_in->i_mapping);
754 if (ret < 0)
755 return ret;
757 ret = btrfs_wait_ordered_range(inode_in, ALIGN_DOWN(pos_in, bs),
758 wb_len);
759 if (ret < 0)
760 return ret;
761 ret = btrfs_wait_ordered_range(inode_out, ALIGN_DOWN(pos_out, bs),
762 wb_len);
763 if (ret < 0)
764 return ret;
766 return generic_remap_file_range_prep(file_in, pos_in, file_out, pos_out,
767 len, remap_flags);
770 loff_t btrfs_remap_file_range(struct file *src_file, loff_t off,
771 struct file *dst_file, loff_t destoff, loff_t len,
772 unsigned int remap_flags)
774 struct inode *src_inode = file_inode(src_file);
775 struct inode *dst_inode = file_inode(dst_file);
776 bool same_inode = dst_inode == src_inode;
777 int ret;
779 if (remap_flags & ~(REMAP_FILE_DEDUP | REMAP_FILE_ADVISORY))
780 return -EINVAL;
782 if (same_inode)
783 inode_lock(src_inode);
784 else
785 lock_two_nondirectories(src_inode, dst_inode);
787 ret = btrfs_remap_file_range_prep(src_file, off, dst_file, destoff,
788 &len, remap_flags);
789 if (ret < 0 || len == 0)
790 goto out_unlock;
792 if (remap_flags & REMAP_FILE_DEDUP)
793 ret = btrfs_extent_same(src_inode, off, len, dst_inode, destoff);
794 else
795 ret = btrfs_clone_files(dst_file, src_file, off, len, destoff);
797 out_unlock:
798 if (same_inode)
799 inode_unlock(src_inode);
800 else
801 unlock_two_nondirectories(src_inode, dst_inode);
803 return ret < 0 ? ret : len;