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