1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (C) 2007 Oracle. All rights reserved.
6 #include <crypto/hash.h>
7 #include <linux/kernel.h>
9 #include <linux/file.h>
11 #include <linux/pagemap.h>
12 #include <linux/highmem.h>
13 #include <linux/time.h>
14 #include <linux/init.h>
15 #include <linux/string.h>
16 #include <linux/backing-dev.h>
17 #include <linux/writeback.h>
18 #include <linux/compat.h>
19 #include <linux/xattr.h>
20 #include <linux/posix_acl.h>
21 #include <linux/falloc.h>
22 #include <linux/slab.h>
23 #include <linux/ratelimit.h>
24 #include <linux/btrfs.h>
25 #include <linux/blkdev.h>
26 #include <linux/posix_acl_xattr.h>
27 #include <linux/uio.h>
28 #include <linux/magic.h>
29 #include <linux/iversion.h>
30 #include <linux/swap.h>
31 #include <linux/migrate.h>
32 #include <linux/sched/mm.h>
33 #include <linux/iomap.h>
34 #include <asm/unaligned.h>
38 #include "transaction.h"
39 #include "btrfs_inode.h"
40 #include "print-tree.h"
41 #include "ordered-data.h"
45 #include "compression.h"
47 #include "free-space-cache.h"
50 #include "delalloc-space.h"
51 #include "block-group.h"
52 #include "space-info.h"
55 struct btrfs_iget_args {
57 struct btrfs_root *root;
60 struct btrfs_dio_data {
64 struct extent_changeset *data_reserved;
67 static const struct inode_operations btrfs_dir_inode_operations;
68 static const struct inode_operations btrfs_symlink_inode_operations;
69 static const struct inode_operations btrfs_special_inode_operations;
70 static const struct inode_operations btrfs_file_inode_operations;
71 static const struct address_space_operations btrfs_aops;
72 static const struct file_operations btrfs_dir_file_operations;
74 static struct kmem_cache *btrfs_inode_cachep;
75 struct kmem_cache *btrfs_trans_handle_cachep;
76 struct kmem_cache *btrfs_path_cachep;
77 struct kmem_cache *btrfs_free_space_cachep;
78 struct kmem_cache *btrfs_free_space_bitmap_cachep;
80 static int btrfs_setsize(struct inode *inode, struct iattr *attr);
81 static int btrfs_truncate(struct inode *inode, bool skip_writeback);
82 static int btrfs_finish_ordered_io(struct btrfs_ordered_extent *ordered_extent);
83 static noinline int cow_file_range(struct btrfs_inode *inode,
84 struct page *locked_page,
85 u64 start, u64 end, int *page_started,
86 unsigned long *nr_written, int unlock);
87 static struct extent_map *create_io_em(struct btrfs_inode *inode, u64 start,
88 u64 len, u64 orig_start, u64 block_start,
89 u64 block_len, u64 orig_block_len,
90 u64 ram_bytes, int compress_type,
93 static void __endio_write_update_ordered(struct btrfs_inode *inode,
94 const u64 offset, const u64 bytes,
98 * btrfs_inode_lock - lock inode i_rwsem based on arguments passed
100 * ilock_flags can have the following bit set:
102 * BTRFS_ILOCK_SHARED - acquire a shared lock on the inode
103 * BTRFS_ILOCK_TRY - try to acquire the lock, if fails on first attempt
106 int btrfs_inode_lock(struct inode *inode, unsigned int ilock_flags)
108 if (ilock_flags & BTRFS_ILOCK_SHARED) {
109 if (ilock_flags & BTRFS_ILOCK_TRY) {
110 if (!inode_trylock_shared(inode))
115 inode_lock_shared(inode);
117 if (ilock_flags & BTRFS_ILOCK_TRY) {
118 if (!inode_trylock(inode))
129 * btrfs_inode_unlock - unock inode i_rwsem
131 * ilock_flags should contain the same bits set as passed to btrfs_inode_lock()
132 * to decide whether the lock acquired is shared or exclusive.
134 void btrfs_inode_unlock(struct inode *inode, unsigned int ilock_flags)
136 if (ilock_flags & BTRFS_ILOCK_SHARED)
137 inode_unlock_shared(inode);
143 * Cleanup all submitted ordered extents in specified range to handle errors
144 * from the btrfs_run_delalloc_range() callback.
146 * NOTE: caller must ensure that when an error happens, it can not call
147 * extent_clear_unlock_delalloc() to clear both the bits EXTENT_DO_ACCOUNTING
148 * and EXTENT_DELALLOC simultaneously, because that causes the reserved metadata
149 * to be released, which we want to happen only when finishing the ordered
150 * extent (btrfs_finish_ordered_io()).
152 static inline void btrfs_cleanup_ordered_extents(struct btrfs_inode *inode,
153 struct page *locked_page,
154 u64 offset, u64 bytes)
156 unsigned long index = offset >> PAGE_SHIFT;
157 unsigned long end_index = (offset + bytes - 1) >> PAGE_SHIFT;
158 u64 page_start = page_offset(locked_page);
159 u64 page_end = page_start + PAGE_SIZE - 1;
163 while (index <= end_index) {
164 page = find_get_page(inode->vfs_inode.i_mapping, index);
168 ClearPagePrivate2(page);
173 * In case this page belongs to the delalloc range being instantiated
174 * then skip it, since the first page of a range is going to be
175 * properly cleaned up by the caller of run_delalloc_range
177 if (page_start >= offset && page_end <= (offset + bytes - 1)) {
182 return __endio_write_update_ordered(inode, offset, bytes, false);
185 static int btrfs_dirty_inode(struct inode *inode);
187 static int btrfs_init_inode_security(struct btrfs_trans_handle *trans,
188 struct inode *inode, struct inode *dir,
189 const struct qstr *qstr)
193 err = btrfs_init_acl(trans, inode, dir);
195 err = btrfs_xattr_security_init(trans, inode, dir, qstr);
200 * this does all the hard work for inserting an inline extent into
201 * the btree. The caller should have done a btrfs_drop_extents so that
202 * no overlapping inline items exist in the btree
204 static int insert_inline_extent(struct btrfs_trans_handle *trans,
205 struct btrfs_path *path, bool extent_inserted,
206 struct btrfs_root *root, struct inode *inode,
207 u64 start, size_t size, size_t compressed_size,
209 struct page **compressed_pages)
211 struct extent_buffer *leaf;
212 struct page *page = NULL;
215 struct btrfs_file_extent_item *ei;
217 size_t cur_size = size;
218 unsigned long offset;
220 ASSERT((compressed_size > 0 && compressed_pages) ||
221 (compressed_size == 0 && !compressed_pages));
223 if (compressed_size && compressed_pages)
224 cur_size = compressed_size;
226 if (!extent_inserted) {
227 struct btrfs_key key;
230 key.objectid = btrfs_ino(BTRFS_I(inode));
232 key.type = BTRFS_EXTENT_DATA_KEY;
234 datasize = btrfs_file_extent_calc_inline_size(cur_size);
235 ret = btrfs_insert_empty_item(trans, root, path, &key,
240 leaf = path->nodes[0];
241 ei = btrfs_item_ptr(leaf, path->slots[0],
242 struct btrfs_file_extent_item);
243 btrfs_set_file_extent_generation(leaf, ei, trans->transid);
244 btrfs_set_file_extent_type(leaf, ei, BTRFS_FILE_EXTENT_INLINE);
245 btrfs_set_file_extent_encryption(leaf, ei, 0);
246 btrfs_set_file_extent_other_encoding(leaf, ei, 0);
247 btrfs_set_file_extent_ram_bytes(leaf, ei, size);
248 ptr = btrfs_file_extent_inline_start(ei);
250 if (compress_type != BTRFS_COMPRESS_NONE) {
253 while (compressed_size > 0) {
254 cpage = compressed_pages[i];
255 cur_size = min_t(unsigned long, compressed_size,
258 kaddr = kmap_atomic(cpage);
259 write_extent_buffer(leaf, kaddr, ptr, cur_size);
260 kunmap_atomic(kaddr);
264 compressed_size -= cur_size;
266 btrfs_set_file_extent_compression(leaf, ei,
269 page = find_get_page(inode->i_mapping,
270 start >> PAGE_SHIFT);
271 btrfs_set_file_extent_compression(leaf, ei, 0);
272 kaddr = kmap_atomic(page);
273 offset = offset_in_page(start);
274 write_extent_buffer(leaf, kaddr + offset, ptr, size);
275 kunmap_atomic(kaddr);
278 btrfs_mark_buffer_dirty(leaf);
279 btrfs_release_path(path);
282 * We align size to sectorsize for inline extents just for simplicity
285 size = ALIGN(size, root->fs_info->sectorsize);
286 ret = btrfs_inode_set_file_extent_range(BTRFS_I(inode), start, size);
291 * we're an inline extent, so nobody can
292 * extend the file past i_size without locking
293 * a page we already have locked.
295 * We must do any isize and inode updates
296 * before we unlock the pages. Otherwise we
297 * could end up racing with unlink.
299 BTRFS_I(inode)->disk_i_size = inode->i_size;
306 * conditionally insert an inline extent into the file. This
307 * does the checks required to make sure the data is small enough
308 * to fit as an inline extent.
310 static noinline int cow_file_range_inline(struct btrfs_inode *inode, u64 start,
311 u64 end, size_t compressed_size,
313 struct page **compressed_pages)
315 struct btrfs_drop_extents_args drop_args = { 0 };
316 struct btrfs_root *root = inode->root;
317 struct btrfs_fs_info *fs_info = root->fs_info;
318 struct btrfs_trans_handle *trans;
319 u64 isize = i_size_read(&inode->vfs_inode);
320 u64 actual_end = min(end + 1, isize);
321 u64 inline_len = actual_end - start;
322 u64 aligned_end = ALIGN(end, fs_info->sectorsize);
323 u64 data_len = inline_len;
325 struct btrfs_path *path;
328 data_len = compressed_size;
331 actual_end > fs_info->sectorsize ||
332 data_len > BTRFS_MAX_INLINE_DATA_SIZE(fs_info) ||
334 (actual_end & (fs_info->sectorsize - 1)) == 0) ||
336 data_len > fs_info->max_inline) {
340 path = btrfs_alloc_path();
344 trans = btrfs_join_transaction(root);
346 btrfs_free_path(path);
347 return PTR_ERR(trans);
349 trans->block_rsv = &inode->block_rsv;
351 drop_args.path = path;
352 drop_args.start = start;
353 drop_args.end = aligned_end;
354 drop_args.drop_cache = true;
355 drop_args.replace_extent = true;
357 if (compressed_size && compressed_pages)
358 drop_args.extent_item_size = btrfs_file_extent_calc_inline_size(
361 drop_args.extent_item_size = btrfs_file_extent_calc_inline_size(
364 ret = btrfs_drop_extents(trans, root, inode, &drop_args);
366 btrfs_abort_transaction(trans, ret);
370 if (isize > actual_end)
371 inline_len = min_t(u64, isize, actual_end);
372 ret = insert_inline_extent(trans, path, drop_args.extent_inserted,
373 root, &inode->vfs_inode, start,
374 inline_len, compressed_size,
375 compress_type, compressed_pages);
376 if (ret && ret != -ENOSPC) {
377 btrfs_abort_transaction(trans, ret);
379 } else if (ret == -ENOSPC) {
384 btrfs_update_inode_bytes(inode, inline_len, drop_args.bytes_found);
385 ret = btrfs_update_inode(trans, root, inode);
386 if (ret && ret != -ENOSPC) {
387 btrfs_abort_transaction(trans, ret);
389 } else if (ret == -ENOSPC) {
394 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC, &inode->runtime_flags);
397 * Don't forget to free the reserved space, as for inlined extent
398 * it won't count as data extent, free them directly here.
399 * And at reserve time, it's always aligned to page size, so
400 * just free one page here.
402 btrfs_qgroup_free_data(inode, NULL, 0, PAGE_SIZE);
403 btrfs_free_path(path);
404 btrfs_end_transaction(trans);
408 struct async_extent {
413 unsigned long nr_pages;
415 struct list_head list;
420 struct page *locked_page;
423 unsigned int write_flags;
424 struct list_head extents;
425 struct cgroup_subsys_state *blkcg_css;
426 struct btrfs_work work;
431 /* Number of chunks in flight; must be first in the structure */
433 struct async_chunk chunks[];
436 static noinline int add_async_extent(struct async_chunk *cow,
437 u64 start, u64 ram_size,
440 unsigned long nr_pages,
443 struct async_extent *async_extent;
445 async_extent = kmalloc(sizeof(*async_extent), GFP_NOFS);
446 BUG_ON(!async_extent); /* -ENOMEM */
447 async_extent->start = start;
448 async_extent->ram_size = ram_size;
449 async_extent->compressed_size = compressed_size;
450 async_extent->pages = pages;
451 async_extent->nr_pages = nr_pages;
452 async_extent->compress_type = compress_type;
453 list_add_tail(&async_extent->list, &cow->extents);
458 * Check if the inode has flags compatible with compression
460 static inline bool inode_can_compress(struct btrfs_inode *inode)
462 if (inode->flags & BTRFS_INODE_NODATACOW ||
463 inode->flags & BTRFS_INODE_NODATASUM)
469 * Check if the inode needs to be submitted to compression, based on mount
470 * options, defragmentation, properties or heuristics.
472 static inline int inode_need_compress(struct btrfs_inode *inode, u64 start,
475 struct btrfs_fs_info *fs_info = inode->root->fs_info;
477 if (!inode_can_compress(inode)) {
478 WARN(IS_ENABLED(CONFIG_BTRFS_DEBUG),
479 KERN_ERR "BTRFS: unexpected compression for ino %llu\n",
484 if (btrfs_test_opt(fs_info, FORCE_COMPRESS))
487 if (inode->defrag_compress)
489 /* bad compression ratios */
490 if (inode->flags & BTRFS_INODE_NOCOMPRESS)
492 if (btrfs_test_opt(fs_info, COMPRESS) ||
493 inode->flags & BTRFS_INODE_COMPRESS ||
494 inode->prop_compress)
495 return btrfs_compress_heuristic(&inode->vfs_inode, start, end);
499 static inline void inode_should_defrag(struct btrfs_inode *inode,
500 u64 start, u64 end, u64 num_bytes, u64 small_write)
502 /* If this is a small write inside eof, kick off a defrag */
503 if (num_bytes < small_write &&
504 (start > 0 || end + 1 < inode->disk_i_size))
505 btrfs_add_inode_defrag(NULL, inode);
509 * we create compressed extents in two phases. The first
510 * phase compresses a range of pages that have already been
511 * locked (both pages and state bits are locked).
513 * This is done inside an ordered work queue, and the compression
514 * is spread across many cpus. The actual IO submission is step
515 * two, and the ordered work queue takes care of making sure that
516 * happens in the same order things were put onto the queue by
517 * writepages and friends.
519 * If this code finds it can't get good compression, it puts an
520 * entry onto the work queue to write the uncompressed bytes. This
521 * makes sure that both compressed inodes and uncompressed inodes
522 * are written in the same order that the flusher thread sent them
525 static noinline int compress_file_range(struct async_chunk *async_chunk)
527 struct inode *inode = async_chunk->inode;
528 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
529 u64 blocksize = fs_info->sectorsize;
530 u64 start = async_chunk->start;
531 u64 end = async_chunk->end;
535 struct page **pages = NULL;
536 unsigned long nr_pages;
537 unsigned long total_compressed = 0;
538 unsigned long total_in = 0;
541 int compress_type = fs_info->compress_type;
542 int compressed_extents = 0;
545 inode_should_defrag(BTRFS_I(inode), start, end, end - start + 1,
549 * We need to save i_size before now because it could change in between
550 * us evaluating the size and assigning it. This is because we lock and
551 * unlock the page in truncate and fallocate, and then modify the i_size
554 * The barriers are to emulate READ_ONCE, remove that once i_size_read
558 i_size = i_size_read(inode);
560 actual_end = min_t(u64, i_size, end + 1);
563 nr_pages = (end >> PAGE_SHIFT) - (start >> PAGE_SHIFT) + 1;
564 BUILD_BUG_ON((BTRFS_MAX_COMPRESSED % PAGE_SIZE) != 0);
565 nr_pages = min_t(unsigned long, nr_pages,
566 BTRFS_MAX_COMPRESSED / PAGE_SIZE);
569 * we don't want to send crud past the end of i_size through
570 * compression, that's just a waste of CPU time. So, if the
571 * end of the file is before the start of our current
572 * requested range of bytes, we bail out to the uncompressed
573 * cleanup code that can deal with all of this.
575 * It isn't really the fastest way to fix things, but this is a
576 * very uncommon corner.
578 if (actual_end <= start)
579 goto cleanup_and_bail_uncompressed;
581 total_compressed = actual_end - start;
584 * skip compression for a small file range(<=blocksize) that
585 * isn't an inline extent, since it doesn't save disk space at all.
587 if (total_compressed <= blocksize &&
588 (start > 0 || end + 1 < BTRFS_I(inode)->disk_i_size))
589 goto cleanup_and_bail_uncompressed;
591 total_compressed = min_t(unsigned long, total_compressed,
592 BTRFS_MAX_UNCOMPRESSED);
597 * we do compression for mount -o compress and when the
598 * inode has not been flagged as nocompress. This flag can
599 * change at any time if we discover bad compression ratios.
601 if (inode_need_compress(BTRFS_I(inode), start, end)) {
603 pages = kcalloc(nr_pages, sizeof(struct page *), GFP_NOFS);
605 /* just bail out to the uncompressed code */
610 if (BTRFS_I(inode)->defrag_compress)
611 compress_type = BTRFS_I(inode)->defrag_compress;
612 else if (BTRFS_I(inode)->prop_compress)
613 compress_type = BTRFS_I(inode)->prop_compress;
616 * we need to call clear_page_dirty_for_io on each
617 * page in the range. Otherwise applications with the file
618 * mmap'd can wander in and change the page contents while
619 * we are compressing them.
621 * If the compression fails for any reason, we set the pages
622 * dirty again later on.
624 * Note that the remaining part is redirtied, the start pointer
625 * has moved, the end is the original one.
628 extent_range_clear_dirty_for_io(inode, start, end);
632 /* Compression level is applied here and only here */
633 ret = btrfs_compress_pages(
634 compress_type | (fs_info->compress_level << 4),
635 inode->i_mapping, start,
642 unsigned long offset = offset_in_page(total_compressed);
643 struct page *page = pages[nr_pages - 1];
646 /* zero the tail end of the last page, we might be
647 * sending it down to disk
650 kaddr = kmap_atomic(page);
651 memset(kaddr + offset, 0,
653 kunmap_atomic(kaddr);
660 /* lets try to make an inline extent */
661 if (ret || total_in < actual_end) {
662 /* we didn't compress the entire range, try
663 * to make an uncompressed inline extent.
665 ret = cow_file_range_inline(BTRFS_I(inode), start, end,
666 0, BTRFS_COMPRESS_NONE,
669 /* try making a compressed inline extent */
670 ret = cow_file_range_inline(BTRFS_I(inode), start, end,
672 compress_type, pages);
675 unsigned long clear_flags = EXTENT_DELALLOC |
676 EXTENT_DELALLOC_NEW | EXTENT_DEFRAG |
677 EXTENT_DO_ACCOUNTING;
678 unsigned long page_error_op;
680 page_error_op = ret < 0 ? PAGE_SET_ERROR : 0;
683 * inline extent creation worked or returned error,
684 * we don't need to create any more async work items.
685 * Unlock and free up our temp pages.
687 * We use DO_ACCOUNTING here because we need the
688 * delalloc_release_metadata to be done _after_ we drop
689 * our outstanding extent for clearing delalloc for this
692 extent_clear_unlock_delalloc(BTRFS_I(inode), start, end,
696 PAGE_START_WRITEBACK |
701 * Ensure we only free the compressed pages if we have
702 * them allocated, as we can still reach here with
703 * inode_need_compress() == false.
706 for (i = 0; i < nr_pages; i++) {
707 WARN_ON(pages[i]->mapping);
718 * we aren't doing an inline extent round the compressed size
719 * up to a block size boundary so the allocator does sane
722 total_compressed = ALIGN(total_compressed, blocksize);
725 * one last check to make sure the compression is really a
726 * win, compare the page count read with the blocks on disk,
727 * compression must free at least one sector size
729 total_in = ALIGN(total_in, PAGE_SIZE);
730 if (total_compressed + blocksize <= total_in) {
731 compressed_extents++;
734 * The async work queues will take care of doing actual
735 * allocation on disk for these compressed pages, and
736 * will submit them to the elevator.
738 add_async_extent(async_chunk, start, total_in,
739 total_compressed, pages, nr_pages,
742 if (start + total_in < end) {
748 return compressed_extents;
753 * the compression code ran but failed to make things smaller,
754 * free any pages it allocated and our page pointer array
756 for (i = 0; i < nr_pages; i++) {
757 WARN_ON(pages[i]->mapping);
762 total_compressed = 0;
765 /* flag the file so we don't compress in the future */
766 if (!btrfs_test_opt(fs_info, FORCE_COMPRESS) &&
767 !(BTRFS_I(inode)->prop_compress)) {
768 BTRFS_I(inode)->flags |= BTRFS_INODE_NOCOMPRESS;
771 cleanup_and_bail_uncompressed:
773 * No compression, but we still need to write the pages in the file
774 * we've been given so far. redirty the locked page if it corresponds
775 * to our extent and set things up for the async work queue to run
776 * cow_file_range to do the normal delalloc dance.
778 if (async_chunk->locked_page &&
779 (page_offset(async_chunk->locked_page) >= start &&
780 page_offset(async_chunk->locked_page)) <= end) {
781 __set_page_dirty_nobuffers(async_chunk->locked_page);
782 /* unlocked later on in the async handlers */
786 extent_range_redirty_for_io(inode, start, end);
787 add_async_extent(async_chunk, start, end - start + 1, 0, NULL, 0,
788 BTRFS_COMPRESS_NONE);
789 compressed_extents++;
791 return compressed_extents;
794 static void free_async_extent_pages(struct async_extent *async_extent)
798 if (!async_extent->pages)
801 for (i = 0; i < async_extent->nr_pages; i++) {
802 WARN_ON(async_extent->pages[i]->mapping);
803 put_page(async_extent->pages[i]);
805 kfree(async_extent->pages);
806 async_extent->nr_pages = 0;
807 async_extent->pages = NULL;
811 * phase two of compressed writeback. This is the ordered portion
812 * of the code, which only gets called in the order the work was
813 * queued. We walk all the async extents created by compress_file_range
814 * and send them down to the disk.
816 static noinline void submit_compressed_extents(struct async_chunk *async_chunk)
818 struct btrfs_inode *inode = BTRFS_I(async_chunk->inode);
819 struct btrfs_fs_info *fs_info = inode->root->fs_info;
820 struct async_extent *async_extent;
822 struct btrfs_key ins;
823 struct extent_map *em;
824 struct btrfs_root *root = inode->root;
825 struct extent_io_tree *io_tree = &inode->io_tree;
829 while (!list_empty(&async_chunk->extents)) {
830 async_extent = list_entry(async_chunk->extents.next,
831 struct async_extent, list);
832 list_del(&async_extent->list);
835 lock_extent(io_tree, async_extent->start,
836 async_extent->start + async_extent->ram_size - 1);
837 /* did the compression code fall back to uncompressed IO? */
838 if (!async_extent->pages) {
839 int page_started = 0;
840 unsigned long nr_written = 0;
842 /* allocate blocks */
843 ret = cow_file_range(inode, async_chunk->locked_page,
845 async_extent->start +
846 async_extent->ram_size - 1,
847 &page_started, &nr_written, 0);
852 * if page_started, cow_file_range inserted an
853 * inline extent and took care of all the unlocking
854 * and IO for us. Otherwise, we need to submit
855 * all those pages down to the drive.
857 if (!page_started && !ret)
858 extent_write_locked_range(&inode->vfs_inode,
860 async_extent->start +
861 async_extent->ram_size - 1,
863 else if (ret && async_chunk->locked_page)
864 unlock_page(async_chunk->locked_page);
870 ret = btrfs_reserve_extent(root, async_extent->ram_size,
871 async_extent->compressed_size,
872 async_extent->compressed_size,
873 0, alloc_hint, &ins, 1, 1);
875 free_async_extent_pages(async_extent);
877 if (ret == -ENOSPC) {
878 unlock_extent(io_tree, async_extent->start,
879 async_extent->start +
880 async_extent->ram_size - 1);
883 * we need to redirty the pages if we decide to
884 * fallback to uncompressed IO, otherwise we
885 * will not submit these pages down to lower
888 extent_range_redirty_for_io(&inode->vfs_inode,
890 async_extent->start +
891 async_extent->ram_size - 1);
898 * here we're doing allocation and writeback of the
901 em = create_io_em(inode, async_extent->start,
902 async_extent->ram_size, /* len */
903 async_extent->start, /* orig_start */
904 ins.objectid, /* block_start */
905 ins.offset, /* block_len */
906 ins.offset, /* orig_block_len */
907 async_extent->ram_size, /* ram_bytes */
908 async_extent->compress_type,
909 BTRFS_ORDERED_COMPRESSED);
911 /* ret value is not necessary due to void function */
912 goto out_free_reserve;
915 ret = btrfs_add_ordered_extent_compress(inode,
918 async_extent->ram_size,
920 async_extent->compress_type);
922 btrfs_drop_extent_cache(inode, async_extent->start,
923 async_extent->start +
924 async_extent->ram_size - 1, 0);
925 goto out_free_reserve;
927 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
930 * clear dirty, set writeback and unlock the pages.
932 extent_clear_unlock_delalloc(inode, async_extent->start,
933 async_extent->start +
934 async_extent->ram_size - 1,
935 NULL, EXTENT_LOCKED | EXTENT_DELALLOC,
936 PAGE_UNLOCK | PAGE_START_WRITEBACK);
937 if (btrfs_submit_compressed_write(inode, async_extent->start,
938 async_extent->ram_size,
940 ins.offset, async_extent->pages,
941 async_extent->nr_pages,
942 async_chunk->write_flags,
943 async_chunk->blkcg_css)) {
944 struct page *p = async_extent->pages[0];
945 const u64 start = async_extent->start;
946 const u64 end = start + async_extent->ram_size - 1;
948 p->mapping = inode->vfs_inode.i_mapping;
949 btrfs_writepage_endio_finish_ordered(p, start, end, 0);
952 extent_clear_unlock_delalloc(inode, start, end, NULL, 0,
955 free_async_extent_pages(async_extent);
957 alloc_hint = ins.objectid + ins.offset;
963 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
964 btrfs_free_reserved_extent(fs_info, ins.objectid, ins.offset, 1);
966 extent_clear_unlock_delalloc(inode, async_extent->start,
967 async_extent->start +
968 async_extent->ram_size - 1,
969 NULL, EXTENT_LOCKED | EXTENT_DELALLOC |
970 EXTENT_DELALLOC_NEW |
971 EXTENT_DEFRAG | EXTENT_DO_ACCOUNTING,
972 PAGE_UNLOCK | PAGE_START_WRITEBACK |
973 PAGE_END_WRITEBACK | PAGE_SET_ERROR);
974 free_async_extent_pages(async_extent);
979 static u64 get_extent_allocation_hint(struct btrfs_inode *inode, u64 start,
982 struct extent_map_tree *em_tree = &inode->extent_tree;
983 struct extent_map *em;
986 read_lock(&em_tree->lock);
987 em = search_extent_mapping(em_tree, start, num_bytes);
990 * if block start isn't an actual block number then find the
991 * first block in this inode and use that as a hint. If that
992 * block is also bogus then just don't worry about it.
994 if (em->block_start >= EXTENT_MAP_LAST_BYTE) {
996 em = search_extent_mapping(em_tree, 0, 0);
997 if (em && em->block_start < EXTENT_MAP_LAST_BYTE)
998 alloc_hint = em->block_start;
1000 free_extent_map(em);
1002 alloc_hint = em->block_start;
1003 free_extent_map(em);
1006 read_unlock(&em_tree->lock);
1012 * when extent_io.c finds a delayed allocation range in the file,
1013 * the call backs end up in this code. The basic idea is to
1014 * allocate extents on disk for the range, and create ordered data structs
1015 * in ram to track those extents.
1017 * locked_page is the page that writepage had locked already. We use
1018 * it to make sure we don't do extra locks or unlocks.
1020 * *page_started is set to one if we unlock locked_page and do everything
1021 * required to start IO on it. It may be clean and already done with
1022 * IO when we return.
1024 static noinline int cow_file_range(struct btrfs_inode *inode,
1025 struct page *locked_page,
1026 u64 start, u64 end, int *page_started,
1027 unsigned long *nr_written, int unlock)
1029 struct btrfs_root *root = inode->root;
1030 struct btrfs_fs_info *fs_info = root->fs_info;
1033 unsigned long ram_size;
1034 u64 cur_alloc_size = 0;
1036 u64 blocksize = fs_info->sectorsize;
1037 struct btrfs_key ins;
1038 struct extent_map *em;
1039 unsigned clear_bits;
1040 unsigned long page_ops;
1041 bool extent_reserved = false;
1044 if (btrfs_is_free_space_inode(inode)) {
1050 num_bytes = ALIGN(end - start + 1, blocksize);
1051 num_bytes = max(blocksize, num_bytes);
1052 ASSERT(num_bytes <= btrfs_super_total_bytes(fs_info->super_copy));
1054 inode_should_defrag(inode, start, end, num_bytes, SZ_64K);
1057 /* lets try to make an inline extent */
1058 ret = cow_file_range_inline(inode, start, end, 0,
1059 BTRFS_COMPRESS_NONE, NULL);
1062 * We use DO_ACCOUNTING here because we need the
1063 * delalloc_release_metadata to be run _after_ we drop
1064 * our outstanding extent for clearing delalloc for this
1067 extent_clear_unlock_delalloc(inode, start, end, NULL,
1068 EXTENT_LOCKED | EXTENT_DELALLOC |
1069 EXTENT_DELALLOC_NEW | EXTENT_DEFRAG |
1070 EXTENT_DO_ACCOUNTING, PAGE_UNLOCK |
1071 PAGE_START_WRITEBACK | PAGE_END_WRITEBACK);
1072 *nr_written = *nr_written +
1073 (end - start + PAGE_SIZE) / PAGE_SIZE;
1076 } else if (ret < 0) {
1081 alloc_hint = get_extent_allocation_hint(inode, start, num_bytes);
1082 btrfs_drop_extent_cache(inode, start, start + num_bytes - 1, 0);
1085 * Relocation relies on the relocated extents to have exactly the same
1086 * size as the original extents. Normally writeback for relocation data
1087 * extents follows a NOCOW path because relocation preallocates the
1088 * extents. However, due to an operation such as scrub turning a block
1089 * group to RO mode, it may fallback to COW mode, so we must make sure
1090 * an extent allocated during COW has exactly the requested size and can
1091 * not be split into smaller extents, otherwise relocation breaks and
1092 * fails during the stage where it updates the bytenr of file extent
1095 if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID)
1096 min_alloc_size = num_bytes;
1098 min_alloc_size = fs_info->sectorsize;
1100 while (num_bytes > 0) {
1101 cur_alloc_size = num_bytes;
1102 ret = btrfs_reserve_extent(root, cur_alloc_size, cur_alloc_size,
1103 min_alloc_size, 0, alloc_hint,
1107 cur_alloc_size = ins.offset;
1108 extent_reserved = true;
1110 ram_size = ins.offset;
1111 em = create_io_em(inode, start, ins.offset, /* len */
1112 start, /* orig_start */
1113 ins.objectid, /* block_start */
1114 ins.offset, /* block_len */
1115 ins.offset, /* orig_block_len */
1116 ram_size, /* ram_bytes */
1117 BTRFS_COMPRESS_NONE, /* compress_type */
1118 BTRFS_ORDERED_REGULAR /* type */);
1123 free_extent_map(em);
1125 ret = btrfs_add_ordered_extent(inode, start, ins.objectid,
1126 ram_size, cur_alloc_size,
1127 BTRFS_ORDERED_REGULAR);
1129 goto out_drop_extent_cache;
1131 if (root->root_key.objectid ==
1132 BTRFS_DATA_RELOC_TREE_OBJECTID) {
1133 ret = btrfs_reloc_clone_csums(inode, start,
1136 * Only drop cache here, and process as normal.
1138 * We must not allow extent_clear_unlock_delalloc()
1139 * at out_unlock label to free meta of this ordered
1140 * extent, as its meta should be freed by
1141 * btrfs_finish_ordered_io().
1143 * So we must continue until @start is increased to
1144 * skip current ordered extent.
1147 btrfs_drop_extent_cache(inode, start,
1148 start + ram_size - 1, 0);
1151 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
1153 /* we're not doing compressed IO, don't unlock the first
1154 * page (which the caller expects to stay locked), don't
1155 * clear any dirty bits and don't set any writeback bits
1157 * Do set the Private2 bit so we know this page was properly
1158 * setup for writepage
1160 page_ops = unlock ? PAGE_UNLOCK : 0;
1161 page_ops |= PAGE_SET_PRIVATE2;
1163 extent_clear_unlock_delalloc(inode, start, start + ram_size - 1,
1165 EXTENT_LOCKED | EXTENT_DELALLOC,
1167 if (num_bytes < cur_alloc_size)
1170 num_bytes -= cur_alloc_size;
1171 alloc_hint = ins.objectid + ins.offset;
1172 start += cur_alloc_size;
1173 extent_reserved = false;
1176 * btrfs_reloc_clone_csums() error, since start is increased
1177 * extent_clear_unlock_delalloc() at out_unlock label won't
1178 * free metadata of current ordered extent, we're OK to exit.
1186 out_drop_extent_cache:
1187 btrfs_drop_extent_cache(inode, start, start + ram_size - 1, 0);
1189 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
1190 btrfs_free_reserved_extent(fs_info, ins.objectid, ins.offset, 1);
1192 clear_bits = EXTENT_LOCKED | EXTENT_DELALLOC | EXTENT_DELALLOC_NEW |
1193 EXTENT_DEFRAG | EXTENT_CLEAR_META_RESV;
1194 page_ops = PAGE_UNLOCK | PAGE_START_WRITEBACK | PAGE_END_WRITEBACK;
1196 * If we reserved an extent for our delalloc range (or a subrange) and
1197 * failed to create the respective ordered extent, then it means that
1198 * when we reserved the extent we decremented the extent's size from
1199 * the data space_info's bytes_may_use counter and incremented the
1200 * space_info's bytes_reserved counter by the same amount. We must make
1201 * sure extent_clear_unlock_delalloc() does not try to decrement again
1202 * the data space_info's bytes_may_use counter, therefore we do not pass
1203 * it the flag EXTENT_CLEAR_DATA_RESV.
1205 if (extent_reserved) {
1206 extent_clear_unlock_delalloc(inode, start,
1207 start + cur_alloc_size - 1,
1211 start += cur_alloc_size;
1215 extent_clear_unlock_delalloc(inode, start, end, locked_page,
1216 clear_bits | EXTENT_CLEAR_DATA_RESV,
1222 * work queue call back to started compression on a file and pages
1224 static noinline void async_cow_start(struct btrfs_work *work)
1226 struct async_chunk *async_chunk;
1227 int compressed_extents;
1229 async_chunk = container_of(work, struct async_chunk, work);
1231 compressed_extents = compress_file_range(async_chunk);
1232 if (compressed_extents == 0) {
1233 btrfs_add_delayed_iput(async_chunk->inode);
1234 async_chunk->inode = NULL;
1239 * work queue call back to submit previously compressed pages
1241 static noinline void async_cow_submit(struct btrfs_work *work)
1243 struct async_chunk *async_chunk = container_of(work, struct async_chunk,
1245 struct btrfs_fs_info *fs_info = btrfs_work_owner(work);
1246 unsigned long nr_pages;
1248 nr_pages = (async_chunk->end - async_chunk->start + PAGE_SIZE) >>
1251 /* atomic_sub_return implies a barrier */
1252 if (atomic_sub_return(nr_pages, &fs_info->async_delalloc_pages) <
1254 cond_wake_up_nomb(&fs_info->async_submit_wait);
1257 * ->inode could be NULL if async_chunk_start has failed to compress,
1258 * in which case we don't have anything to submit, yet we need to
1259 * always adjust ->async_delalloc_pages as its paired with the init
1260 * happening in cow_file_range_async
1262 if (async_chunk->inode)
1263 submit_compressed_extents(async_chunk);
1266 static noinline void async_cow_free(struct btrfs_work *work)
1268 struct async_chunk *async_chunk;
1270 async_chunk = container_of(work, struct async_chunk, work);
1271 if (async_chunk->inode)
1272 btrfs_add_delayed_iput(async_chunk->inode);
1273 if (async_chunk->blkcg_css)
1274 css_put(async_chunk->blkcg_css);
1276 * Since the pointer to 'pending' is at the beginning of the array of
1277 * async_chunk's, freeing it ensures the whole array has been freed.
1279 if (atomic_dec_and_test(async_chunk->pending))
1280 kvfree(async_chunk->pending);
1283 static int cow_file_range_async(struct btrfs_inode *inode,
1284 struct writeback_control *wbc,
1285 struct page *locked_page,
1286 u64 start, u64 end, int *page_started,
1287 unsigned long *nr_written)
1289 struct btrfs_fs_info *fs_info = inode->root->fs_info;
1290 struct cgroup_subsys_state *blkcg_css = wbc_blkcg_css(wbc);
1291 struct async_cow *ctx;
1292 struct async_chunk *async_chunk;
1293 unsigned long nr_pages;
1295 u64 num_chunks = DIV_ROUND_UP(end - start, SZ_512K);
1297 bool should_compress;
1299 const unsigned int write_flags = wbc_to_write_flags(wbc);
1301 unlock_extent(&inode->io_tree, start, end);
1303 if (inode->flags & BTRFS_INODE_NOCOMPRESS &&
1304 !btrfs_test_opt(fs_info, FORCE_COMPRESS)) {
1306 should_compress = false;
1308 should_compress = true;
1311 nofs_flag = memalloc_nofs_save();
1312 ctx = kvmalloc(struct_size(ctx, chunks, num_chunks), GFP_KERNEL);
1313 memalloc_nofs_restore(nofs_flag);
1316 unsigned clear_bits = EXTENT_LOCKED | EXTENT_DELALLOC |
1317 EXTENT_DELALLOC_NEW | EXTENT_DEFRAG |
1318 EXTENT_DO_ACCOUNTING;
1319 unsigned long page_ops = PAGE_UNLOCK | PAGE_START_WRITEBACK |
1320 PAGE_END_WRITEBACK | PAGE_SET_ERROR;
1322 extent_clear_unlock_delalloc(inode, start, end, locked_page,
1323 clear_bits, page_ops);
1327 async_chunk = ctx->chunks;
1328 atomic_set(&ctx->num_chunks, num_chunks);
1330 for (i = 0; i < num_chunks; i++) {
1331 if (should_compress)
1332 cur_end = min(end, start + SZ_512K - 1);
1337 * igrab is called higher up in the call chain, take only the
1338 * lightweight reference for the callback lifetime
1340 ihold(&inode->vfs_inode);
1341 async_chunk[i].pending = &ctx->num_chunks;
1342 async_chunk[i].inode = &inode->vfs_inode;
1343 async_chunk[i].start = start;
1344 async_chunk[i].end = cur_end;
1345 async_chunk[i].write_flags = write_flags;
1346 INIT_LIST_HEAD(&async_chunk[i].extents);
1349 * The locked_page comes all the way from writepage and its
1350 * the original page we were actually given. As we spread
1351 * this large delalloc region across multiple async_chunk
1352 * structs, only the first struct needs a pointer to locked_page
1354 * This way we don't need racey decisions about who is supposed
1359 * Depending on the compressibility, the pages might or
1360 * might not go through async. We want all of them to
1361 * be accounted against wbc once. Let's do it here
1362 * before the paths diverge. wbc accounting is used
1363 * only for foreign writeback detection and doesn't
1364 * need full accuracy. Just account the whole thing
1365 * against the first page.
1367 wbc_account_cgroup_owner(wbc, locked_page,
1369 async_chunk[i].locked_page = locked_page;
1372 async_chunk[i].locked_page = NULL;
1375 if (blkcg_css != blkcg_root_css) {
1377 async_chunk[i].blkcg_css = blkcg_css;
1379 async_chunk[i].blkcg_css = NULL;
1382 btrfs_init_work(&async_chunk[i].work, async_cow_start,
1383 async_cow_submit, async_cow_free);
1385 nr_pages = DIV_ROUND_UP(cur_end - start, PAGE_SIZE);
1386 atomic_add(nr_pages, &fs_info->async_delalloc_pages);
1388 btrfs_queue_work(fs_info->delalloc_workers, &async_chunk[i].work);
1390 *nr_written += nr_pages;
1391 start = cur_end + 1;
1397 static noinline int run_delalloc_zoned(struct btrfs_inode *inode,
1398 struct page *locked_page, u64 start,
1399 u64 end, int *page_started,
1400 unsigned long *nr_written)
1404 ret = cow_file_range(inode, locked_page, start, end, page_started,
1412 __set_page_dirty_nobuffers(locked_page);
1413 account_page_redirty(locked_page);
1414 extent_write_locked_range(&inode->vfs_inode, start, end, WB_SYNC_ALL);
1420 static noinline int csum_exist_in_range(struct btrfs_fs_info *fs_info,
1421 u64 bytenr, u64 num_bytes)
1424 struct btrfs_ordered_sum *sums;
1427 ret = btrfs_lookup_csums_range(fs_info->csum_root, bytenr,
1428 bytenr + num_bytes - 1, &list, 0);
1429 if (ret == 0 && list_empty(&list))
1432 while (!list_empty(&list)) {
1433 sums = list_entry(list.next, struct btrfs_ordered_sum, list);
1434 list_del(&sums->list);
1442 static int fallback_to_cow(struct btrfs_inode *inode, struct page *locked_page,
1443 const u64 start, const u64 end,
1444 int *page_started, unsigned long *nr_written)
1446 const bool is_space_ino = btrfs_is_free_space_inode(inode);
1447 const bool is_reloc_ino = (inode->root->root_key.objectid ==
1448 BTRFS_DATA_RELOC_TREE_OBJECTID);
1449 const u64 range_bytes = end + 1 - start;
1450 struct extent_io_tree *io_tree = &inode->io_tree;
1451 u64 range_start = start;
1455 * If EXTENT_NORESERVE is set it means that when the buffered write was
1456 * made we had not enough available data space and therefore we did not
1457 * reserve data space for it, since we though we could do NOCOW for the
1458 * respective file range (either there is prealloc extent or the inode
1459 * has the NOCOW bit set).
1461 * However when we need to fallback to COW mode (because for example the
1462 * block group for the corresponding extent was turned to RO mode by a
1463 * scrub or relocation) we need to do the following:
1465 * 1) We increment the bytes_may_use counter of the data space info.
1466 * If COW succeeds, it allocates a new data extent and after doing
1467 * that it decrements the space info's bytes_may_use counter and
1468 * increments its bytes_reserved counter by the same amount (we do
1469 * this at btrfs_add_reserved_bytes()). So we need to increment the
1470 * bytes_may_use counter to compensate (when space is reserved at
1471 * buffered write time, the bytes_may_use counter is incremented);
1473 * 2) We clear the EXTENT_NORESERVE bit from the range. We do this so
1474 * that if the COW path fails for any reason, it decrements (through
1475 * extent_clear_unlock_delalloc()) the bytes_may_use counter of the
1476 * data space info, which we incremented in the step above.
1478 * If we need to fallback to cow and the inode corresponds to a free
1479 * space cache inode or an inode of the data relocation tree, we must
1480 * also increment bytes_may_use of the data space_info for the same
1481 * reason. Space caches and relocated data extents always get a prealloc
1482 * extent for them, however scrub or balance may have set the block
1483 * group that contains that extent to RO mode and therefore force COW
1484 * when starting writeback.
1486 count = count_range_bits(io_tree, &range_start, end, range_bytes,
1487 EXTENT_NORESERVE, 0);
1488 if (count > 0 || is_space_ino || is_reloc_ino) {
1490 struct btrfs_fs_info *fs_info = inode->root->fs_info;
1491 struct btrfs_space_info *sinfo = fs_info->data_sinfo;
1493 if (is_space_ino || is_reloc_ino)
1494 bytes = range_bytes;
1496 spin_lock(&sinfo->lock);
1497 btrfs_space_info_update_bytes_may_use(fs_info, sinfo, bytes);
1498 spin_unlock(&sinfo->lock);
1501 clear_extent_bit(io_tree, start, end, EXTENT_NORESERVE,
1505 return cow_file_range(inode, locked_page, start, end, page_started,
1510 * when nowcow writeback call back. This checks for snapshots or COW copies
1511 * of the extents that exist in the file, and COWs the file as required.
1513 * If no cow copies or snapshots exist, we write directly to the existing
1516 static noinline int run_delalloc_nocow(struct btrfs_inode *inode,
1517 struct page *locked_page,
1518 const u64 start, const u64 end,
1519 int *page_started, int force,
1520 unsigned long *nr_written)
1522 struct btrfs_fs_info *fs_info = inode->root->fs_info;
1523 struct btrfs_root *root = inode->root;
1524 struct btrfs_path *path;
1525 u64 cow_start = (u64)-1;
1526 u64 cur_offset = start;
1528 bool check_prev = true;
1529 const bool freespace_inode = btrfs_is_free_space_inode(inode);
1530 u64 ino = btrfs_ino(inode);
1532 u64 disk_bytenr = 0;
1534 path = btrfs_alloc_path();
1536 extent_clear_unlock_delalloc(inode, start, end, locked_page,
1537 EXTENT_LOCKED | EXTENT_DELALLOC |
1538 EXTENT_DO_ACCOUNTING |
1539 EXTENT_DEFRAG, PAGE_UNLOCK |
1540 PAGE_START_WRITEBACK |
1541 PAGE_END_WRITEBACK);
1546 struct btrfs_key found_key;
1547 struct btrfs_file_extent_item *fi;
1548 struct extent_buffer *leaf;
1558 ret = btrfs_lookup_file_extent(NULL, root, path, ino,
1564 * If there is no extent for our range when doing the initial
1565 * search, then go back to the previous slot as it will be the
1566 * one containing the search offset
1568 if (ret > 0 && path->slots[0] > 0 && check_prev) {
1569 leaf = path->nodes[0];
1570 btrfs_item_key_to_cpu(leaf, &found_key,
1571 path->slots[0] - 1);
1572 if (found_key.objectid == ino &&
1573 found_key.type == BTRFS_EXTENT_DATA_KEY)
1578 /* Go to next leaf if we have exhausted the current one */
1579 leaf = path->nodes[0];
1580 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
1581 ret = btrfs_next_leaf(root, path);
1583 if (cow_start != (u64)-1)
1584 cur_offset = cow_start;
1589 leaf = path->nodes[0];
1592 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
1594 /* Didn't find anything for our INO */
1595 if (found_key.objectid > ino)
1598 * Keep searching until we find an EXTENT_ITEM or there are no
1599 * more extents for this inode
1601 if (WARN_ON_ONCE(found_key.objectid < ino) ||
1602 found_key.type < BTRFS_EXTENT_DATA_KEY) {
1607 /* Found key is not EXTENT_DATA_KEY or starts after req range */
1608 if (found_key.type > BTRFS_EXTENT_DATA_KEY ||
1609 found_key.offset > end)
1613 * If the found extent starts after requested offset, then
1614 * adjust extent_end to be right before this extent begins
1616 if (found_key.offset > cur_offset) {
1617 extent_end = found_key.offset;
1623 * Found extent which begins before our range and potentially
1626 fi = btrfs_item_ptr(leaf, path->slots[0],
1627 struct btrfs_file_extent_item);
1628 extent_type = btrfs_file_extent_type(leaf, fi);
1630 ram_bytes = btrfs_file_extent_ram_bytes(leaf, fi);
1631 if (extent_type == BTRFS_FILE_EXTENT_REG ||
1632 extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
1633 disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
1634 extent_offset = btrfs_file_extent_offset(leaf, fi);
1635 extent_end = found_key.offset +
1636 btrfs_file_extent_num_bytes(leaf, fi);
1638 btrfs_file_extent_disk_num_bytes(leaf, fi);
1640 * If the extent we got ends before our current offset,
1641 * skip to the next extent.
1643 if (extent_end <= cur_offset) {
1648 if (disk_bytenr == 0)
1650 /* Skip compressed/encrypted/encoded extents */
1651 if (btrfs_file_extent_compression(leaf, fi) ||
1652 btrfs_file_extent_encryption(leaf, fi) ||
1653 btrfs_file_extent_other_encoding(leaf, fi))
1656 * If extent is created before the last volume's snapshot
1657 * this implies the extent is shared, hence we can't do
1658 * nocow. This is the same check as in
1659 * btrfs_cross_ref_exist but without calling
1660 * btrfs_search_slot.
1662 if (!freespace_inode &&
1663 btrfs_file_extent_generation(leaf, fi) <=
1664 btrfs_root_last_snapshot(&root->root_item))
1666 if (extent_type == BTRFS_FILE_EXTENT_REG && !force)
1670 * The following checks can be expensive, as they need to
1671 * take other locks and do btree or rbtree searches, so
1672 * release the path to avoid blocking other tasks for too
1675 btrfs_release_path(path);
1677 /* If extent is RO, we must COW it */
1678 if (btrfs_extent_readonly(fs_info, disk_bytenr))
1680 ret = btrfs_cross_ref_exist(root, ino,
1682 extent_offset, disk_bytenr, false);
1685 * ret could be -EIO if the above fails to read
1689 if (cow_start != (u64)-1)
1690 cur_offset = cow_start;
1694 WARN_ON_ONCE(freespace_inode);
1697 disk_bytenr += extent_offset;
1698 disk_bytenr += cur_offset - found_key.offset;
1699 num_bytes = min(end + 1, extent_end) - cur_offset;
1701 * If there are pending snapshots for this root, we
1702 * fall into common COW way
1704 if (!freespace_inode && atomic_read(&root->snapshot_force_cow))
1707 * force cow if csum exists in the range.
1708 * this ensure that csum for a given extent are
1709 * either valid or do not exist.
1711 ret = csum_exist_in_range(fs_info, disk_bytenr,
1715 * ret could be -EIO if the above fails to read
1719 if (cow_start != (u64)-1)
1720 cur_offset = cow_start;
1723 WARN_ON_ONCE(freespace_inode);
1726 if (!btrfs_inc_nocow_writers(fs_info, disk_bytenr))
1729 } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
1730 extent_end = found_key.offset + ram_bytes;
1731 extent_end = ALIGN(extent_end, fs_info->sectorsize);
1732 /* Skip extents outside of our requested range */
1733 if (extent_end <= start) {
1738 /* If this triggers then we have a memory corruption */
1743 * If nocow is false then record the beginning of the range
1744 * that needs to be COWed
1747 if (cow_start == (u64)-1)
1748 cow_start = cur_offset;
1749 cur_offset = extent_end;
1750 if (cur_offset > end)
1752 if (!path->nodes[0])
1759 * COW range from cow_start to found_key.offset - 1. As the key
1760 * will contain the beginning of the first extent that can be
1761 * NOCOW, following one which needs to be COW'ed
1763 if (cow_start != (u64)-1) {
1764 ret = fallback_to_cow(inode, locked_page,
1765 cow_start, found_key.offset - 1,
1766 page_started, nr_written);
1769 cow_start = (u64)-1;
1772 if (extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
1773 u64 orig_start = found_key.offset - extent_offset;
1774 struct extent_map *em;
1776 em = create_io_em(inode, cur_offset, num_bytes,
1778 disk_bytenr, /* block_start */
1779 num_bytes, /* block_len */
1780 disk_num_bytes, /* orig_block_len */
1781 ram_bytes, BTRFS_COMPRESS_NONE,
1782 BTRFS_ORDERED_PREALLOC);
1787 free_extent_map(em);
1788 ret = btrfs_add_ordered_extent(inode, cur_offset,
1789 disk_bytenr, num_bytes,
1791 BTRFS_ORDERED_PREALLOC);
1793 btrfs_drop_extent_cache(inode, cur_offset,
1794 cur_offset + num_bytes - 1,
1799 ret = btrfs_add_ordered_extent(inode, cur_offset,
1800 disk_bytenr, num_bytes,
1802 BTRFS_ORDERED_NOCOW);
1808 btrfs_dec_nocow_writers(fs_info, disk_bytenr);
1811 if (root->root_key.objectid ==
1812 BTRFS_DATA_RELOC_TREE_OBJECTID)
1814 * Error handled later, as we must prevent
1815 * extent_clear_unlock_delalloc() in error handler
1816 * from freeing metadata of created ordered extent.
1818 ret = btrfs_reloc_clone_csums(inode, cur_offset,
1821 extent_clear_unlock_delalloc(inode, cur_offset,
1822 cur_offset + num_bytes - 1,
1823 locked_page, EXTENT_LOCKED |
1825 EXTENT_CLEAR_DATA_RESV,
1826 PAGE_UNLOCK | PAGE_SET_PRIVATE2);
1828 cur_offset = extent_end;
1831 * btrfs_reloc_clone_csums() error, now we're OK to call error
1832 * handler, as metadata for created ordered extent will only
1833 * be freed by btrfs_finish_ordered_io().
1837 if (cur_offset > end)
1840 btrfs_release_path(path);
1842 if (cur_offset <= end && cow_start == (u64)-1)
1843 cow_start = cur_offset;
1845 if (cow_start != (u64)-1) {
1847 ret = fallback_to_cow(inode, locked_page, cow_start, end,
1848 page_started, nr_written);
1855 btrfs_dec_nocow_writers(fs_info, disk_bytenr);
1857 if (ret && cur_offset < end)
1858 extent_clear_unlock_delalloc(inode, cur_offset, end,
1859 locked_page, EXTENT_LOCKED |
1860 EXTENT_DELALLOC | EXTENT_DEFRAG |
1861 EXTENT_DO_ACCOUNTING, PAGE_UNLOCK |
1862 PAGE_START_WRITEBACK |
1863 PAGE_END_WRITEBACK);
1864 btrfs_free_path(path);
1868 static inline int need_force_cow(struct btrfs_inode *inode, u64 start, u64 end)
1871 if (!(inode->flags & BTRFS_INODE_NODATACOW) &&
1872 !(inode->flags & BTRFS_INODE_PREALLOC))
1876 * @defrag_bytes is a hint value, no spinlock held here,
1877 * if is not zero, it means the file is defragging.
1878 * Force cow if given extent needs to be defragged.
1880 if (inode->defrag_bytes &&
1881 test_range_bit(&inode->io_tree, start, end, EXTENT_DEFRAG, 0, NULL))
1888 * Function to process delayed allocation (create CoW) for ranges which are
1889 * being touched for the first time.
1891 int btrfs_run_delalloc_range(struct btrfs_inode *inode, struct page *locked_page,
1892 u64 start, u64 end, int *page_started, unsigned long *nr_written,
1893 struct writeback_control *wbc)
1896 int force_cow = need_force_cow(inode, start, end);
1897 const bool zoned = btrfs_is_zoned(inode->root->fs_info);
1899 if (inode->flags & BTRFS_INODE_NODATACOW && !force_cow) {
1901 ret = run_delalloc_nocow(inode, locked_page, start, end,
1902 page_started, 1, nr_written);
1903 } else if (inode->flags & BTRFS_INODE_PREALLOC && !force_cow) {
1905 ret = run_delalloc_nocow(inode, locked_page, start, end,
1906 page_started, 0, nr_written);
1907 } else if (!inode_can_compress(inode) ||
1908 !inode_need_compress(inode, start, end)) {
1910 ret = run_delalloc_zoned(inode, locked_page, start, end,
1911 page_started, nr_written);
1913 ret = cow_file_range(inode, locked_page, start, end,
1914 page_started, nr_written, 1);
1916 set_bit(BTRFS_INODE_HAS_ASYNC_EXTENT, &inode->runtime_flags);
1917 ret = cow_file_range_async(inode, wbc, locked_page, start, end,
1918 page_started, nr_written);
1921 btrfs_cleanup_ordered_extents(inode, locked_page, start,
1926 void btrfs_split_delalloc_extent(struct inode *inode,
1927 struct extent_state *orig, u64 split)
1931 /* not delalloc, ignore it */
1932 if (!(orig->state & EXTENT_DELALLOC))
1935 size = orig->end - orig->start + 1;
1936 if (size > BTRFS_MAX_EXTENT_SIZE) {
1941 * See the explanation in btrfs_merge_delalloc_extent, the same
1942 * applies here, just in reverse.
1944 new_size = orig->end - split + 1;
1945 num_extents = count_max_extents(new_size);
1946 new_size = split - orig->start;
1947 num_extents += count_max_extents(new_size);
1948 if (count_max_extents(size) >= num_extents)
1952 spin_lock(&BTRFS_I(inode)->lock);
1953 btrfs_mod_outstanding_extents(BTRFS_I(inode), 1);
1954 spin_unlock(&BTRFS_I(inode)->lock);
1958 * Handle merged delayed allocation extents so we can keep track of new extents
1959 * that are just merged onto old extents, such as when we are doing sequential
1960 * writes, so we can properly account for the metadata space we'll need.
1962 void btrfs_merge_delalloc_extent(struct inode *inode, struct extent_state *new,
1963 struct extent_state *other)
1965 u64 new_size, old_size;
1968 /* not delalloc, ignore it */
1969 if (!(other->state & EXTENT_DELALLOC))
1972 if (new->start > other->start)
1973 new_size = new->end - other->start + 1;
1975 new_size = other->end - new->start + 1;
1977 /* we're not bigger than the max, unreserve the space and go */
1978 if (new_size <= BTRFS_MAX_EXTENT_SIZE) {
1979 spin_lock(&BTRFS_I(inode)->lock);
1980 btrfs_mod_outstanding_extents(BTRFS_I(inode), -1);
1981 spin_unlock(&BTRFS_I(inode)->lock);
1986 * We have to add up either side to figure out how many extents were
1987 * accounted for before we merged into one big extent. If the number of
1988 * extents we accounted for is <= the amount we need for the new range
1989 * then we can return, otherwise drop. Think of it like this
1993 * So we've grown the extent by a MAX_SIZE extent, this would mean we
1994 * need 2 outstanding extents, on one side we have 1 and the other side
1995 * we have 1 so they are == and we can return. But in this case
1997 * [MAX_SIZE+4k][MAX_SIZE+4k]
1999 * Each range on their own accounts for 2 extents, but merged together
2000 * they are only 3 extents worth of accounting, so we need to drop in
2003 old_size = other->end - other->start + 1;
2004 num_extents = count_max_extents(old_size);
2005 old_size = new->end - new->start + 1;
2006 num_extents += count_max_extents(old_size);
2007 if (count_max_extents(new_size) >= num_extents)
2010 spin_lock(&BTRFS_I(inode)->lock);
2011 btrfs_mod_outstanding_extents(BTRFS_I(inode), -1);
2012 spin_unlock(&BTRFS_I(inode)->lock);
2015 static void btrfs_add_delalloc_inodes(struct btrfs_root *root,
2016 struct inode *inode)
2018 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
2020 spin_lock(&root->delalloc_lock);
2021 if (list_empty(&BTRFS_I(inode)->delalloc_inodes)) {
2022 list_add_tail(&BTRFS_I(inode)->delalloc_inodes,
2023 &root->delalloc_inodes);
2024 set_bit(BTRFS_INODE_IN_DELALLOC_LIST,
2025 &BTRFS_I(inode)->runtime_flags);
2026 root->nr_delalloc_inodes++;
2027 if (root->nr_delalloc_inodes == 1) {
2028 spin_lock(&fs_info->delalloc_root_lock);
2029 BUG_ON(!list_empty(&root->delalloc_root));
2030 list_add_tail(&root->delalloc_root,
2031 &fs_info->delalloc_roots);
2032 spin_unlock(&fs_info->delalloc_root_lock);
2035 spin_unlock(&root->delalloc_lock);
2039 void __btrfs_del_delalloc_inode(struct btrfs_root *root,
2040 struct btrfs_inode *inode)
2042 struct btrfs_fs_info *fs_info = root->fs_info;
2044 if (!list_empty(&inode->delalloc_inodes)) {
2045 list_del_init(&inode->delalloc_inodes);
2046 clear_bit(BTRFS_INODE_IN_DELALLOC_LIST,
2047 &inode->runtime_flags);
2048 root->nr_delalloc_inodes--;
2049 if (!root->nr_delalloc_inodes) {
2050 ASSERT(list_empty(&root->delalloc_inodes));
2051 spin_lock(&fs_info->delalloc_root_lock);
2052 BUG_ON(list_empty(&root->delalloc_root));
2053 list_del_init(&root->delalloc_root);
2054 spin_unlock(&fs_info->delalloc_root_lock);
2059 static void btrfs_del_delalloc_inode(struct btrfs_root *root,
2060 struct btrfs_inode *inode)
2062 spin_lock(&root->delalloc_lock);
2063 __btrfs_del_delalloc_inode(root, inode);
2064 spin_unlock(&root->delalloc_lock);
2068 * Properly track delayed allocation bytes in the inode and to maintain the
2069 * list of inodes that have pending delalloc work to be done.
2071 void btrfs_set_delalloc_extent(struct inode *inode, struct extent_state *state,
2074 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
2076 if ((*bits & EXTENT_DEFRAG) && !(*bits & EXTENT_DELALLOC))
2079 * set_bit and clear bit hooks normally require _irqsave/restore
2080 * but in this case, we are only testing for the DELALLOC
2081 * bit, which is only set or cleared with irqs on
2083 if (!(state->state & EXTENT_DELALLOC) && (*bits & EXTENT_DELALLOC)) {
2084 struct btrfs_root *root = BTRFS_I(inode)->root;
2085 u64 len = state->end + 1 - state->start;
2086 u32 num_extents = count_max_extents(len);
2087 bool do_list = !btrfs_is_free_space_inode(BTRFS_I(inode));
2089 spin_lock(&BTRFS_I(inode)->lock);
2090 btrfs_mod_outstanding_extents(BTRFS_I(inode), num_extents);
2091 spin_unlock(&BTRFS_I(inode)->lock);
2093 /* For sanity tests */
2094 if (btrfs_is_testing(fs_info))
2097 percpu_counter_add_batch(&fs_info->delalloc_bytes, len,
2098 fs_info->delalloc_batch);
2099 spin_lock(&BTRFS_I(inode)->lock);
2100 BTRFS_I(inode)->delalloc_bytes += len;
2101 if (*bits & EXTENT_DEFRAG)
2102 BTRFS_I(inode)->defrag_bytes += len;
2103 if (do_list && !test_bit(BTRFS_INODE_IN_DELALLOC_LIST,
2104 &BTRFS_I(inode)->runtime_flags))
2105 btrfs_add_delalloc_inodes(root, inode);
2106 spin_unlock(&BTRFS_I(inode)->lock);
2109 if (!(state->state & EXTENT_DELALLOC_NEW) &&
2110 (*bits & EXTENT_DELALLOC_NEW)) {
2111 spin_lock(&BTRFS_I(inode)->lock);
2112 BTRFS_I(inode)->new_delalloc_bytes += state->end + 1 -
2114 spin_unlock(&BTRFS_I(inode)->lock);
2119 * Once a range is no longer delalloc this function ensures that proper
2120 * accounting happens.
2122 void btrfs_clear_delalloc_extent(struct inode *vfs_inode,
2123 struct extent_state *state, unsigned *bits)
2125 struct btrfs_inode *inode = BTRFS_I(vfs_inode);
2126 struct btrfs_fs_info *fs_info = btrfs_sb(vfs_inode->i_sb);
2127 u64 len = state->end + 1 - state->start;
2128 u32 num_extents = count_max_extents(len);
2130 if ((state->state & EXTENT_DEFRAG) && (*bits & EXTENT_DEFRAG)) {
2131 spin_lock(&inode->lock);
2132 inode->defrag_bytes -= len;
2133 spin_unlock(&inode->lock);
2137 * set_bit and clear bit hooks normally require _irqsave/restore
2138 * but in this case, we are only testing for the DELALLOC
2139 * bit, which is only set or cleared with irqs on
2141 if ((state->state & EXTENT_DELALLOC) && (*bits & EXTENT_DELALLOC)) {
2142 struct btrfs_root *root = inode->root;
2143 bool do_list = !btrfs_is_free_space_inode(inode);
2145 spin_lock(&inode->lock);
2146 btrfs_mod_outstanding_extents(inode, -num_extents);
2147 spin_unlock(&inode->lock);
2150 * We don't reserve metadata space for space cache inodes so we
2151 * don't need to call delalloc_release_metadata if there is an
2154 if (*bits & EXTENT_CLEAR_META_RESV &&
2155 root != fs_info->tree_root)
2156 btrfs_delalloc_release_metadata(inode, len, false);
2158 /* For sanity tests. */
2159 if (btrfs_is_testing(fs_info))
2162 if (root->root_key.objectid != BTRFS_DATA_RELOC_TREE_OBJECTID &&
2163 do_list && !(state->state & EXTENT_NORESERVE) &&
2164 (*bits & EXTENT_CLEAR_DATA_RESV))
2165 btrfs_free_reserved_data_space_noquota(fs_info, len);
2167 percpu_counter_add_batch(&fs_info->delalloc_bytes, -len,
2168 fs_info->delalloc_batch);
2169 spin_lock(&inode->lock);
2170 inode->delalloc_bytes -= len;
2171 if (do_list && inode->delalloc_bytes == 0 &&
2172 test_bit(BTRFS_INODE_IN_DELALLOC_LIST,
2173 &inode->runtime_flags))
2174 btrfs_del_delalloc_inode(root, inode);
2175 spin_unlock(&inode->lock);
2178 if ((state->state & EXTENT_DELALLOC_NEW) &&
2179 (*bits & EXTENT_DELALLOC_NEW)) {
2180 spin_lock(&inode->lock);
2181 ASSERT(inode->new_delalloc_bytes >= len);
2182 inode->new_delalloc_bytes -= len;
2183 if (*bits & EXTENT_ADD_INODE_BYTES)
2184 inode_add_bytes(&inode->vfs_inode, len);
2185 spin_unlock(&inode->lock);
2190 * btrfs_bio_fits_in_stripe - Checks whether the size of the given bio will fit
2191 * in a chunk's stripe. This function ensures that bios do not span a
2194 * @page - The page we are about to add to the bio
2195 * @size - size we want to add to the bio
2196 * @bio - bio we want to ensure is smaller than a stripe
2197 * @bio_flags - flags of the bio
2199 * return 1 if page cannot be added to the bio
2200 * return 0 if page can be added to the bio
2201 * return error otherwise
2203 int btrfs_bio_fits_in_stripe(struct page *page, size_t size, struct bio *bio,
2204 unsigned long bio_flags)
2206 struct inode *inode = page->mapping->host;
2207 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
2208 u64 logical = bio->bi_iter.bi_sector << 9;
2209 struct extent_map *em;
2213 struct btrfs_io_geometry geom;
2215 if (bio_flags & EXTENT_BIO_COMPRESSED)
2218 length = bio->bi_iter.bi_size;
2219 map_length = length;
2220 em = btrfs_get_chunk_map(fs_info, logical, map_length);
2223 ret = btrfs_get_io_geometry(fs_info, em, btrfs_op(bio), logical,
2228 if (geom.len < length + size)
2231 free_extent_map(em);
2236 * in order to insert checksums into the metadata in large chunks,
2237 * we wait until bio submission time. All the pages in the bio are
2238 * checksummed and sums are attached onto the ordered extent record.
2240 * At IO completion time the cums attached on the ordered extent record
2241 * are inserted into the btree
2243 static blk_status_t btrfs_submit_bio_start(struct inode *inode, struct bio *bio,
2244 u64 dio_file_offset)
2246 return btrfs_csum_one_bio(BTRFS_I(inode), bio, 0, 0);
2249 bool btrfs_bio_fits_in_ordered_extent(struct page *page, struct bio *bio,
2252 struct btrfs_inode *inode = BTRFS_I(page->mapping->host);
2253 struct btrfs_fs_info *fs_info = inode->root->fs_info;
2254 struct btrfs_ordered_extent *ordered;
2255 u64 len = bio->bi_iter.bi_size + size;
2258 ASSERT(btrfs_is_zoned(fs_info));
2259 ASSERT(fs_info->max_zone_append_size > 0);
2260 ASSERT(bio_op(bio) == REQ_OP_ZONE_APPEND);
2262 /* Ordered extent not yet created, so we're good */
2263 ordered = btrfs_lookup_ordered_extent(inode, page_offset(page));
2267 if ((bio->bi_iter.bi_sector << SECTOR_SHIFT) + len >
2268 ordered->disk_bytenr + ordered->disk_num_bytes)
2271 btrfs_put_ordered_extent(ordered);
2276 static blk_status_t extract_ordered_extent(struct btrfs_inode *inode,
2277 struct bio *bio, loff_t file_offset)
2279 struct btrfs_ordered_extent *ordered;
2280 struct extent_map *em = NULL, *em_new = NULL;
2281 struct extent_map_tree *em_tree = &inode->extent_tree;
2282 u64 start = (u64)bio->bi_iter.bi_sector << SECTOR_SHIFT;
2283 u64 len = bio->bi_iter.bi_size;
2284 u64 end = start + len;
2289 ordered = btrfs_lookup_ordered_extent(inode, file_offset);
2290 if (WARN_ON_ONCE(!ordered))
2291 return BLK_STS_IOERR;
2293 /* No need to split */
2294 if (ordered->disk_num_bytes == len)
2297 /* We cannot split once end_bio'd ordered extent */
2298 if (WARN_ON_ONCE(ordered->bytes_left != ordered->disk_num_bytes)) {
2303 /* We cannot split a compressed ordered extent */
2304 if (WARN_ON_ONCE(ordered->disk_num_bytes != ordered->num_bytes)) {
2309 ordered_end = ordered->disk_bytenr + ordered->disk_num_bytes;
2310 /* bio must be in one ordered extent */
2311 if (WARN_ON_ONCE(start < ordered->disk_bytenr || end > ordered_end)) {
2316 /* Checksum list should be empty */
2317 if (WARN_ON_ONCE(!list_empty(&ordered->list))) {
2322 pre = start - ordered->disk_bytenr;
2323 post = ordered_end - end;
2325 ret = btrfs_split_ordered_extent(ordered, pre, post);
2329 read_lock(&em_tree->lock);
2330 em = lookup_extent_mapping(em_tree, ordered->file_offset, len);
2332 read_unlock(&em_tree->lock);
2336 read_unlock(&em_tree->lock);
2338 ASSERT(!test_bit(EXTENT_FLAG_COMPRESSED, &em->flags));
2340 * We cannot reuse em_new here but have to create a new one, as
2341 * unpin_extent_cache() expects the start of the extent map to be the
2342 * logical offset of the file, which does not hold true anymore after
2345 em_new = create_io_em(inode, em->start + pre, len,
2346 em->start + pre, em->block_start + pre, len,
2347 len, len, BTRFS_COMPRESS_NONE,
2348 BTRFS_ORDERED_REGULAR);
2349 if (IS_ERR(em_new)) {
2350 ret = PTR_ERR(em_new);
2353 free_extent_map(em_new);
2356 free_extent_map(em);
2357 btrfs_put_ordered_extent(ordered);
2359 return errno_to_blk_status(ret);
2363 * extent_io.c submission hook. This does the right thing for csum calculation
2364 * on write, or reading the csums from the tree before a read.
2366 * Rules about async/sync submit,
2367 * a) read: sync submit
2369 * b) write without checksum: sync submit
2371 * c) write with checksum:
2372 * c-1) if bio is issued by fsync: sync submit
2373 * (sync_writers != 0)
2375 * c-2) if root is reloc root: sync submit
2376 * (only in case of buffered IO)
2378 * c-3) otherwise: async submit
2380 blk_status_t btrfs_submit_data_bio(struct inode *inode, struct bio *bio,
2381 int mirror_num, unsigned long bio_flags)
2384 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
2385 struct btrfs_root *root = BTRFS_I(inode)->root;
2386 enum btrfs_wq_endio_type metadata = BTRFS_WQ_ENDIO_DATA;
2387 blk_status_t ret = 0;
2389 int async = !atomic_read(&BTRFS_I(inode)->sync_writers);
2391 skip_sum = (BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM) ||
2392 !fs_info->csum_root;
2394 if (btrfs_is_free_space_inode(BTRFS_I(inode)))
2395 metadata = BTRFS_WQ_ENDIO_FREE_SPACE;
2397 if (bio_op(bio) == REQ_OP_ZONE_APPEND) {
2398 struct page *page = bio_first_bvec_all(bio)->bv_page;
2399 loff_t file_offset = page_offset(page);
2401 ret = extract_ordered_extent(BTRFS_I(inode), bio, file_offset);
2406 if (btrfs_op(bio) != BTRFS_MAP_WRITE) {
2407 ret = btrfs_bio_wq_end_io(fs_info, bio, metadata);
2411 if (bio_flags & EXTENT_BIO_COMPRESSED) {
2412 ret = btrfs_submit_compressed_read(inode, bio,
2418 * Lookup bio sums does extra checks around whether we
2419 * need to csum or not, which is why we ignore skip_sum
2422 ret = btrfs_lookup_bio_sums(inode, bio, NULL);
2427 } else if (async && !skip_sum) {
2428 /* csum items have already been cloned */
2429 if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID)
2431 /* we're doing a write, do the async checksumming */
2432 ret = btrfs_wq_submit_bio(inode, bio, mirror_num, bio_flags,
2433 0, btrfs_submit_bio_start);
2435 } else if (!skip_sum) {
2436 ret = btrfs_csum_one_bio(BTRFS_I(inode), bio, 0, 0);
2442 ret = btrfs_map_bio(fs_info, bio, mirror_num);
2446 bio->bi_status = ret;
2453 * given a list of ordered sums record them in the inode. This happens
2454 * at IO completion time based on sums calculated at bio submission time.
2456 static int add_pending_csums(struct btrfs_trans_handle *trans,
2457 struct list_head *list)
2459 struct btrfs_ordered_sum *sum;
2462 list_for_each_entry(sum, list, list) {
2463 trans->adding_csums = true;
2464 ret = btrfs_csum_file_blocks(trans, trans->fs_info->csum_root, sum);
2465 trans->adding_csums = false;
2472 static int btrfs_find_new_delalloc_bytes(struct btrfs_inode *inode,
2475 struct extent_state **cached_state)
2477 u64 search_start = start;
2478 const u64 end = start + len - 1;
2480 while (search_start < end) {
2481 const u64 search_len = end - search_start + 1;
2482 struct extent_map *em;
2486 em = btrfs_get_extent(inode, NULL, 0, search_start, search_len);
2490 if (em->block_start != EXTENT_MAP_HOLE)
2494 if (em->start < search_start)
2495 em_len -= search_start - em->start;
2496 if (em_len > search_len)
2497 em_len = search_len;
2499 ret = set_extent_bit(&inode->io_tree, search_start,
2500 search_start + em_len - 1,
2501 EXTENT_DELALLOC_NEW, 0, NULL, cached_state,
2504 search_start = extent_map_end(em);
2505 free_extent_map(em);
2512 int btrfs_set_extent_delalloc(struct btrfs_inode *inode, u64 start, u64 end,
2513 unsigned int extra_bits,
2514 struct extent_state **cached_state)
2516 WARN_ON(PAGE_ALIGNED(end));
2518 if (start >= i_size_read(&inode->vfs_inode) &&
2519 !(inode->flags & BTRFS_INODE_PREALLOC)) {
2521 * There can't be any extents following eof in this case so just
2522 * set the delalloc new bit for the range directly.
2524 extra_bits |= EXTENT_DELALLOC_NEW;
2528 ret = btrfs_find_new_delalloc_bytes(inode, start,
2535 return set_extent_delalloc(&inode->io_tree, start, end, extra_bits,
2539 /* see btrfs_writepage_start_hook for details on why this is required */
2540 struct btrfs_writepage_fixup {
2542 struct inode *inode;
2543 struct btrfs_work work;
2546 static void btrfs_writepage_fixup_worker(struct btrfs_work *work)
2548 struct btrfs_writepage_fixup *fixup;
2549 struct btrfs_ordered_extent *ordered;
2550 struct extent_state *cached_state = NULL;
2551 struct extent_changeset *data_reserved = NULL;
2553 struct btrfs_inode *inode;
2557 bool free_delalloc_space = true;
2559 fixup = container_of(work, struct btrfs_writepage_fixup, work);
2561 inode = BTRFS_I(fixup->inode);
2562 page_start = page_offset(page);
2563 page_end = page_offset(page) + PAGE_SIZE - 1;
2566 * This is similar to page_mkwrite, we need to reserve the space before
2567 * we take the page lock.
2569 ret = btrfs_delalloc_reserve_space(inode, &data_reserved, page_start,
2575 * Before we queued this fixup, we took a reference on the page.
2576 * page->mapping may go NULL, but it shouldn't be moved to a different
2579 if (!page->mapping || !PageDirty(page) || !PageChecked(page)) {
2581 * Unfortunately this is a little tricky, either
2583 * 1) We got here and our page had already been dealt with and
2584 * we reserved our space, thus ret == 0, so we need to just
2585 * drop our space reservation and bail. This can happen the
2586 * first time we come into the fixup worker, or could happen
2587 * while waiting for the ordered extent.
2588 * 2) Our page was already dealt with, but we happened to get an
2589 * ENOSPC above from the btrfs_delalloc_reserve_space. In
2590 * this case we obviously don't have anything to release, but
2591 * because the page was already dealt with we don't want to
2592 * mark the page with an error, so make sure we're resetting
2593 * ret to 0. This is why we have this check _before_ the ret
2594 * check, because we do not want to have a surprise ENOSPC
2595 * when the page was already properly dealt with.
2598 btrfs_delalloc_release_extents(inode, PAGE_SIZE);
2599 btrfs_delalloc_release_space(inode, data_reserved,
2600 page_start, PAGE_SIZE,
2608 * We can't mess with the page state unless it is locked, so now that
2609 * it is locked bail if we failed to make our space reservation.
2614 lock_extent_bits(&inode->io_tree, page_start, page_end, &cached_state);
2616 /* already ordered? We're done */
2617 if (PagePrivate2(page))
2620 ordered = btrfs_lookup_ordered_range(inode, page_start, PAGE_SIZE);
2622 unlock_extent_cached(&inode->io_tree, page_start, page_end,
2625 btrfs_start_ordered_extent(ordered, 1);
2626 btrfs_put_ordered_extent(ordered);
2630 ret = btrfs_set_extent_delalloc(inode, page_start, page_end, 0,
2636 * Everything went as planned, we're now the owner of a dirty page with
2637 * delayed allocation bits set and space reserved for our COW
2640 * The page was dirty when we started, nothing should have cleaned it.
2642 BUG_ON(!PageDirty(page));
2643 free_delalloc_space = false;
2645 btrfs_delalloc_release_extents(inode, PAGE_SIZE);
2646 if (free_delalloc_space)
2647 btrfs_delalloc_release_space(inode, data_reserved, page_start,
2649 unlock_extent_cached(&inode->io_tree, page_start, page_end,
2654 * We hit ENOSPC or other errors. Update the mapping and page
2655 * to reflect the errors and clean the page.
2657 mapping_set_error(page->mapping, ret);
2658 end_extent_writepage(page, ret, page_start, page_end);
2659 clear_page_dirty_for_io(page);
2662 ClearPageChecked(page);
2666 extent_changeset_free(data_reserved);
2668 * As a precaution, do a delayed iput in case it would be the last iput
2669 * that could need flushing space. Recursing back to fixup worker would
2672 btrfs_add_delayed_iput(&inode->vfs_inode);
2676 * There are a few paths in the higher layers of the kernel that directly
2677 * set the page dirty bit without asking the filesystem if it is a
2678 * good idea. This causes problems because we want to make sure COW
2679 * properly happens and the data=ordered rules are followed.
2681 * In our case any range that doesn't have the ORDERED bit set
2682 * hasn't been properly setup for IO. We kick off an async process
2683 * to fix it up. The async helper will wait for ordered extents, set
2684 * the delalloc bit and make it safe to write the page.
2686 int btrfs_writepage_cow_fixup(struct page *page, u64 start, u64 end)
2688 struct inode *inode = page->mapping->host;
2689 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
2690 struct btrfs_writepage_fixup *fixup;
2692 /* this page is properly in the ordered list */
2693 if (TestClearPagePrivate2(page))
2697 * PageChecked is set below when we create a fixup worker for this page,
2698 * don't try to create another one if we're already PageChecked()
2700 * The extent_io writepage code will redirty the page if we send back
2703 if (PageChecked(page))
2706 fixup = kzalloc(sizeof(*fixup), GFP_NOFS);
2711 * We are already holding a reference to this inode from
2712 * write_cache_pages. We need to hold it because the space reservation
2713 * takes place outside of the page lock, and we can't trust
2714 * page->mapping outside of the page lock.
2717 SetPageChecked(page);
2719 btrfs_init_work(&fixup->work, btrfs_writepage_fixup_worker, NULL, NULL);
2721 fixup->inode = inode;
2722 btrfs_queue_work(fs_info->fixup_workers, &fixup->work);
2727 static int insert_reserved_file_extent(struct btrfs_trans_handle *trans,
2728 struct btrfs_inode *inode, u64 file_pos,
2729 struct btrfs_file_extent_item *stack_fi,
2730 const bool update_inode_bytes,
2731 u64 qgroup_reserved)
2733 struct btrfs_root *root = inode->root;
2734 const u64 sectorsize = root->fs_info->sectorsize;
2735 struct btrfs_path *path;
2736 struct extent_buffer *leaf;
2737 struct btrfs_key ins;
2738 u64 disk_num_bytes = btrfs_stack_file_extent_disk_num_bytes(stack_fi);
2739 u64 disk_bytenr = btrfs_stack_file_extent_disk_bytenr(stack_fi);
2740 u64 num_bytes = btrfs_stack_file_extent_num_bytes(stack_fi);
2741 u64 ram_bytes = btrfs_stack_file_extent_ram_bytes(stack_fi);
2742 struct btrfs_drop_extents_args drop_args = { 0 };
2745 path = btrfs_alloc_path();
2750 * we may be replacing one extent in the tree with another.
2751 * The new extent is pinned in the extent map, and we don't want
2752 * to drop it from the cache until it is completely in the btree.
2754 * So, tell btrfs_drop_extents to leave this extent in the cache.
2755 * the caller is expected to unpin it and allow it to be merged
2758 drop_args.path = path;
2759 drop_args.start = file_pos;
2760 drop_args.end = file_pos + num_bytes;
2761 drop_args.replace_extent = true;
2762 drop_args.extent_item_size = sizeof(*stack_fi);
2763 ret = btrfs_drop_extents(trans, root, inode, &drop_args);
2767 if (!drop_args.extent_inserted) {
2768 ins.objectid = btrfs_ino(inode);
2769 ins.offset = file_pos;
2770 ins.type = BTRFS_EXTENT_DATA_KEY;
2772 ret = btrfs_insert_empty_item(trans, root, path, &ins,
2777 leaf = path->nodes[0];
2778 btrfs_set_stack_file_extent_generation(stack_fi, trans->transid);
2779 write_extent_buffer(leaf, stack_fi,
2780 btrfs_item_ptr_offset(leaf, path->slots[0]),
2781 sizeof(struct btrfs_file_extent_item));
2783 btrfs_mark_buffer_dirty(leaf);
2784 btrfs_release_path(path);
2787 * If we dropped an inline extent here, we know the range where it is
2788 * was not marked with the EXTENT_DELALLOC_NEW bit, so we update the
2789 * number of bytes only for that range contaning the inline extent.
2790 * The remaining of the range will be processed when clearning the
2791 * EXTENT_DELALLOC_BIT bit through the ordered extent completion.
2793 if (file_pos == 0 && !IS_ALIGNED(drop_args.bytes_found, sectorsize)) {
2794 u64 inline_size = round_down(drop_args.bytes_found, sectorsize);
2796 inline_size = drop_args.bytes_found - inline_size;
2797 btrfs_update_inode_bytes(inode, sectorsize, inline_size);
2798 drop_args.bytes_found -= inline_size;
2799 num_bytes -= sectorsize;
2802 if (update_inode_bytes)
2803 btrfs_update_inode_bytes(inode, num_bytes, drop_args.bytes_found);
2805 ins.objectid = disk_bytenr;
2806 ins.offset = disk_num_bytes;
2807 ins.type = BTRFS_EXTENT_ITEM_KEY;
2809 ret = btrfs_inode_set_file_extent_range(inode, file_pos, ram_bytes);
2813 ret = btrfs_alloc_reserved_file_extent(trans, root, btrfs_ino(inode),
2814 file_pos, qgroup_reserved, &ins);
2816 btrfs_free_path(path);
2821 static void btrfs_release_delalloc_bytes(struct btrfs_fs_info *fs_info,
2824 struct btrfs_block_group *cache;
2826 cache = btrfs_lookup_block_group(fs_info, start);
2829 spin_lock(&cache->lock);
2830 cache->delalloc_bytes -= len;
2831 spin_unlock(&cache->lock);
2833 btrfs_put_block_group(cache);
2836 static int insert_ordered_extent_file_extent(struct btrfs_trans_handle *trans,
2837 struct btrfs_ordered_extent *oe)
2839 struct btrfs_file_extent_item stack_fi;
2841 bool update_inode_bytes;
2843 memset(&stack_fi, 0, sizeof(stack_fi));
2844 btrfs_set_stack_file_extent_type(&stack_fi, BTRFS_FILE_EXTENT_REG);
2845 btrfs_set_stack_file_extent_disk_bytenr(&stack_fi, oe->disk_bytenr);
2846 btrfs_set_stack_file_extent_disk_num_bytes(&stack_fi,
2847 oe->disk_num_bytes);
2848 if (test_bit(BTRFS_ORDERED_TRUNCATED, &oe->flags))
2849 logical_len = oe->truncated_len;
2851 logical_len = oe->num_bytes;
2852 btrfs_set_stack_file_extent_num_bytes(&stack_fi, logical_len);
2853 btrfs_set_stack_file_extent_ram_bytes(&stack_fi, logical_len);
2854 btrfs_set_stack_file_extent_compression(&stack_fi, oe->compress_type);
2855 /* Encryption and other encoding is reserved and all 0 */
2858 * For delalloc, when completing an ordered extent we update the inode's
2859 * bytes when clearing the range in the inode's io tree, so pass false
2860 * as the argument 'update_inode_bytes' to insert_reserved_file_extent(),
2861 * except if the ordered extent was truncated.
2863 update_inode_bytes = test_bit(BTRFS_ORDERED_DIRECT, &oe->flags) ||
2864 test_bit(BTRFS_ORDERED_TRUNCATED, &oe->flags);
2866 return insert_reserved_file_extent(trans, BTRFS_I(oe->inode),
2867 oe->file_offset, &stack_fi,
2868 update_inode_bytes, oe->qgroup_rsv);
2872 * As ordered data IO finishes, this gets called so we can finish
2873 * an ordered extent if the range of bytes in the file it covers are
2876 static int btrfs_finish_ordered_io(struct btrfs_ordered_extent *ordered_extent)
2878 struct btrfs_inode *inode = BTRFS_I(ordered_extent->inode);
2879 struct btrfs_root *root = inode->root;
2880 struct btrfs_fs_info *fs_info = root->fs_info;
2881 struct btrfs_trans_handle *trans = NULL;
2882 struct extent_io_tree *io_tree = &inode->io_tree;
2883 struct extent_state *cached_state = NULL;
2885 int compress_type = 0;
2887 u64 logical_len = ordered_extent->num_bytes;
2888 bool freespace_inode;
2889 bool truncated = false;
2890 bool clear_reserved_extent = true;
2891 unsigned int clear_bits = EXTENT_DEFRAG;
2893 start = ordered_extent->file_offset;
2894 end = start + ordered_extent->num_bytes - 1;
2896 if (!test_bit(BTRFS_ORDERED_NOCOW, &ordered_extent->flags) &&
2897 !test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags) &&
2898 !test_bit(BTRFS_ORDERED_DIRECT, &ordered_extent->flags))
2899 clear_bits |= EXTENT_DELALLOC_NEW;
2901 freespace_inode = btrfs_is_free_space_inode(inode);
2903 if (test_bit(BTRFS_ORDERED_IOERR, &ordered_extent->flags)) {
2908 if (ordered_extent->disk)
2909 btrfs_rewrite_logical_zoned(ordered_extent);
2911 btrfs_free_io_failure_record(inode, start, end);
2913 if (test_bit(BTRFS_ORDERED_TRUNCATED, &ordered_extent->flags)) {
2915 logical_len = ordered_extent->truncated_len;
2916 /* Truncated the entire extent, don't bother adding */
2921 if (test_bit(BTRFS_ORDERED_NOCOW, &ordered_extent->flags)) {
2922 BUG_ON(!list_empty(&ordered_extent->list)); /* Logic error */
2924 btrfs_inode_safe_disk_i_size_write(inode, 0);
2925 if (freespace_inode)
2926 trans = btrfs_join_transaction_spacecache(root);
2928 trans = btrfs_join_transaction(root);
2929 if (IS_ERR(trans)) {
2930 ret = PTR_ERR(trans);
2934 trans->block_rsv = &inode->block_rsv;
2935 ret = btrfs_update_inode_fallback(trans, root, inode);
2936 if (ret) /* -ENOMEM or corruption */
2937 btrfs_abort_transaction(trans, ret);
2941 clear_bits |= EXTENT_LOCKED;
2942 lock_extent_bits(io_tree, start, end, &cached_state);
2944 if (freespace_inode)
2945 trans = btrfs_join_transaction_spacecache(root);
2947 trans = btrfs_join_transaction(root);
2948 if (IS_ERR(trans)) {
2949 ret = PTR_ERR(trans);
2954 trans->block_rsv = &inode->block_rsv;
2956 if (test_bit(BTRFS_ORDERED_COMPRESSED, &ordered_extent->flags))
2957 compress_type = ordered_extent->compress_type;
2958 if (test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags)) {
2959 BUG_ON(compress_type);
2960 ret = btrfs_mark_extent_written(trans, inode,
2961 ordered_extent->file_offset,
2962 ordered_extent->file_offset +
2965 BUG_ON(root == fs_info->tree_root);
2966 ret = insert_ordered_extent_file_extent(trans, ordered_extent);
2968 clear_reserved_extent = false;
2969 btrfs_release_delalloc_bytes(fs_info,
2970 ordered_extent->disk_bytenr,
2971 ordered_extent->disk_num_bytes);
2974 unpin_extent_cache(&inode->extent_tree, ordered_extent->file_offset,
2975 ordered_extent->num_bytes, trans->transid);
2977 btrfs_abort_transaction(trans, ret);
2981 ret = add_pending_csums(trans, &ordered_extent->list);
2983 btrfs_abort_transaction(trans, ret);
2988 * If this is a new delalloc range, clear its new delalloc flag to
2989 * update the inode's number of bytes. This needs to be done first
2990 * before updating the inode item.
2992 if ((clear_bits & EXTENT_DELALLOC_NEW) &&
2993 !test_bit(BTRFS_ORDERED_TRUNCATED, &ordered_extent->flags))
2994 clear_extent_bit(&inode->io_tree, start, end,
2995 EXTENT_DELALLOC_NEW | EXTENT_ADD_INODE_BYTES,
2996 0, 0, &cached_state);
2998 btrfs_inode_safe_disk_i_size_write(inode, 0);
2999 ret = btrfs_update_inode_fallback(trans, root, inode);
3000 if (ret) { /* -ENOMEM or corruption */
3001 btrfs_abort_transaction(trans, ret);
3006 clear_extent_bit(&inode->io_tree, start, end, clear_bits,
3007 (clear_bits & EXTENT_LOCKED) ? 1 : 0, 0,
3011 btrfs_end_transaction(trans);
3013 if (ret || truncated) {
3014 u64 unwritten_start = start;
3017 unwritten_start += logical_len;
3018 clear_extent_uptodate(io_tree, unwritten_start, end, NULL);
3020 /* Drop the cache for the part of the extent we didn't write. */
3021 btrfs_drop_extent_cache(inode, unwritten_start, end, 0);
3024 * If the ordered extent had an IOERR or something else went
3025 * wrong we need to return the space for this ordered extent
3026 * back to the allocator. We only free the extent in the
3027 * truncated case if we didn't write out the extent at all.
3029 * If we made it past insert_reserved_file_extent before we
3030 * errored out then we don't need to do this as the accounting
3031 * has already been done.
3033 if ((ret || !logical_len) &&
3034 clear_reserved_extent &&
3035 !test_bit(BTRFS_ORDERED_NOCOW, &ordered_extent->flags) &&
3036 !test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags)) {
3038 * Discard the range before returning it back to the
3041 if (ret && btrfs_test_opt(fs_info, DISCARD_SYNC))
3042 btrfs_discard_extent(fs_info,
3043 ordered_extent->disk_bytenr,
3044 ordered_extent->disk_num_bytes,
3046 btrfs_free_reserved_extent(fs_info,
3047 ordered_extent->disk_bytenr,
3048 ordered_extent->disk_num_bytes, 1);
3053 * This needs to be done to make sure anybody waiting knows we are done
3054 * updating everything for this ordered extent.
3056 btrfs_remove_ordered_extent(inode, ordered_extent);
3059 btrfs_put_ordered_extent(ordered_extent);
3060 /* once for the tree */
3061 btrfs_put_ordered_extent(ordered_extent);
3066 static void finish_ordered_fn(struct btrfs_work *work)
3068 struct btrfs_ordered_extent *ordered_extent;
3069 ordered_extent = container_of(work, struct btrfs_ordered_extent, work);
3070 btrfs_finish_ordered_io(ordered_extent);
3073 void btrfs_writepage_endio_finish_ordered(struct page *page, u64 start,
3074 u64 end, int uptodate)
3076 struct btrfs_inode *inode = BTRFS_I(page->mapping->host);
3077 struct btrfs_fs_info *fs_info = inode->root->fs_info;
3078 struct btrfs_ordered_extent *ordered_extent = NULL;
3079 struct btrfs_workqueue *wq;
3081 trace_btrfs_writepage_end_io_hook(page, start, end, uptodate);
3083 ClearPagePrivate2(page);
3084 if (!btrfs_dec_test_ordered_pending(inode, &ordered_extent, start,
3085 end - start + 1, uptodate))
3088 if (btrfs_is_free_space_inode(inode))
3089 wq = fs_info->endio_freespace_worker;
3091 wq = fs_info->endio_write_workers;
3093 btrfs_init_work(&ordered_extent->work, finish_ordered_fn, NULL, NULL);
3094 btrfs_queue_work(wq, &ordered_extent->work);
3098 * check_data_csum - verify checksum of one sector of uncompressed data
3100 * @io_bio: btrfs_io_bio which contains the csum
3101 * @bio_offset: offset to the beginning of the bio (in bytes)
3102 * @page: page where is the data to be verified
3103 * @pgoff: offset inside the page
3105 * The length of such check is always one sector size.
3107 static int check_data_csum(struct inode *inode, struct btrfs_io_bio *io_bio,
3108 u32 bio_offset, struct page *page, u32 pgoff)
3110 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
3111 SHASH_DESC_ON_STACK(shash, fs_info->csum_shash);
3113 u32 len = fs_info->sectorsize;
3114 const u32 csum_size = fs_info->csum_size;
3115 unsigned int offset_sectors;
3117 u8 csum[BTRFS_CSUM_SIZE];
3119 ASSERT(pgoff + len <= PAGE_SIZE);
3121 offset_sectors = bio_offset >> fs_info->sectorsize_bits;
3122 csum_expected = ((u8 *)io_bio->csum) + offset_sectors * csum_size;
3124 kaddr = kmap_atomic(page);
3125 shash->tfm = fs_info->csum_shash;
3127 crypto_shash_digest(shash, kaddr + pgoff, len, csum);
3129 if (memcmp(csum, csum_expected, csum_size))
3132 kunmap_atomic(kaddr);
3135 btrfs_print_data_csum_error(BTRFS_I(inode), page_offset(page) + pgoff,
3136 csum, csum_expected, io_bio->mirror_num);
3138 btrfs_dev_stat_inc_and_print(io_bio->device,
3139 BTRFS_DEV_STAT_CORRUPTION_ERRS);
3140 memset(kaddr + pgoff, 1, len);
3141 flush_dcache_page(page);
3142 kunmap_atomic(kaddr);
3147 * When reads are done, we need to check csums to verify the data is correct.
3148 * if there's a match, we allow the bio to finish. If not, the code in
3149 * extent_io.c will try to find good copies for us.
3151 * @bio_offset: offset to the beginning of the bio (in bytes)
3152 * @start: file offset of the range start
3153 * @end: file offset of the range end (inclusive)
3154 * @mirror: mirror number
3156 int btrfs_verify_data_csum(struct btrfs_io_bio *io_bio, u32 bio_offset,
3157 struct page *page, u64 start, u64 end, int mirror)
3159 struct inode *inode = page->mapping->host;
3160 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
3161 struct btrfs_root *root = BTRFS_I(inode)->root;
3162 const u32 sectorsize = root->fs_info->sectorsize;
3165 if (PageChecked(page)) {
3166 ClearPageChecked(page);
3170 if (BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM)
3173 if (!root->fs_info->csum_root)
3176 if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID &&
3177 test_range_bit(io_tree, start, end, EXTENT_NODATASUM, 1, NULL)) {
3178 clear_extent_bits(io_tree, start, end, EXTENT_NODATASUM);
3182 ASSERT(page_offset(page) <= start &&
3183 end <= page_offset(page) + PAGE_SIZE - 1);
3184 for (pg_off = offset_in_page(start);
3185 pg_off < offset_in_page(end);
3186 pg_off += sectorsize, bio_offset += sectorsize) {
3189 ret = check_data_csum(inode, io_bio, bio_offset, page, pg_off);
3197 * btrfs_add_delayed_iput - perform a delayed iput on @inode
3199 * @inode: The inode we want to perform iput on
3201 * This function uses the generic vfs_inode::i_count to track whether we should
3202 * just decrement it (in case it's > 1) or if this is the last iput then link
3203 * the inode to the delayed iput machinery. Delayed iputs are processed at
3204 * transaction commit time/superblock commit/cleaner kthread.
3206 void btrfs_add_delayed_iput(struct inode *inode)
3208 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
3209 struct btrfs_inode *binode = BTRFS_I(inode);
3211 if (atomic_add_unless(&inode->i_count, -1, 1))
3214 atomic_inc(&fs_info->nr_delayed_iputs);
3215 spin_lock(&fs_info->delayed_iput_lock);
3216 ASSERT(list_empty(&binode->delayed_iput));
3217 list_add_tail(&binode->delayed_iput, &fs_info->delayed_iputs);
3218 spin_unlock(&fs_info->delayed_iput_lock);
3219 if (!test_bit(BTRFS_FS_CLEANER_RUNNING, &fs_info->flags))
3220 wake_up_process(fs_info->cleaner_kthread);
3223 static void run_delayed_iput_locked(struct btrfs_fs_info *fs_info,
3224 struct btrfs_inode *inode)
3226 list_del_init(&inode->delayed_iput);
3227 spin_unlock(&fs_info->delayed_iput_lock);
3228 iput(&inode->vfs_inode);
3229 if (atomic_dec_and_test(&fs_info->nr_delayed_iputs))
3230 wake_up(&fs_info->delayed_iputs_wait);
3231 spin_lock(&fs_info->delayed_iput_lock);
3234 static void btrfs_run_delayed_iput(struct btrfs_fs_info *fs_info,
3235 struct btrfs_inode *inode)
3237 if (!list_empty(&inode->delayed_iput)) {
3238 spin_lock(&fs_info->delayed_iput_lock);
3239 if (!list_empty(&inode->delayed_iput))
3240 run_delayed_iput_locked(fs_info, inode);
3241 spin_unlock(&fs_info->delayed_iput_lock);
3245 void btrfs_run_delayed_iputs(struct btrfs_fs_info *fs_info)
3248 spin_lock(&fs_info->delayed_iput_lock);
3249 while (!list_empty(&fs_info->delayed_iputs)) {
3250 struct btrfs_inode *inode;
3252 inode = list_first_entry(&fs_info->delayed_iputs,
3253 struct btrfs_inode, delayed_iput);
3254 run_delayed_iput_locked(fs_info, inode);
3256 spin_unlock(&fs_info->delayed_iput_lock);
3260 * Wait for flushing all delayed iputs
3262 * @fs_info: the filesystem
3264 * This will wait on any delayed iputs that are currently running with KILLABLE
3265 * set. Once they are all done running we will return, unless we are killed in
3266 * which case we return EINTR. This helps in user operations like fallocate etc
3267 * that might get blocked on the iputs.
3269 * Return EINTR if we were killed, 0 if nothing's pending
3271 int btrfs_wait_on_delayed_iputs(struct btrfs_fs_info *fs_info)
3273 int ret = wait_event_killable(fs_info->delayed_iputs_wait,
3274 atomic_read(&fs_info->nr_delayed_iputs) == 0);
3281 * This creates an orphan entry for the given inode in case something goes wrong
3282 * in the middle of an unlink.
3284 int btrfs_orphan_add(struct btrfs_trans_handle *trans,
3285 struct btrfs_inode *inode)
3289 ret = btrfs_insert_orphan_item(trans, inode->root, btrfs_ino(inode));
3290 if (ret && ret != -EEXIST) {
3291 btrfs_abort_transaction(trans, ret);
3299 * We have done the delete so we can go ahead and remove the orphan item for
3300 * this particular inode.
3302 static int btrfs_orphan_del(struct btrfs_trans_handle *trans,
3303 struct btrfs_inode *inode)
3305 return btrfs_del_orphan_item(trans, inode->root, btrfs_ino(inode));
3309 * this cleans up any orphans that may be left on the list from the last use
3312 int btrfs_orphan_cleanup(struct btrfs_root *root)
3314 struct btrfs_fs_info *fs_info = root->fs_info;
3315 struct btrfs_path *path;
3316 struct extent_buffer *leaf;
3317 struct btrfs_key key, found_key;
3318 struct btrfs_trans_handle *trans;
3319 struct inode *inode;
3320 u64 last_objectid = 0;
3321 int ret = 0, nr_unlink = 0;
3323 if (cmpxchg(&root->orphan_cleanup_state, 0, ORPHAN_CLEANUP_STARTED))
3326 path = btrfs_alloc_path();
3331 path->reada = READA_BACK;
3333 key.objectid = BTRFS_ORPHAN_OBJECTID;
3334 key.type = BTRFS_ORPHAN_ITEM_KEY;
3335 key.offset = (u64)-1;
3338 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
3343 * if ret == 0 means we found what we were searching for, which
3344 * is weird, but possible, so only screw with path if we didn't
3345 * find the key and see if we have stuff that matches
3349 if (path->slots[0] == 0)
3354 /* pull out the item */
3355 leaf = path->nodes[0];
3356 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
3358 /* make sure the item matches what we want */
3359 if (found_key.objectid != BTRFS_ORPHAN_OBJECTID)
3361 if (found_key.type != BTRFS_ORPHAN_ITEM_KEY)
3364 /* release the path since we're done with it */
3365 btrfs_release_path(path);
3368 * this is where we are basically btrfs_lookup, without the
3369 * crossing root thing. we store the inode number in the
3370 * offset of the orphan item.
3373 if (found_key.offset == last_objectid) {
3375 "Error removing orphan entry, stopping orphan cleanup");
3380 last_objectid = found_key.offset;
3382 found_key.objectid = found_key.offset;
3383 found_key.type = BTRFS_INODE_ITEM_KEY;
3384 found_key.offset = 0;
3385 inode = btrfs_iget(fs_info->sb, last_objectid, root);
3386 ret = PTR_ERR_OR_ZERO(inode);
3387 if (ret && ret != -ENOENT)
3390 if (ret == -ENOENT && root == fs_info->tree_root) {
3391 struct btrfs_root *dead_root;
3392 int is_dead_root = 0;
3395 * this is an orphan in the tree root. Currently these
3396 * could come from 2 sources:
3397 * a) a snapshot deletion in progress
3398 * b) a free space cache inode
3399 * We need to distinguish those two, as the snapshot
3400 * orphan must not get deleted.
3401 * find_dead_roots already ran before us, so if this
3402 * is a snapshot deletion, we should find the root
3403 * in the fs_roots radix tree.
3406 spin_lock(&fs_info->fs_roots_radix_lock);
3407 dead_root = radix_tree_lookup(&fs_info->fs_roots_radix,
3408 (unsigned long)found_key.objectid);
3409 if (dead_root && btrfs_root_refs(&dead_root->root_item) == 0)
3411 spin_unlock(&fs_info->fs_roots_radix_lock);
3414 /* prevent this orphan from being found again */
3415 key.offset = found_key.objectid - 1;
3422 * If we have an inode with links, there are a couple of
3423 * possibilities. Old kernels (before v3.12) used to create an
3424 * orphan item for truncate indicating that there were possibly
3425 * extent items past i_size that needed to be deleted. In v3.12,
3426 * truncate was changed to update i_size in sync with the extent
3427 * items, but the (useless) orphan item was still created. Since
3428 * v4.18, we don't create the orphan item for truncate at all.
3430 * So, this item could mean that we need to do a truncate, but
3431 * only if this filesystem was last used on a pre-v3.12 kernel
3432 * and was not cleanly unmounted. The odds of that are quite
3433 * slim, and it's a pain to do the truncate now, so just delete
3436 * It's also possible that this orphan item was supposed to be
3437 * deleted but wasn't. The inode number may have been reused,
3438 * but either way, we can delete the orphan item.
3440 if (ret == -ENOENT || inode->i_nlink) {
3443 trans = btrfs_start_transaction(root, 1);
3444 if (IS_ERR(trans)) {
3445 ret = PTR_ERR(trans);
3448 btrfs_debug(fs_info, "auto deleting %Lu",
3449 found_key.objectid);
3450 ret = btrfs_del_orphan_item(trans, root,
3451 found_key.objectid);
3452 btrfs_end_transaction(trans);
3460 /* this will do delete_inode and everything for us */
3463 /* release the path since we're done with it */
3464 btrfs_release_path(path);
3466 root->orphan_cleanup_state = ORPHAN_CLEANUP_DONE;
3468 if (test_bit(BTRFS_ROOT_ORPHAN_ITEM_INSERTED, &root->state)) {
3469 trans = btrfs_join_transaction(root);
3471 btrfs_end_transaction(trans);
3475 btrfs_debug(fs_info, "unlinked %d orphans", nr_unlink);
3479 btrfs_err(fs_info, "could not do orphan cleanup %d", ret);
3480 btrfs_free_path(path);
3485 * very simple check to peek ahead in the leaf looking for xattrs. If we
3486 * don't find any xattrs, we know there can't be any acls.
3488 * slot is the slot the inode is in, objectid is the objectid of the inode
3490 static noinline int acls_after_inode_item(struct extent_buffer *leaf,
3491 int slot, u64 objectid,
3492 int *first_xattr_slot)
3494 u32 nritems = btrfs_header_nritems(leaf);
3495 struct btrfs_key found_key;
3496 static u64 xattr_access = 0;
3497 static u64 xattr_default = 0;
3500 if (!xattr_access) {
3501 xattr_access = btrfs_name_hash(XATTR_NAME_POSIX_ACL_ACCESS,
3502 strlen(XATTR_NAME_POSIX_ACL_ACCESS));
3503 xattr_default = btrfs_name_hash(XATTR_NAME_POSIX_ACL_DEFAULT,
3504 strlen(XATTR_NAME_POSIX_ACL_DEFAULT));
3508 *first_xattr_slot = -1;
3509 while (slot < nritems) {
3510 btrfs_item_key_to_cpu(leaf, &found_key, slot);
3512 /* we found a different objectid, there must not be acls */
3513 if (found_key.objectid != objectid)
3516 /* we found an xattr, assume we've got an acl */
3517 if (found_key.type == BTRFS_XATTR_ITEM_KEY) {
3518 if (*first_xattr_slot == -1)
3519 *first_xattr_slot = slot;
3520 if (found_key.offset == xattr_access ||
3521 found_key.offset == xattr_default)
3526 * we found a key greater than an xattr key, there can't
3527 * be any acls later on
3529 if (found_key.type > BTRFS_XATTR_ITEM_KEY)
3536 * it goes inode, inode backrefs, xattrs, extents,
3537 * so if there are a ton of hard links to an inode there can
3538 * be a lot of backrefs. Don't waste time searching too hard,
3539 * this is just an optimization
3544 /* we hit the end of the leaf before we found an xattr or
3545 * something larger than an xattr. We have to assume the inode
3548 if (*first_xattr_slot == -1)
3549 *first_xattr_slot = slot;
3554 * read an inode from the btree into the in-memory inode
3556 static int btrfs_read_locked_inode(struct inode *inode,
3557 struct btrfs_path *in_path)
3559 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
3560 struct btrfs_path *path = in_path;
3561 struct extent_buffer *leaf;
3562 struct btrfs_inode_item *inode_item;
3563 struct btrfs_root *root = BTRFS_I(inode)->root;
3564 struct btrfs_key location;
3569 bool filled = false;
3570 int first_xattr_slot;
3572 ret = btrfs_fill_inode(inode, &rdev);
3577 path = btrfs_alloc_path();
3582 memcpy(&location, &BTRFS_I(inode)->location, sizeof(location));
3584 ret = btrfs_lookup_inode(NULL, root, path, &location, 0);
3586 if (path != in_path)
3587 btrfs_free_path(path);
3591 leaf = path->nodes[0];
3596 inode_item = btrfs_item_ptr(leaf, path->slots[0],
3597 struct btrfs_inode_item);
3598 inode->i_mode = btrfs_inode_mode(leaf, inode_item);
3599 set_nlink(inode, btrfs_inode_nlink(leaf, inode_item));
3600 i_uid_write(inode, btrfs_inode_uid(leaf, inode_item));
3601 i_gid_write(inode, btrfs_inode_gid(leaf, inode_item));
3602 btrfs_i_size_write(BTRFS_I(inode), btrfs_inode_size(leaf, inode_item));
3603 btrfs_inode_set_file_extent_range(BTRFS_I(inode), 0,
3604 round_up(i_size_read(inode), fs_info->sectorsize));
3606 inode->i_atime.tv_sec = btrfs_timespec_sec(leaf, &inode_item->atime);
3607 inode->i_atime.tv_nsec = btrfs_timespec_nsec(leaf, &inode_item->atime);
3609 inode->i_mtime.tv_sec = btrfs_timespec_sec(leaf, &inode_item->mtime);
3610 inode->i_mtime.tv_nsec = btrfs_timespec_nsec(leaf, &inode_item->mtime);
3612 inode->i_ctime.tv_sec = btrfs_timespec_sec(leaf, &inode_item->ctime);
3613 inode->i_ctime.tv_nsec = btrfs_timespec_nsec(leaf, &inode_item->ctime);
3615 BTRFS_I(inode)->i_otime.tv_sec =
3616 btrfs_timespec_sec(leaf, &inode_item->otime);
3617 BTRFS_I(inode)->i_otime.tv_nsec =
3618 btrfs_timespec_nsec(leaf, &inode_item->otime);
3620 inode_set_bytes(inode, btrfs_inode_nbytes(leaf, inode_item));
3621 BTRFS_I(inode)->generation = btrfs_inode_generation(leaf, inode_item);
3622 BTRFS_I(inode)->last_trans = btrfs_inode_transid(leaf, inode_item);
3624 inode_set_iversion_queried(inode,
3625 btrfs_inode_sequence(leaf, inode_item));
3626 inode->i_generation = BTRFS_I(inode)->generation;
3628 rdev = btrfs_inode_rdev(leaf, inode_item);
3630 BTRFS_I(inode)->index_cnt = (u64)-1;
3631 BTRFS_I(inode)->flags = btrfs_inode_flags(leaf, inode_item);
3635 * If we were modified in the current generation and evicted from memory
3636 * and then re-read we need to do a full sync since we don't have any
3637 * idea about which extents were modified before we were evicted from
3640 * This is required for both inode re-read from disk and delayed inode
3641 * in delayed_nodes_tree.
3643 if (BTRFS_I(inode)->last_trans == fs_info->generation)
3644 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC,
3645 &BTRFS_I(inode)->runtime_flags);
3648 * We don't persist the id of the transaction where an unlink operation
3649 * against the inode was last made. So here we assume the inode might
3650 * have been evicted, and therefore the exact value of last_unlink_trans
3651 * lost, and set it to last_trans to avoid metadata inconsistencies
3652 * between the inode and its parent if the inode is fsync'ed and the log
3653 * replayed. For example, in the scenario:
3656 * ln mydir/foo mydir/bar
3659 * echo 2 > /proc/sys/vm/drop_caches # evicts inode
3660 * xfs_io -c fsync mydir/foo
3662 * mount fs, triggers fsync log replay
3664 * We must make sure that when we fsync our inode foo we also log its
3665 * parent inode, otherwise after log replay the parent still has the
3666 * dentry with the "bar" name but our inode foo has a link count of 1
3667 * and doesn't have an inode ref with the name "bar" anymore.
3669 * Setting last_unlink_trans to last_trans is a pessimistic approach,
3670 * but it guarantees correctness at the expense of occasional full
3671 * transaction commits on fsync if our inode is a directory, or if our
3672 * inode is not a directory, logging its parent unnecessarily.
3674 BTRFS_I(inode)->last_unlink_trans = BTRFS_I(inode)->last_trans;
3677 * Same logic as for last_unlink_trans. We don't persist the generation
3678 * of the last transaction where this inode was used for a reflink
3679 * operation, so after eviction and reloading the inode we must be
3680 * pessimistic and assume the last transaction that modified the inode.
3682 BTRFS_I(inode)->last_reflink_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 if (path != in_path)
3723 btrfs_free_path(path);
3726 cache_no_acl(inode);
3728 switch (inode->i_mode & S_IFMT) {
3730 inode->i_mapping->a_ops = &btrfs_aops;
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_aops;
3744 inode->i_op = &btrfs_special_inode_operations;
3745 init_special_inode(inode, inode->i_mode, rdev);
3749 btrfs_sync_inode_flags_to_i_flags(inode);
3754 * given a leaf and an inode, copy the inode fields into the leaf
3756 static void fill_inode_item(struct btrfs_trans_handle *trans,
3757 struct extent_buffer *leaf,
3758 struct btrfs_inode_item *item,
3759 struct inode *inode)
3761 struct btrfs_map_token token;
3763 btrfs_init_map_token(&token, leaf);
3765 btrfs_set_token_inode_uid(&token, item, i_uid_read(inode));
3766 btrfs_set_token_inode_gid(&token, item, i_gid_read(inode));
3767 btrfs_set_token_inode_size(&token, item, BTRFS_I(inode)->disk_i_size);
3768 btrfs_set_token_inode_mode(&token, item, inode->i_mode);
3769 btrfs_set_token_inode_nlink(&token, item, inode->i_nlink);
3771 btrfs_set_token_timespec_sec(&token, &item->atime,
3772 inode->i_atime.tv_sec);
3773 btrfs_set_token_timespec_nsec(&token, &item->atime,
3774 inode->i_atime.tv_nsec);
3776 btrfs_set_token_timespec_sec(&token, &item->mtime,
3777 inode->i_mtime.tv_sec);
3778 btrfs_set_token_timespec_nsec(&token, &item->mtime,
3779 inode->i_mtime.tv_nsec);
3781 btrfs_set_token_timespec_sec(&token, &item->ctime,
3782 inode->i_ctime.tv_sec);
3783 btrfs_set_token_timespec_nsec(&token, &item->ctime,
3784 inode->i_ctime.tv_nsec);
3786 btrfs_set_token_timespec_sec(&token, &item->otime,
3787 BTRFS_I(inode)->i_otime.tv_sec);
3788 btrfs_set_token_timespec_nsec(&token, &item->otime,
3789 BTRFS_I(inode)->i_otime.tv_nsec);
3791 btrfs_set_token_inode_nbytes(&token, item, inode_get_bytes(inode));
3792 btrfs_set_token_inode_generation(&token, item,
3793 BTRFS_I(inode)->generation);
3794 btrfs_set_token_inode_sequence(&token, item, inode_peek_iversion(inode));
3795 btrfs_set_token_inode_transid(&token, item, trans->transid);
3796 btrfs_set_token_inode_rdev(&token, item, inode->i_rdev);
3797 btrfs_set_token_inode_flags(&token, item, BTRFS_I(inode)->flags);
3798 btrfs_set_token_inode_block_group(&token, item, 0);
3802 * copy everything in the in-memory inode into the btree.
3804 static noinline int btrfs_update_inode_item(struct btrfs_trans_handle *trans,
3805 struct btrfs_root *root,
3806 struct btrfs_inode *inode)
3808 struct btrfs_inode_item *inode_item;
3809 struct btrfs_path *path;
3810 struct extent_buffer *leaf;
3813 path = btrfs_alloc_path();
3817 ret = btrfs_lookup_inode(trans, root, path, &inode->location, 1);
3824 leaf = path->nodes[0];
3825 inode_item = btrfs_item_ptr(leaf, path->slots[0],
3826 struct btrfs_inode_item);
3828 fill_inode_item(trans, leaf, inode_item, &inode->vfs_inode);
3829 btrfs_mark_buffer_dirty(leaf);
3830 btrfs_set_inode_last_trans(trans, inode);
3833 btrfs_free_path(path);
3838 * copy everything in the in-memory inode into the btree.
3840 noinline int btrfs_update_inode(struct btrfs_trans_handle *trans,
3841 struct btrfs_root *root,
3842 struct btrfs_inode *inode)
3844 struct btrfs_fs_info *fs_info = root->fs_info;
3848 * If the inode is a free space inode, we can deadlock during commit
3849 * if we put it into the delayed code.
3851 * The data relocation inode should also be directly updated
3854 if (!btrfs_is_free_space_inode(inode)
3855 && root->root_key.objectid != BTRFS_DATA_RELOC_TREE_OBJECTID
3856 && !test_bit(BTRFS_FS_LOG_RECOVERING, &fs_info->flags)) {
3857 btrfs_update_root_times(trans, root);
3859 ret = btrfs_delayed_update_inode(trans, root, inode);
3861 btrfs_set_inode_last_trans(trans, inode);
3865 return btrfs_update_inode_item(trans, root, inode);
3868 int btrfs_update_inode_fallback(struct btrfs_trans_handle *trans,
3869 struct btrfs_root *root, struct btrfs_inode *inode)
3873 ret = btrfs_update_inode(trans, root, inode);
3875 return btrfs_update_inode_item(trans, root, inode);
3880 * unlink helper that gets used here in inode.c and in the tree logging
3881 * recovery code. It remove a link in a directory with a given name, and
3882 * also drops the back refs in the inode to the directory
3884 static int __btrfs_unlink_inode(struct btrfs_trans_handle *trans,
3885 struct btrfs_root *root,
3886 struct btrfs_inode *dir,
3887 struct btrfs_inode *inode,
3888 const char *name, int name_len)
3890 struct btrfs_fs_info *fs_info = root->fs_info;
3891 struct btrfs_path *path;
3893 struct btrfs_dir_item *di;
3895 u64 ino = btrfs_ino(inode);
3896 u64 dir_ino = btrfs_ino(dir);
3898 path = btrfs_alloc_path();
3904 di = btrfs_lookup_dir_item(trans, root, path, dir_ino,
3905 name, name_len, -1);
3906 if (IS_ERR_OR_NULL(di)) {
3907 ret = di ? PTR_ERR(di) : -ENOENT;
3910 ret = btrfs_delete_one_dir_name(trans, root, path, di);
3913 btrfs_release_path(path);
3916 * If we don't have dir index, we have to get it by looking up
3917 * the inode ref, since we get the inode ref, remove it directly,
3918 * it is unnecessary to do delayed deletion.
3920 * But if we have dir index, needn't search inode ref to get it.
3921 * Since the inode ref is close to the inode item, it is better
3922 * that we delay to delete it, and just do this deletion when
3923 * we update the inode item.
3925 if (inode->dir_index) {
3926 ret = btrfs_delayed_delete_inode_ref(inode);
3928 index = inode->dir_index;
3933 ret = btrfs_del_inode_ref(trans, root, name, name_len, ino,
3937 "failed to delete reference to %.*s, inode %llu parent %llu",
3938 name_len, name, ino, dir_ino);
3939 btrfs_abort_transaction(trans, ret);
3943 ret = btrfs_delete_delayed_dir_index(trans, dir, index);
3945 btrfs_abort_transaction(trans, ret);
3949 ret = btrfs_del_inode_ref_in_log(trans, root, name, name_len, inode,
3951 if (ret != 0 && ret != -ENOENT) {
3952 btrfs_abort_transaction(trans, ret);
3956 ret = btrfs_del_dir_entries_in_log(trans, root, name, name_len, dir,
3961 btrfs_abort_transaction(trans, ret);
3964 * If we have a pending delayed iput we could end up with the final iput
3965 * being run in btrfs-cleaner context. If we have enough of these built
3966 * up we can end up burning a lot of time in btrfs-cleaner without any
3967 * way to throttle the unlinks. Since we're currently holding a ref on
3968 * the inode we can run the delayed iput here without any issues as the
3969 * final iput won't be done until after we drop the ref we're currently
3972 btrfs_run_delayed_iput(fs_info, inode);
3974 btrfs_free_path(path);
3978 btrfs_i_size_write(dir, dir->vfs_inode.i_size - name_len * 2);
3979 inode_inc_iversion(&inode->vfs_inode);
3980 inode_inc_iversion(&dir->vfs_inode);
3981 inode->vfs_inode.i_ctime = dir->vfs_inode.i_mtime =
3982 dir->vfs_inode.i_ctime = current_time(&inode->vfs_inode);
3983 ret = btrfs_update_inode(trans, root, dir);
3988 int btrfs_unlink_inode(struct btrfs_trans_handle *trans,
3989 struct btrfs_root *root,
3990 struct btrfs_inode *dir, struct btrfs_inode *inode,
3991 const char *name, int name_len)
3994 ret = __btrfs_unlink_inode(trans, root, dir, inode, name, name_len);
3996 drop_nlink(&inode->vfs_inode);
3997 ret = btrfs_update_inode(trans, root, inode);
4003 * helper to start transaction for unlink and rmdir.
4005 * unlink and rmdir are special in btrfs, they do not always free space, so
4006 * if we cannot make our reservations the normal way try and see if there is
4007 * plenty of slack room in the global reserve to migrate, otherwise we cannot
4008 * allow the unlink to occur.
4010 static struct btrfs_trans_handle *__unlink_start_trans(struct inode *dir)
4012 struct btrfs_root *root = BTRFS_I(dir)->root;
4015 * 1 for the possible orphan item
4016 * 1 for the dir item
4017 * 1 for the dir index
4018 * 1 for the inode ref
4021 return btrfs_start_transaction_fallback_global_rsv(root, 5);
4024 static int btrfs_unlink(struct inode *dir, struct dentry *dentry)
4026 struct btrfs_root *root = BTRFS_I(dir)->root;
4027 struct btrfs_trans_handle *trans;
4028 struct inode *inode = d_inode(dentry);
4031 trans = __unlink_start_trans(dir);
4033 return PTR_ERR(trans);
4035 btrfs_record_unlink_dir(trans, BTRFS_I(dir), BTRFS_I(d_inode(dentry)),
4038 ret = btrfs_unlink_inode(trans, root, BTRFS_I(dir),
4039 BTRFS_I(d_inode(dentry)), dentry->d_name.name,
4040 dentry->d_name.len);
4044 if (inode->i_nlink == 0) {
4045 ret = btrfs_orphan_add(trans, BTRFS_I(inode));
4051 btrfs_end_transaction(trans);
4052 btrfs_btree_balance_dirty(root->fs_info);
4056 static int btrfs_unlink_subvol(struct btrfs_trans_handle *trans,
4057 struct inode *dir, struct dentry *dentry)
4059 struct btrfs_root *root = BTRFS_I(dir)->root;
4060 struct btrfs_inode *inode = BTRFS_I(d_inode(dentry));
4061 struct btrfs_path *path;
4062 struct extent_buffer *leaf;
4063 struct btrfs_dir_item *di;
4064 struct btrfs_key key;
4065 const char *name = dentry->d_name.name;
4066 int name_len = dentry->d_name.len;
4070 u64 dir_ino = btrfs_ino(BTRFS_I(dir));
4072 if (btrfs_ino(inode) == BTRFS_FIRST_FREE_OBJECTID) {
4073 objectid = inode->root->root_key.objectid;
4074 } else if (btrfs_ino(inode) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID) {
4075 objectid = inode->location.objectid;
4081 path = btrfs_alloc_path();
4085 di = btrfs_lookup_dir_item(trans, root, path, dir_ino,
4086 name, name_len, -1);
4087 if (IS_ERR_OR_NULL(di)) {
4088 ret = di ? PTR_ERR(di) : -ENOENT;
4092 leaf = path->nodes[0];
4093 btrfs_dir_item_key_to_cpu(leaf, di, &key);
4094 WARN_ON(key.type != BTRFS_ROOT_ITEM_KEY || key.objectid != objectid);
4095 ret = btrfs_delete_one_dir_name(trans, root, path, di);
4097 btrfs_abort_transaction(trans, ret);
4100 btrfs_release_path(path);
4103 * This is a placeholder inode for a subvolume we didn't have a
4104 * reference to at the time of the snapshot creation. In the meantime
4105 * we could have renamed the real subvol link into our snapshot, so
4106 * depending on btrfs_del_root_ref to return -ENOENT here is incorret.
4107 * Instead simply lookup the dir_index_item for this entry so we can
4108 * remove it. Otherwise we know we have a ref to the root and we can
4109 * call btrfs_del_root_ref, and it _shouldn't_ fail.
4111 if (btrfs_ino(inode) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID) {
4112 di = btrfs_search_dir_index_item(root, path, dir_ino,
4114 if (IS_ERR_OR_NULL(di)) {
4119 btrfs_abort_transaction(trans, ret);
4123 leaf = path->nodes[0];
4124 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
4126 btrfs_release_path(path);
4128 ret = btrfs_del_root_ref(trans, objectid,
4129 root->root_key.objectid, dir_ino,
4130 &index, name, name_len);
4132 btrfs_abort_transaction(trans, ret);
4137 ret = btrfs_delete_delayed_dir_index(trans, BTRFS_I(dir), index);
4139 btrfs_abort_transaction(trans, ret);
4143 btrfs_i_size_write(BTRFS_I(dir), dir->i_size - name_len * 2);
4144 inode_inc_iversion(dir);
4145 dir->i_mtime = dir->i_ctime = current_time(dir);
4146 ret = btrfs_update_inode_fallback(trans, root, BTRFS_I(dir));
4148 btrfs_abort_transaction(trans, ret);
4150 btrfs_free_path(path);
4155 * Helper to check if the subvolume references other subvolumes or if it's
4158 static noinline int may_destroy_subvol(struct btrfs_root *root)
4160 struct btrfs_fs_info *fs_info = root->fs_info;
4161 struct btrfs_path *path;
4162 struct btrfs_dir_item *di;
4163 struct btrfs_key key;
4167 path = btrfs_alloc_path();
4171 /* Make sure this root isn't set as the default subvol */
4172 dir_id = btrfs_super_root_dir(fs_info->super_copy);
4173 di = btrfs_lookup_dir_item(NULL, fs_info->tree_root, path,
4174 dir_id, "default", 7, 0);
4175 if (di && !IS_ERR(di)) {
4176 btrfs_dir_item_key_to_cpu(path->nodes[0], di, &key);
4177 if (key.objectid == root->root_key.objectid) {
4180 "deleting default subvolume %llu is not allowed",
4184 btrfs_release_path(path);
4187 key.objectid = root->root_key.objectid;
4188 key.type = BTRFS_ROOT_REF_KEY;
4189 key.offset = (u64)-1;
4191 ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, path, 0, 0);
4197 if (path->slots[0] > 0) {
4199 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
4200 if (key.objectid == root->root_key.objectid &&
4201 key.type == BTRFS_ROOT_REF_KEY)
4205 btrfs_free_path(path);
4209 /* Delete all dentries for inodes belonging to the root */
4210 static void btrfs_prune_dentries(struct btrfs_root *root)
4212 struct btrfs_fs_info *fs_info = root->fs_info;
4213 struct rb_node *node;
4214 struct rb_node *prev;
4215 struct btrfs_inode *entry;
4216 struct inode *inode;
4219 if (!test_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state))
4220 WARN_ON(btrfs_root_refs(&root->root_item) != 0);
4222 spin_lock(&root->inode_lock);
4224 node = root->inode_tree.rb_node;
4228 entry = rb_entry(node, struct btrfs_inode, rb_node);
4230 if (objectid < btrfs_ino(entry))
4231 node = node->rb_left;
4232 else if (objectid > btrfs_ino(entry))
4233 node = node->rb_right;
4239 entry = rb_entry(prev, struct btrfs_inode, rb_node);
4240 if (objectid <= btrfs_ino(entry)) {
4244 prev = rb_next(prev);
4248 entry = rb_entry(node, struct btrfs_inode, rb_node);
4249 objectid = btrfs_ino(entry) + 1;
4250 inode = igrab(&entry->vfs_inode);
4252 spin_unlock(&root->inode_lock);
4253 if (atomic_read(&inode->i_count) > 1)
4254 d_prune_aliases(inode);
4256 * btrfs_drop_inode will have it removed from the inode
4257 * cache when its usage count hits zero.
4261 spin_lock(&root->inode_lock);
4265 if (cond_resched_lock(&root->inode_lock))
4268 node = rb_next(node);
4270 spin_unlock(&root->inode_lock);
4273 int btrfs_delete_subvolume(struct inode *dir, struct dentry *dentry)
4275 struct btrfs_fs_info *fs_info = btrfs_sb(dentry->d_sb);
4276 struct btrfs_root *root = BTRFS_I(dir)->root;
4277 struct inode *inode = d_inode(dentry);
4278 struct btrfs_root *dest = BTRFS_I(inode)->root;
4279 struct btrfs_trans_handle *trans;
4280 struct btrfs_block_rsv block_rsv;
4285 * Don't allow to delete a subvolume with send in progress. This is
4286 * inside the inode lock so the error handling that has to drop the bit
4287 * again is not run concurrently.
4289 spin_lock(&dest->root_item_lock);
4290 if (dest->send_in_progress) {
4291 spin_unlock(&dest->root_item_lock);
4293 "attempt to delete subvolume %llu during send",
4294 dest->root_key.objectid);
4297 root_flags = btrfs_root_flags(&dest->root_item);
4298 btrfs_set_root_flags(&dest->root_item,
4299 root_flags | BTRFS_ROOT_SUBVOL_DEAD);
4300 spin_unlock(&dest->root_item_lock);
4302 down_write(&fs_info->subvol_sem);
4304 ret = may_destroy_subvol(dest);
4308 btrfs_init_block_rsv(&block_rsv, BTRFS_BLOCK_RSV_TEMP);
4310 * One for dir inode,
4311 * two for dir entries,
4312 * two for root ref/backref.
4314 ret = btrfs_subvolume_reserve_metadata(root, &block_rsv, 5, true);
4318 trans = btrfs_start_transaction(root, 0);
4319 if (IS_ERR(trans)) {
4320 ret = PTR_ERR(trans);
4323 trans->block_rsv = &block_rsv;
4324 trans->bytes_reserved = block_rsv.size;
4326 btrfs_record_snapshot_destroy(trans, BTRFS_I(dir));
4328 ret = btrfs_unlink_subvol(trans, dir, dentry);
4330 btrfs_abort_transaction(trans, ret);
4334 btrfs_record_root_in_trans(trans, dest);
4336 memset(&dest->root_item.drop_progress, 0,
4337 sizeof(dest->root_item.drop_progress));
4338 btrfs_set_root_drop_level(&dest->root_item, 0);
4339 btrfs_set_root_refs(&dest->root_item, 0);
4341 if (!test_and_set_bit(BTRFS_ROOT_ORPHAN_ITEM_INSERTED, &dest->state)) {
4342 ret = btrfs_insert_orphan_item(trans,
4344 dest->root_key.objectid);
4346 btrfs_abort_transaction(trans, ret);
4351 ret = btrfs_uuid_tree_remove(trans, dest->root_item.uuid,
4352 BTRFS_UUID_KEY_SUBVOL,
4353 dest->root_key.objectid);
4354 if (ret && ret != -ENOENT) {
4355 btrfs_abort_transaction(trans, ret);
4358 if (!btrfs_is_empty_uuid(dest->root_item.received_uuid)) {
4359 ret = btrfs_uuid_tree_remove(trans,
4360 dest->root_item.received_uuid,
4361 BTRFS_UUID_KEY_RECEIVED_SUBVOL,
4362 dest->root_key.objectid);
4363 if (ret && ret != -ENOENT) {
4364 btrfs_abort_transaction(trans, ret);
4369 free_anon_bdev(dest->anon_dev);
4372 trans->block_rsv = NULL;
4373 trans->bytes_reserved = 0;
4374 ret = btrfs_end_transaction(trans);
4375 inode->i_flags |= S_DEAD;
4377 btrfs_subvolume_release_metadata(root, &block_rsv);
4379 up_write(&fs_info->subvol_sem);
4381 spin_lock(&dest->root_item_lock);
4382 root_flags = btrfs_root_flags(&dest->root_item);
4383 btrfs_set_root_flags(&dest->root_item,
4384 root_flags & ~BTRFS_ROOT_SUBVOL_DEAD);
4385 spin_unlock(&dest->root_item_lock);
4387 d_invalidate(dentry);
4388 btrfs_prune_dentries(dest);
4389 ASSERT(dest->send_in_progress == 0);
4395 static int btrfs_rmdir(struct inode *dir, struct dentry *dentry)
4397 struct inode *inode = d_inode(dentry);
4399 struct btrfs_root *root = BTRFS_I(dir)->root;
4400 struct btrfs_trans_handle *trans;
4401 u64 last_unlink_trans;
4403 if (inode->i_size > BTRFS_EMPTY_DIR_SIZE)
4405 if (btrfs_ino(BTRFS_I(inode)) == BTRFS_FIRST_FREE_OBJECTID)
4406 return btrfs_delete_subvolume(dir, dentry);
4408 trans = __unlink_start_trans(dir);
4410 return PTR_ERR(trans);
4412 if (unlikely(btrfs_ino(BTRFS_I(inode)) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)) {
4413 err = btrfs_unlink_subvol(trans, dir, dentry);
4417 err = btrfs_orphan_add(trans, BTRFS_I(inode));
4421 last_unlink_trans = BTRFS_I(inode)->last_unlink_trans;
4423 /* now the directory is empty */
4424 err = btrfs_unlink_inode(trans, root, BTRFS_I(dir),
4425 BTRFS_I(d_inode(dentry)), dentry->d_name.name,
4426 dentry->d_name.len);
4428 btrfs_i_size_write(BTRFS_I(inode), 0);
4430 * Propagate the last_unlink_trans value of the deleted dir to
4431 * its parent directory. This is to prevent an unrecoverable
4432 * log tree in the case we do something like this:
4434 * 2) create snapshot under dir foo
4435 * 3) delete the snapshot
4438 * 6) fsync foo or some file inside foo
4440 if (last_unlink_trans >= trans->transid)
4441 BTRFS_I(dir)->last_unlink_trans = last_unlink_trans;
4444 btrfs_end_transaction(trans);
4445 btrfs_btree_balance_dirty(root->fs_info);
4451 * Return this if we need to call truncate_block for the last bit of the
4454 #define NEED_TRUNCATE_BLOCK 1
4457 * this can truncate away extent items, csum items and directory items.
4458 * It starts at a high offset and removes keys until it can't find
4459 * any higher than new_size
4461 * csum items that cross the new i_size are truncated to the new size
4464 * min_type is the minimum key type to truncate down to. If set to 0, this
4465 * will kill all the items on this inode, including the INODE_ITEM_KEY.
4467 int btrfs_truncate_inode_items(struct btrfs_trans_handle *trans,
4468 struct btrfs_root *root,
4469 struct btrfs_inode *inode,
4470 u64 new_size, u32 min_type)
4472 struct btrfs_fs_info *fs_info = root->fs_info;
4473 struct btrfs_path *path;
4474 struct extent_buffer *leaf;
4475 struct btrfs_file_extent_item *fi;
4476 struct btrfs_key key;
4477 struct btrfs_key found_key;
4478 u64 extent_start = 0;
4479 u64 extent_num_bytes = 0;
4480 u64 extent_offset = 0;
4482 u64 last_size = new_size;
4483 u32 found_type = (u8)-1;
4486 int pending_del_nr = 0;
4487 int pending_del_slot = 0;
4488 int extent_type = -1;
4490 u64 ino = btrfs_ino(inode);
4491 u64 bytes_deleted = 0;
4492 bool be_nice = false;
4493 bool should_throttle = false;
4494 const u64 lock_start = ALIGN_DOWN(new_size, fs_info->sectorsize);
4495 struct extent_state *cached_state = NULL;
4497 BUG_ON(new_size > 0 && min_type != BTRFS_EXTENT_DATA_KEY);
4500 * For non-free space inodes and non-shareable roots, we want to back
4501 * off from time to time. This means all inodes in subvolume roots,
4502 * reloc roots, and data reloc roots.
4504 if (!btrfs_is_free_space_inode(inode) &&
4505 test_bit(BTRFS_ROOT_SHAREABLE, &root->state))
4508 path = btrfs_alloc_path();
4511 path->reada = READA_BACK;
4513 if (root->root_key.objectid != BTRFS_TREE_LOG_OBJECTID) {
4514 lock_extent_bits(&inode->io_tree, lock_start, (u64)-1,
4518 * We want to drop from the next block forward in case this
4519 * new size is not block aligned since we will be keeping the
4520 * last block of the extent just the way it is.
4522 btrfs_drop_extent_cache(inode, ALIGN(new_size,
4523 fs_info->sectorsize),
4528 * This function is also used to drop the items in the log tree before
4529 * we relog the inode, so if root != BTRFS_I(inode)->root, it means
4530 * it is used to drop the logged items. So we shouldn't kill the delayed
4533 if (min_type == 0 && root == inode->root)
4534 btrfs_kill_delayed_inode_items(inode);
4537 key.offset = (u64)-1;
4542 * with a 16K leaf size and 128MB extents, you can actually queue
4543 * up a huge file in a single leaf. Most of the time that
4544 * bytes_deleted is > 0, it will be huge by the time we get here
4546 if (be_nice && bytes_deleted > SZ_32M &&
4547 btrfs_should_end_transaction(trans)) {
4552 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
4558 /* there are no items in the tree for us to truncate, we're
4561 if (path->slots[0] == 0)
4567 u64 clear_start = 0, clear_len = 0;
4570 leaf = path->nodes[0];
4571 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
4572 found_type = found_key.type;
4574 if (found_key.objectid != ino)
4577 if (found_type < min_type)
4580 item_end = found_key.offset;
4581 if (found_type == BTRFS_EXTENT_DATA_KEY) {
4582 fi = btrfs_item_ptr(leaf, path->slots[0],
4583 struct btrfs_file_extent_item);
4584 extent_type = btrfs_file_extent_type(leaf, fi);
4585 if (extent_type != BTRFS_FILE_EXTENT_INLINE) {
4587 btrfs_file_extent_num_bytes(leaf, fi);
4589 trace_btrfs_truncate_show_fi_regular(
4590 inode, leaf, fi, found_key.offset);
4591 } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
4592 item_end += btrfs_file_extent_ram_bytes(leaf,
4595 trace_btrfs_truncate_show_fi_inline(
4596 inode, leaf, fi, path->slots[0],
4601 if (found_type > min_type) {
4604 if (item_end < new_size)
4606 if (found_key.offset >= new_size)
4612 /* FIXME, shrink the extent if the ref count is only 1 */
4613 if (found_type != BTRFS_EXTENT_DATA_KEY)
4616 if (extent_type != BTRFS_FILE_EXTENT_INLINE) {
4619 clear_start = found_key.offset;
4620 extent_start = btrfs_file_extent_disk_bytenr(leaf, fi);
4622 u64 orig_num_bytes =
4623 btrfs_file_extent_num_bytes(leaf, fi);
4624 extent_num_bytes = ALIGN(new_size -
4626 fs_info->sectorsize);
4627 clear_start = ALIGN(new_size, fs_info->sectorsize);
4628 btrfs_set_file_extent_num_bytes(leaf, fi,
4630 num_dec = (orig_num_bytes -
4632 if (test_bit(BTRFS_ROOT_SHAREABLE,
4635 inode_sub_bytes(&inode->vfs_inode,
4637 btrfs_mark_buffer_dirty(leaf);
4640 btrfs_file_extent_disk_num_bytes(leaf,
4642 extent_offset = found_key.offset -
4643 btrfs_file_extent_offset(leaf, fi);
4645 /* FIXME blocksize != 4096 */
4646 num_dec = btrfs_file_extent_num_bytes(leaf, fi);
4647 if (extent_start != 0) {
4649 if (test_bit(BTRFS_ROOT_SHAREABLE,
4651 inode_sub_bytes(&inode->vfs_inode,
4655 clear_len = num_dec;
4656 } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
4658 * we can't truncate inline items that have had
4662 btrfs_file_extent_encryption(leaf, fi) == 0 &&
4663 btrfs_file_extent_other_encoding(leaf, fi) == 0 &&
4664 btrfs_file_extent_compression(leaf, fi) == 0) {
4665 u32 size = (u32)(new_size - found_key.offset);
4667 btrfs_set_file_extent_ram_bytes(leaf, fi, size);
4668 size = btrfs_file_extent_calc_inline_size(size);
4669 btrfs_truncate_item(path, size, 1);
4670 } else if (!del_item) {
4672 * We have to bail so the last_size is set to
4673 * just before this extent.
4675 ret = NEED_TRUNCATE_BLOCK;
4679 * Inline extents are special, we just treat
4680 * them as a full sector worth in the file
4681 * extent tree just for simplicity sake.
4683 clear_len = fs_info->sectorsize;
4686 if (test_bit(BTRFS_ROOT_SHAREABLE, &root->state))
4687 inode_sub_bytes(&inode->vfs_inode,
4688 item_end + 1 - new_size);
4692 * We use btrfs_truncate_inode_items() to clean up log trees for
4693 * multiple fsyncs, and in this case we don't want to clear the
4694 * file extent range because it's just the log.
4696 if (root == inode->root) {
4697 ret = btrfs_inode_clear_file_extent_range(inode,
4698 clear_start, clear_len);
4700 btrfs_abort_transaction(trans, ret);
4706 last_size = found_key.offset;
4708 last_size = new_size;
4710 if (!pending_del_nr) {
4711 /* no pending yet, add ourselves */
4712 pending_del_slot = path->slots[0];
4714 } else if (pending_del_nr &&
4715 path->slots[0] + 1 == pending_del_slot) {
4716 /* hop on the pending chunk */
4718 pending_del_slot = path->slots[0];
4725 should_throttle = false;
4728 root->root_key.objectid != BTRFS_TREE_LOG_OBJECTID) {
4729 struct btrfs_ref ref = { 0 };
4731 bytes_deleted += extent_num_bytes;
4733 btrfs_init_generic_ref(&ref, BTRFS_DROP_DELAYED_REF,
4734 extent_start, extent_num_bytes, 0);
4735 ref.real_root = root->root_key.objectid;
4736 btrfs_init_data_ref(&ref, btrfs_header_owner(leaf),
4737 ino, extent_offset);
4738 ret = btrfs_free_extent(trans, &ref);
4740 btrfs_abort_transaction(trans, ret);
4744 if (btrfs_should_throttle_delayed_refs(trans))
4745 should_throttle = true;
4749 if (found_type == BTRFS_INODE_ITEM_KEY)
4752 if (path->slots[0] == 0 ||
4753 path->slots[0] != pending_del_slot ||
4755 if (pending_del_nr) {
4756 ret = btrfs_del_items(trans, root, path,
4760 btrfs_abort_transaction(trans, ret);
4765 btrfs_release_path(path);
4768 * We can generate a lot of delayed refs, so we need to
4769 * throttle every once and a while and make sure we're
4770 * adding enough space to keep up with the work we are
4771 * generating. Since we hold a transaction here we
4772 * can't flush, and we don't want to FLUSH_LIMIT because
4773 * we could have generated too many delayed refs to
4774 * actually allocate, so just bail if we're short and
4775 * let the normal reservation dance happen higher up.
4777 if (should_throttle) {
4778 ret = btrfs_delayed_refs_rsv_refill(fs_info,
4779 BTRFS_RESERVE_NO_FLUSH);
4791 if (ret >= 0 && pending_del_nr) {
4794 err = btrfs_del_items(trans, root, path, pending_del_slot,
4797 btrfs_abort_transaction(trans, err);
4801 if (root->root_key.objectid != BTRFS_TREE_LOG_OBJECTID) {
4802 ASSERT(last_size >= new_size);
4803 if (!ret && last_size > new_size)
4804 last_size = new_size;
4805 btrfs_inode_safe_disk_i_size_write(inode, last_size);
4806 unlock_extent_cached(&inode->io_tree, lock_start, (u64)-1,
4810 btrfs_free_path(path);
4815 * btrfs_truncate_block - read, zero a chunk and write a block
4816 * @inode - inode that we're zeroing
4817 * @from - the offset to start zeroing
4818 * @len - the length to zero, 0 to zero the entire range respective to the
4820 * @front - zero up to the offset instead of from the offset on
4822 * This will find the block for the "from" offset and cow the block and zero the
4823 * part we want to zero. This is used with truncate and hole punching.
4825 int btrfs_truncate_block(struct btrfs_inode *inode, loff_t from, loff_t len,
4828 struct btrfs_fs_info *fs_info = inode->root->fs_info;
4829 struct address_space *mapping = inode->vfs_inode.i_mapping;
4830 struct extent_io_tree *io_tree = &inode->io_tree;
4831 struct btrfs_ordered_extent *ordered;
4832 struct extent_state *cached_state = NULL;
4833 struct extent_changeset *data_reserved = NULL;
4835 bool only_release_metadata = false;
4836 u32 blocksize = fs_info->sectorsize;
4837 pgoff_t index = from >> PAGE_SHIFT;
4838 unsigned offset = from & (blocksize - 1);
4840 gfp_t mask = btrfs_alloc_write_mask(mapping);
4841 size_t write_bytes = blocksize;
4846 if (IS_ALIGNED(offset, blocksize) &&
4847 (!len || IS_ALIGNED(len, blocksize)))
4850 block_start = round_down(from, blocksize);
4851 block_end = block_start + blocksize - 1;
4853 ret = btrfs_check_data_free_space(inode, &data_reserved, block_start,
4856 if (btrfs_check_nocow_lock(inode, block_start, &write_bytes) > 0) {
4857 /* For nocow case, no need to reserve data space */
4858 only_release_metadata = true;
4863 ret = btrfs_delalloc_reserve_metadata(inode, blocksize);
4865 if (!only_release_metadata)
4866 btrfs_free_reserved_data_space(inode, data_reserved,
4867 block_start, blocksize);
4871 page = find_or_create_page(mapping, index, mask);
4873 btrfs_delalloc_release_space(inode, data_reserved, block_start,
4875 btrfs_delalloc_release_extents(inode, blocksize);
4879 ret = set_page_extent_mapped(page);
4883 if (!PageUptodate(page)) {
4884 ret = btrfs_readpage(NULL, page);
4886 if (page->mapping != mapping) {
4891 if (!PageUptodate(page)) {
4896 wait_on_page_writeback(page);
4898 lock_extent_bits(io_tree, block_start, block_end, &cached_state);
4900 ordered = btrfs_lookup_ordered_extent(inode, block_start);
4902 unlock_extent_cached(io_tree, block_start, block_end,
4906 btrfs_start_ordered_extent(ordered, 1);
4907 btrfs_put_ordered_extent(ordered);
4911 clear_extent_bit(&inode->io_tree, block_start, block_end,
4912 EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING | EXTENT_DEFRAG,
4913 0, 0, &cached_state);
4915 ret = btrfs_set_extent_delalloc(inode, block_start, block_end, 0,
4918 unlock_extent_cached(io_tree, block_start, block_end,
4923 if (offset != blocksize) {
4925 len = blocksize - offset;
4928 memset(kaddr + (block_start - page_offset(page)),
4931 memset(kaddr + (block_start - page_offset(page)) + offset,
4933 flush_dcache_page(page);
4936 ClearPageChecked(page);
4937 set_page_dirty(page);
4938 unlock_extent_cached(io_tree, block_start, block_end, &cached_state);
4940 if (only_release_metadata)
4941 set_extent_bit(&inode->io_tree, block_start, block_end,
4942 EXTENT_NORESERVE, 0, NULL, NULL, GFP_NOFS, NULL);
4946 if (only_release_metadata)
4947 btrfs_delalloc_release_metadata(inode, blocksize, true);
4949 btrfs_delalloc_release_space(inode, data_reserved,
4950 block_start, blocksize, true);
4952 btrfs_delalloc_release_extents(inode, blocksize);
4956 if (only_release_metadata)
4957 btrfs_check_nocow_unlock(inode);
4958 extent_changeset_free(data_reserved);
4962 static int maybe_insert_hole(struct btrfs_root *root, struct btrfs_inode *inode,
4963 u64 offset, u64 len)
4965 struct btrfs_fs_info *fs_info = root->fs_info;
4966 struct btrfs_trans_handle *trans;
4967 struct btrfs_drop_extents_args drop_args = { 0 };
4971 * Still need to make sure the inode looks like it's been updated so
4972 * that any holes get logged if we fsync.
4974 if (btrfs_fs_incompat(fs_info, NO_HOLES)) {
4975 inode->last_trans = fs_info->generation;
4976 inode->last_sub_trans = root->log_transid;
4977 inode->last_log_commit = root->last_log_commit;
4982 * 1 - for the one we're dropping
4983 * 1 - for the one we're adding
4984 * 1 - for updating the inode.
4986 trans = btrfs_start_transaction(root, 3);
4988 return PTR_ERR(trans);
4990 drop_args.start = offset;
4991 drop_args.end = offset + len;
4992 drop_args.drop_cache = true;
4994 ret = btrfs_drop_extents(trans, root, inode, &drop_args);
4996 btrfs_abort_transaction(trans, ret);
4997 btrfs_end_transaction(trans);
5001 ret = btrfs_insert_file_extent(trans, root, btrfs_ino(inode),
5002 offset, 0, 0, len, 0, len, 0, 0, 0);
5004 btrfs_abort_transaction(trans, ret);
5006 btrfs_update_inode_bytes(inode, 0, drop_args.bytes_found);
5007 btrfs_update_inode(trans, root, inode);
5009 btrfs_end_transaction(trans);
5014 * This function puts in dummy file extents for the area we're creating a hole
5015 * for. So if we are truncating this file to a larger size we need to insert
5016 * these file extents so that btrfs_get_extent will return a EXTENT_MAP_HOLE for
5017 * the range between oldsize and size
5019 int btrfs_cont_expand(struct btrfs_inode *inode, loff_t oldsize, loff_t size)
5021 struct btrfs_root *root = inode->root;
5022 struct btrfs_fs_info *fs_info = root->fs_info;
5023 struct extent_io_tree *io_tree = &inode->io_tree;
5024 struct extent_map *em = NULL;
5025 struct extent_state *cached_state = NULL;
5026 struct extent_map_tree *em_tree = &inode->extent_tree;
5027 u64 hole_start = ALIGN(oldsize, fs_info->sectorsize);
5028 u64 block_end = ALIGN(size, fs_info->sectorsize);
5035 * If our size started in the middle of a block we need to zero out the
5036 * rest of the block before we expand the i_size, otherwise we could
5037 * expose stale data.
5039 err = btrfs_truncate_block(inode, oldsize, 0, 0);
5043 if (size <= hole_start)
5046 btrfs_lock_and_flush_ordered_range(inode, hole_start, block_end - 1,
5048 cur_offset = hole_start;
5050 em = btrfs_get_extent(inode, NULL, 0, cur_offset,
5051 block_end - cur_offset);
5057 last_byte = min(extent_map_end(em), block_end);
5058 last_byte = ALIGN(last_byte, fs_info->sectorsize);
5059 hole_size = last_byte - cur_offset;
5061 if (!test_bit(EXTENT_FLAG_PREALLOC, &em->flags)) {
5062 struct extent_map *hole_em;
5064 err = maybe_insert_hole(root, inode, cur_offset,
5069 err = btrfs_inode_set_file_extent_range(inode,
5070 cur_offset, hole_size);
5074 btrfs_drop_extent_cache(inode, cur_offset,
5075 cur_offset + hole_size - 1, 0);
5076 hole_em = alloc_extent_map();
5078 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC,
5079 &inode->runtime_flags);
5082 hole_em->start = cur_offset;
5083 hole_em->len = hole_size;
5084 hole_em->orig_start = cur_offset;
5086 hole_em->block_start = EXTENT_MAP_HOLE;
5087 hole_em->block_len = 0;
5088 hole_em->orig_block_len = 0;
5089 hole_em->ram_bytes = hole_size;
5090 hole_em->compress_type = BTRFS_COMPRESS_NONE;
5091 hole_em->generation = fs_info->generation;
5094 write_lock(&em_tree->lock);
5095 err = add_extent_mapping(em_tree, hole_em, 1);
5096 write_unlock(&em_tree->lock);
5099 btrfs_drop_extent_cache(inode, cur_offset,
5103 free_extent_map(hole_em);
5105 err = btrfs_inode_set_file_extent_range(inode,
5106 cur_offset, hole_size);
5111 free_extent_map(em);
5113 cur_offset = last_byte;
5114 if (cur_offset >= block_end)
5117 free_extent_map(em);
5118 unlock_extent_cached(io_tree, hole_start, block_end - 1, &cached_state);
5122 static int btrfs_setsize(struct inode *inode, struct iattr *attr)
5124 struct btrfs_root *root = BTRFS_I(inode)->root;
5125 struct btrfs_trans_handle *trans;
5126 loff_t oldsize = i_size_read(inode);
5127 loff_t newsize = attr->ia_size;
5128 int mask = attr->ia_valid;
5132 * The regular truncate() case without ATTR_CTIME and ATTR_MTIME is a
5133 * special case where we need to update the times despite not having
5134 * these flags set. For all other operations the VFS set these flags
5135 * explicitly if it wants a timestamp update.
5137 if (newsize != oldsize) {
5138 inode_inc_iversion(inode);
5139 if (!(mask & (ATTR_CTIME | ATTR_MTIME)))
5140 inode->i_ctime = inode->i_mtime =
5141 current_time(inode);
5144 if (newsize > oldsize) {
5146 * Don't do an expanding truncate while snapshotting is ongoing.
5147 * This is to ensure the snapshot captures a fully consistent
5148 * state of this file - if the snapshot captures this expanding
5149 * truncation, it must capture all writes that happened before
5152 btrfs_drew_write_lock(&root->snapshot_lock);
5153 ret = btrfs_cont_expand(BTRFS_I(inode), oldsize, newsize);
5155 btrfs_drew_write_unlock(&root->snapshot_lock);
5159 trans = btrfs_start_transaction(root, 1);
5160 if (IS_ERR(trans)) {
5161 btrfs_drew_write_unlock(&root->snapshot_lock);
5162 return PTR_ERR(trans);
5165 i_size_write(inode, newsize);
5166 btrfs_inode_safe_disk_i_size_write(BTRFS_I(inode), 0);
5167 pagecache_isize_extended(inode, oldsize, newsize);
5168 ret = btrfs_update_inode(trans, root, BTRFS_I(inode));
5169 btrfs_drew_write_unlock(&root->snapshot_lock);
5170 btrfs_end_transaction(trans);
5172 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
5174 if (btrfs_is_zoned(fs_info)) {
5175 ret = btrfs_wait_ordered_range(inode,
5176 ALIGN(newsize, fs_info->sectorsize),
5183 * We're truncating a file that used to have good data down to
5184 * zero. Make sure any new writes to the file get on disk
5188 set_bit(BTRFS_INODE_FLUSH_ON_CLOSE,
5189 &BTRFS_I(inode)->runtime_flags);
5191 truncate_setsize(inode, newsize);
5193 inode_dio_wait(inode);
5195 ret = btrfs_truncate(inode, newsize == oldsize);
5196 if (ret && inode->i_nlink) {
5200 * Truncate failed, so fix up the in-memory size. We
5201 * adjusted disk_i_size down as we removed extents, so
5202 * wait for disk_i_size to be stable and then update the
5203 * in-memory size to match.
5205 err = btrfs_wait_ordered_range(inode, 0, (u64)-1);
5208 i_size_write(inode, BTRFS_I(inode)->disk_i_size);
5215 static int btrfs_setattr(struct user_namespace *mnt_userns, struct dentry *dentry,
5218 struct inode *inode = d_inode(dentry);
5219 struct btrfs_root *root = BTRFS_I(inode)->root;
5222 if (btrfs_root_readonly(root))
5225 err = setattr_prepare(&init_user_ns, dentry, attr);
5229 if (S_ISREG(inode->i_mode) && (attr->ia_valid & ATTR_SIZE)) {
5230 err = btrfs_setsize(inode, attr);
5235 if (attr->ia_valid) {
5236 setattr_copy(&init_user_ns, inode, attr);
5237 inode_inc_iversion(inode);
5238 err = btrfs_dirty_inode(inode);
5240 if (!err && attr->ia_valid & ATTR_MODE)
5241 err = posix_acl_chmod(&init_user_ns, inode,
5249 * While truncating the inode pages during eviction, we get the VFS calling
5250 * btrfs_invalidatepage() against each page of the inode. This is slow because
5251 * the calls to btrfs_invalidatepage() result in a huge amount of calls to
5252 * lock_extent_bits() and clear_extent_bit(), which keep merging and splitting
5253 * extent_state structures over and over, wasting lots of time.
5255 * Therefore if the inode is being evicted, let btrfs_invalidatepage() skip all
5256 * those expensive operations on a per page basis and do only the ordered io
5257 * finishing, while we release here the extent_map and extent_state structures,
5258 * without the excessive merging and splitting.
5260 static void evict_inode_truncate_pages(struct inode *inode)
5262 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
5263 struct extent_map_tree *map_tree = &BTRFS_I(inode)->extent_tree;
5264 struct rb_node *node;
5266 ASSERT(inode->i_state & I_FREEING);
5267 truncate_inode_pages_final(&inode->i_data);
5269 write_lock(&map_tree->lock);
5270 while (!RB_EMPTY_ROOT(&map_tree->map.rb_root)) {
5271 struct extent_map *em;
5273 node = rb_first_cached(&map_tree->map);
5274 em = rb_entry(node, struct extent_map, rb_node);
5275 clear_bit(EXTENT_FLAG_PINNED, &em->flags);
5276 clear_bit(EXTENT_FLAG_LOGGING, &em->flags);
5277 remove_extent_mapping(map_tree, em);
5278 free_extent_map(em);
5279 if (need_resched()) {
5280 write_unlock(&map_tree->lock);
5282 write_lock(&map_tree->lock);
5285 write_unlock(&map_tree->lock);
5288 * Keep looping until we have no more ranges in the io tree.
5289 * We can have ongoing bios started by readahead that have
5290 * their endio callback (extent_io.c:end_bio_extent_readpage)
5291 * still in progress (unlocked the pages in the bio but did not yet
5292 * unlocked the ranges in the io tree). Therefore this means some
5293 * ranges can still be locked and eviction started because before
5294 * submitting those bios, which are executed by a separate task (work
5295 * queue kthread), inode references (inode->i_count) were not taken
5296 * (which would be dropped in the end io callback of each bio).
5297 * Therefore here we effectively end up waiting for those bios and
5298 * anyone else holding locked ranges without having bumped the inode's
5299 * reference count - if we don't do it, when they access the inode's
5300 * io_tree to unlock a range it may be too late, leading to an
5301 * use-after-free issue.
5303 spin_lock(&io_tree->lock);
5304 while (!RB_EMPTY_ROOT(&io_tree->state)) {
5305 struct extent_state *state;
5306 struct extent_state *cached_state = NULL;
5309 unsigned state_flags;
5311 node = rb_first(&io_tree->state);
5312 state = rb_entry(node, struct extent_state, rb_node);
5313 start = state->start;
5315 state_flags = state->state;
5316 spin_unlock(&io_tree->lock);
5318 lock_extent_bits(io_tree, start, end, &cached_state);
5321 * If still has DELALLOC flag, the extent didn't reach disk,
5322 * and its reserved space won't be freed by delayed_ref.
5323 * So we need to free its reserved space here.
5324 * (Refer to comment in btrfs_invalidatepage, case 2)
5326 * Note, end is the bytenr of last byte, so we need + 1 here.
5328 if (state_flags & EXTENT_DELALLOC)
5329 btrfs_qgroup_free_data(BTRFS_I(inode), NULL, start,
5332 clear_extent_bit(io_tree, start, end,
5333 EXTENT_LOCKED | EXTENT_DELALLOC |
5334 EXTENT_DO_ACCOUNTING | EXTENT_DEFRAG, 1, 1,
5338 spin_lock(&io_tree->lock);
5340 spin_unlock(&io_tree->lock);
5343 static struct btrfs_trans_handle *evict_refill_and_join(struct btrfs_root *root,
5344 struct btrfs_block_rsv *rsv)
5346 struct btrfs_fs_info *fs_info = root->fs_info;
5347 struct btrfs_block_rsv *global_rsv = &fs_info->global_block_rsv;
5348 struct btrfs_trans_handle *trans;
5349 u64 delayed_refs_extra = btrfs_calc_insert_metadata_size(fs_info, 1);
5353 * Eviction should be taking place at some place safe because of our
5354 * delayed iputs. However the normal flushing code will run delayed
5355 * iputs, so we cannot use FLUSH_ALL otherwise we'll deadlock.
5357 * We reserve the delayed_refs_extra here again because we can't use
5358 * btrfs_start_transaction(root, 0) for the same deadlocky reason as
5359 * above. We reserve our extra bit here because we generate a ton of
5360 * delayed refs activity by truncating.
5362 * If we cannot make our reservation we'll attempt to steal from the
5363 * global reserve, because we really want to be able to free up space.
5365 ret = btrfs_block_rsv_refill(root, rsv, rsv->size + delayed_refs_extra,
5366 BTRFS_RESERVE_FLUSH_EVICT);
5369 * Try to steal from the global reserve if there is space for
5372 if (btrfs_check_space_for_delayed_refs(fs_info) ||
5373 btrfs_block_rsv_migrate(global_rsv, rsv, rsv->size, 0)) {
5375 "could not allocate space for delete; will truncate on mount");
5376 return ERR_PTR(-ENOSPC);
5378 delayed_refs_extra = 0;
5381 trans = btrfs_join_transaction(root);
5385 if (delayed_refs_extra) {
5386 trans->block_rsv = &fs_info->trans_block_rsv;
5387 trans->bytes_reserved = delayed_refs_extra;
5388 btrfs_block_rsv_migrate(rsv, trans->block_rsv,
5389 delayed_refs_extra, 1);
5394 void btrfs_evict_inode(struct inode *inode)
5396 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
5397 struct btrfs_trans_handle *trans;
5398 struct btrfs_root *root = BTRFS_I(inode)->root;
5399 struct btrfs_block_rsv *rsv;
5402 trace_btrfs_inode_evict(inode);
5409 evict_inode_truncate_pages(inode);
5411 if (inode->i_nlink &&
5412 ((btrfs_root_refs(&root->root_item) != 0 &&
5413 root->root_key.objectid != BTRFS_ROOT_TREE_OBJECTID) ||
5414 btrfs_is_free_space_inode(BTRFS_I(inode))))
5417 if (is_bad_inode(inode))
5420 btrfs_free_io_failure_record(BTRFS_I(inode), 0, (u64)-1);
5422 if (test_bit(BTRFS_FS_LOG_RECOVERING, &fs_info->flags))
5425 if (inode->i_nlink > 0) {
5426 BUG_ON(btrfs_root_refs(&root->root_item) != 0 &&
5427 root->root_key.objectid != BTRFS_ROOT_TREE_OBJECTID);
5431 ret = btrfs_commit_inode_delayed_inode(BTRFS_I(inode));
5435 rsv = btrfs_alloc_block_rsv(fs_info, BTRFS_BLOCK_RSV_TEMP);
5438 rsv->size = btrfs_calc_metadata_size(fs_info, 1);
5441 btrfs_i_size_write(BTRFS_I(inode), 0);
5444 trans = evict_refill_and_join(root, rsv);
5448 trans->block_rsv = rsv;
5450 ret = btrfs_truncate_inode_items(trans, root, BTRFS_I(inode),
5452 trans->block_rsv = &fs_info->trans_block_rsv;
5453 btrfs_end_transaction(trans);
5454 btrfs_btree_balance_dirty(fs_info);
5455 if (ret && ret != -ENOSPC && ret != -EAGAIN)
5462 * Errors here aren't a big deal, it just means we leave orphan items in
5463 * the tree. They will be cleaned up on the next mount. If the inode
5464 * number gets reused, cleanup deletes the orphan item without doing
5465 * anything, and unlink reuses the existing orphan item.
5467 * If it turns out that we are dropping too many of these, we might want
5468 * to add a mechanism for retrying these after a commit.
5470 trans = evict_refill_and_join(root, rsv);
5471 if (!IS_ERR(trans)) {
5472 trans->block_rsv = rsv;
5473 btrfs_orphan_del(trans, BTRFS_I(inode));
5474 trans->block_rsv = &fs_info->trans_block_rsv;
5475 btrfs_end_transaction(trans);
5479 btrfs_free_block_rsv(fs_info, rsv);
5482 * If we didn't successfully delete, the orphan item will still be in
5483 * the tree and we'll retry on the next mount. Again, we might also want
5484 * to retry these periodically in the future.
5486 btrfs_remove_delayed_node(BTRFS_I(inode));
5491 * Return the key found in the dir entry in the location pointer, fill @type
5492 * with BTRFS_FT_*, and return 0.
5494 * If no dir entries were found, returns -ENOENT.
5495 * If found a corrupted location in dir entry, returns -EUCLEAN.
5497 static int btrfs_inode_by_name(struct inode *dir, struct dentry *dentry,
5498 struct btrfs_key *location, u8 *type)
5500 const char *name = dentry->d_name.name;
5501 int namelen = dentry->d_name.len;
5502 struct btrfs_dir_item *di;
5503 struct btrfs_path *path;
5504 struct btrfs_root *root = BTRFS_I(dir)->root;
5507 path = btrfs_alloc_path();
5511 di = btrfs_lookup_dir_item(NULL, root, path, btrfs_ino(BTRFS_I(dir)),
5513 if (IS_ERR_OR_NULL(di)) {
5514 ret = di ? PTR_ERR(di) : -ENOENT;
5518 btrfs_dir_item_key_to_cpu(path->nodes[0], di, location);
5519 if (location->type != BTRFS_INODE_ITEM_KEY &&
5520 location->type != BTRFS_ROOT_ITEM_KEY) {
5522 btrfs_warn(root->fs_info,
5523 "%s gets something invalid in DIR_ITEM (name %s, directory ino %llu, location(%llu %u %llu))",
5524 __func__, name, btrfs_ino(BTRFS_I(dir)),
5525 location->objectid, location->type, location->offset);
5528 *type = btrfs_dir_type(path->nodes[0], di);
5530 btrfs_free_path(path);
5535 * when we hit a tree root in a directory, the btrfs part of the inode
5536 * needs to be changed to reflect the root directory of the tree root. This
5537 * is kind of like crossing a mount point.
5539 static int fixup_tree_root_location(struct btrfs_fs_info *fs_info,
5541 struct dentry *dentry,
5542 struct btrfs_key *location,
5543 struct btrfs_root **sub_root)
5545 struct btrfs_path *path;
5546 struct btrfs_root *new_root;
5547 struct btrfs_root_ref *ref;
5548 struct extent_buffer *leaf;
5549 struct btrfs_key key;
5553 path = btrfs_alloc_path();
5560 key.objectid = BTRFS_I(dir)->root->root_key.objectid;
5561 key.type = BTRFS_ROOT_REF_KEY;
5562 key.offset = location->objectid;
5564 ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, path, 0, 0);
5571 leaf = path->nodes[0];
5572 ref = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_ref);
5573 if (btrfs_root_ref_dirid(leaf, ref) != btrfs_ino(BTRFS_I(dir)) ||
5574 btrfs_root_ref_name_len(leaf, ref) != dentry->d_name.len)
5577 ret = memcmp_extent_buffer(leaf, dentry->d_name.name,
5578 (unsigned long)(ref + 1),
5579 dentry->d_name.len);
5583 btrfs_release_path(path);
5585 new_root = btrfs_get_fs_root(fs_info, location->objectid, true);
5586 if (IS_ERR(new_root)) {
5587 err = PTR_ERR(new_root);
5591 *sub_root = new_root;
5592 location->objectid = btrfs_root_dirid(&new_root->root_item);
5593 location->type = BTRFS_INODE_ITEM_KEY;
5594 location->offset = 0;
5597 btrfs_free_path(path);
5601 static void inode_tree_add(struct inode *inode)
5603 struct btrfs_root *root = BTRFS_I(inode)->root;
5604 struct btrfs_inode *entry;
5606 struct rb_node *parent;
5607 struct rb_node *new = &BTRFS_I(inode)->rb_node;
5608 u64 ino = btrfs_ino(BTRFS_I(inode));
5610 if (inode_unhashed(inode))
5613 spin_lock(&root->inode_lock);
5614 p = &root->inode_tree.rb_node;
5617 entry = rb_entry(parent, struct btrfs_inode, rb_node);
5619 if (ino < btrfs_ino(entry))
5620 p = &parent->rb_left;
5621 else if (ino > btrfs_ino(entry))
5622 p = &parent->rb_right;
5624 WARN_ON(!(entry->vfs_inode.i_state &
5625 (I_WILL_FREE | I_FREEING)));
5626 rb_replace_node(parent, new, &root->inode_tree);
5627 RB_CLEAR_NODE(parent);
5628 spin_unlock(&root->inode_lock);
5632 rb_link_node(new, parent, p);
5633 rb_insert_color(new, &root->inode_tree);
5634 spin_unlock(&root->inode_lock);
5637 static void inode_tree_del(struct btrfs_inode *inode)
5639 struct btrfs_root *root = inode->root;
5642 spin_lock(&root->inode_lock);
5643 if (!RB_EMPTY_NODE(&inode->rb_node)) {
5644 rb_erase(&inode->rb_node, &root->inode_tree);
5645 RB_CLEAR_NODE(&inode->rb_node);
5646 empty = RB_EMPTY_ROOT(&root->inode_tree);
5648 spin_unlock(&root->inode_lock);
5650 if (empty && btrfs_root_refs(&root->root_item) == 0) {
5651 spin_lock(&root->inode_lock);
5652 empty = RB_EMPTY_ROOT(&root->inode_tree);
5653 spin_unlock(&root->inode_lock);
5655 btrfs_add_dead_root(root);
5660 static int btrfs_init_locked_inode(struct inode *inode, void *p)
5662 struct btrfs_iget_args *args = p;
5664 inode->i_ino = args->ino;
5665 BTRFS_I(inode)->location.objectid = args->ino;
5666 BTRFS_I(inode)->location.type = BTRFS_INODE_ITEM_KEY;
5667 BTRFS_I(inode)->location.offset = 0;
5668 BTRFS_I(inode)->root = btrfs_grab_root(args->root);
5669 BUG_ON(args->root && !BTRFS_I(inode)->root);
5673 static int btrfs_find_actor(struct inode *inode, void *opaque)
5675 struct btrfs_iget_args *args = opaque;
5677 return args->ino == BTRFS_I(inode)->location.objectid &&
5678 args->root == BTRFS_I(inode)->root;
5681 static struct inode *btrfs_iget_locked(struct super_block *s, u64 ino,
5682 struct btrfs_root *root)
5684 struct inode *inode;
5685 struct btrfs_iget_args args;
5686 unsigned long hashval = btrfs_inode_hash(ino, root);
5691 inode = iget5_locked(s, hashval, btrfs_find_actor,
5692 btrfs_init_locked_inode,
5698 * Get an inode object given its inode number and corresponding root.
5699 * Path can be preallocated to prevent recursing back to iget through
5700 * allocator. NULL is also valid but may require an additional allocation
5703 struct inode *btrfs_iget_path(struct super_block *s, u64 ino,
5704 struct btrfs_root *root, struct btrfs_path *path)
5706 struct inode *inode;
5708 inode = btrfs_iget_locked(s, ino, root);
5710 return ERR_PTR(-ENOMEM);
5712 if (inode->i_state & I_NEW) {
5715 ret = btrfs_read_locked_inode(inode, path);
5717 inode_tree_add(inode);
5718 unlock_new_inode(inode);
5722 * ret > 0 can come from btrfs_search_slot called by
5723 * btrfs_read_locked_inode, this means the inode item
5728 inode = ERR_PTR(ret);
5735 struct inode *btrfs_iget(struct super_block *s, u64 ino, struct btrfs_root *root)
5737 return btrfs_iget_path(s, ino, root, NULL);
5740 static struct inode *new_simple_dir(struct super_block *s,
5741 struct btrfs_key *key,
5742 struct btrfs_root *root)
5744 struct inode *inode = new_inode(s);
5747 return ERR_PTR(-ENOMEM);
5749 BTRFS_I(inode)->root = btrfs_grab_root(root);
5750 memcpy(&BTRFS_I(inode)->location, key, sizeof(*key));
5751 set_bit(BTRFS_INODE_DUMMY, &BTRFS_I(inode)->runtime_flags);
5753 inode->i_ino = BTRFS_EMPTY_SUBVOL_DIR_OBJECTID;
5755 * We only need lookup, the rest is read-only and there's no inode
5756 * associated with the dentry
5758 inode->i_op = &simple_dir_inode_operations;
5759 inode->i_opflags &= ~IOP_XATTR;
5760 inode->i_fop = &simple_dir_operations;
5761 inode->i_mode = S_IFDIR | S_IRUGO | S_IWUSR | S_IXUGO;
5762 inode->i_mtime = current_time(inode);
5763 inode->i_atime = inode->i_mtime;
5764 inode->i_ctime = inode->i_mtime;
5765 BTRFS_I(inode)->i_otime = inode->i_mtime;
5770 static inline u8 btrfs_inode_type(struct inode *inode)
5773 * Compile-time asserts that generic FT_* types still match
5776 BUILD_BUG_ON(BTRFS_FT_UNKNOWN != FT_UNKNOWN);
5777 BUILD_BUG_ON(BTRFS_FT_REG_FILE != FT_REG_FILE);
5778 BUILD_BUG_ON(BTRFS_FT_DIR != FT_DIR);
5779 BUILD_BUG_ON(BTRFS_FT_CHRDEV != FT_CHRDEV);
5780 BUILD_BUG_ON(BTRFS_FT_BLKDEV != FT_BLKDEV);
5781 BUILD_BUG_ON(BTRFS_FT_FIFO != FT_FIFO);
5782 BUILD_BUG_ON(BTRFS_FT_SOCK != FT_SOCK);
5783 BUILD_BUG_ON(BTRFS_FT_SYMLINK != FT_SYMLINK);
5785 return fs_umode_to_ftype(inode->i_mode);
5788 struct inode *btrfs_lookup_dentry(struct inode *dir, struct dentry *dentry)
5790 struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
5791 struct inode *inode;
5792 struct btrfs_root *root = BTRFS_I(dir)->root;
5793 struct btrfs_root *sub_root = root;
5794 struct btrfs_key location;
5798 if (dentry->d_name.len > BTRFS_NAME_LEN)
5799 return ERR_PTR(-ENAMETOOLONG);
5801 ret = btrfs_inode_by_name(dir, dentry, &location, &di_type);
5803 return ERR_PTR(ret);
5805 if (location.type == BTRFS_INODE_ITEM_KEY) {
5806 inode = btrfs_iget(dir->i_sb, location.objectid, root);
5810 /* Do extra check against inode mode with di_type */
5811 if (btrfs_inode_type(inode) != di_type) {
5813 "inode mode mismatch with dir: inode mode=0%o btrfs type=%u dir type=%u",
5814 inode->i_mode, btrfs_inode_type(inode),
5817 return ERR_PTR(-EUCLEAN);
5822 ret = fixup_tree_root_location(fs_info, dir, dentry,
5823 &location, &sub_root);
5826 inode = ERR_PTR(ret);
5828 inode = new_simple_dir(dir->i_sb, &location, sub_root);
5830 inode = btrfs_iget(dir->i_sb, location.objectid, sub_root);
5832 if (root != sub_root)
5833 btrfs_put_root(sub_root);
5835 if (!IS_ERR(inode) && root != sub_root) {
5836 down_read(&fs_info->cleanup_work_sem);
5837 if (!sb_rdonly(inode->i_sb))
5838 ret = btrfs_orphan_cleanup(sub_root);
5839 up_read(&fs_info->cleanup_work_sem);
5842 inode = ERR_PTR(ret);
5849 static int btrfs_dentry_delete(const struct dentry *dentry)
5851 struct btrfs_root *root;
5852 struct inode *inode = d_inode(dentry);
5854 if (!inode && !IS_ROOT(dentry))
5855 inode = d_inode(dentry->d_parent);
5858 root = BTRFS_I(inode)->root;
5859 if (btrfs_root_refs(&root->root_item) == 0)
5862 if (btrfs_ino(BTRFS_I(inode)) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)
5868 static struct dentry *btrfs_lookup(struct inode *dir, struct dentry *dentry,
5871 struct inode *inode = btrfs_lookup_dentry(dir, dentry);
5873 if (inode == ERR_PTR(-ENOENT))
5875 return d_splice_alias(inode, dentry);
5879 * All this infrastructure exists because dir_emit can fault, and we are holding
5880 * the tree lock when doing readdir. For now just allocate a buffer and copy
5881 * our information into that, and then dir_emit from the buffer. This is
5882 * similar to what NFS does, only we don't keep the buffer around in pagecache
5883 * because I'm afraid I'll mess that up. Long term we need to make filldir do
5884 * copy_to_user_inatomic so we don't have to worry about page faulting under the
5887 static int btrfs_opendir(struct inode *inode, struct file *file)
5889 struct btrfs_file_private *private;
5891 private = kzalloc(sizeof(struct btrfs_file_private), GFP_KERNEL);
5894 private->filldir_buf = kzalloc(PAGE_SIZE, GFP_KERNEL);
5895 if (!private->filldir_buf) {
5899 file->private_data = private;
5910 static int btrfs_filldir(void *addr, int entries, struct dir_context *ctx)
5913 struct dir_entry *entry = addr;
5914 char *name = (char *)(entry + 1);
5916 ctx->pos = get_unaligned(&entry->offset);
5917 if (!dir_emit(ctx, name, get_unaligned(&entry->name_len),
5918 get_unaligned(&entry->ino),
5919 get_unaligned(&entry->type)))
5921 addr += sizeof(struct dir_entry) +
5922 get_unaligned(&entry->name_len);
5928 static int btrfs_real_readdir(struct file *file, struct dir_context *ctx)
5930 struct inode *inode = file_inode(file);
5931 struct btrfs_root *root = BTRFS_I(inode)->root;
5932 struct btrfs_file_private *private = file->private_data;
5933 struct btrfs_dir_item *di;
5934 struct btrfs_key key;
5935 struct btrfs_key found_key;
5936 struct btrfs_path *path;
5938 struct list_head ins_list;
5939 struct list_head del_list;
5941 struct extent_buffer *leaf;
5948 struct btrfs_key location;
5950 if (!dir_emit_dots(file, ctx))
5953 path = btrfs_alloc_path();
5957 addr = private->filldir_buf;
5958 path->reada = READA_FORWARD;
5960 INIT_LIST_HEAD(&ins_list);
5961 INIT_LIST_HEAD(&del_list);
5962 put = btrfs_readdir_get_delayed_items(inode, &ins_list, &del_list);
5965 key.type = BTRFS_DIR_INDEX_KEY;
5966 key.offset = ctx->pos;
5967 key.objectid = btrfs_ino(BTRFS_I(inode));
5969 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
5974 struct dir_entry *entry;
5976 leaf = path->nodes[0];
5977 slot = path->slots[0];
5978 if (slot >= btrfs_header_nritems(leaf)) {
5979 ret = btrfs_next_leaf(root, path);
5987 btrfs_item_key_to_cpu(leaf, &found_key, slot);
5989 if (found_key.objectid != key.objectid)
5991 if (found_key.type != BTRFS_DIR_INDEX_KEY)
5993 if (found_key.offset < ctx->pos)
5995 if (btrfs_should_delete_dir_index(&del_list, found_key.offset))
5997 di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item);
5998 name_len = btrfs_dir_name_len(leaf, di);
5999 if ((total_len + sizeof(struct dir_entry) + name_len) >=
6001 btrfs_release_path(path);
6002 ret = btrfs_filldir(private->filldir_buf, entries, ctx);
6005 addr = private->filldir_buf;
6012 put_unaligned(name_len, &entry->name_len);
6013 name_ptr = (char *)(entry + 1);
6014 read_extent_buffer(leaf, name_ptr, (unsigned long)(di + 1),
6016 put_unaligned(fs_ftype_to_dtype(btrfs_dir_type(leaf, di)),
6018 btrfs_dir_item_key_to_cpu(leaf, di, &location);
6019 put_unaligned(location.objectid, &entry->ino);
6020 put_unaligned(found_key.offset, &entry->offset);
6022 addr += sizeof(struct dir_entry) + name_len;
6023 total_len += sizeof(struct dir_entry) + name_len;
6027 btrfs_release_path(path);
6029 ret = btrfs_filldir(private->filldir_buf, entries, ctx);
6033 ret = btrfs_readdir_delayed_dir_index(ctx, &ins_list);
6038 * Stop new entries from being returned after we return the last
6041 * New directory entries are assigned a strictly increasing
6042 * offset. This means that new entries created during readdir
6043 * are *guaranteed* to be seen in the future by that readdir.
6044 * This has broken buggy programs which operate on names as
6045 * they're returned by readdir. Until we re-use freed offsets
6046 * we have this hack to stop new entries from being returned
6047 * under the assumption that they'll never reach this huge
6050 * This is being careful not to overflow 32bit loff_t unless the
6051 * last entry requires it because doing so has broken 32bit apps
6054 if (ctx->pos >= INT_MAX)
6055 ctx->pos = LLONG_MAX;
6062 btrfs_readdir_put_delayed_items(inode, &ins_list, &del_list);
6063 btrfs_free_path(path);
6068 * This is somewhat expensive, updating the tree every time the
6069 * inode changes. But, it is most likely to find the inode in cache.
6070 * FIXME, needs more benchmarking...there are no reasons other than performance
6071 * to keep or drop this code.
6073 static int btrfs_dirty_inode(struct inode *inode)
6075 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
6076 struct btrfs_root *root = BTRFS_I(inode)->root;
6077 struct btrfs_trans_handle *trans;
6080 if (test_bit(BTRFS_INODE_DUMMY, &BTRFS_I(inode)->runtime_flags))
6083 trans = btrfs_join_transaction(root);
6085 return PTR_ERR(trans);
6087 ret = btrfs_update_inode(trans, root, BTRFS_I(inode));
6088 if (ret && ret == -ENOSPC) {
6089 /* whoops, lets try again with the full transaction */
6090 btrfs_end_transaction(trans);
6091 trans = btrfs_start_transaction(root, 1);
6093 return PTR_ERR(trans);
6095 ret = btrfs_update_inode(trans, root, BTRFS_I(inode));
6097 btrfs_end_transaction(trans);
6098 if (BTRFS_I(inode)->delayed_node)
6099 btrfs_balance_delayed_items(fs_info);
6105 * This is a copy of file_update_time. We need this so we can return error on
6106 * ENOSPC for updating the inode in the case of file write and mmap writes.
6108 static int btrfs_update_time(struct inode *inode, struct timespec64 *now,
6111 struct btrfs_root *root = BTRFS_I(inode)->root;
6112 bool dirty = flags & ~S_VERSION;
6114 if (btrfs_root_readonly(root))
6117 if (flags & S_VERSION)
6118 dirty |= inode_maybe_inc_iversion(inode, dirty);
6119 if (flags & S_CTIME)
6120 inode->i_ctime = *now;
6121 if (flags & S_MTIME)
6122 inode->i_mtime = *now;
6123 if (flags & S_ATIME)
6124 inode->i_atime = *now;
6125 return dirty ? btrfs_dirty_inode(inode) : 0;
6129 * find the highest existing sequence number in a directory
6130 * and then set the in-memory index_cnt variable to reflect
6131 * free sequence numbers
6133 static int btrfs_set_inode_index_count(struct btrfs_inode *inode)
6135 struct btrfs_root *root = inode->root;
6136 struct btrfs_key key, found_key;
6137 struct btrfs_path *path;
6138 struct extent_buffer *leaf;
6141 key.objectid = btrfs_ino(inode);
6142 key.type = BTRFS_DIR_INDEX_KEY;
6143 key.offset = (u64)-1;
6145 path = btrfs_alloc_path();
6149 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
6152 /* FIXME: we should be able to handle this */
6158 * MAGIC NUMBER EXPLANATION:
6159 * since we search a directory based on f_pos we have to start at 2
6160 * since '.' and '..' have f_pos of 0 and 1 respectively, so everybody
6161 * else has to start at 2
6163 if (path->slots[0] == 0) {
6164 inode->index_cnt = 2;
6170 leaf = path->nodes[0];
6171 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
6173 if (found_key.objectid != btrfs_ino(inode) ||
6174 found_key.type != BTRFS_DIR_INDEX_KEY) {
6175 inode->index_cnt = 2;
6179 inode->index_cnt = found_key.offset + 1;
6181 btrfs_free_path(path);
6186 * helper to find a free sequence number in a given directory. This current
6187 * code is very simple, later versions will do smarter things in the btree
6189 int btrfs_set_inode_index(struct btrfs_inode *dir, u64 *index)
6193 if (dir->index_cnt == (u64)-1) {
6194 ret = btrfs_inode_delayed_dir_index_count(dir);
6196 ret = btrfs_set_inode_index_count(dir);
6202 *index = dir->index_cnt;
6208 static int btrfs_insert_inode_locked(struct inode *inode)
6210 struct btrfs_iget_args args;
6212 args.ino = BTRFS_I(inode)->location.objectid;
6213 args.root = BTRFS_I(inode)->root;
6215 return insert_inode_locked4(inode,
6216 btrfs_inode_hash(inode->i_ino, BTRFS_I(inode)->root),
6217 btrfs_find_actor, &args);
6221 * Inherit flags from the parent inode.
6223 * Currently only the compression flags and the cow flags are inherited.
6225 static void btrfs_inherit_iflags(struct inode *inode, struct inode *dir)
6232 flags = BTRFS_I(dir)->flags;
6234 if (flags & BTRFS_INODE_NOCOMPRESS) {
6235 BTRFS_I(inode)->flags &= ~BTRFS_INODE_COMPRESS;
6236 BTRFS_I(inode)->flags |= BTRFS_INODE_NOCOMPRESS;
6237 } else if (flags & BTRFS_INODE_COMPRESS) {
6238 BTRFS_I(inode)->flags &= ~BTRFS_INODE_NOCOMPRESS;
6239 BTRFS_I(inode)->flags |= BTRFS_INODE_COMPRESS;
6242 if (flags & BTRFS_INODE_NODATACOW) {
6243 BTRFS_I(inode)->flags |= BTRFS_INODE_NODATACOW;
6244 if (S_ISREG(inode->i_mode))
6245 BTRFS_I(inode)->flags |= BTRFS_INODE_NODATASUM;
6248 btrfs_sync_inode_flags_to_i_flags(inode);
6251 static struct inode *btrfs_new_inode(struct btrfs_trans_handle *trans,
6252 struct btrfs_root *root,
6254 const char *name, int name_len,
6255 u64 ref_objectid, u64 objectid,
6256 umode_t mode, u64 *index)
6258 struct btrfs_fs_info *fs_info = root->fs_info;
6259 struct inode *inode;
6260 struct btrfs_inode_item *inode_item;
6261 struct btrfs_key *location;
6262 struct btrfs_path *path;
6263 struct btrfs_inode_ref *ref;
6264 struct btrfs_key key[2];
6266 int nitems = name ? 2 : 1;
6268 unsigned int nofs_flag;
6271 path = btrfs_alloc_path();
6273 return ERR_PTR(-ENOMEM);
6275 nofs_flag = memalloc_nofs_save();
6276 inode = new_inode(fs_info->sb);
6277 memalloc_nofs_restore(nofs_flag);
6279 btrfs_free_path(path);
6280 return ERR_PTR(-ENOMEM);
6284 * O_TMPFILE, set link count to 0, so that after this point,
6285 * we fill in an inode item with the correct link count.
6288 set_nlink(inode, 0);
6291 * we have to initialize this early, so we can reclaim the inode
6292 * number if we fail afterwards in this function.
6294 inode->i_ino = objectid;
6297 trace_btrfs_inode_request(dir);
6299 ret = btrfs_set_inode_index(BTRFS_I(dir), index);
6301 btrfs_free_path(path);
6303 return ERR_PTR(ret);
6309 * index_cnt is ignored for everything but a dir,
6310 * btrfs_set_inode_index_count has an explanation for the magic
6313 BTRFS_I(inode)->index_cnt = 2;
6314 BTRFS_I(inode)->dir_index = *index;
6315 BTRFS_I(inode)->root = btrfs_grab_root(root);
6316 BTRFS_I(inode)->generation = trans->transid;
6317 inode->i_generation = BTRFS_I(inode)->generation;
6320 * We could have gotten an inode number from somebody who was fsynced
6321 * and then removed in this same transaction, so let's just set full
6322 * sync since it will be a full sync anyway and this will blow away the
6323 * old info in the log.
6325 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC, &BTRFS_I(inode)->runtime_flags);
6327 key[0].objectid = objectid;
6328 key[0].type = BTRFS_INODE_ITEM_KEY;
6331 sizes[0] = sizeof(struct btrfs_inode_item);
6335 * Start new inodes with an inode_ref. This is slightly more
6336 * efficient for small numbers of hard links since they will
6337 * be packed into one item. Extended refs will kick in if we
6338 * add more hard links than can fit in the ref item.
6340 key[1].objectid = objectid;
6341 key[1].type = BTRFS_INODE_REF_KEY;
6342 key[1].offset = ref_objectid;
6344 sizes[1] = name_len + sizeof(*ref);
6347 location = &BTRFS_I(inode)->location;
6348 location->objectid = objectid;
6349 location->offset = 0;
6350 location->type = BTRFS_INODE_ITEM_KEY;
6352 ret = btrfs_insert_inode_locked(inode);
6358 ret = btrfs_insert_empty_items(trans, root, path, key, sizes, nitems);
6362 inode_init_owner(&init_user_ns, inode, dir, mode);
6363 inode_set_bytes(inode, 0);
6365 inode->i_mtime = current_time(inode);
6366 inode->i_atime = inode->i_mtime;
6367 inode->i_ctime = inode->i_mtime;
6368 BTRFS_I(inode)->i_otime = inode->i_mtime;
6370 inode_item = btrfs_item_ptr(path->nodes[0], path->slots[0],
6371 struct btrfs_inode_item);
6372 memzero_extent_buffer(path->nodes[0], (unsigned long)inode_item,
6373 sizeof(*inode_item));
6374 fill_inode_item(trans, path->nodes[0], inode_item, inode);
6377 ref = btrfs_item_ptr(path->nodes[0], path->slots[0] + 1,
6378 struct btrfs_inode_ref);
6379 btrfs_set_inode_ref_name_len(path->nodes[0], ref, name_len);
6380 btrfs_set_inode_ref_index(path->nodes[0], ref, *index);
6381 ptr = (unsigned long)(ref + 1);
6382 write_extent_buffer(path->nodes[0], name, ptr, name_len);
6385 btrfs_mark_buffer_dirty(path->nodes[0]);
6386 btrfs_free_path(path);
6388 btrfs_inherit_iflags(inode, dir);
6390 if (S_ISREG(mode)) {
6391 if (btrfs_test_opt(fs_info, NODATASUM))
6392 BTRFS_I(inode)->flags |= BTRFS_INODE_NODATASUM;
6393 if (btrfs_test_opt(fs_info, NODATACOW))
6394 BTRFS_I(inode)->flags |= BTRFS_INODE_NODATACOW |
6395 BTRFS_INODE_NODATASUM;
6398 inode_tree_add(inode);
6400 trace_btrfs_inode_new(inode);
6401 btrfs_set_inode_last_trans(trans, BTRFS_I(inode));
6403 btrfs_update_root_times(trans, root);
6405 ret = btrfs_inode_inherit_props(trans, inode, dir);
6408 "error inheriting props for ino %llu (root %llu): %d",
6409 btrfs_ino(BTRFS_I(inode)), root->root_key.objectid, ret);
6414 discard_new_inode(inode);
6417 BTRFS_I(dir)->index_cnt--;
6418 btrfs_free_path(path);
6419 return ERR_PTR(ret);
6423 * utility function to add 'inode' into 'parent_inode' with
6424 * a give name and a given sequence number.
6425 * if 'add_backref' is true, also insert a backref from the
6426 * inode to the parent directory.
6428 int btrfs_add_link(struct btrfs_trans_handle *trans,
6429 struct btrfs_inode *parent_inode, struct btrfs_inode *inode,
6430 const char *name, int name_len, int add_backref, u64 index)
6433 struct btrfs_key key;
6434 struct btrfs_root *root = parent_inode->root;
6435 u64 ino = btrfs_ino(inode);
6436 u64 parent_ino = btrfs_ino(parent_inode);
6438 if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) {
6439 memcpy(&key, &inode->root->root_key, sizeof(key));
6442 key.type = BTRFS_INODE_ITEM_KEY;
6446 if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) {
6447 ret = btrfs_add_root_ref(trans, key.objectid,
6448 root->root_key.objectid, parent_ino,
6449 index, name, name_len);
6450 } else if (add_backref) {
6451 ret = btrfs_insert_inode_ref(trans, root, name, name_len, ino,
6455 /* Nothing to clean up yet */
6459 ret = btrfs_insert_dir_item(trans, name, name_len, parent_inode, &key,
6460 btrfs_inode_type(&inode->vfs_inode), index);
6461 if (ret == -EEXIST || ret == -EOVERFLOW)
6464 btrfs_abort_transaction(trans, ret);
6468 btrfs_i_size_write(parent_inode, parent_inode->vfs_inode.i_size +
6470 inode_inc_iversion(&parent_inode->vfs_inode);
6472 * If we are replaying a log tree, we do not want to update the mtime
6473 * and ctime of the parent directory with the current time, since the
6474 * log replay procedure is responsible for setting them to their correct
6475 * values (the ones it had when the fsync was done).
6477 if (!test_bit(BTRFS_FS_LOG_RECOVERING, &root->fs_info->flags)) {
6478 struct timespec64 now = current_time(&parent_inode->vfs_inode);
6480 parent_inode->vfs_inode.i_mtime = now;
6481 parent_inode->vfs_inode.i_ctime = now;
6483 ret = btrfs_update_inode(trans, root, parent_inode);
6485 btrfs_abort_transaction(trans, ret);
6489 if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) {
6492 err = btrfs_del_root_ref(trans, key.objectid,
6493 root->root_key.objectid, parent_ino,
6494 &local_index, name, name_len);
6496 btrfs_abort_transaction(trans, err);
6497 } else if (add_backref) {
6501 err = btrfs_del_inode_ref(trans, root, name, name_len,
6502 ino, parent_ino, &local_index);
6504 btrfs_abort_transaction(trans, err);
6507 /* Return the original error code */
6511 static int btrfs_add_nondir(struct btrfs_trans_handle *trans,
6512 struct btrfs_inode *dir, struct dentry *dentry,
6513 struct btrfs_inode *inode, int backref, u64 index)
6515 int err = btrfs_add_link(trans, dir, inode,
6516 dentry->d_name.name, dentry->d_name.len,
6523 static int btrfs_mknod(struct user_namespace *mnt_userns, struct inode *dir,
6524 struct dentry *dentry, umode_t mode, dev_t rdev)
6526 struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
6527 struct btrfs_trans_handle *trans;
6528 struct btrfs_root *root = BTRFS_I(dir)->root;
6529 struct inode *inode = NULL;
6535 * 2 for inode item and ref
6537 * 1 for xattr if selinux is on
6539 trans = btrfs_start_transaction(root, 5);
6541 return PTR_ERR(trans);
6543 err = btrfs_get_free_objectid(root, &objectid);
6547 inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name,
6548 dentry->d_name.len, btrfs_ino(BTRFS_I(dir)), objectid,
6550 if (IS_ERR(inode)) {
6551 err = PTR_ERR(inode);
6557 * If the active LSM wants to access the inode during
6558 * d_instantiate it needs these. Smack checks to see
6559 * if the filesystem supports xattrs by looking at the
6562 inode->i_op = &btrfs_special_inode_operations;
6563 init_special_inode(inode, inode->i_mode, rdev);
6565 err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name);
6569 err = btrfs_add_nondir(trans, BTRFS_I(dir), dentry, BTRFS_I(inode),
6574 btrfs_update_inode(trans, root, BTRFS_I(inode));
6575 d_instantiate_new(dentry, inode);
6578 btrfs_end_transaction(trans);
6579 btrfs_btree_balance_dirty(fs_info);
6581 inode_dec_link_count(inode);
6582 discard_new_inode(inode);
6587 static int btrfs_create(struct user_namespace *mnt_userns, struct inode *dir,
6588 struct dentry *dentry, umode_t mode, bool excl)
6590 struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
6591 struct btrfs_trans_handle *trans;
6592 struct btrfs_root *root = BTRFS_I(dir)->root;
6593 struct inode *inode = NULL;
6599 * 2 for inode item and ref
6601 * 1 for xattr if selinux is on
6603 trans = btrfs_start_transaction(root, 5);
6605 return PTR_ERR(trans);
6607 err = btrfs_get_free_objectid(root, &objectid);
6611 inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name,
6612 dentry->d_name.len, btrfs_ino(BTRFS_I(dir)), objectid,
6614 if (IS_ERR(inode)) {
6615 err = PTR_ERR(inode);
6620 * If the active LSM wants to access the inode during
6621 * d_instantiate it needs these. Smack checks to see
6622 * if the filesystem supports xattrs by looking at the
6625 inode->i_fop = &btrfs_file_operations;
6626 inode->i_op = &btrfs_file_inode_operations;
6627 inode->i_mapping->a_ops = &btrfs_aops;
6629 err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name);
6633 err = btrfs_update_inode(trans, root, BTRFS_I(inode));
6637 err = btrfs_add_nondir(trans, BTRFS_I(dir), dentry, BTRFS_I(inode),
6642 d_instantiate_new(dentry, inode);
6645 btrfs_end_transaction(trans);
6647 inode_dec_link_count(inode);
6648 discard_new_inode(inode);
6650 btrfs_btree_balance_dirty(fs_info);
6654 static int btrfs_link(struct dentry *old_dentry, struct inode *dir,
6655 struct dentry *dentry)
6657 struct btrfs_trans_handle *trans = NULL;
6658 struct btrfs_root *root = BTRFS_I(dir)->root;
6659 struct inode *inode = d_inode(old_dentry);
6660 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
6665 /* do not allow sys_link's with other subvols of the same device */
6666 if (root->root_key.objectid != BTRFS_I(inode)->root->root_key.objectid)
6669 if (inode->i_nlink >= BTRFS_LINK_MAX)
6672 err = btrfs_set_inode_index(BTRFS_I(dir), &index);
6677 * 2 items for inode and inode ref
6678 * 2 items for dir items
6679 * 1 item for parent inode
6680 * 1 item for orphan item deletion if O_TMPFILE
6682 trans = btrfs_start_transaction(root, inode->i_nlink ? 5 : 6);
6683 if (IS_ERR(trans)) {
6684 err = PTR_ERR(trans);
6689 /* There are several dir indexes for this inode, clear the cache. */
6690 BTRFS_I(inode)->dir_index = 0ULL;
6692 inode_inc_iversion(inode);
6693 inode->i_ctime = current_time(inode);
6695 set_bit(BTRFS_INODE_COPY_EVERYTHING, &BTRFS_I(inode)->runtime_flags);
6697 err = btrfs_add_nondir(trans, BTRFS_I(dir), dentry, BTRFS_I(inode),
6703 struct dentry *parent = dentry->d_parent;
6705 err = btrfs_update_inode(trans, root, BTRFS_I(inode));
6708 if (inode->i_nlink == 1) {
6710 * If new hard link count is 1, it's a file created
6711 * with open(2) O_TMPFILE flag.
6713 err = btrfs_orphan_del(trans, BTRFS_I(inode));
6717 d_instantiate(dentry, inode);
6718 btrfs_log_new_name(trans, BTRFS_I(inode), NULL, parent);
6723 btrfs_end_transaction(trans);
6725 inode_dec_link_count(inode);
6728 btrfs_btree_balance_dirty(fs_info);
6732 static int btrfs_mkdir(struct user_namespace *mnt_userns, struct inode *dir,
6733 struct dentry *dentry, umode_t mode)
6735 struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
6736 struct inode *inode = NULL;
6737 struct btrfs_trans_handle *trans;
6738 struct btrfs_root *root = BTRFS_I(dir)->root;
6744 * 2 items for inode and ref
6745 * 2 items for dir items
6746 * 1 for xattr if selinux is on
6748 trans = btrfs_start_transaction(root, 5);
6750 return PTR_ERR(trans);
6752 err = btrfs_get_free_objectid(root, &objectid);
6756 inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name,
6757 dentry->d_name.len, btrfs_ino(BTRFS_I(dir)), objectid,
6758 S_IFDIR | mode, &index);
6759 if (IS_ERR(inode)) {
6760 err = PTR_ERR(inode);
6765 /* these must be set before we unlock the inode */
6766 inode->i_op = &btrfs_dir_inode_operations;
6767 inode->i_fop = &btrfs_dir_file_operations;
6769 err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name);
6773 btrfs_i_size_write(BTRFS_I(inode), 0);
6774 err = btrfs_update_inode(trans, root, BTRFS_I(inode));
6778 err = btrfs_add_link(trans, BTRFS_I(dir), BTRFS_I(inode),
6779 dentry->d_name.name,
6780 dentry->d_name.len, 0, index);
6784 d_instantiate_new(dentry, inode);
6787 btrfs_end_transaction(trans);
6789 inode_dec_link_count(inode);
6790 discard_new_inode(inode);
6792 btrfs_btree_balance_dirty(fs_info);
6796 static noinline int uncompress_inline(struct btrfs_path *path,
6798 size_t pg_offset, u64 extent_offset,
6799 struct btrfs_file_extent_item *item)
6802 struct extent_buffer *leaf = path->nodes[0];
6805 unsigned long inline_size;
6809 WARN_ON(pg_offset != 0);
6810 compress_type = btrfs_file_extent_compression(leaf, item);
6811 max_size = btrfs_file_extent_ram_bytes(leaf, item);
6812 inline_size = btrfs_file_extent_inline_item_len(leaf,
6813 btrfs_item_nr(path->slots[0]));
6814 tmp = kmalloc(inline_size, GFP_NOFS);
6817 ptr = btrfs_file_extent_inline_start(item);
6819 read_extent_buffer(leaf, tmp, ptr, inline_size);
6821 max_size = min_t(unsigned long, PAGE_SIZE, max_size);
6822 ret = btrfs_decompress(compress_type, tmp, page,
6823 extent_offset, inline_size, max_size);
6826 * decompression code contains a memset to fill in any space between the end
6827 * of the uncompressed data and the end of max_size in case the decompressed
6828 * data ends up shorter than ram_bytes. That doesn't cover the hole between
6829 * the end of an inline extent and the beginning of the next block, so we
6830 * cover that region here.
6833 if (max_size + pg_offset < PAGE_SIZE) {
6834 char *map = kmap(page);
6835 memset(map + pg_offset + max_size, 0, PAGE_SIZE - max_size - pg_offset);
6843 * btrfs_get_extent - Lookup the first extent overlapping a range in a file.
6844 * @inode: file to search in
6845 * @page: page to read extent data into if the extent is inline
6846 * @pg_offset: offset into @page to copy to
6847 * @start: file offset
6848 * @len: length of range starting at @start
6850 * This returns the first &struct extent_map which overlaps with the given
6851 * range, reading it from the B-tree and caching it if necessary. Note that
6852 * there may be more extents which overlap the given range after the returned
6855 * If @page is not NULL and the extent is inline, this also reads the extent
6856 * data directly into the page and marks the extent up to date in the io_tree.
6858 * Return: ERR_PTR on error, non-NULL extent_map on success.
6860 struct extent_map *btrfs_get_extent(struct btrfs_inode *inode,
6861 struct page *page, size_t pg_offset,
6864 struct btrfs_fs_info *fs_info = inode->root->fs_info;
6866 u64 extent_start = 0;
6868 u64 objectid = btrfs_ino(inode);
6869 int extent_type = -1;
6870 struct btrfs_path *path = NULL;
6871 struct btrfs_root *root = inode->root;
6872 struct btrfs_file_extent_item *item;
6873 struct extent_buffer *leaf;
6874 struct btrfs_key found_key;
6875 struct extent_map *em = NULL;
6876 struct extent_map_tree *em_tree = &inode->extent_tree;
6877 struct extent_io_tree *io_tree = &inode->io_tree;
6879 read_lock(&em_tree->lock);
6880 em = lookup_extent_mapping(em_tree, start, len);
6881 read_unlock(&em_tree->lock);
6884 if (em->start > start || em->start + em->len <= start)
6885 free_extent_map(em);
6886 else if (em->block_start == EXTENT_MAP_INLINE && page)
6887 free_extent_map(em);
6891 em = alloc_extent_map();
6896 em->start = EXTENT_MAP_HOLE;
6897 em->orig_start = EXTENT_MAP_HOLE;
6899 em->block_len = (u64)-1;
6901 path = btrfs_alloc_path();
6907 /* Chances are we'll be called again, so go ahead and do readahead */
6908 path->reada = READA_FORWARD;
6911 * The same explanation in load_free_space_cache applies here as well,
6912 * we only read when we're loading the free space cache, and at that
6913 * point the commit_root has everything we need.
6915 if (btrfs_is_free_space_inode(inode)) {
6916 path->search_commit_root = 1;
6917 path->skip_locking = 1;
6920 ret = btrfs_lookup_file_extent(NULL, root, path, objectid, start, 0);
6923 } else if (ret > 0) {
6924 if (path->slots[0] == 0)
6930 leaf = path->nodes[0];
6931 item = btrfs_item_ptr(leaf, path->slots[0],
6932 struct btrfs_file_extent_item);
6933 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
6934 if (found_key.objectid != objectid ||
6935 found_key.type != BTRFS_EXTENT_DATA_KEY) {
6937 * If we backup past the first extent we want to move forward
6938 * and see if there is an extent in front of us, otherwise we'll
6939 * say there is a hole for our whole search range which can
6946 extent_type = btrfs_file_extent_type(leaf, item);
6947 extent_start = found_key.offset;
6948 extent_end = btrfs_file_extent_end(path);
6949 if (extent_type == BTRFS_FILE_EXTENT_REG ||
6950 extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
6951 /* Only regular file could have regular/prealloc extent */
6952 if (!S_ISREG(inode->vfs_inode.i_mode)) {
6955 "regular/prealloc extent found for non-regular inode %llu",
6959 trace_btrfs_get_extent_show_fi_regular(inode, leaf, item,
6961 } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
6962 trace_btrfs_get_extent_show_fi_inline(inode, leaf, item,
6967 if (start >= extent_end) {
6969 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
6970 ret = btrfs_next_leaf(root, path);
6976 leaf = path->nodes[0];
6978 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
6979 if (found_key.objectid != objectid ||
6980 found_key.type != BTRFS_EXTENT_DATA_KEY)
6982 if (start + len <= found_key.offset)
6984 if (start > found_key.offset)
6987 /* New extent overlaps with existing one */
6989 em->orig_start = start;
6990 em->len = found_key.offset - start;
6991 em->block_start = EXTENT_MAP_HOLE;
6995 btrfs_extent_item_to_extent_map(inode, path, item, !page, em);
6997 if (extent_type == BTRFS_FILE_EXTENT_REG ||
6998 extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
7000 } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
7004 size_t extent_offset;
7010 size = btrfs_file_extent_ram_bytes(leaf, item);
7011 extent_offset = page_offset(page) + pg_offset - extent_start;
7012 copy_size = min_t(u64, PAGE_SIZE - pg_offset,
7013 size - extent_offset);
7014 em->start = extent_start + extent_offset;
7015 em->len = ALIGN(copy_size, fs_info->sectorsize);
7016 em->orig_block_len = em->len;
7017 em->orig_start = em->start;
7018 ptr = btrfs_file_extent_inline_start(item) + extent_offset;
7020 if (!PageUptodate(page)) {
7021 if (btrfs_file_extent_compression(leaf, item) !=
7022 BTRFS_COMPRESS_NONE) {
7023 ret = uncompress_inline(path, page, pg_offset,
7024 extent_offset, item);
7029 read_extent_buffer(leaf, map + pg_offset, ptr,
7031 if (pg_offset + copy_size < PAGE_SIZE) {
7032 memset(map + pg_offset + copy_size, 0,
7033 PAGE_SIZE - pg_offset -
7038 flush_dcache_page(page);
7040 set_extent_uptodate(io_tree, em->start,
7041 extent_map_end(em) - 1, NULL, GFP_NOFS);
7046 em->orig_start = start;
7048 em->block_start = EXTENT_MAP_HOLE;
7051 btrfs_release_path(path);
7052 if (em->start > start || extent_map_end(em) <= start) {
7054 "bad extent! em: [%llu %llu] passed [%llu %llu]",
7055 em->start, em->len, start, len);
7060 write_lock(&em_tree->lock);
7061 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, start, len);
7062 write_unlock(&em_tree->lock);
7064 btrfs_free_path(path);
7066 trace_btrfs_get_extent(root, inode, em);
7069 free_extent_map(em);
7070 return ERR_PTR(ret);
7075 struct extent_map *btrfs_get_extent_fiemap(struct btrfs_inode *inode,
7078 struct extent_map *em;
7079 struct extent_map *hole_em = NULL;
7080 u64 delalloc_start = start;
7086 em = btrfs_get_extent(inode, NULL, 0, start, len);
7090 * If our em maps to:
7092 * - a pre-alloc extent,
7093 * there might actually be delalloc bytes behind it.
7095 if (em->block_start != EXTENT_MAP_HOLE &&
7096 !test_bit(EXTENT_FLAG_PREALLOC, &em->flags))
7101 /* check to see if we've wrapped (len == -1 or similar) */
7110 /* ok, we didn't find anything, lets look for delalloc */
7111 delalloc_len = count_range_bits(&inode->io_tree, &delalloc_start,
7112 end, len, EXTENT_DELALLOC, 1);
7113 delalloc_end = delalloc_start + delalloc_len;
7114 if (delalloc_end < delalloc_start)
7115 delalloc_end = (u64)-1;
7118 * We didn't find anything useful, return the original results from
7121 if (delalloc_start > end || delalloc_end <= start) {
7128 * Adjust the delalloc_start to make sure it doesn't go backwards from
7129 * the start they passed in
7131 delalloc_start = max(start, delalloc_start);
7132 delalloc_len = delalloc_end - delalloc_start;
7134 if (delalloc_len > 0) {
7137 const u64 hole_end = extent_map_end(hole_em);
7139 em = alloc_extent_map();
7147 * When btrfs_get_extent can't find anything it returns one
7150 * Make sure what it found really fits our range, and adjust to
7151 * make sure it is based on the start from the caller
7153 if (hole_end <= start || hole_em->start > end) {
7154 free_extent_map(hole_em);
7157 hole_start = max(hole_em->start, start);
7158 hole_len = hole_end - hole_start;
7161 if (hole_em && delalloc_start > hole_start) {
7163 * Our hole starts before our delalloc, so we have to
7164 * return just the parts of the hole that go until the
7167 em->len = min(hole_len, delalloc_start - hole_start);
7168 em->start = hole_start;
7169 em->orig_start = hole_start;
7171 * Don't adjust block start at all, it is fixed at
7174 em->block_start = hole_em->block_start;
7175 em->block_len = hole_len;
7176 if (test_bit(EXTENT_FLAG_PREALLOC, &hole_em->flags))
7177 set_bit(EXTENT_FLAG_PREALLOC, &em->flags);
7180 * Hole is out of passed range or it starts after
7183 em->start = delalloc_start;
7184 em->len = delalloc_len;
7185 em->orig_start = delalloc_start;
7186 em->block_start = EXTENT_MAP_DELALLOC;
7187 em->block_len = delalloc_len;
7194 free_extent_map(hole_em);
7196 free_extent_map(em);
7197 return ERR_PTR(err);
7202 static struct extent_map *btrfs_create_dio_extent(struct btrfs_inode *inode,
7205 const u64 orig_start,
7206 const u64 block_start,
7207 const u64 block_len,
7208 const u64 orig_block_len,
7209 const u64 ram_bytes,
7212 struct extent_map *em = NULL;
7215 if (type != BTRFS_ORDERED_NOCOW) {
7216 em = create_io_em(inode, start, len, orig_start, block_start,
7217 block_len, orig_block_len, ram_bytes,
7218 BTRFS_COMPRESS_NONE, /* compress_type */
7223 ret = btrfs_add_ordered_extent_dio(inode, start, block_start, len,
7227 free_extent_map(em);
7228 btrfs_drop_extent_cache(inode, start, start + len - 1, 0);
7237 static struct extent_map *btrfs_new_extent_direct(struct btrfs_inode *inode,
7240 struct btrfs_root *root = inode->root;
7241 struct btrfs_fs_info *fs_info = root->fs_info;
7242 struct extent_map *em;
7243 struct btrfs_key ins;
7247 alloc_hint = get_extent_allocation_hint(inode, start, len);
7248 ret = btrfs_reserve_extent(root, len, len, fs_info->sectorsize,
7249 0, alloc_hint, &ins, 1, 1);
7251 return ERR_PTR(ret);
7253 em = btrfs_create_dio_extent(inode, start, ins.offset, start,
7254 ins.objectid, ins.offset, ins.offset,
7255 ins.offset, BTRFS_ORDERED_REGULAR);
7256 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
7258 btrfs_free_reserved_extent(fs_info, ins.objectid, ins.offset,
7265 * Check if we can do nocow write into the range [@offset, @offset + @len)
7267 * @offset: File offset
7268 * @len: The length to write, will be updated to the nocow writeable
7270 * @orig_start: (optional) Return the original file offset of the file extent
7271 * @orig_len: (optional) Return the original on-disk length of the file extent
7272 * @ram_bytes: (optional) Return the ram_bytes of the file extent
7273 * @strict: if true, omit optimizations that might force us into unnecessary
7274 * cow. e.g., don't trust generation number.
7277 * >0 and update @len if we can do nocow write
7278 * 0 if we can't do nocow write
7279 * <0 if error happened
7281 * NOTE: This only checks the file extents, caller is responsible to wait for
7282 * any ordered extents.
7284 noinline int can_nocow_extent(struct inode *inode, u64 offset, u64 *len,
7285 u64 *orig_start, u64 *orig_block_len,
7286 u64 *ram_bytes, bool strict)
7288 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
7289 struct btrfs_path *path;
7291 struct extent_buffer *leaf;
7292 struct btrfs_root *root = BTRFS_I(inode)->root;
7293 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
7294 struct btrfs_file_extent_item *fi;
7295 struct btrfs_key key;
7302 bool nocow = (BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW);
7304 path = btrfs_alloc_path();
7308 ret = btrfs_lookup_file_extent(NULL, root, path,
7309 btrfs_ino(BTRFS_I(inode)), offset, 0);
7313 slot = path->slots[0];
7316 /* can't find the item, must cow */
7323 leaf = path->nodes[0];
7324 btrfs_item_key_to_cpu(leaf, &key, slot);
7325 if (key.objectid != btrfs_ino(BTRFS_I(inode)) ||
7326 key.type != BTRFS_EXTENT_DATA_KEY) {
7327 /* not our file or wrong item type, must cow */
7331 if (key.offset > offset) {
7332 /* Wrong offset, must cow */
7336 fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item);
7337 found_type = btrfs_file_extent_type(leaf, fi);
7338 if (found_type != BTRFS_FILE_EXTENT_REG &&
7339 found_type != BTRFS_FILE_EXTENT_PREALLOC) {
7340 /* not a regular extent, must cow */
7344 if (!nocow && found_type == BTRFS_FILE_EXTENT_REG)
7347 extent_end = key.offset + btrfs_file_extent_num_bytes(leaf, fi);
7348 if (extent_end <= offset)
7351 disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
7352 if (disk_bytenr == 0)
7355 if (btrfs_file_extent_compression(leaf, fi) ||
7356 btrfs_file_extent_encryption(leaf, fi) ||
7357 btrfs_file_extent_other_encoding(leaf, fi))
7361 * Do the same check as in btrfs_cross_ref_exist but without the
7362 * unnecessary search.
7365 (btrfs_file_extent_generation(leaf, fi) <=
7366 btrfs_root_last_snapshot(&root->root_item)))
7369 backref_offset = btrfs_file_extent_offset(leaf, fi);
7372 *orig_start = key.offset - backref_offset;
7373 *orig_block_len = btrfs_file_extent_disk_num_bytes(leaf, fi);
7374 *ram_bytes = btrfs_file_extent_ram_bytes(leaf, fi);
7377 if (btrfs_extent_readonly(fs_info, disk_bytenr))
7380 num_bytes = min(offset + *len, extent_end) - offset;
7381 if (!nocow && found_type == BTRFS_FILE_EXTENT_PREALLOC) {
7384 range_end = round_up(offset + num_bytes,
7385 root->fs_info->sectorsize) - 1;
7386 ret = test_range_bit(io_tree, offset, range_end,
7387 EXTENT_DELALLOC, 0, NULL);
7394 btrfs_release_path(path);
7397 * look for other files referencing this extent, if we
7398 * find any we must cow
7401 ret = btrfs_cross_ref_exist(root, btrfs_ino(BTRFS_I(inode)),
7402 key.offset - backref_offset, disk_bytenr,
7410 * adjust disk_bytenr and num_bytes to cover just the bytes
7411 * in this extent we are about to write. If there
7412 * are any csums in that range we have to cow in order
7413 * to keep the csums correct
7415 disk_bytenr += backref_offset;
7416 disk_bytenr += offset - key.offset;
7417 if (csum_exist_in_range(fs_info, disk_bytenr, num_bytes))
7420 * all of the above have passed, it is safe to overwrite this extent
7426 btrfs_free_path(path);
7430 static int lock_extent_direct(struct inode *inode, u64 lockstart, u64 lockend,
7431 struct extent_state **cached_state, bool writing)
7433 struct btrfs_ordered_extent *ordered;
7437 lock_extent_bits(&BTRFS_I(inode)->io_tree, lockstart, lockend,
7440 * We're concerned with the entire range that we're going to be
7441 * doing DIO to, so we need to make sure there's no ordered
7442 * extents in this range.
7444 ordered = btrfs_lookup_ordered_range(BTRFS_I(inode), lockstart,
7445 lockend - lockstart + 1);
7448 * We need to make sure there are no buffered pages in this
7449 * range either, we could have raced between the invalidate in
7450 * generic_file_direct_write and locking the extent. The
7451 * invalidate needs to happen so that reads after a write do not
7455 (!writing || !filemap_range_has_page(inode->i_mapping,
7456 lockstart, lockend)))
7459 unlock_extent_cached(&BTRFS_I(inode)->io_tree, lockstart, lockend,
7464 * If we are doing a DIO read and the ordered extent we
7465 * found is for a buffered write, we can not wait for it
7466 * to complete and retry, because if we do so we can
7467 * deadlock with concurrent buffered writes on page
7468 * locks. This happens only if our DIO read covers more
7469 * than one extent map, if at this point has already
7470 * created an ordered extent for a previous extent map
7471 * and locked its range in the inode's io tree, and a
7472 * concurrent write against that previous extent map's
7473 * range and this range started (we unlock the ranges
7474 * in the io tree only when the bios complete and
7475 * buffered writes always lock pages before attempting
7476 * to lock range in the io tree).
7479 test_bit(BTRFS_ORDERED_DIRECT, &ordered->flags))
7480 btrfs_start_ordered_extent(ordered, 1);
7483 btrfs_put_ordered_extent(ordered);
7486 * We could trigger writeback for this range (and wait
7487 * for it to complete) and then invalidate the pages for
7488 * this range (through invalidate_inode_pages2_range()),
7489 * but that can lead us to a deadlock with a concurrent
7490 * call to readahead (a buffered read or a defrag call
7491 * triggered a readahead) on a page lock due to an
7492 * ordered dio extent we created before but did not have
7493 * yet a corresponding bio submitted (whence it can not
7494 * complete), which makes readahead wait for that
7495 * ordered extent to complete while holding a lock on
7510 /* The callers of this must take lock_extent() */
7511 static struct extent_map *create_io_em(struct btrfs_inode *inode, u64 start,
7512 u64 len, u64 orig_start, u64 block_start,
7513 u64 block_len, u64 orig_block_len,
7514 u64 ram_bytes, int compress_type,
7517 struct extent_map_tree *em_tree;
7518 struct extent_map *em;
7521 ASSERT(type == BTRFS_ORDERED_PREALLOC ||
7522 type == BTRFS_ORDERED_COMPRESSED ||
7523 type == BTRFS_ORDERED_NOCOW ||
7524 type == BTRFS_ORDERED_REGULAR);
7526 em_tree = &inode->extent_tree;
7527 em = alloc_extent_map();
7529 return ERR_PTR(-ENOMEM);
7532 em->orig_start = orig_start;
7534 em->block_len = block_len;
7535 em->block_start = block_start;
7536 em->orig_block_len = orig_block_len;
7537 em->ram_bytes = ram_bytes;
7538 em->generation = -1;
7539 set_bit(EXTENT_FLAG_PINNED, &em->flags);
7540 if (type == BTRFS_ORDERED_PREALLOC) {
7541 set_bit(EXTENT_FLAG_FILLING, &em->flags);
7542 } else if (type == BTRFS_ORDERED_COMPRESSED) {
7543 set_bit(EXTENT_FLAG_COMPRESSED, &em->flags);
7544 em->compress_type = compress_type;
7548 btrfs_drop_extent_cache(inode, em->start,
7549 em->start + em->len - 1, 0);
7550 write_lock(&em_tree->lock);
7551 ret = add_extent_mapping(em_tree, em, 1);
7552 write_unlock(&em_tree->lock);
7554 * The caller has taken lock_extent(), who could race with us
7557 } while (ret == -EEXIST);
7560 free_extent_map(em);
7561 return ERR_PTR(ret);
7564 /* em got 2 refs now, callers needs to do free_extent_map once. */
7569 static int btrfs_get_blocks_direct_write(struct extent_map **map,
7570 struct inode *inode,
7571 struct btrfs_dio_data *dio_data,
7574 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
7575 struct extent_map *em = *map;
7579 * We don't allocate a new extent in the following cases
7581 * 1) The inode is marked as NODATACOW. In this case we'll just use the
7583 * 2) The extent is marked as PREALLOC. We're good to go here and can
7584 * just use the extent.
7587 if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags) ||
7588 ((BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW) &&
7589 em->block_start != EXTENT_MAP_HOLE)) {
7591 u64 block_start, orig_start, orig_block_len, ram_bytes;
7593 if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags))
7594 type = BTRFS_ORDERED_PREALLOC;
7596 type = BTRFS_ORDERED_NOCOW;
7597 len = min(len, em->len - (start - em->start));
7598 block_start = em->block_start + (start - em->start);
7600 if (can_nocow_extent(inode, start, &len, &orig_start,
7601 &orig_block_len, &ram_bytes, false) == 1 &&
7602 btrfs_inc_nocow_writers(fs_info, block_start)) {
7603 struct extent_map *em2;
7605 em2 = btrfs_create_dio_extent(BTRFS_I(inode), start, len,
7606 orig_start, block_start,
7607 len, orig_block_len,
7609 btrfs_dec_nocow_writers(fs_info, block_start);
7610 if (type == BTRFS_ORDERED_PREALLOC) {
7611 free_extent_map(em);
7615 if (em2 && IS_ERR(em2)) {
7620 * For inode marked NODATACOW or extent marked PREALLOC,
7621 * use the existing or preallocated extent, so does not
7622 * need to adjust btrfs_space_info's bytes_may_use.
7624 btrfs_free_reserved_data_space_noquota(fs_info, len);
7629 /* this will cow the extent */
7630 free_extent_map(em);
7631 *map = em = btrfs_new_extent_direct(BTRFS_I(inode), start, len);
7637 len = min(len, em->len - (start - em->start));
7641 * Need to update the i_size under the extent lock so buffered
7642 * readers will get the updated i_size when we unlock.
7644 if (start + len > i_size_read(inode))
7645 i_size_write(inode, start + len);
7647 dio_data->reserve -= len;
7652 static int btrfs_dio_iomap_begin(struct inode *inode, loff_t start,
7653 loff_t length, unsigned int flags, struct iomap *iomap,
7654 struct iomap *srcmap)
7656 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
7657 struct extent_map *em;
7658 struct extent_state *cached_state = NULL;
7659 struct btrfs_dio_data *dio_data = NULL;
7660 u64 lockstart, lockend;
7661 const bool write = !!(flags & IOMAP_WRITE);
7664 bool unlock_extents = false;
7667 len = min_t(u64, len, fs_info->sectorsize);
7670 lockend = start + len - 1;
7673 * The generic stuff only does filemap_write_and_wait_range, which
7674 * isn't enough if we've written compressed pages to this area, so we
7675 * need to flush the dirty pages again to make absolutely sure that any
7676 * outstanding dirty pages are on disk.
7678 if (test_bit(BTRFS_INODE_HAS_ASYNC_EXTENT,
7679 &BTRFS_I(inode)->runtime_flags)) {
7680 ret = filemap_fdatawrite_range(inode->i_mapping, start,
7681 start + length - 1);
7686 dio_data = kzalloc(sizeof(*dio_data), GFP_NOFS);
7690 dio_data->length = length;
7692 dio_data->reserve = round_up(length, fs_info->sectorsize);
7693 ret = btrfs_delalloc_reserve_space(BTRFS_I(inode),
7694 &dio_data->data_reserved,
7695 start, dio_data->reserve);
7697 extent_changeset_free(dio_data->data_reserved);
7702 iomap->private = dio_data;
7706 * If this errors out it's because we couldn't invalidate pagecache for
7707 * this range and we need to fallback to buffered.
7709 if (lock_extent_direct(inode, lockstart, lockend, &cached_state, write)) {
7714 em = btrfs_get_extent(BTRFS_I(inode), NULL, 0, start, len);
7721 * Ok for INLINE and COMPRESSED extents we need to fallback on buffered
7722 * io. INLINE is special, and we could probably kludge it in here, but
7723 * it's still buffered so for safety lets just fall back to the generic
7726 * For COMPRESSED we _have_ to read the entire extent in so we can
7727 * decompress it, so there will be buffering required no matter what we
7728 * do, so go ahead and fallback to buffered.
7730 * We return -ENOTBLK because that's what makes DIO go ahead and go back
7731 * to buffered IO. Don't blame me, this is the price we pay for using
7734 if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags) ||
7735 em->block_start == EXTENT_MAP_INLINE) {
7736 free_extent_map(em);
7741 len = min(len, em->len - (start - em->start));
7743 ret = btrfs_get_blocks_direct_write(&em, inode, dio_data,
7747 unlock_extents = true;
7748 /* Recalc len in case the new em is smaller than requested */
7749 len = min(len, em->len - (start - em->start));
7752 * We need to unlock only the end area that we aren't using.
7753 * The rest is going to be unlocked by the endio routine.
7755 lockstart = start + len;
7756 if (lockstart < lockend)
7757 unlock_extents = true;
7761 unlock_extent_cached(&BTRFS_I(inode)->io_tree,
7762 lockstart, lockend, &cached_state);
7764 free_extent_state(cached_state);
7767 * Translate extent map information to iomap.
7768 * We trim the extents (and move the addr) even though iomap code does
7769 * that, since we have locked only the parts we are performing I/O in.
7771 if ((em->block_start == EXTENT_MAP_HOLE) ||
7772 (test_bit(EXTENT_FLAG_PREALLOC, &em->flags) && !write)) {
7773 iomap->addr = IOMAP_NULL_ADDR;
7774 iomap->type = IOMAP_HOLE;
7776 iomap->addr = em->block_start + (start - em->start);
7777 iomap->type = IOMAP_MAPPED;
7779 iomap->offset = start;
7780 iomap->bdev = fs_info->fs_devices->latest_bdev;
7781 iomap->length = len;
7783 if (write && btrfs_use_zone_append(BTRFS_I(inode), em))
7784 iomap->flags |= IOMAP_F_ZONE_APPEND;
7786 free_extent_map(em);
7791 unlock_extent_cached(&BTRFS_I(inode)->io_tree, lockstart, lockend,
7795 btrfs_delalloc_release_space(BTRFS_I(inode),
7796 dio_data->data_reserved, start,
7797 dio_data->reserve, true);
7798 btrfs_delalloc_release_extents(BTRFS_I(inode), dio_data->reserve);
7799 extent_changeset_free(dio_data->data_reserved);
7805 static int btrfs_dio_iomap_end(struct inode *inode, loff_t pos, loff_t length,
7806 ssize_t written, unsigned int flags, struct iomap *iomap)
7809 struct btrfs_dio_data *dio_data = iomap->private;
7810 size_t submitted = dio_data->submitted;
7811 const bool write = !!(flags & IOMAP_WRITE);
7813 if (!write && (iomap->type == IOMAP_HOLE)) {
7814 /* If reading from a hole, unlock and return */
7815 unlock_extent(&BTRFS_I(inode)->io_tree, pos, pos + length - 1);
7819 if (submitted < length) {
7821 length -= submitted;
7823 __endio_write_update_ordered(BTRFS_I(inode), pos,
7826 unlock_extent(&BTRFS_I(inode)->io_tree, pos,
7832 if (dio_data->reserve)
7833 btrfs_delalloc_release_space(BTRFS_I(inode),
7834 dio_data->data_reserved, pos,
7835 dio_data->reserve, true);
7836 btrfs_delalloc_release_extents(BTRFS_I(inode), dio_data->length);
7837 extent_changeset_free(dio_data->data_reserved);
7841 iomap->private = NULL;
7846 static void btrfs_dio_private_put(struct btrfs_dio_private *dip)
7849 * This implies a barrier so that stores to dio_bio->bi_status before
7850 * this and loads of dio_bio->bi_status after this are fully ordered.
7852 if (!refcount_dec_and_test(&dip->refs))
7855 if (btrfs_op(dip->dio_bio) == BTRFS_MAP_WRITE) {
7856 __endio_write_update_ordered(BTRFS_I(dip->inode),
7857 dip->logical_offset,
7859 !dip->dio_bio->bi_status);
7861 unlock_extent(&BTRFS_I(dip->inode)->io_tree,
7862 dip->logical_offset,
7863 dip->logical_offset + dip->bytes - 1);
7866 bio_endio(dip->dio_bio);
7870 static blk_status_t submit_dio_repair_bio(struct inode *inode, struct bio *bio,
7872 unsigned long bio_flags)
7874 struct btrfs_dio_private *dip = bio->bi_private;
7875 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
7878 BUG_ON(bio_op(bio) == REQ_OP_WRITE);
7880 ret = btrfs_bio_wq_end_io(fs_info, bio, BTRFS_WQ_ENDIO_DATA);
7884 refcount_inc(&dip->refs);
7885 ret = btrfs_map_bio(fs_info, bio, mirror_num);
7887 refcount_dec(&dip->refs);
7891 static blk_status_t btrfs_check_read_dio_bio(struct inode *inode,
7892 struct btrfs_io_bio *io_bio,
7893 const bool uptodate)
7895 struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info;
7896 const u32 sectorsize = fs_info->sectorsize;
7897 struct extent_io_tree *failure_tree = &BTRFS_I(inode)->io_failure_tree;
7898 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
7899 const bool csum = !(BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM);
7900 struct bio_vec bvec;
7901 struct bvec_iter iter;
7902 u64 start = io_bio->logical;
7904 blk_status_t err = BLK_STS_OK;
7906 __bio_for_each_segment(bvec, &io_bio->bio, iter, io_bio->iter) {
7907 unsigned int i, nr_sectors, pgoff;
7909 nr_sectors = BTRFS_BYTES_TO_BLKS(fs_info, bvec.bv_len);
7910 pgoff = bvec.bv_offset;
7911 for (i = 0; i < nr_sectors; i++) {
7912 ASSERT(pgoff < PAGE_SIZE);
7914 (!csum || !check_data_csum(inode, io_bio,
7915 bio_offset, bvec.bv_page, pgoff))) {
7916 clean_io_failure(fs_info, failure_tree, io_tree,
7917 start, bvec.bv_page,
7918 btrfs_ino(BTRFS_I(inode)),
7921 blk_status_t status;
7923 ASSERT((start - io_bio->logical) < UINT_MAX);
7924 status = btrfs_submit_read_repair(inode,
7926 start - io_bio->logical,
7927 bvec.bv_page, pgoff,
7929 start + sectorsize - 1,
7931 submit_dio_repair_bio);
7935 start += sectorsize;
7936 ASSERT(bio_offset + sectorsize > bio_offset);
7937 bio_offset += sectorsize;
7938 pgoff += sectorsize;
7944 static void __endio_write_update_ordered(struct btrfs_inode *inode,
7945 const u64 offset, const u64 bytes,
7946 const bool uptodate)
7948 struct btrfs_fs_info *fs_info = inode->root->fs_info;
7949 struct btrfs_ordered_extent *ordered = NULL;
7950 struct btrfs_workqueue *wq;
7951 u64 ordered_offset = offset;
7952 u64 ordered_bytes = bytes;
7955 if (btrfs_is_free_space_inode(inode))
7956 wq = fs_info->endio_freespace_worker;
7958 wq = fs_info->endio_write_workers;
7960 while (ordered_offset < offset + bytes) {
7961 last_offset = ordered_offset;
7962 if (btrfs_dec_test_first_ordered_pending(inode, &ordered,
7966 btrfs_init_work(&ordered->work, finish_ordered_fn, NULL,
7968 btrfs_queue_work(wq, &ordered->work);
7971 /* No ordered extent found in the range, exit */
7972 if (ordered_offset == last_offset)
7975 * Our bio might span multiple ordered extents. In this case
7976 * we keep going until we have accounted the whole dio.
7978 if (ordered_offset < offset + bytes) {
7979 ordered_bytes = offset + bytes - ordered_offset;
7985 static blk_status_t btrfs_submit_bio_start_direct_io(struct inode *inode,
7987 u64 dio_file_offset)
7989 return btrfs_csum_one_bio(BTRFS_I(inode), bio, dio_file_offset, 1);
7992 static void btrfs_end_dio_bio(struct bio *bio)
7994 struct btrfs_dio_private *dip = bio->bi_private;
7995 blk_status_t err = bio->bi_status;
7998 btrfs_warn(BTRFS_I(dip->inode)->root->fs_info,
7999 "direct IO failed ino %llu rw %d,%u sector %#Lx len %u err no %d",
8000 btrfs_ino(BTRFS_I(dip->inode)), bio_op(bio),
8001 bio->bi_opf, bio->bi_iter.bi_sector,
8002 bio->bi_iter.bi_size, err);
8004 if (bio_op(bio) == REQ_OP_READ) {
8005 err = btrfs_check_read_dio_bio(dip->inode, btrfs_io_bio(bio),
8010 dip->dio_bio->bi_status = err;
8012 btrfs_record_physical_zoned(dip->inode, dip->logical_offset, bio);
8015 btrfs_dio_private_put(dip);
8018 static inline blk_status_t btrfs_submit_dio_bio(struct bio *bio,
8019 struct inode *inode, u64 file_offset, int async_submit)
8021 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
8022 struct btrfs_dio_private *dip = bio->bi_private;
8023 bool write = btrfs_op(bio) == BTRFS_MAP_WRITE;
8026 /* Check btrfs_submit_bio_hook() for rules about async submit. */
8028 async_submit = !atomic_read(&BTRFS_I(inode)->sync_writers);
8031 ret = btrfs_bio_wq_end_io(fs_info, bio, BTRFS_WQ_ENDIO_DATA);
8036 if (BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM)
8039 if (write && async_submit) {
8040 ret = btrfs_wq_submit_bio(inode, bio, 0, 0, file_offset,
8041 btrfs_submit_bio_start_direct_io);
8045 * If we aren't doing async submit, calculate the csum of the
8048 ret = btrfs_csum_one_bio(BTRFS_I(inode), bio, file_offset, 1);
8054 csum_offset = file_offset - dip->logical_offset;
8055 csum_offset >>= fs_info->sectorsize_bits;
8056 csum_offset *= fs_info->csum_size;
8057 btrfs_io_bio(bio)->csum = dip->csums + csum_offset;
8060 ret = btrfs_map_bio(fs_info, bio, 0);
8066 * If this succeeds, the btrfs_dio_private is responsible for cleaning up locked
8067 * or ordered extents whether or not we submit any bios.
8069 static struct btrfs_dio_private *btrfs_create_dio_private(struct bio *dio_bio,
8070 struct inode *inode,
8073 const bool write = (btrfs_op(dio_bio) == BTRFS_MAP_WRITE);
8074 const bool csum = !(BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM);
8076 struct btrfs_dio_private *dip;
8078 dip_size = sizeof(*dip);
8079 if (!write && csum) {
8080 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
8083 nblocks = dio_bio->bi_iter.bi_size >> fs_info->sectorsize_bits;
8084 dip_size += fs_info->csum_size * nblocks;
8087 dip = kzalloc(dip_size, GFP_NOFS);
8092 dip->logical_offset = file_offset;
8093 dip->bytes = dio_bio->bi_iter.bi_size;
8094 dip->disk_bytenr = dio_bio->bi_iter.bi_sector << 9;
8095 dip->dio_bio = dio_bio;
8096 refcount_set(&dip->refs, 1);
8100 static blk_qc_t btrfs_submit_direct(struct inode *inode, struct iomap *iomap,
8101 struct bio *dio_bio, loff_t file_offset)
8103 const bool write = (btrfs_op(dio_bio) == BTRFS_MAP_WRITE);
8104 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
8105 const bool raid56 = (btrfs_data_alloc_profile(fs_info) &
8106 BTRFS_BLOCK_GROUP_RAID56_MASK);
8107 struct btrfs_dio_private *dip;
8110 int async_submit = 0;
8112 int clone_offset = 0;
8116 blk_status_t status;
8117 struct btrfs_io_geometry geom;
8118 struct btrfs_dio_data *dio_data = iomap->private;
8119 struct extent_map *em = NULL;
8121 dip = btrfs_create_dio_private(dio_bio, inode, file_offset);
8124 unlock_extent(&BTRFS_I(inode)->io_tree, file_offset,
8125 file_offset + dio_bio->bi_iter.bi_size - 1);
8127 dio_bio->bi_status = BLK_STS_RESOURCE;
8129 return BLK_QC_T_NONE;
8134 * Load the csums up front to reduce csum tree searches and
8135 * contention when submitting bios.
8137 * If we have csums disabled this will do nothing.
8139 status = btrfs_lookup_bio_sums(inode, dio_bio, dip->csums);
8140 if (status != BLK_STS_OK)
8144 start_sector = dio_bio->bi_iter.bi_sector;
8145 submit_len = dio_bio->bi_iter.bi_size;
8148 logical = start_sector << 9;
8149 em = btrfs_get_chunk_map(fs_info, logical, submit_len);
8151 status = errno_to_blk_status(PTR_ERR(em));
8155 ret = btrfs_get_io_geometry(fs_info, em, btrfs_op(dio_bio),
8156 logical, submit_len, &geom);
8158 status = errno_to_blk_status(ret);
8161 ASSERT(geom.len <= INT_MAX);
8163 clone_len = min_t(int, submit_len, geom.len);
8166 * This will never fail as it's passing GPF_NOFS and
8167 * the allocation is backed by btrfs_bioset.
8169 bio = btrfs_bio_clone_partial(dio_bio, clone_offset, clone_len);
8170 bio->bi_private = dip;
8171 bio->bi_end_io = btrfs_end_dio_bio;
8172 btrfs_io_bio(bio)->logical = file_offset;
8174 WARN_ON_ONCE(write && btrfs_is_zoned(fs_info) &&
8175 fs_info->max_zone_append_size &&
8176 bio_op(bio) != REQ_OP_ZONE_APPEND);
8178 if (bio_op(bio) == REQ_OP_ZONE_APPEND) {
8179 status = extract_ordered_extent(BTRFS_I(inode), bio,
8187 ASSERT(submit_len >= clone_len);
8188 submit_len -= clone_len;
8191 * Increase the count before we submit the bio so we know
8192 * the end IO handler won't happen before we increase the
8193 * count. Otherwise, the dip might get freed before we're
8194 * done setting it up.
8196 * We transfer the initial reference to the last bio, so we
8197 * don't need to increment the reference count for the last one.
8199 if (submit_len > 0) {
8200 refcount_inc(&dip->refs);
8202 * If we are submitting more than one bio, submit them
8203 * all asynchronously. The exception is RAID 5 or 6, as
8204 * asynchronous checksums make it difficult to collect
8205 * full stripe writes.
8211 status = btrfs_submit_dio_bio(bio, inode, file_offset,
8216 refcount_dec(&dip->refs);
8220 dio_data->submitted += clone_len;
8221 clone_offset += clone_len;
8222 start_sector += clone_len >> 9;
8223 file_offset += clone_len;
8225 free_extent_map(em);
8226 } while (submit_len > 0);
8227 return BLK_QC_T_NONE;
8230 free_extent_map(em);
8232 dip->dio_bio->bi_status = status;
8233 btrfs_dio_private_put(dip);
8235 return BLK_QC_T_NONE;
8238 const struct iomap_ops btrfs_dio_iomap_ops = {
8239 .iomap_begin = btrfs_dio_iomap_begin,
8240 .iomap_end = btrfs_dio_iomap_end,
8243 const struct iomap_dio_ops btrfs_dio_ops = {
8244 .submit_io = btrfs_submit_direct,
8247 static int btrfs_fiemap(struct inode *inode, struct fiemap_extent_info *fieinfo,
8252 ret = fiemap_prep(inode, fieinfo, start, &len, 0);
8256 return extent_fiemap(BTRFS_I(inode), fieinfo, start, len);
8259 int btrfs_readpage(struct file *file, struct page *page)
8261 struct btrfs_inode *inode = BTRFS_I(page->mapping->host);
8262 u64 start = page_offset(page);
8263 u64 end = start + PAGE_SIZE - 1;
8264 unsigned long bio_flags = 0;
8265 struct bio *bio = NULL;
8268 btrfs_lock_and_flush_ordered_range(inode, start, end, NULL);
8270 ret = btrfs_do_readpage(page, NULL, &bio, &bio_flags, 0, NULL);
8272 ret = submit_one_bio(bio, 0, bio_flags);
8276 static int btrfs_writepage(struct page *page, struct writeback_control *wbc)
8278 struct inode *inode = page->mapping->host;
8281 if (current->flags & PF_MEMALLOC) {
8282 redirty_page_for_writepage(wbc, page);
8288 * If we are under memory pressure we will call this directly from the
8289 * VM, we need to make sure we have the inode referenced for the ordered
8290 * extent. If not just return like we didn't do anything.
8292 if (!igrab(inode)) {
8293 redirty_page_for_writepage(wbc, page);
8294 return AOP_WRITEPAGE_ACTIVATE;
8296 ret = extent_write_full_page(page, wbc);
8297 btrfs_add_delayed_iput(inode);
8301 static int btrfs_writepages(struct address_space *mapping,
8302 struct writeback_control *wbc)
8304 return extent_writepages(mapping, wbc);
8307 static void btrfs_readahead(struct readahead_control *rac)
8309 extent_readahead(rac);
8312 static int __btrfs_releasepage(struct page *page, gfp_t gfp_flags)
8314 int ret = try_release_extent_mapping(page, gfp_flags);
8316 clear_page_extent_mapped(page);
8320 static int btrfs_releasepage(struct page *page, gfp_t gfp_flags)
8322 if (PageWriteback(page) || PageDirty(page))
8324 return __btrfs_releasepage(page, gfp_flags);
8327 #ifdef CONFIG_MIGRATION
8328 static int btrfs_migratepage(struct address_space *mapping,
8329 struct page *newpage, struct page *page,
8330 enum migrate_mode mode)
8334 ret = migrate_page_move_mapping(mapping, newpage, page, 0);
8335 if (ret != MIGRATEPAGE_SUCCESS)
8338 if (page_has_private(page))
8339 attach_page_private(newpage, detach_page_private(page));
8341 if (PagePrivate2(page)) {
8342 ClearPagePrivate2(page);
8343 SetPagePrivate2(newpage);
8346 if (mode != MIGRATE_SYNC_NO_COPY)
8347 migrate_page_copy(newpage, page);
8349 migrate_page_states(newpage, page);
8350 return MIGRATEPAGE_SUCCESS;
8354 static void btrfs_invalidatepage(struct page *page, unsigned int offset,
8355 unsigned int length)
8357 struct btrfs_inode *inode = BTRFS_I(page->mapping->host);
8358 struct extent_io_tree *tree = &inode->io_tree;
8359 struct btrfs_ordered_extent *ordered;
8360 struct extent_state *cached_state = NULL;
8361 u64 page_start = page_offset(page);
8362 u64 page_end = page_start + PAGE_SIZE - 1;
8365 int inode_evicting = inode->vfs_inode.i_state & I_FREEING;
8366 bool found_ordered = false;
8367 bool completed_ordered = false;
8370 * we have the page locked, so new writeback can't start,
8371 * and the dirty bit won't be cleared while we are here.
8373 * Wait for IO on this page so that we can safely clear
8374 * the PagePrivate2 bit and do ordered accounting
8376 wait_on_page_writeback(page);
8379 btrfs_releasepage(page, GFP_NOFS);
8383 if (!inode_evicting)
8384 lock_extent_bits(tree, page_start, page_end, &cached_state);
8388 ordered = btrfs_lookup_ordered_range(inode, start, page_end - start + 1);
8390 found_ordered = true;
8392 ordered->file_offset + ordered->num_bytes - 1);
8394 * IO on this page will never be started, so we need to account
8395 * for any ordered extents now. Don't clear EXTENT_DELALLOC_NEW
8396 * here, must leave that up for the ordered extent completion.
8398 if (!inode_evicting)
8399 clear_extent_bit(tree, start, end,
8401 EXTENT_LOCKED | EXTENT_DO_ACCOUNTING |
8402 EXTENT_DEFRAG, 1, 0, &cached_state);
8404 * whoever cleared the private bit is responsible
8405 * for the finish_ordered_io
8407 if (TestClearPagePrivate2(page)) {
8408 struct btrfs_ordered_inode_tree *tree;
8411 tree = &inode->ordered_tree;
8413 spin_lock_irq(&tree->lock);
8414 set_bit(BTRFS_ORDERED_TRUNCATED, &ordered->flags);
8415 new_len = start - ordered->file_offset;
8416 if (new_len < ordered->truncated_len)
8417 ordered->truncated_len = new_len;
8418 spin_unlock_irq(&tree->lock);
8420 if (btrfs_dec_test_ordered_pending(inode, &ordered,
8422 end - start + 1, 1)) {
8423 btrfs_finish_ordered_io(ordered);
8424 completed_ordered = true;
8427 btrfs_put_ordered_extent(ordered);
8428 if (!inode_evicting) {
8429 cached_state = NULL;
8430 lock_extent_bits(tree, start, end,
8435 if (start < page_end)
8440 * Qgroup reserved space handler
8441 * Page here will be either
8442 * 1) Already written to disk or ordered extent already submitted
8443 * Then its QGROUP_RESERVED bit in io_tree is already cleaned.
8444 * Qgroup will be handled by its qgroup_record then.
8445 * btrfs_qgroup_free_data() call will do nothing here.
8447 * 2) Not written to disk yet
8448 * Then btrfs_qgroup_free_data() call will clear the QGROUP_RESERVED
8449 * bit of its io_tree, and free the qgroup reserved data space.
8450 * Since the IO will never happen for this page.
8452 btrfs_qgroup_free_data(inode, NULL, page_start, PAGE_SIZE);
8453 if (!inode_evicting) {
8457 * If there's an ordered extent for this range and we have not
8458 * finished it ourselves, we must leave EXTENT_DELALLOC_NEW set
8459 * in the range for the ordered extent completion. We must also
8460 * not delete the range, otherwise we would lose that bit (and
8461 * any other bits set in the range). Make sure EXTENT_UPTODATE
8462 * is cleared if we don't delete, otherwise it can lead to
8463 * corruptions if the i_size is extented later.
8465 if (found_ordered && !completed_ordered)
8467 clear_extent_bit(tree, page_start, page_end, EXTENT_LOCKED |
8468 EXTENT_DELALLOC | EXTENT_UPTODATE |
8469 EXTENT_DO_ACCOUNTING | EXTENT_DEFRAG, 1,
8470 delete, &cached_state);
8472 __btrfs_releasepage(page, GFP_NOFS);
8475 ClearPageChecked(page);
8476 clear_page_extent_mapped(page);
8480 * btrfs_page_mkwrite() is not allowed to change the file size as it gets
8481 * called from a page fault handler when a page is first dirtied. Hence we must
8482 * be careful to check for EOF conditions here. We set the page up correctly
8483 * for a written page which means we get ENOSPC checking when writing into
8484 * holes and correct delalloc and unwritten extent mapping on filesystems that
8485 * support these features.
8487 * We are not allowed to take the i_mutex here so we have to play games to
8488 * protect against truncate races as the page could now be beyond EOF. Because
8489 * truncate_setsize() writes the inode size before removing pages, once we have
8490 * the page lock we can determine safely if the page is beyond EOF. If it is not
8491 * beyond EOF, then the page is guaranteed safe against truncation until we
8494 vm_fault_t btrfs_page_mkwrite(struct vm_fault *vmf)
8496 struct page *page = vmf->page;
8497 struct inode *inode = file_inode(vmf->vma->vm_file);
8498 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
8499 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
8500 struct btrfs_ordered_extent *ordered;
8501 struct extent_state *cached_state = NULL;
8502 struct extent_changeset *data_reserved = NULL;
8504 unsigned long zero_start;
8514 reserved_space = PAGE_SIZE;
8516 sb_start_pagefault(inode->i_sb);
8517 page_start = page_offset(page);
8518 page_end = page_start + PAGE_SIZE - 1;
8522 * Reserving delalloc space after obtaining the page lock can lead to
8523 * deadlock. For example, if a dirty page is locked by this function
8524 * and the call to btrfs_delalloc_reserve_space() ends up triggering
8525 * dirty page write out, then the btrfs_writepage() function could
8526 * end up waiting indefinitely to get a lock on the page currently
8527 * being processed by btrfs_page_mkwrite() function.
8529 ret2 = btrfs_delalloc_reserve_space(BTRFS_I(inode), &data_reserved,
8530 page_start, reserved_space);
8532 ret2 = file_update_time(vmf->vma->vm_file);
8536 ret = vmf_error(ret2);
8542 ret = VM_FAULT_NOPAGE; /* make the VM retry the fault */
8545 size = i_size_read(inode);
8547 if ((page->mapping != inode->i_mapping) ||
8548 (page_start >= size)) {
8549 /* page got truncated out from underneath us */
8552 wait_on_page_writeback(page);
8554 lock_extent_bits(io_tree, page_start, page_end, &cached_state);
8555 ret2 = set_page_extent_mapped(page);
8557 ret = vmf_error(ret2);
8558 unlock_extent_cached(io_tree, page_start, page_end, &cached_state);
8563 * we can't set the delalloc bits if there are pending ordered
8564 * extents. Drop our locks and wait for them to finish
8566 ordered = btrfs_lookup_ordered_range(BTRFS_I(inode), page_start,
8569 unlock_extent_cached(io_tree, page_start, page_end,
8572 btrfs_start_ordered_extent(ordered, 1);
8573 btrfs_put_ordered_extent(ordered);
8577 if (page->index == ((size - 1) >> PAGE_SHIFT)) {
8578 reserved_space = round_up(size - page_start,
8579 fs_info->sectorsize);
8580 if (reserved_space < PAGE_SIZE) {
8581 end = page_start + reserved_space - 1;
8582 btrfs_delalloc_release_space(BTRFS_I(inode),
8583 data_reserved, page_start,
8584 PAGE_SIZE - reserved_space, true);
8589 * page_mkwrite gets called when the page is firstly dirtied after it's
8590 * faulted in, but write(2) could also dirty a page and set delalloc
8591 * bits, thus in this case for space account reason, we still need to
8592 * clear any delalloc bits within this page range since we have to
8593 * reserve data&meta space before lock_page() (see above comments).
8595 clear_extent_bit(&BTRFS_I(inode)->io_tree, page_start, end,
8596 EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING |
8597 EXTENT_DEFRAG, 0, 0, &cached_state);
8599 ret2 = btrfs_set_extent_delalloc(BTRFS_I(inode), page_start, end, 0,
8602 unlock_extent_cached(io_tree, page_start, page_end,
8604 ret = VM_FAULT_SIGBUS;
8608 /* page is wholly or partially inside EOF */
8609 if (page_start + PAGE_SIZE > size)
8610 zero_start = offset_in_page(size);
8612 zero_start = PAGE_SIZE;
8614 if (zero_start != PAGE_SIZE) {
8616 memset(kaddr + zero_start, 0, PAGE_SIZE - zero_start);
8617 flush_dcache_page(page);
8620 ClearPageChecked(page);
8621 set_page_dirty(page);
8622 SetPageUptodate(page);
8624 BTRFS_I(inode)->last_trans = fs_info->generation;
8625 BTRFS_I(inode)->last_sub_trans = BTRFS_I(inode)->root->log_transid;
8626 BTRFS_I(inode)->last_log_commit = BTRFS_I(inode)->root->last_log_commit;
8628 unlock_extent_cached(io_tree, page_start, page_end, &cached_state);
8630 btrfs_delalloc_release_extents(BTRFS_I(inode), PAGE_SIZE);
8631 sb_end_pagefault(inode->i_sb);
8632 extent_changeset_free(data_reserved);
8633 return VM_FAULT_LOCKED;
8638 btrfs_delalloc_release_extents(BTRFS_I(inode), PAGE_SIZE);
8639 btrfs_delalloc_release_space(BTRFS_I(inode), data_reserved, page_start,
8640 reserved_space, (ret != 0));
8642 sb_end_pagefault(inode->i_sb);
8643 extent_changeset_free(data_reserved);
8647 static int btrfs_truncate(struct inode *inode, bool skip_writeback)
8649 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
8650 struct btrfs_root *root = BTRFS_I(inode)->root;
8651 struct btrfs_block_rsv *rsv;
8653 struct btrfs_trans_handle *trans;
8654 u64 mask = fs_info->sectorsize - 1;
8655 u64 min_size = btrfs_calc_metadata_size(fs_info, 1);
8657 if (!skip_writeback) {
8658 ret = btrfs_wait_ordered_range(inode, inode->i_size & (~mask),
8665 * Yes ladies and gentlemen, this is indeed ugly. We have a couple of
8666 * things going on here:
8668 * 1) We need to reserve space to update our inode.
8670 * 2) We need to have something to cache all the space that is going to
8671 * be free'd up by the truncate operation, but also have some slack
8672 * space reserved in case it uses space during the truncate (thank you
8673 * very much snapshotting).
8675 * And we need these to be separate. The fact is we can use a lot of
8676 * space doing the truncate, and we have no earthly idea how much space
8677 * we will use, so we need the truncate reservation to be separate so it
8678 * doesn't end up using space reserved for updating the inode. We also
8679 * need to be able to stop the transaction and start a new one, which
8680 * means we need to be able to update the inode several times, and we
8681 * have no idea of knowing how many times that will be, so we can't just
8682 * reserve 1 item for the entirety of the operation, so that has to be
8683 * done separately as well.
8685 * So that leaves us with
8687 * 1) rsv - for the truncate reservation, which we will steal from the
8688 * transaction reservation.
8689 * 2) fs_info->trans_block_rsv - this will have 1 items worth left for
8690 * updating the inode.
8692 rsv = btrfs_alloc_block_rsv(fs_info, BTRFS_BLOCK_RSV_TEMP);
8695 rsv->size = min_size;
8699 * 1 for the truncate slack space
8700 * 1 for updating the inode.
8702 trans = btrfs_start_transaction(root, 2);
8703 if (IS_ERR(trans)) {
8704 ret = PTR_ERR(trans);
8708 /* Migrate the slack space for the truncate to our reserve */
8709 ret = btrfs_block_rsv_migrate(&fs_info->trans_block_rsv, rsv,
8714 * So if we truncate and then write and fsync we normally would just
8715 * write the extents that changed, which is a problem if we need to
8716 * first truncate that entire inode. So set this flag so we write out
8717 * all of the extents in the inode to the sync log so we're completely
8720 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC, &BTRFS_I(inode)->runtime_flags);
8721 trans->block_rsv = rsv;
8724 ret = btrfs_truncate_inode_items(trans, root, BTRFS_I(inode),
8726 BTRFS_EXTENT_DATA_KEY);
8727 trans->block_rsv = &fs_info->trans_block_rsv;
8728 if (ret != -ENOSPC && ret != -EAGAIN)
8731 ret = btrfs_update_inode(trans, root, BTRFS_I(inode));
8735 btrfs_end_transaction(trans);
8736 btrfs_btree_balance_dirty(fs_info);
8738 trans = btrfs_start_transaction(root, 2);
8739 if (IS_ERR(trans)) {
8740 ret = PTR_ERR(trans);
8745 btrfs_block_rsv_release(fs_info, rsv, -1, NULL);
8746 ret = btrfs_block_rsv_migrate(&fs_info->trans_block_rsv,
8747 rsv, min_size, false);
8748 BUG_ON(ret); /* shouldn't happen */
8749 trans->block_rsv = rsv;
8753 * We can't call btrfs_truncate_block inside a trans handle as we could
8754 * deadlock with freeze, if we got NEED_TRUNCATE_BLOCK then we know
8755 * we've truncated everything except the last little bit, and can do
8756 * btrfs_truncate_block and then update the disk_i_size.
8758 if (ret == NEED_TRUNCATE_BLOCK) {
8759 btrfs_end_transaction(trans);
8760 btrfs_btree_balance_dirty(fs_info);
8762 ret = btrfs_truncate_block(BTRFS_I(inode), inode->i_size, 0, 0);
8765 trans = btrfs_start_transaction(root, 1);
8766 if (IS_ERR(trans)) {
8767 ret = PTR_ERR(trans);
8770 btrfs_inode_safe_disk_i_size_write(BTRFS_I(inode), 0);
8776 trans->block_rsv = &fs_info->trans_block_rsv;
8777 ret2 = btrfs_update_inode(trans, root, BTRFS_I(inode));
8781 ret2 = btrfs_end_transaction(trans);
8784 btrfs_btree_balance_dirty(fs_info);
8787 btrfs_free_block_rsv(fs_info, rsv);
8793 * create a new subvolume directory/inode (helper for the ioctl).
8795 int btrfs_create_subvol_root(struct btrfs_trans_handle *trans,
8796 struct btrfs_root *new_root,
8797 struct btrfs_root *parent_root)
8799 struct inode *inode;
8804 err = btrfs_get_free_objectid(new_root, &ino);
8808 inode = btrfs_new_inode(trans, new_root, NULL, "..", 2, ino, ino,
8809 S_IFDIR | (~current_umask() & S_IRWXUGO),
8812 return PTR_ERR(inode);
8813 inode->i_op = &btrfs_dir_inode_operations;
8814 inode->i_fop = &btrfs_dir_file_operations;
8816 set_nlink(inode, 1);
8817 btrfs_i_size_write(BTRFS_I(inode), 0);
8818 unlock_new_inode(inode);
8820 err = btrfs_subvol_inherit_props(trans, new_root, parent_root);
8822 btrfs_err(new_root->fs_info,
8823 "error inheriting subvolume %llu properties: %d",
8824 new_root->root_key.objectid, err);
8826 err = btrfs_update_inode(trans, new_root, BTRFS_I(inode));
8832 struct inode *btrfs_alloc_inode(struct super_block *sb)
8834 struct btrfs_fs_info *fs_info = btrfs_sb(sb);
8835 struct btrfs_inode *ei;
8836 struct inode *inode;
8838 ei = kmem_cache_alloc(btrfs_inode_cachep, GFP_KERNEL);
8845 ei->last_sub_trans = 0;
8846 ei->logged_trans = 0;
8847 ei->delalloc_bytes = 0;
8848 ei->new_delalloc_bytes = 0;
8849 ei->defrag_bytes = 0;
8850 ei->disk_i_size = 0;
8853 ei->index_cnt = (u64)-1;
8855 ei->last_unlink_trans = 0;
8856 ei->last_reflink_trans = 0;
8857 ei->last_log_commit = 0;
8859 spin_lock_init(&ei->lock);
8860 ei->outstanding_extents = 0;
8861 if (sb->s_magic != BTRFS_TEST_MAGIC)
8862 btrfs_init_metadata_block_rsv(fs_info, &ei->block_rsv,
8863 BTRFS_BLOCK_RSV_DELALLOC);
8864 ei->runtime_flags = 0;
8865 ei->prop_compress = BTRFS_COMPRESS_NONE;
8866 ei->defrag_compress = BTRFS_COMPRESS_NONE;
8868 ei->delayed_node = NULL;
8870 ei->i_otime.tv_sec = 0;
8871 ei->i_otime.tv_nsec = 0;
8873 inode = &ei->vfs_inode;
8874 extent_map_tree_init(&ei->extent_tree);
8875 extent_io_tree_init(fs_info, &ei->io_tree, IO_TREE_INODE_IO, inode);
8876 extent_io_tree_init(fs_info, &ei->io_failure_tree,
8877 IO_TREE_INODE_IO_FAILURE, inode);
8878 extent_io_tree_init(fs_info, &ei->file_extent_tree,
8879 IO_TREE_INODE_FILE_EXTENT, inode);
8880 ei->io_tree.track_uptodate = true;
8881 ei->io_failure_tree.track_uptodate = true;
8882 atomic_set(&ei->sync_writers, 0);
8883 mutex_init(&ei->log_mutex);
8884 btrfs_ordered_inode_tree_init(&ei->ordered_tree);
8885 INIT_LIST_HEAD(&ei->delalloc_inodes);
8886 INIT_LIST_HEAD(&ei->delayed_iput);
8887 RB_CLEAR_NODE(&ei->rb_node);
8892 #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
8893 void btrfs_test_destroy_inode(struct inode *inode)
8895 btrfs_drop_extent_cache(BTRFS_I(inode), 0, (u64)-1, 0);
8896 kmem_cache_free(btrfs_inode_cachep, BTRFS_I(inode));
8900 void btrfs_free_inode(struct inode *inode)
8902 kmem_cache_free(btrfs_inode_cachep, BTRFS_I(inode));
8905 void btrfs_destroy_inode(struct inode *vfs_inode)
8907 struct btrfs_ordered_extent *ordered;
8908 struct btrfs_inode *inode = BTRFS_I(vfs_inode);
8909 struct btrfs_root *root = inode->root;
8911 WARN_ON(!hlist_empty(&vfs_inode->i_dentry));
8912 WARN_ON(vfs_inode->i_data.nrpages);
8913 WARN_ON(inode->block_rsv.reserved);
8914 WARN_ON(inode->block_rsv.size);
8915 WARN_ON(inode->outstanding_extents);
8916 WARN_ON(inode->delalloc_bytes);
8917 WARN_ON(inode->new_delalloc_bytes);
8918 WARN_ON(inode->csum_bytes);
8919 WARN_ON(inode->defrag_bytes);
8922 * This can happen where we create an inode, but somebody else also
8923 * created the same inode and we need to destroy the one we already
8930 ordered = btrfs_lookup_first_ordered_extent(inode, (u64)-1);
8934 btrfs_err(root->fs_info,
8935 "found ordered extent %llu %llu on inode cleanup",
8936 ordered->file_offset, ordered->num_bytes);
8937 btrfs_remove_ordered_extent(inode, ordered);
8938 btrfs_put_ordered_extent(ordered);
8939 btrfs_put_ordered_extent(ordered);
8942 btrfs_qgroup_check_reserved_leak(inode);
8943 inode_tree_del(inode);
8944 btrfs_drop_extent_cache(inode, 0, (u64)-1, 0);
8945 btrfs_inode_clear_file_extent_range(inode, 0, (u64)-1);
8946 btrfs_put_root(inode->root);
8949 int btrfs_drop_inode(struct inode *inode)
8951 struct btrfs_root *root = BTRFS_I(inode)->root;
8956 /* the snap/subvol tree is on deleting */
8957 if (btrfs_root_refs(&root->root_item) == 0)
8960 return generic_drop_inode(inode);
8963 static void init_once(void *foo)
8965 struct btrfs_inode *ei = (struct btrfs_inode *) foo;
8967 inode_init_once(&ei->vfs_inode);
8970 void __cold btrfs_destroy_cachep(void)
8973 * Make sure all delayed rcu free inodes are flushed before we
8977 kmem_cache_destroy(btrfs_inode_cachep);
8978 kmem_cache_destroy(btrfs_trans_handle_cachep);
8979 kmem_cache_destroy(btrfs_path_cachep);
8980 kmem_cache_destroy(btrfs_free_space_cachep);
8981 kmem_cache_destroy(btrfs_free_space_bitmap_cachep);
8984 int __init btrfs_init_cachep(void)
8986 btrfs_inode_cachep = kmem_cache_create("btrfs_inode",
8987 sizeof(struct btrfs_inode), 0,
8988 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD | SLAB_ACCOUNT,
8990 if (!btrfs_inode_cachep)
8993 btrfs_trans_handle_cachep = kmem_cache_create("btrfs_trans_handle",
8994 sizeof(struct btrfs_trans_handle), 0,
8995 SLAB_TEMPORARY | SLAB_MEM_SPREAD, NULL);
8996 if (!btrfs_trans_handle_cachep)
8999 btrfs_path_cachep = kmem_cache_create("btrfs_path",
9000 sizeof(struct btrfs_path), 0,
9001 SLAB_MEM_SPREAD, NULL);
9002 if (!btrfs_path_cachep)
9005 btrfs_free_space_cachep = kmem_cache_create("btrfs_free_space",
9006 sizeof(struct btrfs_free_space), 0,
9007 SLAB_MEM_SPREAD, NULL);
9008 if (!btrfs_free_space_cachep)
9011 btrfs_free_space_bitmap_cachep = kmem_cache_create("btrfs_free_space_bitmap",
9012 PAGE_SIZE, PAGE_SIZE,
9013 SLAB_RED_ZONE, NULL);
9014 if (!btrfs_free_space_bitmap_cachep)
9019 btrfs_destroy_cachep();
9023 static int btrfs_getattr(struct user_namespace *mnt_userns,
9024 const struct path *path, struct kstat *stat,
9025 u32 request_mask, unsigned int flags)
9029 struct inode *inode = d_inode(path->dentry);
9030 u32 blocksize = inode->i_sb->s_blocksize;
9031 u32 bi_flags = BTRFS_I(inode)->flags;
9033 stat->result_mask |= STATX_BTIME;
9034 stat->btime.tv_sec = BTRFS_I(inode)->i_otime.tv_sec;
9035 stat->btime.tv_nsec = BTRFS_I(inode)->i_otime.tv_nsec;
9036 if (bi_flags & BTRFS_INODE_APPEND)
9037 stat->attributes |= STATX_ATTR_APPEND;
9038 if (bi_flags & BTRFS_INODE_COMPRESS)
9039 stat->attributes |= STATX_ATTR_COMPRESSED;
9040 if (bi_flags & BTRFS_INODE_IMMUTABLE)
9041 stat->attributes |= STATX_ATTR_IMMUTABLE;
9042 if (bi_flags & BTRFS_INODE_NODUMP)
9043 stat->attributes |= STATX_ATTR_NODUMP;
9045 stat->attributes_mask |= (STATX_ATTR_APPEND |
9046 STATX_ATTR_COMPRESSED |
9047 STATX_ATTR_IMMUTABLE |
9050 generic_fillattr(&init_user_ns, inode, stat);
9051 stat->dev = BTRFS_I(inode)->root->anon_dev;
9053 spin_lock(&BTRFS_I(inode)->lock);
9054 delalloc_bytes = BTRFS_I(inode)->new_delalloc_bytes;
9055 inode_bytes = inode_get_bytes(inode);
9056 spin_unlock(&BTRFS_I(inode)->lock);
9057 stat->blocks = (ALIGN(inode_bytes, blocksize) +
9058 ALIGN(delalloc_bytes, blocksize)) >> 9;
9062 static int btrfs_rename_exchange(struct inode *old_dir,
9063 struct dentry *old_dentry,
9064 struct inode *new_dir,
9065 struct dentry *new_dentry)
9067 struct btrfs_fs_info *fs_info = btrfs_sb(old_dir->i_sb);
9068 struct btrfs_trans_handle *trans;
9069 struct btrfs_root *root = BTRFS_I(old_dir)->root;
9070 struct btrfs_root *dest = BTRFS_I(new_dir)->root;
9071 struct inode *new_inode = new_dentry->d_inode;
9072 struct inode *old_inode = old_dentry->d_inode;
9073 struct timespec64 ctime = current_time(old_inode);
9074 u64 old_ino = btrfs_ino(BTRFS_I(old_inode));
9075 u64 new_ino = btrfs_ino(BTRFS_I(new_inode));
9080 bool root_log_pinned = false;
9081 bool dest_log_pinned = false;
9083 /* we only allow rename subvolume link between subvolumes */
9084 if (old_ino != BTRFS_FIRST_FREE_OBJECTID && root != dest)
9087 /* close the race window with snapshot create/destroy ioctl */
9088 if (old_ino == BTRFS_FIRST_FREE_OBJECTID ||
9089 new_ino == BTRFS_FIRST_FREE_OBJECTID)
9090 down_read(&fs_info->subvol_sem);
9093 * We want to reserve the absolute worst case amount of items. So if
9094 * both inodes are subvols and we need to unlink them then that would
9095 * require 4 item modifications, but if they are both normal inodes it
9096 * would require 5 item modifications, so we'll assume their normal
9097 * inodes. So 5 * 2 is 10, plus 2 for the new links, so 12 total items
9098 * should cover the worst case number of items we'll modify.
9100 trans = btrfs_start_transaction(root, 12);
9101 if (IS_ERR(trans)) {
9102 ret = PTR_ERR(trans);
9107 btrfs_record_root_in_trans(trans, dest);
9110 * We need to find a free sequence number both in the source and
9111 * in the destination directory for the exchange.
9113 ret = btrfs_set_inode_index(BTRFS_I(new_dir), &old_idx);
9116 ret = btrfs_set_inode_index(BTRFS_I(old_dir), &new_idx);
9120 BTRFS_I(old_inode)->dir_index = 0ULL;
9121 BTRFS_I(new_inode)->dir_index = 0ULL;
9123 /* Reference for the source. */
9124 if (old_ino == BTRFS_FIRST_FREE_OBJECTID) {
9125 /* force full log commit if subvolume involved. */
9126 btrfs_set_log_full_commit(trans);
9128 btrfs_pin_log_trans(root);
9129 root_log_pinned = true;
9130 ret = btrfs_insert_inode_ref(trans, dest,
9131 new_dentry->d_name.name,
9132 new_dentry->d_name.len,
9134 btrfs_ino(BTRFS_I(new_dir)),
9140 /* And now for the dest. */
9141 if (new_ino == BTRFS_FIRST_FREE_OBJECTID) {
9142 /* force full log commit if subvolume involved. */
9143 btrfs_set_log_full_commit(trans);
9145 btrfs_pin_log_trans(dest);
9146 dest_log_pinned = true;
9147 ret = btrfs_insert_inode_ref(trans, root,
9148 old_dentry->d_name.name,
9149 old_dentry->d_name.len,
9151 btrfs_ino(BTRFS_I(old_dir)),
9157 /* Update inode version and ctime/mtime. */
9158 inode_inc_iversion(old_dir);
9159 inode_inc_iversion(new_dir);
9160 inode_inc_iversion(old_inode);
9161 inode_inc_iversion(new_inode);
9162 old_dir->i_ctime = old_dir->i_mtime = ctime;
9163 new_dir->i_ctime = new_dir->i_mtime = ctime;
9164 old_inode->i_ctime = ctime;
9165 new_inode->i_ctime = ctime;
9167 if (old_dentry->d_parent != new_dentry->d_parent) {
9168 btrfs_record_unlink_dir(trans, BTRFS_I(old_dir),
9169 BTRFS_I(old_inode), 1);
9170 btrfs_record_unlink_dir(trans, BTRFS_I(new_dir),
9171 BTRFS_I(new_inode), 1);
9174 /* src is a subvolume */
9175 if (old_ino == BTRFS_FIRST_FREE_OBJECTID) {
9176 ret = btrfs_unlink_subvol(trans, old_dir, old_dentry);
9177 } else { /* src is an inode */
9178 ret = __btrfs_unlink_inode(trans, root, BTRFS_I(old_dir),
9179 BTRFS_I(old_dentry->d_inode),
9180 old_dentry->d_name.name,
9181 old_dentry->d_name.len);
9183 ret = btrfs_update_inode(trans, root, BTRFS_I(old_inode));
9186 btrfs_abort_transaction(trans, ret);
9190 /* dest is a subvolume */
9191 if (new_ino == BTRFS_FIRST_FREE_OBJECTID) {
9192 ret = btrfs_unlink_subvol(trans, new_dir, new_dentry);
9193 } else { /* dest is an inode */
9194 ret = __btrfs_unlink_inode(trans, dest, BTRFS_I(new_dir),
9195 BTRFS_I(new_dentry->d_inode),
9196 new_dentry->d_name.name,
9197 new_dentry->d_name.len);
9199 ret = btrfs_update_inode(trans, dest, BTRFS_I(new_inode));
9202 btrfs_abort_transaction(trans, ret);
9206 ret = btrfs_add_link(trans, BTRFS_I(new_dir), BTRFS_I(old_inode),
9207 new_dentry->d_name.name,
9208 new_dentry->d_name.len, 0, old_idx);
9210 btrfs_abort_transaction(trans, ret);
9214 ret = btrfs_add_link(trans, BTRFS_I(old_dir), BTRFS_I(new_inode),
9215 old_dentry->d_name.name,
9216 old_dentry->d_name.len, 0, new_idx);
9218 btrfs_abort_transaction(trans, ret);
9222 if (old_inode->i_nlink == 1)
9223 BTRFS_I(old_inode)->dir_index = old_idx;
9224 if (new_inode->i_nlink == 1)
9225 BTRFS_I(new_inode)->dir_index = new_idx;
9227 if (root_log_pinned) {
9228 btrfs_log_new_name(trans, BTRFS_I(old_inode), BTRFS_I(old_dir),
9229 new_dentry->d_parent);
9230 btrfs_end_log_trans(root);
9231 root_log_pinned = false;
9233 if (dest_log_pinned) {
9234 btrfs_log_new_name(trans, BTRFS_I(new_inode), BTRFS_I(new_dir),
9235 old_dentry->d_parent);
9236 btrfs_end_log_trans(dest);
9237 dest_log_pinned = false;
9241 * If we have pinned a log and an error happened, we unpin tasks
9242 * trying to sync the log and force them to fallback to a transaction
9243 * commit if the log currently contains any of the inodes involved in
9244 * this rename operation (to ensure we do not persist a log with an
9245 * inconsistent state for any of these inodes or leading to any
9246 * inconsistencies when replayed). If the transaction was aborted, the
9247 * abortion reason is propagated to userspace when attempting to commit
9248 * the transaction. If the log does not contain any of these inodes, we
9249 * allow the tasks to sync it.
9251 if (ret && (root_log_pinned || dest_log_pinned)) {
9252 if (btrfs_inode_in_log(BTRFS_I(old_dir), fs_info->generation) ||
9253 btrfs_inode_in_log(BTRFS_I(new_dir), fs_info->generation) ||
9254 btrfs_inode_in_log(BTRFS_I(old_inode), fs_info->generation) ||
9256 btrfs_inode_in_log(BTRFS_I(new_inode), fs_info->generation)))
9257 btrfs_set_log_full_commit(trans);
9259 if (root_log_pinned) {
9260 btrfs_end_log_trans(root);
9261 root_log_pinned = false;
9263 if (dest_log_pinned) {
9264 btrfs_end_log_trans(dest);
9265 dest_log_pinned = false;
9268 ret2 = btrfs_end_transaction(trans);
9269 ret = ret ? ret : ret2;
9271 if (new_ino == BTRFS_FIRST_FREE_OBJECTID ||
9272 old_ino == BTRFS_FIRST_FREE_OBJECTID)
9273 up_read(&fs_info->subvol_sem);
9278 static int btrfs_whiteout_for_rename(struct btrfs_trans_handle *trans,
9279 struct btrfs_root *root,
9281 struct dentry *dentry)
9284 struct inode *inode;
9288 ret = btrfs_get_free_objectid(root, &objectid);
9292 inode = btrfs_new_inode(trans, root, dir,
9293 dentry->d_name.name,
9295 btrfs_ino(BTRFS_I(dir)),
9297 S_IFCHR | WHITEOUT_MODE,
9300 if (IS_ERR(inode)) {
9301 ret = PTR_ERR(inode);
9305 inode->i_op = &btrfs_special_inode_operations;
9306 init_special_inode(inode, inode->i_mode,
9309 ret = btrfs_init_inode_security(trans, inode, dir,
9314 ret = btrfs_add_nondir(trans, BTRFS_I(dir), dentry,
9315 BTRFS_I(inode), 0, index);
9319 ret = btrfs_update_inode(trans, root, BTRFS_I(inode));
9321 unlock_new_inode(inode);
9323 inode_dec_link_count(inode);
9329 static int btrfs_rename(struct inode *old_dir, struct dentry *old_dentry,
9330 struct inode *new_dir, struct dentry *new_dentry,
9333 struct btrfs_fs_info *fs_info = btrfs_sb(old_dir->i_sb);
9334 struct btrfs_trans_handle *trans;
9335 unsigned int trans_num_items;
9336 struct btrfs_root *root = BTRFS_I(old_dir)->root;
9337 struct btrfs_root *dest = BTRFS_I(new_dir)->root;
9338 struct inode *new_inode = d_inode(new_dentry);
9339 struct inode *old_inode = d_inode(old_dentry);
9343 u64 old_ino = btrfs_ino(BTRFS_I(old_inode));
9344 bool log_pinned = false;
9346 if (btrfs_ino(BTRFS_I(new_dir)) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)
9349 /* we only allow rename subvolume link between subvolumes */
9350 if (old_ino != BTRFS_FIRST_FREE_OBJECTID && root != dest)
9353 if (old_ino == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID ||
9354 (new_inode && btrfs_ino(BTRFS_I(new_inode)) == BTRFS_FIRST_FREE_OBJECTID))
9357 if (S_ISDIR(old_inode->i_mode) && new_inode &&
9358 new_inode->i_size > BTRFS_EMPTY_DIR_SIZE)
9362 /* check for collisions, even if the name isn't there */
9363 ret = btrfs_check_dir_item_collision(dest, new_dir->i_ino,
9364 new_dentry->d_name.name,
9365 new_dentry->d_name.len);
9368 if (ret == -EEXIST) {
9370 * eexist without a new_inode */
9371 if (WARN_ON(!new_inode)) {
9375 /* maybe -EOVERFLOW */
9382 * we're using rename to replace one file with another. Start IO on it
9383 * now so we don't add too much work to the end of the transaction
9385 if (new_inode && S_ISREG(old_inode->i_mode) && new_inode->i_size)
9386 filemap_flush(old_inode->i_mapping);
9388 /* close the racy window with snapshot create/destroy ioctl */
9389 if (old_ino == BTRFS_FIRST_FREE_OBJECTID)
9390 down_read(&fs_info->subvol_sem);
9392 * We want to reserve the absolute worst case amount of items. So if
9393 * both inodes are subvols and we need to unlink them then that would
9394 * require 4 item modifications, but if they are both normal inodes it
9395 * would require 5 item modifications, so we'll assume they are normal
9396 * inodes. So 5 * 2 is 10, plus 1 for the new link, so 11 total items
9397 * should cover the worst case number of items we'll modify.
9398 * If our rename has the whiteout flag, we need more 5 units for the
9399 * new inode (1 inode item, 1 inode ref, 2 dir items and 1 xattr item
9400 * when selinux is enabled).
9402 trans_num_items = 11;
9403 if (flags & RENAME_WHITEOUT)
9404 trans_num_items += 5;
9405 trans = btrfs_start_transaction(root, trans_num_items);
9406 if (IS_ERR(trans)) {
9407 ret = PTR_ERR(trans);
9412 btrfs_record_root_in_trans(trans, dest);
9414 ret = btrfs_set_inode_index(BTRFS_I(new_dir), &index);
9418 BTRFS_I(old_inode)->dir_index = 0ULL;
9419 if (unlikely(old_ino == BTRFS_FIRST_FREE_OBJECTID)) {
9420 /* force full log commit if subvolume involved. */
9421 btrfs_set_log_full_commit(trans);
9423 btrfs_pin_log_trans(root);
9425 ret = btrfs_insert_inode_ref(trans, dest,
9426 new_dentry->d_name.name,
9427 new_dentry->d_name.len,
9429 btrfs_ino(BTRFS_I(new_dir)), index);
9434 inode_inc_iversion(old_dir);
9435 inode_inc_iversion(new_dir);
9436 inode_inc_iversion(old_inode);
9437 old_dir->i_ctime = old_dir->i_mtime =
9438 new_dir->i_ctime = new_dir->i_mtime =
9439 old_inode->i_ctime = current_time(old_dir);
9441 if (old_dentry->d_parent != new_dentry->d_parent)
9442 btrfs_record_unlink_dir(trans, BTRFS_I(old_dir),
9443 BTRFS_I(old_inode), 1);
9445 if (unlikely(old_ino == BTRFS_FIRST_FREE_OBJECTID)) {
9446 ret = btrfs_unlink_subvol(trans, old_dir, old_dentry);
9448 ret = __btrfs_unlink_inode(trans, root, BTRFS_I(old_dir),
9449 BTRFS_I(d_inode(old_dentry)),
9450 old_dentry->d_name.name,
9451 old_dentry->d_name.len);
9453 ret = btrfs_update_inode(trans, root, BTRFS_I(old_inode));
9456 btrfs_abort_transaction(trans, ret);
9461 inode_inc_iversion(new_inode);
9462 new_inode->i_ctime = current_time(new_inode);
9463 if (unlikely(btrfs_ino(BTRFS_I(new_inode)) ==
9464 BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)) {
9465 ret = btrfs_unlink_subvol(trans, new_dir, new_dentry);
9466 BUG_ON(new_inode->i_nlink == 0);
9468 ret = btrfs_unlink_inode(trans, dest, BTRFS_I(new_dir),
9469 BTRFS_I(d_inode(new_dentry)),
9470 new_dentry->d_name.name,
9471 new_dentry->d_name.len);
9473 if (!ret && new_inode->i_nlink == 0)
9474 ret = btrfs_orphan_add(trans,
9475 BTRFS_I(d_inode(new_dentry)));
9477 btrfs_abort_transaction(trans, ret);
9482 ret = btrfs_add_link(trans, BTRFS_I(new_dir), BTRFS_I(old_inode),
9483 new_dentry->d_name.name,
9484 new_dentry->d_name.len, 0, index);
9486 btrfs_abort_transaction(trans, ret);
9490 if (old_inode->i_nlink == 1)
9491 BTRFS_I(old_inode)->dir_index = index;
9494 btrfs_log_new_name(trans, BTRFS_I(old_inode), BTRFS_I(old_dir),
9495 new_dentry->d_parent);
9496 btrfs_end_log_trans(root);
9500 if (flags & RENAME_WHITEOUT) {
9501 ret = btrfs_whiteout_for_rename(trans, root, old_dir,
9505 btrfs_abort_transaction(trans, ret);
9511 * If we have pinned the log and an error happened, we unpin tasks
9512 * trying to sync the log and force them to fallback to a transaction
9513 * commit if the log currently contains any of the inodes involved in
9514 * this rename operation (to ensure we do not persist a log with an
9515 * inconsistent state for any of these inodes or leading to any
9516 * inconsistencies when replayed). If the transaction was aborted, the
9517 * abortion reason is propagated to userspace when attempting to commit
9518 * the transaction. If the log does not contain any of these inodes, we
9519 * allow the tasks to sync it.
9521 if (ret && log_pinned) {
9522 if (btrfs_inode_in_log(BTRFS_I(old_dir), fs_info->generation) ||
9523 btrfs_inode_in_log(BTRFS_I(new_dir), fs_info->generation) ||
9524 btrfs_inode_in_log(BTRFS_I(old_inode), fs_info->generation) ||
9526 btrfs_inode_in_log(BTRFS_I(new_inode), fs_info->generation)))
9527 btrfs_set_log_full_commit(trans);
9529 btrfs_end_log_trans(root);
9532 ret2 = btrfs_end_transaction(trans);
9533 ret = ret ? ret : ret2;
9535 if (old_ino == BTRFS_FIRST_FREE_OBJECTID)
9536 up_read(&fs_info->subvol_sem);
9541 static int btrfs_rename2(struct user_namespace *mnt_userns, struct inode *old_dir,
9542 struct dentry *old_dentry, struct inode *new_dir,
9543 struct dentry *new_dentry, unsigned int flags)
9545 if (flags & ~(RENAME_NOREPLACE | RENAME_EXCHANGE | RENAME_WHITEOUT))
9548 if (flags & RENAME_EXCHANGE)
9549 return btrfs_rename_exchange(old_dir, old_dentry, new_dir,
9552 return btrfs_rename(old_dir, old_dentry, new_dir, new_dentry, flags);
9555 struct btrfs_delalloc_work {
9556 struct inode *inode;
9557 struct completion completion;
9558 struct list_head list;
9559 struct btrfs_work work;
9562 static void btrfs_run_delalloc_work(struct btrfs_work *work)
9564 struct btrfs_delalloc_work *delalloc_work;
9565 struct inode *inode;
9567 delalloc_work = container_of(work, struct btrfs_delalloc_work,
9569 inode = delalloc_work->inode;
9570 filemap_flush(inode->i_mapping);
9571 if (test_bit(BTRFS_INODE_HAS_ASYNC_EXTENT,
9572 &BTRFS_I(inode)->runtime_flags))
9573 filemap_flush(inode->i_mapping);
9576 complete(&delalloc_work->completion);
9579 static struct btrfs_delalloc_work *btrfs_alloc_delalloc_work(struct inode *inode)
9581 struct btrfs_delalloc_work *work;
9583 work = kmalloc(sizeof(*work), GFP_NOFS);
9587 init_completion(&work->completion);
9588 INIT_LIST_HEAD(&work->list);
9589 work->inode = inode;
9590 btrfs_init_work(&work->work, btrfs_run_delalloc_work, NULL, NULL);
9596 * some fairly slow code that needs optimization. This walks the list
9597 * of all the inodes with pending delalloc and forces them to disk.
9599 static int start_delalloc_inodes(struct btrfs_root *root,
9600 struct writeback_control *wbc, bool snapshot,
9601 bool in_reclaim_context)
9603 struct btrfs_inode *binode;
9604 struct inode *inode;
9605 struct btrfs_delalloc_work *work, *next;
9606 struct list_head works;
9607 struct list_head splice;
9609 bool full_flush = wbc->nr_to_write == LONG_MAX;
9611 INIT_LIST_HEAD(&works);
9612 INIT_LIST_HEAD(&splice);
9614 mutex_lock(&root->delalloc_mutex);
9615 spin_lock(&root->delalloc_lock);
9616 list_splice_init(&root->delalloc_inodes, &splice);
9617 while (!list_empty(&splice)) {
9618 binode = list_entry(splice.next, struct btrfs_inode,
9621 list_move_tail(&binode->delalloc_inodes,
9622 &root->delalloc_inodes);
9624 if (in_reclaim_context &&
9625 test_bit(BTRFS_INODE_NO_DELALLOC_FLUSH, &binode->runtime_flags))
9628 inode = igrab(&binode->vfs_inode);
9630 cond_resched_lock(&root->delalloc_lock);
9633 spin_unlock(&root->delalloc_lock);
9636 set_bit(BTRFS_INODE_SNAPSHOT_FLUSH,
9637 &binode->runtime_flags);
9639 work = btrfs_alloc_delalloc_work(inode);
9645 list_add_tail(&work->list, &works);
9646 btrfs_queue_work(root->fs_info->flush_workers,
9649 ret = sync_inode(inode, wbc);
9651 test_bit(BTRFS_INODE_HAS_ASYNC_EXTENT,
9652 &BTRFS_I(inode)->runtime_flags))
9653 ret = sync_inode(inode, wbc);
9654 btrfs_add_delayed_iput(inode);
9655 if (ret || wbc->nr_to_write <= 0)
9659 spin_lock(&root->delalloc_lock);
9661 spin_unlock(&root->delalloc_lock);
9664 list_for_each_entry_safe(work, next, &works, list) {
9665 list_del_init(&work->list);
9666 wait_for_completion(&work->completion);
9670 if (!list_empty(&splice)) {
9671 spin_lock(&root->delalloc_lock);
9672 list_splice_tail(&splice, &root->delalloc_inodes);
9673 spin_unlock(&root->delalloc_lock);
9675 mutex_unlock(&root->delalloc_mutex);
9679 int btrfs_start_delalloc_snapshot(struct btrfs_root *root)
9681 struct writeback_control wbc = {
9682 .nr_to_write = LONG_MAX,
9683 .sync_mode = WB_SYNC_NONE,
9685 .range_end = LLONG_MAX,
9687 struct btrfs_fs_info *fs_info = root->fs_info;
9689 if (test_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state))
9692 return start_delalloc_inodes(root, &wbc, true, false);
9695 int btrfs_start_delalloc_roots(struct btrfs_fs_info *fs_info, long nr,
9696 bool in_reclaim_context)
9698 struct writeback_control wbc = {
9700 .sync_mode = WB_SYNC_NONE,
9702 .range_end = LLONG_MAX,
9704 struct btrfs_root *root;
9705 struct list_head splice;
9708 if (test_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state))
9711 INIT_LIST_HEAD(&splice);
9713 mutex_lock(&fs_info->delalloc_root_mutex);
9714 spin_lock(&fs_info->delalloc_root_lock);
9715 list_splice_init(&fs_info->delalloc_roots, &splice);
9716 while (!list_empty(&splice)) {
9718 * Reset nr_to_write here so we know that we're doing a full
9722 wbc.nr_to_write = LONG_MAX;
9724 root = list_first_entry(&splice, struct btrfs_root,
9726 root = btrfs_grab_root(root);
9728 list_move_tail(&root->delalloc_root,
9729 &fs_info->delalloc_roots);
9730 spin_unlock(&fs_info->delalloc_root_lock);
9732 ret = start_delalloc_inodes(root, &wbc, false, in_reclaim_context);
9733 btrfs_put_root(root);
9734 if (ret < 0 || wbc.nr_to_write <= 0)
9736 spin_lock(&fs_info->delalloc_root_lock);
9738 spin_unlock(&fs_info->delalloc_root_lock);
9742 if (!list_empty(&splice)) {
9743 spin_lock(&fs_info->delalloc_root_lock);
9744 list_splice_tail(&splice, &fs_info->delalloc_roots);
9745 spin_unlock(&fs_info->delalloc_root_lock);
9747 mutex_unlock(&fs_info->delalloc_root_mutex);
9751 static int btrfs_symlink(struct user_namespace *mnt_userns, struct inode *dir,
9752 struct dentry *dentry, const char *symname)
9754 struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
9755 struct btrfs_trans_handle *trans;
9756 struct btrfs_root *root = BTRFS_I(dir)->root;
9757 struct btrfs_path *path;
9758 struct btrfs_key key;
9759 struct inode *inode = NULL;
9766 struct btrfs_file_extent_item *ei;
9767 struct extent_buffer *leaf;
9769 name_len = strlen(symname);
9770 if (name_len > BTRFS_MAX_INLINE_DATA_SIZE(fs_info))
9771 return -ENAMETOOLONG;
9774 * 2 items for inode item and ref
9775 * 2 items for dir items
9776 * 1 item for updating parent inode item
9777 * 1 item for the inline extent item
9778 * 1 item for xattr if selinux is on
9780 trans = btrfs_start_transaction(root, 7);
9782 return PTR_ERR(trans);
9784 err = btrfs_get_free_objectid(root, &objectid);
9788 inode = btrfs_new_inode(trans, root, dir, dentry->d_name.name,
9789 dentry->d_name.len, btrfs_ino(BTRFS_I(dir)),
9790 objectid, S_IFLNK|S_IRWXUGO, &index);
9791 if (IS_ERR(inode)) {
9792 err = PTR_ERR(inode);
9798 * If the active LSM wants to access the inode during
9799 * d_instantiate it needs these. Smack checks to see
9800 * if the filesystem supports xattrs by looking at the
9803 inode->i_fop = &btrfs_file_operations;
9804 inode->i_op = &btrfs_file_inode_operations;
9805 inode->i_mapping->a_ops = &btrfs_aops;
9807 err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name);
9811 path = btrfs_alloc_path();
9816 key.objectid = btrfs_ino(BTRFS_I(inode));
9818 key.type = BTRFS_EXTENT_DATA_KEY;
9819 datasize = btrfs_file_extent_calc_inline_size(name_len);
9820 err = btrfs_insert_empty_item(trans, root, path, &key,
9823 btrfs_free_path(path);
9826 leaf = path->nodes[0];
9827 ei = btrfs_item_ptr(leaf, path->slots[0],
9828 struct btrfs_file_extent_item);
9829 btrfs_set_file_extent_generation(leaf, ei, trans->transid);
9830 btrfs_set_file_extent_type(leaf, ei,
9831 BTRFS_FILE_EXTENT_INLINE);
9832 btrfs_set_file_extent_encryption(leaf, ei, 0);
9833 btrfs_set_file_extent_compression(leaf, ei, 0);
9834 btrfs_set_file_extent_other_encoding(leaf, ei, 0);
9835 btrfs_set_file_extent_ram_bytes(leaf, ei, name_len);
9837 ptr = btrfs_file_extent_inline_start(ei);
9838 write_extent_buffer(leaf, symname, ptr, name_len);
9839 btrfs_mark_buffer_dirty(leaf);
9840 btrfs_free_path(path);
9842 inode->i_op = &btrfs_symlink_inode_operations;
9843 inode_nohighmem(inode);
9844 inode_set_bytes(inode, name_len);
9845 btrfs_i_size_write(BTRFS_I(inode), name_len);
9846 err = btrfs_update_inode(trans, root, BTRFS_I(inode));
9848 * Last step, add directory indexes for our symlink inode. This is the
9849 * last step to avoid extra cleanup of these indexes if an error happens
9853 err = btrfs_add_nondir(trans, BTRFS_I(dir), dentry,
9854 BTRFS_I(inode), 0, index);
9858 d_instantiate_new(dentry, inode);
9861 btrfs_end_transaction(trans);
9863 inode_dec_link_count(inode);
9864 discard_new_inode(inode);
9866 btrfs_btree_balance_dirty(fs_info);
9870 static struct btrfs_trans_handle *insert_prealloc_file_extent(
9871 struct btrfs_trans_handle *trans_in,
9872 struct btrfs_inode *inode,
9873 struct btrfs_key *ins,
9876 struct btrfs_file_extent_item stack_fi;
9877 struct btrfs_replace_extent_info extent_info;
9878 struct btrfs_trans_handle *trans = trans_in;
9879 struct btrfs_path *path;
9880 u64 start = ins->objectid;
9881 u64 len = ins->offset;
9884 memset(&stack_fi, 0, sizeof(stack_fi));
9886 btrfs_set_stack_file_extent_type(&stack_fi, BTRFS_FILE_EXTENT_PREALLOC);
9887 btrfs_set_stack_file_extent_disk_bytenr(&stack_fi, start);
9888 btrfs_set_stack_file_extent_disk_num_bytes(&stack_fi, len);
9889 btrfs_set_stack_file_extent_num_bytes(&stack_fi, len);
9890 btrfs_set_stack_file_extent_ram_bytes(&stack_fi, len);
9891 btrfs_set_stack_file_extent_compression(&stack_fi, BTRFS_COMPRESS_NONE);
9892 /* Encryption and other encoding is reserved and all 0 */
9894 ret = btrfs_qgroup_release_data(inode, file_offset, len);
9896 return ERR_PTR(ret);
9899 ret = insert_reserved_file_extent(trans, inode,
9900 file_offset, &stack_fi,
9903 return ERR_PTR(ret);
9907 extent_info.disk_offset = start;
9908 extent_info.disk_len = len;
9909 extent_info.data_offset = 0;
9910 extent_info.data_len = len;
9911 extent_info.file_offset = file_offset;
9912 extent_info.extent_buf = (char *)&stack_fi;
9913 extent_info.is_new_extent = true;
9914 extent_info.qgroup_reserved = ret;
9915 extent_info.insertions = 0;
9917 path = btrfs_alloc_path();
9919 return ERR_PTR(-ENOMEM);
9921 ret = btrfs_replace_file_extents(&inode->vfs_inode, path, file_offset,
9922 file_offset + len - 1, &extent_info,
9924 btrfs_free_path(path);
9926 return ERR_PTR(ret);
9931 static int __btrfs_prealloc_file_range(struct inode *inode, int mode,
9932 u64 start, u64 num_bytes, u64 min_size,
9933 loff_t actual_len, u64 *alloc_hint,
9934 struct btrfs_trans_handle *trans)
9936 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
9937 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
9938 struct extent_map *em;
9939 struct btrfs_root *root = BTRFS_I(inode)->root;
9940 struct btrfs_key ins;
9941 u64 cur_offset = start;
9942 u64 clear_offset = start;
9945 u64 last_alloc = (u64)-1;
9947 bool own_trans = true;
9948 u64 end = start + num_bytes - 1;
9952 while (num_bytes > 0) {
9953 cur_bytes = min_t(u64, num_bytes, SZ_256M);
9954 cur_bytes = max(cur_bytes, min_size);
9956 * If we are severely fragmented we could end up with really
9957 * small allocations, so if the allocator is returning small
9958 * chunks lets make its job easier by only searching for those
9961 cur_bytes = min(cur_bytes, last_alloc);
9962 ret = btrfs_reserve_extent(root, cur_bytes, cur_bytes,
9963 min_size, 0, *alloc_hint, &ins, 1, 0);
9968 * We've reserved this space, and thus converted it from
9969 * ->bytes_may_use to ->bytes_reserved. Any error that happens
9970 * from here on out we will only need to clear our reservation
9971 * for the remaining unreserved area, so advance our
9972 * clear_offset by our extent size.
9974 clear_offset += ins.offset;
9976 last_alloc = ins.offset;
9977 trans = insert_prealloc_file_extent(trans, BTRFS_I(inode),
9980 * Now that we inserted the prealloc extent we can finally
9981 * decrement the number of reservations in the block group.
9982 * If we did it before, we could race with relocation and have
9983 * relocation miss the reserved extent, making it fail later.
9985 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
9986 if (IS_ERR(trans)) {
9987 ret = PTR_ERR(trans);
9988 btrfs_free_reserved_extent(fs_info, ins.objectid,
9993 btrfs_drop_extent_cache(BTRFS_I(inode), cur_offset,
9994 cur_offset + ins.offset -1, 0);
9996 em = alloc_extent_map();
9998 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC,
9999 &BTRFS_I(inode)->runtime_flags);
10003 em->start = cur_offset;
10004 em->orig_start = cur_offset;
10005 em->len = ins.offset;
10006 em->block_start = ins.objectid;
10007 em->block_len = ins.offset;
10008 em->orig_block_len = ins.offset;
10009 em->ram_bytes = ins.offset;
10010 set_bit(EXTENT_FLAG_PREALLOC, &em->flags);
10011 em->generation = trans->transid;
10014 write_lock(&em_tree->lock);
10015 ret = add_extent_mapping(em_tree, em, 1);
10016 write_unlock(&em_tree->lock);
10017 if (ret != -EEXIST)
10019 btrfs_drop_extent_cache(BTRFS_I(inode), cur_offset,
10020 cur_offset + ins.offset - 1,
10023 free_extent_map(em);
10025 num_bytes -= ins.offset;
10026 cur_offset += ins.offset;
10027 *alloc_hint = ins.objectid + ins.offset;
10029 inode_inc_iversion(inode);
10030 inode->i_ctime = current_time(inode);
10031 BTRFS_I(inode)->flags |= BTRFS_INODE_PREALLOC;
10032 if (!(mode & FALLOC_FL_KEEP_SIZE) &&
10033 (actual_len > inode->i_size) &&
10034 (cur_offset > inode->i_size)) {
10035 if (cur_offset > actual_len)
10036 i_size = actual_len;
10038 i_size = cur_offset;
10039 i_size_write(inode, i_size);
10040 btrfs_inode_safe_disk_i_size_write(BTRFS_I(inode), 0);
10043 ret = btrfs_update_inode(trans, root, BTRFS_I(inode));
10046 btrfs_abort_transaction(trans, ret);
10048 btrfs_end_transaction(trans);
10053 btrfs_end_transaction(trans);
10057 if (clear_offset < end)
10058 btrfs_free_reserved_data_space(BTRFS_I(inode), NULL, clear_offset,
10059 end - clear_offset + 1);
10063 int btrfs_prealloc_file_range(struct inode *inode, int mode,
10064 u64 start, u64 num_bytes, u64 min_size,
10065 loff_t actual_len, u64 *alloc_hint)
10067 return __btrfs_prealloc_file_range(inode, mode, start, num_bytes,
10068 min_size, actual_len, alloc_hint,
10072 int btrfs_prealloc_file_range_trans(struct inode *inode,
10073 struct btrfs_trans_handle *trans, int mode,
10074 u64 start, u64 num_bytes, u64 min_size,
10075 loff_t actual_len, u64 *alloc_hint)
10077 return __btrfs_prealloc_file_range(inode, mode, start, num_bytes,
10078 min_size, actual_len, alloc_hint, trans);
10081 static int btrfs_set_page_dirty(struct page *page)
10083 return __set_page_dirty_nobuffers(page);
10086 static int btrfs_permission(struct user_namespace *mnt_userns,
10087 struct inode *inode, int mask)
10089 struct btrfs_root *root = BTRFS_I(inode)->root;
10090 umode_t mode = inode->i_mode;
10092 if (mask & MAY_WRITE &&
10093 (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode))) {
10094 if (btrfs_root_readonly(root))
10096 if (BTRFS_I(inode)->flags & BTRFS_INODE_READONLY)
10099 return generic_permission(&init_user_ns, inode, mask);
10102 static int btrfs_tmpfile(struct user_namespace *mnt_userns, struct inode *dir,
10103 struct dentry *dentry, umode_t mode)
10105 struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
10106 struct btrfs_trans_handle *trans;
10107 struct btrfs_root *root = BTRFS_I(dir)->root;
10108 struct inode *inode = NULL;
10114 * 5 units required for adding orphan entry
10116 trans = btrfs_start_transaction(root, 5);
10118 return PTR_ERR(trans);
10120 ret = btrfs_get_free_objectid(root, &objectid);
10124 inode = btrfs_new_inode(trans, root, dir, NULL, 0,
10125 btrfs_ino(BTRFS_I(dir)), objectid, mode, &index);
10126 if (IS_ERR(inode)) {
10127 ret = PTR_ERR(inode);
10132 inode->i_fop = &btrfs_file_operations;
10133 inode->i_op = &btrfs_file_inode_operations;
10135 inode->i_mapping->a_ops = &btrfs_aops;
10137 ret = btrfs_init_inode_security(trans, inode, dir, NULL);
10141 ret = btrfs_update_inode(trans, root, BTRFS_I(inode));
10144 ret = btrfs_orphan_add(trans, BTRFS_I(inode));
10149 * We set number of links to 0 in btrfs_new_inode(), and here we set
10150 * it to 1 because d_tmpfile() will issue a warning if the count is 0,
10153 * d_tmpfile() -> inode_dec_link_count() -> drop_nlink()
10155 set_nlink(inode, 1);
10156 d_tmpfile(dentry, inode);
10157 unlock_new_inode(inode);
10158 mark_inode_dirty(inode);
10160 btrfs_end_transaction(trans);
10162 discard_new_inode(inode);
10163 btrfs_btree_balance_dirty(fs_info);
10167 void btrfs_set_range_writeback(struct extent_io_tree *tree, u64 start, u64 end)
10169 struct inode *inode = tree->private_data;
10170 unsigned long index = start >> PAGE_SHIFT;
10171 unsigned long end_index = end >> PAGE_SHIFT;
10174 while (index <= end_index) {
10175 page = find_get_page(inode->i_mapping, index);
10176 ASSERT(page); /* Pages should be in the extent_io_tree */
10177 set_page_writeback(page);
10185 * Add an entry indicating a block group or device which is pinned by a
10186 * swapfile. Returns 0 on success, 1 if there is already an entry for it, or a
10187 * negative errno on failure.
10189 static int btrfs_add_swapfile_pin(struct inode *inode, void *ptr,
10190 bool is_block_group)
10192 struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info;
10193 struct btrfs_swapfile_pin *sp, *entry;
10194 struct rb_node **p;
10195 struct rb_node *parent = NULL;
10197 sp = kmalloc(sizeof(*sp), GFP_NOFS);
10202 sp->is_block_group = is_block_group;
10204 spin_lock(&fs_info->swapfile_pins_lock);
10205 p = &fs_info->swapfile_pins.rb_node;
10208 entry = rb_entry(parent, struct btrfs_swapfile_pin, node);
10209 if (sp->ptr < entry->ptr ||
10210 (sp->ptr == entry->ptr && sp->inode < entry->inode)) {
10211 p = &(*p)->rb_left;
10212 } else if (sp->ptr > entry->ptr ||
10213 (sp->ptr == entry->ptr && sp->inode > entry->inode)) {
10214 p = &(*p)->rb_right;
10216 spin_unlock(&fs_info->swapfile_pins_lock);
10221 rb_link_node(&sp->node, parent, p);
10222 rb_insert_color(&sp->node, &fs_info->swapfile_pins);
10223 spin_unlock(&fs_info->swapfile_pins_lock);
10227 /* Free all of the entries pinned by this swapfile. */
10228 static void btrfs_free_swapfile_pins(struct inode *inode)
10230 struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info;
10231 struct btrfs_swapfile_pin *sp;
10232 struct rb_node *node, *next;
10234 spin_lock(&fs_info->swapfile_pins_lock);
10235 node = rb_first(&fs_info->swapfile_pins);
10237 next = rb_next(node);
10238 sp = rb_entry(node, struct btrfs_swapfile_pin, node);
10239 if (sp->inode == inode) {
10240 rb_erase(&sp->node, &fs_info->swapfile_pins);
10241 if (sp->is_block_group)
10242 btrfs_put_block_group(sp->ptr);
10247 spin_unlock(&fs_info->swapfile_pins_lock);
10250 struct btrfs_swap_info {
10256 unsigned long nr_pages;
10260 static int btrfs_add_swap_extent(struct swap_info_struct *sis,
10261 struct btrfs_swap_info *bsi)
10263 unsigned long nr_pages;
10264 u64 first_ppage, first_ppage_reported, next_ppage;
10267 first_ppage = ALIGN(bsi->block_start, PAGE_SIZE) >> PAGE_SHIFT;
10268 next_ppage = ALIGN_DOWN(bsi->block_start + bsi->block_len,
10269 PAGE_SIZE) >> PAGE_SHIFT;
10271 if (first_ppage >= next_ppage)
10273 nr_pages = next_ppage - first_ppage;
10275 first_ppage_reported = first_ppage;
10276 if (bsi->start == 0)
10277 first_ppage_reported++;
10278 if (bsi->lowest_ppage > first_ppage_reported)
10279 bsi->lowest_ppage = first_ppage_reported;
10280 if (bsi->highest_ppage < (next_ppage - 1))
10281 bsi->highest_ppage = next_ppage - 1;
10283 ret = add_swap_extent(sis, bsi->nr_pages, nr_pages, first_ppage);
10286 bsi->nr_extents += ret;
10287 bsi->nr_pages += nr_pages;
10291 static void btrfs_swap_deactivate(struct file *file)
10293 struct inode *inode = file_inode(file);
10295 btrfs_free_swapfile_pins(inode);
10296 atomic_dec(&BTRFS_I(inode)->root->nr_swapfiles);
10299 static int btrfs_swap_activate(struct swap_info_struct *sis, struct file *file,
10302 struct inode *inode = file_inode(file);
10303 struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info;
10304 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
10305 struct extent_state *cached_state = NULL;
10306 struct extent_map *em = NULL;
10307 struct btrfs_device *device = NULL;
10308 struct btrfs_swap_info bsi = {
10309 .lowest_ppage = (sector_t)-1ULL,
10316 * If the swap file was just created, make sure delalloc is done. If the
10317 * file changes again after this, the user is doing something stupid and
10318 * we don't really care.
10320 ret = btrfs_wait_ordered_range(inode, 0, (u64)-1);
10325 * The inode is locked, so these flags won't change after we check them.
10327 if (BTRFS_I(inode)->flags & BTRFS_INODE_COMPRESS) {
10328 btrfs_warn(fs_info, "swapfile must not be compressed");
10331 if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW)) {
10332 btrfs_warn(fs_info, "swapfile must not be copy-on-write");
10335 if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM)) {
10336 btrfs_warn(fs_info, "swapfile must not be checksummed");
10341 * Balance or device remove/replace/resize can move stuff around from
10342 * under us. The exclop protection makes sure they aren't running/won't
10343 * run concurrently while we are mapping the swap extents, and
10344 * fs_info->swapfile_pins prevents them from running while the swap
10345 * file is active and moving the extents. Note that this also prevents
10346 * a concurrent device add which isn't actually necessary, but it's not
10347 * really worth the trouble to allow it.
10349 if (!btrfs_exclop_start(fs_info, BTRFS_EXCLOP_SWAP_ACTIVATE)) {
10350 btrfs_warn(fs_info,
10351 "cannot activate swapfile while exclusive operation is running");
10355 * Snapshots can create extents which require COW even if NODATACOW is
10356 * set. We use this counter to prevent snapshots. We must increment it
10357 * before walking the extents because we don't want a concurrent
10358 * snapshot to run after we've already checked the extents.
10360 atomic_inc(&BTRFS_I(inode)->root->nr_swapfiles);
10362 isize = ALIGN_DOWN(inode->i_size, fs_info->sectorsize);
10364 lock_extent_bits(io_tree, 0, isize - 1, &cached_state);
10366 while (start < isize) {
10367 u64 logical_block_start, physical_block_start;
10368 struct btrfs_block_group *bg;
10369 u64 len = isize - start;
10371 em = btrfs_get_extent(BTRFS_I(inode), NULL, 0, start, len);
10377 if (em->block_start == EXTENT_MAP_HOLE) {
10378 btrfs_warn(fs_info, "swapfile must not have holes");
10382 if (em->block_start == EXTENT_MAP_INLINE) {
10384 * It's unlikely we'll ever actually find ourselves
10385 * here, as a file small enough to fit inline won't be
10386 * big enough to store more than the swap header, but in
10387 * case something changes in the future, let's catch it
10388 * here rather than later.
10390 btrfs_warn(fs_info, "swapfile must not be inline");
10394 if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) {
10395 btrfs_warn(fs_info, "swapfile must not be compressed");
10400 logical_block_start = em->block_start + (start - em->start);
10401 len = min(len, em->len - (start - em->start));
10402 free_extent_map(em);
10405 ret = can_nocow_extent(inode, start, &len, NULL, NULL, NULL, true);
10411 btrfs_warn(fs_info,
10412 "swapfile must not be copy-on-write");
10417 em = btrfs_get_chunk_map(fs_info, logical_block_start, len);
10423 if (em->map_lookup->type & BTRFS_BLOCK_GROUP_PROFILE_MASK) {
10424 btrfs_warn(fs_info,
10425 "swapfile must have single data profile");
10430 if (device == NULL) {
10431 device = em->map_lookup->stripes[0].dev;
10432 ret = btrfs_add_swapfile_pin(inode, device, false);
10437 } else if (device != em->map_lookup->stripes[0].dev) {
10438 btrfs_warn(fs_info, "swapfile must be on one device");
10443 physical_block_start = (em->map_lookup->stripes[0].physical +
10444 (logical_block_start - em->start));
10445 len = min(len, em->len - (logical_block_start - em->start));
10446 free_extent_map(em);
10449 bg = btrfs_lookup_block_group(fs_info, logical_block_start);
10451 btrfs_warn(fs_info,
10452 "could not find block group containing swapfile");
10457 ret = btrfs_add_swapfile_pin(inode, bg, true);
10459 btrfs_put_block_group(bg);
10466 if (bsi.block_len &&
10467 bsi.block_start + bsi.block_len == physical_block_start) {
10468 bsi.block_len += len;
10470 if (bsi.block_len) {
10471 ret = btrfs_add_swap_extent(sis, &bsi);
10476 bsi.block_start = physical_block_start;
10477 bsi.block_len = len;
10484 ret = btrfs_add_swap_extent(sis, &bsi);
10487 if (!IS_ERR_OR_NULL(em))
10488 free_extent_map(em);
10490 unlock_extent_cached(io_tree, 0, isize - 1, &cached_state);
10493 btrfs_swap_deactivate(file);
10495 btrfs_exclop_finish(fs_info);
10501 sis->bdev = device->bdev;
10502 *span = bsi.highest_ppage - bsi.lowest_ppage + 1;
10503 sis->max = bsi.nr_pages;
10504 sis->pages = bsi.nr_pages - 1;
10505 sis->highest_bit = bsi.nr_pages - 1;
10506 return bsi.nr_extents;
10509 static void btrfs_swap_deactivate(struct file *file)
10513 static int btrfs_swap_activate(struct swap_info_struct *sis, struct file *file,
10516 return -EOPNOTSUPP;
10521 * Update the number of bytes used in the VFS' inode. When we replace extents in
10522 * a range (clone, dedupe, fallocate's zero range), we must update the number of
10523 * bytes used by the inode in an atomic manner, so that concurrent stat(2) calls
10524 * always get a correct value.
10526 void btrfs_update_inode_bytes(struct btrfs_inode *inode,
10527 const u64 add_bytes,
10528 const u64 del_bytes)
10530 if (add_bytes == del_bytes)
10533 spin_lock(&inode->lock);
10535 inode_sub_bytes(&inode->vfs_inode, del_bytes);
10537 inode_add_bytes(&inode->vfs_inode, add_bytes);
10538 spin_unlock(&inode->lock);
10541 static const struct inode_operations btrfs_dir_inode_operations = {
10542 .getattr = btrfs_getattr,
10543 .lookup = btrfs_lookup,
10544 .create = btrfs_create,
10545 .unlink = btrfs_unlink,
10546 .link = btrfs_link,
10547 .mkdir = btrfs_mkdir,
10548 .rmdir = btrfs_rmdir,
10549 .rename = btrfs_rename2,
10550 .symlink = btrfs_symlink,
10551 .setattr = btrfs_setattr,
10552 .mknod = btrfs_mknod,
10553 .listxattr = btrfs_listxattr,
10554 .permission = btrfs_permission,
10555 .get_acl = btrfs_get_acl,
10556 .set_acl = btrfs_set_acl,
10557 .update_time = btrfs_update_time,
10558 .tmpfile = btrfs_tmpfile,
10561 static const struct file_operations btrfs_dir_file_operations = {
10562 .llseek = generic_file_llseek,
10563 .read = generic_read_dir,
10564 .iterate_shared = btrfs_real_readdir,
10565 .open = btrfs_opendir,
10566 .unlocked_ioctl = btrfs_ioctl,
10567 #ifdef CONFIG_COMPAT
10568 .compat_ioctl = btrfs_compat_ioctl,
10570 .release = btrfs_release_file,
10571 .fsync = btrfs_sync_file,
10575 * btrfs doesn't support the bmap operation because swapfiles
10576 * use bmap to make a mapping of extents in the file. They assume
10577 * these extents won't change over the life of the file and they
10578 * use the bmap result to do IO directly to the drive.
10580 * the btrfs bmap call would return logical addresses that aren't
10581 * suitable for IO and they also will change frequently as COW
10582 * operations happen. So, swapfile + btrfs == corruption.
10584 * For now we're avoiding this by dropping bmap.
10586 static const struct address_space_operations btrfs_aops = {
10587 .readpage = btrfs_readpage,
10588 .writepage = btrfs_writepage,
10589 .writepages = btrfs_writepages,
10590 .readahead = btrfs_readahead,
10591 .direct_IO = noop_direct_IO,
10592 .invalidatepage = btrfs_invalidatepage,
10593 .releasepage = btrfs_releasepage,
10594 #ifdef CONFIG_MIGRATION
10595 .migratepage = btrfs_migratepage,
10597 .set_page_dirty = btrfs_set_page_dirty,
10598 .error_remove_page = generic_error_remove_page,
10599 .swap_activate = btrfs_swap_activate,
10600 .swap_deactivate = btrfs_swap_deactivate,
10603 static const struct inode_operations btrfs_file_inode_operations = {
10604 .getattr = btrfs_getattr,
10605 .setattr = btrfs_setattr,
10606 .listxattr = btrfs_listxattr,
10607 .permission = btrfs_permission,
10608 .fiemap = btrfs_fiemap,
10609 .get_acl = btrfs_get_acl,
10610 .set_acl = btrfs_set_acl,
10611 .update_time = btrfs_update_time,
10613 static const struct inode_operations btrfs_special_inode_operations = {
10614 .getattr = btrfs_getattr,
10615 .setattr = btrfs_setattr,
10616 .permission = btrfs_permission,
10617 .listxattr = btrfs_listxattr,
10618 .get_acl = btrfs_get_acl,
10619 .set_acl = btrfs_set_acl,
10620 .update_time = btrfs_update_time,
10622 static const struct inode_operations btrfs_symlink_inode_operations = {
10623 .get_link = page_get_link,
10624 .getattr = btrfs_getattr,
10625 .setattr = btrfs_setattr,
10626 .permission = btrfs_permission,
10627 .listxattr = btrfs_listxattr,
10628 .update_time = btrfs_update_time,
10631 const struct dentry_operations btrfs_dentry_operations = {
10632 .d_delete = btrfs_dentry_delete,