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/blk-cgroup.h>
10 #include <linux/file.h>
12 #include <linux/pagemap.h>
13 #include <linux/highmem.h>
14 #include <linux/time.h>
15 #include <linux/init.h>
16 #include <linux/string.h>
17 #include <linux/backing-dev.h>
18 #include <linux/writeback.h>
19 #include <linux/compat.h>
20 #include <linux/xattr.h>
21 #include <linux/posix_acl.h>
22 #include <linux/falloc.h>
23 #include <linux/slab.h>
24 #include <linux/ratelimit.h>
25 #include <linux/btrfs.h>
26 #include <linux/blkdev.h>
27 #include <linux/posix_acl_xattr.h>
28 #include <linux/uio.h>
29 #include <linux/magic.h>
30 #include <linux/iversion.h>
31 #include <linux/swap.h>
32 #include <linux/migrate.h>
33 #include <linux/sched/mm.h>
34 #include <linux/iomap.h>
35 #include <asm/unaligned.h>
36 #include <linux/fsverity.h>
40 #include "transaction.h"
41 #include "btrfs_inode.h"
42 #include "print-tree.h"
43 #include "ordered-data.h"
47 #include "compression.h"
49 #include "free-space-cache.h"
52 #include "delalloc-space.h"
53 #include "block-group.h"
54 #include "space-info.h"
57 #include "inode-item.h"
59 struct btrfs_iget_args {
61 struct btrfs_root *root;
64 struct btrfs_dio_data {
66 struct extent_changeset *data_reserved;
67 bool data_space_reserved;
71 struct btrfs_dio_private {
75 * Since DIO can use anonymous page, we cannot use page_offset() to
76 * grab the file offset, thus need a dedicated member for file offset.
79 /* Used for bio::bi_size */
83 * References to this structure. There is one reference per in-flight
84 * bio plus one while we're still setting up.
88 /* Array of checksums */
91 /* This must be last */
95 static struct bio_set btrfs_dio_bioset;
97 struct btrfs_rename_ctx {
98 /* Output field. Stores the index number of the old directory entry. */
102 static const struct inode_operations btrfs_dir_inode_operations;
103 static const struct inode_operations btrfs_symlink_inode_operations;
104 static const struct inode_operations btrfs_special_inode_operations;
105 static const struct inode_operations btrfs_file_inode_operations;
106 static const struct address_space_operations btrfs_aops;
107 static const struct file_operations btrfs_dir_file_operations;
109 static struct kmem_cache *btrfs_inode_cachep;
110 struct kmem_cache *btrfs_trans_handle_cachep;
111 struct kmem_cache *btrfs_path_cachep;
112 struct kmem_cache *btrfs_free_space_cachep;
113 struct kmem_cache *btrfs_free_space_bitmap_cachep;
115 static int btrfs_setsize(struct inode *inode, struct iattr *attr);
116 static int btrfs_truncate(struct inode *inode, bool skip_writeback);
117 static noinline int cow_file_range(struct btrfs_inode *inode,
118 struct page *locked_page,
119 u64 start, u64 end, int *page_started,
120 unsigned long *nr_written, int unlock,
122 static struct extent_map *create_io_em(struct btrfs_inode *inode, u64 start,
123 u64 len, u64 orig_start, u64 block_start,
124 u64 block_len, u64 orig_block_len,
125 u64 ram_bytes, int compress_type,
129 * btrfs_inode_lock - lock inode i_rwsem based on arguments passed
131 * ilock_flags can have the following bit set:
133 * BTRFS_ILOCK_SHARED - acquire a shared lock on the inode
134 * BTRFS_ILOCK_TRY - try to acquire the lock, if fails on first attempt
136 * BTRFS_ILOCK_MMAP - acquire a write lock on the i_mmap_lock
138 int btrfs_inode_lock(struct inode *inode, unsigned int ilock_flags)
140 if (ilock_flags & BTRFS_ILOCK_SHARED) {
141 if (ilock_flags & BTRFS_ILOCK_TRY) {
142 if (!inode_trylock_shared(inode))
147 inode_lock_shared(inode);
149 if (ilock_flags & BTRFS_ILOCK_TRY) {
150 if (!inode_trylock(inode))
157 if (ilock_flags & BTRFS_ILOCK_MMAP)
158 down_write(&BTRFS_I(inode)->i_mmap_lock);
163 * btrfs_inode_unlock - unock inode i_rwsem
165 * ilock_flags should contain the same bits set as passed to btrfs_inode_lock()
166 * to decide whether the lock acquired is shared or exclusive.
168 void btrfs_inode_unlock(struct inode *inode, unsigned int ilock_flags)
170 if (ilock_flags & BTRFS_ILOCK_MMAP)
171 up_write(&BTRFS_I(inode)->i_mmap_lock);
172 if (ilock_flags & BTRFS_ILOCK_SHARED)
173 inode_unlock_shared(inode);
179 * Cleanup all submitted ordered extents in specified range to handle errors
180 * from the btrfs_run_delalloc_range() callback.
182 * NOTE: caller must ensure that when an error happens, it can not call
183 * extent_clear_unlock_delalloc() to clear both the bits EXTENT_DO_ACCOUNTING
184 * and EXTENT_DELALLOC simultaneously, because that causes the reserved metadata
185 * to be released, which we want to happen only when finishing the ordered
186 * extent (btrfs_finish_ordered_io()).
188 static inline void btrfs_cleanup_ordered_extents(struct btrfs_inode *inode,
189 struct page *locked_page,
190 u64 offset, u64 bytes)
192 unsigned long index = offset >> PAGE_SHIFT;
193 unsigned long end_index = (offset + bytes - 1) >> PAGE_SHIFT;
194 u64 page_start, page_end;
198 page_start = page_offset(locked_page);
199 page_end = page_start + PAGE_SIZE - 1;
202 while (index <= end_index) {
204 * For locked page, we will call end_extent_writepage() on it
205 * in run_delalloc_range() for the error handling. That
206 * end_extent_writepage() function will call
207 * btrfs_mark_ordered_io_finished() to clear page Ordered and
208 * run the ordered extent accounting.
210 * Here we can't just clear the Ordered bit, or
211 * btrfs_mark_ordered_io_finished() would skip the accounting
212 * for the page range, and the ordered extent will never finish.
214 if (locked_page && index == (page_start >> PAGE_SHIFT)) {
218 page = find_get_page(inode->vfs_inode.i_mapping, index);
224 * Here we just clear all Ordered bits for every page in the
225 * range, then btrfs_mark_ordered_io_finished() will handle
226 * the ordered extent accounting for the range.
228 btrfs_page_clamp_clear_ordered(inode->root->fs_info, page,
234 /* The locked page covers the full range, nothing needs to be done */
235 if (bytes + offset <= page_start + PAGE_SIZE)
238 * In case this page belongs to the delalloc range being
239 * instantiated then skip it, since the first page of a range is
240 * going to be properly cleaned up by the caller of
243 if (page_start >= offset && page_end <= (offset + bytes - 1)) {
244 bytes = offset + bytes - page_offset(locked_page) - PAGE_SIZE;
245 offset = page_offset(locked_page) + PAGE_SIZE;
249 return btrfs_mark_ordered_io_finished(inode, NULL, offset, bytes, false);
252 static int btrfs_dirty_inode(struct inode *inode);
254 static int btrfs_init_inode_security(struct btrfs_trans_handle *trans,
255 struct btrfs_new_inode_args *args)
259 if (args->default_acl) {
260 err = __btrfs_set_acl(trans, args->inode, args->default_acl,
266 err = __btrfs_set_acl(trans, args->inode, args->acl, ACL_TYPE_ACCESS);
270 if (!args->default_acl && !args->acl)
271 cache_no_acl(args->inode);
272 return btrfs_xattr_security_init(trans, args->inode, args->dir,
273 &args->dentry->d_name);
277 * this does all the hard work for inserting an inline extent into
278 * the btree. The caller should have done a btrfs_drop_extents so that
279 * no overlapping inline items exist in the btree
281 static int insert_inline_extent(struct btrfs_trans_handle *trans,
282 struct btrfs_path *path,
283 struct btrfs_inode *inode, bool extent_inserted,
284 size_t size, size_t compressed_size,
286 struct page **compressed_pages,
289 struct btrfs_root *root = inode->root;
290 struct extent_buffer *leaf;
291 struct page *page = NULL;
294 struct btrfs_file_extent_item *ei;
296 size_t cur_size = size;
299 ASSERT((compressed_size > 0 && compressed_pages) ||
300 (compressed_size == 0 && !compressed_pages));
302 if (compressed_size && compressed_pages)
303 cur_size = compressed_size;
305 if (!extent_inserted) {
306 struct btrfs_key key;
309 key.objectid = btrfs_ino(inode);
311 key.type = BTRFS_EXTENT_DATA_KEY;
313 datasize = btrfs_file_extent_calc_inline_size(cur_size);
314 ret = btrfs_insert_empty_item(trans, root, path, &key,
319 leaf = path->nodes[0];
320 ei = btrfs_item_ptr(leaf, path->slots[0],
321 struct btrfs_file_extent_item);
322 btrfs_set_file_extent_generation(leaf, ei, trans->transid);
323 btrfs_set_file_extent_type(leaf, ei, BTRFS_FILE_EXTENT_INLINE);
324 btrfs_set_file_extent_encryption(leaf, ei, 0);
325 btrfs_set_file_extent_other_encoding(leaf, ei, 0);
326 btrfs_set_file_extent_ram_bytes(leaf, ei, size);
327 ptr = btrfs_file_extent_inline_start(ei);
329 if (compress_type != BTRFS_COMPRESS_NONE) {
332 while (compressed_size > 0) {
333 cpage = compressed_pages[i];
334 cur_size = min_t(unsigned long, compressed_size,
337 kaddr = kmap_local_page(cpage);
338 write_extent_buffer(leaf, kaddr, ptr, cur_size);
343 compressed_size -= cur_size;
345 btrfs_set_file_extent_compression(leaf, ei,
348 page = find_get_page(inode->vfs_inode.i_mapping, 0);
349 btrfs_set_file_extent_compression(leaf, ei, 0);
350 kaddr = kmap_local_page(page);
351 write_extent_buffer(leaf, kaddr, ptr, size);
355 btrfs_mark_buffer_dirty(leaf);
356 btrfs_release_path(path);
359 * We align size to sectorsize for inline extents just for simplicity
362 ret = btrfs_inode_set_file_extent_range(inode, 0,
363 ALIGN(size, root->fs_info->sectorsize));
368 * We're an inline extent, so nobody can extend the file past i_size
369 * without locking a page we already have locked.
371 * We must do any i_size and inode updates before we unlock the pages.
372 * Otherwise we could end up racing with unlink.
374 i_size = i_size_read(&inode->vfs_inode);
375 if (update_i_size && size > i_size) {
376 i_size_write(&inode->vfs_inode, size);
379 inode->disk_i_size = i_size;
387 * conditionally insert an inline extent into the file. This
388 * does the checks required to make sure the data is small enough
389 * to fit as an inline extent.
391 static noinline int cow_file_range_inline(struct btrfs_inode *inode, u64 size,
392 size_t compressed_size,
394 struct page **compressed_pages,
397 struct btrfs_drop_extents_args drop_args = { 0 };
398 struct btrfs_root *root = inode->root;
399 struct btrfs_fs_info *fs_info = root->fs_info;
400 struct btrfs_trans_handle *trans;
401 u64 data_len = (compressed_size ?: size);
403 struct btrfs_path *path;
406 * We can create an inline extent if it ends at or beyond the current
407 * i_size, is no larger than a sector (decompressed), and the (possibly
408 * compressed) data fits in a leaf and the configured maximum inline
411 if (size < i_size_read(&inode->vfs_inode) ||
412 size > fs_info->sectorsize ||
413 data_len > BTRFS_MAX_INLINE_DATA_SIZE(fs_info) ||
414 data_len > fs_info->max_inline)
417 path = btrfs_alloc_path();
421 trans = btrfs_join_transaction(root);
423 btrfs_free_path(path);
424 return PTR_ERR(trans);
426 trans->block_rsv = &inode->block_rsv;
428 drop_args.path = path;
430 drop_args.end = fs_info->sectorsize;
431 drop_args.drop_cache = true;
432 drop_args.replace_extent = true;
433 drop_args.extent_item_size = btrfs_file_extent_calc_inline_size(data_len);
434 ret = btrfs_drop_extents(trans, root, inode, &drop_args);
436 btrfs_abort_transaction(trans, ret);
440 ret = insert_inline_extent(trans, path, inode, drop_args.extent_inserted,
441 size, compressed_size, compress_type,
442 compressed_pages, update_i_size);
443 if (ret && ret != -ENOSPC) {
444 btrfs_abort_transaction(trans, ret);
446 } else if (ret == -ENOSPC) {
451 btrfs_update_inode_bytes(inode, size, drop_args.bytes_found);
452 ret = btrfs_update_inode(trans, root, inode);
453 if (ret && ret != -ENOSPC) {
454 btrfs_abort_transaction(trans, ret);
456 } else if (ret == -ENOSPC) {
461 btrfs_set_inode_full_sync(inode);
464 * Don't forget to free the reserved space, as for inlined extent
465 * it won't count as data extent, free them directly here.
466 * And at reserve time, it's always aligned to page size, so
467 * just free one page here.
469 btrfs_qgroup_free_data(inode, NULL, 0, PAGE_SIZE);
470 btrfs_free_path(path);
471 btrfs_end_transaction(trans);
475 struct async_extent {
480 unsigned long nr_pages;
482 struct list_head list;
487 struct page *locked_page;
490 blk_opf_t write_flags;
491 struct list_head extents;
492 struct cgroup_subsys_state *blkcg_css;
493 struct btrfs_work work;
494 struct async_cow *async_cow;
499 struct async_chunk chunks[];
502 static noinline int add_async_extent(struct async_chunk *cow,
503 u64 start, u64 ram_size,
506 unsigned long nr_pages,
509 struct async_extent *async_extent;
511 async_extent = kmalloc(sizeof(*async_extent), GFP_NOFS);
512 BUG_ON(!async_extent); /* -ENOMEM */
513 async_extent->start = start;
514 async_extent->ram_size = ram_size;
515 async_extent->compressed_size = compressed_size;
516 async_extent->pages = pages;
517 async_extent->nr_pages = nr_pages;
518 async_extent->compress_type = compress_type;
519 list_add_tail(&async_extent->list, &cow->extents);
524 * Check if the inode needs to be submitted to compression, based on mount
525 * options, defragmentation, properties or heuristics.
527 static inline int inode_need_compress(struct btrfs_inode *inode, u64 start,
530 struct btrfs_fs_info *fs_info = inode->root->fs_info;
532 if (!btrfs_inode_can_compress(inode)) {
533 WARN(IS_ENABLED(CONFIG_BTRFS_DEBUG),
534 KERN_ERR "BTRFS: unexpected compression for ino %llu\n",
539 * Special check for subpage.
541 * We lock the full page then run each delalloc range in the page, thus
542 * for the following case, we will hit some subpage specific corner case:
545 * | |///////| |///////|
548 * In above case, both range A and range B will try to unlock the full
549 * page [0, 64K), causing the one finished later will have page
550 * unlocked already, triggering various page lock requirement BUG_ON()s.
552 * So here we add an artificial limit that subpage compression can only
553 * if the range is fully page aligned.
555 * In theory we only need to ensure the first page is fully covered, but
556 * the tailing partial page will be locked until the full compression
557 * finishes, delaying the write of other range.
559 * TODO: Make btrfs_run_delalloc_range() to lock all delalloc range
560 * first to prevent any submitted async extent to unlock the full page.
561 * By this, we can ensure for subpage case that only the last async_cow
562 * will unlock the full page.
564 if (fs_info->sectorsize < PAGE_SIZE) {
565 if (!PAGE_ALIGNED(start) ||
566 !PAGE_ALIGNED(end + 1))
571 if (btrfs_test_opt(fs_info, FORCE_COMPRESS))
574 if (inode->defrag_compress)
576 /* bad compression ratios */
577 if (inode->flags & BTRFS_INODE_NOCOMPRESS)
579 if (btrfs_test_opt(fs_info, COMPRESS) ||
580 inode->flags & BTRFS_INODE_COMPRESS ||
581 inode->prop_compress)
582 return btrfs_compress_heuristic(&inode->vfs_inode, start, end);
586 static inline void inode_should_defrag(struct btrfs_inode *inode,
587 u64 start, u64 end, u64 num_bytes, u32 small_write)
589 /* If this is a small write inside eof, kick off a defrag */
590 if (num_bytes < small_write &&
591 (start > 0 || end + 1 < inode->disk_i_size))
592 btrfs_add_inode_defrag(NULL, inode, small_write);
596 * we create compressed extents in two phases. The first
597 * phase compresses a range of pages that have already been
598 * locked (both pages and state bits are locked).
600 * This is done inside an ordered work queue, and the compression
601 * is spread across many cpus. The actual IO submission is step
602 * two, and the ordered work queue takes care of making sure that
603 * happens in the same order things were put onto the queue by
604 * writepages and friends.
606 * If this code finds it can't get good compression, it puts an
607 * entry onto the work queue to write the uncompressed bytes. This
608 * makes sure that both compressed inodes and uncompressed inodes
609 * are written in the same order that the flusher thread sent them
612 static noinline int compress_file_range(struct async_chunk *async_chunk)
614 struct inode *inode = async_chunk->inode;
615 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
616 u64 blocksize = fs_info->sectorsize;
617 u64 start = async_chunk->start;
618 u64 end = async_chunk->end;
622 struct page **pages = NULL;
623 unsigned long nr_pages;
624 unsigned long total_compressed = 0;
625 unsigned long total_in = 0;
628 int compress_type = fs_info->compress_type;
629 int compressed_extents = 0;
632 inode_should_defrag(BTRFS_I(inode), start, end, end - start + 1,
636 * We need to save i_size before now because it could change in between
637 * us evaluating the size and assigning it. This is because we lock and
638 * unlock the page in truncate and fallocate, and then modify the i_size
641 * The barriers are to emulate READ_ONCE, remove that once i_size_read
645 i_size = i_size_read(inode);
647 actual_end = min_t(u64, i_size, end + 1);
650 nr_pages = (end >> PAGE_SHIFT) - (start >> PAGE_SHIFT) + 1;
651 nr_pages = min_t(unsigned long, nr_pages,
652 BTRFS_MAX_COMPRESSED / PAGE_SIZE);
655 * we don't want to send crud past the end of i_size through
656 * compression, that's just a waste of CPU time. So, if the
657 * end of the file is before the start of our current
658 * requested range of bytes, we bail out to the uncompressed
659 * cleanup code that can deal with all of this.
661 * It isn't really the fastest way to fix things, but this is a
662 * very uncommon corner.
664 if (actual_end <= start)
665 goto cleanup_and_bail_uncompressed;
667 total_compressed = actual_end - start;
670 * Skip compression for a small file range(<=blocksize) that
671 * isn't an inline extent, since it doesn't save disk space at all.
673 if (total_compressed <= blocksize &&
674 (start > 0 || end + 1 < BTRFS_I(inode)->disk_i_size))
675 goto cleanup_and_bail_uncompressed;
678 * For subpage case, we require full page alignment for the sector
680 * Thus we must also check against @actual_end, not just @end.
682 if (blocksize < PAGE_SIZE) {
683 if (!PAGE_ALIGNED(start) ||
684 !PAGE_ALIGNED(round_up(actual_end, blocksize)))
685 goto cleanup_and_bail_uncompressed;
688 total_compressed = min_t(unsigned long, total_compressed,
689 BTRFS_MAX_UNCOMPRESSED);
694 * we do compression for mount -o compress and when the
695 * inode has not been flagged as nocompress. This flag can
696 * change at any time if we discover bad compression ratios.
698 if (inode_need_compress(BTRFS_I(inode), start, end)) {
700 pages = kcalloc(nr_pages, sizeof(struct page *), GFP_NOFS);
702 /* just bail out to the uncompressed code */
707 if (BTRFS_I(inode)->defrag_compress)
708 compress_type = BTRFS_I(inode)->defrag_compress;
709 else if (BTRFS_I(inode)->prop_compress)
710 compress_type = BTRFS_I(inode)->prop_compress;
713 * we need to call clear_page_dirty_for_io on each
714 * page in the range. Otherwise applications with the file
715 * mmap'd can wander in and change the page contents while
716 * we are compressing them.
718 * If the compression fails for any reason, we set the pages
719 * dirty again later on.
721 * Note that the remaining part is redirtied, the start pointer
722 * has moved, the end is the original one.
725 extent_range_clear_dirty_for_io(inode, start, end);
729 /* Compression level is applied here and only here */
730 ret = btrfs_compress_pages(
731 compress_type | (fs_info->compress_level << 4),
732 inode->i_mapping, start,
739 unsigned long offset = offset_in_page(total_compressed);
740 struct page *page = pages[nr_pages - 1];
742 /* zero the tail end of the last page, we might be
743 * sending it down to disk
746 memzero_page(page, offset, PAGE_SIZE - offset);
752 * Check cow_file_range() for why we don't even try to create inline
753 * extent for subpage case.
755 if (start == 0 && fs_info->sectorsize == PAGE_SIZE) {
756 /* lets try to make an inline extent */
757 if (ret || total_in < actual_end) {
758 /* we didn't compress the entire range, try
759 * to make an uncompressed inline extent.
761 ret = cow_file_range_inline(BTRFS_I(inode), actual_end,
762 0, BTRFS_COMPRESS_NONE,
765 /* try making a compressed inline extent */
766 ret = cow_file_range_inline(BTRFS_I(inode), actual_end,
768 compress_type, pages,
772 unsigned long clear_flags = EXTENT_DELALLOC |
773 EXTENT_DELALLOC_NEW | EXTENT_DEFRAG |
774 EXTENT_DO_ACCOUNTING;
775 unsigned long page_error_op;
777 page_error_op = ret < 0 ? PAGE_SET_ERROR : 0;
780 * inline extent creation worked or returned error,
781 * we don't need to create any more async work items.
782 * Unlock and free up our temp pages.
784 * We use DO_ACCOUNTING here because we need the
785 * delalloc_release_metadata to be done _after_ we drop
786 * our outstanding extent for clearing delalloc for this
789 extent_clear_unlock_delalloc(BTRFS_I(inode), start, end,
793 PAGE_START_WRITEBACK |
798 * Ensure we only free the compressed pages if we have
799 * them allocated, as we can still reach here with
800 * inode_need_compress() == false.
803 for (i = 0; i < nr_pages; i++) {
804 WARN_ON(pages[i]->mapping);
815 * we aren't doing an inline extent round the compressed size
816 * up to a block size boundary so the allocator does sane
819 total_compressed = ALIGN(total_compressed, blocksize);
822 * one last check to make sure the compression is really a
823 * win, compare the page count read with the blocks on disk,
824 * compression must free at least one sector size
826 total_in = round_up(total_in, fs_info->sectorsize);
827 if (total_compressed + blocksize <= total_in) {
828 compressed_extents++;
831 * The async work queues will take care of doing actual
832 * allocation on disk for these compressed pages, and
833 * will submit them to the elevator.
835 add_async_extent(async_chunk, start, total_in,
836 total_compressed, pages, nr_pages,
839 if (start + total_in < end) {
845 return compressed_extents;
850 * the compression code ran but failed to make things smaller,
851 * free any pages it allocated and our page pointer array
853 for (i = 0; i < nr_pages; i++) {
854 WARN_ON(pages[i]->mapping);
859 total_compressed = 0;
862 /* flag the file so we don't compress in the future */
863 if (!btrfs_test_opt(fs_info, FORCE_COMPRESS) &&
864 !(BTRFS_I(inode)->prop_compress)) {
865 BTRFS_I(inode)->flags |= BTRFS_INODE_NOCOMPRESS;
868 cleanup_and_bail_uncompressed:
870 * No compression, but we still need to write the pages in the file
871 * we've been given so far. redirty the locked page if it corresponds
872 * to our extent and set things up for the async work queue to run
873 * cow_file_range to do the normal delalloc dance.
875 if (async_chunk->locked_page &&
876 (page_offset(async_chunk->locked_page) >= start &&
877 page_offset(async_chunk->locked_page)) <= end) {
878 __set_page_dirty_nobuffers(async_chunk->locked_page);
879 /* unlocked later on in the async handlers */
883 extent_range_redirty_for_io(inode, start, end);
884 add_async_extent(async_chunk, start, end - start + 1, 0, NULL, 0,
885 BTRFS_COMPRESS_NONE);
886 compressed_extents++;
888 return compressed_extents;
891 static void free_async_extent_pages(struct async_extent *async_extent)
895 if (!async_extent->pages)
898 for (i = 0; i < async_extent->nr_pages; i++) {
899 WARN_ON(async_extent->pages[i]->mapping);
900 put_page(async_extent->pages[i]);
902 kfree(async_extent->pages);
903 async_extent->nr_pages = 0;
904 async_extent->pages = NULL;
907 static int submit_uncompressed_range(struct btrfs_inode *inode,
908 struct async_extent *async_extent,
909 struct page *locked_page)
911 u64 start = async_extent->start;
912 u64 end = async_extent->start + async_extent->ram_size - 1;
913 unsigned long nr_written = 0;
914 int page_started = 0;
918 * Call cow_file_range() to run the delalloc range directly, since we
919 * won't go to NOCOW or async path again.
921 * Also we call cow_file_range() with @unlock_page == 0, so that we
922 * can directly submit them without interruption.
924 ret = cow_file_range(inode, locked_page, start, end, &page_started,
925 &nr_written, 0, NULL);
926 /* Inline extent inserted, page gets unlocked and everything is done */
932 btrfs_cleanup_ordered_extents(inode, locked_page, start, end - start + 1);
934 const u64 page_start = page_offset(locked_page);
935 const u64 page_end = page_start + PAGE_SIZE - 1;
937 btrfs_page_set_error(inode->root->fs_info, locked_page,
938 page_start, PAGE_SIZE);
939 set_page_writeback(locked_page);
940 end_page_writeback(locked_page);
941 end_extent_writepage(locked_page, ret, page_start, page_end);
942 unlock_page(locked_page);
947 ret = extent_write_locked_range(&inode->vfs_inode, start, end);
948 /* All pages will be unlocked, including @locked_page */
954 static int submit_one_async_extent(struct btrfs_inode *inode,
955 struct async_chunk *async_chunk,
956 struct async_extent *async_extent,
959 struct extent_io_tree *io_tree = &inode->io_tree;
960 struct btrfs_root *root = inode->root;
961 struct btrfs_fs_info *fs_info = root->fs_info;
962 struct btrfs_key ins;
963 struct page *locked_page = NULL;
964 struct extent_map *em;
966 u64 start = async_extent->start;
967 u64 end = async_extent->start + async_extent->ram_size - 1;
970 * If async_chunk->locked_page is in the async_extent range, we need to
973 if (async_chunk->locked_page) {
974 u64 locked_page_start = page_offset(async_chunk->locked_page);
975 u64 locked_page_end = locked_page_start + PAGE_SIZE - 1;
977 if (!(start >= locked_page_end || end <= locked_page_start))
978 locked_page = async_chunk->locked_page;
980 lock_extent(io_tree, start, end, NULL);
982 /* We have fall back to uncompressed write */
983 if (!async_extent->pages)
984 return submit_uncompressed_range(inode, async_extent, locked_page);
986 ret = btrfs_reserve_extent(root, async_extent->ram_size,
987 async_extent->compressed_size,
988 async_extent->compressed_size,
989 0, *alloc_hint, &ins, 1, 1);
991 free_async_extent_pages(async_extent);
993 * Here we used to try again by going back to non-compressed
994 * path for ENOSPC. But we can't reserve space even for
995 * compressed size, how could it work for uncompressed size
996 * which requires larger size? So here we directly go error
1002 /* Here we're doing allocation and writeback of the compressed pages */
1003 em = create_io_em(inode, start,
1004 async_extent->ram_size, /* len */
1005 start, /* orig_start */
1006 ins.objectid, /* block_start */
1007 ins.offset, /* block_len */
1008 ins.offset, /* orig_block_len */
1009 async_extent->ram_size, /* ram_bytes */
1010 async_extent->compress_type,
1011 BTRFS_ORDERED_COMPRESSED);
1014 goto out_free_reserve;
1016 free_extent_map(em);
1018 ret = btrfs_add_ordered_extent(inode, start, /* file_offset */
1019 async_extent->ram_size, /* num_bytes */
1020 async_extent->ram_size, /* ram_bytes */
1021 ins.objectid, /* disk_bytenr */
1022 ins.offset, /* disk_num_bytes */
1024 1 << BTRFS_ORDERED_COMPRESSED,
1025 async_extent->compress_type);
1027 btrfs_drop_extent_map_range(inode, start, end, false);
1028 goto out_free_reserve;
1030 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
1032 /* Clear dirty, set writeback and unlock the pages. */
1033 extent_clear_unlock_delalloc(inode, start, end,
1034 NULL, EXTENT_LOCKED | EXTENT_DELALLOC,
1035 PAGE_UNLOCK | PAGE_START_WRITEBACK);
1036 if (btrfs_submit_compressed_write(inode, start, /* file_offset */
1037 async_extent->ram_size, /* num_bytes */
1038 ins.objectid, /* disk_bytenr */
1039 ins.offset, /* compressed_len */
1040 async_extent->pages, /* compressed_pages */
1041 async_extent->nr_pages,
1042 async_chunk->write_flags,
1043 async_chunk->blkcg_css, true)) {
1044 const u64 start = async_extent->start;
1045 const u64 end = start + async_extent->ram_size - 1;
1047 btrfs_writepage_endio_finish_ordered(inode, NULL, start, end, 0);
1049 extent_clear_unlock_delalloc(inode, start, end, NULL, 0,
1050 PAGE_END_WRITEBACK | PAGE_SET_ERROR);
1051 free_async_extent_pages(async_extent);
1053 *alloc_hint = ins.objectid + ins.offset;
1054 kfree(async_extent);
1058 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
1059 btrfs_free_reserved_extent(fs_info, ins.objectid, ins.offset, 1);
1061 extent_clear_unlock_delalloc(inode, start, end,
1062 NULL, EXTENT_LOCKED | EXTENT_DELALLOC |
1063 EXTENT_DELALLOC_NEW |
1064 EXTENT_DEFRAG | EXTENT_DO_ACCOUNTING,
1065 PAGE_UNLOCK | PAGE_START_WRITEBACK |
1066 PAGE_END_WRITEBACK | PAGE_SET_ERROR);
1067 free_async_extent_pages(async_extent);
1068 kfree(async_extent);
1073 * Phase two of compressed writeback. This is the ordered portion of the code,
1074 * which only gets called in the order the work was queued. We walk all the
1075 * async extents created by compress_file_range and send them down to the disk.
1077 static noinline void submit_compressed_extents(struct async_chunk *async_chunk)
1079 struct btrfs_inode *inode = BTRFS_I(async_chunk->inode);
1080 struct btrfs_fs_info *fs_info = inode->root->fs_info;
1081 struct async_extent *async_extent;
1085 while (!list_empty(&async_chunk->extents)) {
1089 async_extent = list_entry(async_chunk->extents.next,
1090 struct async_extent, list);
1091 list_del(&async_extent->list);
1092 extent_start = async_extent->start;
1093 ram_size = async_extent->ram_size;
1095 ret = submit_one_async_extent(inode, async_chunk, async_extent,
1097 btrfs_debug(fs_info,
1098 "async extent submission failed root=%lld inode=%llu start=%llu len=%llu ret=%d",
1099 inode->root->root_key.objectid,
1100 btrfs_ino(inode), extent_start, ram_size, ret);
1104 static u64 get_extent_allocation_hint(struct btrfs_inode *inode, u64 start,
1107 struct extent_map_tree *em_tree = &inode->extent_tree;
1108 struct extent_map *em;
1111 read_lock(&em_tree->lock);
1112 em = search_extent_mapping(em_tree, start, num_bytes);
1115 * if block start isn't an actual block number then find the
1116 * first block in this inode and use that as a hint. If that
1117 * block is also bogus then just don't worry about it.
1119 if (em->block_start >= EXTENT_MAP_LAST_BYTE) {
1120 free_extent_map(em);
1121 em = search_extent_mapping(em_tree, 0, 0);
1122 if (em && em->block_start < EXTENT_MAP_LAST_BYTE)
1123 alloc_hint = em->block_start;
1125 free_extent_map(em);
1127 alloc_hint = em->block_start;
1128 free_extent_map(em);
1131 read_unlock(&em_tree->lock);
1137 * when extent_io.c finds a delayed allocation range in the file,
1138 * the call backs end up in this code. The basic idea is to
1139 * allocate extents on disk for the range, and create ordered data structs
1140 * in ram to track those extents.
1142 * locked_page is the page that writepage had locked already. We use
1143 * it to make sure we don't do extra locks or unlocks.
1145 * *page_started is set to one if we unlock locked_page and do everything
1146 * required to start IO on it. It may be clean and already done with
1147 * IO when we return.
1149 * When unlock == 1, we unlock the pages in successfully allocated regions.
1150 * When unlock == 0, we leave them locked for writing them out.
1152 * However, we unlock all the pages except @locked_page in case of failure.
1154 * In summary, page locking state will be as follow:
1156 * - page_started == 1 (return value)
1157 * - All the pages are unlocked. IO is started.
1158 * - Note that this can happen only on success
1160 * - All the pages except @locked_page are unlocked in any case
1162 * - On success, all the pages are locked for writing out them
1163 * - On failure, all the pages except @locked_page are unlocked
1165 * When a failure happens in the second or later iteration of the
1166 * while-loop, the ordered extents created in previous iterations are kept
1167 * intact. So, the caller must clean them up by calling
1168 * btrfs_cleanup_ordered_extents(). See btrfs_run_delalloc_range() for
1171 static noinline int cow_file_range(struct btrfs_inode *inode,
1172 struct page *locked_page,
1173 u64 start, u64 end, int *page_started,
1174 unsigned long *nr_written, int unlock,
1177 struct btrfs_root *root = inode->root;
1178 struct btrfs_fs_info *fs_info = root->fs_info;
1180 u64 orig_start = start;
1182 unsigned long ram_size;
1183 u64 cur_alloc_size = 0;
1185 u64 blocksize = fs_info->sectorsize;
1186 struct btrfs_key ins;
1187 struct extent_map *em;
1188 unsigned clear_bits;
1189 unsigned long page_ops;
1190 bool extent_reserved = false;
1193 if (btrfs_is_free_space_inode(inode)) {
1198 num_bytes = ALIGN(end - start + 1, blocksize);
1199 num_bytes = max(blocksize, num_bytes);
1200 ASSERT(num_bytes <= btrfs_super_total_bytes(fs_info->super_copy));
1202 inode_should_defrag(inode, start, end, num_bytes, SZ_64K);
1205 * Due to the page size limit, for subpage we can only trigger the
1206 * writeback for the dirty sectors of page, that means data writeback
1207 * is doing more writeback than what we want.
1209 * This is especially unexpected for some call sites like fallocate,
1210 * where we only increase i_size after everything is done.
1211 * This means we can trigger inline extent even if we didn't want to.
1212 * So here we skip inline extent creation completely.
1214 if (start == 0 && fs_info->sectorsize == PAGE_SIZE) {
1215 u64 actual_end = min_t(u64, i_size_read(&inode->vfs_inode),
1218 /* lets try to make an inline extent */
1219 ret = cow_file_range_inline(inode, actual_end, 0,
1220 BTRFS_COMPRESS_NONE, NULL, false);
1223 * We use DO_ACCOUNTING here because we need the
1224 * delalloc_release_metadata to be run _after_ we drop
1225 * our outstanding extent for clearing delalloc for this
1228 extent_clear_unlock_delalloc(inode, start, end,
1230 EXTENT_LOCKED | EXTENT_DELALLOC |
1231 EXTENT_DELALLOC_NEW | EXTENT_DEFRAG |
1232 EXTENT_DO_ACCOUNTING, PAGE_UNLOCK |
1233 PAGE_START_WRITEBACK | PAGE_END_WRITEBACK);
1234 *nr_written = *nr_written +
1235 (end - start + PAGE_SIZE) / PAGE_SIZE;
1238 * locked_page is locked by the caller of
1239 * writepage_delalloc(), not locked by
1240 * __process_pages_contig().
1242 * We can't let __process_pages_contig() to unlock it,
1243 * as it doesn't have any subpage::writers recorded.
1245 * Here we manually unlock the page, since the caller
1246 * can't use page_started to determine if it's an
1247 * inline extent or a compressed extent.
1249 unlock_page(locked_page);
1251 } else if (ret < 0) {
1256 alloc_hint = get_extent_allocation_hint(inode, start, num_bytes);
1259 * Relocation relies on the relocated extents to have exactly the same
1260 * size as the original extents. Normally writeback for relocation data
1261 * extents follows a NOCOW path because relocation preallocates the
1262 * extents. However, due to an operation such as scrub turning a block
1263 * group to RO mode, it may fallback to COW mode, so we must make sure
1264 * an extent allocated during COW has exactly the requested size and can
1265 * not be split into smaller extents, otherwise relocation breaks and
1266 * fails during the stage where it updates the bytenr of file extent
1269 if (btrfs_is_data_reloc_root(root))
1270 min_alloc_size = num_bytes;
1272 min_alloc_size = fs_info->sectorsize;
1274 while (num_bytes > 0) {
1275 cur_alloc_size = num_bytes;
1276 ret = btrfs_reserve_extent(root, cur_alloc_size, cur_alloc_size,
1277 min_alloc_size, 0, alloc_hint,
1281 cur_alloc_size = ins.offset;
1282 extent_reserved = true;
1284 ram_size = ins.offset;
1285 em = create_io_em(inode, start, ins.offset, /* len */
1286 start, /* orig_start */
1287 ins.objectid, /* block_start */
1288 ins.offset, /* block_len */
1289 ins.offset, /* orig_block_len */
1290 ram_size, /* ram_bytes */
1291 BTRFS_COMPRESS_NONE, /* compress_type */
1292 BTRFS_ORDERED_REGULAR /* type */);
1297 free_extent_map(em);
1299 ret = btrfs_add_ordered_extent(inode, start, ram_size, ram_size,
1300 ins.objectid, cur_alloc_size, 0,
1301 1 << BTRFS_ORDERED_REGULAR,
1302 BTRFS_COMPRESS_NONE);
1304 goto out_drop_extent_cache;
1306 if (btrfs_is_data_reloc_root(root)) {
1307 ret = btrfs_reloc_clone_csums(inode, start,
1310 * Only drop cache here, and process as normal.
1312 * We must not allow extent_clear_unlock_delalloc()
1313 * at out_unlock label to free meta of this ordered
1314 * extent, as its meta should be freed by
1315 * btrfs_finish_ordered_io().
1317 * So we must continue until @start is increased to
1318 * skip current ordered extent.
1321 btrfs_drop_extent_map_range(inode, start,
1322 start + ram_size - 1,
1326 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
1329 * We're not doing compressed IO, don't unlock the first page
1330 * (which the caller expects to stay locked), don't clear any
1331 * dirty bits and don't set any writeback bits
1333 * Do set the Ordered (Private2) bit so we know this page was
1334 * properly setup for writepage.
1336 page_ops = unlock ? PAGE_UNLOCK : 0;
1337 page_ops |= PAGE_SET_ORDERED;
1339 extent_clear_unlock_delalloc(inode, start, start + ram_size - 1,
1341 EXTENT_LOCKED | EXTENT_DELALLOC,
1343 if (num_bytes < cur_alloc_size)
1346 num_bytes -= cur_alloc_size;
1347 alloc_hint = ins.objectid + ins.offset;
1348 start += cur_alloc_size;
1349 extent_reserved = false;
1352 * btrfs_reloc_clone_csums() error, since start is increased
1353 * extent_clear_unlock_delalloc() at out_unlock label won't
1354 * free metadata of current ordered extent, we're OK to exit.
1362 out_drop_extent_cache:
1363 btrfs_drop_extent_map_range(inode, start, start + ram_size - 1, false);
1365 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
1366 btrfs_free_reserved_extent(fs_info, ins.objectid, ins.offset, 1);
1369 * If done_offset is non-NULL and ret == -EAGAIN, we expect the
1370 * caller to write out the successfully allocated region and retry.
1372 if (done_offset && ret == -EAGAIN) {
1373 if (orig_start < start)
1374 *done_offset = start - 1;
1376 *done_offset = start;
1378 } else if (ret == -EAGAIN) {
1379 /* Convert to -ENOSPC since the caller cannot retry. */
1384 * Now, we have three regions to clean up:
1386 * |-------(1)----|---(2)---|-------------(3)----------|
1387 * `- orig_start `- start `- start + cur_alloc_size `- end
1389 * We process each region below.
1392 clear_bits = EXTENT_LOCKED | EXTENT_DELALLOC | EXTENT_DELALLOC_NEW |
1393 EXTENT_DEFRAG | EXTENT_CLEAR_META_RESV;
1394 page_ops = PAGE_UNLOCK | PAGE_START_WRITEBACK | PAGE_END_WRITEBACK;
1397 * For the range (1). We have already instantiated the ordered extents
1398 * for this region. They are cleaned up by
1399 * btrfs_cleanup_ordered_extents() in e.g,
1400 * btrfs_run_delalloc_range(). EXTENT_LOCKED | EXTENT_DELALLOC are
1401 * already cleared in the above loop. And, EXTENT_DELALLOC_NEW |
1402 * EXTENT_DEFRAG | EXTENT_CLEAR_META_RESV are handled by the cleanup
1405 * However, in case of unlock == 0, we still need to unlock the pages
1406 * (except @locked_page) to ensure all the pages are unlocked.
1408 if (!unlock && orig_start < start) {
1410 mapping_set_error(inode->vfs_inode.i_mapping, ret);
1411 extent_clear_unlock_delalloc(inode, orig_start, start - 1,
1412 locked_page, 0, page_ops);
1416 * For the range (2). If we reserved an extent for our delalloc range
1417 * (or a subrange) and failed to create the respective ordered extent,
1418 * then it means that when we reserved the extent we decremented the
1419 * extent's size from the data space_info's bytes_may_use counter and
1420 * incremented the space_info's bytes_reserved counter by the same
1421 * amount. We must make sure extent_clear_unlock_delalloc() does not try
1422 * to decrement again the data space_info's bytes_may_use counter,
1423 * therefore we do not pass it the flag EXTENT_CLEAR_DATA_RESV.
1425 if (extent_reserved) {
1426 extent_clear_unlock_delalloc(inode, start,
1427 start + cur_alloc_size - 1,
1431 start += cur_alloc_size;
1437 * For the range (3). We never touched the region. In addition to the
1438 * clear_bits above, we add EXTENT_CLEAR_DATA_RESV to release the data
1439 * space_info's bytes_may_use counter, reserved in
1440 * btrfs_check_data_free_space().
1442 extent_clear_unlock_delalloc(inode, start, end, locked_page,
1443 clear_bits | EXTENT_CLEAR_DATA_RESV,
1449 * work queue call back to started compression on a file and pages
1451 static noinline void async_cow_start(struct btrfs_work *work)
1453 struct async_chunk *async_chunk;
1454 int compressed_extents;
1456 async_chunk = container_of(work, struct async_chunk, work);
1458 compressed_extents = compress_file_range(async_chunk);
1459 if (compressed_extents == 0) {
1460 btrfs_add_delayed_iput(async_chunk->inode);
1461 async_chunk->inode = NULL;
1466 * work queue call back to submit previously compressed pages
1468 static noinline void async_cow_submit(struct btrfs_work *work)
1470 struct async_chunk *async_chunk = container_of(work, struct async_chunk,
1472 struct btrfs_fs_info *fs_info = btrfs_work_owner(work);
1473 unsigned long nr_pages;
1475 nr_pages = (async_chunk->end - async_chunk->start + PAGE_SIZE) >>
1479 * ->inode could be NULL if async_chunk_start has failed to compress,
1480 * in which case we don't have anything to submit, yet we need to
1481 * always adjust ->async_delalloc_pages as its paired with the init
1482 * happening in cow_file_range_async
1484 if (async_chunk->inode)
1485 submit_compressed_extents(async_chunk);
1487 /* atomic_sub_return implies a barrier */
1488 if (atomic_sub_return(nr_pages, &fs_info->async_delalloc_pages) <
1490 cond_wake_up_nomb(&fs_info->async_submit_wait);
1493 static noinline void async_cow_free(struct btrfs_work *work)
1495 struct async_chunk *async_chunk;
1496 struct async_cow *async_cow;
1498 async_chunk = container_of(work, struct async_chunk, work);
1499 if (async_chunk->inode)
1500 btrfs_add_delayed_iput(async_chunk->inode);
1501 if (async_chunk->blkcg_css)
1502 css_put(async_chunk->blkcg_css);
1504 async_cow = async_chunk->async_cow;
1505 if (atomic_dec_and_test(&async_cow->num_chunks))
1509 static int cow_file_range_async(struct btrfs_inode *inode,
1510 struct writeback_control *wbc,
1511 struct page *locked_page,
1512 u64 start, u64 end, int *page_started,
1513 unsigned long *nr_written)
1515 struct btrfs_fs_info *fs_info = inode->root->fs_info;
1516 struct cgroup_subsys_state *blkcg_css = wbc_blkcg_css(wbc);
1517 struct async_cow *ctx;
1518 struct async_chunk *async_chunk;
1519 unsigned long nr_pages;
1521 u64 num_chunks = DIV_ROUND_UP(end - start, SZ_512K);
1523 bool should_compress;
1525 const blk_opf_t write_flags = wbc_to_write_flags(wbc);
1527 unlock_extent(&inode->io_tree, start, end, NULL);
1529 if (inode->flags & BTRFS_INODE_NOCOMPRESS &&
1530 !btrfs_test_opt(fs_info, FORCE_COMPRESS)) {
1532 should_compress = false;
1534 should_compress = true;
1537 nofs_flag = memalloc_nofs_save();
1538 ctx = kvmalloc(struct_size(ctx, chunks, num_chunks), GFP_KERNEL);
1539 memalloc_nofs_restore(nofs_flag);
1542 unsigned clear_bits = EXTENT_LOCKED | EXTENT_DELALLOC |
1543 EXTENT_DELALLOC_NEW | EXTENT_DEFRAG |
1544 EXTENT_DO_ACCOUNTING;
1545 unsigned long page_ops = PAGE_UNLOCK | PAGE_START_WRITEBACK |
1546 PAGE_END_WRITEBACK | PAGE_SET_ERROR;
1548 extent_clear_unlock_delalloc(inode, start, end, locked_page,
1549 clear_bits, page_ops);
1553 async_chunk = ctx->chunks;
1554 atomic_set(&ctx->num_chunks, num_chunks);
1556 for (i = 0; i < num_chunks; i++) {
1557 if (should_compress)
1558 cur_end = min(end, start + SZ_512K - 1);
1563 * igrab is called higher up in the call chain, take only the
1564 * lightweight reference for the callback lifetime
1566 ihold(&inode->vfs_inode);
1567 async_chunk[i].async_cow = ctx;
1568 async_chunk[i].inode = &inode->vfs_inode;
1569 async_chunk[i].start = start;
1570 async_chunk[i].end = cur_end;
1571 async_chunk[i].write_flags = write_flags;
1572 INIT_LIST_HEAD(&async_chunk[i].extents);
1575 * The locked_page comes all the way from writepage and its
1576 * the original page we were actually given. As we spread
1577 * this large delalloc region across multiple async_chunk
1578 * structs, only the first struct needs a pointer to locked_page
1580 * This way we don't need racey decisions about who is supposed
1585 * Depending on the compressibility, the pages might or
1586 * might not go through async. We want all of them to
1587 * be accounted against wbc once. Let's do it here
1588 * before the paths diverge. wbc accounting is used
1589 * only for foreign writeback detection and doesn't
1590 * need full accuracy. Just account the whole thing
1591 * against the first page.
1593 wbc_account_cgroup_owner(wbc, locked_page,
1595 async_chunk[i].locked_page = locked_page;
1598 async_chunk[i].locked_page = NULL;
1601 if (blkcg_css != blkcg_root_css) {
1603 async_chunk[i].blkcg_css = blkcg_css;
1605 async_chunk[i].blkcg_css = NULL;
1608 btrfs_init_work(&async_chunk[i].work, async_cow_start,
1609 async_cow_submit, async_cow_free);
1611 nr_pages = DIV_ROUND_UP(cur_end - start, PAGE_SIZE);
1612 atomic_add(nr_pages, &fs_info->async_delalloc_pages);
1614 btrfs_queue_work(fs_info->delalloc_workers, &async_chunk[i].work);
1616 *nr_written += nr_pages;
1617 start = cur_end + 1;
1623 static noinline int run_delalloc_zoned(struct btrfs_inode *inode,
1624 struct page *locked_page, u64 start,
1625 u64 end, int *page_started,
1626 unsigned long *nr_written)
1628 u64 done_offset = end;
1630 bool locked_page_done = false;
1632 while (start <= end) {
1633 ret = cow_file_range(inode, locked_page, start, end, page_started,
1634 nr_written, 0, &done_offset);
1635 if (ret && ret != -EAGAIN)
1638 if (*page_started) {
1646 if (done_offset == start) {
1647 wait_on_bit_io(&inode->root->fs_info->flags,
1648 BTRFS_FS_NEED_ZONE_FINISH,
1649 TASK_UNINTERRUPTIBLE);
1653 if (!locked_page_done) {
1654 __set_page_dirty_nobuffers(locked_page);
1655 account_page_redirty(locked_page);
1657 locked_page_done = true;
1658 extent_write_locked_range(&inode->vfs_inode, start, done_offset);
1660 start = done_offset + 1;
1668 static noinline int csum_exist_in_range(struct btrfs_fs_info *fs_info,
1669 u64 bytenr, u64 num_bytes, bool nowait)
1671 struct btrfs_root *csum_root = btrfs_csum_root(fs_info, bytenr);
1672 struct btrfs_ordered_sum *sums;
1676 ret = btrfs_lookup_csums_range(csum_root, bytenr,
1677 bytenr + num_bytes - 1, &list, 0,
1679 if (ret == 0 && list_empty(&list))
1682 while (!list_empty(&list)) {
1683 sums = list_entry(list.next, struct btrfs_ordered_sum, list);
1684 list_del(&sums->list);
1692 static int fallback_to_cow(struct btrfs_inode *inode, struct page *locked_page,
1693 const u64 start, const u64 end,
1694 int *page_started, unsigned long *nr_written)
1696 const bool is_space_ino = btrfs_is_free_space_inode(inode);
1697 const bool is_reloc_ino = btrfs_is_data_reloc_root(inode->root);
1698 const u64 range_bytes = end + 1 - start;
1699 struct extent_io_tree *io_tree = &inode->io_tree;
1700 u64 range_start = start;
1704 * If EXTENT_NORESERVE is set it means that when the buffered write was
1705 * made we had not enough available data space and therefore we did not
1706 * reserve data space for it, since we though we could do NOCOW for the
1707 * respective file range (either there is prealloc extent or the inode
1708 * has the NOCOW bit set).
1710 * However when we need to fallback to COW mode (because for example the
1711 * block group for the corresponding extent was turned to RO mode by a
1712 * scrub or relocation) we need to do the following:
1714 * 1) We increment the bytes_may_use counter of the data space info.
1715 * If COW succeeds, it allocates a new data extent and after doing
1716 * that it decrements the space info's bytes_may_use counter and
1717 * increments its bytes_reserved counter by the same amount (we do
1718 * this at btrfs_add_reserved_bytes()). So we need to increment the
1719 * bytes_may_use counter to compensate (when space is reserved at
1720 * buffered write time, the bytes_may_use counter is incremented);
1722 * 2) We clear the EXTENT_NORESERVE bit from the range. We do this so
1723 * that if the COW path fails for any reason, it decrements (through
1724 * extent_clear_unlock_delalloc()) the bytes_may_use counter of the
1725 * data space info, which we incremented in the step above.
1727 * If we need to fallback to cow and the inode corresponds to a free
1728 * space cache inode or an inode of the data relocation tree, we must
1729 * also increment bytes_may_use of the data space_info for the same
1730 * reason. Space caches and relocated data extents always get a prealloc
1731 * extent for them, however scrub or balance may have set the block
1732 * group that contains that extent to RO mode and therefore force COW
1733 * when starting writeback.
1735 count = count_range_bits(io_tree, &range_start, end, range_bytes,
1736 EXTENT_NORESERVE, 0);
1737 if (count > 0 || is_space_ino || is_reloc_ino) {
1739 struct btrfs_fs_info *fs_info = inode->root->fs_info;
1740 struct btrfs_space_info *sinfo = fs_info->data_sinfo;
1742 if (is_space_ino || is_reloc_ino)
1743 bytes = range_bytes;
1745 spin_lock(&sinfo->lock);
1746 btrfs_space_info_update_bytes_may_use(fs_info, sinfo, bytes);
1747 spin_unlock(&sinfo->lock);
1750 clear_extent_bit(io_tree, start, end, EXTENT_NORESERVE,
1754 return cow_file_range(inode, locked_page, start, end, page_started,
1755 nr_written, 1, NULL);
1758 struct can_nocow_file_extent_args {
1761 /* Start file offset of the range we want to NOCOW. */
1763 /* End file offset (inclusive) of the range we want to NOCOW. */
1765 bool writeback_path;
1768 * Free the path passed to can_nocow_file_extent() once it's not needed
1773 /* Output fields. Only set when can_nocow_file_extent() returns 1. */
1778 /* Number of bytes that can be written to in NOCOW mode. */
1783 * Check if we can NOCOW the file extent that the path points to.
1784 * This function may return with the path released, so the caller should check
1785 * if path->nodes[0] is NULL or not if it needs to use the path afterwards.
1787 * Returns: < 0 on error
1788 * 0 if we can not NOCOW
1791 static int can_nocow_file_extent(struct btrfs_path *path,
1792 struct btrfs_key *key,
1793 struct btrfs_inode *inode,
1794 struct can_nocow_file_extent_args *args)
1796 const bool is_freespace_inode = btrfs_is_free_space_inode(inode);
1797 struct extent_buffer *leaf = path->nodes[0];
1798 struct btrfs_root *root = inode->root;
1799 struct btrfs_file_extent_item *fi;
1804 bool nowait = path->nowait;
1806 fi = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_file_extent_item);
1807 extent_type = btrfs_file_extent_type(leaf, fi);
1809 if (extent_type == BTRFS_FILE_EXTENT_INLINE)
1812 /* Can't access these fields unless we know it's not an inline extent. */
1813 args->disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
1814 args->disk_num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi);
1815 args->extent_offset = btrfs_file_extent_offset(leaf, fi);
1817 if (!(inode->flags & BTRFS_INODE_NODATACOW) &&
1818 extent_type == BTRFS_FILE_EXTENT_REG)
1822 * If the extent was created before the generation where the last snapshot
1823 * for its subvolume was created, then this implies the extent is shared,
1824 * hence we must COW.
1826 if (!args->strict &&
1827 btrfs_file_extent_generation(leaf, fi) <=
1828 btrfs_root_last_snapshot(&root->root_item))
1831 /* An explicit hole, must COW. */
1832 if (args->disk_bytenr == 0)
1835 /* Compressed/encrypted/encoded extents must be COWed. */
1836 if (btrfs_file_extent_compression(leaf, fi) ||
1837 btrfs_file_extent_encryption(leaf, fi) ||
1838 btrfs_file_extent_other_encoding(leaf, fi))
1841 extent_end = btrfs_file_extent_end(path);
1844 * The following checks can be expensive, as they need to take other
1845 * locks and do btree or rbtree searches, so release the path to avoid
1846 * blocking other tasks for too long.
1848 btrfs_release_path(path);
1850 ret = btrfs_cross_ref_exist(root, btrfs_ino(inode),
1851 key->offset - args->extent_offset,
1852 args->disk_bytenr, false, path);
1853 WARN_ON_ONCE(ret > 0 && is_freespace_inode);
1857 if (args->free_path) {
1859 * We don't need the path anymore, plus through the
1860 * csum_exist_in_range() call below we will end up allocating
1861 * another path. So free the path to avoid unnecessary extra
1864 btrfs_free_path(path);
1868 /* If there are pending snapshots for this root, we must COW. */
1869 if (args->writeback_path && !is_freespace_inode &&
1870 atomic_read(&root->snapshot_force_cow))
1873 args->disk_bytenr += args->extent_offset;
1874 args->disk_bytenr += args->start - key->offset;
1875 args->num_bytes = min(args->end + 1, extent_end) - args->start;
1878 * Force COW if csums exist in the range. This ensures that csums for a
1879 * given extent are either valid or do not exist.
1881 ret = csum_exist_in_range(root->fs_info, args->disk_bytenr, args->num_bytes,
1883 WARN_ON_ONCE(ret > 0 && is_freespace_inode);
1889 if (args->free_path && path)
1890 btrfs_free_path(path);
1892 return ret < 0 ? ret : can_nocow;
1896 * when nowcow writeback call back. This checks for snapshots or COW copies
1897 * of the extents that exist in the file, and COWs the file as required.
1899 * If no cow copies or snapshots exist, we write directly to the existing
1902 static noinline int run_delalloc_nocow(struct btrfs_inode *inode,
1903 struct page *locked_page,
1904 const u64 start, const u64 end,
1906 unsigned long *nr_written)
1908 struct btrfs_fs_info *fs_info = inode->root->fs_info;
1909 struct btrfs_root *root = inode->root;
1910 struct btrfs_path *path;
1911 u64 cow_start = (u64)-1;
1912 u64 cur_offset = start;
1914 bool check_prev = true;
1915 u64 ino = btrfs_ino(inode);
1916 struct btrfs_block_group *bg;
1918 struct can_nocow_file_extent_args nocow_args = { 0 };
1920 path = btrfs_alloc_path();
1922 extent_clear_unlock_delalloc(inode, start, end, locked_page,
1923 EXTENT_LOCKED | EXTENT_DELALLOC |
1924 EXTENT_DO_ACCOUNTING |
1925 EXTENT_DEFRAG, PAGE_UNLOCK |
1926 PAGE_START_WRITEBACK |
1927 PAGE_END_WRITEBACK);
1931 nocow_args.end = end;
1932 nocow_args.writeback_path = true;
1935 struct btrfs_key found_key;
1936 struct btrfs_file_extent_item *fi;
1937 struct extent_buffer *leaf;
1945 ret = btrfs_lookup_file_extent(NULL, root, path, ino,
1951 * If there is no extent for our range when doing the initial
1952 * search, then go back to the previous slot as it will be the
1953 * one containing the search offset
1955 if (ret > 0 && path->slots[0] > 0 && check_prev) {
1956 leaf = path->nodes[0];
1957 btrfs_item_key_to_cpu(leaf, &found_key,
1958 path->slots[0] - 1);
1959 if (found_key.objectid == ino &&
1960 found_key.type == BTRFS_EXTENT_DATA_KEY)
1965 /* Go to next leaf if we have exhausted the current one */
1966 leaf = path->nodes[0];
1967 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
1968 ret = btrfs_next_leaf(root, path);
1970 if (cow_start != (u64)-1)
1971 cur_offset = cow_start;
1976 leaf = path->nodes[0];
1979 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
1981 /* Didn't find anything for our INO */
1982 if (found_key.objectid > ino)
1985 * Keep searching until we find an EXTENT_ITEM or there are no
1986 * more extents for this inode
1988 if (WARN_ON_ONCE(found_key.objectid < ino) ||
1989 found_key.type < BTRFS_EXTENT_DATA_KEY) {
1994 /* Found key is not EXTENT_DATA_KEY or starts after req range */
1995 if (found_key.type > BTRFS_EXTENT_DATA_KEY ||
1996 found_key.offset > end)
2000 * If the found extent starts after requested offset, then
2001 * adjust extent_end to be right before this extent begins
2003 if (found_key.offset > cur_offset) {
2004 extent_end = found_key.offset;
2010 * Found extent which begins before our range and potentially
2013 fi = btrfs_item_ptr(leaf, path->slots[0],
2014 struct btrfs_file_extent_item);
2015 extent_type = btrfs_file_extent_type(leaf, fi);
2016 /* If this is triggered then we have a memory corruption. */
2017 ASSERT(extent_type < BTRFS_NR_FILE_EXTENT_TYPES);
2018 if (WARN_ON(extent_type >= BTRFS_NR_FILE_EXTENT_TYPES)) {
2022 ram_bytes = btrfs_file_extent_ram_bytes(leaf, fi);
2023 extent_end = btrfs_file_extent_end(path);
2026 * If the extent we got ends before our current offset, skip to
2029 if (extent_end <= cur_offset) {
2034 nocow_args.start = cur_offset;
2035 ret = can_nocow_file_extent(path, &found_key, inode, &nocow_args);
2037 if (cow_start != (u64)-1)
2038 cur_offset = cow_start;
2040 } else if (ret == 0) {
2045 bg = btrfs_inc_nocow_writers(fs_info, nocow_args.disk_bytenr);
2050 * If nocow is false then record the beginning of the range
2051 * that needs to be COWed
2054 if (cow_start == (u64)-1)
2055 cow_start = cur_offset;
2056 cur_offset = extent_end;
2057 if (cur_offset > end)
2059 if (!path->nodes[0])
2066 * COW range from cow_start to found_key.offset - 1. As the key
2067 * will contain the beginning of the first extent that can be
2068 * NOCOW, following one which needs to be COW'ed
2070 if (cow_start != (u64)-1) {
2071 ret = fallback_to_cow(inode, locked_page,
2072 cow_start, found_key.offset - 1,
2073 page_started, nr_written);
2076 cow_start = (u64)-1;
2079 nocow_end = cur_offset + nocow_args.num_bytes - 1;
2081 if (extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
2082 u64 orig_start = found_key.offset - nocow_args.extent_offset;
2083 struct extent_map *em;
2085 em = create_io_em(inode, cur_offset, nocow_args.num_bytes,
2087 nocow_args.disk_bytenr, /* block_start */
2088 nocow_args.num_bytes, /* block_len */
2089 nocow_args.disk_num_bytes, /* orig_block_len */
2090 ram_bytes, BTRFS_COMPRESS_NONE,
2091 BTRFS_ORDERED_PREALLOC);
2096 free_extent_map(em);
2097 ret = btrfs_add_ordered_extent(inode,
2098 cur_offset, nocow_args.num_bytes,
2099 nocow_args.num_bytes,
2100 nocow_args.disk_bytenr,
2101 nocow_args.num_bytes, 0,
2102 1 << BTRFS_ORDERED_PREALLOC,
2103 BTRFS_COMPRESS_NONE);
2105 btrfs_drop_extent_map_range(inode, cur_offset,
2110 ret = btrfs_add_ordered_extent(inode, cur_offset,
2111 nocow_args.num_bytes,
2112 nocow_args.num_bytes,
2113 nocow_args.disk_bytenr,
2114 nocow_args.num_bytes,
2116 1 << BTRFS_ORDERED_NOCOW,
2117 BTRFS_COMPRESS_NONE);
2123 btrfs_dec_nocow_writers(bg);
2127 if (btrfs_is_data_reloc_root(root))
2129 * Error handled later, as we must prevent
2130 * extent_clear_unlock_delalloc() in error handler
2131 * from freeing metadata of created ordered extent.
2133 ret = btrfs_reloc_clone_csums(inode, cur_offset,
2134 nocow_args.num_bytes);
2136 extent_clear_unlock_delalloc(inode, cur_offset, nocow_end,
2137 locked_page, EXTENT_LOCKED |
2139 EXTENT_CLEAR_DATA_RESV,
2140 PAGE_UNLOCK | PAGE_SET_ORDERED);
2142 cur_offset = extent_end;
2145 * btrfs_reloc_clone_csums() error, now we're OK to call error
2146 * handler, as metadata for created ordered extent will only
2147 * be freed by btrfs_finish_ordered_io().
2151 if (cur_offset > end)
2154 btrfs_release_path(path);
2156 if (cur_offset <= end && cow_start == (u64)-1)
2157 cow_start = cur_offset;
2159 if (cow_start != (u64)-1) {
2161 ret = fallback_to_cow(inode, locked_page, cow_start, end,
2162 page_started, nr_written);
2169 btrfs_dec_nocow_writers(bg);
2171 if (ret && cur_offset < end)
2172 extent_clear_unlock_delalloc(inode, cur_offset, end,
2173 locked_page, EXTENT_LOCKED |
2174 EXTENT_DELALLOC | EXTENT_DEFRAG |
2175 EXTENT_DO_ACCOUNTING, PAGE_UNLOCK |
2176 PAGE_START_WRITEBACK |
2177 PAGE_END_WRITEBACK);
2178 btrfs_free_path(path);
2182 static bool should_nocow(struct btrfs_inode *inode, u64 start, u64 end)
2184 if (inode->flags & (BTRFS_INODE_NODATACOW | BTRFS_INODE_PREALLOC)) {
2185 if (inode->defrag_bytes &&
2186 test_range_bit(&inode->io_tree, start, end, EXTENT_DEFRAG,
2195 * Function to process delayed allocation (create CoW) for ranges which are
2196 * being touched for the first time.
2198 int btrfs_run_delalloc_range(struct btrfs_inode *inode, struct page *locked_page,
2199 u64 start, u64 end, int *page_started, unsigned long *nr_written,
2200 struct writeback_control *wbc)
2203 const bool zoned = btrfs_is_zoned(inode->root->fs_info);
2206 * The range must cover part of the @locked_page, or the returned
2207 * @page_started can confuse the caller.
2209 ASSERT(!(end <= page_offset(locked_page) ||
2210 start >= page_offset(locked_page) + PAGE_SIZE));
2212 if (should_nocow(inode, start, end)) {
2214 * Normally on a zoned device we're only doing COW writes, but
2215 * in case of relocation on a zoned filesystem we have taken
2216 * precaution, that we're only writing sequentially. It's safe
2217 * to use run_delalloc_nocow() here, like for regular
2218 * preallocated inodes.
2220 ASSERT(!zoned || btrfs_is_data_reloc_root(inode->root));
2221 ret = run_delalloc_nocow(inode, locked_page, start, end,
2222 page_started, nr_written);
2223 } else if (!btrfs_inode_can_compress(inode) ||
2224 !inode_need_compress(inode, start, end)) {
2226 ret = run_delalloc_zoned(inode, locked_page, start, end,
2227 page_started, nr_written);
2229 ret = cow_file_range(inode, locked_page, start, end,
2230 page_started, nr_written, 1, NULL);
2232 set_bit(BTRFS_INODE_HAS_ASYNC_EXTENT, &inode->runtime_flags);
2233 ret = cow_file_range_async(inode, wbc, locked_page, start, end,
2234 page_started, nr_written);
2238 btrfs_cleanup_ordered_extents(inode, locked_page, start,
2243 void btrfs_split_delalloc_extent(struct inode *inode,
2244 struct extent_state *orig, u64 split)
2246 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
2249 /* not delalloc, ignore it */
2250 if (!(orig->state & EXTENT_DELALLOC))
2253 size = orig->end - orig->start + 1;
2254 if (size > fs_info->max_extent_size) {
2259 * See the explanation in btrfs_merge_delalloc_extent, the same
2260 * applies here, just in reverse.
2262 new_size = orig->end - split + 1;
2263 num_extents = count_max_extents(fs_info, new_size);
2264 new_size = split - orig->start;
2265 num_extents += count_max_extents(fs_info, new_size);
2266 if (count_max_extents(fs_info, size) >= num_extents)
2270 spin_lock(&BTRFS_I(inode)->lock);
2271 btrfs_mod_outstanding_extents(BTRFS_I(inode), 1);
2272 spin_unlock(&BTRFS_I(inode)->lock);
2276 * Handle merged delayed allocation extents so we can keep track of new extents
2277 * that are just merged onto old extents, such as when we are doing sequential
2278 * writes, so we can properly account for the metadata space we'll need.
2280 void btrfs_merge_delalloc_extent(struct inode *inode, struct extent_state *new,
2281 struct extent_state *other)
2283 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
2284 u64 new_size, old_size;
2287 /* not delalloc, ignore it */
2288 if (!(other->state & EXTENT_DELALLOC))
2291 if (new->start > other->start)
2292 new_size = new->end - other->start + 1;
2294 new_size = other->end - new->start + 1;
2296 /* we're not bigger than the max, unreserve the space and go */
2297 if (new_size <= fs_info->max_extent_size) {
2298 spin_lock(&BTRFS_I(inode)->lock);
2299 btrfs_mod_outstanding_extents(BTRFS_I(inode), -1);
2300 spin_unlock(&BTRFS_I(inode)->lock);
2305 * We have to add up either side to figure out how many extents were
2306 * accounted for before we merged into one big extent. If the number of
2307 * extents we accounted for is <= the amount we need for the new range
2308 * then we can return, otherwise drop. Think of it like this
2312 * So we've grown the extent by a MAX_SIZE extent, this would mean we
2313 * need 2 outstanding extents, on one side we have 1 and the other side
2314 * we have 1 so they are == and we can return. But in this case
2316 * [MAX_SIZE+4k][MAX_SIZE+4k]
2318 * Each range on their own accounts for 2 extents, but merged together
2319 * they are only 3 extents worth of accounting, so we need to drop in
2322 old_size = other->end - other->start + 1;
2323 num_extents = count_max_extents(fs_info, old_size);
2324 old_size = new->end - new->start + 1;
2325 num_extents += count_max_extents(fs_info, old_size);
2326 if (count_max_extents(fs_info, new_size) >= num_extents)
2329 spin_lock(&BTRFS_I(inode)->lock);
2330 btrfs_mod_outstanding_extents(BTRFS_I(inode), -1);
2331 spin_unlock(&BTRFS_I(inode)->lock);
2334 static void btrfs_add_delalloc_inodes(struct btrfs_root *root,
2335 struct inode *inode)
2337 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
2339 spin_lock(&root->delalloc_lock);
2340 if (list_empty(&BTRFS_I(inode)->delalloc_inodes)) {
2341 list_add_tail(&BTRFS_I(inode)->delalloc_inodes,
2342 &root->delalloc_inodes);
2343 set_bit(BTRFS_INODE_IN_DELALLOC_LIST,
2344 &BTRFS_I(inode)->runtime_flags);
2345 root->nr_delalloc_inodes++;
2346 if (root->nr_delalloc_inodes == 1) {
2347 spin_lock(&fs_info->delalloc_root_lock);
2348 BUG_ON(!list_empty(&root->delalloc_root));
2349 list_add_tail(&root->delalloc_root,
2350 &fs_info->delalloc_roots);
2351 spin_unlock(&fs_info->delalloc_root_lock);
2354 spin_unlock(&root->delalloc_lock);
2358 void __btrfs_del_delalloc_inode(struct btrfs_root *root,
2359 struct btrfs_inode *inode)
2361 struct btrfs_fs_info *fs_info = root->fs_info;
2363 if (!list_empty(&inode->delalloc_inodes)) {
2364 list_del_init(&inode->delalloc_inodes);
2365 clear_bit(BTRFS_INODE_IN_DELALLOC_LIST,
2366 &inode->runtime_flags);
2367 root->nr_delalloc_inodes--;
2368 if (!root->nr_delalloc_inodes) {
2369 ASSERT(list_empty(&root->delalloc_inodes));
2370 spin_lock(&fs_info->delalloc_root_lock);
2371 BUG_ON(list_empty(&root->delalloc_root));
2372 list_del_init(&root->delalloc_root);
2373 spin_unlock(&fs_info->delalloc_root_lock);
2378 static void btrfs_del_delalloc_inode(struct btrfs_root *root,
2379 struct btrfs_inode *inode)
2381 spin_lock(&root->delalloc_lock);
2382 __btrfs_del_delalloc_inode(root, inode);
2383 spin_unlock(&root->delalloc_lock);
2387 * Properly track delayed allocation bytes in the inode and to maintain the
2388 * list of inodes that have pending delalloc work to be done.
2390 void btrfs_set_delalloc_extent(struct inode *inode, struct extent_state *state,
2393 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
2395 if ((bits & EXTENT_DEFRAG) && !(bits & EXTENT_DELALLOC))
2398 * set_bit and clear bit hooks normally require _irqsave/restore
2399 * but in this case, we are only testing for the DELALLOC
2400 * bit, which is only set or cleared with irqs on
2402 if (!(state->state & EXTENT_DELALLOC) && (bits & EXTENT_DELALLOC)) {
2403 struct btrfs_root *root = BTRFS_I(inode)->root;
2404 u64 len = state->end + 1 - state->start;
2405 u32 num_extents = count_max_extents(fs_info, len);
2406 bool do_list = !btrfs_is_free_space_inode(BTRFS_I(inode));
2408 spin_lock(&BTRFS_I(inode)->lock);
2409 btrfs_mod_outstanding_extents(BTRFS_I(inode), num_extents);
2410 spin_unlock(&BTRFS_I(inode)->lock);
2412 /* For sanity tests */
2413 if (btrfs_is_testing(fs_info))
2416 percpu_counter_add_batch(&fs_info->delalloc_bytes, len,
2417 fs_info->delalloc_batch);
2418 spin_lock(&BTRFS_I(inode)->lock);
2419 BTRFS_I(inode)->delalloc_bytes += len;
2420 if (bits & EXTENT_DEFRAG)
2421 BTRFS_I(inode)->defrag_bytes += len;
2422 if (do_list && !test_bit(BTRFS_INODE_IN_DELALLOC_LIST,
2423 &BTRFS_I(inode)->runtime_flags))
2424 btrfs_add_delalloc_inodes(root, inode);
2425 spin_unlock(&BTRFS_I(inode)->lock);
2428 if (!(state->state & EXTENT_DELALLOC_NEW) &&
2429 (bits & EXTENT_DELALLOC_NEW)) {
2430 spin_lock(&BTRFS_I(inode)->lock);
2431 BTRFS_I(inode)->new_delalloc_bytes += state->end + 1 -
2433 spin_unlock(&BTRFS_I(inode)->lock);
2438 * Once a range is no longer delalloc this function ensures that proper
2439 * accounting happens.
2441 void btrfs_clear_delalloc_extent(struct inode *vfs_inode,
2442 struct extent_state *state, u32 bits)
2444 struct btrfs_inode *inode = BTRFS_I(vfs_inode);
2445 struct btrfs_fs_info *fs_info = btrfs_sb(vfs_inode->i_sb);
2446 u64 len = state->end + 1 - state->start;
2447 u32 num_extents = count_max_extents(fs_info, len);
2449 if ((state->state & EXTENT_DEFRAG) && (bits & EXTENT_DEFRAG)) {
2450 spin_lock(&inode->lock);
2451 inode->defrag_bytes -= len;
2452 spin_unlock(&inode->lock);
2456 * set_bit and clear bit hooks normally require _irqsave/restore
2457 * but in this case, we are only testing for the DELALLOC
2458 * bit, which is only set or cleared with irqs on
2460 if ((state->state & EXTENT_DELALLOC) && (bits & EXTENT_DELALLOC)) {
2461 struct btrfs_root *root = inode->root;
2462 bool do_list = !btrfs_is_free_space_inode(inode);
2464 spin_lock(&inode->lock);
2465 btrfs_mod_outstanding_extents(inode, -num_extents);
2466 spin_unlock(&inode->lock);
2469 * We don't reserve metadata space for space cache inodes so we
2470 * don't need to call delalloc_release_metadata if there is an
2473 if (bits & EXTENT_CLEAR_META_RESV &&
2474 root != fs_info->tree_root)
2475 btrfs_delalloc_release_metadata(inode, len, false);
2477 /* For sanity tests. */
2478 if (btrfs_is_testing(fs_info))
2481 if (!btrfs_is_data_reloc_root(root) &&
2482 do_list && !(state->state & EXTENT_NORESERVE) &&
2483 (bits & EXTENT_CLEAR_DATA_RESV))
2484 btrfs_free_reserved_data_space_noquota(fs_info, len);
2486 percpu_counter_add_batch(&fs_info->delalloc_bytes, -len,
2487 fs_info->delalloc_batch);
2488 spin_lock(&inode->lock);
2489 inode->delalloc_bytes -= len;
2490 if (do_list && inode->delalloc_bytes == 0 &&
2491 test_bit(BTRFS_INODE_IN_DELALLOC_LIST,
2492 &inode->runtime_flags))
2493 btrfs_del_delalloc_inode(root, inode);
2494 spin_unlock(&inode->lock);
2497 if ((state->state & EXTENT_DELALLOC_NEW) &&
2498 (bits & EXTENT_DELALLOC_NEW)) {
2499 spin_lock(&inode->lock);
2500 ASSERT(inode->new_delalloc_bytes >= len);
2501 inode->new_delalloc_bytes -= len;
2502 if (bits & EXTENT_ADD_INODE_BYTES)
2503 inode_add_bytes(&inode->vfs_inode, len);
2504 spin_unlock(&inode->lock);
2509 * in order to insert checksums into the metadata in large chunks,
2510 * we wait until bio submission time. All the pages in the bio are
2511 * checksummed and sums are attached onto the ordered extent record.
2513 * At IO completion time the cums attached on the ordered extent record
2514 * are inserted into the btree
2516 static blk_status_t btrfs_submit_bio_start(struct inode *inode, struct bio *bio,
2517 u64 dio_file_offset)
2519 return btrfs_csum_one_bio(BTRFS_I(inode), bio, (u64)-1, false);
2523 * Split an extent_map at [start, start + len]
2525 * This function is intended to be used only for extract_ordered_extent().
2527 static int split_zoned_em(struct btrfs_inode *inode, u64 start, u64 len,
2530 struct extent_map_tree *em_tree = &inode->extent_tree;
2531 struct extent_map *em;
2532 struct extent_map *split_pre = NULL;
2533 struct extent_map *split_mid = NULL;
2534 struct extent_map *split_post = NULL;
2536 unsigned long flags;
2539 if (pre == 0 && post == 0)
2542 split_pre = alloc_extent_map();
2544 split_mid = alloc_extent_map();
2546 split_post = alloc_extent_map();
2547 if (!split_pre || (pre && !split_mid) || (post && !split_post)) {
2552 ASSERT(pre + post < len);
2554 lock_extent(&inode->io_tree, start, start + len - 1, NULL);
2555 write_lock(&em_tree->lock);
2556 em = lookup_extent_mapping(em_tree, start, len);
2562 ASSERT(em->len == len);
2563 ASSERT(!test_bit(EXTENT_FLAG_COMPRESSED, &em->flags));
2564 ASSERT(em->block_start < EXTENT_MAP_LAST_BYTE);
2565 ASSERT(test_bit(EXTENT_FLAG_PINNED, &em->flags));
2566 ASSERT(!test_bit(EXTENT_FLAG_LOGGING, &em->flags));
2567 ASSERT(!list_empty(&em->list));
2570 clear_bit(EXTENT_FLAG_PINNED, &em->flags);
2572 /* First, replace the em with a new extent_map starting from * em->start */
2573 split_pre->start = em->start;
2574 split_pre->len = (pre ? pre : em->len - post);
2575 split_pre->orig_start = split_pre->start;
2576 split_pre->block_start = em->block_start;
2577 split_pre->block_len = split_pre->len;
2578 split_pre->orig_block_len = split_pre->block_len;
2579 split_pre->ram_bytes = split_pre->len;
2580 split_pre->flags = flags;
2581 split_pre->compress_type = em->compress_type;
2582 split_pre->generation = em->generation;
2584 replace_extent_mapping(em_tree, em, split_pre, 1);
2587 * Now we only have an extent_map at:
2588 * [em->start, em->start + pre] if pre != 0
2589 * [em->start, em->start + em->len - post] if pre == 0
2593 /* Insert the middle extent_map */
2594 split_mid->start = em->start + pre;
2595 split_mid->len = em->len - pre - post;
2596 split_mid->orig_start = split_mid->start;
2597 split_mid->block_start = em->block_start + pre;
2598 split_mid->block_len = split_mid->len;
2599 split_mid->orig_block_len = split_mid->block_len;
2600 split_mid->ram_bytes = split_mid->len;
2601 split_mid->flags = flags;
2602 split_mid->compress_type = em->compress_type;
2603 split_mid->generation = em->generation;
2604 add_extent_mapping(em_tree, split_mid, 1);
2608 split_post->start = em->start + em->len - post;
2609 split_post->len = post;
2610 split_post->orig_start = split_post->start;
2611 split_post->block_start = em->block_start + em->len - post;
2612 split_post->block_len = split_post->len;
2613 split_post->orig_block_len = split_post->block_len;
2614 split_post->ram_bytes = split_post->len;
2615 split_post->flags = flags;
2616 split_post->compress_type = em->compress_type;
2617 split_post->generation = em->generation;
2618 add_extent_mapping(em_tree, split_post, 1);
2622 free_extent_map(em);
2623 /* Once for the tree */
2624 free_extent_map(em);
2627 write_unlock(&em_tree->lock);
2628 unlock_extent(&inode->io_tree, start, start + len - 1, NULL);
2630 free_extent_map(split_pre);
2631 free_extent_map(split_mid);
2632 free_extent_map(split_post);
2637 static blk_status_t extract_ordered_extent(struct btrfs_inode *inode,
2638 struct bio *bio, loff_t file_offset)
2640 struct btrfs_ordered_extent *ordered;
2641 u64 start = (u64)bio->bi_iter.bi_sector << SECTOR_SHIFT;
2643 u64 len = bio->bi_iter.bi_size;
2644 u64 end = start + len;
2649 ordered = btrfs_lookup_ordered_extent(inode, file_offset);
2650 if (WARN_ON_ONCE(!ordered))
2651 return BLK_STS_IOERR;
2653 /* No need to split */
2654 if (ordered->disk_num_bytes == len)
2657 /* We cannot split once end_bio'd ordered extent */
2658 if (WARN_ON_ONCE(ordered->bytes_left != ordered->disk_num_bytes)) {
2663 /* We cannot split a compressed ordered extent */
2664 if (WARN_ON_ONCE(ordered->disk_num_bytes != ordered->num_bytes)) {
2669 ordered_end = ordered->disk_bytenr + ordered->disk_num_bytes;
2670 /* bio must be in one ordered extent */
2671 if (WARN_ON_ONCE(start < ordered->disk_bytenr || end > ordered_end)) {
2676 /* Checksum list should be empty */
2677 if (WARN_ON_ONCE(!list_empty(&ordered->list))) {
2682 file_len = ordered->num_bytes;
2683 pre = start - ordered->disk_bytenr;
2684 post = ordered_end - end;
2686 ret = btrfs_split_ordered_extent(ordered, pre, post);
2689 ret = split_zoned_em(inode, file_offset, file_len, pre, post);
2692 btrfs_put_ordered_extent(ordered);
2694 return errno_to_blk_status(ret);
2697 void btrfs_submit_data_write_bio(struct inode *inode, struct bio *bio, int mirror_num)
2699 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
2700 struct btrfs_inode *bi = BTRFS_I(inode);
2703 if (bio_op(bio) == REQ_OP_ZONE_APPEND) {
2704 ret = extract_ordered_extent(bi, bio,
2705 page_offset(bio_first_bvec_all(bio)->bv_page));
2707 btrfs_bio_end_io(btrfs_bio(bio), ret);
2713 * If we need to checksum, and the I/O is not issued by fsync and
2714 * friends, that is ->sync_writers != 0, defer the submission to a
2715 * workqueue to parallelize it.
2717 * Csum items for reloc roots have already been cloned at this point,
2718 * so they are handled as part of the no-checksum case.
2720 if (!(bi->flags & BTRFS_INODE_NODATASUM) &&
2721 !test_bit(BTRFS_FS_STATE_NO_CSUMS, &fs_info->fs_state) &&
2722 !btrfs_is_data_reloc_root(bi->root)) {
2723 if (!atomic_read(&bi->sync_writers) &&
2724 btrfs_wq_submit_bio(inode, bio, mirror_num, 0,
2725 btrfs_submit_bio_start))
2728 ret = btrfs_csum_one_bio(bi, bio, (u64)-1, false);
2730 btrfs_bio_end_io(btrfs_bio(bio), ret);
2734 btrfs_submit_bio(fs_info, bio, mirror_num);
2737 void btrfs_submit_data_read_bio(struct inode *inode, struct bio *bio,
2738 int mirror_num, enum btrfs_compression_type compress_type)
2740 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
2743 if (compress_type != BTRFS_COMPRESS_NONE) {
2745 * btrfs_submit_compressed_read will handle completing the bio
2746 * if there were any errors, so just return here.
2748 btrfs_submit_compressed_read(inode, bio, mirror_num);
2752 /* Save the original iter for read repair */
2753 btrfs_bio(bio)->iter = bio->bi_iter;
2756 * Lookup bio sums does extra checks around whether we need to csum or
2757 * not, which is why we ignore skip_sum here.
2759 ret = btrfs_lookup_bio_sums(inode, bio, NULL);
2761 btrfs_bio_end_io(btrfs_bio(bio), ret);
2765 btrfs_submit_bio(fs_info, bio, mirror_num);
2769 * given a list of ordered sums record them in the inode. This happens
2770 * at IO completion time based on sums calculated at bio submission time.
2772 static int add_pending_csums(struct btrfs_trans_handle *trans,
2773 struct list_head *list)
2775 struct btrfs_ordered_sum *sum;
2776 struct btrfs_root *csum_root = NULL;
2779 list_for_each_entry(sum, list, list) {
2780 trans->adding_csums = true;
2782 csum_root = btrfs_csum_root(trans->fs_info,
2784 ret = btrfs_csum_file_blocks(trans, csum_root, sum);
2785 trans->adding_csums = false;
2792 static int btrfs_find_new_delalloc_bytes(struct btrfs_inode *inode,
2795 struct extent_state **cached_state)
2797 u64 search_start = start;
2798 const u64 end = start + len - 1;
2800 while (search_start < end) {
2801 const u64 search_len = end - search_start + 1;
2802 struct extent_map *em;
2806 em = btrfs_get_extent(inode, NULL, 0, search_start, search_len);
2810 if (em->block_start != EXTENT_MAP_HOLE)
2814 if (em->start < search_start)
2815 em_len -= search_start - em->start;
2816 if (em_len > search_len)
2817 em_len = search_len;
2819 ret = set_extent_bit(&inode->io_tree, search_start,
2820 search_start + em_len - 1,
2821 EXTENT_DELALLOC_NEW, cached_state,
2824 search_start = extent_map_end(em);
2825 free_extent_map(em);
2832 int btrfs_set_extent_delalloc(struct btrfs_inode *inode, u64 start, u64 end,
2833 unsigned int extra_bits,
2834 struct extent_state **cached_state)
2836 WARN_ON(PAGE_ALIGNED(end));
2838 if (start >= i_size_read(&inode->vfs_inode) &&
2839 !(inode->flags & BTRFS_INODE_PREALLOC)) {
2841 * There can't be any extents following eof in this case so just
2842 * set the delalloc new bit for the range directly.
2844 extra_bits |= EXTENT_DELALLOC_NEW;
2848 ret = btrfs_find_new_delalloc_bytes(inode, start,
2855 return set_extent_delalloc(&inode->io_tree, start, end, extra_bits,
2859 /* see btrfs_writepage_start_hook for details on why this is required */
2860 struct btrfs_writepage_fixup {
2862 struct inode *inode;
2863 struct btrfs_work work;
2866 static void btrfs_writepage_fixup_worker(struct btrfs_work *work)
2868 struct btrfs_writepage_fixup *fixup;
2869 struct btrfs_ordered_extent *ordered;
2870 struct extent_state *cached_state = NULL;
2871 struct extent_changeset *data_reserved = NULL;
2873 struct btrfs_inode *inode;
2877 bool free_delalloc_space = true;
2879 fixup = container_of(work, struct btrfs_writepage_fixup, work);
2881 inode = BTRFS_I(fixup->inode);
2882 page_start = page_offset(page);
2883 page_end = page_offset(page) + PAGE_SIZE - 1;
2886 * This is similar to page_mkwrite, we need to reserve the space before
2887 * we take the page lock.
2889 ret = btrfs_delalloc_reserve_space(inode, &data_reserved, page_start,
2895 * Before we queued this fixup, we took a reference on the page.
2896 * page->mapping may go NULL, but it shouldn't be moved to a different
2899 if (!page->mapping || !PageDirty(page) || !PageChecked(page)) {
2901 * Unfortunately this is a little tricky, either
2903 * 1) We got here and our page had already been dealt with and
2904 * we reserved our space, thus ret == 0, so we need to just
2905 * drop our space reservation and bail. This can happen the
2906 * first time we come into the fixup worker, or could happen
2907 * while waiting for the ordered extent.
2908 * 2) Our page was already dealt with, but we happened to get an
2909 * ENOSPC above from the btrfs_delalloc_reserve_space. In
2910 * this case we obviously don't have anything to release, but
2911 * because the page was already dealt with we don't want to
2912 * mark the page with an error, so make sure we're resetting
2913 * ret to 0. This is why we have this check _before_ the ret
2914 * check, because we do not want to have a surprise ENOSPC
2915 * when the page was already properly dealt with.
2918 btrfs_delalloc_release_extents(inode, PAGE_SIZE);
2919 btrfs_delalloc_release_space(inode, data_reserved,
2920 page_start, PAGE_SIZE,
2928 * We can't mess with the page state unless it is locked, so now that
2929 * it is locked bail if we failed to make our space reservation.
2934 lock_extent(&inode->io_tree, page_start, page_end, &cached_state);
2936 /* already ordered? We're done */
2937 if (PageOrdered(page))
2940 ordered = btrfs_lookup_ordered_range(inode, page_start, PAGE_SIZE);
2942 unlock_extent(&inode->io_tree, page_start, page_end,
2945 btrfs_start_ordered_extent(ordered, 1);
2946 btrfs_put_ordered_extent(ordered);
2950 ret = btrfs_set_extent_delalloc(inode, page_start, page_end, 0,
2956 * Everything went as planned, we're now the owner of a dirty page with
2957 * delayed allocation bits set and space reserved for our COW
2960 * The page was dirty when we started, nothing should have cleaned it.
2962 BUG_ON(!PageDirty(page));
2963 free_delalloc_space = false;
2965 btrfs_delalloc_release_extents(inode, PAGE_SIZE);
2966 if (free_delalloc_space)
2967 btrfs_delalloc_release_space(inode, data_reserved, page_start,
2969 unlock_extent(&inode->io_tree, page_start, page_end, &cached_state);
2973 * We hit ENOSPC or other errors. Update the mapping and page
2974 * to reflect the errors and clean the page.
2976 mapping_set_error(page->mapping, ret);
2977 end_extent_writepage(page, ret, page_start, page_end);
2978 clear_page_dirty_for_io(page);
2981 btrfs_page_clear_checked(inode->root->fs_info, page, page_start, PAGE_SIZE);
2985 extent_changeset_free(data_reserved);
2987 * As a precaution, do a delayed iput in case it would be the last iput
2988 * that could need flushing space. Recursing back to fixup worker would
2991 btrfs_add_delayed_iput(&inode->vfs_inode);
2995 * There are a few paths in the higher layers of the kernel that directly
2996 * set the page dirty bit without asking the filesystem if it is a
2997 * good idea. This causes problems because we want to make sure COW
2998 * properly happens and the data=ordered rules are followed.
3000 * In our case any range that doesn't have the ORDERED bit set
3001 * hasn't been properly setup for IO. We kick off an async process
3002 * to fix it up. The async helper will wait for ordered extents, set
3003 * the delalloc bit and make it safe to write the page.
3005 int btrfs_writepage_cow_fixup(struct page *page)
3007 struct inode *inode = page->mapping->host;
3008 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
3009 struct btrfs_writepage_fixup *fixup;
3011 /* This page has ordered extent covering it already */
3012 if (PageOrdered(page))
3016 * PageChecked is set below when we create a fixup worker for this page,
3017 * don't try to create another one if we're already PageChecked()
3019 * The extent_io writepage code will redirty the page if we send back
3022 if (PageChecked(page))
3025 fixup = kzalloc(sizeof(*fixup), GFP_NOFS);
3030 * We are already holding a reference to this inode from
3031 * write_cache_pages. We need to hold it because the space reservation
3032 * takes place outside of the page lock, and we can't trust
3033 * page->mapping outside of the page lock.
3036 btrfs_page_set_checked(fs_info, page, page_offset(page), PAGE_SIZE);
3038 btrfs_init_work(&fixup->work, btrfs_writepage_fixup_worker, NULL, NULL);
3040 fixup->inode = inode;
3041 btrfs_queue_work(fs_info->fixup_workers, &fixup->work);
3046 static int insert_reserved_file_extent(struct btrfs_trans_handle *trans,
3047 struct btrfs_inode *inode, u64 file_pos,
3048 struct btrfs_file_extent_item *stack_fi,
3049 const bool update_inode_bytes,
3050 u64 qgroup_reserved)
3052 struct btrfs_root *root = inode->root;
3053 const u64 sectorsize = root->fs_info->sectorsize;
3054 struct btrfs_path *path;
3055 struct extent_buffer *leaf;
3056 struct btrfs_key ins;
3057 u64 disk_num_bytes = btrfs_stack_file_extent_disk_num_bytes(stack_fi);
3058 u64 disk_bytenr = btrfs_stack_file_extent_disk_bytenr(stack_fi);
3059 u64 offset = btrfs_stack_file_extent_offset(stack_fi);
3060 u64 num_bytes = btrfs_stack_file_extent_num_bytes(stack_fi);
3061 u64 ram_bytes = btrfs_stack_file_extent_ram_bytes(stack_fi);
3062 struct btrfs_drop_extents_args drop_args = { 0 };
3065 path = btrfs_alloc_path();
3070 * we may be replacing one extent in the tree with another.
3071 * The new extent is pinned in the extent map, and we don't want
3072 * to drop it from the cache until it is completely in the btree.
3074 * So, tell btrfs_drop_extents to leave this extent in the cache.
3075 * the caller is expected to unpin it and allow it to be merged
3078 drop_args.path = path;
3079 drop_args.start = file_pos;
3080 drop_args.end = file_pos + num_bytes;
3081 drop_args.replace_extent = true;
3082 drop_args.extent_item_size = sizeof(*stack_fi);
3083 ret = btrfs_drop_extents(trans, root, inode, &drop_args);
3087 if (!drop_args.extent_inserted) {
3088 ins.objectid = btrfs_ino(inode);
3089 ins.offset = file_pos;
3090 ins.type = BTRFS_EXTENT_DATA_KEY;
3092 ret = btrfs_insert_empty_item(trans, root, path, &ins,
3097 leaf = path->nodes[0];
3098 btrfs_set_stack_file_extent_generation(stack_fi, trans->transid);
3099 write_extent_buffer(leaf, stack_fi,
3100 btrfs_item_ptr_offset(leaf, path->slots[0]),
3101 sizeof(struct btrfs_file_extent_item));
3103 btrfs_mark_buffer_dirty(leaf);
3104 btrfs_release_path(path);
3107 * If we dropped an inline extent here, we know the range where it is
3108 * was not marked with the EXTENT_DELALLOC_NEW bit, so we update the
3109 * number of bytes only for that range containing the inline extent.
3110 * The remaining of the range will be processed when clearning the
3111 * EXTENT_DELALLOC_BIT bit through the ordered extent completion.
3113 if (file_pos == 0 && !IS_ALIGNED(drop_args.bytes_found, sectorsize)) {
3114 u64 inline_size = round_down(drop_args.bytes_found, sectorsize);
3116 inline_size = drop_args.bytes_found - inline_size;
3117 btrfs_update_inode_bytes(inode, sectorsize, inline_size);
3118 drop_args.bytes_found -= inline_size;
3119 num_bytes -= sectorsize;
3122 if (update_inode_bytes)
3123 btrfs_update_inode_bytes(inode, num_bytes, drop_args.bytes_found);
3125 ins.objectid = disk_bytenr;
3126 ins.offset = disk_num_bytes;
3127 ins.type = BTRFS_EXTENT_ITEM_KEY;
3129 ret = btrfs_inode_set_file_extent_range(inode, file_pos, ram_bytes);
3133 ret = btrfs_alloc_reserved_file_extent(trans, root, btrfs_ino(inode),
3135 qgroup_reserved, &ins);
3137 btrfs_free_path(path);
3142 static void btrfs_release_delalloc_bytes(struct btrfs_fs_info *fs_info,
3145 struct btrfs_block_group *cache;
3147 cache = btrfs_lookup_block_group(fs_info, start);
3150 spin_lock(&cache->lock);
3151 cache->delalloc_bytes -= len;
3152 spin_unlock(&cache->lock);
3154 btrfs_put_block_group(cache);
3157 static int insert_ordered_extent_file_extent(struct btrfs_trans_handle *trans,
3158 struct btrfs_ordered_extent *oe)
3160 struct btrfs_file_extent_item stack_fi;
3161 bool update_inode_bytes;
3162 u64 num_bytes = oe->num_bytes;
3163 u64 ram_bytes = oe->ram_bytes;
3165 memset(&stack_fi, 0, sizeof(stack_fi));
3166 btrfs_set_stack_file_extent_type(&stack_fi, BTRFS_FILE_EXTENT_REG);
3167 btrfs_set_stack_file_extent_disk_bytenr(&stack_fi, oe->disk_bytenr);
3168 btrfs_set_stack_file_extent_disk_num_bytes(&stack_fi,
3169 oe->disk_num_bytes);
3170 btrfs_set_stack_file_extent_offset(&stack_fi, oe->offset);
3171 if (test_bit(BTRFS_ORDERED_TRUNCATED, &oe->flags)) {
3172 num_bytes = oe->truncated_len;
3173 ram_bytes = num_bytes;
3175 btrfs_set_stack_file_extent_num_bytes(&stack_fi, num_bytes);
3176 btrfs_set_stack_file_extent_ram_bytes(&stack_fi, ram_bytes);
3177 btrfs_set_stack_file_extent_compression(&stack_fi, oe->compress_type);
3178 /* Encryption and other encoding is reserved and all 0 */
3181 * For delalloc, when completing an ordered extent we update the inode's
3182 * bytes when clearing the range in the inode's io tree, so pass false
3183 * as the argument 'update_inode_bytes' to insert_reserved_file_extent(),
3184 * except if the ordered extent was truncated.
3186 update_inode_bytes = test_bit(BTRFS_ORDERED_DIRECT, &oe->flags) ||
3187 test_bit(BTRFS_ORDERED_ENCODED, &oe->flags) ||
3188 test_bit(BTRFS_ORDERED_TRUNCATED, &oe->flags);
3190 return insert_reserved_file_extent(trans, BTRFS_I(oe->inode),
3191 oe->file_offset, &stack_fi,
3192 update_inode_bytes, oe->qgroup_rsv);
3196 * As ordered data IO finishes, this gets called so we can finish
3197 * an ordered extent if the range of bytes in the file it covers are
3200 int btrfs_finish_ordered_io(struct btrfs_ordered_extent *ordered_extent)
3202 struct btrfs_inode *inode = BTRFS_I(ordered_extent->inode);
3203 struct btrfs_root *root = inode->root;
3204 struct btrfs_fs_info *fs_info = root->fs_info;
3205 struct btrfs_trans_handle *trans = NULL;
3206 struct extent_io_tree *io_tree = &inode->io_tree;
3207 struct extent_state *cached_state = NULL;
3209 int compress_type = 0;
3211 u64 logical_len = ordered_extent->num_bytes;
3212 bool freespace_inode;
3213 bool truncated = false;
3214 bool clear_reserved_extent = true;
3215 unsigned int clear_bits = EXTENT_DEFRAG;
3217 start = ordered_extent->file_offset;
3218 end = start + ordered_extent->num_bytes - 1;
3220 if (!test_bit(BTRFS_ORDERED_NOCOW, &ordered_extent->flags) &&
3221 !test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags) &&
3222 !test_bit(BTRFS_ORDERED_DIRECT, &ordered_extent->flags) &&
3223 !test_bit(BTRFS_ORDERED_ENCODED, &ordered_extent->flags))
3224 clear_bits |= EXTENT_DELALLOC_NEW;
3226 freespace_inode = btrfs_is_free_space_inode(inode);
3227 if (!freespace_inode)
3228 btrfs_lockdep_acquire(fs_info, btrfs_ordered_extent);
3230 if (test_bit(BTRFS_ORDERED_IOERR, &ordered_extent->flags)) {
3235 /* A valid bdev implies a write on a sequential zone */
3236 if (ordered_extent->bdev) {
3237 btrfs_rewrite_logical_zoned(ordered_extent);
3238 btrfs_zone_finish_endio(fs_info, ordered_extent->disk_bytenr,
3239 ordered_extent->disk_num_bytes);
3242 btrfs_free_io_failure_record(inode, start, end);
3244 if (test_bit(BTRFS_ORDERED_TRUNCATED, &ordered_extent->flags)) {
3246 logical_len = ordered_extent->truncated_len;
3247 /* Truncated the entire extent, don't bother adding */
3252 if (test_bit(BTRFS_ORDERED_NOCOW, &ordered_extent->flags)) {
3253 BUG_ON(!list_empty(&ordered_extent->list)); /* Logic error */
3255 btrfs_inode_safe_disk_i_size_write(inode, 0);
3256 if (freespace_inode)
3257 trans = btrfs_join_transaction_spacecache(root);
3259 trans = btrfs_join_transaction(root);
3260 if (IS_ERR(trans)) {
3261 ret = PTR_ERR(trans);
3265 trans->block_rsv = &inode->block_rsv;
3266 ret = btrfs_update_inode_fallback(trans, root, inode);
3267 if (ret) /* -ENOMEM or corruption */
3268 btrfs_abort_transaction(trans, ret);
3272 clear_bits |= EXTENT_LOCKED;
3273 lock_extent(io_tree, start, end, &cached_state);
3275 if (freespace_inode)
3276 trans = btrfs_join_transaction_spacecache(root);
3278 trans = btrfs_join_transaction(root);
3279 if (IS_ERR(trans)) {
3280 ret = PTR_ERR(trans);
3285 trans->block_rsv = &inode->block_rsv;
3287 if (test_bit(BTRFS_ORDERED_COMPRESSED, &ordered_extent->flags))
3288 compress_type = ordered_extent->compress_type;
3289 if (test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags)) {
3290 BUG_ON(compress_type);
3291 ret = btrfs_mark_extent_written(trans, inode,
3292 ordered_extent->file_offset,
3293 ordered_extent->file_offset +
3295 btrfs_zoned_release_data_reloc_bg(fs_info, ordered_extent->disk_bytenr,
3296 ordered_extent->disk_num_bytes);
3298 BUG_ON(root == fs_info->tree_root);
3299 ret = insert_ordered_extent_file_extent(trans, ordered_extent);
3301 clear_reserved_extent = false;
3302 btrfs_release_delalloc_bytes(fs_info,
3303 ordered_extent->disk_bytenr,
3304 ordered_extent->disk_num_bytes);
3307 unpin_extent_cache(&inode->extent_tree, ordered_extent->file_offset,
3308 ordered_extent->num_bytes, trans->transid);
3310 btrfs_abort_transaction(trans, ret);
3314 ret = add_pending_csums(trans, &ordered_extent->list);
3316 btrfs_abort_transaction(trans, ret);
3321 * If this is a new delalloc range, clear its new delalloc flag to
3322 * update the inode's number of bytes. This needs to be done first
3323 * before updating the inode item.
3325 if ((clear_bits & EXTENT_DELALLOC_NEW) &&
3326 !test_bit(BTRFS_ORDERED_TRUNCATED, &ordered_extent->flags))
3327 clear_extent_bit(&inode->io_tree, start, end,
3328 EXTENT_DELALLOC_NEW | EXTENT_ADD_INODE_BYTES,
3331 btrfs_inode_safe_disk_i_size_write(inode, 0);
3332 ret = btrfs_update_inode_fallback(trans, root, inode);
3333 if (ret) { /* -ENOMEM or corruption */
3334 btrfs_abort_transaction(trans, ret);
3339 clear_extent_bit(&inode->io_tree, start, end, clear_bits,
3343 btrfs_end_transaction(trans);
3345 if (ret || truncated) {
3346 u64 unwritten_start = start;
3349 * If we failed to finish this ordered extent for any reason we
3350 * need to make sure BTRFS_ORDERED_IOERR is set on the ordered
3351 * extent, and mark the inode with the error if it wasn't
3352 * already set. Any error during writeback would have already
3353 * set the mapping error, so we need to set it if we're the ones
3354 * marking this ordered extent as failed.
3356 if (ret && !test_and_set_bit(BTRFS_ORDERED_IOERR,
3357 &ordered_extent->flags))
3358 mapping_set_error(ordered_extent->inode->i_mapping, -EIO);
3361 unwritten_start += logical_len;
3362 clear_extent_uptodate(io_tree, unwritten_start, end, NULL);
3364 /* Drop extent maps for the part of the extent we didn't write. */
3365 btrfs_drop_extent_map_range(inode, unwritten_start, end, false);
3368 * If the ordered extent had an IOERR or something else went
3369 * wrong we need to return the space for this ordered extent
3370 * back to the allocator. We only free the extent in the
3371 * truncated case if we didn't write out the extent at all.
3373 * If we made it past insert_reserved_file_extent before we
3374 * errored out then we don't need to do this as the accounting
3375 * has already been done.
3377 if ((ret || !logical_len) &&
3378 clear_reserved_extent &&
3379 !test_bit(BTRFS_ORDERED_NOCOW, &ordered_extent->flags) &&
3380 !test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags)) {
3382 * Discard the range before returning it back to the
3385 if (ret && btrfs_test_opt(fs_info, DISCARD_SYNC))
3386 btrfs_discard_extent(fs_info,
3387 ordered_extent->disk_bytenr,
3388 ordered_extent->disk_num_bytes,
3390 btrfs_free_reserved_extent(fs_info,
3391 ordered_extent->disk_bytenr,
3392 ordered_extent->disk_num_bytes, 1);
3397 * This needs to be done to make sure anybody waiting knows we are done
3398 * updating everything for this ordered extent.
3400 btrfs_remove_ordered_extent(inode, ordered_extent);
3403 btrfs_put_ordered_extent(ordered_extent);
3404 /* once for the tree */
3405 btrfs_put_ordered_extent(ordered_extent);
3410 void btrfs_writepage_endio_finish_ordered(struct btrfs_inode *inode,
3411 struct page *page, u64 start,
3412 u64 end, bool uptodate)
3414 trace_btrfs_writepage_end_io_hook(inode, start, end, uptodate);
3416 btrfs_mark_ordered_io_finished(inode, page, start, end + 1 - start, uptodate);
3420 * Verify the checksum for a single sector without any extra action that depend
3421 * on the type of I/O.
3423 int btrfs_check_sector_csum(struct btrfs_fs_info *fs_info, struct page *page,
3424 u32 pgoff, u8 *csum, const u8 * const csum_expected)
3426 SHASH_DESC_ON_STACK(shash, fs_info->csum_shash);
3429 ASSERT(pgoff + fs_info->sectorsize <= PAGE_SIZE);
3431 shash->tfm = fs_info->csum_shash;
3433 kaddr = kmap_local_page(page) + pgoff;
3434 crypto_shash_digest(shash, kaddr, fs_info->sectorsize, csum);
3435 kunmap_local(kaddr);
3437 if (memcmp(csum, csum_expected, fs_info->csum_size))
3442 static u8 *btrfs_csum_ptr(const struct btrfs_fs_info *fs_info, u8 *csums, u64 offset)
3444 u64 offset_in_sectors = offset >> fs_info->sectorsize_bits;
3446 return csums + offset_in_sectors * fs_info->csum_size;
3450 * check_data_csum - verify checksum of one sector of uncompressed data
3452 * @bbio: btrfs_bio which contains the csum
3453 * @bio_offset: offset to the beginning of the bio (in bytes)
3454 * @page: page where is the data to be verified
3455 * @pgoff: offset inside the page
3457 * The length of such check is always one sector size.
3459 * When csum mismatch is detected, we will also report the error and fill the
3460 * corrupted range with zero. (Thus it needs the extra parameters)
3462 int btrfs_check_data_csum(struct inode *inode, struct btrfs_bio *bbio,
3463 u32 bio_offset, struct page *page, u32 pgoff)
3465 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
3466 u32 len = fs_info->sectorsize;
3468 u8 csum[BTRFS_CSUM_SIZE];
3470 ASSERT(pgoff + len <= PAGE_SIZE);
3472 csum_expected = btrfs_csum_ptr(fs_info, bbio->csum, bio_offset);
3474 if (btrfs_check_sector_csum(fs_info, page, pgoff, csum, csum_expected))
3479 btrfs_print_data_csum_error(BTRFS_I(inode),
3480 bbio->file_offset + bio_offset,
3481 csum, csum_expected, bbio->mirror_num);
3483 btrfs_dev_stat_inc_and_print(bbio->device,
3484 BTRFS_DEV_STAT_CORRUPTION_ERRS);
3485 memzero_page(page, pgoff, len);
3490 * When reads are done, we need to check csums to verify the data is correct.
3491 * if there's a match, we allow the bio to finish. If not, the code in
3492 * extent_io.c will try to find good copies for us.
3494 * @bio_offset: offset to the beginning of the bio (in bytes)
3495 * @start: file offset of the range start
3496 * @end: file offset of the range end (inclusive)
3498 * Return a bitmap where bit set means a csum mismatch, and bit not set means
3501 unsigned int btrfs_verify_data_csum(struct btrfs_bio *bbio,
3502 u32 bio_offset, struct page *page,
3505 struct inode *inode = page->mapping->host;
3506 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
3507 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
3508 struct btrfs_root *root = BTRFS_I(inode)->root;
3509 const u32 sectorsize = root->fs_info->sectorsize;
3511 unsigned int result = 0;
3514 * This only happens for NODATASUM or compressed read.
3515 * Normally this should be covered by above check for compressed read
3516 * or the next check for NODATASUM. Just do a quicker exit here.
3518 if (bbio->csum == NULL)
3521 if (BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM)
3524 if (unlikely(test_bit(BTRFS_FS_STATE_NO_CSUMS, &fs_info->fs_state)))
3527 ASSERT(page_offset(page) <= start &&
3528 end <= page_offset(page) + PAGE_SIZE - 1);
3529 for (pg_off = offset_in_page(start);
3530 pg_off < offset_in_page(end);
3531 pg_off += sectorsize, bio_offset += sectorsize) {
3532 u64 file_offset = pg_off + page_offset(page);
3535 if (btrfs_is_data_reloc_root(root) &&
3536 test_range_bit(io_tree, file_offset,
3537 file_offset + sectorsize - 1,
3538 EXTENT_NODATASUM, 1, NULL)) {
3539 /* Skip the range without csum for data reloc inode */
3540 clear_extent_bits(io_tree, file_offset,
3541 file_offset + sectorsize - 1,
3545 ret = btrfs_check_data_csum(inode, bbio, bio_offset, page, pg_off);
3547 const int nr_bit = (pg_off - offset_in_page(start)) >>
3548 root->fs_info->sectorsize_bits;
3550 result |= (1U << nr_bit);
3557 * btrfs_add_delayed_iput - perform a delayed iput on @inode
3559 * @inode: The inode we want to perform iput on
3561 * This function uses the generic vfs_inode::i_count to track whether we should
3562 * just decrement it (in case it's > 1) or if this is the last iput then link
3563 * the inode to the delayed iput machinery. Delayed iputs are processed at
3564 * transaction commit time/superblock commit/cleaner kthread.
3566 void btrfs_add_delayed_iput(struct inode *inode)
3568 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
3569 struct btrfs_inode *binode = BTRFS_I(inode);
3571 if (atomic_add_unless(&inode->i_count, -1, 1))
3574 atomic_inc(&fs_info->nr_delayed_iputs);
3575 spin_lock(&fs_info->delayed_iput_lock);
3576 ASSERT(list_empty(&binode->delayed_iput));
3577 list_add_tail(&binode->delayed_iput, &fs_info->delayed_iputs);
3578 spin_unlock(&fs_info->delayed_iput_lock);
3579 if (!test_bit(BTRFS_FS_CLEANER_RUNNING, &fs_info->flags))
3580 wake_up_process(fs_info->cleaner_kthread);
3583 static void run_delayed_iput_locked(struct btrfs_fs_info *fs_info,
3584 struct btrfs_inode *inode)
3586 list_del_init(&inode->delayed_iput);
3587 spin_unlock(&fs_info->delayed_iput_lock);
3588 iput(&inode->vfs_inode);
3589 if (atomic_dec_and_test(&fs_info->nr_delayed_iputs))
3590 wake_up(&fs_info->delayed_iputs_wait);
3591 spin_lock(&fs_info->delayed_iput_lock);
3594 static void btrfs_run_delayed_iput(struct btrfs_fs_info *fs_info,
3595 struct btrfs_inode *inode)
3597 if (!list_empty(&inode->delayed_iput)) {
3598 spin_lock(&fs_info->delayed_iput_lock);
3599 if (!list_empty(&inode->delayed_iput))
3600 run_delayed_iput_locked(fs_info, inode);
3601 spin_unlock(&fs_info->delayed_iput_lock);
3605 void btrfs_run_delayed_iputs(struct btrfs_fs_info *fs_info)
3608 spin_lock(&fs_info->delayed_iput_lock);
3609 while (!list_empty(&fs_info->delayed_iputs)) {
3610 struct btrfs_inode *inode;
3612 inode = list_first_entry(&fs_info->delayed_iputs,
3613 struct btrfs_inode, delayed_iput);
3614 run_delayed_iput_locked(fs_info, inode);
3615 cond_resched_lock(&fs_info->delayed_iput_lock);
3617 spin_unlock(&fs_info->delayed_iput_lock);
3621 * Wait for flushing all delayed iputs
3623 * @fs_info: the filesystem
3625 * This will wait on any delayed iputs that are currently running with KILLABLE
3626 * set. Once they are all done running we will return, unless we are killed in
3627 * which case we return EINTR. This helps in user operations like fallocate etc
3628 * that might get blocked on the iputs.
3630 * Return EINTR if we were killed, 0 if nothing's pending
3632 int btrfs_wait_on_delayed_iputs(struct btrfs_fs_info *fs_info)
3634 int ret = wait_event_killable(fs_info->delayed_iputs_wait,
3635 atomic_read(&fs_info->nr_delayed_iputs) == 0);
3642 * This creates an orphan entry for the given inode in case something goes wrong
3643 * in the middle of an unlink.
3645 int btrfs_orphan_add(struct btrfs_trans_handle *trans,
3646 struct btrfs_inode *inode)
3650 ret = btrfs_insert_orphan_item(trans, inode->root, btrfs_ino(inode));
3651 if (ret && ret != -EEXIST) {
3652 btrfs_abort_transaction(trans, ret);
3660 * We have done the delete so we can go ahead and remove the orphan item for
3661 * this particular inode.
3663 static int btrfs_orphan_del(struct btrfs_trans_handle *trans,
3664 struct btrfs_inode *inode)
3666 return btrfs_del_orphan_item(trans, inode->root, btrfs_ino(inode));
3670 * this cleans up any orphans that may be left on the list from the last use
3673 int btrfs_orphan_cleanup(struct btrfs_root *root)
3675 struct btrfs_fs_info *fs_info = root->fs_info;
3676 struct btrfs_path *path;
3677 struct extent_buffer *leaf;
3678 struct btrfs_key key, found_key;
3679 struct btrfs_trans_handle *trans;
3680 struct inode *inode;
3681 u64 last_objectid = 0;
3682 int ret = 0, nr_unlink = 0;
3684 if (test_and_set_bit(BTRFS_ROOT_ORPHAN_CLEANUP, &root->state))
3687 path = btrfs_alloc_path();
3692 path->reada = READA_BACK;
3694 key.objectid = BTRFS_ORPHAN_OBJECTID;
3695 key.type = BTRFS_ORPHAN_ITEM_KEY;
3696 key.offset = (u64)-1;
3699 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
3704 * if ret == 0 means we found what we were searching for, which
3705 * is weird, but possible, so only screw with path if we didn't
3706 * find the key and see if we have stuff that matches
3710 if (path->slots[0] == 0)
3715 /* pull out the item */
3716 leaf = path->nodes[0];
3717 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
3719 /* make sure the item matches what we want */
3720 if (found_key.objectid != BTRFS_ORPHAN_OBJECTID)
3722 if (found_key.type != BTRFS_ORPHAN_ITEM_KEY)
3725 /* release the path since we're done with it */
3726 btrfs_release_path(path);
3729 * this is where we are basically btrfs_lookup, without the
3730 * crossing root thing. we store the inode number in the
3731 * offset of the orphan item.
3734 if (found_key.offset == last_objectid) {
3736 "Error removing orphan entry, stopping orphan cleanup");
3741 last_objectid = found_key.offset;
3743 found_key.objectid = found_key.offset;
3744 found_key.type = BTRFS_INODE_ITEM_KEY;
3745 found_key.offset = 0;
3746 inode = btrfs_iget(fs_info->sb, last_objectid, root);
3747 ret = PTR_ERR_OR_ZERO(inode);
3748 if (ret && ret != -ENOENT)
3751 if (ret == -ENOENT && root == fs_info->tree_root) {
3752 struct btrfs_root *dead_root;
3753 int is_dead_root = 0;
3756 * This is an orphan in the tree root. Currently these
3757 * could come from 2 sources:
3758 * a) a root (snapshot/subvolume) deletion in progress
3759 * b) a free space cache inode
3760 * We need to distinguish those two, as the orphan item
3761 * for a root must not get deleted before the deletion
3762 * of the snapshot/subvolume's tree completes.
3764 * btrfs_find_orphan_roots() ran before us, which has
3765 * found all deleted roots and loaded them into
3766 * fs_info->fs_roots_radix. So here we can find if an
3767 * orphan item corresponds to a deleted root by looking
3768 * up the root from that radix tree.
3771 spin_lock(&fs_info->fs_roots_radix_lock);
3772 dead_root = radix_tree_lookup(&fs_info->fs_roots_radix,
3773 (unsigned long)found_key.objectid);
3774 if (dead_root && btrfs_root_refs(&dead_root->root_item) == 0)
3776 spin_unlock(&fs_info->fs_roots_radix_lock);
3779 /* prevent this orphan from being found again */
3780 key.offset = found_key.objectid - 1;
3787 * If we have an inode with links, there are a couple of
3790 * 1. We were halfway through creating fsverity metadata for the
3791 * file. In that case, the orphan item represents incomplete
3792 * fsverity metadata which must be cleaned up with
3793 * btrfs_drop_verity_items and deleting the orphan item.
3795 * 2. Old kernels (before v3.12) used to create an
3796 * orphan item for truncate indicating that there were possibly
3797 * extent items past i_size that needed to be deleted. In v3.12,
3798 * truncate was changed to update i_size in sync with the extent
3799 * items, but the (useless) orphan item was still created. Since
3800 * v4.18, we don't create the orphan item for truncate at all.
3802 * So, this item could mean that we need to do a truncate, but
3803 * only if this filesystem was last used on a pre-v3.12 kernel
3804 * and was not cleanly unmounted. The odds of that are quite
3805 * slim, and it's a pain to do the truncate now, so just delete
3808 * It's also possible that this orphan item was supposed to be
3809 * deleted but wasn't. The inode number may have been reused,
3810 * but either way, we can delete the orphan item.
3812 if (ret == -ENOENT || inode->i_nlink) {
3814 ret = btrfs_drop_verity_items(BTRFS_I(inode));
3819 trans = btrfs_start_transaction(root, 1);
3820 if (IS_ERR(trans)) {
3821 ret = PTR_ERR(trans);
3824 btrfs_debug(fs_info, "auto deleting %Lu",
3825 found_key.objectid);
3826 ret = btrfs_del_orphan_item(trans, root,
3827 found_key.objectid);
3828 btrfs_end_transaction(trans);
3836 /* this will do delete_inode and everything for us */
3839 /* release the path since we're done with it */
3840 btrfs_release_path(path);
3842 if (test_bit(BTRFS_ROOT_ORPHAN_ITEM_INSERTED, &root->state)) {
3843 trans = btrfs_join_transaction(root);
3845 btrfs_end_transaction(trans);
3849 btrfs_debug(fs_info, "unlinked %d orphans", nr_unlink);
3853 btrfs_err(fs_info, "could not do orphan cleanup %d", ret);
3854 btrfs_free_path(path);
3859 * very simple check to peek ahead in the leaf looking for xattrs. If we
3860 * don't find any xattrs, we know there can't be any acls.
3862 * slot is the slot the inode is in, objectid is the objectid of the inode
3864 static noinline int acls_after_inode_item(struct extent_buffer *leaf,
3865 int slot, u64 objectid,
3866 int *first_xattr_slot)
3868 u32 nritems = btrfs_header_nritems(leaf);
3869 struct btrfs_key found_key;
3870 static u64 xattr_access = 0;
3871 static u64 xattr_default = 0;
3874 if (!xattr_access) {
3875 xattr_access = btrfs_name_hash(XATTR_NAME_POSIX_ACL_ACCESS,
3876 strlen(XATTR_NAME_POSIX_ACL_ACCESS));
3877 xattr_default = btrfs_name_hash(XATTR_NAME_POSIX_ACL_DEFAULT,
3878 strlen(XATTR_NAME_POSIX_ACL_DEFAULT));
3882 *first_xattr_slot = -1;
3883 while (slot < nritems) {
3884 btrfs_item_key_to_cpu(leaf, &found_key, slot);
3886 /* we found a different objectid, there must not be acls */
3887 if (found_key.objectid != objectid)
3890 /* we found an xattr, assume we've got an acl */
3891 if (found_key.type == BTRFS_XATTR_ITEM_KEY) {
3892 if (*first_xattr_slot == -1)
3893 *first_xattr_slot = slot;
3894 if (found_key.offset == xattr_access ||
3895 found_key.offset == xattr_default)
3900 * we found a key greater than an xattr key, there can't
3901 * be any acls later on
3903 if (found_key.type > BTRFS_XATTR_ITEM_KEY)
3910 * it goes inode, inode backrefs, xattrs, extents,
3911 * so if there are a ton of hard links to an inode there can
3912 * be a lot of backrefs. Don't waste time searching too hard,
3913 * this is just an optimization
3918 /* we hit the end of the leaf before we found an xattr or
3919 * something larger than an xattr. We have to assume the inode
3922 if (*first_xattr_slot == -1)
3923 *first_xattr_slot = slot;
3928 * read an inode from the btree into the in-memory inode
3930 static int btrfs_read_locked_inode(struct inode *inode,
3931 struct btrfs_path *in_path)
3933 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
3934 struct btrfs_path *path = in_path;
3935 struct extent_buffer *leaf;
3936 struct btrfs_inode_item *inode_item;
3937 struct btrfs_root *root = BTRFS_I(inode)->root;
3938 struct btrfs_key location;
3943 bool filled = false;
3944 int first_xattr_slot;
3946 ret = btrfs_fill_inode(inode, &rdev);
3951 path = btrfs_alloc_path();
3956 memcpy(&location, &BTRFS_I(inode)->location, sizeof(location));
3958 ret = btrfs_lookup_inode(NULL, root, path, &location, 0);
3960 if (path != in_path)
3961 btrfs_free_path(path);
3965 leaf = path->nodes[0];
3970 inode_item = btrfs_item_ptr(leaf, path->slots[0],
3971 struct btrfs_inode_item);
3972 inode->i_mode = btrfs_inode_mode(leaf, inode_item);
3973 set_nlink(inode, btrfs_inode_nlink(leaf, inode_item));
3974 i_uid_write(inode, btrfs_inode_uid(leaf, inode_item));
3975 i_gid_write(inode, btrfs_inode_gid(leaf, inode_item));
3976 btrfs_i_size_write(BTRFS_I(inode), btrfs_inode_size(leaf, inode_item));
3977 btrfs_inode_set_file_extent_range(BTRFS_I(inode), 0,
3978 round_up(i_size_read(inode), fs_info->sectorsize));
3980 inode->i_atime.tv_sec = btrfs_timespec_sec(leaf, &inode_item->atime);
3981 inode->i_atime.tv_nsec = btrfs_timespec_nsec(leaf, &inode_item->atime);
3983 inode->i_mtime.tv_sec = btrfs_timespec_sec(leaf, &inode_item->mtime);
3984 inode->i_mtime.tv_nsec = btrfs_timespec_nsec(leaf, &inode_item->mtime);
3986 inode->i_ctime.tv_sec = btrfs_timespec_sec(leaf, &inode_item->ctime);
3987 inode->i_ctime.tv_nsec = btrfs_timespec_nsec(leaf, &inode_item->ctime);
3989 BTRFS_I(inode)->i_otime.tv_sec =
3990 btrfs_timespec_sec(leaf, &inode_item->otime);
3991 BTRFS_I(inode)->i_otime.tv_nsec =
3992 btrfs_timespec_nsec(leaf, &inode_item->otime);
3994 inode_set_bytes(inode, btrfs_inode_nbytes(leaf, inode_item));
3995 BTRFS_I(inode)->generation = btrfs_inode_generation(leaf, inode_item);
3996 BTRFS_I(inode)->last_trans = btrfs_inode_transid(leaf, inode_item);
3998 inode_set_iversion_queried(inode,
3999 btrfs_inode_sequence(leaf, inode_item));
4000 inode->i_generation = BTRFS_I(inode)->generation;
4002 rdev = btrfs_inode_rdev(leaf, inode_item);
4004 BTRFS_I(inode)->index_cnt = (u64)-1;
4005 btrfs_inode_split_flags(btrfs_inode_flags(leaf, inode_item),
4006 &BTRFS_I(inode)->flags, &BTRFS_I(inode)->ro_flags);
4010 * If we were modified in the current generation and evicted from memory
4011 * and then re-read we need to do a full sync since we don't have any
4012 * idea about which extents were modified before we were evicted from
4015 * This is required for both inode re-read from disk and delayed inode
4016 * in delayed_nodes_tree.
4018 if (BTRFS_I(inode)->last_trans == fs_info->generation)
4019 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC,
4020 &BTRFS_I(inode)->runtime_flags);
4023 * We don't persist the id of the transaction where an unlink operation
4024 * against the inode was last made. So here we assume the inode might
4025 * have been evicted, and therefore the exact value of last_unlink_trans
4026 * lost, and set it to last_trans to avoid metadata inconsistencies
4027 * between the inode and its parent if the inode is fsync'ed and the log
4028 * replayed. For example, in the scenario:
4031 * ln mydir/foo mydir/bar
4034 * echo 2 > /proc/sys/vm/drop_caches # evicts inode
4035 * xfs_io -c fsync mydir/foo
4037 * mount fs, triggers fsync log replay
4039 * We must make sure that when we fsync our inode foo we also log its
4040 * parent inode, otherwise after log replay the parent still has the
4041 * dentry with the "bar" name but our inode foo has a link count of 1
4042 * and doesn't have an inode ref with the name "bar" anymore.
4044 * Setting last_unlink_trans to last_trans is a pessimistic approach,
4045 * but it guarantees correctness at the expense of occasional full
4046 * transaction commits on fsync if our inode is a directory, or if our
4047 * inode is not a directory, logging its parent unnecessarily.
4049 BTRFS_I(inode)->last_unlink_trans = BTRFS_I(inode)->last_trans;
4052 * Same logic as for last_unlink_trans. We don't persist the generation
4053 * of the last transaction where this inode was used for a reflink
4054 * operation, so after eviction and reloading the inode we must be
4055 * pessimistic and assume the last transaction that modified the inode.
4057 BTRFS_I(inode)->last_reflink_trans = BTRFS_I(inode)->last_trans;
4060 if (inode->i_nlink != 1 ||
4061 path->slots[0] >= btrfs_header_nritems(leaf))
4064 btrfs_item_key_to_cpu(leaf, &location, path->slots[0]);
4065 if (location.objectid != btrfs_ino(BTRFS_I(inode)))
4068 ptr = btrfs_item_ptr_offset(leaf, path->slots[0]);
4069 if (location.type == BTRFS_INODE_REF_KEY) {
4070 struct btrfs_inode_ref *ref;
4072 ref = (struct btrfs_inode_ref *)ptr;
4073 BTRFS_I(inode)->dir_index = btrfs_inode_ref_index(leaf, ref);
4074 } else if (location.type == BTRFS_INODE_EXTREF_KEY) {
4075 struct btrfs_inode_extref *extref;
4077 extref = (struct btrfs_inode_extref *)ptr;
4078 BTRFS_I(inode)->dir_index = btrfs_inode_extref_index(leaf,
4083 * try to precache a NULL acl entry for files that don't have
4084 * any xattrs or acls
4086 maybe_acls = acls_after_inode_item(leaf, path->slots[0],
4087 btrfs_ino(BTRFS_I(inode)), &first_xattr_slot);
4088 if (first_xattr_slot != -1) {
4089 path->slots[0] = first_xattr_slot;
4090 ret = btrfs_load_inode_props(inode, path);
4093 "error loading props for ino %llu (root %llu): %d",
4094 btrfs_ino(BTRFS_I(inode)),
4095 root->root_key.objectid, ret);
4097 if (path != in_path)
4098 btrfs_free_path(path);
4101 cache_no_acl(inode);
4103 switch (inode->i_mode & S_IFMT) {
4105 inode->i_mapping->a_ops = &btrfs_aops;
4106 inode->i_fop = &btrfs_file_operations;
4107 inode->i_op = &btrfs_file_inode_operations;
4110 inode->i_fop = &btrfs_dir_file_operations;
4111 inode->i_op = &btrfs_dir_inode_operations;
4114 inode->i_op = &btrfs_symlink_inode_operations;
4115 inode_nohighmem(inode);
4116 inode->i_mapping->a_ops = &btrfs_aops;
4119 inode->i_op = &btrfs_special_inode_operations;
4120 init_special_inode(inode, inode->i_mode, rdev);
4124 btrfs_sync_inode_flags_to_i_flags(inode);
4129 * given a leaf and an inode, copy the inode fields into the leaf
4131 static void fill_inode_item(struct btrfs_trans_handle *trans,
4132 struct extent_buffer *leaf,
4133 struct btrfs_inode_item *item,
4134 struct inode *inode)
4136 struct btrfs_map_token token;
4139 btrfs_init_map_token(&token, leaf);
4141 btrfs_set_token_inode_uid(&token, item, i_uid_read(inode));
4142 btrfs_set_token_inode_gid(&token, item, i_gid_read(inode));
4143 btrfs_set_token_inode_size(&token, item, BTRFS_I(inode)->disk_i_size);
4144 btrfs_set_token_inode_mode(&token, item, inode->i_mode);
4145 btrfs_set_token_inode_nlink(&token, item, inode->i_nlink);
4147 btrfs_set_token_timespec_sec(&token, &item->atime,
4148 inode->i_atime.tv_sec);
4149 btrfs_set_token_timespec_nsec(&token, &item->atime,
4150 inode->i_atime.tv_nsec);
4152 btrfs_set_token_timespec_sec(&token, &item->mtime,
4153 inode->i_mtime.tv_sec);
4154 btrfs_set_token_timespec_nsec(&token, &item->mtime,
4155 inode->i_mtime.tv_nsec);
4157 btrfs_set_token_timespec_sec(&token, &item->ctime,
4158 inode->i_ctime.tv_sec);
4159 btrfs_set_token_timespec_nsec(&token, &item->ctime,
4160 inode->i_ctime.tv_nsec);
4162 btrfs_set_token_timespec_sec(&token, &item->otime,
4163 BTRFS_I(inode)->i_otime.tv_sec);
4164 btrfs_set_token_timespec_nsec(&token, &item->otime,
4165 BTRFS_I(inode)->i_otime.tv_nsec);
4167 btrfs_set_token_inode_nbytes(&token, item, inode_get_bytes(inode));
4168 btrfs_set_token_inode_generation(&token, item,
4169 BTRFS_I(inode)->generation);
4170 btrfs_set_token_inode_sequence(&token, item, inode_peek_iversion(inode));
4171 btrfs_set_token_inode_transid(&token, item, trans->transid);
4172 btrfs_set_token_inode_rdev(&token, item, inode->i_rdev);
4173 flags = btrfs_inode_combine_flags(BTRFS_I(inode)->flags,
4174 BTRFS_I(inode)->ro_flags);
4175 btrfs_set_token_inode_flags(&token, item, flags);
4176 btrfs_set_token_inode_block_group(&token, item, 0);
4180 * copy everything in the in-memory inode into the btree.
4182 static noinline int btrfs_update_inode_item(struct btrfs_trans_handle *trans,
4183 struct btrfs_root *root,
4184 struct btrfs_inode *inode)
4186 struct btrfs_inode_item *inode_item;
4187 struct btrfs_path *path;
4188 struct extent_buffer *leaf;
4191 path = btrfs_alloc_path();
4195 ret = btrfs_lookup_inode(trans, root, path, &inode->location, 1);
4202 leaf = path->nodes[0];
4203 inode_item = btrfs_item_ptr(leaf, path->slots[0],
4204 struct btrfs_inode_item);
4206 fill_inode_item(trans, leaf, inode_item, &inode->vfs_inode);
4207 btrfs_mark_buffer_dirty(leaf);
4208 btrfs_set_inode_last_trans(trans, inode);
4211 btrfs_free_path(path);
4216 * copy everything in the in-memory inode into the btree.
4218 noinline int btrfs_update_inode(struct btrfs_trans_handle *trans,
4219 struct btrfs_root *root,
4220 struct btrfs_inode *inode)
4222 struct btrfs_fs_info *fs_info = root->fs_info;
4226 * If the inode is a free space inode, we can deadlock during commit
4227 * if we put it into the delayed code.
4229 * The data relocation inode should also be directly updated
4232 if (!btrfs_is_free_space_inode(inode)
4233 && !btrfs_is_data_reloc_root(root)
4234 && !test_bit(BTRFS_FS_LOG_RECOVERING, &fs_info->flags)) {
4235 btrfs_update_root_times(trans, root);
4237 ret = btrfs_delayed_update_inode(trans, root, inode);
4239 btrfs_set_inode_last_trans(trans, inode);
4243 return btrfs_update_inode_item(trans, root, inode);
4246 int btrfs_update_inode_fallback(struct btrfs_trans_handle *trans,
4247 struct btrfs_root *root, struct btrfs_inode *inode)
4251 ret = btrfs_update_inode(trans, root, inode);
4253 return btrfs_update_inode_item(trans, root, inode);
4258 * unlink helper that gets used here in inode.c and in the tree logging
4259 * recovery code. It remove a link in a directory with a given name, and
4260 * also drops the back refs in the inode to the directory
4262 static int __btrfs_unlink_inode(struct btrfs_trans_handle *trans,
4263 struct btrfs_inode *dir,
4264 struct btrfs_inode *inode,
4265 const char *name, int name_len,
4266 struct btrfs_rename_ctx *rename_ctx)
4268 struct btrfs_root *root = dir->root;
4269 struct btrfs_fs_info *fs_info = root->fs_info;
4270 struct btrfs_path *path;
4272 struct btrfs_dir_item *di;
4274 u64 ino = btrfs_ino(inode);
4275 u64 dir_ino = btrfs_ino(dir);
4277 path = btrfs_alloc_path();
4283 di = btrfs_lookup_dir_item(trans, root, path, dir_ino,
4284 name, name_len, -1);
4285 if (IS_ERR_OR_NULL(di)) {
4286 ret = di ? PTR_ERR(di) : -ENOENT;
4289 ret = btrfs_delete_one_dir_name(trans, root, path, di);
4292 btrfs_release_path(path);
4295 * If we don't have dir index, we have to get it by looking up
4296 * the inode ref, since we get the inode ref, remove it directly,
4297 * it is unnecessary to do delayed deletion.
4299 * But if we have dir index, needn't search inode ref to get it.
4300 * Since the inode ref is close to the inode item, it is better
4301 * that we delay to delete it, and just do this deletion when
4302 * we update the inode item.
4304 if (inode->dir_index) {
4305 ret = btrfs_delayed_delete_inode_ref(inode);
4307 index = inode->dir_index;
4312 ret = btrfs_del_inode_ref(trans, root, name, name_len, ino,
4316 "failed to delete reference to %.*s, inode %llu parent %llu",
4317 name_len, name, ino, dir_ino);
4318 btrfs_abort_transaction(trans, ret);
4323 rename_ctx->index = index;
4325 ret = btrfs_delete_delayed_dir_index(trans, dir, index);
4327 btrfs_abort_transaction(trans, ret);
4332 * If we are in a rename context, we don't need to update anything in the
4333 * log. That will be done later during the rename by btrfs_log_new_name().
4334 * Besides that, doing it here would only cause extra unnecessary btree
4335 * operations on the log tree, increasing latency for applications.
4338 btrfs_del_inode_ref_in_log(trans, root, name, name_len, inode,
4340 btrfs_del_dir_entries_in_log(trans, root, name, name_len, dir,
4345 * If we have a pending delayed iput we could end up with the final iput
4346 * being run in btrfs-cleaner context. If we have enough of these built
4347 * up we can end up burning a lot of time in btrfs-cleaner without any
4348 * way to throttle the unlinks. Since we're currently holding a ref on
4349 * the inode we can run the delayed iput here without any issues as the
4350 * final iput won't be done until after we drop the ref we're currently
4353 btrfs_run_delayed_iput(fs_info, inode);
4355 btrfs_free_path(path);
4359 btrfs_i_size_write(dir, dir->vfs_inode.i_size - name_len * 2);
4360 inode_inc_iversion(&inode->vfs_inode);
4361 inode_inc_iversion(&dir->vfs_inode);
4362 inode->vfs_inode.i_ctime = current_time(&inode->vfs_inode);
4363 dir->vfs_inode.i_mtime = inode->vfs_inode.i_ctime;
4364 dir->vfs_inode.i_ctime = inode->vfs_inode.i_ctime;
4365 ret = btrfs_update_inode(trans, root, dir);
4370 int btrfs_unlink_inode(struct btrfs_trans_handle *trans,
4371 struct btrfs_inode *dir, struct btrfs_inode *inode,
4372 const char *name, int name_len)
4375 ret = __btrfs_unlink_inode(trans, dir, inode, name, name_len, NULL);
4377 drop_nlink(&inode->vfs_inode);
4378 ret = btrfs_update_inode(trans, inode->root, inode);
4384 * helper to start transaction for unlink and rmdir.
4386 * unlink and rmdir are special in btrfs, they do not always free space, so
4387 * if we cannot make our reservations the normal way try and see if there is
4388 * plenty of slack room in the global reserve to migrate, otherwise we cannot
4389 * allow the unlink to occur.
4391 static struct btrfs_trans_handle *__unlink_start_trans(struct inode *dir)
4393 struct btrfs_root *root = BTRFS_I(dir)->root;
4396 * 1 for the possible orphan item
4397 * 1 for the dir item
4398 * 1 for the dir index
4399 * 1 for the inode ref
4401 * 1 for the parent inode
4403 return btrfs_start_transaction_fallback_global_rsv(root, 6);
4406 static int btrfs_unlink(struct inode *dir, struct dentry *dentry)
4408 struct btrfs_trans_handle *trans;
4409 struct inode *inode = d_inode(dentry);
4412 trans = __unlink_start_trans(dir);
4414 return PTR_ERR(trans);
4416 btrfs_record_unlink_dir(trans, BTRFS_I(dir), BTRFS_I(d_inode(dentry)),
4419 ret = btrfs_unlink_inode(trans, BTRFS_I(dir),
4420 BTRFS_I(d_inode(dentry)), dentry->d_name.name,
4421 dentry->d_name.len);
4425 if (inode->i_nlink == 0) {
4426 ret = btrfs_orphan_add(trans, BTRFS_I(inode));
4432 btrfs_end_transaction(trans);
4433 btrfs_btree_balance_dirty(BTRFS_I(dir)->root->fs_info);
4437 static int btrfs_unlink_subvol(struct btrfs_trans_handle *trans,
4438 struct inode *dir, struct dentry *dentry)
4440 struct btrfs_root *root = BTRFS_I(dir)->root;
4441 struct btrfs_inode *inode = BTRFS_I(d_inode(dentry));
4442 struct btrfs_path *path;
4443 struct extent_buffer *leaf;
4444 struct btrfs_dir_item *di;
4445 struct btrfs_key key;
4446 const char *name = dentry->d_name.name;
4447 int name_len = dentry->d_name.len;
4451 u64 dir_ino = btrfs_ino(BTRFS_I(dir));
4453 if (btrfs_ino(inode) == BTRFS_FIRST_FREE_OBJECTID) {
4454 objectid = inode->root->root_key.objectid;
4455 } else if (btrfs_ino(inode) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID) {
4456 objectid = inode->location.objectid;
4462 path = btrfs_alloc_path();
4466 di = btrfs_lookup_dir_item(trans, root, path, dir_ino,
4467 name, name_len, -1);
4468 if (IS_ERR_OR_NULL(di)) {
4469 ret = di ? PTR_ERR(di) : -ENOENT;
4473 leaf = path->nodes[0];
4474 btrfs_dir_item_key_to_cpu(leaf, di, &key);
4475 WARN_ON(key.type != BTRFS_ROOT_ITEM_KEY || key.objectid != objectid);
4476 ret = btrfs_delete_one_dir_name(trans, root, path, di);
4478 btrfs_abort_transaction(trans, ret);
4481 btrfs_release_path(path);
4484 * This is a placeholder inode for a subvolume we didn't have a
4485 * reference to at the time of the snapshot creation. In the meantime
4486 * we could have renamed the real subvol link into our snapshot, so
4487 * depending on btrfs_del_root_ref to return -ENOENT here is incorrect.
4488 * Instead simply lookup the dir_index_item for this entry so we can
4489 * remove it. Otherwise we know we have a ref to the root and we can
4490 * call btrfs_del_root_ref, and it _shouldn't_ fail.
4492 if (btrfs_ino(inode) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID) {
4493 di = btrfs_search_dir_index_item(root, path, dir_ino,
4495 if (IS_ERR_OR_NULL(di)) {
4500 btrfs_abort_transaction(trans, ret);
4504 leaf = path->nodes[0];
4505 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
4507 btrfs_release_path(path);
4509 ret = btrfs_del_root_ref(trans, objectid,
4510 root->root_key.objectid, dir_ino,
4511 &index, name, name_len);
4513 btrfs_abort_transaction(trans, ret);
4518 ret = btrfs_delete_delayed_dir_index(trans, BTRFS_I(dir), index);
4520 btrfs_abort_transaction(trans, ret);
4524 btrfs_i_size_write(BTRFS_I(dir), dir->i_size - name_len * 2);
4525 inode_inc_iversion(dir);
4526 dir->i_mtime = current_time(dir);
4527 dir->i_ctime = dir->i_mtime;
4528 ret = btrfs_update_inode_fallback(trans, root, BTRFS_I(dir));
4530 btrfs_abort_transaction(trans, ret);
4532 btrfs_free_path(path);
4537 * Helper to check if the subvolume references other subvolumes or if it's
4540 static noinline int may_destroy_subvol(struct btrfs_root *root)
4542 struct btrfs_fs_info *fs_info = root->fs_info;
4543 struct btrfs_path *path;
4544 struct btrfs_dir_item *di;
4545 struct btrfs_key key;
4549 path = btrfs_alloc_path();
4553 /* Make sure this root isn't set as the default subvol */
4554 dir_id = btrfs_super_root_dir(fs_info->super_copy);
4555 di = btrfs_lookup_dir_item(NULL, fs_info->tree_root, path,
4556 dir_id, "default", 7, 0);
4557 if (di && !IS_ERR(di)) {
4558 btrfs_dir_item_key_to_cpu(path->nodes[0], di, &key);
4559 if (key.objectid == root->root_key.objectid) {
4562 "deleting default subvolume %llu is not allowed",
4566 btrfs_release_path(path);
4569 key.objectid = root->root_key.objectid;
4570 key.type = BTRFS_ROOT_REF_KEY;
4571 key.offset = (u64)-1;
4573 ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, path, 0, 0);
4579 if (path->slots[0] > 0) {
4581 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
4582 if (key.objectid == root->root_key.objectid &&
4583 key.type == BTRFS_ROOT_REF_KEY)
4587 btrfs_free_path(path);
4591 /* Delete all dentries for inodes belonging to the root */
4592 static void btrfs_prune_dentries(struct btrfs_root *root)
4594 struct btrfs_fs_info *fs_info = root->fs_info;
4595 struct rb_node *node;
4596 struct rb_node *prev;
4597 struct btrfs_inode *entry;
4598 struct inode *inode;
4601 if (!BTRFS_FS_ERROR(fs_info))
4602 WARN_ON(btrfs_root_refs(&root->root_item) != 0);
4604 spin_lock(&root->inode_lock);
4606 node = root->inode_tree.rb_node;
4610 entry = rb_entry(node, struct btrfs_inode, rb_node);
4612 if (objectid < btrfs_ino(entry))
4613 node = node->rb_left;
4614 else if (objectid > btrfs_ino(entry))
4615 node = node->rb_right;
4621 entry = rb_entry(prev, struct btrfs_inode, rb_node);
4622 if (objectid <= btrfs_ino(entry)) {
4626 prev = rb_next(prev);
4630 entry = rb_entry(node, struct btrfs_inode, rb_node);
4631 objectid = btrfs_ino(entry) + 1;
4632 inode = igrab(&entry->vfs_inode);
4634 spin_unlock(&root->inode_lock);
4635 if (atomic_read(&inode->i_count) > 1)
4636 d_prune_aliases(inode);
4638 * btrfs_drop_inode will have it removed from the inode
4639 * cache when its usage count hits zero.
4643 spin_lock(&root->inode_lock);
4647 if (cond_resched_lock(&root->inode_lock))
4650 node = rb_next(node);
4652 spin_unlock(&root->inode_lock);
4655 int btrfs_delete_subvolume(struct inode *dir, struct dentry *dentry)
4657 struct btrfs_fs_info *fs_info = btrfs_sb(dentry->d_sb);
4658 struct btrfs_root *root = BTRFS_I(dir)->root;
4659 struct inode *inode = d_inode(dentry);
4660 struct btrfs_root *dest = BTRFS_I(inode)->root;
4661 struct btrfs_trans_handle *trans;
4662 struct btrfs_block_rsv block_rsv;
4667 * Don't allow to delete a subvolume with send in progress. This is
4668 * inside the inode lock so the error handling that has to drop the bit
4669 * again is not run concurrently.
4671 spin_lock(&dest->root_item_lock);
4672 if (dest->send_in_progress) {
4673 spin_unlock(&dest->root_item_lock);
4675 "attempt to delete subvolume %llu during send",
4676 dest->root_key.objectid);
4679 if (atomic_read(&dest->nr_swapfiles)) {
4680 spin_unlock(&dest->root_item_lock);
4682 "attempt to delete subvolume %llu with active swapfile",
4683 root->root_key.objectid);
4686 root_flags = btrfs_root_flags(&dest->root_item);
4687 btrfs_set_root_flags(&dest->root_item,
4688 root_flags | BTRFS_ROOT_SUBVOL_DEAD);
4689 spin_unlock(&dest->root_item_lock);
4691 down_write(&fs_info->subvol_sem);
4693 ret = may_destroy_subvol(dest);
4697 btrfs_init_block_rsv(&block_rsv, BTRFS_BLOCK_RSV_TEMP);
4699 * One for dir inode,
4700 * two for dir entries,
4701 * two for root ref/backref.
4703 ret = btrfs_subvolume_reserve_metadata(root, &block_rsv, 5, true);
4707 trans = btrfs_start_transaction(root, 0);
4708 if (IS_ERR(trans)) {
4709 ret = PTR_ERR(trans);
4712 trans->block_rsv = &block_rsv;
4713 trans->bytes_reserved = block_rsv.size;
4715 btrfs_record_snapshot_destroy(trans, BTRFS_I(dir));
4717 ret = btrfs_unlink_subvol(trans, dir, dentry);
4719 btrfs_abort_transaction(trans, ret);
4723 ret = btrfs_record_root_in_trans(trans, dest);
4725 btrfs_abort_transaction(trans, ret);
4729 memset(&dest->root_item.drop_progress, 0,
4730 sizeof(dest->root_item.drop_progress));
4731 btrfs_set_root_drop_level(&dest->root_item, 0);
4732 btrfs_set_root_refs(&dest->root_item, 0);
4734 if (!test_and_set_bit(BTRFS_ROOT_ORPHAN_ITEM_INSERTED, &dest->state)) {
4735 ret = btrfs_insert_orphan_item(trans,
4737 dest->root_key.objectid);
4739 btrfs_abort_transaction(trans, ret);
4744 ret = btrfs_uuid_tree_remove(trans, dest->root_item.uuid,
4745 BTRFS_UUID_KEY_SUBVOL,
4746 dest->root_key.objectid);
4747 if (ret && ret != -ENOENT) {
4748 btrfs_abort_transaction(trans, ret);
4751 if (!btrfs_is_empty_uuid(dest->root_item.received_uuid)) {
4752 ret = btrfs_uuid_tree_remove(trans,
4753 dest->root_item.received_uuid,
4754 BTRFS_UUID_KEY_RECEIVED_SUBVOL,
4755 dest->root_key.objectid);
4756 if (ret && ret != -ENOENT) {
4757 btrfs_abort_transaction(trans, ret);
4762 free_anon_bdev(dest->anon_dev);
4765 trans->block_rsv = NULL;
4766 trans->bytes_reserved = 0;
4767 ret = btrfs_end_transaction(trans);
4768 inode->i_flags |= S_DEAD;
4770 btrfs_subvolume_release_metadata(root, &block_rsv);
4772 up_write(&fs_info->subvol_sem);
4774 spin_lock(&dest->root_item_lock);
4775 root_flags = btrfs_root_flags(&dest->root_item);
4776 btrfs_set_root_flags(&dest->root_item,
4777 root_flags & ~BTRFS_ROOT_SUBVOL_DEAD);
4778 spin_unlock(&dest->root_item_lock);
4780 d_invalidate(dentry);
4781 btrfs_prune_dentries(dest);
4782 ASSERT(dest->send_in_progress == 0);
4788 static int btrfs_rmdir(struct inode *dir, struct dentry *dentry)
4790 struct inode *inode = d_inode(dentry);
4791 struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info;
4793 struct btrfs_trans_handle *trans;
4794 u64 last_unlink_trans;
4796 if (inode->i_size > BTRFS_EMPTY_DIR_SIZE)
4798 if (btrfs_ino(BTRFS_I(inode)) == BTRFS_FIRST_FREE_OBJECTID) {
4799 if (unlikely(btrfs_fs_incompat(fs_info, EXTENT_TREE_V2))) {
4801 "extent tree v2 doesn't support snapshot deletion yet");
4804 return btrfs_delete_subvolume(dir, dentry);
4807 trans = __unlink_start_trans(dir);
4809 return PTR_ERR(trans);
4811 if (unlikely(btrfs_ino(BTRFS_I(inode)) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)) {
4812 err = btrfs_unlink_subvol(trans, dir, dentry);
4816 err = btrfs_orphan_add(trans, BTRFS_I(inode));
4820 last_unlink_trans = BTRFS_I(inode)->last_unlink_trans;
4822 /* now the directory is empty */
4823 err = btrfs_unlink_inode(trans, BTRFS_I(dir),
4824 BTRFS_I(d_inode(dentry)), dentry->d_name.name,
4825 dentry->d_name.len);
4827 btrfs_i_size_write(BTRFS_I(inode), 0);
4829 * Propagate the last_unlink_trans value of the deleted dir to
4830 * its parent directory. This is to prevent an unrecoverable
4831 * log tree in the case we do something like this:
4833 * 2) create snapshot under dir foo
4834 * 3) delete the snapshot
4837 * 6) fsync foo or some file inside foo
4839 if (last_unlink_trans >= trans->transid)
4840 BTRFS_I(dir)->last_unlink_trans = last_unlink_trans;
4843 btrfs_end_transaction(trans);
4844 btrfs_btree_balance_dirty(fs_info);
4850 * btrfs_truncate_block - read, zero a chunk and write a block
4851 * @inode - inode that we're zeroing
4852 * @from - the offset to start zeroing
4853 * @len - the length to zero, 0 to zero the entire range respective to the
4855 * @front - zero up to the offset instead of from the offset on
4857 * This will find the block for the "from" offset and cow the block and zero the
4858 * part we want to zero. This is used with truncate and hole punching.
4860 int btrfs_truncate_block(struct btrfs_inode *inode, loff_t from, loff_t len,
4863 struct btrfs_fs_info *fs_info = inode->root->fs_info;
4864 struct address_space *mapping = inode->vfs_inode.i_mapping;
4865 struct extent_io_tree *io_tree = &inode->io_tree;
4866 struct btrfs_ordered_extent *ordered;
4867 struct extent_state *cached_state = NULL;
4868 struct extent_changeset *data_reserved = NULL;
4869 bool only_release_metadata = false;
4870 u32 blocksize = fs_info->sectorsize;
4871 pgoff_t index = from >> PAGE_SHIFT;
4872 unsigned offset = from & (blocksize - 1);
4874 gfp_t mask = btrfs_alloc_write_mask(mapping);
4875 size_t write_bytes = blocksize;
4880 if (IS_ALIGNED(offset, blocksize) &&
4881 (!len || IS_ALIGNED(len, blocksize)))
4884 block_start = round_down(from, blocksize);
4885 block_end = block_start + blocksize - 1;
4887 ret = btrfs_check_data_free_space(inode, &data_reserved, block_start,
4890 if (btrfs_check_nocow_lock(inode, block_start, &write_bytes, false) > 0) {
4891 /* For nocow case, no need to reserve data space */
4892 only_release_metadata = true;
4897 ret = btrfs_delalloc_reserve_metadata(inode, blocksize, blocksize, false);
4899 if (!only_release_metadata)
4900 btrfs_free_reserved_data_space(inode, data_reserved,
4901 block_start, blocksize);
4905 page = find_or_create_page(mapping, index, mask);
4907 btrfs_delalloc_release_space(inode, data_reserved, block_start,
4909 btrfs_delalloc_release_extents(inode, blocksize);
4913 ret = set_page_extent_mapped(page);
4917 if (!PageUptodate(page)) {
4918 ret = btrfs_read_folio(NULL, page_folio(page));
4920 if (page->mapping != mapping) {
4925 if (!PageUptodate(page)) {
4930 wait_on_page_writeback(page);
4932 lock_extent(io_tree, block_start, block_end, &cached_state);
4934 ordered = btrfs_lookup_ordered_extent(inode, block_start);
4936 unlock_extent(io_tree, block_start, block_end, &cached_state);
4939 btrfs_start_ordered_extent(ordered, 1);
4940 btrfs_put_ordered_extent(ordered);
4944 clear_extent_bit(&inode->io_tree, block_start, block_end,
4945 EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING | EXTENT_DEFRAG,
4948 ret = btrfs_set_extent_delalloc(inode, block_start, block_end, 0,
4951 unlock_extent(io_tree, block_start, block_end, &cached_state);
4955 if (offset != blocksize) {
4957 len = blocksize - offset;
4959 memzero_page(page, (block_start - page_offset(page)),
4962 memzero_page(page, (block_start - page_offset(page)) + offset,
4965 btrfs_page_clear_checked(fs_info, page, block_start,
4966 block_end + 1 - block_start);
4967 btrfs_page_set_dirty(fs_info, page, block_start, block_end + 1 - block_start);
4968 unlock_extent(io_tree, block_start, block_end, &cached_state);
4970 if (only_release_metadata)
4971 set_extent_bit(&inode->io_tree, block_start, block_end,
4972 EXTENT_NORESERVE, NULL, GFP_NOFS);
4976 if (only_release_metadata)
4977 btrfs_delalloc_release_metadata(inode, blocksize, true);
4979 btrfs_delalloc_release_space(inode, data_reserved,
4980 block_start, blocksize, true);
4982 btrfs_delalloc_release_extents(inode, blocksize);
4986 if (only_release_metadata)
4987 btrfs_check_nocow_unlock(inode);
4988 extent_changeset_free(data_reserved);
4992 static int maybe_insert_hole(struct btrfs_root *root, struct btrfs_inode *inode,
4993 u64 offset, u64 len)
4995 struct btrfs_fs_info *fs_info = root->fs_info;
4996 struct btrfs_trans_handle *trans;
4997 struct btrfs_drop_extents_args drop_args = { 0 };
5001 * If NO_HOLES is enabled, we don't need to do anything.
5002 * Later, up in the call chain, either btrfs_set_inode_last_sub_trans()
5003 * or btrfs_update_inode() will be called, which guarantee that the next
5004 * fsync will know this inode was changed and needs to be logged.
5006 if (btrfs_fs_incompat(fs_info, NO_HOLES))
5010 * 1 - for the one we're dropping
5011 * 1 - for the one we're adding
5012 * 1 - for updating the inode.
5014 trans = btrfs_start_transaction(root, 3);
5016 return PTR_ERR(trans);
5018 drop_args.start = offset;
5019 drop_args.end = offset + len;
5020 drop_args.drop_cache = true;
5022 ret = btrfs_drop_extents(trans, root, inode, &drop_args);
5024 btrfs_abort_transaction(trans, ret);
5025 btrfs_end_transaction(trans);
5029 ret = btrfs_insert_hole_extent(trans, root, btrfs_ino(inode), offset, len);
5031 btrfs_abort_transaction(trans, ret);
5033 btrfs_update_inode_bytes(inode, 0, drop_args.bytes_found);
5034 btrfs_update_inode(trans, root, inode);
5036 btrfs_end_transaction(trans);
5041 * This function puts in dummy file extents for the area we're creating a hole
5042 * for. So if we are truncating this file to a larger size we need to insert
5043 * these file extents so that btrfs_get_extent will return a EXTENT_MAP_HOLE for
5044 * the range between oldsize and size
5046 int btrfs_cont_expand(struct btrfs_inode *inode, loff_t oldsize, loff_t size)
5048 struct btrfs_root *root = inode->root;
5049 struct btrfs_fs_info *fs_info = root->fs_info;
5050 struct extent_io_tree *io_tree = &inode->io_tree;
5051 struct extent_map *em = NULL;
5052 struct extent_state *cached_state = NULL;
5053 u64 hole_start = ALIGN(oldsize, fs_info->sectorsize);
5054 u64 block_end = ALIGN(size, fs_info->sectorsize);
5061 * If our size started in the middle of a block we need to zero out the
5062 * rest of the block before we expand the i_size, otherwise we could
5063 * expose stale data.
5065 err = btrfs_truncate_block(inode, oldsize, 0, 0);
5069 if (size <= hole_start)
5072 btrfs_lock_and_flush_ordered_range(inode, hole_start, block_end - 1,
5074 cur_offset = hole_start;
5076 em = btrfs_get_extent(inode, NULL, 0, cur_offset,
5077 block_end - cur_offset);
5083 last_byte = min(extent_map_end(em), block_end);
5084 last_byte = ALIGN(last_byte, fs_info->sectorsize);
5085 hole_size = last_byte - cur_offset;
5087 if (!test_bit(EXTENT_FLAG_PREALLOC, &em->flags)) {
5088 struct extent_map *hole_em;
5090 err = maybe_insert_hole(root, inode, cur_offset,
5095 err = btrfs_inode_set_file_extent_range(inode,
5096 cur_offset, hole_size);
5100 hole_em = alloc_extent_map();
5102 btrfs_drop_extent_map_range(inode, cur_offset,
5103 cur_offset + hole_size - 1,
5105 btrfs_set_inode_full_sync(inode);
5108 hole_em->start = cur_offset;
5109 hole_em->len = hole_size;
5110 hole_em->orig_start = cur_offset;
5112 hole_em->block_start = EXTENT_MAP_HOLE;
5113 hole_em->block_len = 0;
5114 hole_em->orig_block_len = 0;
5115 hole_em->ram_bytes = hole_size;
5116 hole_em->compress_type = BTRFS_COMPRESS_NONE;
5117 hole_em->generation = fs_info->generation;
5119 err = btrfs_replace_extent_map_range(inode, hole_em, true);
5120 free_extent_map(hole_em);
5122 err = btrfs_inode_set_file_extent_range(inode,
5123 cur_offset, hole_size);
5128 free_extent_map(em);
5130 cur_offset = last_byte;
5131 if (cur_offset >= block_end)
5134 free_extent_map(em);
5135 unlock_extent(io_tree, hole_start, block_end - 1, &cached_state);
5139 static int btrfs_setsize(struct inode *inode, struct iattr *attr)
5141 struct btrfs_root *root = BTRFS_I(inode)->root;
5142 struct btrfs_trans_handle *trans;
5143 loff_t oldsize = i_size_read(inode);
5144 loff_t newsize = attr->ia_size;
5145 int mask = attr->ia_valid;
5149 * The regular truncate() case without ATTR_CTIME and ATTR_MTIME is a
5150 * special case where we need to update the times despite not having
5151 * these flags set. For all other operations the VFS set these flags
5152 * explicitly if it wants a timestamp update.
5154 if (newsize != oldsize) {
5155 inode_inc_iversion(inode);
5156 if (!(mask & (ATTR_CTIME | ATTR_MTIME))) {
5157 inode->i_mtime = current_time(inode);
5158 inode->i_ctime = inode->i_mtime;
5162 if (newsize > oldsize) {
5164 * Don't do an expanding truncate while snapshotting is ongoing.
5165 * This is to ensure the snapshot captures a fully consistent
5166 * state of this file - if the snapshot captures this expanding
5167 * truncation, it must capture all writes that happened before
5170 btrfs_drew_write_lock(&root->snapshot_lock);
5171 ret = btrfs_cont_expand(BTRFS_I(inode), oldsize, newsize);
5173 btrfs_drew_write_unlock(&root->snapshot_lock);
5177 trans = btrfs_start_transaction(root, 1);
5178 if (IS_ERR(trans)) {
5179 btrfs_drew_write_unlock(&root->snapshot_lock);
5180 return PTR_ERR(trans);
5183 i_size_write(inode, newsize);
5184 btrfs_inode_safe_disk_i_size_write(BTRFS_I(inode), 0);
5185 pagecache_isize_extended(inode, oldsize, newsize);
5186 ret = btrfs_update_inode(trans, root, BTRFS_I(inode));
5187 btrfs_drew_write_unlock(&root->snapshot_lock);
5188 btrfs_end_transaction(trans);
5190 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
5192 if (btrfs_is_zoned(fs_info)) {
5193 ret = btrfs_wait_ordered_range(inode,
5194 ALIGN(newsize, fs_info->sectorsize),
5201 * We're truncating a file that used to have good data down to
5202 * zero. Make sure any new writes to the file get on disk
5206 set_bit(BTRFS_INODE_FLUSH_ON_CLOSE,
5207 &BTRFS_I(inode)->runtime_flags);
5209 truncate_setsize(inode, newsize);
5211 inode_dio_wait(inode);
5213 ret = btrfs_truncate(inode, newsize == oldsize);
5214 if (ret && inode->i_nlink) {
5218 * Truncate failed, so fix up the in-memory size. We
5219 * adjusted disk_i_size down as we removed extents, so
5220 * wait for disk_i_size to be stable and then update the
5221 * in-memory size to match.
5223 err = btrfs_wait_ordered_range(inode, 0, (u64)-1);
5226 i_size_write(inode, BTRFS_I(inode)->disk_i_size);
5233 static int btrfs_setattr(struct user_namespace *mnt_userns, struct dentry *dentry,
5236 struct inode *inode = d_inode(dentry);
5237 struct btrfs_root *root = BTRFS_I(inode)->root;
5240 if (btrfs_root_readonly(root))
5243 err = setattr_prepare(mnt_userns, dentry, attr);
5247 if (S_ISREG(inode->i_mode) && (attr->ia_valid & ATTR_SIZE)) {
5248 err = btrfs_setsize(inode, attr);
5253 if (attr->ia_valid) {
5254 setattr_copy(mnt_userns, inode, attr);
5255 inode_inc_iversion(inode);
5256 err = btrfs_dirty_inode(inode);
5258 if (!err && attr->ia_valid & ATTR_MODE)
5259 err = posix_acl_chmod(mnt_userns, inode, inode->i_mode);
5266 * While truncating the inode pages during eviction, we get the VFS
5267 * calling btrfs_invalidate_folio() against each folio of the inode. This
5268 * is slow because the calls to btrfs_invalidate_folio() result in a
5269 * huge amount of calls to lock_extent() and clear_extent_bit(),
5270 * which keep merging and splitting extent_state structures over and over,
5271 * wasting lots of time.
5273 * Therefore if the inode is being evicted, let btrfs_invalidate_folio()
5274 * skip all those expensive operations on a per folio basis and do only
5275 * the ordered io finishing, while we release here the extent_map and
5276 * extent_state structures, without the excessive merging and splitting.
5278 static void evict_inode_truncate_pages(struct inode *inode)
5280 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
5281 struct rb_node *node;
5283 ASSERT(inode->i_state & I_FREEING);
5284 truncate_inode_pages_final(&inode->i_data);
5286 btrfs_drop_extent_map_range(BTRFS_I(inode), 0, (u64)-1, false);
5289 * Keep looping until we have no more ranges in the io tree.
5290 * We can have ongoing bios started by readahead that have
5291 * their endio callback (extent_io.c:end_bio_extent_readpage)
5292 * still in progress (unlocked the pages in the bio but did not yet
5293 * unlocked the ranges in the io tree). Therefore this means some
5294 * ranges can still be locked and eviction started because before
5295 * submitting those bios, which are executed by a separate task (work
5296 * queue kthread), inode references (inode->i_count) were not taken
5297 * (which would be dropped in the end io callback of each bio).
5298 * Therefore here we effectively end up waiting for those bios and
5299 * anyone else holding locked ranges without having bumped the inode's
5300 * reference count - if we don't do it, when they access the inode's
5301 * io_tree to unlock a range it may be too late, leading to an
5302 * use-after-free issue.
5304 spin_lock(&io_tree->lock);
5305 while (!RB_EMPTY_ROOT(&io_tree->state)) {
5306 struct extent_state *state;
5307 struct extent_state *cached_state = NULL;
5310 unsigned state_flags;
5312 node = rb_first(&io_tree->state);
5313 state = rb_entry(node, struct extent_state, rb_node);
5314 start = state->start;
5316 state_flags = state->state;
5317 spin_unlock(&io_tree->lock);
5319 lock_extent(io_tree, start, end, &cached_state);
5322 * If still has DELALLOC flag, the extent didn't reach disk,
5323 * and its reserved space won't be freed by delayed_ref.
5324 * So we need to free its reserved space here.
5325 * (Refer to comment in btrfs_invalidate_folio, case 2)
5327 * Note, end is the bytenr of last byte, so we need + 1 here.
5329 if (state_flags & EXTENT_DELALLOC)
5330 btrfs_qgroup_free_data(BTRFS_I(inode), NULL, start,
5333 clear_extent_bit(io_tree, start, end,
5334 EXTENT_CLEAR_ALL_BITS | EXTENT_DO_ACCOUNTING,
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_trans_handle *trans;
5348 u64 delayed_refs_extra = btrfs_calc_insert_metadata_size(fs_info, 1);
5352 * Eviction should be taking place at some place safe because of our
5353 * delayed iputs. However the normal flushing code will run delayed
5354 * iputs, so we cannot use FLUSH_ALL otherwise we'll deadlock.
5356 * We reserve the delayed_refs_extra here again because we can't use
5357 * btrfs_start_transaction(root, 0) for the same deadlocky reason as
5358 * above. We reserve our extra bit here because we generate a ton of
5359 * delayed refs activity by truncating.
5361 * BTRFS_RESERVE_FLUSH_EVICT will steal from the global_rsv if it can,
5362 * if we fail to make this reservation we can re-try without the
5363 * delayed_refs_extra so we can make some forward progress.
5365 ret = btrfs_block_rsv_refill(fs_info, rsv, rsv->size + delayed_refs_extra,
5366 BTRFS_RESERVE_FLUSH_EVICT);
5368 ret = btrfs_block_rsv_refill(fs_info, rsv, rsv->size,
5369 BTRFS_RESERVE_FLUSH_EVICT);
5372 "could not allocate space for delete; will truncate on mount");
5373 return ERR_PTR(-ENOSPC);
5375 delayed_refs_extra = 0;
5378 trans = btrfs_join_transaction(root);
5382 if (delayed_refs_extra) {
5383 trans->block_rsv = &fs_info->trans_block_rsv;
5384 trans->bytes_reserved = delayed_refs_extra;
5385 btrfs_block_rsv_migrate(rsv, trans->block_rsv,
5386 delayed_refs_extra, 1);
5391 void btrfs_evict_inode(struct inode *inode)
5393 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
5394 struct btrfs_trans_handle *trans;
5395 struct btrfs_root *root = BTRFS_I(inode)->root;
5396 struct btrfs_block_rsv *rsv;
5399 trace_btrfs_inode_evict(inode);
5402 fsverity_cleanup_inode(inode);
5407 evict_inode_truncate_pages(inode);
5409 if (inode->i_nlink &&
5410 ((btrfs_root_refs(&root->root_item) != 0 &&
5411 root->root_key.objectid != BTRFS_ROOT_TREE_OBJECTID) ||
5412 btrfs_is_free_space_inode(BTRFS_I(inode))))
5415 if (is_bad_inode(inode))
5418 btrfs_free_io_failure_record(BTRFS_I(inode), 0, (u64)-1);
5420 if (test_bit(BTRFS_FS_LOG_RECOVERING, &fs_info->flags))
5423 if (inode->i_nlink > 0) {
5424 BUG_ON(btrfs_root_refs(&root->root_item) != 0 &&
5425 root->root_key.objectid != BTRFS_ROOT_TREE_OBJECTID);
5430 * This makes sure the inode item in tree is uptodate and the space for
5431 * the inode update is released.
5433 ret = btrfs_commit_inode_delayed_inode(BTRFS_I(inode));
5438 * This drops any pending insert or delete operations we have for this
5439 * inode. We could have a delayed dir index deletion queued up, but
5440 * we're removing the inode completely so that'll be taken care of in
5443 btrfs_kill_delayed_inode_items(BTRFS_I(inode));
5445 rsv = btrfs_alloc_block_rsv(fs_info, BTRFS_BLOCK_RSV_TEMP);
5448 rsv->size = btrfs_calc_metadata_size(fs_info, 1);
5449 rsv->failfast = true;
5451 btrfs_i_size_write(BTRFS_I(inode), 0);
5454 struct btrfs_truncate_control control = {
5455 .inode = BTRFS_I(inode),
5456 .ino = btrfs_ino(BTRFS_I(inode)),
5461 trans = evict_refill_and_join(root, rsv);
5465 trans->block_rsv = rsv;
5467 ret = btrfs_truncate_inode_items(trans, root, &control);
5468 trans->block_rsv = &fs_info->trans_block_rsv;
5469 btrfs_end_transaction(trans);
5470 btrfs_btree_balance_dirty(fs_info);
5471 if (ret && ret != -ENOSPC && ret != -EAGAIN)
5478 * Errors here aren't a big deal, it just means we leave orphan items in
5479 * the tree. They will be cleaned up on the next mount. If the inode
5480 * number gets reused, cleanup deletes the orphan item without doing
5481 * anything, and unlink reuses the existing orphan item.
5483 * If it turns out that we are dropping too many of these, we might want
5484 * to add a mechanism for retrying these after a commit.
5486 trans = evict_refill_and_join(root, rsv);
5487 if (!IS_ERR(trans)) {
5488 trans->block_rsv = rsv;
5489 btrfs_orphan_del(trans, BTRFS_I(inode));
5490 trans->block_rsv = &fs_info->trans_block_rsv;
5491 btrfs_end_transaction(trans);
5495 btrfs_free_block_rsv(fs_info, rsv);
5498 * If we didn't successfully delete, the orphan item will still be in
5499 * the tree and we'll retry on the next mount. Again, we might also want
5500 * to retry these periodically in the future.
5502 btrfs_remove_delayed_node(BTRFS_I(inode));
5503 fsverity_cleanup_inode(inode);
5508 * Return the key found in the dir entry in the location pointer, fill @type
5509 * with BTRFS_FT_*, and return 0.
5511 * If no dir entries were found, returns -ENOENT.
5512 * If found a corrupted location in dir entry, returns -EUCLEAN.
5514 static int btrfs_inode_by_name(struct inode *dir, struct dentry *dentry,
5515 struct btrfs_key *location, u8 *type)
5517 const char *name = dentry->d_name.name;
5518 int namelen = dentry->d_name.len;
5519 struct btrfs_dir_item *di;
5520 struct btrfs_path *path;
5521 struct btrfs_root *root = BTRFS_I(dir)->root;
5524 path = btrfs_alloc_path();
5528 di = btrfs_lookup_dir_item(NULL, root, path, btrfs_ino(BTRFS_I(dir)),
5530 if (IS_ERR_OR_NULL(di)) {
5531 ret = di ? PTR_ERR(di) : -ENOENT;
5535 btrfs_dir_item_key_to_cpu(path->nodes[0], di, location);
5536 if (location->type != BTRFS_INODE_ITEM_KEY &&
5537 location->type != BTRFS_ROOT_ITEM_KEY) {
5539 btrfs_warn(root->fs_info,
5540 "%s gets something invalid in DIR_ITEM (name %s, directory ino %llu, location(%llu %u %llu))",
5541 __func__, name, btrfs_ino(BTRFS_I(dir)),
5542 location->objectid, location->type, location->offset);
5545 *type = btrfs_dir_type(path->nodes[0], di);
5547 btrfs_free_path(path);
5552 * when we hit a tree root in a directory, the btrfs part of the inode
5553 * needs to be changed to reflect the root directory of the tree root. This
5554 * is kind of like crossing a mount point.
5556 static int fixup_tree_root_location(struct btrfs_fs_info *fs_info,
5558 struct dentry *dentry,
5559 struct btrfs_key *location,
5560 struct btrfs_root **sub_root)
5562 struct btrfs_path *path;
5563 struct btrfs_root *new_root;
5564 struct btrfs_root_ref *ref;
5565 struct extent_buffer *leaf;
5566 struct btrfs_key key;
5570 path = btrfs_alloc_path();
5577 key.objectid = BTRFS_I(dir)->root->root_key.objectid;
5578 key.type = BTRFS_ROOT_REF_KEY;
5579 key.offset = location->objectid;
5581 ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, path, 0, 0);
5588 leaf = path->nodes[0];
5589 ref = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_ref);
5590 if (btrfs_root_ref_dirid(leaf, ref) != btrfs_ino(BTRFS_I(dir)) ||
5591 btrfs_root_ref_name_len(leaf, ref) != dentry->d_name.len)
5594 ret = memcmp_extent_buffer(leaf, dentry->d_name.name,
5595 (unsigned long)(ref + 1),
5596 dentry->d_name.len);
5600 btrfs_release_path(path);
5602 new_root = btrfs_get_fs_root(fs_info, location->objectid, true);
5603 if (IS_ERR(new_root)) {
5604 err = PTR_ERR(new_root);
5608 *sub_root = new_root;
5609 location->objectid = btrfs_root_dirid(&new_root->root_item);
5610 location->type = BTRFS_INODE_ITEM_KEY;
5611 location->offset = 0;
5614 btrfs_free_path(path);
5618 static void inode_tree_add(struct inode *inode)
5620 struct btrfs_root *root = BTRFS_I(inode)->root;
5621 struct btrfs_inode *entry;
5623 struct rb_node *parent;
5624 struct rb_node *new = &BTRFS_I(inode)->rb_node;
5625 u64 ino = btrfs_ino(BTRFS_I(inode));
5627 if (inode_unhashed(inode))
5630 spin_lock(&root->inode_lock);
5631 p = &root->inode_tree.rb_node;
5634 entry = rb_entry(parent, struct btrfs_inode, rb_node);
5636 if (ino < btrfs_ino(entry))
5637 p = &parent->rb_left;
5638 else if (ino > btrfs_ino(entry))
5639 p = &parent->rb_right;
5641 WARN_ON(!(entry->vfs_inode.i_state &
5642 (I_WILL_FREE | I_FREEING)));
5643 rb_replace_node(parent, new, &root->inode_tree);
5644 RB_CLEAR_NODE(parent);
5645 spin_unlock(&root->inode_lock);
5649 rb_link_node(new, parent, p);
5650 rb_insert_color(new, &root->inode_tree);
5651 spin_unlock(&root->inode_lock);
5654 static void inode_tree_del(struct btrfs_inode *inode)
5656 struct btrfs_root *root = inode->root;
5659 spin_lock(&root->inode_lock);
5660 if (!RB_EMPTY_NODE(&inode->rb_node)) {
5661 rb_erase(&inode->rb_node, &root->inode_tree);
5662 RB_CLEAR_NODE(&inode->rb_node);
5663 empty = RB_EMPTY_ROOT(&root->inode_tree);
5665 spin_unlock(&root->inode_lock);
5667 if (empty && btrfs_root_refs(&root->root_item) == 0) {
5668 spin_lock(&root->inode_lock);
5669 empty = RB_EMPTY_ROOT(&root->inode_tree);
5670 spin_unlock(&root->inode_lock);
5672 btrfs_add_dead_root(root);
5677 static int btrfs_init_locked_inode(struct inode *inode, void *p)
5679 struct btrfs_iget_args *args = p;
5681 inode->i_ino = args->ino;
5682 BTRFS_I(inode)->location.objectid = args->ino;
5683 BTRFS_I(inode)->location.type = BTRFS_INODE_ITEM_KEY;
5684 BTRFS_I(inode)->location.offset = 0;
5685 BTRFS_I(inode)->root = btrfs_grab_root(args->root);
5686 BUG_ON(args->root && !BTRFS_I(inode)->root);
5688 if (args->root && args->root == args->root->fs_info->tree_root &&
5689 args->ino != BTRFS_BTREE_INODE_OBJECTID)
5690 set_bit(BTRFS_INODE_FREE_SPACE_INODE,
5691 &BTRFS_I(inode)->runtime_flags);
5695 static int btrfs_find_actor(struct inode *inode, void *opaque)
5697 struct btrfs_iget_args *args = opaque;
5699 return args->ino == BTRFS_I(inode)->location.objectid &&
5700 args->root == BTRFS_I(inode)->root;
5703 static struct inode *btrfs_iget_locked(struct super_block *s, u64 ino,
5704 struct btrfs_root *root)
5706 struct inode *inode;
5707 struct btrfs_iget_args args;
5708 unsigned long hashval = btrfs_inode_hash(ino, root);
5713 inode = iget5_locked(s, hashval, btrfs_find_actor,
5714 btrfs_init_locked_inode,
5720 * Get an inode object given its inode number and corresponding root.
5721 * Path can be preallocated to prevent recursing back to iget through
5722 * allocator. NULL is also valid but may require an additional allocation
5725 struct inode *btrfs_iget_path(struct super_block *s, u64 ino,
5726 struct btrfs_root *root, struct btrfs_path *path)
5728 struct inode *inode;
5730 inode = btrfs_iget_locked(s, ino, root);
5732 return ERR_PTR(-ENOMEM);
5734 if (inode->i_state & I_NEW) {
5737 ret = btrfs_read_locked_inode(inode, path);
5739 inode_tree_add(inode);
5740 unlock_new_inode(inode);
5744 * ret > 0 can come from btrfs_search_slot called by
5745 * btrfs_read_locked_inode, this means the inode item
5750 inode = ERR_PTR(ret);
5757 struct inode *btrfs_iget(struct super_block *s, u64 ino, struct btrfs_root *root)
5759 return btrfs_iget_path(s, ino, root, NULL);
5762 static struct inode *new_simple_dir(struct super_block *s,
5763 struct btrfs_key *key,
5764 struct btrfs_root *root)
5766 struct inode *inode = new_inode(s);
5769 return ERR_PTR(-ENOMEM);
5771 BTRFS_I(inode)->root = btrfs_grab_root(root);
5772 memcpy(&BTRFS_I(inode)->location, key, sizeof(*key));
5773 set_bit(BTRFS_INODE_DUMMY, &BTRFS_I(inode)->runtime_flags);
5775 inode->i_ino = BTRFS_EMPTY_SUBVOL_DIR_OBJECTID;
5777 * We only need lookup, the rest is read-only and there's no inode
5778 * associated with the dentry
5780 inode->i_op = &simple_dir_inode_operations;
5781 inode->i_opflags &= ~IOP_XATTR;
5782 inode->i_fop = &simple_dir_operations;
5783 inode->i_mode = S_IFDIR | S_IRUGO | S_IWUSR | S_IXUGO;
5784 inode->i_mtime = current_time(inode);
5785 inode->i_atime = inode->i_mtime;
5786 inode->i_ctime = inode->i_mtime;
5787 BTRFS_I(inode)->i_otime = inode->i_mtime;
5792 static_assert(BTRFS_FT_UNKNOWN == FT_UNKNOWN);
5793 static_assert(BTRFS_FT_REG_FILE == FT_REG_FILE);
5794 static_assert(BTRFS_FT_DIR == FT_DIR);
5795 static_assert(BTRFS_FT_CHRDEV == FT_CHRDEV);
5796 static_assert(BTRFS_FT_BLKDEV == FT_BLKDEV);
5797 static_assert(BTRFS_FT_FIFO == FT_FIFO);
5798 static_assert(BTRFS_FT_SOCK == FT_SOCK);
5799 static_assert(BTRFS_FT_SYMLINK == FT_SYMLINK);
5801 static inline u8 btrfs_inode_type(struct inode *inode)
5803 return fs_umode_to_ftype(inode->i_mode);
5806 struct inode *btrfs_lookup_dentry(struct inode *dir, struct dentry *dentry)
5808 struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
5809 struct inode *inode;
5810 struct btrfs_root *root = BTRFS_I(dir)->root;
5811 struct btrfs_root *sub_root = root;
5812 struct btrfs_key location;
5816 if (dentry->d_name.len > BTRFS_NAME_LEN)
5817 return ERR_PTR(-ENAMETOOLONG);
5819 ret = btrfs_inode_by_name(dir, dentry, &location, &di_type);
5821 return ERR_PTR(ret);
5823 if (location.type == BTRFS_INODE_ITEM_KEY) {
5824 inode = btrfs_iget(dir->i_sb, location.objectid, root);
5828 /* Do extra check against inode mode with di_type */
5829 if (btrfs_inode_type(inode) != di_type) {
5831 "inode mode mismatch with dir: inode mode=0%o btrfs type=%u dir type=%u",
5832 inode->i_mode, btrfs_inode_type(inode),
5835 return ERR_PTR(-EUCLEAN);
5840 ret = fixup_tree_root_location(fs_info, dir, dentry,
5841 &location, &sub_root);
5844 inode = ERR_PTR(ret);
5846 inode = new_simple_dir(dir->i_sb, &location, root);
5848 inode = btrfs_iget(dir->i_sb, location.objectid, sub_root);
5849 btrfs_put_root(sub_root);
5854 down_read(&fs_info->cleanup_work_sem);
5855 if (!sb_rdonly(inode->i_sb))
5856 ret = btrfs_orphan_cleanup(sub_root);
5857 up_read(&fs_info->cleanup_work_sem);
5860 inode = ERR_PTR(ret);
5867 static int btrfs_dentry_delete(const struct dentry *dentry)
5869 struct btrfs_root *root;
5870 struct inode *inode = d_inode(dentry);
5872 if (!inode && !IS_ROOT(dentry))
5873 inode = d_inode(dentry->d_parent);
5876 root = BTRFS_I(inode)->root;
5877 if (btrfs_root_refs(&root->root_item) == 0)
5880 if (btrfs_ino(BTRFS_I(inode)) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)
5886 static struct dentry *btrfs_lookup(struct inode *dir, struct dentry *dentry,
5889 struct inode *inode = btrfs_lookup_dentry(dir, dentry);
5891 if (inode == ERR_PTR(-ENOENT))
5893 return d_splice_alias(inode, dentry);
5897 * All this infrastructure exists because dir_emit can fault, and we are holding
5898 * the tree lock when doing readdir. For now just allocate a buffer and copy
5899 * our information into that, and then dir_emit from the buffer. This is
5900 * similar to what NFS does, only we don't keep the buffer around in pagecache
5901 * because I'm afraid I'll mess that up. Long term we need to make filldir do
5902 * copy_to_user_inatomic so we don't have to worry about page faulting under the
5905 static int btrfs_opendir(struct inode *inode, struct file *file)
5907 struct btrfs_file_private *private;
5909 private = kzalloc(sizeof(struct btrfs_file_private), GFP_KERNEL);
5912 private->filldir_buf = kzalloc(PAGE_SIZE, GFP_KERNEL);
5913 if (!private->filldir_buf) {
5917 file->private_data = private;
5928 static int btrfs_filldir(void *addr, int entries, struct dir_context *ctx)
5931 struct dir_entry *entry = addr;
5932 char *name = (char *)(entry + 1);
5934 ctx->pos = get_unaligned(&entry->offset);
5935 if (!dir_emit(ctx, name, get_unaligned(&entry->name_len),
5936 get_unaligned(&entry->ino),
5937 get_unaligned(&entry->type)))
5939 addr += sizeof(struct dir_entry) +
5940 get_unaligned(&entry->name_len);
5946 static int btrfs_real_readdir(struct file *file, struct dir_context *ctx)
5948 struct inode *inode = file_inode(file);
5949 struct btrfs_root *root = BTRFS_I(inode)->root;
5950 struct btrfs_file_private *private = file->private_data;
5951 struct btrfs_dir_item *di;
5952 struct btrfs_key key;
5953 struct btrfs_key found_key;
5954 struct btrfs_path *path;
5956 struct list_head ins_list;
5957 struct list_head del_list;
5964 struct btrfs_key location;
5966 if (!dir_emit_dots(file, ctx))
5969 path = btrfs_alloc_path();
5973 addr = private->filldir_buf;
5974 path->reada = READA_FORWARD;
5976 INIT_LIST_HEAD(&ins_list);
5977 INIT_LIST_HEAD(&del_list);
5978 put = btrfs_readdir_get_delayed_items(inode, &ins_list, &del_list);
5981 key.type = BTRFS_DIR_INDEX_KEY;
5982 key.offset = ctx->pos;
5983 key.objectid = btrfs_ino(BTRFS_I(inode));
5985 btrfs_for_each_slot(root, &key, &found_key, path, ret) {
5986 struct dir_entry *entry;
5987 struct extent_buffer *leaf = path->nodes[0];
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, path->slots[0], 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;
6025 /* Catch error encountered during iteration */
6029 btrfs_release_path(path);
6031 ret = btrfs_filldir(private->filldir_buf, entries, ctx);
6035 ret = btrfs_readdir_delayed_dir_index(ctx, &ins_list);
6040 * Stop new entries from being returned after we return the last
6043 * New directory entries are assigned a strictly increasing
6044 * offset. This means that new entries created during readdir
6045 * are *guaranteed* to be seen in the future by that readdir.
6046 * This has broken buggy programs which operate on names as
6047 * they're returned by readdir. Until we re-use freed offsets
6048 * we have this hack to stop new entries from being returned
6049 * under the assumption that they'll never reach this huge
6052 * This is being careful not to overflow 32bit loff_t unless the
6053 * last entry requires it because doing so has broken 32bit apps
6056 if (ctx->pos >= INT_MAX)
6057 ctx->pos = LLONG_MAX;
6064 btrfs_readdir_put_delayed_items(inode, &ins_list, &del_list);
6065 btrfs_free_path(path);
6070 * This is somewhat expensive, updating the tree every time the
6071 * inode changes. But, it is most likely to find the inode in cache.
6072 * FIXME, needs more benchmarking...there are no reasons other than performance
6073 * to keep or drop this code.
6075 static int btrfs_dirty_inode(struct inode *inode)
6077 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
6078 struct btrfs_root *root = BTRFS_I(inode)->root;
6079 struct btrfs_trans_handle *trans;
6082 if (test_bit(BTRFS_INODE_DUMMY, &BTRFS_I(inode)->runtime_flags))
6085 trans = btrfs_join_transaction(root);
6087 return PTR_ERR(trans);
6089 ret = btrfs_update_inode(trans, root, BTRFS_I(inode));
6090 if (ret && (ret == -ENOSPC || ret == -EDQUOT)) {
6091 /* whoops, lets try again with the full transaction */
6092 btrfs_end_transaction(trans);
6093 trans = btrfs_start_transaction(root, 1);
6095 return PTR_ERR(trans);
6097 ret = btrfs_update_inode(trans, root, BTRFS_I(inode));
6099 btrfs_end_transaction(trans);
6100 if (BTRFS_I(inode)->delayed_node)
6101 btrfs_balance_delayed_items(fs_info);
6107 * This is a copy of file_update_time. We need this so we can return error on
6108 * ENOSPC for updating the inode in the case of file write and mmap writes.
6110 static int btrfs_update_time(struct inode *inode, struct timespec64 *now,
6113 struct btrfs_root *root = BTRFS_I(inode)->root;
6114 bool dirty = flags & ~S_VERSION;
6116 if (btrfs_root_readonly(root))
6119 if (flags & S_VERSION)
6120 dirty |= inode_maybe_inc_iversion(inode, dirty);
6121 if (flags & S_CTIME)
6122 inode->i_ctime = *now;
6123 if (flags & S_MTIME)
6124 inode->i_mtime = *now;
6125 if (flags & S_ATIME)
6126 inode->i_atime = *now;
6127 return dirty ? btrfs_dirty_inode(inode) : 0;
6131 * find the highest existing sequence number in a directory
6132 * and then set the in-memory index_cnt variable to reflect
6133 * free sequence numbers
6135 static int btrfs_set_inode_index_count(struct btrfs_inode *inode)
6137 struct btrfs_root *root = inode->root;
6138 struct btrfs_key key, found_key;
6139 struct btrfs_path *path;
6140 struct extent_buffer *leaf;
6143 key.objectid = btrfs_ino(inode);
6144 key.type = BTRFS_DIR_INDEX_KEY;
6145 key.offset = (u64)-1;
6147 path = btrfs_alloc_path();
6151 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
6154 /* FIXME: we should be able to handle this */
6159 if (path->slots[0] == 0) {
6160 inode->index_cnt = BTRFS_DIR_START_INDEX;
6166 leaf = path->nodes[0];
6167 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
6169 if (found_key.objectid != btrfs_ino(inode) ||
6170 found_key.type != BTRFS_DIR_INDEX_KEY) {
6171 inode->index_cnt = BTRFS_DIR_START_INDEX;
6175 inode->index_cnt = found_key.offset + 1;
6177 btrfs_free_path(path);
6182 * helper to find a free sequence number in a given directory. This current
6183 * code is very simple, later versions will do smarter things in the btree
6185 int btrfs_set_inode_index(struct btrfs_inode *dir, u64 *index)
6189 if (dir->index_cnt == (u64)-1) {
6190 ret = btrfs_inode_delayed_dir_index_count(dir);
6192 ret = btrfs_set_inode_index_count(dir);
6198 *index = dir->index_cnt;
6204 static int btrfs_insert_inode_locked(struct inode *inode)
6206 struct btrfs_iget_args args;
6208 args.ino = BTRFS_I(inode)->location.objectid;
6209 args.root = BTRFS_I(inode)->root;
6211 return insert_inode_locked4(inode,
6212 btrfs_inode_hash(inode->i_ino, BTRFS_I(inode)->root),
6213 btrfs_find_actor, &args);
6216 int btrfs_new_inode_prepare(struct btrfs_new_inode_args *args,
6217 unsigned int *trans_num_items)
6219 struct inode *dir = args->dir;
6220 struct inode *inode = args->inode;
6223 ret = posix_acl_create(dir, &inode->i_mode, &args->default_acl, &args->acl);
6227 /* 1 to add inode item */
6228 *trans_num_items = 1;
6229 /* 1 to add compression property */
6230 if (BTRFS_I(dir)->prop_compress)
6231 (*trans_num_items)++;
6232 /* 1 to add default ACL xattr */
6233 if (args->default_acl)
6234 (*trans_num_items)++;
6235 /* 1 to add access ACL xattr */
6237 (*trans_num_items)++;
6238 #ifdef CONFIG_SECURITY
6239 /* 1 to add LSM xattr */
6240 if (dir->i_security)
6241 (*trans_num_items)++;
6244 /* 1 to add orphan item */
6245 (*trans_num_items)++;
6249 * 1 to add dir index
6250 * 1 to update parent inode item
6252 * No need for 1 unit for the inode ref item because it is
6253 * inserted in a batch together with the inode item at
6254 * btrfs_create_new_inode().
6256 *trans_num_items += 3;
6261 void btrfs_new_inode_args_destroy(struct btrfs_new_inode_args *args)
6263 posix_acl_release(args->acl);
6264 posix_acl_release(args->default_acl);
6268 * Inherit flags from the parent inode.
6270 * Currently only the compression flags and the cow flags are inherited.
6272 static void btrfs_inherit_iflags(struct inode *inode, struct inode *dir)
6276 flags = BTRFS_I(dir)->flags;
6278 if (flags & BTRFS_INODE_NOCOMPRESS) {
6279 BTRFS_I(inode)->flags &= ~BTRFS_INODE_COMPRESS;
6280 BTRFS_I(inode)->flags |= BTRFS_INODE_NOCOMPRESS;
6281 } else if (flags & BTRFS_INODE_COMPRESS) {
6282 BTRFS_I(inode)->flags &= ~BTRFS_INODE_NOCOMPRESS;
6283 BTRFS_I(inode)->flags |= BTRFS_INODE_COMPRESS;
6286 if (flags & BTRFS_INODE_NODATACOW) {
6287 BTRFS_I(inode)->flags |= BTRFS_INODE_NODATACOW;
6288 if (S_ISREG(inode->i_mode))
6289 BTRFS_I(inode)->flags |= BTRFS_INODE_NODATASUM;
6292 btrfs_sync_inode_flags_to_i_flags(inode);
6295 int btrfs_create_new_inode(struct btrfs_trans_handle *trans,
6296 struct btrfs_new_inode_args *args)
6298 struct inode *dir = args->dir;
6299 struct inode *inode = args->inode;
6300 const char *name = args->orphan ? NULL : args->dentry->d_name.name;
6301 int name_len = args->orphan ? 0 : args->dentry->d_name.len;
6302 struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
6303 struct btrfs_root *root;
6304 struct btrfs_inode_item *inode_item;
6305 struct btrfs_key *location;
6306 struct btrfs_path *path;
6308 struct btrfs_inode_ref *ref;
6309 struct btrfs_key key[2];
6311 struct btrfs_item_batch batch;
6315 path = btrfs_alloc_path();
6320 BTRFS_I(inode)->root = btrfs_grab_root(BTRFS_I(dir)->root);
6321 root = BTRFS_I(inode)->root;
6323 ret = btrfs_get_free_objectid(root, &objectid);
6326 inode->i_ino = objectid;
6330 * O_TMPFILE, set link count to 0, so that after this point, we
6331 * fill in an inode item with the correct link count.
6333 set_nlink(inode, 0);
6335 trace_btrfs_inode_request(dir);
6337 ret = btrfs_set_inode_index(BTRFS_I(dir), &BTRFS_I(inode)->dir_index);
6341 /* index_cnt is ignored for everything but a dir. */
6342 BTRFS_I(inode)->index_cnt = BTRFS_DIR_START_INDEX;
6343 BTRFS_I(inode)->generation = trans->transid;
6344 inode->i_generation = BTRFS_I(inode)->generation;
6347 * Subvolumes don't inherit flags from their parent directory.
6348 * Originally this was probably by accident, but we probably can't
6349 * change it now without compatibility issues.
6352 btrfs_inherit_iflags(inode, dir);
6354 if (S_ISREG(inode->i_mode)) {
6355 if (btrfs_test_opt(fs_info, NODATASUM))
6356 BTRFS_I(inode)->flags |= BTRFS_INODE_NODATASUM;
6357 if (btrfs_test_opt(fs_info, NODATACOW))
6358 BTRFS_I(inode)->flags |= BTRFS_INODE_NODATACOW |
6359 BTRFS_INODE_NODATASUM;
6362 location = &BTRFS_I(inode)->location;
6363 location->objectid = objectid;
6364 location->offset = 0;
6365 location->type = BTRFS_INODE_ITEM_KEY;
6367 ret = btrfs_insert_inode_locked(inode);
6370 BTRFS_I(dir)->index_cnt--;
6375 * We could have gotten an inode number from somebody who was fsynced
6376 * and then removed in this same transaction, so let's just set full
6377 * sync since it will be a full sync anyway and this will blow away the
6378 * old info in the log.
6380 btrfs_set_inode_full_sync(BTRFS_I(inode));
6382 key[0].objectid = objectid;
6383 key[0].type = BTRFS_INODE_ITEM_KEY;
6386 sizes[0] = sizeof(struct btrfs_inode_item);
6388 if (!args->orphan) {
6390 * Start new inodes with an inode_ref. This is slightly more
6391 * efficient for small numbers of hard links since they will
6392 * be packed into one item. Extended refs will kick in if we
6393 * add more hard links than can fit in the ref item.
6395 key[1].objectid = objectid;
6396 key[1].type = BTRFS_INODE_REF_KEY;
6398 key[1].offset = objectid;
6399 sizes[1] = 2 + sizeof(*ref);
6401 key[1].offset = btrfs_ino(BTRFS_I(dir));
6402 sizes[1] = name_len + sizeof(*ref);
6406 batch.keys = &key[0];
6407 batch.data_sizes = &sizes[0];
6408 batch.total_data_size = sizes[0] + (args->orphan ? 0 : sizes[1]);
6409 batch.nr = args->orphan ? 1 : 2;
6410 ret = btrfs_insert_empty_items(trans, root, path, &batch);
6412 btrfs_abort_transaction(trans, ret);
6416 inode->i_mtime = current_time(inode);
6417 inode->i_atime = inode->i_mtime;
6418 inode->i_ctime = inode->i_mtime;
6419 BTRFS_I(inode)->i_otime = inode->i_mtime;
6422 * We're going to fill the inode item now, so at this point the inode
6423 * must be fully initialized.
6426 inode_item = btrfs_item_ptr(path->nodes[0], path->slots[0],
6427 struct btrfs_inode_item);
6428 memzero_extent_buffer(path->nodes[0], (unsigned long)inode_item,
6429 sizeof(*inode_item));
6430 fill_inode_item(trans, path->nodes[0], inode_item, inode);
6432 if (!args->orphan) {
6433 ref = btrfs_item_ptr(path->nodes[0], path->slots[0] + 1,
6434 struct btrfs_inode_ref);
6435 ptr = (unsigned long)(ref + 1);
6437 btrfs_set_inode_ref_name_len(path->nodes[0], ref, 2);
6438 btrfs_set_inode_ref_index(path->nodes[0], ref, 0);
6439 write_extent_buffer(path->nodes[0], "..", ptr, 2);
6441 btrfs_set_inode_ref_name_len(path->nodes[0], ref, name_len);
6442 btrfs_set_inode_ref_index(path->nodes[0], ref,
6443 BTRFS_I(inode)->dir_index);
6444 write_extent_buffer(path->nodes[0], name, ptr, name_len);
6448 btrfs_mark_buffer_dirty(path->nodes[0]);
6450 * We don't need the path anymore, plus inheriting properties, adding
6451 * ACLs, security xattrs, orphan item or adding the link, will result in
6452 * allocating yet another path. So just free our path.
6454 btrfs_free_path(path);
6458 struct inode *parent;
6461 * Subvolumes inherit properties from their parent subvolume,
6462 * not the directory they were created in.
6464 parent = btrfs_iget(fs_info->sb, BTRFS_FIRST_FREE_OBJECTID,
6465 BTRFS_I(dir)->root);
6466 if (IS_ERR(parent)) {
6467 ret = PTR_ERR(parent);
6469 ret = btrfs_inode_inherit_props(trans, inode, parent);
6473 ret = btrfs_inode_inherit_props(trans, inode, dir);
6477 "error inheriting props for ino %llu (root %llu): %d",
6478 btrfs_ino(BTRFS_I(inode)), root->root_key.objectid,
6483 * Subvolumes don't inherit ACLs or get passed to the LSM. This is
6486 if (!args->subvol) {
6487 ret = btrfs_init_inode_security(trans, args);
6489 btrfs_abort_transaction(trans, ret);
6494 inode_tree_add(inode);
6496 trace_btrfs_inode_new(inode);
6497 btrfs_set_inode_last_trans(trans, BTRFS_I(inode));
6499 btrfs_update_root_times(trans, root);
6502 ret = btrfs_orphan_add(trans, BTRFS_I(inode));
6504 ret = btrfs_add_link(trans, BTRFS_I(dir), BTRFS_I(inode), name,
6505 name_len, 0, BTRFS_I(inode)->dir_index);
6508 btrfs_abort_transaction(trans, ret);
6516 * discard_new_inode() calls iput(), but the caller owns the reference
6520 discard_new_inode(inode);
6522 btrfs_free_path(path);
6527 * utility function to add 'inode' into 'parent_inode' with
6528 * a give name and a given sequence number.
6529 * if 'add_backref' is true, also insert a backref from the
6530 * inode to the parent directory.
6532 int btrfs_add_link(struct btrfs_trans_handle *trans,
6533 struct btrfs_inode *parent_inode, struct btrfs_inode *inode,
6534 const char *name, int name_len, int add_backref, u64 index)
6537 struct btrfs_key key;
6538 struct btrfs_root *root = parent_inode->root;
6539 u64 ino = btrfs_ino(inode);
6540 u64 parent_ino = btrfs_ino(parent_inode);
6542 if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) {
6543 memcpy(&key, &inode->root->root_key, sizeof(key));
6546 key.type = BTRFS_INODE_ITEM_KEY;
6550 if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) {
6551 ret = btrfs_add_root_ref(trans, key.objectid,
6552 root->root_key.objectid, parent_ino,
6553 index, name, name_len);
6554 } else if (add_backref) {
6555 ret = btrfs_insert_inode_ref(trans, root, name, name_len, ino,
6559 /* Nothing to clean up yet */
6563 ret = btrfs_insert_dir_item(trans, name, name_len, parent_inode, &key,
6564 btrfs_inode_type(&inode->vfs_inode), index);
6565 if (ret == -EEXIST || ret == -EOVERFLOW)
6568 btrfs_abort_transaction(trans, ret);
6572 btrfs_i_size_write(parent_inode, parent_inode->vfs_inode.i_size +
6574 inode_inc_iversion(&parent_inode->vfs_inode);
6576 * If we are replaying a log tree, we do not want to update the mtime
6577 * and ctime of the parent directory with the current time, since the
6578 * log replay procedure is responsible for setting them to their correct
6579 * values (the ones it had when the fsync was done).
6581 if (!test_bit(BTRFS_FS_LOG_RECOVERING, &root->fs_info->flags)) {
6582 struct timespec64 now = current_time(&parent_inode->vfs_inode);
6584 parent_inode->vfs_inode.i_mtime = now;
6585 parent_inode->vfs_inode.i_ctime = now;
6587 ret = btrfs_update_inode(trans, root, parent_inode);
6589 btrfs_abort_transaction(trans, ret);
6593 if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) {
6596 err = btrfs_del_root_ref(trans, key.objectid,
6597 root->root_key.objectid, parent_ino,
6598 &local_index, name, name_len);
6600 btrfs_abort_transaction(trans, err);
6601 } else if (add_backref) {
6605 err = btrfs_del_inode_ref(trans, root, name, name_len,
6606 ino, parent_ino, &local_index);
6608 btrfs_abort_transaction(trans, err);
6611 /* Return the original error code */
6615 static int btrfs_create_common(struct inode *dir, struct dentry *dentry,
6616 struct inode *inode)
6618 struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
6619 struct btrfs_root *root = BTRFS_I(dir)->root;
6620 struct btrfs_new_inode_args new_inode_args = {
6625 unsigned int trans_num_items;
6626 struct btrfs_trans_handle *trans;
6629 err = btrfs_new_inode_prepare(&new_inode_args, &trans_num_items);
6633 trans = btrfs_start_transaction(root, trans_num_items);
6634 if (IS_ERR(trans)) {
6635 err = PTR_ERR(trans);
6636 goto out_new_inode_args;
6639 err = btrfs_create_new_inode(trans, &new_inode_args);
6641 d_instantiate_new(dentry, inode);
6643 btrfs_end_transaction(trans);
6644 btrfs_btree_balance_dirty(fs_info);
6646 btrfs_new_inode_args_destroy(&new_inode_args);
6653 static int btrfs_mknod(struct user_namespace *mnt_userns, struct inode *dir,
6654 struct dentry *dentry, umode_t mode, dev_t rdev)
6656 struct inode *inode;
6658 inode = new_inode(dir->i_sb);
6661 inode_init_owner(mnt_userns, inode, dir, mode);
6662 inode->i_op = &btrfs_special_inode_operations;
6663 init_special_inode(inode, inode->i_mode, rdev);
6664 return btrfs_create_common(dir, dentry, inode);
6667 static int btrfs_create(struct user_namespace *mnt_userns, struct inode *dir,
6668 struct dentry *dentry, umode_t mode, bool excl)
6670 struct inode *inode;
6672 inode = new_inode(dir->i_sb);
6675 inode_init_owner(mnt_userns, inode, dir, mode);
6676 inode->i_fop = &btrfs_file_operations;
6677 inode->i_op = &btrfs_file_inode_operations;
6678 inode->i_mapping->a_ops = &btrfs_aops;
6679 return btrfs_create_common(dir, dentry, inode);
6682 static int btrfs_link(struct dentry *old_dentry, struct inode *dir,
6683 struct dentry *dentry)
6685 struct btrfs_trans_handle *trans = NULL;
6686 struct btrfs_root *root = BTRFS_I(dir)->root;
6687 struct inode *inode = d_inode(old_dentry);
6688 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
6693 /* do not allow sys_link's with other subvols of the same device */
6694 if (root->root_key.objectid != BTRFS_I(inode)->root->root_key.objectid)
6697 if (inode->i_nlink >= BTRFS_LINK_MAX)
6700 err = btrfs_set_inode_index(BTRFS_I(dir), &index);
6705 * 2 items for inode and inode ref
6706 * 2 items for dir items
6707 * 1 item for parent inode
6708 * 1 item for orphan item deletion if O_TMPFILE
6710 trans = btrfs_start_transaction(root, inode->i_nlink ? 5 : 6);
6711 if (IS_ERR(trans)) {
6712 err = PTR_ERR(trans);
6717 /* There are several dir indexes for this inode, clear the cache. */
6718 BTRFS_I(inode)->dir_index = 0ULL;
6720 inode_inc_iversion(inode);
6721 inode->i_ctime = current_time(inode);
6723 set_bit(BTRFS_INODE_COPY_EVERYTHING, &BTRFS_I(inode)->runtime_flags);
6725 err = btrfs_add_link(trans, BTRFS_I(dir), BTRFS_I(inode),
6726 dentry->d_name.name, dentry->d_name.len, 1, index);
6731 struct dentry *parent = dentry->d_parent;
6733 err = btrfs_update_inode(trans, root, BTRFS_I(inode));
6736 if (inode->i_nlink == 1) {
6738 * If new hard link count is 1, it's a file created
6739 * with open(2) O_TMPFILE flag.
6741 err = btrfs_orphan_del(trans, BTRFS_I(inode));
6745 d_instantiate(dentry, inode);
6746 btrfs_log_new_name(trans, old_dentry, NULL, 0, parent);
6751 btrfs_end_transaction(trans);
6753 inode_dec_link_count(inode);
6756 btrfs_btree_balance_dirty(fs_info);
6760 static int btrfs_mkdir(struct user_namespace *mnt_userns, struct inode *dir,
6761 struct dentry *dentry, umode_t mode)
6763 struct inode *inode;
6765 inode = new_inode(dir->i_sb);
6768 inode_init_owner(mnt_userns, inode, dir, S_IFDIR | mode);
6769 inode->i_op = &btrfs_dir_inode_operations;
6770 inode->i_fop = &btrfs_dir_file_operations;
6771 return btrfs_create_common(dir, dentry, inode);
6774 static noinline int uncompress_inline(struct btrfs_path *path,
6776 size_t pg_offset, u64 extent_offset,
6777 struct btrfs_file_extent_item *item)
6780 struct extent_buffer *leaf = path->nodes[0];
6783 unsigned long inline_size;
6787 WARN_ON(pg_offset != 0);
6788 compress_type = btrfs_file_extent_compression(leaf, item);
6789 max_size = btrfs_file_extent_ram_bytes(leaf, item);
6790 inline_size = btrfs_file_extent_inline_item_len(leaf, path->slots[0]);
6791 tmp = kmalloc(inline_size, GFP_NOFS);
6794 ptr = btrfs_file_extent_inline_start(item);
6796 read_extent_buffer(leaf, tmp, ptr, inline_size);
6798 max_size = min_t(unsigned long, PAGE_SIZE, max_size);
6799 ret = btrfs_decompress(compress_type, tmp, page,
6800 extent_offset, inline_size, max_size);
6803 * decompression code contains a memset to fill in any space between the end
6804 * of the uncompressed data and the end of max_size in case the decompressed
6805 * data ends up shorter than ram_bytes. That doesn't cover the hole between
6806 * the end of an inline extent and the beginning of the next block, so we
6807 * cover that region here.
6810 if (max_size + pg_offset < PAGE_SIZE)
6811 memzero_page(page, pg_offset + max_size,
6812 PAGE_SIZE - max_size - pg_offset);
6818 * btrfs_get_extent - Lookup the first extent overlapping a range in a file.
6819 * @inode: file to search in
6820 * @page: page to read extent data into if the extent is inline
6821 * @pg_offset: offset into @page to copy to
6822 * @start: file offset
6823 * @len: length of range starting at @start
6825 * This returns the first &struct extent_map which overlaps with the given
6826 * range, reading it from the B-tree and caching it if necessary. Note that
6827 * there may be more extents which overlap the given range after the returned
6830 * If @page is not NULL and the extent is inline, this also reads the extent
6831 * data directly into the page and marks the extent up to date in the io_tree.
6833 * Return: ERR_PTR on error, non-NULL extent_map on success.
6835 struct extent_map *btrfs_get_extent(struct btrfs_inode *inode,
6836 struct page *page, size_t pg_offset,
6839 struct btrfs_fs_info *fs_info = inode->root->fs_info;
6841 u64 extent_start = 0;
6843 u64 objectid = btrfs_ino(inode);
6844 int extent_type = -1;
6845 struct btrfs_path *path = NULL;
6846 struct btrfs_root *root = inode->root;
6847 struct btrfs_file_extent_item *item;
6848 struct extent_buffer *leaf;
6849 struct btrfs_key found_key;
6850 struct extent_map *em = NULL;
6851 struct extent_map_tree *em_tree = &inode->extent_tree;
6853 read_lock(&em_tree->lock);
6854 em = lookup_extent_mapping(em_tree, start, len);
6855 read_unlock(&em_tree->lock);
6858 if (em->start > start || em->start + em->len <= start)
6859 free_extent_map(em);
6860 else if (em->block_start == EXTENT_MAP_INLINE && page)
6861 free_extent_map(em);
6865 em = alloc_extent_map();
6870 em->start = EXTENT_MAP_HOLE;
6871 em->orig_start = EXTENT_MAP_HOLE;
6873 em->block_len = (u64)-1;
6875 path = btrfs_alloc_path();
6881 /* Chances are we'll be called again, so go ahead and do readahead */
6882 path->reada = READA_FORWARD;
6885 * The same explanation in load_free_space_cache applies here as well,
6886 * we only read when we're loading the free space cache, and at that
6887 * point the commit_root has everything we need.
6889 if (btrfs_is_free_space_inode(inode)) {
6890 path->search_commit_root = 1;
6891 path->skip_locking = 1;
6894 ret = btrfs_lookup_file_extent(NULL, root, path, objectid, start, 0);
6897 } else if (ret > 0) {
6898 if (path->slots[0] == 0)
6904 leaf = path->nodes[0];
6905 item = btrfs_item_ptr(leaf, path->slots[0],
6906 struct btrfs_file_extent_item);
6907 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
6908 if (found_key.objectid != objectid ||
6909 found_key.type != BTRFS_EXTENT_DATA_KEY) {
6911 * If we backup past the first extent we want to move forward
6912 * and see if there is an extent in front of us, otherwise we'll
6913 * say there is a hole for our whole search range which can
6920 extent_type = btrfs_file_extent_type(leaf, item);
6921 extent_start = found_key.offset;
6922 extent_end = btrfs_file_extent_end(path);
6923 if (extent_type == BTRFS_FILE_EXTENT_REG ||
6924 extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
6925 /* Only regular file could have regular/prealloc extent */
6926 if (!S_ISREG(inode->vfs_inode.i_mode)) {
6929 "regular/prealloc extent found for non-regular inode %llu",
6933 trace_btrfs_get_extent_show_fi_regular(inode, leaf, item,
6935 } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
6936 trace_btrfs_get_extent_show_fi_inline(inode, leaf, item,
6941 if (start >= extent_end) {
6943 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
6944 ret = btrfs_next_leaf(root, path);
6950 leaf = path->nodes[0];
6952 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
6953 if (found_key.objectid != objectid ||
6954 found_key.type != BTRFS_EXTENT_DATA_KEY)
6956 if (start + len <= found_key.offset)
6958 if (start > found_key.offset)
6961 /* New extent overlaps with existing one */
6963 em->orig_start = start;
6964 em->len = found_key.offset - start;
6965 em->block_start = EXTENT_MAP_HOLE;
6969 btrfs_extent_item_to_extent_map(inode, path, item, !page, em);
6971 if (extent_type == BTRFS_FILE_EXTENT_REG ||
6972 extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
6974 } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
6978 size_t extent_offset;
6984 size = btrfs_file_extent_ram_bytes(leaf, item);
6985 extent_offset = page_offset(page) + pg_offset - extent_start;
6986 copy_size = min_t(u64, PAGE_SIZE - pg_offset,
6987 size - extent_offset);
6988 em->start = extent_start + extent_offset;
6989 em->len = ALIGN(copy_size, fs_info->sectorsize);
6990 em->orig_block_len = em->len;
6991 em->orig_start = em->start;
6992 ptr = btrfs_file_extent_inline_start(item) + extent_offset;
6994 if (!PageUptodate(page)) {
6995 if (btrfs_file_extent_compression(leaf, item) !=
6996 BTRFS_COMPRESS_NONE) {
6997 ret = uncompress_inline(path, page, pg_offset,
6998 extent_offset, item);
7002 map = kmap_local_page(page);
7003 read_extent_buffer(leaf, map + pg_offset, ptr,
7005 if (pg_offset + copy_size < PAGE_SIZE) {
7006 memset(map + pg_offset + copy_size, 0,
7007 PAGE_SIZE - pg_offset -
7012 flush_dcache_page(page);
7018 em->orig_start = start;
7020 em->block_start = EXTENT_MAP_HOLE;
7023 btrfs_release_path(path);
7024 if (em->start > start || extent_map_end(em) <= start) {
7026 "bad extent! em: [%llu %llu] passed [%llu %llu]",
7027 em->start, em->len, start, len);
7032 write_lock(&em_tree->lock);
7033 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, start, len);
7034 write_unlock(&em_tree->lock);
7036 btrfs_free_path(path);
7038 trace_btrfs_get_extent(root, inode, em);
7041 free_extent_map(em);
7042 return ERR_PTR(ret);
7047 static struct extent_map *btrfs_create_dio_extent(struct btrfs_inode *inode,
7050 const u64 orig_start,
7051 const u64 block_start,
7052 const u64 block_len,
7053 const u64 orig_block_len,
7054 const u64 ram_bytes,
7057 struct extent_map *em = NULL;
7060 if (type != BTRFS_ORDERED_NOCOW) {
7061 em = create_io_em(inode, start, len, orig_start, block_start,
7062 block_len, orig_block_len, ram_bytes,
7063 BTRFS_COMPRESS_NONE, /* compress_type */
7068 ret = btrfs_add_ordered_extent(inode, start, len, len, block_start,
7071 (1 << BTRFS_ORDERED_DIRECT),
7072 BTRFS_COMPRESS_NONE);
7075 free_extent_map(em);
7076 btrfs_drop_extent_map_range(inode, start,
7077 start + len - 1, false);
7086 static struct extent_map *btrfs_new_extent_direct(struct btrfs_inode *inode,
7089 struct btrfs_root *root = inode->root;
7090 struct btrfs_fs_info *fs_info = root->fs_info;
7091 struct extent_map *em;
7092 struct btrfs_key ins;
7096 alloc_hint = get_extent_allocation_hint(inode, start, len);
7097 ret = btrfs_reserve_extent(root, len, len, fs_info->sectorsize,
7098 0, alloc_hint, &ins, 1, 1);
7100 return ERR_PTR(ret);
7102 em = btrfs_create_dio_extent(inode, start, ins.offset, start,
7103 ins.objectid, ins.offset, ins.offset,
7104 ins.offset, BTRFS_ORDERED_REGULAR);
7105 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
7107 btrfs_free_reserved_extent(fs_info, ins.objectid, ins.offset,
7113 static bool btrfs_extent_readonly(struct btrfs_fs_info *fs_info, u64 bytenr)
7115 struct btrfs_block_group *block_group;
7116 bool readonly = false;
7118 block_group = btrfs_lookup_block_group(fs_info, bytenr);
7119 if (!block_group || block_group->ro)
7122 btrfs_put_block_group(block_group);
7127 * Check if we can do nocow write into the range [@offset, @offset + @len)
7129 * @offset: File offset
7130 * @len: The length to write, will be updated to the nocow writeable
7132 * @orig_start: (optional) Return the original file offset of the file extent
7133 * @orig_len: (optional) Return the original on-disk length of the file extent
7134 * @ram_bytes: (optional) Return the ram_bytes of the file extent
7135 * @strict: if true, omit optimizations that might force us into unnecessary
7136 * cow. e.g., don't trust generation number.
7139 * >0 and update @len if we can do nocow write
7140 * 0 if we can't do nocow write
7141 * <0 if error happened
7143 * NOTE: This only checks the file extents, caller is responsible to wait for
7144 * any ordered extents.
7146 noinline int can_nocow_extent(struct inode *inode, u64 offset, u64 *len,
7147 u64 *orig_start, u64 *orig_block_len,
7148 u64 *ram_bytes, bool nowait, bool strict)
7150 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
7151 struct can_nocow_file_extent_args nocow_args = { 0 };
7152 struct btrfs_path *path;
7154 struct extent_buffer *leaf;
7155 struct btrfs_root *root = BTRFS_I(inode)->root;
7156 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
7157 struct btrfs_file_extent_item *fi;
7158 struct btrfs_key key;
7161 path = btrfs_alloc_path();
7164 path->nowait = nowait;
7166 ret = btrfs_lookup_file_extent(NULL, root, path,
7167 btrfs_ino(BTRFS_I(inode)), offset, 0);
7172 if (path->slots[0] == 0) {
7173 /* can't find the item, must cow */
7180 leaf = path->nodes[0];
7181 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
7182 if (key.objectid != btrfs_ino(BTRFS_I(inode)) ||
7183 key.type != BTRFS_EXTENT_DATA_KEY) {
7184 /* not our file or wrong item type, must cow */
7188 if (key.offset > offset) {
7189 /* Wrong offset, must cow */
7193 if (btrfs_file_extent_end(path) <= offset)
7196 fi = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_file_extent_item);
7197 found_type = btrfs_file_extent_type(leaf, fi);
7199 *ram_bytes = btrfs_file_extent_ram_bytes(leaf, fi);
7201 nocow_args.start = offset;
7202 nocow_args.end = offset + *len - 1;
7203 nocow_args.strict = strict;
7204 nocow_args.free_path = true;
7206 ret = can_nocow_file_extent(path, &key, BTRFS_I(inode), &nocow_args);
7207 /* can_nocow_file_extent() has freed the path. */
7211 /* Treat errors as not being able to NOCOW. */
7217 if (btrfs_extent_readonly(fs_info, nocow_args.disk_bytenr))
7220 if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW) &&
7221 found_type == BTRFS_FILE_EXTENT_PREALLOC) {
7224 range_end = round_up(offset + nocow_args.num_bytes,
7225 root->fs_info->sectorsize) - 1;
7226 ret = test_range_bit(io_tree, offset, range_end,
7227 EXTENT_DELALLOC, 0, NULL);
7235 *orig_start = key.offset - nocow_args.extent_offset;
7237 *orig_block_len = nocow_args.disk_num_bytes;
7239 *len = nocow_args.num_bytes;
7242 btrfs_free_path(path);
7246 static int lock_extent_direct(struct inode *inode, u64 lockstart, u64 lockend,
7247 struct extent_state **cached_state,
7248 unsigned int iomap_flags)
7250 const bool writing = (iomap_flags & IOMAP_WRITE);
7251 const bool nowait = (iomap_flags & IOMAP_NOWAIT);
7252 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
7253 struct btrfs_ordered_extent *ordered;
7258 if (!try_lock_extent(io_tree, lockstart, lockend))
7261 lock_extent(io_tree, lockstart, lockend, cached_state);
7264 * We're concerned with the entire range that we're going to be
7265 * doing DIO to, so we need to make sure there's no ordered
7266 * extents in this range.
7268 ordered = btrfs_lookup_ordered_range(BTRFS_I(inode), lockstart,
7269 lockend - lockstart + 1);
7272 * We need to make sure there are no buffered pages in this
7273 * range either, we could have raced between the invalidate in
7274 * generic_file_direct_write and locking the extent. The
7275 * invalidate needs to happen so that reads after a write do not
7279 (!writing || !filemap_range_has_page(inode->i_mapping,
7280 lockstart, lockend)))
7283 unlock_extent(io_tree, lockstart, lockend, cached_state);
7287 btrfs_put_ordered_extent(ordered);
7292 * If we are doing a DIO read and the ordered extent we
7293 * found is for a buffered write, we can not wait for it
7294 * to complete and retry, because if we do so we can
7295 * deadlock with concurrent buffered writes on page
7296 * locks. This happens only if our DIO read covers more
7297 * than one extent map, if at this point has already
7298 * created an ordered extent for a previous extent map
7299 * and locked its range in the inode's io tree, and a
7300 * concurrent write against that previous extent map's
7301 * range and this range started (we unlock the ranges
7302 * in the io tree only when the bios complete and
7303 * buffered writes always lock pages before attempting
7304 * to lock range in the io tree).
7307 test_bit(BTRFS_ORDERED_DIRECT, &ordered->flags))
7308 btrfs_start_ordered_extent(ordered, 1);
7310 ret = nowait ? -EAGAIN : -ENOTBLK;
7311 btrfs_put_ordered_extent(ordered);
7314 * We could trigger writeback for this range (and wait
7315 * for it to complete) and then invalidate the pages for
7316 * this range (through invalidate_inode_pages2_range()),
7317 * but that can lead us to a deadlock with a concurrent
7318 * call to readahead (a buffered read or a defrag call
7319 * triggered a readahead) on a page lock due to an
7320 * ordered dio extent we created before but did not have
7321 * yet a corresponding bio submitted (whence it can not
7322 * complete), which makes readahead wait for that
7323 * ordered extent to complete while holding a lock on
7326 ret = nowait ? -EAGAIN : -ENOTBLK;
7338 /* The callers of this must take lock_extent() */
7339 static struct extent_map *create_io_em(struct btrfs_inode *inode, u64 start,
7340 u64 len, u64 orig_start, u64 block_start,
7341 u64 block_len, u64 orig_block_len,
7342 u64 ram_bytes, int compress_type,
7345 struct extent_map *em;
7348 ASSERT(type == BTRFS_ORDERED_PREALLOC ||
7349 type == BTRFS_ORDERED_COMPRESSED ||
7350 type == BTRFS_ORDERED_NOCOW ||
7351 type == BTRFS_ORDERED_REGULAR);
7353 em = alloc_extent_map();
7355 return ERR_PTR(-ENOMEM);
7358 em->orig_start = orig_start;
7360 em->block_len = block_len;
7361 em->block_start = block_start;
7362 em->orig_block_len = orig_block_len;
7363 em->ram_bytes = ram_bytes;
7364 em->generation = -1;
7365 set_bit(EXTENT_FLAG_PINNED, &em->flags);
7366 if (type == BTRFS_ORDERED_PREALLOC) {
7367 set_bit(EXTENT_FLAG_FILLING, &em->flags);
7368 } else if (type == BTRFS_ORDERED_COMPRESSED) {
7369 set_bit(EXTENT_FLAG_COMPRESSED, &em->flags);
7370 em->compress_type = compress_type;
7373 ret = btrfs_replace_extent_map_range(inode, em, true);
7375 free_extent_map(em);
7376 return ERR_PTR(ret);
7379 /* em got 2 refs now, callers needs to do free_extent_map once. */
7384 static int btrfs_get_blocks_direct_write(struct extent_map **map,
7385 struct inode *inode,
7386 struct btrfs_dio_data *dio_data,
7388 unsigned int iomap_flags)
7390 const bool nowait = (iomap_flags & IOMAP_NOWAIT);
7391 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
7392 struct extent_map *em = *map;
7394 u64 block_start, orig_start, orig_block_len, ram_bytes;
7395 struct btrfs_block_group *bg;
7396 bool can_nocow = false;
7397 bool space_reserved = false;
7402 * We don't allocate a new extent in the following cases
7404 * 1) The inode is marked as NODATACOW. In this case we'll just use the
7406 * 2) The extent is marked as PREALLOC. We're good to go here and can
7407 * just use the extent.
7410 if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags) ||
7411 ((BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW) &&
7412 em->block_start != EXTENT_MAP_HOLE)) {
7413 if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags))
7414 type = BTRFS_ORDERED_PREALLOC;
7416 type = BTRFS_ORDERED_NOCOW;
7417 len = min(len, em->len - (start - em->start));
7418 block_start = em->block_start + (start - em->start);
7420 if (can_nocow_extent(inode, start, &len, &orig_start,
7421 &orig_block_len, &ram_bytes, false, false) == 1) {
7422 bg = btrfs_inc_nocow_writers(fs_info, block_start);
7430 struct extent_map *em2;
7432 /* We can NOCOW, so only need to reserve metadata space. */
7433 ret = btrfs_delalloc_reserve_metadata(BTRFS_I(inode), len, len,
7436 /* Our caller expects us to free the input extent map. */
7437 free_extent_map(em);
7439 btrfs_dec_nocow_writers(bg);
7440 if (nowait && (ret == -ENOSPC || ret == -EDQUOT))
7444 space_reserved = true;
7446 em2 = btrfs_create_dio_extent(BTRFS_I(inode), start, len,
7447 orig_start, block_start,
7448 len, orig_block_len,
7450 btrfs_dec_nocow_writers(bg);
7451 if (type == BTRFS_ORDERED_PREALLOC) {
7452 free_extent_map(em);
7462 dio_data->nocow_done = true;
7464 /* Our caller expects us to free the input extent map. */
7465 free_extent_map(em);
7472 * If we could not allocate data space before locking the file
7473 * range and we can't do a NOCOW write, then we have to fail.
7475 if (!dio_data->data_space_reserved)
7479 * We have to COW and we have already reserved data space before,
7480 * so now we reserve only metadata.
7482 ret = btrfs_delalloc_reserve_metadata(BTRFS_I(inode), len, len,
7486 space_reserved = true;
7488 em = btrfs_new_extent_direct(BTRFS_I(inode), start, len);
7494 len = min(len, em->len - (start - em->start));
7496 btrfs_delalloc_release_metadata(BTRFS_I(inode),
7497 prev_len - len, true);
7501 * We have created our ordered extent, so we can now release our reservation
7502 * for an outstanding extent.
7504 btrfs_delalloc_release_extents(BTRFS_I(inode), prev_len);
7507 * Need to update the i_size under the extent lock so buffered
7508 * readers will get the updated i_size when we unlock.
7510 if (start + len > i_size_read(inode))
7511 i_size_write(inode, start + len);
7513 if (ret && space_reserved) {
7514 btrfs_delalloc_release_extents(BTRFS_I(inode), len);
7515 btrfs_delalloc_release_metadata(BTRFS_I(inode), len, true);
7520 static int btrfs_dio_iomap_begin(struct inode *inode, loff_t start,
7521 loff_t length, unsigned int flags, struct iomap *iomap,
7522 struct iomap *srcmap)
7524 struct iomap_iter *iter = container_of(iomap, struct iomap_iter, iomap);
7525 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
7526 struct extent_map *em;
7527 struct extent_state *cached_state = NULL;
7528 struct btrfs_dio_data *dio_data = iter->private;
7529 u64 lockstart, lockend;
7530 const bool write = !!(flags & IOMAP_WRITE);
7533 const u64 data_alloc_len = length;
7534 bool unlock_extents = false;
7537 * We could potentially fault if we have a buffer > PAGE_SIZE, and if
7538 * we're NOWAIT we may submit a bio for a partial range and return
7539 * EIOCBQUEUED, which would result in an errant short read.
7541 * The best way to handle this would be to allow for partial completions
7542 * of iocb's, so we could submit the partial bio, return and fault in
7543 * the rest of the pages, and then submit the io for the rest of the
7544 * range. However we don't have that currently, so simply return
7545 * -EAGAIN at this point so that the normal path is used.
7547 if (!write && (flags & IOMAP_NOWAIT) && length > PAGE_SIZE)
7551 * Cap the size of reads to that usually seen in buffered I/O as we need
7552 * to allocate a contiguous array for the checksums.
7555 len = min_t(u64, len, fs_info->sectorsize * BTRFS_MAX_BIO_SECTORS);
7558 lockend = start + len - 1;
7561 * iomap_dio_rw() only does filemap_write_and_wait_range(), which isn't
7562 * enough if we've written compressed pages to this area, so we need to
7563 * flush the dirty pages again to make absolutely sure that any
7564 * outstanding dirty pages are on disk - the first flush only starts
7565 * compression on the data, while keeping the pages locked, so by the
7566 * time the second flush returns we know bios for the compressed pages
7567 * were submitted and finished, and the pages no longer under writeback.
7569 * If we have a NOWAIT request and we have any pages in the range that
7570 * are locked, likely due to compression still in progress, we don't want
7571 * to block on page locks. We also don't want to block on pages marked as
7572 * dirty or under writeback (same as for the non-compression case).
7573 * iomap_dio_rw() did the same check, but after that and before we got
7574 * here, mmap'ed writes may have happened or buffered reads started
7575 * (readpage() and readahead(), which lock pages), as we haven't locked
7576 * the file range yet.
7578 if (test_bit(BTRFS_INODE_HAS_ASYNC_EXTENT,
7579 &BTRFS_I(inode)->runtime_flags)) {
7580 if (flags & IOMAP_NOWAIT) {
7581 if (filemap_range_needs_writeback(inode->i_mapping,
7582 lockstart, lockend))
7585 ret = filemap_fdatawrite_range(inode->i_mapping, start,
7586 start + length - 1);
7592 memset(dio_data, 0, sizeof(*dio_data));
7595 * We always try to allocate data space and must do it before locking
7596 * the file range, to avoid deadlocks with concurrent writes to the same
7597 * range if the range has several extents and the writes don't expand the
7598 * current i_size (the inode lock is taken in shared mode). If we fail to
7599 * allocate data space here we continue and later, after locking the
7600 * file range, we fail with ENOSPC only if we figure out we can not do a
7603 if (write && !(flags & IOMAP_NOWAIT)) {
7604 ret = btrfs_check_data_free_space(BTRFS_I(inode),
7605 &dio_data->data_reserved,
7606 start, data_alloc_len, false);
7608 dio_data->data_space_reserved = true;
7609 else if (ret && !(BTRFS_I(inode)->flags &
7610 (BTRFS_INODE_NODATACOW | BTRFS_INODE_PREALLOC)))
7615 * If this errors out it's because we couldn't invalidate pagecache for
7616 * this range and we need to fallback to buffered IO, or we are doing a
7617 * NOWAIT read/write and we need to block.
7619 ret = lock_extent_direct(inode, lockstart, lockend, &cached_state, flags);
7623 em = btrfs_get_extent(BTRFS_I(inode), NULL, 0, start, len);
7630 * Ok for INLINE and COMPRESSED extents we need to fallback on buffered
7631 * io. INLINE is special, and we could probably kludge it in here, but
7632 * it's still buffered so for safety lets just fall back to the generic
7635 * For COMPRESSED we _have_ to read the entire extent in so we can
7636 * decompress it, so there will be buffering required no matter what we
7637 * do, so go ahead and fallback to buffered.
7639 * We return -ENOTBLK because that's what makes DIO go ahead and go back
7640 * to buffered IO. Don't blame me, this is the price we pay for using
7643 if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags) ||
7644 em->block_start == EXTENT_MAP_INLINE) {
7645 free_extent_map(em);
7647 * If we are in a NOWAIT context, return -EAGAIN in order to
7648 * fallback to buffered IO. This is not only because we can
7649 * block with buffered IO (no support for NOWAIT semantics at
7650 * the moment) but also to avoid returning short reads to user
7651 * space - this happens if we were able to read some data from
7652 * previous non-compressed extents and then when we fallback to
7653 * buffered IO, at btrfs_file_read_iter() by calling
7654 * filemap_read(), we fail to fault in pages for the read buffer,
7655 * in which case filemap_read() returns a short read (the number
7656 * of bytes previously read is > 0, so it does not return -EFAULT).
7658 ret = (flags & IOMAP_NOWAIT) ? -EAGAIN : -ENOTBLK;
7662 len = min(len, em->len - (start - em->start));
7665 * If we have a NOWAIT request and the range contains multiple extents
7666 * (or a mix of extents and holes), then we return -EAGAIN to make the
7667 * caller fallback to a context where it can do a blocking (without
7668 * NOWAIT) request. This way we avoid doing partial IO and returning
7669 * success to the caller, which is not optimal for writes and for reads
7670 * it can result in unexpected behaviour for an application.
7672 * When doing a read, because we use IOMAP_DIO_PARTIAL when calling
7673 * iomap_dio_rw(), we can end up returning less data then what the caller
7674 * asked for, resulting in an unexpected, and incorrect, short read.
7675 * That is, the caller asked to read N bytes and we return less than that,
7676 * which is wrong unless we are crossing EOF. This happens if we get a
7677 * page fault error when trying to fault in pages for the buffer that is
7678 * associated to the struct iov_iter passed to iomap_dio_rw(), and we
7679 * have previously submitted bios for other extents in the range, in
7680 * which case iomap_dio_rw() may return us EIOCBQUEUED if not all of
7681 * those bios have completed by the time we get the page fault error,
7682 * which we return back to our caller - we should only return EIOCBQUEUED
7683 * after we have submitted bios for all the extents in the range.
7685 if ((flags & IOMAP_NOWAIT) && len < length) {
7686 free_extent_map(em);
7692 ret = btrfs_get_blocks_direct_write(&em, inode, dio_data,
7696 unlock_extents = true;
7697 /* Recalc len in case the new em is smaller than requested */
7698 len = min(len, em->len - (start - em->start));
7699 if (dio_data->data_space_reserved) {
7701 u64 release_len = 0;
7703 if (dio_data->nocow_done) {
7704 release_offset = start;
7705 release_len = data_alloc_len;
7706 } else if (len < data_alloc_len) {
7707 release_offset = start + len;
7708 release_len = data_alloc_len - len;
7711 if (release_len > 0)
7712 btrfs_free_reserved_data_space(BTRFS_I(inode),
7713 dio_data->data_reserved,
7719 * We need to unlock only the end area that we aren't using.
7720 * The rest is going to be unlocked by the endio routine.
7722 lockstart = start + len;
7723 if (lockstart < lockend)
7724 unlock_extents = true;
7728 unlock_extent(&BTRFS_I(inode)->io_tree, lockstart, lockend,
7731 free_extent_state(cached_state);
7734 * Translate extent map information to iomap.
7735 * We trim the extents (and move the addr) even though iomap code does
7736 * that, since we have locked only the parts we are performing I/O in.
7738 if ((em->block_start == EXTENT_MAP_HOLE) ||
7739 (test_bit(EXTENT_FLAG_PREALLOC, &em->flags) && !write)) {
7740 iomap->addr = IOMAP_NULL_ADDR;
7741 iomap->type = IOMAP_HOLE;
7743 iomap->addr = em->block_start + (start - em->start);
7744 iomap->type = IOMAP_MAPPED;
7746 iomap->offset = start;
7747 iomap->bdev = fs_info->fs_devices->latest_dev->bdev;
7748 iomap->length = len;
7750 if (write && btrfs_use_zone_append(BTRFS_I(inode), em->block_start))
7751 iomap->flags |= IOMAP_F_ZONE_APPEND;
7753 free_extent_map(em);
7758 unlock_extent(&BTRFS_I(inode)->io_tree, lockstart, lockend,
7761 if (dio_data->data_space_reserved) {
7762 btrfs_free_reserved_data_space(BTRFS_I(inode),
7763 dio_data->data_reserved,
7764 start, data_alloc_len);
7765 extent_changeset_free(dio_data->data_reserved);
7771 static int btrfs_dio_iomap_end(struct inode *inode, loff_t pos, loff_t length,
7772 ssize_t written, unsigned int flags, struct iomap *iomap)
7774 struct iomap_iter *iter = container_of(iomap, struct iomap_iter, iomap);
7775 struct btrfs_dio_data *dio_data = iter->private;
7776 size_t submitted = dio_data->submitted;
7777 const bool write = !!(flags & IOMAP_WRITE);
7780 if (!write && (iomap->type == IOMAP_HOLE)) {
7781 /* If reading from a hole, unlock and return */
7782 unlock_extent(&BTRFS_I(inode)->io_tree, pos, pos + length - 1,
7787 if (submitted < length) {
7789 length -= submitted;
7791 btrfs_mark_ordered_io_finished(BTRFS_I(inode), NULL,
7792 pos, length, false);
7794 unlock_extent(&BTRFS_I(inode)->io_tree, pos,
7795 pos + length - 1, NULL);
7800 extent_changeset_free(dio_data->data_reserved);
7804 static void btrfs_dio_private_put(struct btrfs_dio_private *dip)
7807 * This implies a barrier so that stores to dio_bio->bi_status before
7808 * this and loads of dio_bio->bi_status after this are fully ordered.
7810 if (!refcount_dec_and_test(&dip->refs))
7813 if (btrfs_op(&dip->bio) == BTRFS_MAP_WRITE) {
7814 btrfs_mark_ordered_io_finished(BTRFS_I(dip->inode), NULL,
7815 dip->file_offset, dip->bytes,
7816 !dip->bio.bi_status);
7818 unlock_extent(&BTRFS_I(dip->inode)->io_tree,
7820 dip->file_offset + dip->bytes - 1, NULL);
7824 bio_endio(&dip->bio);
7827 static void submit_dio_repair_bio(struct inode *inode, struct bio *bio,
7829 enum btrfs_compression_type compress_type)
7831 struct btrfs_dio_private *dip = btrfs_bio(bio)->private;
7832 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
7834 BUG_ON(bio_op(bio) == REQ_OP_WRITE);
7836 refcount_inc(&dip->refs);
7837 btrfs_submit_bio(fs_info, bio, mirror_num);
7840 static blk_status_t btrfs_check_read_dio_bio(struct btrfs_dio_private *dip,
7841 struct btrfs_bio *bbio,
7842 const bool uptodate)
7844 struct inode *inode = dip->inode;
7845 struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info;
7846 const bool csum = !(BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM);
7847 blk_status_t err = BLK_STS_OK;
7848 struct bvec_iter iter;
7852 btrfs_bio_for_each_sector(fs_info, bv, bbio, iter, offset) {
7853 u64 start = bbio->file_offset + offset;
7856 (!csum || !btrfs_check_data_csum(inode, bbio, offset, bv.bv_page,
7858 btrfs_clean_io_failure(BTRFS_I(inode), start,
7859 bv.bv_page, bv.bv_offset);
7863 ret = btrfs_repair_one_sector(inode, bbio, offset,
7864 bv.bv_page, bv.bv_offset,
7865 submit_dio_repair_bio);
7867 err = errno_to_blk_status(ret);
7874 static blk_status_t btrfs_submit_bio_start_direct_io(struct inode *inode,
7876 u64 dio_file_offset)
7878 return btrfs_csum_one_bio(BTRFS_I(inode), bio, dio_file_offset, false);
7881 static void btrfs_end_dio_bio(struct btrfs_bio *bbio)
7883 struct btrfs_dio_private *dip = bbio->private;
7884 struct bio *bio = &bbio->bio;
7885 blk_status_t err = bio->bi_status;
7888 btrfs_warn(BTRFS_I(dip->inode)->root->fs_info,
7889 "direct IO failed ino %llu rw %d,%u sector %#Lx len %u err no %d",
7890 btrfs_ino(BTRFS_I(dip->inode)), bio_op(bio),
7891 bio->bi_opf, bio->bi_iter.bi_sector,
7892 bio->bi_iter.bi_size, err);
7894 if (bio_op(bio) == REQ_OP_READ)
7895 err = btrfs_check_read_dio_bio(dip, bbio, !err);
7898 dip->bio.bi_status = err;
7900 btrfs_record_physical_zoned(dip->inode, bbio->file_offset, bio);
7903 btrfs_dio_private_put(dip);
7906 static void btrfs_submit_dio_bio(struct bio *bio, struct inode *inode,
7907 u64 file_offset, int async_submit)
7909 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
7910 struct btrfs_dio_private *dip = btrfs_bio(bio)->private;
7913 /* Save the original iter for read repair */
7914 if (btrfs_op(bio) == BTRFS_MAP_READ)
7915 btrfs_bio(bio)->iter = bio->bi_iter;
7917 if (BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM)
7920 if (btrfs_op(bio) == BTRFS_MAP_WRITE) {
7921 /* Check btrfs_submit_data_write_bio() for async submit rules */
7922 if (async_submit && !atomic_read(&BTRFS_I(inode)->sync_writers) &&
7923 btrfs_wq_submit_bio(inode, bio, 0, file_offset,
7924 btrfs_submit_bio_start_direct_io))
7928 * If we aren't doing async submit, calculate the csum of the
7931 ret = btrfs_csum_one_bio(BTRFS_I(inode), bio, file_offset, false);
7933 btrfs_bio_end_io(btrfs_bio(bio), ret);
7937 btrfs_bio(bio)->csum = btrfs_csum_ptr(fs_info, dip->csums,
7938 file_offset - dip->file_offset);
7941 btrfs_submit_bio(fs_info, bio, 0);
7944 static void btrfs_submit_direct(const struct iomap_iter *iter,
7945 struct bio *dio_bio, loff_t file_offset)
7947 struct btrfs_dio_private *dip =
7948 container_of(dio_bio, struct btrfs_dio_private, bio);
7949 struct inode *inode = iter->inode;
7950 const bool write = (btrfs_op(dio_bio) == BTRFS_MAP_WRITE);
7951 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
7952 const bool raid56 = (btrfs_data_alloc_profile(fs_info) &
7953 BTRFS_BLOCK_GROUP_RAID56_MASK);
7956 int async_submit = 0;
7958 u64 clone_offset = 0;
7962 blk_status_t status;
7963 struct btrfs_io_geometry geom;
7964 struct btrfs_dio_data *dio_data = iter->private;
7965 struct extent_map *em = NULL;
7968 dip->file_offset = file_offset;
7969 dip->bytes = dio_bio->bi_iter.bi_size;
7970 refcount_set(&dip->refs, 1);
7973 if (!write && !(BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM)) {
7974 unsigned int nr_sectors =
7975 (dio_bio->bi_iter.bi_size >> fs_info->sectorsize_bits);
7978 * Load the csums up front to reduce csum tree searches and
7979 * contention when submitting bios.
7981 status = BLK_STS_RESOURCE;
7982 dip->csums = kcalloc(nr_sectors, fs_info->csum_size, GFP_NOFS);
7986 status = btrfs_lookup_bio_sums(inode, dio_bio, dip->csums);
7987 if (status != BLK_STS_OK)
7991 start_sector = dio_bio->bi_iter.bi_sector;
7992 submit_len = dio_bio->bi_iter.bi_size;
7995 logical = start_sector << 9;
7996 em = btrfs_get_chunk_map(fs_info, logical, submit_len);
7998 status = errno_to_blk_status(PTR_ERR(em));
8002 ret = btrfs_get_io_geometry(fs_info, em, btrfs_op(dio_bio),
8005 status = errno_to_blk_status(ret);
8009 clone_len = min(submit_len, geom.len);
8010 ASSERT(clone_len <= UINT_MAX);
8013 * This will never fail as it's passing GPF_NOFS and
8014 * the allocation is backed by btrfs_bioset.
8016 bio = btrfs_bio_clone_partial(dio_bio, clone_offset, clone_len,
8017 btrfs_end_dio_bio, dip);
8018 btrfs_bio(bio)->file_offset = file_offset;
8020 if (bio_op(bio) == REQ_OP_ZONE_APPEND) {
8021 status = extract_ordered_extent(BTRFS_I(inode), bio,
8029 ASSERT(submit_len >= clone_len);
8030 submit_len -= clone_len;
8033 * Increase the count before we submit the bio so we know
8034 * the end IO handler won't happen before we increase the
8035 * count. Otherwise, the dip might get freed before we're
8036 * done setting it up.
8038 * We transfer the initial reference to the last bio, so we
8039 * don't need to increment the reference count for the last one.
8041 if (submit_len > 0) {
8042 refcount_inc(&dip->refs);
8044 * If we are submitting more than one bio, submit them
8045 * all asynchronously. The exception is RAID 5 or 6, as
8046 * asynchronous checksums make it difficult to collect
8047 * full stripe writes.
8053 btrfs_submit_dio_bio(bio, inode, file_offset, async_submit);
8055 dio_data->submitted += clone_len;
8056 clone_offset += clone_len;
8057 start_sector += clone_len >> 9;
8058 file_offset += clone_len;
8060 free_extent_map(em);
8061 } while (submit_len > 0);
8065 free_extent_map(em);
8067 dio_bio->bi_status = status;
8068 btrfs_dio_private_put(dip);
8071 static const struct iomap_ops btrfs_dio_iomap_ops = {
8072 .iomap_begin = btrfs_dio_iomap_begin,
8073 .iomap_end = btrfs_dio_iomap_end,
8076 static const struct iomap_dio_ops btrfs_dio_ops = {
8077 .submit_io = btrfs_submit_direct,
8078 .bio_set = &btrfs_dio_bioset,
8081 ssize_t btrfs_dio_rw(struct kiocb *iocb, struct iov_iter *iter, size_t done_before)
8083 struct btrfs_dio_data data;
8085 return iomap_dio_rw(iocb, iter, &btrfs_dio_iomap_ops, &btrfs_dio_ops,
8086 IOMAP_DIO_PARTIAL | IOMAP_DIO_NOSYNC,
8087 &data, done_before);
8090 static int btrfs_fiemap(struct inode *inode, struct fiemap_extent_info *fieinfo,
8095 ret = fiemap_prep(inode, fieinfo, start, &len, 0);
8100 * fiemap_prep() called filemap_write_and_wait() for the whole possible
8101 * file range (0 to LLONG_MAX), but that is not enough if we have
8102 * compression enabled. The first filemap_fdatawrite_range() only kicks
8103 * in the compression of data (in an async thread) and will return
8104 * before the compression is done and writeback is started. A second
8105 * filemap_fdatawrite_range() is needed to wait for the compression to
8106 * complete and writeback to start. We also need to wait for ordered
8107 * extents to complete, because our fiemap implementation uses mainly
8108 * file extent items to list the extents, searching for extent maps
8109 * only for file ranges with holes or prealloc extents to figure out
8110 * if we have delalloc in those ranges.
8112 if (fieinfo->fi_flags & FIEMAP_FLAG_SYNC) {
8113 ret = btrfs_wait_ordered_range(inode, 0, LLONG_MAX);
8118 return extent_fiemap(BTRFS_I(inode), fieinfo, start, len);
8121 static int btrfs_writepages(struct address_space *mapping,
8122 struct writeback_control *wbc)
8124 return extent_writepages(mapping, wbc);
8127 static void btrfs_readahead(struct readahead_control *rac)
8129 extent_readahead(rac);
8133 * For release_folio() and invalidate_folio() we have a race window where
8134 * folio_end_writeback() is called but the subpage spinlock is not yet released.
8135 * If we continue to release/invalidate the page, we could cause use-after-free
8136 * for subpage spinlock. So this function is to spin and wait for subpage
8139 static void wait_subpage_spinlock(struct page *page)
8141 struct btrfs_fs_info *fs_info = btrfs_sb(page->mapping->host->i_sb);
8142 struct btrfs_subpage *subpage;
8144 if (!btrfs_is_subpage(fs_info, page))
8147 ASSERT(PagePrivate(page) && page->private);
8148 subpage = (struct btrfs_subpage *)page->private;
8151 * This may look insane as we just acquire the spinlock and release it,
8152 * without doing anything. But we just want to make sure no one is
8153 * still holding the subpage spinlock.
8154 * And since the page is not dirty nor writeback, and we have page
8155 * locked, the only possible way to hold a spinlock is from the endio
8156 * function to clear page writeback.
8158 * Here we just acquire the spinlock so that all existing callers
8159 * should exit and we're safe to release/invalidate the page.
8161 spin_lock_irq(&subpage->lock);
8162 spin_unlock_irq(&subpage->lock);
8165 static bool __btrfs_release_folio(struct folio *folio, gfp_t gfp_flags)
8167 int ret = try_release_extent_mapping(&folio->page, gfp_flags);
8170 wait_subpage_spinlock(&folio->page);
8171 clear_page_extent_mapped(&folio->page);
8176 static bool btrfs_release_folio(struct folio *folio, gfp_t gfp_flags)
8178 if (folio_test_writeback(folio) || folio_test_dirty(folio))
8180 return __btrfs_release_folio(folio, gfp_flags);
8183 #ifdef CONFIG_MIGRATION
8184 static int btrfs_migrate_folio(struct address_space *mapping,
8185 struct folio *dst, struct folio *src,
8186 enum migrate_mode mode)
8188 int ret = filemap_migrate_folio(mapping, dst, src, mode);
8190 if (ret != MIGRATEPAGE_SUCCESS)
8193 if (folio_test_ordered(src)) {
8194 folio_clear_ordered(src);
8195 folio_set_ordered(dst);
8198 return MIGRATEPAGE_SUCCESS;
8201 #define btrfs_migrate_folio NULL
8204 static void btrfs_invalidate_folio(struct folio *folio, size_t offset,
8207 struct btrfs_inode *inode = BTRFS_I(folio->mapping->host);
8208 struct btrfs_fs_info *fs_info = inode->root->fs_info;
8209 struct extent_io_tree *tree = &inode->io_tree;
8210 struct extent_state *cached_state = NULL;
8211 u64 page_start = folio_pos(folio);
8212 u64 page_end = page_start + folio_size(folio) - 1;
8214 int inode_evicting = inode->vfs_inode.i_state & I_FREEING;
8217 * We have folio locked so no new ordered extent can be created on this
8218 * page, nor bio can be submitted for this folio.
8220 * But already submitted bio can still be finished on this folio.
8221 * Furthermore, endio function won't skip folio which has Ordered
8222 * (Private2) already cleared, so it's possible for endio and
8223 * invalidate_folio to do the same ordered extent accounting twice
8226 * So here we wait for any submitted bios to finish, so that we won't
8227 * do double ordered extent accounting on the same folio.
8229 folio_wait_writeback(folio);
8230 wait_subpage_spinlock(&folio->page);
8233 * For subpage case, we have call sites like
8234 * btrfs_punch_hole_lock_range() which passes range not aligned to
8236 * If the range doesn't cover the full folio, we don't need to and
8237 * shouldn't clear page extent mapped, as folio->private can still
8238 * record subpage dirty bits for other part of the range.
8240 * For cases that invalidate the full folio even the range doesn't
8241 * cover the full folio, like invalidating the last folio, we're
8242 * still safe to wait for ordered extent to finish.
8244 if (!(offset == 0 && length == folio_size(folio))) {
8245 btrfs_release_folio(folio, GFP_NOFS);
8249 if (!inode_evicting)
8250 lock_extent(tree, page_start, page_end, &cached_state);
8253 while (cur < page_end) {
8254 struct btrfs_ordered_extent *ordered;
8257 u32 extra_flags = 0;
8259 ordered = btrfs_lookup_first_ordered_range(inode, cur,
8260 page_end + 1 - cur);
8262 range_end = page_end;
8264 * No ordered extent covering this range, we are safe
8265 * to delete all extent states in the range.
8267 extra_flags = EXTENT_CLEAR_ALL_BITS;
8270 if (ordered->file_offset > cur) {
8272 * There is a range between [cur, oe->file_offset) not
8273 * covered by any ordered extent.
8274 * We are safe to delete all extent states, and handle
8275 * the ordered extent in the next iteration.
8277 range_end = ordered->file_offset - 1;
8278 extra_flags = EXTENT_CLEAR_ALL_BITS;
8282 range_end = min(ordered->file_offset + ordered->num_bytes - 1,
8284 ASSERT(range_end + 1 - cur < U32_MAX);
8285 range_len = range_end + 1 - cur;
8286 if (!btrfs_page_test_ordered(fs_info, &folio->page, cur, range_len)) {
8288 * If Ordered (Private2) is cleared, it means endio has
8289 * already been executed for the range.
8290 * We can't delete the extent states as
8291 * btrfs_finish_ordered_io() may still use some of them.
8295 btrfs_page_clear_ordered(fs_info, &folio->page, cur, range_len);
8298 * IO on this page will never be started, so we need to account
8299 * for any ordered extents now. Don't clear EXTENT_DELALLOC_NEW
8300 * here, must leave that up for the ordered extent completion.
8302 * This will also unlock the range for incoming
8303 * btrfs_finish_ordered_io().
8305 if (!inode_evicting)
8306 clear_extent_bit(tree, cur, range_end,
8308 EXTENT_LOCKED | EXTENT_DO_ACCOUNTING |
8309 EXTENT_DEFRAG, &cached_state);
8311 spin_lock_irq(&inode->ordered_tree.lock);
8312 set_bit(BTRFS_ORDERED_TRUNCATED, &ordered->flags);
8313 ordered->truncated_len = min(ordered->truncated_len,
8314 cur - ordered->file_offset);
8315 spin_unlock_irq(&inode->ordered_tree.lock);
8318 * If the ordered extent has finished, we're safe to delete all
8319 * the extent states of the range, otherwise
8320 * btrfs_finish_ordered_io() will get executed by endio for
8321 * other pages, so we can't delete extent states.
8323 if (btrfs_dec_test_ordered_pending(inode, &ordered,
8324 cur, range_end + 1 - cur)) {
8325 btrfs_finish_ordered_io(ordered);
8327 * The ordered extent has finished, now we're again
8328 * safe to delete all extent states of the range.
8330 extra_flags = EXTENT_CLEAR_ALL_BITS;
8334 btrfs_put_ordered_extent(ordered);
8336 * Qgroup reserved space handler
8337 * Sector(s) here will be either:
8339 * 1) Already written to disk or bio already finished
8340 * Then its QGROUP_RESERVED bit in io_tree is already cleared.
8341 * Qgroup will be handled by its qgroup_record then.
8342 * btrfs_qgroup_free_data() call will do nothing here.
8344 * 2) Not written to disk yet
8345 * Then btrfs_qgroup_free_data() call will clear the
8346 * QGROUP_RESERVED bit of its io_tree, and free the qgroup
8347 * reserved data space.
8348 * Since the IO will never happen for this page.
8350 btrfs_qgroup_free_data(inode, NULL, cur, range_end + 1 - cur);
8351 if (!inode_evicting) {
8352 clear_extent_bit(tree, cur, range_end, EXTENT_LOCKED |
8353 EXTENT_DELALLOC | EXTENT_UPTODATE |
8354 EXTENT_DO_ACCOUNTING | EXTENT_DEFRAG |
8355 extra_flags, &cached_state);
8357 cur = range_end + 1;
8360 * We have iterated through all ordered extents of the page, the page
8361 * should not have Ordered (Private2) anymore, or the above iteration
8362 * did something wrong.
8364 ASSERT(!folio_test_ordered(folio));
8365 btrfs_page_clear_checked(fs_info, &folio->page, folio_pos(folio), folio_size(folio));
8366 if (!inode_evicting)
8367 __btrfs_release_folio(folio, GFP_NOFS);
8368 clear_page_extent_mapped(&folio->page);
8372 * btrfs_page_mkwrite() is not allowed to change the file size as it gets
8373 * called from a page fault handler when a page is first dirtied. Hence we must
8374 * be careful to check for EOF conditions here. We set the page up correctly
8375 * for a written page which means we get ENOSPC checking when writing into
8376 * holes and correct delalloc and unwritten extent mapping on filesystems that
8377 * support these features.
8379 * We are not allowed to take the i_mutex here so we have to play games to
8380 * protect against truncate races as the page could now be beyond EOF. Because
8381 * truncate_setsize() writes the inode size before removing pages, once we have
8382 * the page lock we can determine safely if the page is beyond EOF. If it is not
8383 * beyond EOF, then the page is guaranteed safe against truncation until we
8386 vm_fault_t btrfs_page_mkwrite(struct vm_fault *vmf)
8388 struct page *page = vmf->page;
8389 struct inode *inode = file_inode(vmf->vma->vm_file);
8390 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
8391 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
8392 struct btrfs_ordered_extent *ordered;
8393 struct extent_state *cached_state = NULL;
8394 struct extent_changeset *data_reserved = NULL;
8395 unsigned long zero_start;
8405 reserved_space = PAGE_SIZE;
8407 sb_start_pagefault(inode->i_sb);
8408 page_start = page_offset(page);
8409 page_end = page_start + PAGE_SIZE - 1;
8413 * Reserving delalloc space after obtaining the page lock can lead to
8414 * deadlock. For example, if a dirty page is locked by this function
8415 * and the call to btrfs_delalloc_reserve_space() ends up triggering
8416 * dirty page write out, then the btrfs_writepages() function could
8417 * end up waiting indefinitely to get a lock on the page currently
8418 * being processed by btrfs_page_mkwrite() function.
8420 ret2 = btrfs_delalloc_reserve_space(BTRFS_I(inode), &data_reserved,
8421 page_start, reserved_space);
8423 ret2 = file_update_time(vmf->vma->vm_file);
8427 ret = vmf_error(ret2);
8433 ret = VM_FAULT_NOPAGE; /* make the VM retry the fault */
8435 down_read(&BTRFS_I(inode)->i_mmap_lock);
8437 size = i_size_read(inode);
8439 if ((page->mapping != inode->i_mapping) ||
8440 (page_start >= size)) {
8441 /* page got truncated out from underneath us */
8444 wait_on_page_writeback(page);
8446 lock_extent(io_tree, page_start, page_end, &cached_state);
8447 ret2 = set_page_extent_mapped(page);
8449 ret = vmf_error(ret2);
8450 unlock_extent(io_tree, page_start, page_end, &cached_state);
8455 * we can't set the delalloc bits if there are pending ordered
8456 * extents. Drop our locks and wait for them to finish
8458 ordered = btrfs_lookup_ordered_range(BTRFS_I(inode), page_start,
8461 unlock_extent(io_tree, page_start, page_end, &cached_state);
8463 up_read(&BTRFS_I(inode)->i_mmap_lock);
8464 btrfs_start_ordered_extent(ordered, 1);
8465 btrfs_put_ordered_extent(ordered);
8469 if (page->index == ((size - 1) >> PAGE_SHIFT)) {
8470 reserved_space = round_up(size - page_start,
8471 fs_info->sectorsize);
8472 if (reserved_space < PAGE_SIZE) {
8473 end = page_start + reserved_space - 1;
8474 btrfs_delalloc_release_space(BTRFS_I(inode),
8475 data_reserved, page_start,
8476 PAGE_SIZE - reserved_space, true);
8481 * page_mkwrite gets called when the page is firstly dirtied after it's
8482 * faulted in, but write(2) could also dirty a page and set delalloc
8483 * bits, thus in this case for space account reason, we still need to
8484 * clear any delalloc bits within this page range since we have to
8485 * reserve data&meta space before lock_page() (see above comments).
8487 clear_extent_bit(&BTRFS_I(inode)->io_tree, page_start, end,
8488 EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING |
8489 EXTENT_DEFRAG, &cached_state);
8491 ret2 = btrfs_set_extent_delalloc(BTRFS_I(inode), page_start, end, 0,
8494 unlock_extent(io_tree, page_start, page_end, &cached_state);
8495 ret = VM_FAULT_SIGBUS;
8499 /* page is wholly or partially inside EOF */
8500 if (page_start + PAGE_SIZE > size)
8501 zero_start = offset_in_page(size);
8503 zero_start = PAGE_SIZE;
8505 if (zero_start != PAGE_SIZE)
8506 memzero_page(page, zero_start, PAGE_SIZE - zero_start);
8508 btrfs_page_clear_checked(fs_info, page, page_start, PAGE_SIZE);
8509 btrfs_page_set_dirty(fs_info, page, page_start, end + 1 - page_start);
8510 btrfs_page_set_uptodate(fs_info, page, page_start, end + 1 - page_start);
8512 btrfs_set_inode_last_sub_trans(BTRFS_I(inode));
8514 unlock_extent(io_tree, page_start, page_end, &cached_state);
8515 up_read(&BTRFS_I(inode)->i_mmap_lock);
8517 btrfs_delalloc_release_extents(BTRFS_I(inode), PAGE_SIZE);
8518 sb_end_pagefault(inode->i_sb);
8519 extent_changeset_free(data_reserved);
8520 return VM_FAULT_LOCKED;
8524 up_read(&BTRFS_I(inode)->i_mmap_lock);
8526 btrfs_delalloc_release_extents(BTRFS_I(inode), PAGE_SIZE);
8527 btrfs_delalloc_release_space(BTRFS_I(inode), data_reserved, page_start,
8528 reserved_space, (ret != 0));
8530 sb_end_pagefault(inode->i_sb);
8531 extent_changeset_free(data_reserved);
8535 static int btrfs_truncate(struct inode *inode, bool skip_writeback)
8537 struct btrfs_truncate_control control = {
8538 .inode = BTRFS_I(inode),
8539 .ino = btrfs_ino(BTRFS_I(inode)),
8540 .min_type = BTRFS_EXTENT_DATA_KEY,
8541 .clear_extent_range = true,
8543 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
8544 struct btrfs_root *root = BTRFS_I(inode)->root;
8545 struct btrfs_block_rsv *rsv;
8547 struct btrfs_trans_handle *trans;
8548 u64 mask = fs_info->sectorsize - 1;
8549 u64 min_size = btrfs_calc_metadata_size(fs_info, 1);
8551 if (!skip_writeback) {
8552 ret = btrfs_wait_ordered_range(inode, inode->i_size & (~mask),
8559 * Yes ladies and gentlemen, this is indeed ugly. We have a couple of
8560 * things going on here:
8562 * 1) We need to reserve space to update our inode.
8564 * 2) We need to have something to cache all the space that is going to
8565 * be free'd up by the truncate operation, but also have some slack
8566 * space reserved in case it uses space during the truncate (thank you
8567 * very much snapshotting).
8569 * And we need these to be separate. The fact is we can use a lot of
8570 * space doing the truncate, and we have no earthly idea how much space
8571 * we will use, so we need the truncate reservation to be separate so it
8572 * doesn't end up using space reserved for updating the inode. We also
8573 * need to be able to stop the transaction and start a new one, which
8574 * means we need to be able to update the inode several times, and we
8575 * have no idea of knowing how many times that will be, so we can't just
8576 * reserve 1 item for the entirety of the operation, so that has to be
8577 * done separately as well.
8579 * So that leaves us with
8581 * 1) rsv - for the truncate reservation, which we will steal from the
8582 * transaction reservation.
8583 * 2) fs_info->trans_block_rsv - this will have 1 items worth left for
8584 * updating the inode.
8586 rsv = btrfs_alloc_block_rsv(fs_info, BTRFS_BLOCK_RSV_TEMP);
8589 rsv->size = min_size;
8590 rsv->failfast = true;
8593 * 1 for the truncate slack space
8594 * 1 for updating the inode.
8596 trans = btrfs_start_transaction(root, 2);
8597 if (IS_ERR(trans)) {
8598 ret = PTR_ERR(trans);
8602 /* Migrate the slack space for the truncate to our reserve */
8603 ret = btrfs_block_rsv_migrate(&fs_info->trans_block_rsv, rsv,
8607 trans->block_rsv = rsv;
8610 struct extent_state *cached_state = NULL;
8611 const u64 new_size = inode->i_size;
8612 const u64 lock_start = ALIGN_DOWN(new_size, fs_info->sectorsize);
8614 control.new_size = new_size;
8615 lock_extent(&BTRFS_I(inode)->io_tree, lock_start, (u64)-1,
8618 * We want to drop from the next block forward in case this new
8619 * size is not block aligned since we will be keeping the last
8620 * block of the extent just the way it is.
8622 btrfs_drop_extent_map_range(BTRFS_I(inode),
8623 ALIGN(new_size, fs_info->sectorsize),
8626 ret = btrfs_truncate_inode_items(trans, root, &control);
8628 inode_sub_bytes(inode, control.sub_bytes);
8629 btrfs_inode_safe_disk_i_size_write(BTRFS_I(inode), control.last_size);
8631 unlock_extent(&BTRFS_I(inode)->io_tree, lock_start, (u64)-1,
8634 trans->block_rsv = &fs_info->trans_block_rsv;
8635 if (ret != -ENOSPC && ret != -EAGAIN)
8638 ret = btrfs_update_inode(trans, root, BTRFS_I(inode));
8642 btrfs_end_transaction(trans);
8643 btrfs_btree_balance_dirty(fs_info);
8645 trans = btrfs_start_transaction(root, 2);
8646 if (IS_ERR(trans)) {
8647 ret = PTR_ERR(trans);
8652 btrfs_block_rsv_release(fs_info, rsv, -1, NULL);
8653 ret = btrfs_block_rsv_migrate(&fs_info->trans_block_rsv,
8654 rsv, min_size, false);
8655 BUG_ON(ret); /* shouldn't happen */
8656 trans->block_rsv = rsv;
8660 * We can't call btrfs_truncate_block inside a trans handle as we could
8661 * deadlock with freeze, if we got BTRFS_NEED_TRUNCATE_BLOCK then we
8662 * know we've truncated everything except the last little bit, and can
8663 * do btrfs_truncate_block and then update the disk_i_size.
8665 if (ret == BTRFS_NEED_TRUNCATE_BLOCK) {
8666 btrfs_end_transaction(trans);
8667 btrfs_btree_balance_dirty(fs_info);
8669 ret = btrfs_truncate_block(BTRFS_I(inode), inode->i_size, 0, 0);
8672 trans = btrfs_start_transaction(root, 1);
8673 if (IS_ERR(trans)) {
8674 ret = PTR_ERR(trans);
8677 btrfs_inode_safe_disk_i_size_write(BTRFS_I(inode), 0);
8683 trans->block_rsv = &fs_info->trans_block_rsv;
8684 ret2 = btrfs_update_inode(trans, root, BTRFS_I(inode));
8688 ret2 = btrfs_end_transaction(trans);
8691 btrfs_btree_balance_dirty(fs_info);
8694 btrfs_free_block_rsv(fs_info, rsv);
8696 * So if we truncate and then write and fsync we normally would just
8697 * write the extents that changed, which is a problem if we need to
8698 * first truncate that entire inode. So set this flag so we write out
8699 * all of the extents in the inode to the sync log so we're completely
8702 * If no extents were dropped or trimmed we don't need to force the next
8703 * fsync to truncate all the inode's items from the log and re-log them
8704 * all. This means the truncate operation did not change the file size,
8705 * or changed it to a smaller size but there was only an implicit hole
8706 * between the old i_size and the new i_size, and there were no prealloc
8707 * extents beyond i_size to drop.
8709 if (control.extents_found > 0)
8710 btrfs_set_inode_full_sync(BTRFS_I(inode));
8715 struct inode *btrfs_new_subvol_inode(struct user_namespace *mnt_userns,
8718 struct inode *inode;
8720 inode = new_inode(dir->i_sb);
8723 * Subvolumes don't inherit the sgid bit or the parent's gid if
8724 * the parent's sgid bit is set. This is probably a bug.
8726 inode_init_owner(mnt_userns, inode, NULL,
8727 S_IFDIR | (~current_umask() & S_IRWXUGO));
8728 inode->i_op = &btrfs_dir_inode_operations;
8729 inode->i_fop = &btrfs_dir_file_operations;
8734 struct inode *btrfs_alloc_inode(struct super_block *sb)
8736 struct btrfs_fs_info *fs_info = btrfs_sb(sb);
8737 struct btrfs_inode *ei;
8738 struct inode *inode;
8740 ei = alloc_inode_sb(sb, btrfs_inode_cachep, GFP_KERNEL);
8747 ei->last_sub_trans = 0;
8748 ei->logged_trans = 0;
8749 ei->delalloc_bytes = 0;
8750 ei->new_delalloc_bytes = 0;
8751 ei->defrag_bytes = 0;
8752 ei->disk_i_size = 0;
8756 ei->index_cnt = (u64)-1;
8758 ei->last_unlink_trans = 0;
8759 ei->last_reflink_trans = 0;
8760 ei->last_log_commit = 0;
8762 spin_lock_init(&ei->lock);
8763 spin_lock_init(&ei->io_failure_lock);
8764 ei->outstanding_extents = 0;
8765 if (sb->s_magic != BTRFS_TEST_MAGIC)
8766 btrfs_init_metadata_block_rsv(fs_info, &ei->block_rsv,
8767 BTRFS_BLOCK_RSV_DELALLOC);
8768 ei->runtime_flags = 0;
8769 ei->prop_compress = BTRFS_COMPRESS_NONE;
8770 ei->defrag_compress = BTRFS_COMPRESS_NONE;
8772 ei->delayed_node = NULL;
8774 ei->i_otime.tv_sec = 0;
8775 ei->i_otime.tv_nsec = 0;
8777 inode = &ei->vfs_inode;
8778 extent_map_tree_init(&ei->extent_tree);
8779 extent_io_tree_init(fs_info, &ei->io_tree, IO_TREE_INODE_IO, inode);
8780 extent_io_tree_init(fs_info, &ei->file_extent_tree,
8781 IO_TREE_INODE_FILE_EXTENT, NULL);
8782 ei->io_failure_tree = RB_ROOT;
8783 atomic_set(&ei->sync_writers, 0);
8784 mutex_init(&ei->log_mutex);
8785 btrfs_ordered_inode_tree_init(&ei->ordered_tree);
8786 INIT_LIST_HEAD(&ei->delalloc_inodes);
8787 INIT_LIST_HEAD(&ei->delayed_iput);
8788 RB_CLEAR_NODE(&ei->rb_node);
8789 init_rwsem(&ei->i_mmap_lock);
8794 #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
8795 void btrfs_test_destroy_inode(struct inode *inode)
8797 btrfs_drop_extent_map_range(BTRFS_I(inode), 0, (u64)-1, false);
8798 kmem_cache_free(btrfs_inode_cachep, BTRFS_I(inode));
8802 void btrfs_free_inode(struct inode *inode)
8804 kmem_cache_free(btrfs_inode_cachep, BTRFS_I(inode));
8807 void btrfs_destroy_inode(struct inode *vfs_inode)
8809 struct btrfs_ordered_extent *ordered;
8810 struct btrfs_inode *inode = BTRFS_I(vfs_inode);
8811 struct btrfs_root *root = inode->root;
8812 bool freespace_inode;
8814 WARN_ON(!hlist_empty(&vfs_inode->i_dentry));
8815 WARN_ON(vfs_inode->i_data.nrpages);
8816 WARN_ON(inode->block_rsv.reserved);
8817 WARN_ON(inode->block_rsv.size);
8818 WARN_ON(inode->outstanding_extents);
8819 if (!S_ISDIR(vfs_inode->i_mode)) {
8820 WARN_ON(inode->delalloc_bytes);
8821 WARN_ON(inode->new_delalloc_bytes);
8823 WARN_ON(inode->csum_bytes);
8824 WARN_ON(inode->defrag_bytes);
8827 * This can happen where we create an inode, but somebody else also
8828 * created the same inode and we need to destroy the one we already
8835 * If this is a free space inode do not take the ordered extents lockdep
8838 freespace_inode = btrfs_is_free_space_inode(inode);
8841 ordered = btrfs_lookup_first_ordered_extent(inode, (u64)-1);
8845 btrfs_err(root->fs_info,
8846 "found ordered extent %llu %llu on inode cleanup",
8847 ordered->file_offset, ordered->num_bytes);
8849 if (!freespace_inode)
8850 btrfs_lockdep_acquire(root->fs_info, btrfs_ordered_extent);
8852 btrfs_remove_ordered_extent(inode, ordered);
8853 btrfs_put_ordered_extent(ordered);
8854 btrfs_put_ordered_extent(ordered);
8857 btrfs_qgroup_check_reserved_leak(inode);
8858 inode_tree_del(inode);
8859 btrfs_drop_extent_map_range(inode, 0, (u64)-1, false);
8860 btrfs_inode_clear_file_extent_range(inode, 0, (u64)-1);
8861 btrfs_put_root(inode->root);
8864 int btrfs_drop_inode(struct inode *inode)
8866 struct btrfs_root *root = BTRFS_I(inode)->root;
8871 /* the snap/subvol tree is on deleting */
8872 if (btrfs_root_refs(&root->root_item) == 0)
8875 return generic_drop_inode(inode);
8878 static void init_once(void *foo)
8880 struct btrfs_inode *ei = foo;
8882 inode_init_once(&ei->vfs_inode);
8885 void __cold btrfs_destroy_cachep(void)
8888 * Make sure all delayed rcu free inodes are flushed before we
8892 bioset_exit(&btrfs_dio_bioset);
8893 kmem_cache_destroy(btrfs_inode_cachep);
8894 kmem_cache_destroy(btrfs_trans_handle_cachep);
8895 kmem_cache_destroy(btrfs_path_cachep);
8896 kmem_cache_destroy(btrfs_free_space_cachep);
8897 kmem_cache_destroy(btrfs_free_space_bitmap_cachep);
8900 int __init btrfs_init_cachep(void)
8902 btrfs_inode_cachep = kmem_cache_create("btrfs_inode",
8903 sizeof(struct btrfs_inode), 0,
8904 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD | SLAB_ACCOUNT,
8906 if (!btrfs_inode_cachep)
8909 btrfs_trans_handle_cachep = kmem_cache_create("btrfs_trans_handle",
8910 sizeof(struct btrfs_trans_handle), 0,
8911 SLAB_TEMPORARY | SLAB_MEM_SPREAD, NULL);
8912 if (!btrfs_trans_handle_cachep)
8915 btrfs_path_cachep = kmem_cache_create("btrfs_path",
8916 sizeof(struct btrfs_path), 0,
8917 SLAB_MEM_SPREAD, NULL);
8918 if (!btrfs_path_cachep)
8921 btrfs_free_space_cachep = kmem_cache_create("btrfs_free_space",
8922 sizeof(struct btrfs_free_space), 0,
8923 SLAB_MEM_SPREAD, NULL);
8924 if (!btrfs_free_space_cachep)
8927 btrfs_free_space_bitmap_cachep = kmem_cache_create("btrfs_free_space_bitmap",
8928 PAGE_SIZE, PAGE_SIZE,
8929 SLAB_MEM_SPREAD, NULL);
8930 if (!btrfs_free_space_bitmap_cachep)
8933 if (bioset_init(&btrfs_dio_bioset, BIO_POOL_SIZE,
8934 offsetof(struct btrfs_dio_private, bio),
8940 btrfs_destroy_cachep();
8944 static int btrfs_getattr(struct user_namespace *mnt_userns,
8945 const struct path *path, struct kstat *stat,
8946 u32 request_mask, unsigned int flags)
8950 struct inode *inode = d_inode(path->dentry);
8951 u32 blocksize = inode->i_sb->s_blocksize;
8952 u32 bi_flags = BTRFS_I(inode)->flags;
8953 u32 bi_ro_flags = BTRFS_I(inode)->ro_flags;
8955 stat->result_mask |= STATX_BTIME;
8956 stat->btime.tv_sec = BTRFS_I(inode)->i_otime.tv_sec;
8957 stat->btime.tv_nsec = BTRFS_I(inode)->i_otime.tv_nsec;
8958 if (bi_flags & BTRFS_INODE_APPEND)
8959 stat->attributes |= STATX_ATTR_APPEND;
8960 if (bi_flags & BTRFS_INODE_COMPRESS)
8961 stat->attributes |= STATX_ATTR_COMPRESSED;
8962 if (bi_flags & BTRFS_INODE_IMMUTABLE)
8963 stat->attributes |= STATX_ATTR_IMMUTABLE;
8964 if (bi_flags & BTRFS_INODE_NODUMP)
8965 stat->attributes |= STATX_ATTR_NODUMP;
8966 if (bi_ro_flags & BTRFS_INODE_RO_VERITY)
8967 stat->attributes |= STATX_ATTR_VERITY;
8969 stat->attributes_mask |= (STATX_ATTR_APPEND |
8970 STATX_ATTR_COMPRESSED |
8971 STATX_ATTR_IMMUTABLE |
8974 generic_fillattr(mnt_userns, inode, stat);
8975 stat->dev = BTRFS_I(inode)->root->anon_dev;
8977 spin_lock(&BTRFS_I(inode)->lock);
8978 delalloc_bytes = BTRFS_I(inode)->new_delalloc_bytes;
8979 inode_bytes = inode_get_bytes(inode);
8980 spin_unlock(&BTRFS_I(inode)->lock);
8981 stat->blocks = (ALIGN(inode_bytes, blocksize) +
8982 ALIGN(delalloc_bytes, blocksize)) >> 9;
8986 static int btrfs_rename_exchange(struct inode *old_dir,
8987 struct dentry *old_dentry,
8988 struct inode *new_dir,
8989 struct dentry *new_dentry)
8991 struct btrfs_fs_info *fs_info = btrfs_sb(old_dir->i_sb);
8992 struct btrfs_trans_handle *trans;
8993 unsigned int trans_num_items;
8994 struct btrfs_root *root = BTRFS_I(old_dir)->root;
8995 struct btrfs_root *dest = BTRFS_I(new_dir)->root;
8996 struct inode *new_inode = new_dentry->d_inode;
8997 struct inode *old_inode = old_dentry->d_inode;
8998 struct timespec64 ctime = current_time(old_inode);
8999 struct btrfs_rename_ctx old_rename_ctx;
9000 struct btrfs_rename_ctx new_rename_ctx;
9001 u64 old_ino = btrfs_ino(BTRFS_I(old_inode));
9002 u64 new_ino = btrfs_ino(BTRFS_I(new_inode));
9007 bool need_abort = false;
9010 * For non-subvolumes allow exchange only within one subvolume, in the
9011 * same inode namespace. Two subvolumes (represented as directory) can
9012 * be exchanged as they're a logical link and have a fixed inode number.
9015 (old_ino != BTRFS_FIRST_FREE_OBJECTID ||
9016 new_ino != BTRFS_FIRST_FREE_OBJECTID))
9019 /* close the race window with snapshot create/destroy ioctl */
9020 if (old_ino == BTRFS_FIRST_FREE_OBJECTID ||
9021 new_ino == BTRFS_FIRST_FREE_OBJECTID)
9022 down_read(&fs_info->subvol_sem);
9026 * 1 to remove old dir item
9027 * 1 to remove old dir index
9028 * 1 to add new dir item
9029 * 1 to add new dir index
9030 * 1 to update parent inode
9032 * If the parents are the same, we only need to account for one
9034 trans_num_items = (old_dir == new_dir ? 9 : 10);
9035 if (old_ino == BTRFS_FIRST_FREE_OBJECTID) {
9037 * 1 to remove old root ref
9038 * 1 to remove old root backref
9039 * 1 to add new root ref
9040 * 1 to add new root backref
9042 trans_num_items += 4;
9045 * 1 to update inode item
9046 * 1 to remove old inode ref
9047 * 1 to add new inode ref
9049 trans_num_items += 3;
9051 if (new_ino == BTRFS_FIRST_FREE_OBJECTID)
9052 trans_num_items += 4;
9054 trans_num_items += 3;
9055 trans = btrfs_start_transaction(root, trans_num_items);
9056 if (IS_ERR(trans)) {
9057 ret = PTR_ERR(trans);
9062 ret = btrfs_record_root_in_trans(trans, dest);
9068 * We need to find a free sequence number both in the source and
9069 * in the destination directory for the exchange.
9071 ret = btrfs_set_inode_index(BTRFS_I(new_dir), &old_idx);
9074 ret = btrfs_set_inode_index(BTRFS_I(old_dir), &new_idx);
9078 BTRFS_I(old_inode)->dir_index = 0ULL;
9079 BTRFS_I(new_inode)->dir_index = 0ULL;
9081 /* Reference for the source. */
9082 if (old_ino == BTRFS_FIRST_FREE_OBJECTID) {
9083 /* force full log commit if subvolume involved. */
9084 btrfs_set_log_full_commit(trans);
9086 ret = btrfs_insert_inode_ref(trans, dest,
9087 new_dentry->d_name.name,
9088 new_dentry->d_name.len,
9090 btrfs_ino(BTRFS_I(new_dir)),
9097 /* And now for the dest. */
9098 if (new_ino == BTRFS_FIRST_FREE_OBJECTID) {
9099 /* force full log commit if subvolume involved. */
9100 btrfs_set_log_full_commit(trans);
9102 ret = btrfs_insert_inode_ref(trans, root,
9103 old_dentry->d_name.name,
9104 old_dentry->d_name.len,
9106 btrfs_ino(BTRFS_I(old_dir)),
9110 btrfs_abort_transaction(trans, ret);
9115 /* Update inode version and ctime/mtime. */
9116 inode_inc_iversion(old_dir);
9117 inode_inc_iversion(new_dir);
9118 inode_inc_iversion(old_inode);
9119 inode_inc_iversion(new_inode);
9120 old_dir->i_mtime = ctime;
9121 old_dir->i_ctime = ctime;
9122 new_dir->i_mtime = ctime;
9123 new_dir->i_ctime = ctime;
9124 old_inode->i_ctime = ctime;
9125 new_inode->i_ctime = ctime;
9127 if (old_dentry->d_parent != new_dentry->d_parent) {
9128 btrfs_record_unlink_dir(trans, BTRFS_I(old_dir),
9129 BTRFS_I(old_inode), 1);
9130 btrfs_record_unlink_dir(trans, BTRFS_I(new_dir),
9131 BTRFS_I(new_inode), 1);
9134 /* src is a subvolume */
9135 if (old_ino == BTRFS_FIRST_FREE_OBJECTID) {
9136 ret = btrfs_unlink_subvol(trans, old_dir, old_dentry);
9137 } else { /* src is an inode */
9138 ret = __btrfs_unlink_inode(trans, BTRFS_I(old_dir),
9139 BTRFS_I(old_dentry->d_inode),
9140 old_dentry->d_name.name,
9141 old_dentry->d_name.len,
9144 ret = btrfs_update_inode(trans, root, BTRFS_I(old_inode));
9147 btrfs_abort_transaction(trans, ret);
9151 /* dest is a subvolume */
9152 if (new_ino == BTRFS_FIRST_FREE_OBJECTID) {
9153 ret = btrfs_unlink_subvol(trans, new_dir, new_dentry);
9154 } else { /* dest is an inode */
9155 ret = __btrfs_unlink_inode(trans, BTRFS_I(new_dir),
9156 BTRFS_I(new_dentry->d_inode),
9157 new_dentry->d_name.name,
9158 new_dentry->d_name.len,
9161 ret = btrfs_update_inode(trans, dest, BTRFS_I(new_inode));
9164 btrfs_abort_transaction(trans, ret);
9168 ret = btrfs_add_link(trans, BTRFS_I(new_dir), BTRFS_I(old_inode),
9169 new_dentry->d_name.name,
9170 new_dentry->d_name.len, 0, old_idx);
9172 btrfs_abort_transaction(trans, ret);
9176 ret = btrfs_add_link(trans, BTRFS_I(old_dir), BTRFS_I(new_inode),
9177 old_dentry->d_name.name,
9178 old_dentry->d_name.len, 0, new_idx);
9180 btrfs_abort_transaction(trans, ret);
9184 if (old_inode->i_nlink == 1)
9185 BTRFS_I(old_inode)->dir_index = old_idx;
9186 if (new_inode->i_nlink == 1)
9187 BTRFS_I(new_inode)->dir_index = new_idx;
9190 * Now pin the logs of the roots. We do it to ensure that no other task
9191 * can sync the logs while we are in progress with the rename, because
9192 * that could result in an inconsistency in case any of the inodes that
9193 * are part of this rename operation were logged before.
9195 if (old_ino != BTRFS_FIRST_FREE_OBJECTID)
9196 btrfs_pin_log_trans(root);
9197 if (new_ino != BTRFS_FIRST_FREE_OBJECTID)
9198 btrfs_pin_log_trans(dest);
9200 /* Do the log updates for all inodes. */
9201 if (old_ino != BTRFS_FIRST_FREE_OBJECTID)
9202 btrfs_log_new_name(trans, old_dentry, BTRFS_I(old_dir),
9203 old_rename_ctx.index, new_dentry->d_parent);
9204 if (new_ino != BTRFS_FIRST_FREE_OBJECTID)
9205 btrfs_log_new_name(trans, new_dentry, BTRFS_I(new_dir),
9206 new_rename_ctx.index, old_dentry->d_parent);
9208 /* Now unpin the logs. */
9209 if (old_ino != BTRFS_FIRST_FREE_OBJECTID)
9210 btrfs_end_log_trans(root);
9211 if (new_ino != BTRFS_FIRST_FREE_OBJECTID)
9212 btrfs_end_log_trans(dest);
9214 ret2 = btrfs_end_transaction(trans);
9215 ret = ret ? ret : ret2;
9217 if (new_ino == BTRFS_FIRST_FREE_OBJECTID ||
9218 old_ino == BTRFS_FIRST_FREE_OBJECTID)
9219 up_read(&fs_info->subvol_sem);
9224 static struct inode *new_whiteout_inode(struct user_namespace *mnt_userns,
9227 struct inode *inode;
9229 inode = new_inode(dir->i_sb);
9231 inode_init_owner(mnt_userns, inode, dir,
9232 S_IFCHR | WHITEOUT_MODE);
9233 inode->i_op = &btrfs_special_inode_operations;
9234 init_special_inode(inode, inode->i_mode, WHITEOUT_DEV);
9239 static int btrfs_rename(struct user_namespace *mnt_userns,
9240 struct inode *old_dir, struct dentry *old_dentry,
9241 struct inode *new_dir, struct dentry *new_dentry,
9244 struct btrfs_fs_info *fs_info = btrfs_sb(old_dir->i_sb);
9245 struct btrfs_new_inode_args whiteout_args = {
9247 .dentry = old_dentry,
9249 struct btrfs_trans_handle *trans;
9250 unsigned int trans_num_items;
9251 struct btrfs_root *root = BTRFS_I(old_dir)->root;
9252 struct btrfs_root *dest = BTRFS_I(new_dir)->root;
9253 struct inode *new_inode = d_inode(new_dentry);
9254 struct inode *old_inode = d_inode(old_dentry);
9255 struct btrfs_rename_ctx rename_ctx;
9259 u64 old_ino = btrfs_ino(BTRFS_I(old_inode));
9261 if (btrfs_ino(BTRFS_I(new_dir)) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)
9264 /* we only allow rename subvolume link between subvolumes */
9265 if (old_ino != BTRFS_FIRST_FREE_OBJECTID && root != dest)
9268 if (old_ino == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID ||
9269 (new_inode && btrfs_ino(BTRFS_I(new_inode)) == BTRFS_FIRST_FREE_OBJECTID))
9272 if (S_ISDIR(old_inode->i_mode) && new_inode &&
9273 new_inode->i_size > BTRFS_EMPTY_DIR_SIZE)
9277 /* check for collisions, even if the name isn't there */
9278 ret = btrfs_check_dir_item_collision(dest, new_dir->i_ino,
9279 new_dentry->d_name.name,
9280 new_dentry->d_name.len);
9283 if (ret == -EEXIST) {
9285 * eexist without a new_inode */
9286 if (WARN_ON(!new_inode)) {
9290 /* maybe -EOVERFLOW */
9297 * we're using rename to replace one file with another. Start IO on it
9298 * now so we don't add too much work to the end of the transaction
9300 if (new_inode && S_ISREG(old_inode->i_mode) && new_inode->i_size)
9301 filemap_flush(old_inode->i_mapping);
9303 if (flags & RENAME_WHITEOUT) {
9304 whiteout_args.inode = new_whiteout_inode(mnt_userns, old_dir);
9305 if (!whiteout_args.inode)
9307 ret = btrfs_new_inode_prepare(&whiteout_args, &trans_num_items);
9309 goto out_whiteout_inode;
9311 /* 1 to update the old parent inode. */
9312 trans_num_items = 1;
9315 if (old_ino == BTRFS_FIRST_FREE_OBJECTID) {
9316 /* Close the race window with snapshot create/destroy ioctl */
9317 down_read(&fs_info->subvol_sem);
9319 * 1 to remove old root ref
9320 * 1 to remove old root backref
9321 * 1 to add new root ref
9322 * 1 to add new root backref
9324 trans_num_items += 4;
9328 * 1 to remove old inode ref
9329 * 1 to add new inode ref
9331 trans_num_items += 3;
9334 * 1 to remove old dir item
9335 * 1 to remove old dir index
9336 * 1 to add new dir item
9337 * 1 to add new dir index
9339 trans_num_items += 4;
9340 /* 1 to update new parent inode if it's not the same as the old parent */
9341 if (new_dir != old_dir)
9346 * 1 to remove inode ref
9347 * 1 to remove dir item
9348 * 1 to remove dir index
9349 * 1 to possibly add orphan item
9351 trans_num_items += 5;
9353 trans = btrfs_start_transaction(root, trans_num_items);
9354 if (IS_ERR(trans)) {
9355 ret = PTR_ERR(trans);
9360 ret = btrfs_record_root_in_trans(trans, dest);
9365 ret = btrfs_set_inode_index(BTRFS_I(new_dir), &index);
9369 BTRFS_I(old_inode)->dir_index = 0ULL;
9370 if (unlikely(old_ino == BTRFS_FIRST_FREE_OBJECTID)) {
9371 /* force full log commit if subvolume involved. */
9372 btrfs_set_log_full_commit(trans);
9374 ret = btrfs_insert_inode_ref(trans, dest,
9375 new_dentry->d_name.name,
9376 new_dentry->d_name.len,
9378 btrfs_ino(BTRFS_I(new_dir)), index);
9383 inode_inc_iversion(old_dir);
9384 inode_inc_iversion(new_dir);
9385 inode_inc_iversion(old_inode);
9386 old_dir->i_mtime = current_time(old_dir);
9387 old_dir->i_ctime = old_dir->i_mtime;
9388 new_dir->i_mtime = old_dir->i_mtime;
9389 new_dir->i_ctime = old_dir->i_mtime;
9390 old_inode->i_ctime = old_dir->i_mtime;
9392 if (old_dentry->d_parent != new_dentry->d_parent)
9393 btrfs_record_unlink_dir(trans, BTRFS_I(old_dir),
9394 BTRFS_I(old_inode), 1);
9396 if (unlikely(old_ino == BTRFS_FIRST_FREE_OBJECTID)) {
9397 ret = btrfs_unlink_subvol(trans, old_dir, old_dentry);
9399 ret = __btrfs_unlink_inode(trans, BTRFS_I(old_dir),
9400 BTRFS_I(d_inode(old_dentry)),
9401 old_dentry->d_name.name,
9402 old_dentry->d_name.len,
9405 ret = btrfs_update_inode(trans, root, BTRFS_I(old_inode));
9408 btrfs_abort_transaction(trans, ret);
9413 inode_inc_iversion(new_inode);
9414 new_inode->i_ctime = current_time(new_inode);
9415 if (unlikely(btrfs_ino(BTRFS_I(new_inode)) ==
9416 BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)) {
9417 ret = btrfs_unlink_subvol(trans, new_dir, new_dentry);
9418 BUG_ON(new_inode->i_nlink == 0);
9420 ret = btrfs_unlink_inode(trans, BTRFS_I(new_dir),
9421 BTRFS_I(d_inode(new_dentry)),
9422 new_dentry->d_name.name,
9423 new_dentry->d_name.len);
9425 if (!ret && new_inode->i_nlink == 0)
9426 ret = btrfs_orphan_add(trans,
9427 BTRFS_I(d_inode(new_dentry)));
9429 btrfs_abort_transaction(trans, ret);
9434 ret = btrfs_add_link(trans, BTRFS_I(new_dir), BTRFS_I(old_inode),
9435 new_dentry->d_name.name,
9436 new_dentry->d_name.len, 0, index);
9438 btrfs_abort_transaction(trans, ret);
9442 if (old_inode->i_nlink == 1)
9443 BTRFS_I(old_inode)->dir_index = index;
9445 if (old_ino != BTRFS_FIRST_FREE_OBJECTID)
9446 btrfs_log_new_name(trans, old_dentry, BTRFS_I(old_dir),
9447 rename_ctx.index, new_dentry->d_parent);
9449 if (flags & RENAME_WHITEOUT) {
9450 ret = btrfs_create_new_inode(trans, &whiteout_args);
9452 btrfs_abort_transaction(trans, ret);
9455 unlock_new_inode(whiteout_args.inode);
9456 iput(whiteout_args.inode);
9457 whiteout_args.inode = NULL;
9461 ret2 = btrfs_end_transaction(trans);
9462 ret = ret ? ret : ret2;
9464 if (old_ino == BTRFS_FIRST_FREE_OBJECTID)
9465 up_read(&fs_info->subvol_sem);
9466 if (flags & RENAME_WHITEOUT)
9467 btrfs_new_inode_args_destroy(&whiteout_args);
9469 if (flags & RENAME_WHITEOUT)
9470 iput(whiteout_args.inode);
9474 static int btrfs_rename2(struct user_namespace *mnt_userns, struct inode *old_dir,
9475 struct dentry *old_dentry, struct inode *new_dir,
9476 struct dentry *new_dentry, unsigned int flags)
9480 if (flags & ~(RENAME_NOREPLACE | RENAME_EXCHANGE | RENAME_WHITEOUT))
9483 if (flags & RENAME_EXCHANGE)
9484 ret = btrfs_rename_exchange(old_dir, old_dentry, new_dir,
9487 ret = btrfs_rename(mnt_userns, old_dir, old_dentry, new_dir,
9490 btrfs_btree_balance_dirty(BTRFS_I(new_dir)->root->fs_info);
9495 struct btrfs_delalloc_work {
9496 struct inode *inode;
9497 struct completion completion;
9498 struct list_head list;
9499 struct btrfs_work work;
9502 static void btrfs_run_delalloc_work(struct btrfs_work *work)
9504 struct btrfs_delalloc_work *delalloc_work;
9505 struct inode *inode;
9507 delalloc_work = container_of(work, struct btrfs_delalloc_work,
9509 inode = delalloc_work->inode;
9510 filemap_flush(inode->i_mapping);
9511 if (test_bit(BTRFS_INODE_HAS_ASYNC_EXTENT,
9512 &BTRFS_I(inode)->runtime_flags))
9513 filemap_flush(inode->i_mapping);
9516 complete(&delalloc_work->completion);
9519 static struct btrfs_delalloc_work *btrfs_alloc_delalloc_work(struct inode *inode)
9521 struct btrfs_delalloc_work *work;
9523 work = kmalloc(sizeof(*work), GFP_NOFS);
9527 init_completion(&work->completion);
9528 INIT_LIST_HEAD(&work->list);
9529 work->inode = inode;
9530 btrfs_init_work(&work->work, btrfs_run_delalloc_work, NULL, NULL);
9536 * some fairly slow code that needs optimization. This walks the list
9537 * of all the inodes with pending delalloc and forces them to disk.
9539 static int start_delalloc_inodes(struct btrfs_root *root,
9540 struct writeback_control *wbc, bool snapshot,
9541 bool in_reclaim_context)
9543 struct btrfs_inode *binode;
9544 struct inode *inode;
9545 struct btrfs_delalloc_work *work, *next;
9546 struct list_head works;
9547 struct list_head splice;
9549 bool full_flush = wbc->nr_to_write == LONG_MAX;
9551 INIT_LIST_HEAD(&works);
9552 INIT_LIST_HEAD(&splice);
9554 mutex_lock(&root->delalloc_mutex);
9555 spin_lock(&root->delalloc_lock);
9556 list_splice_init(&root->delalloc_inodes, &splice);
9557 while (!list_empty(&splice)) {
9558 binode = list_entry(splice.next, struct btrfs_inode,
9561 list_move_tail(&binode->delalloc_inodes,
9562 &root->delalloc_inodes);
9564 if (in_reclaim_context &&
9565 test_bit(BTRFS_INODE_NO_DELALLOC_FLUSH, &binode->runtime_flags))
9568 inode = igrab(&binode->vfs_inode);
9570 cond_resched_lock(&root->delalloc_lock);
9573 spin_unlock(&root->delalloc_lock);
9576 set_bit(BTRFS_INODE_SNAPSHOT_FLUSH,
9577 &binode->runtime_flags);
9579 work = btrfs_alloc_delalloc_work(inode);
9585 list_add_tail(&work->list, &works);
9586 btrfs_queue_work(root->fs_info->flush_workers,
9589 ret = filemap_fdatawrite_wbc(inode->i_mapping, wbc);
9590 btrfs_add_delayed_iput(inode);
9591 if (ret || wbc->nr_to_write <= 0)
9595 spin_lock(&root->delalloc_lock);
9597 spin_unlock(&root->delalloc_lock);
9600 list_for_each_entry_safe(work, next, &works, list) {
9601 list_del_init(&work->list);
9602 wait_for_completion(&work->completion);
9606 if (!list_empty(&splice)) {
9607 spin_lock(&root->delalloc_lock);
9608 list_splice_tail(&splice, &root->delalloc_inodes);
9609 spin_unlock(&root->delalloc_lock);
9611 mutex_unlock(&root->delalloc_mutex);
9615 int btrfs_start_delalloc_snapshot(struct btrfs_root *root, bool in_reclaim_context)
9617 struct writeback_control wbc = {
9618 .nr_to_write = LONG_MAX,
9619 .sync_mode = WB_SYNC_NONE,
9621 .range_end = LLONG_MAX,
9623 struct btrfs_fs_info *fs_info = root->fs_info;
9625 if (BTRFS_FS_ERROR(fs_info))
9628 return start_delalloc_inodes(root, &wbc, true, in_reclaim_context);
9631 int btrfs_start_delalloc_roots(struct btrfs_fs_info *fs_info, long nr,
9632 bool in_reclaim_context)
9634 struct writeback_control wbc = {
9636 .sync_mode = WB_SYNC_NONE,
9638 .range_end = LLONG_MAX,
9640 struct btrfs_root *root;
9641 struct list_head splice;
9644 if (BTRFS_FS_ERROR(fs_info))
9647 INIT_LIST_HEAD(&splice);
9649 mutex_lock(&fs_info->delalloc_root_mutex);
9650 spin_lock(&fs_info->delalloc_root_lock);
9651 list_splice_init(&fs_info->delalloc_roots, &splice);
9652 while (!list_empty(&splice)) {
9654 * Reset nr_to_write here so we know that we're doing a full
9658 wbc.nr_to_write = LONG_MAX;
9660 root = list_first_entry(&splice, struct btrfs_root,
9662 root = btrfs_grab_root(root);
9664 list_move_tail(&root->delalloc_root,
9665 &fs_info->delalloc_roots);
9666 spin_unlock(&fs_info->delalloc_root_lock);
9668 ret = start_delalloc_inodes(root, &wbc, false, in_reclaim_context);
9669 btrfs_put_root(root);
9670 if (ret < 0 || wbc.nr_to_write <= 0)
9672 spin_lock(&fs_info->delalloc_root_lock);
9674 spin_unlock(&fs_info->delalloc_root_lock);
9678 if (!list_empty(&splice)) {
9679 spin_lock(&fs_info->delalloc_root_lock);
9680 list_splice_tail(&splice, &fs_info->delalloc_roots);
9681 spin_unlock(&fs_info->delalloc_root_lock);
9683 mutex_unlock(&fs_info->delalloc_root_mutex);
9687 static int btrfs_symlink(struct user_namespace *mnt_userns, struct inode *dir,
9688 struct dentry *dentry, const char *symname)
9690 struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
9691 struct btrfs_trans_handle *trans;
9692 struct btrfs_root *root = BTRFS_I(dir)->root;
9693 struct btrfs_path *path;
9694 struct btrfs_key key;
9695 struct inode *inode;
9696 struct btrfs_new_inode_args new_inode_args = {
9700 unsigned int trans_num_items;
9705 struct btrfs_file_extent_item *ei;
9706 struct extent_buffer *leaf;
9708 name_len = strlen(symname);
9709 if (name_len > BTRFS_MAX_INLINE_DATA_SIZE(fs_info))
9710 return -ENAMETOOLONG;
9712 inode = new_inode(dir->i_sb);
9715 inode_init_owner(mnt_userns, inode, dir, S_IFLNK | S_IRWXUGO);
9716 inode->i_op = &btrfs_symlink_inode_operations;
9717 inode_nohighmem(inode);
9718 inode->i_mapping->a_ops = &btrfs_aops;
9719 btrfs_i_size_write(BTRFS_I(inode), name_len);
9720 inode_set_bytes(inode, name_len);
9722 new_inode_args.inode = inode;
9723 err = btrfs_new_inode_prepare(&new_inode_args, &trans_num_items);
9726 /* 1 additional item for the inline extent */
9729 trans = btrfs_start_transaction(root, trans_num_items);
9730 if (IS_ERR(trans)) {
9731 err = PTR_ERR(trans);
9732 goto out_new_inode_args;
9735 err = btrfs_create_new_inode(trans, &new_inode_args);
9739 path = btrfs_alloc_path();
9742 btrfs_abort_transaction(trans, err);
9743 discard_new_inode(inode);
9747 key.objectid = btrfs_ino(BTRFS_I(inode));
9749 key.type = BTRFS_EXTENT_DATA_KEY;
9750 datasize = btrfs_file_extent_calc_inline_size(name_len);
9751 err = btrfs_insert_empty_item(trans, root, path, &key,
9754 btrfs_abort_transaction(trans, err);
9755 btrfs_free_path(path);
9756 discard_new_inode(inode);
9760 leaf = path->nodes[0];
9761 ei = btrfs_item_ptr(leaf, path->slots[0],
9762 struct btrfs_file_extent_item);
9763 btrfs_set_file_extent_generation(leaf, ei, trans->transid);
9764 btrfs_set_file_extent_type(leaf, ei,
9765 BTRFS_FILE_EXTENT_INLINE);
9766 btrfs_set_file_extent_encryption(leaf, ei, 0);
9767 btrfs_set_file_extent_compression(leaf, ei, 0);
9768 btrfs_set_file_extent_other_encoding(leaf, ei, 0);
9769 btrfs_set_file_extent_ram_bytes(leaf, ei, name_len);
9771 ptr = btrfs_file_extent_inline_start(ei);
9772 write_extent_buffer(leaf, symname, ptr, name_len);
9773 btrfs_mark_buffer_dirty(leaf);
9774 btrfs_free_path(path);
9776 d_instantiate_new(dentry, inode);
9779 btrfs_end_transaction(trans);
9780 btrfs_btree_balance_dirty(fs_info);
9782 btrfs_new_inode_args_destroy(&new_inode_args);
9789 static struct btrfs_trans_handle *insert_prealloc_file_extent(
9790 struct btrfs_trans_handle *trans_in,
9791 struct btrfs_inode *inode,
9792 struct btrfs_key *ins,
9795 struct btrfs_file_extent_item stack_fi;
9796 struct btrfs_replace_extent_info extent_info;
9797 struct btrfs_trans_handle *trans = trans_in;
9798 struct btrfs_path *path;
9799 u64 start = ins->objectid;
9800 u64 len = ins->offset;
9801 int qgroup_released;
9804 memset(&stack_fi, 0, sizeof(stack_fi));
9806 btrfs_set_stack_file_extent_type(&stack_fi, BTRFS_FILE_EXTENT_PREALLOC);
9807 btrfs_set_stack_file_extent_disk_bytenr(&stack_fi, start);
9808 btrfs_set_stack_file_extent_disk_num_bytes(&stack_fi, len);
9809 btrfs_set_stack_file_extent_num_bytes(&stack_fi, len);
9810 btrfs_set_stack_file_extent_ram_bytes(&stack_fi, len);
9811 btrfs_set_stack_file_extent_compression(&stack_fi, BTRFS_COMPRESS_NONE);
9812 /* Encryption and other encoding is reserved and all 0 */
9814 qgroup_released = btrfs_qgroup_release_data(inode, file_offset, len);
9815 if (qgroup_released < 0)
9816 return ERR_PTR(qgroup_released);
9819 ret = insert_reserved_file_extent(trans, inode,
9820 file_offset, &stack_fi,
9821 true, qgroup_released);
9827 extent_info.disk_offset = start;
9828 extent_info.disk_len = len;
9829 extent_info.data_offset = 0;
9830 extent_info.data_len = len;
9831 extent_info.file_offset = file_offset;
9832 extent_info.extent_buf = (char *)&stack_fi;
9833 extent_info.is_new_extent = true;
9834 extent_info.update_times = true;
9835 extent_info.qgroup_reserved = qgroup_released;
9836 extent_info.insertions = 0;
9838 path = btrfs_alloc_path();
9844 ret = btrfs_replace_file_extents(inode, path, file_offset,
9845 file_offset + len - 1, &extent_info,
9847 btrfs_free_path(path);
9854 * We have released qgroup data range at the beginning of the function,
9855 * and normally qgroup_released bytes will be freed when committing
9857 * But if we error out early, we have to free what we have released
9858 * or we leak qgroup data reservation.
9860 btrfs_qgroup_free_refroot(inode->root->fs_info,
9861 inode->root->root_key.objectid, qgroup_released,
9862 BTRFS_QGROUP_RSV_DATA);
9863 return ERR_PTR(ret);
9866 static int __btrfs_prealloc_file_range(struct inode *inode, int mode,
9867 u64 start, u64 num_bytes, u64 min_size,
9868 loff_t actual_len, u64 *alloc_hint,
9869 struct btrfs_trans_handle *trans)
9871 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
9872 struct extent_map *em;
9873 struct btrfs_root *root = BTRFS_I(inode)->root;
9874 struct btrfs_key ins;
9875 u64 cur_offset = start;
9876 u64 clear_offset = start;
9879 u64 last_alloc = (u64)-1;
9881 bool own_trans = true;
9882 u64 end = start + num_bytes - 1;
9886 while (num_bytes > 0) {
9887 cur_bytes = min_t(u64, num_bytes, SZ_256M);
9888 cur_bytes = max(cur_bytes, min_size);
9890 * If we are severely fragmented we could end up with really
9891 * small allocations, so if the allocator is returning small
9892 * chunks lets make its job easier by only searching for those
9895 cur_bytes = min(cur_bytes, last_alloc);
9896 ret = btrfs_reserve_extent(root, cur_bytes, cur_bytes,
9897 min_size, 0, *alloc_hint, &ins, 1, 0);
9902 * We've reserved this space, and thus converted it from
9903 * ->bytes_may_use to ->bytes_reserved. Any error that happens
9904 * from here on out we will only need to clear our reservation
9905 * for the remaining unreserved area, so advance our
9906 * clear_offset by our extent size.
9908 clear_offset += ins.offset;
9910 last_alloc = ins.offset;
9911 trans = insert_prealloc_file_extent(trans, BTRFS_I(inode),
9914 * Now that we inserted the prealloc extent we can finally
9915 * decrement the number of reservations in the block group.
9916 * If we did it before, we could race with relocation and have
9917 * relocation miss the reserved extent, making it fail later.
9919 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
9920 if (IS_ERR(trans)) {
9921 ret = PTR_ERR(trans);
9922 btrfs_free_reserved_extent(fs_info, ins.objectid,
9927 em = alloc_extent_map();
9929 btrfs_drop_extent_map_range(BTRFS_I(inode), cur_offset,
9930 cur_offset + ins.offset - 1, false);
9931 btrfs_set_inode_full_sync(BTRFS_I(inode));
9935 em->start = cur_offset;
9936 em->orig_start = cur_offset;
9937 em->len = ins.offset;
9938 em->block_start = ins.objectid;
9939 em->block_len = ins.offset;
9940 em->orig_block_len = ins.offset;
9941 em->ram_bytes = ins.offset;
9942 set_bit(EXTENT_FLAG_PREALLOC, &em->flags);
9943 em->generation = trans->transid;
9945 ret = btrfs_replace_extent_map_range(BTRFS_I(inode), em, true);
9946 free_extent_map(em);
9948 num_bytes -= ins.offset;
9949 cur_offset += ins.offset;
9950 *alloc_hint = ins.objectid + ins.offset;
9952 inode_inc_iversion(inode);
9953 inode->i_ctime = current_time(inode);
9954 BTRFS_I(inode)->flags |= BTRFS_INODE_PREALLOC;
9955 if (!(mode & FALLOC_FL_KEEP_SIZE) &&
9956 (actual_len > inode->i_size) &&
9957 (cur_offset > inode->i_size)) {
9958 if (cur_offset > actual_len)
9959 i_size = actual_len;
9961 i_size = cur_offset;
9962 i_size_write(inode, i_size);
9963 btrfs_inode_safe_disk_i_size_write(BTRFS_I(inode), 0);
9966 ret = btrfs_update_inode(trans, root, BTRFS_I(inode));
9969 btrfs_abort_transaction(trans, ret);
9971 btrfs_end_transaction(trans);
9976 btrfs_end_transaction(trans);
9980 if (clear_offset < end)
9981 btrfs_free_reserved_data_space(BTRFS_I(inode), NULL, clear_offset,
9982 end - clear_offset + 1);
9986 int btrfs_prealloc_file_range(struct inode *inode, int mode,
9987 u64 start, u64 num_bytes, u64 min_size,
9988 loff_t actual_len, u64 *alloc_hint)
9990 return __btrfs_prealloc_file_range(inode, mode, start, num_bytes,
9991 min_size, actual_len, alloc_hint,
9995 int btrfs_prealloc_file_range_trans(struct inode *inode,
9996 struct btrfs_trans_handle *trans, int mode,
9997 u64 start, u64 num_bytes, u64 min_size,
9998 loff_t actual_len, u64 *alloc_hint)
10000 return __btrfs_prealloc_file_range(inode, mode, start, num_bytes,
10001 min_size, actual_len, alloc_hint, trans);
10004 static int btrfs_permission(struct user_namespace *mnt_userns,
10005 struct inode *inode, int mask)
10007 struct btrfs_root *root = BTRFS_I(inode)->root;
10008 umode_t mode = inode->i_mode;
10010 if (mask & MAY_WRITE &&
10011 (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode))) {
10012 if (btrfs_root_readonly(root))
10014 if (BTRFS_I(inode)->flags & BTRFS_INODE_READONLY)
10017 return generic_permission(mnt_userns, inode, mask);
10020 static int btrfs_tmpfile(struct user_namespace *mnt_userns, struct inode *dir,
10021 struct file *file, umode_t mode)
10023 struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
10024 struct btrfs_trans_handle *trans;
10025 struct btrfs_root *root = BTRFS_I(dir)->root;
10026 struct inode *inode;
10027 struct btrfs_new_inode_args new_inode_args = {
10029 .dentry = file->f_path.dentry,
10032 unsigned int trans_num_items;
10035 inode = new_inode(dir->i_sb);
10038 inode_init_owner(mnt_userns, inode, dir, mode);
10039 inode->i_fop = &btrfs_file_operations;
10040 inode->i_op = &btrfs_file_inode_operations;
10041 inode->i_mapping->a_ops = &btrfs_aops;
10043 new_inode_args.inode = inode;
10044 ret = btrfs_new_inode_prepare(&new_inode_args, &trans_num_items);
10048 trans = btrfs_start_transaction(root, trans_num_items);
10049 if (IS_ERR(trans)) {
10050 ret = PTR_ERR(trans);
10051 goto out_new_inode_args;
10054 ret = btrfs_create_new_inode(trans, &new_inode_args);
10057 * We set number of links to 0 in btrfs_create_new_inode(), and here we
10058 * set it to 1 because d_tmpfile() will issue a warning if the count is
10061 * d_tmpfile() -> inode_dec_link_count() -> drop_nlink()
10063 set_nlink(inode, 1);
10066 d_tmpfile(file, inode);
10067 unlock_new_inode(inode);
10068 mark_inode_dirty(inode);
10071 btrfs_end_transaction(trans);
10072 btrfs_btree_balance_dirty(fs_info);
10073 out_new_inode_args:
10074 btrfs_new_inode_args_destroy(&new_inode_args);
10078 return finish_open_simple(file, ret);
10081 void btrfs_set_range_writeback(struct btrfs_inode *inode, u64 start, u64 end)
10083 struct btrfs_fs_info *fs_info = inode->root->fs_info;
10084 unsigned long index = start >> PAGE_SHIFT;
10085 unsigned long end_index = end >> PAGE_SHIFT;
10089 ASSERT(end + 1 - start <= U32_MAX);
10090 len = end + 1 - start;
10091 while (index <= end_index) {
10092 page = find_get_page(inode->vfs_inode.i_mapping, index);
10093 ASSERT(page); /* Pages should be in the extent_io_tree */
10095 btrfs_page_set_writeback(fs_info, page, start, len);
10101 int btrfs_encoded_io_compression_from_extent(struct btrfs_fs_info *fs_info,
10104 switch (compress_type) {
10105 case BTRFS_COMPRESS_NONE:
10106 return BTRFS_ENCODED_IO_COMPRESSION_NONE;
10107 case BTRFS_COMPRESS_ZLIB:
10108 return BTRFS_ENCODED_IO_COMPRESSION_ZLIB;
10109 case BTRFS_COMPRESS_LZO:
10111 * The LZO format depends on the sector size. 64K is the maximum
10112 * sector size that we support.
10114 if (fs_info->sectorsize < SZ_4K || fs_info->sectorsize > SZ_64K)
10116 return BTRFS_ENCODED_IO_COMPRESSION_LZO_4K +
10117 (fs_info->sectorsize_bits - 12);
10118 case BTRFS_COMPRESS_ZSTD:
10119 return BTRFS_ENCODED_IO_COMPRESSION_ZSTD;
10125 static ssize_t btrfs_encoded_read_inline(
10126 struct kiocb *iocb,
10127 struct iov_iter *iter, u64 start,
10129 struct extent_state **cached_state,
10130 u64 extent_start, size_t count,
10131 struct btrfs_ioctl_encoded_io_args *encoded,
10134 struct btrfs_inode *inode = BTRFS_I(file_inode(iocb->ki_filp));
10135 struct btrfs_root *root = inode->root;
10136 struct btrfs_fs_info *fs_info = root->fs_info;
10137 struct extent_io_tree *io_tree = &inode->io_tree;
10138 struct btrfs_path *path;
10139 struct extent_buffer *leaf;
10140 struct btrfs_file_extent_item *item;
10146 path = btrfs_alloc_path();
10151 ret = btrfs_lookup_file_extent(NULL, root, path, btrfs_ino(inode),
10155 /* The extent item disappeared? */
10160 leaf = path->nodes[0];
10161 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_file_extent_item);
10163 ram_bytes = btrfs_file_extent_ram_bytes(leaf, item);
10164 ptr = btrfs_file_extent_inline_start(item);
10166 encoded->len = min_t(u64, extent_start + ram_bytes,
10167 inode->vfs_inode.i_size) - iocb->ki_pos;
10168 ret = btrfs_encoded_io_compression_from_extent(fs_info,
10169 btrfs_file_extent_compression(leaf, item));
10172 encoded->compression = ret;
10173 if (encoded->compression) {
10174 size_t inline_size;
10176 inline_size = btrfs_file_extent_inline_item_len(leaf,
10178 if (inline_size > count) {
10182 count = inline_size;
10183 encoded->unencoded_len = ram_bytes;
10184 encoded->unencoded_offset = iocb->ki_pos - extent_start;
10186 count = min_t(u64, count, encoded->len);
10187 encoded->len = count;
10188 encoded->unencoded_len = count;
10189 ptr += iocb->ki_pos - extent_start;
10192 tmp = kmalloc(count, GFP_NOFS);
10197 read_extent_buffer(leaf, tmp, ptr, count);
10198 btrfs_release_path(path);
10199 unlock_extent(io_tree, start, lockend, cached_state);
10200 btrfs_inode_unlock(&inode->vfs_inode, BTRFS_ILOCK_SHARED);
10203 ret = copy_to_iter(tmp, count, iter);
10208 btrfs_free_path(path);
10212 struct btrfs_encoded_read_private {
10213 struct btrfs_inode *inode;
10215 wait_queue_head_t wait;
10217 blk_status_t status;
10221 static blk_status_t submit_encoded_read_bio(struct btrfs_inode *inode,
10222 struct bio *bio, int mirror_num)
10224 struct btrfs_encoded_read_private *priv = btrfs_bio(bio)->private;
10225 struct btrfs_fs_info *fs_info = inode->root->fs_info;
10228 if (!priv->skip_csum) {
10229 ret = btrfs_lookup_bio_sums(&inode->vfs_inode, bio, NULL);
10234 atomic_inc(&priv->pending);
10235 btrfs_submit_bio(fs_info, bio, mirror_num);
10239 static blk_status_t btrfs_encoded_read_verify_csum(struct btrfs_bio *bbio)
10241 const bool uptodate = (bbio->bio.bi_status == BLK_STS_OK);
10242 struct btrfs_encoded_read_private *priv = bbio->private;
10243 struct btrfs_inode *inode = priv->inode;
10244 struct btrfs_fs_info *fs_info = inode->root->fs_info;
10245 u32 sectorsize = fs_info->sectorsize;
10246 struct bio_vec *bvec;
10247 struct bvec_iter_all iter_all;
10248 u32 bio_offset = 0;
10250 if (priv->skip_csum || !uptodate)
10251 return bbio->bio.bi_status;
10253 bio_for_each_segment_all(bvec, &bbio->bio, iter_all) {
10254 unsigned int i, nr_sectors, pgoff;
10256 nr_sectors = BTRFS_BYTES_TO_BLKS(fs_info, bvec->bv_len);
10257 pgoff = bvec->bv_offset;
10258 for (i = 0; i < nr_sectors; i++) {
10259 ASSERT(pgoff < PAGE_SIZE);
10260 if (btrfs_check_data_csum(&inode->vfs_inode, bbio, bio_offset,
10261 bvec->bv_page, pgoff))
10262 return BLK_STS_IOERR;
10263 bio_offset += sectorsize;
10264 pgoff += sectorsize;
10270 static void btrfs_encoded_read_endio(struct btrfs_bio *bbio)
10272 struct btrfs_encoded_read_private *priv = bbio->private;
10273 blk_status_t status;
10275 status = btrfs_encoded_read_verify_csum(bbio);
10278 * The memory barrier implied by the atomic_dec_return() here
10279 * pairs with the memory barrier implied by the
10280 * atomic_dec_return() or io_wait_event() in
10281 * btrfs_encoded_read_regular_fill_pages() to ensure that this
10282 * write is observed before the load of status in
10283 * btrfs_encoded_read_regular_fill_pages().
10285 WRITE_ONCE(priv->status, status);
10287 if (!atomic_dec_return(&priv->pending))
10288 wake_up(&priv->wait);
10289 btrfs_bio_free_csum(bbio);
10290 bio_put(&bbio->bio);
10293 int btrfs_encoded_read_regular_fill_pages(struct btrfs_inode *inode,
10294 u64 file_offset, u64 disk_bytenr,
10295 u64 disk_io_size, struct page **pages)
10297 struct btrfs_fs_info *fs_info = inode->root->fs_info;
10298 struct btrfs_encoded_read_private priv = {
10300 .file_offset = file_offset,
10301 .pending = ATOMIC_INIT(1),
10302 .skip_csum = (inode->flags & BTRFS_INODE_NODATASUM),
10304 unsigned long i = 0;
10308 init_waitqueue_head(&priv.wait);
10310 * Submit bios for the extent, splitting due to bio or stripe limits as
10313 while (cur < disk_io_size) {
10314 struct extent_map *em;
10315 struct btrfs_io_geometry geom;
10316 struct bio *bio = NULL;
10319 em = btrfs_get_chunk_map(fs_info, disk_bytenr + cur,
10320 disk_io_size - cur);
10324 ret = btrfs_get_io_geometry(fs_info, em, BTRFS_MAP_READ,
10325 disk_bytenr + cur, &geom);
10326 free_extent_map(em);
10329 WRITE_ONCE(priv.status, errno_to_blk_status(ret));
10332 remaining = min(geom.len, disk_io_size - cur);
10333 while (bio || remaining) {
10334 size_t bytes = min_t(u64, remaining, PAGE_SIZE);
10337 bio = btrfs_bio_alloc(BIO_MAX_VECS, REQ_OP_READ,
10338 btrfs_encoded_read_endio,
10340 bio->bi_iter.bi_sector =
10341 (disk_bytenr + cur) >> SECTOR_SHIFT;
10345 bio_add_page(bio, pages[i], bytes, 0) < bytes) {
10346 blk_status_t status;
10348 status = submit_encoded_read_bio(inode, bio, 0);
10350 WRITE_ONCE(priv.status, status);
10360 remaining -= bytes;
10365 if (atomic_dec_return(&priv.pending))
10366 io_wait_event(priv.wait, !atomic_read(&priv.pending));
10367 /* See btrfs_encoded_read_endio() for ordering. */
10368 return blk_status_to_errno(READ_ONCE(priv.status));
10371 static ssize_t btrfs_encoded_read_regular(struct kiocb *iocb,
10372 struct iov_iter *iter,
10373 u64 start, u64 lockend,
10374 struct extent_state **cached_state,
10375 u64 disk_bytenr, u64 disk_io_size,
10376 size_t count, bool compressed,
10379 struct btrfs_inode *inode = BTRFS_I(file_inode(iocb->ki_filp));
10380 struct extent_io_tree *io_tree = &inode->io_tree;
10381 struct page **pages;
10382 unsigned long nr_pages, i;
10384 size_t page_offset;
10387 nr_pages = DIV_ROUND_UP(disk_io_size, PAGE_SIZE);
10388 pages = kcalloc(nr_pages, sizeof(struct page *), GFP_NOFS);
10391 ret = btrfs_alloc_page_array(nr_pages, pages);
10397 ret = btrfs_encoded_read_regular_fill_pages(inode, start, disk_bytenr,
10398 disk_io_size, pages);
10402 unlock_extent(io_tree, start, lockend, cached_state);
10403 btrfs_inode_unlock(&inode->vfs_inode, BTRFS_ILOCK_SHARED);
10410 i = (iocb->ki_pos - start) >> PAGE_SHIFT;
10411 page_offset = (iocb->ki_pos - start) & (PAGE_SIZE - 1);
10414 while (cur < count) {
10415 size_t bytes = min_t(size_t, count - cur,
10416 PAGE_SIZE - page_offset);
10418 if (copy_page_to_iter(pages[i], page_offset, bytes,
10429 for (i = 0; i < nr_pages; i++) {
10431 __free_page(pages[i]);
10437 ssize_t btrfs_encoded_read(struct kiocb *iocb, struct iov_iter *iter,
10438 struct btrfs_ioctl_encoded_io_args *encoded)
10440 struct btrfs_inode *inode = BTRFS_I(file_inode(iocb->ki_filp));
10441 struct btrfs_fs_info *fs_info = inode->root->fs_info;
10442 struct extent_io_tree *io_tree = &inode->io_tree;
10444 size_t count = iov_iter_count(iter);
10445 u64 start, lockend, disk_bytenr, disk_io_size;
10446 struct extent_state *cached_state = NULL;
10447 struct extent_map *em;
10448 bool unlocked = false;
10450 file_accessed(iocb->ki_filp);
10452 btrfs_inode_lock(&inode->vfs_inode, BTRFS_ILOCK_SHARED);
10454 if (iocb->ki_pos >= inode->vfs_inode.i_size) {
10455 btrfs_inode_unlock(&inode->vfs_inode, BTRFS_ILOCK_SHARED);
10458 start = ALIGN_DOWN(iocb->ki_pos, fs_info->sectorsize);
10460 * We don't know how long the extent containing iocb->ki_pos is, but if
10461 * it's compressed we know that it won't be longer than this.
10463 lockend = start + BTRFS_MAX_UNCOMPRESSED - 1;
10466 struct btrfs_ordered_extent *ordered;
10468 ret = btrfs_wait_ordered_range(&inode->vfs_inode, start,
10469 lockend - start + 1);
10471 goto out_unlock_inode;
10472 lock_extent(io_tree, start, lockend, &cached_state);
10473 ordered = btrfs_lookup_ordered_range(inode, start,
10474 lockend - start + 1);
10477 btrfs_put_ordered_extent(ordered);
10478 unlock_extent(io_tree, start, lockend, &cached_state);
10482 em = btrfs_get_extent(inode, NULL, 0, start, lockend - start + 1);
10485 goto out_unlock_extent;
10488 if (em->block_start == EXTENT_MAP_INLINE) {
10489 u64 extent_start = em->start;
10492 * For inline extents we get everything we need out of the
10495 free_extent_map(em);
10497 ret = btrfs_encoded_read_inline(iocb, iter, start, lockend,
10498 &cached_state, extent_start,
10499 count, encoded, &unlocked);
10504 * We only want to return up to EOF even if the extent extends beyond
10507 encoded->len = min_t(u64, extent_map_end(em),
10508 inode->vfs_inode.i_size) - iocb->ki_pos;
10509 if (em->block_start == EXTENT_MAP_HOLE ||
10510 test_bit(EXTENT_FLAG_PREALLOC, &em->flags)) {
10511 disk_bytenr = EXTENT_MAP_HOLE;
10512 count = min_t(u64, count, encoded->len);
10513 encoded->len = count;
10514 encoded->unencoded_len = count;
10515 } else if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) {
10516 disk_bytenr = em->block_start;
10518 * Bail if the buffer isn't large enough to return the whole
10519 * compressed extent.
10521 if (em->block_len > count) {
10525 disk_io_size = em->block_len;
10526 count = em->block_len;
10527 encoded->unencoded_len = em->ram_bytes;
10528 encoded->unencoded_offset = iocb->ki_pos - em->orig_start;
10529 ret = btrfs_encoded_io_compression_from_extent(fs_info,
10530 em->compress_type);
10533 encoded->compression = ret;
10535 disk_bytenr = em->block_start + (start - em->start);
10536 if (encoded->len > count)
10537 encoded->len = count;
10539 * Don't read beyond what we locked. This also limits the page
10540 * allocations that we'll do.
10542 disk_io_size = min(lockend + 1, iocb->ki_pos + encoded->len) - start;
10543 count = start + disk_io_size - iocb->ki_pos;
10544 encoded->len = count;
10545 encoded->unencoded_len = count;
10546 disk_io_size = ALIGN(disk_io_size, fs_info->sectorsize);
10548 free_extent_map(em);
10551 if (disk_bytenr == EXTENT_MAP_HOLE) {
10552 unlock_extent(io_tree, start, lockend, &cached_state);
10553 btrfs_inode_unlock(&inode->vfs_inode, BTRFS_ILOCK_SHARED);
10555 ret = iov_iter_zero(count, iter);
10559 ret = btrfs_encoded_read_regular(iocb, iter, start, lockend,
10560 &cached_state, disk_bytenr,
10561 disk_io_size, count,
10562 encoded->compression,
10568 iocb->ki_pos += encoded->len;
10570 free_extent_map(em);
10573 unlock_extent(io_tree, start, lockend, &cached_state);
10576 btrfs_inode_unlock(&inode->vfs_inode, BTRFS_ILOCK_SHARED);
10580 ssize_t btrfs_do_encoded_write(struct kiocb *iocb, struct iov_iter *from,
10581 const struct btrfs_ioctl_encoded_io_args *encoded)
10583 struct btrfs_inode *inode = BTRFS_I(file_inode(iocb->ki_filp));
10584 struct btrfs_root *root = inode->root;
10585 struct btrfs_fs_info *fs_info = root->fs_info;
10586 struct extent_io_tree *io_tree = &inode->io_tree;
10587 struct extent_changeset *data_reserved = NULL;
10588 struct extent_state *cached_state = NULL;
10592 u64 num_bytes, ram_bytes, disk_num_bytes;
10593 unsigned long nr_pages, i;
10594 struct page **pages;
10595 struct btrfs_key ins;
10596 bool extent_reserved = false;
10597 struct extent_map *em;
10600 switch (encoded->compression) {
10601 case BTRFS_ENCODED_IO_COMPRESSION_ZLIB:
10602 compression = BTRFS_COMPRESS_ZLIB;
10604 case BTRFS_ENCODED_IO_COMPRESSION_ZSTD:
10605 compression = BTRFS_COMPRESS_ZSTD;
10607 case BTRFS_ENCODED_IO_COMPRESSION_LZO_4K:
10608 case BTRFS_ENCODED_IO_COMPRESSION_LZO_8K:
10609 case BTRFS_ENCODED_IO_COMPRESSION_LZO_16K:
10610 case BTRFS_ENCODED_IO_COMPRESSION_LZO_32K:
10611 case BTRFS_ENCODED_IO_COMPRESSION_LZO_64K:
10612 /* The sector size must match for LZO. */
10613 if (encoded->compression -
10614 BTRFS_ENCODED_IO_COMPRESSION_LZO_4K + 12 !=
10615 fs_info->sectorsize_bits)
10617 compression = BTRFS_COMPRESS_LZO;
10622 if (encoded->encryption != BTRFS_ENCODED_IO_ENCRYPTION_NONE)
10625 orig_count = iov_iter_count(from);
10627 /* The extent size must be sane. */
10628 if (encoded->unencoded_len > BTRFS_MAX_UNCOMPRESSED ||
10629 orig_count > BTRFS_MAX_COMPRESSED || orig_count == 0)
10633 * The compressed data must be smaller than the decompressed data.
10635 * It's of course possible for data to compress to larger or the same
10636 * size, but the buffered I/O path falls back to no compression for such
10637 * data, and we don't want to break any assumptions by creating these
10640 * Note that this is less strict than the current check we have that the
10641 * compressed data must be at least one sector smaller than the
10642 * decompressed data. We only want to enforce the weaker requirement
10643 * from old kernels that it is at least one byte smaller.
10645 if (orig_count >= encoded->unencoded_len)
10648 /* The extent must start on a sector boundary. */
10649 start = iocb->ki_pos;
10650 if (!IS_ALIGNED(start, fs_info->sectorsize))
10654 * The extent must end on a sector boundary. However, we allow a write
10655 * which ends at or extends i_size to have an unaligned length; we round
10656 * up the extent size and set i_size to the unaligned end.
10658 if (start + encoded->len < inode->vfs_inode.i_size &&
10659 !IS_ALIGNED(start + encoded->len, fs_info->sectorsize))
10662 /* Finally, the offset in the unencoded data must be sector-aligned. */
10663 if (!IS_ALIGNED(encoded->unencoded_offset, fs_info->sectorsize))
10666 num_bytes = ALIGN(encoded->len, fs_info->sectorsize);
10667 ram_bytes = ALIGN(encoded->unencoded_len, fs_info->sectorsize);
10668 end = start + num_bytes - 1;
10671 * If the extent cannot be inline, the compressed data on disk must be
10672 * sector-aligned. For convenience, we extend it with zeroes if it
10675 disk_num_bytes = ALIGN(orig_count, fs_info->sectorsize);
10676 nr_pages = DIV_ROUND_UP(disk_num_bytes, PAGE_SIZE);
10677 pages = kvcalloc(nr_pages, sizeof(struct page *), GFP_KERNEL_ACCOUNT);
10680 for (i = 0; i < nr_pages; i++) {
10681 size_t bytes = min_t(size_t, PAGE_SIZE, iov_iter_count(from));
10684 pages[i] = alloc_page(GFP_KERNEL_ACCOUNT);
10689 kaddr = kmap_local_page(pages[i]);
10690 if (copy_from_iter(kaddr, bytes, from) != bytes) {
10691 kunmap_local(kaddr);
10695 if (bytes < PAGE_SIZE)
10696 memset(kaddr + bytes, 0, PAGE_SIZE - bytes);
10697 kunmap_local(kaddr);
10701 struct btrfs_ordered_extent *ordered;
10703 ret = btrfs_wait_ordered_range(&inode->vfs_inode, start, num_bytes);
10706 ret = invalidate_inode_pages2_range(inode->vfs_inode.i_mapping,
10707 start >> PAGE_SHIFT,
10708 end >> PAGE_SHIFT);
10711 lock_extent(io_tree, start, end, &cached_state);
10712 ordered = btrfs_lookup_ordered_range(inode, start, num_bytes);
10714 !filemap_range_has_page(inode->vfs_inode.i_mapping, start, end))
10717 btrfs_put_ordered_extent(ordered);
10718 unlock_extent(io_tree, start, end, &cached_state);
10723 * We don't use the higher-level delalloc space functions because our
10724 * num_bytes and disk_num_bytes are different.
10726 ret = btrfs_alloc_data_chunk_ondemand(inode, disk_num_bytes);
10729 ret = btrfs_qgroup_reserve_data(inode, &data_reserved, start, num_bytes);
10731 goto out_free_data_space;
10732 ret = btrfs_delalloc_reserve_metadata(inode, num_bytes, disk_num_bytes,
10735 goto out_qgroup_free_data;
10737 /* Try an inline extent first. */
10738 if (start == 0 && encoded->unencoded_len == encoded->len &&
10739 encoded->unencoded_offset == 0) {
10740 ret = cow_file_range_inline(inode, encoded->len, orig_count,
10741 compression, pages, true);
10745 goto out_delalloc_release;
10749 ret = btrfs_reserve_extent(root, disk_num_bytes, disk_num_bytes,
10750 disk_num_bytes, 0, 0, &ins, 1, 1);
10752 goto out_delalloc_release;
10753 extent_reserved = true;
10755 em = create_io_em(inode, start, num_bytes,
10756 start - encoded->unencoded_offset, ins.objectid,
10757 ins.offset, ins.offset, ram_bytes, compression,
10758 BTRFS_ORDERED_COMPRESSED);
10761 goto out_free_reserved;
10763 free_extent_map(em);
10765 ret = btrfs_add_ordered_extent(inode, start, num_bytes, ram_bytes,
10766 ins.objectid, ins.offset,
10767 encoded->unencoded_offset,
10768 (1 << BTRFS_ORDERED_ENCODED) |
10769 (1 << BTRFS_ORDERED_COMPRESSED),
10772 btrfs_drop_extent_map_range(inode, start, end, false);
10773 goto out_free_reserved;
10775 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
10777 if (start + encoded->len > inode->vfs_inode.i_size)
10778 i_size_write(&inode->vfs_inode, start + encoded->len);
10780 unlock_extent(io_tree, start, end, &cached_state);
10782 btrfs_delalloc_release_extents(inode, num_bytes);
10784 if (btrfs_submit_compressed_write(inode, start, num_bytes, ins.objectid,
10785 ins.offset, pages, nr_pages, 0, NULL,
10787 btrfs_writepage_endio_finish_ordered(inode, pages[0], start, end, 0);
10795 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
10796 btrfs_free_reserved_extent(fs_info, ins.objectid, ins.offset, 1);
10797 out_delalloc_release:
10798 btrfs_delalloc_release_extents(inode, num_bytes);
10799 btrfs_delalloc_release_metadata(inode, disk_num_bytes, ret < 0);
10800 out_qgroup_free_data:
10802 btrfs_qgroup_free_data(inode, data_reserved, start, num_bytes);
10803 out_free_data_space:
10805 * If btrfs_reserve_extent() succeeded, then we already decremented
10808 if (!extent_reserved)
10809 btrfs_free_reserved_data_space_noquota(fs_info, disk_num_bytes);
10811 unlock_extent(io_tree, start, end, &cached_state);
10813 for (i = 0; i < nr_pages; i++) {
10815 __free_page(pages[i]);
10820 iocb->ki_pos += encoded->len;
10826 * Add an entry indicating a block group or device which is pinned by a
10827 * swapfile. Returns 0 on success, 1 if there is already an entry for it, or a
10828 * negative errno on failure.
10830 static int btrfs_add_swapfile_pin(struct inode *inode, void *ptr,
10831 bool is_block_group)
10833 struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info;
10834 struct btrfs_swapfile_pin *sp, *entry;
10835 struct rb_node **p;
10836 struct rb_node *parent = NULL;
10838 sp = kmalloc(sizeof(*sp), GFP_NOFS);
10843 sp->is_block_group = is_block_group;
10844 sp->bg_extent_count = 1;
10846 spin_lock(&fs_info->swapfile_pins_lock);
10847 p = &fs_info->swapfile_pins.rb_node;
10850 entry = rb_entry(parent, struct btrfs_swapfile_pin, node);
10851 if (sp->ptr < entry->ptr ||
10852 (sp->ptr == entry->ptr && sp->inode < entry->inode)) {
10853 p = &(*p)->rb_left;
10854 } else if (sp->ptr > entry->ptr ||
10855 (sp->ptr == entry->ptr && sp->inode > entry->inode)) {
10856 p = &(*p)->rb_right;
10858 if (is_block_group)
10859 entry->bg_extent_count++;
10860 spin_unlock(&fs_info->swapfile_pins_lock);
10865 rb_link_node(&sp->node, parent, p);
10866 rb_insert_color(&sp->node, &fs_info->swapfile_pins);
10867 spin_unlock(&fs_info->swapfile_pins_lock);
10871 /* Free all of the entries pinned by this swapfile. */
10872 static void btrfs_free_swapfile_pins(struct inode *inode)
10874 struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info;
10875 struct btrfs_swapfile_pin *sp;
10876 struct rb_node *node, *next;
10878 spin_lock(&fs_info->swapfile_pins_lock);
10879 node = rb_first(&fs_info->swapfile_pins);
10881 next = rb_next(node);
10882 sp = rb_entry(node, struct btrfs_swapfile_pin, node);
10883 if (sp->inode == inode) {
10884 rb_erase(&sp->node, &fs_info->swapfile_pins);
10885 if (sp->is_block_group) {
10886 btrfs_dec_block_group_swap_extents(sp->ptr,
10887 sp->bg_extent_count);
10888 btrfs_put_block_group(sp->ptr);
10894 spin_unlock(&fs_info->swapfile_pins_lock);
10897 struct btrfs_swap_info {
10903 unsigned long nr_pages;
10907 static int btrfs_add_swap_extent(struct swap_info_struct *sis,
10908 struct btrfs_swap_info *bsi)
10910 unsigned long nr_pages;
10911 unsigned long max_pages;
10912 u64 first_ppage, first_ppage_reported, next_ppage;
10916 * Our swapfile may have had its size extended after the swap header was
10917 * written. In that case activating the swapfile should not go beyond
10918 * the max size set in the swap header.
10920 if (bsi->nr_pages >= sis->max)
10923 max_pages = sis->max - bsi->nr_pages;
10924 first_ppage = ALIGN(bsi->block_start, PAGE_SIZE) >> PAGE_SHIFT;
10925 next_ppage = ALIGN_DOWN(bsi->block_start + bsi->block_len,
10926 PAGE_SIZE) >> PAGE_SHIFT;
10928 if (first_ppage >= next_ppage)
10930 nr_pages = next_ppage - first_ppage;
10931 nr_pages = min(nr_pages, max_pages);
10933 first_ppage_reported = first_ppage;
10934 if (bsi->start == 0)
10935 first_ppage_reported++;
10936 if (bsi->lowest_ppage > first_ppage_reported)
10937 bsi->lowest_ppage = first_ppage_reported;
10938 if (bsi->highest_ppage < (next_ppage - 1))
10939 bsi->highest_ppage = next_ppage - 1;
10941 ret = add_swap_extent(sis, bsi->nr_pages, nr_pages, first_ppage);
10944 bsi->nr_extents += ret;
10945 bsi->nr_pages += nr_pages;
10949 static void btrfs_swap_deactivate(struct file *file)
10951 struct inode *inode = file_inode(file);
10953 btrfs_free_swapfile_pins(inode);
10954 atomic_dec(&BTRFS_I(inode)->root->nr_swapfiles);
10957 static int btrfs_swap_activate(struct swap_info_struct *sis, struct file *file,
10960 struct inode *inode = file_inode(file);
10961 struct btrfs_root *root = BTRFS_I(inode)->root;
10962 struct btrfs_fs_info *fs_info = root->fs_info;
10963 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
10964 struct extent_state *cached_state = NULL;
10965 struct extent_map *em = NULL;
10966 struct btrfs_device *device = NULL;
10967 struct btrfs_swap_info bsi = {
10968 .lowest_ppage = (sector_t)-1ULL,
10975 * If the swap file was just created, make sure delalloc is done. If the
10976 * file changes again after this, the user is doing something stupid and
10977 * we don't really care.
10979 ret = btrfs_wait_ordered_range(inode, 0, (u64)-1);
10984 * The inode is locked, so these flags won't change after we check them.
10986 if (BTRFS_I(inode)->flags & BTRFS_INODE_COMPRESS) {
10987 btrfs_warn(fs_info, "swapfile must not be compressed");
10990 if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW)) {
10991 btrfs_warn(fs_info, "swapfile must not be copy-on-write");
10994 if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM)) {
10995 btrfs_warn(fs_info, "swapfile must not be checksummed");
11000 * Balance or device remove/replace/resize can move stuff around from
11001 * under us. The exclop protection makes sure they aren't running/won't
11002 * run concurrently while we are mapping the swap extents, and
11003 * fs_info->swapfile_pins prevents them from running while the swap
11004 * file is active and moving the extents. Note that this also prevents
11005 * a concurrent device add which isn't actually necessary, but it's not
11006 * really worth the trouble to allow it.
11008 if (!btrfs_exclop_start(fs_info, BTRFS_EXCLOP_SWAP_ACTIVATE)) {
11009 btrfs_warn(fs_info,
11010 "cannot activate swapfile while exclusive operation is running");
11015 * Prevent snapshot creation while we are activating the swap file.
11016 * We do not want to race with snapshot creation. If snapshot creation
11017 * already started before we bumped nr_swapfiles from 0 to 1 and
11018 * completes before the first write into the swap file after it is
11019 * activated, than that write would fallback to COW.
11021 if (!btrfs_drew_try_write_lock(&root->snapshot_lock)) {
11022 btrfs_exclop_finish(fs_info);
11023 btrfs_warn(fs_info,
11024 "cannot activate swapfile because snapshot creation is in progress");
11028 * Snapshots can create extents which require COW even if NODATACOW is
11029 * set. We use this counter to prevent snapshots. We must increment it
11030 * before walking the extents because we don't want a concurrent
11031 * snapshot to run after we've already checked the extents.
11033 * It is possible that subvolume is marked for deletion but still not
11034 * removed yet. To prevent this race, we check the root status before
11035 * activating the swapfile.
11037 spin_lock(&root->root_item_lock);
11038 if (btrfs_root_dead(root)) {
11039 spin_unlock(&root->root_item_lock);
11041 btrfs_exclop_finish(fs_info);
11042 btrfs_warn(fs_info,
11043 "cannot activate swapfile because subvolume %llu is being deleted",
11044 root->root_key.objectid);
11047 atomic_inc(&root->nr_swapfiles);
11048 spin_unlock(&root->root_item_lock);
11050 isize = ALIGN_DOWN(inode->i_size, fs_info->sectorsize);
11052 lock_extent(io_tree, 0, isize - 1, &cached_state);
11054 while (start < isize) {
11055 u64 logical_block_start, physical_block_start;
11056 struct btrfs_block_group *bg;
11057 u64 len = isize - start;
11059 em = btrfs_get_extent(BTRFS_I(inode), NULL, 0, start, len);
11065 if (em->block_start == EXTENT_MAP_HOLE) {
11066 btrfs_warn(fs_info, "swapfile must not have holes");
11070 if (em->block_start == EXTENT_MAP_INLINE) {
11072 * It's unlikely we'll ever actually find ourselves
11073 * here, as a file small enough to fit inline won't be
11074 * big enough to store more than the swap header, but in
11075 * case something changes in the future, let's catch it
11076 * here rather than later.
11078 btrfs_warn(fs_info, "swapfile must not be inline");
11082 if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) {
11083 btrfs_warn(fs_info, "swapfile must not be compressed");
11088 logical_block_start = em->block_start + (start - em->start);
11089 len = min(len, em->len - (start - em->start));
11090 free_extent_map(em);
11093 ret = can_nocow_extent(inode, start, &len, NULL, NULL, NULL, false, true);
11099 btrfs_warn(fs_info,
11100 "swapfile must not be copy-on-write");
11105 em = btrfs_get_chunk_map(fs_info, logical_block_start, len);
11111 if (em->map_lookup->type & BTRFS_BLOCK_GROUP_PROFILE_MASK) {
11112 btrfs_warn(fs_info,
11113 "swapfile must have single data profile");
11118 if (device == NULL) {
11119 device = em->map_lookup->stripes[0].dev;
11120 ret = btrfs_add_swapfile_pin(inode, device, false);
11125 } else if (device != em->map_lookup->stripes[0].dev) {
11126 btrfs_warn(fs_info, "swapfile must be on one device");
11131 physical_block_start = (em->map_lookup->stripes[0].physical +
11132 (logical_block_start - em->start));
11133 len = min(len, em->len - (logical_block_start - em->start));
11134 free_extent_map(em);
11137 bg = btrfs_lookup_block_group(fs_info, logical_block_start);
11139 btrfs_warn(fs_info,
11140 "could not find block group containing swapfile");
11145 if (!btrfs_inc_block_group_swap_extents(bg)) {
11146 btrfs_warn(fs_info,
11147 "block group for swapfile at %llu is read-only%s",
11149 atomic_read(&fs_info->scrubs_running) ?
11150 " (scrub running)" : "");
11151 btrfs_put_block_group(bg);
11156 ret = btrfs_add_swapfile_pin(inode, bg, true);
11158 btrfs_put_block_group(bg);
11165 if (bsi.block_len &&
11166 bsi.block_start + bsi.block_len == physical_block_start) {
11167 bsi.block_len += len;
11169 if (bsi.block_len) {
11170 ret = btrfs_add_swap_extent(sis, &bsi);
11175 bsi.block_start = physical_block_start;
11176 bsi.block_len = len;
11183 ret = btrfs_add_swap_extent(sis, &bsi);
11186 if (!IS_ERR_OR_NULL(em))
11187 free_extent_map(em);
11189 unlock_extent(io_tree, 0, isize - 1, &cached_state);
11192 btrfs_swap_deactivate(file);
11194 btrfs_drew_write_unlock(&root->snapshot_lock);
11196 btrfs_exclop_finish(fs_info);
11202 sis->bdev = device->bdev;
11203 *span = bsi.highest_ppage - bsi.lowest_ppage + 1;
11204 sis->max = bsi.nr_pages;
11205 sis->pages = bsi.nr_pages - 1;
11206 sis->highest_bit = bsi.nr_pages - 1;
11207 return bsi.nr_extents;
11210 static void btrfs_swap_deactivate(struct file *file)
11214 static int btrfs_swap_activate(struct swap_info_struct *sis, struct file *file,
11217 return -EOPNOTSUPP;
11222 * Update the number of bytes used in the VFS' inode. When we replace extents in
11223 * a range (clone, dedupe, fallocate's zero range), we must update the number of
11224 * bytes used by the inode in an atomic manner, so that concurrent stat(2) calls
11225 * always get a correct value.
11227 void btrfs_update_inode_bytes(struct btrfs_inode *inode,
11228 const u64 add_bytes,
11229 const u64 del_bytes)
11231 if (add_bytes == del_bytes)
11234 spin_lock(&inode->lock);
11236 inode_sub_bytes(&inode->vfs_inode, del_bytes);
11238 inode_add_bytes(&inode->vfs_inode, add_bytes);
11239 spin_unlock(&inode->lock);
11243 * Verify that there are no ordered extents for a given file range.
11245 * @inode: The target inode.
11246 * @start: Start offset of the file range, should be sector size aligned.
11247 * @end: End offset (inclusive) of the file range, its value +1 should be
11248 * sector size aligned.
11250 * This should typically be used for cases where we locked an inode's VFS lock in
11251 * exclusive mode, we have also locked the inode's i_mmap_lock in exclusive mode,
11252 * we have flushed all delalloc in the range, we have waited for all ordered
11253 * extents in the range to complete and finally we have locked the file range in
11254 * the inode's io_tree.
11256 void btrfs_assert_inode_range_clean(struct btrfs_inode *inode, u64 start, u64 end)
11258 struct btrfs_root *root = inode->root;
11259 struct btrfs_ordered_extent *ordered;
11261 if (!IS_ENABLED(CONFIG_BTRFS_ASSERT))
11264 ordered = btrfs_lookup_first_ordered_range(inode, start, end + 1 - start);
11266 btrfs_err(root->fs_info,
11267 "found unexpected ordered extent in file range [%llu, %llu] for inode %llu root %llu (ordered range [%llu, %llu])",
11268 start, end, btrfs_ino(inode), root->root_key.objectid,
11269 ordered->file_offset,
11270 ordered->file_offset + ordered->num_bytes - 1);
11271 btrfs_put_ordered_extent(ordered);
11274 ASSERT(ordered == NULL);
11277 static const struct inode_operations btrfs_dir_inode_operations = {
11278 .getattr = btrfs_getattr,
11279 .lookup = btrfs_lookup,
11280 .create = btrfs_create,
11281 .unlink = btrfs_unlink,
11282 .link = btrfs_link,
11283 .mkdir = btrfs_mkdir,
11284 .rmdir = btrfs_rmdir,
11285 .rename = btrfs_rename2,
11286 .symlink = btrfs_symlink,
11287 .setattr = btrfs_setattr,
11288 .mknod = btrfs_mknod,
11289 .listxattr = btrfs_listxattr,
11290 .permission = btrfs_permission,
11291 .get_acl = btrfs_get_acl,
11292 .set_acl = btrfs_set_acl,
11293 .update_time = btrfs_update_time,
11294 .tmpfile = btrfs_tmpfile,
11295 .fileattr_get = btrfs_fileattr_get,
11296 .fileattr_set = btrfs_fileattr_set,
11299 static const struct file_operations btrfs_dir_file_operations = {
11300 .llseek = generic_file_llseek,
11301 .read = generic_read_dir,
11302 .iterate_shared = btrfs_real_readdir,
11303 .open = btrfs_opendir,
11304 .unlocked_ioctl = btrfs_ioctl,
11305 #ifdef CONFIG_COMPAT
11306 .compat_ioctl = btrfs_compat_ioctl,
11308 .release = btrfs_release_file,
11309 .fsync = btrfs_sync_file,
11313 * btrfs doesn't support the bmap operation because swapfiles
11314 * use bmap to make a mapping of extents in the file. They assume
11315 * these extents won't change over the life of the file and they
11316 * use the bmap result to do IO directly to the drive.
11318 * the btrfs bmap call would return logical addresses that aren't
11319 * suitable for IO and they also will change frequently as COW
11320 * operations happen. So, swapfile + btrfs == corruption.
11322 * For now we're avoiding this by dropping bmap.
11324 static const struct address_space_operations btrfs_aops = {
11325 .read_folio = btrfs_read_folio,
11326 .writepages = btrfs_writepages,
11327 .readahead = btrfs_readahead,
11328 .direct_IO = noop_direct_IO,
11329 .invalidate_folio = btrfs_invalidate_folio,
11330 .release_folio = btrfs_release_folio,
11331 .migrate_folio = btrfs_migrate_folio,
11332 .dirty_folio = filemap_dirty_folio,
11333 .error_remove_page = generic_error_remove_page,
11334 .swap_activate = btrfs_swap_activate,
11335 .swap_deactivate = btrfs_swap_deactivate,
11338 static const struct inode_operations btrfs_file_inode_operations = {
11339 .getattr = btrfs_getattr,
11340 .setattr = btrfs_setattr,
11341 .listxattr = btrfs_listxattr,
11342 .permission = btrfs_permission,
11343 .fiemap = btrfs_fiemap,
11344 .get_acl = btrfs_get_acl,
11345 .set_acl = btrfs_set_acl,
11346 .update_time = btrfs_update_time,
11347 .fileattr_get = btrfs_fileattr_get,
11348 .fileattr_set = btrfs_fileattr_set,
11350 static const struct inode_operations btrfs_special_inode_operations = {
11351 .getattr = btrfs_getattr,
11352 .setattr = btrfs_setattr,
11353 .permission = btrfs_permission,
11354 .listxattr = btrfs_listxattr,
11355 .get_acl = btrfs_get_acl,
11356 .set_acl = btrfs_set_acl,
11357 .update_time = btrfs_update_time,
11359 static const struct inode_operations btrfs_symlink_inode_operations = {
11360 .get_link = page_get_link,
11361 .getattr = btrfs_getattr,
11362 .setattr = btrfs_setattr,
11363 .permission = btrfs_permission,
11364 .listxattr = btrfs_listxattr,
11365 .update_time = btrfs_update_time,
11368 const struct dentry_operations btrfs_dentry_operations = {
11369 .d_delete = btrfs_dentry_delete,