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;
69 struct btrfs_rename_ctx {
70 /* Output field. Stores the index number of the old directory entry. */
74 static const struct inode_operations btrfs_dir_inode_operations;
75 static const struct inode_operations btrfs_symlink_inode_operations;
76 static const struct inode_operations btrfs_special_inode_operations;
77 static const struct inode_operations btrfs_file_inode_operations;
78 static const struct address_space_operations btrfs_aops;
79 static const struct file_operations btrfs_dir_file_operations;
81 static struct kmem_cache *btrfs_inode_cachep;
82 struct kmem_cache *btrfs_trans_handle_cachep;
83 struct kmem_cache *btrfs_path_cachep;
84 struct kmem_cache *btrfs_free_space_cachep;
85 struct kmem_cache *btrfs_free_space_bitmap_cachep;
87 static int btrfs_setsize(struct inode *inode, struct iattr *attr);
88 static int btrfs_truncate(struct inode *inode, bool skip_writeback);
89 static int btrfs_finish_ordered_io(struct btrfs_ordered_extent *ordered_extent);
90 static noinline int cow_file_range(struct btrfs_inode *inode,
91 struct page *locked_page,
92 u64 start, u64 end, int *page_started,
93 unsigned long *nr_written, int unlock);
94 static struct extent_map *create_io_em(struct btrfs_inode *inode, u64 start,
95 u64 len, u64 orig_start, u64 block_start,
96 u64 block_len, u64 orig_block_len,
97 u64 ram_bytes, int compress_type,
100 static void __endio_write_update_ordered(struct btrfs_inode *inode,
101 const u64 offset, const u64 bytes,
102 const bool uptodate);
105 * btrfs_inode_lock - lock inode i_rwsem based on arguments passed
107 * ilock_flags can have the following bit set:
109 * BTRFS_ILOCK_SHARED - acquire a shared lock on the inode
110 * BTRFS_ILOCK_TRY - try to acquire the lock, if fails on first attempt
112 * BTRFS_ILOCK_MMAP - acquire a write lock on the i_mmap_lock
114 int btrfs_inode_lock(struct inode *inode, unsigned int ilock_flags)
116 if (ilock_flags & BTRFS_ILOCK_SHARED) {
117 if (ilock_flags & BTRFS_ILOCK_TRY) {
118 if (!inode_trylock_shared(inode))
123 inode_lock_shared(inode);
125 if (ilock_flags & BTRFS_ILOCK_TRY) {
126 if (!inode_trylock(inode))
133 if (ilock_flags & BTRFS_ILOCK_MMAP)
134 down_write(&BTRFS_I(inode)->i_mmap_lock);
139 * btrfs_inode_unlock - unock inode i_rwsem
141 * ilock_flags should contain the same bits set as passed to btrfs_inode_lock()
142 * to decide whether the lock acquired is shared or exclusive.
144 void btrfs_inode_unlock(struct inode *inode, unsigned int ilock_flags)
146 if (ilock_flags & BTRFS_ILOCK_MMAP)
147 up_write(&BTRFS_I(inode)->i_mmap_lock);
148 if (ilock_flags & BTRFS_ILOCK_SHARED)
149 inode_unlock_shared(inode);
155 * Cleanup all submitted ordered extents in specified range to handle errors
156 * from the btrfs_run_delalloc_range() callback.
158 * NOTE: caller must ensure that when an error happens, it can not call
159 * extent_clear_unlock_delalloc() to clear both the bits EXTENT_DO_ACCOUNTING
160 * and EXTENT_DELALLOC simultaneously, because that causes the reserved metadata
161 * to be released, which we want to happen only when finishing the ordered
162 * extent (btrfs_finish_ordered_io()).
164 static inline void btrfs_cleanup_ordered_extents(struct btrfs_inode *inode,
165 struct page *locked_page,
166 u64 offset, u64 bytes)
168 unsigned long index = offset >> PAGE_SHIFT;
169 unsigned long end_index = (offset + bytes - 1) >> PAGE_SHIFT;
170 u64 page_start = page_offset(locked_page);
171 u64 page_end = page_start + PAGE_SIZE - 1;
175 while (index <= end_index) {
177 * For locked page, we will call end_extent_writepage() on it
178 * in run_delalloc_range() for the error handling. That
179 * end_extent_writepage() function will call
180 * btrfs_mark_ordered_io_finished() to clear page Ordered and
181 * run the ordered extent accounting.
183 * Here we can't just clear the Ordered bit, or
184 * btrfs_mark_ordered_io_finished() would skip the accounting
185 * for the page range, and the ordered extent will never finish.
187 if (index == (page_offset(locked_page) >> PAGE_SHIFT)) {
191 page = find_get_page(inode->vfs_inode.i_mapping, index);
197 * Here we just clear all Ordered bits for every page in the
198 * range, then __endio_write_update_ordered() will handle
199 * the ordered extent accounting for the range.
201 btrfs_page_clamp_clear_ordered(inode->root->fs_info, page,
206 /* The locked page covers the full range, nothing needs to be done */
207 if (bytes + offset <= page_offset(locked_page) + PAGE_SIZE)
210 * In case this page belongs to the delalloc range being instantiated
211 * then skip it, since the first page of a range is going to be
212 * properly cleaned up by the caller of run_delalloc_range
214 if (page_start >= offset && page_end <= (offset + bytes - 1)) {
215 bytes = offset + bytes - page_offset(locked_page) - PAGE_SIZE;
216 offset = page_offset(locked_page) + PAGE_SIZE;
219 return __endio_write_update_ordered(inode, offset, bytes, false);
222 static int btrfs_dirty_inode(struct inode *inode);
224 static int btrfs_init_inode_security(struct btrfs_trans_handle *trans,
225 struct inode *inode, struct inode *dir,
226 const struct qstr *qstr)
230 err = btrfs_init_acl(trans, inode, dir);
232 err = btrfs_xattr_security_init(trans, inode, dir, qstr);
237 * this does all the hard work for inserting an inline extent into
238 * the btree. The caller should have done a btrfs_drop_extents so that
239 * no overlapping inline items exist in the btree
241 static int insert_inline_extent(struct btrfs_trans_handle *trans,
242 struct btrfs_path *path,
243 struct btrfs_inode *inode, bool extent_inserted,
244 size_t size, size_t compressed_size,
246 struct page **compressed_pages,
249 struct btrfs_root *root = inode->root;
250 struct extent_buffer *leaf;
251 struct page *page = NULL;
254 struct btrfs_file_extent_item *ei;
256 size_t cur_size = size;
259 ASSERT((compressed_size > 0 && compressed_pages) ||
260 (compressed_size == 0 && !compressed_pages));
262 if (compressed_size && compressed_pages)
263 cur_size = compressed_size;
265 if (!extent_inserted) {
266 struct btrfs_key key;
269 key.objectid = btrfs_ino(inode);
271 key.type = BTRFS_EXTENT_DATA_KEY;
273 datasize = btrfs_file_extent_calc_inline_size(cur_size);
274 ret = btrfs_insert_empty_item(trans, root, path, &key,
279 leaf = path->nodes[0];
280 ei = btrfs_item_ptr(leaf, path->slots[0],
281 struct btrfs_file_extent_item);
282 btrfs_set_file_extent_generation(leaf, ei, trans->transid);
283 btrfs_set_file_extent_type(leaf, ei, BTRFS_FILE_EXTENT_INLINE);
284 btrfs_set_file_extent_encryption(leaf, ei, 0);
285 btrfs_set_file_extent_other_encoding(leaf, ei, 0);
286 btrfs_set_file_extent_ram_bytes(leaf, ei, size);
287 ptr = btrfs_file_extent_inline_start(ei);
289 if (compress_type != BTRFS_COMPRESS_NONE) {
292 while (compressed_size > 0) {
293 cpage = compressed_pages[i];
294 cur_size = min_t(unsigned long, compressed_size,
297 kaddr = kmap_atomic(cpage);
298 write_extent_buffer(leaf, kaddr, ptr, cur_size);
299 kunmap_atomic(kaddr);
303 compressed_size -= cur_size;
305 btrfs_set_file_extent_compression(leaf, ei,
308 page = find_get_page(inode->vfs_inode.i_mapping, 0);
309 btrfs_set_file_extent_compression(leaf, ei, 0);
310 kaddr = kmap_atomic(page);
311 write_extent_buffer(leaf, kaddr, ptr, size);
312 kunmap_atomic(kaddr);
315 btrfs_mark_buffer_dirty(leaf);
316 btrfs_release_path(path);
319 * We align size to sectorsize for inline extents just for simplicity
322 ret = btrfs_inode_set_file_extent_range(inode, 0,
323 ALIGN(size, root->fs_info->sectorsize));
328 * We're an inline extent, so nobody can extend the file past i_size
329 * without locking a page we already have locked.
331 * We must do any i_size and inode updates before we unlock the pages.
332 * Otherwise we could end up racing with unlink.
334 i_size = i_size_read(&inode->vfs_inode);
335 if (update_i_size && size > i_size) {
336 i_size_write(&inode->vfs_inode, size);
339 inode->disk_i_size = i_size;
347 * conditionally insert an inline extent into the file. This
348 * does the checks required to make sure the data is small enough
349 * to fit as an inline extent.
351 static noinline int cow_file_range_inline(struct btrfs_inode *inode, u64 size,
352 size_t compressed_size,
354 struct page **compressed_pages,
357 struct btrfs_drop_extents_args drop_args = { 0 };
358 struct btrfs_root *root = inode->root;
359 struct btrfs_fs_info *fs_info = root->fs_info;
360 struct btrfs_trans_handle *trans;
361 u64 data_len = (compressed_size ?: size);
363 struct btrfs_path *path;
366 * We can create an inline extent if it ends at or beyond the current
367 * i_size, is no larger than a sector (decompressed), and the (possibly
368 * compressed) data fits in a leaf and the configured maximum inline
371 if (size < i_size_read(&inode->vfs_inode) ||
372 size > fs_info->sectorsize ||
373 data_len > BTRFS_MAX_INLINE_DATA_SIZE(fs_info) ||
374 data_len > fs_info->max_inline)
377 path = btrfs_alloc_path();
381 trans = btrfs_join_transaction(root);
383 btrfs_free_path(path);
384 return PTR_ERR(trans);
386 trans->block_rsv = &inode->block_rsv;
388 drop_args.path = path;
390 drop_args.end = fs_info->sectorsize;
391 drop_args.drop_cache = true;
392 drop_args.replace_extent = true;
393 drop_args.extent_item_size = btrfs_file_extent_calc_inline_size(data_len);
394 ret = btrfs_drop_extents(trans, root, inode, &drop_args);
396 btrfs_abort_transaction(trans, ret);
400 ret = insert_inline_extent(trans, path, inode, drop_args.extent_inserted,
401 size, compressed_size, compress_type,
402 compressed_pages, update_i_size);
403 if (ret && ret != -ENOSPC) {
404 btrfs_abort_transaction(trans, ret);
406 } else if (ret == -ENOSPC) {
411 btrfs_update_inode_bytes(inode, size, drop_args.bytes_found);
412 ret = btrfs_update_inode(trans, root, inode);
413 if (ret && ret != -ENOSPC) {
414 btrfs_abort_transaction(trans, ret);
416 } else if (ret == -ENOSPC) {
421 btrfs_set_inode_full_sync(inode);
424 * Don't forget to free the reserved space, as for inlined extent
425 * it won't count as data extent, free them directly here.
426 * And at reserve time, it's always aligned to page size, so
427 * just free one page here.
429 btrfs_qgroup_free_data(inode, NULL, 0, PAGE_SIZE);
430 btrfs_free_path(path);
431 btrfs_end_transaction(trans);
435 struct async_extent {
440 unsigned long nr_pages;
442 struct list_head list;
447 struct page *locked_page;
450 unsigned int write_flags;
451 struct list_head extents;
452 struct cgroup_subsys_state *blkcg_css;
453 struct btrfs_work work;
454 struct async_cow *async_cow;
459 struct async_chunk chunks[];
462 static noinline int add_async_extent(struct async_chunk *cow,
463 u64 start, u64 ram_size,
466 unsigned long nr_pages,
469 struct async_extent *async_extent;
471 async_extent = kmalloc(sizeof(*async_extent), GFP_NOFS);
472 BUG_ON(!async_extent); /* -ENOMEM */
473 async_extent->start = start;
474 async_extent->ram_size = ram_size;
475 async_extent->compressed_size = compressed_size;
476 async_extent->pages = pages;
477 async_extent->nr_pages = nr_pages;
478 async_extent->compress_type = compress_type;
479 list_add_tail(&async_extent->list, &cow->extents);
484 * Check if the inode needs to be submitted to compression, based on mount
485 * options, defragmentation, properties or heuristics.
487 static inline int inode_need_compress(struct btrfs_inode *inode, u64 start,
490 struct btrfs_fs_info *fs_info = inode->root->fs_info;
492 if (!btrfs_inode_can_compress(inode)) {
493 WARN(IS_ENABLED(CONFIG_BTRFS_DEBUG),
494 KERN_ERR "BTRFS: unexpected compression for ino %llu\n",
499 * Special check for subpage.
501 * We lock the full page then run each delalloc range in the page, thus
502 * for the following case, we will hit some subpage specific corner case:
505 * | |///////| |///////|
508 * In above case, both range A and range B will try to unlock the full
509 * page [0, 64K), causing the one finished later will have page
510 * unlocked already, triggering various page lock requirement BUG_ON()s.
512 * So here we add an artificial limit that subpage compression can only
513 * if the range is fully page aligned.
515 * In theory we only need to ensure the first page is fully covered, but
516 * the tailing partial page will be locked until the full compression
517 * finishes, delaying the write of other range.
519 * TODO: Make btrfs_run_delalloc_range() to lock all delalloc range
520 * first to prevent any submitted async extent to unlock the full page.
521 * By this, we can ensure for subpage case that only the last async_cow
522 * will unlock the full page.
524 if (fs_info->sectorsize < PAGE_SIZE) {
525 if (!IS_ALIGNED(start, PAGE_SIZE) ||
526 !IS_ALIGNED(end + 1, PAGE_SIZE))
531 if (btrfs_test_opt(fs_info, FORCE_COMPRESS))
534 if (inode->defrag_compress)
536 /* bad compression ratios */
537 if (inode->flags & BTRFS_INODE_NOCOMPRESS)
539 if (btrfs_test_opt(fs_info, COMPRESS) ||
540 inode->flags & BTRFS_INODE_COMPRESS ||
541 inode->prop_compress)
542 return btrfs_compress_heuristic(&inode->vfs_inode, start, end);
546 static inline void inode_should_defrag(struct btrfs_inode *inode,
547 u64 start, u64 end, u64 num_bytes, u32 small_write)
549 /* If this is a small write inside eof, kick off a defrag */
550 if (num_bytes < small_write &&
551 (start > 0 || end + 1 < inode->disk_i_size))
552 btrfs_add_inode_defrag(NULL, inode, small_write);
556 * we create compressed extents in two phases. The first
557 * phase compresses a range of pages that have already been
558 * locked (both pages and state bits are locked).
560 * This is done inside an ordered work queue, and the compression
561 * is spread across many cpus. The actual IO submission is step
562 * two, and the ordered work queue takes care of making sure that
563 * happens in the same order things were put onto the queue by
564 * writepages and friends.
566 * If this code finds it can't get good compression, it puts an
567 * entry onto the work queue to write the uncompressed bytes. This
568 * makes sure that both compressed inodes and uncompressed inodes
569 * are written in the same order that the flusher thread sent them
572 static noinline int compress_file_range(struct async_chunk *async_chunk)
574 struct inode *inode = async_chunk->inode;
575 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
576 u64 blocksize = fs_info->sectorsize;
577 u64 start = async_chunk->start;
578 u64 end = async_chunk->end;
582 struct page **pages = NULL;
583 unsigned long nr_pages;
584 unsigned long total_compressed = 0;
585 unsigned long total_in = 0;
588 int compress_type = fs_info->compress_type;
589 int compressed_extents = 0;
592 inode_should_defrag(BTRFS_I(inode), start, end, end - start + 1,
596 * We need to save i_size before now because it could change in between
597 * us evaluating the size and assigning it. This is because we lock and
598 * unlock the page in truncate and fallocate, and then modify the i_size
601 * The barriers are to emulate READ_ONCE, remove that once i_size_read
605 i_size = i_size_read(inode);
607 actual_end = min_t(u64, i_size, end + 1);
610 nr_pages = (end >> PAGE_SHIFT) - (start >> PAGE_SHIFT) + 1;
611 nr_pages = min_t(unsigned long, nr_pages,
612 BTRFS_MAX_COMPRESSED / PAGE_SIZE);
615 * we don't want to send crud past the end of i_size through
616 * compression, that's just a waste of CPU time. So, if the
617 * end of the file is before the start of our current
618 * requested range of bytes, we bail out to the uncompressed
619 * cleanup code that can deal with all of this.
621 * It isn't really the fastest way to fix things, but this is a
622 * very uncommon corner.
624 if (actual_end <= start)
625 goto cleanup_and_bail_uncompressed;
627 total_compressed = actual_end - start;
630 * Skip compression for a small file range(<=blocksize) that
631 * isn't an inline extent, since it doesn't save disk space at all.
633 if (total_compressed <= blocksize &&
634 (start > 0 || end + 1 < BTRFS_I(inode)->disk_i_size))
635 goto cleanup_and_bail_uncompressed;
638 * For subpage case, we require full page alignment for the sector
640 * Thus we must also check against @actual_end, not just @end.
642 if (blocksize < PAGE_SIZE) {
643 if (!IS_ALIGNED(start, PAGE_SIZE) ||
644 !IS_ALIGNED(round_up(actual_end, blocksize), PAGE_SIZE))
645 goto cleanup_and_bail_uncompressed;
648 total_compressed = min_t(unsigned long, total_compressed,
649 BTRFS_MAX_UNCOMPRESSED);
654 * we do compression for mount -o compress and when the
655 * inode has not been flagged as nocompress. This flag can
656 * change at any time if we discover bad compression ratios.
658 if (inode_need_compress(BTRFS_I(inode), start, end)) {
660 pages = kcalloc(nr_pages, sizeof(struct page *), GFP_NOFS);
662 /* just bail out to the uncompressed code */
667 if (BTRFS_I(inode)->defrag_compress)
668 compress_type = BTRFS_I(inode)->defrag_compress;
669 else if (BTRFS_I(inode)->prop_compress)
670 compress_type = BTRFS_I(inode)->prop_compress;
673 * we need to call clear_page_dirty_for_io on each
674 * page in the range. Otherwise applications with the file
675 * mmap'd can wander in and change the page contents while
676 * we are compressing them.
678 * If the compression fails for any reason, we set the pages
679 * dirty again later on.
681 * Note that the remaining part is redirtied, the start pointer
682 * has moved, the end is the original one.
685 extent_range_clear_dirty_for_io(inode, start, end);
689 /* Compression level is applied here and only here */
690 ret = btrfs_compress_pages(
691 compress_type | (fs_info->compress_level << 4),
692 inode->i_mapping, start,
699 unsigned long offset = offset_in_page(total_compressed);
700 struct page *page = pages[nr_pages - 1];
702 /* zero the tail end of the last page, we might be
703 * sending it down to disk
706 memzero_page(page, offset, PAGE_SIZE - offset);
712 * Check cow_file_range() for why we don't even try to create inline
713 * extent for subpage case.
715 if (start == 0 && fs_info->sectorsize == PAGE_SIZE) {
716 /* lets try to make an inline extent */
717 if (ret || total_in < actual_end) {
718 /* we didn't compress the entire range, try
719 * to make an uncompressed inline extent.
721 ret = cow_file_range_inline(BTRFS_I(inode), actual_end,
722 0, BTRFS_COMPRESS_NONE,
725 /* try making a compressed inline extent */
726 ret = cow_file_range_inline(BTRFS_I(inode), actual_end,
728 compress_type, pages,
732 unsigned long clear_flags = EXTENT_DELALLOC |
733 EXTENT_DELALLOC_NEW | EXTENT_DEFRAG |
734 EXTENT_DO_ACCOUNTING;
735 unsigned long page_error_op;
737 page_error_op = ret < 0 ? PAGE_SET_ERROR : 0;
740 * inline extent creation worked or returned error,
741 * we don't need to create any more async work items.
742 * Unlock and free up our temp pages.
744 * We use DO_ACCOUNTING here because we need the
745 * delalloc_release_metadata to be done _after_ we drop
746 * our outstanding extent for clearing delalloc for this
749 extent_clear_unlock_delalloc(BTRFS_I(inode), start, end,
753 PAGE_START_WRITEBACK |
758 * Ensure we only free the compressed pages if we have
759 * them allocated, as we can still reach here with
760 * inode_need_compress() == false.
763 for (i = 0; i < nr_pages; i++) {
764 WARN_ON(pages[i]->mapping);
775 * we aren't doing an inline extent round the compressed size
776 * up to a block size boundary so the allocator does sane
779 total_compressed = ALIGN(total_compressed, blocksize);
782 * one last check to make sure the compression is really a
783 * win, compare the page count read with the blocks on disk,
784 * compression must free at least one sector size
786 total_in = round_up(total_in, fs_info->sectorsize);
787 if (total_compressed + blocksize <= total_in) {
788 compressed_extents++;
791 * The async work queues will take care of doing actual
792 * allocation on disk for these compressed pages, and
793 * will submit them to the elevator.
795 add_async_extent(async_chunk, start, total_in,
796 total_compressed, pages, nr_pages,
799 if (start + total_in < end) {
805 return compressed_extents;
810 * the compression code ran but failed to make things smaller,
811 * free any pages it allocated and our page pointer array
813 for (i = 0; i < nr_pages; i++) {
814 WARN_ON(pages[i]->mapping);
819 total_compressed = 0;
822 /* flag the file so we don't compress in the future */
823 if (!btrfs_test_opt(fs_info, FORCE_COMPRESS) &&
824 !(BTRFS_I(inode)->prop_compress)) {
825 BTRFS_I(inode)->flags |= BTRFS_INODE_NOCOMPRESS;
828 cleanup_and_bail_uncompressed:
830 * No compression, but we still need to write the pages in the file
831 * we've been given so far. redirty the locked page if it corresponds
832 * to our extent and set things up for the async work queue to run
833 * cow_file_range to do the normal delalloc dance.
835 if (async_chunk->locked_page &&
836 (page_offset(async_chunk->locked_page) >= start &&
837 page_offset(async_chunk->locked_page)) <= end) {
838 __set_page_dirty_nobuffers(async_chunk->locked_page);
839 /* unlocked later on in the async handlers */
843 extent_range_redirty_for_io(inode, start, end);
844 add_async_extent(async_chunk, start, end - start + 1, 0, NULL, 0,
845 BTRFS_COMPRESS_NONE);
846 compressed_extents++;
848 return compressed_extents;
851 static void free_async_extent_pages(struct async_extent *async_extent)
855 if (!async_extent->pages)
858 for (i = 0; i < async_extent->nr_pages; i++) {
859 WARN_ON(async_extent->pages[i]->mapping);
860 put_page(async_extent->pages[i]);
862 kfree(async_extent->pages);
863 async_extent->nr_pages = 0;
864 async_extent->pages = NULL;
867 static int submit_uncompressed_range(struct btrfs_inode *inode,
868 struct async_extent *async_extent,
869 struct page *locked_page)
871 u64 start = async_extent->start;
872 u64 end = async_extent->start + async_extent->ram_size - 1;
873 unsigned long nr_written = 0;
874 int page_started = 0;
878 * Call cow_file_range() to run the delalloc range directly, since we
879 * won't go to NOCOW or async path again.
881 * Also we call cow_file_range() with @unlock_page == 0, so that we
882 * can directly submit them without interruption.
884 ret = cow_file_range(inode, locked_page, start, end, &page_started,
886 /* Inline extent inserted, page gets unlocked and everything is done */
893 unlock_page(locked_page);
897 ret = extent_write_locked_range(&inode->vfs_inode, start, end);
898 /* All pages will be unlocked, including @locked_page */
904 static int submit_one_async_extent(struct btrfs_inode *inode,
905 struct async_chunk *async_chunk,
906 struct async_extent *async_extent,
909 struct extent_io_tree *io_tree = &inode->io_tree;
910 struct btrfs_root *root = inode->root;
911 struct btrfs_fs_info *fs_info = root->fs_info;
912 struct btrfs_key ins;
913 struct page *locked_page = NULL;
914 struct extent_map *em;
916 u64 start = async_extent->start;
917 u64 end = async_extent->start + async_extent->ram_size - 1;
920 * If async_chunk->locked_page is in the async_extent range, we need to
923 if (async_chunk->locked_page) {
924 u64 locked_page_start = page_offset(async_chunk->locked_page);
925 u64 locked_page_end = locked_page_start + PAGE_SIZE - 1;
927 if (!(start >= locked_page_end || end <= locked_page_start))
928 locked_page = async_chunk->locked_page;
930 lock_extent(io_tree, start, end);
932 /* We have fall back to uncompressed write */
933 if (!async_extent->pages)
934 return submit_uncompressed_range(inode, async_extent, locked_page);
936 ret = btrfs_reserve_extent(root, async_extent->ram_size,
937 async_extent->compressed_size,
938 async_extent->compressed_size,
939 0, *alloc_hint, &ins, 1, 1);
941 free_async_extent_pages(async_extent);
943 * Here we used to try again by going back to non-compressed
944 * path for ENOSPC. But we can't reserve space even for
945 * compressed size, how could it work for uncompressed size
946 * which requires larger size? So here we directly go error
952 /* Here we're doing allocation and writeback of the compressed pages */
953 em = create_io_em(inode, start,
954 async_extent->ram_size, /* len */
955 start, /* orig_start */
956 ins.objectid, /* block_start */
957 ins.offset, /* block_len */
958 ins.offset, /* orig_block_len */
959 async_extent->ram_size, /* ram_bytes */
960 async_extent->compress_type,
961 BTRFS_ORDERED_COMPRESSED);
964 goto out_free_reserve;
968 ret = btrfs_add_ordered_extent(inode, start, /* file_offset */
969 async_extent->ram_size, /* num_bytes */
970 async_extent->ram_size, /* ram_bytes */
971 ins.objectid, /* disk_bytenr */
972 ins.offset, /* disk_num_bytes */
974 1 << BTRFS_ORDERED_COMPRESSED,
975 async_extent->compress_type);
977 btrfs_drop_extent_cache(inode, start, end, 0);
978 goto out_free_reserve;
980 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
982 /* Clear dirty, set writeback and unlock the pages. */
983 extent_clear_unlock_delalloc(inode, start, end,
984 NULL, EXTENT_LOCKED | EXTENT_DELALLOC,
985 PAGE_UNLOCK | PAGE_START_WRITEBACK);
986 if (btrfs_submit_compressed_write(inode, start, /* file_offset */
987 async_extent->ram_size, /* num_bytes */
988 ins.objectid, /* disk_bytenr */
989 ins.offset, /* compressed_len */
990 async_extent->pages, /* compressed_pages */
991 async_extent->nr_pages,
992 async_chunk->write_flags,
993 async_chunk->blkcg_css, true)) {
994 const u64 start = async_extent->start;
995 const u64 end = start + async_extent->ram_size - 1;
997 btrfs_writepage_endio_finish_ordered(inode, NULL, start, end, 0);
999 extent_clear_unlock_delalloc(inode, start, end, NULL, 0,
1000 PAGE_END_WRITEBACK | PAGE_SET_ERROR);
1001 free_async_extent_pages(async_extent);
1003 *alloc_hint = ins.objectid + ins.offset;
1004 kfree(async_extent);
1008 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
1009 btrfs_free_reserved_extent(fs_info, ins.objectid, ins.offset, 1);
1011 extent_clear_unlock_delalloc(inode, start, end,
1012 NULL, EXTENT_LOCKED | EXTENT_DELALLOC |
1013 EXTENT_DELALLOC_NEW |
1014 EXTENT_DEFRAG | EXTENT_DO_ACCOUNTING,
1015 PAGE_UNLOCK | PAGE_START_WRITEBACK |
1016 PAGE_END_WRITEBACK | PAGE_SET_ERROR);
1017 free_async_extent_pages(async_extent);
1018 kfree(async_extent);
1023 * Phase two of compressed writeback. This is the ordered portion of the code,
1024 * which only gets called in the order the work was queued. We walk all the
1025 * async extents created by compress_file_range and send them down to the disk.
1027 static noinline void submit_compressed_extents(struct async_chunk *async_chunk)
1029 struct btrfs_inode *inode = BTRFS_I(async_chunk->inode);
1030 struct btrfs_fs_info *fs_info = inode->root->fs_info;
1031 struct async_extent *async_extent;
1035 while (!list_empty(&async_chunk->extents)) {
1039 async_extent = list_entry(async_chunk->extents.next,
1040 struct async_extent, list);
1041 list_del(&async_extent->list);
1042 extent_start = async_extent->start;
1043 ram_size = async_extent->ram_size;
1045 ret = submit_one_async_extent(inode, async_chunk, async_extent,
1047 btrfs_debug(fs_info,
1048 "async extent submission failed root=%lld inode=%llu start=%llu len=%llu ret=%d",
1049 inode->root->root_key.objectid,
1050 btrfs_ino(inode), extent_start, ram_size, ret);
1054 static u64 get_extent_allocation_hint(struct btrfs_inode *inode, u64 start,
1057 struct extent_map_tree *em_tree = &inode->extent_tree;
1058 struct extent_map *em;
1061 read_lock(&em_tree->lock);
1062 em = search_extent_mapping(em_tree, start, num_bytes);
1065 * if block start isn't an actual block number then find the
1066 * first block in this inode and use that as a hint. If that
1067 * block is also bogus then just don't worry about it.
1069 if (em->block_start >= EXTENT_MAP_LAST_BYTE) {
1070 free_extent_map(em);
1071 em = search_extent_mapping(em_tree, 0, 0);
1072 if (em && em->block_start < EXTENT_MAP_LAST_BYTE)
1073 alloc_hint = em->block_start;
1075 free_extent_map(em);
1077 alloc_hint = em->block_start;
1078 free_extent_map(em);
1081 read_unlock(&em_tree->lock);
1087 * when extent_io.c finds a delayed allocation range in the file,
1088 * the call backs end up in this code. The basic idea is to
1089 * allocate extents on disk for the range, and create ordered data structs
1090 * in ram to track those extents.
1092 * locked_page is the page that writepage had locked already. We use
1093 * it to make sure we don't do extra locks or unlocks.
1095 * *page_started is set to one if we unlock locked_page and do everything
1096 * required to start IO on it. It may be clean and already done with
1097 * IO when we return.
1099 static noinline int cow_file_range(struct btrfs_inode *inode,
1100 struct page *locked_page,
1101 u64 start, u64 end, int *page_started,
1102 unsigned long *nr_written, int unlock)
1104 struct btrfs_root *root = inode->root;
1105 struct btrfs_fs_info *fs_info = root->fs_info;
1108 unsigned long ram_size;
1109 u64 cur_alloc_size = 0;
1111 u64 blocksize = fs_info->sectorsize;
1112 struct btrfs_key ins;
1113 struct extent_map *em;
1114 unsigned clear_bits;
1115 unsigned long page_ops;
1116 bool extent_reserved = false;
1119 if (btrfs_is_free_space_inode(inode)) {
1124 num_bytes = ALIGN(end - start + 1, blocksize);
1125 num_bytes = max(blocksize, num_bytes);
1126 ASSERT(num_bytes <= btrfs_super_total_bytes(fs_info->super_copy));
1128 inode_should_defrag(inode, start, end, num_bytes, SZ_64K);
1131 * Due to the page size limit, for subpage we can only trigger the
1132 * writeback for the dirty sectors of page, that means data writeback
1133 * is doing more writeback than what we want.
1135 * This is especially unexpected for some call sites like fallocate,
1136 * where we only increase i_size after everything is done.
1137 * This means we can trigger inline extent even if we didn't want to.
1138 * So here we skip inline extent creation completely.
1140 if (start == 0 && fs_info->sectorsize == PAGE_SIZE) {
1141 u64 actual_end = min_t(u64, i_size_read(&inode->vfs_inode),
1144 /* lets try to make an inline extent */
1145 ret = cow_file_range_inline(inode, actual_end, 0,
1146 BTRFS_COMPRESS_NONE, NULL, false);
1149 * We use DO_ACCOUNTING here because we need the
1150 * delalloc_release_metadata to be run _after_ we drop
1151 * our outstanding extent for clearing delalloc for this
1154 extent_clear_unlock_delalloc(inode, start, end,
1156 EXTENT_LOCKED | EXTENT_DELALLOC |
1157 EXTENT_DELALLOC_NEW | EXTENT_DEFRAG |
1158 EXTENT_DO_ACCOUNTING, PAGE_UNLOCK |
1159 PAGE_START_WRITEBACK | PAGE_END_WRITEBACK);
1160 *nr_written = *nr_written +
1161 (end - start + PAGE_SIZE) / PAGE_SIZE;
1164 * locked_page is locked by the caller of
1165 * writepage_delalloc(), not locked by
1166 * __process_pages_contig().
1168 * We can't let __process_pages_contig() to unlock it,
1169 * as it doesn't have any subpage::writers recorded.
1171 * Here we manually unlock the page, since the caller
1172 * can't use page_started to determine if it's an
1173 * inline extent or a compressed extent.
1175 unlock_page(locked_page);
1177 } else if (ret < 0) {
1182 alloc_hint = get_extent_allocation_hint(inode, start, num_bytes);
1183 btrfs_drop_extent_cache(inode, start, start + num_bytes - 1, 0);
1186 * Relocation relies on the relocated extents to have exactly the same
1187 * size as the original extents. Normally writeback for relocation data
1188 * extents follows a NOCOW path because relocation preallocates the
1189 * extents. However, due to an operation such as scrub turning a block
1190 * group to RO mode, it may fallback to COW mode, so we must make sure
1191 * an extent allocated during COW has exactly the requested size and can
1192 * not be split into smaller extents, otherwise relocation breaks and
1193 * fails during the stage where it updates the bytenr of file extent
1196 if (btrfs_is_data_reloc_root(root))
1197 min_alloc_size = num_bytes;
1199 min_alloc_size = fs_info->sectorsize;
1201 while (num_bytes > 0) {
1202 cur_alloc_size = num_bytes;
1203 ret = btrfs_reserve_extent(root, cur_alloc_size, cur_alloc_size,
1204 min_alloc_size, 0, alloc_hint,
1208 cur_alloc_size = ins.offset;
1209 extent_reserved = true;
1211 ram_size = ins.offset;
1212 em = create_io_em(inode, start, ins.offset, /* len */
1213 start, /* orig_start */
1214 ins.objectid, /* block_start */
1215 ins.offset, /* block_len */
1216 ins.offset, /* orig_block_len */
1217 ram_size, /* ram_bytes */
1218 BTRFS_COMPRESS_NONE, /* compress_type */
1219 BTRFS_ORDERED_REGULAR /* type */);
1224 free_extent_map(em);
1226 ret = btrfs_add_ordered_extent(inode, start, ram_size, ram_size,
1227 ins.objectid, cur_alloc_size, 0,
1228 1 << BTRFS_ORDERED_REGULAR,
1229 BTRFS_COMPRESS_NONE);
1231 goto out_drop_extent_cache;
1233 if (btrfs_is_data_reloc_root(root)) {
1234 ret = btrfs_reloc_clone_csums(inode, start,
1237 * Only drop cache here, and process as normal.
1239 * We must not allow extent_clear_unlock_delalloc()
1240 * at out_unlock label to free meta of this ordered
1241 * extent, as its meta should be freed by
1242 * btrfs_finish_ordered_io().
1244 * So we must continue until @start is increased to
1245 * skip current ordered extent.
1248 btrfs_drop_extent_cache(inode, start,
1249 start + ram_size - 1, 0);
1252 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
1255 * We're not doing compressed IO, don't unlock the first page
1256 * (which the caller expects to stay locked), don't clear any
1257 * dirty bits and don't set any writeback bits
1259 * Do set the Ordered (Private2) bit so we know this page was
1260 * properly setup for writepage.
1262 page_ops = unlock ? PAGE_UNLOCK : 0;
1263 page_ops |= PAGE_SET_ORDERED;
1265 extent_clear_unlock_delalloc(inode, start, start + ram_size - 1,
1267 EXTENT_LOCKED | EXTENT_DELALLOC,
1269 if (num_bytes < cur_alloc_size)
1272 num_bytes -= cur_alloc_size;
1273 alloc_hint = ins.objectid + ins.offset;
1274 start += cur_alloc_size;
1275 extent_reserved = false;
1278 * btrfs_reloc_clone_csums() error, since start is increased
1279 * extent_clear_unlock_delalloc() at out_unlock label won't
1280 * free metadata of current ordered extent, we're OK to exit.
1288 out_drop_extent_cache:
1289 btrfs_drop_extent_cache(inode, start, start + ram_size - 1, 0);
1291 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
1292 btrfs_free_reserved_extent(fs_info, ins.objectid, ins.offset, 1);
1294 clear_bits = EXTENT_LOCKED | EXTENT_DELALLOC | EXTENT_DELALLOC_NEW |
1295 EXTENT_DEFRAG | EXTENT_CLEAR_META_RESV;
1296 page_ops = PAGE_UNLOCK | PAGE_START_WRITEBACK | PAGE_END_WRITEBACK;
1298 * If we reserved an extent for our delalloc range (or a subrange) and
1299 * failed to create the respective ordered extent, then it means that
1300 * when we reserved the extent we decremented the extent's size from
1301 * the data space_info's bytes_may_use counter and incremented the
1302 * space_info's bytes_reserved counter by the same amount. We must make
1303 * sure extent_clear_unlock_delalloc() does not try to decrement again
1304 * the data space_info's bytes_may_use counter, therefore we do not pass
1305 * it the flag EXTENT_CLEAR_DATA_RESV.
1307 if (extent_reserved) {
1308 extent_clear_unlock_delalloc(inode, start,
1309 start + cur_alloc_size - 1,
1313 start += cur_alloc_size;
1317 extent_clear_unlock_delalloc(inode, start, end, locked_page,
1318 clear_bits | EXTENT_CLEAR_DATA_RESV,
1324 * work queue call back to started compression on a file and pages
1326 static noinline void async_cow_start(struct btrfs_work *work)
1328 struct async_chunk *async_chunk;
1329 int compressed_extents;
1331 async_chunk = container_of(work, struct async_chunk, work);
1333 compressed_extents = compress_file_range(async_chunk);
1334 if (compressed_extents == 0) {
1335 btrfs_add_delayed_iput(async_chunk->inode);
1336 async_chunk->inode = NULL;
1341 * work queue call back to submit previously compressed pages
1343 static noinline void async_cow_submit(struct btrfs_work *work)
1345 struct async_chunk *async_chunk = container_of(work, struct async_chunk,
1347 struct btrfs_fs_info *fs_info = btrfs_work_owner(work);
1348 unsigned long nr_pages;
1350 nr_pages = (async_chunk->end - async_chunk->start + PAGE_SIZE) >>
1354 * ->inode could be NULL if async_chunk_start has failed to compress,
1355 * in which case we don't have anything to submit, yet we need to
1356 * always adjust ->async_delalloc_pages as its paired with the init
1357 * happening in cow_file_range_async
1359 if (async_chunk->inode)
1360 submit_compressed_extents(async_chunk);
1362 /* atomic_sub_return implies a barrier */
1363 if (atomic_sub_return(nr_pages, &fs_info->async_delalloc_pages) <
1365 cond_wake_up_nomb(&fs_info->async_submit_wait);
1368 static noinline void async_cow_free(struct btrfs_work *work)
1370 struct async_chunk *async_chunk;
1371 struct async_cow *async_cow;
1373 async_chunk = container_of(work, struct async_chunk, work);
1374 if (async_chunk->inode)
1375 btrfs_add_delayed_iput(async_chunk->inode);
1376 if (async_chunk->blkcg_css)
1377 css_put(async_chunk->blkcg_css);
1379 async_cow = async_chunk->async_cow;
1380 if (atomic_dec_and_test(&async_cow->num_chunks))
1384 static int cow_file_range_async(struct btrfs_inode *inode,
1385 struct writeback_control *wbc,
1386 struct page *locked_page,
1387 u64 start, u64 end, int *page_started,
1388 unsigned long *nr_written)
1390 struct btrfs_fs_info *fs_info = inode->root->fs_info;
1391 struct cgroup_subsys_state *blkcg_css = wbc_blkcg_css(wbc);
1392 struct async_cow *ctx;
1393 struct async_chunk *async_chunk;
1394 unsigned long nr_pages;
1396 u64 num_chunks = DIV_ROUND_UP(end - start, SZ_512K);
1398 bool should_compress;
1400 const unsigned int write_flags = wbc_to_write_flags(wbc);
1402 unlock_extent(&inode->io_tree, start, end);
1404 if (inode->flags & BTRFS_INODE_NOCOMPRESS &&
1405 !btrfs_test_opt(fs_info, FORCE_COMPRESS)) {
1407 should_compress = false;
1409 should_compress = true;
1412 nofs_flag = memalloc_nofs_save();
1413 ctx = kvmalloc(struct_size(ctx, chunks, num_chunks), GFP_KERNEL);
1414 memalloc_nofs_restore(nofs_flag);
1417 unsigned clear_bits = EXTENT_LOCKED | EXTENT_DELALLOC |
1418 EXTENT_DELALLOC_NEW | EXTENT_DEFRAG |
1419 EXTENT_DO_ACCOUNTING;
1420 unsigned long page_ops = PAGE_UNLOCK | PAGE_START_WRITEBACK |
1421 PAGE_END_WRITEBACK | PAGE_SET_ERROR;
1423 extent_clear_unlock_delalloc(inode, start, end, locked_page,
1424 clear_bits, page_ops);
1428 async_chunk = ctx->chunks;
1429 atomic_set(&ctx->num_chunks, num_chunks);
1431 for (i = 0; i < num_chunks; i++) {
1432 if (should_compress)
1433 cur_end = min(end, start + SZ_512K - 1);
1438 * igrab is called higher up in the call chain, take only the
1439 * lightweight reference for the callback lifetime
1441 ihold(&inode->vfs_inode);
1442 async_chunk[i].async_cow = ctx;
1443 async_chunk[i].inode = &inode->vfs_inode;
1444 async_chunk[i].start = start;
1445 async_chunk[i].end = cur_end;
1446 async_chunk[i].write_flags = write_flags;
1447 INIT_LIST_HEAD(&async_chunk[i].extents);
1450 * The locked_page comes all the way from writepage and its
1451 * the original page we were actually given. As we spread
1452 * this large delalloc region across multiple async_chunk
1453 * structs, only the first struct needs a pointer to locked_page
1455 * This way we don't need racey decisions about who is supposed
1460 * Depending on the compressibility, the pages might or
1461 * might not go through async. We want all of them to
1462 * be accounted against wbc once. Let's do it here
1463 * before the paths diverge. wbc accounting is used
1464 * only for foreign writeback detection and doesn't
1465 * need full accuracy. Just account the whole thing
1466 * against the first page.
1468 wbc_account_cgroup_owner(wbc, locked_page,
1470 async_chunk[i].locked_page = locked_page;
1473 async_chunk[i].locked_page = NULL;
1476 if (blkcg_css != blkcg_root_css) {
1478 async_chunk[i].blkcg_css = blkcg_css;
1480 async_chunk[i].blkcg_css = NULL;
1483 btrfs_init_work(&async_chunk[i].work, async_cow_start,
1484 async_cow_submit, async_cow_free);
1486 nr_pages = DIV_ROUND_UP(cur_end - start, PAGE_SIZE);
1487 atomic_add(nr_pages, &fs_info->async_delalloc_pages);
1489 btrfs_queue_work(fs_info->delalloc_workers, &async_chunk[i].work);
1491 *nr_written += nr_pages;
1492 start = cur_end + 1;
1498 static noinline int run_delalloc_zoned(struct btrfs_inode *inode,
1499 struct page *locked_page, u64 start,
1500 u64 end, int *page_started,
1501 unsigned long *nr_written)
1505 ret = cow_file_range(inode, locked_page, start, end, page_started,
1513 __set_page_dirty_nobuffers(locked_page);
1514 account_page_redirty(locked_page);
1515 extent_write_locked_range(&inode->vfs_inode, start, end);
1521 static noinline int csum_exist_in_range(struct btrfs_fs_info *fs_info,
1522 u64 bytenr, u64 num_bytes)
1524 struct btrfs_root *csum_root = btrfs_csum_root(fs_info, bytenr);
1525 struct btrfs_ordered_sum *sums;
1529 ret = btrfs_lookup_csums_range(csum_root, bytenr,
1530 bytenr + num_bytes - 1, &list, 0);
1531 if (ret == 0 && list_empty(&list))
1534 while (!list_empty(&list)) {
1535 sums = list_entry(list.next, struct btrfs_ordered_sum, list);
1536 list_del(&sums->list);
1544 static int fallback_to_cow(struct btrfs_inode *inode, struct page *locked_page,
1545 const u64 start, const u64 end,
1546 int *page_started, unsigned long *nr_written)
1548 const bool is_space_ino = btrfs_is_free_space_inode(inode);
1549 const bool is_reloc_ino = btrfs_is_data_reloc_root(inode->root);
1550 const u64 range_bytes = end + 1 - start;
1551 struct extent_io_tree *io_tree = &inode->io_tree;
1552 u64 range_start = start;
1556 * If EXTENT_NORESERVE is set it means that when the buffered write was
1557 * made we had not enough available data space and therefore we did not
1558 * reserve data space for it, since we though we could do NOCOW for the
1559 * respective file range (either there is prealloc extent or the inode
1560 * has the NOCOW bit set).
1562 * However when we need to fallback to COW mode (because for example the
1563 * block group for the corresponding extent was turned to RO mode by a
1564 * scrub or relocation) we need to do the following:
1566 * 1) We increment the bytes_may_use counter of the data space info.
1567 * If COW succeeds, it allocates a new data extent and after doing
1568 * that it decrements the space info's bytes_may_use counter and
1569 * increments its bytes_reserved counter by the same amount (we do
1570 * this at btrfs_add_reserved_bytes()). So we need to increment the
1571 * bytes_may_use counter to compensate (when space is reserved at
1572 * buffered write time, the bytes_may_use counter is incremented);
1574 * 2) We clear the EXTENT_NORESERVE bit from the range. We do this so
1575 * that if the COW path fails for any reason, it decrements (through
1576 * extent_clear_unlock_delalloc()) the bytes_may_use counter of the
1577 * data space info, which we incremented in the step above.
1579 * If we need to fallback to cow and the inode corresponds to a free
1580 * space cache inode or an inode of the data relocation tree, we must
1581 * also increment bytes_may_use of the data space_info for the same
1582 * reason. Space caches and relocated data extents always get a prealloc
1583 * extent for them, however scrub or balance may have set the block
1584 * group that contains that extent to RO mode and therefore force COW
1585 * when starting writeback.
1587 count = count_range_bits(io_tree, &range_start, end, range_bytes,
1588 EXTENT_NORESERVE, 0);
1589 if (count > 0 || is_space_ino || is_reloc_ino) {
1591 struct btrfs_fs_info *fs_info = inode->root->fs_info;
1592 struct btrfs_space_info *sinfo = fs_info->data_sinfo;
1594 if (is_space_ino || is_reloc_ino)
1595 bytes = range_bytes;
1597 spin_lock(&sinfo->lock);
1598 btrfs_space_info_update_bytes_may_use(fs_info, sinfo, bytes);
1599 spin_unlock(&sinfo->lock);
1602 clear_extent_bit(io_tree, start, end, EXTENT_NORESERVE,
1606 return cow_file_range(inode, locked_page, start, end, page_started,
1611 * when nowcow writeback call back. This checks for snapshots or COW copies
1612 * of the extents that exist in the file, and COWs the file as required.
1614 * If no cow copies or snapshots exist, we write directly to the existing
1617 static noinline int run_delalloc_nocow(struct btrfs_inode *inode,
1618 struct page *locked_page,
1619 const u64 start, const u64 end,
1621 unsigned long *nr_written)
1623 struct btrfs_fs_info *fs_info = inode->root->fs_info;
1624 struct btrfs_root *root = inode->root;
1625 struct btrfs_path *path;
1626 u64 cow_start = (u64)-1;
1627 u64 cur_offset = start;
1629 bool check_prev = true;
1630 const bool freespace_inode = btrfs_is_free_space_inode(inode);
1631 u64 ino = btrfs_ino(inode);
1633 u64 disk_bytenr = 0;
1634 const bool force = inode->flags & BTRFS_INODE_NODATACOW;
1636 path = btrfs_alloc_path();
1638 extent_clear_unlock_delalloc(inode, start, end, locked_page,
1639 EXTENT_LOCKED | EXTENT_DELALLOC |
1640 EXTENT_DO_ACCOUNTING |
1641 EXTENT_DEFRAG, PAGE_UNLOCK |
1642 PAGE_START_WRITEBACK |
1643 PAGE_END_WRITEBACK);
1648 struct btrfs_key found_key;
1649 struct btrfs_file_extent_item *fi;
1650 struct extent_buffer *leaf;
1660 ret = btrfs_lookup_file_extent(NULL, root, path, ino,
1666 * If there is no extent for our range when doing the initial
1667 * search, then go back to the previous slot as it will be the
1668 * one containing the search offset
1670 if (ret > 0 && path->slots[0] > 0 && check_prev) {
1671 leaf = path->nodes[0];
1672 btrfs_item_key_to_cpu(leaf, &found_key,
1673 path->slots[0] - 1);
1674 if (found_key.objectid == ino &&
1675 found_key.type == BTRFS_EXTENT_DATA_KEY)
1680 /* Go to next leaf if we have exhausted the current one */
1681 leaf = path->nodes[0];
1682 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
1683 ret = btrfs_next_leaf(root, path);
1685 if (cow_start != (u64)-1)
1686 cur_offset = cow_start;
1691 leaf = path->nodes[0];
1694 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
1696 /* Didn't find anything for our INO */
1697 if (found_key.objectid > ino)
1700 * Keep searching until we find an EXTENT_ITEM or there are no
1701 * more extents for this inode
1703 if (WARN_ON_ONCE(found_key.objectid < ino) ||
1704 found_key.type < BTRFS_EXTENT_DATA_KEY) {
1709 /* Found key is not EXTENT_DATA_KEY or starts after req range */
1710 if (found_key.type > BTRFS_EXTENT_DATA_KEY ||
1711 found_key.offset > end)
1715 * If the found extent starts after requested offset, then
1716 * adjust extent_end to be right before this extent begins
1718 if (found_key.offset > cur_offset) {
1719 extent_end = found_key.offset;
1725 * Found extent which begins before our range and potentially
1728 fi = btrfs_item_ptr(leaf, path->slots[0],
1729 struct btrfs_file_extent_item);
1730 extent_type = btrfs_file_extent_type(leaf, fi);
1732 ram_bytes = btrfs_file_extent_ram_bytes(leaf, fi);
1733 if (extent_type == BTRFS_FILE_EXTENT_REG ||
1734 extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
1735 disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
1736 extent_offset = btrfs_file_extent_offset(leaf, fi);
1737 extent_end = found_key.offset +
1738 btrfs_file_extent_num_bytes(leaf, fi);
1740 btrfs_file_extent_disk_num_bytes(leaf, fi);
1742 * If the extent we got ends before our current offset,
1743 * skip to the next extent.
1745 if (extent_end <= cur_offset) {
1750 if (disk_bytenr == 0)
1752 /* Skip compressed/encrypted/encoded extents */
1753 if (btrfs_file_extent_compression(leaf, fi) ||
1754 btrfs_file_extent_encryption(leaf, fi) ||
1755 btrfs_file_extent_other_encoding(leaf, fi))
1758 * If extent is created before the last volume's snapshot
1759 * this implies the extent is shared, hence we can't do
1760 * nocow. This is the same check as in
1761 * btrfs_cross_ref_exist but without calling
1762 * btrfs_search_slot.
1764 if (!freespace_inode &&
1765 btrfs_file_extent_generation(leaf, fi) <=
1766 btrfs_root_last_snapshot(&root->root_item))
1768 if (extent_type == BTRFS_FILE_EXTENT_REG && !force)
1772 * The following checks can be expensive, as they need to
1773 * take other locks and do btree or rbtree searches, so
1774 * release the path to avoid blocking other tasks for too
1777 btrfs_release_path(path);
1779 ret = btrfs_cross_ref_exist(root, ino,
1781 extent_offset, disk_bytenr, false);
1784 * ret could be -EIO if the above fails to read
1788 if (cow_start != (u64)-1)
1789 cur_offset = cow_start;
1793 WARN_ON_ONCE(freespace_inode);
1796 disk_bytenr += extent_offset;
1797 disk_bytenr += cur_offset - found_key.offset;
1798 num_bytes = min(end + 1, extent_end) - cur_offset;
1800 * If there are pending snapshots for this root, we
1801 * fall into common COW way
1803 if (!freespace_inode && atomic_read(&root->snapshot_force_cow))
1806 * force cow if csum exists in the range.
1807 * this ensure that csum for a given extent are
1808 * either valid or do not exist.
1810 ret = csum_exist_in_range(fs_info, disk_bytenr,
1814 * ret could be -EIO if the above fails to read
1818 if (cow_start != (u64)-1)
1819 cur_offset = cow_start;
1822 WARN_ON_ONCE(freespace_inode);
1825 /* If the extent's block group is RO, we must COW */
1826 if (!btrfs_inc_nocow_writers(fs_info, disk_bytenr))
1829 } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
1830 extent_end = found_key.offset + ram_bytes;
1831 extent_end = ALIGN(extent_end, fs_info->sectorsize);
1832 /* Skip extents outside of our requested range */
1833 if (extent_end <= start) {
1838 /* If this triggers then we have a memory corruption */
1843 * If nocow is false then record the beginning of the range
1844 * that needs to be COWed
1847 if (cow_start == (u64)-1)
1848 cow_start = cur_offset;
1849 cur_offset = extent_end;
1850 if (cur_offset > end)
1852 if (!path->nodes[0])
1859 * COW range from cow_start to found_key.offset - 1. As the key
1860 * will contain the beginning of the first extent that can be
1861 * NOCOW, following one which needs to be COW'ed
1863 if (cow_start != (u64)-1) {
1864 ret = fallback_to_cow(inode, locked_page,
1865 cow_start, found_key.offset - 1,
1866 page_started, nr_written);
1869 cow_start = (u64)-1;
1872 if (extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
1873 u64 orig_start = found_key.offset - extent_offset;
1874 struct extent_map *em;
1876 em = create_io_em(inode, cur_offset, num_bytes,
1878 disk_bytenr, /* block_start */
1879 num_bytes, /* block_len */
1880 disk_num_bytes, /* orig_block_len */
1881 ram_bytes, BTRFS_COMPRESS_NONE,
1882 BTRFS_ORDERED_PREALLOC);
1887 free_extent_map(em);
1888 ret = btrfs_add_ordered_extent(inode,
1889 cur_offset, num_bytes, num_bytes,
1890 disk_bytenr, num_bytes, 0,
1891 1 << BTRFS_ORDERED_PREALLOC,
1892 BTRFS_COMPRESS_NONE);
1894 btrfs_drop_extent_cache(inode, cur_offset,
1895 cur_offset + num_bytes - 1,
1900 ret = btrfs_add_ordered_extent(inode, cur_offset,
1901 num_bytes, num_bytes,
1902 disk_bytenr, num_bytes,
1904 1 << BTRFS_ORDERED_NOCOW,
1905 BTRFS_COMPRESS_NONE);
1911 btrfs_dec_nocow_writers(fs_info, disk_bytenr);
1914 if (btrfs_is_data_reloc_root(root))
1916 * Error handled later, as we must prevent
1917 * extent_clear_unlock_delalloc() in error handler
1918 * from freeing metadata of created ordered extent.
1920 ret = btrfs_reloc_clone_csums(inode, cur_offset,
1923 extent_clear_unlock_delalloc(inode, cur_offset,
1924 cur_offset + num_bytes - 1,
1925 locked_page, EXTENT_LOCKED |
1927 EXTENT_CLEAR_DATA_RESV,
1928 PAGE_UNLOCK | PAGE_SET_ORDERED);
1930 cur_offset = extent_end;
1933 * btrfs_reloc_clone_csums() error, now we're OK to call error
1934 * handler, as metadata for created ordered extent will only
1935 * be freed by btrfs_finish_ordered_io().
1939 if (cur_offset > end)
1942 btrfs_release_path(path);
1944 if (cur_offset <= end && cow_start == (u64)-1)
1945 cow_start = cur_offset;
1947 if (cow_start != (u64)-1) {
1949 ret = fallback_to_cow(inode, locked_page, cow_start, end,
1950 page_started, nr_written);
1957 btrfs_dec_nocow_writers(fs_info, disk_bytenr);
1959 if (ret && cur_offset < end)
1960 extent_clear_unlock_delalloc(inode, cur_offset, end,
1961 locked_page, EXTENT_LOCKED |
1962 EXTENT_DELALLOC | EXTENT_DEFRAG |
1963 EXTENT_DO_ACCOUNTING, PAGE_UNLOCK |
1964 PAGE_START_WRITEBACK |
1965 PAGE_END_WRITEBACK);
1966 btrfs_free_path(path);
1970 static bool should_nocow(struct btrfs_inode *inode, u64 start, u64 end)
1972 if (inode->flags & (BTRFS_INODE_NODATACOW | BTRFS_INODE_PREALLOC)) {
1973 if (inode->defrag_bytes &&
1974 test_range_bit(&inode->io_tree, start, end, EXTENT_DEFRAG,
1983 * Function to process delayed allocation (create CoW) for ranges which are
1984 * being touched for the first time.
1986 int btrfs_run_delalloc_range(struct btrfs_inode *inode, struct page *locked_page,
1987 u64 start, u64 end, int *page_started, unsigned long *nr_written,
1988 struct writeback_control *wbc)
1991 const bool zoned = btrfs_is_zoned(inode->root->fs_info);
1994 * The range must cover part of the @locked_page, or the returned
1995 * @page_started can confuse the caller.
1997 ASSERT(!(end <= page_offset(locked_page) ||
1998 start >= page_offset(locked_page) + PAGE_SIZE));
2000 if (should_nocow(inode, start, end)) {
2002 * Normally on a zoned device we're only doing COW writes, but
2003 * in case of relocation on a zoned filesystem we have taken
2004 * precaution, that we're only writing sequentially. It's safe
2005 * to use run_delalloc_nocow() here, like for regular
2006 * preallocated inodes.
2008 ASSERT(!zoned || btrfs_is_data_reloc_root(inode->root));
2009 ret = run_delalloc_nocow(inode, locked_page, start, end,
2010 page_started, nr_written);
2011 } else if (!btrfs_inode_can_compress(inode) ||
2012 !inode_need_compress(inode, start, end)) {
2014 ret = run_delalloc_zoned(inode, locked_page, start, end,
2015 page_started, nr_written);
2017 ret = cow_file_range(inode, locked_page, start, end,
2018 page_started, nr_written, 1);
2020 set_bit(BTRFS_INODE_HAS_ASYNC_EXTENT, &inode->runtime_flags);
2021 ret = cow_file_range_async(inode, wbc, locked_page, start, end,
2022 page_started, nr_written);
2026 btrfs_cleanup_ordered_extents(inode, locked_page, start,
2031 void btrfs_split_delalloc_extent(struct inode *inode,
2032 struct extent_state *orig, u64 split)
2036 /* not delalloc, ignore it */
2037 if (!(orig->state & EXTENT_DELALLOC))
2040 size = orig->end - orig->start + 1;
2041 if (size > BTRFS_MAX_EXTENT_SIZE) {
2046 * See the explanation in btrfs_merge_delalloc_extent, the same
2047 * applies here, just in reverse.
2049 new_size = orig->end - split + 1;
2050 num_extents = count_max_extents(new_size);
2051 new_size = split - orig->start;
2052 num_extents += count_max_extents(new_size);
2053 if (count_max_extents(size) >= num_extents)
2057 spin_lock(&BTRFS_I(inode)->lock);
2058 btrfs_mod_outstanding_extents(BTRFS_I(inode), 1);
2059 spin_unlock(&BTRFS_I(inode)->lock);
2063 * Handle merged delayed allocation extents so we can keep track of new extents
2064 * that are just merged onto old extents, such as when we are doing sequential
2065 * writes, so we can properly account for the metadata space we'll need.
2067 void btrfs_merge_delalloc_extent(struct inode *inode, struct extent_state *new,
2068 struct extent_state *other)
2070 u64 new_size, old_size;
2073 /* not delalloc, ignore it */
2074 if (!(other->state & EXTENT_DELALLOC))
2077 if (new->start > other->start)
2078 new_size = new->end - other->start + 1;
2080 new_size = other->end - new->start + 1;
2082 /* we're not bigger than the max, unreserve the space and go */
2083 if (new_size <= BTRFS_MAX_EXTENT_SIZE) {
2084 spin_lock(&BTRFS_I(inode)->lock);
2085 btrfs_mod_outstanding_extents(BTRFS_I(inode), -1);
2086 spin_unlock(&BTRFS_I(inode)->lock);
2091 * We have to add up either side to figure out how many extents were
2092 * accounted for before we merged into one big extent. If the number of
2093 * extents we accounted for is <= the amount we need for the new range
2094 * then we can return, otherwise drop. Think of it like this
2098 * So we've grown the extent by a MAX_SIZE extent, this would mean we
2099 * need 2 outstanding extents, on one side we have 1 and the other side
2100 * we have 1 so they are == and we can return. But in this case
2102 * [MAX_SIZE+4k][MAX_SIZE+4k]
2104 * Each range on their own accounts for 2 extents, but merged together
2105 * they are only 3 extents worth of accounting, so we need to drop in
2108 old_size = other->end - other->start + 1;
2109 num_extents = count_max_extents(old_size);
2110 old_size = new->end - new->start + 1;
2111 num_extents += count_max_extents(old_size);
2112 if (count_max_extents(new_size) >= num_extents)
2115 spin_lock(&BTRFS_I(inode)->lock);
2116 btrfs_mod_outstanding_extents(BTRFS_I(inode), -1);
2117 spin_unlock(&BTRFS_I(inode)->lock);
2120 static void btrfs_add_delalloc_inodes(struct btrfs_root *root,
2121 struct inode *inode)
2123 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
2125 spin_lock(&root->delalloc_lock);
2126 if (list_empty(&BTRFS_I(inode)->delalloc_inodes)) {
2127 list_add_tail(&BTRFS_I(inode)->delalloc_inodes,
2128 &root->delalloc_inodes);
2129 set_bit(BTRFS_INODE_IN_DELALLOC_LIST,
2130 &BTRFS_I(inode)->runtime_flags);
2131 root->nr_delalloc_inodes++;
2132 if (root->nr_delalloc_inodes == 1) {
2133 spin_lock(&fs_info->delalloc_root_lock);
2134 BUG_ON(!list_empty(&root->delalloc_root));
2135 list_add_tail(&root->delalloc_root,
2136 &fs_info->delalloc_roots);
2137 spin_unlock(&fs_info->delalloc_root_lock);
2140 spin_unlock(&root->delalloc_lock);
2144 void __btrfs_del_delalloc_inode(struct btrfs_root *root,
2145 struct btrfs_inode *inode)
2147 struct btrfs_fs_info *fs_info = root->fs_info;
2149 if (!list_empty(&inode->delalloc_inodes)) {
2150 list_del_init(&inode->delalloc_inodes);
2151 clear_bit(BTRFS_INODE_IN_DELALLOC_LIST,
2152 &inode->runtime_flags);
2153 root->nr_delalloc_inodes--;
2154 if (!root->nr_delalloc_inodes) {
2155 ASSERT(list_empty(&root->delalloc_inodes));
2156 spin_lock(&fs_info->delalloc_root_lock);
2157 BUG_ON(list_empty(&root->delalloc_root));
2158 list_del_init(&root->delalloc_root);
2159 spin_unlock(&fs_info->delalloc_root_lock);
2164 static void btrfs_del_delalloc_inode(struct btrfs_root *root,
2165 struct btrfs_inode *inode)
2167 spin_lock(&root->delalloc_lock);
2168 __btrfs_del_delalloc_inode(root, inode);
2169 spin_unlock(&root->delalloc_lock);
2173 * Properly track delayed allocation bytes in the inode and to maintain the
2174 * list of inodes that have pending delalloc work to be done.
2176 void btrfs_set_delalloc_extent(struct inode *inode, struct extent_state *state,
2179 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
2181 if ((*bits & EXTENT_DEFRAG) && !(*bits & EXTENT_DELALLOC))
2184 * set_bit and clear bit hooks normally require _irqsave/restore
2185 * but in this case, we are only testing for the DELALLOC
2186 * bit, which is only set or cleared with irqs on
2188 if (!(state->state & EXTENT_DELALLOC) && (*bits & EXTENT_DELALLOC)) {
2189 struct btrfs_root *root = BTRFS_I(inode)->root;
2190 u64 len = state->end + 1 - state->start;
2191 u32 num_extents = count_max_extents(len);
2192 bool do_list = !btrfs_is_free_space_inode(BTRFS_I(inode));
2194 spin_lock(&BTRFS_I(inode)->lock);
2195 btrfs_mod_outstanding_extents(BTRFS_I(inode), num_extents);
2196 spin_unlock(&BTRFS_I(inode)->lock);
2198 /* For sanity tests */
2199 if (btrfs_is_testing(fs_info))
2202 percpu_counter_add_batch(&fs_info->delalloc_bytes, len,
2203 fs_info->delalloc_batch);
2204 spin_lock(&BTRFS_I(inode)->lock);
2205 BTRFS_I(inode)->delalloc_bytes += len;
2206 if (*bits & EXTENT_DEFRAG)
2207 BTRFS_I(inode)->defrag_bytes += len;
2208 if (do_list && !test_bit(BTRFS_INODE_IN_DELALLOC_LIST,
2209 &BTRFS_I(inode)->runtime_flags))
2210 btrfs_add_delalloc_inodes(root, inode);
2211 spin_unlock(&BTRFS_I(inode)->lock);
2214 if (!(state->state & EXTENT_DELALLOC_NEW) &&
2215 (*bits & EXTENT_DELALLOC_NEW)) {
2216 spin_lock(&BTRFS_I(inode)->lock);
2217 BTRFS_I(inode)->new_delalloc_bytes += state->end + 1 -
2219 spin_unlock(&BTRFS_I(inode)->lock);
2224 * Once a range is no longer delalloc this function ensures that proper
2225 * accounting happens.
2227 void btrfs_clear_delalloc_extent(struct inode *vfs_inode,
2228 struct extent_state *state, unsigned *bits)
2230 struct btrfs_inode *inode = BTRFS_I(vfs_inode);
2231 struct btrfs_fs_info *fs_info = btrfs_sb(vfs_inode->i_sb);
2232 u64 len = state->end + 1 - state->start;
2233 u32 num_extents = count_max_extents(len);
2235 if ((state->state & EXTENT_DEFRAG) && (*bits & EXTENT_DEFRAG)) {
2236 spin_lock(&inode->lock);
2237 inode->defrag_bytes -= len;
2238 spin_unlock(&inode->lock);
2242 * set_bit and clear bit hooks normally require _irqsave/restore
2243 * but in this case, we are only testing for the DELALLOC
2244 * bit, which is only set or cleared with irqs on
2246 if ((state->state & EXTENT_DELALLOC) && (*bits & EXTENT_DELALLOC)) {
2247 struct btrfs_root *root = inode->root;
2248 bool do_list = !btrfs_is_free_space_inode(inode);
2250 spin_lock(&inode->lock);
2251 btrfs_mod_outstanding_extents(inode, -num_extents);
2252 spin_unlock(&inode->lock);
2255 * We don't reserve metadata space for space cache inodes so we
2256 * don't need to call delalloc_release_metadata if there is an
2259 if (*bits & EXTENT_CLEAR_META_RESV &&
2260 root != fs_info->tree_root)
2261 btrfs_delalloc_release_metadata(inode, len, false);
2263 /* For sanity tests. */
2264 if (btrfs_is_testing(fs_info))
2267 if (!btrfs_is_data_reloc_root(root) &&
2268 do_list && !(state->state & EXTENT_NORESERVE) &&
2269 (*bits & EXTENT_CLEAR_DATA_RESV))
2270 btrfs_free_reserved_data_space_noquota(fs_info, len);
2272 percpu_counter_add_batch(&fs_info->delalloc_bytes, -len,
2273 fs_info->delalloc_batch);
2274 spin_lock(&inode->lock);
2275 inode->delalloc_bytes -= len;
2276 if (do_list && inode->delalloc_bytes == 0 &&
2277 test_bit(BTRFS_INODE_IN_DELALLOC_LIST,
2278 &inode->runtime_flags))
2279 btrfs_del_delalloc_inode(root, inode);
2280 spin_unlock(&inode->lock);
2283 if ((state->state & EXTENT_DELALLOC_NEW) &&
2284 (*bits & EXTENT_DELALLOC_NEW)) {
2285 spin_lock(&inode->lock);
2286 ASSERT(inode->new_delalloc_bytes >= len);
2287 inode->new_delalloc_bytes -= len;
2288 if (*bits & EXTENT_ADD_INODE_BYTES)
2289 inode_add_bytes(&inode->vfs_inode, len);
2290 spin_unlock(&inode->lock);
2295 * in order to insert checksums into the metadata in large chunks,
2296 * we wait until bio submission time. All the pages in the bio are
2297 * checksummed and sums are attached onto the ordered extent record.
2299 * At IO completion time the cums attached on the ordered extent record
2300 * are inserted into the btree
2302 static blk_status_t btrfs_submit_bio_start(struct inode *inode, struct bio *bio,
2303 u64 dio_file_offset)
2305 return btrfs_csum_one_bio(BTRFS_I(inode), bio, (u64)-1, false);
2309 * Split an extent_map at [start, start + len]
2311 * This function is intended to be used only for extract_ordered_extent().
2313 static int split_zoned_em(struct btrfs_inode *inode, u64 start, u64 len,
2316 struct extent_map_tree *em_tree = &inode->extent_tree;
2317 struct extent_map *em;
2318 struct extent_map *split_pre = NULL;
2319 struct extent_map *split_mid = NULL;
2320 struct extent_map *split_post = NULL;
2322 unsigned long flags;
2325 if (pre == 0 && post == 0)
2328 split_pre = alloc_extent_map();
2330 split_mid = alloc_extent_map();
2332 split_post = alloc_extent_map();
2333 if (!split_pre || (pre && !split_mid) || (post && !split_post)) {
2338 ASSERT(pre + post < len);
2340 lock_extent(&inode->io_tree, start, start + len - 1);
2341 write_lock(&em_tree->lock);
2342 em = lookup_extent_mapping(em_tree, start, len);
2348 ASSERT(em->len == len);
2349 ASSERT(!test_bit(EXTENT_FLAG_COMPRESSED, &em->flags));
2350 ASSERT(em->block_start < EXTENT_MAP_LAST_BYTE);
2351 ASSERT(test_bit(EXTENT_FLAG_PINNED, &em->flags));
2352 ASSERT(!test_bit(EXTENT_FLAG_LOGGING, &em->flags));
2353 ASSERT(!list_empty(&em->list));
2356 clear_bit(EXTENT_FLAG_PINNED, &em->flags);
2358 /* First, replace the em with a new extent_map starting from * em->start */
2359 split_pre->start = em->start;
2360 split_pre->len = (pre ? pre : em->len - post);
2361 split_pre->orig_start = split_pre->start;
2362 split_pre->block_start = em->block_start;
2363 split_pre->block_len = split_pre->len;
2364 split_pre->orig_block_len = split_pre->block_len;
2365 split_pre->ram_bytes = split_pre->len;
2366 split_pre->flags = flags;
2367 split_pre->compress_type = em->compress_type;
2368 split_pre->generation = em->generation;
2370 replace_extent_mapping(em_tree, em, split_pre, 1);
2373 * Now we only have an extent_map at:
2374 * [em->start, em->start + pre] if pre != 0
2375 * [em->start, em->start + em->len - post] if pre == 0
2379 /* Insert the middle extent_map */
2380 split_mid->start = em->start + pre;
2381 split_mid->len = em->len - pre - post;
2382 split_mid->orig_start = split_mid->start;
2383 split_mid->block_start = em->block_start + pre;
2384 split_mid->block_len = split_mid->len;
2385 split_mid->orig_block_len = split_mid->block_len;
2386 split_mid->ram_bytes = split_mid->len;
2387 split_mid->flags = flags;
2388 split_mid->compress_type = em->compress_type;
2389 split_mid->generation = em->generation;
2390 add_extent_mapping(em_tree, split_mid, 1);
2394 split_post->start = em->start + em->len - post;
2395 split_post->len = post;
2396 split_post->orig_start = split_post->start;
2397 split_post->block_start = em->block_start + em->len - post;
2398 split_post->block_len = split_post->len;
2399 split_post->orig_block_len = split_post->block_len;
2400 split_post->ram_bytes = split_post->len;
2401 split_post->flags = flags;
2402 split_post->compress_type = em->compress_type;
2403 split_post->generation = em->generation;
2404 add_extent_mapping(em_tree, split_post, 1);
2408 free_extent_map(em);
2409 /* Once for the tree */
2410 free_extent_map(em);
2413 write_unlock(&em_tree->lock);
2414 unlock_extent(&inode->io_tree, start, start + len - 1);
2416 free_extent_map(split_pre);
2417 free_extent_map(split_mid);
2418 free_extent_map(split_post);
2423 static blk_status_t extract_ordered_extent(struct btrfs_inode *inode,
2424 struct bio *bio, loff_t file_offset)
2426 struct btrfs_ordered_extent *ordered;
2427 u64 start = (u64)bio->bi_iter.bi_sector << SECTOR_SHIFT;
2429 u64 len = bio->bi_iter.bi_size;
2430 u64 end = start + len;
2435 ordered = btrfs_lookup_ordered_extent(inode, file_offset);
2436 if (WARN_ON_ONCE(!ordered))
2437 return BLK_STS_IOERR;
2439 /* No need to split */
2440 if (ordered->disk_num_bytes == len)
2443 /* We cannot split once end_bio'd ordered extent */
2444 if (WARN_ON_ONCE(ordered->bytes_left != ordered->disk_num_bytes)) {
2449 /* We cannot split a compressed ordered extent */
2450 if (WARN_ON_ONCE(ordered->disk_num_bytes != ordered->num_bytes)) {
2455 ordered_end = ordered->disk_bytenr + ordered->disk_num_bytes;
2456 /* bio must be in one ordered extent */
2457 if (WARN_ON_ONCE(start < ordered->disk_bytenr || end > ordered_end)) {
2462 /* Checksum list should be empty */
2463 if (WARN_ON_ONCE(!list_empty(&ordered->list))) {
2468 file_len = ordered->num_bytes;
2469 pre = start - ordered->disk_bytenr;
2470 post = ordered_end - end;
2472 ret = btrfs_split_ordered_extent(ordered, pre, post);
2475 ret = split_zoned_em(inode, file_offset, file_len, pre, post);
2478 btrfs_put_ordered_extent(ordered);
2480 return errno_to_blk_status(ret);
2484 * extent_io.c submission hook. This does the right thing for csum calculation
2485 * on write, or reading the csums from the tree before a read.
2487 * Rules about async/sync submit,
2488 * a) read: sync submit
2490 * b) write without checksum: sync submit
2492 * c) write with checksum:
2493 * c-1) if bio is issued by fsync: sync submit
2494 * (sync_writers != 0)
2496 * c-2) if root is reloc root: sync submit
2497 * (only in case of buffered IO)
2499 * c-3) otherwise: async submit
2501 blk_status_t btrfs_submit_data_bio(struct inode *inode, struct bio *bio,
2502 int mirror_num, unsigned long bio_flags)
2505 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
2506 struct btrfs_root *root = BTRFS_I(inode)->root;
2507 enum btrfs_wq_endio_type metadata = BTRFS_WQ_ENDIO_DATA;
2508 blk_status_t ret = 0;
2510 int async = !atomic_read(&BTRFS_I(inode)->sync_writers);
2512 skip_sum = (BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM) ||
2513 test_bit(BTRFS_FS_STATE_NO_CSUMS, &fs_info->fs_state);
2515 if (btrfs_is_free_space_inode(BTRFS_I(inode)))
2516 metadata = BTRFS_WQ_ENDIO_FREE_SPACE;
2518 if (bio_op(bio) == REQ_OP_ZONE_APPEND) {
2519 struct page *page = bio_first_bvec_all(bio)->bv_page;
2520 loff_t file_offset = page_offset(page);
2522 ret = extract_ordered_extent(BTRFS_I(inode), bio, file_offset);
2527 if (btrfs_op(bio) != BTRFS_MAP_WRITE) {
2528 ret = btrfs_bio_wq_end_io(fs_info, bio, metadata);
2532 if (bio_flags & EXTENT_BIO_COMPRESSED) {
2534 * btrfs_submit_compressed_read will handle completing
2535 * the bio if there were any errors, so just return
2538 ret = btrfs_submit_compressed_read(inode, bio,
2544 * Lookup bio sums does extra checks around whether we
2545 * need to csum or not, which is why we ignore skip_sum
2548 ret = btrfs_lookup_bio_sums(inode, bio, NULL);
2553 } else if (async && !skip_sum) {
2554 /* csum items have already been cloned */
2555 if (btrfs_is_data_reloc_root(root))
2557 /* we're doing a write, do the async checksumming */
2558 ret = btrfs_wq_submit_bio(inode, bio, mirror_num, bio_flags,
2559 0, btrfs_submit_bio_start);
2561 } else if (!skip_sum) {
2562 ret = btrfs_csum_one_bio(BTRFS_I(inode), bio, (u64)-1, false);
2568 ret = btrfs_map_bio(fs_info, bio, mirror_num);
2572 bio->bi_status = ret;
2580 * given a list of ordered sums record them in the inode. This happens
2581 * at IO completion time based on sums calculated at bio submission time.
2583 static int add_pending_csums(struct btrfs_trans_handle *trans,
2584 struct list_head *list)
2586 struct btrfs_ordered_sum *sum;
2587 struct btrfs_root *csum_root = NULL;
2590 list_for_each_entry(sum, list, list) {
2591 trans->adding_csums = true;
2593 csum_root = btrfs_csum_root(trans->fs_info,
2595 ret = btrfs_csum_file_blocks(trans, csum_root, sum);
2596 trans->adding_csums = false;
2603 static int btrfs_find_new_delalloc_bytes(struct btrfs_inode *inode,
2606 struct extent_state **cached_state)
2608 u64 search_start = start;
2609 const u64 end = start + len - 1;
2611 while (search_start < end) {
2612 const u64 search_len = end - search_start + 1;
2613 struct extent_map *em;
2617 em = btrfs_get_extent(inode, NULL, 0, search_start, search_len);
2621 if (em->block_start != EXTENT_MAP_HOLE)
2625 if (em->start < search_start)
2626 em_len -= search_start - em->start;
2627 if (em_len > search_len)
2628 em_len = search_len;
2630 ret = set_extent_bit(&inode->io_tree, search_start,
2631 search_start + em_len - 1,
2632 EXTENT_DELALLOC_NEW, 0, NULL, cached_state,
2635 search_start = extent_map_end(em);
2636 free_extent_map(em);
2643 int btrfs_set_extent_delalloc(struct btrfs_inode *inode, u64 start, u64 end,
2644 unsigned int extra_bits,
2645 struct extent_state **cached_state)
2647 WARN_ON(PAGE_ALIGNED(end));
2649 if (start >= i_size_read(&inode->vfs_inode) &&
2650 !(inode->flags & BTRFS_INODE_PREALLOC)) {
2652 * There can't be any extents following eof in this case so just
2653 * set the delalloc new bit for the range directly.
2655 extra_bits |= EXTENT_DELALLOC_NEW;
2659 ret = btrfs_find_new_delalloc_bytes(inode, start,
2666 return set_extent_delalloc(&inode->io_tree, start, end, extra_bits,
2670 /* see btrfs_writepage_start_hook for details on why this is required */
2671 struct btrfs_writepage_fixup {
2673 struct inode *inode;
2674 struct btrfs_work work;
2677 static void btrfs_writepage_fixup_worker(struct btrfs_work *work)
2679 struct btrfs_writepage_fixup *fixup;
2680 struct btrfs_ordered_extent *ordered;
2681 struct extent_state *cached_state = NULL;
2682 struct extent_changeset *data_reserved = NULL;
2684 struct btrfs_inode *inode;
2688 bool free_delalloc_space = true;
2690 fixup = container_of(work, struct btrfs_writepage_fixup, work);
2692 inode = BTRFS_I(fixup->inode);
2693 page_start = page_offset(page);
2694 page_end = page_offset(page) + PAGE_SIZE - 1;
2697 * This is similar to page_mkwrite, we need to reserve the space before
2698 * we take the page lock.
2700 ret = btrfs_delalloc_reserve_space(inode, &data_reserved, page_start,
2706 * Before we queued this fixup, we took a reference on the page.
2707 * page->mapping may go NULL, but it shouldn't be moved to a different
2710 if (!page->mapping || !PageDirty(page) || !PageChecked(page)) {
2712 * Unfortunately this is a little tricky, either
2714 * 1) We got here and our page had already been dealt with and
2715 * we reserved our space, thus ret == 0, so we need to just
2716 * drop our space reservation and bail. This can happen the
2717 * first time we come into the fixup worker, or could happen
2718 * while waiting for the ordered extent.
2719 * 2) Our page was already dealt with, but we happened to get an
2720 * ENOSPC above from the btrfs_delalloc_reserve_space. In
2721 * this case we obviously don't have anything to release, but
2722 * because the page was already dealt with we don't want to
2723 * mark the page with an error, so make sure we're resetting
2724 * ret to 0. This is why we have this check _before_ the ret
2725 * check, because we do not want to have a surprise ENOSPC
2726 * when the page was already properly dealt with.
2729 btrfs_delalloc_release_extents(inode, PAGE_SIZE);
2730 btrfs_delalloc_release_space(inode, data_reserved,
2731 page_start, PAGE_SIZE,
2739 * We can't mess with the page state unless it is locked, so now that
2740 * it is locked bail if we failed to make our space reservation.
2745 lock_extent_bits(&inode->io_tree, page_start, page_end, &cached_state);
2747 /* already ordered? We're done */
2748 if (PageOrdered(page))
2751 ordered = btrfs_lookup_ordered_range(inode, page_start, PAGE_SIZE);
2753 unlock_extent_cached(&inode->io_tree, page_start, page_end,
2756 btrfs_start_ordered_extent(ordered, 1);
2757 btrfs_put_ordered_extent(ordered);
2761 ret = btrfs_set_extent_delalloc(inode, page_start, page_end, 0,
2767 * Everything went as planned, we're now the owner of a dirty page with
2768 * delayed allocation bits set and space reserved for our COW
2771 * The page was dirty when we started, nothing should have cleaned it.
2773 BUG_ON(!PageDirty(page));
2774 free_delalloc_space = false;
2776 btrfs_delalloc_release_extents(inode, PAGE_SIZE);
2777 if (free_delalloc_space)
2778 btrfs_delalloc_release_space(inode, data_reserved, page_start,
2780 unlock_extent_cached(&inode->io_tree, page_start, page_end,
2785 * We hit ENOSPC or other errors. Update the mapping and page
2786 * to reflect the errors and clean the page.
2788 mapping_set_error(page->mapping, ret);
2789 end_extent_writepage(page, ret, page_start, page_end);
2790 clear_page_dirty_for_io(page);
2793 btrfs_page_clear_checked(inode->root->fs_info, page, page_start, PAGE_SIZE);
2797 extent_changeset_free(data_reserved);
2799 * As a precaution, do a delayed iput in case it would be the last iput
2800 * that could need flushing space. Recursing back to fixup worker would
2803 btrfs_add_delayed_iput(&inode->vfs_inode);
2807 * There are a few paths in the higher layers of the kernel that directly
2808 * set the page dirty bit without asking the filesystem if it is a
2809 * good idea. This causes problems because we want to make sure COW
2810 * properly happens and the data=ordered rules are followed.
2812 * In our case any range that doesn't have the ORDERED bit set
2813 * hasn't been properly setup for IO. We kick off an async process
2814 * to fix it up. The async helper will wait for ordered extents, set
2815 * the delalloc bit and make it safe to write the page.
2817 int btrfs_writepage_cow_fixup(struct page *page)
2819 struct inode *inode = page->mapping->host;
2820 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
2821 struct btrfs_writepage_fixup *fixup;
2823 /* This page has ordered extent covering it already */
2824 if (PageOrdered(page))
2828 * PageChecked is set below when we create a fixup worker for this page,
2829 * don't try to create another one if we're already PageChecked()
2831 * The extent_io writepage code will redirty the page if we send back
2834 if (PageChecked(page))
2837 fixup = kzalloc(sizeof(*fixup), GFP_NOFS);
2842 * We are already holding a reference to this inode from
2843 * write_cache_pages. We need to hold it because the space reservation
2844 * takes place outside of the page lock, and we can't trust
2845 * page->mapping outside of the page lock.
2848 btrfs_page_set_checked(fs_info, page, page_offset(page), PAGE_SIZE);
2850 btrfs_init_work(&fixup->work, btrfs_writepage_fixup_worker, NULL, NULL);
2852 fixup->inode = inode;
2853 btrfs_queue_work(fs_info->fixup_workers, &fixup->work);
2858 static int insert_reserved_file_extent(struct btrfs_trans_handle *trans,
2859 struct btrfs_inode *inode, u64 file_pos,
2860 struct btrfs_file_extent_item *stack_fi,
2861 const bool update_inode_bytes,
2862 u64 qgroup_reserved)
2864 struct btrfs_root *root = inode->root;
2865 const u64 sectorsize = root->fs_info->sectorsize;
2866 struct btrfs_path *path;
2867 struct extent_buffer *leaf;
2868 struct btrfs_key ins;
2869 u64 disk_num_bytes = btrfs_stack_file_extent_disk_num_bytes(stack_fi);
2870 u64 disk_bytenr = btrfs_stack_file_extent_disk_bytenr(stack_fi);
2871 u64 offset = btrfs_stack_file_extent_offset(stack_fi);
2872 u64 num_bytes = btrfs_stack_file_extent_num_bytes(stack_fi);
2873 u64 ram_bytes = btrfs_stack_file_extent_ram_bytes(stack_fi);
2874 struct btrfs_drop_extents_args drop_args = { 0 };
2877 path = btrfs_alloc_path();
2882 * we may be replacing one extent in the tree with another.
2883 * The new extent is pinned in the extent map, and we don't want
2884 * to drop it from the cache until it is completely in the btree.
2886 * So, tell btrfs_drop_extents to leave this extent in the cache.
2887 * the caller is expected to unpin it and allow it to be merged
2890 drop_args.path = path;
2891 drop_args.start = file_pos;
2892 drop_args.end = file_pos + num_bytes;
2893 drop_args.replace_extent = true;
2894 drop_args.extent_item_size = sizeof(*stack_fi);
2895 ret = btrfs_drop_extents(trans, root, inode, &drop_args);
2899 if (!drop_args.extent_inserted) {
2900 ins.objectid = btrfs_ino(inode);
2901 ins.offset = file_pos;
2902 ins.type = BTRFS_EXTENT_DATA_KEY;
2904 ret = btrfs_insert_empty_item(trans, root, path, &ins,
2909 leaf = path->nodes[0];
2910 btrfs_set_stack_file_extent_generation(stack_fi, trans->transid);
2911 write_extent_buffer(leaf, stack_fi,
2912 btrfs_item_ptr_offset(leaf, path->slots[0]),
2913 sizeof(struct btrfs_file_extent_item));
2915 btrfs_mark_buffer_dirty(leaf);
2916 btrfs_release_path(path);
2919 * If we dropped an inline extent here, we know the range where it is
2920 * was not marked with the EXTENT_DELALLOC_NEW bit, so we update the
2921 * number of bytes only for that range containing the inline extent.
2922 * The remaining of the range will be processed when clearning the
2923 * EXTENT_DELALLOC_BIT bit through the ordered extent completion.
2925 if (file_pos == 0 && !IS_ALIGNED(drop_args.bytes_found, sectorsize)) {
2926 u64 inline_size = round_down(drop_args.bytes_found, sectorsize);
2928 inline_size = drop_args.bytes_found - inline_size;
2929 btrfs_update_inode_bytes(inode, sectorsize, inline_size);
2930 drop_args.bytes_found -= inline_size;
2931 num_bytes -= sectorsize;
2934 if (update_inode_bytes)
2935 btrfs_update_inode_bytes(inode, num_bytes, drop_args.bytes_found);
2937 ins.objectid = disk_bytenr;
2938 ins.offset = disk_num_bytes;
2939 ins.type = BTRFS_EXTENT_ITEM_KEY;
2941 ret = btrfs_inode_set_file_extent_range(inode, file_pos, ram_bytes);
2945 ret = btrfs_alloc_reserved_file_extent(trans, root, btrfs_ino(inode),
2947 qgroup_reserved, &ins);
2949 btrfs_free_path(path);
2954 static void btrfs_release_delalloc_bytes(struct btrfs_fs_info *fs_info,
2957 struct btrfs_block_group *cache;
2959 cache = btrfs_lookup_block_group(fs_info, start);
2962 spin_lock(&cache->lock);
2963 cache->delalloc_bytes -= len;
2964 spin_unlock(&cache->lock);
2966 btrfs_put_block_group(cache);
2969 static int insert_ordered_extent_file_extent(struct btrfs_trans_handle *trans,
2970 struct btrfs_ordered_extent *oe)
2972 struct btrfs_file_extent_item stack_fi;
2973 bool update_inode_bytes;
2974 u64 num_bytes = oe->num_bytes;
2975 u64 ram_bytes = oe->ram_bytes;
2977 memset(&stack_fi, 0, sizeof(stack_fi));
2978 btrfs_set_stack_file_extent_type(&stack_fi, BTRFS_FILE_EXTENT_REG);
2979 btrfs_set_stack_file_extent_disk_bytenr(&stack_fi, oe->disk_bytenr);
2980 btrfs_set_stack_file_extent_disk_num_bytes(&stack_fi,
2981 oe->disk_num_bytes);
2982 btrfs_set_stack_file_extent_offset(&stack_fi, oe->offset);
2983 if (test_bit(BTRFS_ORDERED_TRUNCATED, &oe->flags))
2984 num_bytes = ram_bytes = oe->truncated_len;
2985 btrfs_set_stack_file_extent_num_bytes(&stack_fi, num_bytes);
2986 btrfs_set_stack_file_extent_ram_bytes(&stack_fi, ram_bytes);
2987 btrfs_set_stack_file_extent_compression(&stack_fi, oe->compress_type);
2988 /* Encryption and other encoding is reserved and all 0 */
2991 * For delalloc, when completing an ordered extent we update the inode's
2992 * bytes when clearing the range in the inode's io tree, so pass false
2993 * as the argument 'update_inode_bytes' to insert_reserved_file_extent(),
2994 * except if the ordered extent was truncated.
2996 update_inode_bytes = test_bit(BTRFS_ORDERED_DIRECT, &oe->flags) ||
2997 test_bit(BTRFS_ORDERED_ENCODED, &oe->flags) ||
2998 test_bit(BTRFS_ORDERED_TRUNCATED, &oe->flags);
3000 return insert_reserved_file_extent(trans, BTRFS_I(oe->inode),
3001 oe->file_offset, &stack_fi,
3002 update_inode_bytes, oe->qgroup_rsv);
3006 * As ordered data IO finishes, this gets called so we can finish
3007 * an ordered extent if the range of bytes in the file it covers are
3010 static int btrfs_finish_ordered_io(struct btrfs_ordered_extent *ordered_extent)
3012 struct btrfs_inode *inode = BTRFS_I(ordered_extent->inode);
3013 struct btrfs_root *root = inode->root;
3014 struct btrfs_fs_info *fs_info = root->fs_info;
3015 struct btrfs_trans_handle *trans = NULL;
3016 struct extent_io_tree *io_tree = &inode->io_tree;
3017 struct extent_state *cached_state = NULL;
3019 int compress_type = 0;
3021 u64 logical_len = ordered_extent->num_bytes;
3022 bool freespace_inode;
3023 bool truncated = false;
3024 bool clear_reserved_extent = true;
3025 unsigned int clear_bits = EXTENT_DEFRAG;
3027 start = ordered_extent->file_offset;
3028 end = start + ordered_extent->num_bytes - 1;
3030 if (!test_bit(BTRFS_ORDERED_NOCOW, &ordered_extent->flags) &&
3031 !test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags) &&
3032 !test_bit(BTRFS_ORDERED_DIRECT, &ordered_extent->flags) &&
3033 !test_bit(BTRFS_ORDERED_ENCODED, &ordered_extent->flags))
3034 clear_bits |= EXTENT_DELALLOC_NEW;
3036 freespace_inode = btrfs_is_free_space_inode(inode);
3038 if (test_bit(BTRFS_ORDERED_IOERR, &ordered_extent->flags)) {
3043 /* A valid bdev implies a write on a sequential zone */
3044 if (ordered_extent->bdev) {
3045 btrfs_rewrite_logical_zoned(ordered_extent);
3046 btrfs_zone_finish_endio(fs_info, ordered_extent->disk_bytenr,
3047 ordered_extent->disk_num_bytes);
3050 btrfs_free_io_failure_record(inode, start, end);
3052 if (test_bit(BTRFS_ORDERED_TRUNCATED, &ordered_extent->flags)) {
3054 logical_len = ordered_extent->truncated_len;
3055 /* Truncated the entire extent, don't bother adding */
3060 if (test_bit(BTRFS_ORDERED_NOCOW, &ordered_extent->flags)) {
3061 BUG_ON(!list_empty(&ordered_extent->list)); /* Logic error */
3063 btrfs_inode_safe_disk_i_size_write(inode, 0);
3064 if (freespace_inode)
3065 trans = btrfs_join_transaction_spacecache(root);
3067 trans = btrfs_join_transaction(root);
3068 if (IS_ERR(trans)) {
3069 ret = PTR_ERR(trans);
3073 trans->block_rsv = &inode->block_rsv;
3074 ret = btrfs_update_inode_fallback(trans, root, inode);
3075 if (ret) /* -ENOMEM or corruption */
3076 btrfs_abort_transaction(trans, ret);
3080 clear_bits |= EXTENT_LOCKED;
3081 lock_extent_bits(io_tree, start, end, &cached_state);
3083 if (freespace_inode)
3084 trans = btrfs_join_transaction_spacecache(root);
3086 trans = btrfs_join_transaction(root);
3087 if (IS_ERR(trans)) {
3088 ret = PTR_ERR(trans);
3093 trans->block_rsv = &inode->block_rsv;
3095 if (test_bit(BTRFS_ORDERED_COMPRESSED, &ordered_extent->flags))
3096 compress_type = ordered_extent->compress_type;
3097 if (test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags)) {
3098 BUG_ON(compress_type);
3099 ret = btrfs_mark_extent_written(trans, inode,
3100 ordered_extent->file_offset,
3101 ordered_extent->file_offset +
3104 BUG_ON(root == fs_info->tree_root);
3105 ret = insert_ordered_extent_file_extent(trans, ordered_extent);
3107 clear_reserved_extent = false;
3108 btrfs_release_delalloc_bytes(fs_info,
3109 ordered_extent->disk_bytenr,
3110 ordered_extent->disk_num_bytes);
3113 unpin_extent_cache(&inode->extent_tree, ordered_extent->file_offset,
3114 ordered_extent->num_bytes, trans->transid);
3116 btrfs_abort_transaction(trans, ret);
3120 ret = add_pending_csums(trans, &ordered_extent->list);
3122 btrfs_abort_transaction(trans, ret);
3127 * If this is a new delalloc range, clear its new delalloc flag to
3128 * update the inode's number of bytes. This needs to be done first
3129 * before updating the inode item.
3131 if ((clear_bits & EXTENT_DELALLOC_NEW) &&
3132 !test_bit(BTRFS_ORDERED_TRUNCATED, &ordered_extent->flags))
3133 clear_extent_bit(&inode->io_tree, start, end,
3134 EXTENT_DELALLOC_NEW | EXTENT_ADD_INODE_BYTES,
3135 0, 0, &cached_state);
3137 btrfs_inode_safe_disk_i_size_write(inode, 0);
3138 ret = btrfs_update_inode_fallback(trans, root, inode);
3139 if (ret) { /* -ENOMEM or corruption */
3140 btrfs_abort_transaction(trans, ret);
3145 clear_extent_bit(&inode->io_tree, start, end, clear_bits,
3146 (clear_bits & EXTENT_LOCKED) ? 1 : 0, 0,
3150 btrfs_end_transaction(trans);
3152 if (ret || truncated) {
3153 u64 unwritten_start = start;
3156 * If we failed to finish this ordered extent for any reason we
3157 * need to make sure BTRFS_ORDERED_IOERR is set on the ordered
3158 * extent, and mark the inode with the error if it wasn't
3159 * already set. Any error during writeback would have already
3160 * set the mapping error, so we need to set it if we're the ones
3161 * marking this ordered extent as failed.
3163 if (ret && !test_and_set_bit(BTRFS_ORDERED_IOERR,
3164 &ordered_extent->flags))
3165 mapping_set_error(ordered_extent->inode->i_mapping, -EIO);
3168 unwritten_start += logical_len;
3169 clear_extent_uptodate(io_tree, unwritten_start, end, NULL);
3171 /* Drop the cache for the part of the extent we didn't write. */
3172 btrfs_drop_extent_cache(inode, unwritten_start, end, 0);
3175 * If the ordered extent had an IOERR or something else went
3176 * wrong we need to return the space for this ordered extent
3177 * back to the allocator. We only free the extent in the
3178 * truncated case if we didn't write out the extent at all.
3180 * If we made it past insert_reserved_file_extent before we
3181 * errored out then we don't need to do this as the accounting
3182 * has already been done.
3184 if ((ret || !logical_len) &&
3185 clear_reserved_extent &&
3186 !test_bit(BTRFS_ORDERED_NOCOW, &ordered_extent->flags) &&
3187 !test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags)) {
3189 * Discard the range before returning it back to the
3192 if (ret && btrfs_test_opt(fs_info, DISCARD_SYNC))
3193 btrfs_discard_extent(fs_info,
3194 ordered_extent->disk_bytenr,
3195 ordered_extent->disk_num_bytes,
3197 btrfs_free_reserved_extent(fs_info,
3198 ordered_extent->disk_bytenr,
3199 ordered_extent->disk_num_bytes, 1);
3204 * This needs to be done to make sure anybody waiting knows we are done
3205 * updating everything for this ordered extent.
3207 btrfs_remove_ordered_extent(inode, ordered_extent);
3210 btrfs_put_ordered_extent(ordered_extent);
3211 /* once for the tree */
3212 btrfs_put_ordered_extent(ordered_extent);
3217 static void finish_ordered_fn(struct btrfs_work *work)
3219 struct btrfs_ordered_extent *ordered_extent;
3220 ordered_extent = container_of(work, struct btrfs_ordered_extent, work);
3221 btrfs_finish_ordered_io(ordered_extent);
3224 void btrfs_writepage_endio_finish_ordered(struct btrfs_inode *inode,
3225 struct page *page, u64 start,
3226 u64 end, bool uptodate)
3228 trace_btrfs_writepage_end_io_hook(inode, start, end, uptodate);
3230 btrfs_mark_ordered_io_finished(inode, page, start, end + 1 - start,
3231 finish_ordered_fn, uptodate);
3235 * check_data_csum - verify checksum of one sector of uncompressed data
3237 * @io_bio: btrfs_io_bio which contains the csum
3238 * @bio_offset: offset to the beginning of the bio (in bytes)
3239 * @page: page where is the data to be verified
3240 * @pgoff: offset inside the page
3241 * @start: logical offset in the file
3243 * The length of such check is always one sector size.
3245 static int check_data_csum(struct inode *inode, struct btrfs_bio *bbio,
3246 u32 bio_offset, struct page *page, u32 pgoff,
3249 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
3250 SHASH_DESC_ON_STACK(shash, fs_info->csum_shash);
3252 u32 len = fs_info->sectorsize;
3253 const u32 csum_size = fs_info->csum_size;
3254 unsigned int offset_sectors;
3256 u8 csum[BTRFS_CSUM_SIZE];
3258 ASSERT(pgoff + len <= PAGE_SIZE);
3260 offset_sectors = bio_offset >> fs_info->sectorsize_bits;
3261 csum_expected = ((u8 *)bbio->csum) + offset_sectors * csum_size;
3263 kaddr = kmap_atomic(page);
3264 shash->tfm = fs_info->csum_shash;
3266 crypto_shash_digest(shash, kaddr + pgoff, len, csum);
3268 if (memcmp(csum, csum_expected, csum_size))
3271 kunmap_atomic(kaddr);
3274 btrfs_print_data_csum_error(BTRFS_I(inode), start, csum, csum_expected,
3277 btrfs_dev_stat_inc_and_print(bbio->device,
3278 BTRFS_DEV_STAT_CORRUPTION_ERRS);
3279 memset(kaddr + pgoff, 1, len);
3280 flush_dcache_page(page);
3281 kunmap_atomic(kaddr);
3286 * When reads are done, we need to check csums to verify the data is correct.
3287 * if there's a match, we allow the bio to finish. If not, the code in
3288 * extent_io.c will try to find good copies for us.
3290 * @bio_offset: offset to the beginning of the bio (in bytes)
3291 * @start: file offset of the range start
3292 * @end: file offset of the range end (inclusive)
3294 * Return a bitmap where bit set means a csum mismatch, and bit not set means
3297 unsigned int btrfs_verify_data_csum(struct btrfs_bio *bbio,
3298 u32 bio_offset, struct page *page,
3301 struct inode *inode = page->mapping->host;
3302 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
3303 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
3304 struct btrfs_root *root = BTRFS_I(inode)->root;
3305 const u32 sectorsize = root->fs_info->sectorsize;
3307 unsigned int result = 0;
3309 if (btrfs_page_test_checked(fs_info, page, start, end + 1 - start)) {
3310 btrfs_page_clear_checked(fs_info, page, start, end + 1 - start);
3315 * This only happens for NODATASUM or compressed read.
3316 * Normally this should be covered by above check for compressed read
3317 * or the next check for NODATASUM. Just do a quicker exit here.
3319 if (bbio->csum == NULL)
3322 if (BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM)
3325 if (unlikely(test_bit(BTRFS_FS_STATE_NO_CSUMS, &fs_info->fs_state)))
3328 ASSERT(page_offset(page) <= start &&
3329 end <= page_offset(page) + PAGE_SIZE - 1);
3330 for (pg_off = offset_in_page(start);
3331 pg_off < offset_in_page(end);
3332 pg_off += sectorsize, bio_offset += sectorsize) {
3333 u64 file_offset = pg_off + page_offset(page);
3336 if (btrfs_is_data_reloc_root(root) &&
3337 test_range_bit(io_tree, file_offset,
3338 file_offset + sectorsize - 1,
3339 EXTENT_NODATASUM, 1, NULL)) {
3340 /* Skip the range without csum for data reloc inode */
3341 clear_extent_bits(io_tree, file_offset,
3342 file_offset + sectorsize - 1,
3346 ret = check_data_csum(inode, bbio, bio_offset, page, pg_off,
3347 page_offset(page) + pg_off);
3349 const int nr_bit = (pg_off - offset_in_page(start)) >>
3350 root->fs_info->sectorsize_bits;
3352 result |= (1U << nr_bit);
3359 * btrfs_add_delayed_iput - perform a delayed iput on @inode
3361 * @inode: The inode we want to perform iput on
3363 * This function uses the generic vfs_inode::i_count to track whether we should
3364 * just decrement it (in case it's > 1) or if this is the last iput then link
3365 * the inode to the delayed iput machinery. Delayed iputs are processed at
3366 * transaction commit time/superblock commit/cleaner kthread.
3368 void btrfs_add_delayed_iput(struct inode *inode)
3370 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
3371 struct btrfs_inode *binode = BTRFS_I(inode);
3373 if (atomic_add_unless(&inode->i_count, -1, 1))
3376 atomic_inc(&fs_info->nr_delayed_iputs);
3377 spin_lock(&fs_info->delayed_iput_lock);
3378 ASSERT(list_empty(&binode->delayed_iput));
3379 list_add_tail(&binode->delayed_iput, &fs_info->delayed_iputs);
3380 spin_unlock(&fs_info->delayed_iput_lock);
3381 if (!test_bit(BTRFS_FS_CLEANER_RUNNING, &fs_info->flags))
3382 wake_up_process(fs_info->cleaner_kthread);
3385 static void run_delayed_iput_locked(struct btrfs_fs_info *fs_info,
3386 struct btrfs_inode *inode)
3388 list_del_init(&inode->delayed_iput);
3389 spin_unlock(&fs_info->delayed_iput_lock);
3390 iput(&inode->vfs_inode);
3391 if (atomic_dec_and_test(&fs_info->nr_delayed_iputs))
3392 wake_up(&fs_info->delayed_iputs_wait);
3393 spin_lock(&fs_info->delayed_iput_lock);
3396 static void btrfs_run_delayed_iput(struct btrfs_fs_info *fs_info,
3397 struct btrfs_inode *inode)
3399 if (!list_empty(&inode->delayed_iput)) {
3400 spin_lock(&fs_info->delayed_iput_lock);
3401 if (!list_empty(&inode->delayed_iput))
3402 run_delayed_iput_locked(fs_info, inode);
3403 spin_unlock(&fs_info->delayed_iput_lock);
3407 void btrfs_run_delayed_iputs(struct btrfs_fs_info *fs_info)
3410 spin_lock(&fs_info->delayed_iput_lock);
3411 while (!list_empty(&fs_info->delayed_iputs)) {
3412 struct btrfs_inode *inode;
3414 inode = list_first_entry(&fs_info->delayed_iputs,
3415 struct btrfs_inode, delayed_iput);
3416 run_delayed_iput_locked(fs_info, inode);
3417 cond_resched_lock(&fs_info->delayed_iput_lock);
3419 spin_unlock(&fs_info->delayed_iput_lock);
3423 * Wait for flushing all delayed iputs
3425 * @fs_info: the filesystem
3427 * This will wait on any delayed iputs that are currently running with KILLABLE
3428 * set. Once they are all done running we will return, unless we are killed in
3429 * which case we return EINTR. This helps in user operations like fallocate etc
3430 * that might get blocked on the iputs.
3432 * Return EINTR if we were killed, 0 if nothing's pending
3434 int btrfs_wait_on_delayed_iputs(struct btrfs_fs_info *fs_info)
3436 int ret = wait_event_killable(fs_info->delayed_iputs_wait,
3437 atomic_read(&fs_info->nr_delayed_iputs) == 0);
3444 * This creates an orphan entry for the given inode in case something goes wrong
3445 * in the middle of an unlink.
3447 int btrfs_orphan_add(struct btrfs_trans_handle *trans,
3448 struct btrfs_inode *inode)
3452 ret = btrfs_insert_orphan_item(trans, inode->root, btrfs_ino(inode));
3453 if (ret && ret != -EEXIST) {
3454 btrfs_abort_transaction(trans, ret);
3462 * We have done the delete so we can go ahead and remove the orphan item for
3463 * this particular inode.
3465 static int btrfs_orphan_del(struct btrfs_trans_handle *trans,
3466 struct btrfs_inode *inode)
3468 return btrfs_del_orphan_item(trans, inode->root, btrfs_ino(inode));
3472 * this cleans up any orphans that may be left on the list from the last use
3475 int btrfs_orphan_cleanup(struct btrfs_root *root)
3477 struct btrfs_fs_info *fs_info = root->fs_info;
3478 struct btrfs_path *path;
3479 struct extent_buffer *leaf;
3480 struct btrfs_key key, found_key;
3481 struct btrfs_trans_handle *trans;
3482 struct inode *inode;
3483 u64 last_objectid = 0;
3484 int ret = 0, nr_unlink = 0;
3486 if (test_and_set_bit(BTRFS_ROOT_ORPHAN_CLEANUP, &root->state))
3489 path = btrfs_alloc_path();
3494 path->reada = READA_BACK;
3496 key.objectid = BTRFS_ORPHAN_OBJECTID;
3497 key.type = BTRFS_ORPHAN_ITEM_KEY;
3498 key.offset = (u64)-1;
3501 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
3506 * if ret == 0 means we found what we were searching for, which
3507 * is weird, but possible, so only screw with path if we didn't
3508 * find the key and see if we have stuff that matches
3512 if (path->slots[0] == 0)
3517 /* pull out the item */
3518 leaf = path->nodes[0];
3519 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
3521 /* make sure the item matches what we want */
3522 if (found_key.objectid != BTRFS_ORPHAN_OBJECTID)
3524 if (found_key.type != BTRFS_ORPHAN_ITEM_KEY)
3527 /* release the path since we're done with it */
3528 btrfs_release_path(path);
3531 * this is where we are basically btrfs_lookup, without the
3532 * crossing root thing. we store the inode number in the
3533 * offset of the orphan item.
3536 if (found_key.offset == last_objectid) {
3538 "Error removing orphan entry, stopping orphan cleanup");
3543 last_objectid = found_key.offset;
3545 found_key.objectid = found_key.offset;
3546 found_key.type = BTRFS_INODE_ITEM_KEY;
3547 found_key.offset = 0;
3548 inode = btrfs_iget(fs_info->sb, last_objectid, root);
3549 ret = PTR_ERR_OR_ZERO(inode);
3550 if (ret && ret != -ENOENT)
3553 if (ret == -ENOENT && root == fs_info->tree_root) {
3554 struct btrfs_root *dead_root;
3555 int is_dead_root = 0;
3558 * This is an orphan in the tree root. Currently these
3559 * could come from 2 sources:
3560 * a) a root (snapshot/subvolume) deletion in progress
3561 * b) a free space cache inode
3562 * We need to distinguish those two, as the orphan item
3563 * for a root must not get deleted before the deletion
3564 * of the snapshot/subvolume's tree completes.
3566 * btrfs_find_orphan_roots() ran before us, which has
3567 * found all deleted roots and loaded them into
3568 * fs_info->fs_roots_radix. So here we can find if an
3569 * orphan item corresponds to a deleted root by looking
3570 * up the root from that radix tree.
3573 spin_lock(&fs_info->fs_roots_radix_lock);
3574 dead_root = radix_tree_lookup(&fs_info->fs_roots_radix,
3575 (unsigned long)found_key.objectid);
3576 if (dead_root && btrfs_root_refs(&dead_root->root_item) == 0)
3578 spin_unlock(&fs_info->fs_roots_radix_lock);
3581 /* prevent this orphan from being found again */
3582 key.offset = found_key.objectid - 1;
3589 * If we have an inode with links, there are a couple of
3592 * 1. We were halfway through creating fsverity metadata for the
3593 * file. In that case, the orphan item represents incomplete
3594 * fsverity metadata which must be cleaned up with
3595 * btrfs_drop_verity_items and deleting the orphan item.
3597 * 2. Old kernels (before v3.12) used to create an
3598 * orphan item for truncate indicating that there were possibly
3599 * extent items past i_size that needed to be deleted. In v3.12,
3600 * truncate was changed to update i_size in sync with the extent
3601 * items, but the (useless) orphan item was still created. Since
3602 * v4.18, we don't create the orphan item for truncate at all.
3604 * So, this item could mean that we need to do a truncate, but
3605 * only if this filesystem was last used on a pre-v3.12 kernel
3606 * and was not cleanly unmounted. The odds of that are quite
3607 * slim, and it's a pain to do the truncate now, so just delete
3610 * It's also possible that this orphan item was supposed to be
3611 * deleted but wasn't. The inode number may have been reused,
3612 * but either way, we can delete the orphan item.
3614 if (ret == -ENOENT || inode->i_nlink) {
3616 ret = btrfs_drop_verity_items(BTRFS_I(inode));
3621 trans = btrfs_start_transaction(root, 1);
3622 if (IS_ERR(trans)) {
3623 ret = PTR_ERR(trans);
3626 btrfs_debug(fs_info, "auto deleting %Lu",
3627 found_key.objectid);
3628 ret = btrfs_del_orphan_item(trans, root,
3629 found_key.objectid);
3630 btrfs_end_transaction(trans);
3638 /* this will do delete_inode and everything for us */
3641 /* release the path since we're done with it */
3642 btrfs_release_path(path);
3644 if (test_bit(BTRFS_ROOT_ORPHAN_ITEM_INSERTED, &root->state)) {
3645 trans = btrfs_join_transaction(root);
3647 btrfs_end_transaction(trans);
3651 btrfs_debug(fs_info, "unlinked %d orphans", nr_unlink);
3655 btrfs_err(fs_info, "could not do orphan cleanup %d", ret);
3656 btrfs_free_path(path);
3661 * very simple check to peek ahead in the leaf looking for xattrs. If we
3662 * don't find any xattrs, we know there can't be any acls.
3664 * slot is the slot the inode is in, objectid is the objectid of the inode
3666 static noinline int acls_after_inode_item(struct extent_buffer *leaf,
3667 int slot, u64 objectid,
3668 int *first_xattr_slot)
3670 u32 nritems = btrfs_header_nritems(leaf);
3671 struct btrfs_key found_key;
3672 static u64 xattr_access = 0;
3673 static u64 xattr_default = 0;
3676 if (!xattr_access) {
3677 xattr_access = btrfs_name_hash(XATTR_NAME_POSIX_ACL_ACCESS,
3678 strlen(XATTR_NAME_POSIX_ACL_ACCESS));
3679 xattr_default = btrfs_name_hash(XATTR_NAME_POSIX_ACL_DEFAULT,
3680 strlen(XATTR_NAME_POSIX_ACL_DEFAULT));
3684 *first_xattr_slot = -1;
3685 while (slot < nritems) {
3686 btrfs_item_key_to_cpu(leaf, &found_key, slot);
3688 /* we found a different objectid, there must not be acls */
3689 if (found_key.objectid != objectid)
3692 /* we found an xattr, assume we've got an acl */
3693 if (found_key.type == BTRFS_XATTR_ITEM_KEY) {
3694 if (*first_xattr_slot == -1)
3695 *first_xattr_slot = slot;
3696 if (found_key.offset == xattr_access ||
3697 found_key.offset == xattr_default)
3702 * we found a key greater than an xattr key, there can't
3703 * be any acls later on
3705 if (found_key.type > BTRFS_XATTR_ITEM_KEY)
3712 * it goes inode, inode backrefs, xattrs, extents,
3713 * so if there are a ton of hard links to an inode there can
3714 * be a lot of backrefs. Don't waste time searching too hard,
3715 * this is just an optimization
3720 /* we hit the end of the leaf before we found an xattr or
3721 * something larger than an xattr. We have to assume the inode
3724 if (*first_xattr_slot == -1)
3725 *first_xattr_slot = slot;
3730 * read an inode from the btree into the in-memory inode
3732 static int btrfs_read_locked_inode(struct inode *inode,
3733 struct btrfs_path *in_path)
3735 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
3736 struct btrfs_path *path = in_path;
3737 struct extent_buffer *leaf;
3738 struct btrfs_inode_item *inode_item;
3739 struct btrfs_root *root = BTRFS_I(inode)->root;
3740 struct btrfs_key location;
3745 bool filled = false;
3746 int first_xattr_slot;
3748 ret = btrfs_fill_inode(inode, &rdev);
3753 path = btrfs_alloc_path();
3758 memcpy(&location, &BTRFS_I(inode)->location, sizeof(location));
3760 ret = btrfs_lookup_inode(NULL, root, path, &location, 0);
3762 if (path != in_path)
3763 btrfs_free_path(path);
3767 leaf = path->nodes[0];
3772 inode_item = btrfs_item_ptr(leaf, path->slots[0],
3773 struct btrfs_inode_item);
3774 inode->i_mode = btrfs_inode_mode(leaf, inode_item);
3775 set_nlink(inode, btrfs_inode_nlink(leaf, inode_item));
3776 i_uid_write(inode, btrfs_inode_uid(leaf, inode_item));
3777 i_gid_write(inode, btrfs_inode_gid(leaf, inode_item));
3778 btrfs_i_size_write(BTRFS_I(inode), btrfs_inode_size(leaf, inode_item));
3779 btrfs_inode_set_file_extent_range(BTRFS_I(inode), 0,
3780 round_up(i_size_read(inode), fs_info->sectorsize));
3782 inode->i_atime.tv_sec = btrfs_timespec_sec(leaf, &inode_item->atime);
3783 inode->i_atime.tv_nsec = btrfs_timespec_nsec(leaf, &inode_item->atime);
3785 inode->i_mtime.tv_sec = btrfs_timespec_sec(leaf, &inode_item->mtime);
3786 inode->i_mtime.tv_nsec = btrfs_timespec_nsec(leaf, &inode_item->mtime);
3788 inode->i_ctime.tv_sec = btrfs_timespec_sec(leaf, &inode_item->ctime);
3789 inode->i_ctime.tv_nsec = btrfs_timespec_nsec(leaf, &inode_item->ctime);
3791 BTRFS_I(inode)->i_otime.tv_sec =
3792 btrfs_timespec_sec(leaf, &inode_item->otime);
3793 BTRFS_I(inode)->i_otime.tv_nsec =
3794 btrfs_timespec_nsec(leaf, &inode_item->otime);
3796 inode_set_bytes(inode, btrfs_inode_nbytes(leaf, inode_item));
3797 BTRFS_I(inode)->generation = btrfs_inode_generation(leaf, inode_item);
3798 BTRFS_I(inode)->last_trans = btrfs_inode_transid(leaf, inode_item);
3800 inode_set_iversion_queried(inode,
3801 btrfs_inode_sequence(leaf, inode_item));
3802 inode->i_generation = BTRFS_I(inode)->generation;
3804 rdev = btrfs_inode_rdev(leaf, inode_item);
3806 BTRFS_I(inode)->index_cnt = (u64)-1;
3807 btrfs_inode_split_flags(btrfs_inode_flags(leaf, inode_item),
3808 &BTRFS_I(inode)->flags, &BTRFS_I(inode)->ro_flags);
3812 * If we were modified in the current generation and evicted from memory
3813 * and then re-read we need to do a full sync since we don't have any
3814 * idea about which extents were modified before we were evicted from
3817 * This is required for both inode re-read from disk and delayed inode
3818 * in delayed_nodes_tree.
3820 if (BTRFS_I(inode)->last_trans == fs_info->generation)
3821 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC,
3822 &BTRFS_I(inode)->runtime_flags);
3825 * We don't persist the id of the transaction where an unlink operation
3826 * against the inode was last made. So here we assume the inode might
3827 * have been evicted, and therefore the exact value of last_unlink_trans
3828 * lost, and set it to last_trans to avoid metadata inconsistencies
3829 * between the inode and its parent if the inode is fsync'ed and the log
3830 * replayed. For example, in the scenario:
3833 * ln mydir/foo mydir/bar
3836 * echo 2 > /proc/sys/vm/drop_caches # evicts inode
3837 * xfs_io -c fsync mydir/foo
3839 * mount fs, triggers fsync log replay
3841 * We must make sure that when we fsync our inode foo we also log its
3842 * parent inode, otherwise after log replay the parent still has the
3843 * dentry with the "bar" name but our inode foo has a link count of 1
3844 * and doesn't have an inode ref with the name "bar" anymore.
3846 * Setting last_unlink_trans to last_trans is a pessimistic approach,
3847 * but it guarantees correctness at the expense of occasional full
3848 * transaction commits on fsync if our inode is a directory, or if our
3849 * inode is not a directory, logging its parent unnecessarily.
3851 BTRFS_I(inode)->last_unlink_trans = BTRFS_I(inode)->last_trans;
3854 * Same logic as for last_unlink_trans. We don't persist the generation
3855 * of the last transaction where this inode was used for a reflink
3856 * operation, so after eviction and reloading the inode we must be
3857 * pessimistic and assume the last transaction that modified the inode.
3859 BTRFS_I(inode)->last_reflink_trans = BTRFS_I(inode)->last_trans;
3862 if (inode->i_nlink != 1 ||
3863 path->slots[0] >= btrfs_header_nritems(leaf))
3866 btrfs_item_key_to_cpu(leaf, &location, path->slots[0]);
3867 if (location.objectid != btrfs_ino(BTRFS_I(inode)))
3870 ptr = btrfs_item_ptr_offset(leaf, path->slots[0]);
3871 if (location.type == BTRFS_INODE_REF_KEY) {
3872 struct btrfs_inode_ref *ref;
3874 ref = (struct btrfs_inode_ref *)ptr;
3875 BTRFS_I(inode)->dir_index = btrfs_inode_ref_index(leaf, ref);
3876 } else if (location.type == BTRFS_INODE_EXTREF_KEY) {
3877 struct btrfs_inode_extref *extref;
3879 extref = (struct btrfs_inode_extref *)ptr;
3880 BTRFS_I(inode)->dir_index = btrfs_inode_extref_index(leaf,
3885 * try to precache a NULL acl entry for files that don't have
3886 * any xattrs or acls
3888 maybe_acls = acls_after_inode_item(leaf, path->slots[0],
3889 btrfs_ino(BTRFS_I(inode)), &first_xattr_slot);
3890 if (first_xattr_slot != -1) {
3891 path->slots[0] = first_xattr_slot;
3892 ret = btrfs_load_inode_props(inode, path);
3895 "error loading props for ino %llu (root %llu): %d",
3896 btrfs_ino(BTRFS_I(inode)),
3897 root->root_key.objectid, ret);
3899 if (path != in_path)
3900 btrfs_free_path(path);
3903 cache_no_acl(inode);
3905 switch (inode->i_mode & S_IFMT) {
3907 inode->i_mapping->a_ops = &btrfs_aops;
3908 inode->i_fop = &btrfs_file_operations;
3909 inode->i_op = &btrfs_file_inode_operations;
3912 inode->i_fop = &btrfs_dir_file_operations;
3913 inode->i_op = &btrfs_dir_inode_operations;
3916 inode->i_op = &btrfs_symlink_inode_operations;
3917 inode_nohighmem(inode);
3918 inode->i_mapping->a_ops = &btrfs_aops;
3921 inode->i_op = &btrfs_special_inode_operations;
3922 init_special_inode(inode, inode->i_mode, rdev);
3926 btrfs_sync_inode_flags_to_i_flags(inode);
3931 * given a leaf and an inode, copy the inode fields into the leaf
3933 static void fill_inode_item(struct btrfs_trans_handle *trans,
3934 struct extent_buffer *leaf,
3935 struct btrfs_inode_item *item,
3936 struct inode *inode)
3938 struct btrfs_map_token token;
3941 btrfs_init_map_token(&token, leaf);
3943 btrfs_set_token_inode_uid(&token, item, i_uid_read(inode));
3944 btrfs_set_token_inode_gid(&token, item, i_gid_read(inode));
3945 btrfs_set_token_inode_size(&token, item, BTRFS_I(inode)->disk_i_size);
3946 btrfs_set_token_inode_mode(&token, item, inode->i_mode);
3947 btrfs_set_token_inode_nlink(&token, item, inode->i_nlink);
3949 btrfs_set_token_timespec_sec(&token, &item->atime,
3950 inode->i_atime.tv_sec);
3951 btrfs_set_token_timespec_nsec(&token, &item->atime,
3952 inode->i_atime.tv_nsec);
3954 btrfs_set_token_timespec_sec(&token, &item->mtime,
3955 inode->i_mtime.tv_sec);
3956 btrfs_set_token_timespec_nsec(&token, &item->mtime,
3957 inode->i_mtime.tv_nsec);
3959 btrfs_set_token_timespec_sec(&token, &item->ctime,
3960 inode->i_ctime.tv_sec);
3961 btrfs_set_token_timespec_nsec(&token, &item->ctime,
3962 inode->i_ctime.tv_nsec);
3964 btrfs_set_token_timespec_sec(&token, &item->otime,
3965 BTRFS_I(inode)->i_otime.tv_sec);
3966 btrfs_set_token_timespec_nsec(&token, &item->otime,
3967 BTRFS_I(inode)->i_otime.tv_nsec);
3969 btrfs_set_token_inode_nbytes(&token, item, inode_get_bytes(inode));
3970 btrfs_set_token_inode_generation(&token, item,
3971 BTRFS_I(inode)->generation);
3972 btrfs_set_token_inode_sequence(&token, item, inode_peek_iversion(inode));
3973 btrfs_set_token_inode_transid(&token, item, trans->transid);
3974 btrfs_set_token_inode_rdev(&token, item, inode->i_rdev);
3975 flags = btrfs_inode_combine_flags(BTRFS_I(inode)->flags,
3976 BTRFS_I(inode)->ro_flags);
3977 btrfs_set_token_inode_flags(&token, item, flags);
3978 btrfs_set_token_inode_block_group(&token, item, 0);
3982 * copy everything in the in-memory inode into the btree.
3984 static noinline int btrfs_update_inode_item(struct btrfs_trans_handle *trans,
3985 struct btrfs_root *root,
3986 struct btrfs_inode *inode)
3988 struct btrfs_inode_item *inode_item;
3989 struct btrfs_path *path;
3990 struct extent_buffer *leaf;
3993 path = btrfs_alloc_path();
3997 ret = btrfs_lookup_inode(trans, root, path, &inode->location, 1);
4004 leaf = path->nodes[0];
4005 inode_item = btrfs_item_ptr(leaf, path->slots[0],
4006 struct btrfs_inode_item);
4008 fill_inode_item(trans, leaf, inode_item, &inode->vfs_inode);
4009 btrfs_mark_buffer_dirty(leaf);
4010 btrfs_set_inode_last_trans(trans, inode);
4013 btrfs_free_path(path);
4018 * copy everything in the in-memory inode into the btree.
4020 noinline int btrfs_update_inode(struct btrfs_trans_handle *trans,
4021 struct btrfs_root *root,
4022 struct btrfs_inode *inode)
4024 struct btrfs_fs_info *fs_info = root->fs_info;
4028 * If the inode is a free space inode, we can deadlock during commit
4029 * if we put it into the delayed code.
4031 * The data relocation inode should also be directly updated
4034 if (!btrfs_is_free_space_inode(inode)
4035 && !btrfs_is_data_reloc_root(root)
4036 && !test_bit(BTRFS_FS_LOG_RECOVERING, &fs_info->flags)) {
4037 btrfs_update_root_times(trans, root);
4039 ret = btrfs_delayed_update_inode(trans, root, inode);
4041 btrfs_set_inode_last_trans(trans, inode);
4045 return btrfs_update_inode_item(trans, root, inode);
4048 int btrfs_update_inode_fallback(struct btrfs_trans_handle *trans,
4049 struct btrfs_root *root, struct btrfs_inode *inode)
4053 ret = btrfs_update_inode(trans, root, inode);
4055 return btrfs_update_inode_item(trans, root, inode);
4060 * unlink helper that gets used here in inode.c and in the tree logging
4061 * recovery code. It remove a link in a directory with a given name, and
4062 * also drops the back refs in the inode to the directory
4064 static int __btrfs_unlink_inode(struct btrfs_trans_handle *trans,
4065 struct btrfs_inode *dir,
4066 struct btrfs_inode *inode,
4067 const char *name, int name_len,
4068 struct btrfs_rename_ctx *rename_ctx)
4070 struct btrfs_root *root = dir->root;
4071 struct btrfs_fs_info *fs_info = root->fs_info;
4072 struct btrfs_path *path;
4074 struct btrfs_dir_item *di;
4076 u64 ino = btrfs_ino(inode);
4077 u64 dir_ino = btrfs_ino(dir);
4079 path = btrfs_alloc_path();
4085 di = btrfs_lookup_dir_item(trans, root, path, dir_ino,
4086 name, name_len, -1);
4087 if (IS_ERR_OR_NULL(di)) {
4088 ret = di ? PTR_ERR(di) : -ENOENT;
4091 ret = btrfs_delete_one_dir_name(trans, root, path, di);
4094 btrfs_release_path(path);
4097 * If we don't have dir index, we have to get it by looking up
4098 * the inode ref, since we get the inode ref, remove it directly,
4099 * it is unnecessary to do delayed deletion.
4101 * But if we have dir index, needn't search inode ref to get it.
4102 * Since the inode ref is close to the inode item, it is better
4103 * that we delay to delete it, and just do this deletion when
4104 * we update the inode item.
4106 if (inode->dir_index) {
4107 ret = btrfs_delayed_delete_inode_ref(inode);
4109 index = inode->dir_index;
4114 ret = btrfs_del_inode_ref(trans, root, name, name_len, ino,
4118 "failed to delete reference to %.*s, inode %llu parent %llu",
4119 name_len, name, ino, dir_ino);
4120 btrfs_abort_transaction(trans, ret);
4125 rename_ctx->index = index;
4127 ret = btrfs_delete_delayed_dir_index(trans, dir, index);
4129 btrfs_abort_transaction(trans, ret);
4134 * If we are in a rename context, we don't need to update anything in the
4135 * log. That will be done later during the rename by btrfs_log_new_name().
4136 * Besides that, doing it here would only cause extra unncessary btree
4137 * operations on the log tree, increasing latency for applications.
4140 btrfs_del_inode_ref_in_log(trans, root, name, name_len, inode,
4142 btrfs_del_dir_entries_in_log(trans, root, name, name_len, dir,
4147 * If we have a pending delayed iput we could end up with the final iput
4148 * being run in btrfs-cleaner context. If we have enough of these built
4149 * up we can end up burning a lot of time in btrfs-cleaner without any
4150 * way to throttle the unlinks. Since we're currently holding a ref on
4151 * the inode we can run the delayed iput here without any issues as the
4152 * final iput won't be done until after we drop the ref we're currently
4155 btrfs_run_delayed_iput(fs_info, inode);
4157 btrfs_free_path(path);
4161 btrfs_i_size_write(dir, dir->vfs_inode.i_size - name_len * 2);
4162 inode_inc_iversion(&inode->vfs_inode);
4163 inode_inc_iversion(&dir->vfs_inode);
4164 inode->vfs_inode.i_ctime = dir->vfs_inode.i_mtime =
4165 dir->vfs_inode.i_ctime = current_time(&inode->vfs_inode);
4166 ret = btrfs_update_inode(trans, root, dir);
4171 int btrfs_unlink_inode(struct btrfs_trans_handle *trans,
4172 struct btrfs_inode *dir, struct btrfs_inode *inode,
4173 const char *name, int name_len)
4176 ret = __btrfs_unlink_inode(trans, dir, inode, name, name_len, NULL);
4178 drop_nlink(&inode->vfs_inode);
4179 ret = btrfs_update_inode(trans, inode->root, inode);
4185 * helper to start transaction for unlink and rmdir.
4187 * unlink and rmdir are special in btrfs, they do not always free space, so
4188 * if we cannot make our reservations the normal way try and see if there is
4189 * plenty of slack room in the global reserve to migrate, otherwise we cannot
4190 * allow the unlink to occur.
4192 static struct btrfs_trans_handle *__unlink_start_trans(struct inode *dir)
4194 struct btrfs_root *root = BTRFS_I(dir)->root;
4197 * 1 for the possible orphan item
4198 * 1 for the dir item
4199 * 1 for the dir index
4200 * 1 for the inode ref
4203 return btrfs_start_transaction_fallback_global_rsv(root, 5);
4206 static int btrfs_unlink(struct inode *dir, struct dentry *dentry)
4208 struct btrfs_trans_handle *trans;
4209 struct inode *inode = d_inode(dentry);
4212 trans = __unlink_start_trans(dir);
4214 return PTR_ERR(trans);
4216 btrfs_record_unlink_dir(trans, BTRFS_I(dir), BTRFS_I(d_inode(dentry)),
4219 ret = btrfs_unlink_inode(trans, BTRFS_I(dir),
4220 BTRFS_I(d_inode(dentry)), dentry->d_name.name,
4221 dentry->d_name.len);
4225 if (inode->i_nlink == 0) {
4226 ret = btrfs_orphan_add(trans, BTRFS_I(inode));
4232 btrfs_end_transaction(trans);
4233 btrfs_btree_balance_dirty(BTRFS_I(dir)->root->fs_info);
4237 static int btrfs_unlink_subvol(struct btrfs_trans_handle *trans,
4238 struct inode *dir, struct dentry *dentry)
4240 struct btrfs_root *root = BTRFS_I(dir)->root;
4241 struct btrfs_inode *inode = BTRFS_I(d_inode(dentry));
4242 struct btrfs_path *path;
4243 struct extent_buffer *leaf;
4244 struct btrfs_dir_item *di;
4245 struct btrfs_key key;
4246 const char *name = dentry->d_name.name;
4247 int name_len = dentry->d_name.len;
4251 u64 dir_ino = btrfs_ino(BTRFS_I(dir));
4253 if (btrfs_ino(inode) == BTRFS_FIRST_FREE_OBJECTID) {
4254 objectid = inode->root->root_key.objectid;
4255 } else if (btrfs_ino(inode) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID) {
4256 objectid = inode->location.objectid;
4262 path = btrfs_alloc_path();
4266 di = btrfs_lookup_dir_item(trans, root, path, dir_ino,
4267 name, name_len, -1);
4268 if (IS_ERR_OR_NULL(di)) {
4269 ret = di ? PTR_ERR(di) : -ENOENT;
4273 leaf = path->nodes[0];
4274 btrfs_dir_item_key_to_cpu(leaf, di, &key);
4275 WARN_ON(key.type != BTRFS_ROOT_ITEM_KEY || key.objectid != objectid);
4276 ret = btrfs_delete_one_dir_name(trans, root, path, di);
4278 btrfs_abort_transaction(trans, ret);
4281 btrfs_release_path(path);
4284 * This is a placeholder inode for a subvolume we didn't have a
4285 * reference to at the time of the snapshot creation. In the meantime
4286 * we could have renamed the real subvol link into our snapshot, so
4287 * depending on btrfs_del_root_ref to return -ENOENT here is incorrect.
4288 * Instead simply lookup the dir_index_item for this entry so we can
4289 * remove it. Otherwise we know we have a ref to the root and we can
4290 * call btrfs_del_root_ref, and it _shouldn't_ fail.
4292 if (btrfs_ino(inode) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID) {
4293 di = btrfs_search_dir_index_item(root, path, dir_ino,
4295 if (IS_ERR_OR_NULL(di)) {
4300 btrfs_abort_transaction(trans, ret);
4304 leaf = path->nodes[0];
4305 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
4307 btrfs_release_path(path);
4309 ret = btrfs_del_root_ref(trans, objectid,
4310 root->root_key.objectid, dir_ino,
4311 &index, name, name_len);
4313 btrfs_abort_transaction(trans, ret);
4318 ret = btrfs_delete_delayed_dir_index(trans, BTRFS_I(dir), index);
4320 btrfs_abort_transaction(trans, ret);
4324 btrfs_i_size_write(BTRFS_I(dir), dir->i_size - name_len * 2);
4325 inode_inc_iversion(dir);
4326 dir->i_mtime = dir->i_ctime = current_time(dir);
4327 ret = btrfs_update_inode_fallback(trans, root, BTRFS_I(dir));
4329 btrfs_abort_transaction(trans, ret);
4331 btrfs_free_path(path);
4336 * Helper to check if the subvolume references other subvolumes or if it's
4339 static noinline int may_destroy_subvol(struct btrfs_root *root)
4341 struct btrfs_fs_info *fs_info = root->fs_info;
4342 struct btrfs_path *path;
4343 struct btrfs_dir_item *di;
4344 struct btrfs_key key;
4348 path = btrfs_alloc_path();
4352 /* Make sure this root isn't set as the default subvol */
4353 dir_id = btrfs_super_root_dir(fs_info->super_copy);
4354 di = btrfs_lookup_dir_item(NULL, fs_info->tree_root, path,
4355 dir_id, "default", 7, 0);
4356 if (di && !IS_ERR(di)) {
4357 btrfs_dir_item_key_to_cpu(path->nodes[0], di, &key);
4358 if (key.objectid == root->root_key.objectid) {
4361 "deleting default subvolume %llu is not allowed",
4365 btrfs_release_path(path);
4368 key.objectid = root->root_key.objectid;
4369 key.type = BTRFS_ROOT_REF_KEY;
4370 key.offset = (u64)-1;
4372 ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, path, 0, 0);
4378 if (path->slots[0] > 0) {
4380 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
4381 if (key.objectid == root->root_key.objectid &&
4382 key.type == BTRFS_ROOT_REF_KEY)
4386 btrfs_free_path(path);
4390 /* Delete all dentries for inodes belonging to the root */
4391 static void btrfs_prune_dentries(struct btrfs_root *root)
4393 struct btrfs_fs_info *fs_info = root->fs_info;
4394 struct rb_node *node;
4395 struct rb_node *prev;
4396 struct btrfs_inode *entry;
4397 struct inode *inode;
4400 if (!BTRFS_FS_ERROR(fs_info))
4401 WARN_ON(btrfs_root_refs(&root->root_item) != 0);
4403 spin_lock(&root->inode_lock);
4405 node = root->inode_tree.rb_node;
4409 entry = rb_entry(node, struct btrfs_inode, rb_node);
4411 if (objectid < btrfs_ino(entry))
4412 node = node->rb_left;
4413 else if (objectid > btrfs_ino(entry))
4414 node = node->rb_right;
4420 entry = rb_entry(prev, struct btrfs_inode, rb_node);
4421 if (objectid <= btrfs_ino(entry)) {
4425 prev = rb_next(prev);
4429 entry = rb_entry(node, struct btrfs_inode, rb_node);
4430 objectid = btrfs_ino(entry) + 1;
4431 inode = igrab(&entry->vfs_inode);
4433 spin_unlock(&root->inode_lock);
4434 if (atomic_read(&inode->i_count) > 1)
4435 d_prune_aliases(inode);
4437 * btrfs_drop_inode will have it removed from the inode
4438 * cache when its usage count hits zero.
4442 spin_lock(&root->inode_lock);
4446 if (cond_resched_lock(&root->inode_lock))
4449 node = rb_next(node);
4451 spin_unlock(&root->inode_lock);
4454 int btrfs_delete_subvolume(struct inode *dir, struct dentry *dentry)
4456 struct btrfs_fs_info *fs_info = btrfs_sb(dentry->d_sb);
4457 struct btrfs_root *root = BTRFS_I(dir)->root;
4458 struct inode *inode = d_inode(dentry);
4459 struct btrfs_root *dest = BTRFS_I(inode)->root;
4460 struct btrfs_trans_handle *trans;
4461 struct btrfs_block_rsv block_rsv;
4466 * Don't allow to delete a subvolume with send in progress. This is
4467 * inside the inode lock so the error handling that has to drop the bit
4468 * again is not run concurrently.
4470 spin_lock(&dest->root_item_lock);
4471 if (dest->send_in_progress) {
4472 spin_unlock(&dest->root_item_lock);
4474 "attempt to delete subvolume %llu during send",
4475 dest->root_key.objectid);
4478 if (atomic_read(&dest->nr_swapfiles)) {
4479 spin_unlock(&dest->root_item_lock);
4481 "attempt to delete subvolume %llu with active swapfile",
4482 root->root_key.objectid);
4485 root_flags = btrfs_root_flags(&dest->root_item);
4486 btrfs_set_root_flags(&dest->root_item,
4487 root_flags | BTRFS_ROOT_SUBVOL_DEAD);
4488 spin_unlock(&dest->root_item_lock);
4490 down_write(&fs_info->subvol_sem);
4492 ret = may_destroy_subvol(dest);
4496 btrfs_init_block_rsv(&block_rsv, BTRFS_BLOCK_RSV_TEMP);
4498 * One for dir inode,
4499 * two for dir entries,
4500 * two for root ref/backref.
4502 ret = btrfs_subvolume_reserve_metadata(root, &block_rsv, 5, true);
4506 trans = btrfs_start_transaction(root, 0);
4507 if (IS_ERR(trans)) {
4508 ret = PTR_ERR(trans);
4511 trans->block_rsv = &block_rsv;
4512 trans->bytes_reserved = block_rsv.size;
4514 btrfs_record_snapshot_destroy(trans, BTRFS_I(dir));
4516 ret = btrfs_unlink_subvol(trans, dir, dentry);
4518 btrfs_abort_transaction(trans, ret);
4522 ret = btrfs_record_root_in_trans(trans, dest);
4524 btrfs_abort_transaction(trans, ret);
4528 memset(&dest->root_item.drop_progress, 0,
4529 sizeof(dest->root_item.drop_progress));
4530 btrfs_set_root_drop_level(&dest->root_item, 0);
4531 btrfs_set_root_refs(&dest->root_item, 0);
4533 if (!test_and_set_bit(BTRFS_ROOT_ORPHAN_ITEM_INSERTED, &dest->state)) {
4534 ret = btrfs_insert_orphan_item(trans,
4536 dest->root_key.objectid);
4538 btrfs_abort_transaction(trans, ret);
4543 ret = btrfs_uuid_tree_remove(trans, dest->root_item.uuid,
4544 BTRFS_UUID_KEY_SUBVOL,
4545 dest->root_key.objectid);
4546 if (ret && ret != -ENOENT) {
4547 btrfs_abort_transaction(trans, ret);
4550 if (!btrfs_is_empty_uuid(dest->root_item.received_uuid)) {
4551 ret = btrfs_uuid_tree_remove(trans,
4552 dest->root_item.received_uuid,
4553 BTRFS_UUID_KEY_RECEIVED_SUBVOL,
4554 dest->root_key.objectid);
4555 if (ret && ret != -ENOENT) {
4556 btrfs_abort_transaction(trans, ret);
4561 free_anon_bdev(dest->anon_dev);
4564 trans->block_rsv = NULL;
4565 trans->bytes_reserved = 0;
4566 ret = btrfs_end_transaction(trans);
4567 inode->i_flags |= S_DEAD;
4569 btrfs_subvolume_release_metadata(root, &block_rsv);
4571 up_write(&fs_info->subvol_sem);
4573 spin_lock(&dest->root_item_lock);
4574 root_flags = btrfs_root_flags(&dest->root_item);
4575 btrfs_set_root_flags(&dest->root_item,
4576 root_flags & ~BTRFS_ROOT_SUBVOL_DEAD);
4577 spin_unlock(&dest->root_item_lock);
4579 d_invalidate(dentry);
4580 btrfs_prune_dentries(dest);
4581 ASSERT(dest->send_in_progress == 0);
4587 static int btrfs_rmdir(struct inode *dir, struct dentry *dentry)
4589 struct inode *inode = d_inode(dentry);
4590 struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info;
4592 struct btrfs_trans_handle *trans;
4593 u64 last_unlink_trans;
4595 if (inode->i_size > BTRFS_EMPTY_DIR_SIZE)
4597 if (btrfs_ino(BTRFS_I(inode)) == BTRFS_FIRST_FREE_OBJECTID) {
4598 if (unlikely(btrfs_fs_incompat(fs_info, EXTENT_TREE_V2))) {
4600 "extent tree v2 doesn't support snapshot deletion yet");
4603 return btrfs_delete_subvolume(dir, dentry);
4606 trans = __unlink_start_trans(dir);
4608 return PTR_ERR(trans);
4610 if (unlikely(btrfs_ino(BTRFS_I(inode)) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)) {
4611 err = btrfs_unlink_subvol(trans, dir, dentry);
4615 err = btrfs_orphan_add(trans, BTRFS_I(inode));
4619 last_unlink_trans = BTRFS_I(inode)->last_unlink_trans;
4621 /* now the directory is empty */
4622 err = btrfs_unlink_inode(trans, BTRFS_I(dir),
4623 BTRFS_I(d_inode(dentry)), dentry->d_name.name,
4624 dentry->d_name.len);
4626 btrfs_i_size_write(BTRFS_I(inode), 0);
4628 * Propagate the last_unlink_trans value of the deleted dir to
4629 * its parent directory. This is to prevent an unrecoverable
4630 * log tree in the case we do something like this:
4632 * 2) create snapshot under dir foo
4633 * 3) delete the snapshot
4636 * 6) fsync foo or some file inside foo
4638 if (last_unlink_trans >= trans->transid)
4639 BTRFS_I(dir)->last_unlink_trans = last_unlink_trans;
4642 btrfs_end_transaction(trans);
4643 btrfs_btree_balance_dirty(fs_info);
4649 * btrfs_truncate_block - read, zero a chunk and write a block
4650 * @inode - inode that we're zeroing
4651 * @from - the offset to start zeroing
4652 * @len - the length to zero, 0 to zero the entire range respective to the
4654 * @front - zero up to the offset instead of from the offset on
4656 * This will find the block for the "from" offset and cow the block and zero the
4657 * part we want to zero. This is used with truncate and hole punching.
4659 int btrfs_truncate_block(struct btrfs_inode *inode, loff_t from, loff_t len,
4662 struct btrfs_fs_info *fs_info = inode->root->fs_info;
4663 struct address_space *mapping = inode->vfs_inode.i_mapping;
4664 struct extent_io_tree *io_tree = &inode->io_tree;
4665 struct btrfs_ordered_extent *ordered;
4666 struct extent_state *cached_state = NULL;
4667 struct extent_changeset *data_reserved = NULL;
4668 bool only_release_metadata = false;
4669 u32 blocksize = fs_info->sectorsize;
4670 pgoff_t index = from >> PAGE_SHIFT;
4671 unsigned offset = from & (blocksize - 1);
4673 gfp_t mask = btrfs_alloc_write_mask(mapping);
4674 size_t write_bytes = blocksize;
4679 if (IS_ALIGNED(offset, blocksize) &&
4680 (!len || IS_ALIGNED(len, blocksize)))
4683 block_start = round_down(from, blocksize);
4684 block_end = block_start + blocksize - 1;
4686 ret = btrfs_check_data_free_space(inode, &data_reserved, block_start,
4689 if (btrfs_check_nocow_lock(inode, block_start, &write_bytes) > 0) {
4690 /* For nocow case, no need to reserve data space */
4691 only_release_metadata = true;
4696 ret = btrfs_delalloc_reserve_metadata(inode, blocksize, blocksize);
4698 if (!only_release_metadata)
4699 btrfs_free_reserved_data_space(inode, data_reserved,
4700 block_start, blocksize);
4704 page = find_or_create_page(mapping, index, mask);
4706 btrfs_delalloc_release_space(inode, data_reserved, block_start,
4708 btrfs_delalloc_release_extents(inode, blocksize);
4712 ret = set_page_extent_mapped(page);
4716 if (!PageUptodate(page)) {
4717 ret = btrfs_readpage(NULL, page);
4719 if (page->mapping != mapping) {
4724 if (!PageUptodate(page)) {
4729 wait_on_page_writeback(page);
4731 lock_extent_bits(io_tree, block_start, block_end, &cached_state);
4733 ordered = btrfs_lookup_ordered_extent(inode, block_start);
4735 unlock_extent_cached(io_tree, block_start, block_end,
4739 btrfs_start_ordered_extent(ordered, 1);
4740 btrfs_put_ordered_extent(ordered);
4744 clear_extent_bit(&inode->io_tree, block_start, block_end,
4745 EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING | EXTENT_DEFRAG,
4746 0, 0, &cached_state);
4748 ret = btrfs_set_extent_delalloc(inode, block_start, block_end, 0,
4751 unlock_extent_cached(io_tree, block_start, block_end,
4756 if (offset != blocksize) {
4758 len = blocksize - offset;
4760 memzero_page(page, (block_start - page_offset(page)),
4763 memzero_page(page, (block_start - page_offset(page)) + offset,
4765 flush_dcache_page(page);
4767 btrfs_page_clear_checked(fs_info, page, block_start,
4768 block_end + 1 - block_start);
4769 btrfs_page_set_dirty(fs_info, page, block_start, block_end + 1 - block_start);
4770 unlock_extent_cached(io_tree, block_start, block_end, &cached_state);
4772 if (only_release_metadata)
4773 set_extent_bit(&inode->io_tree, block_start, block_end,
4774 EXTENT_NORESERVE, 0, NULL, NULL, GFP_NOFS, NULL);
4778 if (only_release_metadata)
4779 btrfs_delalloc_release_metadata(inode, blocksize, true);
4781 btrfs_delalloc_release_space(inode, data_reserved,
4782 block_start, blocksize, true);
4784 btrfs_delalloc_release_extents(inode, blocksize);
4788 if (only_release_metadata)
4789 btrfs_check_nocow_unlock(inode);
4790 extent_changeset_free(data_reserved);
4794 static int maybe_insert_hole(struct btrfs_root *root, struct btrfs_inode *inode,
4795 u64 offset, u64 len)
4797 struct btrfs_fs_info *fs_info = root->fs_info;
4798 struct btrfs_trans_handle *trans;
4799 struct btrfs_drop_extents_args drop_args = { 0 };
4803 * If NO_HOLES is enabled, we don't need to do anything.
4804 * Later, up in the call chain, either btrfs_set_inode_last_sub_trans()
4805 * or btrfs_update_inode() will be called, which guarantee that the next
4806 * fsync will know this inode was changed and needs to be logged.
4808 if (btrfs_fs_incompat(fs_info, NO_HOLES))
4812 * 1 - for the one we're dropping
4813 * 1 - for the one we're adding
4814 * 1 - for updating the inode.
4816 trans = btrfs_start_transaction(root, 3);
4818 return PTR_ERR(trans);
4820 drop_args.start = offset;
4821 drop_args.end = offset + len;
4822 drop_args.drop_cache = true;
4824 ret = btrfs_drop_extents(trans, root, inode, &drop_args);
4826 btrfs_abort_transaction(trans, ret);
4827 btrfs_end_transaction(trans);
4831 ret = btrfs_insert_file_extent(trans, root, btrfs_ino(inode),
4832 offset, 0, 0, len, 0, len, 0, 0, 0);
4834 btrfs_abort_transaction(trans, ret);
4836 btrfs_update_inode_bytes(inode, 0, drop_args.bytes_found);
4837 btrfs_update_inode(trans, root, inode);
4839 btrfs_end_transaction(trans);
4844 * This function puts in dummy file extents for the area we're creating a hole
4845 * for. So if we are truncating this file to a larger size we need to insert
4846 * these file extents so that btrfs_get_extent will return a EXTENT_MAP_HOLE for
4847 * the range between oldsize and size
4849 int btrfs_cont_expand(struct btrfs_inode *inode, loff_t oldsize, loff_t size)
4851 struct btrfs_root *root = inode->root;
4852 struct btrfs_fs_info *fs_info = root->fs_info;
4853 struct extent_io_tree *io_tree = &inode->io_tree;
4854 struct extent_map *em = NULL;
4855 struct extent_state *cached_state = NULL;
4856 struct extent_map_tree *em_tree = &inode->extent_tree;
4857 u64 hole_start = ALIGN(oldsize, fs_info->sectorsize);
4858 u64 block_end = ALIGN(size, fs_info->sectorsize);
4865 * If our size started in the middle of a block we need to zero out the
4866 * rest of the block before we expand the i_size, otherwise we could
4867 * expose stale data.
4869 err = btrfs_truncate_block(inode, oldsize, 0, 0);
4873 if (size <= hole_start)
4876 btrfs_lock_and_flush_ordered_range(inode, hole_start, block_end - 1,
4878 cur_offset = hole_start;
4880 em = btrfs_get_extent(inode, NULL, 0, cur_offset,
4881 block_end - cur_offset);
4887 last_byte = min(extent_map_end(em), block_end);
4888 last_byte = ALIGN(last_byte, fs_info->sectorsize);
4889 hole_size = last_byte - cur_offset;
4891 if (!test_bit(EXTENT_FLAG_PREALLOC, &em->flags)) {
4892 struct extent_map *hole_em;
4894 err = maybe_insert_hole(root, inode, cur_offset,
4899 err = btrfs_inode_set_file_extent_range(inode,
4900 cur_offset, hole_size);
4904 btrfs_drop_extent_cache(inode, cur_offset,
4905 cur_offset + hole_size - 1, 0);
4906 hole_em = alloc_extent_map();
4908 btrfs_set_inode_full_sync(inode);
4911 hole_em->start = cur_offset;
4912 hole_em->len = hole_size;
4913 hole_em->orig_start = cur_offset;
4915 hole_em->block_start = EXTENT_MAP_HOLE;
4916 hole_em->block_len = 0;
4917 hole_em->orig_block_len = 0;
4918 hole_em->ram_bytes = hole_size;
4919 hole_em->compress_type = BTRFS_COMPRESS_NONE;
4920 hole_em->generation = fs_info->generation;
4923 write_lock(&em_tree->lock);
4924 err = add_extent_mapping(em_tree, hole_em, 1);
4925 write_unlock(&em_tree->lock);
4928 btrfs_drop_extent_cache(inode, cur_offset,
4932 free_extent_map(hole_em);
4934 err = btrfs_inode_set_file_extent_range(inode,
4935 cur_offset, hole_size);
4940 free_extent_map(em);
4942 cur_offset = last_byte;
4943 if (cur_offset >= block_end)
4946 free_extent_map(em);
4947 unlock_extent_cached(io_tree, hole_start, block_end - 1, &cached_state);
4951 static int btrfs_setsize(struct inode *inode, struct iattr *attr)
4953 struct btrfs_root *root = BTRFS_I(inode)->root;
4954 struct btrfs_trans_handle *trans;
4955 loff_t oldsize = i_size_read(inode);
4956 loff_t newsize = attr->ia_size;
4957 int mask = attr->ia_valid;
4961 * The regular truncate() case without ATTR_CTIME and ATTR_MTIME is a
4962 * special case where we need to update the times despite not having
4963 * these flags set. For all other operations the VFS set these flags
4964 * explicitly if it wants a timestamp update.
4966 if (newsize != oldsize) {
4967 inode_inc_iversion(inode);
4968 if (!(mask & (ATTR_CTIME | ATTR_MTIME)))
4969 inode->i_ctime = inode->i_mtime =
4970 current_time(inode);
4973 if (newsize > oldsize) {
4975 * Don't do an expanding truncate while snapshotting is ongoing.
4976 * This is to ensure the snapshot captures a fully consistent
4977 * state of this file - if the snapshot captures this expanding
4978 * truncation, it must capture all writes that happened before
4981 btrfs_drew_write_lock(&root->snapshot_lock);
4982 ret = btrfs_cont_expand(BTRFS_I(inode), oldsize, newsize);
4984 btrfs_drew_write_unlock(&root->snapshot_lock);
4988 trans = btrfs_start_transaction(root, 1);
4989 if (IS_ERR(trans)) {
4990 btrfs_drew_write_unlock(&root->snapshot_lock);
4991 return PTR_ERR(trans);
4994 i_size_write(inode, newsize);
4995 btrfs_inode_safe_disk_i_size_write(BTRFS_I(inode), 0);
4996 pagecache_isize_extended(inode, oldsize, newsize);
4997 ret = btrfs_update_inode(trans, root, BTRFS_I(inode));
4998 btrfs_drew_write_unlock(&root->snapshot_lock);
4999 btrfs_end_transaction(trans);
5001 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
5003 if (btrfs_is_zoned(fs_info)) {
5004 ret = btrfs_wait_ordered_range(inode,
5005 ALIGN(newsize, fs_info->sectorsize),
5012 * We're truncating a file that used to have good data down to
5013 * zero. Make sure any new writes to the file get on disk
5017 set_bit(BTRFS_INODE_FLUSH_ON_CLOSE,
5018 &BTRFS_I(inode)->runtime_flags);
5020 truncate_setsize(inode, newsize);
5022 inode_dio_wait(inode);
5024 ret = btrfs_truncate(inode, newsize == oldsize);
5025 if (ret && inode->i_nlink) {
5029 * Truncate failed, so fix up the in-memory size. We
5030 * adjusted disk_i_size down as we removed extents, so
5031 * wait for disk_i_size to be stable and then update the
5032 * in-memory size to match.
5034 err = btrfs_wait_ordered_range(inode, 0, (u64)-1);
5037 i_size_write(inode, BTRFS_I(inode)->disk_i_size);
5044 static int btrfs_setattr(struct user_namespace *mnt_userns, struct dentry *dentry,
5047 struct inode *inode = d_inode(dentry);
5048 struct btrfs_root *root = BTRFS_I(inode)->root;
5051 if (btrfs_root_readonly(root))
5054 err = setattr_prepare(mnt_userns, dentry, attr);
5058 if (S_ISREG(inode->i_mode) && (attr->ia_valid & ATTR_SIZE)) {
5059 err = btrfs_setsize(inode, attr);
5064 if (attr->ia_valid) {
5065 setattr_copy(mnt_userns, inode, attr);
5066 inode_inc_iversion(inode);
5067 err = btrfs_dirty_inode(inode);
5069 if (!err && attr->ia_valid & ATTR_MODE)
5070 err = posix_acl_chmod(mnt_userns, inode, inode->i_mode);
5077 * While truncating the inode pages during eviction, we get the VFS
5078 * calling btrfs_invalidate_folio() against each folio of the inode. This
5079 * is slow because the calls to btrfs_invalidate_folio() result in a
5080 * huge amount of calls to lock_extent_bits() and clear_extent_bit(),
5081 * which keep merging and splitting extent_state structures over and over,
5082 * wasting lots of time.
5084 * Therefore if the inode is being evicted, let btrfs_invalidate_folio()
5085 * skip all those expensive operations on a per folio basis and do only
5086 * the ordered io finishing, while we release here the extent_map and
5087 * extent_state structures, without the excessive merging and splitting.
5089 static void evict_inode_truncate_pages(struct inode *inode)
5091 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
5092 struct extent_map_tree *map_tree = &BTRFS_I(inode)->extent_tree;
5093 struct rb_node *node;
5095 ASSERT(inode->i_state & I_FREEING);
5096 truncate_inode_pages_final(&inode->i_data);
5098 write_lock(&map_tree->lock);
5099 while (!RB_EMPTY_ROOT(&map_tree->map.rb_root)) {
5100 struct extent_map *em;
5102 node = rb_first_cached(&map_tree->map);
5103 em = rb_entry(node, struct extent_map, rb_node);
5104 clear_bit(EXTENT_FLAG_PINNED, &em->flags);
5105 clear_bit(EXTENT_FLAG_LOGGING, &em->flags);
5106 remove_extent_mapping(map_tree, em);
5107 free_extent_map(em);
5108 if (need_resched()) {
5109 write_unlock(&map_tree->lock);
5111 write_lock(&map_tree->lock);
5114 write_unlock(&map_tree->lock);
5117 * Keep looping until we have no more ranges in the io tree.
5118 * We can have ongoing bios started by readahead that have
5119 * their endio callback (extent_io.c:end_bio_extent_readpage)
5120 * still in progress (unlocked the pages in the bio but did not yet
5121 * unlocked the ranges in the io tree). Therefore this means some
5122 * ranges can still be locked and eviction started because before
5123 * submitting those bios, which are executed by a separate task (work
5124 * queue kthread), inode references (inode->i_count) were not taken
5125 * (which would be dropped in the end io callback of each bio).
5126 * Therefore here we effectively end up waiting for those bios and
5127 * anyone else holding locked ranges without having bumped the inode's
5128 * reference count - if we don't do it, when they access the inode's
5129 * io_tree to unlock a range it may be too late, leading to an
5130 * use-after-free issue.
5132 spin_lock(&io_tree->lock);
5133 while (!RB_EMPTY_ROOT(&io_tree->state)) {
5134 struct extent_state *state;
5135 struct extent_state *cached_state = NULL;
5138 unsigned state_flags;
5140 node = rb_first(&io_tree->state);
5141 state = rb_entry(node, struct extent_state, rb_node);
5142 start = state->start;
5144 state_flags = state->state;
5145 spin_unlock(&io_tree->lock);
5147 lock_extent_bits(io_tree, start, end, &cached_state);
5150 * If still has DELALLOC flag, the extent didn't reach disk,
5151 * and its reserved space won't be freed by delayed_ref.
5152 * So we need to free its reserved space here.
5153 * (Refer to comment in btrfs_invalidate_folio, case 2)
5155 * Note, end is the bytenr of last byte, so we need + 1 here.
5157 if (state_flags & EXTENT_DELALLOC)
5158 btrfs_qgroup_free_data(BTRFS_I(inode), NULL, start,
5161 clear_extent_bit(io_tree, start, end,
5162 EXTENT_LOCKED | EXTENT_DELALLOC |
5163 EXTENT_DO_ACCOUNTING | EXTENT_DEFRAG, 1, 1,
5167 spin_lock(&io_tree->lock);
5169 spin_unlock(&io_tree->lock);
5172 static struct btrfs_trans_handle *evict_refill_and_join(struct btrfs_root *root,
5173 struct btrfs_block_rsv *rsv)
5175 struct btrfs_fs_info *fs_info = root->fs_info;
5176 struct btrfs_trans_handle *trans;
5177 u64 delayed_refs_extra = btrfs_calc_insert_metadata_size(fs_info, 1);
5181 * Eviction should be taking place at some place safe because of our
5182 * delayed iputs. However the normal flushing code will run delayed
5183 * iputs, so we cannot use FLUSH_ALL otherwise we'll deadlock.
5185 * We reserve the delayed_refs_extra here again because we can't use
5186 * btrfs_start_transaction(root, 0) for the same deadlocky reason as
5187 * above. We reserve our extra bit here because we generate a ton of
5188 * delayed refs activity by truncating.
5190 * BTRFS_RESERVE_FLUSH_EVICT will steal from the global_rsv if it can,
5191 * if we fail to make this reservation we can re-try without the
5192 * delayed_refs_extra so we can make some forward progress.
5194 ret = btrfs_block_rsv_refill(fs_info, rsv, rsv->size + delayed_refs_extra,
5195 BTRFS_RESERVE_FLUSH_EVICT);
5197 ret = btrfs_block_rsv_refill(fs_info, rsv, rsv->size,
5198 BTRFS_RESERVE_FLUSH_EVICT);
5201 "could not allocate space for delete; will truncate on mount");
5202 return ERR_PTR(-ENOSPC);
5204 delayed_refs_extra = 0;
5207 trans = btrfs_join_transaction(root);
5211 if (delayed_refs_extra) {
5212 trans->block_rsv = &fs_info->trans_block_rsv;
5213 trans->bytes_reserved = delayed_refs_extra;
5214 btrfs_block_rsv_migrate(rsv, trans->block_rsv,
5215 delayed_refs_extra, 1);
5220 void btrfs_evict_inode(struct inode *inode)
5222 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
5223 struct btrfs_trans_handle *trans;
5224 struct btrfs_root *root = BTRFS_I(inode)->root;
5225 struct btrfs_block_rsv *rsv;
5228 trace_btrfs_inode_evict(inode);
5231 fsverity_cleanup_inode(inode);
5236 evict_inode_truncate_pages(inode);
5238 if (inode->i_nlink &&
5239 ((btrfs_root_refs(&root->root_item) != 0 &&
5240 root->root_key.objectid != BTRFS_ROOT_TREE_OBJECTID) ||
5241 btrfs_is_free_space_inode(BTRFS_I(inode))))
5244 if (is_bad_inode(inode))
5247 btrfs_free_io_failure_record(BTRFS_I(inode), 0, (u64)-1);
5249 if (test_bit(BTRFS_FS_LOG_RECOVERING, &fs_info->flags))
5252 if (inode->i_nlink > 0) {
5253 BUG_ON(btrfs_root_refs(&root->root_item) != 0 &&
5254 root->root_key.objectid != BTRFS_ROOT_TREE_OBJECTID);
5259 * This makes sure the inode item in tree is uptodate and the space for
5260 * the inode update is released.
5262 ret = btrfs_commit_inode_delayed_inode(BTRFS_I(inode));
5267 * This drops any pending insert or delete operations we have for this
5268 * inode. We could have a delayed dir index deletion queued up, but
5269 * we're removing the inode completely so that'll be taken care of in
5272 btrfs_kill_delayed_inode_items(BTRFS_I(inode));
5274 rsv = btrfs_alloc_block_rsv(fs_info, BTRFS_BLOCK_RSV_TEMP);
5277 rsv->size = btrfs_calc_metadata_size(fs_info, 1);
5280 btrfs_i_size_write(BTRFS_I(inode), 0);
5283 struct btrfs_truncate_control control = {
5284 .inode = BTRFS_I(inode),
5285 .ino = btrfs_ino(BTRFS_I(inode)),
5290 trans = evict_refill_and_join(root, rsv);
5294 trans->block_rsv = rsv;
5296 ret = btrfs_truncate_inode_items(trans, root, &control);
5297 trans->block_rsv = &fs_info->trans_block_rsv;
5298 btrfs_end_transaction(trans);
5299 btrfs_btree_balance_dirty(fs_info);
5300 if (ret && ret != -ENOSPC && ret != -EAGAIN)
5307 * Errors here aren't a big deal, it just means we leave orphan items in
5308 * the tree. They will be cleaned up on the next mount. If the inode
5309 * number gets reused, cleanup deletes the orphan item without doing
5310 * anything, and unlink reuses the existing orphan item.
5312 * If it turns out that we are dropping too many of these, we might want
5313 * to add a mechanism for retrying these after a commit.
5315 trans = evict_refill_and_join(root, rsv);
5316 if (!IS_ERR(trans)) {
5317 trans->block_rsv = rsv;
5318 btrfs_orphan_del(trans, BTRFS_I(inode));
5319 trans->block_rsv = &fs_info->trans_block_rsv;
5320 btrfs_end_transaction(trans);
5324 btrfs_free_block_rsv(fs_info, rsv);
5327 * If we didn't successfully delete, the orphan item will still be in
5328 * the tree and we'll retry on the next mount. Again, we might also want
5329 * to retry these periodically in the future.
5331 btrfs_remove_delayed_node(BTRFS_I(inode));
5332 fsverity_cleanup_inode(inode);
5337 * Return the key found in the dir entry in the location pointer, fill @type
5338 * with BTRFS_FT_*, and return 0.
5340 * If no dir entries were found, returns -ENOENT.
5341 * If found a corrupted location in dir entry, returns -EUCLEAN.
5343 static int btrfs_inode_by_name(struct inode *dir, struct dentry *dentry,
5344 struct btrfs_key *location, u8 *type)
5346 const char *name = dentry->d_name.name;
5347 int namelen = dentry->d_name.len;
5348 struct btrfs_dir_item *di;
5349 struct btrfs_path *path;
5350 struct btrfs_root *root = BTRFS_I(dir)->root;
5353 path = btrfs_alloc_path();
5357 di = btrfs_lookup_dir_item(NULL, root, path, btrfs_ino(BTRFS_I(dir)),
5359 if (IS_ERR_OR_NULL(di)) {
5360 ret = di ? PTR_ERR(di) : -ENOENT;
5364 btrfs_dir_item_key_to_cpu(path->nodes[0], di, location);
5365 if (location->type != BTRFS_INODE_ITEM_KEY &&
5366 location->type != BTRFS_ROOT_ITEM_KEY) {
5368 btrfs_warn(root->fs_info,
5369 "%s gets something invalid in DIR_ITEM (name %s, directory ino %llu, location(%llu %u %llu))",
5370 __func__, name, btrfs_ino(BTRFS_I(dir)),
5371 location->objectid, location->type, location->offset);
5374 *type = btrfs_dir_type(path->nodes[0], di);
5376 btrfs_free_path(path);
5381 * when we hit a tree root in a directory, the btrfs part of the inode
5382 * needs to be changed to reflect the root directory of the tree root. This
5383 * is kind of like crossing a mount point.
5385 static int fixup_tree_root_location(struct btrfs_fs_info *fs_info,
5387 struct dentry *dentry,
5388 struct btrfs_key *location,
5389 struct btrfs_root **sub_root)
5391 struct btrfs_path *path;
5392 struct btrfs_root *new_root;
5393 struct btrfs_root_ref *ref;
5394 struct extent_buffer *leaf;
5395 struct btrfs_key key;
5399 path = btrfs_alloc_path();
5406 key.objectid = BTRFS_I(dir)->root->root_key.objectid;
5407 key.type = BTRFS_ROOT_REF_KEY;
5408 key.offset = location->objectid;
5410 ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, path, 0, 0);
5417 leaf = path->nodes[0];
5418 ref = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_ref);
5419 if (btrfs_root_ref_dirid(leaf, ref) != btrfs_ino(BTRFS_I(dir)) ||
5420 btrfs_root_ref_name_len(leaf, ref) != dentry->d_name.len)
5423 ret = memcmp_extent_buffer(leaf, dentry->d_name.name,
5424 (unsigned long)(ref + 1),
5425 dentry->d_name.len);
5429 btrfs_release_path(path);
5431 new_root = btrfs_get_fs_root(fs_info, location->objectid, true);
5432 if (IS_ERR(new_root)) {
5433 err = PTR_ERR(new_root);
5437 *sub_root = new_root;
5438 location->objectid = btrfs_root_dirid(&new_root->root_item);
5439 location->type = BTRFS_INODE_ITEM_KEY;
5440 location->offset = 0;
5443 btrfs_free_path(path);
5447 static void inode_tree_add(struct inode *inode)
5449 struct btrfs_root *root = BTRFS_I(inode)->root;
5450 struct btrfs_inode *entry;
5452 struct rb_node *parent;
5453 struct rb_node *new = &BTRFS_I(inode)->rb_node;
5454 u64 ino = btrfs_ino(BTRFS_I(inode));
5456 if (inode_unhashed(inode))
5459 spin_lock(&root->inode_lock);
5460 p = &root->inode_tree.rb_node;
5463 entry = rb_entry(parent, struct btrfs_inode, rb_node);
5465 if (ino < btrfs_ino(entry))
5466 p = &parent->rb_left;
5467 else if (ino > btrfs_ino(entry))
5468 p = &parent->rb_right;
5470 WARN_ON(!(entry->vfs_inode.i_state &
5471 (I_WILL_FREE | I_FREEING)));
5472 rb_replace_node(parent, new, &root->inode_tree);
5473 RB_CLEAR_NODE(parent);
5474 spin_unlock(&root->inode_lock);
5478 rb_link_node(new, parent, p);
5479 rb_insert_color(new, &root->inode_tree);
5480 spin_unlock(&root->inode_lock);
5483 static void inode_tree_del(struct btrfs_inode *inode)
5485 struct btrfs_root *root = inode->root;
5488 spin_lock(&root->inode_lock);
5489 if (!RB_EMPTY_NODE(&inode->rb_node)) {
5490 rb_erase(&inode->rb_node, &root->inode_tree);
5491 RB_CLEAR_NODE(&inode->rb_node);
5492 empty = RB_EMPTY_ROOT(&root->inode_tree);
5494 spin_unlock(&root->inode_lock);
5496 if (empty && btrfs_root_refs(&root->root_item) == 0) {
5497 spin_lock(&root->inode_lock);
5498 empty = RB_EMPTY_ROOT(&root->inode_tree);
5499 spin_unlock(&root->inode_lock);
5501 btrfs_add_dead_root(root);
5506 static int btrfs_init_locked_inode(struct inode *inode, void *p)
5508 struct btrfs_iget_args *args = p;
5510 inode->i_ino = args->ino;
5511 BTRFS_I(inode)->location.objectid = args->ino;
5512 BTRFS_I(inode)->location.type = BTRFS_INODE_ITEM_KEY;
5513 BTRFS_I(inode)->location.offset = 0;
5514 BTRFS_I(inode)->root = btrfs_grab_root(args->root);
5515 BUG_ON(args->root && !BTRFS_I(inode)->root);
5519 static int btrfs_find_actor(struct inode *inode, void *opaque)
5521 struct btrfs_iget_args *args = opaque;
5523 return args->ino == BTRFS_I(inode)->location.objectid &&
5524 args->root == BTRFS_I(inode)->root;
5527 static struct inode *btrfs_iget_locked(struct super_block *s, u64 ino,
5528 struct btrfs_root *root)
5530 struct inode *inode;
5531 struct btrfs_iget_args args;
5532 unsigned long hashval = btrfs_inode_hash(ino, root);
5537 inode = iget5_locked(s, hashval, btrfs_find_actor,
5538 btrfs_init_locked_inode,
5544 * Get an inode object given its inode number and corresponding root.
5545 * Path can be preallocated to prevent recursing back to iget through
5546 * allocator. NULL is also valid but may require an additional allocation
5549 struct inode *btrfs_iget_path(struct super_block *s, u64 ino,
5550 struct btrfs_root *root, struct btrfs_path *path)
5552 struct inode *inode;
5554 inode = btrfs_iget_locked(s, ino, root);
5556 return ERR_PTR(-ENOMEM);
5558 if (inode->i_state & I_NEW) {
5561 ret = btrfs_read_locked_inode(inode, path);
5563 inode_tree_add(inode);
5564 unlock_new_inode(inode);
5568 * ret > 0 can come from btrfs_search_slot called by
5569 * btrfs_read_locked_inode, this means the inode item
5574 inode = ERR_PTR(ret);
5581 struct inode *btrfs_iget(struct super_block *s, u64 ino, struct btrfs_root *root)
5583 return btrfs_iget_path(s, ino, root, NULL);
5586 static struct inode *new_simple_dir(struct super_block *s,
5587 struct btrfs_key *key,
5588 struct btrfs_root *root)
5590 struct inode *inode = new_inode(s);
5593 return ERR_PTR(-ENOMEM);
5595 BTRFS_I(inode)->root = btrfs_grab_root(root);
5596 memcpy(&BTRFS_I(inode)->location, key, sizeof(*key));
5597 set_bit(BTRFS_INODE_DUMMY, &BTRFS_I(inode)->runtime_flags);
5599 inode->i_ino = BTRFS_EMPTY_SUBVOL_DIR_OBJECTID;
5601 * We only need lookup, the rest is read-only and there's no inode
5602 * associated with the dentry
5604 inode->i_op = &simple_dir_inode_operations;
5605 inode->i_opflags &= ~IOP_XATTR;
5606 inode->i_fop = &simple_dir_operations;
5607 inode->i_mode = S_IFDIR | S_IRUGO | S_IWUSR | S_IXUGO;
5608 inode->i_mtime = current_time(inode);
5609 inode->i_atime = inode->i_mtime;
5610 inode->i_ctime = inode->i_mtime;
5611 BTRFS_I(inode)->i_otime = inode->i_mtime;
5616 static_assert(BTRFS_FT_UNKNOWN == FT_UNKNOWN);
5617 static_assert(BTRFS_FT_REG_FILE == FT_REG_FILE);
5618 static_assert(BTRFS_FT_DIR == FT_DIR);
5619 static_assert(BTRFS_FT_CHRDEV == FT_CHRDEV);
5620 static_assert(BTRFS_FT_BLKDEV == FT_BLKDEV);
5621 static_assert(BTRFS_FT_FIFO == FT_FIFO);
5622 static_assert(BTRFS_FT_SOCK == FT_SOCK);
5623 static_assert(BTRFS_FT_SYMLINK == FT_SYMLINK);
5625 static inline u8 btrfs_inode_type(struct inode *inode)
5627 return fs_umode_to_ftype(inode->i_mode);
5630 struct inode *btrfs_lookup_dentry(struct inode *dir, struct dentry *dentry)
5632 struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
5633 struct inode *inode;
5634 struct btrfs_root *root = BTRFS_I(dir)->root;
5635 struct btrfs_root *sub_root = root;
5636 struct btrfs_key location;
5640 if (dentry->d_name.len > BTRFS_NAME_LEN)
5641 return ERR_PTR(-ENAMETOOLONG);
5643 ret = btrfs_inode_by_name(dir, dentry, &location, &di_type);
5645 return ERR_PTR(ret);
5647 if (location.type == BTRFS_INODE_ITEM_KEY) {
5648 inode = btrfs_iget(dir->i_sb, location.objectid, root);
5652 /* Do extra check against inode mode with di_type */
5653 if (btrfs_inode_type(inode) != di_type) {
5655 "inode mode mismatch with dir: inode mode=0%o btrfs type=%u dir type=%u",
5656 inode->i_mode, btrfs_inode_type(inode),
5659 return ERR_PTR(-EUCLEAN);
5664 ret = fixup_tree_root_location(fs_info, dir, dentry,
5665 &location, &sub_root);
5668 inode = ERR_PTR(ret);
5670 inode = new_simple_dir(dir->i_sb, &location, sub_root);
5672 inode = btrfs_iget(dir->i_sb, location.objectid, sub_root);
5674 if (root != sub_root)
5675 btrfs_put_root(sub_root);
5677 if (!IS_ERR(inode) && root != sub_root) {
5678 down_read(&fs_info->cleanup_work_sem);
5679 if (!sb_rdonly(inode->i_sb))
5680 ret = btrfs_orphan_cleanup(sub_root);
5681 up_read(&fs_info->cleanup_work_sem);
5684 inode = ERR_PTR(ret);
5691 static int btrfs_dentry_delete(const struct dentry *dentry)
5693 struct btrfs_root *root;
5694 struct inode *inode = d_inode(dentry);
5696 if (!inode && !IS_ROOT(dentry))
5697 inode = d_inode(dentry->d_parent);
5700 root = BTRFS_I(inode)->root;
5701 if (btrfs_root_refs(&root->root_item) == 0)
5704 if (btrfs_ino(BTRFS_I(inode)) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)
5710 static struct dentry *btrfs_lookup(struct inode *dir, struct dentry *dentry,
5713 struct inode *inode = btrfs_lookup_dentry(dir, dentry);
5715 if (inode == ERR_PTR(-ENOENT))
5717 return d_splice_alias(inode, dentry);
5721 * All this infrastructure exists because dir_emit can fault, and we are holding
5722 * the tree lock when doing readdir. For now just allocate a buffer and copy
5723 * our information into that, and then dir_emit from the buffer. This is
5724 * similar to what NFS does, only we don't keep the buffer around in pagecache
5725 * because I'm afraid I'll mess that up. Long term we need to make filldir do
5726 * copy_to_user_inatomic so we don't have to worry about page faulting under the
5729 static int btrfs_opendir(struct inode *inode, struct file *file)
5731 struct btrfs_file_private *private;
5733 private = kzalloc(sizeof(struct btrfs_file_private), GFP_KERNEL);
5736 private->filldir_buf = kzalloc(PAGE_SIZE, GFP_KERNEL);
5737 if (!private->filldir_buf) {
5741 file->private_data = private;
5752 static int btrfs_filldir(void *addr, int entries, struct dir_context *ctx)
5755 struct dir_entry *entry = addr;
5756 char *name = (char *)(entry + 1);
5758 ctx->pos = get_unaligned(&entry->offset);
5759 if (!dir_emit(ctx, name, get_unaligned(&entry->name_len),
5760 get_unaligned(&entry->ino),
5761 get_unaligned(&entry->type)))
5763 addr += sizeof(struct dir_entry) +
5764 get_unaligned(&entry->name_len);
5770 static int btrfs_real_readdir(struct file *file, struct dir_context *ctx)
5772 struct inode *inode = file_inode(file);
5773 struct btrfs_root *root = BTRFS_I(inode)->root;
5774 struct btrfs_file_private *private = file->private_data;
5775 struct btrfs_dir_item *di;
5776 struct btrfs_key key;
5777 struct btrfs_key found_key;
5778 struct btrfs_path *path;
5780 struct list_head ins_list;
5781 struct list_head del_list;
5783 struct extent_buffer *leaf;
5790 struct btrfs_key location;
5792 if (!dir_emit_dots(file, ctx))
5795 path = btrfs_alloc_path();
5799 addr = private->filldir_buf;
5800 path->reada = READA_FORWARD;
5802 INIT_LIST_HEAD(&ins_list);
5803 INIT_LIST_HEAD(&del_list);
5804 put = btrfs_readdir_get_delayed_items(inode, &ins_list, &del_list);
5807 key.type = BTRFS_DIR_INDEX_KEY;
5808 key.offset = ctx->pos;
5809 key.objectid = btrfs_ino(BTRFS_I(inode));
5811 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
5816 struct dir_entry *entry;
5818 leaf = path->nodes[0];
5819 slot = path->slots[0];
5820 if (slot >= btrfs_header_nritems(leaf)) {
5821 ret = btrfs_next_leaf(root, path);
5829 btrfs_item_key_to_cpu(leaf, &found_key, slot);
5831 if (found_key.objectid != key.objectid)
5833 if (found_key.type != BTRFS_DIR_INDEX_KEY)
5835 if (found_key.offset < ctx->pos)
5837 if (btrfs_should_delete_dir_index(&del_list, found_key.offset))
5839 di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item);
5840 name_len = btrfs_dir_name_len(leaf, di);
5841 if ((total_len + sizeof(struct dir_entry) + name_len) >=
5843 btrfs_release_path(path);
5844 ret = btrfs_filldir(private->filldir_buf, entries, ctx);
5847 addr = private->filldir_buf;
5854 put_unaligned(name_len, &entry->name_len);
5855 name_ptr = (char *)(entry + 1);
5856 read_extent_buffer(leaf, name_ptr, (unsigned long)(di + 1),
5858 put_unaligned(fs_ftype_to_dtype(btrfs_dir_type(leaf, di)),
5860 btrfs_dir_item_key_to_cpu(leaf, di, &location);
5861 put_unaligned(location.objectid, &entry->ino);
5862 put_unaligned(found_key.offset, &entry->offset);
5864 addr += sizeof(struct dir_entry) + name_len;
5865 total_len += sizeof(struct dir_entry) + name_len;
5869 btrfs_release_path(path);
5871 ret = btrfs_filldir(private->filldir_buf, entries, ctx);
5875 ret = btrfs_readdir_delayed_dir_index(ctx, &ins_list);
5880 * Stop new entries from being returned after we return the last
5883 * New directory entries are assigned a strictly increasing
5884 * offset. This means that new entries created during readdir
5885 * are *guaranteed* to be seen in the future by that readdir.
5886 * This has broken buggy programs which operate on names as
5887 * they're returned by readdir. Until we re-use freed offsets
5888 * we have this hack to stop new entries from being returned
5889 * under the assumption that they'll never reach this huge
5892 * This is being careful not to overflow 32bit loff_t unless the
5893 * last entry requires it because doing so has broken 32bit apps
5896 if (ctx->pos >= INT_MAX)
5897 ctx->pos = LLONG_MAX;
5904 btrfs_readdir_put_delayed_items(inode, &ins_list, &del_list);
5905 btrfs_free_path(path);
5910 * This is somewhat expensive, updating the tree every time the
5911 * inode changes. But, it is most likely to find the inode in cache.
5912 * FIXME, needs more benchmarking...there are no reasons other than performance
5913 * to keep or drop this code.
5915 static int btrfs_dirty_inode(struct inode *inode)
5917 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
5918 struct btrfs_root *root = BTRFS_I(inode)->root;
5919 struct btrfs_trans_handle *trans;
5922 if (test_bit(BTRFS_INODE_DUMMY, &BTRFS_I(inode)->runtime_flags))
5925 trans = btrfs_join_transaction(root);
5927 return PTR_ERR(trans);
5929 ret = btrfs_update_inode(trans, root, BTRFS_I(inode));
5930 if (ret && (ret == -ENOSPC || ret == -EDQUOT)) {
5931 /* whoops, lets try again with the full transaction */
5932 btrfs_end_transaction(trans);
5933 trans = btrfs_start_transaction(root, 1);
5935 return PTR_ERR(trans);
5937 ret = btrfs_update_inode(trans, root, BTRFS_I(inode));
5939 btrfs_end_transaction(trans);
5940 if (BTRFS_I(inode)->delayed_node)
5941 btrfs_balance_delayed_items(fs_info);
5947 * This is a copy of file_update_time. We need this so we can return error on
5948 * ENOSPC for updating the inode in the case of file write and mmap writes.
5950 static int btrfs_update_time(struct inode *inode, struct timespec64 *now,
5953 struct btrfs_root *root = BTRFS_I(inode)->root;
5954 bool dirty = flags & ~S_VERSION;
5956 if (btrfs_root_readonly(root))
5959 if (flags & S_VERSION)
5960 dirty |= inode_maybe_inc_iversion(inode, dirty);
5961 if (flags & S_CTIME)
5962 inode->i_ctime = *now;
5963 if (flags & S_MTIME)
5964 inode->i_mtime = *now;
5965 if (flags & S_ATIME)
5966 inode->i_atime = *now;
5967 return dirty ? btrfs_dirty_inode(inode) : 0;
5971 * find the highest existing sequence number in a directory
5972 * and then set the in-memory index_cnt variable to reflect
5973 * free sequence numbers
5975 static int btrfs_set_inode_index_count(struct btrfs_inode *inode)
5977 struct btrfs_root *root = inode->root;
5978 struct btrfs_key key, found_key;
5979 struct btrfs_path *path;
5980 struct extent_buffer *leaf;
5983 key.objectid = btrfs_ino(inode);
5984 key.type = BTRFS_DIR_INDEX_KEY;
5985 key.offset = (u64)-1;
5987 path = btrfs_alloc_path();
5991 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
5994 /* FIXME: we should be able to handle this */
5999 if (path->slots[0] == 0) {
6000 inode->index_cnt = BTRFS_DIR_START_INDEX;
6006 leaf = path->nodes[0];
6007 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
6009 if (found_key.objectid != btrfs_ino(inode) ||
6010 found_key.type != BTRFS_DIR_INDEX_KEY) {
6011 inode->index_cnt = BTRFS_DIR_START_INDEX;
6015 inode->index_cnt = found_key.offset + 1;
6017 btrfs_free_path(path);
6022 * helper to find a free sequence number in a given directory. This current
6023 * code is very simple, later versions will do smarter things in the btree
6025 int btrfs_set_inode_index(struct btrfs_inode *dir, u64 *index)
6029 if (dir->index_cnt == (u64)-1) {
6030 ret = btrfs_inode_delayed_dir_index_count(dir);
6032 ret = btrfs_set_inode_index_count(dir);
6038 *index = dir->index_cnt;
6044 static int btrfs_insert_inode_locked(struct inode *inode)
6046 struct btrfs_iget_args args;
6048 args.ino = BTRFS_I(inode)->location.objectid;
6049 args.root = BTRFS_I(inode)->root;
6051 return insert_inode_locked4(inode,
6052 btrfs_inode_hash(inode->i_ino, BTRFS_I(inode)->root),
6053 btrfs_find_actor, &args);
6057 * Inherit flags from the parent inode.
6059 * Currently only the compression flags and the cow flags are inherited.
6061 static void btrfs_inherit_iflags(struct inode *inode, struct inode *dir)
6068 flags = BTRFS_I(dir)->flags;
6070 if (flags & BTRFS_INODE_NOCOMPRESS) {
6071 BTRFS_I(inode)->flags &= ~BTRFS_INODE_COMPRESS;
6072 BTRFS_I(inode)->flags |= BTRFS_INODE_NOCOMPRESS;
6073 } else if (flags & BTRFS_INODE_COMPRESS) {
6074 BTRFS_I(inode)->flags &= ~BTRFS_INODE_NOCOMPRESS;
6075 BTRFS_I(inode)->flags |= BTRFS_INODE_COMPRESS;
6078 if (flags & BTRFS_INODE_NODATACOW) {
6079 BTRFS_I(inode)->flags |= BTRFS_INODE_NODATACOW;
6080 if (S_ISREG(inode->i_mode))
6081 BTRFS_I(inode)->flags |= BTRFS_INODE_NODATASUM;
6084 btrfs_sync_inode_flags_to_i_flags(inode);
6087 static struct inode *btrfs_new_inode(struct btrfs_trans_handle *trans,
6088 struct btrfs_root *root,
6089 struct user_namespace *mnt_userns,
6091 const char *name, int name_len,
6092 u64 ref_objectid, u64 objectid,
6093 umode_t mode, u64 *index)
6095 struct btrfs_fs_info *fs_info = root->fs_info;
6096 struct inode *inode;
6097 struct btrfs_inode_item *inode_item;
6098 struct btrfs_key *location;
6099 struct btrfs_path *path;
6100 struct btrfs_inode_ref *ref;
6101 struct btrfs_key key[2];
6103 struct btrfs_item_batch batch;
6105 unsigned int nofs_flag;
6108 path = btrfs_alloc_path();
6110 return ERR_PTR(-ENOMEM);
6112 nofs_flag = memalloc_nofs_save();
6113 inode = new_inode(fs_info->sb);
6114 memalloc_nofs_restore(nofs_flag);
6116 btrfs_free_path(path);
6117 return ERR_PTR(-ENOMEM);
6121 * O_TMPFILE, set link count to 0, so that after this point,
6122 * we fill in an inode item with the correct link count.
6125 set_nlink(inode, 0);
6128 * we have to initialize this early, so we can reclaim the inode
6129 * number if we fail afterwards in this function.
6131 inode->i_ino = objectid;
6134 trace_btrfs_inode_request(dir);
6136 ret = btrfs_set_inode_index(BTRFS_I(dir), index);
6138 btrfs_free_path(path);
6140 return ERR_PTR(ret);
6146 * index_cnt is ignored for everything but a dir,
6147 * btrfs_set_inode_index_count has an explanation for the magic
6150 BTRFS_I(inode)->index_cnt = 2;
6151 BTRFS_I(inode)->dir_index = *index;
6152 BTRFS_I(inode)->root = btrfs_grab_root(root);
6153 BTRFS_I(inode)->generation = trans->transid;
6154 inode->i_generation = BTRFS_I(inode)->generation;
6157 * We could have gotten an inode number from somebody who was fsynced
6158 * and then removed in this same transaction, so let's just set full
6159 * sync since it will be a full sync anyway and this will blow away the
6160 * old info in the log.
6162 btrfs_set_inode_full_sync(BTRFS_I(inode));
6164 key[0].objectid = objectid;
6165 key[0].type = BTRFS_INODE_ITEM_KEY;
6168 sizes[0] = sizeof(struct btrfs_inode_item);
6172 * Start new inodes with an inode_ref. This is slightly more
6173 * efficient for small numbers of hard links since they will
6174 * be packed into one item. Extended refs will kick in if we
6175 * add more hard links than can fit in the ref item.
6177 key[1].objectid = objectid;
6178 key[1].type = BTRFS_INODE_REF_KEY;
6179 key[1].offset = ref_objectid;
6181 sizes[1] = name_len + sizeof(*ref);
6184 location = &BTRFS_I(inode)->location;
6185 location->objectid = objectid;
6186 location->offset = 0;
6187 location->type = BTRFS_INODE_ITEM_KEY;
6189 ret = btrfs_insert_inode_locked(inode);
6195 batch.keys = &key[0];
6196 batch.data_sizes = &sizes[0];
6197 batch.total_data_size = sizes[0] + (name ? sizes[1] : 0);
6198 batch.nr = name ? 2 : 1;
6199 ret = btrfs_insert_empty_items(trans, root, path, &batch);
6203 inode_init_owner(mnt_userns, inode, dir, mode);
6204 inode_set_bytes(inode, 0);
6206 inode->i_mtime = current_time(inode);
6207 inode->i_atime = inode->i_mtime;
6208 inode->i_ctime = inode->i_mtime;
6209 BTRFS_I(inode)->i_otime = inode->i_mtime;
6211 inode_item = btrfs_item_ptr(path->nodes[0], path->slots[0],
6212 struct btrfs_inode_item);
6213 memzero_extent_buffer(path->nodes[0], (unsigned long)inode_item,
6214 sizeof(*inode_item));
6215 fill_inode_item(trans, path->nodes[0], inode_item, inode);
6218 ref = btrfs_item_ptr(path->nodes[0], path->slots[0] + 1,
6219 struct btrfs_inode_ref);
6220 btrfs_set_inode_ref_name_len(path->nodes[0], ref, name_len);
6221 btrfs_set_inode_ref_index(path->nodes[0], ref, *index);
6222 ptr = (unsigned long)(ref + 1);
6223 write_extent_buffer(path->nodes[0], name, ptr, name_len);
6226 btrfs_mark_buffer_dirty(path->nodes[0]);
6227 btrfs_free_path(path);
6229 btrfs_inherit_iflags(inode, dir);
6231 if (S_ISREG(mode)) {
6232 if (btrfs_test_opt(fs_info, NODATASUM))
6233 BTRFS_I(inode)->flags |= BTRFS_INODE_NODATASUM;
6234 if (btrfs_test_opt(fs_info, NODATACOW))
6235 BTRFS_I(inode)->flags |= BTRFS_INODE_NODATACOW |
6236 BTRFS_INODE_NODATASUM;
6239 inode_tree_add(inode);
6241 trace_btrfs_inode_new(inode);
6242 btrfs_set_inode_last_trans(trans, BTRFS_I(inode));
6244 btrfs_update_root_times(trans, root);
6246 ret = btrfs_inode_inherit_props(trans, inode, dir);
6249 "error inheriting props for ino %llu (root %llu): %d",
6250 btrfs_ino(BTRFS_I(inode)), root->root_key.objectid, ret);
6255 discard_new_inode(inode);
6258 BTRFS_I(dir)->index_cnt--;
6259 btrfs_free_path(path);
6260 return ERR_PTR(ret);
6264 * utility function to add 'inode' into 'parent_inode' with
6265 * a give name and a given sequence number.
6266 * if 'add_backref' is true, also insert a backref from the
6267 * inode to the parent directory.
6269 int btrfs_add_link(struct btrfs_trans_handle *trans,
6270 struct btrfs_inode *parent_inode, struct btrfs_inode *inode,
6271 const char *name, int name_len, int add_backref, u64 index)
6274 struct btrfs_key key;
6275 struct btrfs_root *root = parent_inode->root;
6276 u64 ino = btrfs_ino(inode);
6277 u64 parent_ino = btrfs_ino(parent_inode);
6279 if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) {
6280 memcpy(&key, &inode->root->root_key, sizeof(key));
6283 key.type = BTRFS_INODE_ITEM_KEY;
6287 if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) {
6288 ret = btrfs_add_root_ref(trans, key.objectid,
6289 root->root_key.objectid, parent_ino,
6290 index, name, name_len);
6291 } else if (add_backref) {
6292 ret = btrfs_insert_inode_ref(trans, root, name, name_len, ino,
6296 /* Nothing to clean up yet */
6300 ret = btrfs_insert_dir_item(trans, name, name_len, parent_inode, &key,
6301 btrfs_inode_type(&inode->vfs_inode), index);
6302 if (ret == -EEXIST || ret == -EOVERFLOW)
6305 btrfs_abort_transaction(trans, ret);
6309 btrfs_i_size_write(parent_inode, parent_inode->vfs_inode.i_size +
6311 inode_inc_iversion(&parent_inode->vfs_inode);
6313 * If we are replaying a log tree, we do not want to update the mtime
6314 * and ctime of the parent directory with the current time, since the
6315 * log replay procedure is responsible for setting them to their correct
6316 * values (the ones it had when the fsync was done).
6318 if (!test_bit(BTRFS_FS_LOG_RECOVERING, &root->fs_info->flags)) {
6319 struct timespec64 now = current_time(&parent_inode->vfs_inode);
6321 parent_inode->vfs_inode.i_mtime = now;
6322 parent_inode->vfs_inode.i_ctime = now;
6324 ret = btrfs_update_inode(trans, root, parent_inode);
6326 btrfs_abort_transaction(trans, ret);
6330 if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) {
6333 err = btrfs_del_root_ref(trans, key.objectid,
6334 root->root_key.objectid, parent_ino,
6335 &local_index, name, name_len);
6337 btrfs_abort_transaction(trans, err);
6338 } else if (add_backref) {
6342 err = btrfs_del_inode_ref(trans, root, name, name_len,
6343 ino, parent_ino, &local_index);
6345 btrfs_abort_transaction(trans, err);
6348 /* Return the original error code */
6352 static int btrfs_add_nondir(struct btrfs_trans_handle *trans,
6353 struct btrfs_inode *dir, struct dentry *dentry,
6354 struct btrfs_inode *inode, int backref, u64 index)
6356 int err = btrfs_add_link(trans, dir, inode,
6357 dentry->d_name.name, dentry->d_name.len,
6364 static int btrfs_mknod(struct user_namespace *mnt_userns, struct inode *dir,
6365 struct dentry *dentry, umode_t mode, dev_t rdev)
6367 struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
6368 struct btrfs_trans_handle *trans;
6369 struct btrfs_root *root = BTRFS_I(dir)->root;
6370 struct inode *inode = NULL;
6376 * 2 for inode item and ref
6378 * 1 for xattr if selinux is on
6380 trans = btrfs_start_transaction(root, 5);
6382 return PTR_ERR(trans);
6384 err = btrfs_get_free_objectid(root, &objectid);
6388 inode = btrfs_new_inode(trans, root, mnt_userns, dir,
6389 dentry->d_name.name, dentry->d_name.len,
6390 btrfs_ino(BTRFS_I(dir)), objectid, mode, &index);
6391 if (IS_ERR(inode)) {
6392 err = PTR_ERR(inode);
6398 * If the active LSM wants to access the inode during
6399 * d_instantiate it needs these. Smack checks to see
6400 * if the filesystem supports xattrs by looking at the
6403 inode->i_op = &btrfs_special_inode_operations;
6404 init_special_inode(inode, inode->i_mode, rdev);
6406 err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name);
6410 err = btrfs_add_nondir(trans, BTRFS_I(dir), dentry, BTRFS_I(inode),
6415 btrfs_update_inode(trans, root, BTRFS_I(inode));
6416 d_instantiate_new(dentry, inode);
6419 btrfs_end_transaction(trans);
6420 btrfs_btree_balance_dirty(fs_info);
6422 inode_dec_link_count(inode);
6423 discard_new_inode(inode);
6428 static int btrfs_create(struct user_namespace *mnt_userns, struct inode *dir,
6429 struct dentry *dentry, umode_t mode, bool excl)
6431 struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
6432 struct btrfs_trans_handle *trans;
6433 struct btrfs_root *root = BTRFS_I(dir)->root;
6434 struct inode *inode = NULL;
6440 * 2 for inode item and ref
6442 * 1 for xattr if selinux is on
6444 trans = btrfs_start_transaction(root, 5);
6446 return PTR_ERR(trans);
6448 err = btrfs_get_free_objectid(root, &objectid);
6452 inode = btrfs_new_inode(trans, root, mnt_userns, dir,
6453 dentry->d_name.name, dentry->d_name.len,
6454 btrfs_ino(BTRFS_I(dir)), objectid, mode, &index);
6455 if (IS_ERR(inode)) {
6456 err = PTR_ERR(inode);
6461 * If the active LSM wants to access the inode during
6462 * d_instantiate it needs these. Smack checks to see
6463 * if the filesystem supports xattrs by looking at the
6466 inode->i_fop = &btrfs_file_operations;
6467 inode->i_op = &btrfs_file_inode_operations;
6468 inode->i_mapping->a_ops = &btrfs_aops;
6470 err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name);
6474 err = btrfs_update_inode(trans, root, BTRFS_I(inode));
6478 err = btrfs_add_nondir(trans, BTRFS_I(dir), dentry, BTRFS_I(inode),
6483 d_instantiate_new(dentry, inode);
6486 btrfs_end_transaction(trans);
6488 inode_dec_link_count(inode);
6489 discard_new_inode(inode);
6491 btrfs_btree_balance_dirty(fs_info);
6495 static int btrfs_link(struct dentry *old_dentry, struct inode *dir,
6496 struct dentry *dentry)
6498 struct btrfs_trans_handle *trans = NULL;
6499 struct btrfs_root *root = BTRFS_I(dir)->root;
6500 struct inode *inode = d_inode(old_dentry);
6501 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
6506 /* do not allow sys_link's with other subvols of the same device */
6507 if (root->root_key.objectid != BTRFS_I(inode)->root->root_key.objectid)
6510 if (inode->i_nlink >= BTRFS_LINK_MAX)
6513 err = btrfs_set_inode_index(BTRFS_I(dir), &index);
6518 * 2 items for inode and inode ref
6519 * 2 items for dir items
6520 * 1 item for parent inode
6521 * 1 item for orphan item deletion if O_TMPFILE
6523 trans = btrfs_start_transaction(root, inode->i_nlink ? 5 : 6);
6524 if (IS_ERR(trans)) {
6525 err = PTR_ERR(trans);
6530 /* There are several dir indexes for this inode, clear the cache. */
6531 BTRFS_I(inode)->dir_index = 0ULL;
6533 inode_inc_iversion(inode);
6534 inode->i_ctime = current_time(inode);
6536 set_bit(BTRFS_INODE_COPY_EVERYTHING, &BTRFS_I(inode)->runtime_flags);
6538 err = btrfs_add_nondir(trans, BTRFS_I(dir), dentry, BTRFS_I(inode),
6544 struct dentry *parent = dentry->d_parent;
6546 err = btrfs_update_inode(trans, root, BTRFS_I(inode));
6549 if (inode->i_nlink == 1) {
6551 * If new hard link count is 1, it's a file created
6552 * with open(2) O_TMPFILE flag.
6554 err = btrfs_orphan_del(trans, BTRFS_I(inode));
6558 d_instantiate(dentry, inode);
6559 btrfs_log_new_name(trans, old_dentry, NULL, 0, parent);
6564 btrfs_end_transaction(trans);
6566 inode_dec_link_count(inode);
6569 btrfs_btree_balance_dirty(fs_info);
6573 static int btrfs_mkdir(struct user_namespace *mnt_userns, struct inode *dir,
6574 struct dentry *dentry, umode_t mode)
6576 struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
6577 struct inode *inode = NULL;
6578 struct btrfs_trans_handle *trans;
6579 struct btrfs_root *root = BTRFS_I(dir)->root;
6585 * 2 items for inode and ref
6586 * 2 items for dir items
6587 * 1 for xattr if selinux is on
6589 trans = btrfs_start_transaction(root, 5);
6591 return PTR_ERR(trans);
6593 err = btrfs_get_free_objectid(root, &objectid);
6597 inode = btrfs_new_inode(trans, root, mnt_userns, dir,
6598 dentry->d_name.name, dentry->d_name.len,
6599 btrfs_ino(BTRFS_I(dir)), objectid,
6600 S_IFDIR | mode, &index);
6601 if (IS_ERR(inode)) {
6602 err = PTR_ERR(inode);
6607 /* these must be set before we unlock the inode */
6608 inode->i_op = &btrfs_dir_inode_operations;
6609 inode->i_fop = &btrfs_dir_file_operations;
6611 err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name);
6615 btrfs_i_size_write(BTRFS_I(inode), 0);
6616 err = btrfs_update_inode(trans, root, BTRFS_I(inode));
6620 err = btrfs_add_link(trans, BTRFS_I(dir), BTRFS_I(inode),
6621 dentry->d_name.name,
6622 dentry->d_name.len, 0, index);
6626 d_instantiate_new(dentry, inode);
6629 btrfs_end_transaction(trans);
6631 inode_dec_link_count(inode);
6632 discard_new_inode(inode);
6634 btrfs_btree_balance_dirty(fs_info);
6638 static noinline int uncompress_inline(struct btrfs_path *path,
6640 size_t pg_offset, u64 extent_offset,
6641 struct btrfs_file_extent_item *item)
6644 struct extent_buffer *leaf = path->nodes[0];
6647 unsigned long inline_size;
6651 WARN_ON(pg_offset != 0);
6652 compress_type = btrfs_file_extent_compression(leaf, item);
6653 max_size = btrfs_file_extent_ram_bytes(leaf, item);
6654 inline_size = btrfs_file_extent_inline_item_len(leaf, path->slots[0]);
6655 tmp = kmalloc(inline_size, GFP_NOFS);
6658 ptr = btrfs_file_extent_inline_start(item);
6660 read_extent_buffer(leaf, tmp, ptr, inline_size);
6662 max_size = min_t(unsigned long, PAGE_SIZE, max_size);
6663 ret = btrfs_decompress(compress_type, tmp, page,
6664 extent_offset, inline_size, max_size);
6667 * decompression code contains a memset to fill in any space between the end
6668 * of the uncompressed data and the end of max_size in case the decompressed
6669 * data ends up shorter than ram_bytes. That doesn't cover the hole between
6670 * the end of an inline extent and the beginning of the next block, so we
6671 * cover that region here.
6674 if (max_size + pg_offset < PAGE_SIZE)
6675 memzero_page(page, pg_offset + max_size,
6676 PAGE_SIZE - max_size - pg_offset);
6682 * btrfs_get_extent - Lookup the first extent overlapping a range in a file.
6683 * @inode: file to search in
6684 * @page: page to read extent data into if the extent is inline
6685 * @pg_offset: offset into @page to copy to
6686 * @start: file offset
6687 * @len: length of range starting at @start
6689 * This returns the first &struct extent_map which overlaps with the given
6690 * range, reading it from the B-tree and caching it if necessary. Note that
6691 * there may be more extents which overlap the given range after the returned
6694 * If @page is not NULL and the extent is inline, this also reads the extent
6695 * data directly into the page and marks the extent up to date in the io_tree.
6697 * Return: ERR_PTR on error, non-NULL extent_map on success.
6699 struct extent_map *btrfs_get_extent(struct btrfs_inode *inode,
6700 struct page *page, size_t pg_offset,
6703 struct btrfs_fs_info *fs_info = inode->root->fs_info;
6705 u64 extent_start = 0;
6707 u64 objectid = btrfs_ino(inode);
6708 int extent_type = -1;
6709 struct btrfs_path *path = NULL;
6710 struct btrfs_root *root = inode->root;
6711 struct btrfs_file_extent_item *item;
6712 struct extent_buffer *leaf;
6713 struct btrfs_key found_key;
6714 struct extent_map *em = NULL;
6715 struct extent_map_tree *em_tree = &inode->extent_tree;
6716 struct extent_io_tree *io_tree = &inode->io_tree;
6718 read_lock(&em_tree->lock);
6719 em = lookup_extent_mapping(em_tree, start, len);
6720 read_unlock(&em_tree->lock);
6723 if (em->start > start || em->start + em->len <= start)
6724 free_extent_map(em);
6725 else if (em->block_start == EXTENT_MAP_INLINE && page)
6726 free_extent_map(em);
6730 em = alloc_extent_map();
6735 em->start = EXTENT_MAP_HOLE;
6736 em->orig_start = EXTENT_MAP_HOLE;
6738 em->block_len = (u64)-1;
6740 path = btrfs_alloc_path();
6746 /* Chances are we'll be called again, so go ahead and do readahead */
6747 path->reada = READA_FORWARD;
6750 * The same explanation in load_free_space_cache applies here as well,
6751 * we only read when we're loading the free space cache, and at that
6752 * point the commit_root has everything we need.
6754 if (btrfs_is_free_space_inode(inode)) {
6755 path->search_commit_root = 1;
6756 path->skip_locking = 1;
6759 ret = btrfs_lookup_file_extent(NULL, root, path, objectid, start, 0);
6762 } else if (ret > 0) {
6763 if (path->slots[0] == 0)
6769 leaf = path->nodes[0];
6770 item = btrfs_item_ptr(leaf, path->slots[0],
6771 struct btrfs_file_extent_item);
6772 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
6773 if (found_key.objectid != objectid ||
6774 found_key.type != BTRFS_EXTENT_DATA_KEY) {
6776 * If we backup past the first extent we want to move forward
6777 * and see if there is an extent in front of us, otherwise we'll
6778 * say there is a hole for our whole search range which can
6785 extent_type = btrfs_file_extent_type(leaf, item);
6786 extent_start = found_key.offset;
6787 extent_end = btrfs_file_extent_end(path);
6788 if (extent_type == BTRFS_FILE_EXTENT_REG ||
6789 extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
6790 /* Only regular file could have regular/prealloc extent */
6791 if (!S_ISREG(inode->vfs_inode.i_mode)) {
6794 "regular/prealloc extent found for non-regular inode %llu",
6798 trace_btrfs_get_extent_show_fi_regular(inode, leaf, item,
6800 } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
6801 trace_btrfs_get_extent_show_fi_inline(inode, leaf, item,
6806 if (start >= extent_end) {
6808 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
6809 ret = btrfs_next_leaf(root, path);
6815 leaf = path->nodes[0];
6817 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
6818 if (found_key.objectid != objectid ||
6819 found_key.type != BTRFS_EXTENT_DATA_KEY)
6821 if (start + len <= found_key.offset)
6823 if (start > found_key.offset)
6826 /* New extent overlaps with existing one */
6828 em->orig_start = start;
6829 em->len = found_key.offset - start;
6830 em->block_start = EXTENT_MAP_HOLE;
6834 btrfs_extent_item_to_extent_map(inode, path, item, !page, em);
6836 if (extent_type == BTRFS_FILE_EXTENT_REG ||
6837 extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
6839 } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
6843 size_t extent_offset;
6849 size = btrfs_file_extent_ram_bytes(leaf, item);
6850 extent_offset = page_offset(page) + pg_offset - extent_start;
6851 copy_size = min_t(u64, PAGE_SIZE - pg_offset,
6852 size - extent_offset);
6853 em->start = extent_start + extent_offset;
6854 em->len = ALIGN(copy_size, fs_info->sectorsize);
6855 em->orig_block_len = em->len;
6856 em->orig_start = em->start;
6857 ptr = btrfs_file_extent_inline_start(item) + extent_offset;
6859 if (!PageUptodate(page)) {
6860 if (btrfs_file_extent_compression(leaf, item) !=
6861 BTRFS_COMPRESS_NONE) {
6862 ret = uncompress_inline(path, page, pg_offset,
6863 extent_offset, item);
6867 map = kmap_local_page(page);
6868 read_extent_buffer(leaf, map + pg_offset, ptr,
6870 if (pg_offset + copy_size < PAGE_SIZE) {
6871 memset(map + pg_offset + copy_size, 0,
6872 PAGE_SIZE - pg_offset -
6877 flush_dcache_page(page);
6879 set_extent_uptodate(io_tree, em->start,
6880 extent_map_end(em) - 1, NULL, GFP_NOFS);
6885 em->orig_start = start;
6887 em->block_start = EXTENT_MAP_HOLE;
6890 btrfs_release_path(path);
6891 if (em->start > start || extent_map_end(em) <= start) {
6893 "bad extent! em: [%llu %llu] passed [%llu %llu]",
6894 em->start, em->len, start, len);
6899 write_lock(&em_tree->lock);
6900 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, start, len);
6901 write_unlock(&em_tree->lock);
6903 btrfs_free_path(path);
6905 trace_btrfs_get_extent(root, inode, em);
6908 free_extent_map(em);
6909 return ERR_PTR(ret);
6914 struct extent_map *btrfs_get_extent_fiemap(struct btrfs_inode *inode,
6917 struct extent_map *em;
6918 struct extent_map *hole_em = NULL;
6919 u64 delalloc_start = start;
6925 em = btrfs_get_extent(inode, NULL, 0, start, len);
6929 * If our em maps to:
6931 * - a pre-alloc extent,
6932 * there might actually be delalloc bytes behind it.
6934 if (em->block_start != EXTENT_MAP_HOLE &&
6935 !test_bit(EXTENT_FLAG_PREALLOC, &em->flags))
6940 /* check to see if we've wrapped (len == -1 or similar) */
6949 /* ok, we didn't find anything, lets look for delalloc */
6950 delalloc_len = count_range_bits(&inode->io_tree, &delalloc_start,
6951 end, len, EXTENT_DELALLOC, 1);
6952 delalloc_end = delalloc_start + delalloc_len;
6953 if (delalloc_end < delalloc_start)
6954 delalloc_end = (u64)-1;
6957 * We didn't find anything useful, return the original results from
6960 if (delalloc_start > end || delalloc_end <= start) {
6967 * Adjust the delalloc_start to make sure it doesn't go backwards from
6968 * the start they passed in
6970 delalloc_start = max(start, delalloc_start);
6971 delalloc_len = delalloc_end - delalloc_start;
6973 if (delalloc_len > 0) {
6976 const u64 hole_end = extent_map_end(hole_em);
6978 em = alloc_extent_map();
6986 * When btrfs_get_extent can't find anything it returns one
6989 * Make sure what it found really fits our range, and adjust to
6990 * make sure it is based on the start from the caller
6992 if (hole_end <= start || hole_em->start > end) {
6993 free_extent_map(hole_em);
6996 hole_start = max(hole_em->start, start);
6997 hole_len = hole_end - hole_start;
7000 if (hole_em && delalloc_start > hole_start) {
7002 * Our hole starts before our delalloc, so we have to
7003 * return just the parts of the hole that go until the
7006 em->len = min(hole_len, delalloc_start - hole_start);
7007 em->start = hole_start;
7008 em->orig_start = hole_start;
7010 * Don't adjust block start at all, it is fixed at
7013 em->block_start = hole_em->block_start;
7014 em->block_len = hole_len;
7015 if (test_bit(EXTENT_FLAG_PREALLOC, &hole_em->flags))
7016 set_bit(EXTENT_FLAG_PREALLOC, &em->flags);
7019 * Hole is out of passed range or it starts after
7022 em->start = delalloc_start;
7023 em->len = delalloc_len;
7024 em->orig_start = delalloc_start;
7025 em->block_start = EXTENT_MAP_DELALLOC;
7026 em->block_len = delalloc_len;
7033 free_extent_map(hole_em);
7035 free_extent_map(em);
7036 return ERR_PTR(err);
7041 static struct extent_map *btrfs_create_dio_extent(struct btrfs_inode *inode,
7044 const u64 orig_start,
7045 const u64 block_start,
7046 const u64 block_len,
7047 const u64 orig_block_len,
7048 const u64 ram_bytes,
7051 struct extent_map *em = NULL;
7054 if (type != BTRFS_ORDERED_NOCOW) {
7055 em = create_io_em(inode, start, len, orig_start, block_start,
7056 block_len, orig_block_len, ram_bytes,
7057 BTRFS_COMPRESS_NONE, /* compress_type */
7062 ret = btrfs_add_ordered_extent(inode, start, len, len, block_start,
7065 (1 << BTRFS_ORDERED_DIRECT),
7066 BTRFS_COMPRESS_NONE);
7069 free_extent_map(em);
7070 btrfs_drop_extent_cache(inode, start, start + len - 1, 0);
7079 static struct extent_map *btrfs_new_extent_direct(struct btrfs_inode *inode,
7082 struct btrfs_root *root = inode->root;
7083 struct btrfs_fs_info *fs_info = root->fs_info;
7084 struct extent_map *em;
7085 struct btrfs_key ins;
7089 alloc_hint = get_extent_allocation_hint(inode, start, len);
7090 ret = btrfs_reserve_extent(root, len, len, fs_info->sectorsize,
7091 0, alloc_hint, &ins, 1, 1);
7093 return ERR_PTR(ret);
7095 em = btrfs_create_dio_extent(inode, start, ins.offset, start,
7096 ins.objectid, ins.offset, ins.offset,
7097 ins.offset, BTRFS_ORDERED_REGULAR);
7098 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
7100 btrfs_free_reserved_extent(fs_info, ins.objectid, ins.offset,
7106 static bool btrfs_extent_readonly(struct btrfs_fs_info *fs_info, u64 bytenr)
7108 struct btrfs_block_group *block_group;
7109 bool readonly = false;
7111 block_group = btrfs_lookup_block_group(fs_info, bytenr);
7112 if (!block_group || block_group->ro)
7115 btrfs_put_block_group(block_group);
7120 * Check if we can do nocow write into the range [@offset, @offset + @len)
7122 * @offset: File offset
7123 * @len: The length to write, will be updated to the nocow writeable
7125 * @orig_start: (optional) Return the original file offset of the file extent
7126 * @orig_len: (optional) Return the original on-disk length of the file extent
7127 * @ram_bytes: (optional) Return the ram_bytes of the file extent
7128 * @strict: if true, omit optimizations that might force us into unnecessary
7129 * cow. e.g., don't trust generation number.
7132 * >0 and update @len if we can do nocow write
7133 * 0 if we can't do nocow write
7134 * <0 if error happened
7136 * NOTE: This only checks the file extents, caller is responsible to wait for
7137 * any ordered extents.
7139 noinline int can_nocow_extent(struct inode *inode, u64 offset, u64 *len,
7140 u64 *orig_start, u64 *orig_block_len,
7141 u64 *ram_bytes, bool strict)
7143 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
7144 struct btrfs_path *path;
7146 struct extent_buffer *leaf;
7147 struct btrfs_root *root = BTRFS_I(inode)->root;
7148 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
7149 struct btrfs_file_extent_item *fi;
7150 struct btrfs_key key;
7157 bool nocow = (BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW);
7159 path = btrfs_alloc_path();
7163 ret = btrfs_lookup_file_extent(NULL, root, path,
7164 btrfs_ino(BTRFS_I(inode)), offset, 0);
7168 slot = path->slots[0];
7171 /* can't find the item, must cow */
7178 leaf = path->nodes[0];
7179 btrfs_item_key_to_cpu(leaf, &key, slot);
7180 if (key.objectid != btrfs_ino(BTRFS_I(inode)) ||
7181 key.type != BTRFS_EXTENT_DATA_KEY) {
7182 /* not our file or wrong item type, must cow */
7186 if (key.offset > offset) {
7187 /* Wrong offset, must cow */
7191 fi = btrfs_item_ptr(leaf, slot, struct btrfs_file_extent_item);
7192 found_type = btrfs_file_extent_type(leaf, fi);
7193 if (found_type != BTRFS_FILE_EXTENT_REG &&
7194 found_type != BTRFS_FILE_EXTENT_PREALLOC) {
7195 /* not a regular extent, must cow */
7199 if (!nocow && found_type == BTRFS_FILE_EXTENT_REG)
7202 extent_end = key.offset + btrfs_file_extent_num_bytes(leaf, fi);
7203 if (extent_end <= offset)
7206 disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
7207 if (disk_bytenr == 0)
7210 if (btrfs_file_extent_compression(leaf, fi) ||
7211 btrfs_file_extent_encryption(leaf, fi) ||
7212 btrfs_file_extent_other_encoding(leaf, fi))
7216 * Do the same check as in btrfs_cross_ref_exist but without the
7217 * unnecessary search.
7220 (btrfs_file_extent_generation(leaf, fi) <=
7221 btrfs_root_last_snapshot(&root->root_item)))
7224 backref_offset = btrfs_file_extent_offset(leaf, fi);
7227 *orig_start = key.offset - backref_offset;
7228 *orig_block_len = btrfs_file_extent_disk_num_bytes(leaf, fi);
7229 *ram_bytes = btrfs_file_extent_ram_bytes(leaf, fi);
7232 if (btrfs_extent_readonly(fs_info, disk_bytenr))
7235 num_bytes = min(offset + *len, extent_end) - offset;
7236 if (!nocow && found_type == BTRFS_FILE_EXTENT_PREALLOC) {
7239 range_end = round_up(offset + num_bytes,
7240 root->fs_info->sectorsize) - 1;
7241 ret = test_range_bit(io_tree, offset, range_end,
7242 EXTENT_DELALLOC, 0, NULL);
7249 btrfs_release_path(path);
7252 * look for other files referencing this extent, if we
7253 * find any we must cow
7256 ret = btrfs_cross_ref_exist(root, btrfs_ino(BTRFS_I(inode)),
7257 key.offset - backref_offset, disk_bytenr,
7265 * adjust disk_bytenr and num_bytes to cover just the bytes
7266 * in this extent we are about to write. If there
7267 * are any csums in that range we have to cow in order
7268 * to keep the csums correct
7270 disk_bytenr += backref_offset;
7271 disk_bytenr += offset - key.offset;
7272 if (csum_exist_in_range(fs_info, disk_bytenr, num_bytes))
7275 * all of the above have passed, it is safe to overwrite this extent
7281 btrfs_free_path(path);
7285 static int lock_extent_direct(struct inode *inode, u64 lockstart, u64 lockend,
7286 struct extent_state **cached_state, bool writing)
7288 struct btrfs_ordered_extent *ordered;
7292 lock_extent_bits(&BTRFS_I(inode)->io_tree, lockstart, lockend,
7295 * We're concerned with the entire range that we're going to be
7296 * doing DIO to, so we need to make sure there's no ordered
7297 * extents in this range.
7299 ordered = btrfs_lookup_ordered_range(BTRFS_I(inode), lockstart,
7300 lockend - lockstart + 1);
7303 * We need to make sure there are no buffered pages in this
7304 * range either, we could have raced between the invalidate in
7305 * generic_file_direct_write and locking the extent. The
7306 * invalidate needs to happen so that reads after a write do not
7310 (!writing || !filemap_range_has_page(inode->i_mapping,
7311 lockstart, lockend)))
7314 unlock_extent_cached(&BTRFS_I(inode)->io_tree, lockstart, lockend,
7319 * If we are doing a DIO read and the ordered extent we
7320 * found is for a buffered write, we can not wait for it
7321 * to complete and retry, because if we do so we can
7322 * deadlock with concurrent buffered writes on page
7323 * locks. This happens only if our DIO read covers more
7324 * than one extent map, if at this point has already
7325 * created an ordered extent for a previous extent map
7326 * and locked its range in the inode's io tree, and a
7327 * concurrent write against that previous extent map's
7328 * range and this range started (we unlock the ranges
7329 * in the io tree only when the bios complete and
7330 * buffered writes always lock pages before attempting
7331 * to lock range in the io tree).
7334 test_bit(BTRFS_ORDERED_DIRECT, &ordered->flags))
7335 btrfs_start_ordered_extent(ordered, 1);
7338 btrfs_put_ordered_extent(ordered);
7341 * We could trigger writeback for this range (and wait
7342 * for it to complete) and then invalidate the pages for
7343 * this range (through invalidate_inode_pages2_range()),
7344 * but that can lead us to a deadlock with a concurrent
7345 * call to readahead (a buffered read or a defrag call
7346 * triggered a readahead) on a page lock due to an
7347 * ordered dio extent we created before but did not have
7348 * yet a corresponding bio submitted (whence it can not
7349 * complete), which makes readahead wait for that
7350 * ordered extent to complete while holding a lock on
7365 /* The callers of this must take lock_extent() */
7366 static struct extent_map *create_io_em(struct btrfs_inode *inode, u64 start,
7367 u64 len, u64 orig_start, u64 block_start,
7368 u64 block_len, u64 orig_block_len,
7369 u64 ram_bytes, int compress_type,
7372 struct extent_map_tree *em_tree;
7373 struct extent_map *em;
7376 ASSERT(type == BTRFS_ORDERED_PREALLOC ||
7377 type == BTRFS_ORDERED_COMPRESSED ||
7378 type == BTRFS_ORDERED_NOCOW ||
7379 type == BTRFS_ORDERED_REGULAR);
7381 em_tree = &inode->extent_tree;
7382 em = alloc_extent_map();
7384 return ERR_PTR(-ENOMEM);
7387 em->orig_start = orig_start;
7389 em->block_len = block_len;
7390 em->block_start = block_start;
7391 em->orig_block_len = orig_block_len;
7392 em->ram_bytes = ram_bytes;
7393 em->generation = -1;
7394 set_bit(EXTENT_FLAG_PINNED, &em->flags);
7395 if (type == BTRFS_ORDERED_PREALLOC) {
7396 set_bit(EXTENT_FLAG_FILLING, &em->flags);
7397 } else if (type == BTRFS_ORDERED_COMPRESSED) {
7398 set_bit(EXTENT_FLAG_COMPRESSED, &em->flags);
7399 em->compress_type = compress_type;
7403 btrfs_drop_extent_cache(inode, em->start,
7404 em->start + em->len - 1, 0);
7405 write_lock(&em_tree->lock);
7406 ret = add_extent_mapping(em_tree, em, 1);
7407 write_unlock(&em_tree->lock);
7409 * The caller has taken lock_extent(), who could race with us
7412 } while (ret == -EEXIST);
7415 free_extent_map(em);
7416 return ERR_PTR(ret);
7419 /* em got 2 refs now, callers needs to do free_extent_map once. */
7424 static int btrfs_get_blocks_direct_write(struct extent_map **map,
7425 struct inode *inode,
7426 struct btrfs_dio_data *dio_data,
7429 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
7430 struct extent_map *em = *map;
7432 u64 block_start, orig_start, orig_block_len, ram_bytes;
7433 bool can_nocow = false;
7434 bool space_reserved = false;
7439 * We don't allocate a new extent in the following cases
7441 * 1) The inode is marked as NODATACOW. In this case we'll just use the
7443 * 2) The extent is marked as PREALLOC. We're good to go here and can
7444 * just use the extent.
7447 if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags) ||
7448 ((BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW) &&
7449 em->block_start != EXTENT_MAP_HOLE)) {
7450 if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags))
7451 type = BTRFS_ORDERED_PREALLOC;
7453 type = BTRFS_ORDERED_NOCOW;
7454 len = min(len, em->len - (start - em->start));
7455 block_start = em->block_start + (start - em->start);
7457 if (can_nocow_extent(inode, start, &len, &orig_start,
7458 &orig_block_len, &ram_bytes, false) == 1 &&
7459 btrfs_inc_nocow_writers(fs_info, block_start))
7465 struct extent_map *em2;
7467 /* We can NOCOW, so only need to reserve metadata space. */
7468 ret = btrfs_delalloc_reserve_metadata(BTRFS_I(inode), len, len);
7470 /* Our caller expects us to free the input extent map. */
7471 free_extent_map(em);
7473 btrfs_dec_nocow_writers(fs_info, block_start);
7476 space_reserved = true;
7478 em2 = btrfs_create_dio_extent(BTRFS_I(inode), start, len,
7479 orig_start, block_start,
7480 len, orig_block_len,
7482 btrfs_dec_nocow_writers(fs_info, block_start);
7483 if (type == BTRFS_ORDERED_PREALLOC) {
7484 free_extent_map(em);
7493 /* Our caller expects us to free the input extent map. */
7494 free_extent_map(em);
7497 /* We have to COW, so need to reserve metadata and data space. */
7498 ret = btrfs_delalloc_reserve_space(BTRFS_I(inode),
7499 &dio_data->data_reserved,
7503 space_reserved = true;
7505 em = btrfs_new_extent_direct(BTRFS_I(inode), start, len);
7511 len = min(len, em->len - (start - em->start));
7513 btrfs_delalloc_release_space(BTRFS_I(inode),
7514 dio_data->data_reserved,
7515 start + len, prev_len - len,
7520 * We have created our ordered extent, so we can now release our reservation
7521 * for an outstanding extent.
7523 btrfs_delalloc_release_extents(BTRFS_I(inode), prev_len);
7526 * Need to update the i_size under the extent lock so buffered
7527 * readers will get the updated i_size when we unlock.
7529 if (start + len > i_size_read(inode))
7530 i_size_write(inode, start + len);
7532 if (ret && space_reserved) {
7533 btrfs_delalloc_release_extents(BTRFS_I(inode), len);
7535 btrfs_delalloc_release_metadata(BTRFS_I(inode), len, true);
7537 btrfs_delalloc_release_space(BTRFS_I(inode),
7538 dio_data->data_reserved,
7540 extent_changeset_free(dio_data->data_reserved);
7541 dio_data->data_reserved = NULL;
7547 static int btrfs_dio_iomap_begin(struct inode *inode, loff_t start,
7548 loff_t length, unsigned int flags, struct iomap *iomap,
7549 struct iomap *srcmap)
7551 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
7552 struct extent_map *em;
7553 struct extent_state *cached_state = NULL;
7554 struct btrfs_dio_data *dio_data = NULL;
7555 u64 lockstart, lockend;
7556 const bool write = !!(flags & IOMAP_WRITE);
7559 bool unlock_extents = false;
7562 len = min_t(u64, len, fs_info->sectorsize);
7565 lockend = start + len - 1;
7568 * The generic stuff only does filemap_write_and_wait_range, which
7569 * isn't enough if we've written compressed pages to this area, so we
7570 * need to flush the dirty pages again to make absolutely sure that any
7571 * outstanding dirty pages are on disk.
7573 if (test_bit(BTRFS_INODE_HAS_ASYNC_EXTENT,
7574 &BTRFS_I(inode)->runtime_flags)) {
7575 ret = filemap_fdatawrite_range(inode->i_mapping, start,
7576 start + length - 1);
7581 dio_data = kzalloc(sizeof(*dio_data), GFP_NOFS);
7585 iomap->private = dio_data;
7589 * If this errors out it's because we couldn't invalidate pagecache for
7590 * this range and we need to fallback to buffered.
7592 if (lock_extent_direct(inode, lockstart, lockend, &cached_state, write)) {
7597 em = btrfs_get_extent(BTRFS_I(inode), NULL, 0, start, len);
7604 * Ok for INLINE and COMPRESSED extents we need to fallback on buffered
7605 * io. INLINE is special, and we could probably kludge it in here, but
7606 * it's still buffered so for safety lets just fall back to the generic
7609 * For COMPRESSED we _have_ to read the entire extent in so we can
7610 * decompress it, so there will be buffering required no matter what we
7611 * do, so go ahead and fallback to buffered.
7613 * We return -ENOTBLK because that's what makes DIO go ahead and go back
7614 * to buffered IO. Don't blame me, this is the price we pay for using
7617 if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags) ||
7618 em->block_start == EXTENT_MAP_INLINE) {
7619 free_extent_map(em);
7624 len = min(len, em->len - (start - em->start));
7627 * If we have a NOWAIT request and the range contains multiple extents
7628 * (or a mix of extents and holes), then we return -EAGAIN to make the
7629 * caller fallback to a context where it can do a blocking (without
7630 * NOWAIT) request. This way we avoid doing partial IO and returning
7631 * success to the caller, which is not optimal for writes and for reads
7632 * it can result in unexpected behaviour for an application.
7634 * When doing a read, because we use IOMAP_DIO_PARTIAL when calling
7635 * iomap_dio_rw(), we can end up returning less data then what the caller
7636 * asked for, resulting in an unexpected, and incorrect, short read.
7637 * That is, the caller asked to read N bytes and we return less than that,
7638 * which is wrong unless we are crossing EOF. This happens if we get a
7639 * page fault error when trying to fault in pages for the buffer that is
7640 * associated to the struct iov_iter passed to iomap_dio_rw(), and we
7641 * have previously submitted bios for other extents in the range, in
7642 * which case iomap_dio_rw() may return us EIOCBQUEUED if not all of
7643 * those bios have completed by the time we get the page fault error,
7644 * which we return back to our caller - we should only return EIOCBQUEUED
7645 * after we have submitted bios for all the extents in the range.
7647 if ((flags & IOMAP_NOWAIT) && len < length) {
7648 free_extent_map(em);
7654 ret = btrfs_get_blocks_direct_write(&em, inode, dio_data,
7658 unlock_extents = true;
7659 /* Recalc len in case the new em is smaller than requested */
7660 len = min(len, em->len - (start - em->start));
7663 * We need to unlock only the end area that we aren't using.
7664 * The rest is going to be unlocked by the endio routine.
7666 lockstart = start + len;
7667 if (lockstart < lockend)
7668 unlock_extents = true;
7672 unlock_extent_cached(&BTRFS_I(inode)->io_tree,
7673 lockstart, lockend, &cached_state);
7675 free_extent_state(cached_state);
7678 * Translate extent map information to iomap.
7679 * We trim the extents (and move the addr) even though iomap code does
7680 * that, since we have locked only the parts we are performing I/O in.
7682 if ((em->block_start == EXTENT_MAP_HOLE) ||
7683 (test_bit(EXTENT_FLAG_PREALLOC, &em->flags) && !write)) {
7684 iomap->addr = IOMAP_NULL_ADDR;
7685 iomap->type = IOMAP_HOLE;
7687 iomap->addr = em->block_start + (start - em->start);
7688 iomap->type = IOMAP_MAPPED;
7690 iomap->offset = start;
7691 iomap->bdev = fs_info->fs_devices->latest_dev->bdev;
7692 iomap->length = len;
7694 if (write && btrfs_use_zone_append(BTRFS_I(inode), em->block_start))
7695 iomap->flags |= IOMAP_F_ZONE_APPEND;
7697 free_extent_map(em);
7702 unlock_extent_cached(&BTRFS_I(inode)->io_tree, lockstart, lockend,
7710 static int btrfs_dio_iomap_end(struct inode *inode, loff_t pos, loff_t length,
7711 ssize_t written, unsigned int flags, struct iomap *iomap)
7714 struct btrfs_dio_data *dio_data = iomap->private;
7715 size_t submitted = dio_data->submitted;
7716 const bool write = !!(flags & IOMAP_WRITE);
7718 if (!write && (iomap->type == IOMAP_HOLE)) {
7719 /* If reading from a hole, unlock and return */
7720 unlock_extent(&BTRFS_I(inode)->io_tree, pos, pos + length - 1);
7724 if (submitted < length) {
7726 length -= submitted;
7728 __endio_write_update_ordered(BTRFS_I(inode), pos,
7731 unlock_extent(&BTRFS_I(inode)->io_tree, pos,
7737 extent_changeset_free(dio_data->data_reserved);
7740 iomap->private = NULL;
7745 static void btrfs_dio_private_put(struct btrfs_dio_private *dip)
7748 * This implies a barrier so that stores to dio_bio->bi_status before
7749 * this and loads of dio_bio->bi_status after this are fully ordered.
7751 if (!refcount_dec_and_test(&dip->refs))
7754 if (btrfs_op(dip->dio_bio) == BTRFS_MAP_WRITE) {
7755 __endio_write_update_ordered(BTRFS_I(dip->inode),
7758 !dip->dio_bio->bi_status);
7760 unlock_extent(&BTRFS_I(dip->inode)->io_tree,
7762 dip->file_offset + dip->bytes - 1);
7765 bio_endio(dip->dio_bio);
7769 static blk_status_t submit_dio_repair_bio(struct inode *inode, struct bio *bio,
7771 unsigned long bio_flags)
7773 struct btrfs_dio_private *dip = bio->bi_private;
7774 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
7777 BUG_ON(bio_op(bio) == REQ_OP_WRITE);
7779 ret = btrfs_bio_wq_end_io(fs_info, bio, BTRFS_WQ_ENDIO_DATA);
7783 refcount_inc(&dip->refs);
7784 ret = btrfs_map_bio(fs_info, bio, mirror_num);
7786 refcount_dec(&dip->refs);
7790 static blk_status_t btrfs_check_read_dio_bio(struct btrfs_dio_private *dip,
7791 struct btrfs_bio *bbio,
7792 const bool uptodate)
7794 struct inode *inode = dip->inode;
7795 struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info;
7796 const u32 sectorsize = fs_info->sectorsize;
7797 struct extent_io_tree *failure_tree = &BTRFS_I(inode)->io_failure_tree;
7798 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
7799 const bool csum = !(BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM);
7800 struct bio_vec bvec;
7801 struct bvec_iter iter;
7803 blk_status_t err = BLK_STS_OK;
7805 __bio_for_each_segment(bvec, &bbio->bio, iter, bbio->iter) {
7806 unsigned int i, nr_sectors, pgoff;
7808 nr_sectors = BTRFS_BYTES_TO_BLKS(fs_info, bvec.bv_len);
7809 pgoff = bvec.bv_offset;
7810 for (i = 0; i < nr_sectors; i++) {
7811 u64 start = bbio->file_offset + bio_offset;
7813 ASSERT(pgoff < PAGE_SIZE);
7815 (!csum || !check_data_csum(inode, bbio,
7816 bio_offset, bvec.bv_page,
7818 clean_io_failure(fs_info, failure_tree, io_tree,
7819 start, bvec.bv_page,
7820 btrfs_ino(BTRFS_I(inode)),
7825 ret = btrfs_repair_one_sector(inode, &bbio->bio,
7826 bio_offset, bvec.bv_page, pgoff,
7827 start, bbio->mirror_num,
7828 submit_dio_repair_bio);
7830 err = errno_to_blk_status(ret);
7832 ASSERT(bio_offset + sectorsize > bio_offset);
7833 bio_offset += sectorsize;
7834 pgoff += sectorsize;
7840 static void __endio_write_update_ordered(struct btrfs_inode *inode,
7841 const u64 offset, const u64 bytes,
7842 const bool uptodate)
7844 btrfs_mark_ordered_io_finished(inode, NULL, offset, bytes,
7845 finish_ordered_fn, uptodate);
7848 static blk_status_t btrfs_submit_bio_start_direct_io(struct inode *inode,
7850 u64 dio_file_offset)
7852 return btrfs_csum_one_bio(BTRFS_I(inode), bio, dio_file_offset, false);
7855 static void btrfs_end_dio_bio(struct bio *bio)
7857 struct btrfs_dio_private *dip = bio->bi_private;
7858 struct btrfs_bio *bbio = btrfs_bio(bio);
7859 blk_status_t err = bio->bi_status;
7862 btrfs_warn(BTRFS_I(dip->inode)->root->fs_info,
7863 "direct IO failed ino %llu rw %d,%u sector %#Lx len %u err no %d",
7864 btrfs_ino(BTRFS_I(dip->inode)), bio_op(bio),
7865 bio->bi_opf, bio->bi_iter.bi_sector,
7866 bio->bi_iter.bi_size, err);
7868 if (bio_op(bio) == REQ_OP_READ)
7869 err = btrfs_check_read_dio_bio(dip, bbio, !err);
7872 dip->dio_bio->bi_status = err;
7874 btrfs_record_physical_zoned(dip->inode, bbio->file_offset, bio);
7877 btrfs_dio_private_put(dip);
7880 static inline blk_status_t btrfs_submit_dio_bio(struct bio *bio,
7881 struct inode *inode, u64 file_offset, int async_submit)
7883 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
7884 struct btrfs_dio_private *dip = bio->bi_private;
7885 bool write = btrfs_op(bio) == BTRFS_MAP_WRITE;
7888 /* Check btrfs_submit_bio_hook() for rules about async submit. */
7890 async_submit = !atomic_read(&BTRFS_I(inode)->sync_writers);
7893 ret = btrfs_bio_wq_end_io(fs_info, bio, BTRFS_WQ_ENDIO_DATA);
7898 if (BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM)
7901 if (write && async_submit) {
7902 ret = btrfs_wq_submit_bio(inode, bio, 0, 0, file_offset,
7903 btrfs_submit_bio_start_direct_io);
7907 * If we aren't doing async submit, calculate the csum of the
7910 ret = btrfs_csum_one_bio(BTRFS_I(inode), bio, file_offset, false);
7916 csum_offset = file_offset - dip->file_offset;
7917 csum_offset >>= fs_info->sectorsize_bits;
7918 csum_offset *= fs_info->csum_size;
7919 btrfs_bio(bio)->csum = dip->csums + csum_offset;
7922 ret = btrfs_map_bio(fs_info, bio, 0);
7928 * If this succeeds, the btrfs_dio_private is responsible for cleaning up locked
7929 * or ordered extents whether or not we submit any bios.
7931 static struct btrfs_dio_private *btrfs_create_dio_private(struct bio *dio_bio,
7932 struct inode *inode,
7935 const bool write = (btrfs_op(dio_bio) == BTRFS_MAP_WRITE);
7936 const bool csum = !(BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM);
7938 struct btrfs_dio_private *dip;
7940 dip_size = sizeof(*dip);
7941 if (!write && csum) {
7942 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
7945 nblocks = dio_bio->bi_iter.bi_size >> fs_info->sectorsize_bits;
7946 dip_size += fs_info->csum_size * nblocks;
7949 dip = kzalloc(dip_size, GFP_NOFS);
7954 dip->file_offset = file_offset;
7955 dip->bytes = dio_bio->bi_iter.bi_size;
7956 dip->disk_bytenr = dio_bio->bi_iter.bi_sector << 9;
7957 dip->dio_bio = dio_bio;
7958 refcount_set(&dip->refs, 1);
7962 static void btrfs_submit_direct(const struct iomap_iter *iter,
7963 struct bio *dio_bio, loff_t file_offset)
7965 struct inode *inode = iter->inode;
7966 const bool write = (btrfs_op(dio_bio) == BTRFS_MAP_WRITE);
7967 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
7968 const bool raid56 = (btrfs_data_alloc_profile(fs_info) &
7969 BTRFS_BLOCK_GROUP_RAID56_MASK);
7970 struct btrfs_dio_private *dip;
7973 int async_submit = 0;
7975 u64 clone_offset = 0;
7979 blk_status_t status;
7980 struct btrfs_io_geometry geom;
7981 struct btrfs_dio_data *dio_data = iter->iomap.private;
7982 struct extent_map *em = NULL;
7984 dip = btrfs_create_dio_private(dio_bio, inode, file_offset);
7987 unlock_extent(&BTRFS_I(inode)->io_tree, file_offset,
7988 file_offset + dio_bio->bi_iter.bi_size - 1);
7990 dio_bio->bi_status = BLK_STS_RESOURCE;
7997 * Load the csums up front to reduce csum tree searches and
7998 * contention when submitting bios.
8000 * If we have csums disabled this will do nothing.
8002 status = btrfs_lookup_bio_sums(inode, dio_bio, dip->csums);
8003 if (status != BLK_STS_OK)
8007 start_sector = dio_bio->bi_iter.bi_sector;
8008 submit_len = dio_bio->bi_iter.bi_size;
8011 logical = start_sector << 9;
8012 em = btrfs_get_chunk_map(fs_info, logical, submit_len);
8014 status = errno_to_blk_status(PTR_ERR(em));
8018 ret = btrfs_get_io_geometry(fs_info, em, btrfs_op(dio_bio),
8021 status = errno_to_blk_status(ret);
8025 clone_len = min(submit_len, geom.len);
8026 ASSERT(clone_len <= UINT_MAX);
8029 * This will never fail as it's passing GPF_NOFS and
8030 * the allocation is backed by btrfs_bioset.
8032 bio = btrfs_bio_clone_partial(dio_bio, clone_offset, clone_len);
8033 bio->bi_private = dip;
8034 bio->bi_end_io = btrfs_end_dio_bio;
8035 btrfs_bio(bio)->file_offset = file_offset;
8037 if (bio_op(bio) == REQ_OP_ZONE_APPEND) {
8038 status = extract_ordered_extent(BTRFS_I(inode), bio,
8046 ASSERT(submit_len >= clone_len);
8047 submit_len -= clone_len;
8050 * Increase the count before we submit the bio so we know
8051 * the end IO handler won't happen before we increase the
8052 * count. Otherwise, the dip might get freed before we're
8053 * done setting it up.
8055 * We transfer the initial reference to the last bio, so we
8056 * don't need to increment the reference count for the last one.
8058 if (submit_len > 0) {
8059 refcount_inc(&dip->refs);
8061 * If we are submitting more than one bio, submit them
8062 * all asynchronously. The exception is RAID 5 or 6, as
8063 * asynchronous checksums make it difficult to collect
8064 * full stripe writes.
8070 status = btrfs_submit_dio_bio(bio, inode, file_offset,
8075 refcount_dec(&dip->refs);
8079 dio_data->submitted += clone_len;
8080 clone_offset += clone_len;
8081 start_sector += clone_len >> 9;
8082 file_offset += clone_len;
8084 free_extent_map(em);
8085 } while (submit_len > 0);
8089 free_extent_map(em);
8091 dip->dio_bio->bi_status = status;
8092 btrfs_dio_private_put(dip);
8095 const struct iomap_ops btrfs_dio_iomap_ops = {
8096 .iomap_begin = btrfs_dio_iomap_begin,
8097 .iomap_end = btrfs_dio_iomap_end,
8100 const struct iomap_dio_ops btrfs_dio_ops = {
8101 .submit_io = btrfs_submit_direct,
8104 static int btrfs_fiemap(struct inode *inode, struct fiemap_extent_info *fieinfo,
8109 ret = fiemap_prep(inode, fieinfo, start, &len, 0);
8113 return extent_fiemap(BTRFS_I(inode), fieinfo, start, len);
8116 int btrfs_readpage(struct file *file, struct page *page)
8118 struct btrfs_inode *inode = BTRFS_I(page->mapping->host);
8119 u64 start = page_offset(page);
8120 u64 end = start + PAGE_SIZE - 1;
8121 struct btrfs_bio_ctrl bio_ctrl = { 0 };
8124 btrfs_lock_and_flush_ordered_range(inode, start, end, NULL);
8126 ret = btrfs_do_readpage(page, NULL, &bio_ctrl, 0, NULL);
8130 ret2 = submit_one_bio(bio_ctrl.bio, 0, bio_ctrl.bio_flags);
8137 static int btrfs_writepage(struct page *page, struct writeback_control *wbc)
8139 struct inode *inode = page->mapping->host;
8142 if (current->flags & PF_MEMALLOC) {
8143 redirty_page_for_writepage(wbc, page);
8149 * If we are under memory pressure we will call this directly from the
8150 * VM, we need to make sure we have the inode referenced for the ordered
8151 * extent. If not just return like we didn't do anything.
8153 if (!igrab(inode)) {
8154 redirty_page_for_writepage(wbc, page);
8155 return AOP_WRITEPAGE_ACTIVATE;
8157 ret = extent_write_full_page(page, wbc);
8158 btrfs_add_delayed_iput(inode);
8162 static int btrfs_writepages(struct address_space *mapping,
8163 struct writeback_control *wbc)
8165 return extent_writepages(mapping, wbc);
8168 static void btrfs_readahead(struct readahead_control *rac)
8170 extent_readahead(rac);
8174 * For releasepage() and invalidate_folio() we have a race window where
8175 * folio_end_writeback() is called but the subpage spinlock is not yet released.
8176 * If we continue to release/invalidate the page, we could cause use-after-free
8177 * for subpage spinlock. So this function is to spin and wait for subpage
8180 static void wait_subpage_spinlock(struct page *page)
8182 struct btrfs_fs_info *fs_info = btrfs_sb(page->mapping->host->i_sb);
8183 struct btrfs_subpage *subpage;
8185 if (fs_info->sectorsize == PAGE_SIZE)
8188 ASSERT(PagePrivate(page) && page->private);
8189 subpage = (struct btrfs_subpage *)page->private;
8192 * This may look insane as we just acquire the spinlock and release it,
8193 * without doing anything. But we just want to make sure no one is
8194 * still holding the subpage spinlock.
8195 * And since the page is not dirty nor writeback, and we have page
8196 * locked, the only possible way to hold a spinlock is from the endio
8197 * function to clear page writeback.
8199 * Here we just acquire the spinlock so that all existing callers
8200 * should exit and we're safe to release/invalidate the page.
8202 spin_lock_irq(&subpage->lock);
8203 spin_unlock_irq(&subpage->lock);
8206 static int __btrfs_releasepage(struct page *page, gfp_t gfp_flags)
8208 int ret = try_release_extent_mapping(page, gfp_flags);
8211 wait_subpage_spinlock(page);
8212 clear_page_extent_mapped(page);
8217 static int btrfs_releasepage(struct page *page, gfp_t gfp_flags)
8219 if (PageWriteback(page) || PageDirty(page))
8221 return __btrfs_releasepage(page, gfp_flags);
8224 #ifdef CONFIG_MIGRATION
8225 static int btrfs_migratepage(struct address_space *mapping,
8226 struct page *newpage, struct page *page,
8227 enum migrate_mode mode)
8231 ret = migrate_page_move_mapping(mapping, newpage, page, 0);
8232 if (ret != MIGRATEPAGE_SUCCESS)
8235 if (page_has_private(page))
8236 attach_page_private(newpage, detach_page_private(page));
8238 if (PageOrdered(page)) {
8239 ClearPageOrdered(page);
8240 SetPageOrdered(newpage);
8243 if (mode != MIGRATE_SYNC_NO_COPY)
8244 migrate_page_copy(newpage, page);
8246 migrate_page_states(newpage, page);
8247 return MIGRATEPAGE_SUCCESS;
8251 static void btrfs_invalidate_folio(struct folio *folio, size_t offset,
8254 struct btrfs_inode *inode = BTRFS_I(folio->mapping->host);
8255 struct btrfs_fs_info *fs_info = inode->root->fs_info;
8256 struct extent_io_tree *tree = &inode->io_tree;
8257 struct extent_state *cached_state = NULL;
8258 u64 page_start = folio_pos(folio);
8259 u64 page_end = page_start + folio_size(folio) - 1;
8261 int inode_evicting = inode->vfs_inode.i_state & I_FREEING;
8264 * We have folio locked so no new ordered extent can be created on this
8265 * page, nor bio can be submitted for this folio.
8267 * But already submitted bio can still be finished on this folio.
8268 * Furthermore, endio function won't skip folio which has Ordered
8269 * (Private2) already cleared, so it's possible for endio and
8270 * invalidate_folio to do the same ordered extent accounting twice
8273 * So here we wait for any submitted bios to finish, so that we won't
8274 * do double ordered extent accounting on the same folio.
8276 folio_wait_writeback(folio);
8277 wait_subpage_spinlock(&folio->page);
8280 * For subpage case, we have call sites like
8281 * btrfs_punch_hole_lock_range() which passes range not aligned to
8283 * If the range doesn't cover the full folio, we don't need to and
8284 * shouldn't clear page extent mapped, as folio->private can still
8285 * record subpage dirty bits for other part of the range.
8287 * For cases that invalidate the full folio even the range doesn't
8288 * cover the full folio, like invalidating the last folio, we're
8289 * still safe to wait for ordered extent to finish.
8291 if (!(offset == 0 && length == folio_size(folio))) {
8292 btrfs_releasepage(&folio->page, GFP_NOFS);
8296 if (!inode_evicting)
8297 lock_extent_bits(tree, page_start, page_end, &cached_state);
8300 while (cur < page_end) {
8301 struct btrfs_ordered_extent *ordered;
8306 ordered = btrfs_lookup_first_ordered_range(inode, cur,
8307 page_end + 1 - cur);
8309 range_end = page_end;
8311 * No ordered extent covering this range, we are safe
8312 * to delete all extent states in the range.
8314 delete_states = true;
8317 if (ordered->file_offset > cur) {
8319 * There is a range between [cur, oe->file_offset) not
8320 * covered by any ordered extent.
8321 * We are safe to delete all extent states, and handle
8322 * the ordered extent in the next iteration.
8324 range_end = ordered->file_offset - 1;
8325 delete_states = true;
8329 range_end = min(ordered->file_offset + ordered->num_bytes - 1,
8331 ASSERT(range_end + 1 - cur < U32_MAX);
8332 range_len = range_end + 1 - cur;
8333 if (!btrfs_page_test_ordered(fs_info, &folio->page, cur, range_len)) {
8335 * If Ordered (Private2) is cleared, it means endio has
8336 * already been executed for the range.
8337 * We can't delete the extent states as
8338 * btrfs_finish_ordered_io() may still use some of them.
8340 delete_states = false;
8343 btrfs_page_clear_ordered(fs_info, &folio->page, cur, range_len);
8346 * IO on this page will never be started, so we need to account
8347 * for any ordered extents now. Don't clear EXTENT_DELALLOC_NEW
8348 * here, must leave that up for the ordered extent completion.
8350 * This will also unlock the range for incoming
8351 * btrfs_finish_ordered_io().
8353 if (!inode_evicting)
8354 clear_extent_bit(tree, cur, range_end,
8356 EXTENT_LOCKED | EXTENT_DO_ACCOUNTING |
8357 EXTENT_DEFRAG, 1, 0, &cached_state);
8359 spin_lock_irq(&inode->ordered_tree.lock);
8360 set_bit(BTRFS_ORDERED_TRUNCATED, &ordered->flags);
8361 ordered->truncated_len = min(ordered->truncated_len,
8362 cur - ordered->file_offset);
8363 spin_unlock_irq(&inode->ordered_tree.lock);
8365 if (btrfs_dec_test_ordered_pending(inode, &ordered,
8366 cur, range_end + 1 - cur)) {
8367 btrfs_finish_ordered_io(ordered);
8369 * The ordered extent has finished, now we're again
8370 * safe to delete all extent states of the range.
8372 delete_states = true;
8375 * btrfs_finish_ordered_io() will get executed by endio
8376 * of other pages, thus we can't delete extent states
8379 delete_states = false;
8383 btrfs_put_ordered_extent(ordered);
8385 * Qgroup reserved space handler
8386 * Sector(s) here will be either:
8388 * 1) Already written to disk or bio already finished
8389 * Then its QGROUP_RESERVED bit in io_tree is already cleared.
8390 * Qgroup will be handled by its qgroup_record then.
8391 * btrfs_qgroup_free_data() call will do nothing here.
8393 * 2) Not written to disk yet
8394 * Then btrfs_qgroup_free_data() call will clear the
8395 * QGROUP_RESERVED bit of its io_tree, and free the qgroup
8396 * reserved data space.
8397 * Since the IO will never happen for this page.
8399 btrfs_qgroup_free_data(inode, NULL, cur, range_end + 1 - cur);
8400 if (!inode_evicting) {
8401 clear_extent_bit(tree, cur, range_end, EXTENT_LOCKED |
8402 EXTENT_DELALLOC | EXTENT_UPTODATE |
8403 EXTENT_DO_ACCOUNTING | EXTENT_DEFRAG, 1,
8404 delete_states, &cached_state);
8406 cur = range_end + 1;
8409 * We have iterated through all ordered extents of the page, the page
8410 * should not have Ordered (Private2) anymore, or the above iteration
8411 * did something wrong.
8413 ASSERT(!folio_test_ordered(folio));
8414 btrfs_page_clear_checked(fs_info, &folio->page, folio_pos(folio), folio_size(folio));
8415 if (!inode_evicting)
8416 __btrfs_releasepage(&folio->page, GFP_NOFS);
8417 clear_page_extent_mapped(&folio->page);
8421 * btrfs_page_mkwrite() is not allowed to change the file size as it gets
8422 * called from a page fault handler when a page is first dirtied. Hence we must
8423 * be careful to check for EOF conditions here. We set the page up correctly
8424 * for a written page which means we get ENOSPC checking when writing into
8425 * holes and correct delalloc and unwritten extent mapping on filesystems that
8426 * support these features.
8428 * We are not allowed to take the i_mutex here so we have to play games to
8429 * protect against truncate races as the page could now be beyond EOF. Because
8430 * truncate_setsize() writes the inode size before removing pages, once we have
8431 * the page lock we can determine safely if the page is beyond EOF. If it is not
8432 * beyond EOF, then the page is guaranteed safe against truncation until we
8435 vm_fault_t btrfs_page_mkwrite(struct vm_fault *vmf)
8437 struct page *page = vmf->page;
8438 struct inode *inode = file_inode(vmf->vma->vm_file);
8439 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
8440 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
8441 struct btrfs_ordered_extent *ordered;
8442 struct extent_state *cached_state = NULL;
8443 struct extent_changeset *data_reserved = NULL;
8444 unsigned long zero_start;
8454 reserved_space = PAGE_SIZE;
8456 sb_start_pagefault(inode->i_sb);
8457 page_start = page_offset(page);
8458 page_end = page_start + PAGE_SIZE - 1;
8462 * Reserving delalloc space after obtaining the page lock can lead to
8463 * deadlock. For example, if a dirty page is locked by this function
8464 * and the call to btrfs_delalloc_reserve_space() ends up triggering
8465 * dirty page write out, then the btrfs_writepage() function could
8466 * end up waiting indefinitely to get a lock on the page currently
8467 * being processed by btrfs_page_mkwrite() function.
8469 ret2 = btrfs_delalloc_reserve_space(BTRFS_I(inode), &data_reserved,
8470 page_start, reserved_space);
8472 ret2 = file_update_time(vmf->vma->vm_file);
8476 ret = vmf_error(ret2);
8482 ret = VM_FAULT_NOPAGE; /* make the VM retry the fault */
8484 down_read(&BTRFS_I(inode)->i_mmap_lock);
8486 size = i_size_read(inode);
8488 if ((page->mapping != inode->i_mapping) ||
8489 (page_start >= size)) {
8490 /* page got truncated out from underneath us */
8493 wait_on_page_writeback(page);
8495 lock_extent_bits(io_tree, page_start, page_end, &cached_state);
8496 ret2 = set_page_extent_mapped(page);
8498 ret = vmf_error(ret2);
8499 unlock_extent_cached(io_tree, page_start, page_end, &cached_state);
8504 * we can't set the delalloc bits if there are pending ordered
8505 * extents. Drop our locks and wait for them to finish
8507 ordered = btrfs_lookup_ordered_range(BTRFS_I(inode), page_start,
8510 unlock_extent_cached(io_tree, page_start, page_end,
8513 up_read(&BTRFS_I(inode)->i_mmap_lock);
8514 btrfs_start_ordered_extent(ordered, 1);
8515 btrfs_put_ordered_extent(ordered);
8519 if (page->index == ((size - 1) >> PAGE_SHIFT)) {
8520 reserved_space = round_up(size - page_start,
8521 fs_info->sectorsize);
8522 if (reserved_space < PAGE_SIZE) {
8523 end = page_start + reserved_space - 1;
8524 btrfs_delalloc_release_space(BTRFS_I(inode),
8525 data_reserved, page_start,
8526 PAGE_SIZE - reserved_space, true);
8531 * page_mkwrite gets called when the page is firstly dirtied after it's
8532 * faulted in, but write(2) could also dirty a page and set delalloc
8533 * bits, thus in this case for space account reason, we still need to
8534 * clear any delalloc bits within this page range since we have to
8535 * reserve data&meta space before lock_page() (see above comments).
8537 clear_extent_bit(&BTRFS_I(inode)->io_tree, page_start, end,
8538 EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING |
8539 EXTENT_DEFRAG, 0, 0, &cached_state);
8541 ret2 = btrfs_set_extent_delalloc(BTRFS_I(inode), page_start, end, 0,
8544 unlock_extent_cached(io_tree, page_start, page_end,
8546 ret = VM_FAULT_SIGBUS;
8550 /* page is wholly or partially inside EOF */
8551 if (page_start + PAGE_SIZE > size)
8552 zero_start = offset_in_page(size);
8554 zero_start = PAGE_SIZE;
8556 if (zero_start != PAGE_SIZE) {
8557 memzero_page(page, zero_start, PAGE_SIZE - zero_start);
8558 flush_dcache_page(page);
8560 btrfs_page_clear_checked(fs_info, page, page_start, PAGE_SIZE);
8561 btrfs_page_set_dirty(fs_info, page, page_start, end + 1 - page_start);
8562 btrfs_page_set_uptodate(fs_info, page, page_start, end + 1 - page_start);
8564 btrfs_set_inode_last_sub_trans(BTRFS_I(inode));
8566 unlock_extent_cached(io_tree, page_start, page_end, &cached_state);
8567 up_read(&BTRFS_I(inode)->i_mmap_lock);
8569 btrfs_delalloc_release_extents(BTRFS_I(inode), PAGE_SIZE);
8570 sb_end_pagefault(inode->i_sb);
8571 extent_changeset_free(data_reserved);
8572 return VM_FAULT_LOCKED;
8576 up_read(&BTRFS_I(inode)->i_mmap_lock);
8578 btrfs_delalloc_release_extents(BTRFS_I(inode), PAGE_SIZE);
8579 btrfs_delalloc_release_space(BTRFS_I(inode), data_reserved, page_start,
8580 reserved_space, (ret != 0));
8582 sb_end_pagefault(inode->i_sb);
8583 extent_changeset_free(data_reserved);
8587 static int btrfs_truncate(struct inode *inode, bool skip_writeback)
8589 struct btrfs_truncate_control control = {
8590 .inode = BTRFS_I(inode),
8591 .ino = btrfs_ino(BTRFS_I(inode)),
8592 .min_type = BTRFS_EXTENT_DATA_KEY,
8593 .clear_extent_range = true,
8595 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
8596 struct btrfs_root *root = BTRFS_I(inode)->root;
8597 struct btrfs_block_rsv *rsv;
8599 struct btrfs_trans_handle *trans;
8600 u64 mask = fs_info->sectorsize - 1;
8601 u64 min_size = btrfs_calc_metadata_size(fs_info, 1);
8603 if (!skip_writeback) {
8604 ret = btrfs_wait_ordered_range(inode, inode->i_size & (~mask),
8611 * Yes ladies and gentlemen, this is indeed ugly. We have a couple of
8612 * things going on here:
8614 * 1) We need to reserve space to update our inode.
8616 * 2) We need to have something to cache all the space that is going to
8617 * be free'd up by the truncate operation, but also have some slack
8618 * space reserved in case it uses space during the truncate (thank you
8619 * very much snapshotting).
8621 * And we need these to be separate. The fact is we can use a lot of
8622 * space doing the truncate, and we have no earthly idea how much space
8623 * we will use, so we need the truncate reservation to be separate so it
8624 * doesn't end up using space reserved for updating the inode. We also
8625 * need to be able to stop the transaction and start a new one, which
8626 * means we need to be able to update the inode several times, and we
8627 * have no idea of knowing how many times that will be, so we can't just
8628 * reserve 1 item for the entirety of the operation, so that has to be
8629 * done separately as well.
8631 * So that leaves us with
8633 * 1) rsv - for the truncate reservation, which we will steal from the
8634 * transaction reservation.
8635 * 2) fs_info->trans_block_rsv - this will have 1 items worth left for
8636 * updating the inode.
8638 rsv = btrfs_alloc_block_rsv(fs_info, BTRFS_BLOCK_RSV_TEMP);
8641 rsv->size = min_size;
8645 * 1 for the truncate slack space
8646 * 1 for updating the inode.
8648 trans = btrfs_start_transaction(root, 2);
8649 if (IS_ERR(trans)) {
8650 ret = PTR_ERR(trans);
8654 /* Migrate the slack space for the truncate to our reserve */
8655 ret = btrfs_block_rsv_migrate(&fs_info->trans_block_rsv, rsv,
8659 trans->block_rsv = rsv;
8662 struct extent_state *cached_state = NULL;
8663 const u64 new_size = inode->i_size;
8664 const u64 lock_start = ALIGN_DOWN(new_size, fs_info->sectorsize);
8666 control.new_size = new_size;
8667 lock_extent_bits(&BTRFS_I(inode)->io_tree, lock_start, (u64)-1,
8670 * We want to drop from the next block forward in case this new
8671 * size is not block aligned since we will be keeping the last
8672 * block of the extent just the way it is.
8674 btrfs_drop_extent_cache(BTRFS_I(inode),
8675 ALIGN(new_size, fs_info->sectorsize),
8678 ret = btrfs_truncate_inode_items(trans, root, &control);
8680 inode_sub_bytes(inode, control.sub_bytes);
8681 btrfs_inode_safe_disk_i_size_write(BTRFS_I(inode), control.last_size);
8683 unlock_extent_cached(&BTRFS_I(inode)->io_tree, lock_start,
8684 (u64)-1, &cached_state);
8686 trans->block_rsv = &fs_info->trans_block_rsv;
8687 if (ret != -ENOSPC && ret != -EAGAIN)
8690 ret = btrfs_update_inode(trans, root, BTRFS_I(inode));
8694 btrfs_end_transaction(trans);
8695 btrfs_btree_balance_dirty(fs_info);
8697 trans = btrfs_start_transaction(root, 2);
8698 if (IS_ERR(trans)) {
8699 ret = PTR_ERR(trans);
8704 btrfs_block_rsv_release(fs_info, rsv, -1, NULL);
8705 ret = btrfs_block_rsv_migrate(&fs_info->trans_block_rsv,
8706 rsv, min_size, false);
8707 BUG_ON(ret); /* shouldn't happen */
8708 trans->block_rsv = rsv;
8712 * We can't call btrfs_truncate_block inside a trans handle as we could
8713 * deadlock with freeze, if we got BTRFS_NEED_TRUNCATE_BLOCK then we
8714 * know we've truncated everything except the last little bit, and can
8715 * do btrfs_truncate_block and then update the disk_i_size.
8717 if (ret == BTRFS_NEED_TRUNCATE_BLOCK) {
8718 btrfs_end_transaction(trans);
8719 btrfs_btree_balance_dirty(fs_info);
8721 ret = btrfs_truncate_block(BTRFS_I(inode), inode->i_size, 0, 0);
8724 trans = btrfs_start_transaction(root, 1);
8725 if (IS_ERR(trans)) {
8726 ret = PTR_ERR(trans);
8729 btrfs_inode_safe_disk_i_size_write(BTRFS_I(inode), 0);
8735 trans->block_rsv = &fs_info->trans_block_rsv;
8736 ret2 = btrfs_update_inode(trans, root, BTRFS_I(inode));
8740 ret2 = btrfs_end_transaction(trans);
8743 btrfs_btree_balance_dirty(fs_info);
8746 btrfs_free_block_rsv(fs_info, rsv);
8748 * So if we truncate and then write and fsync we normally would just
8749 * write the extents that changed, which is a problem if we need to
8750 * first truncate that entire inode. So set this flag so we write out
8751 * all of the extents in the inode to the sync log so we're completely
8754 * If no extents were dropped or trimmed we don't need to force the next
8755 * fsync to truncate all the inode's items from the log and re-log them
8756 * all. This means the truncate operation did not change the file size,
8757 * or changed it to a smaller size but there was only an implicit hole
8758 * between the old i_size and the new i_size, and there were no prealloc
8759 * extents beyond i_size to drop.
8761 if (control.extents_found > 0)
8762 btrfs_set_inode_full_sync(BTRFS_I(inode));
8768 * create a new subvolume directory/inode (helper for the ioctl).
8770 int btrfs_create_subvol_root(struct btrfs_trans_handle *trans,
8771 struct btrfs_root *new_root,
8772 struct btrfs_root *parent_root,
8773 struct user_namespace *mnt_userns)
8775 struct inode *inode;
8780 err = btrfs_get_free_objectid(new_root, &ino);
8784 inode = btrfs_new_inode(trans, new_root, mnt_userns, NULL, "..", 2,
8786 S_IFDIR | (~current_umask() & S_IRWXUGO),
8789 return PTR_ERR(inode);
8790 inode->i_op = &btrfs_dir_inode_operations;
8791 inode->i_fop = &btrfs_dir_file_operations;
8793 set_nlink(inode, 1);
8794 btrfs_i_size_write(BTRFS_I(inode), 0);
8795 unlock_new_inode(inode);
8797 err = btrfs_subvol_inherit_props(trans, new_root, parent_root);
8799 btrfs_err(new_root->fs_info,
8800 "error inheriting subvolume %llu properties: %d",
8801 new_root->root_key.objectid, err);
8803 err = btrfs_update_inode(trans, new_root, BTRFS_I(inode));
8809 struct inode *btrfs_alloc_inode(struct super_block *sb)
8811 struct btrfs_fs_info *fs_info = btrfs_sb(sb);
8812 struct btrfs_inode *ei;
8813 struct inode *inode;
8815 ei = alloc_inode_sb(sb, btrfs_inode_cachep, GFP_KERNEL);
8822 ei->last_sub_trans = 0;
8823 ei->logged_trans = 0;
8824 ei->delalloc_bytes = 0;
8825 ei->new_delalloc_bytes = 0;
8826 ei->defrag_bytes = 0;
8827 ei->disk_i_size = 0;
8831 ei->index_cnt = (u64)-1;
8833 ei->last_unlink_trans = 0;
8834 ei->last_reflink_trans = 0;
8835 ei->last_log_commit = 0;
8837 spin_lock_init(&ei->lock);
8838 ei->outstanding_extents = 0;
8839 if (sb->s_magic != BTRFS_TEST_MAGIC)
8840 btrfs_init_metadata_block_rsv(fs_info, &ei->block_rsv,
8841 BTRFS_BLOCK_RSV_DELALLOC);
8842 ei->runtime_flags = 0;
8843 ei->prop_compress = BTRFS_COMPRESS_NONE;
8844 ei->defrag_compress = BTRFS_COMPRESS_NONE;
8846 ei->delayed_node = NULL;
8848 ei->i_otime.tv_sec = 0;
8849 ei->i_otime.tv_nsec = 0;
8851 inode = &ei->vfs_inode;
8852 extent_map_tree_init(&ei->extent_tree);
8853 extent_io_tree_init(fs_info, &ei->io_tree, IO_TREE_INODE_IO, inode);
8854 extent_io_tree_init(fs_info, &ei->io_failure_tree,
8855 IO_TREE_INODE_IO_FAILURE, inode);
8856 extent_io_tree_init(fs_info, &ei->file_extent_tree,
8857 IO_TREE_INODE_FILE_EXTENT, inode);
8858 ei->io_tree.track_uptodate = true;
8859 ei->io_failure_tree.track_uptodate = true;
8860 atomic_set(&ei->sync_writers, 0);
8861 mutex_init(&ei->log_mutex);
8862 btrfs_ordered_inode_tree_init(&ei->ordered_tree);
8863 INIT_LIST_HEAD(&ei->delalloc_inodes);
8864 INIT_LIST_HEAD(&ei->delayed_iput);
8865 RB_CLEAR_NODE(&ei->rb_node);
8866 init_rwsem(&ei->i_mmap_lock);
8871 #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
8872 void btrfs_test_destroy_inode(struct inode *inode)
8874 btrfs_drop_extent_cache(BTRFS_I(inode), 0, (u64)-1, 0);
8875 kmem_cache_free(btrfs_inode_cachep, BTRFS_I(inode));
8879 void btrfs_free_inode(struct inode *inode)
8881 kmem_cache_free(btrfs_inode_cachep, BTRFS_I(inode));
8884 void btrfs_destroy_inode(struct inode *vfs_inode)
8886 struct btrfs_ordered_extent *ordered;
8887 struct btrfs_inode *inode = BTRFS_I(vfs_inode);
8888 struct btrfs_root *root = inode->root;
8890 WARN_ON(!hlist_empty(&vfs_inode->i_dentry));
8891 WARN_ON(vfs_inode->i_data.nrpages);
8892 WARN_ON(inode->block_rsv.reserved);
8893 WARN_ON(inode->block_rsv.size);
8894 WARN_ON(inode->outstanding_extents);
8895 if (!S_ISDIR(vfs_inode->i_mode)) {
8896 WARN_ON(inode->delalloc_bytes);
8897 WARN_ON(inode->new_delalloc_bytes);
8899 WARN_ON(inode->csum_bytes);
8900 WARN_ON(inode->defrag_bytes);
8903 * This can happen where we create an inode, but somebody else also
8904 * created the same inode and we need to destroy the one we already
8911 ordered = btrfs_lookup_first_ordered_extent(inode, (u64)-1);
8915 btrfs_err(root->fs_info,
8916 "found ordered extent %llu %llu on inode cleanup",
8917 ordered->file_offset, ordered->num_bytes);
8918 btrfs_remove_ordered_extent(inode, ordered);
8919 btrfs_put_ordered_extent(ordered);
8920 btrfs_put_ordered_extent(ordered);
8923 btrfs_qgroup_check_reserved_leak(inode);
8924 inode_tree_del(inode);
8925 btrfs_drop_extent_cache(inode, 0, (u64)-1, 0);
8926 btrfs_inode_clear_file_extent_range(inode, 0, (u64)-1);
8927 btrfs_put_root(inode->root);
8930 int btrfs_drop_inode(struct inode *inode)
8932 struct btrfs_root *root = BTRFS_I(inode)->root;
8937 /* the snap/subvol tree is on deleting */
8938 if (btrfs_root_refs(&root->root_item) == 0)
8941 return generic_drop_inode(inode);
8944 static void init_once(void *foo)
8946 struct btrfs_inode *ei = (struct btrfs_inode *) foo;
8948 inode_init_once(&ei->vfs_inode);
8951 void __cold btrfs_destroy_cachep(void)
8954 * Make sure all delayed rcu free inodes are flushed before we
8958 kmem_cache_destroy(btrfs_inode_cachep);
8959 kmem_cache_destroy(btrfs_trans_handle_cachep);
8960 kmem_cache_destroy(btrfs_path_cachep);
8961 kmem_cache_destroy(btrfs_free_space_cachep);
8962 kmem_cache_destroy(btrfs_free_space_bitmap_cachep);
8965 int __init btrfs_init_cachep(void)
8967 btrfs_inode_cachep = kmem_cache_create("btrfs_inode",
8968 sizeof(struct btrfs_inode), 0,
8969 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD | SLAB_ACCOUNT,
8971 if (!btrfs_inode_cachep)
8974 btrfs_trans_handle_cachep = kmem_cache_create("btrfs_trans_handle",
8975 sizeof(struct btrfs_trans_handle), 0,
8976 SLAB_TEMPORARY | SLAB_MEM_SPREAD, NULL);
8977 if (!btrfs_trans_handle_cachep)
8980 btrfs_path_cachep = kmem_cache_create("btrfs_path",
8981 sizeof(struct btrfs_path), 0,
8982 SLAB_MEM_SPREAD, NULL);
8983 if (!btrfs_path_cachep)
8986 btrfs_free_space_cachep = kmem_cache_create("btrfs_free_space",
8987 sizeof(struct btrfs_free_space), 0,
8988 SLAB_MEM_SPREAD, NULL);
8989 if (!btrfs_free_space_cachep)
8992 btrfs_free_space_bitmap_cachep = kmem_cache_create("btrfs_free_space_bitmap",
8993 PAGE_SIZE, PAGE_SIZE,
8994 SLAB_MEM_SPREAD, NULL);
8995 if (!btrfs_free_space_bitmap_cachep)
9000 btrfs_destroy_cachep();
9004 static int btrfs_getattr(struct user_namespace *mnt_userns,
9005 const struct path *path, struct kstat *stat,
9006 u32 request_mask, unsigned int flags)
9010 struct inode *inode = d_inode(path->dentry);
9011 u32 blocksize = inode->i_sb->s_blocksize;
9012 u32 bi_flags = BTRFS_I(inode)->flags;
9013 u32 bi_ro_flags = BTRFS_I(inode)->ro_flags;
9015 stat->result_mask |= STATX_BTIME;
9016 stat->btime.tv_sec = BTRFS_I(inode)->i_otime.tv_sec;
9017 stat->btime.tv_nsec = BTRFS_I(inode)->i_otime.tv_nsec;
9018 if (bi_flags & BTRFS_INODE_APPEND)
9019 stat->attributes |= STATX_ATTR_APPEND;
9020 if (bi_flags & BTRFS_INODE_COMPRESS)
9021 stat->attributes |= STATX_ATTR_COMPRESSED;
9022 if (bi_flags & BTRFS_INODE_IMMUTABLE)
9023 stat->attributes |= STATX_ATTR_IMMUTABLE;
9024 if (bi_flags & BTRFS_INODE_NODUMP)
9025 stat->attributes |= STATX_ATTR_NODUMP;
9026 if (bi_ro_flags & BTRFS_INODE_RO_VERITY)
9027 stat->attributes |= STATX_ATTR_VERITY;
9029 stat->attributes_mask |= (STATX_ATTR_APPEND |
9030 STATX_ATTR_COMPRESSED |
9031 STATX_ATTR_IMMUTABLE |
9034 generic_fillattr(mnt_userns, inode, stat);
9035 stat->dev = BTRFS_I(inode)->root->anon_dev;
9037 spin_lock(&BTRFS_I(inode)->lock);
9038 delalloc_bytes = BTRFS_I(inode)->new_delalloc_bytes;
9039 inode_bytes = inode_get_bytes(inode);
9040 spin_unlock(&BTRFS_I(inode)->lock);
9041 stat->blocks = (ALIGN(inode_bytes, blocksize) +
9042 ALIGN(delalloc_bytes, blocksize)) >> 9;
9046 static int btrfs_rename_exchange(struct inode *old_dir,
9047 struct dentry *old_dentry,
9048 struct inode *new_dir,
9049 struct dentry *new_dentry)
9051 struct btrfs_fs_info *fs_info = btrfs_sb(old_dir->i_sb);
9052 struct btrfs_trans_handle *trans;
9053 struct btrfs_root *root = BTRFS_I(old_dir)->root;
9054 struct btrfs_root *dest = BTRFS_I(new_dir)->root;
9055 struct inode *new_inode = new_dentry->d_inode;
9056 struct inode *old_inode = old_dentry->d_inode;
9057 struct timespec64 ctime = current_time(old_inode);
9058 struct btrfs_rename_ctx old_rename_ctx;
9059 struct btrfs_rename_ctx new_rename_ctx;
9060 u64 old_ino = btrfs_ino(BTRFS_I(old_inode));
9061 u64 new_ino = btrfs_ino(BTRFS_I(new_inode));
9066 bool need_abort = false;
9069 * For non-subvolumes allow exchange only within one subvolume, in the
9070 * same inode namespace. Two subvolumes (represented as directory) can
9071 * be exchanged as they're a logical link and have a fixed inode number.
9074 (old_ino != BTRFS_FIRST_FREE_OBJECTID ||
9075 new_ino != BTRFS_FIRST_FREE_OBJECTID))
9078 /* close the race window with snapshot create/destroy ioctl */
9079 if (old_ino == BTRFS_FIRST_FREE_OBJECTID ||
9080 new_ino == BTRFS_FIRST_FREE_OBJECTID)
9081 down_read(&fs_info->subvol_sem);
9084 * We want to reserve the absolute worst case amount of items. So if
9085 * both inodes are subvols and we need to unlink them then that would
9086 * require 4 item modifications, but if they are both normal inodes it
9087 * would require 5 item modifications, so we'll assume their normal
9088 * inodes. So 5 * 2 is 10, plus 2 for the new links, so 12 total items
9089 * should cover the worst case number of items we'll modify.
9091 trans = btrfs_start_transaction(root, 12);
9092 if (IS_ERR(trans)) {
9093 ret = PTR_ERR(trans);
9098 ret = btrfs_record_root_in_trans(trans, dest);
9104 * We need to find a free sequence number both in the source and
9105 * in the destination directory for the exchange.
9107 ret = btrfs_set_inode_index(BTRFS_I(new_dir), &old_idx);
9110 ret = btrfs_set_inode_index(BTRFS_I(old_dir), &new_idx);
9114 BTRFS_I(old_inode)->dir_index = 0ULL;
9115 BTRFS_I(new_inode)->dir_index = 0ULL;
9117 /* Reference for the source. */
9118 if (old_ino == BTRFS_FIRST_FREE_OBJECTID) {
9119 /* force full log commit if subvolume involved. */
9120 btrfs_set_log_full_commit(trans);
9122 ret = btrfs_insert_inode_ref(trans, dest,
9123 new_dentry->d_name.name,
9124 new_dentry->d_name.len,
9126 btrfs_ino(BTRFS_I(new_dir)),
9133 /* And now for the dest. */
9134 if (new_ino == BTRFS_FIRST_FREE_OBJECTID) {
9135 /* force full log commit if subvolume involved. */
9136 btrfs_set_log_full_commit(trans);
9138 ret = btrfs_insert_inode_ref(trans, root,
9139 old_dentry->d_name.name,
9140 old_dentry->d_name.len,
9142 btrfs_ino(BTRFS_I(old_dir)),
9146 btrfs_abort_transaction(trans, ret);
9151 /* Update inode version and ctime/mtime. */
9152 inode_inc_iversion(old_dir);
9153 inode_inc_iversion(new_dir);
9154 inode_inc_iversion(old_inode);
9155 inode_inc_iversion(new_inode);
9156 old_dir->i_ctime = old_dir->i_mtime = ctime;
9157 new_dir->i_ctime = new_dir->i_mtime = ctime;
9158 old_inode->i_ctime = ctime;
9159 new_inode->i_ctime = ctime;
9161 if (old_dentry->d_parent != new_dentry->d_parent) {
9162 btrfs_record_unlink_dir(trans, BTRFS_I(old_dir),
9163 BTRFS_I(old_inode), 1);
9164 btrfs_record_unlink_dir(trans, BTRFS_I(new_dir),
9165 BTRFS_I(new_inode), 1);
9168 /* src is a subvolume */
9169 if (old_ino == BTRFS_FIRST_FREE_OBJECTID) {
9170 ret = btrfs_unlink_subvol(trans, old_dir, old_dentry);
9171 } else { /* src is an inode */
9172 ret = __btrfs_unlink_inode(trans, BTRFS_I(old_dir),
9173 BTRFS_I(old_dentry->d_inode),
9174 old_dentry->d_name.name,
9175 old_dentry->d_name.len,
9178 ret = btrfs_update_inode(trans, root, BTRFS_I(old_inode));
9181 btrfs_abort_transaction(trans, ret);
9185 /* dest is a subvolume */
9186 if (new_ino == BTRFS_FIRST_FREE_OBJECTID) {
9187 ret = btrfs_unlink_subvol(trans, new_dir, new_dentry);
9188 } else { /* dest is an inode */
9189 ret = __btrfs_unlink_inode(trans, BTRFS_I(new_dir),
9190 BTRFS_I(new_dentry->d_inode),
9191 new_dentry->d_name.name,
9192 new_dentry->d_name.len,
9195 ret = btrfs_update_inode(trans, dest, BTRFS_I(new_inode));
9198 btrfs_abort_transaction(trans, ret);
9202 ret = btrfs_add_link(trans, BTRFS_I(new_dir), BTRFS_I(old_inode),
9203 new_dentry->d_name.name,
9204 new_dentry->d_name.len, 0, old_idx);
9206 btrfs_abort_transaction(trans, ret);
9210 ret = btrfs_add_link(trans, BTRFS_I(old_dir), BTRFS_I(new_inode),
9211 old_dentry->d_name.name,
9212 old_dentry->d_name.len, 0, new_idx);
9214 btrfs_abort_transaction(trans, ret);
9218 if (old_inode->i_nlink == 1)
9219 BTRFS_I(old_inode)->dir_index = old_idx;
9220 if (new_inode->i_nlink == 1)
9221 BTRFS_I(new_inode)->dir_index = new_idx;
9224 * Now pin the logs of the roots. We do it to ensure that no other task
9225 * can sync the logs while we are in progress with the rename, because
9226 * that could result in an inconsistency in case any of the inodes that
9227 * are part of this rename operation were logged before.
9229 if (old_ino != BTRFS_FIRST_FREE_OBJECTID)
9230 btrfs_pin_log_trans(root);
9231 if (new_ino != BTRFS_FIRST_FREE_OBJECTID)
9232 btrfs_pin_log_trans(dest);
9234 /* Do the log updates for all inodes. */
9235 if (old_ino != BTRFS_FIRST_FREE_OBJECTID)
9236 btrfs_log_new_name(trans, old_dentry, BTRFS_I(old_dir),
9237 old_rename_ctx.index, new_dentry->d_parent);
9238 if (new_ino != BTRFS_FIRST_FREE_OBJECTID)
9239 btrfs_log_new_name(trans, new_dentry, BTRFS_I(new_dir),
9240 new_rename_ctx.index, old_dentry->d_parent);
9242 /* Now unpin the logs. */
9243 if (old_ino != BTRFS_FIRST_FREE_OBJECTID)
9244 btrfs_end_log_trans(root);
9245 if (new_ino != BTRFS_FIRST_FREE_OBJECTID)
9246 btrfs_end_log_trans(dest);
9248 ret2 = btrfs_end_transaction(trans);
9249 ret = ret ? ret : ret2;
9251 if (new_ino == BTRFS_FIRST_FREE_OBJECTID ||
9252 old_ino == BTRFS_FIRST_FREE_OBJECTID)
9253 up_read(&fs_info->subvol_sem);
9258 static int btrfs_whiteout_for_rename(struct btrfs_trans_handle *trans,
9259 struct btrfs_root *root,
9260 struct user_namespace *mnt_userns,
9262 struct dentry *dentry)
9265 struct inode *inode;
9269 ret = btrfs_get_free_objectid(root, &objectid);
9273 inode = btrfs_new_inode(trans, root, mnt_userns, dir,
9274 dentry->d_name.name,
9276 btrfs_ino(BTRFS_I(dir)),
9278 S_IFCHR | WHITEOUT_MODE,
9281 if (IS_ERR(inode)) {
9282 ret = PTR_ERR(inode);
9286 inode->i_op = &btrfs_special_inode_operations;
9287 init_special_inode(inode, inode->i_mode,
9290 ret = btrfs_init_inode_security(trans, inode, dir,
9295 ret = btrfs_add_nondir(trans, BTRFS_I(dir), dentry,
9296 BTRFS_I(inode), 0, index);
9300 ret = btrfs_update_inode(trans, root, BTRFS_I(inode));
9302 unlock_new_inode(inode);
9304 inode_dec_link_count(inode);
9310 static int btrfs_rename(struct user_namespace *mnt_userns,
9311 struct inode *old_dir, struct dentry *old_dentry,
9312 struct inode *new_dir, struct dentry *new_dentry,
9315 struct btrfs_fs_info *fs_info = btrfs_sb(old_dir->i_sb);
9316 struct btrfs_trans_handle *trans;
9317 unsigned int trans_num_items;
9318 struct btrfs_root *root = BTRFS_I(old_dir)->root;
9319 struct btrfs_root *dest = BTRFS_I(new_dir)->root;
9320 struct inode *new_inode = d_inode(new_dentry);
9321 struct inode *old_inode = d_inode(old_dentry);
9322 struct btrfs_rename_ctx rename_ctx;
9326 u64 old_ino = btrfs_ino(BTRFS_I(old_inode));
9328 if (btrfs_ino(BTRFS_I(new_dir)) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)
9331 /* we only allow rename subvolume link between subvolumes */
9332 if (old_ino != BTRFS_FIRST_FREE_OBJECTID && root != dest)
9335 if (old_ino == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID ||
9336 (new_inode && btrfs_ino(BTRFS_I(new_inode)) == BTRFS_FIRST_FREE_OBJECTID))
9339 if (S_ISDIR(old_inode->i_mode) && new_inode &&
9340 new_inode->i_size > BTRFS_EMPTY_DIR_SIZE)
9344 /* check for collisions, even if the name isn't there */
9345 ret = btrfs_check_dir_item_collision(dest, new_dir->i_ino,
9346 new_dentry->d_name.name,
9347 new_dentry->d_name.len);
9350 if (ret == -EEXIST) {
9352 * eexist without a new_inode */
9353 if (WARN_ON(!new_inode)) {
9357 /* maybe -EOVERFLOW */
9364 * we're using rename to replace one file with another. Start IO on it
9365 * now so we don't add too much work to the end of the transaction
9367 if (new_inode && S_ISREG(old_inode->i_mode) && new_inode->i_size)
9368 filemap_flush(old_inode->i_mapping);
9370 /* close the racy window with snapshot create/destroy ioctl */
9371 if (old_ino == BTRFS_FIRST_FREE_OBJECTID)
9372 down_read(&fs_info->subvol_sem);
9374 * We want to reserve the absolute worst case amount of items. So if
9375 * both inodes are subvols and we need to unlink them then that would
9376 * require 4 item modifications, but if they are both normal inodes it
9377 * would require 5 item modifications, so we'll assume they are normal
9378 * inodes. So 5 * 2 is 10, plus 1 for the new link, so 11 total items
9379 * should cover the worst case number of items we'll modify.
9380 * If our rename has the whiteout flag, we need more 5 units for the
9381 * new inode (1 inode item, 1 inode ref, 2 dir items and 1 xattr item
9382 * when selinux is enabled).
9384 trans_num_items = 11;
9385 if (flags & RENAME_WHITEOUT)
9386 trans_num_items += 5;
9387 trans = btrfs_start_transaction(root, trans_num_items);
9388 if (IS_ERR(trans)) {
9389 ret = PTR_ERR(trans);
9394 ret = btrfs_record_root_in_trans(trans, dest);
9399 ret = btrfs_set_inode_index(BTRFS_I(new_dir), &index);
9403 BTRFS_I(old_inode)->dir_index = 0ULL;
9404 if (unlikely(old_ino == BTRFS_FIRST_FREE_OBJECTID)) {
9405 /* force full log commit if subvolume involved. */
9406 btrfs_set_log_full_commit(trans);
9408 ret = btrfs_insert_inode_ref(trans, dest,
9409 new_dentry->d_name.name,
9410 new_dentry->d_name.len,
9412 btrfs_ino(BTRFS_I(new_dir)), index);
9417 inode_inc_iversion(old_dir);
9418 inode_inc_iversion(new_dir);
9419 inode_inc_iversion(old_inode);
9420 old_dir->i_ctime = old_dir->i_mtime =
9421 new_dir->i_ctime = new_dir->i_mtime =
9422 old_inode->i_ctime = current_time(old_dir);
9424 if (old_dentry->d_parent != new_dentry->d_parent)
9425 btrfs_record_unlink_dir(trans, BTRFS_I(old_dir),
9426 BTRFS_I(old_inode), 1);
9428 if (unlikely(old_ino == BTRFS_FIRST_FREE_OBJECTID)) {
9429 ret = btrfs_unlink_subvol(trans, old_dir, old_dentry);
9431 ret = __btrfs_unlink_inode(trans, BTRFS_I(old_dir),
9432 BTRFS_I(d_inode(old_dentry)),
9433 old_dentry->d_name.name,
9434 old_dentry->d_name.len,
9437 ret = btrfs_update_inode(trans, root, BTRFS_I(old_inode));
9440 btrfs_abort_transaction(trans, ret);
9445 inode_inc_iversion(new_inode);
9446 new_inode->i_ctime = current_time(new_inode);
9447 if (unlikely(btrfs_ino(BTRFS_I(new_inode)) ==
9448 BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)) {
9449 ret = btrfs_unlink_subvol(trans, new_dir, new_dentry);
9450 BUG_ON(new_inode->i_nlink == 0);
9452 ret = btrfs_unlink_inode(trans, BTRFS_I(new_dir),
9453 BTRFS_I(d_inode(new_dentry)),
9454 new_dentry->d_name.name,
9455 new_dentry->d_name.len);
9457 if (!ret && new_inode->i_nlink == 0)
9458 ret = btrfs_orphan_add(trans,
9459 BTRFS_I(d_inode(new_dentry)));
9461 btrfs_abort_transaction(trans, ret);
9466 ret = btrfs_add_link(trans, BTRFS_I(new_dir), BTRFS_I(old_inode),
9467 new_dentry->d_name.name,
9468 new_dentry->d_name.len, 0, index);
9470 btrfs_abort_transaction(trans, ret);
9474 if (old_inode->i_nlink == 1)
9475 BTRFS_I(old_inode)->dir_index = index;
9477 if (old_ino != BTRFS_FIRST_FREE_OBJECTID)
9478 btrfs_log_new_name(trans, old_dentry, BTRFS_I(old_dir),
9479 rename_ctx.index, new_dentry->d_parent);
9481 if (flags & RENAME_WHITEOUT) {
9482 ret = btrfs_whiteout_for_rename(trans, root, mnt_userns,
9483 old_dir, old_dentry);
9486 btrfs_abort_transaction(trans, ret);
9491 ret2 = btrfs_end_transaction(trans);
9492 ret = ret ? ret : ret2;
9494 if (old_ino == BTRFS_FIRST_FREE_OBJECTID)
9495 up_read(&fs_info->subvol_sem);
9500 static int btrfs_rename2(struct user_namespace *mnt_userns, struct inode *old_dir,
9501 struct dentry *old_dentry, struct inode *new_dir,
9502 struct dentry *new_dentry, unsigned int flags)
9504 if (flags & ~(RENAME_NOREPLACE | RENAME_EXCHANGE | RENAME_WHITEOUT))
9507 if (flags & RENAME_EXCHANGE)
9508 return btrfs_rename_exchange(old_dir, old_dentry, new_dir,
9511 return btrfs_rename(mnt_userns, old_dir, old_dentry, new_dir,
9515 struct btrfs_delalloc_work {
9516 struct inode *inode;
9517 struct completion completion;
9518 struct list_head list;
9519 struct btrfs_work work;
9522 static void btrfs_run_delalloc_work(struct btrfs_work *work)
9524 struct btrfs_delalloc_work *delalloc_work;
9525 struct inode *inode;
9527 delalloc_work = container_of(work, struct btrfs_delalloc_work,
9529 inode = delalloc_work->inode;
9530 filemap_flush(inode->i_mapping);
9531 if (test_bit(BTRFS_INODE_HAS_ASYNC_EXTENT,
9532 &BTRFS_I(inode)->runtime_flags))
9533 filemap_flush(inode->i_mapping);
9536 complete(&delalloc_work->completion);
9539 static struct btrfs_delalloc_work *btrfs_alloc_delalloc_work(struct inode *inode)
9541 struct btrfs_delalloc_work *work;
9543 work = kmalloc(sizeof(*work), GFP_NOFS);
9547 init_completion(&work->completion);
9548 INIT_LIST_HEAD(&work->list);
9549 work->inode = inode;
9550 btrfs_init_work(&work->work, btrfs_run_delalloc_work, NULL, NULL);
9556 * some fairly slow code that needs optimization. This walks the list
9557 * of all the inodes with pending delalloc and forces them to disk.
9559 static int start_delalloc_inodes(struct btrfs_root *root,
9560 struct writeback_control *wbc, bool snapshot,
9561 bool in_reclaim_context)
9563 struct btrfs_inode *binode;
9564 struct inode *inode;
9565 struct btrfs_delalloc_work *work, *next;
9566 struct list_head works;
9567 struct list_head splice;
9569 bool full_flush = wbc->nr_to_write == LONG_MAX;
9571 INIT_LIST_HEAD(&works);
9572 INIT_LIST_HEAD(&splice);
9574 mutex_lock(&root->delalloc_mutex);
9575 spin_lock(&root->delalloc_lock);
9576 list_splice_init(&root->delalloc_inodes, &splice);
9577 while (!list_empty(&splice)) {
9578 binode = list_entry(splice.next, struct btrfs_inode,
9581 list_move_tail(&binode->delalloc_inodes,
9582 &root->delalloc_inodes);
9584 if (in_reclaim_context &&
9585 test_bit(BTRFS_INODE_NO_DELALLOC_FLUSH, &binode->runtime_flags))
9588 inode = igrab(&binode->vfs_inode);
9590 cond_resched_lock(&root->delalloc_lock);
9593 spin_unlock(&root->delalloc_lock);
9596 set_bit(BTRFS_INODE_SNAPSHOT_FLUSH,
9597 &binode->runtime_flags);
9599 work = btrfs_alloc_delalloc_work(inode);
9605 list_add_tail(&work->list, &works);
9606 btrfs_queue_work(root->fs_info->flush_workers,
9609 ret = filemap_fdatawrite_wbc(inode->i_mapping, wbc);
9610 btrfs_add_delayed_iput(inode);
9611 if (ret || wbc->nr_to_write <= 0)
9615 spin_lock(&root->delalloc_lock);
9617 spin_unlock(&root->delalloc_lock);
9620 list_for_each_entry_safe(work, next, &works, list) {
9621 list_del_init(&work->list);
9622 wait_for_completion(&work->completion);
9626 if (!list_empty(&splice)) {
9627 spin_lock(&root->delalloc_lock);
9628 list_splice_tail(&splice, &root->delalloc_inodes);
9629 spin_unlock(&root->delalloc_lock);
9631 mutex_unlock(&root->delalloc_mutex);
9635 int btrfs_start_delalloc_snapshot(struct btrfs_root *root, bool in_reclaim_context)
9637 struct writeback_control wbc = {
9638 .nr_to_write = LONG_MAX,
9639 .sync_mode = WB_SYNC_NONE,
9641 .range_end = LLONG_MAX,
9643 struct btrfs_fs_info *fs_info = root->fs_info;
9645 if (BTRFS_FS_ERROR(fs_info))
9648 return start_delalloc_inodes(root, &wbc, true, in_reclaim_context);
9651 int btrfs_start_delalloc_roots(struct btrfs_fs_info *fs_info, long nr,
9652 bool in_reclaim_context)
9654 struct writeback_control wbc = {
9656 .sync_mode = WB_SYNC_NONE,
9658 .range_end = LLONG_MAX,
9660 struct btrfs_root *root;
9661 struct list_head splice;
9664 if (BTRFS_FS_ERROR(fs_info))
9667 INIT_LIST_HEAD(&splice);
9669 mutex_lock(&fs_info->delalloc_root_mutex);
9670 spin_lock(&fs_info->delalloc_root_lock);
9671 list_splice_init(&fs_info->delalloc_roots, &splice);
9672 while (!list_empty(&splice)) {
9674 * Reset nr_to_write here so we know that we're doing a full
9678 wbc.nr_to_write = LONG_MAX;
9680 root = list_first_entry(&splice, struct btrfs_root,
9682 root = btrfs_grab_root(root);
9684 list_move_tail(&root->delalloc_root,
9685 &fs_info->delalloc_roots);
9686 spin_unlock(&fs_info->delalloc_root_lock);
9688 ret = start_delalloc_inodes(root, &wbc, false, in_reclaim_context);
9689 btrfs_put_root(root);
9690 if (ret < 0 || wbc.nr_to_write <= 0)
9692 spin_lock(&fs_info->delalloc_root_lock);
9694 spin_unlock(&fs_info->delalloc_root_lock);
9698 if (!list_empty(&splice)) {
9699 spin_lock(&fs_info->delalloc_root_lock);
9700 list_splice_tail(&splice, &fs_info->delalloc_roots);
9701 spin_unlock(&fs_info->delalloc_root_lock);
9703 mutex_unlock(&fs_info->delalloc_root_mutex);
9707 static int btrfs_symlink(struct user_namespace *mnt_userns, struct inode *dir,
9708 struct dentry *dentry, const char *symname)
9710 struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
9711 struct btrfs_trans_handle *trans;
9712 struct btrfs_root *root = BTRFS_I(dir)->root;
9713 struct btrfs_path *path;
9714 struct btrfs_key key;
9715 struct inode *inode = NULL;
9722 struct btrfs_file_extent_item *ei;
9723 struct extent_buffer *leaf;
9725 name_len = strlen(symname);
9726 if (name_len > BTRFS_MAX_INLINE_DATA_SIZE(fs_info))
9727 return -ENAMETOOLONG;
9730 * 2 items for inode item and ref
9731 * 2 items for dir items
9732 * 1 item for updating parent inode item
9733 * 1 item for the inline extent item
9734 * 1 item for xattr if selinux is on
9736 trans = btrfs_start_transaction(root, 7);
9738 return PTR_ERR(trans);
9740 err = btrfs_get_free_objectid(root, &objectid);
9744 inode = btrfs_new_inode(trans, root, mnt_userns, dir,
9745 dentry->d_name.name, dentry->d_name.len,
9746 btrfs_ino(BTRFS_I(dir)), objectid,
9747 S_IFLNK | S_IRWXUGO, &index);
9748 if (IS_ERR(inode)) {
9749 err = PTR_ERR(inode);
9755 * If the active LSM wants to access the inode during
9756 * d_instantiate it needs these. Smack checks to see
9757 * if the filesystem supports xattrs by looking at the
9760 inode->i_fop = &btrfs_file_operations;
9761 inode->i_op = &btrfs_file_inode_operations;
9762 inode->i_mapping->a_ops = &btrfs_aops;
9764 err = btrfs_init_inode_security(trans, inode, dir, &dentry->d_name);
9768 path = btrfs_alloc_path();
9773 key.objectid = btrfs_ino(BTRFS_I(inode));
9775 key.type = BTRFS_EXTENT_DATA_KEY;
9776 datasize = btrfs_file_extent_calc_inline_size(name_len);
9777 err = btrfs_insert_empty_item(trans, root, path, &key,
9780 btrfs_free_path(path);
9783 leaf = path->nodes[0];
9784 ei = btrfs_item_ptr(leaf, path->slots[0],
9785 struct btrfs_file_extent_item);
9786 btrfs_set_file_extent_generation(leaf, ei, trans->transid);
9787 btrfs_set_file_extent_type(leaf, ei,
9788 BTRFS_FILE_EXTENT_INLINE);
9789 btrfs_set_file_extent_encryption(leaf, ei, 0);
9790 btrfs_set_file_extent_compression(leaf, ei, 0);
9791 btrfs_set_file_extent_other_encoding(leaf, ei, 0);
9792 btrfs_set_file_extent_ram_bytes(leaf, ei, name_len);
9794 ptr = btrfs_file_extent_inline_start(ei);
9795 write_extent_buffer(leaf, symname, ptr, name_len);
9796 btrfs_mark_buffer_dirty(leaf);
9797 btrfs_free_path(path);
9799 inode->i_op = &btrfs_symlink_inode_operations;
9800 inode_nohighmem(inode);
9801 inode_set_bytes(inode, name_len);
9802 btrfs_i_size_write(BTRFS_I(inode), name_len);
9803 err = btrfs_update_inode(trans, root, BTRFS_I(inode));
9805 * Last step, add directory indexes for our symlink inode. This is the
9806 * last step to avoid extra cleanup of these indexes if an error happens
9810 err = btrfs_add_nondir(trans, BTRFS_I(dir), dentry,
9811 BTRFS_I(inode), 0, index);
9815 d_instantiate_new(dentry, inode);
9818 btrfs_end_transaction(trans);
9820 inode_dec_link_count(inode);
9821 discard_new_inode(inode);
9823 btrfs_btree_balance_dirty(fs_info);
9827 static struct btrfs_trans_handle *insert_prealloc_file_extent(
9828 struct btrfs_trans_handle *trans_in,
9829 struct btrfs_inode *inode,
9830 struct btrfs_key *ins,
9833 struct btrfs_file_extent_item stack_fi;
9834 struct btrfs_replace_extent_info extent_info;
9835 struct btrfs_trans_handle *trans = trans_in;
9836 struct btrfs_path *path;
9837 u64 start = ins->objectid;
9838 u64 len = ins->offset;
9839 int qgroup_released;
9842 memset(&stack_fi, 0, sizeof(stack_fi));
9844 btrfs_set_stack_file_extent_type(&stack_fi, BTRFS_FILE_EXTENT_PREALLOC);
9845 btrfs_set_stack_file_extent_disk_bytenr(&stack_fi, start);
9846 btrfs_set_stack_file_extent_disk_num_bytes(&stack_fi, len);
9847 btrfs_set_stack_file_extent_num_bytes(&stack_fi, len);
9848 btrfs_set_stack_file_extent_ram_bytes(&stack_fi, len);
9849 btrfs_set_stack_file_extent_compression(&stack_fi, BTRFS_COMPRESS_NONE);
9850 /* Encryption and other encoding is reserved and all 0 */
9852 qgroup_released = btrfs_qgroup_release_data(inode, file_offset, len);
9853 if (qgroup_released < 0)
9854 return ERR_PTR(qgroup_released);
9857 ret = insert_reserved_file_extent(trans, inode,
9858 file_offset, &stack_fi,
9859 true, qgroup_released);
9865 extent_info.disk_offset = start;
9866 extent_info.disk_len = len;
9867 extent_info.data_offset = 0;
9868 extent_info.data_len = len;
9869 extent_info.file_offset = file_offset;
9870 extent_info.extent_buf = (char *)&stack_fi;
9871 extent_info.is_new_extent = true;
9872 extent_info.qgroup_reserved = qgroup_released;
9873 extent_info.insertions = 0;
9875 path = btrfs_alloc_path();
9881 ret = btrfs_replace_file_extents(inode, path, file_offset,
9882 file_offset + len - 1, &extent_info,
9884 btrfs_free_path(path);
9891 * We have released qgroup data range at the beginning of the function,
9892 * and normally qgroup_released bytes will be freed when committing
9894 * But if we error out early, we have to free what we have released
9895 * or we leak qgroup data reservation.
9897 btrfs_qgroup_free_refroot(inode->root->fs_info,
9898 inode->root->root_key.objectid, qgroup_released,
9899 BTRFS_QGROUP_RSV_DATA);
9900 return ERR_PTR(ret);
9903 static int __btrfs_prealloc_file_range(struct inode *inode, int mode,
9904 u64 start, u64 num_bytes, u64 min_size,
9905 loff_t actual_len, u64 *alloc_hint,
9906 struct btrfs_trans_handle *trans)
9908 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
9909 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
9910 struct extent_map *em;
9911 struct btrfs_root *root = BTRFS_I(inode)->root;
9912 struct btrfs_key ins;
9913 u64 cur_offset = start;
9914 u64 clear_offset = start;
9917 u64 last_alloc = (u64)-1;
9919 bool own_trans = true;
9920 u64 end = start + num_bytes - 1;
9924 while (num_bytes > 0) {
9925 cur_bytes = min_t(u64, num_bytes, SZ_256M);
9926 cur_bytes = max(cur_bytes, min_size);
9928 * If we are severely fragmented we could end up with really
9929 * small allocations, so if the allocator is returning small
9930 * chunks lets make its job easier by only searching for those
9933 cur_bytes = min(cur_bytes, last_alloc);
9934 ret = btrfs_reserve_extent(root, cur_bytes, cur_bytes,
9935 min_size, 0, *alloc_hint, &ins, 1, 0);
9940 * We've reserved this space, and thus converted it from
9941 * ->bytes_may_use to ->bytes_reserved. Any error that happens
9942 * from here on out we will only need to clear our reservation
9943 * for the remaining unreserved area, so advance our
9944 * clear_offset by our extent size.
9946 clear_offset += ins.offset;
9948 last_alloc = ins.offset;
9949 trans = insert_prealloc_file_extent(trans, BTRFS_I(inode),
9952 * Now that we inserted the prealloc extent we can finally
9953 * decrement the number of reservations in the block group.
9954 * If we did it before, we could race with relocation and have
9955 * relocation miss the reserved extent, making it fail later.
9957 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
9958 if (IS_ERR(trans)) {
9959 ret = PTR_ERR(trans);
9960 btrfs_free_reserved_extent(fs_info, ins.objectid,
9965 btrfs_drop_extent_cache(BTRFS_I(inode), cur_offset,
9966 cur_offset + ins.offset -1, 0);
9968 em = alloc_extent_map();
9970 btrfs_set_inode_full_sync(BTRFS_I(inode));
9974 em->start = cur_offset;
9975 em->orig_start = cur_offset;
9976 em->len = ins.offset;
9977 em->block_start = ins.objectid;
9978 em->block_len = ins.offset;
9979 em->orig_block_len = ins.offset;
9980 em->ram_bytes = ins.offset;
9981 set_bit(EXTENT_FLAG_PREALLOC, &em->flags);
9982 em->generation = trans->transid;
9985 write_lock(&em_tree->lock);
9986 ret = add_extent_mapping(em_tree, em, 1);
9987 write_unlock(&em_tree->lock);
9990 btrfs_drop_extent_cache(BTRFS_I(inode), cur_offset,
9991 cur_offset + ins.offset - 1,
9994 free_extent_map(em);
9996 num_bytes -= ins.offset;
9997 cur_offset += ins.offset;
9998 *alloc_hint = ins.objectid + ins.offset;
10000 inode_inc_iversion(inode);
10001 inode->i_ctime = current_time(inode);
10002 BTRFS_I(inode)->flags |= BTRFS_INODE_PREALLOC;
10003 if (!(mode & FALLOC_FL_KEEP_SIZE) &&
10004 (actual_len > inode->i_size) &&
10005 (cur_offset > inode->i_size)) {
10006 if (cur_offset > actual_len)
10007 i_size = actual_len;
10009 i_size = cur_offset;
10010 i_size_write(inode, i_size);
10011 btrfs_inode_safe_disk_i_size_write(BTRFS_I(inode), 0);
10014 ret = btrfs_update_inode(trans, root, BTRFS_I(inode));
10017 btrfs_abort_transaction(trans, ret);
10019 btrfs_end_transaction(trans);
10024 btrfs_end_transaction(trans);
10028 if (clear_offset < end)
10029 btrfs_free_reserved_data_space(BTRFS_I(inode), NULL, clear_offset,
10030 end - clear_offset + 1);
10034 int btrfs_prealloc_file_range(struct inode *inode, int mode,
10035 u64 start, u64 num_bytes, u64 min_size,
10036 loff_t actual_len, u64 *alloc_hint)
10038 return __btrfs_prealloc_file_range(inode, mode, start, num_bytes,
10039 min_size, actual_len, alloc_hint,
10043 int btrfs_prealloc_file_range_trans(struct inode *inode,
10044 struct btrfs_trans_handle *trans, int mode,
10045 u64 start, u64 num_bytes, u64 min_size,
10046 loff_t actual_len, u64 *alloc_hint)
10048 return __btrfs_prealloc_file_range(inode, mode, start, num_bytes,
10049 min_size, actual_len, alloc_hint, trans);
10052 static int btrfs_permission(struct user_namespace *mnt_userns,
10053 struct inode *inode, int mask)
10055 struct btrfs_root *root = BTRFS_I(inode)->root;
10056 umode_t mode = inode->i_mode;
10058 if (mask & MAY_WRITE &&
10059 (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode))) {
10060 if (btrfs_root_readonly(root))
10062 if (BTRFS_I(inode)->flags & BTRFS_INODE_READONLY)
10065 return generic_permission(mnt_userns, inode, mask);
10068 static int btrfs_tmpfile(struct user_namespace *mnt_userns, struct inode *dir,
10069 struct dentry *dentry, umode_t mode)
10071 struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
10072 struct btrfs_trans_handle *trans;
10073 struct btrfs_root *root = BTRFS_I(dir)->root;
10074 struct inode *inode = NULL;
10080 * 5 units required for adding orphan entry
10082 trans = btrfs_start_transaction(root, 5);
10084 return PTR_ERR(trans);
10086 ret = btrfs_get_free_objectid(root, &objectid);
10090 inode = btrfs_new_inode(trans, root, mnt_userns, dir, NULL, 0,
10091 btrfs_ino(BTRFS_I(dir)), objectid, mode, &index);
10092 if (IS_ERR(inode)) {
10093 ret = PTR_ERR(inode);
10098 inode->i_fop = &btrfs_file_operations;
10099 inode->i_op = &btrfs_file_inode_operations;
10101 inode->i_mapping->a_ops = &btrfs_aops;
10103 ret = btrfs_init_inode_security(trans, inode, dir, NULL);
10107 ret = btrfs_update_inode(trans, root, BTRFS_I(inode));
10110 ret = btrfs_orphan_add(trans, BTRFS_I(inode));
10115 * We set number of links to 0 in btrfs_new_inode(), and here we set
10116 * it to 1 because d_tmpfile() will issue a warning if the count is 0,
10119 * d_tmpfile() -> inode_dec_link_count() -> drop_nlink()
10121 set_nlink(inode, 1);
10122 d_tmpfile(dentry, inode);
10123 unlock_new_inode(inode);
10124 mark_inode_dirty(inode);
10126 btrfs_end_transaction(trans);
10128 discard_new_inode(inode);
10129 btrfs_btree_balance_dirty(fs_info);
10133 void btrfs_set_range_writeback(struct btrfs_inode *inode, u64 start, u64 end)
10135 struct btrfs_fs_info *fs_info = inode->root->fs_info;
10136 unsigned long index = start >> PAGE_SHIFT;
10137 unsigned long end_index = end >> PAGE_SHIFT;
10141 ASSERT(end + 1 - start <= U32_MAX);
10142 len = end + 1 - start;
10143 while (index <= end_index) {
10144 page = find_get_page(inode->vfs_inode.i_mapping, index);
10145 ASSERT(page); /* Pages should be in the extent_io_tree */
10147 btrfs_page_set_writeback(fs_info, page, start, len);
10153 static int btrfs_encoded_io_compression_from_extent(
10154 struct btrfs_fs_info *fs_info,
10157 switch (compress_type) {
10158 case BTRFS_COMPRESS_NONE:
10159 return BTRFS_ENCODED_IO_COMPRESSION_NONE;
10160 case BTRFS_COMPRESS_ZLIB:
10161 return BTRFS_ENCODED_IO_COMPRESSION_ZLIB;
10162 case BTRFS_COMPRESS_LZO:
10164 * The LZO format depends on the sector size. 64K is the maximum
10165 * sector size that we support.
10167 if (fs_info->sectorsize < SZ_4K || fs_info->sectorsize > SZ_64K)
10169 return BTRFS_ENCODED_IO_COMPRESSION_LZO_4K +
10170 (fs_info->sectorsize_bits - 12);
10171 case BTRFS_COMPRESS_ZSTD:
10172 return BTRFS_ENCODED_IO_COMPRESSION_ZSTD;
10178 static ssize_t btrfs_encoded_read_inline(
10179 struct kiocb *iocb,
10180 struct iov_iter *iter, u64 start,
10182 struct extent_state **cached_state,
10183 u64 extent_start, size_t count,
10184 struct btrfs_ioctl_encoded_io_args *encoded,
10187 struct btrfs_inode *inode = BTRFS_I(file_inode(iocb->ki_filp));
10188 struct btrfs_root *root = inode->root;
10189 struct btrfs_fs_info *fs_info = root->fs_info;
10190 struct extent_io_tree *io_tree = &inode->io_tree;
10191 struct btrfs_path *path;
10192 struct extent_buffer *leaf;
10193 struct btrfs_file_extent_item *item;
10199 path = btrfs_alloc_path();
10204 ret = btrfs_lookup_file_extent(NULL, root, path, btrfs_ino(inode),
10208 /* The extent item disappeared? */
10213 leaf = path->nodes[0];
10214 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_file_extent_item);
10216 ram_bytes = btrfs_file_extent_ram_bytes(leaf, item);
10217 ptr = btrfs_file_extent_inline_start(item);
10219 encoded->len = min_t(u64, extent_start + ram_bytes,
10220 inode->vfs_inode.i_size) - iocb->ki_pos;
10221 ret = btrfs_encoded_io_compression_from_extent(fs_info,
10222 btrfs_file_extent_compression(leaf, item));
10225 encoded->compression = ret;
10226 if (encoded->compression) {
10227 size_t inline_size;
10229 inline_size = btrfs_file_extent_inline_item_len(leaf,
10231 if (inline_size > count) {
10235 count = inline_size;
10236 encoded->unencoded_len = ram_bytes;
10237 encoded->unencoded_offset = iocb->ki_pos - extent_start;
10239 count = min_t(u64, count, encoded->len);
10240 encoded->len = count;
10241 encoded->unencoded_len = count;
10242 ptr += iocb->ki_pos - extent_start;
10245 tmp = kmalloc(count, GFP_NOFS);
10250 read_extent_buffer(leaf, tmp, ptr, count);
10251 btrfs_release_path(path);
10252 unlock_extent_cached(io_tree, start, lockend, cached_state);
10253 btrfs_inode_unlock(&inode->vfs_inode, BTRFS_ILOCK_SHARED);
10256 ret = copy_to_iter(tmp, count, iter);
10261 btrfs_free_path(path);
10265 struct btrfs_encoded_read_private {
10266 struct btrfs_inode *inode;
10268 wait_queue_head_t wait;
10270 blk_status_t status;
10274 static blk_status_t submit_encoded_read_bio(struct btrfs_inode *inode,
10275 struct bio *bio, int mirror_num)
10277 struct btrfs_encoded_read_private *priv = bio->bi_private;
10278 struct btrfs_bio *bbio = btrfs_bio(bio);
10279 struct btrfs_fs_info *fs_info = inode->root->fs_info;
10282 if (!priv->skip_csum) {
10283 ret = btrfs_lookup_bio_sums(&inode->vfs_inode, bio, NULL);
10288 ret = btrfs_bio_wq_end_io(fs_info, bio, BTRFS_WQ_ENDIO_DATA);
10290 btrfs_bio_free_csum(bbio);
10294 atomic_inc(&priv->pending);
10295 ret = btrfs_map_bio(fs_info, bio, mirror_num);
10297 atomic_dec(&priv->pending);
10298 btrfs_bio_free_csum(bbio);
10303 static blk_status_t btrfs_encoded_read_verify_csum(struct btrfs_bio *bbio)
10305 const bool uptodate = (bbio->bio.bi_status == BLK_STS_OK);
10306 struct btrfs_encoded_read_private *priv = bbio->bio.bi_private;
10307 struct btrfs_inode *inode = priv->inode;
10308 struct btrfs_fs_info *fs_info = inode->root->fs_info;
10309 u32 sectorsize = fs_info->sectorsize;
10310 struct bio_vec *bvec;
10311 struct bvec_iter_all iter_all;
10312 u64 start = priv->file_offset;
10313 u32 bio_offset = 0;
10315 if (priv->skip_csum || !uptodate)
10316 return bbio->bio.bi_status;
10318 bio_for_each_segment_all(bvec, &bbio->bio, iter_all) {
10319 unsigned int i, nr_sectors, pgoff;
10321 nr_sectors = BTRFS_BYTES_TO_BLKS(fs_info, bvec->bv_len);
10322 pgoff = bvec->bv_offset;
10323 for (i = 0; i < nr_sectors; i++) {
10324 ASSERT(pgoff < PAGE_SIZE);
10325 if (check_data_csum(&inode->vfs_inode, bbio, bio_offset,
10326 bvec->bv_page, pgoff, start))
10327 return BLK_STS_IOERR;
10328 start += sectorsize;
10329 bio_offset += sectorsize;
10330 pgoff += sectorsize;
10336 static void btrfs_encoded_read_endio(struct bio *bio)
10338 struct btrfs_encoded_read_private *priv = bio->bi_private;
10339 struct btrfs_bio *bbio = btrfs_bio(bio);
10340 blk_status_t status;
10342 status = btrfs_encoded_read_verify_csum(bbio);
10345 * The memory barrier implied by the atomic_dec_return() here
10346 * pairs with the memory barrier implied by the
10347 * atomic_dec_return() or io_wait_event() in
10348 * btrfs_encoded_read_regular_fill_pages() to ensure that this
10349 * write is observed before the load of status in
10350 * btrfs_encoded_read_regular_fill_pages().
10352 WRITE_ONCE(priv->status, status);
10354 if (!atomic_dec_return(&priv->pending))
10355 wake_up(&priv->wait);
10356 btrfs_bio_free_csum(bbio);
10360 static int btrfs_encoded_read_regular_fill_pages(struct btrfs_inode *inode,
10364 struct page **pages)
10366 struct btrfs_fs_info *fs_info = inode->root->fs_info;
10367 struct btrfs_encoded_read_private priv = {
10369 .file_offset = file_offset,
10370 .pending = ATOMIC_INIT(1),
10371 .skip_csum = (inode->flags & BTRFS_INODE_NODATASUM),
10373 unsigned long i = 0;
10377 init_waitqueue_head(&priv.wait);
10379 * Submit bios for the extent, splitting due to bio or stripe limits as
10382 while (cur < disk_io_size) {
10383 struct extent_map *em;
10384 struct btrfs_io_geometry geom;
10385 struct bio *bio = NULL;
10388 em = btrfs_get_chunk_map(fs_info, disk_bytenr + cur,
10389 disk_io_size - cur);
10393 ret = btrfs_get_io_geometry(fs_info, em, BTRFS_MAP_READ,
10394 disk_bytenr + cur, &geom);
10395 free_extent_map(em);
10398 WRITE_ONCE(priv.status, errno_to_blk_status(ret));
10401 remaining = min(geom.len, disk_io_size - cur);
10402 while (bio || remaining) {
10403 size_t bytes = min_t(u64, remaining, PAGE_SIZE);
10406 bio = btrfs_bio_alloc(BIO_MAX_VECS);
10407 bio->bi_iter.bi_sector =
10408 (disk_bytenr + cur) >> SECTOR_SHIFT;
10409 bio->bi_end_io = btrfs_encoded_read_endio;
10410 bio->bi_private = &priv;
10411 bio->bi_opf = REQ_OP_READ;
10415 bio_add_page(bio, pages[i], bytes, 0) < bytes) {
10416 blk_status_t status;
10418 status = submit_encoded_read_bio(inode, bio, 0);
10420 WRITE_ONCE(priv.status, status);
10430 remaining -= bytes;
10435 if (atomic_dec_return(&priv.pending))
10436 io_wait_event(priv.wait, !atomic_read(&priv.pending));
10437 /* See btrfs_encoded_read_endio() for ordering. */
10438 return blk_status_to_errno(READ_ONCE(priv.status));
10441 static ssize_t btrfs_encoded_read_regular(struct kiocb *iocb,
10442 struct iov_iter *iter,
10443 u64 start, u64 lockend,
10444 struct extent_state **cached_state,
10445 u64 disk_bytenr, u64 disk_io_size,
10446 size_t count, bool compressed,
10449 struct btrfs_inode *inode = BTRFS_I(file_inode(iocb->ki_filp));
10450 struct extent_io_tree *io_tree = &inode->io_tree;
10451 struct page **pages;
10452 unsigned long nr_pages, i;
10454 size_t page_offset;
10457 nr_pages = DIV_ROUND_UP(disk_io_size, PAGE_SIZE);
10458 pages = kcalloc(nr_pages, sizeof(struct page *), GFP_NOFS);
10461 for (i = 0; i < nr_pages; i++) {
10462 pages[i] = alloc_page(GFP_NOFS);
10469 ret = btrfs_encoded_read_regular_fill_pages(inode, start, disk_bytenr,
10470 disk_io_size, pages);
10474 unlock_extent_cached(io_tree, start, lockend, cached_state);
10475 btrfs_inode_unlock(&inode->vfs_inode, BTRFS_ILOCK_SHARED);
10482 i = (iocb->ki_pos - start) >> PAGE_SHIFT;
10483 page_offset = (iocb->ki_pos - start) & (PAGE_SIZE - 1);
10486 while (cur < count) {
10487 size_t bytes = min_t(size_t, count - cur,
10488 PAGE_SIZE - page_offset);
10490 if (copy_page_to_iter(pages[i], page_offset, bytes,
10501 for (i = 0; i < nr_pages; i++) {
10503 __free_page(pages[i]);
10509 ssize_t btrfs_encoded_read(struct kiocb *iocb, struct iov_iter *iter,
10510 struct btrfs_ioctl_encoded_io_args *encoded)
10512 struct btrfs_inode *inode = BTRFS_I(file_inode(iocb->ki_filp));
10513 struct btrfs_fs_info *fs_info = inode->root->fs_info;
10514 struct extent_io_tree *io_tree = &inode->io_tree;
10516 size_t count = iov_iter_count(iter);
10517 u64 start, lockend, disk_bytenr, disk_io_size;
10518 struct extent_state *cached_state = NULL;
10519 struct extent_map *em;
10520 bool unlocked = false;
10522 file_accessed(iocb->ki_filp);
10524 btrfs_inode_lock(&inode->vfs_inode, BTRFS_ILOCK_SHARED);
10526 if (iocb->ki_pos >= inode->vfs_inode.i_size) {
10527 btrfs_inode_unlock(&inode->vfs_inode, BTRFS_ILOCK_SHARED);
10530 start = ALIGN_DOWN(iocb->ki_pos, fs_info->sectorsize);
10532 * We don't know how long the extent containing iocb->ki_pos is, but if
10533 * it's compressed we know that it won't be longer than this.
10535 lockend = start + BTRFS_MAX_UNCOMPRESSED - 1;
10538 struct btrfs_ordered_extent *ordered;
10540 ret = btrfs_wait_ordered_range(&inode->vfs_inode, start,
10541 lockend - start + 1);
10543 goto out_unlock_inode;
10544 lock_extent_bits(io_tree, start, lockend, &cached_state);
10545 ordered = btrfs_lookup_ordered_range(inode, start,
10546 lockend - start + 1);
10549 btrfs_put_ordered_extent(ordered);
10550 unlock_extent_cached(io_tree, start, lockend, &cached_state);
10554 em = btrfs_get_extent(inode, NULL, 0, start, lockend - start + 1);
10557 goto out_unlock_extent;
10560 if (em->block_start == EXTENT_MAP_INLINE) {
10561 u64 extent_start = em->start;
10564 * For inline extents we get everything we need out of the
10567 free_extent_map(em);
10569 ret = btrfs_encoded_read_inline(iocb, iter, start, lockend,
10570 &cached_state, extent_start,
10571 count, encoded, &unlocked);
10576 * We only want to return up to EOF even if the extent extends beyond
10579 encoded->len = min_t(u64, extent_map_end(em),
10580 inode->vfs_inode.i_size) - iocb->ki_pos;
10581 if (em->block_start == EXTENT_MAP_HOLE ||
10582 test_bit(EXTENT_FLAG_PREALLOC, &em->flags)) {
10583 disk_bytenr = EXTENT_MAP_HOLE;
10584 count = min_t(u64, count, encoded->len);
10585 encoded->len = count;
10586 encoded->unencoded_len = count;
10587 } else if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) {
10588 disk_bytenr = em->block_start;
10590 * Bail if the buffer isn't large enough to return the whole
10591 * compressed extent.
10593 if (em->block_len > count) {
10597 disk_io_size = count = em->block_len;
10598 encoded->unencoded_len = em->ram_bytes;
10599 encoded->unencoded_offset = iocb->ki_pos - em->orig_start;
10600 ret = btrfs_encoded_io_compression_from_extent(fs_info,
10601 em->compress_type);
10604 encoded->compression = ret;
10606 disk_bytenr = em->block_start + (start - em->start);
10607 if (encoded->len > count)
10608 encoded->len = count;
10610 * Don't read beyond what we locked. This also limits the page
10611 * allocations that we'll do.
10613 disk_io_size = min(lockend + 1, iocb->ki_pos + encoded->len) - start;
10614 count = start + disk_io_size - iocb->ki_pos;
10615 encoded->len = count;
10616 encoded->unencoded_len = count;
10617 disk_io_size = ALIGN(disk_io_size, fs_info->sectorsize);
10619 free_extent_map(em);
10622 if (disk_bytenr == EXTENT_MAP_HOLE) {
10623 unlock_extent_cached(io_tree, start, lockend, &cached_state);
10624 btrfs_inode_unlock(&inode->vfs_inode, BTRFS_ILOCK_SHARED);
10626 ret = iov_iter_zero(count, iter);
10630 ret = btrfs_encoded_read_regular(iocb, iter, start, lockend,
10631 &cached_state, disk_bytenr,
10632 disk_io_size, count,
10633 encoded->compression,
10639 iocb->ki_pos += encoded->len;
10641 free_extent_map(em);
10644 unlock_extent_cached(io_tree, start, lockend, &cached_state);
10647 btrfs_inode_unlock(&inode->vfs_inode, BTRFS_ILOCK_SHARED);
10651 ssize_t btrfs_do_encoded_write(struct kiocb *iocb, struct iov_iter *from,
10652 const struct btrfs_ioctl_encoded_io_args *encoded)
10654 struct btrfs_inode *inode = BTRFS_I(file_inode(iocb->ki_filp));
10655 struct btrfs_root *root = inode->root;
10656 struct btrfs_fs_info *fs_info = root->fs_info;
10657 struct extent_io_tree *io_tree = &inode->io_tree;
10658 struct extent_changeset *data_reserved = NULL;
10659 struct extent_state *cached_state = NULL;
10663 u64 num_bytes, ram_bytes, disk_num_bytes;
10664 unsigned long nr_pages, i;
10665 struct page **pages;
10666 struct btrfs_key ins;
10667 bool extent_reserved = false;
10668 struct extent_map *em;
10671 switch (encoded->compression) {
10672 case BTRFS_ENCODED_IO_COMPRESSION_ZLIB:
10673 compression = BTRFS_COMPRESS_ZLIB;
10675 case BTRFS_ENCODED_IO_COMPRESSION_ZSTD:
10676 compression = BTRFS_COMPRESS_ZSTD;
10678 case BTRFS_ENCODED_IO_COMPRESSION_LZO_4K:
10679 case BTRFS_ENCODED_IO_COMPRESSION_LZO_8K:
10680 case BTRFS_ENCODED_IO_COMPRESSION_LZO_16K:
10681 case BTRFS_ENCODED_IO_COMPRESSION_LZO_32K:
10682 case BTRFS_ENCODED_IO_COMPRESSION_LZO_64K:
10683 /* The sector size must match for LZO. */
10684 if (encoded->compression -
10685 BTRFS_ENCODED_IO_COMPRESSION_LZO_4K + 12 !=
10686 fs_info->sectorsize_bits)
10688 compression = BTRFS_COMPRESS_LZO;
10693 if (encoded->encryption != BTRFS_ENCODED_IO_ENCRYPTION_NONE)
10696 orig_count = iov_iter_count(from);
10698 /* The extent size must be sane. */
10699 if (encoded->unencoded_len > BTRFS_MAX_UNCOMPRESSED ||
10700 orig_count > BTRFS_MAX_COMPRESSED || orig_count == 0)
10704 * The compressed data must be smaller than the decompressed data.
10706 * It's of course possible for data to compress to larger or the same
10707 * size, but the buffered I/O path falls back to no compression for such
10708 * data, and we don't want to break any assumptions by creating these
10711 * Note that this is less strict than the current check we have that the
10712 * compressed data must be at least one sector smaller than the
10713 * decompressed data. We only want to enforce the weaker requirement
10714 * from old kernels that it is at least one byte smaller.
10716 if (orig_count >= encoded->unencoded_len)
10719 /* The extent must start on a sector boundary. */
10720 start = iocb->ki_pos;
10721 if (!IS_ALIGNED(start, fs_info->sectorsize))
10725 * The extent must end on a sector boundary. However, we allow a write
10726 * which ends at or extends i_size to have an unaligned length; we round
10727 * up the extent size and set i_size to the unaligned end.
10729 if (start + encoded->len < inode->vfs_inode.i_size &&
10730 !IS_ALIGNED(start + encoded->len, fs_info->sectorsize))
10733 /* Finally, the offset in the unencoded data must be sector-aligned. */
10734 if (!IS_ALIGNED(encoded->unencoded_offset, fs_info->sectorsize))
10737 num_bytes = ALIGN(encoded->len, fs_info->sectorsize);
10738 ram_bytes = ALIGN(encoded->unencoded_len, fs_info->sectorsize);
10739 end = start + num_bytes - 1;
10742 * If the extent cannot be inline, the compressed data on disk must be
10743 * sector-aligned. For convenience, we extend it with zeroes if it
10746 disk_num_bytes = ALIGN(orig_count, fs_info->sectorsize);
10747 nr_pages = DIV_ROUND_UP(disk_num_bytes, PAGE_SIZE);
10748 pages = kvcalloc(nr_pages, sizeof(struct page *), GFP_KERNEL_ACCOUNT);
10751 for (i = 0; i < nr_pages; i++) {
10752 size_t bytes = min_t(size_t, PAGE_SIZE, iov_iter_count(from));
10755 pages[i] = alloc_page(GFP_KERNEL_ACCOUNT);
10760 kaddr = kmap(pages[i]);
10761 if (copy_from_iter(kaddr, bytes, from) != bytes) {
10766 if (bytes < PAGE_SIZE)
10767 memset(kaddr + bytes, 0, PAGE_SIZE - bytes);
10772 struct btrfs_ordered_extent *ordered;
10774 ret = btrfs_wait_ordered_range(&inode->vfs_inode, start, num_bytes);
10777 ret = invalidate_inode_pages2_range(inode->vfs_inode.i_mapping,
10778 start >> PAGE_SHIFT,
10779 end >> PAGE_SHIFT);
10782 lock_extent_bits(io_tree, start, end, &cached_state);
10783 ordered = btrfs_lookup_ordered_range(inode, start, num_bytes);
10785 !filemap_range_has_page(inode->vfs_inode.i_mapping, start, end))
10788 btrfs_put_ordered_extent(ordered);
10789 unlock_extent_cached(io_tree, start, end, &cached_state);
10794 * We don't use the higher-level delalloc space functions because our
10795 * num_bytes and disk_num_bytes are different.
10797 ret = btrfs_alloc_data_chunk_ondemand(inode, disk_num_bytes);
10800 ret = btrfs_qgroup_reserve_data(inode, &data_reserved, start, num_bytes);
10802 goto out_free_data_space;
10803 ret = btrfs_delalloc_reserve_metadata(inode, num_bytes, disk_num_bytes);
10805 goto out_qgroup_free_data;
10807 /* Try an inline extent first. */
10808 if (start == 0 && encoded->unencoded_len == encoded->len &&
10809 encoded->unencoded_offset == 0) {
10810 ret = cow_file_range_inline(inode, encoded->len, orig_count,
10811 compression, pages, true);
10815 goto out_delalloc_release;
10819 ret = btrfs_reserve_extent(root, disk_num_bytes, disk_num_bytes,
10820 disk_num_bytes, 0, 0, &ins, 1, 1);
10822 goto out_delalloc_release;
10823 extent_reserved = true;
10825 em = create_io_em(inode, start, num_bytes,
10826 start - encoded->unencoded_offset, ins.objectid,
10827 ins.offset, ins.offset, ram_bytes, compression,
10828 BTRFS_ORDERED_COMPRESSED);
10831 goto out_free_reserved;
10833 free_extent_map(em);
10835 ret = btrfs_add_ordered_extent(inode, start, num_bytes, ram_bytes,
10836 ins.objectid, ins.offset,
10837 encoded->unencoded_offset,
10838 (1 << BTRFS_ORDERED_ENCODED) |
10839 (1 << BTRFS_ORDERED_COMPRESSED),
10842 btrfs_drop_extent_cache(inode, start, end, 0);
10843 goto out_free_reserved;
10845 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
10847 if (start + encoded->len > inode->vfs_inode.i_size)
10848 i_size_write(&inode->vfs_inode, start + encoded->len);
10850 unlock_extent_cached(io_tree, start, end, &cached_state);
10852 btrfs_delalloc_release_extents(inode, num_bytes);
10854 if (btrfs_submit_compressed_write(inode, start, num_bytes, ins.objectid,
10855 ins.offset, pages, nr_pages, 0, NULL,
10857 btrfs_writepage_endio_finish_ordered(inode, pages[0], start, end, 0);
10865 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
10866 btrfs_free_reserved_extent(fs_info, ins.objectid, ins.offset, 1);
10867 out_delalloc_release:
10868 btrfs_delalloc_release_extents(inode, num_bytes);
10869 btrfs_delalloc_release_metadata(inode, disk_num_bytes, ret < 0);
10870 out_qgroup_free_data:
10872 btrfs_qgroup_free_data(inode, data_reserved, start, num_bytes);
10873 out_free_data_space:
10875 * If btrfs_reserve_extent() succeeded, then we already decremented
10878 if (!extent_reserved)
10879 btrfs_free_reserved_data_space_noquota(fs_info, disk_num_bytes);
10881 unlock_extent_cached(io_tree, start, end, &cached_state);
10883 for (i = 0; i < nr_pages; i++) {
10885 __free_page(pages[i]);
10890 iocb->ki_pos += encoded->len;
10896 * Add an entry indicating a block group or device which is pinned by a
10897 * swapfile. Returns 0 on success, 1 if there is already an entry for it, or a
10898 * negative errno on failure.
10900 static int btrfs_add_swapfile_pin(struct inode *inode, void *ptr,
10901 bool is_block_group)
10903 struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info;
10904 struct btrfs_swapfile_pin *sp, *entry;
10905 struct rb_node **p;
10906 struct rb_node *parent = NULL;
10908 sp = kmalloc(sizeof(*sp), GFP_NOFS);
10913 sp->is_block_group = is_block_group;
10914 sp->bg_extent_count = 1;
10916 spin_lock(&fs_info->swapfile_pins_lock);
10917 p = &fs_info->swapfile_pins.rb_node;
10920 entry = rb_entry(parent, struct btrfs_swapfile_pin, node);
10921 if (sp->ptr < entry->ptr ||
10922 (sp->ptr == entry->ptr && sp->inode < entry->inode)) {
10923 p = &(*p)->rb_left;
10924 } else if (sp->ptr > entry->ptr ||
10925 (sp->ptr == entry->ptr && sp->inode > entry->inode)) {
10926 p = &(*p)->rb_right;
10928 if (is_block_group)
10929 entry->bg_extent_count++;
10930 spin_unlock(&fs_info->swapfile_pins_lock);
10935 rb_link_node(&sp->node, parent, p);
10936 rb_insert_color(&sp->node, &fs_info->swapfile_pins);
10937 spin_unlock(&fs_info->swapfile_pins_lock);
10941 /* Free all of the entries pinned by this swapfile. */
10942 static void btrfs_free_swapfile_pins(struct inode *inode)
10944 struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info;
10945 struct btrfs_swapfile_pin *sp;
10946 struct rb_node *node, *next;
10948 spin_lock(&fs_info->swapfile_pins_lock);
10949 node = rb_first(&fs_info->swapfile_pins);
10951 next = rb_next(node);
10952 sp = rb_entry(node, struct btrfs_swapfile_pin, node);
10953 if (sp->inode == inode) {
10954 rb_erase(&sp->node, &fs_info->swapfile_pins);
10955 if (sp->is_block_group) {
10956 btrfs_dec_block_group_swap_extents(sp->ptr,
10957 sp->bg_extent_count);
10958 btrfs_put_block_group(sp->ptr);
10964 spin_unlock(&fs_info->swapfile_pins_lock);
10967 struct btrfs_swap_info {
10973 unsigned long nr_pages;
10977 static int btrfs_add_swap_extent(struct swap_info_struct *sis,
10978 struct btrfs_swap_info *bsi)
10980 unsigned long nr_pages;
10981 unsigned long max_pages;
10982 u64 first_ppage, first_ppage_reported, next_ppage;
10986 * Our swapfile may have had its size extended after the swap header was
10987 * written. In that case activating the swapfile should not go beyond
10988 * the max size set in the swap header.
10990 if (bsi->nr_pages >= sis->max)
10993 max_pages = sis->max - bsi->nr_pages;
10994 first_ppage = ALIGN(bsi->block_start, PAGE_SIZE) >> PAGE_SHIFT;
10995 next_ppage = ALIGN_DOWN(bsi->block_start + bsi->block_len,
10996 PAGE_SIZE) >> PAGE_SHIFT;
10998 if (first_ppage >= next_ppage)
11000 nr_pages = next_ppage - first_ppage;
11001 nr_pages = min(nr_pages, max_pages);
11003 first_ppage_reported = first_ppage;
11004 if (bsi->start == 0)
11005 first_ppage_reported++;
11006 if (bsi->lowest_ppage > first_ppage_reported)
11007 bsi->lowest_ppage = first_ppage_reported;
11008 if (bsi->highest_ppage < (next_ppage - 1))
11009 bsi->highest_ppage = next_ppage - 1;
11011 ret = add_swap_extent(sis, bsi->nr_pages, nr_pages, first_ppage);
11014 bsi->nr_extents += ret;
11015 bsi->nr_pages += nr_pages;
11019 static void btrfs_swap_deactivate(struct file *file)
11021 struct inode *inode = file_inode(file);
11023 btrfs_free_swapfile_pins(inode);
11024 atomic_dec(&BTRFS_I(inode)->root->nr_swapfiles);
11027 static int btrfs_swap_activate(struct swap_info_struct *sis, struct file *file,
11030 struct inode *inode = file_inode(file);
11031 struct btrfs_root *root = BTRFS_I(inode)->root;
11032 struct btrfs_fs_info *fs_info = root->fs_info;
11033 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
11034 struct extent_state *cached_state = NULL;
11035 struct extent_map *em = NULL;
11036 struct btrfs_device *device = NULL;
11037 struct btrfs_swap_info bsi = {
11038 .lowest_ppage = (sector_t)-1ULL,
11045 * If the swap file was just created, make sure delalloc is done. If the
11046 * file changes again after this, the user is doing something stupid and
11047 * we don't really care.
11049 ret = btrfs_wait_ordered_range(inode, 0, (u64)-1);
11054 * The inode is locked, so these flags won't change after we check them.
11056 if (BTRFS_I(inode)->flags & BTRFS_INODE_COMPRESS) {
11057 btrfs_warn(fs_info, "swapfile must not be compressed");
11060 if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW)) {
11061 btrfs_warn(fs_info, "swapfile must not be copy-on-write");
11064 if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM)) {
11065 btrfs_warn(fs_info, "swapfile must not be checksummed");
11070 * Balance or device remove/replace/resize can move stuff around from
11071 * under us. The exclop protection makes sure they aren't running/won't
11072 * run concurrently while we are mapping the swap extents, and
11073 * fs_info->swapfile_pins prevents them from running while the swap
11074 * file is active and moving the extents. Note that this also prevents
11075 * a concurrent device add which isn't actually necessary, but it's not
11076 * really worth the trouble to allow it.
11078 if (!btrfs_exclop_start(fs_info, BTRFS_EXCLOP_SWAP_ACTIVATE)) {
11079 btrfs_warn(fs_info,
11080 "cannot activate swapfile while exclusive operation is running");
11085 * Prevent snapshot creation while we are activating the swap file.
11086 * We do not want to race with snapshot creation. If snapshot creation
11087 * already started before we bumped nr_swapfiles from 0 to 1 and
11088 * completes before the first write into the swap file after it is
11089 * activated, than that write would fallback to COW.
11091 if (!btrfs_drew_try_write_lock(&root->snapshot_lock)) {
11092 btrfs_exclop_finish(fs_info);
11093 btrfs_warn(fs_info,
11094 "cannot activate swapfile because snapshot creation is in progress");
11098 * Snapshots can create extents which require COW even if NODATACOW is
11099 * set. We use this counter to prevent snapshots. We must increment it
11100 * before walking the extents because we don't want a concurrent
11101 * snapshot to run after we've already checked the extents.
11103 * It is possible that subvolume is marked for deletion but still not
11104 * removed yet. To prevent this race, we check the root status before
11105 * activating the swapfile.
11107 spin_lock(&root->root_item_lock);
11108 if (btrfs_root_dead(root)) {
11109 spin_unlock(&root->root_item_lock);
11111 btrfs_exclop_finish(fs_info);
11112 btrfs_warn(fs_info,
11113 "cannot activate swapfile because subvolume %llu is being deleted",
11114 root->root_key.objectid);
11117 atomic_inc(&root->nr_swapfiles);
11118 spin_unlock(&root->root_item_lock);
11120 isize = ALIGN_DOWN(inode->i_size, fs_info->sectorsize);
11122 lock_extent_bits(io_tree, 0, isize - 1, &cached_state);
11124 while (start < isize) {
11125 u64 logical_block_start, physical_block_start;
11126 struct btrfs_block_group *bg;
11127 u64 len = isize - start;
11129 em = btrfs_get_extent(BTRFS_I(inode), NULL, 0, start, len);
11135 if (em->block_start == EXTENT_MAP_HOLE) {
11136 btrfs_warn(fs_info, "swapfile must not have holes");
11140 if (em->block_start == EXTENT_MAP_INLINE) {
11142 * It's unlikely we'll ever actually find ourselves
11143 * here, as a file small enough to fit inline won't be
11144 * big enough to store more than the swap header, but in
11145 * case something changes in the future, let's catch it
11146 * here rather than later.
11148 btrfs_warn(fs_info, "swapfile must not be inline");
11152 if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) {
11153 btrfs_warn(fs_info, "swapfile must not be compressed");
11158 logical_block_start = em->block_start + (start - em->start);
11159 len = min(len, em->len - (start - em->start));
11160 free_extent_map(em);
11163 ret = can_nocow_extent(inode, start, &len, NULL, NULL, NULL, true);
11169 btrfs_warn(fs_info,
11170 "swapfile must not be copy-on-write");
11175 em = btrfs_get_chunk_map(fs_info, logical_block_start, len);
11181 if (em->map_lookup->type & BTRFS_BLOCK_GROUP_PROFILE_MASK) {
11182 btrfs_warn(fs_info,
11183 "swapfile must have single data profile");
11188 if (device == NULL) {
11189 device = em->map_lookup->stripes[0].dev;
11190 ret = btrfs_add_swapfile_pin(inode, device, false);
11195 } else if (device != em->map_lookup->stripes[0].dev) {
11196 btrfs_warn(fs_info, "swapfile must be on one device");
11201 physical_block_start = (em->map_lookup->stripes[0].physical +
11202 (logical_block_start - em->start));
11203 len = min(len, em->len - (logical_block_start - em->start));
11204 free_extent_map(em);
11207 bg = btrfs_lookup_block_group(fs_info, logical_block_start);
11209 btrfs_warn(fs_info,
11210 "could not find block group containing swapfile");
11215 if (!btrfs_inc_block_group_swap_extents(bg)) {
11216 btrfs_warn(fs_info,
11217 "block group for swapfile at %llu is read-only%s",
11219 atomic_read(&fs_info->scrubs_running) ?
11220 " (scrub running)" : "");
11221 btrfs_put_block_group(bg);
11226 ret = btrfs_add_swapfile_pin(inode, bg, true);
11228 btrfs_put_block_group(bg);
11235 if (bsi.block_len &&
11236 bsi.block_start + bsi.block_len == physical_block_start) {
11237 bsi.block_len += len;
11239 if (bsi.block_len) {
11240 ret = btrfs_add_swap_extent(sis, &bsi);
11245 bsi.block_start = physical_block_start;
11246 bsi.block_len = len;
11253 ret = btrfs_add_swap_extent(sis, &bsi);
11256 if (!IS_ERR_OR_NULL(em))
11257 free_extent_map(em);
11259 unlock_extent_cached(io_tree, 0, isize - 1, &cached_state);
11262 btrfs_swap_deactivate(file);
11264 btrfs_drew_write_unlock(&root->snapshot_lock);
11266 btrfs_exclop_finish(fs_info);
11272 sis->bdev = device->bdev;
11273 *span = bsi.highest_ppage - bsi.lowest_ppage + 1;
11274 sis->max = bsi.nr_pages;
11275 sis->pages = bsi.nr_pages - 1;
11276 sis->highest_bit = bsi.nr_pages - 1;
11277 return bsi.nr_extents;
11280 static void btrfs_swap_deactivate(struct file *file)
11284 static int btrfs_swap_activate(struct swap_info_struct *sis, struct file *file,
11287 return -EOPNOTSUPP;
11292 * Update the number of bytes used in the VFS' inode. When we replace extents in
11293 * a range (clone, dedupe, fallocate's zero range), we must update the number of
11294 * bytes used by the inode in an atomic manner, so that concurrent stat(2) calls
11295 * always get a correct value.
11297 void btrfs_update_inode_bytes(struct btrfs_inode *inode,
11298 const u64 add_bytes,
11299 const u64 del_bytes)
11301 if (add_bytes == del_bytes)
11304 spin_lock(&inode->lock);
11306 inode_sub_bytes(&inode->vfs_inode, del_bytes);
11308 inode_add_bytes(&inode->vfs_inode, add_bytes);
11309 spin_unlock(&inode->lock);
11312 static const struct inode_operations btrfs_dir_inode_operations = {
11313 .getattr = btrfs_getattr,
11314 .lookup = btrfs_lookup,
11315 .create = btrfs_create,
11316 .unlink = btrfs_unlink,
11317 .link = btrfs_link,
11318 .mkdir = btrfs_mkdir,
11319 .rmdir = btrfs_rmdir,
11320 .rename = btrfs_rename2,
11321 .symlink = btrfs_symlink,
11322 .setattr = btrfs_setattr,
11323 .mknod = btrfs_mknod,
11324 .listxattr = btrfs_listxattr,
11325 .permission = btrfs_permission,
11326 .get_acl = btrfs_get_acl,
11327 .set_acl = btrfs_set_acl,
11328 .update_time = btrfs_update_time,
11329 .tmpfile = btrfs_tmpfile,
11330 .fileattr_get = btrfs_fileattr_get,
11331 .fileattr_set = btrfs_fileattr_set,
11334 static const struct file_operations btrfs_dir_file_operations = {
11335 .llseek = generic_file_llseek,
11336 .read = generic_read_dir,
11337 .iterate_shared = btrfs_real_readdir,
11338 .open = btrfs_opendir,
11339 .unlocked_ioctl = btrfs_ioctl,
11340 #ifdef CONFIG_COMPAT
11341 .compat_ioctl = btrfs_compat_ioctl,
11343 .release = btrfs_release_file,
11344 .fsync = btrfs_sync_file,
11348 * btrfs doesn't support the bmap operation because swapfiles
11349 * use bmap to make a mapping of extents in the file. They assume
11350 * these extents won't change over the life of the file and they
11351 * use the bmap result to do IO directly to the drive.
11353 * the btrfs bmap call would return logical addresses that aren't
11354 * suitable for IO and they also will change frequently as COW
11355 * operations happen. So, swapfile + btrfs == corruption.
11357 * For now we're avoiding this by dropping bmap.
11359 static const struct address_space_operations btrfs_aops = {
11360 .readpage = btrfs_readpage,
11361 .writepage = btrfs_writepage,
11362 .writepages = btrfs_writepages,
11363 .readahead = btrfs_readahead,
11364 .direct_IO = noop_direct_IO,
11365 .invalidate_folio = btrfs_invalidate_folio,
11366 .releasepage = btrfs_releasepage,
11367 #ifdef CONFIG_MIGRATION
11368 .migratepage = btrfs_migratepage,
11370 .dirty_folio = filemap_dirty_folio,
11371 .error_remove_page = generic_error_remove_page,
11372 .swap_activate = btrfs_swap_activate,
11373 .swap_deactivate = btrfs_swap_deactivate,
11376 static const struct inode_operations btrfs_file_inode_operations = {
11377 .getattr = btrfs_getattr,
11378 .setattr = btrfs_setattr,
11379 .listxattr = btrfs_listxattr,
11380 .permission = btrfs_permission,
11381 .fiemap = btrfs_fiemap,
11382 .get_acl = btrfs_get_acl,
11383 .set_acl = btrfs_set_acl,
11384 .update_time = btrfs_update_time,
11385 .fileattr_get = btrfs_fileattr_get,
11386 .fileattr_set = btrfs_fileattr_set,
11388 static const struct inode_operations btrfs_special_inode_operations = {
11389 .getattr = btrfs_getattr,
11390 .setattr = btrfs_setattr,
11391 .permission = btrfs_permission,
11392 .listxattr = btrfs_listxattr,
11393 .get_acl = btrfs_get_acl,
11394 .set_acl = btrfs_set_acl,
11395 .update_time = btrfs_update_time,
11397 static const struct inode_operations btrfs_symlink_inode_operations = {
11398 .get_link = page_get_link,
11399 .getattr = btrfs_getattr,
11400 .setattr = btrfs_setattr,
11401 .permission = btrfs_permission,
11402 .listxattr = btrfs_listxattr,
11403 .update_time = btrfs_update_time,
11406 const struct dentry_operations btrfs_dentry_operations = {
11407 .d_delete = btrfs_dentry_delete,