Merge tag 'for-4.17-rc6-tag' of git://git.kernel.org/pub/scm/linux/kernel/git/kdave...
[muen/linux.git] / fs / btrfs / inode.c
1 // SPDX-License-Identifier: GPL-2.0
2 /*
3  * Copyright (C) 2007 Oracle.  All rights reserved.
4  */
5
6 #include <linux/kernel.h>
7 #include <linux/bio.h>
8 #include <linux/buffer_head.h>
9 #include <linux/file.h>
10 #include <linux/fs.h>
11 #include <linux/pagemap.h>
12 #include <linux/highmem.h>
13 #include <linux/time.h>
14 #include <linux/init.h>
15 #include <linux/string.h>
16 #include <linux/backing-dev.h>
17 #include <linux/mpage.h>
18 #include <linux/swap.h>
19 #include <linux/writeback.h>
20 #include <linux/compat.h>
21 #include <linux/bit_spinlock.h>
22 #include <linux/xattr.h>
23 #include <linux/posix_acl.h>
24 #include <linux/falloc.h>
25 #include <linux/slab.h>
26 #include <linux/ratelimit.h>
27 #include <linux/mount.h>
28 #include <linux/btrfs.h>
29 #include <linux/blkdev.h>
30 #include <linux/posix_acl_xattr.h>
31 #include <linux/uio.h>
32 #include <linux/magic.h>
33 #include <linux/iversion.h>
34 #include <asm/unaligned.h>
35 #include "ctree.h"
36 #include "disk-io.h"
37 #include "transaction.h"
38 #include "btrfs_inode.h"
39 #include "print-tree.h"
40 #include "ordered-data.h"
41 #include "xattr.h"
42 #include "tree-log.h"
43 #include "volumes.h"
44 #include "compression.h"
45 #include "locking.h"
46 #include "free-space-cache.h"
47 #include "inode-map.h"
48 #include "backref.h"
49 #include "props.h"
50 #include "qgroup.h"
51 #include "dedupe.h"
52
53 struct btrfs_iget_args {
54         struct btrfs_key *location;
55         struct btrfs_root *root;
56 };
57
58 struct btrfs_dio_data {
59         u64 reserve;
60         u64 unsubmitted_oe_range_start;
61         u64 unsubmitted_oe_range_end;
62         int overwrite;
63 };
64
65 static const struct inode_operations btrfs_dir_inode_operations;
66 static const struct inode_operations btrfs_symlink_inode_operations;
67 static const struct inode_operations btrfs_dir_ro_inode_operations;
68 static const struct inode_operations btrfs_special_inode_operations;
69 static const struct inode_operations btrfs_file_inode_operations;
70 static const struct address_space_operations btrfs_aops;
71 static const struct address_space_operations btrfs_symlink_aops;
72 static const struct file_operations btrfs_dir_file_operations;
73 static const struct extent_io_ops btrfs_extent_io_ops;
74
75 static struct kmem_cache *btrfs_inode_cachep;
76 struct kmem_cache *btrfs_trans_handle_cachep;
77 struct kmem_cache *btrfs_path_cachep;
78 struct kmem_cache *btrfs_free_space_cachep;
79
80 #define S_SHIFT 12
81 static const unsigned char btrfs_type_by_mode[S_IFMT >> S_SHIFT] = {
82         [S_IFREG >> S_SHIFT]    = BTRFS_FT_REG_FILE,
83         [S_IFDIR >> S_SHIFT]    = BTRFS_FT_DIR,
84         [S_IFCHR >> S_SHIFT]    = BTRFS_FT_CHRDEV,
85         [S_IFBLK >> S_SHIFT]    = BTRFS_FT_BLKDEV,
86         [S_IFIFO >> S_SHIFT]    = BTRFS_FT_FIFO,
87         [S_IFSOCK >> S_SHIFT]   = BTRFS_FT_SOCK,
88         [S_IFLNK >> S_SHIFT]    = BTRFS_FT_SYMLINK,
89 };
90
91 static int btrfs_setsize(struct inode *inode, struct iattr *attr);
92 static int btrfs_truncate(struct inode *inode, bool skip_writeback);
93 static int btrfs_finish_ordered_io(struct btrfs_ordered_extent *ordered_extent);
94 static noinline int cow_file_range(struct inode *inode,
95                                    struct page *locked_page,
96                                    u64 start, u64 end, u64 delalloc_end,
97                                    int *page_started, unsigned long *nr_written,
98                                    int unlock, struct btrfs_dedupe_hash *hash);
99 static struct extent_map *create_io_em(struct inode *inode, u64 start, u64 len,
100                                        u64 orig_start, u64 block_start,
101                                        u64 block_len, u64 orig_block_len,
102                                        u64 ram_bytes, int compress_type,
103                                        int type);
104
105 static void __endio_write_update_ordered(struct inode *inode,
106                                          const u64 offset, const u64 bytes,
107                                          const bool uptodate);
108
109 /*
110  * Cleanup all submitted ordered extents in specified range to handle errors
111  * from the fill_dellaloc() callback.
112  *
113  * NOTE: caller must ensure that when an error happens, it can not call
114  * extent_clear_unlock_delalloc() to clear both the bits EXTENT_DO_ACCOUNTING
115  * and EXTENT_DELALLOC simultaneously, because that causes the reserved metadata
116  * to be released, which we want to happen only when finishing the ordered
117  * extent (btrfs_finish_ordered_io()). Also note that the caller of the
118  * fill_delalloc() callback already does proper cleanup for the first page of
119  * the range, that is, it invokes the callback writepage_end_io_hook() for the
120  * range of the first page.
121  */
122 static inline void btrfs_cleanup_ordered_extents(struct inode *inode,
123                                                  const u64 offset,
124                                                  const u64 bytes)
125 {
126         unsigned long index = offset >> PAGE_SHIFT;
127         unsigned long end_index = (offset + bytes - 1) >> PAGE_SHIFT;
128         struct page *page;
129
130         while (index <= end_index) {
131                 page = find_get_page(inode->i_mapping, index);
132                 index++;
133                 if (!page)
134                         continue;
135                 ClearPagePrivate2(page);
136                 put_page(page);
137         }
138         return __endio_write_update_ordered(inode, offset + PAGE_SIZE,
139                                             bytes - PAGE_SIZE, false);
140 }
141
142 static int btrfs_dirty_inode(struct inode *inode);
143
144 #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
145 void btrfs_test_inode_set_ops(struct inode *inode)
146 {
147         BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops;
148 }
149 #endif
150
151 static int btrfs_init_inode_security(struct btrfs_trans_handle *trans,
152                                      struct inode *inode,  struct inode *dir,
153                                      const struct qstr *qstr)
154 {
155         int err;
156
157         err = btrfs_init_acl(trans, inode, dir);
158         if (!err)
159                 err = btrfs_xattr_security_init(trans, inode, dir, qstr);
160         return err;
161 }
162
163 /*
164  * this does all the hard work for inserting an inline extent into
165  * the btree.  The caller should have done a btrfs_drop_extents so that
166  * no overlapping inline items exist in the btree
167  */
168 static int insert_inline_extent(struct btrfs_trans_handle *trans,
169                                 struct btrfs_path *path, int extent_inserted,
170                                 struct btrfs_root *root, struct inode *inode,
171                                 u64 start, size_t size, size_t compressed_size,
172                                 int compress_type,
173                                 struct page **compressed_pages)
174 {
175         struct extent_buffer *leaf;
176         struct page *page = NULL;
177         char *kaddr;
178         unsigned long ptr;
179         struct btrfs_file_extent_item *ei;
180         int ret;
181         size_t cur_size = size;
182         unsigned long offset;
183
184         if (compressed_size && compressed_pages)
185                 cur_size = compressed_size;
186
187         inode_add_bytes(inode, size);
188
189         if (!extent_inserted) {
190                 struct btrfs_key key;
191                 size_t datasize;
192
193                 key.objectid = btrfs_ino(BTRFS_I(inode));
194                 key.offset = start;
195                 key.type = BTRFS_EXTENT_DATA_KEY;
196
197                 datasize = btrfs_file_extent_calc_inline_size(cur_size);
198                 path->leave_spinning = 1;
199                 ret = btrfs_insert_empty_item(trans, root, path, &key,
200                                               datasize);
201                 if (ret)
202                         goto fail;
203         }
204         leaf = path->nodes[0];
205         ei = btrfs_item_ptr(leaf, path->slots[0],
206                             struct btrfs_file_extent_item);
207         btrfs_set_file_extent_generation(leaf, ei, trans->transid);
208         btrfs_set_file_extent_type(leaf, ei, BTRFS_FILE_EXTENT_INLINE);
209         btrfs_set_file_extent_encryption(leaf, ei, 0);
210         btrfs_set_file_extent_other_encoding(leaf, ei, 0);
211         btrfs_set_file_extent_ram_bytes(leaf, ei, size);
212         ptr = btrfs_file_extent_inline_start(ei);
213
214         if (compress_type != BTRFS_COMPRESS_NONE) {
215                 struct page *cpage;
216                 int i = 0;
217                 while (compressed_size > 0) {
218                         cpage = compressed_pages[i];
219                         cur_size = min_t(unsigned long, compressed_size,
220                                        PAGE_SIZE);
221
222                         kaddr = kmap_atomic(cpage);
223                         write_extent_buffer(leaf, kaddr, ptr, cur_size);
224                         kunmap_atomic(kaddr);
225
226                         i++;
227                         ptr += cur_size;
228                         compressed_size -= cur_size;
229                 }
230                 btrfs_set_file_extent_compression(leaf, ei,
231                                                   compress_type);
232         } else {
233                 page = find_get_page(inode->i_mapping,
234                                      start >> PAGE_SHIFT);
235                 btrfs_set_file_extent_compression(leaf, ei, 0);
236                 kaddr = kmap_atomic(page);
237                 offset = start & (PAGE_SIZE - 1);
238                 write_extent_buffer(leaf, kaddr + offset, ptr, size);
239                 kunmap_atomic(kaddr);
240                 put_page(page);
241         }
242         btrfs_mark_buffer_dirty(leaf);
243         btrfs_release_path(path);
244
245         /*
246          * we're an inline extent, so nobody can
247          * extend the file past i_size without locking
248          * a page we already have locked.
249          *
250          * We must do any isize and inode updates
251          * before we unlock the pages.  Otherwise we
252          * could end up racing with unlink.
253          */
254         BTRFS_I(inode)->disk_i_size = inode->i_size;
255         ret = btrfs_update_inode(trans, root, inode);
256
257 fail:
258         return ret;
259 }
260
261
262 /*
263  * conditionally insert an inline extent into the file.  This
264  * does the checks required to make sure the data is small enough
265  * to fit as an inline extent.
266  */
267 static noinline int cow_file_range_inline(struct inode *inode, u64 start,
268                                           u64 end, size_t compressed_size,
269                                           int compress_type,
270                                           struct page **compressed_pages)
271 {
272         struct btrfs_root *root = BTRFS_I(inode)->root;
273         struct btrfs_fs_info *fs_info = root->fs_info;
274         struct btrfs_trans_handle *trans;
275         u64 isize = i_size_read(inode);
276         u64 actual_end = min(end + 1, isize);
277         u64 inline_len = actual_end - start;
278         u64 aligned_end = ALIGN(end, fs_info->sectorsize);
279         u64 data_len = inline_len;
280         int ret;
281         struct btrfs_path *path;
282         int extent_inserted = 0;
283         u32 extent_item_size;
284
285         if (compressed_size)
286                 data_len = compressed_size;
287
288         if (start > 0 ||
289             actual_end > fs_info->sectorsize ||
290             data_len > BTRFS_MAX_INLINE_DATA_SIZE(fs_info) ||
291             (!compressed_size &&
292             (actual_end & (fs_info->sectorsize - 1)) == 0) ||
293             end + 1 < isize ||
294             data_len > fs_info->max_inline) {
295                 return 1;
296         }
297
298         path = btrfs_alloc_path();
299         if (!path)
300                 return -ENOMEM;
301
302         trans = btrfs_join_transaction(root);
303         if (IS_ERR(trans)) {
304                 btrfs_free_path(path);
305                 return PTR_ERR(trans);
306         }
307         trans->block_rsv = &BTRFS_I(inode)->block_rsv;
308
309         if (compressed_size && compressed_pages)
310                 extent_item_size = btrfs_file_extent_calc_inline_size(
311                    compressed_size);
312         else
313                 extent_item_size = btrfs_file_extent_calc_inline_size(
314                     inline_len);
315
316         ret = __btrfs_drop_extents(trans, root, inode, path,
317                                    start, aligned_end, NULL,
318                                    1, 1, extent_item_size, &extent_inserted);
319         if (ret) {
320                 btrfs_abort_transaction(trans, ret);
321                 goto out;
322         }
323
324         if (isize > actual_end)
325                 inline_len = min_t(u64, isize, actual_end);
326         ret = insert_inline_extent(trans, path, extent_inserted,
327                                    root, inode, start,
328                                    inline_len, compressed_size,
329                                    compress_type, compressed_pages);
330         if (ret && ret != -ENOSPC) {
331                 btrfs_abort_transaction(trans, ret);
332                 goto out;
333         } else if (ret == -ENOSPC) {
334                 ret = 1;
335                 goto out;
336         }
337
338         set_bit(BTRFS_INODE_NEEDS_FULL_SYNC, &BTRFS_I(inode)->runtime_flags);
339         btrfs_drop_extent_cache(BTRFS_I(inode), start, aligned_end - 1, 0);
340 out:
341         /*
342          * Don't forget to free the reserved space, as for inlined extent
343          * it won't count as data extent, free them directly here.
344          * And at reserve time, it's always aligned to page size, so
345          * just free one page here.
346          */
347         btrfs_qgroup_free_data(inode, NULL, 0, PAGE_SIZE);
348         btrfs_free_path(path);
349         btrfs_end_transaction(trans);
350         return ret;
351 }
352
353 struct async_extent {
354         u64 start;
355         u64 ram_size;
356         u64 compressed_size;
357         struct page **pages;
358         unsigned long nr_pages;
359         int compress_type;
360         struct list_head list;
361 };
362
363 struct async_cow {
364         struct inode *inode;
365         struct btrfs_root *root;
366         struct page *locked_page;
367         u64 start;
368         u64 end;
369         unsigned int write_flags;
370         struct list_head extents;
371         struct btrfs_work work;
372 };
373
374 static noinline int add_async_extent(struct async_cow *cow,
375                                      u64 start, u64 ram_size,
376                                      u64 compressed_size,
377                                      struct page **pages,
378                                      unsigned long nr_pages,
379                                      int compress_type)
380 {
381         struct async_extent *async_extent;
382
383         async_extent = kmalloc(sizeof(*async_extent), GFP_NOFS);
384         BUG_ON(!async_extent); /* -ENOMEM */
385         async_extent->start = start;
386         async_extent->ram_size = ram_size;
387         async_extent->compressed_size = compressed_size;
388         async_extent->pages = pages;
389         async_extent->nr_pages = nr_pages;
390         async_extent->compress_type = compress_type;
391         list_add_tail(&async_extent->list, &cow->extents);
392         return 0;
393 }
394
395 static inline int inode_need_compress(struct inode *inode, u64 start, u64 end)
396 {
397         struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
398
399         /* force compress */
400         if (btrfs_test_opt(fs_info, FORCE_COMPRESS))
401                 return 1;
402         /* defrag ioctl */
403         if (BTRFS_I(inode)->defrag_compress)
404                 return 1;
405         /* bad compression ratios */
406         if (BTRFS_I(inode)->flags & BTRFS_INODE_NOCOMPRESS)
407                 return 0;
408         if (btrfs_test_opt(fs_info, COMPRESS) ||
409             BTRFS_I(inode)->flags & BTRFS_INODE_COMPRESS ||
410             BTRFS_I(inode)->prop_compress)
411                 return btrfs_compress_heuristic(inode, start, end);
412         return 0;
413 }
414
415 static inline void inode_should_defrag(struct btrfs_inode *inode,
416                 u64 start, u64 end, u64 num_bytes, u64 small_write)
417 {
418         /* If this is a small write inside eof, kick off a defrag */
419         if (num_bytes < small_write &&
420             (start > 0 || end + 1 < inode->disk_i_size))
421                 btrfs_add_inode_defrag(NULL, inode);
422 }
423
424 /*
425  * we create compressed extents in two phases.  The first
426  * phase compresses a range of pages that have already been
427  * locked (both pages and state bits are locked).
428  *
429  * This is done inside an ordered work queue, and the compression
430  * is spread across many cpus.  The actual IO submission is step
431  * two, and the ordered work queue takes care of making sure that
432  * happens in the same order things were put onto the queue by
433  * writepages and friends.
434  *
435  * If this code finds it can't get good compression, it puts an
436  * entry onto the work queue to write the uncompressed bytes.  This
437  * makes sure that both compressed inodes and uncompressed inodes
438  * are written in the same order that the flusher thread sent them
439  * down.
440  */
441 static noinline void compress_file_range(struct inode *inode,
442                                         struct page *locked_page,
443                                         u64 start, u64 end,
444                                         struct async_cow *async_cow,
445                                         int *num_added)
446 {
447         struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
448         u64 blocksize = fs_info->sectorsize;
449         u64 actual_end;
450         u64 isize = i_size_read(inode);
451         int ret = 0;
452         struct page **pages = NULL;
453         unsigned long nr_pages;
454         unsigned long total_compressed = 0;
455         unsigned long total_in = 0;
456         int i;
457         int will_compress;
458         int compress_type = fs_info->compress_type;
459         int redirty = 0;
460
461         inode_should_defrag(BTRFS_I(inode), start, end, end - start + 1,
462                         SZ_16K);
463
464         actual_end = min_t(u64, isize, end + 1);
465 again:
466         will_compress = 0;
467         nr_pages = (end >> PAGE_SHIFT) - (start >> PAGE_SHIFT) + 1;
468         BUILD_BUG_ON((BTRFS_MAX_COMPRESSED % PAGE_SIZE) != 0);
469         nr_pages = min_t(unsigned long, nr_pages,
470                         BTRFS_MAX_COMPRESSED / PAGE_SIZE);
471
472         /*
473          * we don't want to send crud past the end of i_size through
474          * compression, that's just a waste of CPU time.  So, if the
475          * end of the file is before the start of our current
476          * requested range of bytes, we bail out to the uncompressed
477          * cleanup code that can deal with all of this.
478          *
479          * It isn't really the fastest way to fix things, but this is a
480          * very uncommon corner.
481          */
482         if (actual_end <= start)
483                 goto cleanup_and_bail_uncompressed;
484
485         total_compressed = actual_end - start;
486
487         /*
488          * skip compression for a small file range(<=blocksize) that
489          * isn't an inline extent, since it doesn't save disk space at all.
490          */
491         if (total_compressed <= blocksize &&
492            (start > 0 || end + 1 < BTRFS_I(inode)->disk_i_size))
493                 goto cleanup_and_bail_uncompressed;
494
495         total_compressed = min_t(unsigned long, total_compressed,
496                         BTRFS_MAX_UNCOMPRESSED);
497         total_in = 0;
498         ret = 0;
499
500         /*
501          * we do compression for mount -o compress and when the
502          * inode has not been flagged as nocompress.  This flag can
503          * change at any time if we discover bad compression ratios.
504          */
505         if (inode_need_compress(inode, start, end)) {
506                 WARN_ON(pages);
507                 pages = kcalloc(nr_pages, sizeof(struct page *), GFP_NOFS);
508                 if (!pages) {
509                         /* just bail out to the uncompressed code */
510                         goto cont;
511                 }
512
513                 if (BTRFS_I(inode)->defrag_compress)
514                         compress_type = BTRFS_I(inode)->defrag_compress;
515                 else if (BTRFS_I(inode)->prop_compress)
516                         compress_type = BTRFS_I(inode)->prop_compress;
517
518                 /*
519                  * we need to call clear_page_dirty_for_io on each
520                  * page in the range.  Otherwise applications with the file
521                  * mmap'd can wander in and change the page contents while
522                  * we are compressing them.
523                  *
524                  * If the compression fails for any reason, we set the pages
525                  * dirty again later on.
526                  *
527                  * Note that the remaining part is redirtied, the start pointer
528                  * has moved, the end is the original one.
529                  */
530                 if (!redirty) {
531                         extent_range_clear_dirty_for_io(inode, start, end);
532                         redirty = 1;
533                 }
534
535                 /* Compression level is applied here and only here */
536                 ret = btrfs_compress_pages(
537                         compress_type | (fs_info->compress_level << 4),
538                                            inode->i_mapping, start,
539                                            pages,
540                                            &nr_pages,
541                                            &total_in,
542                                            &total_compressed);
543
544                 if (!ret) {
545                         unsigned long offset = total_compressed &
546                                 (PAGE_SIZE - 1);
547                         struct page *page = pages[nr_pages - 1];
548                         char *kaddr;
549
550                         /* zero the tail end of the last page, we might be
551                          * sending it down to disk
552                          */
553                         if (offset) {
554                                 kaddr = kmap_atomic(page);
555                                 memset(kaddr + offset, 0,
556                                        PAGE_SIZE - offset);
557                                 kunmap_atomic(kaddr);
558                         }
559                         will_compress = 1;
560                 }
561         }
562 cont:
563         if (start == 0) {
564                 /* lets try to make an inline extent */
565                 if (ret || total_in < actual_end) {
566                         /* we didn't compress the entire range, try
567                          * to make an uncompressed inline extent.
568                          */
569                         ret = cow_file_range_inline(inode, start, end, 0,
570                                                     BTRFS_COMPRESS_NONE, NULL);
571                 } else {
572                         /* try making a compressed inline extent */
573                         ret = cow_file_range_inline(inode, start, end,
574                                                     total_compressed,
575                                                     compress_type, pages);
576                 }
577                 if (ret <= 0) {
578                         unsigned long clear_flags = EXTENT_DELALLOC |
579                                 EXTENT_DELALLOC_NEW | EXTENT_DEFRAG |
580                                 EXTENT_DO_ACCOUNTING;
581                         unsigned long page_error_op;
582
583                         page_error_op = ret < 0 ? PAGE_SET_ERROR : 0;
584
585                         /*
586                          * inline extent creation worked or returned error,
587                          * we don't need to create any more async work items.
588                          * Unlock and free up our temp pages.
589                          *
590                          * We use DO_ACCOUNTING here because we need the
591                          * delalloc_release_metadata to be done _after_ we drop
592                          * our outstanding extent for clearing delalloc for this
593                          * range.
594                          */
595                         extent_clear_unlock_delalloc(inode, start, end, end,
596                                                      NULL, clear_flags,
597                                                      PAGE_UNLOCK |
598                                                      PAGE_CLEAR_DIRTY |
599                                                      PAGE_SET_WRITEBACK |
600                                                      page_error_op |
601                                                      PAGE_END_WRITEBACK);
602                         goto free_pages_out;
603                 }
604         }
605
606         if (will_compress) {
607                 /*
608                  * we aren't doing an inline extent round the compressed size
609                  * up to a block size boundary so the allocator does sane
610                  * things
611                  */
612                 total_compressed = ALIGN(total_compressed, blocksize);
613
614                 /*
615                  * one last check to make sure the compression is really a
616                  * win, compare the page count read with the blocks on disk,
617                  * compression must free at least one sector size
618                  */
619                 total_in = ALIGN(total_in, PAGE_SIZE);
620                 if (total_compressed + blocksize <= total_in) {
621                         *num_added += 1;
622
623                         /*
624                          * The async work queues will take care of doing actual
625                          * allocation on disk for these compressed pages, and
626                          * will submit them to the elevator.
627                          */
628                         add_async_extent(async_cow, start, total_in,
629                                         total_compressed, pages, nr_pages,
630                                         compress_type);
631
632                         if (start + total_in < end) {
633                                 start += total_in;
634                                 pages = NULL;
635                                 cond_resched();
636                                 goto again;
637                         }
638                         return;
639                 }
640         }
641         if (pages) {
642                 /*
643                  * the compression code ran but failed to make things smaller,
644                  * free any pages it allocated and our page pointer array
645                  */
646                 for (i = 0; i < nr_pages; i++) {
647                         WARN_ON(pages[i]->mapping);
648                         put_page(pages[i]);
649                 }
650                 kfree(pages);
651                 pages = NULL;
652                 total_compressed = 0;
653                 nr_pages = 0;
654
655                 /* flag the file so we don't compress in the future */
656                 if (!btrfs_test_opt(fs_info, FORCE_COMPRESS) &&
657                     !(BTRFS_I(inode)->prop_compress)) {
658                         BTRFS_I(inode)->flags |= BTRFS_INODE_NOCOMPRESS;
659                 }
660         }
661 cleanup_and_bail_uncompressed:
662         /*
663          * No compression, but we still need to write the pages in the file
664          * we've been given so far.  redirty the locked page if it corresponds
665          * to our extent and set things up for the async work queue to run
666          * cow_file_range to do the normal delalloc dance.
667          */
668         if (page_offset(locked_page) >= start &&
669             page_offset(locked_page) <= end)
670                 __set_page_dirty_nobuffers(locked_page);
671                 /* unlocked later on in the async handlers */
672
673         if (redirty)
674                 extent_range_redirty_for_io(inode, start, end);
675         add_async_extent(async_cow, start, end - start + 1, 0, NULL, 0,
676                          BTRFS_COMPRESS_NONE);
677         *num_added += 1;
678
679         return;
680
681 free_pages_out:
682         for (i = 0; i < nr_pages; i++) {
683                 WARN_ON(pages[i]->mapping);
684                 put_page(pages[i]);
685         }
686         kfree(pages);
687 }
688
689 static void free_async_extent_pages(struct async_extent *async_extent)
690 {
691         int i;
692
693         if (!async_extent->pages)
694                 return;
695
696         for (i = 0; i < async_extent->nr_pages; i++) {
697                 WARN_ON(async_extent->pages[i]->mapping);
698                 put_page(async_extent->pages[i]);
699         }
700         kfree(async_extent->pages);
701         async_extent->nr_pages = 0;
702         async_extent->pages = NULL;
703 }
704
705 /*
706  * phase two of compressed writeback.  This is the ordered portion
707  * of the code, which only gets called in the order the work was
708  * queued.  We walk all the async extents created by compress_file_range
709  * and send them down to the disk.
710  */
711 static noinline void submit_compressed_extents(struct inode *inode,
712                                               struct async_cow *async_cow)
713 {
714         struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
715         struct async_extent *async_extent;
716         u64 alloc_hint = 0;
717         struct btrfs_key ins;
718         struct extent_map *em;
719         struct btrfs_root *root = BTRFS_I(inode)->root;
720         struct extent_io_tree *io_tree;
721         int ret = 0;
722
723 again:
724         while (!list_empty(&async_cow->extents)) {
725                 async_extent = list_entry(async_cow->extents.next,
726                                           struct async_extent, list);
727                 list_del(&async_extent->list);
728
729                 io_tree = &BTRFS_I(inode)->io_tree;
730
731 retry:
732                 /* did the compression code fall back to uncompressed IO? */
733                 if (!async_extent->pages) {
734                         int page_started = 0;
735                         unsigned long nr_written = 0;
736
737                         lock_extent(io_tree, async_extent->start,
738                                          async_extent->start +
739                                          async_extent->ram_size - 1);
740
741                         /* allocate blocks */
742                         ret = cow_file_range(inode, async_cow->locked_page,
743                                              async_extent->start,
744                                              async_extent->start +
745                                              async_extent->ram_size - 1,
746                                              async_extent->start +
747                                              async_extent->ram_size - 1,
748                                              &page_started, &nr_written, 0,
749                                              NULL);
750
751                         /* JDM XXX */
752
753                         /*
754                          * if page_started, cow_file_range inserted an
755                          * inline extent and took care of all the unlocking
756                          * and IO for us.  Otherwise, we need to submit
757                          * all those pages down to the drive.
758                          */
759                         if (!page_started && !ret)
760                                 extent_write_locked_range(inode,
761                                                   async_extent->start,
762                                                   async_extent->start +
763                                                   async_extent->ram_size - 1,
764                                                   WB_SYNC_ALL);
765                         else if (ret)
766                                 unlock_page(async_cow->locked_page);
767                         kfree(async_extent);
768                         cond_resched();
769                         continue;
770                 }
771
772                 lock_extent(io_tree, async_extent->start,
773                             async_extent->start + async_extent->ram_size - 1);
774
775                 ret = btrfs_reserve_extent(root, async_extent->ram_size,
776                                            async_extent->compressed_size,
777                                            async_extent->compressed_size,
778                                            0, alloc_hint, &ins, 1, 1);
779                 if (ret) {
780                         free_async_extent_pages(async_extent);
781
782                         if (ret == -ENOSPC) {
783                                 unlock_extent(io_tree, async_extent->start,
784                                               async_extent->start +
785                                               async_extent->ram_size - 1);
786
787                                 /*
788                                  * we need to redirty the pages if we decide to
789                                  * fallback to uncompressed IO, otherwise we
790                                  * will not submit these pages down to lower
791                                  * layers.
792                                  */
793                                 extent_range_redirty_for_io(inode,
794                                                 async_extent->start,
795                                                 async_extent->start +
796                                                 async_extent->ram_size - 1);
797
798                                 goto retry;
799                         }
800                         goto out_free;
801                 }
802                 /*
803                  * here we're doing allocation and writeback of the
804                  * compressed pages
805                  */
806                 em = create_io_em(inode, async_extent->start,
807                                   async_extent->ram_size, /* len */
808                                   async_extent->start, /* orig_start */
809                                   ins.objectid, /* block_start */
810                                   ins.offset, /* block_len */
811                                   ins.offset, /* orig_block_len */
812                                   async_extent->ram_size, /* ram_bytes */
813                                   async_extent->compress_type,
814                                   BTRFS_ORDERED_COMPRESSED);
815                 if (IS_ERR(em))
816                         /* ret value is not necessary due to void function */
817                         goto out_free_reserve;
818                 free_extent_map(em);
819
820                 ret = btrfs_add_ordered_extent_compress(inode,
821                                                 async_extent->start,
822                                                 ins.objectid,
823                                                 async_extent->ram_size,
824                                                 ins.offset,
825                                                 BTRFS_ORDERED_COMPRESSED,
826                                                 async_extent->compress_type);
827                 if (ret) {
828                         btrfs_drop_extent_cache(BTRFS_I(inode),
829                                                 async_extent->start,
830                                                 async_extent->start +
831                                                 async_extent->ram_size - 1, 0);
832                         goto out_free_reserve;
833                 }
834                 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
835
836                 /*
837                  * clear dirty, set writeback and unlock the pages.
838                  */
839                 extent_clear_unlock_delalloc(inode, async_extent->start,
840                                 async_extent->start +
841                                 async_extent->ram_size - 1,
842                                 async_extent->start +
843                                 async_extent->ram_size - 1,
844                                 NULL, EXTENT_LOCKED | EXTENT_DELALLOC,
845                                 PAGE_UNLOCK | PAGE_CLEAR_DIRTY |
846                                 PAGE_SET_WRITEBACK);
847                 if (btrfs_submit_compressed_write(inode,
848                                     async_extent->start,
849                                     async_extent->ram_size,
850                                     ins.objectid,
851                                     ins.offset, async_extent->pages,
852                                     async_extent->nr_pages,
853                                     async_cow->write_flags)) {
854                         struct extent_io_tree *tree = &BTRFS_I(inode)->io_tree;
855                         struct page *p = async_extent->pages[0];
856                         const u64 start = async_extent->start;
857                         const u64 end = start + async_extent->ram_size - 1;
858
859                         p->mapping = inode->i_mapping;
860                         tree->ops->writepage_end_io_hook(p, start, end,
861                                                          NULL, 0);
862                         p->mapping = NULL;
863                         extent_clear_unlock_delalloc(inode, start, end, end,
864                                                      NULL, 0,
865                                                      PAGE_END_WRITEBACK |
866                                                      PAGE_SET_ERROR);
867                         free_async_extent_pages(async_extent);
868                 }
869                 alloc_hint = ins.objectid + ins.offset;
870                 kfree(async_extent);
871                 cond_resched();
872         }
873         return;
874 out_free_reserve:
875         btrfs_dec_block_group_reservations(fs_info, ins.objectid);
876         btrfs_free_reserved_extent(fs_info, ins.objectid, ins.offset, 1);
877 out_free:
878         extent_clear_unlock_delalloc(inode, async_extent->start,
879                                      async_extent->start +
880                                      async_extent->ram_size - 1,
881                                      async_extent->start +
882                                      async_extent->ram_size - 1,
883                                      NULL, EXTENT_LOCKED | EXTENT_DELALLOC |
884                                      EXTENT_DELALLOC_NEW |
885                                      EXTENT_DEFRAG | EXTENT_DO_ACCOUNTING,
886                                      PAGE_UNLOCK | PAGE_CLEAR_DIRTY |
887                                      PAGE_SET_WRITEBACK | PAGE_END_WRITEBACK |
888                                      PAGE_SET_ERROR);
889         free_async_extent_pages(async_extent);
890         kfree(async_extent);
891         goto again;
892 }
893
894 static u64 get_extent_allocation_hint(struct inode *inode, u64 start,
895                                       u64 num_bytes)
896 {
897         struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
898         struct extent_map *em;
899         u64 alloc_hint = 0;
900
901         read_lock(&em_tree->lock);
902         em = search_extent_mapping(em_tree, start, num_bytes);
903         if (em) {
904                 /*
905                  * if block start isn't an actual block number then find the
906                  * first block in this inode and use that as a hint.  If that
907                  * block is also bogus then just don't worry about it.
908                  */
909                 if (em->block_start >= EXTENT_MAP_LAST_BYTE) {
910                         free_extent_map(em);
911                         em = search_extent_mapping(em_tree, 0, 0);
912                         if (em && em->block_start < EXTENT_MAP_LAST_BYTE)
913                                 alloc_hint = em->block_start;
914                         if (em)
915                                 free_extent_map(em);
916                 } else {
917                         alloc_hint = em->block_start;
918                         free_extent_map(em);
919                 }
920         }
921         read_unlock(&em_tree->lock);
922
923         return alloc_hint;
924 }
925
926 /*
927  * when extent_io.c finds a delayed allocation range in the file,
928  * the call backs end up in this code.  The basic idea is to
929  * allocate extents on disk for the range, and create ordered data structs
930  * in ram to track those extents.
931  *
932  * locked_page is the page that writepage had locked already.  We use
933  * it to make sure we don't do extra locks or unlocks.
934  *
935  * *page_started is set to one if we unlock locked_page and do everything
936  * required to start IO on it.  It may be clean and already done with
937  * IO when we return.
938  */
939 static noinline int cow_file_range(struct inode *inode,
940                                    struct page *locked_page,
941                                    u64 start, u64 end, u64 delalloc_end,
942                                    int *page_started, unsigned long *nr_written,
943                                    int unlock, struct btrfs_dedupe_hash *hash)
944 {
945         struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
946         struct btrfs_root *root = BTRFS_I(inode)->root;
947         u64 alloc_hint = 0;
948         u64 num_bytes;
949         unsigned long ram_size;
950         u64 cur_alloc_size = 0;
951         u64 blocksize = fs_info->sectorsize;
952         struct btrfs_key ins;
953         struct extent_map *em;
954         unsigned clear_bits;
955         unsigned long page_ops;
956         bool extent_reserved = false;
957         int ret = 0;
958
959         if (btrfs_is_free_space_inode(BTRFS_I(inode))) {
960                 WARN_ON_ONCE(1);
961                 ret = -EINVAL;
962                 goto out_unlock;
963         }
964
965         num_bytes = ALIGN(end - start + 1, blocksize);
966         num_bytes = max(blocksize,  num_bytes);
967         ASSERT(num_bytes <= btrfs_super_total_bytes(fs_info->super_copy));
968
969         inode_should_defrag(BTRFS_I(inode), start, end, num_bytes, SZ_64K);
970
971         if (start == 0) {
972                 /* lets try to make an inline extent */
973                 ret = cow_file_range_inline(inode, start, end, 0,
974                                             BTRFS_COMPRESS_NONE, NULL);
975                 if (ret == 0) {
976                         /*
977                          * We use DO_ACCOUNTING here because we need the
978                          * delalloc_release_metadata to be run _after_ we drop
979                          * our outstanding extent for clearing delalloc for this
980                          * range.
981                          */
982                         extent_clear_unlock_delalloc(inode, start, end,
983                                      delalloc_end, NULL,
984                                      EXTENT_LOCKED | EXTENT_DELALLOC |
985                                      EXTENT_DELALLOC_NEW | EXTENT_DEFRAG |
986                                      EXTENT_DO_ACCOUNTING, PAGE_UNLOCK |
987                                      PAGE_CLEAR_DIRTY | PAGE_SET_WRITEBACK |
988                                      PAGE_END_WRITEBACK);
989                         *nr_written = *nr_written +
990                              (end - start + PAGE_SIZE) / PAGE_SIZE;
991                         *page_started = 1;
992                         goto out;
993                 } else if (ret < 0) {
994                         goto out_unlock;
995                 }
996         }
997
998         alloc_hint = get_extent_allocation_hint(inode, start, num_bytes);
999         btrfs_drop_extent_cache(BTRFS_I(inode), start,
1000                         start + num_bytes - 1, 0);
1001
1002         while (num_bytes > 0) {
1003                 cur_alloc_size = num_bytes;
1004                 ret = btrfs_reserve_extent(root, cur_alloc_size, cur_alloc_size,
1005                                            fs_info->sectorsize, 0, alloc_hint,
1006                                            &ins, 1, 1);
1007                 if (ret < 0)
1008                         goto out_unlock;
1009                 cur_alloc_size = ins.offset;
1010                 extent_reserved = true;
1011
1012                 ram_size = ins.offset;
1013                 em = create_io_em(inode, start, ins.offset, /* len */
1014                                   start, /* orig_start */
1015                                   ins.objectid, /* block_start */
1016                                   ins.offset, /* block_len */
1017                                   ins.offset, /* orig_block_len */
1018                                   ram_size, /* ram_bytes */
1019                                   BTRFS_COMPRESS_NONE, /* compress_type */
1020                                   BTRFS_ORDERED_REGULAR /* type */);
1021                 if (IS_ERR(em))
1022                         goto out_reserve;
1023                 free_extent_map(em);
1024
1025                 ret = btrfs_add_ordered_extent(inode, start, ins.objectid,
1026                                                ram_size, cur_alloc_size, 0);
1027                 if (ret)
1028                         goto out_drop_extent_cache;
1029
1030                 if (root->root_key.objectid ==
1031                     BTRFS_DATA_RELOC_TREE_OBJECTID) {
1032                         ret = btrfs_reloc_clone_csums(inode, start,
1033                                                       cur_alloc_size);
1034                         /*
1035                          * Only drop cache here, and process as normal.
1036                          *
1037                          * We must not allow extent_clear_unlock_delalloc()
1038                          * at out_unlock label to free meta of this ordered
1039                          * extent, as its meta should be freed by
1040                          * btrfs_finish_ordered_io().
1041                          *
1042                          * So we must continue until @start is increased to
1043                          * skip current ordered extent.
1044                          */
1045                         if (ret)
1046                                 btrfs_drop_extent_cache(BTRFS_I(inode), start,
1047                                                 start + ram_size - 1, 0);
1048                 }
1049
1050                 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
1051
1052                 /* we're not doing compressed IO, don't unlock the first
1053                  * page (which the caller expects to stay locked), don't
1054                  * clear any dirty bits and don't set any writeback bits
1055                  *
1056                  * Do set the Private2 bit so we know this page was properly
1057                  * setup for writepage
1058                  */
1059                 page_ops = unlock ? PAGE_UNLOCK : 0;
1060                 page_ops |= PAGE_SET_PRIVATE2;
1061
1062                 extent_clear_unlock_delalloc(inode, start,
1063                                              start + ram_size - 1,
1064                                              delalloc_end, locked_page,
1065                                              EXTENT_LOCKED | EXTENT_DELALLOC,
1066                                              page_ops);
1067                 if (num_bytes < cur_alloc_size)
1068                         num_bytes = 0;
1069                 else
1070                         num_bytes -= cur_alloc_size;
1071                 alloc_hint = ins.objectid + ins.offset;
1072                 start += cur_alloc_size;
1073                 extent_reserved = false;
1074
1075                 /*
1076                  * btrfs_reloc_clone_csums() error, since start is increased
1077                  * extent_clear_unlock_delalloc() at out_unlock label won't
1078                  * free metadata of current ordered extent, we're OK to exit.
1079                  */
1080                 if (ret)
1081                         goto out_unlock;
1082         }
1083 out:
1084         return ret;
1085
1086 out_drop_extent_cache:
1087         btrfs_drop_extent_cache(BTRFS_I(inode), start, start + ram_size - 1, 0);
1088 out_reserve:
1089         btrfs_dec_block_group_reservations(fs_info, ins.objectid);
1090         btrfs_free_reserved_extent(fs_info, ins.objectid, ins.offset, 1);
1091 out_unlock:
1092         clear_bits = EXTENT_LOCKED | EXTENT_DELALLOC | EXTENT_DELALLOC_NEW |
1093                 EXTENT_DEFRAG | EXTENT_CLEAR_META_RESV;
1094         page_ops = PAGE_UNLOCK | PAGE_CLEAR_DIRTY | PAGE_SET_WRITEBACK |
1095                 PAGE_END_WRITEBACK;
1096         /*
1097          * If we reserved an extent for our delalloc range (or a subrange) and
1098          * failed to create the respective ordered extent, then it means that
1099          * when we reserved the extent we decremented the extent's size from
1100          * the data space_info's bytes_may_use counter and incremented the
1101          * space_info's bytes_reserved counter by the same amount. We must make
1102          * sure extent_clear_unlock_delalloc() does not try to decrement again
1103          * the data space_info's bytes_may_use counter, therefore we do not pass
1104          * it the flag EXTENT_CLEAR_DATA_RESV.
1105          */
1106         if (extent_reserved) {
1107                 extent_clear_unlock_delalloc(inode, start,
1108                                              start + cur_alloc_size,
1109                                              start + cur_alloc_size,
1110                                              locked_page,
1111                                              clear_bits,
1112                                              page_ops);
1113                 start += cur_alloc_size;
1114                 if (start >= end)
1115                         goto out;
1116         }
1117         extent_clear_unlock_delalloc(inode, start, end, delalloc_end,
1118                                      locked_page,
1119                                      clear_bits | EXTENT_CLEAR_DATA_RESV,
1120                                      page_ops);
1121         goto out;
1122 }
1123
1124 /*
1125  * work queue call back to started compression on a file and pages
1126  */
1127 static noinline void async_cow_start(struct btrfs_work *work)
1128 {
1129         struct async_cow *async_cow;
1130         int num_added = 0;
1131         async_cow = container_of(work, struct async_cow, work);
1132
1133         compress_file_range(async_cow->inode, async_cow->locked_page,
1134                             async_cow->start, async_cow->end, async_cow,
1135                             &num_added);
1136         if (num_added == 0) {
1137                 btrfs_add_delayed_iput(async_cow->inode);
1138                 async_cow->inode = NULL;
1139         }
1140 }
1141
1142 /*
1143  * work queue call back to submit previously compressed pages
1144  */
1145 static noinline void async_cow_submit(struct btrfs_work *work)
1146 {
1147         struct btrfs_fs_info *fs_info;
1148         struct async_cow *async_cow;
1149         struct btrfs_root *root;
1150         unsigned long nr_pages;
1151
1152         async_cow = container_of(work, struct async_cow, work);
1153
1154         root = async_cow->root;
1155         fs_info = root->fs_info;
1156         nr_pages = (async_cow->end - async_cow->start + PAGE_SIZE) >>
1157                 PAGE_SHIFT;
1158
1159         /*
1160          * atomic_sub_return implies a barrier for waitqueue_active
1161          */
1162         if (atomic_sub_return(nr_pages, &fs_info->async_delalloc_pages) <
1163             5 * SZ_1M &&
1164             waitqueue_active(&fs_info->async_submit_wait))
1165                 wake_up(&fs_info->async_submit_wait);
1166
1167         if (async_cow->inode)
1168                 submit_compressed_extents(async_cow->inode, async_cow);
1169 }
1170
1171 static noinline void async_cow_free(struct btrfs_work *work)
1172 {
1173         struct async_cow *async_cow;
1174         async_cow = container_of(work, struct async_cow, work);
1175         if (async_cow->inode)
1176                 btrfs_add_delayed_iput(async_cow->inode);
1177         kfree(async_cow);
1178 }
1179
1180 static int cow_file_range_async(struct inode *inode, struct page *locked_page,
1181                                 u64 start, u64 end, int *page_started,
1182                                 unsigned long *nr_written,
1183                                 unsigned int write_flags)
1184 {
1185         struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
1186         struct async_cow *async_cow;
1187         struct btrfs_root *root = BTRFS_I(inode)->root;
1188         unsigned long nr_pages;
1189         u64 cur_end;
1190
1191         clear_extent_bit(&BTRFS_I(inode)->io_tree, start, end, EXTENT_LOCKED,
1192                          1, 0, NULL);
1193         while (start < end) {
1194                 async_cow = kmalloc(sizeof(*async_cow), GFP_NOFS);
1195                 BUG_ON(!async_cow); /* -ENOMEM */
1196                 async_cow->inode = igrab(inode);
1197                 async_cow->root = root;
1198                 async_cow->locked_page = locked_page;
1199                 async_cow->start = start;
1200                 async_cow->write_flags = write_flags;
1201
1202                 if (BTRFS_I(inode)->flags & BTRFS_INODE_NOCOMPRESS &&
1203                     !btrfs_test_opt(fs_info, FORCE_COMPRESS))
1204                         cur_end = end;
1205                 else
1206                         cur_end = min(end, start + SZ_512K - 1);
1207
1208                 async_cow->end = cur_end;
1209                 INIT_LIST_HEAD(&async_cow->extents);
1210
1211                 btrfs_init_work(&async_cow->work,
1212                                 btrfs_delalloc_helper,
1213                                 async_cow_start, async_cow_submit,
1214                                 async_cow_free);
1215
1216                 nr_pages = (cur_end - start + PAGE_SIZE) >>
1217                         PAGE_SHIFT;
1218                 atomic_add(nr_pages, &fs_info->async_delalloc_pages);
1219
1220                 btrfs_queue_work(fs_info->delalloc_workers, &async_cow->work);
1221
1222                 *nr_written += nr_pages;
1223                 start = cur_end + 1;
1224         }
1225         *page_started = 1;
1226         return 0;
1227 }
1228
1229 static noinline int csum_exist_in_range(struct btrfs_fs_info *fs_info,
1230                                         u64 bytenr, u64 num_bytes)
1231 {
1232         int ret;
1233         struct btrfs_ordered_sum *sums;
1234         LIST_HEAD(list);
1235
1236         ret = btrfs_lookup_csums_range(fs_info->csum_root, bytenr,
1237                                        bytenr + num_bytes - 1, &list, 0);
1238         if (ret == 0 && list_empty(&list))
1239                 return 0;
1240
1241         while (!list_empty(&list)) {
1242                 sums = list_entry(list.next, struct btrfs_ordered_sum, list);
1243                 list_del(&sums->list);
1244                 kfree(sums);
1245         }
1246         if (ret < 0)
1247                 return ret;
1248         return 1;
1249 }
1250
1251 /*
1252  * when nowcow writeback call back.  This checks for snapshots or COW copies
1253  * of the extents that exist in the file, and COWs the file as required.
1254  *
1255  * If no cow copies or snapshots exist, we write directly to the existing
1256  * blocks on disk
1257  */
1258 static noinline int run_delalloc_nocow(struct inode *inode,
1259                                        struct page *locked_page,
1260                               u64 start, u64 end, int *page_started, int force,
1261                               unsigned long *nr_written)
1262 {
1263         struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
1264         struct btrfs_root *root = BTRFS_I(inode)->root;
1265         struct extent_buffer *leaf;
1266         struct btrfs_path *path;
1267         struct btrfs_file_extent_item *fi;
1268         struct btrfs_key found_key;
1269         struct extent_map *em;
1270         u64 cow_start;
1271         u64 cur_offset;
1272         u64 extent_end;
1273         u64 extent_offset;
1274         u64 disk_bytenr;
1275         u64 num_bytes;
1276         u64 disk_num_bytes;
1277         u64 ram_bytes;
1278         int extent_type;
1279         int ret, err;
1280         int type;
1281         int nocow;
1282         int check_prev = 1;
1283         bool nolock;
1284         u64 ino = btrfs_ino(BTRFS_I(inode));
1285
1286         path = btrfs_alloc_path();
1287         if (!path) {
1288                 extent_clear_unlock_delalloc(inode, start, end, end,
1289                                              locked_page,
1290                                              EXTENT_LOCKED | EXTENT_DELALLOC |
1291                                              EXTENT_DO_ACCOUNTING |
1292                                              EXTENT_DEFRAG, PAGE_UNLOCK |
1293                                              PAGE_CLEAR_DIRTY |
1294                                              PAGE_SET_WRITEBACK |
1295                                              PAGE_END_WRITEBACK);
1296                 return -ENOMEM;
1297         }
1298
1299         nolock = btrfs_is_free_space_inode(BTRFS_I(inode));
1300
1301         cow_start = (u64)-1;
1302         cur_offset = start;
1303         while (1) {
1304                 ret = btrfs_lookup_file_extent(NULL, root, path, ino,
1305                                                cur_offset, 0);
1306                 if (ret < 0)
1307                         goto error;
1308                 if (ret > 0 && path->slots[0] > 0 && check_prev) {
1309                         leaf = path->nodes[0];
1310                         btrfs_item_key_to_cpu(leaf, &found_key,
1311                                               path->slots[0] - 1);
1312                         if (found_key.objectid == ino &&
1313                             found_key.type == BTRFS_EXTENT_DATA_KEY)
1314                                 path->slots[0]--;
1315                 }
1316                 check_prev = 0;
1317 next_slot:
1318                 leaf = path->nodes[0];
1319                 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
1320                         ret = btrfs_next_leaf(root, path);
1321                         if (ret < 0) {
1322                                 if (cow_start != (u64)-1)
1323                                         cur_offset = cow_start;
1324                                 goto error;
1325                         }
1326                         if (ret > 0)
1327                                 break;
1328                         leaf = path->nodes[0];
1329                 }
1330
1331                 nocow = 0;
1332                 disk_bytenr = 0;
1333                 num_bytes = 0;
1334                 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
1335
1336                 if (found_key.objectid > ino)
1337                         break;
1338                 if (WARN_ON_ONCE(found_key.objectid < ino) ||
1339                     found_key.type < BTRFS_EXTENT_DATA_KEY) {
1340                         path->slots[0]++;
1341                         goto next_slot;
1342                 }
1343                 if (found_key.type > BTRFS_EXTENT_DATA_KEY ||
1344                     found_key.offset > end)
1345                         break;
1346
1347                 if (found_key.offset > cur_offset) {
1348                         extent_end = found_key.offset;
1349                         extent_type = 0;
1350                         goto out_check;
1351                 }
1352
1353                 fi = btrfs_item_ptr(leaf, path->slots[0],
1354                                     struct btrfs_file_extent_item);
1355                 extent_type = btrfs_file_extent_type(leaf, fi);
1356
1357                 ram_bytes = btrfs_file_extent_ram_bytes(leaf, fi);
1358                 if (extent_type == BTRFS_FILE_EXTENT_REG ||
1359                     extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
1360                         disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
1361                         extent_offset = btrfs_file_extent_offset(leaf, fi);
1362                         extent_end = found_key.offset +
1363                                 btrfs_file_extent_num_bytes(leaf, fi);
1364                         disk_num_bytes =
1365                                 btrfs_file_extent_disk_num_bytes(leaf, fi);
1366                         if (extent_end <= start) {
1367                                 path->slots[0]++;
1368                                 goto next_slot;
1369                         }
1370                         if (disk_bytenr == 0)
1371                                 goto out_check;
1372                         if (btrfs_file_extent_compression(leaf, fi) ||
1373                             btrfs_file_extent_encryption(leaf, fi) ||
1374                             btrfs_file_extent_other_encoding(leaf, fi))
1375                                 goto out_check;
1376                         if (extent_type == BTRFS_FILE_EXTENT_REG && !force)
1377                                 goto out_check;
1378                         if (btrfs_extent_readonly(fs_info, disk_bytenr))
1379                                 goto out_check;
1380                         ret = btrfs_cross_ref_exist(root, ino,
1381                                                     found_key.offset -
1382                                                     extent_offset, disk_bytenr);
1383                         if (ret) {
1384                                 /*
1385                                  * ret could be -EIO if the above fails to read
1386                                  * metadata.
1387                                  */
1388                                 if (ret < 0) {
1389                                         if (cow_start != (u64)-1)
1390                                                 cur_offset = cow_start;
1391                                         goto error;
1392                                 }
1393
1394                                 WARN_ON_ONCE(nolock);
1395                                 goto out_check;
1396                         }
1397                         disk_bytenr += extent_offset;
1398                         disk_bytenr += cur_offset - found_key.offset;
1399                         num_bytes = min(end + 1, extent_end) - cur_offset;
1400                         /*
1401                          * if there are pending snapshots for this root,
1402                          * we fall into common COW way.
1403                          */
1404                         if (!nolock) {
1405                                 err = btrfs_start_write_no_snapshotting(root);
1406                                 if (!err)
1407                                         goto out_check;
1408                         }
1409                         /*
1410                          * force cow if csum exists in the range.
1411                          * this ensure that csum for a given extent are
1412                          * either valid or do not exist.
1413                          */
1414                         ret = csum_exist_in_range(fs_info, disk_bytenr,
1415                                                   num_bytes);
1416                         if (ret) {
1417                                 if (!nolock)
1418                                         btrfs_end_write_no_snapshotting(root);
1419
1420                                 /*
1421                                  * ret could be -EIO if the above fails to read
1422                                  * metadata.
1423                                  */
1424                                 if (ret < 0) {
1425                                         if (cow_start != (u64)-1)
1426                                                 cur_offset = cow_start;
1427                                         goto error;
1428                                 }
1429                                 WARN_ON_ONCE(nolock);
1430                                 goto out_check;
1431                         }
1432                         if (!btrfs_inc_nocow_writers(fs_info, disk_bytenr)) {
1433                                 if (!nolock)
1434                                         btrfs_end_write_no_snapshotting(root);
1435                                 goto out_check;
1436                         }
1437                         nocow = 1;
1438                 } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
1439                         extent_end = found_key.offset +
1440                                 btrfs_file_extent_inline_len(leaf,
1441                                                      path->slots[0], fi);
1442                         extent_end = ALIGN(extent_end,
1443                                            fs_info->sectorsize);
1444                 } else {
1445                         BUG_ON(1);
1446                 }
1447 out_check:
1448                 if (extent_end <= start) {
1449                         path->slots[0]++;
1450                         if (!nolock && nocow)
1451                                 btrfs_end_write_no_snapshotting(root);
1452                         if (nocow)
1453                                 btrfs_dec_nocow_writers(fs_info, disk_bytenr);
1454                         goto next_slot;
1455                 }
1456                 if (!nocow) {
1457                         if (cow_start == (u64)-1)
1458                                 cow_start = cur_offset;
1459                         cur_offset = extent_end;
1460                         if (cur_offset > end)
1461                                 break;
1462                         path->slots[0]++;
1463                         goto next_slot;
1464                 }
1465
1466                 btrfs_release_path(path);
1467                 if (cow_start != (u64)-1) {
1468                         ret = cow_file_range(inode, locked_page,
1469                                              cow_start, found_key.offset - 1,
1470                                              end, page_started, nr_written, 1,
1471                                              NULL);
1472                         if (ret) {
1473                                 if (!nolock && nocow)
1474                                         btrfs_end_write_no_snapshotting(root);
1475                                 if (nocow)
1476                                         btrfs_dec_nocow_writers(fs_info,
1477                                                                 disk_bytenr);
1478                                 goto error;
1479                         }
1480                         cow_start = (u64)-1;
1481                 }
1482
1483                 if (extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
1484                         u64 orig_start = found_key.offset - extent_offset;
1485
1486                         em = create_io_em(inode, cur_offset, num_bytes,
1487                                           orig_start,
1488                                           disk_bytenr, /* block_start */
1489                                           num_bytes, /* block_len */
1490                                           disk_num_bytes, /* orig_block_len */
1491                                           ram_bytes, BTRFS_COMPRESS_NONE,
1492                                           BTRFS_ORDERED_PREALLOC);
1493                         if (IS_ERR(em)) {
1494                                 if (!nolock && nocow)
1495                                         btrfs_end_write_no_snapshotting(root);
1496                                 if (nocow)
1497                                         btrfs_dec_nocow_writers(fs_info,
1498                                                                 disk_bytenr);
1499                                 ret = PTR_ERR(em);
1500                                 goto error;
1501                         }
1502                         free_extent_map(em);
1503                 }
1504
1505                 if (extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
1506                         type = BTRFS_ORDERED_PREALLOC;
1507                 } else {
1508                         type = BTRFS_ORDERED_NOCOW;
1509                 }
1510
1511                 ret = btrfs_add_ordered_extent(inode, cur_offset, disk_bytenr,
1512                                                num_bytes, num_bytes, type);
1513                 if (nocow)
1514                         btrfs_dec_nocow_writers(fs_info, disk_bytenr);
1515                 BUG_ON(ret); /* -ENOMEM */
1516
1517                 if (root->root_key.objectid ==
1518                     BTRFS_DATA_RELOC_TREE_OBJECTID)
1519                         /*
1520                          * Error handled later, as we must prevent
1521                          * extent_clear_unlock_delalloc() in error handler
1522                          * from freeing metadata of created ordered extent.
1523                          */
1524                         ret = btrfs_reloc_clone_csums(inode, cur_offset,
1525                                                       num_bytes);
1526
1527                 extent_clear_unlock_delalloc(inode, cur_offset,
1528                                              cur_offset + num_bytes - 1, end,
1529                                              locked_page, EXTENT_LOCKED |
1530                                              EXTENT_DELALLOC |
1531                                              EXTENT_CLEAR_DATA_RESV,
1532                                              PAGE_UNLOCK | PAGE_SET_PRIVATE2);
1533
1534                 if (!nolock && nocow)
1535                         btrfs_end_write_no_snapshotting(root);
1536                 cur_offset = extent_end;
1537
1538                 /*
1539                  * btrfs_reloc_clone_csums() error, now we're OK to call error
1540                  * handler, as metadata for created ordered extent will only
1541                  * be freed by btrfs_finish_ordered_io().
1542                  */
1543                 if (ret)
1544                         goto error;
1545                 if (cur_offset > end)
1546                         break;
1547         }
1548         btrfs_release_path(path);
1549
1550         if (cur_offset <= end && cow_start == (u64)-1) {
1551                 cow_start = cur_offset;
1552                 cur_offset = end;
1553         }
1554
1555         if (cow_start != (u64)-1) {
1556                 ret = cow_file_range(inode, locked_page, cow_start, end, end,
1557                                      page_started, nr_written, 1, NULL);
1558                 if (ret)
1559                         goto error;
1560         }
1561
1562 error:
1563         if (ret && cur_offset < end)
1564                 extent_clear_unlock_delalloc(inode, cur_offset, end, end,
1565                                              locked_page, EXTENT_LOCKED |
1566                                              EXTENT_DELALLOC | EXTENT_DEFRAG |
1567                                              EXTENT_DO_ACCOUNTING, PAGE_UNLOCK |
1568                                              PAGE_CLEAR_DIRTY |
1569                                              PAGE_SET_WRITEBACK |
1570                                              PAGE_END_WRITEBACK);
1571         btrfs_free_path(path);
1572         return ret;
1573 }
1574
1575 static inline int need_force_cow(struct inode *inode, u64 start, u64 end)
1576 {
1577
1578         if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW) &&
1579             !(BTRFS_I(inode)->flags & BTRFS_INODE_PREALLOC))
1580                 return 0;
1581
1582         /*
1583          * @defrag_bytes is a hint value, no spinlock held here,
1584          * if is not zero, it means the file is defragging.
1585          * Force cow if given extent needs to be defragged.
1586          */
1587         if (BTRFS_I(inode)->defrag_bytes &&
1588             test_range_bit(&BTRFS_I(inode)->io_tree, start, end,
1589                            EXTENT_DEFRAG, 0, NULL))
1590                 return 1;
1591
1592         return 0;
1593 }
1594
1595 /*
1596  * extent_io.c call back to do delayed allocation processing
1597  */
1598 static int run_delalloc_range(void *private_data, struct page *locked_page,
1599                               u64 start, u64 end, int *page_started,
1600                               unsigned long *nr_written,
1601                               struct writeback_control *wbc)
1602 {
1603         struct inode *inode = private_data;
1604         int ret;
1605         int force_cow = need_force_cow(inode, start, end);
1606         unsigned int write_flags = wbc_to_write_flags(wbc);
1607
1608         if (BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW && !force_cow) {
1609                 ret = run_delalloc_nocow(inode, locked_page, start, end,
1610                                          page_started, 1, nr_written);
1611         } else if (BTRFS_I(inode)->flags & BTRFS_INODE_PREALLOC && !force_cow) {
1612                 ret = run_delalloc_nocow(inode, locked_page, start, end,
1613                                          page_started, 0, nr_written);
1614         } else if (!inode_need_compress(inode, start, end)) {
1615                 ret = cow_file_range(inode, locked_page, start, end, end,
1616                                       page_started, nr_written, 1, NULL);
1617         } else {
1618                 set_bit(BTRFS_INODE_HAS_ASYNC_EXTENT,
1619                         &BTRFS_I(inode)->runtime_flags);
1620                 ret = cow_file_range_async(inode, locked_page, start, end,
1621                                            page_started, nr_written,
1622                                            write_flags);
1623         }
1624         if (ret)
1625                 btrfs_cleanup_ordered_extents(inode, start, end - start + 1);
1626         return ret;
1627 }
1628
1629 static void btrfs_split_extent_hook(void *private_data,
1630                                     struct extent_state *orig, u64 split)
1631 {
1632         struct inode *inode = private_data;
1633         u64 size;
1634
1635         /* not delalloc, ignore it */
1636         if (!(orig->state & EXTENT_DELALLOC))
1637                 return;
1638
1639         size = orig->end - orig->start + 1;
1640         if (size > BTRFS_MAX_EXTENT_SIZE) {
1641                 u32 num_extents;
1642                 u64 new_size;
1643
1644                 /*
1645                  * See the explanation in btrfs_merge_extent_hook, the same
1646                  * applies here, just in reverse.
1647                  */
1648                 new_size = orig->end - split + 1;
1649                 num_extents = count_max_extents(new_size);
1650                 new_size = split - orig->start;
1651                 num_extents += count_max_extents(new_size);
1652                 if (count_max_extents(size) >= num_extents)
1653                         return;
1654         }
1655
1656         spin_lock(&BTRFS_I(inode)->lock);
1657         btrfs_mod_outstanding_extents(BTRFS_I(inode), 1);
1658         spin_unlock(&BTRFS_I(inode)->lock);
1659 }
1660
1661 /*
1662  * extent_io.c merge_extent_hook, used to track merged delayed allocation
1663  * extents so we can keep track of new extents that are just merged onto old
1664  * extents, such as when we are doing sequential writes, so we can properly
1665  * account for the metadata space we'll need.
1666  */
1667 static void btrfs_merge_extent_hook(void *private_data,
1668                                     struct extent_state *new,
1669                                     struct extent_state *other)
1670 {
1671         struct inode *inode = private_data;
1672         u64 new_size, old_size;
1673         u32 num_extents;
1674
1675         /* not delalloc, ignore it */
1676         if (!(other->state & EXTENT_DELALLOC))
1677                 return;
1678
1679         if (new->start > other->start)
1680                 new_size = new->end - other->start + 1;
1681         else
1682                 new_size = other->end - new->start + 1;
1683
1684         /* we're not bigger than the max, unreserve the space and go */
1685         if (new_size <= BTRFS_MAX_EXTENT_SIZE) {
1686                 spin_lock(&BTRFS_I(inode)->lock);
1687                 btrfs_mod_outstanding_extents(BTRFS_I(inode), -1);
1688                 spin_unlock(&BTRFS_I(inode)->lock);
1689                 return;
1690         }
1691
1692         /*
1693          * We have to add up either side to figure out how many extents were
1694          * accounted for before we merged into one big extent.  If the number of
1695          * extents we accounted for is <= the amount we need for the new range
1696          * then we can return, otherwise drop.  Think of it like this
1697          *
1698          * [ 4k][MAX_SIZE]
1699          *
1700          * So we've grown the extent by a MAX_SIZE extent, this would mean we
1701          * need 2 outstanding extents, on one side we have 1 and the other side
1702          * we have 1 so they are == and we can return.  But in this case
1703          *
1704          * [MAX_SIZE+4k][MAX_SIZE+4k]
1705          *
1706          * Each range on their own accounts for 2 extents, but merged together
1707          * they are only 3 extents worth of accounting, so we need to drop in
1708          * this case.
1709          */
1710         old_size = other->end - other->start + 1;
1711         num_extents = count_max_extents(old_size);
1712         old_size = new->end - new->start + 1;
1713         num_extents += count_max_extents(old_size);
1714         if (count_max_extents(new_size) >= num_extents)
1715                 return;
1716
1717         spin_lock(&BTRFS_I(inode)->lock);
1718         btrfs_mod_outstanding_extents(BTRFS_I(inode), -1);
1719         spin_unlock(&BTRFS_I(inode)->lock);
1720 }
1721
1722 static void btrfs_add_delalloc_inodes(struct btrfs_root *root,
1723                                       struct inode *inode)
1724 {
1725         struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
1726
1727         spin_lock(&root->delalloc_lock);
1728         if (list_empty(&BTRFS_I(inode)->delalloc_inodes)) {
1729                 list_add_tail(&BTRFS_I(inode)->delalloc_inodes,
1730                               &root->delalloc_inodes);
1731                 set_bit(BTRFS_INODE_IN_DELALLOC_LIST,
1732                         &BTRFS_I(inode)->runtime_flags);
1733                 root->nr_delalloc_inodes++;
1734                 if (root->nr_delalloc_inodes == 1) {
1735                         spin_lock(&fs_info->delalloc_root_lock);
1736                         BUG_ON(!list_empty(&root->delalloc_root));
1737                         list_add_tail(&root->delalloc_root,
1738                                       &fs_info->delalloc_roots);
1739                         spin_unlock(&fs_info->delalloc_root_lock);
1740                 }
1741         }
1742         spin_unlock(&root->delalloc_lock);
1743 }
1744
1745
1746 void __btrfs_del_delalloc_inode(struct btrfs_root *root,
1747                                 struct btrfs_inode *inode)
1748 {
1749         struct btrfs_fs_info *fs_info = btrfs_sb(inode->vfs_inode.i_sb);
1750
1751         if (!list_empty(&inode->delalloc_inodes)) {
1752                 list_del_init(&inode->delalloc_inodes);
1753                 clear_bit(BTRFS_INODE_IN_DELALLOC_LIST,
1754                           &inode->runtime_flags);
1755                 root->nr_delalloc_inodes--;
1756                 if (!root->nr_delalloc_inodes) {
1757                         spin_lock(&fs_info->delalloc_root_lock);
1758                         BUG_ON(list_empty(&root->delalloc_root));
1759                         list_del_init(&root->delalloc_root);
1760                         spin_unlock(&fs_info->delalloc_root_lock);
1761                 }
1762         }
1763 }
1764
1765 static void btrfs_del_delalloc_inode(struct btrfs_root *root,
1766                                      struct btrfs_inode *inode)
1767 {
1768         spin_lock(&root->delalloc_lock);
1769         __btrfs_del_delalloc_inode(root, inode);
1770         spin_unlock(&root->delalloc_lock);
1771 }
1772
1773 /*
1774  * extent_io.c set_bit_hook, used to track delayed allocation
1775  * bytes in this file, and to maintain the list of inodes that
1776  * have pending delalloc work to be done.
1777  */
1778 static void btrfs_set_bit_hook(void *private_data,
1779                                struct extent_state *state, unsigned *bits)
1780 {
1781         struct inode *inode = private_data;
1782
1783         struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
1784
1785         if ((*bits & EXTENT_DEFRAG) && !(*bits & EXTENT_DELALLOC))
1786                 WARN_ON(1);
1787         /*
1788          * set_bit and clear bit hooks normally require _irqsave/restore
1789          * but in this case, we are only testing for the DELALLOC
1790          * bit, which is only set or cleared with irqs on
1791          */
1792         if (!(state->state & EXTENT_DELALLOC) && (*bits & EXTENT_DELALLOC)) {
1793                 struct btrfs_root *root = BTRFS_I(inode)->root;
1794                 u64 len = state->end + 1 - state->start;
1795                 u32 num_extents = count_max_extents(len);
1796                 bool do_list = !btrfs_is_free_space_inode(BTRFS_I(inode));
1797
1798                 spin_lock(&BTRFS_I(inode)->lock);
1799                 btrfs_mod_outstanding_extents(BTRFS_I(inode), num_extents);
1800                 spin_unlock(&BTRFS_I(inode)->lock);
1801
1802                 /* For sanity tests */
1803                 if (btrfs_is_testing(fs_info))
1804                         return;
1805
1806                 percpu_counter_add_batch(&fs_info->delalloc_bytes, len,
1807                                          fs_info->delalloc_batch);
1808                 spin_lock(&BTRFS_I(inode)->lock);
1809                 BTRFS_I(inode)->delalloc_bytes += len;
1810                 if (*bits & EXTENT_DEFRAG)
1811                         BTRFS_I(inode)->defrag_bytes += len;
1812                 if (do_list && !test_bit(BTRFS_INODE_IN_DELALLOC_LIST,
1813                                          &BTRFS_I(inode)->runtime_flags))
1814                         btrfs_add_delalloc_inodes(root, inode);
1815                 spin_unlock(&BTRFS_I(inode)->lock);
1816         }
1817
1818         if (!(state->state & EXTENT_DELALLOC_NEW) &&
1819             (*bits & EXTENT_DELALLOC_NEW)) {
1820                 spin_lock(&BTRFS_I(inode)->lock);
1821                 BTRFS_I(inode)->new_delalloc_bytes += state->end + 1 -
1822                         state->start;
1823                 spin_unlock(&BTRFS_I(inode)->lock);
1824         }
1825 }
1826
1827 /*
1828  * extent_io.c clear_bit_hook, see set_bit_hook for why
1829  */
1830 static void btrfs_clear_bit_hook(void *private_data,
1831                                  struct extent_state *state,
1832                                  unsigned *bits)
1833 {
1834         struct btrfs_inode *inode = BTRFS_I((struct inode *)private_data);
1835         struct btrfs_fs_info *fs_info = btrfs_sb(inode->vfs_inode.i_sb);
1836         u64 len = state->end + 1 - state->start;
1837         u32 num_extents = count_max_extents(len);
1838
1839         if ((state->state & EXTENT_DEFRAG) && (*bits & EXTENT_DEFRAG)) {
1840                 spin_lock(&inode->lock);
1841                 inode->defrag_bytes -= len;
1842                 spin_unlock(&inode->lock);
1843         }
1844
1845         /*
1846          * set_bit and clear bit hooks normally require _irqsave/restore
1847          * but in this case, we are only testing for the DELALLOC
1848          * bit, which is only set or cleared with irqs on
1849          */
1850         if ((state->state & EXTENT_DELALLOC) && (*bits & EXTENT_DELALLOC)) {
1851                 struct btrfs_root *root = inode->root;
1852                 bool do_list = !btrfs_is_free_space_inode(inode);
1853
1854                 spin_lock(&inode->lock);
1855                 btrfs_mod_outstanding_extents(inode, -num_extents);
1856                 spin_unlock(&inode->lock);
1857
1858                 /*
1859                  * We don't reserve metadata space for space cache inodes so we
1860                  * don't need to call dellalloc_release_metadata if there is an
1861                  * error.
1862                  */
1863                 if (*bits & EXTENT_CLEAR_META_RESV &&
1864                     root != fs_info->tree_root)
1865                         btrfs_delalloc_release_metadata(inode, len, false);
1866
1867                 /* For sanity tests. */
1868                 if (btrfs_is_testing(fs_info))
1869                         return;
1870
1871                 if (root->root_key.objectid != BTRFS_DATA_RELOC_TREE_OBJECTID &&
1872                     do_list && !(state->state & EXTENT_NORESERVE) &&
1873                     (*bits & EXTENT_CLEAR_DATA_RESV))
1874                         btrfs_free_reserved_data_space_noquota(
1875                                         &inode->vfs_inode,
1876                                         state->start, len);
1877
1878                 percpu_counter_add_batch(&fs_info->delalloc_bytes, -len,
1879                                          fs_info->delalloc_batch);
1880                 spin_lock(&inode->lock);
1881                 inode->delalloc_bytes -= len;
1882                 if (do_list && inode->delalloc_bytes == 0 &&
1883                     test_bit(BTRFS_INODE_IN_DELALLOC_LIST,
1884                                         &inode->runtime_flags))
1885                         btrfs_del_delalloc_inode(root, inode);
1886                 spin_unlock(&inode->lock);
1887         }
1888
1889         if ((state->state & EXTENT_DELALLOC_NEW) &&
1890             (*bits & EXTENT_DELALLOC_NEW)) {
1891                 spin_lock(&inode->lock);
1892                 ASSERT(inode->new_delalloc_bytes >= len);
1893                 inode->new_delalloc_bytes -= len;
1894                 spin_unlock(&inode->lock);
1895         }
1896 }
1897
1898 /*
1899  * extent_io.c merge_bio_hook, this must check the chunk tree to make sure
1900  * we don't create bios that span stripes or chunks
1901  *
1902  * return 1 if page cannot be merged to bio
1903  * return 0 if page can be merged to bio
1904  * return error otherwise
1905  */
1906 int btrfs_merge_bio_hook(struct page *page, unsigned long offset,
1907                          size_t size, struct bio *bio,
1908                          unsigned long bio_flags)
1909 {
1910         struct inode *inode = page->mapping->host;
1911         struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
1912         u64 logical = (u64)bio->bi_iter.bi_sector << 9;
1913         u64 length = 0;
1914         u64 map_length;
1915         int ret;
1916
1917         if (bio_flags & EXTENT_BIO_COMPRESSED)
1918                 return 0;
1919
1920         length = bio->bi_iter.bi_size;
1921         map_length = length;
1922         ret = btrfs_map_block(fs_info, btrfs_op(bio), logical, &map_length,
1923                               NULL, 0);
1924         if (ret < 0)
1925                 return ret;
1926         if (map_length < length + size)
1927                 return 1;
1928         return 0;
1929 }
1930
1931 /*
1932  * in order to insert checksums into the metadata in large chunks,
1933  * we wait until bio submission time.   All the pages in the bio are
1934  * checksummed and sums are attached onto the ordered extent record.
1935  *
1936  * At IO completion time the cums attached on the ordered extent record
1937  * are inserted into the btree
1938  */
1939 static blk_status_t btrfs_submit_bio_start(void *private_data, struct bio *bio,
1940                                     u64 bio_offset)
1941 {
1942         struct inode *inode = private_data;
1943         blk_status_t ret = 0;
1944
1945         ret = btrfs_csum_one_bio(inode, bio, 0, 0);
1946         BUG_ON(ret); /* -ENOMEM */
1947         return 0;
1948 }
1949
1950 /*
1951  * in order to insert checksums into the metadata in large chunks,
1952  * we wait until bio submission time.   All the pages in the bio are
1953  * checksummed and sums are attached onto the ordered extent record.
1954  *
1955  * At IO completion time the cums attached on the ordered extent record
1956  * are inserted into the btree
1957  */
1958 static blk_status_t btrfs_submit_bio_done(void *private_data, struct bio *bio,
1959                           int mirror_num)
1960 {
1961         struct inode *inode = private_data;
1962         struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
1963         blk_status_t ret;
1964
1965         ret = btrfs_map_bio(fs_info, bio, mirror_num, 1);
1966         if (ret) {
1967                 bio->bi_status = ret;
1968                 bio_endio(bio);
1969         }
1970         return ret;
1971 }
1972
1973 /*
1974  * extent_io.c submission hook. This does the right thing for csum calculation
1975  * on write, or reading the csums from the tree before a read.
1976  *
1977  * Rules about async/sync submit,
1978  * a) read:                             sync submit
1979  *
1980  * b) write without checksum:           sync submit
1981  *
1982  * c) write with checksum:
1983  *    c-1) if bio is issued by fsync:   sync submit
1984  *         (sync_writers != 0)
1985  *
1986  *    c-2) if root is reloc root:       sync submit
1987  *         (only in case of buffered IO)
1988  *
1989  *    c-3) otherwise:                   async submit
1990  */
1991 static blk_status_t btrfs_submit_bio_hook(void *private_data, struct bio *bio,
1992                                  int mirror_num, unsigned long bio_flags,
1993                                  u64 bio_offset)
1994 {
1995         struct inode *inode = private_data;
1996         struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
1997         struct btrfs_root *root = BTRFS_I(inode)->root;
1998         enum btrfs_wq_endio_type metadata = BTRFS_WQ_ENDIO_DATA;
1999         blk_status_t ret = 0;
2000         int skip_sum;
2001         int async = !atomic_read(&BTRFS_I(inode)->sync_writers);
2002
2003         skip_sum = BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM;
2004
2005         if (btrfs_is_free_space_inode(BTRFS_I(inode)))
2006                 metadata = BTRFS_WQ_ENDIO_FREE_SPACE;
2007
2008         if (bio_op(bio) != REQ_OP_WRITE) {
2009                 ret = btrfs_bio_wq_end_io(fs_info, bio, metadata);
2010                 if (ret)
2011                         goto out;
2012
2013                 if (bio_flags & EXTENT_BIO_COMPRESSED) {
2014                         ret = btrfs_submit_compressed_read(inode, bio,
2015                                                            mirror_num,
2016                                                            bio_flags);
2017                         goto out;
2018                 } else if (!skip_sum) {
2019                         ret = btrfs_lookup_bio_sums(inode, bio, NULL);
2020                         if (ret)
2021                                 goto out;
2022                 }
2023                 goto mapit;
2024         } else if (async && !skip_sum) {
2025                 /* csum items have already been cloned */
2026                 if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID)
2027                         goto mapit;
2028                 /* we're doing a write, do the async checksumming */
2029                 ret = btrfs_wq_submit_bio(fs_info, bio, mirror_num, bio_flags,
2030                                           bio_offset, inode,
2031                                           btrfs_submit_bio_start,
2032                                           btrfs_submit_bio_done);
2033                 goto out;
2034         } else if (!skip_sum) {
2035                 ret = btrfs_csum_one_bio(inode, bio, 0, 0);
2036                 if (ret)
2037                         goto out;
2038         }
2039
2040 mapit:
2041         ret = btrfs_map_bio(fs_info, bio, mirror_num, 0);
2042
2043 out:
2044         if (ret) {
2045                 bio->bi_status = ret;
2046                 bio_endio(bio);
2047         }
2048         return ret;
2049 }
2050
2051 /*
2052  * given a list of ordered sums record them in the inode.  This happens
2053  * at IO completion time based on sums calculated at bio submission time.
2054  */
2055 static noinline int add_pending_csums(struct btrfs_trans_handle *trans,
2056                              struct inode *inode, struct list_head *list)
2057 {
2058         struct btrfs_ordered_sum *sum;
2059         int ret;
2060
2061         list_for_each_entry(sum, list, list) {
2062                 trans->adding_csums = true;
2063                 ret = btrfs_csum_file_blocks(trans,
2064                        BTRFS_I(inode)->root->fs_info->csum_root, sum);
2065                 trans->adding_csums = false;
2066                 if (ret)
2067                         return ret;
2068         }
2069         return 0;
2070 }
2071
2072 int btrfs_set_extent_delalloc(struct inode *inode, u64 start, u64 end,
2073                               unsigned int extra_bits,
2074                               struct extent_state **cached_state, int dedupe)
2075 {
2076         WARN_ON((end & (PAGE_SIZE - 1)) == 0);
2077         return set_extent_delalloc(&BTRFS_I(inode)->io_tree, start, end,
2078                                    extra_bits, cached_state);
2079 }
2080
2081 /* see btrfs_writepage_start_hook for details on why this is required */
2082 struct btrfs_writepage_fixup {
2083         struct page *page;
2084         struct btrfs_work work;
2085 };
2086
2087 static void btrfs_writepage_fixup_worker(struct btrfs_work *work)
2088 {
2089         struct btrfs_writepage_fixup *fixup;
2090         struct btrfs_ordered_extent *ordered;
2091         struct extent_state *cached_state = NULL;
2092         struct extent_changeset *data_reserved = NULL;
2093         struct page *page;
2094         struct inode *inode;
2095         u64 page_start;
2096         u64 page_end;
2097         int ret;
2098
2099         fixup = container_of(work, struct btrfs_writepage_fixup, work);
2100         page = fixup->page;
2101 again:
2102         lock_page(page);
2103         if (!page->mapping || !PageDirty(page) || !PageChecked(page)) {
2104                 ClearPageChecked(page);
2105                 goto out_page;
2106         }
2107
2108         inode = page->mapping->host;
2109         page_start = page_offset(page);
2110         page_end = page_offset(page) + PAGE_SIZE - 1;
2111
2112         lock_extent_bits(&BTRFS_I(inode)->io_tree, page_start, page_end,
2113                          &cached_state);
2114
2115         /* already ordered? We're done */
2116         if (PagePrivate2(page))
2117                 goto out;
2118
2119         ordered = btrfs_lookup_ordered_range(BTRFS_I(inode), page_start,
2120                                         PAGE_SIZE);
2121         if (ordered) {
2122                 unlock_extent_cached(&BTRFS_I(inode)->io_tree, page_start,
2123                                      page_end, &cached_state);
2124                 unlock_page(page);
2125                 btrfs_start_ordered_extent(inode, ordered, 1);
2126                 btrfs_put_ordered_extent(ordered);
2127                 goto again;
2128         }
2129
2130         ret = btrfs_delalloc_reserve_space(inode, &data_reserved, page_start,
2131                                            PAGE_SIZE);
2132         if (ret) {
2133                 mapping_set_error(page->mapping, ret);
2134                 end_extent_writepage(page, ret, page_start, page_end);
2135                 ClearPageChecked(page);
2136                 goto out;
2137          }
2138
2139         ret = btrfs_set_extent_delalloc(inode, page_start, page_end, 0,
2140                                         &cached_state, 0);
2141         if (ret) {
2142                 mapping_set_error(page->mapping, ret);
2143                 end_extent_writepage(page, ret, page_start, page_end);
2144                 ClearPageChecked(page);
2145                 goto out;
2146         }
2147
2148         ClearPageChecked(page);
2149         set_page_dirty(page);
2150         btrfs_delalloc_release_extents(BTRFS_I(inode), PAGE_SIZE, false);
2151 out:
2152         unlock_extent_cached(&BTRFS_I(inode)->io_tree, page_start, page_end,
2153                              &cached_state);
2154 out_page:
2155         unlock_page(page);
2156         put_page(page);
2157         kfree(fixup);
2158         extent_changeset_free(data_reserved);
2159 }
2160
2161 /*
2162  * There are a few paths in the higher layers of the kernel that directly
2163  * set the page dirty bit without asking the filesystem if it is a
2164  * good idea.  This causes problems because we want to make sure COW
2165  * properly happens and the data=ordered rules are followed.
2166  *
2167  * In our case any range that doesn't have the ORDERED bit set
2168  * hasn't been properly setup for IO.  We kick off an async process
2169  * to fix it up.  The async helper will wait for ordered extents, set
2170  * the delalloc bit and make it safe to write the page.
2171  */
2172 static int btrfs_writepage_start_hook(struct page *page, u64 start, u64 end)
2173 {
2174         struct inode *inode = page->mapping->host;
2175         struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
2176         struct btrfs_writepage_fixup *fixup;
2177
2178         /* this page is properly in the ordered list */
2179         if (TestClearPagePrivate2(page))
2180                 return 0;
2181
2182         if (PageChecked(page))
2183                 return -EAGAIN;
2184
2185         fixup = kzalloc(sizeof(*fixup), GFP_NOFS);
2186         if (!fixup)
2187                 return -EAGAIN;
2188
2189         SetPageChecked(page);
2190         get_page(page);
2191         btrfs_init_work(&fixup->work, btrfs_fixup_helper,
2192                         btrfs_writepage_fixup_worker, NULL, NULL);
2193         fixup->page = page;
2194         btrfs_queue_work(fs_info->fixup_workers, &fixup->work);
2195         return -EBUSY;
2196 }
2197
2198 static int insert_reserved_file_extent(struct btrfs_trans_handle *trans,
2199                                        struct inode *inode, u64 file_pos,
2200                                        u64 disk_bytenr, u64 disk_num_bytes,
2201                                        u64 num_bytes, u64 ram_bytes,
2202                                        u8 compression, u8 encryption,
2203                                        u16 other_encoding, int extent_type)
2204 {
2205         struct btrfs_root *root = BTRFS_I(inode)->root;
2206         struct btrfs_file_extent_item *fi;
2207         struct btrfs_path *path;
2208         struct extent_buffer *leaf;
2209         struct btrfs_key ins;
2210         u64 qg_released;
2211         int extent_inserted = 0;
2212         int ret;
2213
2214         path = btrfs_alloc_path();
2215         if (!path)
2216                 return -ENOMEM;
2217
2218         /*
2219          * we may be replacing one extent in the tree with another.
2220          * The new extent is pinned in the extent map, and we don't want
2221          * to drop it from the cache until it is completely in the btree.
2222          *
2223          * So, tell btrfs_drop_extents to leave this extent in the cache.
2224          * the caller is expected to unpin it and allow it to be merged
2225          * with the others.
2226          */
2227         ret = __btrfs_drop_extents(trans, root, inode, path, file_pos,
2228                                    file_pos + num_bytes, NULL, 0,
2229                                    1, sizeof(*fi), &extent_inserted);
2230         if (ret)
2231                 goto out;
2232
2233         if (!extent_inserted) {
2234                 ins.objectid = btrfs_ino(BTRFS_I(inode));
2235                 ins.offset = file_pos;
2236                 ins.type = BTRFS_EXTENT_DATA_KEY;
2237
2238                 path->leave_spinning = 1;
2239                 ret = btrfs_insert_empty_item(trans, root, path, &ins,
2240                                               sizeof(*fi));
2241                 if (ret)
2242                         goto out;
2243         }
2244         leaf = path->nodes[0];
2245         fi = btrfs_item_ptr(leaf, path->slots[0],
2246                             struct btrfs_file_extent_item);
2247         btrfs_set_file_extent_generation(leaf, fi, trans->transid);
2248         btrfs_set_file_extent_type(leaf, fi, extent_type);
2249         btrfs_set_file_extent_disk_bytenr(leaf, fi, disk_bytenr);
2250         btrfs_set_file_extent_disk_num_bytes(leaf, fi, disk_num_bytes);
2251         btrfs_set_file_extent_offset(leaf, fi, 0);
2252         btrfs_set_file_extent_num_bytes(leaf, fi, num_bytes);
2253         btrfs_set_file_extent_ram_bytes(leaf, fi, ram_bytes);
2254         btrfs_set_file_extent_compression(leaf, fi, compression);
2255         btrfs_set_file_extent_encryption(leaf, fi, encryption);
2256         btrfs_set_file_extent_other_encoding(leaf, fi, other_encoding);
2257
2258         btrfs_mark_buffer_dirty(leaf);
2259         btrfs_release_path(path);
2260
2261         inode_add_bytes(inode, num_bytes);
2262
2263         ins.objectid = disk_bytenr;
2264         ins.offset = disk_num_bytes;
2265         ins.type = BTRFS_EXTENT_ITEM_KEY;
2266
2267         /*
2268          * Release the reserved range from inode dirty range map, as it is
2269          * already moved into delayed_ref_head
2270          */
2271         ret = btrfs_qgroup_release_data(inode, file_pos, ram_bytes);
2272         if (ret < 0)
2273                 goto out;
2274         qg_released = ret;
2275         ret = btrfs_alloc_reserved_file_extent(trans, root,
2276                                                btrfs_ino(BTRFS_I(inode)),
2277                                                file_pos, qg_released, &ins);
2278 out:
2279         btrfs_free_path(path);
2280
2281         return ret;
2282 }
2283
2284 /* snapshot-aware defrag */
2285 struct sa_defrag_extent_backref {
2286         struct rb_node node;
2287         struct old_sa_defrag_extent *old;
2288         u64 root_id;
2289         u64 inum;
2290         u64 file_pos;
2291         u64 extent_offset;
2292         u64 num_bytes;
2293         u64 generation;
2294 };
2295
2296 struct old_sa_defrag_extent {
2297         struct list_head list;
2298         struct new_sa_defrag_extent *new;
2299
2300         u64 extent_offset;
2301         u64 bytenr;
2302         u64 offset;
2303         u64 len;
2304         int count;
2305 };
2306
2307 struct new_sa_defrag_extent {
2308         struct rb_root root;
2309         struct list_head head;
2310         struct btrfs_path *path;
2311         struct inode *inode;
2312         u64 file_pos;
2313         u64 len;
2314         u64 bytenr;
2315         u64 disk_len;
2316         u8 compress_type;
2317 };
2318
2319 static int backref_comp(struct sa_defrag_extent_backref *b1,
2320                         struct sa_defrag_extent_backref *b2)
2321 {
2322         if (b1->root_id < b2->root_id)
2323                 return -1;
2324         else if (b1->root_id > b2->root_id)
2325                 return 1;
2326
2327         if (b1->inum < b2->inum)
2328                 return -1;
2329         else if (b1->inum > b2->inum)
2330                 return 1;
2331
2332         if (b1->file_pos < b2->file_pos)
2333                 return -1;
2334         else if (b1->file_pos > b2->file_pos)
2335                 return 1;
2336
2337         /*
2338          * [------------------------------] ===> (a range of space)
2339          *     |<--->|   |<---->| =============> (fs/file tree A)
2340          * |<---------------------------->| ===> (fs/file tree B)
2341          *
2342          * A range of space can refer to two file extents in one tree while
2343          * refer to only one file extent in another tree.
2344          *
2345          * So we may process a disk offset more than one time(two extents in A)
2346          * and locate at the same extent(one extent in B), then insert two same
2347          * backrefs(both refer to the extent in B).
2348          */
2349         return 0;
2350 }
2351
2352 static void backref_insert(struct rb_root *root,
2353                            struct sa_defrag_extent_backref *backref)
2354 {
2355         struct rb_node **p = &root->rb_node;
2356         struct rb_node *parent = NULL;
2357         struct sa_defrag_extent_backref *entry;
2358         int ret;
2359
2360         while (*p) {
2361                 parent = *p;
2362                 entry = rb_entry(parent, struct sa_defrag_extent_backref, node);
2363
2364                 ret = backref_comp(backref, entry);
2365                 if (ret < 0)
2366                         p = &(*p)->rb_left;
2367                 else
2368                         p = &(*p)->rb_right;
2369         }
2370
2371         rb_link_node(&backref->node, parent, p);
2372         rb_insert_color(&backref->node, root);
2373 }
2374
2375 /*
2376  * Note the backref might has changed, and in this case we just return 0.
2377  */
2378 static noinline int record_one_backref(u64 inum, u64 offset, u64 root_id,
2379                                        void *ctx)
2380 {
2381         struct btrfs_file_extent_item *extent;
2382         struct old_sa_defrag_extent *old = ctx;
2383         struct new_sa_defrag_extent *new = old->new;
2384         struct btrfs_path *path = new->path;
2385         struct btrfs_key key;
2386         struct btrfs_root *root;
2387         struct sa_defrag_extent_backref *backref;
2388         struct extent_buffer *leaf;
2389         struct inode *inode = new->inode;
2390         struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
2391         int slot;
2392         int ret;
2393         u64 extent_offset;
2394         u64 num_bytes;
2395
2396         if (BTRFS_I(inode)->root->root_key.objectid == root_id &&
2397             inum == btrfs_ino(BTRFS_I(inode)))
2398                 return 0;
2399
2400         key.objectid = root_id;
2401         key.type = BTRFS_ROOT_ITEM_KEY;
2402         key.offset = (u64)-1;
2403
2404         root = btrfs_read_fs_root_no_name(fs_info, &key);
2405         if (IS_ERR(root)) {
2406                 if (PTR_ERR(root) == -ENOENT)
2407                         return 0;
2408                 WARN_ON(1);
2409                 btrfs_debug(fs_info, "inum=%llu, offset=%llu, root_id=%llu",
2410                          inum, offset, root_id);
2411                 return PTR_ERR(root);
2412         }
2413
2414         key.objectid = inum;
2415         key.type = BTRFS_EXTENT_DATA_KEY;
2416         if (offset > (u64)-1 << 32)
2417                 key.offset = 0;
2418         else
2419                 key.offset = offset;
2420
2421         ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
2422         if (WARN_ON(ret < 0))
2423                 return ret;
2424         ret = 0;
2425
2426         while (1) {
2427                 cond_resched();
2428
2429                 leaf = path->nodes[0];
2430                 slot = path->slots[0];
2431
2432                 if (slot >= btrfs_header_nritems(leaf)) {
2433                         ret = btrfs_next_leaf(root, path);
2434                         if (ret < 0) {
2435                                 goto out;
2436                         } else if (ret > 0) {
2437                                 ret = 0;
2438                                 goto out;
2439                         }
2440                         continue;
2441                 }
2442
2443                 path->slots[0]++;
2444
2445                 btrfs_item_key_to_cpu(leaf, &key, slot);
2446
2447                 if (key.objectid > inum)
2448                         goto out;
2449
2450                 if (key.objectid < inum || key.type != BTRFS_EXTENT_DATA_KEY)
2451                         continue;
2452
2453                 extent = btrfs_item_ptr(leaf, slot,
2454                                         struct btrfs_file_extent_item);
2455
2456                 if (btrfs_file_extent_disk_bytenr(leaf, extent) != old->bytenr)
2457                         continue;
2458
2459                 /*
2460                  * 'offset' refers to the exact key.offset,
2461                  * NOT the 'offset' field in btrfs_extent_data_ref, ie.
2462                  * (key.offset - extent_offset).
2463                  */
2464                 if (key.offset != offset)
2465                         continue;
2466
2467                 extent_offset = btrfs_file_extent_offset(leaf, extent);
2468                 num_bytes = btrfs_file_extent_num_bytes(leaf, extent);
2469
2470                 if (extent_offset >= old->extent_offset + old->offset +
2471                     old->len || extent_offset + num_bytes <=
2472                     old->extent_offset + old->offset)
2473                         continue;
2474                 break;
2475         }
2476
2477         backref = kmalloc(sizeof(*backref), GFP_NOFS);
2478         if (!backref) {
2479                 ret = -ENOENT;
2480                 goto out;
2481         }
2482
2483         backref->root_id = root_id;
2484         backref->inum = inum;
2485         backref->file_pos = offset;
2486         backref->num_bytes = num_bytes;
2487         backref->extent_offset = extent_offset;
2488         backref->generation = btrfs_file_extent_generation(leaf, extent);
2489         backref->old = old;
2490         backref_insert(&new->root, backref);
2491         old->count++;
2492 out:
2493         btrfs_release_path(path);
2494         WARN_ON(ret);
2495         return ret;
2496 }
2497
2498 static noinline bool record_extent_backrefs(struct btrfs_path *path,
2499                                    struct new_sa_defrag_extent *new)
2500 {
2501         struct btrfs_fs_info *fs_info = btrfs_sb(new->inode->i_sb);
2502         struct old_sa_defrag_extent *old, *tmp;
2503         int ret;
2504
2505         new->path = path;
2506
2507         list_for_each_entry_safe(old, tmp, &new->head, list) {
2508                 ret = iterate_inodes_from_logical(old->bytenr +
2509                                                   old->extent_offset, fs_info,
2510                                                   path, record_one_backref,
2511                                                   old, false);
2512                 if (ret < 0 && ret != -ENOENT)
2513                         return false;
2514
2515                 /* no backref to be processed for this extent */
2516                 if (!old->count) {
2517                         list_del(&old->list);
2518                         kfree(old);
2519                 }
2520         }
2521
2522         if (list_empty(&new->head))
2523                 return false;
2524
2525         return true;
2526 }
2527
2528 static int relink_is_mergable(struct extent_buffer *leaf,
2529                               struct btrfs_file_extent_item *fi,
2530                               struct new_sa_defrag_extent *new)
2531 {
2532         if (btrfs_file_extent_disk_bytenr(leaf, fi) != new->bytenr)
2533                 return 0;
2534
2535         if (btrfs_file_extent_type(leaf, fi) != BTRFS_FILE_EXTENT_REG)
2536                 return 0;
2537
2538         if (btrfs_file_extent_compression(leaf, fi) != new->compress_type)
2539                 return 0;
2540
2541         if (btrfs_file_extent_encryption(leaf, fi) ||
2542             btrfs_file_extent_other_encoding(leaf, fi))
2543                 return 0;
2544
2545         return 1;
2546 }
2547
2548 /*
2549  * Note the backref might has changed, and in this case we just return 0.
2550  */
2551 static noinline int relink_extent_backref(struct btrfs_path *path,
2552                                  struct sa_defrag_extent_backref *prev,
2553                                  struct sa_defrag_extent_backref *backref)
2554 {
2555         struct btrfs_file_extent_item *extent;
2556         struct btrfs_file_extent_item *item;
2557         struct btrfs_ordered_extent *ordered;
2558         struct btrfs_trans_handle *trans;
2559         struct btrfs_root *root;
2560         struct btrfs_key key;
2561         struct extent_buffer *leaf;
2562         struct old_sa_defrag_extent *old = backref->old;
2563         struct new_sa_defrag_extent *new = old->new;
2564         struct btrfs_fs_info *fs_info = btrfs_sb(new->inode->i_sb);
2565         struct inode *inode;
2566         struct extent_state *cached = NULL;
2567         int ret = 0;
2568         u64 start;
2569         u64 len;
2570         u64 lock_start;
2571         u64 lock_end;
2572         bool merge = false;
2573         int index;
2574
2575         if (prev && prev->root_id == backref->root_id &&
2576             prev->inum == backref->inum &&
2577             prev->file_pos + prev->num_bytes == backref->file_pos)
2578                 merge = true;
2579
2580         /* step 1: get root */
2581         key.objectid = backref->root_id;
2582         key.type = BTRFS_ROOT_ITEM_KEY;
2583         key.offset = (u64)-1;
2584
2585         index = srcu_read_lock(&fs_info->subvol_srcu);
2586
2587         root = btrfs_read_fs_root_no_name(fs_info, &key);
2588         if (IS_ERR(root)) {
2589                 srcu_read_unlock(&fs_info->subvol_srcu, index);
2590                 if (PTR_ERR(root) == -ENOENT)
2591                         return 0;
2592                 return PTR_ERR(root);
2593         }
2594
2595         if (btrfs_root_readonly(root)) {
2596                 srcu_read_unlock(&fs_info->subvol_srcu, index);
2597                 return 0;
2598         }
2599
2600         /* step 2: get inode */
2601         key.objectid = backref->inum;
2602         key.type = BTRFS_INODE_ITEM_KEY;
2603         key.offset = 0;
2604
2605         inode = btrfs_iget(fs_info->sb, &key, root, NULL);
2606         if (IS_ERR(inode)) {
2607                 srcu_read_unlock(&fs_info->subvol_srcu, index);
2608                 return 0;
2609         }
2610
2611         srcu_read_unlock(&fs_info->subvol_srcu, index);
2612
2613         /* step 3: relink backref */
2614         lock_start = backref->file_pos;
2615         lock_end = backref->file_pos + backref->num_bytes - 1;
2616         lock_extent_bits(&BTRFS_I(inode)->io_tree, lock_start, lock_end,
2617                          &cached);
2618
2619         ordered = btrfs_lookup_first_ordered_extent(inode, lock_end);
2620         if (ordered) {
2621                 btrfs_put_ordered_extent(ordered);
2622                 goto out_unlock;
2623         }
2624
2625         trans = btrfs_join_transaction(root);
2626         if (IS_ERR(trans)) {
2627                 ret = PTR_ERR(trans);
2628                 goto out_unlock;
2629         }
2630
2631         key.objectid = backref->inum;
2632         key.type = BTRFS_EXTENT_DATA_KEY;
2633         key.offset = backref->file_pos;
2634
2635         ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
2636         if (ret < 0) {
2637                 goto out_free_path;
2638         } else if (ret > 0) {
2639                 ret = 0;
2640                 goto out_free_path;
2641         }
2642
2643         extent = btrfs_item_ptr(path->nodes[0], path->slots[0],
2644                                 struct btrfs_file_extent_item);
2645
2646         if (btrfs_file_extent_generation(path->nodes[0], extent) !=
2647             backref->generation)
2648                 goto out_free_path;
2649
2650         btrfs_release_path(path);
2651
2652         start = backref->file_pos;
2653         if (backref->extent_offset < old->extent_offset + old->offset)
2654                 start += old->extent_offset + old->offset -
2655                          backref->extent_offset;
2656
2657         len = min(backref->extent_offset + backref->num_bytes,
2658                   old->extent_offset + old->offset + old->len);
2659         len -= max(backref->extent_offset, old->extent_offset + old->offset);
2660
2661         ret = btrfs_drop_extents(trans, root, inode, start,
2662                                  start + len, 1);
2663         if (ret)
2664                 goto out_free_path;
2665 again:
2666         key.objectid = btrfs_ino(BTRFS_I(inode));
2667         key.type = BTRFS_EXTENT_DATA_KEY;
2668         key.offset = start;
2669
2670         path->leave_spinning = 1;
2671         if (merge) {
2672                 struct btrfs_file_extent_item *fi;
2673                 u64 extent_len;
2674                 struct btrfs_key found_key;
2675
2676                 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
2677                 if (ret < 0)
2678                         goto out_free_path;
2679
2680                 path->slots[0]--;
2681                 leaf = path->nodes[0];
2682                 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
2683
2684                 fi = btrfs_item_ptr(leaf, path->slots[0],
2685                                     struct btrfs_file_extent_item);
2686                 extent_len = btrfs_file_extent_num_bytes(leaf, fi);
2687
2688                 if (extent_len + found_key.offset == start &&
2689                     relink_is_mergable(leaf, fi, new)) {
2690                         btrfs_set_file_extent_num_bytes(leaf, fi,
2691                                                         extent_len + len);
2692                         btrfs_mark_buffer_dirty(leaf);
2693                         inode_add_bytes(inode, len);
2694
2695                         ret = 1;
2696                         goto out_free_path;
2697                 } else {
2698                         merge = false;
2699                         btrfs_release_path(path);
2700                         goto again;
2701                 }
2702         }
2703
2704         ret = btrfs_insert_empty_item(trans, root, path, &key,
2705                                         sizeof(*extent));
2706         if (ret) {
2707                 btrfs_abort_transaction(trans, ret);
2708                 goto out_free_path;
2709         }
2710
2711         leaf = path->nodes[0];
2712         item = btrfs_item_ptr(leaf, path->slots[0],
2713                                 struct btrfs_file_extent_item);
2714         btrfs_set_file_extent_disk_bytenr(leaf, item, new->bytenr);
2715         btrfs_set_file_extent_disk_num_bytes(leaf, item, new->disk_len);
2716         btrfs_set_file_extent_offset(leaf, item, start - new->file_pos);
2717         btrfs_set_file_extent_num_bytes(leaf, item, len);
2718         btrfs_set_file_extent_ram_bytes(leaf, item, new->len);
2719         btrfs_set_file_extent_generation(leaf, item, trans->transid);
2720         btrfs_set_file_extent_type(leaf, item, BTRFS_FILE_EXTENT_REG);
2721         btrfs_set_file_extent_compression(leaf, item, new->compress_type);
2722         btrfs_set_file_extent_encryption(leaf, item, 0);
2723         btrfs_set_file_extent_other_encoding(leaf, item, 0);
2724
2725         btrfs_mark_buffer_dirty(leaf);
2726         inode_add_bytes(inode, len);
2727         btrfs_release_path(path);
2728
2729         ret = btrfs_inc_extent_ref(trans, root, new->bytenr,
2730                         new->disk_len, 0,
2731                         backref->root_id, backref->inum,
2732                         new->file_pos); /* start - extent_offset */
2733         if (ret) {
2734                 btrfs_abort_transaction(trans, ret);
2735                 goto out_free_path;
2736         }
2737
2738         ret = 1;
2739 out_free_path:
2740         btrfs_release_path(path);
2741         path->leave_spinning = 0;
2742         btrfs_end_transaction(trans);
2743 out_unlock:
2744         unlock_extent_cached(&BTRFS_I(inode)->io_tree, lock_start, lock_end,
2745                              &cached);
2746         iput(inode);
2747         return ret;
2748 }
2749
2750 static void free_sa_defrag_extent(struct new_sa_defrag_extent *new)
2751 {
2752         struct old_sa_defrag_extent *old, *tmp;
2753
2754         if (!new)
2755                 return;
2756
2757         list_for_each_entry_safe(old, tmp, &new->head, list) {
2758                 kfree(old);
2759         }
2760         kfree(new);
2761 }
2762
2763 static void relink_file_extents(struct new_sa_defrag_extent *new)
2764 {
2765         struct btrfs_fs_info *fs_info = btrfs_sb(new->inode->i_sb);
2766         struct btrfs_path *path;
2767         struct sa_defrag_extent_backref *backref;
2768         struct sa_defrag_extent_backref *prev = NULL;
2769         struct inode *inode;
2770         struct rb_node *node;
2771         int ret;
2772
2773         inode = new->inode;
2774
2775         path = btrfs_alloc_path();
2776         if (!path)
2777                 return;
2778
2779         if (!record_extent_backrefs(path, new)) {
2780                 btrfs_free_path(path);
2781                 goto out;
2782         }
2783         btrfs_release_path(path);
2784
2785         while (1) {
2786                 node = rb_first(&new->root);
2787                 if (!node)
2788                         break;
2789                 rb_erase(node, &new->root);
2790
2791                 backref = rb_entry(node, struct sa_defrag_extent_backref, node);
2792
2793                 ret = relink_extent_backref(path, prev, backref);
2794                 WARN_ON(ret < 0);
2795
2796                 kfree(prev);
2797
2798                 if (ret == 1)
2799                         prev = backref;
2800                 else
2801                         prev = NULL;
2802                 cond_resched();
2803         }
2804         kfree(prev);
2805
2806         btrfs_free_path(path);
2807 out:
2808         free_sa_defrag_extent(new);
2809
2810         atomic_dec(&fs_info->defrag_running);
2811         wake_up(&fs_info->transaction_wait);
2812 }
2813
2814 static struct new_sa_defrag_extent *
2815 record_old_file_extents(struct inode *inode,
2816                         struct btrfs_ordered_extent *ordered)
2817 {
2818         struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
2819         struct btrfs_root *root = BTRFS_I(inode)->root;
2820         struct btrfs_path *path;
2821         struct btrfs_key key;
2822         struct old_sa_defrag_extent *old;
2823         struct new_sa_defrag_extent *new;
2824         int ret;
2825
2826         new = kmalloc(sizeof(*new), GFP_NOFS);
2827         if (!new)
2828                 return NULL;
2829
2830         new->inode = inode;
2831         new->file_pos = ordered->file_offset;
2832         new->len = ordered->len;
2833         new->bytenr = ordered->start;
2834         new->disk_len = ordered->disk_len;
2835         new->compress_type = ordered->compress_type;
2836         new->root = RB_ROOT;
2837         INIT_LIST_HEAD(&new->head);
2838
2839         path = btrfs_alloc_path();
2840         if (!path)
2841                 goto out_kfree;
2842
2843         key.objectid = btrfs_ino(BTRFS_I(inode));
2844         key.type = BTRFS_EXTENT_DATA_KEY;
2845         key.offset = new->file_pos;
2846
2847         ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
2848         if (ret < 0)
2849                 goto out_free_path;
2850         if (ret > 0 && path->slots[0] > 0)
2851                 path->slots[0]--;
2852
2853         /* find out all the old extents for the file range */
2854         while (1) {
2855                 struct btrfs_file_extent_item *extent;
2856                 struct extent_buffer *l;
2857                 int slot;
2858                 u64 num_bytes;
2859                 u64 offset;
2860                 u64 end;
2861                 u64 disk_bytenr;
2862                 u64 extent_offset;
2863
2864                 l = path->nodes[0];
2865                 slot = path->slots[0];
2866
2867                 if (slot >= btrfs_header_nritems(l)) {
2868                         ret = btrfs_next_leaf(root, path);
2869                         if (ret < 0)
2870                                 goto out_free_path;
2871                         else if (ret > 0)
2872                                 break;
2873                         continue;
2874                 }
2875
2876                 btrfs_item_key_to_cpu(l, &key, slot);
2877
2878                 if (key.objectid != btrfs_ino(BTRFS_I(inode)))
2879                         break;
2880                 if (key.type != BTRFS_EXTENT_DATA_KEY)
2881                         break;
2882                 if (key.offset >= new->file_pos + new->len)
2883                         break;
2884
2885                 extent = btrfs_item_ptr(l, slot, struct btrfs_file_extent_item);
2886
2887                 num_bytes = btrfs_file_extent_num_bytes(l, extent);
2888                 if (key.offset + num_bytes < new->file_pos)
2889                         goto next;
2890
2891                 disk_bytenr = btrfs_file_extent_disk_bytenr(l, extent);
2892                 if (!disk_bytenr)
2893                         goto next;
2894
2895                 extent_offset = btrfs_file_extent_offset(l, extent);
2896
2897                 old = kmalloc(sizeof(*old), GFP_NOFS);
2898                 if (!old)
2899                         goto out_free_path;
2900
2901                 offset = max(new->file_pos, key.offset);
2902                 end = min(new->file_pos + new->len, key.offset + num_bytes);
2903
2904                 old->bytenr = disk_bytenr;
2905                 old->extent_offset = extent_offset;
2906                 old->offset = offset - key.offset;
2907                 old->len = end - offset;
2908                 old->new = new;
2909                 old->count = 0;
2910                 list_add_tail(&old->list, &new->head);
2911 next:
2912                 path->slots[0]++;
2913                 cond_resched();
2914         }
2915
2916         btrfs_free_path(path);
2917         atomic_inc(&fs_info->defrag_running);
2918
2919         return new;
2920
2921 out_free_path:
2922         btrfs_free_path(path);
2923 out_kfree:
2924         free_sa_defrag_extent(new);
2925         return NULL;
2926 }
2927
2928 static void btrfs_release_delalloc_bytes(struct btrfs_fs_info *fs_info,
2929                                          u64 start, u64 len)
2930 {
2931         struct btrfs_block_group_cache *cache;
2932
2933         cache = btrfs_lookup_block_group(fs_info, start);
2934         ASSERT(cache);
2935
2936         spin_lock(&cache->lock);
2937         cache->delalloc_bytes -= len;
2938         spin_unlock(&cache->lock);
2939
2940         btrfs_put_block_group(cache);
2941 }
2942
2943 /* as ordered data IO finishes, this gets called so we can finish
2944  * an ordered extent if the range of bytes in the file it covers are
2945  * fully written.
2946  */
2947 static int btrfs_finish_ordered_io(struct btrfs_ordered_extent *ordered_extent)
2948 {
2949         struct inode *inode = ordered_extent->inode;
2950         struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
2951         struct btrfs_root *root = BTRFS_I(inode)->root;
2952         struct btrfs_trans_handle *trans = NULL;
2953         struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
2954         struct extent_state *cached_state = NULL;
2955         struct new_sa_defrag_extent *new = NULL;
2956         int compress_type = 0;
2957         int ret = 0;
2958         u64 logical_len = ordered_extent->len;
2959         bool nolock;
2960         bool truncated = false;
2961         bool range_locked = false;
2962         bool clear_new_delalloc_bytes = false;
2963
2964         if (!test_bit(BTRFS_ORDERED_NOCOW, &ordered_extent->flags) &&
2965             !test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags) &&
2966             !test_bit(BTRFS_ORDERED_DIRECT, &ordered_extent->flags))
2967                 clear_new_delalloc_bytes = true;
2968
2969         nolock = btrfs_is_free_space_inode(BTRFS_I(inode));
2970
2971         if (test_bit(BTRFS_ORDERED_IOERR, &ordered_extent->flags)) {
2972                 ret = -EIO;
2973                 goto out;
2974         }
2975
2976         btrfs_free_io_failure_record(BTRFS_I(inode),
2977                         ordered_extent->file_offset,
2978                         ordered_extent->file_offset +
2979                         ordered_extent->len - 1);
2980
2981         if (test_bit(BTRFS_ORDERED_TRUNCATED, &ordered_extent->flags)) {
2982                 truncated = true;
2983                 logical_len = ordered_extent->truncated_len;
2984                 /* Truncated the entire extent, don't bother adding */
2985                 if (!logical_len)
2986                         goto out;
2987         }
2988
2989         if (test_bit(BTRFS_ORDERED_NOCOW, &ordered_extent->flags)) {
2990                 BUG_ON(!list_empty(&ordered_extent->list)); /* Logic error */
2991
2992                 /*
2993                  * For mwrite(mmap + memset to write) case, we still reserve
2994                  * space for NOCOW range.
2995                  * As NOCOW won't cause a new delayed ref, just free the space
2996                  */
2997                 btrfs_qgroup_free_data(inode, NULL, ordered_extent->file_offset,
2998                                        ordered_extent->len);
2999                 btrfs_ordered_update_i_size(inode, 0, ordered_extent);
3000                 if (nolock)
3001                         trans = btrfs_join_transaction_nolock(root);
3002                 else
3003                         trans = btrfs_join_transaction(root);
3004                 if (IS_ERR(trans)) {
3005                         ret = PTR_ERR(trans);
3006                         trans = NULL;
3007                         goto out;
3008                 }
3009                 trans->block_rsv = &BTRFS_I(inode)->block_rsv;
3010                 ret = btrfs_update_inode_fallback(trans, root, inode);
3011                 if (ret) /* -ENOMEM or corruption */
3012                         btrfs_abort_transaction(trans, ret);
3013                 goto out;
3014         }
3015
3016         range_locked = true;
3017         lock_extent_bits(io_tree, ordered_extent->file_offset,
3018                          ordered_extent->file_offset + ordered_extent->len - 1,
3019                          &cached_state);
3020
3021         ret = test_range_bit(io_tree, ordered_extent->file_offset,
3022                         ordered_extent->file_offset + ordered_extent->len - 1,
3023                         EXTENT_DEFRAG, 0, cached_state);
3024         if (ret) {
3025                 u64 last_snapshot = btrfs_root_last_snapshot(&root->root_item);
3026                 if (0 && last_snapshot >= BTRFS_I(inode)->generation)
3027                         /* the inode is shared */
3028                         new = record_old_file_extents(inode, ordered_extent);
3029
3030                 clear_extent_bit(io_tree, ordered_extent->file_offset,
3031                         ordered_extent->file_offset + ordered_extent->len - 1,
3032                         EXTENT_DEFRAG, 0, 0, &cached_state);
3033         }
3034
3035         if (nolock)
3036                 trans = btrfs_join_transaction_nolock(root);
3037         else
3038                 trans = btrfs_join_transaction(root);
3039         if (IS_ERR(trans)) {
3040                 ret = PTR_ERR(trans);
3041                 trans = NULL;
3042                 goto out;
3043         }
3044
3045         trans->block_rsv = &BTRFS_I(inode)->block_rsv;
3046
3047         if (test_bit(BTRFS_ORDERED_COMPRESSED, &ordered_extent->flags))
3048                 compress_type = ordered_extent->compress_type;
3049         if (test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags)) {
3050                 BUG_ON(compress_type);
3051                 btrfs_qgroup_free_data(inode, NULL, ordered_extent->file_offset,
3052                                        ordered_extent->len);
3053                 ret = btrfs_mark_extent_written(trans, BTRFS_I(inode),
3054                                                 ordered_extent->file_offset,
3055                                                 ordered_extent->file_offset +
3056                                                 logical_len);
3057         } else {
3058                 BUG_ON(root == fs_info->tree_root);
3059                 ret = insert_reserved_file_extent(trans, inode,
3060                                                 ordered_extent->file_offset,
3061                                                 ordered_extent->start,
3062                                                 ordered_extent->disk_len,
3063                                                 logical_len, logical_len,
3064                                                 compress_type, 0, 0,
3065                                                 BTRFS_FILE_EXTENT_REG);
3066                 if (!ret)
3067                         btrfs_release_delalloc_bytes(fs_info,
3068                                                      ordered_extent->start,
3069                                                      ordered_extent->disk_len);
3070         }
3071         unpin_extent_cache(&BTRFS_I(inode)->extent_tree,
3072                            ordered_extent->file_offset, ordered_extent->len,
3073                            trans->transid);
3074         if (ret < 0) {
3075                 btrfs_abort_transaction(trans, ret);
3076                 goto out;
3077         }
3078
3079         ret = add_pending_csums(trans, inode, &ordered_extent->list);
3080         if (ret) {
3081                 btrfs_abort_transaction(trans, ret);
3082                 goto out;
3083         }
3084
3085         btrfs_ordered_update_i_size(inode, 0, ordered_extent);
3086         ret = btrfs_update_inode_fallback(trans, root, inode);
3087         if (ret) { /* -ENOMEM or corruption */
3088                 btrfs_abort_transaction(trans, ret);
3089                 goto out;
3090         }
3091         ret = 0;
3092 out:
3093         if (range_locked || clear_new_delalloc_bytes) {
3094                 unsigned int clear_bits = 0;
3095
3096                 if (range_locked)
3097                         clear_bits |= EXTENT_LOCKED;
3098                 if (clear_new_delalloc_bytes)
3099                         clear_bits |= EXTENT_DELALLOC_NEW;
3100                 clear_extent_bit(&BTRFS_I(inode)->io_tree,
3101                                  ordered_extent->file_offset,
3102                                  ordered_extent->file_offset +
3103                                  ordered_extent->len - 1,
3104                                  clear_bits,
3105                                  (clear_bits & EXTENT_LOCKED) ? 1 : 0,
3106                                  0, &cached_state);
3107         }
3108
3109         if (trans)
3110                 btrfs_end_transaction(trans);
3111
3112         if (ret || truncated) {
3113                 u64 start, end;
3114
3115                 if (truncated)
3116                         start = ordered_extent->file_offset + logical_len;
3117                 else
3118                         start = ordered_extent->file_offset;
3119                 end = ordered_extent->file_offset + ordered_extent->len - 1;
3120                 clear_extent_uptodate(io_tree, start, end, NULL);
3121
3122                 /* Drop the cache for the part of the extent we didn't write. */
3123                 btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 0);
3124
3125                 /*
3126                  * If the ordered extent had an IOERR or something else went
3127                  * wrong we need to return the space for this ordered extent
3128                  * back to the allocator.  We only free the extent in the
3129                  * truncated case if we didn't write out the extent at all.
3130                  */
3131                 if ((ret || !logical_len) &&
3132                     !test_bit(BTRFS_ORDERED_NOCOW, &ordered_extent->flags) &&
3133                     !test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags))
3134                         btrfs_free_reserved_extent(fs_info,
3135                                                    ordered_extent->start,
3136                                                    ordered_extent->disk_len, 1);
3137         }
3138
3139
3140         /*
3141          * This needs to be done to make sure anybody waiting knows we are done
3142          * updating everything for this ordered extent.
3143          */
3144         btrfs_remove_ordered_extent(inode, ordered_extent);
3145
3146         /* for snapshot-aware defrag */
3147         if (new) {
3148                 if (ret) {
3149                         free_sa_defrag_extent(new);
3150                         atomic_dec(&fs_info->defrag_running);
3151                 } else {
3152                         relink_file_extents(new);
3153                 }
3154         }
3155
3156         /* once for us */
3157         btrfs_put_ordered_extent(ordered_extent);
3158         /* once for the tree */
3159         btrfs_put_ordered_extent(ordered_extent);
3160
3161         return ret;
3162 }
3163
3164 static void finish_ordered_fn(struct btrfs_work *work)
3165 {
3166         struct btrfs_ordered_extent *ordered_extent;
3167         ordered_extent = container_of(work, struct btrfs_ordered_extent, work);
3168         btrfs_finish_ordered_io(ordered_extent);
3169 }
3170
3171 static void btrfs_writepage_end_io_hook(struct page *page, u64 start, u64 end,
3172                                 struct extent_state *state, int uptodate)
3173 {
3174         struct inode *inode = page->mapping->host;
3175         struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
3176         struct btrfs_ordered_extent *ordered_extent = NULL;
3177         struct btrfs_workqueue *wq;
3178         btrfs_work_func_t func;
3179
3180         trace_btrfs_writepage_end_io_hook(page, start, end, uptodate);
3181
3182         ClearPagePrivate2(page);
3183         if (!btrfs_dec_test_ordered_pending(inode, &ordered_extent, start,
3184                                             end - start + 1, uptodate))
3185                 return;
3186
3187         if (btrfs_is_free_space_inode(BTRFS_I(inode))) {
3188                 wq = fs_info->endio_freespace_worker;
3189                 func = btrfs_freespace_write_helper;
3190         } else {
3191                 wq = fs_info->endio_write_workers;
3192                 func = btrfs_endio_write_helper;
3193         }
3194
3195         btrfs_init_work(&ordered_extent->work, func, finish_ordered_fn, NULL,
3196                         NULL);
3197         btrfs_queue_work(wq, &ordered_extent->work);
3198 }
3199
3200 static int __readpage_endio_check(struct inode *inode,
3201                                   struct btrfs_io_bio *io_bio,
3202                                   int icsum, struct page *page,
3203                                   int pgoff, u64 start, size_t len)
3204 {
3205         char *kaddr;
3206         u32 csum_expected;
3207         u32 csum = ~(u32)0;
3208
3209         csum_expected = *(((u32 *)io_bio->csum) + icsum);
3210
3211         kaddr = kmap_atomic(page);
3212         csum = btrfs_csum_data(kaddr + pgoff, csum,  len);
3213         btrfs_csum_final(csum, (u8 *)&csum);
3214         if (csum != csum_expected)
3215                 goto zeroit;
3216
3217         kunmap_atomic(kaddr);
3218         return 0;
3219 zeroit:
3220         btrfs_print_data_csum_error(BTRFS_I(inode), start, csum, csum_expected,
3221                                     io_bio->mirror_num);
3222         memset(kaddr + pgoff, 1, len);
3223         flush_dcache_page(page);
3224         kunmap_atomic(kaddr);