2 * Copyright (C) 2007 Oracle. All rights reserved.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
13 * You should have received a copy of the GNU General Public
14 * License along with this program; if not, write to the
15 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
16 * Boston, MA 021110-1307, USA.
19 #include <linux/kernel.h>
20 #include <linux/bio.h>
21 #include <linux/buffer_head.h>
22 #include <linux/file.h>
24 #include <linux/pagemap.h>
25 #include <linux/highmem.h>
26 #include <linux/time.h>
27 #include <linux/init.h>
28 #include <linux/string.h>
29 #include <linux/backing-dev.h>
30 #include <linux/mpage.h>
31 #include <linux/swap.h>
32 #include <linux/writeback.h>
33 #include <linux/compat.h>
34 #include <linux/bit_spinlock.h>
35 #include <linux/xattr.h>
36 #include <linux/posix_acl.h>
37 #include <linux/falloc.h>
38 #include <linux/slab.h>
39 #include <linux/ratelimit.h>
40 #include <linux/mount.h>
41 #include <linux/btrfs.h>
42 #include <linux/blkdev.h>
43 #include <linux/posix_acl_xattr.h>
44 #include <linux/uio.h>
47 #include "transaction.h"
48 #include "btrfs_inode.h"
49 #include "print-tree.h"
50 #include "ordered-data.h"
54 #include "compression.h"
56 #include "free-space-cache.h"
57 #include "inode-map.h"
64 struct btrfs_iget_args {
65 struct btrfs_key *location;
66 struct btrfs_root *root;
69 struct btrfs_dio_data {
70 u64 outstanding_extents;
72 u64 unsubmitted_oe_range_start;
73 u64 unsubmitted_oe_range_end;
77 static const struct inode_operations btrfs_dir_inode_operations;
78 static const struct inode_operations btrfs_symlink_inode_operations;
79 static const struct inode_operations btrfs_dir_ro_inode_operations;
80 static const struct inode_operations btrfs_special_inode_operations;
81 static const struct inode_operations btrfs_file_inode_operations;
82 static const struct address_space_operations btrfs_aops;
83 static const struct address_space_operations btrfs_symlink_aops;
84 static const struct file_operations btrfs_dir_file_operations;
85 static const struct extent_io_ops btrfs_extent_io_ops;
87 static struct kmem_cache *btrfs_inode_cachep;
88 struct kmem_cache *btrfs_trans_handle_cachep;
89 struct kmem_cache *btrfs_transaction_cachep;
90 struct kmem_cache *btrfs_path_cachep;
91 struct kmem_cache *btrfs_free_space_cachep;
94 static const unsigned char btrfs_type_by_mode[S_IFMT >> S_SHIFT] = {
95 [S_IFREG >> S_SHIFT] = BTRFS_FT_REG_FILE,
96 [S_IFDIR >> S_SHIFT] = BTRFS_FT_DIR,
97 [S_IFCHR >> S_SHIFT] = BTRFS_FT_CHRDEV,
98 [S_IFBLK >> S_SHIFT] = BTRFS_FT_BLKDEV,
99 [S_IFIFO >> S_SHIFT] = BTRFS_FT_FIFO,
100 [S_IFSOCK >> S_SHIFT] = BTRFS_FT_SOCK,
101 [S_IFLNK >> S_SHIFT] = BTRFS_FT_SYMLINK,
104 static int btrfs_setsize(struct inode *inode, struct iattr *attr);
105 static int btrfs_truncate(struct inode *inode);
106 static int btrfs_finish_ordered_io(struct btrfs_ordered_extent *ordered_extent);
107 static noinline int cow_file_range(struct inode *inode,
108 struct page *locked_page,
109 u64 start, u64 end, u64 delalloc_end,
110 int *page_started, unsigned long *nr_written,
111 int unlock, struct btrfs_dedupe_hash *hash);
112 static struct extent_map *create_io_em(struct inode *inode, u64 start, u64 len,
113 u64 orig_start, u64 block_start,
114 u64 block_len, u64 orig_block_len,
115 u64 ram_bytes, int compress_type,
118 static int btrfs_dirty_inode(struct inode *inode);
120 #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
121 void btrfs_test_inode_set_ops(struct inode *inode)
123 BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops;
127 static int btrfs_init_inode_security(struct btrfs_trans_handle *trans,
128 struct inode *inode, struct inode *dir,
129 const struct qstr *qstr)
133 err = btrfs_init_acl(trans, inode, dir);
135 err = btrfs_xattr_security_init(trans, inode, dir, qstr);
140 * this does all the hard work for inserting an inline extent into
141 * the btree. The caller should have done a btrfs_drop_extents so that
142 * no overlapping inline items exist in the btree
144 static int insert_inline_extent(struct btrfs_trans_handle *trans,
145 struct btrfs_path *path, int extent_inserted,
146 struct btrfs_root *root, struct inode *inode,
147 u64 start, size_t size, size_t compressed_size,
149 struct page **compressed_pages)
151 struct extent_buffer *leaf;
152 struct page *page = NULL;
155 struct btrfs_file_extent_item *ei;
158 size_t cur_size = size;
159 unsigned long offset;
161 if (compressed_size && compressed_pages)
162 cur_size = compressed_size;
164 inode_add_bytes(inode, size);
166 if (!extent_inserted) {
167 struct btrfs_key key;
170 key.objectid = btrfs_ino(BTRFS_I(inode));
172 key.type = BTRFS_EXTENT_DATA_KEY;
174 datasize = btrfs_file_extent_calc_inline_size(cur_size);
175 path->leave_spinning = 1;
176 ret = btrfs_insert_empty_item(trans, root, path, &key,
183 leaf = path->nodes[0];
184 ei = btrfs_item_ptr(leaf, path->slots[0],
185 struct btrfs_file_extent_item);
186 btrfs_set_file_extent_generation(leaf, ei, trans->transid);
187 btrfs_set_file_extent_type(leaf, ei, BTRFS_FILE_EXTENT_INLINE);
188 btrfs_set_file_extent_encryption(leaf, ei, 0);
189 btrfs_set_file_extent_other_encoding(leaf, ei, 0);
190 btrfs_set_file_extent_ram_bytes(leaf, ei, size);
191 ptr = btrfs_file_extent_inline_start(ei);
193 if (compress_type != BTRFS_COMPRESS_NONE) {
196 while (compressed_size > 0) {
197 cpage = compressed_pages[i];
198 cur_size = min_t(unsigned long, compressed_size,
201 kaddr = kmap_atomic(cpage);
202 write_extent_buffer(leaf, kaddr, ptr, cur_size);
203 kunmap_atomic(kaddr);
207 compressed_size -= cur_size;
209 btrfs_set_file_extent_compression(leaf, ei,
212 page = find_get_page(inode->i_mapping,
213 start >> PAGE_SHIFT);
214 btrfs_set_file_extent_compression(leaf, ei, 0);
215 kaddr = kmap_atomic(page);
216 offset = start & (PAGE_SIZE - 1);
217 write_extent_buffer(leaf, kaddr + offset, ptr, size);
218 kunmap_atomic(kaddr);
221 btrfs_mark_buffer_dirty(leaf);
222 btrfs_release_path(path);
225 * we're an inline extent, so nobody can
226 * extend the file past i_size without locking
227 * a page we already have locked.
229 * We must do any isize and inode updates
230 * before we unlock the pages. Otherwise we
231 * could end up racing with unlink.
233 BTRFS_I(inode)->disk_i_size = inode->i_size;
234 ret = btrfs_update_inode(trans, root, inode);
243 * conditionally insert an inline extent into the file. This
244 * does the checks required to make sure the data is small enough
245 * to fit as an inline extent.
247 static noinline int cow_file_range_inline(struct btrfs_root *root,
248 struct inode *inode, u64 start,
249 u64 end, size_t compressed_size,
251 struct page **compressed_pages)
253 struct btrfs_fs_info *fs_info = root->fs_info;
254 struct btrfs_trans_handle *trans;
255 u64 isize = i_size_read(inode);
256 u64 actual_end = min(end + 1, isize);
257 u64 inline_len = actual_end - start;
258 u64 aligned_end = ALIGN(end, fs_info->sectorsize);
259 u64 data_len = inline_len;
261 struct btrfs_path *path;
262 int extent_inserted = 0;
263 u32 extent_item_size;
266 data_len = compressed_size;
269 actual_end > fs_info->sectorsize ||
270 data_len > BTRFS_MAX_INLINE_DATA_SIZE(fs_info) ||
272 (actual_end & (fs_info->sectorsize - 1)) == 0) ||
274 data_len > fs_info->max_inline) {
278 path = btrfs_alloc_path();
282 trans = btrfs_join_transaction(root);
284 btrfs_free_path(path);
285 return PTR_ERR(trans);
287 trans->block_rsv = &fs_info->delalloc_block_rsv;
289 if (compressed_size && compressed_pages)
290 extent_item_size = btrfs_file_extent_calc_inline_size(
293 extent_item_size = btrfs_file_extent_calc_inline_size(
296 ret = __btrfs_drop_extents(trans, root, inode, path,
297 start, aligned_end, NULL,
298 1, 1, extent_item_size, &extent_inserted);
300 btrfs_abort_transaction(trans, ret);
304 if (isize > actual_end)
305 inline_len = min_t(u64, isize, actual_end);
306 ret = insert_inline_extent(trans, path, extent_inserted,
308 inline_len, compressed_size,
309 compress_type, compressed_pages);
310 if (ret && ret != -ENOSPC) {
311 btrfs_abort_transaction(trans, ret);
313 } else if (ret == -ENOSPC) {
318 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC, &BTRFS_I(inode)->runtime_flags);
319 btrfs_delalloc_release_metadata(BTRFS_I(inode), end + 1 - start);
320 btrfs_drop_extent_cache(BTRFS_I(inode), start, aligned_end - 1, 0);
323 * Don't forget to free the reserved space, as for inlined extent
324 * it won't count as data extent, free them directly here.
325 * And at reserve time, it's always aligned to page size, so
326 * just free one page here.
328 btrfs_qgroup_free_data(inode, 0, PAGE_SIZE);
329 btrfs_free_path(path);
330 btrfs_end_transaction(trans);
334 struct async_extent {
339 unsigned long nr_pages;
341 struct list_head list;
346 struct btrfs_root *root;
347 struct page *locked_page;
350 struct list_head extents;
351 struct btrfs_work work;
354 static noinline int add_async_extent(struct async_cow *cow,
355 u64 start, u64 ram_size,
358 unsigned long nr_pages,
361 struct async_extent *async_extent;
363 async_extent = kmalloc(sizeof(*async_extent), GFP_NOFS);
364 BUG_ON(!async_extent); /* -ENOMEM */
365 async_extent->start = start;
366 async_extent->ram_size = ram_size;
367 async_extent->compressed_size = compressed_size;
368 async_extent->pages = pages;
369 async_extent->nr_pages = nr_pages;
370 async_extent->compress_type = compress_type;
371 list_add_tail(&async_extent->list, &cow->extents);
375 static inline int inode_need_compress(struct inode *inode)
377 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
380 if (btrfs_test_opt(fs_info, FORCE_COMPRESS))
382 /* bad compression ratios */
383 if (BTRFS_I(inode)->flags & BTRFS_INODE_NOCOMPRESS)
385 if (btrfs_test_opt(fs_info, COMPRESS) ||
386 BTRFS_I(inode)->flags & BTRFS_INODE_COMPRESS ||
387 BTRFS_I(inode)->force_compress)
392 static inline void inode_should_defrag(struct btrfs_inode *inode,
393 u64 start, u64 end, u64 num_bytes, u64 small_write)
395 /* If this is a small write inside eof, kick off a defrag */
396 if (num_bytes < small_write &&
397 (start > 0 || end + 1 < inode->disk_i_size))
398 btrfs_add_inode_defrag(NULL, inode);
402 * we create compressed extents in two phases. The first
403 * phase compresses a range of pages that have already been
404 * locked (both pages and state bits are locked).
406 * This is done inside an ordered work queue, and the compression
407 * is spread across many cpus. The actual IO submission is step
408 * two, and the ordered work queue takes care of making sure that
409 * happens in the same order things were put onto the queue by
410 * writepages and friends.
412 * If this code finds it can't get good compression, it puts an
413 * entry onto the work queue to write the uncompressed bytes. This
414 * makes sure that both compressed inodes and uncompressed inodes
415 * are written in the same order that the flusher thread sent them
418 static noinline void compress_file_range(struct inode *inode,
419 struct page *locked_page,
421 struct async_cow *async_cow,
424 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
425 struct btrfs_root *root = BTRFS_I(inode)->root;
427 u64 blocksize = fs_info->sectorsize;
429 u64 isize = i_size_read(inode);
431 struct page **pages = NULL;
432 unsigned long nr_pages;
433 unsigned long total_compressed = 0;
434 unsigned long total_in = 0;
437 int compress_type = fs_info->compress_type;
440 inode_should_defrag(BTRFS_I(inode), start, end, end - start + 1,
443 actual_end = min_t(u64, isize, end + 1);
446 nr_pages = (end >> PAGE_SHIFT) - (start >> PAGE_SHIFT) + 1;
447 BUILD_BUG_ON((BTRFS_MAX_COMPRESSED % PAGE_SIZE) != 0);
448 nr_pages = min_t(unsigned long, nr_pages,
449 BTRFS_MAX_COMPRESSED / PAGE_SIZE);
452 * we don't want to send crud past the end of i_size through
453 * compression, that's just a waste of CPU time. So, if the
454 * end of the file is before the start of our current
455 * requested range of bytes, we bail out to the uncompressed
456 * cleanup code that can deal with all of this.
458 * It isn't really the fastest way to fix things, but this is a
459 * very uncommon corner.
461 if (actual_end <= start)
462 goto cleanup_and_bail_uncompressed;
464 total_compressed = actual_end - start;
467 * skip compression for a small file range(<=blocksize) that
468 * isn't an inline extent, since it doesn't save disk space at all.
470 if (total_compressed <= blocksize &&
471 (start > 0 || end + 1 < BTRFS_I(inode)->disk_i_size))
472 goto cleanup_and_bail_uncompressed;
474 total_compressed = min_t(unsigned long, total_compressed,
475 BTRFS_MAX_UNCOMPRESSED);
476 num_bytes = ALIGN(end - start + 1, blocksize);
477 num_bytes = max(blocksize, num_bytes);
482 * we do compression for mount -o compress and when the
483 * inode has not been flagged as nocompress. This flag can
484 * change at any time if we discover bad compression ratios.
486 if (inode_need_compress(inode)) {
488 pages = kcalloc(nr_pages, sizeof(struct page *), GFP_NOFS);
490 /* just bail out to the uncompressed code */
494 if (BTRFS_I(inode)->force_compress)
495 compress_type = BTRFS_I(inode)->force_compress;
498 * we need to call clear_page_dirty_for_io on each
499 * page in the range. Otherwise applications with the file
500 * mmap'd can wander in and change the page contents while
501 * we are compressing them.
503 * If the compression fails for any reason, we set the pages
504 * dirty again later on.
506 extent_range_clear_dirty_for_io(inode, start, end);
508 ret = btrfs_compress_pages(compress_type,
509 inode->i_mapping, start,
516 unsigned long offset = total_compressed &
518 struct page *page = pages[nr_pages - 1];
521 /* zero the tail end of the last page, we might be
522 * sending it down to disk
525 kaddr = kmap_atomic(page);
526 memset(kaddr + offset, 0,
528 kunmap_atomic(kaddr);
535 /* lets try to make an inline extent */
536 if (ret || total_in < (actual_end - start)) {
537 /* we didn't compress the entire range, try
538 * to make an uncompressed inline extent.
540 ret = cow_file_range_inline(root, inode, start, end,
541 0, BTRFS_COMPRESS_NONE, NULL);
543 /* try making a compressed inline extent */
544 ret = cow_file_range_inline(root, inode, start, end,
546 compress_type, pages);
549 unsigned long clear_flags = EXTENT_DELALLOC |
551 unsigned long page_error_op;
553 clear_flags |= (ret < 0) ? EXTENT_DO_ACCOUNTING : 0;
554 page_error_op = ret < 0 ? PAGE_SET_ERROR : 0;
557 * inline extent creation worked or returned error,
558 * we don't need to create any more async work items.
559 * Unlock and free up our temp pages.
561 extent_clear_unlock_delalloc(inode, start, end, end,
568 btrfs_free_reserved_data_space_noquota(inode, start,
576 * we aren't doing an inline extent round the compressed size
577 * up to a block size boundary so the allocator does sane
580 total_compressed = ALIGN(total_compressed, blocksize);
583 * one last check to make sure the compression is really a
584 * win, compare the page count read with the blocks on disk
586 total_in = ALIGN(total_in, PAGE_SIZE);
587 if (total_compressed >= total_in) {
590 num_bytes = total_in;
594 * The async work queues will take care of doing actual
595 * allocation on disk for these compressed pages, and
596 * will submit them to the elevator.
598 add_async_extent(async_cow, start, num_bytes,
599 total_compressed, pages, nr_pages,
602 if (start + num_bytes < end) {
613 * the compression code ran but failed to make things smaller,
614 * free any pages it allocated and our page pointer array
616 for (i = 0; i < nr_pages; i++) {
617 WARN_ON(pages[i]->mapping);
622 total_compressed = 0;
625 /* flag the file so we don't compress in the future */
626 if (!btrfs_test_opt(fs_info, FORCE_COMPRESS) &&
627 !(BTRFS_I(inode)->force_compress)) {
628 BTRFS_I(inode)->flags |= BTRFS_INODE_NOCOMPRESS;
631 cleanup_and_bail_uncompressed:
633 * No compression, but we still need to write the pages in the file
634 * we've been given so far. redirty the locked page if it corresponds
635 * to our extent and set things up for the async work queue to run
636 * cow_file_range to do the normal delalloc dance.
638 if (page_offset(locked_page) >= start &&
639 page_offset(locked_page) <= end)
640 __set_page_dirty_nobuffers(locked_page);
641 /* unlocked later on in the async handlers */
644 extent_range_redirty_for_io(inode, start, end);
645 add_async_extent(async_cow, start, end - start + 1, 0, NULL, 0,
646 BTRFS_COMPRESS_NONE);
652 for (i = 0; i < nr_pages; i++) {
653 WARN_ON(pages[i]->mapping);
659 static void free_async_extent_pages(struct async_extent *async_extent)
663 if (!async_extent->pages)
666 for (i = 0; i < async_extent->nr_pages; i++) {
667 WARN_ON(async_extent->pages[i]->mapping);
668 put_page(async_extent->pages[i]);
670 kfree(async_extent->pages);
671 async_extent->nr_pages = 0;
672 async_extent->pages = NULL;
676 * phase two of compressed writeback. This is the ordered portion
677 * of the code, which only gets called in the order the work was
678 * queued. We walk all the async extents created by compress_file_range
679 * and send them down to the disk.
681 static noinline void submit_compressed_extents(struct inode *inode,
682 struct async_cow *async_cow)
684 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
685 struct async_extent *async_extent;
687 struct btrfs_key ins;
688 struct extent_map *em;
689 struct btrfs_root *root = BTRFS_I(inode)->root;
690 struct extent_io_tree *io_tree;
694 while (!list_empty(&async_cow->extents)) {
695 async_extent = list_entry(async_cow->extents.next,
696 struct async_extent, list);
697 list_del(&async_extent->list);
699 io_tree = &BTRFS_I(inode)->io_tree;
702 /* did the compression code fall back to uncompressed IO? */
703 if (!async_extent->pages) {
704 int page_started = 0;
705 unsigned long nr_written = 0;
707 lock_extent(io_tree, async_extent->start,
708 async_extent->start +
709 async_extent->ram_size - 1);
711 /* allocate blocks */
712 ret = cow_file_range(inode, async_cow->locked_page,
714 async_extent->start +
715 async_extent->ram_size - 1,
716 async_extent->start +
717 async_extent->ram_size - 1,
718 &page_started, &nr_written, 0,
724 * if page_started, cow_file_range inserted an
725 * inline extent and took care of all the unlocking
726 * and IO for us. Otherwise, we need to submit
727 * all those pages down to the drive.
729 if (!page_started && !ret)
730 extent_write_locked_range(io_tree,
731 inode, async_extent->start,
732 async_extent->start +
733 async_extent->ram_size - 1,
737 unlock_page(async_cow->locked_page);
743 lock_extent(io_tree, async_extent->start,
744 async_extent->start + async_extent->ram_size - 1);
746 ret = btrfs_reserve_extent(root, async_extent->ram_size,
747 async_extent->compressed_size,
748 async_extent->compressed_size,
749 0, alloc_hint, &ins, 1, 1);
751 free_async_extent_pages(async_extent);
753 if (ret == -ENOSPC) {
754 unlock_extent(io_tree, async_extent->start,
755 async_extent->start +
756 async_extent->ram_size - 1);
759 * we need to redirty the pages if we decide to
760 * fallback to uncompressed IO, otherwise we
761 * will not submit these pages down to lower
764 extent_range_redirty_for_io(inode,
766 async_extent->start +
767 async_extent->ram_size - 1);
774 * here we're doing allocation and writeback of the
777 em = create_io_em(inode, async_extent->start,
778 async_extent->ram_size, /* len */
779 async_extent->start, /* orig_start */
780 ins.objectid, /* block_start */
781 ins.offset, /* block_len */
782 ins.offset, /* orig_block_len */
783 async_extent->ram_size, /* ram_bytes */
784 async_extent->compress_type,
785 BTRFS_ORDERED_COMPRESSED);
787 /* ret value is not necessary due to void function */
788 goto out_free_reserve;
791 ret = btrfs_add_ordered_extent_compress(inode,
794 async_extent->ram_size,
796 BTRFS_ORDERED_COMPRESSED,
797 async_extent->compress_type);
799 btrfs_drop_extent_cache(BTRFS_I(inode),
801 async_extent->start +
802 async_extent->ram_size - 1, 0);
803 goto out_free_reserve;
805 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
808 * clear dirty, set writeback and unlock the pages.
810 extent_clear_unlock_delalloc(inode, async_extent->start,
811 async_extent->start +
812 async_extent->ram_size - 1,
813 async_extent->start +
814 async_extent->ram_size - 1,
815 NULL, EXTENT_LOCKED | EXTENT_DELALLOC,
816 PAGE_UNLOCK | PAGE_CLEAR_DIRTY |
818 ret = btrfs_submit_compressed_write(inode,
820 async_extent->ram_size,
822 ins.offset, async_extent->pages,
823 async_extent->nr_pages);
825 struct extent_io_tree *tree = &BTRFS_I(inode)->io_tree;
826 struct page *p = async_extent->pages[0];
827 const u64 start = async_extent->start;
828 const u64 end = start + async_extent->ram_size - 1;
830 p->mapping = inode->i_mapping;
831 tree->ops->writepage_end_io_hook(p, start, end,
834 extent_clear_unlock_delalloc(inode, start, end, end,
838 free_async_extent_pages(async_extent);
840 alloc_hint = ins.objectid + ins.offset;
846 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
847 btrfs_free_reserved_extent(fs_info, ins.objectid, ins.offset, 1);
849 extent_clear_unlock_delalloc(inode, async_extent->start,
850 async_extent->start +
851 async_extent->ram_size - 1,
852 async_extent->start +
853 async_extent->ram_size - 1,
854 NULL, EXTENT_LOCKED | EXTENT_DELALLOC |
855 EXTENT_DEFRAG | EXTENT_DO_ACCOUNTING,
856 PAGE_UNLOCK | PAGE_CLEAR_DIRTY |
857 PAGE_SET_WRITEBACK | PAGE_END_WRITEBACK |
859 free_async_extent_pages(async_extent);
864 static u64 get_extent_allocation_hint(struct inode *inode, u64 start,
867 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
868 struct extent_map *em;
871 read_lock(&em_tree->lock);
872 em = search_extent_mapping(em_tree, start, num_bytes);
875 * if block start isn't an actual block number then find the
876 * first block in this inode and use that as a hint. If that
877 * block is also bogus then just don't worry about it.
879 if (em->block_start >= EXTENT_MAP_LAST_BYTE) {
881 em = search_extent_mapping(em_tree, 0, 0);
882 if (em && em->block_start < EXTENT_MAP_LAST_BYTE)
883 alloc_hint = em->block_start;
887 alloc_hint = em->block_start;
891 read_unlock(&em_tree->lock);
897 * when extent_io.c finds a delayed allocation range in the file,
898 * the call backs end up in this code. The basic idea is to
899 * allocate extents on disk for the range, and create ordered data structs
900 * in ram to track those extents.
902 * locked_page is the page that writepage had locked already. We use
903 * it to make sure we don't do extra locks or unlocks.
905 * *page_started is set to one if we unlock locked_page and do everything
906 * required to start IO on it. It may be clean and already done with
909 static noinline int cow_file_range(struct inode *inode,
910 struct page *locked_page,
911 u64 start, u64 end, u64 delalloc_end,
912 int *page_started, unsigned long *nr_written,
913 int unlock, struct btrfs_dedupe_hash *hash)
915 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
916 struct btrfs_root *root = BTRFS_I(inode)->root;
919 unsigned long ram_size;
922 u64 blocksize = fs_info->sectorsize;
923 struct btrfs_key ins;
924 struct extent_map *em;
927 if (btrfs_is_free_space_inode(BTRFS_I(inode))) {
933 num_bytes = ALIGN(end - start + 1, blocksize);
934 num_bytes = max(blocksize, num_bytes);
935 disk_num_bytes = num_bytes;
937 inode_should_defrag(BTRFS_I(inode), start, end, num_bytes, SZ_64K);
940 /* lets try to make an inline extent */
941 ret = cow_file_range_inline(root, inode, start, end, 0,
942 BTRFS_COMPRESS_NONE, NULL);
944 extent_clear_unlock_delalloc(inode, start, end,
946 EXTENT_LOCKED | EXTENT_DELALLOC |
947 EXTENT_DEFRAG, PAGE_UNLOCK |
948 PAGE_CLEAR_DIRTY | PAGE_SET_WRITEBACK |
950 btrfs_free_reserved_data_space_noquota(inode, start,
952 *nr_written = *nr_written +
953 (end - start + PAGE_SIZE) / PAGE_SIZE;
956 } else if (ret < 0) {
961 BUG_ON(disk_num_bytes >
962 btrfs_super_total_bytes(fs_info->super_copy));
964 alloc_hint = get_extent_allocation_hint(inode, start, num_bytes);
965 btrfs_drop_extent_cache(BTRFS_I(inode), start,
966 start + num_bytes - 1, 0);
968 while (disk_num_bytes > 0) {
971 cur_alloc_size = disk_num_bytes;
972 ret = btrfs_reserve_extent(root, cur_alloc_size, cur_alloc_size,
973 fs_info->sectorsize, 0, alloc_hint,
978 ram_size = ins.offset;
979 em = create_io_em(inode, start, ins.offset, /* len */
980 start, /* orig_start */
981 ins.objectid, /* block_start */
982 ins.offset, /* block_len */
983 ins.offset, /* orig_block_len */
984 ram_size, /* ram_bytes */
985 BTRFS_COMPRESS_NONE, /* compress_type */
986 BTRFS_ORDERED_REGULAR /* type */);
991 cur_alloc_size = ins.offset;
992 ret = btrfs_add_ordered_extent(inode, start, ins.objectid,
993 ram_size, cur_alloc_size, 0);
995 goto out_drop_extent_cache;
997 if (root->root_key.objectid ==
998 BTRFS_DATA_RELOC_TREE_OBJECTID) {
999 ret = btrfs_reloc_clone_csums(inode, start,
1002 goto out_drop_extent_cache;
1005 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
1007 if (disk_num_bytes < cur_alloc_size)
1010 /* we're not doing compressed IO, don't unlock the first
1011 * page (which the caller expects to stay locked), don't
1012 * clear any dirty bits and don't set any writeback bits
1014 * Do set the Private2 bit so we know this page was properly
1015 * setup for writepage
1017 op = unlock ? PAGE_UNLOCK : 0;
1018 op |= PAGE_SET_PRIVATE2;
1020 extent_clear_unlock_delalloc(inode, start,
1021 start + ram_size - 1,
1022 delalloc_end, locked_page,
1023 EXTENT_LOCKED | EXTENT_DELALLOC,
1025 disk_num_bytes -= cur_alloc_size;
1026 num_bytes -= cur_alloc_size;
1027 alloc_hint = ins.objectid + ins.offset;
1028 start += cur_alloc_size;
1033 out_drop_extent_cache:
1034 btrfs_drop_extent_cache(BTRFS_I(inode), start, start + ram_size - 1, 0);
1036 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
1037 btrfs_free_reserved_extent(fs_info, ins.objectid, ins.offset, 1);
1039 extent_clear_unlock_delalloc(inode, start, end, delalloc_end,
1041 EXTENT_LOCKED | EXTENT_DO_ACCOUNTING |
1042 EXTENT_DELALLOC | EXTENT_DEFRAG,
1043 PAGE_UNLOCK | PAGE_CLEAR_DIRTY |
1044 PAGE_SET_WRITEBACK | PAGE_END_WRITEBACK);
1049 * work queue call back to started compression on a file and pages
1051 static noinline void async_cow_start(struct btrfs_work *work)
1053 struct async_cow *async_cow;
1055 async_cow = container_of(work, struct async_cow, work);
1057 compress_file_range(async_cow->inode, async_cow->locked_page,
1058 async_cow->start, async_cow->end, async_cow,
1060 if (num_added == 0) {
1061 btrfs_add_delayed_iput(async_cow->inode);
1062 async_cow->inode = NULL;
1067 * work queue call back to submit previously compressed pages
1069 static noinline void async_cow_submit(struct btrfs_work *work)
1071 struct btrfs_fs_info *fs_info;
1072 struct async_cow *async_cow;
1073 struct btrfs_root *root;
1074 unsigned long nr_pages;
1076 async_cow = container_of(work, struct async_cow, work);
1078 root = async_cow->root;
1079 fs_info = root->fs_info;
1080 nr_pages = (async_cow->end - async_cow->start + PAGE_SIZE) >>
1084 * atomic_sub_return implies a barrier for waitqueue_active
1086 if (atomic_sub_return(nr_pages, &fs_info->async_delalloc_pages) <
1088 waitqueue_active(&fs_info->async_submit_wait))
1089 wake_up(&fs_info->async_submit_wait);
1091 if (async_cow->inode)
1092 submit_compressed_extents(async_cow->inode, async_cow);
1095 static noinline void async_cow_free(struct btrfs_work *work)
1097 struct async_cow *async_cow;
1098 async_cow = container_of(work, struct async_cow, work);
1099 if (async_cow->inode)
1100 btrfs_add_delayed_iput(async_cow->inode);
1104 static int cow_file_range_async(struct inode *inode, struct page *locked_page,
1105 u64 start, u64 end, int *page_started,
1106 unsigned long *nr_written)
1108 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
1109 struct async_cow *async_cow;
1110 struct btrfs_root *root = BTRFS_I(inode)->root;
1111 unsigned long nr_pages;
1114 clear_extent_bit(&BTRFS_I(inode)->io_tree, start, end, EXTENT_LOCKED,
1115 1, 0, NULL, GFP_NOFS);
1116 while (start < end) {
1117 async_cow = kmalloc(sizeof(*async_cow), GFP_NOFS);
1118 BUG_ON(!async_cow); /* -ENOMEM */
1119 async_cow->inode = igrab(inode);
1120 async_cow->root = root;
1121 async_cow->locked_page = locked_page;
1122 async_cow->start = start;
1124 if (BTRFS_I(inode)->flags & BTRFS_INODE_NOCOMPRESS &&
1125 !btrfs_test_opt(fs_info, FORCE_COMPRESS))
1128 cur_end = min(end, start + SZ_512K - 1);
1130 async_cow->end = cur_end;
1131 INIT_LIST_HEAD(&async_cow->extents);
1133 btrfs_init_work(&async_cow->work,
1134 btrfs_delalloc_helper,
1135 async_cow_start, async_cow_submit,
1138 nr_pages = (cur_end - start + PAGE_SIZE) >>
1140 atomic_add(nr_pages, &fs_info->async_delalloc_pages);
1142 btrfs_queue_work(fs_info->delalloc_workers, &async_cow->work);
1144 while (atomic_read(&fs_info->async_submit_draining) &&
1145 atomic_read(&fs_info->async_delalloc_pages)) {
1146 wait_event(fs_info->async_submit_wait,
1147 (atomic_read(&fs_info->async_delalloc_pages) ==
1151 *nr_written += nr_pages;
1152 start = cur_end + 1;
1158 static noinline int csum_exist_in_range(struct btrfs_fs_info *fs_info,
1159 u64 bytenr, u64 num_bytes)
1162 struct btrfs_ordered_sum *sums;
1165 ret = btrfs_lookup_csums_range(fs_info->csum_root, bytenr,
1166 bytenr + num_bytes - 1, &list, 0);
1167 if (ret == 0 && list_empty(&list))
1170 while (!list_empty(&list)) {
1171 sums = list_entry(list.next, struct btrfs_ordered_sum, list);
1172 list_del(&sums->list);
1179 * when nowcow writeback call back. This checks for snapshots or COW copies
1180 * of the extents that exist in the file, and COWs the file as required.
1182 * If no cow copies or snapshots exist, we write directly to the existing
1185 static noinline int run_delalloc_nocow(struct inode *inode,
1186 struct page *locked_page,
1187 u64 start, u64 end, int *page_started, int force,
1188 unsigned long *nr_written)
1190 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
1191 struct btrfs_root *root = BTRFS_I(inode)->root;
1192 struct extent_buffer *leaf;
1193 struct btrfs_path *path;
1194 struct btrfs_file_extent_item *fi;
1195 struct btrfs_key found_key;
1196 struct extent_map *em;
1211 u64 ino = btrfs_ino(BTRFS_I(inode));
1213 path = btrfs_alloc_path();
1215 extent_clear_unlock_delalloc(inode, start, end, end,
1217 EXTENT_LOCKED | EXTENT_DELALLOC |
1218 EXTENT_DO_ACCOUNTING |
1219 EXTENT_DEFRAG, PAGE_UNLOCK |
1221 PAGE_SET_WRITEBACK |
1222 PAGE_END_WRITEBACK);
1226 nolock = btrfs_is_free_space_inode(BTRFS_I(inode));
1228 cow_start = (u64)-1;
1231 ret = btrfs_lookup_file_extent(NULL, root, path, ino,
1235 if (ret > 0 && path->slots[0] > 0 && check_prev) {
1236 leaf = path->nodes[0];
1237 btrfs_item_key_to_cpu(leaf, &found_key,
1238 path->slots[0] - 1);
1239 if (found_key.objectid == ino &&
1240 found_key.type == BTRFS_EXTENT_DATA_KEY)
1245 leaf = path->nodes[0];
1246 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
1247 ret = btrfs_next_leaf(root, path);
1252 leaf = path->nodes[0];
1258 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
1260 if (found_key.objectid > ino)
1262 if (WARN_ON_ONCE(found_key.objectid < ino) ||
1263 found_key.type < BTRFS_EXTENT_DATA_KEY) {
1267 if (found_key.type > BTRFS_EXTENT_DATA_KEY ||
1268 found_key.offset > end)
1271 if (found_key.offset > cur_offset) {
1272 extent_end = found_key.offset;
1277 fi = btrfs_item_ptr(leaf, path->slots[0],
1278 struct btrfs_file_extent_item);
1279 extent_type = btrfs_file_extent_type(leaf, fi);
1281 ram_bytes = btrfs_file_extent_ram_bytes(leaf, fi);
1282 if (extent_type == BTRFS_FILE_EXTENT_REG ||
1283 extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
1284 disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
1285 extent_offset = btrfs_file_extent_offset(leaf, fi);
1286 extent_end = found_key.offset +
1287 btrfs_file_extent_num_bytes(leaf, fi);
1289 btrfs_file_extent_disk_num_bytes(leaf, fi);
1290 if (extent_end <= start) {
1294 if (disk_bytenr == 0)
1296 if (btrfs_file_extent_compression(leaf, fi) ||
1297 btrfs_file_extent_encryption(leaf, fi) ||
1298 btrfs_file_extent_other_encoding(leaf, fi))
1300 if (extent_type == BTRFS_FILE_EXTENT_REG && !force)
1302 if (btrfs_extent_readonly(fs_info, disk_bytenr))
1304 if (btrfs_cross_ref_exist(root, ino,
1306 extent_offset, disk_bytenr))
1308 disk_bytenr += extent_offset;
1309 disk_bytenr += cur_offset - found_key.offset;
1310 num_bytes = min(end + 1, extent_end) - cur_offset;
1312 * if there are pending snapshots for this root,
1313 * we fall into common COW way.
1316 err = btrfs_start_write_no_snapshoting(root);
1321 * force cow if csum exists in the range.
1322 * this ensure that csum for a given extent are
1323 * either valid or do not exist.
1325 if (csum_exist_in_range(fs_info, disk_bytenr,
1328 if (!btrfs_inc_nocow_writers(fs_info, disk_bytenr))
1331 } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
1332 extent_end = found_key.offset +
1333 btrfs_file_extent_inline_len(leaf,
1334 path->slots[0], fi);
1335 extent_end = ALIGN(extent_end,
1336 fs_info->sectorsize);
1341 if (extent_end <= start) {
1343 if (!nolock && nocow)
1344 btrfs_end_write_no_snapshoting(root);
1346 btrfs_dec_nocow_writers(fs_info, disk_bytenr);
1350 if (cow_start == (u64)-1)
1351 cow_start = cur_offset;
1352 cur_offset = extent_end;
1353 if (cur_offset > end)
1359 btrfs_release_path(path);
1360 if (cow_start != (u64)-1) {
1361 ret = cow_file_range(inode, locked_page,
1362 cow_start, found_key.offset - 1,
1363 end, page_started, nr_written, 1,
1366 if (!nolock && nocow)
1367 btrfs_end_write_no_snapshoting(root);
1369 btrfs_dec_nocow_writers(fs_info,
1373 cow_start = (u64)-1;
1376 if (extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
1377 u64 orig_start = found_key.offset - extent_offset;
1379 em = create_io_em(inode, cur_offset, num_bytes,
1381 disk_bytenr, /* block_start */
1382 num_bytes, /* block_len */
1383 disk_num_bytes, /* orig_block_len */
1384 ram_bytes, BTRFS_COMPRESS_NONE,
1385 BTRFS_ORDERED_PREALLOC);
1387 if (!nolock && nocow)
1388 btrfs_end_write_no_snapshoting(root);
1390 btrfs_dec_nocow_writers(fs_info,
1395 free_extent_map(em);
1398 if (extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
1399 type = BTRFS_ORDERED_PREALLOC;
1401 type = BTRFS_ORDERED_NOCOW;
1404 ret = btrfs_add_ordered_extent(inode, cur_offset, disk_bytenr,
1405 num_bytes, num_bytes, type);
1407 btrfs_dec_nocow_writers(fs_info, disk_bytenr);
1408 BUG_ON(ret); /* -ENOMEM */
1410 if (root->root_key.objectid ==
1411 BTRFS_DATA_RELOC_TREE_OBJECTID) {
1412 ret = btrfs_reloc_clone_csums(inode, cur_offset,
1415 if (!nolock && nocow)
1416 btrfs_end_write_no_snapshoting(root);
1421 extent_clear_unlock_delalloc(inode, cur_offset,
1422 cur_offset + num_bytes - 1, end,
1423 locked_page, EXTENT_LOCKED |
1425 EXTENT_CLEAR_DATA_RESV,
1426 PAGE_UNLOCK | PAGE_SET_PRIVATE2);
1428 if (!nolock && nocow)
1429 btrfs_end_write_no_snapshoting(root);
1430 cur_offset = extent_end;
1431 if (cur_offset > end)
1434 btrfs_release_path(path);
1436 if (cur_offset <= end && cow_start == (u64)-1) {
1437 cow_start = cur_offset;
1441 if (cow_start != (u64)-1) {
1442 ret = cow_file_range(inode, locked_page, cow_start, end, end,
1443 page_started, nr_written, 1, NULL);
1449 if (ret && cur_offset < end)
1450 extent_clear_unlock_delalloc(inode, cur_offset, end, end,
1451 locked_page, EXTENT_LOCKED |
1452 EXTENT_DELALLOC | EXTENT_DEFRAG |
1453 EXTENT_DO_ACCOUNTING, PAGE_UNLOCK |
1455 PAGE_SET_WRITEBACK |
1456 PAGE_END_WRITEBACK);
1457 btrfs_free_path(path);
1461 static inline int need_force_cow(struct inode *inode, u64 start, u64 end)
1464 if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW) &&
1465 !(BTRFS_I(inode)->flags & BTRFS_INODE_PREALLOC))
1469 * @defrag_bytes is a hint value, no spinlock held here,
1470 * if is not zero, it means the file is defragging.
1471 * Force cow if given extent needs to be defragged.
1473 if (BTRFS_I(inode)->defrag_bytes &&
1474 test_range_bit(&BTRFS_I(inode)->io_tree, start, end,
1475 EXTENT_DEFRAG, 0, NULL))
1482 * extent_io.c call back to do delayed allocation processing
1484 static int run_delalloc_range(struct inode *inode, struct page *locked_page,
1485 u64 start, u64 end, int *page_started,
1486 unsigned long *nr_written)
1489 int force_cow = need_force_cow(inode, start, end);
1491 if (BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW && !force_cow) {
1492 ret = run_delalloc_nocow(inode, locked_page, start, end,
1493 page_started, 1, nr_written);
1494 } else if (BTRFS_I(inode)->flags & BTRFS_INODE_PREALLOC && !force_cow) {
1495 ret = run_delalloc_nocow(inode, locked_page, start, end,
1496 page_started, 0, nr_written);
1497 } else if (!inode_need_compress(inode)) {
1498 ret = cow_file_range(inode, locked_page, start, end, end,
1499 page_started, nr_written, 1, NULL);
1501 set_bit(BTRFS_INODE_HAS_ASYNC_EXTENT,
1502 &BTRFS_I(inode)->runtime_flags);
1503 ret = cow_file_range_async(inode, locked_page, start, end,
1504 page_started, nr_written);
1509 static void btrfs_split_extent_hook(struct inode *inode,
1510 struct extent_state *orig, u64 split)
1514 /* not delalloc, ignore it */
1515 if (!(orig->state & EXTENT_DELALLOC))
1518 size = orig->end - orig->start + 1;
1519 if (size > BTRFS_MAX_EXTENT_SIZE) {
1524 * See the explanation in btrfs_merge_extent_hook, the same
1525 * applies here, just in reverse.
1527 new_size = orig->end - split + 1;
1528 num_extents = count_max_extents(new_size);
1529 new_size = split - orig->start;
1530 num_extents += count_max_extents(new_size);
1531 if (count_max_extents(size) >= num_extents)
1535 spin_lock(&BTRFS_I(inode)->lock);
1536 BTRFS_I(inode)->outstanding_extents++;
1537 spin_unlock(&BTRFS_I(inode)->lock);
1541 * extent_io.c merge_extent_hook, used to track merged delayed allocation
1542 * extents so we can keep track of new extents that are just merged onto old
1543 * extents, such as when we are doing sequential writes, so we can properly
1544 * account for the metadata space we'll need.
1546 static void btrfs_merge_extent_hook(struct inode *inode,
1547 struct extent_state *new,
1548 struct extent_state *other)
1550 u64 new_size, old_size;
1553 /* not delalloc, ignore it */
1554 if (!(other->state & EXTENT_DELALLOC))
1557 if (new->start > other->start)
1558 new_size = new->end - other->start + 1;
1560 new_size = other->end - new->start + 1;
1562 /* we're not bigger than the max, unreserve the space and go */
1563 if (new_size <= BTRFS_MAX_EXTENT_SIZE) {
1564 spin_lock(&BTRFS_I(inode)->lock);
1565 BTRFS_I(inode)->outstanding_extents--;
1566 spin_unlock(&BTRFS_I(inode)->lock);
1571 * We have to add up either side to figure out how many extents were
1572 * accounted for before we merged into one big extent. If the number of
1573 * extents we accounted for is <= the amount we need for the new range
1574 * then we can return, otherwise drop. Think of it like this
1578 * So we've grown the extent by a MAX_SIZE extent, this would mean we
1579 * need 2 outstanding extents, on one side we have 1 and the other side
1580 * we have 1 so they are == and we can return. But in this case
1582 * [MAX_SIZE+4k][MAX_SIZE+4k]
1584 * Each range on their own accounts for 2 extents, but merged together
1585 * they are only 3 extents worth of accounting, so we need to drop in
1588 old_size = other->end - other->start + 1;
1589 num_extents = count_max_extents(old_size);
1590 old_size = new->end - new->start + 1;
1591 num_extents += count_max_extents(old_size);
1592 if (count_max_extents(new_size) >= num_extents)
1595 spin_lock(&BTRFS_I(inode)->lock);
1596 BTRFS_I(inode)->outstanding_extents--;
1597 spin_unlock(&BTRFS_I(inode)->lock);
1600 static void btrfs_add_delalloc_inodes(struct btrfs_root *root,
1601 struct inode *inode)
1603 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
1605 spin_lock(&root->delalloc_lock);
1606 if (list_empty(&BTRFS_I(inode)->delalloc_inodes)) {
1607 list_add_tail(&BTRFS_I(inode)->delalloc_inodes,
1608 &root->delalloc_inodes);
1609 set_bit(BTRFS_INODE_IN_DELALLOC_LIST,
1610 &BTRFS_I(inode)->runtime_flags);
1611 root->nr_delalloc_inodes++;
1612 if (root->nr_delalloc_inodes == 1) {
1613 spin_lock(&fs_info->delalloc_root_lock);
1614 BUG_ON(!list_empty(&root->delalloc_root));
1615 list_add_tail(&root->delalloc_root,
1616 &fs_info->delalloc_roots);
1617 spin_unlock(&fs_info->delalloc_root_lock);
1620 spin_unlock(&root->delalloc_lock);
1623 static void btrfs_del_delalloc_inode(struct btrfs_root *root,
1624 struct btrfs_inode *inode)
1626 struct btrfs_fs_info *fs_info = btrfs_sb(inode->vfs_inode.i_sb);
1628 spin_lock(&root->delalloc_lock);
1629 if (!list_empty(&inode->delalloc_inodes)) {
1630 list_del_init(&inode->delalloc_inodes);
1631 clear_bit(BTRFS_INODE_IN_DELALLOC_LIST,
1632 &inode->runtime_flags);
1633 root->nr_delalloc_inodes--;
1634 if (!root->nr_delalloc_inodes) {
1635 spin_lock(&fs_info->delalloc_root_lock);
1636 BUG_ON(list_empty(&root->delalloc_root));
1637 list_del_init(&root->delalloc_root);
1638 spin_unlock(&fs_info->delalloc_root_lock);
1641 spin_unlock(&root->delalloc_lock);
1645 * extent_io.c set_bit_hook, used to track delayed allocation
1646 * bytes in this file, and to maintain the list of inodes that
1647 * have pending delalloc work to be done.
1649 static void btrfs_set_bit_hook(struct inode *inode,
1650 struct extent_state *state, unsigned *bits)
1653 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
1655 if ((*bits & EXTENT_DEFRAG) && !(*bits & EXTENT_DELALLOC))
1658 * set_bit and clear bit hooks normally require _irqsave/restore
1659 * but in this case, we are only testing for the DELALLOC
1660 * bit, which is only set or cleared with irqs on
1662 if (!(state->state & EXTENT_DELALLOC) && (*bits & EXTENT_DELALLOC)) {
1663 struct btrfs_root *root = BTRFS_I(inode)->root;
1664 u64 len = state->end + 1 - state->start;
1665 bool do_list = !btrfs_is_free_space_inode(BTRFS_I(inode));
1667 if (*bits & EXTENT_FIRST_DELALLOC) {
1668 *bits &= ~EXTENT_FIRST_DELALLOC;
1670 spin_lock(&BTRFS_I(inode)->lock);
1671 BTRFS_I(inode)->outstanding_extents++;
1672 spin_unlock(&BTRFS_I(inode)->lock);
1675 /* For sanity tests */
1676 if (btrfs_is_testing(fs_info))
1679 __percpu_counter_add(&fs_info->delalloc_bytes, len,
1680 fs_info->delalloc_batch);
1681 spin_lock(&BTRFS_I(inode)->lock);
1682 BTRFS_I(inode)->delalloc_bytes += len;
1683 if (*bits & EXTENT_DEFRAG)
1684 BTRFS_I(inode)->defrag_bytes += len;
1685 if (do_list && !test_bit(BTRFS_INODE_IN_DELALLOC_LIST,
1686 &BTRFS_I(inode)->runtime_flags))
1687 btrfs_add_delalloc_inodes(root, inode);
1688 spin_unlock(&BTRFS_I(inode)->lock);
1693 * extent_io.c clear_bit_hook, see set_bit_hook for why
1695 static void btrfs_clear_bit_hook(struct btrfs_inode *inode,
1696 struct extent_state *state,
1699 struct btrfs_fs_info *fs_info = btrfs_sb(inode->vfs_inode.i_sb);
1700 u64 len = state->end + 1 - state->start;
1701 u32 num_extents = count_max_extents(len);
1703 spin_lock(&inode->lock);
1704 if ((state->state & EXTENT_DEFRAG) && (*bits & EXTENT_DEFRAG))
1705 inode->defrag_bytes -= len;
1706 spin_unlock(&inode->lock);
1709 * set_bit and clear bit hooks normally require _irqsave/restore
1710 * but in this case, we are only testing for the DELALLOC
1711 * bit, which is only set or cleared with irqs on
1713 if ((state->state & EXTENT_DELALLOC) && (*bits & EXTENT_DELALLOC)) {
1714 struct btrfs_root *root = inode->root;
1715 bool do_list = !btrfs_is_free_space_inode(inode);
1717 if (*bits & EXTENT_FIRST_DELALLOC) {
1718 *bits &= ~EXTENT_FIRST_DELALLOC;
1719 } else if (!(*bits & EXTENT_DO_ACCOUNTING)) {
1720 spin_lock(&inode->lock);
1721 inode->outstanding_extents -= num_extents;
1722 spin_unlock(&inode->lock);
1726 * We don't reserve metadata space for space cache inodes so we
1727 * don't need to call dellalloc_release_metadata if there is an
1730 if (*bits & EXTENT_DO_ACCOUNTING &&
1731 root != fs_info->tree_root)
1732 btrfs_delalloc_release_metadata(inode, len);
1734 /* For sanity tests. */
1735 if (btrfs_is_testing(fs_info))
1738 if (root->root_key.objectid != BTRFS_DATA_RELOC_TREE_OBJECTID
1739 && do_list && !(state->state & EXTENT_NORESERVE)
1740 && (*bits & (EXTENT_DO_ACCOUNTING |
1741 EXTENT_CLEAR_DATA_RESV)))
1742 btrfs_free_reserved_data_space_noquota(
1746 __percpu_counter_add(&fs_info->delalloc_bytes, -len,
1747 fs_info->delalloc_batch);
1748 spin_lock(&inode->lock);
1749 inode->delalloc_bytes -= len;
1750 if (do_list && inode->delalloc_bytes == 0 &&
1751 test_bit(BTRFS_INODE_IN_DELALLOC_LIST,
1752 &inode->runtime_flags))
1753 btrfs_del_delalloc_inode(root, inode);
1754 spin_unlock(&inode->lock);
1759 * extent_io.c merge_bio_hook, this must check the chunk tree to make sure
1760 * we don't create bios that span stripes or chunks
1762 * return 1 if page cannot be merged to bio
1763 * return 0 if page can be merged to bio
1764 * return error otherwise
1766 int btrfs_merge_bio_hook(struct page *page, unsigned long offset,
1767 size_t size, struct bio *bio,
1768 unsigned long bio_flags)
1770 struct inode *inode = page->mapping->host;
1771 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
1772 u64 logical = (u64)bio->bi_iter.bi_sector << 9;
1777 if (bio_flags & EXTENT_BIO_COMPRESSED)
1780 length = bio->bi_iter.bi_size;
1781 map_length = length;
1782 ret = btrfs_map_block(fs_info, btrfs_op(bio), logical, &map_length,
1786 if (map_length < length + size)
1792 * in order to insert checksums into the metadata in large chunks,
1793 * we wait until bio submission time. All the pages in the bio are
1794 * checksummed and sums are attached onto the ordered extent record.
1796 * At IO completion time the cums attached on the ordered extent record
1797 * are inserted into the btree
1799 static int __btrfs_submit_bio_start(struct inode *inode, struct bio *bio,
1800 int mirror_num, unsigned long bio_flags,
1805 ret = btrfs_csum_one_bio(inode, bio, 0, 0);
1806 BUG_ON(ret); /* -ENOMEM */
1811 * in order to insert checksums into the metadata in large chunks,
1812 * we wait until bio submission time. All the pages in the bio are
1813 * checksummed and sums are attached onto the ordered extent record.
1815 * At IO completion time the cums attached on the ordered extent record
1816 * are inserted into the btree
1818 static int __btrfs_submit_bio_done(struct inode *inode, struct bio *bio,
1819 int mirror_num, unsigned long bio_flags,
1822 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
1825 ret = btrfs_map_bio(fs_info, bio, mirror_num, 1);
1827 bio->bi_error = ret;
1834 * extent_io.c submission hook. This does the right thing for csum calculation
1835 * on write, or reading the csums from the tree before a read
1837 static int btrfs_submit_bio_hook(struct inode *inode, struct bio *bio,
1838 int mirror_num, unsigned long bio_flags,
1841 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
1842 struct btrfs_root *root = BTRFS_I(inode)->root;
1843 enum btrfs_wq_endio_type metadata = BTRFS_WQ_ENDIO_DATA;
1846 int async = !atomic_read(&BTRFS_I(inode)->sync_writers);
1848 skip_sum = BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM;
1850 if (btrfs_is_free_space_inode(BTRFS_I(inode)))
1851 metadata = BTRFS_WQ_ENDIO_FREE_SPACE;
1853 if (bio_op(bio) != REQ_OP_WRITE) {
1854 ret = btrfs_bio_wq_end_io(fs_info, bio, metadata);
1858 if (bio_flags & EXTENT_BIO_COMPRESSED) {
1859 ret = btrfs_submit_compressed_read(inode, bio,
1863 } else if (!skip_sum) {
1864 ret = btrfs_lookup_bio_sums(inode, bio, NULL);
1869 } else if (async && !skip_sum) {
1870 /* csum items have already been cloned */
1871 if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID)
1873 /* we're doing a write, do the async checksumming */
1874 ret = btrfs_wq_submit_bio(fs_info, inode, bio, mirror_num,
1875 bio_flags, bio_offset,
1876 __btrfs_submit_bio_start,
1877 __btrfs_submit_bio_done);
1879 } else if (!skip_sum) {
1880 ret = btrfs_csum_one_bio(inode, bio, 0, 0);
1886 ret = btrfs_map_bio(fs_info, bio, mirror_num, 0);
1890 bio->bi_error = ret;
1897 * given a list of ordered sums record them in the inode. This happens
1898 * at IO completion time based on sums calculated at bio submission time.
1900 static noinline int add_pending_csums(struct btrfs_trans_handle *trans,
1901 struct inode *inode, struct list_head *list)
1903 struct btrfs_ordered_sum *sum;
1905 list_for_each_entry(sum, list, list) {
1906 trans->adding_csums = 1;
1907 btrfs_csum_file_blocks(trans,
1908 BTRFS_I(inode)->root->fs_info->csum_root, sum);
1909 trans->adding_csums = 0;
1914 int btrfs_set_extent_delalloc(struct inode *inode, u64 start, u64 end,
1915 struct extent_state **cached_state, int dedupe)
1917 WARN_ON((end & (PAGE_SIZE - 1)) == 0);
1918 return set_extent_delalloc(&BTRFS_I(inode)->io_tree, start, end,
1922 /* see btrfs_writepage_start_hook for details on why this is required */
1923 struct btrfs_writepage_fixup {
1925 struct btrfs_work work;
1928 static void btrfs_writepage_fixup_worker(struct btrfs_work *work)
1930 struct btrfs_writepage_fixup *fixup;
1931 struct btrfs_ordered_extent *ordered;
1932 struct extent_state *cached_state = NULL;
1934 struct inode *inode;
1939 fixup = container_of(work, struct btrfs_writepage_fixup, work);
1943 if (!page->mapping || !PageDirty(page) || !PageChecked(page)) {
1944 ClearPageChecked(page);
1948 inode = page->mapping->host;
1949 page_start = page_offset(page);
1950 page_end = page_offset(page) + PAGE_SIZE - 1;
1952 lock_extent_bits(&BTRFS_I(inode)->io_tree, page_start, page_end,
1955 /* already ordered? We're done */
1956 if (PagePrivate2(page))
1959 ordered = btrfs_lookup_ordered_range(BTRFS_I(inode), page_start,
1962 unlock_extent_cached(&BTRFS_I(inode)->io_tree, page_start,
1963 page_end, &cached_state, GFP_NOFS);
1965 btrfs_start_ordered_extent(inode, ordered, 1);
1966 btrfs_put_ordered_extent(ordered);
1970 ret = btrfs_delalloc_reserve_space(inode, page_start,
1973 mapping_set_error(page->mapping, ret);
1974 end_extent_writepage(page, ret, page_start, page_end);
1975 ClearPageChecked(page);
1979 btrfs_set_extent_delalloc(inode, page_start, page_end, &cached_state,
1981 ClearPageChecked(page);
1982 set_page_dirty(page);
1984 unlock_extent_cached(&BTRFS_I(inode)->io_tree, page_start, page_end,
1985 &cached_state, GFP_NOFS);
1993 * There are a few paths in the higher layers of the kernel that directly
1994 * set the page dirty bit without asking the filesystem if it is a
1995 * good idea. This causes problems because we want to make sure COW
1996 * properly happens and the data=ordered rules are followed.
1998 * In our case any range that doesn't have the ORDERED bit set
1999 * hasn't been properly setup for IO. We kick off an async process
2000 * to fix it up. The async helper will wait for ordered extents, set
2001 * the delalloc bit and make it safe to write the page.
2003 static int btrfs_writepage_start_hook(struct page *page, u64 start, u64 end)
2005 struct inode *inode = page->mapping->host;
2006 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
2007 struct btrfs_writepage_fixup *fixup;
2009 /* this page is properly in the ordered list */
2010 if (TestClearPagePrivate2(page))
2013 if (PageChecked(page))
2016 fixup = kzalloc(sizeof(*fixup), GFP_NOFS);
2020 SetPageChecked(page);
2022 btrfs_init_work(&fixup->work, btrfs_fixup_helper,
2023 btrfs_writepage_fixup_worker, NULL, NULL);
2025 btrfs_queue_work(fs_info->fixup_workers, &fixup->work);
2029 static int insert_reserved_file_extent(struct btrfs_trans_handle *trans,
2030 struct inode *inode, u64 file_pos,
2031 u64 disk_bytenr, u64 disk_num_bytes,
2032 u64 num_bytes, u64 ram_bytes,
2033 u8 compression, u8 encryption,
2034 u16 other_encoding, int extent_type)
2036 struct btrfs_root *root = BTRFS_I(inode)->root;
2037 struct btrfs_file_extent_item *fi;
2038 struct btrfs_path *path;
2039 struct extent_buffer *leaf;
2040 struct btrfs_key ins;
2041 int extent_inserted = 0;
2044 path = btrfs_alloc_path();
2049 * we may be replacing one extent in the tree with another.
2050 * The new extent is pinned in the extent map, and we don't want
2051 * to drop it from the cache until it is completely in the btree.
2053 * So, tell btrfs_drop_extents to leave this extent in the cache.
2054 * the caller is expected to unpin it and allow it to be merged
2057 ret = __btrfs_drop_extents(trans, root, inode, path, file_pos,
2058 file_pos + num_bytes, NULL, 0,
2059 1, sizeof(*fi), &extent_inserted);
2063 if (!extent_inserted) {
2064 ins.objectid = btrfs_ino(BTRFS_I(inode));
2065 ins.offset = file_pos;
2066 ins.type = BTRFS_EXTENT_DATA_KEY;
2068 path->leave_spinning = 1;
2069 ret = btrfs_insert_empty_item(trans, root, path, &ins,
2074 leaf = path->nodes[0];
2075 fi = btrfs_item_ptr(leaf, path->slots[0],
2076 struct btrfs_file_extent_item);
2077 btrfs_set_file_extent_generation(leaf, fi, trans->transid);
2078 btrfs_set_file_extent_type(leaf, fi, extent_type);
2079 btrfs_set_file_extent_disk_bytenr(leaf, fi, disk_bytenr);
2080 btrfs_set_file_extent_disk_num_bytes(leaf, fi, disk_num_bytes);
2081 btrfs_set_file_extent_offset(leaf, fi, 0);
2082 btrfs_set_file_extent_num_bytes(leaf, fi, num_bytes);
2083 btrfs_set_file_extent_ram_bytes(leaf, fi, ram_bytes);
2084 btrfs_set_file_extent_compression(leaf, fi, compression);
2085 btrfs_set_file_extent_encryption(leaf, fi, encryption);
2086 btrfs_set_file_extent_other_encoding(leaf, fi, other_encoding);
2088 btrfs_mark_buffer_dirty(leaf);
2089 btrfs_release_path(path);
2091 inode_add_bytes(inode, num_bytes);
2093 ins.objectid = disk_bytenr;
2094 ins.offset = disk_num_bytes;
2095 ins.type = BTRFS_EXTENT_ITEM_KEY;
2096 ret = btrfs_alloc_reserved_file_extent(trans, root->root_key.objectid,
2097 btrfs_ino(BTRFS_I(inode)), file_pos, ram_bytes, &ins);
2099 * Release the reserved range from inode dirty range map, as it is
2100 * already moved into delayed_ref_head
2102 btrfs_qgroup_release_data(inode, file_pos, ram_bytes);
2104 btrfs_free_path(path);
2109 /* snapshot-aware defrag */
2110 struct sa_defrag_extent_backref {
2111 struct rb_node node;
2112 struct old_sa_defrag_extent *old;
2121 struct old_sa_defrag_extent {
2122 struct list_head list;
2123 struct new_sa_defrag_extent *new;
2132 struct new_sa_defrag_extent {
2133 struct rb_root root;
2134 struct list_head head;
2135 struct btrfs_path *path;
2136 struct inode *inode;
2144 static int backref_comp(struct sa_defrag_extent_backref *b1,
2145 struct sa_defrag_extent_backref *b2)
2147 if (b1->root_id < b2->root_id)
2149 else if (b1->root_id > b2->root_id)
2152 if (b1->inum < b2->inum)
2154 else if (b1->inum > b2->inum)
2157 if (b1->file_pos < b2->file_pos)
2159 else if (b1->file_pos > b2->file_pos)
2163 * [------------------------------] ===> (a range of space)
2164 * |<--->| |<---->| =============> (fs/file tree A)
2165 * |<---------------------------->| ===> (fs/file tree B)
2167 * A range of space can refer to two file extents in one tree while
2168 * refer to only one file extent in another tree.
2170 * So we may process a disk offset more than one time(two extents in A)
2171 * and locate at the same extent(one extent in B), then insert two same
2172 * backrefs(both refer to the extent in B).
2177 static void backref_insert(struct rb_root *root,
2178 struct sa_defrag_extent_backref *backref)
2180 struct rb_node **p = &root->rb_node;
2181 struct rb_node *parent = NULL;
2182 struct sa_defrag_extent_backref *entry;
2187 entry = rb_entry(parent, struct sa_defrag_extent_backref, node);
2189 ret = backref_comp(backref, entry);
2193 p = &(*p)->rb_right;
2196 rb_link_node(&backref->node, parent, p);
2197 rb_insert_color(&backref->node, root);
2201 * Note the backref might has changed, and in this case we just return 0.
2203 static noinline int record_one_backref(u64 inum, u64 offset, u64 root_id,
2206 struct btrfs_file_extent_item *extent;
2207 struct old_sa_defrag_extent *old = ctx;
2208 struct new_sa_defrag_extent *new = old->new;
2209 struct btrfs_path *path = new->path;
2210 struct btrfs_key key;
2211 struct btrfs_root *root;
2212 struct sa_defrag_extent_backref *backref;
2213 struct extent_buffer *leaf;
2214 struct inode *inode = new->inode;
2215 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
2221 if (BTRFS_I(inode)->root->root_key.objectid == root_id &&
2222 inum == btrfs_ino(BTRFS_I(inode)))
2225 key.objectid = root_id;
2226 key.type = BTRFS_ROOT_ITEM_KEY;
2227 key.offset = (u64)-1;
2229 root = btrfs_read_fs_root_no_name(fs_info, &key);
2231 if (PTR_ERR(root) == -ENOENT)
2234 btrfs_debug(fs_info, "inum=%llu, offset=%llu, root_id=%llu",
2235 inum, offset, root_id);
2236 return PTR_ERR(root);
2239 key.objectid = inum;
2240 key.type = BTRFS_EXTENT_DATA_KEY;
2241 if (offset > (u64)-1 << 32)
2244 key.offset = offset;
2246 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
2247 if (WARN_ON(ret < 0))
2254 leaf = path->nodes[0];
2255 slot = path->slots[0];
2257 if (slot >= btrfs_header_nritems(leaf)) {
2258 ret = btrfs_next_leaf(root, path);
2261 } else if (ret > 0) {
2270 btrfs_item_key_to_cpu(leaf, &key, slot);
2272 if (key.objectid > inum)
2275 if (key.objectid < inum || key.type != BTRFS_EXTENT_DATA_KEY)
2278 extent = btrfs_item_ptr(leaf, slot,
2279 struct btrfs_file_extent_item);
2281 if (btrfs_file_extent_disk_bytenr(leaf, extent) != old->bytenr)
2285 * 'offset' refers to the exact key.offset,
2286 * NOT the 'offset' field in btrfs_extent_data_ref, ie.
2287 * (key.offset - extent_offset).
2289 if (key.offset != offset)
2292 extent_offset = btrfs_file_extent_offset(leaf, extent);
2293 num_bytes = btrfs_file_extent_num_bytes(leaf, extent);
2295 if (extent_offset >= old->extent_offset + old->offset +
2296 old->len || extent_offset + num_bytes <=
2297 old->extent_offset + old->offset)
2302 backref = kmalloc(sizeof(*backref), GFP_NOFS);
2308 backref->root_id = root_id;
2309 backref->inum = inum;
2310 backref->file_pos = offset;
2311 backref->num_bytes = num_bytes;
2312 backref->extent_offset = extent_offset;
2313 backref->generation = btrfs_file_extent_generation(leaf, extent);
2315 backref_insert(&new->root, backref);
2318 btrfs_release_path(path);
2323 static noinline bool record_extent_backrefs(struct btrfs_path *path,
2324 struct new_sa_defrag_extent *new)
2326 struct btrfs_fs_info *fs_info = btrfs_sb(new->inode->i_sb);
2327 struct old_sa_defrag_extent *old, *tmp;
2332 list_for_each_entry_safe(old, tmp, &new->head, list) {
2333 ret = iterate_inodes_from_logical(old->bytenr +
2334 old->extent_offset, fs_info,
2335 path, record_one_backref,
2337 if (ret < 0 && ret != -ENOENT)
2340 /* no backref to be processed for this extent */
2342 list_del(&old->list);
2347 if (list_empty(&new->head))
2353 static int relink_is_mergable(struct extent_buffer *leaf,
2354 struct btrfs_file_extent_item *fi,
2355 struct new_sa_defrag_extent *new)
2357 if (btrfs_file_extent_disk_bytenr(leaf, fi) != new->bytenr)
2360 if (btrfs_file_extent_type(leaf, fi) != BTRFS_FILE_EXTENT_REG)
2363 if (btrfs_file_extent_compression(leaf, fi) != new->compress_type)
2366 if (btrfs_file_extent_encryption(leaf, fi) ||
2367 btrfs_file_extent_other_encoding(leaf, fi))
2374 * Note the backref might has changed, and in this case we just return 0.
2376 static noinline int relink_extent_backref(struct btrfs_path *path,
2377 struct sa_defrag_extent_backref *prev,
2378 struct sa_defrag_extent_backref *backref)
2380 struct btrfs_file_extent_item *extent;
2381 struct btrfs_file_extent_item *item;
2382 struct btrfs_ordered_extent *ordered;
2383 struct btrfs_trans_handle *trans;
2384 struct btrfs_root *root;
2385 struct btrfs_key key;
2386 struct extent_buffer *leaf;
2387 struct old_sa_defrag_extent *old = backref->old;
2388 struct new_sa_defrag_extent *new = old->new;
2389 struct btrfs_fs_info *fs_info = btrfs_sb(new->inode->i_sb);
2390 struct inode *inode;
2391 struct extent_state *cached = NULL;
2400 if (prev && prev->root_id == backref->root_id &&
2401 prev->inum == backref->inum &&
2402 prev->file_pos + prev->num_bytes == backref->file_pos)
2405 /* step 1: get root */
2406 key.objectid = backref->root_id;
2407 key.type = BTRFS_ROOT_ITEM_KEY;
2408 key.offset = (u64)-1;
2410 index = srcu_read_lock(&fs_info->subvol_srcu);
2412 root = btrfs_read_fs_root_no_name(fs_info, &key);
2414 srcu_read_unlock(&fs_info->subvol_srcu, index);
2415 if (PTR_ERR(root) == -ENOENT)
2417 return PTR_ERR(root);
2420 if (btrfs_root_readonly(root)) {
2421 srcu_read_unlock(&fs_info->subvol_srcu, index);
2425 /* step 2: get inode */
2426 key.objectid = backref->inum;
2427 key.type = BTRFS_INODE_ITEM_KEY;
2430 inode = btrfs_iget(fs_info->sb, &key, root, NULL);
2431 if (IS_ERR(inode)) {
2432 srcu_read_unlock(&fs_info->subvol_srcu, index);
2436 srcu_read_unlock(&fs_info->subvol_srcu, index);
2438 /* step 3: relink backref */
2439 lock_start = backref->file_pos;
2440 lock_end = backref->file_pos + backref->num_bytes - 1;
2441 lock_extent_bits(&BTRFS_I(inode)->io_tree, lock_start, lock_end,
2444 ordered = btrfs_lookup_first_ordered_extent(inode, lock_end);
2446 btrfs_put_ordered_extent(ordered);
2450 trans = btrfs_join_transaction(root);
2451 if (IS_ERR(trans)) {
2452 ret = PTR_ERR(trans);
2456 key.objectid = backref->inum;
2457 key.type = BTRFS_EXTENT_DATA_KEY;
2458 key.offset = backref->file_pos;
2460 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
2463 } else if (ret > 0) {
2468 extent = btrfs_item_ptr(path->nodes[0], path->slots[0],
2469 struct btrfs_file_extent_item);
2471 if (btrfs_file_extent_generation(path->nodes[0], extent) !=
2472 backref->generation)
2475 btrfs_release_path(path);
2477 start = backref->file_pos;
2478 if (backref->extent_offset < old->extent_offset + old->offset)
2479 start += old->extent_offset + old->offset -
2480 backref->extent_offset;
2482 len = min(backref->extent_offset + backref->num_bytes,
2483 old->extent_offset + old->offset + old->len);
2484 len -= max(backref->extent_offset, old->extent_offset + old->offset);
2486 ret = btrfs_drop_extents(trans, root, inode, start,
2491 key.objectid = btrfs_ino(BTRFS_I(inode));
2492 key.type = BTRFS_EXTENT_DATA_KEY;
2495 path->leave_spinning = 1;
2497 struct btrfs_file_extent_item *fi;
2499 struct btrfs_key found_key;
2501 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
2506 leaf = path->nodes[0];
2507 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
2509 fi = btrfs_item_ptr(leaf, path->slots[0],
2510 struct btrfs_file_extent_item);
2511 extent_len = btrfs_file_extent_num_bytes(leaf, fi);
2513 if (extent_len + found_key.offset == start &&
2514 relink_is_mergable(leaf, fi, new)) {
2515 btrfs_set_file_extent_num_bytes(leaf, fi,
2517 btrfs_mark_buffer_dirty(leaf);
2518 inode_add_bytes(inode, len);
2524 btrfs_release_path(path);
2529 ret = btrfs_insert_empty_item(trans, root, path, &key,
2532 btrfs_abort_transaction(trans, ret);
2536 leaf = path->nodes[0];
2537 item = btrfs_item_ptr(leaf, path->slots[0],
2538 struct btrfs_file_extent_item);
2539 btrfs_set_file_extent_disk_bytenr(leaf, item, new->bytenr);
2540 btrfs_set_file_extent_disk_num_bytes(leaf, item, new->disk_len);
2541 btrfs_set_file_extent_offset(leaf, item, start - new->file_pos);
2542 btrfs_set_file_extent_num_bytes(leaf, item, len);
2543 btrfs_set_file_extent_ram_bytes(leaf, item, new->len);
2544 btrfs_set_file_extent_generation(leaf, item, trans->transid);
2545 btrfs_set_file_extent_type(leaf, item, BTRFS_FILE_EXTENT_REG);
2546 btrfs_set_file_extent_compression(leaf, item, new->compress_type);
2547 btrfs_set_file_extent_encryption(leaf, item, 0);
2548 btrfs_set_file_extent_other_encoding(leaf, item, 0);
2550 btrfs_mark_buffer_dirty(leaf);
2551 inode_add_bytes(inode, len);
2552 btrfs_release_path(path);
2554 ret = btrfs_inc_extent_ref(trans, fs_info, new->bytenr,
2556 backref->root_id, backref->inum,
2557 new->file_pos); /* start - extent_offset */
2559 btrfs_abort_transaction(trans, ret);
2565 btrfs_release_path(path);
2566 path->leave_spinning = 0;
2567 btrfs_end_transaction(trans);
2569 unlock_extent_cached(&BTRFS_I(inode)->io_tree, lock_start, lock_end,
2575 static void free_sa_defrag_extent(struct new_sa_defrag_extent *new)
2577 struct old_sa_defrag_extent *old, *tmp;
2582 list_for_each_entry_safe(old, tmp, &new->head, list) {
2588 static void relink_file_extents(struct new_sa_defrag_extent *new)
2590 struct btrfs_fs_info *fs_info = btrfs_sb(new->inode->i_sb);
2591 struct btrfs_path *path;
2592 struct sa_defrag_extent_backref *backref;
2593 struct sa_defrag_extent_backref *prev = NULL;
2594 struct inode *inode;
2595 struct btrfs_root *root;
2596 struct rb_node *node;
2600 root = BTRFS_I(inode)->root;
2602 path = btrfs_alloc_path();
2606 if (!record_extent_backrefs(path, new)) {
2607 btrfs_free_path(path);
2610 btrfs_release_path(path);
2613 node = rb_first(&new->root);
2616 rb_erase(node, &new->root);
2618 backref = rb_entry(node, struct sa_defrag_extent_backref, node);
2620 ret = relink_extent_backref(path, prev, backref);
2633 btrfs_free_path(path);
2635 free_sa_defrag_extent(new);
2637 atomic_dec(&fs_info->defrag_running);
2638 wake_up(&fs_info->transaction_wait);
2641 static struct new_sa_defrag_extent *
2642 record_old_file_extents(struct inode *inode,
2643 struct btrfs_ordered_extent *ordered)
2645 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
2646 struct btrfs_root *root = BTRFS_I(inode)->root;
2647 struct btrfs_path *path;
2648 struct btrfs_key key;
2649 struct old_sa_defrag_extent *old;
2650 struct new_sa_defrag_extent *new;
2653 new = kmalloc(sizeof(*new), GFP_NOFS);
2658 new->file_pos = ordered->file_offset;
2659 new->len = ordered->len;
2660 new->bytenr = ordered->start;
2661 new->disk_len = ordered->disk_len;
2662 new->compress_type = ordered->compress_type;
2663 new->root = RB_ROOT;
2664 INIT_LIST_HEAD(&new->head);
2666 path = btrfs_alloc_path();
2670 key.objectid = btrfs_ino(BTRFS_I(inode));
2671 key.type = BTRFS_EXTENT_DATA_KEY;
2672 key.offset = new->file_pos;
2674 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
2677 if (ret > 0 && path->slots[0] > 0)
2680 /* find out all the old extents for the file range */
2682 struct btrfs_file_extent_item *extent;
2683 struct extent_buffer *l;
2692 slot = path->slots[0];
2694 if (slot >= btrfs_header_nritems(l)) {
2695 ret = btrfs_next_leaf(root, path);
2703 btrfs_item_key_to_cpu(l, &key, slot);
2705 if (key.objectid != btrfs_ino(BTRFS_I(inode)))
2707 if (key.type != BTRFS_EXTENT_DATA_KEY)
2709 if (key.offset >= new->file_pos + new->len)
2712 extent = btrfs_item_ptr(l, slot, struct btrfs_file_extent_item);
2714 num_bytes = btrfs_file_extent_num_bytes(l, extent);
2715 if (key.offset + num_bytes < new->file_pos)
2718 disk_bytenr = btrfs_file_extent_disk_bytenr(l, extent);
2722 extent_offset = btrfs_file_extent_offset(l, extent);
2724 old = kmalloc(sizeof(*old), GFP_NOFS);
2728 offset = max(new->file_pos, key.offset);
2729 end = min(new->file_pos + new->len, key.offset + num_bytes);
2731 old->bytenr = disk_bytenr;
2732 old->extent_offset = extent_offset;
2733 old->offset = offset - key.offset;
2734 old->len = end - offset;
2737 list_add_tail(&old->list, &new->head);
2743 btrfs_free_path(path);
2744 atomic_inc(&fs_info->defrag_running);
2749 btrfs_free_path(path);
2751 free_sa_defrag_extent(new);
2755 static void btrfs_release_delalloc_bytes(struct btrfs_fs_info *fs_info,
2758 struct btrfs_block_group_cache *cache;
2760 cache = btrfs_lookup_block_group(fs_info, start);
2763 spin_lock(&cache->lock);
2764 cache->delalloc_bytes -= len;
2765 spin_unlock(&cache->lock);
2767 btrfs_put_block_group(cache);
2770 /* as ordered data IO finishes, this gets called so we can finish
2771 * an ordered extent if the range of bytes in the file it covers are
2774 static int btrfs_finish_ordered_io(struct btrfs_ordered_extent *ordered_extent)
2776 struct inode *inode = ordered_extent->inode;
2777 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
2778 struct btrfs_root *root = BTRFS_I(inode)->root;
2779 struct btrfs_trans_handle *trans = NULL;
2780 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
2781 struct extent_state *cached_state = NULL;
2782 struct new_sa_defrag_extent *new = NULL;
2783 int compress_type = 0;
2785 u64 logical_len = ordered_extent->len;
2787 bool truncated = false;
2789 nolock = btrfs_is_free_space_inode(BTRFS_I(inode));
2791 if (test_bit(BTRFS_ORDERED_IOERR, &ordered_extent->flags)) {
2796 btrfs_free_io_failure_record(BTRFS_I(inode),
2797 ordered_extent->file_offset,
2798 ordered_extent->file_offset +
2799 ordered_extent->len - 1);
2801 if (test_bit(BTRFS_ORDERED_TRUNCATED, &ordered_extent->flags)) {
2803 logical_len = ordered_extent->truncated_len;
2804 /* Truncated the entire extent, don't bother adding */
2809 if (test_bit(BTRFS_ORDERED_NOCOW, &ordered_extent->flags)) {
2810 BUG_ON(!list_empty(&ordered_extent->list)); /* Logic error */
2813 * For mwrite(mmap + memset to write) case, we still reserve
2814 * space for NOCOW range.
2815 * As NOCOW won't cause a new delayed ref, just free the space
2817 btrfs_qgroup_free_data(inode, ordered_extent->file_offset,
2818 ordered_extent->len);
2819 btrfs_ordered_update_i_size(inode, 0, ordered_extent);
2821 trans = btrfs_join_transaction_nolock(root);
2823 trans = btrfs_join_transaction(root);
2824 if (IS_ERR(trans)) {
2825 ret = PTR_ERR(trans);
2829 trans->block_rsv = &fs_info->delalloc_block_rsv;
2830 ret = btrfs_update_inode_fallback(trans, root, inode);
2831 if (ret) /* -ENOMEM or corruption */
2832 btrfs_abort_transaction(trans, ret);
2836 lock_extent_bits(io_tree, ordered_extent->file_offset,
2837 ordered_extent->file_offset + ordered_extent->len - 1,
2840 ret = test_range_bit(io_tree, ordered_extent->file_offset,
2841 ordered_extent->file_offset + ordered_extent->len - 1,
2842 EXTENT_DEFRAG, 1, cached_state);
2844 u64 last_snapshot = btrfs_root_last_snapshot(&root->root_item);
2845 if (0 && last_snapshot >= BTRFS_I(inode)->generation)
2846 /* the inode is shared */
2847 new = record_old_file_extents(inode, ordered_extent);
2849 clear_extent_bit(io_tree, ordered_extent->file_offset,
2850 ordered_extent->file_offset + ordered_extent->len - 1,
2851 EXTENT_DEFRAG, 0, 0, &cached_state, GFP_NOFS);
2855 trans = btrfs_join_transaction_nolock(root);
2857 trans = btrfs_join_transaction(root);
2858 if (IS_ERR(trans)) {
2859 ret = PTR_ERR(trans);
2864 trans->block_rsv = &fs_info->delalloc_block_rsv;
2866 if (test_bit(BTRFS_ORDERED_COMPRESSED, &ordered_extent->flags))
2867 compress_type = ordered_extent->compress_type;
2868 if (test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags)) {
2869 BUG_ON(compress_type);
2870 ret = btrfs_mark_extent_written(trans, BTRFS_I(inode),
2871 ordered_extent->file_offset,
2872 ordered_extent->file_offset +
2875 BUG_ON(root == fs_info->tree_root);
2876 ret = insert_reserved_file_extent(trans, inode,
2877 ordered_extent->file_offset,
2878 ordered_extent->start,
2879 ordered_extent->disk_len,
2880 logical_len, logical_len,
2881 compress_type, 0, 0,
2882 BTRFS_FILE_EXTENT_REG);
2884 btrfs_release_delalloc_bytes(fs_info,
2885 ordered_extent->start,
2886 ordered_extent->disk_len);
2888 unpin_extent_cache(&BTRFS_I(inode)->extent_tree,
2889 ordered_extent->file_offset, ordered_extent->len,
2892 btrfs_abort_transaction(trans, ret);
2896 add_pending_csums(trans, inode, &ordered_extent->list);
2898 btrfs_ordered_update_i_size(inode, 0, ordered_extent);
2899 ret = btrfs_update_inode_fallback(trans, root, inode);
2900 if (ret) { /* -ENOMEM or corruption */
2901 btrfs_abort_transaction(trans, ret);
2906 unlock_extent_cached(io_tree, ordered_extent->file_offset,
2907 ordered_extent->file_offset +
2908 ordered_extent->len - 1, &cached_state, GFP_NOFS);
2910 if (root != fs_info->tree_root)
2911 btrfs_delalloc_release_metadata(BTRFS_I(inode),
2912 ordered_extent->len);
2914 btrfs_end_transaction(trans);
2916 if (ret || truncated) {
2920 start = ordered_extent->file_offset + logical_len;
2922 start = ordered_extent->file_offset;
2923 end = ordered_extent->file_offset + ordered_extent->len - 1;
2924 clear_extent_uptodate(io_tree, start, end, NULL, GFP_NOFS);
2926 /* Drop the cache for the part of the extent we didn't write. */
2927 btrfs_drop_extent_cache(BTRFS_I(inode), start, end, 0);
2930 * If the ordered extent had an IOERR or something else went
2931 * wrong we need to return the space for this ordered extent
2932 * back to the allocator. We only free the extent in the
2933 * truncated case if we didn't write out the extent at all.
2935 if ((ret || !logical_len) &&
2936 !test_bit(BTRFS_ORDERED_NOCOW, &ordered_extent->flags) &&
2937 !test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags))
2938 btrfs_free_reserved_extent(fs_info,
2939 ordered_extent->start,
2940 ordered_extent->disk_len, 1);
2945 * This needs to be done to make sure anybody waiting knows we are done
2946 * updating everything for this ordered extent.
2948 btrfs_remove_ordered_extent(inode, ordered_extent);
2950 /* for snapshot-aware defrag */
2953 free_sa_defrag_extent(new);
2954 atomic_dec(&fs_info->defrag_running);
2956 relink_file_extents(new);
2961 btrfs_put_ordered_extent(ordered_extent);
2962 /* once for the tree */
2963 btrfs_put_ordered_extent(ordered_extent);
2968 static void finish_ordered_fn(struct btrfs_work *work)
2970 struct btrfs_ordered_extent *ordered_extent;
2971 ordered_extent = container_of(work, struct btrfs_ordered_extent, work);
2972 btrfs_finish_ordered_io(ordered_extent);
2975 static void btrfs_writepage_end_io_hook(struct page *page, u64 start, u64 end,
2976 struct extent_state *state, int uptodate)
2978 struct inode *inode = page->mapping->host;
2979 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
2980 struct btrfs_ordered_extent *ordered_extent = NULL;
2981 struct btrfs_workqueue *wq;
2982 btrfs_work_func_t func;
2984 trace_btrfs_writepage_end_io_hook(page, start, end, uptodate);
2986 ClearPagePrivate2(page);
2987 if (!btrfs_dec_test_ordered_pending(inode, &ordered_extent, start,
2988 end - start + 1, uptodate))
2991 if (btrfs_is_free_space_inode(BTRFS_I(inode))) {
2992 wq = fs_info->endio_freespace_worker;
2993 func = btrfs_freespace_write_helper;
2995 wq = fs_info->endio_write_workers;
2996 func = btrfs_endio_write_helper;
2999 btrfs_init_work(&ordered_extent->work, func, finish_ordered_fn, NULL,
3001 btrfs_queue_work(wq, &ordered_extent->work);
3004 static int __readpage_endio_check(struct inode *inode,
3005 struct btrfs_io_bio *io_bio,
3006 int icsum, struct page *page,
3007 int pgoff, u64 start, size_t len)
3013 csum_expected = *(((u32 *)io_bio->csum) + icsum);
3015 kaddr = kmap_atomic(page);
3016 csum = btrfs_csum_data(kaddr + pgoff, csum, len);
3017 btrfs_csum_final(csum, (u8 *)&csum);
3018 if (csum != csum_expected)
3021 kunmap_atomic(kaddr);
3024 btrfs_print_data_csum_error(BTRFS_I(inode), start, csum, csum_expected,
3025 io_bio->mirror_num);
3026 memset(kaddr + pgoff, 1, len);
3027 flush_dcache_page(page);
3028 kunmap_atomic(kaddr);
3029 if (csum_expected == 0)
3035 * when reads are done, we need to check csums to verify the data is correct
3036 * if there's a match, we allow the bio to finish. If not, the code in
3037 * extent_io.c will try to find good copies for us.
3039 static int btrfs_readpage_end_io_hook(struct btrfs_io_bio *io_bio,
3040 u64 phy_offset, struct page *page,
3041 u64 start, u64 end, int mirror)
3043 size_t offset = start - page_offset(page);
3044 struct inode *inode = page->mapping->host;
3045 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
3046 struct btrfs_root *root = BTRFS_I(inode)->root;
3048 if (PageChecked(page)) {
3049 ClearPageChecked(page);
3053 if (BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM)
3056 if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID &&
3057 test_range_bit(io_tree, start, end, EXTENT_NODATASUM, 1, NULL)) {
3058 clear_extent_bits(io_tree, start, end, EXTENT_NODATASUM);
3062 phy_offset >>= inode->i_sb->s_blocksize_bits;
3063 return __readpage_endio_check(inode, io_bio, phy_offset, page, offset,
3064 start, (size_t)(end - start + 1));
3067 void btrfs_add_delayed_iput(struct inode *inode)
3069 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
3070 struct btrfs_inode *binode = BTRFS_I(inode);
3072 if (atomic_add_unless(&inode->i_count, -1, 1))
3075 spin_lock(&fs_info->delayed_iput_lock);
3076 if (binode->delayed_iput_count == 0) {
3077 ASSERT(list_empty(&binode->delayed_iput));
3078 list_add_tail(&binode->delayed_iput, &fs_info->delayed_iputs);
3080 binode->delayed_iput_count++;
3082 spin_unlock(&fs_info->delayed_iput_lock);
3085 void btrfs_run_delayed_iputs(struct btrfs_fs_info *fs_info)
3088 spin_lock(&fs_info->delayed_iput_lock);
3089 while (!list_empty(&fs_info->delayed_iputs)) {
3090 struct btrfs_inode *inode;
3092 inode = list_first_entry(&fs_info->delayed_iputs,
3093 struct btrfs_inode, delayed_iput);
3094 if (inode->delayed_iput_count) {
3095 inode->delayed_iput_count--;
3096 list_move_tail(&inode->delayed_iput,
3097 &fs_info->delayed_iputs);
3099 list_del_init(&inode->delayed_iput);
3101 spin_unlock(&fs_info->delayed_iput_lock);
3102 iput(&inode->vfs_inode);
3103 spin_lock(&fs_info->delayed_iput_lock);
3105 spin_unlock(&fs_info->delayed_iput_lock);
3109 * This is called in transaction commit time. If there are no orphan
3110 * files in the subvolume, it removes orphan item and frees block_rsv
3113 void btrfs_orphan_commit_root(struct btrfs_trans_handle *trans,
3114 struct btrfs_root *root)
3116 struct btrfs_fs_info *fs_info = root->fs_info;
3117 struct btrfs_block_rsv *block_rsv;
3120 if (atomic_read(&root->orphan_inodes) ||
3121 root->orphan_cleanup_state != ORPHAN_CLEANUP_DONE)
3124 spin_lock(&root->orphan_lock);
3125 if (atomic_read(&root->orphan_inodes)) {
3126 spin_unlock(&root->orphan_lock);
3130 if (root->orphan_cleanup_state != ORPHAN_CLEANUP_DONE) {
3131 spin_unlock(&root->orphan_lock);
3135 block_rsv = root->orphan_block_rsv;
3136 root->orphan_block_rsv = NULL;
3137 spin_unlock(&root->orphan_lock);
3139 if (test_bit(BTRFS_ROOT_ORPHAN_ITEM_INSERTED, &root->state) &&
3140 btrfs_root_refs(&root->root_item) > 0) {
3141 ret = btrfs_del_orphan_item(trans, fs_info->tree_root,
3142 root->root_key.objectid);
3144 btrfs_abort_transaction(trans, ret);
3146 clear_bit(BTRFS_ROOT_ORPHAN_ITEM_INSERTED,
3151 WARN_ON(block_rsv->size > 0);
3152 btrfs_free_block_rsv(fs_info, block_rsv);
3157 * This creates an orphan entry for the given inode in case something goes
3158 * wrong in the middle of an unlink/truncate.
3160 * NOTE: caller of this function should reserve 5 units of metadata for
3163 int btrfs_orphan_add(struct btrfs_trans_handle *trans,
3164 struct btrfs_inode *inode)
3166 struct btrfs_fs_info *fs_info = btrfs_sb(inode->vfs_inode.i_sb);
3167 struct btrfs_root *root = inode->root;
3168 struct btrfs_block_rsv *block_rsv = NULL;
3173 if (!root->orphan_block_rsv) {
3174 block_rsv = btrfs_alloc_block_rsv(fs_info,
3175 BTRFS_BLOCK_RSV_TEMP);
3180 spin_lock(&root->orphan_lock);
3181 if (!root->orphan_block_rsv) {
3182 root->orphan_block_rsv = block_rsv;
3183 } else if (block_rsv) {
3184 btrfs_free_block_rsv(fs_info, block_rsv);
3188 if (!test_and_set_bit(BTRFS_INODE_HAS_ORPHAN_ITEM,
3189 &inode->runtime_flags)) {
3192 * For proper ENOSPC handling, we should do orphan
3193 * cleanup when mounting. But this introduces backward
3194 * compatibility issue.
3196 if (!xchg(&root->orphan_item_inserted, 1))
3202 atomic_inc(&root->orphan_inodes);
3205 if (!test_and_set_bit(BTRFS_INODE_ORPHAN_META_RESERVED,
3206 &inode->runtime_flags))
3208 spin_unlock(&root->orphan_lock);
3210 /* grab metadata reservation from transaction handle */
3212 ret = btrfs_orphan_reserve_metadata(trans, inode);
3215 atomic_dec(&root->orphan_inodes);
3216 clear_bit(BTRFS_INODE_ORPHAN_META_RESERVED,
3217 &inode->runtime_flags);
3219 clear_bit(BTRFS_INODE_HAS_ORPHAN_ITEM,
3220 &inode->runtime_flags);
3225 /* insert an orphan item to track this unlinked/truncated file */
3227 ret = btrfs_insert_orphan_item(trans, root, btrfs_ino(inode));
3229 atomic_dec(&root->orphan_inodes);
3231 clear_bit(BTRFS_INODE_ORPHAN_META_RESERVED,
3232 &inode->runtime_flags);
3233 btrfs_orphan_release_metadata(inode);
3235 if (ret != -EEXIST) {
3236 clear_bit(BTRFS_INODE_HAS_ORPHAN_ITEM,
3237 &inode->runtime_flags);
3238 btrfs_abort_transaction(trans, ret);
3245 /* insert an orphan item to track subvolume contains orphan files */
3247 ret = btrfs_insert_orphan_item(trans, fs_info->tree_root,
3248 root->root_key.objectid);
3249 if (ret && ret != -EEXIST) {
3250 btrfs_abort_transaction(trans, ret);
3258 * We have done the truncate/delete so we can go ahead and remove the orphan
3259 * item for this particular inode.
3261 static int btrfs_orphan_del(struct btrfs_trans_handle *trans,
3262 struct btrfs_inode *inode)
3264 struct btrfs_root *root = inode->root;
3265 int delete_item = 0;
3266 int release_rsv = 0;
3269 spin_lock(&root->orphan_lock);
3270 if (test_and_clear_bit(BTRFS_INODE_HAS_ORPHAN_ITEM,
3271 &inode->runtime_flags))
3274 if (test_and_clear_bit(BTRFS_INODE_ORPHAN_META_RESERVED,
3275 &inode->runtime_flags))
3277 spin_unlock(&root->orphan_lock);
3280 atomic_dec(&root->orphan_inodes);
3282 ret = btrfs_del_orphan_item(trans, root,
3287 btrfs_orphan_release_metadata(inode);
3293 * this cleans up any orphans that may be left on the list from the last use
3296 int btrfs_orphan_cleanup(struct btrfs_root *root)
3298 struct btrfs_fs_info *fs_info = root->fs_info;
3299 struct btrfs_path *path;
3300 struct extent_buffer *leaf;
3301 struct btrfs_key key, found_key;
3302 struct btrfs_trans_handle *trans;
3303 struct inode *inode;
3304 u64 last_objectid = 0;
3305 int ret = 0, nr_unlink = 0, nr_truncate = 0;
3307 if (cmpxchg(&root->orphan_cleanup_state, 0, ORPHAN_CLEANUP_STARTED))
3310 path = btrfs_alloc_path();
3315 path->reada = READA_BACK;
3317 key.objectid = BTRFS_ORPHAN_OBJECTID;
3318 key.type = BTRFS_ORPHAN_ITEM_KEY;
3319 key.offset = (u64)-1;
3322 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
3327 * if ret == 0 means we found what we were searching for, which
3328 * is weird, but possible, so only screw with path if we didn't
3329 * find the key and see if we have stuff that matches
3333 if (path->slots[0] == 0)
3338 /* pull out the item */
3339 leaf = path->nodes[0];
3340 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
3342 /* make sure the item matches what we want */
3343 if (found_key.objectid != BTRFS_ORPHAN_OBJECTID)
3345 if (found_key.type != BTRFS_ORPHAN_ITEM_KEY)
3348 /* release the path since we're done with it */
3349 btrfs_release_path(path);
3352 * this is where we are basically btrfs_lookup, without the
3353 * crossing root thing. we store the inode number in the
3354 * offset of the orphan item.
3357 if (found_key.offset == last_objectid) {
3359 "Error removing orphan entry, stopping orphan cleanup");
3364 last_objectid = found_key.offset;
3366 found_key.objectid = found_key.offset;
3367 found_key.type = BTRFS_INODE_ITEM_KEY;
3368 found_key.offset = 0;
3369 inode = btrfs_iget(fs_info->sb, &found_key, root, NULL);
3370 ret = PTR_ERR_OR_ZERO(inode);
3371 if (ret && ret != -ENOENT)
3374 if (ret == -ENOENT && root == fs_info->tree_root) {
3375 struct btrfs_root *dead_root;
3376 struct btrfs_fs_info *fs_info = root->fs_info;
3377 int is_dead_root = 0;
3380 * this is an orphan in the tree root. Currently these
3381 * could come from 2 sources:
3382 * a) a snapshot deletion in progress
3383 * b) a free space cache inode
3384 * We need to distinguish those two, as the snapshot
3385 * orphan must not get deleted.
3386 * find_dead_roots already ran before us, so if this
3387 * is a snapshot deletion, we should find the root
3388 * in the dead_roots list
3390 spin_lock(&fs_info->trans_lock);
3391 list_for_each_entry(dead_root, &fs_info->dead_roots,
3393 if (dead_root->root_key.objectid ==
3394 found_key.objectid) {
3399 spin_unlock(&fs_info->trans_lock);
3401 /* prevent this orphan from being found again */
3402 key.offset = found_key.objectid - 1;
3407 * Inode is already gone but the orphan item is still there,
3408 * kill the orphan item.
3410 if (ret == -ENOENT) {
3411 trans = btrfs_start_transaction(root, 1);
3412 if (IS_ERR(trans)) {
3413 ret = PTR_ERR(trans);
3416 btrfs_debug(fs_info, "auto deleting %Lu",
3417 found_key.objectid);
3418 ret = btrfs_del_orphan_item(trans, root,
3419 found_key.objectid);
3420 btrfs_end_transaction(trans);
3427 * add this inode to the orphan list so btrfs_orphan_del does
3428 * the proper thing when we hit it
3430 set_bit(BTRFS_INODE_HAS_ORPHAN_ITEM,
3431 &BTRFS_I(inode)->runtime_flags);
3432 atomic_inc(&root->orphan_inodes);
3434 /* if we have links, this was a truncate, lets do that */
3435 if (inode->i_nlink) {
3436 if (WARN_ON(!S_ISREG(inode->i_mode))) {
3442 /* 1 for the orphan item deletion. */
3443 trans = btrfs_start_transaction(root, 1);
3444 if (IS_ERR(trans)) {
3446 ret = PTR_ERR(trans);
3449 ret = btrfs_orphan_add(trans, BTRFS_I(inode));
3450 btrfs_end_transaction(trans);
3456 ret = btrfs_truncate(inode);
3458 btrfs_orphan_del(NULL, BTRFS_I(inode));
3463 /* this will do delete_inode and everything for us */
3468 /* release the path since we're done with it */
3469 btrfs_release_path(path);
3471 root->orphan_cleanup_state = ORPHAN_CLEANUP_DONE;
3473 if (root->orphan_block_rsv)
3474 btrfs_block_rsv_release(fs_info, root->orphan_block_rsv,
3477 if (root->orphan_block_rsv ||
3478 test_bit(BTRFS_ROOT_ORPHAN_ITEM_INSERTED, &root->state)) {
3479 trans = btrfs_join_transaction(root);
3481 btrfs_end_transaction(trans);
3485 btrfs_debug(fs_info, "unlinked %d orphans", nr_unlink);
3487 btrfs_debug(fs_info, "truncated %d orphans", nr_truncate);
3491 btrfs_err(fs_info, "could not do orphan cleanup %d", ret);
3492 btrfs_free_path(path);
3497 * very simple check to peek ahead in the leaf looking for xattrs. If we
3498 * don't find any xattrs, we know there can't be any acls.
3500 * slot is the slot the inode is in, objectid is the objectid of the inode
3502 static noinline int acls_after_inode_item(struct extent_buffer *leaf,
3503 int slot, u64 objectid,
3504 int *first_xattr_slot)
3506 u32 nritems = btrfs_header_nritems(leaf);
3507 struct btrfs_key found_key;
3508 static u64 xattr_access = 0;
3509 static u64 xattr_default = 0;
3512 if (!xattr_access) {
3513 xattr_access = btrfs_name_hash(XATTR_NAME_POSIX_ACL_ACCESS,
3514 strlen(XATTR_NAME_POSIX_ACL_ACCESS));
3515 xattr_default = btrfs_name_hash(XATTR_NAME_POSIX_ACL_DEFAULT,
3516 strlen(XATTR_NAME_POSIX_ACL_DEFAULT));
3520 *first_xattr_slot = -1;
3521 while (slot < nritems) {
3522 btrfs_item_key_to_cpu(leaf, &found_key, slot);
3524 /* we found a different objectid, there must not be acls */
3525 if (found_key.objectid != objectid)
3528 /* we found an xattr, assume we've got an acl */
3529 if (found_key.type == BTRFS_XATTR_ITEM_KEY) {
3530 if (*first_xattr_slot == -1)
3531 *first_xattr_slot = slot;
3532 if (found_key.offset == xattr_access ||
3533 found_key.offset == xattr_default)
3538 * we found a key greater than an xattr key, there can't
3539 * be any acls later on
3541 if (found_key.type > BTRFS_XATTR_ITEM_KEY)
3548 * it goes inode, inode backrefs, xattrs, extents,
3549 * so if there are a ton of hard links to an inode there can
3550 * be a lot of backrefs. Don't waste time searching too hard,
3551 * this is just an optimization
3556 /* we hit the end of the leaf before we found an xattr or
3557 * something larger than an xattr. We have to assume the inode
3560 if (*first_xattr_slot == -1)
3561 *first_xattr_slot = slot;
3566 * read an inode from the btree into the in-memory inode
3568 static int btrfs_read_locked_inode(struct inode *inode)
3570 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
3571 struct btrfs_path *path;
3572 struct extent_buffer *leaf;
3573 struct btrfs_inode_item *inode_item;
3574 struct btrfs_root *root = BTRFS_I(inode)->root;
3575 struct btrfs_key location;
3580 bool filled = false;
3581 int first_xattr_slot;
3583 ret = btrfs_fill_inode(inode, &rdev);
3587 path = btrfs_alloc_path();
3593 memcpy(&location, &BTRFS_I(inode)->location, sizeof(location));
3595 ret = btrfs_lookup_inode(NULL, root, path, &location, 0);
3602 leaf = path->nodes[0];
3607 inode_item = btrfs_item_ptr(leaf, path->slots[0],
3608 struct btrfs_inode_item);
3609 inode->i_mode = btrfs_inode_mode(leaf, inode_item);
3610 set_nlink(inode, btrfs_inode_nlink(leaf, inode_item));
3611 i_uid_write(inode, btrfs_inode_uid(leaf, inode_item));
3612 i_gid_write(inode, btrfs_inode_gid(leaf, inode_item));
3613 btrfs_i_size_write(BTRFS_I(inode), btrfs_inode_size(leaf, inode_item));
3615 inode->i_atime.tv_sec = btrfs_timespec_sec(leaf, &inode_item->atime);
3616 inode->i_atime.tv_nsec = btrfs_timespec_nsec(leaf, &inode_item->atime);
3618 inode->i_mtime.tv_sec = btrfs_timespec_sec(leaf, &inode_item->mtime);
3619 inode->i_mtime.tv_nsec = btrfs_timespec_nsec(leaf, &inode_item->mtime);
3621 inode->i_ctime.tv_sec = btrfs_timespec_sec(leaf, &inode_item->ctime);
3622 inode->i_ctime.tv_nsec = btrfs_timespec_nsec(leaf, &inode_item->ctime);
3624 BTRFS_I(inode)->i_otime.tv_sec =
3625 btrfs_timespec_sec(leaf, &inode_item->otime);
3626 BTRFS_I(inode)->i_otime.tv_nsec =
3627 btrfs_timespec_nsec(leaf, &inode_item->otime);
3629 inode_set_bytes(inode, btrfs_inode_nbytes(leaf, inode_item));
3630 BTRFS_I(inode)->generation = btrfs_inode_generation(leaf, inode_item);
3631 BTRFS_I(inode)->last_trans = btrfs_inode_transid(leaf, inode_item);
3633 inode->i_version = btrfs_inode_sequence(leaf, inode_item);
3634 inode->i_generation = BTRFS_I(inode)->generation;
3636 rdev = btrfs_inode_rdev(leaf, inode_item);
3638 BTRFS_I(inode)->index_cnt = (u64)-1;
3639 BTRFS_I(inode)->flags = btrfs_inode_flags(leaf, inode_item);
3643 * If we were modified in the current generation and evicted from memory
3644 * and then re-read we need to do a full sync since we don't have any
3645 * idea about which extents were modified before we were evicted from
3648 * This is required for both inode re-read from disk and delayed inode
3649 * in delayed_nodes_tree.
3651 if (BTRFS_I(inode)->last_trans == fs_info->generation)
3652 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC,
3653 &BTRFS_I(inode)->runtime_flags);
3656 * We don't persist the id of the transaction where an unlink operation
3657 * against the inode was last made. So here we assume the inode might
3658 * have been evicted, and therefore the exact value of last_unlink_trans
3659 * lost, and set it to last_trans to avoid metadata inconsistencies
3660 * between the inode and its parent if the inode is fsync'ed and the log
3661 * replayed. For example, in the scenario:
3664 * ln mydir/foo mydir/bar
3667 * echo 2 > /proc/sys/vm/drop_caches # evicts inode
3668 * xfs_io -c fsync mydir/foo
3670 * mount fs, triggers fsync log replay
3672 * We must make sure that when we fsync our inode foo we also log its
3673 * parent inode, otherwise after log replay the parent still has the
3674 * dentry with the "bar" name but our inode foo has a link count of 1
3675 * and doesn't have an inode ref with the name "bar" anymore.
3677 * Setting last_unlink_trans to last_trans is a pessimistic approach,
3678 * but it guarantees correctness at the expense of occasional full
3679 * transaction commits on fsync if our inode is a directory, or if our
3680 * inode is not a directory, logging its parent unnecessarily.
3682 BTRFS_I(inode)->last_unlink_trans = BTRFS_I(inode)->last_trans;
3685 if (inode->i_nlink != 1 ||
3686 path->slots[0] >= btrfs_header_nritems(leaf))
3689 btrfs_item_key_to_cpu(leaf, &location, path->slots[0]);
3690 if (location.objectid != btrfs_ino(BTRFS_I(inode)))
3693 ptr = btrfs_item_ptr_offset(leaf, path->slots[0]);
3694 if (location.type == BTRFS_INODE_REF_KEY) {
3695 struct btrfs_inode_ref *ref;
3697 ref = (struct btrfs_inode_ref *)ptr;
3698 BTRFS_I(inode)->dir_index = btrfs_inode_ref_index(leaf, ref);
3699 } else if (location.type == BTRFS_INODE_EXTREF_KEY) {
3700 struct btrfs_inode_extref *extref;
3702 extref = (struct btrfs_inode_extref *)ptr;
3703 BTRFS_I(inode)->dir_index = btrfs_inode_extref_index(leaf,
3708 * try to precache a NULL acl entry for files that don't have
3709 * any xattrs or acls
3711 maybe_acls = acls_after_inode_item(leaf, path->slots[0],
3712 btrfs_ino(BTRFS_I(inode)), &first_xattr_slot);
3713 if (first_xattr_slot != -1) {
3714 path->slots[0] = first_xattr_slot;
3715 ret = btrfs_load_inode_props(inode, path);
3718 "error loading props for ino %llu (root %llu): %d",
3719 btrfs_ino(BTRFS_I(inode)),
3720 root->root_key.objectid, ret);
3722 btrfs_free_path(path);
3725 cache_no_acl(inode);
3727 switch (inode->i_mode & S_IFMT) {
3729 inode->i_mapping->a_ops = &btrfs_aops;
3730 BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops;
3731 inode->i_fop = &btrfs_file_operations;
3732 inode->i_op = &btrfs_file_inode_operations;
3735 inode->i_fop = &btrfs_dir_file_operations;
3736 inode->i_op = &btrfs_dir_inode_operations;
3739 inode->i_op = &btrfs_symlink_inode_operations;
3740 inode_nohighmem(inode);
3741 inode->i_mapping->a_ops = &btrfs_symlink_aops;
3744 inode->i_op = &btrfs_special_inode_operations;
3745 init_special_inode(inode, inode->i_mode, rdev);
3749 btrfs_update_iflags(inode);
3753 btrfs_free_path(path);
3754 make_bad_inode(inode);
3759 * given a leaf and an inode, copy the inode fields into the leaf
3761 static void fill_inode_item(struct btrfs_trans_handle *trans,
3762 struct extent_buffer *leaf,
3763 struct btrfs_inode_item *item,
3764 struct inode *inode)
3766 struct btrfs_map_token token;
3768 btrfs_init_map_token(&token);
3770 btrfs_set_token_inode_uid(leaf, item, i_uid_read(inode), &token);
3771 btrfs_set_token_inode_gid(leaf, item, i_gid_read(inode), &token);
3772 btrfs_set_token_inode_size(leaf, item, BTRFS_I(inode)->disk_i_size,
3774 btrfs_set_token_inode_mode(leaf, item, inode->i_mode, &token);
3775 btrfs_set_token_inode_nlink(leaf, item, inode->i_nlink, &token);
3777 btrfs_set_token_timespec_sec(leaf, &item->atime,
3778 inode->i_atime.tv_sec, &token);
3779 btrfs_set_token_timespec_nsec(leaf, &item->atime,
3780 inode->i_atime.tv_nsec, &token);
3782 btrfs_set_token_timespec_sec(leaf, &item->mtime,
3783 inode->i_mtime.tv_sec, &token);
3784 btrfs_set_token_timespec_nsec(leaf, &item->mtime,
3785 inode->i_mtime.tv_nsec, &token);
3787 btrfs_set_token_timespec_sec(leaf, &item->ctime,
3788 inode->i_ctime.tv_sec, &token);
3789 btrfs_set_token_timespec_nsec(leaf, &item->ctime,
3790 inode->i_ctime.tv_nsec, &token);
3792 btrfs_set_token_timespec_sec(leaf, &item->otime,
3793 BTRFS_I(inode)->i_otime.tv_sec, &token);
3794 btrfs_set_token_timespec_nsec(leaf, &item->otime,
3795 BTRFS_I(inode)->i_otime.tv_nsec, &token);
3797 btrfs_set_token_inode_nbytes(leaf, item, inode_get_bytes(inode),
3799 btrfs_set_token_inode_generation(leaf, item, BTRFS_I(inode)->generation,
3801 btrfs_set_token_inode_sequence(leaf, item, inode->i_version, &token);
3802 btrfs_set_token_inode_transid(leaf, item, trans->transid, &token);
3803 btrfs_set_token_inode_rdev(leaf, item, inode->i_rdev, &token);
3804 btrfs_set_token_inode_flags(leaf, item, BTRFS_I(inode)->flags, &token);
3805 btrfs_set_token_inode_block_group(leaf, item, 0, &token);
3809 * copy everything in the in-memory inode into the btree.
3811 static noinline int btrfs_update_inode_item(struct btrfs_trans_handle *trans,
3812 struct btrfs_root *root, struct inode *inode)
3814 struct btrfs_inode_item *inode_item;
3815 struct btrfs_path *path;
3816 struct extent_buffer *leaf;
3819 path = btrfs_alloc_path();
3823 path->leave_spinning = 1;
3824 ret = btrfs_lookup_inode(trans, root, path, &BTRFS_I(inode)->location,
3832 leaf = path->nodes[0];
3833 inode_item = btrfs_item_ptr(leaf, path->slots[0],
3834 struct btrfs_inode_item);
3836 fill_inode_item(trans, leaf, inode_item, inode);
3837 btrfs_mark_buffer_dirty(leaf);
3838 btrfs_set_inode_last_trans(trans, inode);
3841 btrfs_free_path(path);
3846 * copy everything in the in-memory inode into the btree.
3848 noinline int btrfs_update_inode(struct btrfs_trans_handle *trans,
3849 struct btrfs_root *root, struct inode *inode)
3851 struct btrfs_fs_info *fs_info = root->fs_info;
3855 * If the inode is a free space inode, we can deadlock during commit
3856 * if we put it into the delayed code.
3858 * The data relocation inode should also be directly updated
3861 if (!btrfs_is_free_space_inode(BTRFS_I(inode))
3862 && root->root_key.objectid != BTRFS_DATA_RELOC_TREE_OBJECTID
3863 && !test_bit(BTRFS_FS_LOG_RECOVERING, &fs_info->flags)) {
3864 btrfs_update_root_times(trans, root);
3866 ret = btrfs_delayed_update_inode(trans, root, inode);
3868 btrfs_set_inode_last_trans(trans, inode);
3872 return btrfs_update_inode_item(trans, root, inode);
3875 noinline int btrfs_update_inode_fallback(struct btrfs_trans_handle *trans,
3876 struct btrfs_root *root,
3877 struct inode *inode)
3881 ret = btrfs_update_inode(trans, root, inode);
3883 return btrfs_update_inode_item(trans, root, inode);
3888 * unlink helper that gets used here in inode.c and in the tree logging
3889 * recovery code. It remove a link in a directory with a given name, and
3890 * also drops the back refs in the inode to the directory
3892 static int __btrfs_unlink_inode(struct btrfs_trans_handle *trans,
3893 struct btrfs_root *root,
3894 struct btrfs_inode *dir,
3895 struct btrfs_inode *inode,
3896 const char *name, int name_len)
3898 struct btrfs_fs_info *fs_info = root->fs_info;
3899 struct btrfs_path *path;
3901 struct extent_buffer *leaf;
3902 struct btrfs_dir_item *di;
3903 struct btrfs_key key;
3905 u64 ino = btrfs_ino(inode);
3906 u64 dir_ino = btrfs_ino(dir);
3908 path = btrfs_alloc_path();
3914 path->leave_spinning = 1;
3915 di = btrfs_lookup_dir_item(trans, root, path, dir_ino,
3916 name, name_len, -1);
3925 leaf = path->nodes[0];
3926 btrfs_dir_item_key_to_cpu(leaf, di, &key);
3927 ret = btrfs_delete_one_dir_name(trans, root, path, di);
3930 btrfs_release_path(path);
3933 * If we don't have dir index, we have to get it by looking up
3934 * the inode ref, since we get the inode ref, remove it directly,
3935 * it is unnecessary to do delayed deletion.
3937 * But if we have dir index, needn't search inode ref to get it.
3938 * Since the inode ref is close to the inode item, it is better
3939 * that we delay to delete it, and just do this deletion when
3940 * we update the inode item.
3942 if (inode->dir_index) {
3943 ret = btrfs_delayed_delete_inode_ref(inode);
3945 index = inode->dir_index;
3950 ret = btrfs_del_inode_ref(trans, root, name, name_len, ino,
3954 "failed to delete reference to %.*s, inode %llu parent %llu",
3955 name_len, name, ino, dir_ino);
3956 btrfs_abort_transaction(trans, ret);
3960 ret = btrfs_delete_delayed_dir_index(trans, fs_info, dir, index);
3962 btrfs_abort_transaction(trans, ret);
3966 ret = btrfs_del_inode_ref_in_log(trans, root, name, name_len, inode,
3968 if (ret != 0 && ret != -ENOENT) {
3969 btrfs_abort_transaction(trans, ret);
3973 ret = btrfs_del_dir_entries_in_log(trans, root, name, name_len, dir,
3978 btrfs_abort_transaction(trans, ret);
3980 btrfs_free_path(path);
3984 btrfs_i_size_write(dir, dir->vfs_inode.i_size - name_len * 2);
3985 inode_inc_iversion(&inode->vfs_inode);
3986 inode_inc_iversion(&dir->vfs_inode);
3987 inode->vfs_inode.i_ctime = dir->vfs_inode.i_mtime =
3988 dir->vfs_inode.i_ctime = current_time(&inode->vfs_inode);
3989 ret = btrfs_update_inode(trans, root, &dir->vfs_inode);
3994 int btrfs_unlink_inode(struct btrfs_trans_handle *trans,
3995 struct btrfs_root *root,
3996 struct btrfs_inode *dir, struct btrfs_inode *inode,
3997 const char *name, int name_len)
4000 ret = __btrfs_unlink_inode(trans, root, dir, inode, name, name_len);
4002 drop_nlink(&inode->vfs_inode);
4003 ret = btrfs_update_inode(trans, root, &inode->vfs_inode);
4009 * helper to start transaction for unlink and rmdir.
4011 * unlink and rmdir are special in btrfs, they do not always free space, so
4012 * if we cannot make our reservations the normal way try and see if there is
4013 * plenty of slack room in the global reserve to migrate, otherwise we cannot
4014 * allow the unlink to occur.
4016 static struct btrfs_trans_handle *__unlink_start_trans(struct inode *dir)
4018 struct btrfs_root *root = BTRFS_I(dir)->root;
4021 * 1 for the possible orphan item
4022 * 1 for the dir item
4023 * 1 for the dir index
4024 * 1 for the inode ref
4027 return btrfs_start_transaction_fallback_global_rsv(root, 5, 5);
4030 static int btrfs_unlink(struct inode *dir, struct dentry *dentry)
4032 struct btrfs_root *root = BTRFS_I(dir)->root;
4033 struct btrfs_trans_handle *trans;
4034 struct inode *inode = d_inode(dentry);
4037 trans = __unlink_start_trans(dir);
4039 return PTR_ERR(trans);
4041 btrfs_record_unlink_dir(trans, BTRFS_I(dir), BTRFS_I(d_inode(dentry)),
4044 ret = btrfs_unlink_inode(trans, root, BTRFS_I(dir),
4045 BTRFS_I(d_inode(dentry)), dentry->d_name.name,
4046 dentry->d_name.len);
4050 if (inode->i_nlink == 0) {
4051 ret = btrfs_orphan_add(trans, BTRFS_I(inode));
4057 btrfs_end_transaction(trans);
4058 btrfs_btree_balance_dirty(root->fs_info);
4062 int btrfs_unlink_subvol(struct btrfs_trans_handle *trans,
4063 struct btrfs_root *root,
4064 struct inode *dir, u64 objectid,
4065 const char *name, int name_len)
4067 struct btrfs_fs_info *fs_info = root->fs_info;
4068 struct btrfs_path *path;
4069 struct extent_buffer *leaf;
4070 struct btrfs_dir_item *di;
4071 struct btrfs_key key;
4074 u64 dir_ino = btrfs_ino(BTRFS_I(dir));
4076 path = btrfs_alloc_path();
4080 di = btrfs_lookup_dir_item(trans, root, path, dir_ino,
4081 name, name_len, -1);
4082 if (IS_ERR_OR_NULL(di)) {
4090 leaf = path->nodes[0];
4091 btrfs_dir_item_key_to_cpu(leaf, di, &key);
4092 WARN_ON(key.type != BTRFS_ROOT_ITEM_KEY || key.objectid != objectid);
4093 ret = btrfs_delete_one_dir_name(trans, root, path, di);
4095 btrfs_abort_transaction(trans, ret);
4098 btrfs_release_path(path);
4100 ret = btrfs_del_root_ref(trans, fs_info, objectid,
4101 root->root_key.objectid, dir_ino,
4102 &index, name, name_len);
4104 if (ret != -ENOENT) {
4105 btrfs_abort_transaction(trans, ret);
4108 di = btrfs_search_dir_index_item(root, path, dir_ino,
4110 if (IS_ERR_OR_NULL(di)) {
4115 btrfs_abort_transaction(trans, ret);
4119 leaf = path->nodes[0];
4120 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
4121 btrfs_release_path(path);
4124 btrfs_release_path(path);
4126 ret = btrfs_delete_delayed_dir_index(trans, fs_info, BTRFS_I(dir), index);
4128 btrfs_abort_transaction(trans, ret);
4132 btrfs_i_size_write(BTRFS_I(dir), dir->i_size - name_len * 2);
4133 inode_inc_iversion(dir);
4134 dir->i_mtime = dir->i_ctime = current_time(dir);
4135 ret = btrfs_update_inode_fallback(trans, root, dir);
4137 btrfs_abort_transaction(trans, ret);
4139 btrfs_free_path(path);
4143 static int btrfs_rmdir(struct inode *dir, struct dentry *dentry)
4145 struct inode *inode = d_inode(dentry);
4147 struct btrfs_root *root = BTRFS_I(dir)->root;
4148 struct btrfs_trans_handle *trans;
4149 u64 last_unlink_trans;
4151 if (inode->i_size > BTRFS_EMPTY_DIR_SIZE)
4153 if (btrfs_ino(BTRFS_I(inode)) == BTRFS_FIRST_FREE_OBJECTID)
4156 trans = __unlink_start_trans(dir);
4158 return PTR_ERR(trans);
4160 if (unlikely(btrfs_ino(BTRFS_I(inode)) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)) {
4161 err = btrfs_unlink_subvol(trans, root, dir,
4162 BTRFS_I(inode)->location.objectid,
4163 dentry->d_name.name,
4164 dentry->d_name.len);
4168 err = btrfs_orphan_add(trans, BTRFS_I(inode));
4172 last_unlink_trans = BTRFS_I(inode)->last_unlink_trans;
4174 /* now the directory is empty */
4175 err = btrfs_unlink_inode(trans, root, BTRFS_I(dir),
4176 BTRFS_I(d_inode(dentry)), dentry->d_name.name,
4177 dentry->d_name.len);
4179 btrfs_i_size_write(BTRFS_I(inode), 0);
4181 * Propagate the last_unlink_trans value of the deleted dir to
4182 * its parent directory. This is to prevent an unrecoverable
4183 * log tree in the case we do something like this:
4185 * 2) create snapshot under dir foo
4186 * 3) delete the snapshot
4189 * 6) fsync foo or some file inside foo
4191 if (last_unlink_trans >= trans->transid)
4192 BTRFS_I(dir)->last_unlink_trans = last_unlink_trans;
4195 btrfs_end_transaction(trans);
4196 btrfs_btree_balance_dirty(root->fs_info);
4201 static int truncate_space_check(struct btrfs_trans_handle *trans,
4202 struct btrfs_root *root,
4205 struct btrfs_fs_info *fs_info = root->fs_info;
4209 * This is only used to apply pressure to the enospc system, we don't
4210 * intend to use this reservation at all.
4212 bytes_deleted = btrfs_csum_bytes_to_leaves(fs_info, bytes_deleted);
4213 bytes_deleted *= fs_info->nodesize;
4214 ret = btrfs_block_rsv_add(root, &fs_info->trans_block_rsv,
4215 bytes_deleted, BTRFS_RESERVE_NO_FLUSH);
4217 trace_btrfs_space_reservation(fs_info, "transaction",
4220 trans->bytes_reserved += bytes_deleted;
4226 static int truncate_inline_extent(struct inode *inode,
4227 struct btrfs_path *path,
4228 struct btrfs_key *found_key,
4232 struct extent_buffer *leaf = path->nodes[0];
4233 int slot = path->slots[0];
4234 struct btrfs_file_extent_item *fi;
4235 u32 size = (u32)(new_size - found_key->offset);
4236 struct btrfs_root *root = BTRFS_I(inode)->root;
4238 fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item);
4240 if (btrfs_file_extent_compression(leaf, fi) != BTRFS_COMPRESS_NONE) {
4241 loff_t offset = new_size;
4242 loff_t page_end = ALIGN(offset, PAGE_SIZE);
4245 * Zero out the remaining of the last page of our inline extent,
4246 * instead of directly truncating our inline extent here - that
4247 * would be much more complex (decompressing all the data, then
4248 * compressing the truncated data, which might be bigger than
4249 * the size of the inline extent, resize the extent, etc).
4250 * We release the path because to get the page we might need to
4251 * read the extent item from disk (data not in the page cache).
4253 btrfs_release_path(path);
4254 return btrfs_truncate_block(inode, offset, page_end - offset,
4258 btrfs_set_file_extent_ram_bytes(leaf, fi, size);
4259 size = btrfs_file_extent_calc_inline_size(size);
4260 btrfs_truncate_item(root->fs_info, path, size, 1);
4262 if (test_bit(BTRFS_ROOT_REF_COWS, &root->state))
4263 inode_sub_bytes(inode, item_end + 1 - new_size);
4269 * this can truncate away extent items, csum items and directory items.
4270 * It starts at a high offset and removes keys until it can't find
4271 * any higher than new_size
4273 * csum items that cross the new i_size are truncated to the new size
4276 * min_type is the minimum key type to truncate down to. If set to 0, this
4277 * will kill all the items on this inode, including the INODE_ITEM_KEY.
4279 int btrfs_truncate_inode_items(struct btrfs_trans_handle *trans,
4280 struct btrfs_root *root,
4281 struct inode *inode,
4282 u64 new_size, u32 min_type)
4284 struct btrfs_fs_info *fs_info = root->fs_info;
4285 struct btrfs_path *path;
4286 struct extent_buffer *leaf;
4287 struct btrfs_file_extent_item *fi;
4288 struct btrfs_key key;
4289 struct btrfs_key found_key;
4290 u64 extent_start = 0;
4291 u64 extent_num_bytes = 0;
4292 u64 extent_offset = 0;
4294 u64 last_size = new_size;
4295 u32 found_type = (u8)-1;
4298 int pending_del_nr = 0;
4299 int pending_del_slot = 0;
4300 int extent_type = -1;
4303 u64 ino = btrfs_ino(BTRFS_I(inode));
4304 u64 bytes_deleted = 0;
4306 bool should_throttle = 0;
4307 bool should_end = 0;
4309 BUG_ON(new_size > 0 && min_type != BTRFS_EXTENT_DATA_KEY);
4312 * for non-free space inodes and ref cows, we want to back off from
4315 if (!btrfs_is_free_space_inode(BTRFS_I(inode)) &&
4316 test_bit(BTRFS_ROOT_REF_COWS, &root->state))
4319 path = btrfs_alloc_path();
4322 path->reada = READA_BACK;
4325 * We want to drop from the next block forward in case this new size is
4326 * not block aligned since we will be keeping the last block of the
4327 * extent just the way it is.
4329 if (test_bit(BTRFS_ROOT_REF_COWS, &root->state) ||
4330 root == fs_info->tree_root)
4331 btrfs_drop_extent_cache(BTRFS_I(inode), ALIGN(new_size,
4332 fs_info->sectorsize),
4336 * This function is also used to drop the items in the log tree before
4337 * we relog the inode, so if root != BTRFS_I(inode)->root, it means
4338 * it is used to drop the loged items. So we shouldn't kill the delayed
4341 if (min_type == 0 && root == BTRFS_I(inode)->root)
4342 btrfs_kill_delayed_inode_items(BTRFS_I(inode));
4345 key.offset = (u64)-1;
4350 * with a 16K leaf size and 128MB extents, you can actually queue
4351 * up a huge file in a single leaf. Most of the time that
4352 * bytes_deleted is > 0, it will be huge by the time we get here
4354 if (be_nice && bytes_deleted > SZ_32M) {
4355 if (btrfs_should_end_transaction(trans)) {
4362 path->leave_spinning = 1;
4363 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
4370 /* there are no items in the tree for us to truncate, we're
4373 if (path->slots[0] == 0)
4380 leaf = path->nodes[0];
4381 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
4382 found_type = found_key.type;
4384 if (found_key.objectid != ino)
4387 if (found_type < min_type)
4390 item_end = found_key.offset;
4391 if (found_type == BTRFS_EXTENT_DATA_KEY) {
4392 fi = btrfs_item_ptr(leaf, path->slots[0],
4393 struct btrfs_file_extent_item);
4394 extent_type = btrfs_file_extent_type(leaf, fi);
4395 if (extent_type != BTRFS_FILE_EXTENT_INLINE) {
4397 btrfs_file_extent_num_bytes(leaf, fi);
4398 } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
4399 item_end += btrfs_file_extent_inline_len(leaf,
4400 path->slots[0], fi);
4404 if (found_type > min_type) {
4407 if (item_end < new_size) {
4409 * With NO_HOLES mode, for the following mapping
4411 * [0-4k][hole][8k-12k]
4413 * if truncating isize down to 6k, it ends up
4416 if (btrfs_fs_incompat(root->fs_info, NO_HOLES))
4417 last_size = new_size;
4420 if (found_key.offset >= new_size)
4426 /* FIXME, shrink the extent if the ref count is only 1 */
4427 if (found_type != BTRFS_EXTENT_DATA_KEY)
4431 last_size = found_key.offset;
4433 last_size = new_size;
4435 if (extent_type != BTRFS_FILE_EXTENT_INLINE) {
4437 extent_start = btrfs_file_extent_disk_bytenr(leaf, fi);
4439 u64 orig_num_bytes =
4440 btrfs_file_extent_num_bytes(leaf, fi);
4441 extent_num_bytes = ALIGN(new_size -
4443 fs_info->sectorsize);
4444 btrfs_set_file_extent_num_bytes(leaf, fi,
4446 num_dec = (orig_num_bytes -
4448 if (test_bit(BTRFS_ROOT_REF_COWS,
4451 inode_sub_bytes(inode, num_dec);
4452 btrfs_mark_buffer_dirty(leaf);
4455 btrfs_file_extent_disk_num_bytes(leaf,
4457 extent_offset = found_key.offset -
4458 btrfs_file_extent_offset(leaf, fi);
4460 /* FIXME blocksize != 4096 */
4461 num_dec = btrfs_file_extent_num_bytes(leaf, fi);
4462 if (extent_start != 0) {
4464 if (test_bit(BTRFS_ROOT_REF_COWS,
4466 inode_sub_bytes(inode, num_dec);
4469 } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
4471 * we can't truncate inline items that have had
4475 btrfs_file_extent_encryption(leaf, fi) == 0 &&
4476 btrfs_file_extent_other_encoding(leaf, fi) == 0) {
4479 * Need to release path in order to truncate a
4480 * compressed extent. So delete any accumulated
4481 * extent items so far.
4483 if (btrfs_file_extent_compression(leaf, fi) !=
4484 BTRFS_COMPRESS_NONE && pending_del_nr) {
4485 err = btrfs_del_items(trans, root, path,
4489 btrfs_abort_transaction(trans,
4496 err = truncate_inline_extent(inode, path,
4501 btrfs_abort_transaction(trans, err);
4504 } else if (test_bit(BTRFS_ROOT_REF_COWS,
4506 inode_sub_bytes(inode, item_end + 1 - new_size);
4511 if (!pending_del_nr) {
4512 /* no pending yet, add ourselves */
4513 pending_del_slot = path->slots[0];
4515 } else if (pending_del_nr &&
4516 path->slots[0] + 1 == pending_del_slot) {
4517 /* hop on the pending chunk */
4519 pending_del_slot = path->slots[0];
4526 should_throttle = 0;
4529 (test_bit(BTRFS_ROOT_REF_COWS, &root->state) ||
4530 root == fs_info->tree_root)) {
4531 btrfs_set_path_blocking(path);
4532 bytes_deleted += extent_num_bytes;
4533 ret = btrfs_free_extent(trans, fs_info, extent_start,
4534 extent_num_bytes, 0,
4535 btrfs_header_owner(leaf),
4536 ino, extent_offset);
4538 if (btrfs_should_throttle_delayed_refs(trans, fs_info))
4539 btrfs_async_run_delayed_refs(fs_info,
4540 trans->delayed_ref_updates * 2,
4543 if (truncate_space_check(trans, root,
4544 extent_num_bytes)) {
4547 if (btrfs_should_throttle_delayed_refs(trans,
4549 should_throttle = 1;
4553 if (found_type == BTRFS_INODE_ITEM_KEY)
4556 if (path->slots[0] == 0 ||
4557 path->slots[0] != pending_del_slot ||
4558 should_throttle || should_end) {
4559 if (pending_del_nr) {
4560 ret = btrfs_del_items(trans, root, path,
4564 btrfs_abort_transaction(trans, ret);
4569 btrfs_release_path(path);
4570 if (should_throttle) {
4571 unsigned long updates = trans->delayed_ref_updates;
4573 trans->delayed_ref_updates = 0;
4574 ret = btrfs_run_delayed_refs(trans,
4582 * if we failed to refill our space rsv, bail out
4583 * and let the transaction restart
4595 if (pending_del_nr) {
4596 ret = btrfs_del_items(trans, root, path, pending_del_slot,
4599 btrfs_abort_transaction(trans, ret);
4602 if (root->root_key.objectid != BTRFS_TREE_LOG_OBJECTID)
4603 btrfs_ordered_update_i_size(inode, last_size, NULL);
4605 btrfs_free_path(path);
4608 /* only inline file may have last_size != new_size */
4609 if (new_size >= fs_info->sectorsize ||
4610 new_size > fs_info->max_inline)
4611 ASSERT(last_size == new_size);
4614 if (be_nice && bytes_deleted > SZ_32M) {
4615 unsigned long updates = trans->delayed_ref_updates;
4617 trans->delayed_ref_updates = 0;
4618 ret = btrfs_run_delayed_refs(trans, fs_info,
4628 * btrfs_truncate_block - read, zero a chunk and write a block
4629 * @inode - inode that we're zeroing
4630 * @from - the offset to start zeroing
4631 * @len - the length to zero, 0 to zero the entire range respective to the
4633 * @front - zero up to the offset instead of from the offset on
4635 * This will find the block for the "from" offset and cow the block and zero the
4636 * part we want to zero. This is used with truncate and hole punching.
4638 int btrfs_truncate_block(struct inode *inode, loff_t from, loff_t len,
4641 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
4642 struct address_space *mapping = inode->i_mapping;
4643 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
4644 struct btrfs_ordered_extent *ordered;
4645 struct extent_state *cached_state = NULL;
4647 u32 blocksize = fs_info->sectorsize;
4648 pgoff_t index = from >> PAGE_SHIFT;
4649 unsigned offset = from & (blocksize - 1);
4651 gfp_t mask = btrfs_alloc_write_mask(mapping);
4656 if ((offset & (blocksize - 1)) == 0 &&
4657 (!len || ((len & (blocksize - 1)) == 0)))
4660 ret = btrfs_delalloc_reserve_space(inode,
4661 round_down(from, blocksize), blocksize);
4666 page = find_or_create_page(mapping, index, mask);
4668 btrfs_delalloc_release_space(inode,
4669 round_down(from, blocksize),
4675 block_start = round_down(from, blocksize);
4676 block_end = block_start + blocksize - 1;
4678 if (!PageUptodate(page)) {
4679 ret = btrfs_readpage(NULL, page);
4681 if (page->mapping != mapping) {
4686 if (!PageUptodate(page)) {
4691 wait_on_page_writeback(page);
4693 lock_extent_bits(io_tree, block_start, block_end, &cached_state);
4694 set_page_extent_mapped(page);
4696 ordered = btrfs_lookup_ordered_extent(inode, block_start);
4698 unlock_extent_cached(io_tree, block_start, block_end,
4699 &cached_state, GFP_NOFS);
4702 btrfs_start_ordered_extent(inode, ordered, 1);
4703 btrfs_put_ordered_extent(ordered);
4707 clear_extent_bit(&BTRFS_I(inode)->io_tree, block_start, block_end,
4708 EXTENT_DIRTY | EXTENT_DELALLOC |
4709 EXTENT_DO_ACCOUNTING | EXTENT_DEFRAG,
4710 0, 0, &cached_state, GFP_NOFS);
4712 ret = btrfs_set_extent_delalloc(inode, block_start, block_end,
4715 unlock_extent_cached(io_tree, block_start, block_end,
4716 &cached_state, GFP_NOFS);
4720 if (offset != blocksize) {
4722 len = blocksize - offset;
4725 memset(kaddr + (block_start - page_offset(page)),
4728 memset(kaddr + (block_start - page_offset(page)) + offset,
4730 flush_dcache_page(page);
4733 ClearPageChecked(page);
4734 set_page_dirty(page);
4735 unlock_extent_cached(io_tree, block_start, block_end, &cached_state,
4740 btrfs_delalloc_release_space(inode, block_start,
4748 static int maybe_insert_hole(struct btrfs_root *root, struct inode *inode,
4749 u64 offset, u64 len)
4751 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
4752 struct btrfs_trans_handle *trans;
4756 * Still need to make sure the inode looks like it's been updated so
4757 * that any holes get logged if we fsync.
4759 if (btrfs_fs_incompat(fs_info, NO_HOLES)) {
4760 BTRFS_I(inode)->last_trans = fs_info->generation;
4761 BTRFS_I(inode)->last_sub_trans = root->log_transid;
4762 BTRFS_I(inode)->last_log_commit = root->last_log_commit;
4767 * 1 - for the one we're dropping
4768 * 1 - for the one we're adding
4769 * 1 - for updating the inode.
4771 trans = btrfs_start_transaction(root, 3);
4773 return PTR_ERR(trans);
4775 ret = btrfs_drop_extents(trans, root, inode, offset, offset + len, 1);
4777 btrfs_abort_transaction(trans, ret);
4778 btrfs_end_transaction(trans);
4782 ret = btrfs_insert_file_extent(trans, root, btrfs_ino(BTRFS_I(inode)),
4783 offset, 0, 0, len, 0, len, 0, 0, 0);
4785 btrfs_abort_transaction(trans, ret);
4787 btrfs_update_inode(trans, root, inode);
4788 btrfs_end_transaction(trans);
4793 * This function puts in dummy file extents for the area we're creating a hole
4794 * for. So if we are truncating this file to a larger size we need to insert
4795 * these file extents so that btrfs_get_extent will return a EXTENT_MAP_HOLE for
4796 * the range between oldsize and size
4798 int btrfs_cont_expand(struct inode *inode, loff_t oldsize, loff_t size)
4800 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
4801 struct btrfs_root *root = BTRFS_I(inode)->root;
4802 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
4803 struct extent_map *em = NULL;
4804 struct extent_state *cached_state = NULL;
4805 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
4806 u64 hole_start = ALIGN(oldsize, fs_info->sectorsize);
4807 u64 block_end = ALIGN(size, fs_info->sectorsize);
4814 * If our size started in the middle of a block we need to zero out the
4815 * rest of the block before we expand the i_size, otherwise we could
4816 * expose stale data.
4818 err = btrfs_truncate_block(inode, oldsize, 0, 0);
4822 if (size <= hole_start)
4826 struct btrfs_ordered_extent *ordered;
4828 lock_extent_bits(io_tree, hole_start, block_end - 1,
4830 ordered = btrfs_lookup_ordered_range(BTRFS_I(inode), hole_start,
4831 block_end - hole_start);
4834 unlock_extent_cached(io_tree, hole_start, block_end - 1,
4835 &cached_state, GFP_NOFS);
4836 btrfs_start_ordered_extent(inode, ordered, 1);
4837 btrfs_put_ordered_extent(ordered);
4840 cur_offset = hole_start;
4842 em = btrfs_get_extent(BTRFS_I(inode), NULL, 0, cur_offset,
4843 block_end - cur_offset, 0);
4849 last_byte = min(extent_map_end(em), block_end);
4850 last_byte = ALIGN(last_byte, fs_info->sectorsize);
4851 if (!test_bit(EXTENT_FLAG_PREALLOC, &em->flags)) {
4852 struct extent_map *hole_em;
4853 hole_size = last_byte - cur_offset;
4855 err = maybe_insert_hole(root, inode, cur_offset,
4859 btrfs_drop_extent_cache(BTRFS_I(inode), cur_offset,
4860 cur_offset + hole_size - 1, 0);
4861 hole_em = alloc_extent_map();
4863 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC,
4864 &BTRFS_I(inode)->runtime_flags);
4867 hole_em->start = cur_offset;
4868 hole_em->len = hole_size;
4869 hole_em->orig_start = cur_offset;
4871 hole_em->block_start = EXTENT_MAP_HOLE;
4872 hole_em->block_len = 0;
4873 hole_em->orig_block_len = 0;
4874 hole_em->ram_bytes = hole_size;
4875 hole_em->bdev = fs_info->fs_devices->latest_bdev;
4876 hole_em->compress_type = BTRFS_COMPRESS_NONE;
4877 hole_em->generation = fs_info->generation;
4880 write_lock(&em_tree->lock);
4881 err = add_extent_mapping(em_tree, hole_em, 1);
4882 write_unlock(&em_tree->lock);
4885 btrfs_drop_extent_cache(BTRFS_I(inode),
4890 free_extent_map(hole_em);
4893 free_extent_map(em);
4895 cur_offset = last_byte;
4896 if (cur_offset >= block_end)
4899 free_extent_map(em);
4900 unlock_extent_cached(io_tree, hole_start, block_end - 1, &cached_state,
4905 static int btrfs_setsize(struct inode *inode, struct iattr *attr)
4907 struct btrfs_root *root = BTRFS_I(inode)->root;
4908 struct btrfs_trans_handle *trans;
4909 loff_t oldsize = i_size_read(inode);
4910 loff_t newsize = attr->ia_size;
4911 int mask = attr->ia_valid;
4915 * The regular truncate() case without ATTR_CTIME and ATTR_MTIME is a
4916 * special case where we need to update the times despite not having
4917 * these flags set. For all other operations the VFS set these flags
4918 * explicitly if it wants a timestamp update.
4920 if (newsize != oldsize) {
4921 inode_inc_iversion(inode);
4922 if (!(mask & (ATTR_CTIME | ATTR_MTIME)))
4923 inode->i_ctime = inode->i_mtime =
4924 current_time(inode);
4927 if (newsize > oldsize) {
4929 * Don't do an expanding truncate while snapshoting is ongoing.
4930 * This is to ensure the snapshot captures a fully consistent
4931 * state of this file - if the snapshot captures this expanding
4932 * truncation, it must capture all writes that happened before
4935 btrfs_wait_for_snapshot_creation(root);
4936 ret = btrfs_cont_expand(inode, oldsize, newsize);
4938 btrfs_end_write_no_snapshoting(root);
4942 trans = btrfs_start_transaction(root, 1);
4943 if (IS_ERR(trans)) {
4944 btrfs_end_write_no_snapshoting(root);
4945 return PTR_ERR(trans);
4948 i_size_write(inode, newsize);
4949 btrfs_ordered_update_i_size(inode, i_size_read(inode), NULL);
4950 pagecache_isize_extended(inode, oldsize, newsize);
4951 ret = btrfs_update_inode(trans, root, inode);
4952 btrfs_end_write_no_snapshoting(root);
4953 btrfs_end_transaction(trans);
4957 * We're truncating a file that used to have good data down to
4958 * zero. Make sure it gets into the ordered flush list so that
4959 * any new writes get down to disk quickly.
4962 set_bit(BTRFS_INODE_ORDERED_DATA_CLOSE,
4963 &BTRFS_I(inode)->runtime_flags);
4966 * 1 for the orphan item we're going to add
4967 * 1 for the orphan item deletion.
4969 trans = btrfs_start_transaction(root, 2);
4971 return PTR_ERR(trans);
4974 * We need to do this in case we fail at _any_ point during the
4975 * actual truncate. Once we do the truncate_setsize we could
4976 * invalidate pages which forces any outstanding ordered io to
4977 * be instantly completed which will give us extents that need
4978 * to be truncated. If we fail to get an orphan inode down we
4979 * could have left over extents that were never meant to live,
4980 * so we need to guarantee from this point on that everything
4981 * will be consistent.
4983 ret = btrfs_orphan_add(trans, BTRFS_I(inode));
4984 btrfs_end_transaction(trans);
4988 /* we don't support swapfiles, so vmtruncate shouldn't fail */
4989 truncate_setsize(inode, newsize);
4991 /* Disable nonlocked read DIO to avoid the end less truncate */
4992 btrfs_inode_block_unlocked_dio(BTRFS_I(inode));
4993 inode_dio_wait(inode);
4994 btrfs_inode_resume_unlocked_dio(BTRFS_I(inode));
4996 ret = btrfs_truncate(inode);
4997 if (ret && inode->i_nlink) {
5000 /* To get a stable disk_i_size */
5001 err = btrfs_wait_ordered_range(inode, 0, (u64)-1);
5003 btrfs_orphan_del(NULL, BTRFS_I(inode));
5008 * failed to truncate, disk_i_size is only adjusted down
5009 * as we remove extents, so it should represent the true
5010 * size of the inode, so reset the in memory size and
5011 * delete our orphan entry.
5013 trans = btrfs_join_transaction(root);
5014 if (IS_ERR(trans)) {
5015 btrfs_orphan_del(NULL, BTRFS_I(inode));
5018 i_size_write(inode, BTRFS_I(inode)->disk_i_size);
5019 err = btrfs_orphan_del(trans, BTRFS_I(inode));
5021 btrfs_abort_transaction(trans, err);
5022 btrfs_end_transaction(trans);
5029 static int btrfs_setattr(struct dentry *dentry, struct iattr *attr)
5031 struct inode *inode = d_inode(dentry);
5032 struct btrfs_root *root = BTRFS_I(inode)->root;
5035 if (btrfs_root_readonly(root))
5038 err = setattr_prepare(dentry, attr);
5042 if (S_ISREG(inode->i_mode) && (attr->ia_valid & ATTR_SIZE)) {
5043 err = btrfs_setsize(inode, attr);
5048 if (attr->ia_valid) {
5049 setattr_copy(inode, attr);
5050 inode_inc_iversion(inode);
5051 err = btrfs_dirty_inode(inode);
5053 if (!err && attr->ia_valid & ATTR_MODE)
5054 err = posix_acl_chmod(inode, inode->i_mode);
5061 * While truncating the inode pages during eviction, we get the VFS calling
5062 * btrfs_invalidatepage() against each page of the inode. This is slow because
5063 * the calls to btrfs_invalidatepage() result in a huge amount of calls to
5064 * lock_extent_bits() and clear_extent_bit(), which keep merging and splitting
5065 * extent_state structures over and over, wasting lots of time.
5067 * Therefore if the inode is being evicted, let btrfs_invalidatepage() skip all
5068 * those expensive operations on a per page basis and do only the ordered io
5069 * finishing, while we release here the extent_map and extent_state structures,
5070 * without the excessive merging and splitting.
5072 static void evict_inode_truncate_pages(struct inode *inode)
5074 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
5075 struct extent_map_tree *map_tree = &BTRFS_I(inode)->extent_tree;
5076 struct rb_node *node;
5078 ASSERT(inode->i_state & I_FREEING);
5079 truncate_inode_pages_final(&inode->i_data);
5081 write_lock(&map_tree->lock);
5082 while (!RB_EMPTY_ROOT(&map_tree->map)) {
5083 struct extent_map *em;
5085 node = rb_first(&map_tree->map);
5086 em = rb_entry(node, struct extent_map, rb_node);
5087 clear_bit(EXTENT_FLAG_PINNED, &em->flags);
5088 clear_bit(EXTENT_FLAG_LOGGING, &em->flags);
5089 remove_extent_mapping(map_tree, em);
5090 free_extent_map(em);
5091 if (need_resched()) {
5092 write_unlock(&map_tree->lock);
5094 write_lock(&map_tree->lock);
5097 write_unlock(&map_tree->lock);
5100 * Keep looping until we have no more ranges in the io tree.
5101 * We can have ongoing bios started by readpages (called from readahead)
5102 * that have their endio callback (extent_io.c:end_bio_extent_readpage)
5103 * still in progress (unlocked the pages in the bio but did not yet
5104 * unlocked the ranges in the io tree). Therefore this means some
5105 * ranges can still be locked and eviction started because before
5106 * submitting those bios, which are executed by a separate task (work
5107 * queue kthread), inode references (inode->i_count) were not taken
5108 * (which would be dropped in the end io callback of each bio).
5109 * Therefore here we effectively end up waiting for those bios and
5110 * anyone else holding locked ranges without having bumped the inode's
5111 * reference count - if we don't do it, when they access the inode's
5112 * io_tree to unlock a range it may be too late, leading to an
5113 * use-after-free issue.
5115 spin_lock(&io_tree->lock);
5116 while (!RB_EMPTY_ROOT(&io_tree->state)) {
5117 struct extent_state *state;
5118 struct extent_state *cached_state = NULL;
5122 node = rb_first(&io_tree->state);
5123 state = rb_entry(node, struct extent_state, rb_node);
5124 start = state->start;
5126 spin_unlock(&io_tree->lock);
5128 lock_extent_bits(io_tree, start, end, &cached_state);
5131 * If still has DELALLOC flag, the extent didn't reach disk,
5132 * and its reserved space won't be freed by delayed_ref.
5133 * So we need to free its reserved space here.
5134 * (Refer to comment in btrfs_invalidatepage, case 2)
5136 * Note, end is the bytenr of last byte, so we need + 1 here.
5138 if (state->state & EXTENT_DELALLOC)
5139 btrfs_qgroup_free_data(inode, start, end - start + 1);
5141 clear_extent_bit(io_tree, start, end,
5142 EXTENT_LOCKED | EXTENT_DIRTY |
5143 EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING |
5144 EXTENT_DEFRAG, 1, 1,
5145 &cached_state, GFP_NOFS);
5148 spin_lock(&io_tree->lock);
5150 spin_unlock(&io_tree->lock);
5153 void btrfs_evict_inode(struct inode *inode)
5155 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
5156 struct btrfs_trans_handle *trans;
5157 struct btrfs_root *root = BTRFS_I(inode)->root;
5158 struct btrfs_block_rsv *rsv, *global_rsv;
5159 int steal_from_global = 0;
5163 trace_btrfs_inode_evict(inode);
5166 kmem_cache_free(btrfs_inode_cachep, BTRFS_I(inode));
5170 min_size = btrfs_calc_trunc_metadata_size(fs_info, 1);
5172 evict_inode_truncate_pages(inode);
5174 if (inode->i_nlink &&
5175 ((btrfs_root_refs(&root->root_item) != 0 &&
5176 root->root_key.objectid != BTRFS_ROOT_TREE_OBJECTID) ||
5177 btrfs_is_free_space_inode(BTRFS_I(inode))))
5180 if (is_bad_inode(inode)) {
5181 btrfs_orphan_del(NULL, BTRFS_I(inode));
5184 /* do we really want it for ->i_nlink > 0 and zero btrfs_root_refs? */
5185 if (!special_file(inode->i_mode))
5186 btrfs_wait_ordered_range(inode, 0, (u64)-1);
5188 btrfs_free_io_failure_record(BTRFS_I(inode), 0, (u64)-1);
5190 if (test_bit(BTRFS_FS_LOG_RECOVERING, &fs_info->flags)) {
5191 BUG_ON(test_bit(BTRFS_INODE_HAS_ORPHAN_ITEM,
5192 &BTRFS_I(inode)->runtime_flags));
5196 if (inode->i_nlink > 0) {
5197 BUG_ON(btrfs_root_refs(&root->root_item) != 0 &&
5198 root->root_key.objectid != BTRFS_ROOT_TREE_OBJECTID);
5202 ret = btrfs_commit_inode_delayed_inode(BTRFS_I(inode));
5204 btrfs_orphan_del(NULL, BTRFS_I(inode));
5208 rsv = btrfs_alloc_block_rsv(fs_info, BTRFS_BLOCK_RSV_TEMP);
5210 btrfs_orphan_del(NULL, BTRFS_I(inode));
5213 rsv->size = min_size;
5215 global_rsv = &fs_info->global_block_rsv;
5217 btrfs_i_size_write(BTRFS_I(inode), 0);
5220 * This is a bit simpler than btrfs_truncate since we've already
5221 * reserved our space for our orphan item in the unlink, so we just
5222 * need to reserve some slack space in case we add bytes and update
5223 * inode item when doing the truncate.
5226 ret = btrfs_block_rsv_refill(root, rsv, min_size,
5227 BTRFS_RESERVE_FLUSH_LIMIT);
5230 * Try and steal from the global reserve since we will
5231 * likely not use this space anyway, we want to try as
5232 * hard as possible to get this to work.
5235 steal_from_global++;
5237 steal_from_global = 0;
5241 * steal_from_global == 0: we reserved stuff, hooray!
5242 * steal_from_global == 1: we didn't reserve stuff, boo!
5243 * steal_from_global == 2: we've committed, still not a lot of
5244 * room but maybe we'll have room in the global reserve this
5246 * steal_from_global == 3: abandon all hope!
5248 if (steal_from_global > 2) {
5250 "Could not get space for a delete, will truncate on mount %d",
5252 btrfs_orphan_del(NULL, BTRFS_I(inode));
5253 btrfs_free_block_rsv(fs_info, rsv);
5257 trans = btrfs_join_transaction(root);
5258 if (IS_ERR(trans)) {
5259 btrfs_orphan_del(NULL, BTRFS_I(inode));
5260 btrfs_free_block_rsv(fs_info, rsv);
5265 * We can't just steal from the global reserve, we need to make
5266 * sure there is room to do it, if not we need to commit and try
5269 if (steal_from_global) {
5270 if (!btrfs_check_space_for_delayed_refs(trans, fs_info))
5271 ret = btrfs_block_rsv_migrate(global_rsv, rsv,
5278 * Couldn't steal from the global reserve, we have too much
5279 * pending stuff built up, commit the transaction and try it
5283 ret = btrfs_commit_transaction(trans);
5285 btrfs_orphan_del(NULL, BTRFS_I(inode));
5286 btrfs_free_block_rsv(fs_info, rsv);
5291 steal_from_global = 0;
5294 trans->block_rsv = rsv;
5296 ret = btrfs_truncate_inode_items(trans, root, inode, 0, 0);
5297 if (ret != -ENOSPC && ret != -EAGAIN)
5300 trans->block_rsv = &fs_info->trans_block_rsv;
5301 btrfs_end_transaction(trans);
5303 btrfs_btree_balance_dirty(fs_info);
5306 btrfs_free_block_rsv(fs_info, rsv);
5309 * Errors here aren't a big deal, it just means we leave orphan items
5310 * in the tree. They will be cleaned up on the next mount.
5313 trans->block_rsv = root->orphan_block_rsv;
5314 btrfs_orphan_del(trans, BTRFS_I(inode));
5316 btrfs_orphan_del(NULL, BTRFS_I(inode));
5319 trans->block_rsv = &fs_info->trans_block_rsv;
5320 if (!(root == fs_info->tree_root ||
5321 root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID))
5322 btrfs_return_ino(root, btrfs_ino(BTRFS_I(inode)));
5324 btrfs_end_transaction(trans);
5325 btrfs_btree_balance_dirty(fs_info);
5327 btrfs_remove_delayed_node(BTRFS_I(inode));
5332 * this returns the key found in the dir entry in the location pointer.
5333 * If no dir entries were found, location->objectid is 0.
5335 static int btrfs_inode_by_name(struct inode *dir, struct dentry *dentry,
5336 struct btrfs_key *location)
5338 const char *name = dentry->d_name.name;
5339 int namelen = dentry->d_name.len;
5340 struct btrfs_dir_item *di;
5341 struct btrfs_path *path;
5342 struct btrfs_root *root = BTRFS_I(dir)->root;
5345 path = btrfs_alloc_path();
5349 di = btrfs_lookup_dir_item(NULL, root, path, btrfs_ino(BTRFS_I(dir)),
5354 if (IS_ERR_OR_NULL(di))
5357 btrfs_dir_item_key_to_cpu(path->nodes[0], di, location);
5359 btrfs_free_path(path);
5362 location->objectid = 0;
5367 * when we hit a tree root in a directory, the btrfs part of the inode
5368 * needs to be changed to reflect the root directory of the tree root. This
5369 * is kind of like crossing a mount point.
5371 static int fixup_tree_root_location(struct btrfs_fs_info *fs_info,
5373 struct dentry *dentry,
5374 struct btrfs_key *location,
5375 struct btrfs_root **sub_root)
5377 struct btrfs_path *path;
5378 struct btrfs_root *new_root;
5379 struct btrfs_root_ref *ref;
5380 struct extent_buffer *leaf;
5381 struct btrfs_key key;
5385 path = btrfs_alloc_path();
5392 key.objectid = BTRFS_I(dir)->root->root_key.objectid;
5393 key.type = BTRFS_ROOT_REF_KEY;
5394 key.offset = location->objectid;
5396 ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, path, 0, 0);
5403 leaf = path->nodes[0];
5404 ref = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_ref);
5405 if (btrfs_root_ref_dirid(leaf, ref) != btrfs_ino(BTRFS_I(dir)) ||
5406 btrfs_root_ref_name_len(leaf, ref) != dentry->d_name.len)
5409 ret = memcmp_extent_buffer(leaf, dentry->d_name.name,
5410 (unsigned long)(ref + 1),
5411 dentry->d_name.len);
5415 btrfs_release_path(path);
5417 new_root = btrfs_read_fs_root_no_name(fs_info, location);
5418 if (IS_ERR(new_root)) {
5419 err = PTR_ERR(new_root);
5423 *sub_root = new_root;
5424 location->objectid = btrfs_root_dirid(&new_root->root_item);
5425 location->type = BTRFS_INODE_ITEM_KEY;
5426 location->offset = 0;
5429 btrfs_free_path(path);
5433 static void inode_tree_add(struct inode *inode)
5435 struct btrfs_root *root = BTRFS_I(inode)->root;
5436 struct btrfs_inode *entry;
5438 struct rb_node *parent;
5439 struct rb_node *new = &BTRFS_I(inode)->rb_node;
5440 u64 ino = btrfs_ino(BTRFS_I(inode));
5442 if (inode_unhashed(inode))
5445 spin_lock(&root->inode_lock);
5446 p = &root->inode_tree.rb_node;
5449 entry = rb_entry(parent, struct btrfs_inode, rb_node);
5451 if (ino < btrfs_ino(BTRFS_I(&entry->vfs_inode)))
5452 p = &parent->rb_left;
5453 else if (ino > btrfs_ino(BTRFS_I(&entry->vfs_inode)))
5454 p = &parent->rb_right;
5456 WARN_ON(!(entry->vfs_inode.i_state &
5457 (I_WILL_FREE | I_FREEING)));
5458 rb_replace_node(parent, new, &root->inode_tree);
5459 RB_CLEAR_NODE(parent);
5460 spin_unlock(&root->inode_lock);
5464 rb_link_node(new, parent, p);
5465 rb_insert_color(new, &root->inode_tree);
5466 spin_unlock(&root->inode_lock);
5469 static void inode_tree_del(struct inode *inode)
5471 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
5472 struct btrfs_root *root = BTRFS_I(inode)->root;
5475 spin_lock(&root->inode_lock);
5476 if (!RB_EMPTY_NODE(&BTRFS_I(inode)->rb_node)) {
5477 rb_erase(&BTRFS_I(inode)->rb_node, &root->inode_tree);
5478 RB_CLEAR_NODE(&BTRFS_I(inode)->rb_node);
5479 empty = RB_EMPTY_ROOT(&root->inode_tree);
5481 spin_unlock(&root->inode_lock);
5483 if (empty && btrfs_root_refs(&root->root_item) == 0) {
5484 synchronize_srcu(&fs_info->subvol_srcu);
5485 spin_lock(&root->inode_lock);
5486 empty = RB_EMPTY_ROOT(&root->inode_tree);
5487 spin_unlock(&root->inode_lock);
5489 btrfs_add_dead_root(root);
5493 void btrfs_invalidate_inodes(struct btrfs_root *root)
5495 struct btrfs_fs_info *fs_info = root->fs_info;
5496 struct rb_node *node;
5497 struct rb_node *prev;
5498 struct btrfs_inode *entry;
5499 struct inode *inode;
5502 if (!test_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state))
5503 WARN_ON(btrfs_root_refs(&root->root_item) != 0);
5505 spin_lock(&root->inode_lock);
5507 node = root->inode_tree.rb_node;
5511 entry = rb_entry(node, struct btrfs_inode, rb_node);
5513 if (objectid < btrfs_ino(BTRFS_I(&entry->vfs_inode)))
5514 node = node->rb_left;
5515 else if (objectid > btrfs_ino(BTRFS_I(&entry->vfs_inode)))
5516 node = node->rb_right;
5522 entry = rb_entry(prev, struct btrfs_inode, rb_node);
5523 if (objectid <= btrfs_ino(BTRFS_I(&entry->vfs_inode))) {
5527 prev = rb_next(prev);
5531 entry = rb_entry(node, struct btrfs_inode, rb_node);
5532 objectid = btrfs_ino(BTRFS_I(&entry->vfs_inode)) + 1;
5533 inode = igrab(&entry->vfs_inode);
5535 spin_unlock(&root->inode_lock);
5536 if (atomic_read(&inode->i_count) > 1)
5537 d_prune_aliases(inode);
5539 * btrfs_drop_inode will have it removed from
5540 * the inode cache when its usage count
5545 spin_lock(&root->inode_lock);
5549 if (cond_resched_lock(&root->inode_lock))
5552 node = rb_next(node);
5554 spin_unlock(&root->inode_lock);
5557 static int btrfs_init_locked_inode(struct inode *inode, void *p)
5559 struct btrfs_iget_args *args = p;
5560 inode->i_ino = args->location->objectid;
5561 memcpy(&BTRFS_I(inode)->location, args->location,
5562 sizeof(*args->location));
5563 BTRFS_I(inode)->root = args->root;
5567 static int btrfs_find_actor(struct inode *inode, void *opaque)
5569 struct btrfs_iget_args *args = opaque;
5570 return args->location->objectid == BTRFS_I(inode)->location.objectid &&
5571 args->root == BTRFS_I(inode)->root;
5574 static struct inode *btrfs_iget_locked(struct super_block *s,
5575 struct btrfs_key *location,
5576 struct btrfs_root *root)
5578 struct inode *inode;
5579 struct btrfs_iget_args args;
5580 unsigned long hashval = btrfs_inode_hash(location->objectid, root);
5582 args.location = location;
5585 inode = iget5_locked(s, hashval, btrfs_find_actor,
5586 btrfs_init_locked_inode,
5591 /* Get an inode object given its location and corresponding root.
5592 * Returns in *is_new if the inode was read from disk
5594 struct inode *btrfs_iget(struct super_block *s, struct btrfs_key *location,
5595 struct btrfs_root *root, int *new)
5597 struct inode *inode;
5599 inode = btrfs_iget_locked(s, location, root);
5601 return ERR_PTR(-ENOMEM);
5603 if (inode->i_state & I_NEW) {
5606 ret = btrfs_read_locked_inode(inode);
5607 if (!is_bad_inode(inode)) {
5608 inode_tree_add(inode);
5609 unlock_new_inode(inode);
5613 unlock_new_inode(inode);
5616 inode = ERR_PTR(ret < 0 ? ret : -ESTALE);
5623 static struct inode *new_simple_dir(struct super_block *s,
5624 struct btrfs_key *key,
5625 struct btrfs_root *root)
5627 struct inode *inode = new_inode(s);
5630 return ERR_PTR(-ENOMEM);
5632 BTRFS_I(inode)->root = root;
5633 memcpy(&BTRFS_I(inode)->location, key, sizeof(*key));
5634 set_bit(BTRFS_INODE_DUMMY, &BTRFS_I(inode)->runtime_flags);
5636 inode->i_ino = BTRFS_EMPTY_SUBVOL_DIR_OBJECTID;
5637 inode->i_op = &btrfs_dir_ro_inode_operations;
5638 inode->i_opflags &= ~IOP_XATTR;
5639 inode->i_fop = &simple_dir_operations;
5640 inode->i_mode = S_IFDIR | S_IRUGO | S_IWUSR | S_IXUGO;
5641 inode->i_mtime = current_time(inode);
5642 inode->i_atime = inode->i_mtime;
5643 inode->i_ctime = inode->i_mtime;
5644 BTRFS_I(inode)->i_otime = inode->i_mtime;
5649 struct inode *btrfs_lookup_dentry(struct inode *dir, struct dentry *dentry)
5651 struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
5652 struct inode *inode;
5653 struct btrfs_root *root = BTRFS_I(dir)->root;
5654 struct btrfs_root *sub_root = root;
5655 struct btrfs_key location;
5659 if (dentry->d_name.len > BTRFS_NAME_LEN)
5660 return ERR_PTR(-ENAMETOOLONG);
5662 ret = btrfs_inode_by_name(dir, dentry, &location);
5664 return ERR_PTR(ret);
5666 if (location.objectid == 0)
5667 return ERR_PTR(-ENOENT);
5669 if (location.type == BTRFS_INODE_ITEM_KEY) {
5670 inode = btrfs_iget(dir->i_sb, &location, root, NULL);
5674 BUG_ON(location.type != BTRFS_ROOT_ITEM_KEY);
5676 index = srcu_read_lock(&fs_info->subvol_srcu);
5677 ret = fixup_tree_root_location(fs_info, dir, dentry,
5678 &location, &sub_root);
5681 inode = ERR_PTR(ret);
5683 inode = new_simple_dir(dir->i_sb, &location, sub_root);
5685 inode = btrfs_iget(dir->i_sb, &location, sub_root, NULL);
5687 srcu_read_unlock(&fs_info->subvol_srcu, index);
5689 if (!IS_ERR(inode) && root != sub_root) {
5690 down_read(&fs_info->cleanup_work_sem);
5691 if (!(inode->i_sb->s_flags & MS_RDONLY))
5692 ret = btrfs_orphan_cleanup(sub_root);
5693 up_read(&fs_info->cleanup_work_sem);
5696 inode = ERR_PTR(ret);
5703 static int btrfs_dentry_delete(const struct dentry *dentry)
5705 struct btrfs_root *root;
5706 struct inode *inode = d_inode(dentry);
5708 if (!inode && !IS_ROOT(dentry))
5709 inode = d_inode(dentry->d_parent);
5712 root = BTRFS_I(inode)->root;
5713 if (btrfs_root_refs(&root->root_item) == 0)
5716 if (btrfs_ino(BTRFS_I(inode)) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)
5722 static void btrfs_dentry_release(struct dentry *dentry)
5724 kfree(dentry->d_fsdata);
5727 static struct dentry *btrfs_lookup(struct inode *dir, struct dentry *dentry,
5730 struct inode *inode;
5732 inode = btrfs_lookup_dentry(dir, dentry);
5733 if (IS_ERR(inode)) {
5734 if (PTR_ERR(inode) == -ENOENT)
5737 return ERR_CAST(inode);
5740 return d_splice_alias(inode, dentry);
5743 unsigned char btrfs_filetype_table[] = {
5744 DT_UNKNOWN, DT_REG, DT_DIR, DT_CHR, DT_BLK, DT_FIFO, DT_SOCK, DT_LNK
5747 static int btrfs_real_readdir(struct file *file, struct dir_context *ctx)
5749 struct inode *inode = file_inode(file);
5750 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
5751 struct btrfs_root *root = BTRFS_I(inode)->root;
5752 struct btrfs_item *item;
5753 struct btrfs_dir_item *di;
5754 struct btrfs_key key;
5755 struct btrfs_key found_key;
5756 struct btrfs_path *path;
5757 struct list_head ins_list;
5758 struct list_head del_list;
5760 struct extent_buffer *leaf;
5762 unsigned char d_type;
5768 struct btrfs_key location;
5770 if (!dir_emit_dots(file, ctx))
5773 path = btrfs_alloc_path();
5777 path->reada = READA_FORWARD;
5779 INIT_LIST_HEAD(&ins_list);
5780 INIT_LIST_HEAD(&del_list);
5781 put = btrfs_readdir_get_delayed_items(inode, &ins_list, &del_list);
5783 key.type = BTRFS_DIR_INDEX_KEY;
5784 key.offset = ctx->pos;
5785 key.objectid = btrfs_ino(BTRFS_I(inode));
5787 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
5792 leaf = path->nodes[0];
5793 slot = path->slots[0];
5794 if (slot >= btrfs_header_nritems(leaf)) {
5795 ret = btrfs_next_leaf(root, path);
5803 item = btrfs_item_nr(slot);
5804 btrfs_item_key_to_cpu(leaf, &found_key, slot);
5806 if (found_key.objectid != key.objectid)
5808 if (found_key.type != BTRFS_DIR_INDEX_KEY)
5810 if (found_key.offset < ctx->pos)
5812 if (btrfs_should_delete_dir_index(&del_list, found_key.offset))
5815 ctx->pos = found_key.offset;
5817 di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item);
5818 if (verify_dir_item(fs_info, leaf, di))
5821 name_len = btrfs_dir_name_len(leaf, di);
5822 if (name_len <= sizeof(tmp_name)) {
5823 name_ptr = tmp_name;
5825 name_ptr = kmalloc(name_len, GFP_KERNEL);
5831 read_extent_buffer(leaf, name_ptr, (unsigned long)(di + 1),
5834 d_type = btrfs_filetype_table[btrfs_dir_type(leaf, di)];
5835 btrfs_dir_item_key_to_cpu(leaf, di, &location);
5837 over = !dir_emit(ctx, name_ptr, name_len, location.objectid,
5840 if (name_ptr != tmp_name)
5850 ret = btrfs_readdir_delayed_dir_index(ctx, &ins_list);
5855 * Stop new entries from being returned after we return the last
5858 * New directory entries are assigned a strictly increasing
5859 * offset. This means that new entries created during readdir
5860 * are *guaranteed* to be seen in the future by that readdir.
5861 * This has broken buggy programs which operate on names as
5862 * they're returned by readdir. Until we re-use freed offsets
5863 * we have this hack to stop new entries from being returned
5864 * under the assumption that they'll never reach this huge
5867 * This is being careful not to overflow 32bit loff_t unless the
5868 * last entry requires it because doing so has broken 32bit apps
5871 if (ctx->pos >= INT_MAX)
5872 ctx->pos = LLONG_MAX;
5879 btrfs_readdir_put_delayed_items(inode, &ins_list, &del_list);
5880 btrfs_free_path(path);
5884 int btrfs_write_inode(struct inode *inode, struct writeback_control *wbc)
5886 struct btrfs_root *root = BTRFS_I(inode)->root;
5887 struct btrfs_trans_handle *trans;
5889 bool nolock = false;
5891 if (test_bit(BTRFS_INODE_DUMMY, &BTRFS_I(inode)->runtime_flags))
5894 if (btrfs_fs_closing(root->fs_info) &&
5895 btrfs_is_free_space_inode(BTRFS_I(inode)))
5898 if (wbc->sync_mode == WB_SYNC_ALL) {
5900 trans = btrfs_join_transaction_nolock(root);
5902 trans = btrfs_join_transaction(root);
5904 return PTR_ERR(trans);
5905 ret = btrfs_commit_transaction(trans);
5911 * This is somewhat expensive, updating the tree every time the
5912 * inode changes. But, it is most likely to find the inode in cache.
5913 * FIXME, needs more benchmarking...there are no reasons other than performance
5914 * to keep or drop this code.
5916 static int btrfs_dirty_inode(struct inode *inode)
5918 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
5919 struct btrfs_root *root = BTRFS_I(inode)->root;
5920 struct btrfs_trans_handle *trans;
5923 if (test_bit(BTRFS_INODE_DUMMY, &BTRFS_I(inode)->runtime_flags))
5926 trans = btrfs_join_transaction(root);
5928 return PTR_ERR(trans);
5930 ret = btrfs_update_inode(trans, root, inode);
5931 if (ret && ret == -ENOSPC) {
5932 /* whoops, lets try again with the full transaction */
5933 btrfs_end_transaction(trans);
5934 trans = btrfs_start_transaction(root, 1);
5936 return PTR_ERR(trans);
5938 ret = btrfs_update_inode(trans, root, inode);
5940 btrfs_end_transaction(trans);
5941 if (BTRFS_I(inode)->delayed_node)
5942 btrfs_balance_delayed_items(fs_info);
5948 * This is a copy of file_update_time. We need this so we can return error on
5949 * ENOSPC for updating the inode in the case of file write and mmap writes.
5951 static int btrfs_update_time(struct inode *inode, struct timespec *now,
5954 struct btrfs_root *root = BTRFS_I(inode)->root;
5956 if (btrfs_root_readonly(root))
5959 if (flags & S_VERSION)
5960 inode_inc_iversion(inode);
5961 if (flags & S_CTIME)
5962 inode->i_ctime = *now;
5963 if (flags & S_MTIME)
5964 inode->i_mtime = *now;
5965 if (flags & S_ATIME)
5966 inode->i_atime = *now;
5967 return btrfs_dirty_inode(inode);
5971 * find the highest existing sequence number in a directory
5972 * and then set the in-memory index_cnt variable to reflect
5973 * free sequence numbers
5975 static int btrfs_set_inode_index_count(struct btrfs_inode *inode)
5977 struct btrfs_root *root = inode->root;
5978 struct btrfs_key key, found_key;
5979 struct btrfs_path *path;
5980 struct extent_buffer *leaf;
5983 key.objectid = btrfs_ino(inode);
5984 key.type = BTRFS_DIR_INDEX_KEY;
5985 key.offset = (u64)-1;
5987 path = btrfs_alloc_path();
5991 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
5994 /* FIXME: we should be able to handle this */
6000 * MAGIC NUMBER EXPLANATION:
6001 * since we search a directory based on f_pos we have to start at 2
6002 * since '.' and '..' have f_pos of 0 and 1 respectively, so everybody
6003 * else has to start at 2
6005 if (path->slots[0] == 0) {
6006 inode->index_cnt = 2;
6012 leaf = path->nodes[0];
6013 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
6015 if (found_key.objectid != btrfs_ino(inode) ||
6016 found_key.type != BTRFS_DIR_INDEX_KEY) {
6017 inode->index_cnt = 2;
6021 inode->index_cnt = found_key.offset + 1;
6023 btrfs_free_path(path);
6028 * helper to find a free sequence number in a given directory. This current
6029 * code is very simple, later versions will do smarter things in the btree
6031 int btrfs_set_inode_index(struct btrfs_inode *dir, u64 *index)
6035 if (dir->index_cnt == (u64)-1) {
6036 ret = btrfs_inode_delayed_dir_index_count(dir);
6038 ret = btrfs_set_inode_index_count(dir);
6044 *index = dir->index_cnt;
6050 static int btrfs_insert_inode_locked(struct inode *inode)
6052 struct btrfs_iget_args args;
6053 args.location = &BTRFS_I(inode)->location;
6054 args.root = BTRFS_I(inode)->root;
6056 return insert_inode_locked4(inode,
6057 btrfs_inode_hash(inode->i_ino, BTRFS_I(inode)->root),
6058 btrfs_find_actor, &args);
6061 static struct inode *btrfs_new_inode(struct btrfs_trans_handle *trans,
6062 struct btrfs_root *root,
6064 const char *name, int name_len,
6065 u64 ref_objectid, u64 objectid,
6066 umode_t mode, u64 *index)
6068 struct btrfs_fs_info *fs_info = root->fs_info;
6069 struct inode *inode;
6070 struct btrfs_inode_item *inode_item;
6071 struct btrfs_key *location;
6072 struct btrfs_path *path;
6073 struct btrfs_inode_ref *ref;
6074 struct btrfs_key key[2];
6076 int nitems = name ? 2 : 1;
6080 path = btrfs_alloc_path();
6082 return ERR_PTR(-ENOMEM);
6084 inode = new_inode(fs_info->sb);
6086 btrfs_free_path(path);
6087 return ERR_PTR(-ENOMEM);
6091 * O_TMPFILE, set link count to 0, so that after this point,
6092 * we fill in an inode item with the correct link count.
6095 set_nlink(inode, 0);
6098 * we have to initialize this early, so we can reclaim the inode
6099 * number if we fail afterwards in this function.
6101 inode->i_ino = objectid;
6104 trace_btrfs_inode_request(dir);
6106 ret = btrfs_set_inode_index(BTRFS_I(dir), index);
6108 btrfs_free_path(path);
6110 return ERR_PTR(ret);
6116 * index_cnt is ignored for everything but a dir,
6117 * btrfs_get_inode_index_count has an explanation for the magic
6120 BTRFS_I(inode)->index_cnt = 2;
6121 BTRFS_I(inode)->dir_index = *index;
6122 BTRFS_I(inode)->root = root;
6123 BTRFS_I(inode)->generation = trans->transid;
6124 inode->i_generation = BTRFS_I(inode)->generation;
6127 * We could have gotten an inode number from somebody who was fsynced
6128 * and then removed in this same transaction, so let's just set full
6129 * sync since it will be a full sync anyway and this will blow away the
6130 * old info in the log.
6132 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC, &BTRFS_I(inode)->runtime_flags);
6134 key[0].objectid = objectid;
6135 key[0].type = BTRFS_INODE_ITEM_KEY;
6138 sizes[0] = sizeof(struct btrfs_inode_item);
6142 * Start new inodes with an inode_ref. This is slightly more
6143 * efficient for small numbers of hard links since they will
6144 * be packed into one item. Extended refs will kick in if we
6145 * add more hard links than can fit in the ref item.
6147 key[1].objectid = objectid;
6148 key[1].type = BTRFS_INODE_REF_KEY;
6149 key[1].offset = ref_objectid;
6151 sizes[1] = name_len + sizeof(*ref);
6154 location = &BTRFS_I(inode)->location;
6155 location->objectid = objectid;
6156 location->offset = 0;
6157 location->type = BTRFS_INODE_ITEM_KEY;
6159 ret = btrfs_insert_inode_locked(inode);
6163 path->leave_spinning = 1;
6164 ret = btrfs_insert_empty_items(trans, root, path, key, sizes, nitems);
6168 inode_init_owner(inode, dir, mode);
6169 inode_set_bytes(inode, 0);
6171 inode->i_mtime = current_time(inode);
6172 inode->i_atime = inode->i_mtime;
6173 inode->i_ctime = inode->i_mtime;
6174 BTRFS_I(inode)->i_otime = inode->i_mtime;
6176 inode_item = btrfs_item_ptr(path->nodes[0], path->slots[0],
6177 struct btrfs_inode_item);
6178 memzero_extent_buffer(path->nodes[0], (unsigned long)inode_item,
6179 sizeof(*inode_item));
6180 fill_inode_item(trans, path->nodes[0], inode_item, inode);
6183 ref = btrfs_item_ptr(path->nodes[0], path->slots[0] + 1,
6184 struct btrfs_inode_ref);
6185 btrfs_set_inode_ref_name_len(path->nodes[0], ref, name_len);
6186 btrfs_set_inode_ref_index(path->nodes[0], ref, *index);
6187 ptr = (unsigned long)(ref + 1);
6188 write_extent_buffer(path->nodes[0], name, ptr, name_len);
6191 btrfs_mark_buffer_dirty(path->nodes[0]);
6192 btrfs_free_path(path);
6194 btrfs_inherit_iflags(inode, dir);
6196 if (S_ISREG(mode)) {
6197 if (btrfs_test_opt(fs_info, NODATASUM))
6198 BTRFS_I(inode)->flags |= BTRFS_INODE_NODATASUM;
6199 if (btrfs_test_opt(fs_info, NODATACOW))
6200 BTRFS_I(inode)->flags |= BTRFS_INODE_NODATACOW |
6201 BTRFS_INODE_NODATASUM;
6204 inode_tree_add(inode);
6206 trace_btrfs_inode_new(inode);
6207 btrfs_set_inode_last_trans(trans, inode);
6209 btrfs_update_root_times(trans, root);
6211 ret = btrfs_inode_inherit_props(trans, inode, dir);
6214 "error inheriting props for ino %llu (root %llu): %d",
6215 btrfs_ino(BTRFS_I(inode)), root->root_key.objectid, ret);
6220 unlock_new_inode(inode);
6223 BTRFS_I(dir)->index_cnt--;
6224 btrfs_free_path(path);
6226 return ERR_PTR(ret);
6229 static inline u8 btrfs_inode_type(struct inode *inode)
6231 return btrfs_type_by_mode[(inode->i_mode & S_IFMT) >> S_SHIFT];
6235 * utility function to add 'inode' into 'parent_inode' with
6236 * a give name and a given sequence number.
6237 * if 'add_backref' is true, also insert a backref from the
6238 * inode to the parent directory.
6240 int btrfs_add_link(struct btrfs_trans_handle *trans,
6241 struct btrfs_inode *parent_inode, struct btrfs_inode *inode,
6242 const char *name, int name_len, int add_backref, u64 index)
6244 struct btrfs_fs_info *fs_info = btrfs_sb(inode->vfs_inode.i_sb);
6246 struct btrfs_key key;
6247 struct btrfs_root *root = parent_inode->root;
6248 u64 ino = btrfs_ino(inode);
6249 u64 parent_ino = btrfs_ino(parent_inode);
6251 if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) {
6252 memcpy(&key, &inode->root->root_key, sizeof(key));
6255 key.type = BTRFS_INODE_ITEM_KEY;
6259 if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) {
6260 ret = btrfs_add_root_ref(trans, fs_info, key.objectid,
6261 root->root_key.objectid, parent_ino,
6262 index, name, name_len);
6263 } else if (add_backref) {
6264 ret = btrfs_insert_inode_ref(trans, root, name, name_len, ino,
6268 /* Nothing to clean up yet */
6272 ret = btrfs_insert_dir_item(trans, root, name, name_len,
6274 btrfs_inode_type(&inode->vfs_inode), index);
6275 if (ret == -EEXIST || ret == -EOVERFLOW)
6278 btrfs_abort_transaction(trans, ret);
6282 btrfs_i_size_write(parent_inode, parent_inode->vfs_inode.i_size +
6284 inode_inc_iversion(&parent_inode->vfs_inode);
6285 parent_inode->vfs_inode.i_mtime = parent_inode->vfs_inode.i_ctime =
6286 current_time(&parent_inode->vfs_inode);
6287 ret = btrfs_update_inode(trans, root, &parent_inode->vfs_inode);
6289 btrfs_abort_transaction(trans, ret);
6293 if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) {
6296 err = btrfs_del_root_ref(trans, fs_info, key.objectid,
6297 root->root_key.objectid, parent_ino,
6298 &local_index, name, name_len);
6300 } else if (add_backref) {
6304 err = btrfs_del_inode_ref(trans, root, name, name_len,
6305 ino, parent_ino, &local_index);
6310 static int btrfs_add_nondir(struct btrfs_trans_handle *trans,
6311 struct btrfs_inode *dir, struct dentry *dentry,
6312 struct btrfs_inode *inode, int backref, u64 index)
6314 int err = btrfs_add_link(trans, dir, inode,
6315 dentry->d_name.name, dentry->d_name.len,
6322 static int btrfs_mknod(struct inode *dir, struct dentry *dentry,
6323 umode_t mode, dev_t rdev)
6325 struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
6326 struct btrfs_trans_handle *trans;
6327 struct btrfs_root *root = BTRFS_I(dir)->root;
6328 struct inode *inode = NULL;
6335 * 2 for inode item and ref
6337 * 1 for xattr if selinux is on
6339 trans = btrfs_start_transaction(root, 5);
6341 return PTR_ERR(trans);
6343 err = btrfs_find_free_ino(root, &objectid);
6347 inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name,
6348 dentry->d_name.len, btrfs_ino(BTRFS_I(dir)), objectid,
6350 if (IS_ERR(inode)) {
6351 err = PTR_ERR(inode);
6356 * If the active LSM wants to access the inode during
6357 * d_instantiate it needs these. Smack checks to see
6358 * if the filesystem supports xattrs by looking at the
6361 inode->i_op = &btrfs_special_inode_operations;
6362 init_special_inode(inode, inode->i_mode, rdev);
6364 err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name);
6366 goto out_unlock_inode;
6368 err = btrfs_add_nondir(trans, BTRFS_I(dir), dentry, BTRFS_I(inode),
6371 goto out_unlock_inode;
6373 btrfs_update_inode(trans, root, inode);
6374 unlock_new_inode(inode);
6375 d_instantiate(dentry, inode);
6379 btrfs_end_transaction(trans);
6380 btrfs_balance_delayed_items(fs_info);
6381 btrfs_btree_balance_dirty(fs_info);
6383 inode_dec_link_count(inode);
6390 unlock_new_inode(inode);
6395 static int btrfs_create(struct inode *dir, struct dentry *dentry,
6396 umode_t mode, bool excl)
6398 struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
6399 struct btrfs_trans_handle *trans;
6400 struct btrfs_root *root = BTRFS_I(dir)->root;
6401 struct inode *inode = NULL;
6402 int drop_inode_on_err = 0;
6408 * 2 for inode item and ref
6410 * 1 for xattr if selinux is on
6412 trans = btrfs_start_transaction(root, 5);
6414 return PTR_ERR(trans);
6416 err = btrfs_find_free_ino(root, &objectid);
6420 inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name,
6421 dentry->d_name.len, btrfs_ino(BTRFS_I(dir)), objectid,
6423 if (IS_ERR(inode)) {
6424 err = PTR_ERR(inode);
6427 drop_inode_on_err = 1;
6429 * If the active LSM wants to access the inode during
6430 * d_instantiate it needs these. Smack checks to see
6431 * if the filesystem supports xattrs by looking at the
6434 inode->i_fop = &btrfs_file_operations;
6435 inode->i_op = &btrfs_file_inode_operations;
6436 inode->i_mapping->a_ops = &btrfs_aops;
6438 err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name);
6440 goto out_unlock_inode;
6442 err = btrfs_update_inode(trans, root, inode);
6444 goto out_unlock_inode;
6446 err = btrfs_add_nondir(trans, BTRFS_I(dir), dentry, BTRFS_I(inode),
6449 goto out_unlock_inode;
6451 BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops;
6452 unlock_new_inode(inode);
6453 d_instantiate(dentry, inode);
6456 btrfs_end_transaction(trans);
6457 if (err && drop_inode_on_err) {
6458 inode_dec_link_count(inode);
6461 btrfs_balance_delayed_items(fs_info);
6462 btrfs_btree_balance_dirty(fs_info);
6466 unlock_new_inode(inode);
6471 static int btrfs_link(struct dentry *old_dentry, struct inode *dir,
6472 struct dentry *dentry)
6474 struct btrfs_trans_handle *trans = NULL;
6475 struct btrfs_root *root = BTRFS_I(dir)->root;
6476 struct inode *inode = d_inode(old_dentry);
6477 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
6482 /* do not allow sys_link's with other subvols of the same device */
6483 if (root->objectid != BTRFS_I(inode)->root->objectid)
6486 if (inode->i_nlink >= BTRFS_LINK_MAX)
6489 err = btrfs_set_inode_index(BTRFS_I(dir), &index);
6494 * 2 items for inode and inode ref
6495 * 2 items for dir items
6496 * 1 item for parent inode
6498 trans = btrfs_start_transaction(root, 5);
6499 if (IS_ERR(trans)) {
6500 err = PTR_ERR(trans);
6505 /* There are several dir indexes for this inode, clear the cache. */
6506 BTRFS_I(inode)->dir_index = 0ULL;
6508 inode_inc_iversion(inode);
6509 inode->i_ctime = current_time(inode);
6511 set_bit(BTRFS_INODE_COPY_EVERYTHING, &BTRFS_I(inode)->runtime_flags);
6513 err = btrfs_add_nondir(trans, BTRFS_I(dir), dentry, BTRFS_I(inode),
6519 struct dentry *parent = dentry->d_parent;
6520 err = btrfs_update_inode(trans, root, inode);
6523 if (inode->i_nlink == 1) {
6525 * If new hard link count is 1, it's a file created
6526 * with open(2) O_TMPFILE flag.
6528 err = btrfs_orphan_del(trans, BTRFS_I(inode));
6532 d_instantiate(dentry, inode);
6533 btrfs_log_new_name(trans, BTRFS_I(inode), NULL, parent);
6536 btrfs_balance_delayed_items(fs_info);
6539 btrfs_end_transaction(trans);
6541 inode_dec_link_count(inode);
6544 btrfs_btree_balance_dirty(fs_info);
6548 static int btrfs_mkdir(struct inode *dir, struct dentry *dentry, umode_t mode)
6550 struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
6551 struct inode *inode = NULL;
6552 struct btrfs_trans_handle *trans;
6553 struct btrfs_root *root = BTRFS_I(dir)->root;
6555 int drop_on_err = 0;
6560 * 2 items for inode and ref
6561 * 2 items for dir items
6562 * 1 for xattr if selinux is on
6564 trans = btrfs_start_transaction(root, 5);
6566 return PTR_ERR(trans);
6568 err = btrfs_find_free_ino(root, &objectid);
6572 inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name,
6573 dentry->d_name.len, btrfs_ino(BTRFS_I(dir)), objectid,
6574 S_IFDIR | mode, &index);
6575 if (IS_ERR(inode)) {
6576 err = PTR_ERR(inode);
6581 /* these must be set before we unlock the inode */
6582 inode->i_op = &btrfs_dir_inode_operations;
6583 inode->i_fop = &btrfs_dir_file_operations;
6585 err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name);
6587 goto out_fail_inode;
6589 btrfs_i_size_write(BTRFS_I(inode), 0);
6590 err = btrfs_update_inode(trans, root, inode);
6592 goto out_fail_inode;
6594 err = btrfs_add_link(trans, BTRFS_I(dir), BTRFS_I(inode),
6595 dentry->d_name.name,
6596 dentry->d_name.len, 0, index);
6598 goto out_fail_inode;
6600 d_instantiate(dentry, inode);
6602 * mkdir is special. We're unlocking after we call d_instantiate
6603 * to avoid a race with nfsd calling d_instantiate.
6605 unlock_new_inode(inode);
6609 btrfs_end_transaction(trans);
6611 inode_dec_link_count(inode);
6614 btrfs_balance_delayed_items(fs_info);
6615 btrfs_btree_balance_dirty(fs_info);
6619 unlock_new_inode(inode);
6623 /* Find next extent map of a given extent map, caller needs to ensure locks */
6624 static struct extent_map *next_extent_map(struct extent_map *em)
6626 struct rb_node *next;
6628 next = rb_next(&em->rb_node);
6631 return container_of(next, struct extent_map, rb_node);
6634 static struct extent_map *prev_extent_map(struct extent_map *em)
6636 struct rb_node *prev;
6638 prev = rb_prev(&em->rb_node);
6641 return container_of(prev, struct extent_map, rb_node);
6644 /* helper for btfs_get_extent. Given an existing extent in the tree,
6645 * the existing extent is the nearest extent to map_start,
6646 * and an extent that you want to insert, deal with overlap and insert
6647 * the best fitted new extent into the tree.
6649 static int merge_extent_mapping(struct extent_map_tree *em_tree,
6650 struct extent_map *existing,
6651 struct extent_map *em,
6654 struct extent_map *prev;
6655 struct extent_map *next;
6660 BUG_ON(map_start < em->start || map_start >= extent_map_end(em));
6662 if (existing->start > map_start) {
6664 prev = prev_extent_map(next);
6667 next = next_extent_map(prev);
6670 start = prev ? extent_map_end(prev) : em->start;
6671 start = max_t(u64, start, em->start);
6672 end = next ? next->start : extent_map_end(em);
6673 end = min_t(u64, end, extent_map_end(em));
6674 start_diff = start - em->start;
6676 em->len = end - start;
6677 if (em->block_start < EXTENT_MAP_LAST_BYTE &&
6678 !test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) {
6679 em->block_start += start_diff;
6680 em->block_len -= start_diff;
6682 return add_extent_mapping(em_tree, em, 0);
6685 static noinline int uncompress_inline(struct btrfs_path *path,
6687 size_t pg_offset, u64 extent_offset,
6688 struct btrfs_file_extent_item *item)
6691 struct extent_buffer *leaf = path->nodes[0];
6694 unsigned long inline_size;
6698 WARN_ON(pg_offset != 0);
6699 compress_type = btrfs_file_extent_compression(leaf, item);
6700 max_size = btrfs_file_extent_ram_bytes(leaf, item);
6701 inline_size = btrfs_file_extent_inline_item_len(leaf,
6702 btrfs_item_nr(path->slots[0]));
6703 tmp = kmalloc(inline_size, GFP_NOFS);
6706 ptr = btrfs_file_extent_inline_start(item);
6708 read_extent_buffer(leaf, tmp, ptr, inline_size);
6710 max_size = min_t(unsigned long, PAGE_SIZE, max_size);
6711 ret = btrfs_decompress(compress_type, tmp, page,
6712 extent_offset, inline_size, max_size);
6718 * a bit scary, this does extent mapping from logical file offset to the disk.
6719 * the ugly parts come from merging extents from the disk with the in-ram
6720 * representation. This gets more complex because of the data=ordered code,
6721 * where the in-ram extents might be locked pending data=ordered completion.
6723 * This also copies inline extents directly into the page.
6726 struct extent_map *btrfs_get_extent(struct btrfs_inode *inode,
6728 size_t pg_offset, u64 start, u64 len,
6731 struct btrfs_fs_info *fs_info = btrfs_sb(inode->vfs_inode.i_sb);
6734 u64 extent_start = 0;
6736 u64 objectid = btrfs_ino(inode);
6738 struct btrfs_path *path = NULL;
6739 struct btrfs_root *root = inode->root;
6740 struct btrfs_file_extent_item *item;
6741 struct extent_buffer *leaf;
6742 struct btrfs_key found_key;
6743 struct extent_map *em = NULL;
6744 struct extent_map_tree *em_tree = &inode->extent_tree;
6745 struct extent_io_tree *io_tree = &inode->io_tree;
6746 struct btrfs_trans_handle *trans = NULL;
6747 const bool new_inline = !page || create;
6750 read_lock(&em_tree->lock);
6751 em = lookup_extent_mapping(em_tree, start, len);
6753 em->bdev = fs_info->fs_devices->latest_bdev;
6754 read_unlock(&em_tree->lock);
6757 if (em->start > start || em->start + em->len <= start)
6758 free_extent_map(em);
6759 else if (em->block_start == EXTENT_MAP_INLINE && page)
6760 free_extent_map(em);
6764 em = alloc_extent_map();
6769 em->bdev = fs_info->fs_devices->latest_bdev;
6770 em->start = EXTENT_MAP_HOLE;
6771 em->orig_start = EXTENT_MAP_HOLE;
6773 em->block_len = (u64)-1;
6776 path = btrfs_alloc_path();
6782 * Chances are we'll be called again, so go ahead and do
6785 path->reada = READA_FORWARD;
6788 ret = btrfs_lookup_file_extent(trans, root, path,
6789 objectid, start, trans != NULL);
6796 if (path->slots[0] == 0)
6801 leaf = path->nodes[0];
6802 item = btrfs_item_ptr(leaf, path->slots[0],
6803 struct btrfs_file_extent_item);
6804 /* are we inside the extent that was found? */
6805 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
6806 found_type = found_key.type;
6807 if (found_key.objectid != objectid ||
6808 found_type != BTRFS_EXTENT_DATA_KEY) {
6810 * If we backup past the first extent we want to move forward
6811 * and see if there is an extent in front of us, otherwise we'll
6812 * say there is a hole for our whole search range which can
6819 found_type = btrfs_file_extent_type(leaf, item);
6820 extent_start = found_key.offset;
6821 if (found_type == BTRFS_FILE_EXTENT_REG ||
6822 found_type == BTRFS_FILE_EXTENT_PREALLOC) {
6823 extent_end = extent_start +
6824 btrfs_file_extent_num_bytes(leaf, item);
6825 } else if (found_type == BTRFS_FILE_EXTENT_INLINE) {
6827 size = btrfs_file_extent_inline_len(leaf, path->slots[0], item);
6828 extent_end = ALIGN(extent_start + size,
6829 fs_info->sectorsize);
6832 if (start >= extent_end) {
6834 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
6835 ret = btrfs_next_leaf(root, path);
6842 leaf = path->nodes[0];
6844 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
6845 if (found_key.objectid != objectid ||
6846 found_key.type != BTRFS_EXTENT_DATA_KEY)
6848 if (start + len <= found_key.offset)
6850 if (start > found_key.offset)
6853 em->orig_start = start;
6854 em->len = found_key.offset - start;
6858 btrfs_extent_item_to_extent_map(inode, path, item,
6861 if (found_type == BTRFS_FILE_EXTENT_REG ||
6862 found_type == BTRFS_FILE_EXTENT_PREALLOC) {
6864 } else if (found_type == BTRFS_FILE_EXTENT_INLINE) {
6868 size_t extent_offset;
6874 size = btrfs_file_extent_inline_len(leaf, path->slots[0], item);
6875 extent_offset = page_offset(page) + pg_offset - extent_start;
6876 copy_size = min_t(u64, PAGE_SIZE - pg_offset,
6877 size - extent_offset);
6878 em->start = extent_start + extent_offset;
6879 em->len = ALIGN(copy_size, fs_info->sectorsize);
6880 em->orig_block_len = em->len;
6881 em->orig_start = em->start;
6882 ptr = btrfs_file_extent_inline_start(item) + extent_offset;
6883 if (create == 0 && !PageUptodate(page)) {
6884 if (btrfs_file_extent_compression(leaf, item) !=
6885 BTRFS_COMPRESS_NONE) {
6886 ret = uncompress_inline(path, page, pg_offset,
6887 extent_offset, item);
6894 read_extent_buffer(leaf, map + pg_offset, ptr,
6896 if (pg_offset + copy_size < PAGE_SIZE) {
6897 memset(map + pg_offset + copy_size, 0,
6898 PAGE_SIZE - pg_offset -
6903 flush_dcache_page(page);
6904 } else if (create && PageUptodate(page)) {
6908 free_extent_map(em);
6911 btrfs_release_path(path);
6912 trans = btrfs_join_transaction(root);
6915 return ERR_CAST(trans);
6919 write_extent_buffer(leaf, map + pg_offset, ptr,
6922 btrfs_mark_buffer_dirty(leaf);
6924 set_extent_uptodate(io_tree, em->start,
6925 extent_map_end(em) - 1, NULL, GFP_NOFS);
6930 em->orig_start = start;
6933 em->block_start = EXTENT_MAP_HOLE;
6934 set_bit(EXTENT_FLAG_VACANCY, &em->flags);
6936 btrfs_release_path(path);
6937 if (em->start > start || extent_map_end(em) <= start) {
6939 "bad extent! em: [%llu %llu] passed [%llu %llu]",
6940 em->start, em->len, start, len);
6946 write_lock(&em_tree->lock);
6947 ret = add_extent_mapping(em_tree, em, 0);
6948 /* it is possible that someone inserted the extent into the tree
6949 * while we had the lock dropped. It is also possible that
6950 * an overlapping map exists in the tree
6952 if (ret == -EEXIST) {
6953 struct extent_map *existing;
6957 existing = search_extent_mapping(em_tree, start, len);
6959 * existing will always be non-NULL, since there must be
6960 * extent causing the -EEXIST.
6962 if (existing->start == em->start &&
6963 extent_map_end(existing) >= extent_map_end(em) &&
6964 em->block_start == existing->block_start) {
6966 * The existing extent map already encompasses the
6967 * entire extent map we tried to add.
6969 free_extent_map(em);
6973 } else if (start >= extent_map_end(existing) ||
6974 start <= existing->start) {
6976 * The existing extent map is the one nearest to
6977 * the [start, start + len) range which overlaps
6979 err = merge_extent_mapping(em_tree, existing,
6981 free_extent_map(existing);
6983 free_extent_map(em);
6987 free_extent_map(em);
6992 write_unlock(&em_tree->lock);
6995 trace_btrfs_get_extent(root, inode, em);
6997 btrfs_free_path(path);
6999 ret = btrfs_end_transaction(trans);
7004 free_extent_map(em);
7005 return ERR_PTR(err);
7007 BUG_ON(!em); /* Error is always set */
7011 struct extent_map *btrfs_get_extent_fiemap(struct btrfs_inode *inode,
7013 size_t pg_offset, u64 start, u64 len,
7016 struct extent_map *em;
7017 struct extent_map *hole_em = NULL;
7018 u64 range_start = start;
7024 em = btrfs_get_extent(inode, page, pg_offset, start, len, create);
7031 * - a pre-alloc extent,
7032 * there might actually be delalloc bytes behind it.
7034 if (em->block_start != EXTENT_MAP_HOLE &&
7035 !test_bit(EXTENT_FLAG_PREALLOC, &em->flags))
7041 /* check to see if we've wrapped (len == -1 or similar) */
7050 /* ok, we didn't find anything, lets look for delalloc */
7051 found = count_range_bits(&inode->io_tree, &range_start,
7052 end, len, EXTENT_DELALLOC, 1);
7053 found_end = range_start + found;
7054 if (found_end < range_start)
7055 found_end = (u64)-1;
7058 * we didn't find anything useful, return
7059 * the original results from get_extent()
7061 if (range_start > end || found_end <= start) {
7067 /* adjust the range_start to make sure it doesn't
7068 * go backwards from the start they passed in
7070 range_start = max(start, range_start);
7071 found = found_end - range_start;
7074 u64 hole_start = start;
7077 em = alloc_extent_map();
7083 * when btrfs_get_extent can't find anything it
7084 * returns one huge hole
7086 * make sure what it found really fits our range, and
7087 * adjust to make sure it is based on the start from
7091 u64 calc_end = extent_map_end(hole_em);
7093 if (calc_end <= start || (hole_em->start > end)) {
7094 free_extent_map(hole_em);
7097 hole_start = max(hole_em->start, start);
7098 hole_len = calc_end - hole_start;
7102 if (hole_em && range_start > hole_start) {
7103 /* our hole starts before our delalloc, so we
7104 * have to return just the parts of the hole
7105 * that go until the delalloc starts
7107 em->len = min(hole_len,
7108 range_start - hole_start);
7109 em->start = hole_start;
7110 em->orig_start = hole_start;
7112 * don't adjust block start at all,
7113 * it is fixed at EXTENT_MAP_HOLE
7115 em->block_start = hole_em->block_start;
7116 em->block_len = hole_len;
7117 if (test_bit(EXTENT_FLAG_PREALLOC, &hole_em->flags))
7118 set_bit(EXTENT_FLAG_PREALLOC, &em->flags);
7120 em->start = range_start;
7122 em->orig_start = range_start;
7123 em->block_start = EXTENT_MAP_DELALLOC;
7124 em->block_len = found;
7126 } else if (hole_em) {
7131 free_extent_map(hole_em);
7133 free_extent_map(em);
7134 return ERR_PTR(err);
7139 static struct extent_map *btrfs_create_dio_extent(struct inode *inode,
7142 const u64 orig_start,
7143 const u64 block_start,
7144 const u64 block_len,
7145 const u64 orig_block_len,
7146 const u64 ram_bytes,
7149 struct extent_map *em = NULL;
7152 if (type != BTRFS_ORDERED_NOCOW) {
7153 em = create_io_em(inode, start, len, orig_start,
7154 block_start, block_len, orig_block_len,
7156 BTRFS_COMPRESS_NONE, /* compress_type */
7161 ret = btrfs_add_ordered_extent_dio(inode, start, block_start,
7162 len, block_len, type);
7165 free_extent_map(em);
7166 btrfs_drop_extent_cache(BTRFS_I(inode), start,
7167 start + len - 1, 0);
7176 static struct extent_map *btrfs_new_extent_direct(struct inode *inode,
7179 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
7180 struct btrfs_root *root = BTRFS_I(inode)->root;
7181 struct extent_map *em;
7182 struct btrfs_key ins;
7186 alloc_hint = get_extent_allocation_hint(inode, start, len);
7187 ret = btrfs_reserve_extent(root, len, len, fs_info->sectorsize,
7188 0, alloc_hint, &ins, 1, 1);
7190 return ERR_PTR(ret);
7192 em = btrfs_create_dio_extent(inode, start, ins.offset, start,
7193 ins.objectid, ins.offset, ins.offset,
7194 ins.offset, BTRFS_ORDERED_REGULAR);
7195 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
7197 btrfs_free_reserved_extent(fs_info, ins.objectid,
7204 * returns 1 when the nocow is safe, < 1 on error, 0 if the
7205 * block must be cow'd
7207 noinline int can_nocow_extent(struct inode *inode, u64 offset, u64 *len,
7208 u64 *orig_start, u64 *orig_block_len,
7211 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
7212 struct btrfs_path *path;
7214 struct extent_buffer *leaf;
7215 struct btrfs_root *root = BTRFS_I(inode)->root;
7216 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
7217 struct btrfs_file_extent_item *fi;
7218 struct btrfs_key key;
7225 bool nocow = (BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW);
7227 path = btrfs_alloc_path();
7231 ret = btrfs_lookup_file_extent(NULL, root, path,
7232 btrfs_ino(BTRFS_I(inode)), offset, 0);
7236 slot = path->slots[0];
7239 /* can't find the item, must cow */
7246 leaf = path->nodes[0];
7247 btrfs_item_key_to_cpu(leaf, &key, slot);
7248 if (key.objectid != btrfs_ino(BTRFS_I(inode)) ||
7249 key.type != BTRFS_EXTENT_DATA_KEY) {
7250 /* not our file or wrong item type, must cow */
7254 if (key.offset > offset) {
7255 /* Wrong offset, must cow */
7259 fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item);
7260 found_type = btrfs_file_extent_type(leaf, fi);
7261 if (found_type != BTRFS_FILE_EXTENT_REG &&
7262 found_type != BTRFS_FILE_EXTENT_PREALLOC) {
7263 /* not a regular extent, must cow */
7267 if (!nocow && found_type == BTRFS_FILE_EXTENT_REG)
7270 extent_end = key.offset + btrfs_file_extent_num_bytes(leaf, fi);
7271 if (extent_end <= offset)
7274 disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
7275 if (disk_bytenr == 0)
7278 if (btrfs_file_extent_compression(leaf, fi) ||
7279 btrfs_file_extent_encryption(leaf, fi) ||
7280 btrfs_file_extent_other_encoding(leaf, fi))
7283 backref_offset = btrfs_file_extent_offset(leaf, fi);
7286 *orig_start = key.offset - backref_offset;
7287 *orig_block_len = btrfs_file_extent_disk_num_bytes(leaf, fi);
7288 *ram_bytes = btrfs_file_extent_ram_bytes(leaf, fi);
7291 if (btrfs_extent_readonly(fs_info, disk_bytenr))
7294 num_bytes = min(offset + *len, extent_end) - offset;
7295 if (!nocow && found_type == BTRFS_FILE_EXTENT_PREALLOC) {
7298 range_end = round_up(offset + num_bytes,
7299 root->fs_info->sectorsize) - 1;
7300 ret = test_range_bit(io_tree, offset, range_end,
7301 EXTENT_DELALLOC, 0, NULL);
7308 btrfs_release_path(path);
7311 * look for other files referencing this extent, if we
7312 * find any we must cow
7315 ret = btrfs_cross_ref_exist(root, btrfs_ino(BTRFS_I(inode)),
7316 key.offset - backref_offset, disk_bytenr);
7323 * adjust disk_bytenr and num_bytes to cover just the bytes
7324 * in this extent we are about to write. If there
7325 * are any csums in that range we have to cow in order
7326 * to keep the csums correct
7328 disk_bytenr += backref_offset;
7329 disk_bytenr += offset - key.offset;
7330 if (csum_exist_in_range(fs_info, disk_bytenr, num_bytes))
7333 * all of the above have passed, it is safe to overwrite this extent
7339 btrfs_free_path(path);
7343 bool btrfs_page_exists_in_range(struct inode *inode, loff_t start, loff_t end)
7345 struct radix_tree_root *root = &inode->i_mapping->page_tree;
7347 void **pagep = NULL;
7348 struct page *page = NULL;
7352 start_idx = start >> PAGE_SHIFT;
7355 * end is the last byte in the last page. end == start is legal
7357 end_idx = end >> PAGE_SHIFT;
7361 /* Most of the code in this while loop is lifted from
7362 * find_get_page. It's been modified to begin searching from a
7363 * page and return just the first page found in that range. If the
7364 * found idx is less than or equal to the end idx then we know that
7365 * a page exists. If no pages are found or if those pages are
7366 * outside of the range then we're fine (yay!) */
7367 while (page == NULL &&
7368 radix_tree_gang_lookup_slot(root, &pagep, NULL, start_idx, 1)) {
7369 page = radix_tree_deref_slot(pagep);
7370 if (unlikely(!page))
7373 if (radix_tree_exception(page)) {
7374 if (radix_tree_deref_retry(page)) {
7379 * Otherwise, shmem/tmpfs must be storing a swap entry
7380 * here as an exceptional entry: so return it without
7381 * attempting to raise page count.
7384 break; /* TODO: Is this relevant for this use case? */
7387 if (!page_cache_get_speculative(page)) {
7393 * Has the page moved?
7394 * This is part of the lockless pagecache protocol. See
7395 * include/linux/pagemap.h for details.
7397 if (unlikely(page != *pagep)) {
7404 if (page->index <= end_idx)
7413 static int lock_extent_direct(struct inode *inode, u64 lockstart, u64 lockend,
7414 struct extent_state **cached_state, int writing)
7416 struct btrfs_ordered_extent *ordered;
7420 lock_extent_bits(&BTRFS_I(inode)->io_tree, lockstart, lockend,
7423 * We're concerned with the entire range that we're going to be
7424 * doing DIO to, so we need to make sure there's no ordered
7425 * extents in this range.
7427 ordered = btrfs_lookup_ordered_range(BTRFS_I(inode), lockstart,
7428 lockend - lockstart + 1);
7431 * We need to make sure there are no buffered pages in this
7432 * range either, we could have raced between the invalidate in
7433 * generic_file_direct_write and locking the extent. The
7434 * invalidate needs to happen so that reads after a write do not
7439 !btrfs_page_exists_in_range(inode, lockstart, lockend)))
7442 unlock_extent_cached(&BTRFS_I(inode)->io_tree, lockstart, lockend,
7443 cached_state, GFP_NOFS);
7447 * If we are doing a DIO read and the ordered extent we
7448 * found is for a buffered write, we can not wait for it
7449 * to complete and retry, because if we do so we can
7450 * deadlock with concurrent buffered writes on page
7451 * locks. This happens only if our DIO read covers more
7452 * than one extent map, if at this point has already
7453 * created an ordered extent for a previous extent map
7454 * and locked its range in the inode's io tree, and a
7455 * concurrent write against that previous extent map's
7456 * range and this range started (we unlock the ranges
7457 * in the io tree only when the bios complete and
7458 * buffered writes always lock pages before attempting
7459 * to lock range in the io tree).
7462 test_bit(BTRFS_ORDERED_DIRECT, &ordered->flags))
7463 btrfs_start_ordered_extent(inode, ordered, 1);
7466 btrfs_put_ordered_extent(ordered);
7469 * We could trigger writeback for this range (and wait
7470 * for it to complete) and then invalidate the pages for
7471 * this range (through invalidate_inode_pages2_range()),
7472 * but that can lead us to a deadlock with a concurrent
7473 * call to readpages() (a buffered read or a defrag call
7474 * triggered a readahead) on a page lock due to an
7475 * ordered dio extent we created before but did not have
7476 * yet a corresponding bio submitted (whence it can not
7477 * complete), which makes readpages() wait for that
7478 * ordered extent to complete while holding a lock on
7493 /* The callers of this must take lock_extent() */
7494 static struct extent_map *create_io_em(struct inode *inode, u64 start, u64 len,
7495 u64 orig_start, u64 block_start,
7496 u64 block_len, u64 orig_block_len,
7497 u64 ram_bytes, int compress_type,
7500 struct extent_map_tree *em_tree;
7501 struct extent_map *em;
7502 struct btrfs_root *root = BTRFS_I(inode)->root;
7505 ASSERT(type == BTRFS_ORDERED_PREALLOC ||
7506 type == BTRFS_ORDERED_COMPRESSED ||
7507 type == BTRFS_ORDERED_NOCOW ||
7508 type == BTRFS_ORDERED_REGULAR);
7510 em_tree = &BTRFS_I(inode)->extent_tree;
7511 em = alloc_extent_map();
7513 return ERR_PTR(-ENOMEM);
7516 em->orig_start = orig_start;
7518 em->block_len = block_len;
7519 em->block_start = block_start;
7520 em->bdev = root->fs_info->fs_devices->latest_bdev;
7521 em->orig_block_len = orig_block_len;
7522 em->ram_bytes = ram_bytes;
7523 em->generation = -1;
7524 set_bit(EXTENT_FLAG_PINNED, &em->flags);
7525 if (type == BTRFS_ORDERED_PREALLOC) {
7526 set_bit(EXTENT_FLAG_FILLING, &em->flags);
7527 } else if (type == BTRFS_ORDERED_COMPRESSED) {
7528 set_bit(EXTENT_FLAG_COMPRESSED, &em->flags);
7529 em->compress_type = compress_type;
7533 btrfs_drop_extent_cache(BTRFS_I(inode), em->start,
7534 em->start + em->len - 1, 0);
7535 write_lock(&em_tree->lock);
7536 ret = add_extent_mapping(em_tree, em, 1);
7537 write_unlock(&em_tree->lock);
7539 * The caller has taken lock_extent(), who could race with us
7542 } while (ret == -EEXIST);
7545 free_extent_map(em);
7546 return ERR_PTR(ret);
7549 /* em got 2 refs now, callers needs to do free_extent_map once. */
7553 static void adjust_dio_outstanding_extents(struct inode *inode,
7554 struct btrfs_dio_data *dio_data,
7557 unsigned num_extents = count_max_extents(len);
7560 * If we have an outstanding_extents count still set then we're
7561 * within our reservation, otherwise we need to adjust our inode
7562 * counter appropriately.
7564 if (dio_data->outstanding_extents >= num_extents) {
7565 dio_data->outstanding_extents -= num_extents;
7568 * If dio write length has been split due to no large enough
7569 * contiguous space, we need to compensate our inode counter
7572 u64 num_needed = num_extents - dio_data->outstanding_extents;
7574 spin_lock(&BTRFS_I(inode)->lock);
7575 BTRFS_I(inode)->outstanding_extents += num_needed;
7576 spin_unlock(&BTRFS_I(inode)->lock);
7580 static int btrfs_get_blocks_direct(struct inode *inode, sector_t iblock,
7581 struct buffer_head *bh_result, int create)
7583 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
7584 struct extent_map *em;
7585 struct extent_state *cached_state = NULL;
7586 struct btrfs_dio_data *dio_data = NULL;
7587 u64 start = iblock << inode->i_blkbits;
7588 u64 lockstart, lockend;
7589 u64 len = bh_result->b_size;
7590 int unlock_bits = EXTENT_LOCKED;
7594 unlock_bits |= EXTENT_DIRTY;
7596 len = min_t(u64, len, fs_info->sectorsize);
7599 lockend = start + len - 1;
7601 if (current->journal_info) {
7603 * Need to pull our outstanding extents and set journal_info to NULL so
7604 * that anything that needs to check if there's a transaction doesn't get
7607 dio_data = current->journal_info;
7608 current->journal_info = NULL;
7612 * If this errors out it's because we couldn't invalidate pagecache for
7613 * this range and we need to fallback to buffered.
7615 if (lock_extent_direct(inode, lockstart, lockend, &cached_state,
7621 em = btrfs_get_extent(BTRFS_I(inode), NULL, 0, start, len, 0);
7628 * Ok for INLINE and COMPRESSED extents we need to fallback on buffered
7629 * io. INLINE is special, and we could probably kludge it in here, but
7630 * it's still buffered so for safety lets just fall back to the generic
7633 * For COMPRESSED we _have_ to read the entire extent in so we can
7634 * decompress it, so there will be buffering required no matter what we
7635 * do, so go ahead and fallback to buffered.
7637 * We return -ENOTBLK because that's what makes DIO go ahead and go back
7638 * to buffered IO. Don't blame me, this is the price we pay for using
7641 if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags) ||
7642 em->block_start == EXTENT_MAP_INLINE) {
7643 free_extent_map(em);
7648 /* Just a good old fashioned hole, return */
7649 if (!create && (em->block_start == EXTENT_MAP_HOLE ||
7650 test_bit(EXTENT_FLAG_PREALLOC, &em->flags))) {
7651 free_extent_map(em);
7656 * We don't allocate a new extent in the following cases
7658 * 1) The inode is marked as NODATACOW. In this case we'll just use the
7660 * 2) The extent is marked as PREALLOC. We're good to go here and can
7661 * just use the extent.
7665 len = min(len, em->len - (start - em->start));
7666 lockstart = start + len;
7670 if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags) ||
7671 ((BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW) &&
7672 em->block_start != EXTENT_MAP_HOLE)) {
7674 u64 block_start, orig_start, orig_block_len, ram_bytes;
7676 if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags))
7677 type = BTRFS_ORDERED_PREALLOC;
7679 type = BTRFS_ORDERED_NOCOW;
7680 len = min(len, em->len - (start - em->start));
7681 block_start = em->block_start + (start - em->start);
7683 if (can_nocow_extent(inode, start, &len, &orig_start,
7684 &orig_block_len, &ram_bytes) == 1 &&
7685 btrfs_inc_nocow_writers(fs_info, block_start)) {
7686 struct extent_map *em2;
7688 em2 = btrfs_create_dio_extent(inode, start, len,
7689 orig_start, block_start,
7690 len, orig_block_len,
7692 btrfs_dec_nocow_writers(fs_info, block_start);
7693 if (type == BTRFS_ORDERED_PREALLOC) {
7694 free_extent_map(em);
7697 if (em2 && IS_ERR(em2)) {
7702 * For inode marked NODATACOW or extent marked PREALLOC,
7703 * use the existing or preallocated extent, so does not
7704 * need to adjust btrfs_space_info's bytes_may_use.
7706 btrfs_free_reserved_data_space_noquota(inode,
7713 * this will cow the extent, reset the len in case we changed
7716 len = bh_result->b_size;
7717 free_extent_map(em);
7718 em = btrfs_new_extent_direct(inode, start, len);
7723 len = min(len, em->len - (start - em->start));
7725 bh_result->b_blocknr = (em->block_start + (start - em->start)) >>
7727 bh_result->b_size = len;
7728 bh_result->b_bdev = em->bdev;
7729 set_buffer_mapped(bh_result);
7731 if (!test_bit(EXTENT_FLAG_PREALLOC, &em->flags))
7732 set_buffer_new(bh_result);
7735 * Need to update the i_size under the extent lock so buffered
7736 * readers will get the updated i_size when we unlock.
7738 if (!dio_data->overwrite && start + len > i_size_read(inode))
7739 i_size_write(inode, start + len);
7741 adjust_dio_outstanding_extents(inode, dio_data, len);
7742 WARN_ON(dio_data->reserve < len);
7743 dio_data->reserve -= len;
7744 dio_data->unsubmitted_oe_range_end = start + len;
7745 current->journal_info = dio_data;
7749 * In the case of write we need to clear and unlock the entire range,
7750 * in the case of read we need to unlock only the end area that we
7751 * aren't using if there is any left over space.
7753 if (lockstart < lockend) {
7754 clear_extent_bit(&BTRFS_I(inode)->io_tree, lockstart,
7755 lockend, unlock_bits, 1, 0,
7756 &cached_state, GFP_NOFS);
7758 free_extent_state(cached_state);
7761 free_extent_map(em);
7766 clear_extent_bit(&BTRFS_I(inode)->io_tree, lockstart, lockend,
7767 unlock_bits, 1, 0, &cached_state, GFP_NOFS);
7770 current->journal_info = dio_data;
7772 * Compensate the delalloc release we do in btrfs_direct_IO() when we
7773 * write less data then expected, so that we don't underflow our inode's
7774 * outstanding extents counter.
7776 if (create && dio_data)
7777 adjust_dio_outstanding_extents(inode, dio_data, len);
7782 static inline int submit_dio_repair_bio(struct inode *inode, struct bio *bio,
7785 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
7788 BUG_ON(bio_op(bio) == REQ_OP_WRITE);
7792 ret = btrfs_bio_wq_end_io(fs_info, bio, BTRFS_WQ_ENDIO_DIO_REPAIR);
7796 ret = btrfs_map_bio(fs_info, bio, mirror_num, 0);
7802 static int btrfs_check_dio_repairable(struct inode *inode,
7803 struct bio *failed_bio,
7804 struct io_failure_record *failrec,
7807 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
7810 num_copies = btrfs_num_copies(fs_info, failrec->logical, failrec->len);
7811 if (num_copies == 1) {
7813 * we only have a single copy of the data, so don't bother with
7814 * all the retry and error correction code that follows. no
7815 * matter what the error is, it is very likely to persist.
7817 btrfs_debug(fs_info,
7818 "Check DIO Repairable: cannot repair, num_copies=%d, next_mirror %d, failed_mirror %d",
7819 num_copies, failrec->this_mirror, failed_mirror);
7823 failrec->failed_mirror = failed_mirror;
7824 failrec->this_mirror++;
7825 if (failrec->this_mirror == failed_mirror)
7826 failrec->this_mirror++;
7828 if (failrec->this_mirror > num_copies) {
7829 btrfs_debug(fs_info,
7830 "Check DIO Repairable: (fail) num_copies=%d, next_mirror %d, failed_mirror %d",
7831 num_copies, failrec->this_mirror, failed_mirror);
7838 static int dio_read_error(struct inode *inode, struct bio *failed_bio,
7839 struct page *page, unsigned int pgoff,
7840 u64 start, u64 end, int failed_mirror,
7841 bio_end_io_t *repair_endio, void *repair_arg)
7843 struct io_failure_record *failrec;
7849 BUG_ON(bio_op(failed_bio) == REQ_OP_WRITE);
7851 ret = btrfs_get_io_failure_record(inode, start, end, &failrec);
7855 ret = btrfs_check_dio_repairable(inode, failed_bio, failrec,
7858 free_io_failure(BTRFS_I(inode), failrec);
7862 if ((failed_bio->bi_vcnt > 1)
7863 || (failed_bio->bi_io_vec->bv_len
7864 > btrfs_inode_sectorsize(inode)))
7865 read_mode |= REQ_FAILFAST_DEV;
7867 isector = start - btrfs_io_bio(failed_bio)->logical;
7868 isector >>= inode->i_sb->s_blocksize_bits;
7869 bio = btrfs_create_repair_bio(inode, failed_bio, failrec, page,
7870 pgoff, isector, repair_endio, repair_arg);
7872 free_io_failure(BTRFS_I(inode), failrec);
7875 bio_set_op_attrs(bio, REQ_OP_READ, read_mode);
7877 btrfs_debug(BTRFS_I(inode)->root->fs_info,
7878 "Repair DIO Read Error: submitting new dio read[%#x] to this_mirror=%d, in_validation=%d\n",
7879 read_mode, failrec->this_mirror, failrec->in_validation);
7881 ret = submit_dio_repair_bio(inode, bio, failrec->this_mirror);
7883 free_io_failure(BTRFS_I(inode), failrec);
7890 struct btrfs_retry_complete {
7891 struct completion done;
7892 struct inode *inode;
7897 static void btrfs_retry_endio_nocsum(struct bio *bio)
7899 struct btrfs_retry_complete *done = bio->bi_private;
7900 struct inode *inode;
7901 struct bio_vec *bvec;
7907 ASSERT(bio->bi_vcnt == 1);
7908 inode = bio->bi_io_vec->bv_page->mapping->host;
7909 ASSERT(bio->bi_io_vec->bv_len == btrfs_inode_sectorsize(inode));
7912 bio_for_each_segment_all(bvec, bio, i)
7913 clean_io_failure(BTRFS_I(done->inode), done->start, bvec->bv_page, 0);
7915 complete(&done->done);
7919 static int __btrfs_correct_data_nocsum(struct inode *inode,
7920 struct btrfs_io_bio *io_bio)
7922 struct btrfs_fs_info *fs_info;
7923 struct bio_vec *bvec;
7924 struct btrfs_retry_complete done;
7932 fs_info = BTRFS_I(inode)->root->fs_info;
7933 sectorsize = fs_info->sectorsize;
7935 start = io_bio->logical;
7938 bio_for_each_segment_all(bvec, &io_bio->bio, i) {
7939 nr_sectors = BTRFS_BYTES_TO_BLKS(fs_info, bvec->bv_len);
7940 pgoff = bvec->bv_offset;
7942 next_block_or_try_again:
7945 init_completion(&done.done);
7947 ret = dio_read_error(inode, &io_bio->bio, bvec->bv_page,
7948 pgoff, start, start + sectorsize - 1,
7950 btrfs_retry_endio_nocsum, &done);
7954 wait_for_completion(&done.done);
7956 if (!done.uptodate) {
7957 /* We might have another mirror, so try again */
7958 goto next_block_or_try_again;
7961 start += sectorsize;
7964 pgoff += sectorsize;
7965 goto next_block_or_try_again;
7972 static void btrfs_retry_endio(struct bio *bio)
7974 struct btrfs_retry_complete *done = bio->bi_private;
7975 struct btrfs_io_bio *io_bio = btrfs_io_bio(bio);
7976 struct inode *inode;
7977 struct bio_vec *bvec;
7988 start = done->start;
7990 ASSERT(bio->bi_vcnt == 1);
7991 inode = bio->bi_io_vec->bv_page->mapping->host;
7992 ASSERT(bio->bi_io_vec->bv_len == btrfs_inode_sectorsize(inode));
7994 bio_for_each_segment_all(bvec, bio, i) {
7995 ret = __readpage_endio_check(done->inode, io_bio, i,
7996 bvec->bv_page, bvec->bv_offset,
7997 done->start, bvec->bv_len);
7999 clean_io_failure(BTRFS_I(done->inode), done->start,
8000 bvec->bv_page, bvec->bv_offset);
8005 done->uptodate = uptodate;
8007 complete(&done->done);
8011 static int __btrfs_subio_endio_read(struct inode *inode,
8012 struct btrfs_io_bio *io_bio, int err)
8014 struct btrfs_fs_info *fs_info;
8015 struct bio_vec *bvec;
8016 struct btrfs_retry_complete done;
8026 fs_info = BTRFS_I(inode)->root->fs_info;
8027 sectorsize = fs_info->sectorsize;
8030 start = io_bio->logical;
8033 bio_for_each_segment_all(bvec, &io_bio->bio, i) {
8034 nr_sectors = BTRFS_BYTES_TO_BLKS(fs_info, bvec->bv_len);
8036 pgoff = bvec->bv_offset;
8038 csum_pos = BTRFS_BYTES_TO_BLKS(fs_info, offset);
8039 ret = __readpage_endio_check(inode, io_bio, csum_pos,
8040 bvec->bv_page, pgoff, start,
8047 init_completion(&done.done);
8049 ret = dio_read_error(inode, &io_bio->bio, bvec->bv_page,
8050 pgoff, start, start + sectorsize - 1,
8052 btrfs_retry_endio, &done);
8058 wait_for_completion(&done.done);
8060 if (!done.uptodate) {
8061 /* We might have another mirror, so try again */
8065 offset += sectorsize;
8066 start += sectorsize;
8071 pgoff += sectorsize;
8079 static int btrfs_subio_endio_read(struct inode *inode,
8080 struct btrfs_io_bio *io_bio, int err)
8082 bool skip_csum = BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM;
8086 return __btrfs_correct_data_nocsum(inode, io_bio);
8090 return __btrfs_subio_endio_read(inode, io_bio, err);
8094 static void btrfs_endio_direct_read(struct bio *bio)
8096 struct btrfs_dio_private *dip = bio->bi_private;
8097 struct inode *inode = dip->inode;
8098 struct bio *dio_bio;
8099 struct btrfs_io_bio *io_bio = btrfs_io_bio(bio);
8100 int err = bio->bi_error;
8102 if (dip->flags & BTRFS_DIO_ORIG_BIO_SUBMITTED)
8103 err = btrfs_subio_endio_read(inode, io_bio, err);
8105 unlock_extent(&BTRFS_I(inode)->io_tree, dip->logical_offset,
8106 dip->logical_offset + dip->bytes - 1);
8107 dio_bio = dip->dio_bio;
8111 dio_bio->bi_error = bio->bi_error;
8112 dio_end_io(dio_bio, bio->bi_error);
8115 io_bio->end_io(io_bio, err);
8119 static void btrfs_endio_direct_write_update_ordered(struct inode *inode,
8124 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
8125 struct btrfs_ordered_extent *ordered = NULL;
8126 u64 ordered_offset = offset;
8127 u64 ordered_bytes = bytes;
8131 ret = btrfs_dec_test_first_ordered_pending(inode, &ordered,
8138 btrfs_init_work(&ordered->work, btrfs_endio_write_helper,
8139 finish_ordered_fn, NULL, NULL);
8140 btrfs_queue_work(fs_info->endio_write_workers, &ordered->work);
8143 * our bio might span multiple ordered extents. If we haven't
8144 * completed the accounting for the whole dio, go back and try again
8146 if (ordered_offset < offset + bytes) {
8147 ordered_bytes = offset + bytes - ordered_offset;
8153 static void btrfs_endio_direct_write(struct bio *bio)
8155 struct btrfs_dio_private *dip = bio->bi_private;
8156 struct bio *dio_bio = dip->dio_bio;
8158 btrfs_endio_direct_write_update_ordered(dip->inode,
8159 dip->logical_offset,
8165 dio_bio->bi_error = bio->bi_error;
8166 dio_end_io(dio_bio, bio->bi_error);
8170 static int __btrfs_submit_bio_start_direct_io(struct inode *inode,
8171 struct bio *bio, int mirror_num,
8172 unsigned long bio_flags, u64 offset)
8175 ret = btrfs_csum_one_bio(inode, bio, offset, 1);
8176 BUG_ON(ret); /* -ENOMEM */
8180 static void btrfs_end_dio_bio(struct bio *bio)
8182 struct btrfs_dio_private *dip = bio->bi_private;
8183 int err = bio->bi_error;
8186 btrfs_warn(BTRFS_I(dip->inode)->root->fs_info,
8187 "direct IO failed ino %llu rw %d,%u sector %#Lx len %u err no %d",
8188 btrfs_ino(BTRFS_I(dip->inode)), bio_op(bio),
8190 (unsigned long long)bio->bi_iter.bi_sector,
8191 bio->bi_iter.bi_size, err);
8193 if (dip->subio_endio)
8194 err = dip->subio_endio(dip->inode, btrfs_io_bio(bio), err);
8200 * before atomic variable goto zero, we must make sure
8201 * dip->errors is perceived to be set.
8203 smp_mb__before_atomic();
8206 /* if there are more bios still pending for this dio, just exit */
8207 if (!atomic_dec_and_test(&dip->pending_bios))
8211 bio_io_error(dip->orig_bio);
8213 dip->dio_bio->bi_error = 0;
8214 bio_endio(dip->orig_bio);
8220 static struct bio *btrfs_dio_bio_alloc(struct block_device *bdev,
8221 u64 first_sector, gfp_t gfp_flags)
8224 bio = btrfs_bio_alloc(bdev, first_sector, BIO_MAX_PAGES, gfp_flags);
8226 bio_associate_current(bio);
8230 static inline int btrfs_lookup_and_bind_dio_csum(struct inode *inode,
8231 struct btrfs_dio_private *dip,
8235 struct btrfs_io_bio *io_bio = btrfs_io_bio(bio);
8236 struct btrfs_io_bio *orig_io_bio = btrfs_io_bio(dip->orig_bio);
8240 * We load all the csum data we need when we submit
8241 * the first bio to reduce the csum tree search and
8244 if (dip->logical_offset == file_offset) {
8245 ret = btrfs_lookup_bio_sums_dio(inode, dip->orig_bio,
8251 if (bio == dip->orig_bio)
8254 file_offset -= dip->logical_offset;
8255 file_offset >>= inode->i_sb->s_blocksize_bits;
8256 io_bio->csum = (u8 *)(((u32 *)orig_io_bio->csum) + file_offset);
8261 static inline int __btrfs_submit_dio_bio(struct bio *bio, struct inode *inode,
8262 u64 file_offset, int skip_sum,
8265 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
8266 struct btrfs_dio_private *dip = bio->bi_private;
8267 bool write = bio_op(bio) == REQ_OP_WRITE;
8271 async_submit = !atomic_read(&BTRFS_I(inode)->sync_writers);
8276 ret = btrfs_bio_wq_end_io(fs_info, bio, BTRFS_WQ_ENDIO_DATA);
8284 if (write && async_submit) {
8285 ret = btrfs_wq_submit_bio(fs_info, inode, bio, 0, 0,
8287 __btrfs_submit_bio_start_direct_io,
8288 __btrfs_submit_bio_done);
8292 * If we aren't doing async submit, calculate the csum of the
8295 ret = btrfs_csum_one_bio(inode, bio, file_offset, 1);
8299 ret = btrfs_lookup_and_bind_dio_csum(inode, dip, bio,
8305 ret = btrfs_map_bio(fs_info, bio, 0, async_submit);
8311 static int btrfs_submit_direct_hook(struct btrfs_dio_private *dip,
8314 struct inode *inode = dip->inode;
8315 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
8316 struct btrfs_root *root = BTRFS_I(inode)->root;
8318 struct bio *orig_bio = dip->orig_bio;
8319 struct bio_vec *bvec;
8320 u64 start_sector = orig_bio->bi_iter.bi_sector;
8321 u64 file_offset = dip->logical_offset;
8324 u32 blocksize = fs_info->sectorsize;
8325 int async_submit = 0;
8330 map_length = orig_bio->bi_iter.bi_size;
8331 ret = btrfs_map_block(fs_info, btrfs_op(orig_bio), start_sector << 9,
8332 &map_length, NULL, 0);
8336 if (map_length >= orig_bio->bi_iter.bi_size) {
8338 dip->flags |= BTRFS_DIO_ORIG_BIO_SUBMITTED;
8342 /* async crcs make it difficult to collect full stripe writes. */
8343 if (btrfs_get_alloc_profile(root, 1) & BTRFS_BLOCK_GROUP_RAID56_MASK)
8348 bio = btrfs_dio_bio_alloc(orig_bio->bi_bdev, start_sector, GFP_NOFS);
8352 bio->bi_opf = orig_bio->bi_opf;
8353 bio->bi_private = dip;
8354 bio->bi_end_io = btrfs_end_dio_bio;
8355 btrfs_io_bio(bio)->logical = file_offset;
8356 atomic_inc(&dip->pending_bios);
8358 bio_for_each_segment_all(bvec, orig_bio, j) {
8359 nr_sectors = BTRFS_BYTES_TO_BLKS(fs_info, bvec->bv_len);
8362 if (unlikely(map_length < submit_len + blocksize ||
8363 bio_add_page(bio, bvec->bv_page, blocksize,
8364 bvec->bv_offset + (i * blocksize)) < blocksize)) {
8366 * inc the count before we submit the bio so
8367 * we know the end IO handler won't happen before
8368 * we inc the count. Otherwise, the dip might get freed
8369 * before we're done setting it up
8371 atomic_inc(&dip->pending_bios);
8372 ret = __btrfs_submit_dio_bio(bio, inode,
8373 file_offset, skip_sum,
8377 atomic_dec(&dip->pending_bios);
8381 start_sector += submit_len >> 9;
8382 file_offset += submit_len;
8386 bio = btrfs_dio_bio_alloc(orig_bio->bi_bdev,
8387 start_sector, GFP_NOFS);
8390 bio->bi_opf = orig_bio->bi_opf;
8391 bio->bi_private = dip;
8392 bio->bi_end_io = btrfs_end_dio_bio;
8393 btrfs_io_bio(bio)->logical = file_offset;
8395 map_length = orig_bio->bi_iter.bi_size;
8396 ret = btrfs_map_block(fs_info, btrfs_op(orig_bio),
8398 &map_length, NULL, 0);
8406 submit_len += blocksize;
8415 ret = __btrfs_submit_dio_bio(bio, inode, file_offset, skip_sum,
8424 * before atomic variable goto zero, we must
8425 * make sure dip->errors is perceived to be set.
8427 smp_mb__before_atomic();
8428 if (atomic_dec_and_test(&dip->pending_bios))
8429 bio_io_error(dip->orig_bio);
8431 /* bio_end_io() will handle error, so we needn't return it */
8435 static void btrfs_submit_direct(struct bio *dio_bio, struct inode *inode,
8438 struct btrfs_dio_private *dip = NULL;
8439 struct bio *io_bio = NULL;
8440 struct btrfs_io_bio *btrfs_bio;
8442 bool write = (bio_op(dio_bio) == REQ_OP_WRITE);
8445 skip_sum = BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM;
8447 io_bio = btrfs_bio_clone(dio_bio, GFP_NOFS);
8453 dip = kzalloc(sizeof(*dip), GFP_NOFS);
8459 dip->private = dio_bio->bi_private;
8461 dip->logical_offset = file_offset;
8462 dip->bytes = dio_bio->bi_iter.bi_size;
8463 dip->disk_bytenr = (u64)dio_bio->bi_iter.bi_sector << 9;
8464 io_bio->bi_private = dip;
8465 dip->orig_bio = io_bio;
8466 dip->dio_bio = dio_bio;
8467 atomic_set(&dip->pending_bios, 0);
8468 btrfs_bio = btrfs_io_bio(io_bio);
8469 btrfs_bio->logical = file_offset;
8472 io_bio->bi_end_io = btrfs_endio_direct_write;
8474 io_bio->bi_end_io = btrfs_endio_direct_read;
8475 dip->subio_endio = btrfs_subio_endio_read;
8479 * Reset the range for unsubmitted ordered extents (to a 0 length range)
8480 * even if we fail to submit a bio, because in such case we do the
8481 * corresponding error handling below and it must not be done a second
8482 * time by btrfs_direct_IO().
8485 struct btrfs_dio_data *dio_data = current->journal_info;
8487 dio_data->unsubmitted_oe_range_end = dip->logical_offset +
8489 dio_data->unsubmitted_oe_range_start =
8490 dio_data->unsubmitted_oe_range_end;
8493 ret = btrfs_submit_direct_hook(dip, skip_sum);
8497 if (btrfs_bio->end_io)
8498 btrfs_bio->end_io(btrfs_bio, ret);
8502 * If we arrived here it means either we failed to submit the dip
8503 * or we either failed to clone the dio_bio or failed to allocate the
8504 * dip. If we cloned the dio_bio and allocated the dip, we can just
8505 * call bio_endio against our io_bio so that we get proper resource
8506 * cleanup if we fail to submit the dip, otherwise, we must do the
8507 * same as btrfs_endio_direct_[write|read] because we can't call these
8508 * callbacks - they require an allocated dip and a clone of dio_bio.
8510 if (io_bio && dip) {
8511 io_bio->bi_error = -EIO;
8514 * The end io callbacks free our dip, do the final put on io_bio
8515 * and all the cleanup and final put for dio_bio (through
8522 btrfs_endio_direct_write_update_ordered(inode,
8524 dio_bio->bi_iter.bi_size,
8527 unlock_extent(&BTRFS_I(inode)->io_tree, file_offset,
8528 file_offset + dio_bio->bi_iter.bi_size - 1);
8530 dio_bio->bi_error = -EIO;
8532 * Releases and cleans up our dio_bio, no need to bio_put()
8533 * nor bio_endio()/bio_io_error() against dio_bio.
8535 dio_end_io(dio_bio, ret);
8542 static ssize_t check_direct_IO(struct btrfs_fs_info *fs_info,
8544 const struct iov_iter *iter, loff_t offset)
8548 unsigned int blocksize_mask = fs_info->sectorsize - 1;
8549 ssize_t retval = -EINVAL;
8551 if (offset & blocksize_mask)
8554 if (iov_iter_alignment(iter) & blocksize_mask)
8557 /* If this is a write we don't need to check anymore */
8558 if (iov_iter_rw(iter) != READ || !iter_is_iovec(iter))
8561 * Check to make sure we don't have duplicate iov_base's in this
8562 * iovec, if so return EINVAL, otherwise we'll get csum errors
8563 * when reading back.
8565 for (seg = 0; seg < iter->nr_segs; seg++) {
8566 for (i = seg + 1; i < iter->nr_segs; i++) {
8567 if (iter->iov[seg].iov_base == iter->iov[i].iov_base)
8576 static ssize_t btrfs_direct_IO(struct kiocb *iocb, struct iov_iter *iter)
8578 struct file *file = iocb->ki_filp;
8579 struct inode *inode = file->f_mapping->host;
8580 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
8581 struct btrfs_dio_data dio_data = { 0 };
8582 loff_t offset = iocb->ki_pos;
8586 bool relock = false;
8589 if (check_direct_IO(fs_info, iocb, iter, offset))
8592 inode_dio_begin(inode);
8593 smp_mb__after_atomic();
8596 * The generic stuff only does filemap_write_and_wait_range, which
8597 * isn't enough if we've written compressed pages to this area, so
8598 * we need to flush the dirty pages again to make absolutely sure
8599 * that any outstanding dirty pages are on disk.
8601 count = iov_iter_count(iter);
8602 if (test_bit(BTRFS_INODE_HAS_ASYNC_EXTENT,
8603 &BTRFS_I(inode)->runtime_flags))
8604 filemap_fdatawrite_range(inode->i_mapping, offset,
8605 offset + count - 1);
8607 if (iov_iter_rw(iter) == WRITE) {
8609 * If the write DIO is beyond the EOF, we need update
8610 * the isize, but it is protected by i_mutex. So we can
8611 * not unlock the i_mutex at this case.
8613 if (offset + count <= inode->i_size) {
8614 dio_data.overwrite = 1;
8615 inode_unlock(inode);
8618 ret = btrfs_delalloc_reserve_space(inode, offset, count);
8621 dio_data.outstanding_extents = count_max_extents(count);
8624 * We need to know how many extents we reserved so that we can
8625 * do the accounting properly if we go over the number we
8626 * originally calculated. Abuse current->journal_info for this.
8628 dio_data.reserve = round_up(count,
8629 fs_info->sectorsize);
8630 dio_data.unsubmitted_oe_range_start = (u64)offset;
8631 dio_data.unsubmitted_oe_range_end = (u64)offset;
8632 current->journal_info = &dio_data;
8633 down_read(&BTRFS_I(inode)->dio_sem);
8634 } else if (test_bit(BTRFS_INODE_READDIO_NEED_LOCK,
8635 &BTRFS_I(inode)->runtime_flags)) {
8636 inode_dio_end(inode);
8637 flags = DIO_LOCKING | DIO_SKIP_HOLES;
8641 ret = __blockdev_direct_IO(iocb, inode,
8642 fs_info->fs_devices->latest_bdev,
8643 iter, btrfs_get_blocks_direct, NULL,
8644 btrfs_submit_direct, flags);
8645 if (iov_iter_rw(iter) == WRITE) {
8646 up_read(&BTRFS_I(inode)->dio_sem);
8647 current->journal_info = NULL;
8648 if (ret < 0 && ret != -EIOCBQUEUED) {
8649 if (dio_data.reserve)
8650 btrfs_delalloc_release_space(inode, offset,
8653 * On error we might have left some ordered extents
8654 * without submitting corresponding bios for them, so
8655 * cleanup them up to avoid other tasks getting them
8656 * and waiting for them to complete forever.
8658 if (dio_data.unsubmitted_oe_range_start <
8659 dio_data.unsubmitted_oe_range_end)
8660 btrfs_endio_direct_write_update_ordered(inode,
8661 dio_data.unsubmitted_oe_range_start,
8662 dio_data.unsubmitted_oe_range_end -
8663 dio_data.unsubmitted_oe_range_start,
8665 } else if (ret >= 0 && (size_t)ret < count)
8666 btrfs_delalloc_release_space(inode, offset,
8667 count - (size_t)ret);
8671 inode_dio_end(inode);
8678 #define BTRFS_FIEMAP_FLAGS (FIEMAP_FLAG_SYNC)
8680 static int btrfs_fiemap(struct inode *inode, struct fiemap_extent_info *fieinfo,
8681 __u64 start, __u64 len)
8685 ret = fiemap_check_flags(fieinfo, BTRFS_FIEMAP_FLAGS);
8689 return extent_fiemap(inode, fieinfo, start, len, btrfs_get_extent_fiemap);
8692 int btrfs_readpage(struct file *file, struct page *page)
8694 struct extent_io_tree *tree;
8695 tree = &BTRFS_I(page->mapping->host)->io_tree;
8696 return extent_read_full_page(tree, page, btrfs_get_extent, 0);
8699 static int btrfs_writepage(struct page *page, struct writeback_control *wbc)
8701 struct extent_io_tree *tree;
8702 struct inode *inode = page->mapping->host;
8705 if (current->flags & PF_MEMALLOC) {
8706 redirty_page_for_writepage(wbc, page);
8712 * If we are under memory pressure we will call this directly from the
8713 * VM, we need to make sure we have the inode referenced for the ordered
8714 * extent. If not just return like we didn't do anything.
8716 if (!igrab(inode)) {
8717 redirty_page_for_writepage(wbc, page);
8718 return AOP_WRITEPAGE_ACTIVATE;
8720 tree = &BTRFS_I(page->mapping->host)->io_tree;
8721 ret = extent_write_full_page(tree, page, btrfs_get_extent, wbc);
8722 btrfs_add_delayed_iput(inode);
8726 static int btrfs_writepages(struct address_space *mapping,
8727 struct writeback_control *wbc)
8729 struct extent_io_tree *tree;
8731 tree = &BTRFS_I(mapping->host)->io_tree;
8732 return extent_writepages(tree, mapping, btrfs_get_extent, wbc);
8736 btrfs_readpages(struct file *file, struct address_space *mapping,
8737 struct list_head *pages, unsigned nr_pages)
8739 struct extent_io_tree *tree;
8740 tree = &BTRFS_I(mapping->host)->io_tree;
8741 return extent_readpages(tree, mapping, pages, nr_pages,
8744 static int __btrfs_releasepage(struct page *page, gfp_t gfp_flags)
8746 struct extent_io_tree *tree;
8747 struct extent_map_tree *map;
8750 tree = &BTRFS_I(page->mapping->host)->io_tree;
8751 map = &BTRFS_I(page->mapping->host)->extent_tree;
8752 ret = try_release_extent_mapping(map, tree, page, gfp_flags);
8754 ClearPagePrivate(page);
8755 set_page_private(page, 0);
8761 static int btrfs_releasepage(struct page *page, gfp_t gfp_flags)
8763 if (PageWriteback(page) || PageDirty(page))
8765 return __btrfs_releasepage(page, gfp_flags);
8768 static void btrfs_invalidatepage(struct page *page, unsigned int offset,
8769 unsigned int length)
8771 struct inode *inode = page->mapping->host;
8772 struct extent_io_tree *tree;
8773 struct btrfs_ordered_extent *ordered;
8774 struct extent_state *cached_state = NULL;
8775 u64 page_start = page_offset(page);
8776 u64 page_end = page_start + PAGE_SIZE - 1;
8779 int inode_evicting = inode->i_state & I_FREEING;
8782 * we have the page locked, so new writeback can't start,
8783 * and the dirty bit won't be cleared while we are here.
8785 * Wait for IO on this page so that we can safely clear
8786 * the PagePrivate2 bit and do ordered accounting
8788 wait_on_page_writeback(page);
8790 tree = &BTRFS_I(inode)->io_tree;
8792 btrfs_releasepage(page, GFP_NOFS);
8796 if (!inode_evicting)
8797 lock_extent_bits(tree, page_start, page_end, &cached_state);
8800 ordered = btrfs_lookup_ordered_range(BTRFS_I(inode), start,
8801 page_end - start + 1);
8803 end = min(page_end, ordered->file_offset + ordered->len - 1);
8805 * IO on this page will never be started, so we need
8806 * to account for any ordered extents now
8808 if (!inode_evicting)
8809 clear_extent_bit(tree, start, end,
8810 EXTENT_DIRTY | EXTENT_DELALLOC |
8811 EXTENT_LOCKED | EXTENT_DO_ACCOUNTING |
8812 EXTENT_DEFRAG, 1, 0, &cached_state,
8815 * whoever cleared the private bit is responsible
8816 * for the finish_ordered_io
8818 if (TestClearPagePrivate2(page)) {
8819 struct btrfs_ordered_inode_tree *tree;
8822 tree = &BTRFS_I(inode)->ordered_tree;
8824 spin_lock_irq(&tree->lock);
8825 set_bit(BTRFS_ORDERED_TRUNCATED, &ordered->flags);
8826 new_len = start - ordered->file_offset;
8827 if (new_len < ordered->truncated_len)
8828 ordered->truncated_len = new_len;
8829 spin_unlock_irq(&tree->lock);
8831 if (btrfs_dec_test_ordered_pending(inode, &ordered,
8833 end - start + 1, 1))
8834 btrfs_finish_ordered_io(ordered);
8836 btrfs_put_ordered_extent(ordered);
8837 if (!inode_evicting) {
8838 cached_state = NULL;
8839 lock_extent_bits(tree, start, end,
8844 if (start < page_end)
8849 * Qgroup reserved space handler
8850 * Page here will be either
8851 * 1) Already written to disk
8852 * In this case, its reserved space is released from data rsv map
8853 * and will be freed by delayed_ref handler finally.
8854 * So even we call qgroup_free_data(), it won't decrease reserved
8856 * 2) Not written to disk
8857 * This means the reserved space should be freed here. However,
8858 * if a truncate invalidates the page (by clearing PageDirty)
8859 * and the page is accounted for while allocating extent
8860 * in btrfs_check_data_free_space() we let delayed_ref to
8861 * free the entire extent.
8863 if (PageDirty(page))
8864 btrfs_qgroup_free_data(inode, page_start, PAGE_SIZE);
8865 if (!inode_evicting) {
8866 clear_extent_bit(tree, page_start, page_end,
8867 EXTENT_LOCKED | EXTENT_DIRTY |
8868 EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING |
8869 EXTENT_DEFRAG, 1, 1,
8870 &cached_state, GFP_NOFS);
8872 __btrfs_releasepage(page, GFP_NOFS);
8875 ClearPageChecked(page);
8876 if (PagePrivate(page)) {
8877 ClearPagePrivate(page);
8878 set_page_private(page, 0);
8884 * btrfs_page_mkwrite() is not allowed to change the file size as it gets
8885 * called from a page fault handler when a page is first dirtied. Hence we must
8886 * be careful to check for EOF conditions here. We set the page up correctly
8887 * for a written page which means we get ENOSPC checking when writing into
8888 * holes and correct delalloc and unwritten extent mapping on filesystems that
8889 * support these features.
8891 * We are not allowed to take the i_mutex here so we have to play games to
8892 * protect against truncate races as the page could now be beyond EOF. Because
8893 * vmtruncate() writes the inode size before removing pages, once we have the
8894 * page lock we can determine safely if the page is beyond EOF. If it is not
8895 * beyond EOF, then the page is guaranteed safe against truncation until we
8898 int btrfs_page_mkwrite(struct vm_area_struct *vma, struct vm_fault *vmf)
8900 struct page *page = vmf->page;
8901 struct inode *inode = file_inode(vma->vm_file);
8902 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
8903 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
8904 struct btrfs_ordered_extent *ordered;
8905 struct extent_state *cached_state = NULL;
8907 unsigned long zero_start;
8916 reserved_space = PAGE_SIZE;
8918 sb_start_pagefault(inode->i_sb);
8919 page_start = page_offset(page);
8920 page_end = page_start + PAGE_SIZE - 1;
8924 * Reserving delalloc space after obtaining the page lock can lead to
8925 * deadlock. For example, if a dirty page is locked by this function
8926 * and the call to btrfs_delalloc_reserve_space() ends up triggering
8927 * dirty page write out, then the btrfs_writepage() function could
8928 * end up waiting indefinitely to get a lock on the page currently
8929 * being processed by btrfs_page_mkwrite() function.
8931 ret = btrfs_delalloc_reserve_space(inode, page_start,
8934 ret = file_update_time(vma->vm_file);
8940 else /* -ENOSPC, -EIO, etc */
8941 ret = VM_FAULT_SIGBUS;
8947 ret = VM_FAULT_NOPAGE; /* make the VM retry the fault */
8950 size = i_size_read(inode);
8952 if ((page->mapping != inode->i_mapping) ||
8953 (page_start >= size)) {
8954 /* page got truncated out from underneath us */
8957 wait_on_page_writeback(page);
8959 lock_extent_bits(io_tree, page_start, page_end, &cached_state);
8960 set_page_extent_mapped(page);
8963 * we can't set the delalloc bits if there are pending ordered
8964 * extents. Drop our locks and wait for them to finish
8966 ordered = btrfs_lookup_ordered_range(BTRFS_I(inode), page_start,
8969 unlock_extent_cached(io_tree, page_start, page_end,
8970 &cached_state, GFP_NOFS);
8972 btrfs_start_ordered_extent(inode, ordered, 1);
8973 btrfs_put_ordered_extent(ordered);
8977 if (page->index == ((size - 1) >> PAGE_SHIFT)) {
8978 reserved_space = round_up(size - page_start,
8979 fs_info->sectorsize);
8980 if (reserved_space < PAGE_SIZE) {
8981 end = page_start + reserved_space - 1;
8982 spin_lock(&BTRFS_I(inode)->lock);
8983 BTRFS_I(inode)->outstanding_extents++;
8984 spin_unlock(&BTRFS_I(inode)->lock);
8985 btrfs_delalloc_release_space(inode, page_start,
8986 PAGE_SIZE - reserved_space);
8991 * page_mkwrite gets called when the page is firstly dirtied after it's
8992 * faulted in, but write(2) could also dirty a page and set delalloc
8993 * bits, thus in this case for space account reason, we still need to
8994 * clear any delalloc bits within this page range since we have to
8995 * reserve data&meta space before lock_page() (see above comments).
8997 clear_extent_bit(&BTRFS_I(inode)->io_tree, page_start, end,
8998 EXTENT_DIRTY | EXTENT_DELALLOC |
8999 EXTENT_DO_ACCOUNTING | EXTENT_DEFRAG,
9000 0, 0, &cached_state, GFP_NOFS);
9002 ret = btrfs_set_extent_delalloc(inode, page_start, end,
9005 unlock_extent_cached(io_tree, page_start, page_end,
9006 &cached_state, GFP_NOFS);
9007 ret = VM_FAULT_SIGBUS;
9012 /* page is wholly or partially inside EOF */
9013 if (page_start + PAGE_SIZE > size)
9014 zero_start = size & ~PAGE_MASK;
9016 zero_start = PAGE_SIZE;
9018 if (zero_start != PAGE_SIZE) {
9020 memset(kaddr + zero_start, 0, PAGE_SIZE - zero_start);
9021 flush_dcache_page(page);
9024 ClearPageChecked(page);
9025 set_page_dirty(page);
9026 SetPageUptodate(page);
9028 BTRFS_I(inode)->last_trans = fs_info->generation;
9029 BTRFS_I(inode)->last_sub_trans = BTRFS_I(inode)->root->log_transid;
9030 BTRFS_I(inode)->last_log_commit = BTRFS_I(inode)->root->last_log_commit;
9032 unlock_extent_cached(io_tree, page_start, page_end, &cached_state, GFP_NOFS);
9036 sb_end_pagefault(inode->i_sb);
9037 return VM_FAULT_LOCKED;
9041 btrfs_delalloc_release_space(inode, page_start, reserved_space);
9043 sb_end_pagefault(inode->i_sb);
9047 static int btrfs_truncate(struct inode *inode)
9049 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
9050 struct btrfs_root *root = BTRFS_I(inode)->root;
9051 struct btrfs_block_rsv *rsv;
9054 struct btrfs_trans_handle *trans;
9055 u64 mask = fs_info->sectorsize - 1;
9056 u64 min_size = btrfs_calc_trunc_metadata_size(fs_info, 1);
9058 ret = btrfs_wait_ordered_range(inode, inode->i_size & (~mask),
9064 * Yes ladies and gentlemen, this is indeed ugly. The fact is we have
9065 * 3 things going on here
9067 * 1) We need to reserve space for our orphan item and the space to
9068 * delete our orphan item. Lord knows we don't want to have a dangling
9069 * orphan item because we didn't reserve space to remove it.
9071 * 2) We need to reserve space to update our inode.
9073 * 3) We need to have something to cache all the space that is going to
9074 * be free'd up by the truncate operation, but also have some slack
9075 * space reserved in case it uses space during the truncate (thank you
9076 * very much snapshotting).
9078 * And we need these to all be separate. The fact is we can use a lot of
9079 * space doing the truncate, and we have no earthly idea how much space
9080 * we will use, so we need the truncate reservation to be separate so it
9081 * doesn't end up using space reserved for updating the inode or
9082 * removing the orphan item. We also need to be able to stop the
9083 * transaction and start a new one, which means we need to be able to
9084 * update the inode several times, and we have no idea of knowing how
9085 * many times that will be, so we can't just reserve 1 item for the
9086 * entirety of the operation, so that has to be done separately as well.
9087 * Then there is the orphan item, which does indeed need to be held on
9088 * to for the whole operation, and we need nobody to touch this reserved
9089 * space except the orphan code.
9091 * So that leaves us with
9093 * 1) root->orphan_block_rsv - for the orphan deletion.
9094 * 2) rsv - for the truncate reservation, which we will steal from the
9095 * transaction reservation.
9096 * 3) fs_info->trans_block_rsv - this will have 1 items worth left for
9097 * updating the inode.
9099 rsv = btrfs_alloc_block_rsv(fs_info, BTRFS_BLOCK_RSV_TEMP);
9102 rsv->size = min_size;
9106 * 1 for the truncate slack space
9107 * 1 for updating the inode.
9109 trans = btrfs_start_transaction(root, 2);
9110 if (IS_ERR(trans)) {
9111 err = PTR_ERR(trans);
9115 /* Migrate the slack space for the truncate to our reserve */
9116 ret = btrfs_block_rsv_migrate(&fs_info->trans_block_rsv, rsv,
9121 * So if we truncate and then write and fsync we normally would just
9122 * write the extents that changed, which is a problem if we need to
9123 * first truncate that entire inode. So set this flag so we write out
9124 * all of the extents in the inode to the sync log so we're completely
9127 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC, &BTRFS_I(inode)->runtime_flags);
9128 trans->block_rsv = rsv;
9131 ret = btrfs_truncate_inode_items(trans, root, inode,
9133 BTRFS_EXTENT_DATA_KEY);
9134 if (ret != -ENOSPC && ret != -EAGAIN) {
9139 trans->block_rsv = &fs_info->trans_block_rsv;
9140 ret = btrfs_update_inode(trans, root, inode);
9146 btrfs_end_transaction(trans);
9147 btrfs_btree_balance_dirty(fs_info);
9149 trans = btrfs_start_transaction(root, 2);
9150 if (IS_ERR(trans)) {
9151 ret = err = PTR_ERR(trans);
9156 btrfs_block_rsv_release(fs_info, rsv, -1);
9157 ret = btrfs_block_rsv_migrate(&fs_info->trans_block_rsv,
9159 BUG_ON(ret); /* shouldn't happen */
9160 trans->block_rsv = rsv;
9163 if (ret == 0 && inode->i_nlink > 0) {
9164 trans->block_rsv = root->orphan_block_rsv;
9165 ret = btrfs_orphan_del(trans, BTRFS_I(inode));
9171 trans->block_rsv = &fs_info->trans_block_rsv;
9172 ret = btrfs_update_inode(trans, root, inode);
9176 ret = btrfs_end_transaction(trans);
9177 btrfs_btree_balance_dirty(fs_info);
9180 btrfs_free_block_rsv(fs_info, rsv);
9189 * create a new subvolume directory/inode (helper for the ioctl).
9191 int btrfs_create_subvol_root(struct btrfs_trans_handle *trans,
9192 struct btrfs_root *new_root,
9193 struct btrfs_root *parent_root,
9196 struct inode *inode;
9200 inode = btrfs_new_inode(trans, new_root, NULL, "..", 2,
9201 new_dirid, new_dirid,
9202 S_IFDIR | (~current_umask() & S_IRWXUGO),
9205 return PTR_ERR(inode);
9206 inode->i_op = &btrfs_dir_inode_operations;
9207 inode->i_fop = &btrfs_dir_file_operations;
9209 set_nlink(inode, 1);
9210 btrfs_i_size_write(BTRFS_I(inode), 0);
9211 unlock_new_inode(inode);
9213 err = btrfs_subvol_inherit_props(trans, new_root, parent_root);
9215 btrfs_err(new_root->fs_info,
9216 "error inheriting subvolume %llu properties: %d",
9217 new_root->root_key.objectid, err);
9219 err = btrfs_update_inode(trans, new_root, inode);
9225 struct inode *btrfs_alloc_inode(struct super_block *sb)
9227 struct btrfs_inode *ei;
9228 struct inode *inode;
9230 ei = kmem_cache_alloc(btrfs_inode_cachep, GFP_NOFS);
9237 ei->last_sub_trans = 0;
9238 ei->logged_trans = 0;
9239 ei->delalloc_bytes = 0;
9240 ei->defrag_bytes = 0;
9241 ei->disk_i_size = 0;
9244 ei->index_cnt = (u64)-1;
9246 ei->last_unlink_trans = 0;
9247 ei->last_log_commit = 0;
9248 ei->delayed_iput_count = 0;
9250 spin_lock_init(&ei->lock);
9251 ei->outstanding_extents = 0;
9252 ei->reserved_extents = 0;
9254 ei->runtime_flags = 0;
9255 ei->force_compress = BTRFS_COMPRESS_NONE;
9257 ei->delayed_node = NULL;
9259 ei->i_otime.tv_sec = 0;
9260 ei->i_otime.tv_nsec = 0;
9262 inode = &ei->vfs_inode;
9263 extent_map_tree_init(&ei->extent_tree);
9264 extent_io_tree_init(&ei->io_tree, &inode->i_data);
9265 extent_io_tree_init(&ei->io_failure_tree, &inode->i_data);
9266 ei->io_tree.track_uptodate = 1;
9267 ei->io_failure_tree.track_uptodate = 1;
9268 atomic_set(&ei->sync_writers, 0);
9269 mutex_init(&ei->log_mutex);
9270 mutex_init(&ei->delalloc_mutex);
9271 btrfs_ordered_inode_tree_init(&ei->ordered_tree);
9272 INIT_LIST_HEAD(&ei->delalloc_inodes);
9273 INIT_LIST_HEAD(&ei->delayed_iput);
9274 RB_CLEAR_NODE(&ei->rb_node);
9275 init_rwsem(&ei->dio_sem);
9280 #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
9281 void btrfs_test_destroy_inode(struct inode *inode)
9283 btrfs_drop_extent_cache(BTRFS_I(inode), 0, (u64)-1, 0);
9284 kmem_cache_free(btrfs_inode_cachep, BTRFS_I(inode));
9288 static void btrfs_i_callback(struct rcu_head *head)
9290 struct inode *inode = container_of(head, struct inode, i_rcu);
9291 kmem_cache_free(btrfs_inode_cachep, BTRFS_I(inode));
9294 void btrfs_destroy_inode(struct inode *inode)
9296 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
9297 struct btrfs_ordered_extent *ordered;
9298 struct btrfs_root *root = BTRFS_I(inode)->root;
9300 WARN_ON(!hlist_empty(&inode->i_dentry));
9301 WARN_ON(inode->i_data.nrpages);
9302 WARN_ON(BTRFS_I(inode)->outstanding_extents);
9303 WARN_ON(BTRFS_I(inode)->reserved_extents);
9304 WARN_ON(BTRFS_I(inode)->delalloc_bytes);
9305 WARN_ON(BTRFS_I(inode)->csum_bytes);
9306 WARN_ON(BTRFS_I(inode)->defrag_bytes);
9309 * This can happen where we create an inode, but somebody else also
9310 * created the same inode and we need to destroy the one we already
9316 if (test_bit(BTRFS_INODE_HAS_ORPHAN_ITEM,
9317 &BTRFS_I(inode)->runtime_flags)) {
9318 btrfs_info(fs_info, "inode %llu still on the orphan list",
9319 btrfs_ino(BTRFS_I(inode)));
9320 atomic_dec(&root->orphan_inodes);
9324 ordered = btrfs_lookup_first_ordered_extent(inode, (u64)-1);
9329 "found ordered extent %llu %llu on inode cleanup",
9330 ordered->file_offset, ordered->len);
9331 btrfs_remove_ordered_extent(inode, ordered);
9332 btrfs_put_ordered_extent(ordered);
9333 btrfs_put_ordered_extent(ordered);
9336 btrfs_qgroup_check_reserved_leak(inode);
9337 inode_tree_del(inode);
9338 btrfs_drop_extent_cache(BTRFS_I(inode), 0, (u64)-1, 0);
9340 call_rcu(&inode->i_rcu, btrfs_i_callback);
9343 int btrfs_drop_inode(struct inode *inode)
9345 struct btrfs_root *root = BTRFS_I(inode)->root;
9350 /* the snap/subvol tree is on deleting */
9351 if (btrfs_root_refs(&root->root_item) == 0)
9354 return generic_drop_inode(inode);
9357 static void init_once(void *foo)
9359 struct btrfs_inode *ei = (struct btrfs_inode *) foo;
9361 inode_init_once(&ei->vfs_inode);
9364 void btrfs_destroy_cachep(void)
9367 * Make sure all delayed rcu free inodes are flushed before we
9371 kmem_cache_destroy(btrfs_inode_cachep);
9372 kmem_cache_destroy(btrfs_trans_handle_cachep);
9373 kmem_cache_destroy(btrfs_transaction_cachep);
9374 kmem_cache_destroy(btrfs_path_cachep);
9375 kmem_cache_destroy(btrfs_free_space_cachep);
9378 int btrfs_init_cachep(void)
9380 btrfs_inode_cachep = kmem_cache_create("btrfs_inode",
9381 sizeof(struct btrfs_inode), 0,
9382 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD | SLAB_ACCOUNT,
9384 if (!btrfs_inode_cachep)
9387 btrfs_trans_handle_cachep = kmem_cache_create("btrfs_trans_handle",
9388 sizeof(struct btrfs_trans_handle), 0,
9389 SLAB_TEMPORARY | SLAB_MEM_SPREAD, NULL);
9390 if (!btrfs_trans_handle_cachep)
9393 btrfs_transaction_cachep = kmem_cache_create("btrfs_transaction",
9394 sizeof(struct btrfs_transaction), 0,
9395 SLAB_TEMPORARY | SLAB_MEM_SPREAD, NULL);
9396 if (!btrfs_transaction_cachep)
9399 btrfs_path_cachep = kmem_cache_create("btrfs_path",
9400 sizeof(struct btrfs_path), 0,
9401 SLAB_MEM_SPREAD, NULL);
9402 if (!btrfs_path_cachep)
9405 btrfs_free_space_cachep = kmem_cache_create("btrfs_free_space",
9406 sizeof(struct btrfs_free_space), 0,
9407 SLAB_MEM_SPREAD, NULL);
9408 if (!btrfs_free_space_cachep)
9413 btrfs_destroy_cachep();
9417 static int btrfs_getattr(struct vfsmount *mnt,
9418 struct dentry *dentry, struct kstat *stat)
9421 struct inode *inode = d_inode(dentry);
9422 u32 blocksize = inode->i_sb->s_blocksize;
9424 generic_fillattr(inode, stat);
9425 stat->dev = BTRFS_I(inode)->root->anon_dev;
9427 spin_lock(&BTRFS_I(inode)->lock);
9428 delalloc_bytes = BTRFS_I(inode)->delalloc_bytes;
9429 spin_unlock(&BTRFS_I(inode)->lock);
9430 stat->blocks = (ALIGN(inode_get_bytes(inode), blocksize) +
9431 ALIGN(delalloc_bytes, blocksize)) >> 9;
9435 static int btrfs_rename_exchange(struct inode *old_dir,
9436 struct dentry *old_dentry,
9437 struct inode *new_dir,
9438 struct dentry *new_dentry)
9440 struct btrfs_fs_info *fs_info = btrfs_sb(old_dir->i_sb);
9441 struct btrfs_trans_handle *trans;
9442 struct btrfs_root *root = BTRFS_I(old_dir)->root;
9443 struct btrfs_root *dest = BTRFS_I(new_dir)->root;
9444 struct inode *new_inode = new_dentry->d_inode;
9445 struct inode *old_inode = old_dentry->d_inode;
9446 struct timespec ctime = current_time(old_inode);
9447 struct dentry *parent;
9448 u64 old_ino = btrfs_ino(BTRFS_I(old_inode));
9449 u64 new_ino = btrfs_ino(BTRFS_I(new_inode));
9454 bool root_log_pinned = false;
9455 bool dest_log_pinned = false;
9457 /* we only allow rename subvolume link between subvolumes */
9458 if (old_ino != BTRFS_FIRST_FREE_OBJECTID && root != dest)
9461 /* close the race window with snapshot create/destroy ioctl */
9462 if (old_ino == BTRFS_FIRST_FREE_OBJECTID)
9463 down_read(&fs_info->subvol_sem);
9464 if (new_ino == BTRFS_FIRST_FREE_OBJECTID)
9465 down_read(&fs_info->subvol_sem);
9468 * We want to reserve the absolute worst case amount of items. So if
9469 * both inodes are subvols and we need to unlink them then that would
9470 * require 4 item modifications, but if they are both normal inodes it
9471 * would require 5 item modifications, so we'll assume their normal
9472 * inodes. So 5 * 2 is 10, plus 2 for the new links, so 12 total items
9473 * should cover the worst case number of items we'll modify.
9475 trans = btrfs_start_transaction(root, 12);
9476 if (IS_ERR(trans)) {
9477 ret = PTR_ERR(trans);
9482 * We need to find a free sequence number both in the source and
9483 * in the destination directory for the exchange.
9485 ret = btrfs_set_inode_index(BTRFS_I(new_dir), &old_idx);
9488 ret = btrfs_set_inode_index(BTRFS_I(old_dir), &new_idx);
9492 BTRFS_I(old_inode)->dir_index = 0ULL;
9493 BTRFS_I(new_inode)->dir_index = 0ULL;
9495 /* Reference for the source. */
9496 if (old_ino == BTRFS_FIRST_FREE_OBJECTID) {
9497 /* force full log commit if subvolume involved. */
9498 btrfs_set_log_full_commit(fs_info, trans);
9500 btrfs_pin_log_trans(root);
9501 root_log_pinned = true;
9502 ret = btrfs_insert_inode_ref(trans, dest,
9503 new_dentry->d_name.name,
9504 new_dentry->d_name.len,
9506 btrfs_ino(BTRFS_I(new_dir)),
9512 /* And now for the dest. */
9513 if (new_ino == BTRFS_FIRST_FREE_OBJECTID) {
9514 /* force full log commit if subvolume involved. */
9515 btrfs_set_log_full_commit(fs_info, trans);
9517 btrfs_pin_log_trans(dest);
9518 dest_log_pinned = true;
9519 ret = btrfs_insert_inode_ref(trans, root,
9520 old_dentry->d_name.name,
9521 old_dentry->d_name.len,
9523 btrfs_ino(BTRFS_I(old_dir)),
9529 /* Update inode version and ctime/mtime. */
9530 inode_inc_iversion(old_dir);
9531 inode_inc_iversion(new_dir);
9532 inode_inc_iversion(old_inode);
9533 inode_inc_iversion(new_inode);
9534 old_dir->i_ctime = old_dir->i_mtime = ctime;
9535 new_dir->i_ctime = new_dir->i_mtime = ctime;
9536 old_inode->i_ctime = ctime;
9537 new_inode->i_ctime = ctime;
9539 if (old_dentry->d_parent != new_dentry->d_parent) {
9540 btrfs_record_unlink_dir(trans, BTRFS_I(old_dir),
9541 BTRFS_I(old_inode), 1);
9542 btrfs_record_unlink_dir(trans, BTRFS_I(new_dir),
9543 BTRFS_I(new_inode), 1);
9546 /* src is a subvolume */
9547 if (old_ino == BTRFS_FIRST_FREE_OBJECTID) {
9548 root_objectid = BTRFS_I(old_inode)->root->root_key.objectid;
9549 ret = btrfs_unlink_subvol(trans, root, old_dir,
9551 old_dentry->d_name.name,
9552 old_dentry->d_name.len);
9553 } else { /* src is an inode */
9554 ret = __btrfs_unlink_inode(trans, root, BTRFS_I(old_dir),
9555 BTRFS_I(old_dentry->d_inode),
9556 old_dentry->d_name.name,
9557 old_dentry->d_name.len);
9559 ret = btrfs_update_inode(trans, root, old_inode);
9562 btrfs_abort_transaction(trans, ret);
9566 /* dest is a subvolume */
9567 if (new_ino == BTRFS_FIRST_FREE_OBJECTID) {
9568 root_objectid = BTRFS_I(new_inode)->root->root_key.objectid;
9569 ret = btrfs_unlink_subvol(trans, dest, new_dir,
9571 new_dentry->d_name.name,
9572 new_dentry->d_name.len);
9573 } else { /* dest is an inode */
9574 ret = __btrfs_unlink_inode(trans, dest, BTRFS_I(new_dir),
9575 BTRFS_I(new_dentry->d_inode),
9576 new_dentry->d_name.name,
9577 new_dentry->d_name.len);
9579 ret = btrfs_update_inode(trans, dest, new_inode);
9582 btrfs_abort_transaction(trans, ret);
9586 ret = btrfs_add_link(trans, BTRFS_I(new_dir), BTRFS_I(old_inode),
9587 new_dentry->d_name.name,
9588 new_dentry->d_name.len, 0, old_idx);
9590 btrfs_abort_transaction(trans, ret);
9594 ret = btrfs_add_link(trans, BTRFS_I(old_dir), BTRFS_I(new_inode),
9595 old_dentry->d_name.name,
9596 old_dentry->d_name.len, 0, new_idx);
9598 btrfs_abort_transaction(trans, ret);
9602 if (old_inode->i_nlink == 1)
9603 BTRFS_I(old_inode)->dir_index = old_idx;
9604 if (new_inode->i_nlink == 1)
9605 BTRFS_I(new_inode)->dir_index = new_idx;
9607 if (root_log_pinned) {
9608 parent = new_dentry->d_parent;
9609 btrfs_log_new_name(trans, BTRFS_I(old_inode), BTRFS_I(old_dir),
9611 btrfs_end_log_trans(root);
9612 root_log_pinned = false;
9614 if (dest_log_pinned) {
9615 parent = old_dentry->d_parent;
9616 btrfs_log_new_name(trans, BTRFS_I(new_inode), BTRFS_I(new_dir),
9618 btrfs_end_log_trans(dest);
9619 dest_log_pinned = false;
9623 * If we have pinned a log and an error happened, we unpin tasks
9624 * trying to sync the log and force them to fallback to a transaction
9625 * commit if the log currently contains any of the inodes involved in
9626 * this rename operation (to ensure we do not persist a log with an
9627 * inconsistent state for any of these inodes or leading to any
9628 * inconsistencies when replayed). If the transaction was aborted, the
9629 * abortion reason is propagated to userspace when attempting to commit
9630 * the transaction. If the log does not contain any of these inodes, we
9631 * allow the tasks to sync it.
9633 if (ret && (root_log_pinned || dest_log_pinned)) {
9634 if (btrfs_inode_in_log(BTRFS_I(old_dir), fs_info->generation) ||
9635 btrfs_inode_in_log(BTRFS_I(new_dir), fs_info->generation) ||
9636 btrfs_inode_in_log(BTRFS_I(old_inode), fs_info->generation) ||
9638 btrfs_inode_in_log(BTRFS_I(new_inode), fs_info->generation)))
9639 btrfs_set_log_full_commit(fs_info, trans);
9641 if (root_log_pinned) {
9642 btrfs_end_log_trans(root);
9643 root_log_pinned = false;
9645 if (dest_log_pinned) {
9646 btrfs_end_log_trans(dest);
9647 dest_log_pinned = false;
9650 ret = btrfs_end_transaction(trans);
9652 if (new_ino == BTRFS_FIRST_FREE_OBJECTID)
9653 up_read(&fs_info->subvol_sem);
9654 if (old_ino == BTRFS_FIRST_FREE_OBJECTID)
9655 up_read(&fs_info->subvol_sem);
9660 static int btrfs_whiteout_for_rename(struct btrfs_trans_handle *trans,
9661 struct btrfs_root *root,
9663 struct dentry *dentry)
9666 struct inode *inode;
9670 ret = btrfs_find_free_ino(root, &objectid);
9674 inode = btrfs_new_inode(trans, root, dir,
9675 dentry->d_name.name,
9677 btrfs_ino(BTRFS_I(dir)),
9679 S_IFCHR | WHITEOUT_MODE,
9682 if (IS_ERR(inode)) {
9683 ret = PTR_ERR(inode);
9687 inode->i_op = &btrfs_special_inode_operations;
9688 init_special_inode(inode, inode->i_mode,
9691 ret = btrfs_init_inode_security(trans, inode, dir,
9696 ret = btrfs_add_nondir(trans, BTRFS_I(dir), dentry,
9697 BTRFS_I(inode), 0, index);
9701 ret = btrfs_update_inode(trans, root, inode);
9703 unlock_new_inode(inode);
9705 inode_dec_link_count(inode);
9711 static int btrfs_rename(struct inode *old_dir, struct dentry *old_dentry,
9712 struct inode *new_dir, struct dentry *new_dentry,
9715 struct btrfs_fs_info *fs_info = btrfs_sb(old_dir->i_sb);
9716 struct btrfs_trans_handle *trans;
9717 unsigned int trans_num_items;
9718 struct btrfs_root *root = BTRFS_I(old_dir)->root;
9719 struct btrfs_root *dest = BTRFS_I(new_dir)->root;
9720 struct inode *new_inode = d_inode(new_dentry);
9721 struct inode *old_inode = d_inode(old_dentry);
9725 u64 old_ino = btrfs_ino(BTRFS_I(old_inode));
9726 bool log_pinned = false;
9728 if (btrfs_ino(BTRFS_I(new_dir)) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)
9731 /* we only allow rename subvolume link between subvolumes */
9732 if (old_ino != BTRFS_FIRST_FREE_OBJECTID && root != dest)
9735 if (old_ino == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID ||
9736 (new_inode && btrfs_ino(BTRFS_I(new_inode)) == BTRFS_FIRST_FREE_OBJECTID))
9739 if (S_ISDIR(old_inode->i_mode) && new_inode &&
9740 new_inode->i_size > BTRFS_EMPTY_DIR_SIZE)
9744 /* check for collisions, even if the name isn't there */
9745 ret = btrfs_check_dir_item_collision(dest, new_dir->i_ino,
9746 new_dentry->d_name.name,
9747 new_dentry->d_name.len);
9750 if (ret == -EEXIST) {
9752 * eexist without a new_inode */
9753 if (WARN_ON(!new_inode)) {
9757 /* maybe -EOVERFLOW */
9764 * we're using rename to replace one file with another. Start IO on it
9765 * now so we don't add too much work to the end of the transaction
9767 if (new_inode && S_ISREG(old_inode->i_mode) && new_inode->i_size)
9768 filemap_flush(old_inode->i_mapping);
9770 /* close the racy window with snapshot create/destroy ioctl */
9771 if (old_ino == BTRFS_FIRST_FREE_OBJECTID)
9772 down_read(&fs_info->subvol_sem);
9774 * We want to reserve the absolute worst case amount of items. So if
9775 * both inodes are subvols and we need to unlink them then that would
9776 * require 4 item modifications, but if they are both normal inodes it
9777 * would require 5 item modifications, so we'll assume they are normal
9778 * inodes. So 5 * 2 is 10, plus 1 for the new link, so 11 total items
9779 * should cover the worst case number of items we'll modify.
9780 * If our rename has the whiteout flag, we need more 5 units for the
9781 * new inode (1 inode item, 1 inode ref, 2 dir items and 1 xattr item
9782 * when selinux is enabled).
9784 trans_num_items = 11;
9785 if (flags & RENAME_WHITEOUT)
9786 trans_num_items += 5;
9787 trans = btrfs_start_transaction(root, trans_num_items);
9788 if (IS_ERR(trans)) {
9789 ret = PTR_ERR(trans);
9794 btrfs_record_root_in_trans(trans, dest);
9796 ret = btrfs_set_inode_index(BTRFS_I(new_dir), &index);
9800 BTRFS_I(old_inode)->dir_index = 0ULL;
9801 if (unlikely(old_ino == BTRFS_FIRST_FREE_OBJECTID)) {
9802 /* force full log commit if subvolume involved. */
9803 btrfs_set_log_full_commit(fs_info, trans);
9805 btrfs_pin_log_trans(root);
9807 ret = btrfs_insert_inode_ref(trans, dest,
9808 new_dentry->d_name.name,
9809 new_dentry->d_name.len,
9811 btrfs_ino(BTRFS_I(new_dir)), index);
9816 inode_inc_iversion(old_dir);
9817 inode_inc_iversion(new_dir);
9818 inode_inc_iversion(old_inode);
9819 old_dir->i_ctime = old_dir->i_mtime =
9820 new_dir->i_ctime = new_dir->i_mtime =
9821 old_inode->i_ctime = current_time(old_dir);
9823 if (old_dentry->d_parent != new_dentry->d_parent)
9824 btrfs_record_unlink_dir(trans, BTRFS_I(old_dir),
9825 BTRFS_I(old_inode), 1);
9827 if (unlikely(old_ino == BTRFS_FIRST_FREE_OBJECTID)) {
9828 root_objectid = BTRFS_I(old_inode)->root->root_key.objectid;
9829 ret = btrfs_unlink_subvol(trans, root, old_dir, root_objectid,
9830 old_dentry->d_name.name,
9831 old_dentry->d_name.len);
9833 ret = __btrfs_unlink_inode(trans, root, BTRFS_I(old_dir),
9834 BTRFS_I(d_inode(old_dentry)),
9835 old_dentry->d_name.name,
9836 old_dentry->d_name.len);
9838 ret = btrfs_update_inode(trans, root, old_inode);
9841 btrfs_abort_transaction(trans, ret);
9846 inode_inc_iversion(new_inode);
9847 new_inode->i_ctime = current_time(new_inode);
9848 if (unlikely(btrfs_ino(BTRFS_I(new_inode)) ==
9849 BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)) {
9850 root_objectid = BTRFS_I(new_inode)->location.objectid;
9851 ret = btrfs_unlink_subvol(trans, dest, new_dir,
9853 new_dentry->d_name.name,
9854 new_dentry->d_name.len);
9855 BUG_ON(new_inode->i_nlink == 0);
9857 ret = btrfs_unlink_inode(trans, dest, BTRFS_I(new_dir),
9858 BTRFS_I(d_inode(new_dentry)),
9859 new_dentry->d_name.name,
9860 new_dentry->d_name.len);
9862 if (!ret && new_inode->i_nlink == 0)
9863 ret = btrfs_orphan_add(trans,
9864 BTRFS_I(d_inode(new_dentry)));
9866 btrfs_abort_transaction(trans, ret);
9871 ret = btrfs_add_link(trans, BTRFS_I(new_dir), BTRFS_I(old_inode),
9872 new_dentry->d_name.name,
9873 new_dentry->d_name.len, 0, index);
9875 btrfs_abort_transaction(trans, ret);
9879 if (old_inode->i_nlink == 1)
9880 BTRFS_I(old_inode)->dir_index = index;
9883 struct dentry *parent = new_dentry->d_parent;
9885 btrfs_log_new_name(trans, BTRFS_I(old_inode), BTRFS_I(old_dir),
9887 btrfs_end_log_trans(root);
9891 if (flags & RENAME_WHITEOUT) {
9892 ret = btrfs_whiteout_for_rename(trans, root, old_dir,
9896 btrfs_abort_transaction(trans, ret);
9902 * If we have pinned the log and an error happened, we unpin tasks
9903 * trying to sync the log and force them to fallback to a transaction
9904 * commit if the log currently contains any of the inodes involved in
9905 * this rename operation (to ensure we do not persist a log with an
9906 * inconsistent state for any of these inodes or leading to any
9907 * inconsistencies when replayed). If the transaction was aborted, the
9908 * abortion reason is propagated to userspace when attempting to commit
9909 * the transaction. If the log does not contain any of these inodes, we
9910 * allow the tasks to sync it.
9912 if (ret && log_pinned) {
9913 if (btrfs_inode_in_log(BTRFS_I(old_dir), fs_info->generation) ||
9914 btrfs_inode_in_log(BTRFS_I(new_dir), fs_info->generation) ||
9915 btrfs_inode_in_log(BTRFS_I(old_inode), fs_info->generation) ||
9917 btrfs_inode_in_log(BTRFS_I(new_inode), fs_info->generation)))
9918 btrfs_set_log_full_commit(fs_info, trans);
9920 btrfs_end_log_trans(root);
9923 btrfs_end_transaction(trans);
9925 if (old_ino == BTRFS_FIRST_FREE_OBJECTID)
9926 up_read(&fs_info->subvol_sem);
9931 static int btrfs_rename2(struct inode *old_dir, struct dentry *old_dentry,
9932 struct inode *new_dir, struct dentry *new_dentry,
9935 if (flags & ~(RENAME_NOREPLACE | RENAME_EXCHANGE | RENAME_WHITEOUT))
9938 if (flags & RENAME_EXCHANGE)
9939 return btrfs_rename_exchange(old_dir, old_dentry, new_dir,
9942 return btrfs_rename(old_dir, old_dentry, new_dir, new_dentry, flags);
9945 static void btrfs_run_delalloc_work(struct btrfs_work *work)
9947 struct btrfs_delalloc_work *delalloc_work;
9948 struct inode *inode;
9950 delalloc_work = container_of(work, struct btrfs_delalloc_work,
9952 inode = delalloc_work->inode;
9953 filemap_flush(inode->i_mapping);
9954 if (test_bit(BTRFS_INODE_HAS_ASYNC_EXTENT,
9955 &BTRFS_I(inode)->runtime_flags))
9956 filemap_flush(inode->i_mapping);
9958 if (delalloc_work->delay_iput)
9959 btrfs_add_delayed_iput(inode);
9962 complete(&delalloc_work->completion);
9965 struct btrfs_delalloc_work *btrfs_alloc_delalloc_work(struct inode *inode,
9968 struct btrfs_delalloc_work *work;
9970 work = kmalloc(sizeof(*work), GFP_NOFS);
9974 init_completion(&work->completion);
9975 INIT_LIST_HEAD(&work->list);
9976 work->inode = inode;
9977 work->delay_iput = delay_iput;
9978 WARN_ON_ONCE(!inode);
9979 btrfs_init_work(&work->work, btrfs_flush_delalloc_helper,
9980 btrfs_run_delalloc_work, NULL, NULL);
9985 void btrfs_wait_and_free_delalloc_work(struct btrfs_delalloc_work *work)
9987 wait_for_completion(&work->completion);
9992 * some fairly slow code that needs optimization. This walks the list
9993 * of all the inodes with pending delalloc and forces them to disk.
9995 static int __start_delalloc_inodes(struct btrfs_root *root, int delay_iput,
9998 struct btrfs_inode *binode;
9999 struct inode *inode;
10000 struct btrfs_delalloc_work *work, *next;
10001 struct list_head works;
10002 struct list_head splice;
10005 INIT_LIST_HEAD(&works);
10006 INIT_LIST_HEAD(&splice);
10008 mutex_lock(&root->delalloc_mutex);
10009 spin_lock(&root->delalloc_lock);
10010 list_splice_init(&root->delalloc_inodes, &splice);
10011 while (!list_empty(&splice)) {
10012 binode = list_entry(splice.next, struct btrfs_inode,
10015 list_move_tail(&binode->delalloc_inodes,
10016 &root->delalloc_inodes);
10017 inode = igrab(&binode->vfs_inode);
10019 cond_resched_lock(&root->delalloc_lock);
10022 spin_unlock(&root->delalloc_lock);
10024 work = btrfs_alloc_delalloc_work(inode, delay_iput);
10027 btrfs_add_delayed_iput(inode);
10033 list_add_tail(&work->list, &works);
10034 btrfs_queue_work(root->fs_info->flush_workers,
10037 if (nr != -1 && ret >= nr)
10040 spin_lock(&root->delalloc_lock);
10042 spin_unlock(&root->delalloc_lock);
10045 list_for_each_entry_safe(work, next, &works, list) {
10046 list_del_init(&work->list);
10047 btrfs_wait_and_free_delalloc_work(work);
10050 if (!list_empty_careful(&splice)) {
10051 spin_lock(&root->delalloc_lock);
10052 list_splice_tail(&splice, &root->delalloc_inodes);
10053 spin_unlock(&root->delalloc_lock);
10055 mutex_unlock(&root->delalloc_mutex);
10059 int btrfs_start_delalloc_inodes(struct btrfs_root *root, int delay_iput)
10061 struct btrfs_fs_info *fs_info = root->fs_info;
10064 if (test_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state))
10067 ret = __start_delalloc_inodes(root, delay_iput, -1);
10071 * the filemap_flush will queue IO into the worker threads, but
10072 * we have to make sure the IO is actually started and that
10073 * ordered extents get created before we return
10075 atomic_inc(&fs_info->async_submit_draining);
10076 while (atomic_read(&fs_info->nr_async_submits) ||
10077 atomic_read(&fs_info->async_delalloc_pages)) {
10078 wait_event(fs_info->async_submit_wait,
10079 (atomic_read(&fs_info->nr_async_submits) == 0 &&
10080 atomic_read(&fs_info->async_delalloc_pages) == 0));
10082 atomic_dec(&fs_info->async_submit_draining);
10086 int btrfs_start_delalloc_roots(struct btrfs_fs_info *fs_info, int delay_iput,
10089 struct btrfs_root *root;
10090 struct list_head splice;
10093 if (test_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state))
10096 INIT_LIST_HEAD(&splice);
10098 mutex_lock(&fs_info->delalloc_root_mutex);
10099 spin_lock(&fs_info->delalloc_root_lock);
10100 list_splice_init(&fs_info->delalloc_roots, &splice);
10101 while (!list_empty(&splice) && nr) {
10102 root = list_first_entry(&splice, struct btrfs_root,
10104 root = btrfs_grab_fs_root(root);
10106 list_move_tail(&root->delalloc_root,
10107 &fs_info->delalloc_roots);
10108 spin_unlock(&fs_info->delalloc_root_lock);
10110 ret = __start_delalloc_inodes(root, delay_iput, nr);
10111 btrfs_put_fs_root(root);
10119 spin_lock(&fs_info->delalloc_root_lock);
10121 spin_unlock(&fs_info->delalloc_root_lock);
10124 atomic_inc(&fs_info->async_submit_draining);
10125 while (atomic_read(&fs_info->nr_async_submits) ||
10126 atomic_read(&fs_info->async_delalloc_pages)) {
10127 wait_event(fs_info->async_submit_wait,
10128 (atomic_read(&fs_info->nr_async_submits) == 0 &&
10129 atomic_read(&fs_info->async_delalloc_pages) == 0));
10131 atomic_dec(&fs_info->async_submit_draining);
10133 if (!list_empty_careful(&splice)) {
10134 spin_lock(&fs_info->delalloc_root_lock);
10135 list_splice_tail(&splice, &fs_info->delalloc_roots);
10136 spin_unlock(&fs_info->delalloc_root_lock);
10138 mutex_unlock(&fs_info->delalloc_root_mutex);
10142 static int btrfs_symlink(struct inode *dir, struct dentry *dentry,
10143 const char *symname)
10145 struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
10146 struct btrfs_trans_handle *trans;
10147 struct btrfs_root *root = BTRFS_I(dir)->root;
10148 struct btrfs_path *path;
10149 struct btrfs_key key;
10150 struct inode *inode = NULL;
10152 int drop_inode = 0;
10158 struct btrfs_file_extent_item *ei;
10159 struct extent_buffer *leaf;
10161 name_len = strlen(symname);
10162 if (name_len > BTRFS_MAX_INLINE_DATA_SIZE(fs_info))
10163 return -ENAMETOOLONG;
10166 * 2 items for inode item and ref
10167 * 2 items for dir items
10168 * 1 item for updating parent inode item
10169 * 1 item for the inline extent item
10170 * 1 item for xattr if selinux is on
10172 trans = btrfs_start_transaction(root, 7);
10174 return PTR_ERR(trans);
10176 err = btrfs_find_free_ino(root, &objectid);
10180 inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name,
10181 dentry->d_name.len, btrfs_ino(BTRFS_I(dir)),
10182 objectid, S_IFLNK|S_IRWXUGO, &index);
10183 if (IS_ERR(inode)) {
10184 err = PTR_ERR(inode);
10189 * If the active LSM wants to access the inode during
10190 * d_instantiate it needs these. Smack checks to see
10191 * if the filesystem supports xattrs by looking at the
10194 inode->i_fop = &btrfs_file_operations;
10195 inode->i_op = &btrfs_file_inode_operations;
10196 inode->i_mapping->a_ops = &btrfs_aops;
10197 BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops;
10199 err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name);
10201 goto out_unlock_inode;
10203 path = btrfs_alloc_path();
10206 goto out_unlock_inode;
10208 key.objectid = btrfs_ino(BTRFS_I(inode));
10210 key.type = BTRFS_EXTENT_DATA_KEY;
10211 datasize = btrfs_file_extent_calc_inline_size(name_len);
10212 err = btrfs_insert_empty_item(trans, root, path, &key,
10215 btrfs_free_path(path);
10216 goto out_unlock_inode;
10218 leaf = path->nodes[0];
10219 ei = btrfs_item_ptr(leaf, path->slots[0],
10220 struct btrfs_file_extent_item);
10221 btrfs_set_file_extent_generation(leaf, ei, trans->transid);
10222 btrfs_set_file_extent_type(leaf, ei,
10223 BTRFS_FILE_EXTENT_INLINE);
10224 btrfs_set_file_extent_encryption(leaf, ei, 0);
10225 btrfs_set_file_extent_compression(leaf, ei, 0);
10226 btrfs_set_file_extent_other_encoding(leaf, ei, 0);
10227 btrfs_set_file_extent_ram_bytes(leaf, ei, name_len);
10229 ptr = btrfs_file_extent_inline_start(ei);
10230 write_extent_buffer(leaf, symname, ptr, name_len);
10231 btrfs_mark_buffer_dirty(leaf);
10232 btrfs_free_path(path);
10234 inode->i_op = &btrfs_symlink_inode_operations;
10235 inode_nohighmem(inode);
10236 inode->i_mapping->a_ops = &btrfs_symlink_aops;
10237 inode_set_bytes(inode, name_len);
10238 btrfs_i_size_write(BTRFS_I(inode), name_len);
10239 err = btrfs_update_inode(trans, root, inode);
10241 * Last step, add directory indexes for our symlink inode. This is the
10242 * last step to avoid extra cleanup of these indexes if an error happens
10246 err = btrfs_add_nondir(trans, BTRFS_I(dir), dentry,
10247 BTRFS_I(inode), 0, index);
10250 goto out_unlock_inode;
10253 unlock_new_inode(inode);
10254 d_instantiate(dentry, inode);
10257 btrfs_end_transaction(trans);
10259 inode_dec_link_count(inode);
10262 btrfs_btree_balance_dirty(fs_info);
10267 unlock_new_inode(inode);
10271 static int __btrfs_prealloc_file_range(struct inode *inode, int mode,
10272 u64 start, u64 num_bytes, u64 min_size,
10273 loff_t actual_len, u64 *alloc_hint,
10274 struct btrfs_trans_handle *trans)
10276 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
10277 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
10278 struct extent_map *em;
10279 struct btrfs_root *root = BTRFS_I(inode)->root;
10280 struct btrfs_key ins;
10281 u64 cur_offset = start;
10284 u64 last_alloc = (u64)-1;
10286 bool own_trans = true;
10287 u64 end = start + num_bytes - 1;
10291 while (num_bytes > 0) {
10293 trans = btrfs_start_transaction(root, 3);
10294 if (IS_ERR(trans)) {
10295 ret = PTR_ERR(trans);
10300 cur_bytes = min_t(u64, num_bytes, SZ_256M);
10301 cur_bytes = max(cur_bytes, min_size);
10303 * If we are severely fragmented we could end up with really
10304 * small allocations, so if the allocator is returning small
10305 * chunks lets make its job easier by only searching for those
10308 cur_bytes = min(cur_bytes, last_alloc);
10309 ret = btrfs_reserve_extent(root, cur_bytes, cur_bytes,
10310 min_size, 0, *alloc_hint, &ins, 1, 0);
10313 btrfs_end_transaction(trans);
10316 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
10318 last_alloc = ins.offset;
10319 ret = insert_reserved_file_extent(trans, inode,
10320 cur_offset, ins.objectid,
10321 ins.offset, ins.offset,
10322 ins.offset, 0, 0, 0,
10323 BTRFS_FILE_EXTENT_PREALLOC);
10325 btrfs_free_reserved_extent(fs_info, ins.objectid,
10327 btrfs_abort_transaction(trans, ret);
10329 btrfs_end_transaction(trans);
10333 btrfs_drop_extent_cache(BTRFS_I(inode), cur_offset,
10334 cur_offset + ins.offset -1, 0);
10336 em = alloc_extent_map();
10338 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC,
10339 &BTRFS_I(inode)->runtime_flags);
10343 em->start = cur_offset;
10344 em->orig_start = cur_offset;
10345 em->len = ins.offset;
10346 em->block_start = ins.objectid;
10347 em->block_len = ins.offset;
10348 em->orig_block_len = ins.offset;
10349 em->ram_bytes = ins.offset;
10350 em->bdev = fs_info->fs_devices->latest_bdev;
10351 set_bit(EXTENT_FLAG_PREALLOC, &em->flags);
10352 em->generation = trans->transid;
10355 write_lock(&em_tree->lock);
10356 ret = add_extent_mapping(em_tree, em, 1);
10357 write_unlock(&em_tree->lock);
10358 if (ret != -EEXIST)
10360 btrfs_drop_extent_cache(BTRFS_I(inode), cur_offset,
10361 cur_offset + ins.offset - 1,
10364 free_extent_map(em);
10366 num_bytes -= ins.offset;
10367 cur_offset += ins.offset;
10368 *alloc_hint = ins.objectid + ins.offset;
10370 inode_inc_iversion(inode);
10371 inode->i_ctime = current_time(inode);
10372 BTRFS_I(inode)->flags |= BTRFS_INODE_PREALLOC;
10373 if (!(mode & FALLOC_FL_KEEP_SIZE) &&
10374 (actual_len > inode->i_size) &&
10375 (cur_offset > inode->i_size)) {
10376 if (cur_offset > actual_len)
10377 i_size = actual_len;
10379 i_size = cur_offset;
10380 i_size_write(inode, i_size);
10381 btrfs_ordered_update_i_size(inode, i_size, NULL);
10384 ret = btrfs_update_inode(trans, root, inode);
10387 btrfs_abort_transaction(trans, ret);
10389 btrfs_end_transaction(trans);
10394 btrfs_end_transaction(trans);
10396 if (cur_offset < end)
10397 btrfs_free_reserved_data_space(inode, cur_offset,
10398 end - cur_offset + 1);
10402 int btrfs_prealloc_file_range(struct inode *inode, int mode,
10403 u64 start, u64 num_bytes, u64 min_size,
10404 loff_t actual_len, u64 *alloc_hint)
10406 return __btrfs_prealloc_file_range(inode, mode, start, num_bytes,
10407 min_size, actual_len, alloc_hint,
10411 int btrfs_prealloc_file_range_trans(struct inode *inode,
10412 struct btrfs_trans_handle *trans, int mode,
10413 u64 start, u64 num_bytes, u64 min_size,
10414 loff_t actual_len, u64 *alloc_hint)
10416 return __btrfs_prealloc_file_range(inode, mode, start, num_bytes,
10417 min_size, actual_len, alloc_hint, trans);
10420 static int btrfs_set_page_dirty(struct page *page)
10422 return __set_page_dirty_nobuffers(page);
10425 static int btrfs_permission(struct inode *inode, int mask)
10427 struct btrfs_root *root = BTRFS_I(inode)->root;
10428 umode_t mode = inode->i_mode;
10430 if (mask & MAY_WRITE &&
10431 (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode))) {
10432 if (btrfs_root_readonly(root))
10434 if (BTRFS_I(inode)->flags & BTRFS_INODE_READONLY)
10437 return generic_permission(inode, mask);
10440 static int btrfs_tmpfile(struct inode *dir, struct dentry *dentry, umode_t mode)
10442 struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
10443 struct btrfs_trans_handle *trans;
10444 struct btrfs_root *root = BTRFS_I(dir)->root;
10445 struct inode *inode = NULL;
10451 * 5 units required for adding orphan entry
10453 trans = btrfs_start_transaction(root, 5);
10455 return PTR_ERR(trans);
10457 ret = btrfs_find_free_ino(root, &objectid);
10461 inode = btrfs_new_inode(trans, root, dir, NULL, 0,
10462 btrfs_ino(BTRFS_I(dir)), objectid, mode, &index);
10463 if (IS_ERR(inode)) {
10464 ret = PTR_ERR(inode);
10469 inode->i_fop = &btrfs_file_operations;
10470 inode->i_op = &btrfs_file_inode_operations;
10472 inode->i_mapping->a_ops = &btrfs_aops;
10473 BTRFS_I(inode)->io_tree.ops = &btrfs_extent_io_ops;
10475 ret = btrfs_init_inode_security(trans, inode, dir, NULL);
10479 ret = btrfs_update_inode(trans, root, inode);
10482 ret = btrfs_orphan_add(trans, BTRFS_I(inode));
10487 * We set number of links to 0 in btrfs_new_inode(), and here we set
10488 * it to 1 because d_tmpfile() will issue a warning if the count is 0,
10491 * d_tmpfile() -> inode_dec_link_count() -> drop_nlink()
10493 set_nlink(inode, 1);
10494 unlock_new_inode(inode);
10495 d_tmpfile(dentry, inode);
10496 mark_inode_dirty(inode);
10499 btrfs_end_transaction(trans);
10502 btrfs_balance_delayed_items(fs_info);
10503 btrfs_btree_balance_dirty(fs_info);
10507 unlock_new_inode(inode);
10512 static const struct inode_operations btrfs_dir_inode_operations = {
10513 .getattr = btrfs_getattr,
10514 .lookup = btrfs_lookup,
10515 .create = btrfs_create,
10516 .unlink = btrfs_unlink,
10517 .link = btrfs_link,
10518 .mkdir = btrfs_mkdir,
10519 .rmdir = btrfs_rmdir,
10520 .rename = btrfs_rename2,
10521 .symlink = btrfs_symlink,
10522 .setattr = btrfs_setattr,
10523 .mknod = btrfs_mknod,
10524 .listxattr = btrfs_listxattr,
10525 .permission = btrfs_permission,
10526 .get_acl = btrfs_get_acl,
10527 .set_acl = btrfs_set_acl,
10528 .update_time = btrfs_update_time,
10529 .tmpfile = btrfs_tmpfile,
10531 static const struct inode_operations btrfs_dir_ro_inode_operations = {
10532 .lookup = btrfs_lookup,
10533 .permission = btrfs_permission,
10534 .update_time = btrfs_update_time,
10537 static const struct file_operations btrfs_dir_file_operations = {
10538 .llseek = generic_file_llseek,
10539 .read = generic_read_dir,
10540 .iterate_shared = btrfs_real_readdir,
10541 .unlocked_ioctl = btrfs_ioctl,
10542 #ifdef CONFIG_COMPAT
10543 .compat_ioctl = btrfs_compat_ioctl,
10545 .release = btrfs_release_file,
10546 .fsync = btrfs_sync_file,
10549 static const struct extent_io_ops btrfs_extent_io_ops = {
10550 /* mandatory callbacks */
10551 .submit_bio_hook = btrfs_submit_bio_hook,
10552 .readpage_end_io_hook = btrfs_readpage_end_io_hook,
10553 .merge_bio_hook = btrfs_merge_bio_hook,
10555 /* optional callbacks */
10556 .fill_delalloc = run_delalloc_range,
10557 .writepage_end_io_hook = btrfs_writepage_end_io_hook,
10558 .writepage_start_hook = btrfs_writepage_start_hook,
10559 .set_bit_hook = btrfs_set_bit_hook,
10560 .clear_bit_hook = btrfs_clear_bit_hook,
10561 .merge_extent_hook = btrfs_merge_extent_hook,
10562 .split_extent_hook = btrfs_split_extent_hook,
10566 * btrfs doesn't support the bmap operation because swapfiles
10567 * use bmap to make a mapping of extents in the file. They assume
10568 * these extents won't change over the life of the file and they
10569 * use the bmap result to do IO directly to the drive.
10571 * the btrfs bmap call would return logical addresses that aren't
10572 * suitable for IO and they also will change frequently as COW
10573 * operations happen. So, swapfile + btrfs == corruption.
10575 * For now we're avoiding this by dropping bmap.
10577 static const struct address_space_operations btrfs_aops = {
10578 .readpage = btrfs_readpage,
10579 .writepage = btrfs_writepage,
10580 .writepages = btrfs_writepages,
10581 .readpages = btrfs_readpages,
10582 .direct_IO = btrfs_direct_IO,
10583 .invalidatepage = btrfs_invalidatepage,
10584 .releasepage = btrfs_releasepage,
10585 .set_page_dirty = btrfs_set_page_dirty,
10586 .error_remove_page = generic_error_remove_page,
10589 static const struct address_space_operations btrfs_symlink_aops = {
10590 .readpage = btrfs_readpage,
10591 .writepage = btrfs_writepage,
10592 .invalidatepage = btrfs_invalidatepage,
10593 .releasepage = btrfs_releasepage,
10596 static const struct inode_operations btrfs_file_inode_operations = {
10597 .getattr = btrfs_getattr,
10598 .setattr = btrfs_setattr,
10599 .listxattr = btrfs_listxattr,
10600 .permission = btrfs_permission,
10601 .fiemap = btrfs_fiemap,
10602 .get_acl = btrfs_get_acl,
10603 .set_acl = btrfs_set_acl,
10604 .update_time = btrfs_update_time,
10606 static const struct inode_operations btrfs_special_inode_operations = {
10607 .getattr = btrfs_getattr,
10608 .setattr = btrfs_setattr,
10609 .permission = btrfs_permission,
10610 .listxattr = btrfs_listxattr,
10611 .get_acl = btrfs_get_acl,
10612 .set_acl = btrfs_set_acl,
10613 .update_time = btrfs_update_time,
10615 static const struct inode_operations btrfs_symlink_inode_operations = {
10616 .get_link = page_get_link,
10617 .getattr = btrfs_getattr,
10618 .setattr = btrfs_setattr,
10619 .permission = btrfs_permission,
10620 .listxattr = btrfs_listxattr,
10621 .update_time = btrfs_update_time,
10624 const struct dentry_operations btrfs_dentry_operations = {
10625 .d_delete = btrfs_dentry_delete,
10626 .d_release = btrfs_dentry_release,