1 // SPDX-License-Identifier: GPL-2.0 1 // SPDX-License-Identifier: GPL-2.0
2 2
3 #include <linux/blkdev.h> 3 #include <linux/blkdev.h>
4 #include <linux/iversion.h> 4 #include <linux/iversion.h>
5 #include "ctree.h" 5 #include "ctree.h"
6 #include "fs.h" 6 #include "fs.h"
7 #include "messages.h" 7 #include "messages.h"
8 #include "compression.h" 8 #include "compression.h"
9 #include "delalloc-space.h" 9 #include "delalloc-space.h"
10 #include "disk-io.h" 10 #include "disk-io.h"
11 #include "reflink.h" 11 #include "reflink.h"
12 #include "transaction.h" 12 #include "transaction.h"
13 #include "subpage.h" 13 #include "subpage.h"
14 #include "accessors.h" 14 #include "accessors.h"
15 #include "file-item.h" 15 #include "file-item.h"
16 #include "file.h" 16 #include "file.h"
17 #include "super.h" 17 #include "super.h"
18 18
19 #define BTRFS_MAX_DEDUPE_LEN SZ_16M 19 #define BTRFS_MAX_DEDUPE_LEN SZ_16M
20 20
21 static int clone_finish_inode_update(struct bt 21 static int clone_finish_inode_update(struct btrfs_trans_handle *trans,
22 struct in 22 struct inode *inode,
23 u64 endof 23 u64 endoff,
24 const u64 24 const u64 destoff,
25 const u64 25 const u64 olen,
26 int no_ti 26 int no_time_update)
27 { 27 {
28 int ret; 28 int ret;
29 29
30 inode_inc_iversion(inode); 30 inode_inc_iversion(inode);
31 if (!no_time_update) { 31 if (!no_time_update) {
32 inode_set_mtime_to_ts(inode, i 32 inode_set_mtime_to_ts(inode, inode_set_ctime_current(inode));
33 } 33 }
34 /* 34 /*
35 * We round up to the block size at eo 35 * We round up to the block size at eof when determining which
36 * extents to clone above, but shouldn 36 * extents to clone above, but shouldn't round up the file size.
37 */ 37 */
38 if (endoff > destoff + olen) 38 if (endoff > destoff + olen)
39 endoff = destoff + olen; 39 endoff = destoff + olen;
40 if (endoff > inode->i_size) { 40 if (endoff > inode->i_size) {
41 i_size_write(inode, endoff); 41 i_size_write(inode, endoff);
42 btrfs_inode_safe_disk_i_size_w 42 btrfs_inode_safe_disk_i_size_write(BTRFS_I(inode), 0);
43 } 43 }
44 44
45 ret = btrfs_update_inode(trans, BTRFS_ 45 ret = btrfs_update_inode(trans, BTRFS_I(inode));
46 if (ret) { 46 if (ret) {
47 btrfs_abort_transaction(trans, 47 btrfs_abort_transaction(trans, ret);
48 btrfs_end_transaction(trans); 48 btrfs_end_transaction(trans);
49 goto out; 49 goto out;
50 } 50 }
51 ret = btrfs_end_transaction(trans); 51 ret = btrfs_end_transaction(trans);
52 out: 52 out:
53 return ret; 53 return ret;
54 } 54 }
55 55
56 static int copy_inline_to_page(struct btrfs_in 56 static int copy_inline_to_page(struct btrfs_inode *inode,
57 const u64 file_ 57 const u64 file_offset,
58 char *inline_da 58 char *inline_data,
59 const u64 size, 59 const u64 size,
60 const u64 datal 60 const u64 datal,
61 const u8 comp_t 61 const u8 comp_type)
62 { 62 {
63 struct btrfs_fs_info *fs_info = inode- 63 struct btrfs_fs_info *fs_info = inode->root->fs_info;
64 const u32 block_size = fs_info->sector 64 const u32 block_size = fs_info->sectorsize;
65 const u64 range_end = file_offset + bl 65 const u64 range_end = file_offset + block_size - 1;
66 const size_t inline_size = size - btrf 66 const size_t inline_size = size - btrfs_file_extent_calc_inline_size(0);
67 char *data_start = inline_data + btrfs 67 char *data_start = inline_data + btrfs_file_extent_calc_inline_size(0);
68 struct extent_changeset *data_reserved 68 struct extent_changeset *data_reserved = NULL;
69 struct folio *folio = NULL; !! 69 struct page *page = NULL;
70 struct address_space *mapping = inode- 70 struct address_space *mapping = inode->vfs_inode.i_mapping;
71 int ret; 71 int ret;
72 72
73 ASSERT(IS_ALIGNED(file_offset, block_s 73 ASSERT(IS_ALIGNED(file_offset, block_size));
74 74
75 /* 75 /*
76 * We have flushed and locked the rang 76 * We have flushed and locked the ranges of the source and destination
77 * inodes, we also have locked the ino 77 * inodes, we also have locked the inodes, so we are safe to do a
78 * reservation here. Also we must not 78 * reservation here. Also we must not do the reservation while holding
79 * a transaction open, otherwise we wo 79 * a transaction open, otherwise we would deadlock.
80 */ 80 */
81 ret = btrfs_delalloc_reserve_space(ino 81 ret = btrfs_delalloc_reserve_space(inode, &data_reserved, file_offset,
82 blo 82 block_size);
83 if (ret) 83 if (ret)
84 goto out; 84 goto out;
85 85
86 folio = __filemap_get_folio(mapping, f !! 86 page = find_or_create_page(mapping, file_offset >> PAGE_SHIFT,
87 FGP_LO !! 87 btrfs_alloc_write_mask(mapping));
88 btrfs_ !! 88 if (!page) {
89 if (IS_ERR(folio)) { <<
90 ret = -ENOMEM; 89 ret = -ENOMEM;
91 goto out_unlock; 90 goto out_unlock;
92 } 91 }
93 92
94 ret = set_folio_extent_mapped(folio); !! 93 ret = set_page_extent_mapped(page);
95 if (ret < 0) 94 if (ret < 0)
96 goto out_unlock; 95 goto out_unlock;
97 96
98 clear_extent_bit(&inode->io_tree, file 97 clear_extent_bit(&inode->io_tree, file_offset, range_end,
99 EXTENT_DELALLOC | EXT 98 EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING | EXTENT_DEFRAG,
100 NULL); 99 NULL);
101 ret = btrfs_set_extent_delalloc(inode, 100 ret = btrfs_set_extent_delalloc(inode, file_offset, range_end, 0, NULL);
102 if (ret) 101 if (ret)
103 goto out_unlock; 102 goto out_unlock;
104 103
105 /* 104 /*
106 * After dirtying the page our caller 105 * After dirtying the page our caller will need to start a transaction,
107 * and if we are low on metadata free 106 * and if we are low on metadata free space, that can cause flushing of
108 * delalloc for all inodes in order to 107 * delalloc for all inodes in order to get metadata space released.
109 * However we are holding the range lo 108 * However we are holding the range locked for the whole duration of
110 * the clone/dedupe operation, so we m 109 * the clone/dedupe operation, so we may deadlock if that happens and no
111 * other task releases enough space. S 110 * other task releases enough space. So mark this inode as not being
112 * possible to flush to avoid such dea 111 * possible to flush to avoid such deadlock. We will clear that flag
113 * when we finish cloning all extents, 112 * when we finish cloning all extents, since a transaction is started
114 * after finding each extent to clone. 113 * after finding each extent to clone.
115 */ 114 */
116 set_bit(BTRFS_INODE_NO_DELALLOC_FLUSH, 115 set_bit(BTRFS_INODE_NO_DELALLOC_FLUSH, &inode->runtime_flags);
117 116
118 if (comp_type == BTRFS_COMPRESS_NONE) 117 if (comp_type == BTRFS_COMPRESS_NONE) {
119 memcpy_to_folio(folio, offset_ !! 118 memcpy_to_page(page, offset_in_page(file_offset), data_start,
120 datal) !! 119 datal);
121 } else { 120 } else {
122 ret = btrfs_decompress(comp_ty !! 121 ret = btrfs_decompress(comp_type, data_start, page,
123 offset_ !! 122 offset_in_page(file_offset),
124 inline_ 123 inline_size, datal);
125 if (ret) 124 if (ret)
126 goto out_unlock; 125 goto out_unlock;
127 flush_dcache_folio(folio); !! 126 flush_dcache_page(page);
128 } 127 }
129 128
130 /* 129 /*
131 * If our inline data is smaller then 130 * If our inline data is smaller then the block/page size, then the
132 * remaining of the block/page is equi 131 * remaining of the block/page is equivalent to zeroes. We had something
133 * like the following done: 132 * like the following done:
134 * 133 *
135 * $ xfs_io -f -c "pwrite -S 0xab 0 50 134 * $ xfs_io -f -c "pwrite -S 0xab 0 500" file
136 * $ sync # (or fsync) 135 * $ sync # (or fsync)
137 * $ xfs_io -c "falloc 0 4K" file 136 * $ xfs_io -c "falloc 0 4K" file
138 * $ xfs_io -c "pwrite -S 0xcd 4K 4K" 137 * $ xfs_io -c "pwrite -S 0xcd 4K 4K"
139 * 138 *
140 * So what's in the range [500, 4095] 139 * So what's in the range [500, 4095] corresponds to zeroes.
141 */ 140 */
142 if (datal < block_size) 141 if (datal < block_size)
143 folio_zero_range(folio, datal, !! 142 memzero_page(page, datal, block_size - datal);
144 143
145 btrfs_folio_set_uptodate(fs_info, foli !! 144 btrfs_folio_set_uptodate(fs_info, page_folio(page), file_offset, block_size);
146 btrfs_folio_clear_checked(fs_info, fol !! 145 btrfs_folio_clear_checked(fs_info, page_folio(page), file_offset, block_size);
147 btrfs_folio_set_dirty(fs_info, folio, !! 146 btrfs_folio_set_dirty(fs_info, page_folio(page), file_offset, block_size);
148 out_unlock: 147 out_unlock:
149 if (!IS_ERR(folio)) { !! 148 if (page) {
150 folio_unlock(folio); !! 149 unlock_page(page);
151 folio_put(folio); !! 150 put_page(page);
152 } 151 }
153 if (ret) 152 if (ret)
154 btrfs_delalloc_release_space(i 153 btrfs_delalloc_release_space(inode, data_reserved, file_offset,
155 b 154 block_size, true);
156 btrfs_delalloc_release_extents(inode, 155 btrfs_delalloc_release_extents(inode, block_size);
157 out: 156 out:
158 extent_changeset_free(data_reserved); 157 extent_changeset_free(data_reserved);
159 158
160 return ret; 159 return ret;
161 } 160 }
162 161
163 /* 162 /*
164 * Deal with cloning of inline extents. We try 163 * Deal with cloning of inline extents. We try to copy the inline extent from
165 * the source inode to destination inode when 164 * the source inode to destination inode when possible. When not possible we
166 * copy the inline extent's data into the resp 165 * copy the inline extent's data into the respective page of the inode.
167 */ 166 */
168 static int clone_copy_inline_extent(struct ino 167 static int clone_copy_inline_extent(struct inode *dst,
169 struct btr 168 struct btrfs_path *path,
170 struct btr 169 struct btrfs_key *new_key,
171 const u64 170 const u64 drop_start,
172 const u64 171 const u64 datal,
173 const u64 172 const u64 size,
174 const u8 c 173 const u8 comp_type,
175 char *inli 174 char *inline_data,
176 struct btr 175 struct btrfs_trans_handle **trans_out)
177 { 176 {
178 struct btrfs_fs_info *fs_info = inode_ 177 struct btrfs_fs_info *fs_info = inode_to_fs_info(dst);
179 struct btrfs_root *root = BTRFS_I(dst) 178 struct btrfs_root *root = BTRFS_I(dst)->root;
180 const u64 aligned_end = ALIGN(new_key- 179 const u64 aligned_end = ALIGN(new_key->offset + datal,
181 fs_info- 180 fs_info->sectorsize);
182 struct btrfs_trans_handle *trans = NUL 181 struct btrfs_trans_handle *trans = NULL;
183 struct btrfs_drop_extents_args drop_ar 182 struct btrfs_drop_extents_args drop_args = { 0 };
184 int ret; 183 int ret;
185 struct btrfs_key key; 184 struct btrfs_key key;
186 185
187 if (new_key->offset > 0) { 186 if (new_key->offset > 0) {
188 ret = copy_inline_to_page(BTRF 187 ret = copy_inline_to_page(BTRFS_I(dst), new_key->offset,
189 inli 188 inline_data, size, datal, comp_type);
190 goto out; 189 goto out;
191 } 190 }
192 191
193 key.objectid = btrfs_ino(BTRFS_I(dst)) 192 key.objectid = btrfs_ino(BTRFS_I(dst));
194 key.type = BTRFS_EXTENT_DATA_KEY; 193 key.type = BTRFS_EXTENT_DATA_KEY;
195 key.offset = 0; 194 key.offset = 0;
196 ret = btrfs_search_slot(NULL, root, &k 195 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
197 if (ret < 0) { 196 if (ret < 0) {
198 return ret; 197 return ret;
199 } else if (ret > 0) { 198 } else if (ret > 0) {
200 if (path->slots[0] >= btrfs_he 199 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) {
201 ret = btrfs_next_leaf( 200 ret = btrfs_next_leaf(root, path);
202 if (ret < 0) 201 if (ret < 0)
203 return ret; 202 return ret;
204 else if (ret > 0) 203 else if (ret > 0)
205 goto copy_inli 204 goto copy_inline_extent;
206 } 205 }
207 btrfs_item_key_to_cpu(path->no 206 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
208 if (key.objectid == btrfs_ino( 207 if (key.objectid == btrfs_ino(BTRFS_I(dst)) &&
209 key.type == BTRFS_EXTENT_D 208 key.type == BTRFS_EXTENT_DATA_KEY) {
210 /* 209 /*
211 * There's an implicit 210 * There's an implicit hole at file offset 0, copy the
212 * inline extent's dat 211 * inline extent's data to the page.
213 */ 212 */
214 ASSERT(key.offset > 0) 213 ASSERT(key.offset > 0);
215 goto copy_to_page; 214 goto copy_to_page;
216 } 215 }
217 } else if (i_size_read(dst) <= datal) 216 } else if (i_size_read(dst) <= datal) {
218 struct btrfs_file_extent_item 217 struct btrfs_file_extent_item *ei;
219 218
220 ei = btrfs_item_ptr(path->node 219 ei = btrfs_item_ptr(path->nodes[0], path->slots[0],
221 struct btr 220 struct btrfs_file_extent_item);
222 /* 221 /*
223 * If it's an inline extent re 222 * If it's an inline extent replace it with the source inline
224 * extent, otherwise copy the 223 * extent, otherwise copy the source inline extent data into
225 * the respective page at the 224 * the respective page at the destination inode.
226 */ 225 */
227 if (btrfs_file_extent_type(pat 226 if (btrfs_file_extent_type(path->nodes[0], ei) ==
228 BTRFS_FILE_EXTENT_INLINE) 227 BTRFS_FILE_EXTENT_INLINE)
229 goto copy_inline_exten 228 goto copy_inline_extent;
230 229
231 goto copy_to_page; 230 goto copy_to_page;
232 } 231 }
233 232
234 copy_inline_extent: 233 copy_inline_extent:
235 /* 234 /*
236 * We have no extent items, or we have 235 * We have no extent items, or we have an extent at offset 0 which may
237 * or may not be inlined. All these ca 236 * or may not be inlined. All these cases are dealt the same way.
238 */ 237 */
239 if (i_size_read(dst) > datal) { 238 if (i_size_read(dst) > datal) {
240 /* 239 /*
241 * At the destination offset 0 240 * At the destination offset 0 we have either a hole, a regular
242 * extent or an inline extent 241 * extent or an inline extent larger then the one we want to
243 * clone. Deal with all these 242 * clone. Deal with all these cases by copying the inline extent
244 * data into the respective pa 243 * data into the respective page at the destination inode.
245 */ 244 */
246 goto copy_to_page; 245 goto copy_to_page;
247 } 246 }
248 247
249 /* 248 /*
250 * Release path before starting a new 249 * Release path before starting a new transaction so we don't hold locks
251 * that would confuse lockdep. 250 * that would confuse lockdep.
252 */ 251 */
253 btrfs_release_path(path); 252 btrfs_release_path(path);
254 /* 253 /*
255 * If we end up here it means were cop 254 * If we end up here it means were copy the inline extent into a leaf
256 * of the destination inode. We know w 255 * of the destination inode. We know we will drop or adjust at most one
257 * extent item in the destination root 256 * extent item in the destination root.
258 * 257 *
259 * 1 unit - adjusting old extent (we m 258 * 1 unit - adjusting old extent (we may have to split it)
260 * 1 unit - add new extent 259 * 1 unit - add new extent
261 * 1 unit - inode update 260 * 1 unit - inode update
262 */ 261 */
263 trans = btrfs_start_transaction(root, 262 trans = btrfs_start_transaction(root, 3);
264 if (IS_ERR(trans)) { 263 if (IS_ERR(trans)) {
265 ret = PTR_ERR(trans); 264 ret = PTR_ERR(trans);
266 trans = NULL; 265 trans = NULL;
267 goto out; 266 goto out;
268 } 267 }
269 drop_args.path = path; 268 drop_args.path = path;
270 drop_args.start = drop_start; 269 drop_args.start = drop_start;
271 drop_args.end = aligned_end; 270 drop_args.end = aligned_end;
272 drop_args.drop_cache = true; 271 drop_args.drop_cache = true;
273 ret = btrfs_drop_extents(trans, root, 272 ret = btrfs_drop_extents(trans, root, BTRFS_I(dst), &drop_args);
274 if (ret) 273 if (ret)
275 goto out; 274 goto out;
276 ret = btrfs_insert_empty_item(trans, r 275 ret = btrfs_insert_empty_item(trans, root, path, new_key, size);
277 if (ret) 276 if (ret)
278 goto out; 277 goto out;
279 278
280 write_extent_buffer(path->nodes[0], in 279 write_extent_buffer(path->nodes[0], inline_data,
281 btrfs_item_ptr_off 280 btrfs_item_ptr_offset(path->nodes[0],
282 281 path->slots[0]),
283 size); 282 size);
284 btrfs_update_inode_bytes(BTRFS_I(dst), 283 btrfs_update_inode_bytes(BTRFS_I(dst), datal, drop_args.bytes_found);
285 btrfs_set_inode_full_sync(BTRFS_I(dst) 284 btrfs_set_inode_full_sync(BTRFS_I(dst));
286 ret = btrfs_inode_set_file_extent_rang 285 ret = btrfs_inode_set_file_extent_range(BTRFS_I(dst), 0, aligned_end);
287 out: 286 out:
288 if (!ret && !trans) { 287 if (!ret && !trans) {
289 /* 288 /*
290 * No transaction here means w 289 * No transaction here means we copied the inline extent into a
291 * page of the destination ino 290 * page of the destination inode.
292 * 291 *
293 * 1 unit to update inode item 292 * 1 unit to update inode item
294 */ 293 */
295 trans = btrfs_start_transactio 294 trans = btrfs_start_transaction(root, 1);
296 if (IS_ERR(trans)) { 295 if (IS_ERR(trans)) {
297 ret = PTR_ERR(trans); 296 ret = PTR_ERR(trans);
298 trans = NULL; 297 trans = NULL;
299 } 298 }
300 } 299 }
301 if (ret && trans) { 300 if (ret && trans) {
302 btrfs_abort_transaction(trans, 301 btrfs_abort_transaction(trans, ret);
303 btrfs_end_transaction(trans); 302 btrfs_end_transaction(trans);
304 } 303 }
305 if (!ret) 304 if (!ret)
306 *trans_out = trans; 305 *trans_out = trans;
307 306
308 return ret; 307 return ret;
309 308
310 copy_to_page: 309 copy_to_page:
311 /* 310 /*
312 * Release our path because we don't n 311 * Release our path because we don't need it anymore and also because
313 * copy_inline_to_page() needs to rese 312 * copy_inline_to_page() needs to reserve data and metadata, which may
314 * need to flush delalloc when we are 313 * need to flush delalloc when we are low on available space and
315 * therefore cause a deadlock if write 314 * therefore cause a deadlock if writeback of an inline extent needs to
316 * write to the same leaf or an ordere 315 * write to the same leaf or an ordered extent completion needs to write
317 * to the same leaf. 316 * to the same leaf.
318 */ 317 */
319 btrfs_release_path(path); 318 btrfs_release_path(path);
320 319
321 ret = copy_inline_to_page(BTRFS_I(dst) 320 ret = copy_inline_to_page(BTRFS_I(dst), new_key->offset,
322 inline_data, 321 inline_data, size, datal, comp_type);
323 goto out; 322 goto out;
324 } 323 }
325 324
326 /* 325 /*
327 * Clone a range from inode file to another. 326 * Clone a range from inode file to another.
328 * 327 *
329 * @src: Inode to clone from 328 * @src: Inode to clone from
330 * @inode: Inode to clone to 329 * @inode: Inode to clone to
331 * @off: Offset within source to s 330 * @off: Offset within source to start clone from
332 * @olen: Original length, passed b 331 * @olen: Original length, passed by user, of range to clone
333 * @olen_aligned: Block-aligned value of ol 332 * @olen_aligned: Block-aligned value of olen
334 * @destoff: Offset within @inode to s 333 * @destoff: Offset within @inode to start clone
335 * @no_time_update: Whether to update mtime/c 334 * @no_time_update: Whether to update mtime/ctime on the target inode
336 */ 335 */
337 static int btrfs_clone(struct inode *src, stru 336 static int btrfs_clone(struct inode *src, struct inode *inode,
338 const u64 off, const u6 337 const u64 off, const u64 olen, const u64 olen_aligned,
339 const u64 destoff, int 338 const u64 destoff, int no_time_update)
340 { 339 {
341 struct btrfs_fs_info *fs_info = inode_ 340 struct btrfs_fs_info *fs_info = inode_to_fs_info(inode);
342 struct btrfs_path *path = NULL; 341 struct btrfs_path *path = NULL;
343 struct extent_buffer *leaf; 342 struct extent_buffer *leaf;
344 struct btrfs_trans_handle *trans; 343 struct btrfs_trans_handle *trans;
345 char *buf = NULL; 344 char *buf = NULL;
346 struct btrfs_key key; 345 struct btrfs_key key;
347 u32 nritems; 346 u32 nritems;
348 int slot; 347 int slot;
349 int ret; 348 int ret;
350 const u64 len = olen_aligned; 349 const u64 len = olen_aligned;
351 u64 last_dest_end = destoff; 350 u64 last_dest_end = destoff;
352 u64 prev_extent_end = off; 351 u64 prev_extent_end = off;
353 352
354 ret = -ENOMEM; 353 ret = -ENOMEM;
355 buf = kvmalloc(fs_info->nodesize, GFP_ 354 buf = kvmalloc(fs_info->nodesize, GFP_KERNEL);
356 if (!buf) 355 if (!buf)
357 return ret; 356 return ret;
358 357
359 path = btrfs_alloc_path(); 358 path = btrfs_alloc_path();
360 if (!path) { 359 if (!path) {
361 kvfree(buf); 360 kvfree(buf);
362 return ret; 361 return ret;
363 } 362 }
364 363
365 path->reada = READA_FORWARD; 364 path->reada = READA_FORWARD;
366 /* Clone data */ 365 /* Clone data */
367 key.objectid = btrfs_ino(BTRFS_I(src)) 366 key.objectid = btrfs_ino(BTRFS_I(src));
368 key.type = BTRFS_EXTENT_DATA_KEY; 367 key.type = BTRFS_EXTENT_DATA_KEY;
369 key.offset = off; 368 key.offset = off;
370 369
371 while (1) { 370 while (1) {
372 struct btrfs_file_extent_item 371 struct btrfs_file_extent_item *extent;
373 u64 extent_gen; 372 u64 extent_gen;
374 int type; 373 int type;
375 u32 size; 374 u32 size;
376 struct btrfs_key new_key; 375 struct btrfs_key new_key;
377 u64 disko = 0, diskl = 0; 376 u64 disko = 0, diskl = 0;
378 u64 datao = 0, datal = 0; 377 u64 datao = 0, datal = 0;
379 u8 comp; 378 u8 comp;
380 u64 drop_start; 379 u64 drop_start;
381 380
382 /* Note the key will change ty 381 /* Note the key will change type as we walk through the tree */
383 ret = btrfs_search_slot(NULL, 382 ret = btrfs_search_slot(NULL, BTRFS_I(src)->root, &key, path,
384 0, 0); 383 0, 0);
385 if (ret < 0) 384 if (ret < 0)
386 goto out; 385 goto out;
387 /* 386 /*
388 * First search, if no extent 387 * First search, if no extent item that starts at offset off was
389 * found but the previous item 388 * found but the previous item is an extent item, it's possible
390 * it might overlap our target 389 * it might overlap our target range, therefore process it.
391 */ 390 */
392 if (key.offset == off && ret > 391 if (key.offset == off && ret > 0 && path->slots[0] > 0) {
393 btrfs_item_key_to_cpu( 392 btrfs_item_key_to_cpu(path->nodes[0], &key,
394 393 path->slots[0] - 1);
395 if (key.type == BTRFS_ 394 if (key.type == BTRFS_EXTENT_DATA_KEY)
396 path->slots[0] 395 path->slots[0]--;
397 } 396 }
398 397
399 nritems = btrfs_header_nritems 398 nritems = btrfs_header_nritems(path->nodes[0]);
400 process_slot: 399 process_slot:
401 if (path->slots[0] >= nritems) 400 if (path->slots[0] >= nritems) {
402 ret = btrfs_next_leaf( 401 ret = btrfs_next_leaf(BTRFS_I(src)->root, path);
403 if (ret < 0) 402 if (ret < 0)
404 goto out; 403 goto out;
405 if (ret > 0) 404 if (ret > 0)
406 break; 405 break;
407 nritems = btrfs_header 406 nritems = btrfs_header_nritems(path->nodes[0]);
408 } 407 }
409 leaf = path->nodes[0]; 408 leaf = path->nodes[0];
410 slot = path->slots[0]; 409 slot = path->slots[0];
411 410
412 btrfs_item_key_to_cpu(leaf, &k 411 btrfs_item_key_to_cpu(leaf, &key, slot);
413 if (key.type > BTRFS_EXTENT_DA 412 if (key.type > BTRFS_EXTENT_DATA_KEY ||
414 key.objectid != btrfs_ino( 413 key.objectid != btrfs_ino(BTRFS_I(src)))
415 break; 414 break;
416 415
417 ASSERT(key.type == BTRFS_EXTEN 416 ASSERT(key.type == BTRFS_EXTENT_DATA_KEY);
418 417
419 extent = btrfs_item_ptr(leaf, 418 extent = btrfs_item_ptr(leaf, slot,
420 struct 419 struct btrfs_file_extent_item);
421 extent_gen = btrfs_file_extent 420 extent_gen = btrfs_file_extent_generation(leaf, extent);
422 comp = btrfs_file_extent_compr 421 comp = btrfs_file_extent_compression(leaf, extent);
423 type = btrfs_file_extent_type( 422 type = btrfs_file_extent_type(leaf, extent);
424 if (type == BTRFS_FILE_EXTENT_ 423 if (type == BTRFS_FILE_EXTENT_REG ||
425 type == BTRFS_FILE_EXTENT_ 424 type == BTRFS_FILE_EXTENT_PREALLOC) {
426 disko = btrfs_file_ext 425 disko = btrfs_file_extent_disk_bytenr(leaf, extent);
427 diskl = btrfs_file_ext 426 diskl = btrfs_file_extent_disk_num_bytes(leaf, extent);
428 datao = btrfs_file_ext 427 datao = btrfs_file_extent_offset(leaf, extent);
429 datal = btrfs_file_ext 428 datal = btrfs_file_extent_num_bytes(leaf, extent);
430 } else if (type == BTRFS_FILE_ 429 } else if (type == BTRFS_FILE_EXTENT_INLINE) {
431 /* Take upper bound, m 430 /* Take upper bound, may be compressed */
432 datal = btrfs_file_ext 431 datal = btrfs_file_extent_ram_bytes(leaf, extent);
433 } 432 }
434 433
435 /* 434 /*
436 * The first search might have 435 * The first search might have left us at an extent item that
437 * ends before our target rang 436 * ends before our target range's start, can happen if we have
438 * holes and NO_HOLES feature 437 * holes and NO_HOLES feature enabled.
439 * 438 *
440 * Subsequent searches may lea 439 * Subsequent searches may leave us on a file range we have
441 * processed before - this hap 440 * processed before - this happens due to a race with ordered
442 * extent completion for a fil 441 * extent completion for a file range that is outside our source
443 * range, but that range was p 442 * range, but that range was part of a file extent item that
444 * also covered a leading part 443 * also covered a leading part of our source range.
445 */ 444 */
446 if (key.offset + datal <= prev 445 if (key.offset + datal <= prev_extent_end) {
447 path->slots[0]++; 446 path->slots[0]++;
448 goto process_slot; 447 goto process_slot;
449 } else if (key.offset >= off + 448 } else if (key.offset >= off + len) {
450 break; 449 break;
451 } 450 }
452 451
453 prev_extent_end = key.offset + 452 prev_extent_end = key.offset + datal;
454 size = btrfs_item_size(leaf, s 453 size = btrfs_item_size(leaf, slot);
455 read_extent_buffer(leaf, buf, 454 read_extent_buffer(leaf, buf, btrfs_item_ptr_offset(leaf, slot),
456 size); 455 size);
457 456
458 btrfs_release_path(path); 457 btrfs_release_path(path);
459 458
460 memcpy(&new_key, &key, sizeof( 459 memcpy(&new_key, &key, sizeof(new_key));
461 new_key.objectid = btrfs_ino(B 460 new_key.objectid = btrfs_ino(BTRFS_I(inode));
462 if (off <= key.offset) 461 if (off <= key.offset)
463 new_key.offset = key.o 462 new_key.offset = key.offset + destoff - off;
464 else 463 else
465 new_key.offset = desto 464 new_key.offset = destoff;
466 465
467 /* 466 /*
468 * Deal with a hole that doesn 467 * Deal with a hole that doesn't have an extent item that
469 * represents it (NO_HOLES fea 468 * represents it (NO_HOLES feature enabled).
470 * This hole is either in the 469 * This hole is either in the middle of the cloning range or at
471 * the beginning (fully overla 470 * the beginning (fully overlaps it or partially overlaps it).
472 */ 471 */
473 if (new_key.offset != last_des 472 if (new_key.offset != last_dest_end)
474 drop_start = last_dest 473 drop_start = last_dest_end;
475 else 474 else
476 drop_start = new_key.o 475 drop_start = new_key.offset;
477 476
478 if (type == BTRFS_FILE_EXTENT_ 477 if (type == BTRFS_FILE_EXTENT_REG ||
479 type == BTRFS_FILE_EXTENT_ 478 type == BTRFS_FILE_EXTENT_PREALLOC) {
480 struct btrfs_replace_e 479 struct btrfs_replace_extent_info clone_info;
481 480
482 /* 481 /*
483 * a | --- range t 482 * a | --- range to clone ---| b
484 * | ------------- ext 483 * | ------------- extent ------------- |
485 */ 484 */
486 485
487 /* Subtract range b */ 486 /* Subtract range b */
488 if (key.offset + datal 487 if (key.offset + datal > off + len)
489 datal = off + 488 datal = off + len - key.offset;
490 489
491 /* Subtract range a */ 490 /* Subtract range a */
492 if (off > key.offset) 491 if (off > key.offset) {
493 datao += off - 492 datao += off - key.offset;
494 datal -= off - 493 datal -= off - key.offset;
495 } 494 }
496 495
497 clone_info.disk_offset 496 clone_info.disk_offset = disko;
498 clone_info.disk_len = 497 clone_info.disk_len = diskl;
499 clone_info.data_offset 498 clone_info.data_offset = datao;
500 clone_info.data_len = 499 clone_info.data_len = datal;
501 clone_info.file_offset 500 clone_info.file_offset = new_key.offset;
502 clone_info.extent_buf 501 clone_info.extent_buf = buf;
503 clone_info.is_new_exte 502 clone_info.is_new_extent = false;
504 clone_info.update_time 503 clone_info.update_times = !no_time_update;
505 ret = btrfs_replace_fi 504 ret = btrfs_replace_file_extents(BTRFS_I(inode), path,
506 drop_s 505 drop_start, new_key.offset + datal - 1,
507 &clone 506 &clone_info, &trans);
508 if (ret) 507 if (ret)
509 goto out; 508 goto out;
510 } else { 509 } else {
511 ASSERT(type == BTRFS_F 510 ASSERT(type == BTRFS_FILE_EXTENT_INLINE);
512 /* 511 /*
513 * Inline extents alwa 512 * Inline extents always have to start at file offset 0
514 * and can never be bi 513 * and can never be bigger then the sector size. We can
515 * never clone only pa 514 * never clone only parts of an inline extent, since all
516 * reflink operations 515 * reflink operations must start at a sector size aligned
517 * offset, and the len 516 * offset, and the length must be aligned too or end at
518 * the i_size (which i 517 * the i_size (which implies the whole inlined data).
519 */ 518 */
520 ASSERT(key.offset == 0 519 ASSERT(key.offset == 0);
521 ASSERT(datal <= fs_inf 520 ASSERT(datal <= fs_info->sectorsize);
522 if (WARN_ON(type != BT 521 if (WARN_ON(type != BTRFS_FILE_EXTENT_INLINE) ||
523 WARN_ON(key.offset 522 WARN_ON(key.offset != 0) ||
524 WARN_ON(datal > fs 523 WARN_ON(datal > fs_info->sectorsize)) {
525 ret = -EUCLEAN 524 ret = -EUCLEAN;
526 goto out; 525 goto out;
527 } 526 }
528 527
529 ret = clone_copy_inlin 528 ret = clone_copy_inline_extent(inode, path, &new_key,
530 529 drop_start, datal, size,
531 530 comp, buf, &trans);
532 if (ret) 531 if (ret)
533 goto out; 532 goto out;
534 } 533 }
535 534
536 btrfs_release_path(path); 535 btrfs_release_path(path);
537 536
538 /* 537 /*
539 * Whenever we share an extent 538 * Whenever we share an extent we update the last_reflink_trans
540 * of each inode to the curren 539 * of each inode to the current transaction. This is needed to
541 * make sure fsync does not lo 540 * make sure fsync does not log multiple checksum items with
542 * overlapping ranges (because 541 * overlapping ranges (because some extent items might refer
543 * only to sections of the ori 542 * only to sections of the original extent). For the destination
544 * inode we do this regardless 543 * inode we do this regardless of the generation of the extents
545 * or even if they are inline 544 * or even if they are inline extents or explicit holes, to make
546 * sure a full fsync does not 545 * sure a full fsync does not skip them. For the source inode,
547 * we only need to update last 546 * we only need to update last_reflink_trans in case it's a new
548 * extent that is not a hole o 547 * extent that is not a hole or an inline extent, to deal with
549 * the checksums problem on fs 548 * the checksums problem on fsync.
550 */ 549 */
551 if (extent_gen == trans->trans 550 if (extent_gen == trans->transid && disko > 0)
552 BTRFS_I(src)->last_ref 551 BTRFS_I(src)->last_reflink_trans = trans->transid;
553 552
554 BTRFS_I(inode)->last_reflink_t 553 BTRFS_I(inode)->last_reflink_trans = trans->transid;
555 554
556 last_dest_end = ALIGN(new_key. 555 last_dest_end = ALIGN(new_key.offset + datal,
557 fs_info- 556 fs_info->sectorsize);
558 ret = clone_finish_inode_updat 557 ret = clone_finish_inode_update(trans, inode, last_dest_end,
559 558 destoff, olen, no_time_update);
560 if (ret) 559 if (ret)
561 goto out; 560 goto out;
562 if (new_key.offset + datal >= 561 if (new_key.offset + datal >= destoff + len)
563 break; 562 break;
564 563
565 btrfs_release_path(path); 564 btrfs_release_path(path);
566 key.offset = prev_extent_end; 565 key.offset = prev_extent_end;
567 566
568 if (fatal_signal_pending(curre 567 if (fatal_signal_pending(current)) {
569 ret = -EINTR; 568 ret = -EINTR;
570 goto out; 569 goto out;
571 } 570 }
572 571
573 cond_resched(); 572 cond_resched();
574 } 573 }
575 ret = 0; 574 ret = 0;
576 575
577 if (last_dest_end < destoff + len) { 576 if (last_dest_end < destoff + len) {
578 /* 577 /*
579 * We have an implicit hole th 578 * We have an implicit hole that fully or partially overlaps our
580 * cloning range at its end. T 579 * cloning range at its end. This means that we either have the
581 * NO_HOLES feature enabled or 580 * NO_HOLES feature enabled or the implicit hole happened due to
582 * mixing buffered and direct 581 * mixing buffered and direct IO writes against this file.
583 */ 582 */
584 btrfs_release_path(path); 583 btrfs_release_path(path);
585 584
586 /* 585 /*
587 * When using NO_HOLES and we 586 * When using NO_HOLES and we are cloning a range that covers
588 * only a hole (no extents) in 587 * only a hole (no extents) into a range beyond the current
589 * i_size, punching a hole in 588 * i_size, punching a hole in the target range will not create
590 * an extent map defining a ho 589 * an extent map defining a hole, because the range starts at or
591 * beyond current i_size. If t 590 * beyond current i_size. If the file previously had an i_size
592 * greater than the new i_size 591 * greater than the new i_size set by this clone operation, we
593 * need to make sure the next 592 * need to make sure the next fsync is a full fsync, so that it
594 * detects and logs a hole cov 593 * detects and logs a hole covering a range from the current
595 * i_size to the new i_size. I 594 * i_size to the new i_size. If the clone range covers extents,
596 * besides a hole, then we kno 595 * besides a hole, then we know the full sync flag was already
597 * set by previous calls to bt 596 * set by previous calls to btrfs_replace_file_extents() that
598 * replaced file extent items. 597 * replaced file extent items.
599 */ 598 */
600 if (last_dest_end >= i_size_re 599 if (last_dest_end >= i_size_read(inode))
601 btrfs_set_inode_full_s 600 btrfs_set_inode_full_sync(BTRFS_I(inode));
602 601
603 ret = btrfs_replace_file_exten 602 ret = btrfs_replace_file_extents(BTRFS_I(inode), path,
604 last_dest_end, 603 last_dest_end, destoff + len - 1, NULL, &trans);
605 if (ret) 604 if (ret)
606 goto out; 605 goto out;
607 606
608 ret = clone_finish_inode_updat 607 ret = clone_finish_inode_update(trans, inode, destoff + len,
609 608 destoff, olen, no_time_update);
610 } 609 }
611 610
612 out: 611 out:
613 btrfs_free_path(path); 612 btrfs_free_path(path);
614 kvfree(buf); 613 kvfree(buf);
615 clear_bit(BTRFS_INODE_NO_DELALLOC_FLUS 614 clear_bit(BTRFS_INODE_NO_DELALLOC_FLUSH, &BTRFS_I(inode)->runtime_flags);
616 615
617 return ret; 616 return ret;
618 } 617 }
619 618
620 static void btrfs_double_mmap_lock(struct inod 619 static void btrfs_double_mmap_lock(struct inode *inode1, struct inode *inode2)
621 { 620 {
622 if (inode1 < inode2) 621 if (inode1 < inode2)
623 swap(inode1, inode2); 622 swap(inode1, inode2);
624 down_write(&BTRFS_I(inode1)->i_mmap_lo 623 down_write(&BTRFS_I(inode1)->i_mmap_lock);
625 down_write_nested(&BTRFS_I(inode2)->i_ 624 down_write_nested(&BTRFS_I(inode2)->i_mmap_lock, SINGLE_DEPTH_NESTING);
626 } 625 }
627 626
628 static void btrfs_double_mmap_unlock(struct in 627 static void btrfs_double_mmap_unlock(struct inode *inode1, struct inode *inode2)
629 { 628 {
630 up_write(&BTRFS_I(inode1)->i_mmap_lock 629 up_write(&BTRFS_I(inode1)->i_mmap_lock);
631 up_write(&BTRFS_I(inode2)->i_mmap_lock 630 up_write(&BTRFS_I(inode2)->i_mmap_lock);
632 } 631 }
633 632
634 static int btrfs_extent_same_range(struct inod 633 static int btrfs_extent_same_range(struct inode *src, u64 loff, u64 len,
635 struct inod 634 struct inode *dst, u64 dst_loff)
636 { 635 {
637 const u64 end = dst_loff + len - 1; 636 const u64 end = dst_loff + len - 1;
638 struct extent_state *cached_state = NU 637 struct extent_state *cached_state = NULL;
639 struct btrfs_fs_info *fs_info = BTRFS_ 638 struct btrfs_fs_info *fs_info = BTRFS_I(src)->root->fs_info;
640 const u64 bs = fs_info->sectorsize; 639 const u64 bs = fs_info->sectorsize;
641 int ret; 640 int ret;
642 641
643 /* 642 /*
644 * Lock destination range to serialize 643 * Lock destination range to serialize with concurrent readahead(), and
645 * we are safe from concurrency with r 644 * we are safe from concurrency with relocation of source extents
646 * because we have already locked the 645 * because we have already locked the inode's i_mmap_lock in exclusive
647 * mode. 646 * mode.
648 */ 647 */
649 lock_extent(&BTRFS_I(dst)->io_tree, ds 648 lock_extent(&BTRFS_I(dst)->io_tree, dst_loff, end, &cached_state);
650 ret = btrfs_clone(src, dst, loff, len, 649 ret = btrfs_clone(src, dst, loff, len, ALIGN(len, bs), dst_loff, 1);
651 unlock_extent(&BTRFS_I(dst)->io_tree, 650 unlock_extent(&BTRFS_I(dst)->io_tree, dst_loff, end, &cached_state);
652 651
653 btrfs_btree_balance_dirty(fs_info); 652 btrfs_btree_balance_dirty(fs_info);
654 653
655 return ret; 654 return ret;
656 } 655 }
657 656
658 static int btrfs_extent_same(struct inode *src 657 static int btrfs_extent_same(struct inode *src, u64 loff, u64 olen,
659 struct inode *dst 658 struct inode *dst, u64 dst_loff)
660 { 659 {
661 int ret = 0; 660 int ret = 0;
662 u64 i, tail_len, chunk_count; 661 u64 i, tail_len, chunk_count;
663 struct btrfs_root *root_dst = BTRFS_I( 662 struct btrfs_root *root_dst = BTRFS_I(dst)->root;
664 663
665 spin_lock(&root_dst->root_item_lock); 664 spin_lock(&root_dst->root_item_lock);
666 if (root_dst->send_in_progress) { 665 if (root_dst->send_in_progress) {
667 btrfs_warn_rl(root_dst->fs_inf 666 btrfs_warn_rl(root_dst->fs_info,
668 "cannot deduplicate to root %llu while send op 667 "cannot deduplicate to root %llu while send operations are using it (%d in progress)",
669 btrfs_root_id(ro 668 btrfs_root_id(root_dst),
670 root_dst->send_i 669 root_dst->send_in_progress);
671 spin_unlock(&root_dst->root_it 670 spin_unlock(&root_dst->root_item_lock);
672 return -EAGAIN; 671 return -EAGAIN;
673 } 672 }
674 root_dst->dedupe_in_progress++; 673 root_dst->dedupe_in_progress++;
675 spin_unlock(&root_dst->root_item_lock) 674 spin_unlock(&root_dst->root_item_lock);
676 675
677 tail_len = olen % BTRFS_MAX_DEDUPE_LEN 676 tail_len = olen % BTRFS_MAX_DEDUPE_LEN;
678 chunk_count = div_u64(olen, BTRFS_MAX_ 677 chunk_count = div_u64(olen, BTRFS_MAX_DEDUPE_LEN);
679 678
680 for (i = 0; i < chunk_count; i++) { 679 for (i = 0; i < chunk_count; i++) {
681 ret = btrfs_extent_same_range( 680 ret = btrfs_extent_same_range(src, loff, BTRFS_MAX_DEDUPE_LEN,
682 681 dst, dst_loff);
683 if (ret) 682 if (ret)
684 goto out; 683 goto out;
685 684
686 loff += BTRFS_MAX_DEDUPE_LEN; 685 loff += BTRFS_MAX_DEDUPE_LEN;
687 dst_loff += BTRFS_MAX_DEDUPE_L 686 dst_loff += BTRFS_MAX_DEDUPE_LEN;
688 } 687 }
689 688
690 if (tail_len > 0) 689 if (tail_len > 0)
691 ret = btrfs_extent_same_range( 690 ret = btrfs_extent_same_range(src, loff, tail_len, dst, dst_loff);
692 out: 691 out:
693 spin_lock(&root_dst->root_item_lock); 692 spin_lock(&root_dst->root_item_lock);
694 root_dst->dedupe_in_progress--; 693 root_dst->dedupe_in_progress--;
695 spin_unlock(&root_dst->root_item_lock) 694 spin_unlock(&root_dst->root_item_lock);
696 695
697 return ret; 696 return ret;
698 } 697 }
699 698
700 static noinline int btrfs_clone_files(struct f 699 static noinline int btrfs_clone_files(struct file *file, struct file *file_src,
701 u64 of 700 u64 off, u64 olen, u64 destoff)
702 { 701 {
703 struct extent_state *cached_state = NU 702 struct extent_state *cached_state = NULL;
704 struct inode *inode = file_inode(file) 703 struct inode *inode = file_inode(file);
705 struct inode *src = file_inode(file_sr 704 struct inode *src = file_inode(file_src);
706 struct btrfs_fs_info *fs_info = inode_ 705 struct btrfs_fs_info *fs_info = inode_to_fs_info(inode);
707 int ret; 706 int ret;
708 int wb_ret; 707 int wb_ret;
709 u64 len = olen; 708 u64 len = olen;
710 u64 bs = fs_info->sectorsize; 709 u64 bs = fs_info->sectorsize;
711 u64 end; 710 u64 end;
712 711
713 /* 712 /*
714 * VFS's generic_remap_file_range_prep 713 * VFS's generic_remap_file_range_prep() protects us from cloning the
715 * eof block into the middle of a file 714 * eof block into the middle of a file, which would result in corruption
716 * if the file size is not blocksize a 715 * if the file size is not blocksize aligned. So we don't need to check
717 * for that case here. 716 * for that case here.
718 */ 717 */
719 if (off + len == src->i_size) 718 if (off + len == src->i_size)
720 len = ALIGN(src->i_size, bs) - 719 len = ALIGN(src->i_size, bs) - off;
721 720
722 if (destoff > inode->i_size) { 721 if (destoff > inode->i_size) {
723 const u64 wb_start = ALIGN_DOW 722 const u64 wb_start = ALIGN_DOWN(inode->i_size, bs);
724 723
725 ret = btrfs_cont_expand(BTRFS_ 724 ret = btrfs_cont_expand(BTRFS_I(inode), inode->i_size, destoff);
726 if (ret) 725 if (ret)
727 return ret; 726 return ret;
728 /* 727 /*
729 * We may have truncated the l 728 * We may have truncated the last block if the inode's size is
730 * not sector size aligned, so 729 * not sector size aligned, so we need to wait for writeback to
731 * complete before proceeding 730 * complete before proceeding further, otherwise we can race
732 * with cloning and attempt to 731 * with cloning and attempt to increment a reference to an
733 * extent that no longer exist 732 * extent that no longer exists (writeback completed right after
734 * we found the previous exten 733 * we found the previous extent covering eof and before we
735 * attempted to increment its 734 * attempted to increment its reference count).
736 */ 735 */
737 ret = btrfs_wait_ordered_range !! 736 ret = btrfs_wait_ordered_range(inode, wb_start,
738 737 destoff - wb_start);
739 if (ret) 738 if (ret)
740 return ret; 739 return ret;
741 } 740 }
742 741
743 /* 742 /*
744 * Lock destination range to serialize 743 * Lock destination range to serialize with concurrent readahead(), and
745 * we are safe from concurrency with r 744 * we are safe from concurrency with relocation of source extents
746 * because we have already locked the 745 * because we have already locked the inode's i_mmap_lock in exclusive
747 * mode. 746 * mode.
748 */ 747 */
749 end = destoff + len - 1; 748 end = destoff + len - 1;
750 lock_extent(&BTRFS_I(inode)->io_tree, 749 lock_extent(&BTRFS_I(inode)->io_tree, destoff, end, &cached_state);
751 ret = btrfs_clone(src, inode, off, ole 750 ret = btrfs_clone(src, inode, off, olen, len, destoff, 0);
752 unlock_extent(&BTRFS_I(inode)->io_tree 751 unlock_extent(&BTRFS_I(inode)->io_tree, destoff, end, &cached_state);
753 752
754 /* 753 /*
755 * We may have copied an inline extent 754 * We may have copied an inline extent into a page of the destination
756 * range, so wait for writeback to com 755 * range, so wait for writeback to complete before truncating pages
757 * from the page cache. This is a rare 756 * from the page cache. This is a rare case.
758 */ 757 */
759 wb_ret = btrfs_wait_ordered_range(BTRF !! 758 wb_ret = btrfs_wait_ordered_range(inode, destoff, len);
760 ret = ret ? ret : wb_ret; 759 ret = ret ? ret : wb_ret;
761 /* 760 /*
762 * Truncate page cache pages so that f 761 * Truncate page cache pages so that future reads will see the cloned
763 * data immediately and not the previo 762 * data immediately and not the previous data.
764 */ 763 */
765 truncate_inode_pages_range(&inode->i_d 764 truncate_inode_pages_range(&inode->i_data,
766 round_down(des 765 round_down(destoff, PAGE_SIZE),
767 round_up(desto 766 round_up(destoff + len, PAGE_SIZE) - 1);
768 767
769 btrfs_btree_balance_dirty(fs_info); 768 btrfs_btree_balance_dirty(fs_info);
770 769
771 return ret; 770 return ret;
772 } 771 }
773 772
774 static int btrfs_remap_file_range_prep(struct 773 static int btrfs_remap_file_range_prep(struct file *file_in, loff_t pos_in,
775 struct 774 struct file *file_out, loff_t pos_out,
776 loff_t 775 loff_t *len, unsigned int remap_flags)
777 { 776 {
778 struct inode *inode_in = file_inode(fi 777 struct inode *inode_in = file_inode(file_in);
779 struct inode *inode_out = file_inode(f 778 struct inode *inode_out = file_inode(file_out);
780 u64 bs = BTRFS_I(inode_out)->root->fs_ 779 u64 bs = BTRFS_I(inode_out)->root->fs_info->sectorsize;
781 u64 wb_len; 780 u64 wb_len;
782 int ret; 781 int ret;
783 782
784 if (!(remap_flags & REMAP_FILE_DEDUP)) 783 if (!(remap_flags & REMAP_FILE_DEDUP)) {
785 struct btrfs_root *root_out = 784 struct btrfs_root *root_out = BTRFS_I(inode_out)->root;
786 785
787 if (btrfs_root_readonly(root_o 786 if (btrfs_root_readonly(root_out))
788 return -EROFS; 787 return -EROFS;
789 788
790 ASSERT(inode_in->i_sb == inode 789 ASSERT(inode_in->i_sb == inode_out->i_sb);
791 } 790 }
792 791
793 /* Don't make the dst file partly chec 792 /* Don't make the dst file partly checksummed */
794 if ((BTRFS_I(inode_in)->flags & BTRFS_ 793 if ((BTRFS_I(inode_in)->flags & BTRFS_INODE_NODATASUM) !=
795 (BTRFS_I(inode_out)->flags & BTRFS 794 (BTRFS_I(inode_out)->flags & BTRFS_INODE_NODATASUM)) {
796 return -EINVAL; 795 return -EINVAL;
797 } 796 }
798 797
799 /* 798 /*
800 * Now that the inodes are locked, we 799 * Now that the inodes are locked, we need to start writeback ourselves
801 * and can not rely on the writeback f 800 * and can not rely on the writeback from the VFS's generic helper
802 * generic_remap_file_range_prep() bec 801 * generic_remap_file_range_prep() because:
803 * 802 *
804 * 1) For compression we must call fil 803 * 1) For compression we must call filemap_fdatawrite_range() range
805 * twice (btrfs_fdatawrite_range() 804 * twice (btrfs_fdatawrite_range() does it for us), and the generic
806 * helper only calls it once; 805 * helper only calls it once;
807 * 806 *
808 * 2) filemap_fdatawrite_range(), call 807 * 2) filemap_fdatawrite_range(), called by the generic helper only
809 * waits for the writeback to compl 808 * waits for the writeback to complete, i.e. for IO to be done, and
810 * not for the ordered extents to c 809 * not for the ordered extents to complete. We need to wait for them
811 * to complete so that new file ext 810 * to complete so that new file extent items are in the fs tree.
812 */ 811 */
813 if (*len == 0 && !(remap_flags & REMAP 812 if (*len == 0 && !(remap_flags & REMAP_FILE_DEDUP))
814 wb_len = ALIGN(inode_in->i_siz 813 wb_len = ALIGN(inode_in->i_size, bs) - ALIGN_DOWN(pos_in, bs);
815 else 814 else
816 wb_len = ALIGN(*len, bs); 815 wb_len = ALIGN(*len, bs);
817 816
818 /* 817 /*
819 * Workaround to make sure NOCOW buffe 818 * Workaround to make sure NOCOW buffered write reach disk as NOCOW.
820 * 819 *
821 * Btrfs' back references do not have 820 * Btrfs' back references do not have a block level granularity, they
822 * work at the whole extent level. 821 * work at the whole extent level.
823 * NOCOW buffered write without data s 822 * NOCOW buffered write without data space reserved may not be able
824 * to fall back to CoW due to lack of 823 * to fall back to CoW due to lack of data space, thus could cause
825 * data loss. 824 * data loss.
826 * 825 *
827 * Here we take a shortcut by flushing 826 * Here we take a shortcut by flushing the whole inode, so that all
828 * nocow write should reach disk as no 827 * nocow write should reach disk as nocow before we increase the
829 * reference of the extent. We could d 828 * reference of the extent. We could do better by only flushing NOCOW
830 * data, but that needs extra accounti 829 * data, but that needs extra accounting.
831 * 830 *
832 * Also we don't need to check ASYNC_E 831 * Also we don't need to check ASYNC_EXTENT, as async extent will be
833 * CoWed anyway, not affecting nocow p 832 * CoWed anyway, not affecting nocow part.
834 */ 833 */
835 ret = filemap_flush(inode_in->i_mappin 834 ret = filemap_flush(inode_in->i_mapping);
836 if (ret < 0) 835 if (ret < 0)
837 return ret; 836 return ret;
838 837
839 ret = btrfs_wait_ordered_range(BTRFS_I !! 838 ret = btrfs_wait_ordered_range(inode_in, ALIGN_DOWN(pos_in, bs),
840 wb_len) 839 wb_len);
841 if (ret < 0) 840 if (ret < 0)
842 return ret; 841 return ret;
843 ret = btrfs_wait_ordered_range(BTRFS_I !! 842 ret = btrfs_wait_ordered_range(inode_out, ALIGN_DOWN(pos_out, bs),
844 wb_len) 843 wb_len);
845 if (ret < 0) 844 if (ret < 0)
846 return ret; 845 return ret;
847 846
848 return generic_remap_file_range_prep(f 847 return generic_remap_file_range_prep(file_in, pos_in, file_out, pos_out,
849 le 848 len, remap_flags);
850 } 849 }
851 850
852 static bool file_sync_write(const struct file 851 static bool file_sync_write(const struct file *file)
853 { 852 {
854 if (file->f_flags & (__O_SYNC | O_DSYN 853 if (file->f_flags & (__O_SYNC | O_DSYNC))
855 return true; 854 return true;
856 if (IS_SYNC(file_inode(file))) 855 if (IS_SYNC(file_inode(file)))
857 return true; 856 return true;
858 857
859 return false; 858 return false;
860 } 859 }
861 860
862 loff_t btrfs_remap_file_range(struct file *src 861 loff_t btrfs_remap_file_range(struct file *src_file, loff_t off,
863 struct file *dst_file, loff_t 862 struct file *dst_file, loff_t destoff, loff_t len,
864 unsigned int remap_flags) 863 unsigned int remap_flags)
865 { 864 {
866 struct inode *src_inode = file_inode(s 865 struct inode *src_inode = file_inode(src_file);
867 struct inode *dst_inode = file_inode(d 866 struct inode *dst_inode = file_inode(dst_file);
868 bool same_inode = dst_inode == src_ino 867 bool same_inode = dst_inode == src_inode;
869 int ret; 868 int ret;
870 869
871 if (remap_flags & ~(REMAP_FILE_DEDUP | 870 if (remap_flags & ~(REMAP_FILE_DEDUP | REMAP_FILE_ADVISORY))
872 return -EINVAL; 871 return -EINVAL;
873 872
874 if (same_inode) { 873 if (same_inode) {
875 btrfs_inode_lock(BTRFS_I(src_i 874 btrfs_inode_lock(BTRFS_I(src_inode), BTRFS_ILOCK_MMAP);
876 } else { 875 } else {
877 lock_two_nondirectories(src_in 876 lock_two_nondirectories(src_inode, dst_inode);
878 btrfs_double_mmap_lock(src_ino 877 btrfs_double_mmap_lock(src_inode, dst_inode);
879 } 878 }
880 879
881 ret = btrfs_remap_file_range_prep(src_ 880 ret = btrfs_remap_file_range_prep(src_file, off, dst_file, destoff,
882 &len 881 &len, remap_flags);
883 if (ret < 0 || len == 0) 882 if (ret < 0 || len == 0)
884 goto out_unlock; 883 goto out_unlock;
885 884
886 if (remap_flags & REMAP_FILE_DEDUP) 885 if (remap_flags & REMAP_FILE_DEDUP)
887 ret = btrfs_extent_same(src_in 886 ret = btrfs_extent_same(src_inode, off, len, dst_inode, destoff);
888 else 887 else
889 ret = btrfs_clone_files(dst_fi 888 ret = btrfs_clone_files(dst_file, src_file, off, len, destoff);
890 889
891 out_unlock: 890 out_unlock:
892 if (same_inode) { 891 if (same_inode) {
893 btrfs_inode_unlock(BTRFS_I(src 892 btrfs_inode_unlock(BTRFS_I(src_inode), BTRFS_ILOCK_MMAP);
894 } else { 893 } else {
895 btrfs_double_mmap_unlock(src_i 894 btrfs_double_mmap_unlock(src_inode, dst_inode);
896 unlock_two_nondirectories(src_ 895 unlock_two_nondirectories(src_inode, dst_inode);
897 } 896 }
898 897
899 /* 898 /*
900 * If either the source or the destina 899 * If either the source or the destination file was opened with O_SYNC,
901 * O_DSYNC or has the S_SYNC attribute 900 * O_DSYNC or has the S_SYNC attribute, fsync both the destination and
902 * source files/ranges, so that after 901 * source files/ranges, so that after a successful return (0) followed
903 * by a power failure results in the r 902 * by a power failure results in the reflinked data to be readable from
904 * both files/ranges. 903 * both files/ranges.
905 */ 904 */
906 if (ret == 0 && len > 0 && 905 if (ret == 0 && len > 0 &&
907 (file_sync_write(src_file) || file 906 (file_sync_write(src_file) || file_sync_write(dst_file))) {
908 ret = btrfs_sync_file(src_file 907 ret = btrfs_sync_file(src_file, off, off + len - 1, 0);
909 if (ret == 0) 908 if (ret == 0)
910 ret = btrfs_sync_file( 909 ret = btrfs_sync_file(dst_file, destoff,
911 910 destoff + len - 1, 0);
912 } 911 }
913 912
914 return ret < 0 ? ret : len; 913 return ret < 0 ? ret : len;
915 } 914 }
916 915
Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.