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 #include "accessors.h"
60 #include "extent-tree.h"
61 #include "root-tree.h"
64 #include "file-item.h"
65 #include "uuid-tree.h"
69 #include "relocation.h"
74 #include "raid-stripe-tree.h"
76 struct btrfs_iget_args {
78 struct btrfs_root *root;
81 struct btrfs_dio_data {
83 struct extent_changeset *data_reserved;
84 struct btrfs_ordered_extent *ordered;
85 bool data_space_reserved;
89 struct btrfs_dio_private {
94 /* This must be last */
95 struct btrfs_bio bbio;
98 static struct bio_set btrfs_dio_bioset;
100 struct btrfs_rename_ctx {
101 /* Output field. Stores the index number of the old directory entry. */
106 * Used by data_reloc_print_warning_inode() to pass needed info for filename
107 * resolution and output of error message.
109 struct data_reloc_warn {
110 struct btrfs_path path;
111 struct btrfs_fs_info *fs_info;
112 u64 extent_item_size;
117 static const struct inode_operations btrfs_dir_inode_operations;
118 static const struct inode_operations btrfs_symlink_inode_operations;
119 static const struct inode_operations btrfs_special_inode_operations;
120 static const struct inode_operations btrfs_file_inode_operations;
121 static const struct address_space_operations btrfs_aops;
122 static const struct file_operations btrfs_dir_file_operations;
124 static struct kmem_cache *btrfs_inode_cachep;
126 static int btrfs_setsize(struct inode *inode, struct iattr *attr);
127 static int btrfs_truncate(struct btrfs_inode *inode, bool skip_writeback);
129 static noinline int run_delalloc_cow(struct btrfs_inode *inode,
130 struct page *locked_page, u64 start,
131 u64 end, struct writeback_control *wbc,
133 static struct extent_map *create_io_em(struct btrfs_inode *inode, u64 start,
134 u64 len, u64 orig_start, u64 block_start,
135 u64 block_len, u64 orig_block_len,
136 u64 ram_bytes, int compress_type,
139 static int data_reloc_print_warning_inode(u64 inum, u64 offset, u64 num_bytes,
140 u64 root, void *warn_ctx)
142 struct data_reloc_warn *warn = warn_ctx;
143 struct btrfs_fs_info *fs_info = warn->fs_info;
144 struct extent_buffer *eb;
145 struct btrfs_inode_item *inode_item;
146 struct inode_fs_paths *ipath = NULL;
147 struct btrfs_root *local_root;
148 struct btrfs_key key;
149 unsigned int nofs_flag;
153 local_root = btrfs_get_fs_root(fs_info, root, true);
154 if (IS_ERR(local_root)) {
155 ret = PTR_ERR(local_root);
159 /* This makes the path point to (inum INODE_ITEM ioff). */
161 key.type = BTRFS_INODE_ITEM_KEY;
164 ret = btrfs_search_slot(NULL, local_root, &key, &warn->path, 0, 0);
166 btrfs_put_root(local_root);
167 btrfs_release_path(&warn->path);
171 eb = warn->path.nodes[0];
172 inode_item = btrfs_item_ptr(eb, warn->path.slots[0], struct btrfs_inode_item);
173 nlink = btrfs_inode_nlink(eb, inode_item);
174 btrfs_release_path(&warn->path);
176 nofs_flag = memalloc_nofs_save();
177 ipath = init_ipath(4096, local_root, &warn->path);
178 memalloc_nofs_restore(nofs_flag);
180 btrfs_put_root(local_root);
181 ret = PTR_ERR(ipath);
184 * -ENOMEM, not a critical error, just output an generic error
188 "checksum error at logical %llu mirror %u root %llu, inode %llu offset %llu",
189 warn->logical, warn->mirror_num, root, inum, offset);
192 ret = paths_from_inode(inum, ipath);
197 * We deliberately ignore the bit ipath might have been too small to
198 * hold all of the paths here
200 for (int i = 0; i < ipath->fspath->elem_cnt; i++) {
202 "checksum error at logical %llu mirror %u root %llu inode %llu offset %llu length %u links %u (path: %s)",
203 warn->logical, warn->mirror_num, root, inum, offset,
204 fs_info->sectorsize, nlink,
205 (char *)(unsigned long)ipath->fspath->val[i]);
208 btrfs_put_root(local_root);
214 "checksum error at logical %llu mirror %u root %llu inode %llu offset %llu, path resolving failed with ret=%d",
215 warn->logical, warn->mirror_num, root, inum, offset, ret);
222 * Do extra user-friendly error output (e.g. lookup all the affected files).
224 * Return true if we succeeded doing the backref lookup.
225 * Return false if such lookup failed, and has to fallback to the old error message.
227 static void print_data_reloc_error(const struct btrfs_inode *inode, u64 file_off,
228 const u8 *csum, const u8 *csum_expected,
231 struct btrfs_fs_info *fs_info = inode->root->fs_info;
232 struct btrfs_path path = { 0 };
233 struct btrfs_key found_key = { 0 };
234 struct extent_buffer *eb;
235 struct btrfs_extent_item *ei;
236 const u32 csum_size = fs_info->csum_size;
242 mutex_lock(&fs_info->reloc_mutex);
243 logical = btrfs_get_reloc_bg_bytenr(fs_info);
244 mutex_unlock(&fs_info->reloc_mutex);
246 if (logical == U64_MAX) {
247 btrfs_warn_rl(fs_info, "has data reloc tree but no running relocation");
248 btrfs_warn_rl(fs_info,
249 "csum failed root %lld ino %llu off %llu csum " CSUM_FMT " expected csum " CSUM_FMT " mirror %d",
250 inode->root->root_key.objectid, btrfs_ino(inode), file_off,
251 CSUM_FMT_VALUE(csum_size, csum),
252 CSUM_FMT_VALUE(csum_size, csum_expected),
258 btrfs_warn_rl(fs_info,
259 "csum failed root %lld ino %llu off %llu logical %llu csum " CSUM_FMT " expected csum " CSUM_FMT " mirror %d",
260 inode->root->root_key.objectid,
261 btrfs_ino(inode), file_off, logical,
262 CSUM_FMT_VALUE(csum_size, csum),
263 CSUM_FMT_VALUE(csum_size, csum_expected),
266 ret = extent_from_logical(fs_info, logical, &path, &found_key, &flags);
268 btrfs_err_rl(fs_info, "failed to lookup extent item for logical %llu: %d",
273 ei = btrfs_item_ptr(eb, path.slots[0], struct btrfs_extent_item);
274 item_size = btrfs_item_size(eb, path.slots[0]);
275 if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) {
276 unsigned long ptr = 0;
281 ret = tree_backref_for_extent(&ptr, eb, &found_key, ei,
282 item_size, &ref_root,
285 btrfs_warn_rl(fs_info,
286 "failed to resolve tree backref for logical %llu: %d",
293 btrfs_warn_rl(fs_info,
294 "csum error at logical %llu mirror %u: metadata %s (level %d) in tree %llu",
296 (ref_level ? "node" : "leaf"),
297 ref_level, ref_root);
299 btrfs_release_path(&path);
301 struct btrfs_backref_walk_ctx ctx = { 0 };
302 struct data_reloc_warn reloc_warn = { 0 };
304 btrfs_release_path(&path);
306 ctx.bytenr = found_key.objectid;
307 ctx.extent_item_pos = logical - found_key.objectid;
308 ctx.fs_info = fs_info;
310 reloc_warn.logical = logical;
311 reloc_warn.extent_item_size = found_key.offset;
312 reloc_warn.mirror_num = mirror_num;
313 reloc_warn.fs_info = fs_info;
315 iterate_extent_inodes(&ctx, true,
316 data_reloc_print_warning_inode, &reloc_warn);
320 static void __cold btrfs_print_data_csum_error(struct btrfs_inode *inode,
321 u64 logical_start, u8 *csum, u8 *csum_expected, int mirror_num)
323 struct btrfs_root *root = inode->root;
324 const u32 csum_size = root->fs_info->csum_size;
326 /* For data reloc tree, it's better to do a backref lookup instead. */
327 if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID)
328 return print_data_reloc_error(inode, logical_start, csum,
329 csum_expected, mirror_num);
331 /* Output without objectid, which is more meaningful */
332 if (root->root_key.objectid >= BTRFS_LAST_FREE_OBJECTID) {
333 btrfs_warn_rl(root->fs_info,
334 "csum failed root %lld ino %lld off %llu csum " CSUM_FMT " expected csum " CSUM_FMT " mirror %d",
335 root->root_key.objectid, btrfs_ino(inode),
337 CSUM_FMT_VALUE(csum_size, csum),
338 CSUM_FMT_VALUE(csum_size, csum_expected),
341 btrfs_warn_rl(root->fs_info,
342 "csum failed root %llu ino %llu off %llu csum " CSUM_FMT " expected csum " CSUM_FMT " mirror %d",
343 root->root_key.objectid, btrfs_ino(inode),
345 CSUM_FMT_VALUE(csum_size, csum),
346 CSUM_FMT_VALUE(csum_size, csum_expected),
352 * Lock inode i_rwsem based on arguments passed.
354 * ilock_flags can have the following bit set:
356 * BTRFS_ILOCK_SHARED - acquire a shared lock on the inode
357 * BTRFS_ILOCK_TRY - try to acquire the lock, if fails on first attempt
359 * BTRFS_ILOCK_MMAP - acquire a write lock on the i_mmap_lock
361 int btrfs_inode_lock(struct btrfs_inode *inode, unsigned int ilock_flags)
363 if (ilock_flags & BTRFS_ILOCK_SHARED) {
364 if (ilock_flags & BTRFS_ILOCK_TRY) {
365 if (!inode_trylock_shared(&inode->vfs_inode))
370 inode_lock_shared(&inode->vfs_inode);
372 if (ilock_flags & BTRFS_ILOCK_TRY) {
373 if (!inode_trylock(&inode->vfs_inode))
378 inode_lock(&inode->vfs_inode);
380 if (ilock_flags & BTRFS_ILOCK_MMAP)
381 down_write(&inode->i_mmap_lock);
386 * Unock inode i_rwsem.
388 * ilock_flags should contain the same bits set as passed to btrfs_inode_lock()
389 * to decide whether the lock acquired is shared or exclusive.
391 void btrfs_inode_unlock(struct btrfs_inode *inode, unsigned int ilock_flags)
393 if (ilock_flags & BTRFS_ILOCK_MMAP)
394 up_write(&inode->i_mmap_lock);
395 if (ilock_flags & BTRFS_ILOCK_SHARED)
396 inode_unlock_shared(&inode->vfs_inode);
398 inode_unlock(&inode->vfs_inode);
402 * Cleanup all submitted ordered extents in specified range to handle errors
403 * from the btrfs_run_delalloc_range() callback.
405 * NOTE: caller must ensure that when an error happens, it can not call
406 * extent_clear_unlock_delalloc() to clear both the bits EXTENT_DO_ACCOUNTING
407 * and EXTENT_DELALLOC simultaneously, because that causes the reserved metadata
408 * to be released, which we want to happen only when finishing the ordered
409 * extent (btrfs_finish_ordered_io()).
411 static inline void btrfs_cleanup_ordered_extents(struct btrfs_inode *inode,
412 struct page *locked_page,
413 u64 offset, u64 bytes)
415 unsigned long index = offset >> PAGE_SHIFT;
416 unsigned long end_index = (offset + bytes - 1) >> PAGE_SHIFT;
417 u64 page_start = 0, page_end = 0;
421 page_start = page_offset(locked_page);
422 page_end = page_start + PAGE_SIZE - 1;
425 while (index <= end_index) {
427 * For locked page, we will call btrfs_mark_ordered_io_finished
428 * through btrfs_mark_ordered_io_finished() on it
429 * in run_delalloc_range() for the error handling, which will
430 * clear page Ordered and run the ordered extent accounting.
432 * Here we can't just clear the Ordered bit, or
433 * btrfs_mark_ordered_io_finished() would skip the accounting
434 * for the page range, and the ordered extent will never finish.
436 if (locked_page && index == (page_start >> PAGE_SHIFT)) {
440 page = find_get_page(inode->vfs_inode.i_mapping, index);
446 * Here we just clear all Ordered bits for every page in the
447 * range, then btrfs_mark_ordered_io_finished() will handle
448 * the ordered extent accounting for the range.
450 btrfs_page_clamp_clear_ordered(inode->root->fs_info, page,
456 /* The locked page covers the full range, nothing needs to be done */
457 if (bytes + offset <= page_start + PAGE_SIZE)
460 * In case this page belongs to the delalloc range being
461 * instantiated then skip it, since the first page of a range is
462 * going to be properly cleaned up by the caller of
465 if (page_start >= offset && page_end <= (offset + bytes - 1)) {
466 bytes = offset + bytes - page_offset(locked_page) - PAGE_SIZE;
467 offset = page_offset(locked_page) + PAGE_SIZE;
471 return btrfs_mark_ordered_io_finished(inode, NULL, offset, bytes, false);
474 static int btrfs_dirty_inode(struct btrfs_inode *inode);
476 static int btrfs_init_inode_security(struct btrfs_trans_handle *trans,
477 struct btrfs_new_inode_args *args)
481 if (args->default_acl) {
482 err = __btrfs_set_acl(trans, args->inode, args->default_acl,
488 err = __btrfs_set_acl(trans, args->inode, args->acl, ACL_TYPE_ACCESS);
492 if (!args->default_acl && !args->acl)
493 cache_no_acl(args->inode);
494 return btrfs_xattr_security_init(trans, args->inode, args->dir,
495 &args->dentry->d_name);
499 * this does all the hard work for inserting an inline extent into
500 * the btree. The caller should have done a btrfs_drop_extents so that
501 * no overlapping inline items exist in the btree
503 static int insert_inline_extent(struct btrfs_trans_handle *trans,
504 struct btrfs_path *path,
505 struct btrfs_inode *inode, bool extent_inserted,
506 size_t size, size_t compressed_size,
508 struct page **compressed_pages,
511 struct btrfs_root *root = inode->root;
512 struct extent_buffer *leaf;
513 struct page *page = NULL;
516 struct btrfs_file_extent_item *ei;
518 size_t cur_size = size;
521 ASSERT((compressed_size > 0 && compressed_pages) ||
522 (compressed_size == 0 && !compressed_pages));
524 if (compressed_size && compressed_pages)
525 cur_size = compressed_size;
527 if (!extent_inserted) {
528 struct btrfs_key key;
531 key.objectid = btrfs_ino(inode);
533 key.type = BTRFS_EXTENT_DATA_KEY;
535 datasize = btrfs_file_extent_calc_inline_size(cur_size);
536 ret = btrfs_insert_empty_item(trans, root, path, &key,
541 leaf = path->nodes[0];
542 ei = btrfs_item_ptr(leaf, path->slots[0],
543 struct btrfs_file_extent_item);
544 btrfs_set_file_extent_generation(leaf, ei, trans->transid);
545 btrfs_set_file_extent_type(leaf, ei, BTRFS_FILE_EXTENT_INLINE);
546 btrfs_set_file_extent_encryption(leaf, ei, 0);
547 btrfs_set_file_extent_other_encoding(leaf, ei, 0);
548 btrfs_set_file_extent_ram_bytes(leaf, ei, size);
549 ptr = btrfs_file_extent_inline_start(ei);
551 if (compress_type != BTRFS_COMPRESS_NONE) {
554 while (compressed_size > 0) {
555 cpage = compressed_pages[i];
556 cur_size = min_t(unsigned long, compressed_size,
559 kaddr = kmap_local_page(cpage);
560 write_extent_buffer(leaf, kaddr, ptr, cur_size);
565 compressed_size -= cur_size;
567 btrfs_set_file_extent_compression(leaf, ei,
570 page = find_get_page(inode->vfs_inode.i_mapping, 0);
571 btrfs_set_file_extent_compression(leaf, ei, 0);
572 kaddr = kmap_local_page(page);
573 write_extent_buffer(leaf, kaddr, ptr, size);
577 btrfs_mark_buffer_dirty(trans, leaf);
578 btrfs_release_path(path);
581 * We align size to sectorsize for inline extents just for simplicity
584 ret = btrfs_inode_set_file_extent_range(inode, 0,
585 ALIGN(size, root->fs_info->sectorsize));
590 * We're an inline extent, so nobody can extend the file past i_size
591 * without locking a page we already have locked.
593 * We must do any i_size and inode updates before we unlock the pages.
594 * Otherwise we could end up racing with unlink.
596 i_size = i_size_read(&inode->vfs_inode);
597 if (update_i_size && size > i_size) {
598 i_size_write(&inode->vfs_inode, size);
601 inode->disk_i_size = i_size;
609 * conditionally insert an inline extent into the file. This
610 * does the checks required to make sure the data is small enough
611 * to fit as an inline extent.
613 static noinline int cow_file_range_inline(struct btrfs_inode *inode, u64 size,
614 size_t compressed_size,
616 struct page **compressed_pages,
619 struct btrfs_drop_extents_args drop_args = { 0 };
620 struct btrfs_root *root = inode->root;
621 struct btrfs_fs_info *fs_info = root->fs_info;
622 struct btrfs_trans_handle *trans;
623 u64 data_len = (compressed_size ?: size);
625 struct btrfs_path *path;
628 * We can create an inline extent if it ends at or beyond the current
629 * i_size, is no larger than a sector (decompressed), and the (possibly
630 * compressed) data fits in a leaf and the configured maximum inline
633 if (size < i_size_read(&inode->vfs_inode) ||
634 size > fs_info->sectorsize ||
635 data_len > BTRFS_MAX_INLINE_DATA_SIZE(fs_info) ||
636 data_len > fs_info->max_inline)
639 path = btrfs_alloc_path();
643 trans = btrfs_join_transaction(root);
645 btrfs_free_path(path);
646 return PTR_ERR(trans);
648 trans->block_rsv = &inode->block_rsv;
650 drop_args.path = path;
652 drop_args.end = fs_info->sectorsize;
653 drop_args.drop_cache = true;
654 drop_args.replace_extent = true;
655 drop_args.extent_item_size = btrfs_file_extent_calc_inline_size(data_len);
656 ret = btrfs_drop_extents(trans, root, inode, &drop_args);
658 btrfs_abort_transaction(trans, ret);
662 ret = insert_inline_extent(trans, path, inode, drop_args.extent_inserted,
663 size, compressed_size, compress_type,
664 compressed_pages, update_i_size);
665 if (ret && ret != -ENOSPC) {
666 btrfs_abort_transaction(trans, ret);
668 } else if (ret == -ENOSPC) {
673 btrfs_update_inode_bytes(inode, size, drop_args.bytes_found);
674 ret = btrfs_update_inode(trans, inode);
675 if (ret && ret != -ENOSPC) {
676 btrfs_abort_transaction(trans, ret);
678 } else if (ret == -ENOSPC) {
683 btrfs_set_inode_full_sync(inode);
686 * Don't forget to free the reserved space, as for inlined extent
687 * it won't count as data extent, free them directly here.
688 * And at reserve time, it's always aligned to page size, so
689 * just free one page here.
691 btrfs_qgroup_free_data(inode, NULL, 0, PAGE_SIZE);
692 btrfs_free_path(path);
693 btrfs_end_transaction(trans);
697 struct async_extent {
702 unsigned long nr_pages;
704 struct list_head list;
708 struct btrfs_inode *inode;
709 struct page *locked_page;
712 blk_opf_t write_flags;
713 struct list_head extents;
714 struct cgroup_subsys_state *blkcg_css;
715 struct btrfs_work work;
716 struct async_cow *async_cow;
721 struct async_chunk chunks[];
724 static noinline int add_async_extent(struct async_chunk *cow,
725 u64 start, u64 ram_size,
728 unsigned long nr_pages,
731 struct async_extent *async_extent;
733 async_extent = kmalloc(sizeof(*async_extent), GFP_NOFS);
734 BUG_ON(!async_extent); /* -ENOMEM */
735 async_extent->start = start;
736 async_extent->ram_size = ram_size;
737 async_extent->compressed_size = compressed_size;
738 async_extent->pages = pages;
739 async_extent->nr_pages = nr_pages;
740 async_extent->compress_type = compress_type;
741 list_add_tail(&async_extent->list, &cow->extents);
746 * Check if the inode needs to be submitted to compression, based on mount
747 * options, defragmentation, properties or heuristics.
749 static inline int inode_need_compress(struct btrfs_inode *inode, u64 start,
752 struct btrfs_fs_info *fs_info = inode->root->fs_info;
754 if (!btrfs_inode_can_compress(inode)) {
755 WARN(IS_ENABLED(CONFIG_BTRFS_DEBUG),
756 KERN_ERR "BTRFS: unexpected compression for ino %llu\n",
761 * Special check for subpage.
763 * We lock the full page then run each delalloc range in the page, thus
764 * for the following case, we will hit some subpage specific corner case:
767 * | |///////| |///////|
770 * In above case, both range A and range B will try to unlock the full
771 * page [0, 64K), causing the one finished later will have page
772 * unlocked already, triggering various page lock requirement BUG_ON()s.
774 * So here we add an artificial limit that subpage compression can only
775 * if the range is fully page aligned.
777 * In theory we only need to ensure the first page is fully covered, but
778 * the tailing partial page will be locked until the full compression
779 * finishes, delaying the write of other range.
781 * TODO: Make btrfs_run_delalloc_range() to lock all delalloc range
782 * first to prevent any submitted async extent to unlock the full page.
783 * By this, we can ensure for subpage case that only the last async_cow
784 * will unlock the full page.
786 if (fs_info->sectorsize < PAGE_SIZE) {
787 if (!PAGE_ALIGNED(start) ||
788 !PAGE_ALIGNED(end + 1))
793 if (btrfs_test_opt(fs_info, FORCE_COMPRESS))
796 if (inode->defrag_compress)
798 /* bad compression ratios */
799 if (inode->flags & BTRFS_INODE_NOCOMPRESS)
801 if (btrfs_test_opt(fs_info, COMPRESS) ||
802 inode->flags & BTRFS_INODE_COMPRESS ||
803 inode->prop_compress)
804 return btrfs_compress_heuristic(&inode->vfs_inode, start, end);
808 static inline void inode_should_defrag(struct btrfs_inode *inode,
809 u64 start, u64 end, u64 num_bytes, u32 small_write)
811 /* If this is a small write inside eof, kick off a defrag */
812 if (num_bytes < small_write &&
813 (start > 0 || end + 1 < inode->disk_i_size))
814 btrfs_add_inode_defrag(NULL, inode, small_write);
818 * Work queue call back to started compression on a file and pages.
820 * This is done inside an ordered work queue, and the compression is spread
821 * across many cpus. The actual IO submission is step two, and the ordered work
822 * queue takes care of making sure that happens in the same order things were
823 * put onto the queue by writepages and friends.
825 * If this code finds it can't get good compression, it puts an entry onto the
826 * work queue to write the uncompressed bytes. This makes sure that both
827 * compressed inodes and uncompressed inodes are written in the same order that
828 * the flusher thread sent them down.
830 static void compress_file_range(struct btrfs_work *work)
832 struct async_chunk *async_chunk =
833 container_of(work, struct async_chunk, work);
834 struct btrfs_inode *inode = async_chunk->inode;
835 struct btrfs_fs_info *fs_info = inode->root->fs_info;
836 struct address_space *mapping = inode->vfs_inode.i_mapping;
837 u64 blocksize = fs_info->sectorsize;
838 u64 start = async_chunk->start;
839 u64 end = async_chunk->end;
844 unsigned long nr_pages;
845 unsigned long total_compressed = 0;
846 unsigned long total_in = 0;
849 int compress_type = fs_info->compress_type;
851 inode_should_defrag(inode, start, end, end - start + 1, SZ_16K);
854 * We need to call clear_page_dirty_for_io on each page in the range.
855 * Otherwise applications with the file mmap'd can wander in and change
856 * the page contents while we are compressing them.
858 extent_range_clear_dirty_for_io(&inode->vfs_inode, start, end);
861 * We need to save i_size before now because it could change in between
862 * us evaluating the size and assigning it. This is because we lock and
863 * unlock the page in truncate and fallocate, and then modify the i_size
866 * The barriers are to emulate READ_ONCE, remove that once i_size_read
870 i_size = i_size_read(&inode->vfs_inode);
872 actual_end = min_t(u64, i_size, end + 1);
875 nr_pages = (end >> PAGE_SHIFT) - (start >> PAGE_SHIFT) + 1;
876 nr_pages = min_t(unsigned long, nr_pages, BTRFS_MAX_COMPRESSED_PAGES);
879 * we don't want to send crud past the end of i_size through
880 * compression, that's just a waste of CPU time. So, if the
881 * end of the file is before the start of our current
882 * requested range of bytes, we bail out to the uncompressed
883 * cleanup code that can deal with all of this.
885 * It isn't really the fastest way to fix things, but this is a
886 * very uncommon corner.
888 if (actual_end <= start)
889 goto cleanup_and_bail_uncompressed;
891 total_compressed = actual_end - start;
894 * Skip compression for a small file range(<=blocksize) that
895 * isn't an inline extent, since it doesn't save disk space at all.
897 if (total_compressed <= blocksize &&
898 (start > 0 || end + 1 < inode->disk_i_size))
899 goto cleanup_and_bail_uncompressed;
902 * For subpage case, we require full page alignment for the sector
904 * Thus we must also check against @actual_end, not just @end.
906 if (blocksize < PAGE_SIZE) {
907 if (!PAGE_ALIGNED(start) ||
908 !PAGE_ALIGNED(round_up(actual_end, blocksize)))
909 goto cleanup_and_bail_uncompressed;
912 total_compressed = min_t(unsigned long, total_compressed,
913 BTRFS_MAX_UNCOMPRESSED);
918 * We do compression for mount -o compress and when the inode has not
919 * been flagged as NOCOMPRESS. This flag can change at any time if we
920 * discover bad compression ratios.
922 if (!inode_need_compress(inode, start, end))
923 goto cleanup_and_bail_uncompressed;
925 pages = kcalloc(nr_pages, sizeof(struct page *), GFP_NOFS);
928 * Memory allocation failure is not a fatal error, we can fall
929 * back to uncompressed code.
931 goto cleanup_and_bail_uncompressed;
934 if (inode->defrag_compress)
935 compress_type = inode->defrag_compress;
936 else if (inode->prop_compress)
937 compress_type = inode->prop_compress;
939 /* Compression level is applied here. */
940 ret = btrfs_compress_pages(compress_type | (fs_info->compress_level << 4),
941 mapping, start, pages, &nr_pages, &total_in,
944 goto mark_incompressible;
947 * Zero the tail end of the last page, as we might be sending it down
950 poff = offset_in_page(total_compressed);
952 memzero_page(pages[nr_pages - 1], poff, PAGE_SIZE - poff);
955 * Try to create an inline extent.
957 * If we didn't compress the entire range, try to create an uncompressed
958 * inline extent, else a compressed one.
960 * Check cow_file_range() for why we don't even try to create inline
961 * extent for the subpage case.
963 if (start == 0 && fs_info->sectorsize == PAGE_SIZE) {
964 if (total_in < actual_end) {
965 ret = cow_file_range_inline(inode, actual_end, 0,
966 BTRFS_COMPRESS_NONE, NULL,
969 ret = cow_file_range_inline(inode, actual_end,
971 compress_type, pages,
975 unsigned long clear_flags = EXTENT_DELALLOC |
976 EXTENT_DELALLOC_NEW | EXTENT_DEFRAG |
977 EXTENT_DO_ACCOUNTING;
980 mapping_set_error(mapping, -EIO);
983 * inline extent creation worked or returned error,
984 * we don't need to create any more async work items.
985 * Unlock and free up our temp pages.
987 * We use DO_ACCOUNTING here because we need the
988 * delalloc_release_metadata to be done _after_ we drop
989 * our outstanding extent for clearing delalloc for this
992 extent_clear_unlock_delalloc(inode, start, end,
996 PAGE_START_WRITEBACK |
1003 * We aren't doing an inline extent. Round the compressed size up to a
1004 * block size boundary so the allocator does sane things.
1006 total_compressed = ALIGN(total_compressed, blocksize);
1009 * One last check to make sure the compression is really a win, compare
1010 * the page count read with the blocks on disk, compression must free at
1013 total_in = round_up(total_in, fs_info->sectorsize);
1014 if (total_compressed + blocksize > total_in)
1015 goto mark_incompressible;
1018 * The async work queues will take care of doing actual allocation on
1019 * disk for these compressed pages, and will submit the bios.
1021 add_async_extent(async_chunk, start, total_in, total_compressed, pages,
1022 nr_pages, compress_type);
1023 if (start + total_in < end) {
1030 mark_incompressible:
1031 if (!btrfs_test_opt(fs_info, FORCE_COMPRESS) && !inode->prop_compress)
1032 inode->flags |= BTRFS_INODE_NOCOMPRESS;
1033 cleanup_and_bail_uncompressed:
1034 add_async_extent(async_chunk, start, end - start + 1, 0, NULL, 0,
1035 BTRFS_COMPRESS_NONE);
1038 for (i = 0; i < nr_pages; i++) {
1039 WARN_ON(pages[i]->mapping);
1046 static void free_async_extent_pages(struct async_extent *async_extent)
1050 if (!async_extent->pages)
1053 for (i = 0; i < async_extent->nr_pages; i++) {
1054 WARN_ON(async_extent->pages[i]->mapping);
1055 put_page(async_extent->pages[i]);
1057 kfree(async_extent->pages);
1058 async_extent->nr_pages = 0;
1059 async_extent->pages = NULL;
1062 static void submit_uncompressed_range(struct btrfs_inode *inode,
1063 struct async_extent *async_extent,
1064 struct page *locked_page)
1066 u64 start = async_extent->start;
1067 u64 end = async_extent->start + async_extent->ram_size - 1;
1069 struct writeback_control wbc = {
1070 .sync_mode = WB_SYNC_ALL,
1071 .range_start = start,
1073 .no_cgroup_owner = 1,
1076 wbc_attach_fdatawrite_inode(&wbc, &inode->vfs_inode);
1077 ret = run_delalloc_cow(inode, locked_page, start, end, &wbc, false);
1078 wbc_detach_inode(&wbc);
1080 btrfs_cleanup_ordered_extents(inode, locked_page, start, end - start + 1);
1082 const u64 page_start = page_offset(locked_page);
1084 set_page_writeback(locked_page);
1085 end_page_writeback(locked_page);
1086 btrfs_mark_ordered_io_finished(inode, locked_page,
1087 page_start, PAGE_SIZE,
1089 mapping_set_error(locked_page->mapping, ret);
1090 unlock_page(locked_page);
1095 static void submit_one_async_extent(struct async_chunk *async_chunk,
1096 struct async_extent *async_extent,
1099 struct btrfs_inode *inode = async_chunk->inode;
1100 struct extent_io_tree *io_tree = &inode->io_tree;
1101 struct btrfs_root *root = inode->root;
1102 struct btrfs_fs_info *fs_info = root->fs_info;
1103 struct btrfs_ordered_extent *ordered;
1104 struct btrfs_key ins;
1105 struct page *locked_page = NULL;
1106 struct extent_map *em;
1108 u64 start = async_extent->start;
1109 u64 end = async_extent->start + async_extent->ram_size - 1;
1111 if (async_chunk->blkcg_css)
1112 kthread_associate_blkcg(async_chunk->blkcg_css);
1115 * If async_chunk->locked_page is in the async_extent range, we need to
1118 if (async_chunk->locked_page) {
1119 u64 locked_page_start = page_offset(async_chunk->locked_page);
1120 u64 locked_page_end = locked_page_start + PAGE_SIZE - 1;
1122 if (!(start >= locked_page_end || end <= locked_page_start))
1123 locked_page = async_chunk->locked_page;
1125 lock_extent(io_tree, start, end, NULL);
1127 if (async_extent->compress_type == BTRFS_COMPRESS_NONE) {
1128 submit_uncompressed_range(inode, async_extent, locked_page);
1132 ret = btrfs_reserve_extent(root, async_extent->ram_size,
1133 async_extent->compressed_size,
1134 async_extent->compressed_size,
1135 0, *alloc_hint, &ins, 1, 1);
1138 * Here we used to try again by going back to non-compressed
1139 * path for ENOSPC. But we can't reserve space even for
1140 * compressed size, how could it work for uncompressed size
1141 * which requires larger size? So here we directly go error
1147 /* Here we're doing allocation and writeback of the compressed pages */
1148 em = create_io_em(inode, start,
1149 async_extent->ram_size, /* len */
1150 start, /* orig_start */
1151 ins.objectid, /* block_start */
1152 ins.offset, /* block_len */
1153 ins.offset, /* orig_block_len */
1154 async_extent->ram_size, /* ram_bytes */
1155 async_extent->compress_type,
1156 BTRFS_ORDERED_COMPRESSED);
1159 goto out_free_reserve;
1161 free_extent_map(em);
1163 ordered = btrfs_alloc_ordered_extent(inode, start, /* file_offset */
1164 async_extent->ram_size, /* num_bytes */
1165 async_extent->ram_size, /* ram_bytes */
1166 ins.objectid, /* disk_bytenr */
1167 ins.offset, /* disk_num_bytes */
1169 1 << BTRFS_ORDERED_COMPRESSED,
1170 async_extent->compress_type);
1171 if (IS_ERR(ordered)) {
1172 btrfs_drop_extent_map_range(inode, start, end, false);
1173 ret = PTR_ERR(ordered);
1174 goto out_free_reserve;
1176 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
1178 /* Clear dirty, set writeback and unlock the pages. */
1179 extent_clear_unlock_delalloc(inode, start, end,
1180 NULL, EXTENT_LOCKED | EXTENT_DELALLOC,
1181 PAGE_UNLOCK | PAGE_START_WRITEBACK);
1182 btrfs_submit_compressed_write(ordered,
1183 async_extent->pages, /* compressed_pages */
1184 async_extent->nr_pages,
1185 async_chunk->write_flags, true);
1186 *alloc_hint = ins.objectid + ins.offset;
1188 if (async_chunk->blkcg_css)
1189 kthread_associate_blkcg(NULL);
1190 kfree(async_extent);
1194 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
1195 btrfs_free_reserved_extent(fs_info, ins.objectid, ins.offset, 1);
1197 mapping_set_error(inode->vfs_inode.i_mapping, -EIO);
1198 extent_clear_unlock_delalloc(inode, start, end,
1199 NULL, EXTENT_LOCKED | EXTENT_DELALLOC |
1200 EXTENT_DELALLOC_NEW |
1201 EXTENT_DEFRAG | EXTENT_DO_ACCOUNTING,
1202 PAGE_UNLOCK | PAGE_START_WRITEBACK |
1203 PAGE_END_WRITEBACK);
1204 free_async_extent_pages(async_extent);
1205 if (async_chunk->blkcg_css)
1206 kthread_associate_blkcg(NULL);
1207 btrfs_debug(fs_info,
1208 "async extent submission failed root=%lld inode=%llu start=%llu len=%llu ret=%d",
1209 root->root_key.objectid, btrfs_ino(inode), start,
1210 async_extent->ram_size, ret);
1211 kfree(async_extent);
1214 static u64 get_extent_allocation_hint(struct btrfs_inode *inode, u64 start,
1217 struct extent_map_tree *em_tree = &inode->extent_tree;
1218 struct extent_map *em;
1221 read_lock(&em_tree->lock);
1222 em = search_extent_mapping(em_tree, start, num_bytes);
1225 * if block start isn't an actual block number then find the
1226 * first block in this inode and use that as a hint. If that
1227 * block is also bogus then just don't worry about it.
1229 if (em->block_start >= EXTENT_MAP_LAST_BYTE) {
1230 free_extent_map(em);
1231 em = search_extent_mapping(em_tree, 0, 0);
1232 if (em && em->block_start < EXTENT_MAP_LAST_BYTE)
1233 alloc_hint = em->block_start;
1235 free_extent_map(em);
1237 alloc_hint = em->block_start;
1238 free_extent_map(em);
1241 read_unlock(&em_tree->lock);
1247 * when extent_io.c finds a delayed allocation range in the file,
1248 * the call backs end up in this code. The basic idea is to
1249 * allocate extents on disk for the range, and create ordered data structs
1250 * in ram to track those extents.
1252 * locked_page is the page that writepage had locked already. We use
1253 * it to make sure we don't do extra locks or unlocks.
1255 * When this function fails, it unlocks all pages except @locked_page.
1257 * When this function successfully creates an inline extent, it returns 1 and
1258 * unlocks all pages including locked_page and starts I/O on them.
1259 * (In reality inline extents are limited to a single page, so locked_page is
1260 * the only page handled anyway).
1262 * When this function succeed and creates a normal extent, the page locking
1263 * status depends on the passed in flags:
1265 * - If @keep_locked is set, all pages are kept locked.
1266 * - Else all pages except for @locked_page are unlocked.
1268 * When a failure happens in the second or later iteration of the
1269 * while-loop, the ordered extents created in previous iterations are kept
1270 * intact. So, the caller must clean them up by calling
1271 * btrfs_cleanup_ordered_extents(). See btrfs_run_delalloc_range() for
1274 static noinline int cow_file_range(struct btrfs_inode *inode,
1275 struct page *locked_page, u64 start, u64 end,
1277 bool keep_locked, bool no_inline)
1279 struct btrfs_root *root = inode->root;
1280 struct btrfs_fs_info *fs_info = root->fs_info;
1282 u64 orig_start = start;
1284 unsigned long ram_size;
1285 u64 cur_alloc_size = 0;
1287 u64 blocksize = fs_info->sectorsize;
1288 struct btrfs_key ins;
1289 struct extent_map *em;
1290 unsigned clear_bits;
1291 unsigned long page_ops;
1292 bool extent_reserved = false;
1295 if (btrfs_is_free_space_inode(inode)) {
1300 num_bytes = ALIGN(end - start + 1, blocksize);
1301 num_bytes = max(blocksize, num_bytes);
1302 ASSERT(num_bytes <= btrfs_super_total_bytes(fs_info->super_copy));
1304 inode_should_defrag(inode, start, end, num_bytes, SZ_64K);
1307 * Due to the page size limit, for subpage we can only trigger the
1308 * writeback for the dirty sectors of page, that means data writeback
1309 * is doing more writeback than what we want.
1311 * This is especially unexpected for some call sites like fallocate,
1312 * where we only increase i_size after everything is done.
1313 * This means we can trigger inline extent even if we didn't want to.
1314 * So here we skip inline extent creation completely.
1316 if (start == 0 && fs_info->sectorsize == PAGE_SIZE && !no_inline) {
1317 u64 actual_end = min_t(u64, i_size_read(&inode->vfs_inode),
1320 /* lets try to make an inline extent */
1321 ret = cow_file_range_inline(inode, actual_end, 0,
1322 BTRFS_COMPRESS_NONE, NULL, false);
1325 * We use DO_ACCOUNTING here because we need the
1326 * delalloc_release_metadata to be run _after_ we drop
1327 * our outstanding extent for clearing delalloc for this
1330 extent_clear_unlock_delalloc(inode, start, end,
1332 EXTENT_LOCKED | EXTENT_DELALLOC |
1333 EXTENT_DELALLOC_NEW | EXTENT_DEFRAG |
1334 EXTENT_DO_ACCOUNTING, PAGE_UNLOCK |
1335 PAGE_START_WRITEBACK | PAGE_END_WRITEBACK);
1337 * locked_page is locked by the caller of
1338 * writepage_delalloc(), not locked by
1339 * __process_pages_contig().
1341 * We can't let __process_pages_contig() to unlock it,
1342 * as it doesn't have any subpage::writers recorded.
1344 * Here we manually unlock the page, since the caller
1345 * can't determine if it's an inline extent or a
1346 * compressed extent.
1348 unlock_page(locked_page);
1351 } else if (ret < 0) {
1356 alloc_hint = get_extent_allocation_hint(inode, start, num_bytes);
1359 * Relocation relies on the relocated extents to have exactly the same
1360 * size as the original extents. Normally writeback for relocation data
1361 * extents follows a NOCOW path because relocation preallocates the
1362 * extents. However, due to an operation such as scrub turning a block
1363 * group to RO mode, it may fallback to COW mode, so we must make sure
1364 * an extent allocated during COW has exactly the requested size and can
1365 * not be split into smaller extents, otherwise relocation breaks and
1366 * fails during the stage where it updates the bytenr of file extent
1369 if (btrfs_is_data_reloc_root(root))
1370 min_alloc_size = num_bytes;
1372 min_alloc_size = fs_info->sectorsize;
1374 while (num_bytes > 0) {
1375 struct btrfs_ordered_extent *ordered;
1377 cur_alloc_size = num_bytes;
1378 ret = btrfs_reserve_extent(root, cur_alloc_size, cur_alloc_size,
1379 min_alloc_size, 0, alloc_hint,
1381 if (ret == -EAGAIN) {
1383 * btrfs_reserve_extent only returns -EAGAIN for zoned
1384 * file systems, which is an indication that there are
1385 * no active zones to allocate from at the moment.
1387 * If this is the first loop iteration, wait for at
1388 * least one zone to finish before retrying the
1389 * allocation. Otherwise ask the caller to write out
1390 * the already allocated blocks before coming back to
1391 * us, or return -ENOSPC if it can't handle retries.
1393 ASSERT(btrfs_is_zoned(fs_info));
1394 if (start == orig_start) {
1395 wait_on_bit_io(&inode->root->fs_info->flags,
1396 BTRFS_FS_NEED_ZONE_FINISH,
1397 TASK_UNINTERRUPTIBLE);
1401 *done_offset = start - 1;
1408 cur_alloc_size = ins.offset;
1409 extent_reserved = true;
1411 ram_size = ins.offset;
1412 em = create_io_em(inode, start, ins.offset, /* len */
1413 start, /* orig_start */
1414 ins.objectid, /* block_start */
1415 ins.offset, /* block_len */
1416 ins.offset, /* orig_block_len */
1417 ram_size, /* ram_bytes */
1418 BTRFS_COMPRESS_NONE, /* compress_type */
1419 BTRFS_ORDERED_REGULAR /* type */);
1424 free_extent_map(em);
1426 ordered = btrfs_alloc_ordered_extent(inode, start, ram_size,
1427 ram_size, ins.objectid, cur_alloc_size,
1428 0, 1 << BTRFS_ORDERED_REGULAR,
1429 BTRFS_COMPRESS_NONE);
1430 if (IS_ERR(ordered)) {
1431 ret = PTR_ERR(ordered);
1432 goto out_drop_extent_cache;
1435 if (btrfs_is_data_reloc_root(root)) {
1436 ret = btrfs_reloc_clone_csums(ordered);
1439 * Only drop cache here, and process as normal.
1441 * We must not allow extent_clear_unlock_delalloc()
1442 * at out_unlock label to free meta of this ordered
1443 * extent, as its meta should be freed by
1444 * btrfs_finish_ordered_io().
1446 * So we must continue until @start is increased to
1447 * skip current ordered extent.
1450 btrfs_drop_extent_map_range(inode, start,
1451 start + ram_size - 1,
1454 btrfs_put_ordered_extent(ordered);
1456 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
1459 * We're not doing compressed IO, don't unlock the first page
1460 * (which the caller expects to stay locked), don't clear any
1461 * dirty bits and don't set any writeback bits
1463 * Do set the Ordered (Private2) bit so we know this page was
1464 * properly setup for writepage.
1466 page_ops = (keep_locked ? 0 : PAGE_UNLOCK);
1467 page_ops |= PAGE_SET_ORDERED;
1469 extent_clear_unlock_delalloc(inode, start, start + ram_size - 1,
1471 EXTENT_LOCKED | EXTENT_DELALLOC,
1473 if (num_bytes < cur_alloc_size)
1476 num_bytes -= cur_alloc_size;
1477 alloc_hint = ins.objectid + ins.offset;
1478 start += cur_alloc_size;
1479 extent_reserved = false;
1482 * btrfs_reloc_clone_csums() error, since start is increased
1483 * extent_clear_unlock_delalloc() at out_unlock label won't
1484 * free metadata of current ordered extent, we're OK to exit.
1494 out_drop_extent_cache:
1495 btrfs_drop_extent_map_range(inode, start, start + ram_size - 1, false);
1497 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
1498 btrfs_free_reserved_extent(fs_info, ins.objectid, ins.offset, 1);
1501 * Now, we have three regions to clean up:
1503 * |-------(1)----|---(2)---|-------------(3)----------|
1504 * `- orig_start `- start `- start + cur_alloc_size `- end
1506 * We process each region below.
1509 clear_bits = EXTENT_LOCKED | EXTENT_DELALLOC | EXTENT_DELALLOC_NEW |
1510 EXTENT_DEFRAG | EXTENT_CLEAR_META_RESV;
1511 page_ops = PAGE_UNLOCK | PAGE_START_WRITEBACK | PAGE_END_WRITEBACK;
1514 * For the range (1). We have already instantiated the ordered extents
1515 * for this region. They are cleaned up by
1516 * btrfs_cleanup_ordered_extents() in e.g,
1517 * btrfs_run_delalloc_range(). EXTENT_LOCKED | EXTENT_DELALLOC are
1518 * already cleared in the above loop. And, EXTENT_DELALLOC_NEW |
1519 * EXTENT_DEFRAG | EXTENT_CLEAR_META_RESV are handled by the cleanup
1522 * However, in case of @keep_locked, we still need to unlock the pages
1523 * (except @locked_page) to ensure all the pages are unlocked.
1525 if (keep_locked && orig_start < start) {
1527 mapping_set_error(inode->vfs_inode.i_mapping, ret);
1528 extent_clear_unlock_delalloc(inode, orig_start, start - 1,
1529 locked_page, 0, page_ops);
1533 * For the range (2). If we reserved an extent for our delalloc range
1534 * (or a subrange) and failed to create the respective ordered extent,
1535 * then it means that when we reserved the extent we decremented the
1536 * extent's size from the data space_info's bytes_may_use counter and
1537 * incremented the space_info's bytes_reserved counter by the same
1538 * amount. We must make sure extent_clear_unlock_delalloc() does not try
1539 * to decrement again the data space_info's bytes_may_use counter,
1540 * therefore we do not pass it the flag EXTENT_CLEAR_DATA_RESV.
1542 if (extent_reserved) {
1543 extent_clear_unlock_delalloc(inode, start,
1544 start + cur_alloc_size - 1,
1548 start += cur_alloc_size;
1552 * For the range (3). We never touched the region. In addition to the
1553 * clear_bits above, we add EXTENT_CLEAR_DATA_RESV to release the data
1554 * space_info's bytes_may_use counter, reserved in
1555 * btrfs_check_data_free_space().
1558 clear_bits |= EXTENT_CLEAR_DATA_RESV;
1559 extent_clear_unlock_delalloc(inode, start, end, locked_page,
1560 clear_bits, page_ops);
1566 * Phase two of compressed writeback. This is the ordered portion of the code,
1567 * which only gets called in the order the work was queued. We walk all the
1568 * async extents created by compress_file_range and send them down to the disk.
1570 * If called with @do_free == true then it'll try to finish the work and free
1571 * the work struct eventually.
1573 static noinline void submit_compressed_extents(struct btrfs_work *work, bool do_free)
1575 struct async_chunk *async_chunk = container_of(work, struct async_chunk,
1577 struct btrfs_fs_info *fs_info = btrfs_work_owner(work);
1578 struct async_extent *async_extent;
1579 unsigned long nr_pages;
1583 struct async_chunk *async_chunk;
1584 struct async_cow *async_cow;
1586 async_chunk = container_of(work, struct async_chunk, work);
1587 btrfs_add_delayed_iput(async_chunk->inode);
1588 if (async_chunk->blkcg_css)
1589 css_put(async_chunk->blkcg_css);
1591 async_cow = async_chunk->async_cow;
1592 if (atomic_dec_and_test(&async_cow->num_chunks))
1597 nr_pages = (async_chunk->end - async_chunk->start + PAGE_SIZE) >>
1600 while (!list_empty(&async_chunk->extents)) {
1601 async_extent = list_entry(async_chunk->extents.next,
1602 struct async_extent, list);
1603 list_del(&async_extent->list);
1604 submit_one_async_extent(async_chunk, async_extent, &alloc_hint);
1607 /* atomic_sub_return implies a barrier */
1608 if (atomic_sub_return(nr_pages, &fs_info->async_delalloc_pages) <
1610 cond_wake_up_nomb(&fs_info->async_submit_wait);
1613 static bool run_delalloc_compressed(struct btrfs_inode *inode,
1614 struct page *locked_page, u64 start,
1615 u64 end, struct writeback_control *wbc)
1617 struct btrfs_fs_info *fs_info = inode->root->fs_info;
1618 struct cgroup_subsys_state *blkcg_css = wbc_blkcg_css(wbc);
1619 struct async_cow *ctx;
1620 struct async_chunk *async_chunk;
1621 unsigned long nr_pages;
1622 u64 num_chunks = DIV_ROUND_UP(end - start, SZ_512K);
1625 const blk_opf_t write_flags = wbc_to_write_flags(wbc);
1627 nofs_flag = memalloc_nofs_save();
1628 ctx = kvmalloc(struct_size(ctx, chunks, num_chunks), GFP_KERNEL);
1629 memalloc_nofs_restore(nofs_flag);
1633 unlock_extent(&inode->io_tree, start, end, NULL);
1634 set_bit(BTRFS_INODE_HAS_ASYNC_EXTENT, &inode->runtime_flags);
1636 async_chunk = ctx->chunks;
1637 atomic_set(&ctx->num_chunks, num_chunks);
1639 for (i = 0; i < num_chunks; i++) {
1640 u64 cur_end = min(end, start + SZ_512K - 1);
1643 * igrab is called higher up in the call chain, take only the
1644 * lightweight reference for the callback lifetime
1646 ihold(&inode->vfs_inode);
1647 async_chunk[i].async_cow = ctx;
1648 async_chunk[i].inode = inode;
1649 async_chunk[i].start = start;
1650 async_chunk[i].end = cur_end;
1651 async_chunk[i].write_flags = write_flags;
1652 INIT_LIST_HEAD(&async_chunk[i].extents);
1655 * The locked_page comes all the way from writepage and its
1656 * the original page we were actually given. As we spread
1657 * this large delalloc region across multiple async_chunk
1658 * structs, only the first struct needs a pointer to locked_page
1660 * This way we don't need racey decisions about who is supposed
1665 * Depending on the compressibility, the pages might or
1666 * might not go through async. We want all of them to
1667 * be accounted against wbc once. Let's do it here
1668 * before the paths diverge. wbc accounting is used
1669 * only for foreign writeback detection and doesn't
1670 * need full accuracy. Just account the whole thing
1671 * against the first page.
1673 wbc_account_cgroup_owner(wbc, locked_page,
1675 async_chunk[i].locked_page = locked_page;
1678 async_chunk[i].locked_page = NULL;
1681 if (blkcg_css != blkcg_root_css) {
1683 async_chunk[i].blkcg_css = blkcg_css;
1684 async_chunk[i].write_flags |= REQ_BTRFS_CGROUP_PUNT;
1686 async_chunk[i].blkcg_css = NULL;
1689 btrfs_init_work(&async_chunk[i].work, compress_file_range,
1690 submit_compressed_extents);
1692 nr_pages = DIV_ROUND_UP(cur_end - start, PAGE_SIZE);
1693 atomic_add(nr_pages, &fs_info->async_delalloc_pages);
1695 btrfs_queue_work(fs_info->delalloc_workers, &async_chunk[i].work);
1697 start = cur_end + 1;
1703 * Run the delalloc range from start to end, and write back any dirty pages
1704 * covered by the range.
1706 static noinline int run_delalloc_cow(struct btrfs_inode *inode,
1707 struct page *locked_page, u64 start,
1708 u64 end, struct writeback_control *wbc,
1711 u64 done_offset = end;
1714 while (start <= end) {
1715 ret = cow_file_range(inode, locked_page, start, end, &done_offset,
1719 extent_write_locked_range(&inode->vfs_inode, locked_page, start,
1720 done_offset, wbc, pages_dirty);
1721 start = done_offset + 1;
1727 static noinline int csum_exist_in_range(struct btrfs_fs_info *fs_info,
1728 u64 bytenr, u64 num_bytes, bool nowait)
1730 struct btrfs_root *csum_root = btrfs_csum_root(fs_info, bytenr);
1731 struct btrfs_ordered_sum *sums;
1735 ret = btrfs_lookup_csums_list(csum_root, bytenr, bytenr + num_bytes - 1,
1737 if (ret == 0 && list_empty(&list))
1740 while (!list_empty(&list)) {
1741 sums = list_entry(list.next, struct btrfs_ordered_sum, list);
1742 list_del(&sums->list);
1750 static int fallback_to_cow(struct btrfs_inode *inode, struct page *locked_page,
1751 const u64 start, const u64 end)
1753 const bool is_space_ino = btrfs_is_free_space_inode(inode);
1754 const bool is_reloc_ino = btrfs_is_data_reloc_root(inode->root);
1755 const u64 range_bytes = end + 1 - start;
1756 struct extent_io_tree *io_tree = &inode->io_tree;
1757 u64 range_start = start;
1762 * If EXTENT_NORESERVE is set it means that when the buffered write was
1763 * made we had not enough available data space and therefore we did not
1764 * reserve data space for it, since we though we could do NOCOW for the
1765 * respective file range (either there is prealloc extent or the inode
1766 * has the NOCOW bit set).
1768 * However when we need to fallback to COW mode (because for example the
1769 * block group for the corresponding extent was turned to RO mode by a
1770 * scrub or relocation) we need to do the following:
1772 * 1) We increment the bytes_may_use counter of the data space info.
1773 * If COW succeeds, it allocates a new data extent and after doing
1774 * that it decrements the space info's bytes_may_use counter and
1775 * increments its bytes_reserved counter by the same amount (we do
1776 * this at btrfs_add_reserved_bytes()). So we need to increment the
1777 * bytes_may_use counter to compensate (when space is reserved at
1778 * buffered write time, the bytes_may_use counter is incremented);
1780 * 2) We clear the EXTENT_NORESERVE bit from the range. We do this so
1781 * that if the COW path fails for any reason, it decrements (through
1782 * extent_clear_unlock_delalloc()) the bytes_may_use counter of the
1783 * data space info, which we incremented in the step above.
1785 * If we need to fallback to cow and the inode corresponds to a free
1786 * space cache inode or an inode of the data relocation tree, we must
1787 * also increment bytes_may_use of the data space_info for the same
1788 * reason. Space caches and relocated data extents always get a prealloc
1789 * extent for them, however scrub or balance may have set the block
1790 * group that contains that extent to RO mode and therefore force COW
1791 * when starting writeback.
1793 count = count_range_bits(io_tree, &range_start, end, range_bytes,
1794 EXTENT_NORESERVE, 0, NULL);
1795 if (count > 0 || is_space_ino || is_reloc_ino) {
1797 struct btrfs_fs_info *fs_info = inode->root->fs_info;
1798 struct btrfs_space_info *sinfo = fs_info->data_sinfo;
1800 if (is_space_ino || is_reloc_ino)
1801 bytes = range_bytes;
1803 spin_lock(&sinfo->lock);
1804 btrfs_space_info_update_bytes_may_use(fs_info, sinfo, bytes);
1805 spin_unlock(&sinfo->lock);
1808 clear_extent_bit(io_tree, start, end, EXTENT_NORESERVE,
1813 * Don't try to create inline extents, as a mix of inline extent that
1814 * is written out and unlocked directly and a normal NOCOW extent
1817 ret = cow_file_range(inode, locked_page, start, end, NULL, false, true);
1822 struct can_nocow_file_extent_args {
1825 /* Start file offset of the range we want to NOCOW. */
1827 /* End file offset (inclusive) of the range we want to NOCOW. */
1829 bool writeback_path;
1832 * Free the path passed to can_nocow_file_extent() once it's not needed
1837 /* Output fields. Only set when can_nocow_file_extent() returns 1. */
1842 /* Number of bytes that can be written to in NOCOW mode. */
1847 * Check if we can NOCOW the file extent that the path points to.
1848 * This function may return with the path released, so the caller should check
1849 * if path->nodes[0] is NULL or not if it needs to use the path afterwards.
1851 * Returns: < 0 on error
1852 * 0 if we can not NOCOW
1855 static int can_nocow_file_extent(struct btrfs_path *path,
1856 struct btrfs_key *key,
1857 struct btrfs_inode *inode,
1858 struct can_nocow_file_extent_args *args)
1860 const bool is_freespace_inode = btrfs_is_free_space_inode(inode);
1861 struct extent_buffer *leaf = path->nodes[0];
1862 struct btrfs_root *root = inode->root;
1863 struct btrfs_file_extent_item *fi;
1868 bool nowait = path->nowait;
1870 fi = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_file_extent_item);
1871 extent_type = btrfs_file_extent_type(leaf, fi);
1873 if (extent_type == BTRFS_FILE_EXTENT_INLINE)
1876 /* Can't access these fields unless we know it's not an inline extent. */
1877 args->disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi);
1878 args->disk_num_bytes = btrfs_file_extent_disk_num_bytes(leaf, fi);
1879 args->extent_offset = btrfs_file_extent_offset(leaf, fi);
1881 if (!(inode->flags & BTRFS_INODE_NODATACOW) &&
1882 extent_type == BTRFS_FILE_EXTENT_REG)
1886 * If the extent was created before the generation where the last snapshot
1887 * for its subvolume was created, then this implies the extent is shared,
1888 * hence we must COW.
1890 if (!args->strict &&
1891 btrfs_file_extent_generation(leaf, fi) <=
1892 btrfs_root_last_snapshot(&root->root_item))
1895 /* An explicit hole, must COW. */
1896 if (args->disk_bytenr == 0)
1899 /* Compressed/encrypted/encoded extents must be COWed. */
1900 if (btrfs_file_extent_compression(leaf, fi) ||
1901 btrfs_file_extent_encryption(leaf, fi) ||
1902 btrfs_file_extent_other_encoding(leaf, fi))
1905 extent_end = btrfs_file_extent_end(path);
1908 * The following checks can be expensive, as they need to take other
1909 * locks and do btree or rbtree searches, so release the path to avoid
1910 * blocking other tasks for too long.
1912 btrfs_release_path(path);
1914 ret = btrfs_cross_ref_exist(root, btrfs_ino(inode),
1915 key->offset - args->extent_offset,
1916 args->disk_bytenr, args->strict, path);
1917 WARN_ON_ONCE(ret > 0 && is_freespace_inode);
1921 if (args->free_path) {
1923 * We don't need the path anymore, plus through the
1924 * csum_exist_in_range() call below we will end up allocating
1925 * another path. So free the path to avoid unnecessary extra
1928 btrfs_free_path(path);
1932 /* If there are pending snapshots for this root, we must COW. */
1933 if (args->writeback_path && !is_freespace_inode &&
1934 atomic_read(&root->snapshot_force_cow))
1937 args->disk_bytenr += args->extent_offset;
1938 args->disk_bytenr += args->start - key->offset;
1939 args->num_bytes = min(args->end + 1, extent_end) - args->start;
1942 * Force COW if csums exist in the range. This ensures that csums for a
1943 * given extent are either valid or do not exist.
1945 ret = csum_exist_in_range(root->fs_info, args->disk_bytenr, args->num_bytes,
1947 WARN_ON_ONCE(ret > 0 && is_freespace_inode);
1953 if (args->free_path && path)
1954 btrfs_free_path(path);
1956 return ret < 0 ? ret : can_nocow;
1960 * when nowcow writeback call back. This checks for snapshots or COW copies
1961 * of the extents that exist in the file, and COWs the file as required.
1963 * If no cow copies or snapshots exist, we write directly to the existing
1966 static noinline int run_delalloc_nocow(struct btrfs_inode *inode,
1967 struct page *locked_page,
1968 const u64 start, const u64 end)
1970 struct btrfs_fs_info *fs_info = inode->root->fs_info;
1971 struct btrfs_root *root = inode->root;
1972 struct btrfs_path *path;
1973 u64 cow_start = (u64)-1;
1974 u64 cur_offset = start;
1976 bool check_prev = true;
1977 u64 ino = btrfs_ino(inode);
1978 struct can_nocow_file_extent_args nocow_args = { 0 };
1981 * Normally on a zoned device we're only doing COW writes, but in case
1982 * of relocation on a zoned filesystem serializes I/O so that we're only
1983 * writing sequentially and can end up here as well.
1985 ASSERT(!btrfs_is_zoned(fs_info) || btrfs_is_data_reloc_root(root));
1987 path = btrfs_alloc_path();
1993 nocow_args.end = end;
1994 nocow_args.writeback_path = true;
1997 struct btrfs_block_group *nocow_bg = NULL;
1998 struct btrfs_ordered_extent *ordered;
1999 struct btrfs_key found_key;
2000 struct btrfs_file_extent_item *fi;
2001 struct extent_buffer *leaf;
2008 ret = btrfs_lookup_file_extent(NULL, root, path, ino,
2014 * If there is no extent for our range when doing the initial
2015 * search, then go back to the previous slot as it will be the
2016 * one containing the search offset
2018 if (ret > 0 && path->slots[0] > 0 && check_prev) {
2019 leaf = path->nodes[0];
2020 btrfs_item_key_to_cpu(leaf, &found_key,
2021 path->slots[0] - 1);
2022 if (found_key.objectid == ino &&
2023 found_key.type == BTRFS_EXTENT_DATA_KEY)
2028 /* Go to next leaf if we have exhausted the current one */
2029 leaf = path->nodes[0];
2030 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
2031 ret = btrfs_next_leaf(root, path);
2036 leaf = path->nodes[0];
2039 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
2041 /* Didn't find anything for our INO */
2042 if (found_key.objectid > ino)
2045 * Keep searching until we find an EXTENT_ITEM or there are no
2046 * more extents for this inode
2048 if (WARN_ON_ONCE(found_key.objectid < ino) ||
2049 found_key.type < BTRFS_EXTENT_DATA_KEY) {
2054 /* Found key is not EXTENT_DATA_KEY or starts after req range */
2055 if (found_key.type > BTRFS_EXTENT_DATA_KEY ||
2056 found_key.offset > end)
2060 * If the found extent starts after requested offset, then
2061 * adjust extent_end to be right before this extent begins
2063 if (found_key.offset > cur_offset) {
2064 extent_end = found_key.offset;
2070 * Found extent which begins before our range and potentially
2073 fi = btrfs_item_ptr(leaf, path->slots[0],
2074 struct btrfs_file_extent_item);
2075 extent_type = btrfs_file_extent_type(leaf, fi);
2076 /* If this is triggered then we have a memory corruption. */
2077 ASSERT(extent_type < BTRFS_NR_FILE_EXTENT_TYPES);
2078 if (WARN_ON(extent_type >= BTRFS_NR_FILE_EXTENT_TYPES)) {
2082 ram_bytes = btrfs_file_extent_ram_bytes(leaf, fi);
2083 extent_end = btrfs_file_extent_end(path);
2086 * If the extent we got ends before our current offset, skip to
2089 if (extent_end <= cur_offset) {
2094 nocow_args.start = cur_offset;
2095 ret = can_nocow_file_extent(path, &found_key, inode, &nocow_args);
2102 nocow_bg = btrfs_inc_nocow_writers(fs_info, nocow_args.disk_bytenr);
2106 * If we can't perform NOCOW writeback for the range,
2107 * then record the beginning of the range that needs to
2108 * be COWed. It will be written out before the next
2109 * NOCOW range if we find one, or when exiting this
2112 if (cow_start == (u64)-1)
2113 cow_start = cur_offset;
2114 cur_offset = extent_end;
2115 if (cur_offset > end)
2117 if (!path->nodes[0])
2124 * COW range from cow_start to found_key.offset - 1. As the key
2125 * will contain the beginning of the first extent that can be
2126 * NOCOW, following one which needs to be COW'ed
2128 if (cow_start != (u64)-1) {
2129 ret = fallback_to_cow(inode, locked_page,
2130 cow_start, found_key.offset - 1);
2131 cow_start = (u64)-1;
2133 btrfs_dec_nocow_writers(nocow_bg);
2138 nocow_end = cur_offset + nocow_args.num_bytes - 1;
2139 is_prealloc = extent_type == BTRFS_FILE_EXTENT_PREALLOC;
2141 u64 orig_start = found_key.offset - nocow_args.extent_offset;
2142 struct extent_map *em;
2144 em = create_io_em(inode, cur_offset, nocow_args.num_bytes,
2146 nocow_args.disk_bytenr, /* block_start */
2147 nocow_args.num_bytes, /* block_len */
2148 nocow_args.disk_num_bytes, /* orig_block_len */
2149 ram_bytes, BTRFS_COMPRESS_NONE,
2150 BTRFS_ORDERED_PREALLOC);
2152 btrfs_dec_nocow_writers(nocow_bg);
2156 free_extent_map(em);
2159 ordered = btrfs_alloc_ordered_extent(inode, cur_offset,
2160 nocow_args.num_bytes, nocow_args.num_bytes,
2161 nocow_args.disk_bytenr, nocow_args.num_bytes, 0,
2163 ? (1 << BTRFS_ORDERED_PREALLOC)
2164 : (1 << BTRFS_ORDERED_NOCOW),
2165 BTRFS_COMPRESS_NONE);
2166 btrfs_dec_nocow_writers(nocow_bg);
2167 if (IS_ERR(ordered)) {
2169 btrfs_drop_extent_map_range(inode, cur_offset,
2172 ret = PTR_ERR(ordered);
2176 if (btrfs_is_data_reloc_root(root))
2178 * Error handled later, as we must prevent
2179 * extent_clear_unlock_delalloc() in error handler
2180 * from freeing metadata of created ordered extent.
2182 ret = btrfs_reloc_clone_csums(ordered);
2183 btrfs_put_ordered_extent(ordered);
2185 extent_clear_unlock_delalloc(inode, cur_offset, nocow_end,
2186 locked_page, EXTENT_LOCKED |
2188 EXTENT_CLEAR_DATA_RESV,
2189 PAGE_UNLOCK | PAGE_SET_ORDERED);
2191 cur_offset = extent_end;
2194 * btrfs_reloc_clone_csums() error, now we're OK to call error
2195 * handler, as metadata for created ordered extent will only
2196 * be freed by btrfs_finish_ordered_io().
2200 if (cur_offset > end)
2203 btrfs_release_path(path);
2205 if (cur_offset <= end && cow_start == (u64)-1)
2206 cow_start = cur_offset;
2208 if (cow_start != (u64)-1) {
2210 ret = fallback_to_cow(inode, locked_page, cow_start, end);
2211 cow_start = (u64)-1;
2216 btrfs_free_path(path);
2221 * If an error happened while a COW region is outstanding, cur_offset
2222 * needs to be reset to cow_start to ensure the COW region is unlocked
2225 if (cow_start != (u64)-1)
2226 cur_offset = cow_start;
2227 if (cur_offset < end)
2228 extent_clear_unlock_delalloc(inode, cur_offset, end,
2229 locked_page, EXTENT_LOCKED |
2230 EXTENT_DELALLOC | EXTENT_DEFRAG |
2231 EXTENT_DO_ACCOUNTING, PAGE_UNLOCK |
2232 PAGE_START_WRITEBACK |
2233 PAGE_END_WRITEBACK);
2234 btrfs_free_path(path);
2238 static bool should_nocow(struct btrfs_inode *inode, u64 start, u64 end)
2240 if (inode->flags & (BTRFS_INODE_NODATACOW | BTRFS_INODE_PREALLOC)) {
2241 if (inode->defrag_bytes &&
2242 test_range_bit(&inode->io_tree, start, end, EXTENT_DEFRAG,
2251 * Function to process delayed allocation (create CoW) for ranges which are
2252 * being touched for the first time.
2254 int btrfs_run_delalloc_range(struct btrfs_inode *inode, struct page *locked_page,
2255 u64 start, u64 end, struct writeback_control *wbc)
2257 const bool zoned = btrfs_is_zoned(inode->root->fs_info);
2261 * The range must cover part of the @locked_page, or a return of 1
2262 * can confuse the caller.
2264 ASSERT(!(end <= page_offset(locked_page) ||
2265 start >= page_offset(locked_page) + PAGE_SIZE));
2267 if (should_nocow(inode, start, end)) {
2268 ret = run_delalloc_nocow(inode, locked_page, start, end);
2272 if (btrfs_inode_can_compress(inode) &&
2273 inode_need_compress(inode, start, end) &&
2274 run_delalloc_compressed(inode, locked_page, start, end, wbc))
2278 ret = run_delalloc_cow(inode, locked_page, start, end, wbc,
2281 ret = cow_file_range(inode, locked_page, start, end, NULL,
2286 btrfs_cleanup_ordered_extents(inode, locked_page, start,
2291 void btrfs_split_delalloc_extent(struct btrfs_inode *inode,
2292 struct extent_state *orig, u64 split)
2294 struct btrfs_fs_info *fs_info = inode->root->fs_info;
2297 /* not delalloc, ignore it */
2298 if (!(orig->state & EXTENT_DELALLOC))
2301 size = orig->end - orig->start + 1;
2302 if (size > fs_info->max_extent_size) {
2307 * See the explanation in btrfs_merge_delalloc_extent, the same
2308 * applies here, just in reverse.
2310 new_size = orig->end - split + 1;
2311 num_extents = count_max_extents(fs_info, new_size);
2312 new_size = split - orig->start;
2313 num_extents += count_max_extents(fs_info, new_size);
2314 if (count_max_extents(fs_info, size) >= num_extents)
2318 spin_lock(&inode->lock);
2319 btrfs_mod_outstanding_extents(inode, 1);
2320 spin_unlock(&inode->lock);
2324 * Handle merged delayed allocation extents so we can keep track of new extents
2325 * that are just merged onto old extents, such as when we are doing sequential
2326 * writes, so we can properly account for the metadata space we'll need.
2328 void btrfs_merge_delalloc_extent(struct btrfs_inode *inode, struct extent_state *new,
2329 struct extent_state *other)
2331 struct btrfs_fs_info *fs_info = inode->root->fs_info;
2332 u64 new_size, old_size;
2335 /* not delalloc, ignore it */
2336 if (!(other->state & EXTENT_DELALLOC))
2339 if (new->start > other->start)
2340 new_size = new->end - other->start + 1;
2342 new_size = other->end - new->start + 1;
2344 /* we're not bigger than the max, unreserve the space and go */
2345 if (new_size <= fs_info->max_extent_size) {
2346 spin_lock(&inode->lock);
2347 btrfs_mod_outstanding_extents(inode, -1);
2348 spin_unlock(&inode->lock);
2353 * We have to add up either side to figure out how many extents were
2354 * accounted for before we merged into one big extent. If the number of
2355 * extents we accounted for is <= the amount we need for the new range
2356 * then we can return, otherwise drop. Think of it like this
2360 * So we've grown the extent by a MAX_SIZE extent, this would mean we
2361 * need 2 outstanding extents, on one side we have 1 and the other side
2362 * we have 1 so they are == and we can return. But in this case
2364 * [MAX_SIZE+4k][MAX_SIZE+4k]
2366 * Each range on their own accounts for 2 extents, but merged together
2367 * they are only 3 extents worth of accounting, so we need to drop in
2370 old_size = other->end - other->start + 1;
2371 num_extents = count_max_extents(fs_info, old_size);
2372 old_size = new->end - new->start + 1;
2373 num_extents += count_max_extents(fs_info, old_size);
2374 if (count_max_extents(fs_info, new_size) >= num_extents)
2377 spin_lock(&inode->lock);
2378 btrfs_mod_outstanding_extents(inode, -1);
2379 spin_unlock(&inode->lock);
2382 static void btrfs_add_delalloc_inodes(struct btrfs_root *root,
2383 struct btrfs_inode *inode)
2385 struct btrfs_fs_info *fs_info = inode->root->fs_info;
2387 spin_lock(&root->delalloc_lock);
2388 if (list_empty(&inode->delalloc_inodes)) {
2389 list_add_tail(&inode->delalloc_inodes, &root->delalloc_inodes);
2390 set_bit(BTRFS_INODE_IN_DELALLOC_LIST, &inode->runtime_flags);
2391 root->nr_delalloc_inodes++;
2392 if (root->nr_delalloc_inodes == 1) {
2393 spin_lock(&fs_info->delalloc_root_lock);
2394 BUG_ON(!list_empty(&root->delalloc_root));
2395 list_add_tail(&root->delalloc_root,
2396 &fs_info->delalloc_roots);
2397 spin_unlock(&fs_info->delalloc_root_lock);
2400 spin_unlock(&root->delalloc_lock);
2403 void __btrfs_del_delalloc_inode(struct btrfs_root *root,
2404 struct btrfs_inode *inode)
2406 struct btrfs_fs_info *fs_info = root->fs_info;
2408 if (!list_empty(&inode->delalloc_inodes)) {
2409 list_del_init(&inode->delalloc_inodes);
2410 clear_bit(BTRFS_INODE_IN_DELALLOC_LIST,
2411 &inode->runtime_flags);
2412 root->nr_delalloc_inodes--;
2413 if (!root->nr_delalloc_inodes) {
2414 ASSERT(list_empty(&root->delalloc_inodes));
2415 spin_lock(&fs_info->delalloc_root_lock);
2416 BUG_ON(list_empty(&root->delalloc_root));
2417 list_del_init(&root->delalloc_root);
2418 spin_unlock(&fs_info->delalloc_root_lock);
2423 static void btrfs_del_delalloc_inode(struct btrfs_root *root,
2424 struct btrfs_inode *inode)
2426 spin_lock(&root->delalloc_lock);
2427 __btrfs_del_delalloc_inode(root, inode);
2428 spin_unlock(&root->delalloc_lock);
2432 * Properly track delayed allocation bytes in the inode and to maintain the
2433 * list of inodes that have pending delalloc work to be done.
2435 void btrfs_set_delalloc_extent(struct btrfs_inode *inode, struct extent_state *state,
2438 struct btrfs_fs_info *fs_info = inode->root->fs_info;
2440 if ((bits & EXTENT_DEFRAG) && !(bits & EXTENT_DELALLOC))
2443 * set_bit and clear bit hooks normally require _irqsave/restore
2444 * but in this case, we are only testing for the DELALLOC
2445 * bit, which is only set or cleared with irqs on
2447 if (!(state->state & EXTENT_DELALLOC) && (bits & EXTENT_DELALLOC)) {
2448 struct btrfs_root *root = inode->root;
2449 u64 len = state->end + 1 - state->start;
2450 u32 num_extents = count_max_extents(fs_info, len);
2451 bool do_list = !btrfs_is_free_space_inode(inode);
2453 spin_lock(&inode->lock);
2454 btrfs_mod_outstanding_extents(inode, num_extents);
2455 spin_unlock(&inode->lock);
2457 /* For sanity tests */
2458 if (btrfs_is_testing(fs_info))
2461 percpu_counter_add_batch(&fs_info->delalloc_bytes, len,
2462 fs_info->delalloc_batch);
2463 spin_lock(&inode->lock);
2464 inode->delalloc_bytes += len;
2465 if (bits & EXTENT_DEFRAG)
2466 inode->defrag_bytes += len;
2467 if (do_list && !test_bit(BTRFS_INODE_IN_DELALLOC_LIST,
2468 &inode->runtime_flags))
2469 btrfs_add_delalloc_inodes(root, inode);
2470 spin_unlock(&inode->lock);
2473 if (!(state->state & EXTENT_DELALLOC_NEW) &&
2474 (bits & EXTENT_DELALLOC_NEW)) {
2475 spin_lock(&inode->lock);
2476 inode->new_delalloc_bytes += state->end + 1 - state->start;
2477 spin_unlock(&inode->lock);
2482 * Once a range is no longer delalloc this function ensures that proper
2483 * accounting happens.
2485 void btrfs_clear_delalloc_extent(struct btrfs_inode *inode,
2486 struct extent_state *state, u32 bits)
2488 struct btrfs_fs_info *fs_info = inode->root->fs_info;
2489 u64 len = state->end + 1 - state->start;
2490 u32 num_extents = count_max_extents(fs_info, len);
2492 if ((state->state & EXTENT_DEFRAG) && (bits & EXTENT_DEFRAG)) {
2493 spin_lock(&inode->lock);
2494 inode->defrag_bytes -= len;
2495 spin_unlock(&inode->lock);
2499 * set_bit and clear bit hooks normally require _irqsave/restore
2500 * but in this case, we are only testing for the DELALLOC
2501 * bit, which is only set or cleared with irqs on
2503 if ((state->state & EXTENT_DELALLOC) && (bits & EXTENT_DELALLOC)) {
2504 struct btrfs_root *root = inode->root;
2505 bool do_list = !btrfs_is_free_space_inode(inode);
2507 spin_lock(&inode->lock);
2508 btrfs_mod_outstanding_extents(inode, -num_extents);
2509 spin_unlock(&inode->lock);
2512 * We don't reserve metadata space for space cache inodes so we
2513 * don't need to call delalloc_release_metadata if there is an
2516 if (bits & EXTENT_CLEAR_META_RESV &&
2517 root != fs_info->tree_root)
2518 btrfs_delalloc_release_metadata(inode, len, false);
2520 /* For sanity tests. */
2521 if (btrfs_is_testing(fs_info))
2524 if (!btrfs_is_data_reloc_root(root) &&
2525 do_list && !(state->state & EXTENT_NORESERVE) &&
2526 (bits & EXTENT_CLEAR_DATA_RESV))
2527 btrfs_free_reserved_data_space_noquota(fs_info, len);
2529 percpu_counter_add_batch(&fs_info->delalloc_bytes, -len,
2530 fs_info->delalloc_batch);
2531 spin_lock(&inode->lock);
2532 inode->delalloc_bytes -= len;
2533 if (do_list && inode->delalloc_bytes == 0 &&
2534 test_bit(BTRFS_INODE_IN_DELALLOC_LIST,
2535 &inode->runtime_flags))
2536 btrfs_del_delalloc_inode(root, inode);
2537 spin_unlock(&inode->lock);
2540 if ((state->state & EXTENT_DELALLOC_NEW) &&
2541 (bits & EXTENT_DELALLOC_NEW)) {
2542 spin_lock(&inode->lock);
2543 ASSERT(inode->new_delalloc_bytes >= len);
2544 inode->new_delalloc_bytes -= len;
2545 if (bits & EXTENT_ADD_INODE_BYTES)
2546 inode_add_bytes(&inode->vfs_inode, len);
2547 spin_unlock(&inode->lock);
2551 static int btrfs_extract_ordered_extent(struct btrfs_bio *bbio,
2552 struct btrfs_ordered_extent *ordered)
2554 u64 start = (u64)bbio->bio.bi_iter.bi_sector << SECTOR_SHIFT;
2555 u64 len = bbio->bio.bi_iter.bi_size;
2556 struct btrfs_ordered_extent *new;
2559 /* Must always be called for the beginning of an ordered extent. */
2560 if (WARN_ON_ONCE(start != ordered->disk_bytenr))
2563 /* No need to split if the ordered extent covers the entire bio. */
2564 if (ordered->disk_num_bytes == len) {
2565 refcount_inc(&ordered->refs);
2566 bbio->ordered = ordered;
2571 * Don't split the extent_map for NOCOW extents, as we're writing into
2572 * a pre-existing one.
2574 if (!test_bit(BTRFS_ORDERED_NOCOW, &ordered->flags)) {
2575 ret = split_extent_map(bbio->inode, bbio->file_offset,
2576 ordered->num_bytes, len,
2577 ordered->disk_bytenr);
2582 new = btrfs_split_ordered_extent(ordered, len);
2584 return PTR_ERR(new);
2585 bbio->ordered = new;
2590 * given a list of ordered sums record them in the inode. This happens
2591 * at IO completion time based on sums calculated at bio submission time.
2593 static int add_pending_csums(struct btrfs_trans_handle *trans,
2594 struct list_head *list)
2596 struct btrfs_ordered_sum *sum;
2597 struct btrfs_root *csum_root = NULL;
2600 list_for_each_entry(sum, list, list) {
2601 trans->adding_csums = true;
2603 csum_root = btrfs_csum_root(trans->fs_info,
2605 ret = btrfs_csum_file_blocks(trans, csum_root, sum);
2606 trans->adding_csums = false;
2613 static int btrfs_find_new_delalloc_bytes(struct btrfs_inode *inode,
2616 struct extent_state **cached_state)
2618 u64 search_start = start;
2619 const u64 end = start + len - 1;
2621 while (search_start < end) {
2622 const u64 search_len = end - search_start + 1;
2623 struct extent_map *em;
2627 em = btrfs_get_extent(inode, NULL, 0, search_start, search_len);
2631 if (em->block_start != EXTENT_MAP_HOLE)
2635 if (em->start < search_start)
2636 em_len -= search_start - em->start;
2637 if (em_len > search_len)
2638 em_len = search_len;
2640 ret = set_extent_bit(&inode->io_tree, search_start,
2641 search_start + em_len - 1,
2642 EXTENT_DELALLOC_NEW, cached_state);
2644 search_start = extent_map_end(em);
2645 free_extent_map(em);
2652 int btrfs_set_extent_delalloc(struct btrfs_inode *inode, u64 start, u64 end,
2653 unsigned int extra_bits,
2654 struct extent_state **cached_state)
2656 WARN_ON(PAGE_ALIGNED(end));
2658 if (start >= i_size_read(&inode->vfs_inode) &&
2659 !(inode->flags & BTRFS_INODE_PREALLOC)) {
2661 * There can't be any extents following eof in this case so just
2662 * set the delalloc new bit for the range directly.
2664 extra_bits |= EXTENT_DELALLOC_NEW;
2668 ret = btrfs_find_new_delalloc_bytes(inode, start,
2675 return set_extent_bit(&inode->io_tree, start, end,
2676 EXTENT_DELALLOC | extra_bits, cached_state);
2679 /* see btrfs_writepage_start_hook for details on why this is required */
2680 struct btrfs_writepage_fixup {
2682 struct btrfs_inode *inode;
2683 struct btrfs_work work;
2686 static void btrfs_writepage_fixup_worker(struct btrfs_work *work)
2688 struct btrfs_writepage_fixup *fixup =
2689 container_of(work, struct btrfs_writepage_fixup, work);
2690 struct btrfs_ordered_extent *ordered;
2691 struct extent_state *cached_state = NULL;
2692 struct extent_changeset *data_reserved = NULL;
2693 struct page *page = fixup->page;
2694 struct btrfs_inode *inode = fixup->inode;
2695 struct btrfs_fs_info *fs_info = inode->root->fs_info;
2696 u64 page_start = page_offset(page);
2697 u64 page_end = page_offset(page) + PAGE_SIZE - 1;
2699 bool free_delalloc_space = true;
2702 * This is similar to page_mkwrite, we need to reserve the space before
2703 * we take the page lock.
2705 ret = btrfs_delalloc_reserve_space(inode, &data_reserved, page_start,
2711 * Before we queued this fixup, we took a reference on the page.
2712 * page->mapping may go NULL, but it shouldn't be moved to a different
2715 if (!page->mapping || !PageDirty(page) || !PageChecked(page)) {
2717 * Unfortunately this is a little tricky, either
2719 * 1) We got here and our page had already been dealt with and
2720 * we reserved our space, thus ret == 0, so we need to just
2721 * drop our space reservation and bail. This can happen the
2722 * first time we come into the fixup worker, or could happen
2723 * while waiting for the ordered extent.
2724 * 2) Our page was already dealt with, but we happened to get an
2725 * ENOSPC above from the btrfs_delalloc_reserve_space. In
2726 * this case we obviously don't have anything to release, but
2727 * because the page was already dealt with we don't want to
2728 * mark the page with an error, so make sure we're resetting
2729 * ret to 0. This is why we have this check _before_ the ret
2730 * check, because we do not want to have a surprise ENOSPC
2731 * when the page was already properly dealt with.
2734 btrfs_delalloc_release_extents(inode, PAGE_SIZE);
2735 btrfs_delalloc_release_space(inode, data_reserved,
2736 page_start, PAGE_SIZE,
2744 * We can't mess with the page state unless it is locked, so now that
2745 * it is locked bail if we failed to make our space reservation.
2750 lock_extent(&inode->io_tree, page_start, page_end, &cached_state);
2752 /* already ordered? We're done */
2753 if (PageOrdered(page))
2756 ordered = btrfs_lookup_ordered_range(inode, page_start, PAGE_SIZE);
2758 unlock_extent(&inode->io_tree, page_start, page_end,
2761 btrfs_start_ordered_extent(ordered);
2762 btrfs_put_ordered_extent(ordered);
2766 ret = btrfs_set_extent_delalloc(inode, page_start, page_end, 0,
2772 * Everything went as planned, we're now the owner of a dirty page with
2773 * delayed allocation bits set and space reserved for our COW
2776 * The page was dirty when we started, nothing should have cleaned it.
2778 BUG_ON(!PageDirty(page));
2779 free_delalloc_space = false;
2781 btrfs_delalloc_release_extents(inode, PAGE_SIZE);
2782 if (free_delalloc_space)
2783 btrfs_delalloc_release_space(inode, data_reserved, page_start,
2785 unlock_extent(&inode->io_tree, page_start, page_end, &cached_state);
2789 * We hit ENOSPC or other errors. Update the mapping and page
2790 * to reflect the errors and clean the page.
2792 mapping_set_error(page->mapping, ret);
2793 btrfs_mark_ordered_io_finished(inode, page, page_start,
2795 clear_page_dirty_for_io(page);
2797 btrfs_page_clear_checked(fs_info, page, page_start, PAGE_SIZE);
2801 extent_changeset_free(data_reserved);
2803 * As a precaution, do a delayed iput in case it would be the last iput
2804 * that could need flushing space. Recursing back to fixup worker would
2807 btrfs_add_delayed_iput(inode);
2811 * There are a few paths in the higher layers of the kernel that directly
2812 * set the page dirty bit without asking the filesystem if it is a
2813 * good idea. This causes problems because we want to make sure COW
2814 * properly happens and the data=ordered rules are followed.
2816 * In our case any range that doesn't have the ORDERED bit set
2817 * hasn't been properly setup for IO. We kick off an async process
2818 * to fix it up. The async helper will wait for ordered extents, set
2819 * the delalloc bit and make it safe to write the page.
2821 int btrfs_writepage_cow_fixup(struct page *page)
2823 struct inode *inode = page->mapping->host;
2824 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
2825 struct btrfs_writepage_fixup *fixup;
2827 /* This page has ordered extent covering it already */
2828 if (PageOrdered(page))
2832 * PageChecked is set below when we create a fixup worker for this page,
2833 * don't try to create another one if we're already PageChecked()
2835 * The extent_io writepage code will redirty the page if we send back
2838 if (PageChecked(page))
2841 fixup = kzalloc(sizeof(*fixup), GFP_NOFS);
2846 * We are already holding a reference to this inode from
2847 * write_cache_pages. We need to hold it because the space reservation
2848 * takes place outside of the page lock, and we can't trust
2849 * page->mapping outside of the page lock.
2852 btrfs_page_set_checked(fs_info, page, page_offset(page), PAGE_SIZE);
2854 btrfs_init_work(&fixup->work, btrfs_writepage_fixup_worker, NULL);
2856 fixup->inode = BTRFS_I(inode);
2857 btrfs_queue_work(fs_info->fixup_workers, &fixup->work);
2862 static int insert_reserved_file_extent(struct btrfs_trans_handle *trans,
2863 struct btrfs_inode *inode, u64 file_pos,
2864 struct btrfs_file_extent_item *stack_fi,
2865 const bool update_inode_bytes,
2866 u64 qgroup_reserved)
2868 struct btrfs_root *root = inode->root;
2869 const u64 sectorsize = root->fs_info->sectorsize;
2870 struct btrfs_path *path;
2871 struct extent_buffer *leaf;
2872 struct btrfs_key ins;
2873 u64 disk_num_bytes = btrfs_stack_file_extent_disk_num_bytes(stack_fi);
2874 u64 disk_bytenr = btrfs_stack_file_extent_disk_bytenr(stack_fi);
2875 u64 offset = btrfs_stack_file_extent_offset(stack_fi);
2876 u64 num_bytes = btrfs_stack_file_extent_num_bytes(stack_fi);
2877 u64 ram_bytes = btrfs_stack_file_extent_ram_bytes(stack_fi);
2878 struct btrfs_drop_extents_args drop_args = { 0 };
2881 path = btrfs_alloc_path();
2886 * we may be replacing one extent in the tree with another.
2887 * The new extent is pinned in the extent map, and we don't want
2888 * to drop it from the cache until it is completely in the btree.
2890 * So, tell btrfs_drop_extents to leave this extent in the cache.
2891 * the caller is expected to unpin it and allow it to be merged
2894 drop_args.path = path;
2895 drop_args.start = file_pos;
2896 drop_args.end = file_pos + num_bytes;
2897 drop_args.replace_extent = true;
2898 drop_args.extent_item_size = sizeof(*stack_fi);
2899 ret = btrfs_drop_extents(trans, root, inode, &drop_args);
2903 if (!drop_args.extent_inserted) {
2904 ins.objectid = btrfs_ino(inode);
2905 ins.offset = file_pos;
2906 ins.type = BTRFS_EXTENT_DATA_KEY;
2908 ret = btrfs_insert_empty_item(trans, root, path, &ins,
2913 leaf = path->nodes[0];
2914 btrfs_set_stack_file_extent_generation(stack_fi, trans->transid);
2915 write_extent_buffer(leaf, stack_fi,
2916 btrfs_item_ptr_offset(leaf, path->slots[0]),
2917 sizeof(struct btrfs_file_extent_item));
2919 btrfs_mark_buffer_dirty(trans, leaf);
2920 btrfs_release_path(path);
2923 * If we dropped an inline extent here, we know the range where it is
2924 * was not marked with the EXTENT_DELALLOC_NEW bit, so we update the
2925 * number of bytes only for that range containing the inline extent.
2926 * The remaining of the range will be processed when clearning the
2927 * EXTENT_DELALLOC_BIT bit through the ordered extent completion.
2929 if (file_pos == 0 && !IS_ALIGNED(drop_args.bytes_found, sectorsize)) {
2930 u64 inline_size = round_down(drop_args.bytes_found, sectorsize);
2932 inline_size = drop_args.bytes_found - inline_size;
2933 btrfs_update_inode_bytes(inode, sectorsize, inline_size);
2934 drop_args.bytes_found -= inline_size;
2935 num_bytes -= sectorsize;
2938 if (update_inode_bytes)
2939 btrfs_update_inode_bytes(inode, num_bytes, drop_args.bytes_found);
2941 ins.objectid = disk_bytenr;
2942 ins.offset = disk_num_bytes;
2943 ins.type = BTRFS_EXTENT_ITEM_KEY;
2945 ret = btrfs_inode_set_file_extent_range(inode, file_pos, ram_bytes);
2949 ret = btrfs_alloc_reserved_file_extent(trans, root, btrfs_ino(inode),
2951 qgroup_reserved, &ins);
2953 btrfs_free_path(path);
2958 static void btrfs_release_delalloc_bytes(struct btrfs_fs_info *fs_info,
2961 struct btrfs_block_group *cache;
2963 cache = btrfs_lookup_block_group(fs_info, start);
2966 spin_lock(&cache->lock);
2967 cache->delalloc_bytes -= len;
2968 spin_unlock(&cache->lock);
2970 btrfs_put_block_group(cache);
2973 static int insert_ordered_extent_file_extent(struct btrfs_trans_handle *trans,
2974 struct btrfs_ordered_extent *oe)
2976 struct btrfs_file_extent_item stack_fi;
2977 bool update_inode_bytes;
2978 u64 num_bytes = oe->num_bytes;
2979 u64 ram_bytes = oe->ram_bytes;
2981 memset(&stack_fi, 0, sizeof(stack_fi));
2982 btrfs_set_stack_file_extent_type(&stack_fi, BTRFS_FILE_EXTENT_REG);
2983 btrfs_set_stack_file_extent_disk_bytenr(&stack_fi, oe->disk_bytenr);
2984 btrfs_set_stack_file_extent_disk_num_bytes(&stack_fi,
2985 oe->disk_num_bytes);
2986 btrfs_set_stack_file_extent_offset(&stack_fi, oe->offset);
2987 if (test_bit(BTRFS_ORDERED_TRUNCATED, &oe->flags)) {
2988 num_bytes = oe->truncated_len;
2989 ram_bytes = num_bytes;
2991 btrfs_set_stack_file_extent_num_bytes(&stack_fi, num_bytes);
2992 btrfs_set_stack_file_extent_ram_bytes(&stack_fi, ram_bytes);
2993 btrfs_set_stack_file_extent_compression(&stack_fi, oe->compress_type);
2994 /* Encryption and other encoding is reserved and all 0 */
2997 * For delalloc, when completing an ordered extent we update the inode's
2998 * bytes when clearing the range in the inode's io tree, so pass false
2999 * as the argument 'update_inode_bytes' to insert_reserved_file_extent(),
3000 * except if the ordered extent was truncated.
3002 update_inode_bytes = test_bit(BTRFS_ORDERED_DIRECT, &oe->flags) ||
3003 test_bit(BTRFS_ORDERED_ENCODED, &oe->flags) ||
3004 test_bit(BTRFS_ORDERED_TRUNCATED, &oe->flags);
3006 return insert_reserved_file_extent(trans, BTRFS_I(oe->inode),
3007 oe->file_offset, &stack_fi,
3008 update_inode_bytes, oe->qgroup_rsv);
3012 * As ordered data IO finishes, this gets called so we can finish
3013 * an ordered extent if the range of bytes in the file it covers are
3016 int btrfs_finish_one_ordered(struct btrfs_ordered_extent *ordered_extent)
3018 struct btrfs_inode *inode = BTRFS_I(ordered_extent->inode);
3019 struct btrfs_root *root = inode->root;
3020 struct btrfs_fs_info *fs_info = root->fs_info;
3021 struct btrfs_trans_handle *trans = NULL;
3022 struct extent_io_tree *io_tree = &inode->io_tree;
3023 struct extent_state *cached_state = NULL;
3025 int compress_type = 0;
3027 u64 logical_len = ordered_extent->num_bytes;
3028 bool freespace_inode;
3029 bool truncated = false;
3030 bool clear_reserved_extent = true;
3031 unsigned int clear_bits = EXTENT_DEFRAG;
3033 start = ordered_extent->file_offset;
3034 end = start + ordered_extent->num_bytes - 1;
3036 if (!test_bit(BTRFS_ORDERED_NOCOW, &ordered_extent->flags) &&
3037 !test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags) &&
3038 !test_bit(BTRFS_ORDERED_DIRECT, &ordered_extent->flags) &&
3039 !test_bit(BTRFS_ORDERED_ENCODED, &ordered_extent->flags))
3040 clear_bits |= EXTENT_DELALLOC_NEW;
3042 freespace_inode = btrfs_is_free_space_inode(inode);
3043 if (!freespace_inode)
3044 btrfs_lockdep_acquire(fs_info, btrfs_ordered_extent);
3046 if (test_bit(BTRFS_ORDERED_IOERR, &ordered_extent->flags)) {
3051 if (btrfs_is_zoned(fs_info))
3052 btrfs_zone_finish_endio(fs_info, ordered_extent->disk_bytenr,
3053 ordered_extent->disk_num_bytes);
3055 if (test_bit(BTRFS_ORDERED_TRUNCATED, &ordered_extent->flags)) {
3057 logical_len = ordered_extent->truncated_len;
3058 /* Truncated the entire extent, don't bother adding */
3063 if (test_bit(BTRFS_ORDERED_NOCOW, &ordered_extent->flags)) {
3064 BUG_ON(!list_empty(&ordered_extent->list)); /* Logic error */
3066 btrfs_inode_safe_disk_i_size_write(inode, 0);
3067 if (freespace_inode)
3068 trans = btrfs_join_transaction_spacecache(root);
3070 trans = btrfs_join_transaction(root);
3071 if (IS_ERR(trans)) {
3072 ret = PTR_ERR(trans);
3076 trans->block_rsv = &inode->block_rsv;
3077 ret = btrfs_update_inode_fallback(trans, inode);
3078 if (ret) /* -ENOMEM or corruption */
3079 btrfs_abort_transaction(trans, ret);
3083 clear_bits |= EXTENT_LOCKED;
3084 lock_extent(io_tree, start, end, &cached_state);
3086 if (freespace_inode)
3087 trans = btrfs_join_transaction_spacecache(root);
3089 trans = btrfs_join_transaction(root);
3090 if (IS_ERR(trans)) {
3091 ret = PTR_ERR(trans);
3096 trans->block_rsv = &inode->block_rsv;
3098 ret = btrfs_insert_raid_extent(trans, ordered_extent);
3102 if (test_bit(BTRFS_ORDERED_COMPRESSED, &ordered_extent->flags))
3103 compress_type = ordered_extent->compress_type;
3104 if (test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags)) {
3105 BUG_ON(compress_type);
3106 ret = btrfs_mark_extent_written(trans, inode,
3107 ordered_extent->file_offset,
3108 ordered_extent->file_offset +
3110 btrfs_zoned_release_data_reloc_bg(fs_info, ordered_extent->disk_bytenr,
3111 ordered_extent->disk_num_bytes);
3113 BUG_ON(root == fs_info->tree_root);
3114 ret = insert_ordered_extent_file_extent(trans, ordered_extent);
3116 clear_reserved_extent = false;
3117 btrfs_release_delalloc_bytes(fs_info,
3118 ordered_extent->disk_bytenr,
3119 ordered_extent->disk_num_bytes);
3122 unpin_extent_cache(&inode->extent_tree, ordered_extent->file_offset,
3123 ordered_extent->num_bytes, trans->transid);
3125 btrfs_abort_transaction(trans, ret);
3129 ret = add_pending_csums(trans, &ordered_extent->list);
3131 btrfs_abort_transaction(trans, ret);
3136 * If this is a new delalloc range, clear its new delalloc flag to
3137 * update the inode's number of bytes. This needs to be done first
3138 * before updating the inode item.
3140 if ((clear_bits & EXTENT_DELALLOC_NEW) &&
3141 !test_bit(BTRFS_ORDERED_TRUNCATED, &ordered_extent->flags))
3142 clear_extent_bit(&inode->io_tree, start, end,
3143 EXTENT_DELALLOC_NEW | EXTENT_ADD_INODE_BYTES,
3146 btrfs_inode_safe_disk_i_size_write(inode, 0);
3147 ret = btrfs_update_inode_fallback(trans, inode);
3148 if (ret) { /* -ENOMEM or corruption */
3149 btrfs_abort_transaction(trans, ret);
3154 clear_extent_bit(&inode->io_tree, start, end, clear_bits,
3158 btrfs_end_transaction(trans);
3160 if (ret || truncated) {
3161 u64 unwritten_start = start;
3164 * If we failed to finish this ordered extent for any reason we
3165 * need to make sure BTRFS_ORDERED_IOERR is set on the ordered
3166 * extent, and mark the inode with the error if it wasn't
3167 * already set. Any error during writeback would have already
3168 * set the mapping error, so we need to set it if we're the ones
3169 * marking this ordered extent as failed.
3171 if (ret && !test_and_set_bit(BTRFS_ORDERED_IOERR,
3172 &ordered_extent->flags))
3173 mapping_set_error(ordered_extent->inode->i_mapping, -EIO);
3176 unwritten_start += logical_len;
3177 clear_extent_uptodate(io_tree, unwritten_start, end, NULL);
3179 /* Drop extent maps for the part of the extent we didn't write. */
3180 btrfs_drop_extent_map_range(inode, unwritten_start, end, false);
3183 * If the ordered extent had an IOERR or something else went
3184 * wrong we need to return the space for this ordered extent
3185 * back to the allocator. We only free the extent in the
3186 * truncated case if we didn't write out the extent at all.
3188 * If we made it past insert_reserved_file_extent before we
3189 * errored out then we don't need to do this as the accounting
3190 * has already been done.
3192 if ((ret || !logical_len) &&
3193 clear_reserved_extent &&
3194 !test_bit(BTRFS_ORDERED_NOCOW, &ordered_extent->flags) &&
3195 !test_bit(BTRFS_ORDERED_PREALLOC, &ordered_extent->flags)) {
3197 * Discard the range before returning it back to the
3200 if (ret && btrfs_test_opt(fs_info, DISCARD_SYNC))
3201 btrfs_discard_extent(fs_info,
3202 ordered_extent->disk_bytenr,
3203 ordered_extent->disk_num_bytes,
3205 btrfs_free_reserved_extent(fs_info,
3206 ordered_extent->disk_bytenr,
3207 ordered_extent->disk_num_bytes, 1);
3209 * Actually free the qgroup rsv which was released when
3210 * the ordered extent was created.
3212 btrfs_qgroup_free_refroot(fs_info, inode->root->root_key.objectid,
3213 ordered_extent->qgroup_rsv,
3214 BTRFS_QGROUP_RSV_DATA);
3219 * This needs to be done to make sure anybody waiting knows we are done
3220 * updating everything for this ordered extent.
3222 btrfs_remove_ordered_extent(inode, ordered_extent);
3225 btrfs_put_ordered_extent(ordered_extent);
3226 /* once for the tree */
3227 btrfs_put_ordered_extent(ordered_extent);
3232 int btrfs_finish_ordered_io(struct btrfs_ordered_extent *ordered)
3234 if (btrfs_is_zoned(btrfs_sb(ordered->inode->i_sb)) &&
3235 !test_bit(BTRFS_ORDERED_IOERR, &ordered->flags) &&
3236 list_empty(&ordered->bioc_list))
3237 btrfs_finish_ordered_zoned(ordered);
3238 return btrfs_finish_one_ordered(ordered);
3242 * Verify the checksum for a single sector without any extra action that depend
3243 * on the type of I/O.
3245 int btrfs_check_sector_csum(struct btrfs_fs_info *fs_info, struct page *page,
3246 u32 pgoff, u8 *csum, const u8 * const csum_expected)
3248 SHASH_DESC_ON_STACK(shash, fs_info->csum_shash);
3251 ASSERT(pgoff + fs_info->sectorsize <= PAGE_SIZE);
3253 shash->tfm = fs_info->csum_shash;
3255 kaddr = kmap_local_page(page) + pgoff;
3256 crypto_shash_digest(shash, kaddr, fs_info->sectorsize, csum);
3257 kunmap_local(kaddr);
3259 if (memcmp(csum, csum_expected, fs_info->csum_size))
3265 * Verify the checksum of a single data sector.
3267 * @bbio: btrfs_io_bio which contains the csum
3268 * @dev: device the sector is on
3269 * @bio_offset: offset to the beginning of the bio (in bytes)
3270 * @bv: bio_vec to check
3272 * Check if the checksum on a data block is valid. When a checksum mismatch is
3273 * detected, report the error and fill the corrupted range with zero.
3275 * Return %true if the sector is ok or had no checksum to start with, else %false.
3277 bool btrfs_data_csum_ok(struct btrfs_bio *bbio, struct btrfs_device *dev,
3278 u32 bio_offset, struct bio_vec *bv)
3280 struct btrfs_inode *inode = bbio->inode;
3281 struct btrfs_fs_info *fs_info = inode->root->fs_info;
3282 u64 file_offset = bbio->file_offset + bio_offset;
3283 u64 end = file_offset + bv->bv_len - 1;
3285 u8 csum[BTRFS_CSUM_SIZE];
3287 ASSERT(bv->bv_len == fs_info->sectorsize);
3292 if (btrfs_is_data_reloc_root(inode->root) &&
3293 test_range_bit(&inode->io_tree, file_offset, end, EXTENT_NODATASUM,
3295 /* Skip the range without csum for data reloc inode */
3296 clear_extent_bits(&inode->io_tree, file_offset, end,
3301 csum_expected = bbio->csum + (bio_offset >> fs_info->sectorsize_bits) *
3303 if (btrfs_check_sector_csum(fs_info, bv->bv_page, bv->bv_offset, csum,
3309 btrfs_print_data_csum_error(inode, file_offset, csum, csum_expected,
3312 btrfs_dev_stat_inc_and_print(dev, BTRFS_DEV_STAT_CORRUPTION_ERRS);
3318 * Perform a delayed iput on @inode.
3320 * @inode: The inode we want to perform iput on
3322 * This function uses the generic vfs_inode::i_count to track whether we should
3323 * just decrement it (in case it's > 1) or if this is the last iput then link
3324 * the inode to the delayed iput machinery. Delayed iputs are processed at
3325 * transaction commit time/superblock commit/cleaner kthread.
3327 void btrfs_add_delayed_iput(struct btrfs_inode *inode)
3329 struct btrfs_fs_info *fs_info = inode->root->fs_info;
3330 unsigned long flags;
3332 if (atomic_add_unless(&inode->vfs_inode.i_count, -1, 1))
3335 atomic_inc(&fs_info->nr_delayed_iputs);
3337 * Need to be irq safe here because we can be called from either an irq
3338 * context (see bio.c and btrfs_put_ordered_extent()) or a non-irq
3341 spin_lock_irqsave(&fs_info->delayed_iput_lock, flags);
3342 ASSERT(list_empty(&inode->delayed_iput));
3343 list_add_tail(&inode->delayed_iput, &fs_info->delayed_iputs);
3344 spin_unlock_irqrestore(&fs_info->delayed_iput_lock, flags);
3345 if (!test_bit(BTRFS_FS_CLEANER_RUNNING, &fs_info->flags))
3346 wake_up_process(fs_info->cleaner_kthread);
3349 static void run_delayed_iput_locked(struct btrfs_fs_info *fs_info,
3350 struct btrfs_inode *inode)
3352 list_del_init(&inode->delayed_iput);
3353 spin_unlock_irq(&fs_info->delayed_iput_lock);
3354 iput(&inode->vfs_inode);
3355 if (atomic_dec_and_test(&fs_info->nr_delayed_iputs))
3356 wake_up(&fs_info->delayed_iputs_wait);
3357 spin_lock_irq(&fs_info->delayed_iput_lock);
3360 static void btrfs_run_delayed_iput(struct btrfs_fs_info *fs_info,
3361 struct btrfs_inode *inode)
3363 if (!list_empty(&inode->delayed_iput)) {
3364 spin_lock_irq(&fs_info->delayed_iput_lock);
3365 if (!list_empty(&inode->delayed_iput))
3366 run_delayed_iput_locked(fs_info, inode);
3367 spin_unlock_irq(&fs_info->delayed_iput_lock);
3371 void btrfs_run_delayed_iputs(struct btrfs_fs_info *fs_info)
3374 * btrfs_put_ordered_extent() can run in irq context (see bio.c), which
3375 * calls btrfs_add_delayed_iput() and that needs to lock
3376 * fs_info->delayed_iput_lock. So we need to disable irqs here to
3377 * prevent a deadlock.
3379 spin_lock_irq(&fs_info->delayed_iput_lock);
3380 while (!list_empty(&fs_info->delayed_iputs)) {
3381 struct btrfs_inode *inode;
3383 inode = list_first_entry(&fs_info->delayed_iputs,
3384 struct btrfs_inode, delayed_iput);
3385 run_delayed_iput_locked(fs_info, inode);
3386 if (need_resched()) {
3387 spin_unlock_irq(&fs_info->delayed_iput_lock);
3389 spin_lock_irq(&fs_info->delayed_iput_lock);
3392 spin_unlock_irq(&fs_info->delayed_iput_lock);
3396 * Wait for flushing all delayed iputs
3398 * @fs_info: the filesystem
3400 * This will wait on any delayed iputs that are currently running with KILLABLE
3401 * set. Once they are all done running we will return, unless we are killed in
3402 * which case we return EINTR. This helps in user operations like fallocate etc
3403 * that might get blocked on the iputs.
3405 * Return EINTR if we were killed, 0 if nothing's pending
3407 int btrfs_wait_on_delayed_iputs(struct btrfs_fs_info *fs_info)
3409 int ret = wait_event_killable(fs_info->delayed_iputs_wait,
3410 atomic_read(&fs_info->nr_delayed_iputs) == 0);
3417 * This creates an orphan entry for the given inode in case something goes wrong
3418 * in the middle of an unlink.
3420 int btrfs_orphan_add(struct btrfs_trans_handle *trans,
3421 struct btrfs_inode *inode)
3425 ret = btrfs_insert_orphan_item(trans, inode->root, btrfs_ino(inode));
3426 if (ret && ret != -EEXIST) {
3427 btrfs_abort_transaction(trans, ret);
3435 * We have done the delete so we can go ahead and remove the orphan item for
3436 * this particular inode.
3438 static int btrfs_orphan_del(struct btrfs_trans_handle *trans,
3439 struct btrfs_inode *inode)
3441 return btrfs_del_orphan_item(trans, inode->root, btrfs_ino(inode));
3445 * this cleans up any orphans that may be left on the list from the last use
3448 int btrfs_orphan_cleanup(struct btrfs_root *root)
3450 struct btrfs_fs_info *fs_info = root->fs_info;
3451 struct btrfs_path *path;
3452 struct extent_buffer *leaf;
3453 struct btrfs_key key, found_key;
3454 struct btrfs_trans_handle *trans;
3455 struct inode *inode;
3456 u64 last_objectid = 0;
3457 int ret = 0, nr_unlink = 0;
3459 if (test_and_set_bit(BTRFS_ROOT_ORPHAN_CLEANUP, &root->state))
3462 path = btrfs_alloc_path();
3467 path->reada = READA_BACK;
3469 key.objectid = BTRFS_ORPHAN_OBJECTID;
3470 key.type = BTRFS_ORPHAN_ITEM_KEY;
3471 key.offset = (u64)-1;
3474 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
3479 * if ret == 0 means we found what we were searching for, which
3480 * is weird, but possible, so only screw with path if we didn't
3481 * find the key and see if we have stuff that matches
3485 if (path->slots[0] == 0)
3490 /* pull out the item */
3491 leaf = path->nodes[0];
3492 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
3494 /* make sure the item matches what we want */
3495 if (found_key.objectid != BTRFS_ORPHAN_OBJECTID)
3497 if (found_key.type != BTRFS_ORPHAN_ITEM_KEY)
3500 /* release the path since we're done with it */
3501 btrfs_release_path(path);
3504 * this is where we are basically btrfs_lookup, without the
3505 * crossing root thing. we store the inode number in the
3506 * offset of the orphan item.
3509 if (found_key.offset == last_objectid) {
3511 * We found the same inode as before. This means we were
3512 * not able to remove its items via eviction triggered
3513 * by an iput(). A transaction abort may have happened,
3514 * due to -ENOSPC for example, so try to grab the error
3515 * that lead to a transaction abort, if any.
3518 "Error removing orphan entry, stopping orphan cleanup");
3519 ret = BTRFS_FS_ERROR(fs_info) ?: -EINVAL;
3523 last_objectid = found_key.offset;
3525 found_key.objectid = found_key.offset;
3526 found_key.type = BTRFS_INODE_ITEM_KEY;
3527 found_key.offset = 0;
3528 inode = btrfs_iget(fs_info->sb, last_objectid, root);
3529 if (IS_ERR(inode)) {
3530 ret = PTR_ERR(inode);
3536 if (!inode && root == fs_info->tree_root) {
3537 struct btrfs_root *dead_root;
3538 int is_dead_root = 0;
3541 * This is an orphan in the tree root. Currently these
3542 * could come from 2 sources:
3543 * a) a root (snapshot/subvolume) deletion in progress
3544 * b) a free space cache inode
3545 * We need to distinguish those two, as the orphan item
3546 * for a root must not get deleted before the deletion
3547 * of the snapshot/subvolume's tree completes.
3549 * btrfs_find_orphan_roots() ran before us, which has
3550 * found all deleted roots and loaded them into
3551 * fs_info->fs_roots_radix. So here we can find if an
3552 * orphan item corresponds to a deleted root by looking
3553 * up the root from that radix tree.
3556 spin_lock(&fs_info->fs_roots_radix_lock);
3557 dead_root = radix_tree_lookup(&fs_info->fs_roots_radix,
3558 (unsigned long)found_key.objectid);
3559 if (dead_root && btrfs_root_refs(&dead_root->root_item) == 0)
3561 spin_unlock(&fs_info->fs_roots_radix_lock);
3564 /* prevent this orphan from being found again */
3565 key.offset = found_key.objectid - 1;
3572 * If we have an inode with links, there are a couple of
3575 * 1. We were halfway through creating fsverity metadata for the
3576 * file. In that case, the orphan item represents incomplete
3577 * fsverity metadata which must be cleaned up with
3578 * btrfs_drop_verity_items and deleting the orphan item.
3580 * 2. Old kernels (before v3.12) used to create an
3581 * orphan item for truncate indicating that there were possibly
3582 * extent items past i_size that needed to be deleted. In v3.12,
3583 * truncate was changed to update i_size in sync with the extent
3584 * items, but the (useless) orphan item was still created. Since
3585 * v4.18, we don't create the orphan item for truncate at all.
3587 * So, this item could mean that we need to do a truncate, but
3588 * only if this filesystem was last used on a pre-v3.12 kernel
3589 * and was not cleanly unmounted. The odds of that are quite
3590 * slim, and it's a pain to do the truncate now, so just delete
3593 * It's also possible that this orphan item was supposed to be
3594 * deleted but wasn't. The inode number may have been reused,
3595 * but either way, we can delete the orphan item.
3597 if (!inode || inode->i_nlink) {
3599 ret = btrfs_drop_verity_items(BTRFS_I(inode));
3605 trans = btrfs_start_transaction(root, 1);
3606 if (IS_ERR(trans)) {
3607 ret = PTR_ERR(trans);
3610 btrfs_debug(fs_info, "auto deleting %Lu",
3611 found_key.objectid);
3612 ret = btrfs_del_orphan_item(trans, root,
3613 found_key.objectid);
3614 btrfs_end_transaction(trans);
3622 /* this will do delete_inode and everything for us */
3625 /* release the path since we're done with it */
3626 btrfs_release_path(path);
3628 if (test_bit(BTRFS_ROOT_ORPHAN_ITEM_INSERTED, &root->state)) {
3629 trans = btrfs_join_transaction(root);
3631 btrfs_end_transaction(trans);
3635 btrfs_debug(fs_info, "unlinked %d orphans", nr_unlink);
3639 btrfs_err(fs_info, "could not do orphan cleanup %d", ret);
3640 btrfs_free_path(path);
3645 * very simple check to peek ahead in the leaf looking for xattrs. If we
3646 * don't find any xattrs, we know there can't be any acls.
3648 * slot is the slot the inode is in, objectid is the objectid of the inode
3650 static noinline int acls_after_inode_item(struct extent_buffer *leaf,
3651 int slot, u64 objectid,
3652 int *first_xattr_slot)
3654 u32 nritems = btrfs_header_nritems(leaf);
3655 struct btrfs_key found_key;
3656 static u64 xattr_access = 0;
3657 static u64 xattr_default = 0;
3660 if (!xattr_access) {
3661 xattr_access = btrfs_name_hash(XATTR_NAME_POSIX_ACL_ACCESS,
3662 strlen(XATTR_NAME_POSIX_ACL_ACCESS));
3663 xattr_default = btrfs_name_hash(XATTR_NAME_POSIX_ACL_DEFAULT,
3664 strlen(XATTR_NAME_POSIX_ACL_DEFAULT));
3668 *first_xattr_slot = -1;
3669 while (slot < nritems) {
3670 btrfs_item_key_to_cpu(leaf, &found_key, slot);
3672 /* we found a different objectid, there must not be acls */
3673 if (found_key.objectid != objectid)
3676 /* we found an xattr, assume we've got an acl */
3677 if (found_key.type == BTRFS_XATTR_ITEM_KEY) {
3678 if (*first_xattr_slot == -1)
3679 *first_xattr_slot = slot;
3680 if (found_key.offset == xattr_access ||
3681 found_key.offset == xattr_default)
3686 * we found a key greater than an xattr key, there can't
3687 * be any acls later on
3689 if (found_key.type > BTRFS_XATTR_ITEM_KEY)
3696 * it goes inode, inode backrefs, xattrs, extents,
3697 * so if there are a ton of hard links to an inode there can
3698 * be a lot of backrefs. Don't waste time searching too hard,
3699 * this is just an optimization
3704 /* we hit the end of the leaf before we found an xattr or
3705 * something larger than an xattr. We have to assume the inode
3708 if (*first_xattr_slot == -1)
3709 *first_xattr_slot = slot;
3714 * read an inode from the btree into the in-memory inode
3716 static int btrfs_read_locked_inode(struct inode *inode,
3717 struct btrfs_path *in_path)
3719 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
3720 struct btrfs_path *path = in_path;
3721 struct extent_buffer *leaf;
3722 struct btrfs_inode_item *inode_item;
3723 struct btrfs_root *root = BTRFS_I(inode)->root;
3724 struct btrfs_key location;
3729 bool filled = false;
3730 int first_xattr_slot;
3732 ret = btrfs_fill_inode(inode, &rdev);
3737 path = btrfs_alloc_path();
3742 memcpy(&location, &BTRFS_I(inode)->location, sizeof(location));
3744 ret = btrfs_lookup_inode(NULL, root, path, &location, 0);
3746 if (path != in_path)
3747 btrfs_free_path(path);
3751 leaf = path->nodes[0];
3756 inode_item = btrfs_item_ptr(leaf, path->slots[0],
3757 struct btrfs_inode_item);
3758 inode->i_mode = btrfs_inode_mode(leaf, inode_item);
3759 set_nlink(inode, btrfs_inode_nlink(leaf, inode_item));
3760 i_uid_write(inode, btrfs_inode_uid(leaf, inode_item));
3761 i_gid_write(inode, btrfs_inode_gid(leaf, inode_item));
3762 btrfs_i_size_write(BTRFS_I(inode), btrfs_inode_size(leaf, inode_item));
3763 btrfs_inode_set_file_extent_range(BTRFS_I(inode), 0,
3764 round_up(i_size_read(inode), fs_info->sectorsize));
3766 inode->i_atime.tv_sec = btrfs_timespec_sec(leaf, &inode_item->atime);
3767 inode->i_atime.tv_nsec = btrfs_timespec_nsec(leaf, &inode_item->atime);
3769 inode->i_mtime.tv_sec = btrfs_timespec_sec(leaf, &inode_item->mtime);
3770 inode->i_mtime.tv_nsec = btrfs_timespec_nsec(leaf, &inode_item->mtime);
3772 inode_set_ctime(inode, btrfs_timespec_sec(leaf, &inode_item->ctime),
3773 btrfs_timespec_nsec(leaf, &inode_item->ctime));
3775 BTRFS_I(inode)->i_otime.tv_sec =
3776 btrfs_timespec_sec(leaf, &inode_item->otime);
3777 BTRFS_I(inode)->i_otime.tv_nsec =
3778 btrfs_timespec_nsec(leaf, &inode_item->otime);
3780 inode_set_bytes(inode, btrfs_inode_nbytes(leaf, inode_item));
3781 BTRFS_I(inode)->generation = btrfs_inode_generation(leaf, inode_item);
3782 BTRFS_I(inode)->last_trans = btrfs_inode_transid(leaf, inode_item);
3784 inode_set_iversion_queried(inode,
3785 btrfs_inode_sequence(leaf, inode_item));
3786 inode->i_generation = BTRFS_I(inode)->generation;
3788 rdev = btrfs_inode_rdev(leaf, inode_item);
3790 BTRFS_I(inode)->index_cnt = (u64)-1;
3791 btrfs_inode_split_flags(btrfs_inode_flags(leaf, inode_item),
3792 &BTRFS_I(inode)->flags, &BTRFS_I(inode)->ro_flags);
3796 * If we were modified in the current generation and evicted from memory
3797 * and then re-read we need to do a full sync since we don't have any
3798 * idea about which extents were modified before we were evicted from
3801 * This is required for both inode re-read from disk and delayed inode
3802 * in delayed_nodes_tree.
3804 if (BTRFS_I(inode)->last_trans == fs_info->generation)
3805 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC,
3806 &BTRFS_I(inode)->runtime_flags);
3809 * We don't persist the id of the transaction where an unlink operation
3810 * against the inode was last made. So here we assume the inode might
3811 * have been evicted, and therefore the exact value of last_unlink_trans
3812 * lost, and set it to last_trans to avoid metadata inconsistencies
3813 * between the inode and its parent if the inode is fsync'ed and the log
3814 * replayed. For example, in the scenario:
3817 * ln mydir/foo mydir/bar
3820 * echo 2 > /proc/sys/vm/drop_caches # evicts inode
3821 * xfs_io -c fsync mydir/foo
3823 * mount fs, triggers fsync log replay
3825 * We must make sure that when we fsync our inode foo we also log its
3826 * parent inode, otherwise after log replay the parent still has the
3827 * dentry with the "bar" name but our inode foo has a link count of 1
3828 * and doesn't have an inode ref with the name "bar" anymore.
3830 * Setting last_unlink_trans to last_trans is a pessimistic approach,
3831 * but it guarantees correctness at the expense of occasional full
3832 * transaction commits on fsync if our inode is a directory, or if our
3833 * inode is not a directory, logging its parent unnecessarily.
3835 BTRFS_I(inode)->last_unlink_trans = BTRFS_I(inode)->last_trans;
3838 * Same logic as for last_unlink_trans. We don't persist the generation
3839 * of the last transaction where this inode was used for a reflink
3840 * operation, so after eviction and reloading the inode we must be
3841 * pessimistic and assume the last transaction that modified the inode.
3843 BTRFS_I(inode)->last_reflink_trans = BTRFS_I(inode)->last_trans;
3846 if (inode->i_nlink != 1 ||
3847 path->slots[0] >= btrfs_header_nritems(leaf))
3850 btrfs_item_key_to_cpu(leaf, &location, path->slots[0]);
3851 if (location.objectid != btrfs_ino(BTRFS_I(inode)))
3854 ptr = btrfs_item_ptr_offset(leaf, path->slots[0]);
3855 if (location.type == BTRFS_INODE_REF_KEY) {
3856 struct btrfs_inode_ref *ref;
3858 ref = (struct btrfs_inode_ref *)ptr;
3859 BTRFS_I(inode)->dir_index = btrfs_inode_ref_index(leaf, ref);
3860 } else if (location.type == BTRFS_INODE_EXTREF_KEY) {
3861 struct btrfs_inode_extref *extref;
3863 extref = (struct btrfs_inode_extref *)ptr;
3864 BTRFS_I(inode)->dir_index = btrfs_inode_extref_index(leaf,
3869 * try to precache a NULL acl entry for files that don't have
3870 * any xattrs or acls
3872 maybe_acls = acls_after_inode_item(leaf, path->slots[0],
3873 btrfs_ino(BTRFS_I(inode)), &first_xattr_slot);
3874 if (first_xattr_slot != -1) {
3875 path->slots[0] = first_xattr_slot;
3876 ret = btrfs_load_inode_props(inode, path);
3879 "error loading props for ino %llu (root %llu): %d",
3880 btrfs_ino(BTRFS_I(inode)),
3881 root->root_key.objectid, ret);
3883 if (path != in_path)
3884 btrfs_free_path(path);
3887 cache_no_acl(inode);
3889 switch (inode->i_mode & S_IFMT) {
3891 inode->i_mapping->a_ops = &btrfs_aops;
3892 inode->i_fop = &btrfs_file_operations;
3893 inode->i_op = &btrfs_file_inode_operations;
3896 inode->i_fop = &btrfs_dir_file_operations;
3897 inode->i_op = &btrfs_dir_inode_operations;
3900 inode->i_op = &btrfs_symlink_inode_operations;
3901 inode_nohighmem(inode);
3902 inode->i_mapping->a_ops = &btrfs_aops;
3905 inode->i_op = &btrfs_special_inode_operations;
3906 init_special_inode(inode, inode->i_mode, rdev);
3910 btrfs_sync_inode_flags_to_i_flags(inode);
3915 * given a leaf and an inode, copy the inode fields into the leaf
3917 static void fill_inode_item(struct btrfs_trans_handle *trans,
3918 struct extent_buffer *leaf,
3919 struct btrfs_inode_item *item,
3920 struct inode *inode)
3922 struct btrfs_map_token token;
3925 btrfs_init_map_token(&token, leaf);
3927 btrfs_set_token_inode_uid(&token, item, i_uid_read(inode));
3928 btrfs_set_token_inode_gid(&token, item, i_gid_read(inode));
3929 btrfs_set_token_inode_size(&token, item, BTRFS_I(inode)->disk_i_size);
3930 btrfs_set_token_inode_mode(&token, item, inode->i_mode);
3931 btrfs_set_token_inode_nlink(&token, item, inode->i_nlink);
3933 btrfs_set_token_timespec_sec(&token, &item->atime,
3934 inode->i_atime.tv_sec);
3935 btrfs_set_token_timespec_nsec(&token, &item->atime,
3936 inode->i_atime.tv_nsec);
3938 btrfs_set_token_timespec_sec(&token, &item->mtime,
3939 inode->i_mtime.tv_sec);
3940 btrfs_set_token_timespec_nsec(&token, &item->mtime,
3941 inode->i_mtime.tv_nsec);
3943 btrfs_set_token_timespec_sec(&token, &item->ctime,
3944 inode_get_ctime(inode).tv_sec);
3945 btrfs_set_token_timespec_nsec(&token, &item->ctime,
3946 inode_get_ctime(inode).tv_nsec);
3948 btrfs_set_token_timespec_sec(&token, &item->otime,
3949 BTRFS_I(inode)->i_otime.tv_sec);
3950 btrfs_set_token_timespec_nsec(&token, &item->otime,
3951 BTRFS_I(inode)->i_otime.tv_nsec);
3953 btrfs_set_token_inode_nbytes(&token, item, inode_get_bytes(inode));
3954 btrfs_set_token_inode_generation(&token, item,
3955 BTRFS_I(inode)->generation);
3956 btrfs_set_token_inode_sequence(&token, item, inode_peek_iversion(inode));
3957 btrfs_set_token_inode_transid(&token, item, trans->transid);
3958 btrfs_set_token_inode_rdev(&token, item, inode->i_rdev);
3959 flags = btrfs_inode_combine_flags(BTRFS_I(inode)->flags,
3960 BTRFS_I(inode)->ro_flags);
3961 btrfs_set_token_inode_flags(&token, item, flags);
3962 btrfs_set_token_inode_block_group(&token, item, 0);
3966 * copy everything in the in-memory inode into the btree.
3968 static noinline int btrfs_update_inode_item(struct btrfs_trans_handle *trans,
3969 struct btrfs_inode *inode)
3971 struct btrfs_inode_item *inode_item;
3972 struct btrfs_path *path;
3973 struct extent_buffer *leaf;
3976 path = btrfs_alloc_path();
3980 ret = btrfs_lookup_inode(trans, inode->root, path, &inode->location, 1);
3987 leaf = path->nodes[0];
3988 inode_item = btrfs_item_ptr(leaf, path->slots[0],
3989 struct btrfs_inode_item);
3991 fill_inode_item(trans, leaf, inode_item, &inode->vfs_inode);
3992 btrfs_mark_buffer_dirty(trans, leaf);
3993 btrfs_set_inode_last_trans(trans, inode);
3996 btrfs_free_path(path);
4001 * copy everything in the in-memory inode into the btree.
4003 int btrfs_update_inode(struct btrfs_trans_handle *trans,
4004 struct btrfs_inode *inode)
4006 struct btrfs_root *root = inode->root;
4007 struct btrfs_fs_info *fs_info = root->fs_info;
4011 * If the inode is a free space inode, we can deadlock during commit
4012 * if we put it into the delayed code.
4014 * The data relocation inode should also be directly updated
4017 if (!btrfs_is_free_space_inode(inode)
4018 && !btrfs_is_data_reloc_root(root)
4019 && !test_bit(BTRFS_FS_LOG_RECOVERING, &fs_info->flags)) {
4020 btrfs_update_root_times(trans, root);
4022 ret = btrfs_delayed_update_inode(trans, root, inode);
4024 btrfs_set_inode_last_trans(trans, inode);
4028 return btrfs_update_inode_item(trans, inode);
4031 int btrfs_update_inode_fallback(struct btrfs_trans_handle *trans,
4032 struct btrfs_inode *inode)
4036 ret = btrfs_update_inode(trans, inode);
4038 return btrfs_update_inode_item(trans, inode);
4043 * unlink helper that gets used here in inode.c and in the tree logging
4044 * recovery code. It remove a link in a directory with a given name, and
4045 * also drops the back refs in the inode to the directory
4047 static int __btrfs_unlink_inode(struct btrfs_trans_handle *trans,
4048 struct btrfs_inode *dir,
4049 struct btrfs_inode *inode,
4050 const struct fscrypt_str *name,
4051 struct btrfs_rename_ctx *rename_ctx)
4053 struct btrfs_root *root = dir->root;
4054 struct btrfs_fs_info *fs_info = root->fs_info;
4055 struct btrfs_path *path;
4057 struct btrfs_dir_item *di;
4059 u64 ino = btrfs_ino(inode);
4060 u64 dir_ino = btrfs_ino(dir);
4062 path = btrfs_alloc_path();
4068 di = btrfs_lookup_dir_item(trans, root, path, dir_ino, name, -1);
4069 if (IS_ERR_OR_NULL(di)) {
4070 ret = di ? PTR_ERR(di) : -ENOENT;
4073 ret = btrfs_delete_one_dir_name(trans, root, path, di);
4076 btrfs_release_path(path);
4079 * If we don't have dir index, we have to get it by looking up
4080 * the inode ref, since we get the inode ref, remove it directly,
4081 * it is unnecessary to do delayed deletion.
4083 * But if we have dir index, needn't search inode ref to get it.
4084 * Since the inode ref is close to the inode item, it is better
4085 * that we delay to delete it, and just do this deletion when
4086 * we update the inode item.
4088 if (inode->dir_index) {
4089 ret = btrfs_delayed_delete_inode_ref(inode);
4091 index = inode->dir_index;
4096 ret = btrfs_del_inode_ref(trans, root, name, ino, dir_ino, &index);
4099 "failed to delete reference to %.*s, inode %llu parent %llu",
4100 name->len, name->name, ino, dir_ino);
4101 btrfs_abort_transaction(trans, ret);
4106 rename_ctx->index = index;
4108 ret = btrfs_delete_delayed_dir_index(trans, dir, index);
4110 btrfs_abort_transaction(trans, ret);
4115 * If we are in a rename context, we don't need to update anything in the
4116 * log. That will be done later during the rename by btrfs_log_new_name().
4117 * Besides that, doing it here would only cause extra unnecessary btree
4118 * operations on the log tree, increasing latency for applications.
4121 btrfs_del_inode_ref_in_log(trans, root, name, inode, dir_ino);
4122 btrfs_del_dir_entries_in_log(trans, root, name, dir, index);
4126 * If we have a pending delayed iput we could end up with the final iput
4127 * being run in btrfs-cleaner context. If we have enough of these built
4128 * up we can end up burning a lot of time in btrfs-cleaner without any
4129 * way to throttle the unlinks. Since we're currently holding a ref on
4130 * the inode we can run the delayed iput here without any issues as the
4131 * final iput won't be done until after we drop the ref we're currently
4134 btrfs_run_delayed_iput(fs_info, inode);
4136 btrfs_free_path(path);
4140 btrfs_i_size_write(dir, dir->vfs_inode.i_size - name->len * 2);
4141 inode_inc_iversion(&inode->vfs_inode);
4142 inode_inc_iversion(&dir->vfs_inode);
4143 inode_set_ctime_current(&inode->vfs_inode);
4144 dir->vfs_inode.i_mtime = inode_set_ctime_current(&dir->vfs_inode);
4145 ret = btrfs_update_inode(trans, dir);
4150 int btrfs_unlink_inode(struct btrfs_trans_handle *trans,
4151 struct btrfs_inode *dir, struct btrfs_inode *inode,
4152 const struct fscrypt_str *name)
4156 ret = __btrfs_unlink_inode(trans, dir, inode, name, NULL);
4158 drop_nlink(&inode->vfs_inode);
4159 ret = btrfs_update_inode(trans, inode);
4165 * helper to start transaction for unlink and rmdir.
4167 * unlink and rmdir are special in btrfs, they do not always free space, so
4168 * if we cannot make our reservations the normal way try and see if there is
4169 * plenty of slack room in the global reserve to migrate, otherwise we cannot
4170 * allow the unlink to occur.
4172 static struct btrfs_trans_handle *__unlink_start_trans(struct btrfs_inode *dir)
4174 struct btrfs_root *root = dir->root;
4176 return btrfs_start_transaction_fallback_global_rsv(root,
4177 BTRFS_UNLINK_METADATA_UNITS);
4180 static int btrfs_unlink(struct inode *dir, struct dentry *dentry)
4182 struct btrfs_trans_handle *trans;
4183 struct inode *inode = d_inode(dentry);
4185 struct fscrypt_name fname;
4187 ret = fscrypt_setup_filename(dir, &dentry->d_name, 1, &fname);
4191 /* This needs to handle no-key deletions later on */
4193 trans = __unlink_start_trans(BTRFS_I(dir));
4194 if (IS_ERR(trans)) {
4195 ret = PTR_ERR(trans);
4199 btrfs_record_unlink_dir(trans, BTRFS_I(dir), BTRFS_I(d_inode(dentry)),
4202 ret = btrfs_unlink_inode(trans, BTRFS_I(dir), BTRFS_I(d_inode(dentry)),
4207 if (inode->i_nlink == 0) {
4208 ret = btrfs_orphan_add(trans, BTRFS_I(inode));
4214 btrfs_end_transaction(trans);
4215 btrfs_btree_balance_dirty(BTRFS_I(dir)->root->fs_info);
4217 fscrypt_free_filename(&fname);
4221 static int btrfs_unlink_subvol(struct btrfs_trans_handle *trans,
4222 struct btrfs_inode *dir, struct dentry *dentry)
4224 struct btrfs_root *root = dir->root;
4225 struct btrfs_inode *inode = BTRFS_I(d_inode(dentry));
4226 struct btrfs_path *path;
4227 struct extent_buffer *leaf;
4228 struct btrfs_dir_item *di;
4229 struct btrfs_key key;
4233 u64 dir_ino = btrfs_ino(dir);
4234 struct fscrypt_name fname;
4236 ret = fscrypt_setup_filename(&dir->vfs_inode, &dentry->d_name, 1, &fname);
4240 /* This needs to handle no-key deletions later on */
4242 if (btrfs_ino(inode) == BTRFS_FIRST_FREE_OBJECTID) {
4243 objectid = inode->root->root_key.objectid;
4244 } else if (btrfs_ino(inode) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID) {
4245 objectid = inode->location.objectid;
4248 fscrypt_free_filename(&fname);
4252 path = btrfs_alloc_path();
4258 di = btrfs_lookup_dir_item(trans, root, path, dir_ino,
4259 &fname.disk_name, -1);
4260 if (IS_ERR_OR_NULL(di)) {
4261 ret = di ? PTR_ERR(di) : -ENOENT;
4265 leaf = path->nodes[0];
4266 btrfs_dir_item_key_to_cpu(leaf, di, &key);
4267 WARN_ON(key.type != BTRFS_ROOT_ITEM_KEY || key.objectid != objectid);
4268 ret = btrfs_delete_one_dir_name(trans, root, path, di);
4270 btrfs_abort_transaction(trans, ret);
4273 btrfs_release_path(path);
4276 * This is a placeholder inode for a subvolume we didn't have a
4277 * reference to at the time of the snapshot creation. In the meantime
4278 * we could have renamed the real subvol link into our snapshot, so
4279 * depending on btrfs_del_root_ref to return -ENOENT here is incorrect.
4280 * Instead simply lookup the dir_index_item for this entry so we can
4281 * remove it. Otherwise we know we have a ref to the root and we can
4282 * call btrfs_del_root_ref, and it _shouldn't_ fail.
4284 if (btrfs_ino(inode) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID) {
4285 di = btrfs_search_dir_index_item(root, path, dir_ino, &fname.disk_name);
4286 if (IS_ERR_OR_NULL(di)) {
4291 btrfs_abort_transaction(trans, ret);
4295 leaf = path->nodes[0];
4296 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
4298 btrfs_release_path(path);
4300 ret = btrfs_del_root_ref(trans, objectid,
4301 root->root_key.objectid, dir_ino,
4302 &index, &fname.disk_name);
4304 btrfs_abort_transaction(trans, ret);
4309 ret = btrfs_delete_delayed_dir_index(trans, dir, index);
4311 btrfs_abort_transaction(trans, ret);
4315 btrfs_i_size_write(dir, dir->vfs_inode.i_size - fname.disk_name.len * 2);
4316 inode_inc_iversion(&dir->vfs_inode);
4317 dir->vfs_inode.i_mtime = inode_set_ctime_current(&dir->vfs_inode);
4318 ret = btrfs_update_inode_fallback(trans, dir);
4320 btrfs_abort_transaction(trans, ret);
4322 btrfs_free_path(path);
4323 fscrypt_free_filename(&fname);
4328 * Helper to check if the subvolume references other subvolumes or if it's
4331 static noinline int may_destroy_subvol(struct btrfs_root *root)
4333 struct btrfs_fs_info *fs_info = root->fs_info;
4334 struct btrfs_path *path;
4335 struct btrfs_dir_item *di;
4336 struct btrfs_key key;
4337 struct fscrypt_str name = FSTR_INIT("default", 7);
4341 path = btrfs_alloc_path();
4345 /* Make sure this root isn't set as the default subvol */
4346 dir_id = btrfs_super_root_dir(fs_info->super_copy);
4347 di = btrfs_lookup_dir_item(NULL, fs_info->tree_root, path,
4349 if (di && !IS_ERR(di)) {
4350 btrfs_dir_item_key_to_cpu(path->nodes[0], di, &key);
4351 if (key.objectid == root->root_key.objectid) {
4354 "deleting default subvolume %llu is not allowed",
4358 btrfs_release_path(path);
4361 key.objectid = root->root_key.objectid;
4362 key.type = BTRFS_ROOT_REF_KEY;
4363 key.offset = (u64)-1;
4365 ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, path, 0, 0);
4371 if (path->slots[0] > 0) {
4373 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
4374 if (key.objectid == root->root_key.objectid &&
4375 key.type == BTRFS_ROOT_REF_KEY)
4379 btrfs_free_path(path);
4383 /* Delete all dentries for inodes belonging to the root */
4384 static void btrfs_prune_dentries(struct btrfs_root *root)
4386 struct btrfs_fs_info *fs_info = root->fs_info;
4387 struct rb_node *node;
4388 struct rb_node *prev;
4389 struct btrfs_inode *entry;
4390 struct inode *inode;
4393 if (!BTRFS_FS_ERROR(fs_info))
4394 WARN_ON(btrfs_root_refs(&root->root_item) != 0);
4396 spin_lock(&root->inode_lock);
4398 node = root->inode_tree.rb_node;
4402 entry = rb_entry(node, struct btrfs_inode, rb_node);
4404 if (objectid < btrfs_ino(entry))
4405 node = node->rb_left;
4406 else if (objectid > btrfs_ino(entry))
4407 node = node->rb_right;
4413 entry = rb_entry(prev, struct btrfs_inode, rb_node);
4414 if (objectid <= btrfs_ino(entry)) {
4418 prev = rb_next(prev);
4422 entry = rb_entry(node, struct btrfs_inode, rb_node);
4423 objectid = btrfs_ino(entry) + 1;
4424 inode = igrab(&entry->vfs_inode);
4426 spin_unlock(&root->inode_lock);
4427 if (atomic_read(&inode->i_count) > 1)
4428 d_prune_aliases(inode);
4430 * btrfs_drop_inode will have it removed from the inode
4431 * cache when its usage count hits zero.
4435 spin_lock(&root->inode_lock);
4439 if (cond_resched_lock(&root->inode_lock))
4442 node = rb_next(node);
4444 spin_unlock(&root->inode_lock);
4447 int btrfs_delete_subvolume(struct btrfs_inode *dir, struct dentry *dentry)
4449 struct btrfs_fs_info *fs_info = btrfs_sb(dentry->d_sb);
4450 struct btrfs_root *root = dir->root;
4451 struct inode *inode = d_inode(dentry);
4452 struct btrfs_root *dest = BTRFS_I(inode)->root;
4453 struct btrfs_trans_handle *trans;
4454 struct btrfs_block_rsv block_rsv;
4459 * Don't allow to delete a subvolume with send in progress. This is
4460 * inside the inode lock so the error handling that has to drop the bit
4461 * again is not run concurrently.
4463 spin_lock(&dest->root_item_lock);
4464 if (dest->send_in_progress) {
4465 spin_unlock(&dest->root_item_lock);
4467 "attempt to delete subvolume %llu during send",
4468 dest->root_key.objectid);
4471 if (atomic_read(&dest->nr_swapfiles)) {
4472 spin_unlock(&dest->root_item_lock);
4474 "attempt to delete subvolume %llu with active swapfile",
4475 root->root_key.objectid);
4478 root_flags = btrfs_root_flags(&dest->root_item);
4479 btrfs_set_root_flags(&dest->root_item,
4480 root_flags | BTRFS_ROOT_SUBVOL_DEAD);
4481 spin_unlock(&dest->root_item_lock);
4483 down_write(&fs_info->subvol_sem);
4485 ret = may_destroy_subvol(dest);
4489 btrfs_init_block_rsv(&block_rsv, BTRFS_BLOCK_RSV_TEMP);
4491 * One for dir inode,
4492 * two for dir entries,
4493 * two for root ref/backref.
4495 ret = btrfs_subvolume_reserve_metadata(root, &block_rsv, 5, true);
4499 trans = btrfs_start_transaction(root, 0);
4500 if (IS_ERR(trans)) {
4501 ret = PTR_ERR(trans);
4504 trans->block_rsv = &block_rsv;
4505 trans->bytes_reserved = block_rsv.size;
4507 btrfs_record_snapshot_destroy(trans, dir);
4509 ret = btrfs_unlink_subvol(trans, dir, dentry);
4511 btrfs_abort_transaction(trans, ret);
4515 ret = btrfs_record_root_in_trans(trans, dest);
4517 btrfs_abort_transaction(trans, ret);
4521 memset(&dest->root_item.drop_progress, 0,
4522 sizeof(dest->root_item.drop_progress));
4523 btrfs_set_root_drop_level(&dest->root_item, 0);
4524 btrfs_set_root_refs(&dest->root_item, 0);
4526 if (!test_and_set_bit(BTRFS_ROOT_ORPHAN_ITEM_INSERTED, &dest->state)) {
4527 ret = btrfs_insert_orphan_item(trans,
4529 dest->root_key.objectid);
4531 btrfs_abort_transaction(trans, ret);
4536 ret = btrfs_uuid_tree_remove(trans, dest->root_item.uuid,
4537 BTRFS_UUID_KEY_SUBVOL,
4538 dest->root_key.objectid);
4539 if (ret && ret != -ENOENT) {
4540 btrfs_abort_transaction(trans, ret);
4543 if (!btrfs_is_empty_uuid(dest->root_item.received_uuid)) {
4544 ret = btrfs_uuid_tree_remove(trans,
4545 dest->root_item.received_uuid,
4546 BTRFS_UUID_KEY_RECEIVED_SUBVOL,
4547 dest->root_key.objectid);
4548 if (ret && ret != -ENOENT) {
4549 btrfs_abort_transaction(trans, ret);
4554 free_anon_bdev(dest->anon_dev);
4557 trans->block_rsv = NULL;
4558 trans->bytes_reserved = 0;
4559 ret = btrfs_end_transaction(trans);
4560 inode->i_flags |= S_DEAD;
4562 btrfs_subvolume_release_metadata(root, &block_rsv);
4564 up_write(&fs_info->subvol_sem);
4566 spin_lock(&dest->root_item_lock);
4567 root_flags = btrfs_root_flags(&dest->root_item);
4568 btrfs_set_root_flags(&dest->root_item,
4569 root_flags & ~BTRFS_ROOT_SUBVOL_DEAD);
4570 spin_unlock(&dest->root_item_lock);
4572 d_invalidate(dentry);
4573 btrfs_prune_dentries(dest);
4574 ASSERT(dest->send_in_progress == 0);
4580 static int btrfs_rmdir(struct inode *dir, struct dentry *dentry)
4582 struct inode *inode = d_inode(dentry);
4583 struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info;
4585 struct btrfs_trans_handle *trans;
4586 u64 last_unlink_trans;
4587 struct fscrypt_name fname;
4589 if (inode->i_size > BTRFS_EMPTY_DIR_SIZE)
4591 if (btrfs_ino(BTRFS_I(inode)) == BTRFS_FIRST_FREE_OBJECTID) {
4592 if (unlikely(btrfs_fs_incompat(fs_info, EXTENT_TREE_V2))) {
4594 "extent tree v2 doesn't support snapshot deletion yet");
4597 return btrfs_delete_subvolume(BTRFS_I(dir), dentry);
4600 err = fscrypt_setup_filename(dir, &dentry->d_name, 1, &fname);
4604 /* This needs to handle no-key deletions later on */
4606 trans = __unlink_start_trans(BTRFS_I(dir));
4607 if (IS_ERR(trans)) {
4608 err = PTR_ERR(trans);
4612 if (unlikely(btrfs_ino(BTRFS_I(inode)) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)) {
4613 err = btrfs_unlink_subvol(trans, BTRFS_I(dir), dentry);
4617 err = btrfs_orphan_add(trans, BTRFS_I(inode));
4621 last_unlink_trans = BTRFS_I(inode)->last_unlink_trans;
4623 /* now the directory is empty */
4624 err = btrfs_unlink_inode(trans, BTRFS_I(dir), BTRFS_I(d_inode(dentry)),
4627 btrfs_i_size_write(BTRFS_I(inode), 0);
4629 * Propagate the last_unlink_trans value of the deleted dir to
4630 * its parent directory. This is to prevent an unrecoverable
4631 * log tree in the case we do something like this:
4633 * 2) create snapshot under dir foo
4634 * 3) delete the snapshot
4637 * 6) fsync foo or some file inside foo
4639 if (last_unlink_trans >= trans->transid)
4640 BTRFS_I(dir)->last_unlink_trans = last_unlink_trans;
4643 btrfs_end_transaction(trans);
4645 btrfs_btree_balance_dirty(fs_info);
4646 fscrypt_free_filename(&fname);
4652 * Read, zero a chunk and write a block.
4654 * @inode - inode that we're zeroing
4655 * @from - the offset to start zeroing
4656 * @len - the length to zero, 0 to zero the entire range respective to the
4658 * @front - zero up to the offset instead of from the offset on
4660 * This will find the block for the "from" offset and cow the block and zero the
4661 * part we want to zero. This is used with truncate and hole punching.
4663 int btrfs_truncate_block(struct btrfs_inode *inode, loff_t from, loff_t len,
4666 struct btrfs_fs_info *fs_info = inode->root->fs_info;
4667 struct address_space *mapping = inode->vfs_inode.i_mapping;
4668 struct extent_io_tree *io_tree = &inode->io_tree;
4669 struct btrfs_ordered_extent *ordered;
4670 struct extent_state *cached_state = NULL;
4671 struct extent_changeset *data_reserved = NULL;
4672 bool only_release_metadata = false;
4673 u32 blocksize = fs_info->sectorsize;
4674 pgoff_t index = from >> PAGE_SHIFT;
4675 unsigned offset = from & (blocksize - 1);
4677 gfp_t mask = btrfs_alloc_write_mask(mapping);
4678 size_t write_bytes = blocksize;
4683 if (IS_ALIGNED(offset, blocksize) &&
4684 (!len || IS_ALIGNED(len, blocksize)))
4687 block_start = round_down(from, blocksize);
4688 block_end = block_start + blocksize - 1;
4690 ret = btrfs_check_data_free_space(inode, &data_reserved, block_start,
4693 if (btrfs_check_nocow_lock(inode, block_start, &write_bytes, false) > 0) {
4694 /* For nocow case, no need to reserve data space */
4695 only_release_metadata = true;
4700 ret = btrfs_delalloc_reserve_metadata(inode, blocksize, blocksize, false);
4702 if (!only_release_metadata)
4703 btrfs_free_reserved_data_space(inode, data_reserved,
4704 block_start, blocksize);
4708 page = find_or_create_page(mapping, index, mask);
4710 btrfs_delalloc_release_space(inode, data_reserved, block_start,
4712 btrfs_delalloc_release_extents(inode, blocksize);
4717 if (!PageUptodate(page)) {
4718 ret = btrfs_read_folio(NULL, page_folio(page));
4720 if (page->mapping != mapping) {
4725 if (!PageUptodate(page)) {
4732 * We unlock the page after the io is completed and then re-lock it
4733 * above. release_folio() could have come in between that and cleared
4734 * PagePrivate(), but left the page in the mapping. Set the page mapped
4735 * here to make sure it's properly set for the subpage stuff.
4737 ret = set_page_extent_mapped(page);
4741 wait_on_page_writeback(page);
4743 lock_extent(io_tree, block_start, block_end, &cached_state);
4745 ordered = btrfs_lookup_ordered_extent(inode, block_start);
4747 unlock_extent(io_tree, block_start, block_end, &cached_state);
4750 btrfs_start_ordered_extent(ordered);
4751 btrfs_put_ordered_extent(ordered);
4755 clear_extent_bit(&inode->io_tree, block_start, block_end,
4756 EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING | EXTENT_DEFRAG,
4759 ret = btrfs_set_extent_delalloc(inode, block_start, block_end, 0,
4762 unlock_extent(io_tree, block_start, block_end, &cached_state);
4766 if (offset != blocksize) {
4768 len = blocksize - offset;
4770 memzero_page(page, (block_start - page_offset(page)),
4773 memzero_page(page, (block_start - page_offset(page)) + offset,
4776 btrfs_page_clear_checked(fs_info, page, block_start,
4777 block_end + 1 - block_start);
4778 btrfs_page_set_dirty(fs_info, page, block_start, block_end + 1 - block_start);
4779 unlock_extent(io_tree, block_start, block_end, &cached_state);
4781 if (only_release_metadata)
4782 set_extent_bit(&inode->io_tree, block_start, block_end,
4783 EXTENT_NORESERVE, NULL);
4787 if (only_release_metadata)
4788 btrfs_delalloc_release_metadata(inode, blocksize, true);
4790 btrfs_delalloc_release_space(inode, data_reserved,
4791 block_start, blocksize, true);
4793 btrfs_delalloc_release_extents(inode, blocksize);
4797 if (only_release_metadata)
4798 btrfs_check_nocow_unlock(inode);
4799 extent_changeset_free(data_reserved);
4803 static int maybe_insert_hole(struct btrfs_root *root, struct btrfs_inode *inode,
4804 u64 offset, u64 len)
4806 struct btrfs_fs_info *fs_info = root->fs_info;
4807 struct btrfs_trans_handle *trans;
4808 struct btrfs_drop_extents_args drop_args = { 0 };
4812 * If NO_HOLES is enabled, we don't need to do anything.
4813 * Later, up in the call chain, either btrfs_set_inode_last_sub_trans()
4814 * or btrfs_update_inode() will be called, which guarantee that the next
4815 * fsync will know this inode was changed and needs to be logged.
4817 if (btrfs_fs_incompat(fs_info, NO_HOLES))
4821 * 1 - for the one we're dropping
4822 * 1 - for the one we're adding
4823 * 1 - for updating the inode.
4825 trans = btrfs_start_transaction(root, 3);
4827 return PTR_ERR(trans);
4829 drop_args.start = offset;
4830 drop_args.end = offset + len;
4831 drop_args.drop_cache = true;
4833 ret = btrfs_drop_extents(trans, root, inode, &drop_args);
4835 btrfs_abort_transaction(trans, ret);
4836 btrfs_end_transaction(trans);
4840 ret = btrfs_insert_hole_extent(trans, root, btrfs_ino(inode), offset, len);
4842 btrfs_abort_transaction(trans, ret);
4844 btrfs_update_inode_bytes(inode, 0, drop_args.bytes_found);
4845 btrfs_update_inode(trans, inode);
4847 btrfs_end_transaction(trans);
4852 * This function puts in dummy file extents for the area we're creating a hole
4853 * for. So if we are truncating this file to a larger size we need to insert
4854 * these file extents so that btrfs_get_extent will return a EXTENT_MAP_HOLE for
4855 * the range between oldsize and size
4857 int btrfs_cont_expand(struct btrfs_inode *inode, loff_t oldsize, loff_t size)
4859 struct btrfs_root *root = inode->root;
4860 struct btrfs_fs_info *fs_info = root->fs_info;
4861 struct extent_io_tree *io_tree = &inode->io_tree;
4862 struct extent_map *em = NULL;
4863 struct extent_state *cached_state = NULL;
4864 u64 hole_start = ALIGN(oldsize, fs_info->sectorsize);
4865 u64 block_end = ALIGN(size, fs_info->sectorsize);
4872 * If our size started in the middle of a block we need to zero out the
4873 * rest of the block before we expand the i_size, otherwise we could
4874 * expose stale data.
4876 err = btrfs_truncate_block(inode, oldsize, 0, 0);
4880 if (size <= hole_start)
4883 btrfs_lock_and_flush_ordered_range(inode, hole_start, block_end - 1,
4885 cur_offset = hole_start;
4887 em = btrfs_get_extent(inode, NULL, 0, cur_offset,
4888 block_end - cur_offset);
4894 last_byte = min(extent_map_end(em), block_end);
4895 last_byte = ALIGN(last_byte, fs_info->sectorsize);
4896 hole_size = last_byte - cur_offset;
4898 if (!test_bit(EXTENT_FLAG_PREALLOC, &em->flags)) {
4899 struct extent_map *hole_em;
4901 err = maybe_insert_hole(root, inode, cur_offset,
4906 err = btrfs_inode_set_file_extent_range(inode,
4907 cur_offset, hole_size);
4911 hole_em = alloc_extent_map();
4913 btrfs_drop_extent_map_range(inode, cur_offset,
4914 cur_offset + hole_size - 1,
4916 btrfs_set_inode_full_sync(inode);
4919 hole_em->start = cur_offset;
4920 hole_em->len = hole_size;
4921 hole_em->orig_start = cur_offset;
4923 hole_em->block_start = EXTENT_MAP_HOLE;
4924 hole_em->block_len = 0;
4925 hole_em->orig_block_len = 0;
4926 hole_em->ram_bytes = hole_size;
4927 hole_em->compress_type = BTRFS_COMPRESS_NONE;
4928 hole_em->generation = fs_info->generation;
4930 err = btrfs_replace_extent_map_range(inode, hole_em, true);
4931 free_extent_map(hole_em);
4933 err = btrfs_inode_set_file_extent_range(inode,
4934 cur_offset, hole_size);
4939 free_extent_map(em);
4941 cur_offset = last_byte;
4942 if (cur_offset >= block_end)
4945 free_extent_map(em);
4946 unlock_extent(io_tree, hole_start, block_end - 1, &cached_state);
4950 static int btrfs_setsize(struct inode *inode, struct iattr *attr)
4952 struct btrfs_root *root = BTRFS_I(inode)->root;
4953 struct btrfs_trans_handle *trans;
4954 loff_t oldsize = i_size_read(inode);
4955 loff_t newsize = attr->ia_size;
4956 int mask = attr->ia_valid;
4960 * The regular truncate() case without ATTR_CTIME and ATTR_MTIME is a
4961 * special case where we need to update the times despite not having
4962 * these flags set. For all other operations the VFS set these flags
4963 * explicitly if it wants a timestamp update.
4965 if (newsize != oldsize) {
4966 inode_inc_iversion(inode);
4967 if (!(mask & (ATTR_CTIME | ATTR_MTIME))) {
4968 inode->i_mtime = inode_set_ctime_current(inode);
4972 if (newsize > oldsize) {
4974 * Don't do an expanding truncate while snapshotting is ongoing.
4975 * This is to ensure the snapshot captures a fully consistent
4976 * state of this file - if the snapshot captures this expanding
4977 * truncation, it must capture all writes that happened before
4980 btrfs_drew_write_lock(&root->snapshot_lock);
4981 ret = btrfs_cont_expand(BTRFS_I(inode), oldsize, newsize);
4983 btrfs_drew_write_unlock(&root->snapshot_lock);
4987 trans = btrfs_start_transaction(root, 1);
4988 if (IS_ERR(trans)) {
4989 btrfs_drew_write_unlock(&root->snapshot_lock);
4990 return PTR_ERR(trans);
4993 i_size_write(inode, newsize);
4994 btrfs_inode_safe_disk_i_size_write(BTRFS_I(inode), 0);
4995 pagecache_isize_extended(inode, oldsize, newsize);
4996 ret = btrfs_update_inode(trans, BTRFS_I(inode));
4997 btrfs_drew_write_unlock(&root->snapshot_lock);
4998 btrfs_end_transaction(trans);
5000 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
5002 if (btrfs_is_zoned(fs_info)) {
5003 ret = btrfs_wait_ordered_range(inode,
5004 ALIGN(newsize, fs_info->sectorsize),
5011 * We're truncating a file that used to have good data down to
5012 * zero. Make sure any new writes to the file get on disk
5016 set_bit(BTRFS_INODE_FLUSH_ON_CLOSE,
5017 &BTRFS_I(inode)->runtime_flags);
5019 truncate_setsize(inode, newsize);
5021 inode_dio_wait(inode);
5023 ret = btrfs_truncate(BTRFS_I(inode), newsize == oldsize);
5024 if (ret && inode->i_nlink) {
5028 * Truncate failed, so fix up the in-memory size. We
5029 * adjusted disk_i_size down as we removed extents, so
5030 * wait for disk_i_size to be stable and then update the
5031 * in-memory size to match.
5033 err = btrfs_wait_ordered_range(inode, 0, (u64)-1);
5036 i_size_write(inode, BTRFS_I(inode)->disk_i_size);
5043 static int btrfs_setattr(struct mnt_idmap *idmap, struct dentry *dentry,
5046 struct inode *inode = d_inode(dentry);
5047 struct btrfs_root *root = BTRFS_I(inode)->root;
5050 if (btrfs_root_readonly(root))
5053 err = setattr_prepare(idmap, dentry, attr);
5057 if (S_ISREG(inode->i_mode) && (attr->ia_valid & ATTR_SIZE)) {
5058 err = btrfs_setsize(inode, attr);
5063 if (attr->ia_valid) {
5064 setattr_copy(idmap, inode, attr);
5065 inode_inc_iversion(inode);
5066 err = btrfs_dirty_inode(BTRFS_I(inode));
5068 if (!err && attr->ia_valid & ATTR_MODE)
5069 err = posix_acl_chmod(idmap, dentry, inode->i_mode);
5076 * While truncating the inode pages during eviction, we get the VFS
5077 * calling btrfs_invalidate_folio() against each folio of the inode. This
5078 * is slow because the calls to btrfs_invalidate_folio() result in a
5079 * huge amount of calls to lock_extent() and clear_extent_bit(),
5080 * which keep merging and splitting extent_state structures over and over,
5081 * wasting lots of time.
5083 * Therefore if the inode is being evicted, let btrfs_invalidate_folio()
5084 * skip all those expensive operations on a per folio basis and do only
5085 * the ordered io finishing, while we release here the extent_map and
5086 * extent_state structures, without the excessive merging and splitting.
5088 static void evict_inode_truncate_pages(struct inode *inode)
5090 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
5091 struct rb_node *node;
5093 ASSERT(inode->i_state & I_FREEING);
5094 truncate_inode_pages_final(&inode->i_data);
5096 btrfs_drop_extent_map_range(BTRFS_I(inode), 0, (u64)-1, false);
5099 * Keep looping until we have no more ranges in the io tree.
5100 * We can have ongoing bios started by readahead that have
5101 * their endio callback (extent_io.c:end_bio_extent_readpage)
5102 * still in progress (unlocked the pages in the bio but did not yet
5103 * unlocked the ranges in the io tree). Therefore this means some
5104 * ranges can still be locked and eviction started because before
5105 * submitting those bios, which are executed by a separate task (work
5106 * queue kthread), inode references (inode->i_count) were not taken
5107 * (which would be dropped in the end io callback of each bio).
5108 * Therefore here we effectively end up waiting for those bios and
5109 * anyone else holding locked ranges without having bumped the inode's
5110 * reference count - if we don't do it, when they access the inode's
5111 * io_tree to unlock a range it may be too late, leading to an
5112 * use-after-free issue.
5114 spin_lock(&io_tree->lock);
5115 while (!RB_EMPTY_ROOT(&io_tree->state)) {
5116 struct extent_state *state;
5117 struct extent_state *cached_state = NULL;
5120 unsigned state_flags;
5122 node = rb_first(&io_tree->state);
5123 state = rb_entry(node, struct extent_state, rb_node);
5124 start = state->start;
5126 state_flags = state->state;
5127 spin_unlock(&io_tree->lock);
5129 lock_extent(io_tree, start, end, &cached_state);
5132 * If still has DELALLOC flag, the extent didn't reach disk,
5133 * and its reserved space won't be freed by delayed_ref.
5134 * So we need to free its reserved space here.
5135 * (Refer to comment in btrfs_invalidate_folio, case 2)
5137 * Note, end is the bytenr of last byte, so we need + 1 here.
5139 if (state_flags & EXTENT_DELALLOC)
5140 btrfs_qgroup_free_data(BTRFS_I(inode), NULL, start,
5143 clear_extent_bit(io_tree, start, end,
5144 EXTENT_CLEAR_ALL_BITS | EXTENT_DO_ACCOUNTING,
5148 spin_lock(&io_tree->lock);
5150 spin_unlock(&io_tree->lock);
5153 static struct btrfs_trans_handle *evict_refill_and_join(struct btrfs_root *root,
5154 struct btrfs_block_rsv *rsv)
5156 struct btrfs_fs_info *fs_info = root->fs_info;
5157 struct btrfs_trans_handle *trans;
5158 u64 delayed_refs_extra = btrfs_calc_delayed_ref_bytes(fs_info, 1);
5162 * Eviction should be taking place at some place safe because of our
5163 * delayed iputs. However the normal flushing code will run delayed
5164 * iputs, so we cannot use FLUSH_ALL otherwise we'll deadlock.
5166 * We reserve the delayed_refs_extra here again because we can't use
5167 * btrfs_start_transaction(root, 0) for the same deadlocky reason as
5168 * above. We reserve our extra bit here because we generate a ton of
5169 * delayed refs activity by truncating.
5171 * BTRFS_RESERVE_FLUSH_EVICT will steal from the global_rsv if it can,
5172 * if we fail to make this reservation we can re-try without the
5173 * delayed_refs_extra so we can make some forward progress.
5175 ret = btrfs_block_rsv_refill(fs_info, rsv, rsv->size + delayed_refs_extra,
5176 BTRFS_RESERVE_FLUSH_EVICT);
5178 ret = btrfs_block_rsv_refill(fs_info, rsv, rsv->size,
5179 BTRFS_RESERVE_FLUSH_EVICT);
5182 "could not allocate space for delete; will truncate on mount");
5183 return ERR_PTR(-ENOSPC);
5185 delayed_refs_extra = 0;
5188 trans = btrfs_join_transaction(root);
5192 if (delayed_refs_extra) {
5193 trans->block_rsv = &fs_info->trans_block_rsv;
5194 trans->bytes_reserved = delayed_refs_extra;
5195 btrfs_block_rsv_migrate(rsv, trans->block_rsv,
5196 delayed_refs_extra, true);
5201 void btrfs_evict_inode(struct inode *inode)
5203 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
5204 struct btrfs_trans_handle *trans;
5205 struct btrfs_root *root = BTRFS_I(inode)->root;
5206 struct btrfs_block_rsv *rsv = NULL;
5209 trace_btrfs_inode_evict(inode);
5212 fsverity_cleanup_inode(inode);
5217 evict_inode_truncate_pages(inode);
5219 if (inode->i_nlink &&
5220 ((btrfs_root_refs(&root->root_item) != 0 &&
5221 root->root_key.objectid != BTRFS_ROOT_TREE_OBJECTID) ||
5222 btrfs_is_free_space_inode(BTRFS_I(inode))))
5225 if (is_bad_inode(inode))
5228 if (test_bit(BTRFS_FS_LOG_RECOVERING, &fs_info->flags))
5231 if (inode->i_nlink > 0) {
5232 BUG_ON(btrfs_root_refs(&root->root_item) != 0 &&
5233 root->root_key.objectid != BTRFS_ROOT_TREE_OBJECTID);
5238 * This makes sure the inode item in tree is uptodate and the space for
5239 * the inode update is released.
5241 ret = btrfs_commit_inode_delayed_inode(BTRFS_I(inode));
5246 * This drops any pending insert or delete operations we have for this
5247 * inode. We could have a delayed dir index deletion queued up, but
5248 * we're removing the inode completely so that'll be taken care of in
5251 btrfs_kill_delayed_inode_items(BTRFS_I(inode));
5253 rsv = btrfs_alloc_block_rsv(fs_info, BTRFS_BLOCK_RSV_TEMP);
5256 rsv->size = btrfs_calc_metadata_size(fs_info, 1);
5257 rsv->failfast = true;
5259 btrfs_i_size_write(BTRFS_I(inode), 0);
5262 struct btrfs_truncate_control control = {
5263 .inode = BTRFS_I(inode),
5264 .ino = btrfs_ino(BTRFS_I(inode)),
5269 trans = evict_refill_and_join(root, rsv);
5273 trans->block_rsv = rsv;
5275 ret = btrfs_truncate_inode_items(trans, root, &control);
5276 trans->block_rsv = &fs_info->trans_block_rsv;
5277 btrfs_end_transaction(trans);
5279 * We have not added new delayed items for our inode after we
5280 * have flushed its delayed items, so no need to throttle on
5281 * delayed items. However we have modified extent buffers.
5283 btrfs_btree_balance_dirty_nodelay(fs_info);
5284 if (ret && ret != -ENOSPC && ret != -EAGAIN)
5291 * Errors here aren't a big deal, it just means we leave orphan items in
5292 * the tree. They will be cleaned up on the next mount. If the inode
5293 * number gets reused, cleanup deletes the orphan item without doing
5294 * anything, and unlink reuses the existing orphan item.
5296 * If it turns out that we are dropping too many of these, we might want
5297 * to add a mechanism for retrying these after a commit.
5299 trans = evict_refill_and_join(root, rsv);
5300 if (!IS_ERR(trans)) {
5301 trans->block_rsv = rsv;
5302 btrfs_orphan_del(trans, BTRFS_I(inode));
5303 trans->block_rsv = &fs_info->trans_block_rsv;
5304 btrfs_end_transaction(trans);
5308 btrfs_free_block_rsv(fs_info, rsv);
5310 * If we didn't successfully delete, the orphan item will still be in
5311 * the tree and we'll retry on the next mount. Again, we might also want
5312 * to retry these periodically in the future.
5314 btrfs_remove_delayed_node(BTRFS_I(inode));
5315 fsverity_cleanup_inode(inode);
5320 * Return the key found in the dir entry in the location pointer, fill @type
5321 * with BTRFS_FT_*, and return 0.
5323 * If no dir entries were found, returns -ENOENT.
5324 * If found a corrupted location in dir entry, returns -EUCLEAN.
5326 static int btrfs_inode_by_name(struct btrfs_inode *dir, struct dentry *dentry,
5327 struct btrfs_key *location, u8 *type)
5329 struct btrfs_dir_item *di;
5330 struct btrfs_path *path;
5331 struct btrfs_root *root = dir->root;
5333 struct fscrypt_name fname;
5335 path = btrfs_alloc_path();
5339 ret = fscrypt_setup_filename(&dir->vfs_inode, &dentry->d_name, 1, &fname);
5343 * fscrypt_setup_filename() should never return a positive value, but
5344 * gcc on sparc/parisc thinks it can, so assert that doesn't happen.
5348 /* This needs to handle no-key deletions later on */
5350 di = btrfs_lookup_dir_item(NULL, root, path, btrfs_ino(dir),
5351 &fname.disk_name, 0);
5352 if (IS_ERR_OR_NULL(di)) {
5353 ret = di ? PTR_ERR(di) : -ENOENT;
5357 btrfs_dir_item_key_to_cpu(path->nodes[0], di, location);
5358 if (location->type != BTRFS_INODE_ITEM_KEY &&
5359 location->type != BTRFS_ROOT_ITEM_KEY) {
5361 btrfs_warn(root->fs_info,
5362 "%s gets something invalid in DIR_ITEM (name %s, directory ino %llu, location(%llu %u %llu))",
5363 __func__, fname.disk_name.name, btrfs_ino(dir),
5364 location->objectid, location->type, location->offset);
5367 *type = btrfs_dir_ftype(path->nodes[0], di);
5369 fscrypt_free_filename(&fname);
5370 btrfs_free_path(path);
5375 * when we hit a tree root in a directory, the btrfs part of the inode
5376 * needs to be changed to reflect the root directory of the tree root. This
5377 * is kind of like crossing a mount point.
5379 static int fixup_tree_root_location(struct btrfs_fs_info *fs_info,
5380 struct btrfs_inode *dir,
5381 struct dentry *dentry,
5382 struct btrfs_key *location,
5383 struct btrfs_root **sub_root)
5385 struct btrfs_path *path;
5386 struct btrfs_root *new_root;
5387 struct btrfs_root_ref *ref;
5388 struct extent_buffer *leaf;
5389 struct btrfs_key key;
5392 struct fscrypt_name fname;
5394 ret = fscrypt_setup_filename(&dir->vfs_inode, &dentry->d_name, 0, &fname);
5398 path = btrfs_alloc_path();
5405 key.objectid = dir->root->root_key.objectid;
5406 key.type = BTRFS_ROOT_REF_KEY;
5407 key.offset = location->objectid;
5409 ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, path, 0, 0);
5416 leaf = path->nodes[0];
5417 ref = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_ref);
5418 if (btrfs_root_ref_dirid(leaf, ref) != btrfs_ino(dir) ||
5419 btrfs_root_ref_name_len(leaf, ref) != fname.disk_name.len)
5422 ret = memcmp_extent_buffer(leaf, fname.disk_name.name,
5423 (unsigned long)(ref + 1), fname.disk_name.len);
5427 btrfs_release_path(path);
5429 new_root = btrfs_get_fs_root(fs_info, location->objectid, true);
5430 if (IS_ERR(new_root)) {
5431 err = PTR_ERR(new_root);
5435 *sub_root = new_root;
5436 location->objectid = btrfs_root_dirid(&new_root->root_item);
5437 location->type = BTRFS_INODE_ITEM_KEY;
5438 location->offset = 0;
5441 btrfs_free_path(path);
5442 fscrypt_free_filename(&fname);
5446 static void inode_tree_add(struct btrfs_inode *inode)
5448 struct btrfs_root *root = inode->root;
5449 struct btrfs_inode *entry;
5451 struct rb_node *parent;
5452 struct rb_node *new = &inode->rb_node;
5453 u64 ino = btrfs_ino(inode);
5455 if (inode_unhashed(&inode->vfs_inode))
5458 spin_lock(&root->inode_lock);
5459 p = &root->inode_tree.rb_node;
5462 entry = rb_entry(parent, struct btrfs_inode, rb_node);
5464 if (ino < btrfs_ino(entry))
5465 p = &parent->rb_left;
5466 else if (ino > btrfs_ino(entry))
5467 p = &parent->rb_right;
5469 WARN_ON(!(entry->vfs_inode.i_state &
5470 (I_WILL_FREE | I_FREEING)));
5471 rb_replace_node(parent, new, &root->inode_tree);
5472 RB_CLEAR_NODE(parent);
5473 spin_unlock(&root->inode_lock);
5477 rb_link_node(new, parent, p);
5478 rb_insert_color(new, &root->inode_tree);
5479 spin_unlock(&root->inode_lock);
5482 static void inode_tree_del(struct btrfs_inode *inode)
5484 struct btrfs_root *root = inode->root;
5487 spin_lock(&root->inode_lock);
5488 if (!RB_EMPTY_NODE(&inode->rb_node)) {
5489 rb_erase(&inode->rb_node, &root->inode_tree);
5490 RB_CLEAR_NODE(&inode->rb_node);
5491 empty = RB_EMPTY_ROOT(&root->inode_tree);
5493 spin_unlock(&root->inode_lock);
5495 if (empty && btrfs_root_refs(&root->root_item) == 0) {
5496 spin_lock(&root->inode_lock);
5497 empty = RB_EMPTY_ROOT(&root->inode_tree);
5498 spin_unlock(&root->inode_lock);
5500 btrfs_add_dead_root(root);
5505 static int btrfs_init_locked_inode(struct inode *inode, void *p)
5507 struct btrfs_iget_args *args = p;
5509 inode->i_ino = args->ino;
5510 BTRFS_I(inode)->location.objectid = args->ino;
5511 BTRFS_I(inode)->location.type = BTRFS_INODE_ITEM_KEY;
5512 BTRFS_I(inode)->location.offset = 0;
5513 BTRFS_I(inode)->root = btrfs_grab_root(args->root);
5514 BUG_ON(args->root && !BTRFS_I(inode)->root);
5516 if (args->root && args->root == args->root->fs_info->tree_root &&
5517 args->ino != BTRFS_BTREE_INODE_OBJECTID)
5518 set_bit(BTRFS_INODE_FREE_SPACE_INODE,
5519 &BTRFS_I(inode)->runtime_flags);
5523 static int btrfs_find_actor(struct inode *inode, void *opaque)
5525 struct btrfs_iget_args *args = opaque;
5527 return args->ino == BTRFS_I(inode)->location.objectid &&
5528 args->root == BTRFS_I(inode)->root;
5531 static struct inode *btrfs_iget_locked(struct super_block *s, u64 ino,
5532 struct btrfs_root *root)
5534 struct inode *inode;
5535 struct btrfs_iget_args args;
5536 unsigned long hashval = btrfs_inode_hash(ino, root);
5541 inode = iget5_locked(s, hashval, btrfs_find_actor,
5542 btrfs_init_locked_inode,
5548 * Get an inode object given its inode number and corresponding root.
5549 * Path can be preallocated to prevent recursing back to iget through
5550 * allocator. NULL is also valid but may require an additional allocation
5553 struct inode *btrfs_iget_path(struct super_block *s, u64 ino,
5554 struct btrfs_root *root, struct btrfs_path *path)
5556 struct inode *inode;
5558 inode = btrfs_iget_locked(s, ino, root);
5560 return ERR_PTR(-ENOMEM);
5562 if (inode->i_state & I_NEW) {
5565 ret = btrfs_read_locked_inode(inode, path);
5567 inode_tree_add(BTRFS_I(inode));
5568 unlock_new_inode(inode);
5572 * ret > 0 can come from btrfs_search_slot called by
5573 * btrfs_read_locked_inode, this means the inode item
5578 inode = ERR_PTR(ret);
5585 struct inode *btrfs_iget(struct super_block *s, u64 ino, struct btrfs_root *root)
5587 return btrfs_iget_path(s, ino, root, NULL);
5590 static struct inode *new_simple_dir(struct inode *dir,
5591 struct btrfs_key *key,
5592 struct btrfs_root *root)
5594 struct inode *inode = new_inode(dir->i_sb);
5597 return ERR_PTR(-ENOMEM);
5599 BTRFS_I(inode)->root = btrfs_grab_root(root);
5600 memcpy(&BTRFS_I(inode)->location, key, sizeof(*key));
5601 set_bit(BTRFS_INODE_DUMMY, &BTRFS_I(inode)->runtime_flags);
5603 inode->i_ino = BTRFS_EMPTY_SUBVOL_DIR_OBJECTID;
5605 * We only need lookup, the rest is read-only and there's no inode
5606 * associated with the dentry
5608 inode->i_op = &simple_dir_inode_operations;
5609 inode->i_opflags &= ~IOP_XATTR;
5610 inode->i_fop = &simple_dir_operations;
5611 inode->i_mode = S_IFDIR | S_IRUGO | S_IWUSR | S_IXUGO;
5612 inode->i_mtime = inode_set_ctime_current(inode);
5613 inode->i_atime = dir->i_atime;
5614 BTRFS_I(inode)->i_otime = inode->i_mtime;
5615 inode->i_uid = dir->i_uid;
5616 inode->i_gid = dir->i_gid;
5621 static_assert(BTRFS_FT_UNKNOWN == FT_UNKNOWN);
5622 static_assert(BTRFS_FT_REG_FILE == FT_REG_FILE);
5623 static_assert(BTRFS_FT_DIR == FT_DIR);
5624 static_assert(BTRFS_FT_CHRDEV == FT_CHRDEV);
5625 static_assert(BTRFS_FT_BLKDEV == FT_BLKDEV);
5626 static_assert(BTRFS_FT_FIFO == FT_FIFO);
5627 static_assert(BTRFS_FT_SOCK == FT_SOCK);
5628 static_assert(BTRFS_FT_SYMLINK == FT_SYMLINK);
5630 static inline u8 btrfs_inode_type(struct inode *inode)
5632 return fs_umode_to_ftype(inode->i_mode);
5635 struct inode *btrfs_lookup_dentry(struct inode *dir, struct dentry *dentry)
5637 struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
5638 struct inode *inode;
5639 struct btrfs_root *root = BTRFS_I(dir)->root;
5640 struct btrfs_root *sub_root = root;
5641 struct btrfs_key location;
5645 if (dentry->d_name.len > BTRFS_NAME_LEN)
5646 return ERR_PTR(-ENAMETOOLONG);
5648 ret = btrfs_inode_by_name(BTRFS_I(dir), dentry, &location, &di_type);
5650 return ERR_PTR(ret);
5652 if (location.type == BTRFS_INODE_ITEM_KEY) {
5653 inode = btrfs_iget(dir->i_sb, location.objectid, root);
5657 /* Do extra check against inode mode with di_type */
5658 if (btrfs_inode_type(inode) != di_type) {
5660 "inode mode mismatch with dir: inode mode=0%o btrfs type=%u dir type=%u",
5661 inode->i_mode, btrfs_inode_type(inode),
5664 return ERR_PTR(-EUCLEAN);
5669 ret = fixup_tree_root_location(fs_info, BTRFS_I(dir), dentry,
5670 &location, &sub_root);
5673 inode = ERR_PTR(ret);
5675 inode = new_simple_dir(dir, &location, root);
5677 inode = btrfs_iget(dir->i_sb, location.objectid, sub_root);
5678 btrfs_put_root(sub_root);
5683 down_read(&fs_info->cleanup_work_sem);
5684 if (!sb_rdonly(inode->i_sb))
5685 ret = btrfs_orphan_cleanup(sub_root);
5686 up_read(&fs_info->cleanup_work_sem);
5689 inode = ERR_PTR(ret);
5696 static int btrfs_dentry_delete(const struct dentry *dentry)
5698 struct btrfs_root *root;
5699 struct inode *inode = d_inode(dentry);
5701 if (!inode && !IS_ROOT(dentry))
5702 inode = d_inode(dentry->d_parent);
5705 root = BTRFS_I(inode)->root;
5706 if (btrfs_root_refs(&root->root_item) == 0)
5709 if (btrfs_ino(BTRFS_I(inode)) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)
5715 static struct dentry *btrfs_lookup(struct inode *dir, struct dentry *dentry,
5718 struct inode *inode = btrfs_lookup_dentry(dir, dentry);
5720 if (inode == ERR_PTR(-ENOENT))
5722 return d_splice_alias(inode, dentry);
5726 * Find the highest existing sequence number in a directory and then set the
5727 * in-memory index_cnt variable to the first free sequence number.
5729 static int btrfs_set_inode_index_count(struct btrfs_inode *inode)
5731 struct btrfs_root *root = inode->root;
5732 struct btrfs_key key, found_key;
5733 struct btrfs_path *path;
5734 struct extent_buffer *leaf;
5737 key.objectid = btrfs_ino(inode);
5738 key.type = BTRFS_DIR_INDEX_KEY;
5739 key.offset = (u64)-1;
5741 path = btrfs_alloc_path();
5745 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
5748 /* FIXME: we should be able to handle this */
5753 if (path->slots[0] == 0) {
5754 inode->index_cnt = BTRFS_DIR_START_INDEX;
5760 leaf = path->nodes[0];
5761 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
5763 if (found_key.objectid != btrfs_ino(inode) ||
5764 found_key.type != BTRFS_DIR_INDEX_KEY) {
5765 inode->index_cnt = BTRFS_DIR_START_INDEX;
5769 inode->index_cnt = found_key.offset + 1;
5771 btrfs_free_path(path);
5775 static int btrfs_get_dir_last_index(struct btrfs_inode *dir, u64 *index)
5779 btrfs_inode_lock(dir, 0);
5780 if (dir->index_cnt == (u64)-1) {
5781 ret = btrfs_inode_delayed_dir_index_count(dir);
5783 ret = btrfs_set_inode_index_count(dir);
5789 /* index_cnt is the index number of next new entry, so decrement it. */
5790 *index = dir->index_cnt - 1;
5792 btrfs_inode_unlock(dir, 0);
5798 * All this infrastructure exists because dir_emit can fault, and we are holding
5799 * the tree lock when doing readdir. For now just allocate a buffer and copy
5800 * our information into that, and then dir_emit from the buffer. This is
5801 * similar to what NFS does, only we don't keep the buffer around in pagecache
5802 * because I'm afraid I'll mess that up. Long term we need to make filldir do
5803 * copy_to_user_inatomic so we don't have to worry about page faulting under the
5806 static int btrfs_opendir(struct inode *inode, struct file *file)
5808 struct btrfs_file_private *private;
5812 ret = btrfs_get_dir_last_index(BTRFS_I(inode), &last_index);
5816 private = kzalloc(sizeof(struct btrfs_file_private), GFP_KERNEL);
5819 private->last_index = last_index;
5820 private->filldir_buf = kzalloc(PAGE_SIZE, GFP_KERNEL);
5821 if (!private->filldir_buf) {
5825 file->private_data = private;
5829 static loff_t btrfs_dir_llseek(struct file *file, loff_t offset, int whence)
5831 struct btrfs_file_private *private = file->private_data;
5834 ret = btrfs_get_dir_last_index(BTRFS_I(file_inode(file)),
5835 &private->last_index);
5839 return generic_file_llseek(file, offset, whence);
5849 static int btrfs_filldir(void *addr, int entries, struct dir_context *ctx)
5852 struct dir_entry *entry = addr;
5853 char *name = (char *)(entry + 1);
5855 ctx->pos = get_unaligned(&entry->offset);
5856 if (!dir_emit(ctx, name, get_unaligned(&entry->name_len),
5857 get_unaligned(&entry->ino),
5858 get_unaligned(&entry->type)))
5860 addr += sizeof(struct dir_entry) +
5861 get_unaligned(&entry->name_len);
5867 static int btrfs_real_readdir(struct file *file, struct dir_context *ctx)
5869 struct inode *inode = file_inode(file);
5870 struct btrfs_root *root = BTRFS_I(inode)->root;
5871 struct btrfs_file_private *private = file->private_data;
5872 struct btrfs_dir_item *di;
5873 struct btrfs_key key;
5874 struct btrfs_key found_key;
5875 struct btrfs_path *path;
5877 LIST_HEAD(ins_list);
5878 LIST_HEAD(del_list);
5885 struct btrfs_key location;
5887 if (!dir_emit_dots(file, ctx))
5890 path = btrfs_alloc_path();
5894 addr = private->filldir_buf;
5895 path->reada = READA_FORWARD;
5897 put = btrfs_readdir_get_delayed_items(inode, private->last_index,
5898 &ins_list, &del_list);
5901 key.type = BTRFS_DIR_INDEX_KEY;
5902 key.offset = ctx->pos;
5903 key.objectid = btrfs_ino(BTRFS_I(inode));
5905 btrfs_for_each_slot(root, &key, &found_key, path, ret) {
5906 struct dir_entry *entry;
5907 struct extent_buffer *leaf = path->nodes[0];
5910 if (found_key.objectid != key.objectid)
5912 if (found_key.type != BTRFS_DIR_INDEX_KEY)
5914 if (found_key.offset < ctx->pos)
5916 if (found_key.offset > private->last_index)
5918 if (btrfs_should_delete_dir_index(&del_list, found_key.offset))
5920 di = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dir_item);
5921 name_len = btrfs_dir_name_len(leaf, di);
5922 if ((total_len + sizeof(struct dir_entry) + name_len) >=
5924 btrfs_release_path(path);
5925 ret = btrfs_filldir(private->filldir_buf, entries, ctx);
5928 addr = private->filldir_buf;
5934 ftype = btrfs_dir_flags_to_ftype(btrfs_dir_flags(leaf, di));
5936 name_ptr = (char *)(entry + 1);
5937 read_extent_buffer(leaf, name_ptr,
5938 (unsigned long)(di + 1), name_len);
5939 put_unaligned(name_len, &entry->name_len);
5940 put_unaligned(fs_ftype_to_dtype(ftype), &entry->type);
5941 btrfs_dir_item_key_to_cpu(leaf, di, &location);
5942 put_unaligned(location.objectid, &entry->ino);
5943 put_unaligned(found_key.offset, &entry->offset);
5945 addr += sizeof(struct dir_entry) + name_len;
5946 total_len += sizeof(struct dir_entry) + name_len;
5948 /* Catch error encountered during iteration */
5952 btrfs_release_path(path);
5954 ret = btrfs_filldir(private->filldir_buf, entries, ctx);
5958 ret = btrfs_readdir_delayed_dir_index(ctx, &ins_list);
5963 * Stop new entries from being returned after we return the last
5966 * New directory entries are assigned a strictly increasing
5967 * offset. This means that new entries created during readdir
5968 * are *guaranteed* to be seen in the future by that readdir.
5969 * This has broken buggy programs which operate on names as
5970 * they're returned by readdir. Until we re-use freed offsets
5971 * we have this hack to stop new entries from being returned
5972 * under the assumption that they'll never reach this huge
5975 * This is being careful not to overflow 32bit loff_t unless the
5976 * last entry requires it because doing so has broken 32bit apps
5979 if (ctx->pos >= INT_MAX)
5980 ctx->pos = LLONG_MAX;
5987 btrfs_readdir_put_delayed_items(inode, &ins_list, &del_list);
5988 btrfs_free_path(path);
5993 * This is somewhat expensive, updating the tree every time the
5994 * inode changes. But, it is most likely to find the inode in cache.
5995 * FIXME, needs more benchmarking...there are no reasons other than performance
5996 * to keep or drop this code.
5998 static int btrfs_dirty_inode(struct btrfs_inode *inode)
6000 struct btrfs_root *root = inode->root;
6001 struct btrfs_fs_info *fs_info = root->fs_info;
6002 struct btrfs_trans_handle *trans;
6005 if (test_bit(BTRFS_INODE_DUMMY, &inode->runtime_flags))
6008 trans = btrfs_join_transaction(root);
6010 return PTR_ERR(trans);
6012 ret = btrfs_update_inode(trans, inode);
6013 if (ret == -ENOSPC || ret == -EDQUOT) {
6014 /* whoops, lets try again with the full transaction */
6015 btrfs_end_transaction(trans);
6016 trans = btrfs_start_transaction(root, 1);
6018 return PTR_ERR(trans);
6020 ret = btrfs_update_inode(trans, inode);
6022 btrfs_end_transaction(trans);
6023 if (inode->delayed_node)
6024 btrfs_balance_delayed_items(fs_info);
6030 * This is a copy of file_update_time. We need this so we can return error on
6031 * ENOSPC for updating the inode in the case of file write and mmap writes.
6033 static int btrfs_update_time(struct inode *inode, int flags)
6035 struct btrfs_root *root = BTRFS_I(inode)->root;
6036 bool dirty = flags & ~S_VERSION;
6038 if (btrfs_root_readonly(root))
6041 dirty = inode_update_timestamps(inode, flags);
6042 return dirty ? btrfs_dirty_inode(BTRFS_I(inode)) : 0;
6046 * helper to find a free sequence number in a given directory. This current
6047 * code is very simple, later versions will do smarter things in the btree
6049 int btrfs_set_inode_index(struct btrfs_inode *dir, u64 *index)
6053 if (dir->index_cnt == (u64)-1) {
6054 ret = btrfs_inode_delayed_dir_index_count(dir);
6056 ret = btrfs_set_inode_index_count(dir);
6062 *index = dir->index_cnt;
6068 static int btrfs_insert_inode_locked(struct inode *inode)
6070 struct btrfs_iget_args args;
6072 args.ino = BTRFS_I(inode)->location.objectid;
6073 args.root = BTRFS_I(inode)->root;
6075 return insert_inode_locked4(inode,
6076 btrfs_inode_hash(inode->i_ino, BTRFS_I(inode)->root),
6077 btrfs_find_actor, &args);
6080 int btrfs_new_inode_prepare(struct btrfs_new_inode_args *args,
6081 unsigned int *trans_num_items)
6083 struct inode *dir = args->dir;
6084 struct inode *inode = args->inode;
6087 if (!args->orphan) {
6088 ret = fscrypt_setup_filename(dir, &args->dentry->d_name, 0,
6094 ret = posix_acl_create(dir, &inode->i_mode, &args->default_acl, &args->acl);
6096 fscrypt_free_filename(&args->fname);
6100 /* 1 to add inode item */
6101 *trans_num_items = 1;
6102 /* 1 to add compression property */
6103 if (BTRFS_I(dir)->prop_compress)
6104 (*trans_num_items)++;
6105 /* 1 to add default ACL xattr */
6106 if (args->default_acl)
6107 (*trans_num_items)++;
6108 /* 1 to add access ACL xattr */
6110 (*trans_num_items)++;
6111 #ifdef CONFIG_SECURITY
6112 /* 1 to add LSM xattr */
6113 if (dir->i_security)
6114 (*trans_num_items)++;
6117 /* 1 to add orphan item */
6118 (*trans_num_items)++;
6122 * 1 to add dir index
6123 * 1 to update parent inode item
6125 * No need for 1 unit for the inode ref item because it is
6126 * inserted in a batch together with the inode item at
6127 * btrfs_create_new_inode().
6129 *trans_num_items += 3;
6134 void btrfs_new_inode_args_destroy(struct btrfs_new_inode_args *args)
6136 posix_acl_release(args->acl);
6137 posix_acl_release(args->default_acl);
6138 fscrypt_free_filename(&args->fname);
6142 * Inherit flags from the parent inode.
6144 * Currently only the compression flags and the cow flags are inherited.
6146 static void btrfs_inherit_iflags(struct btrfs_inode *inode, struct btrfs_inode *dir)
6152 if (flags & BTRFS_INODE_NOCOMPRESS) {
6153 inode->flags &= ~BTRFS_INODE_COMPRESS;
6154 inode->flags |= BTRFS_INODE_NOCOMPRESS;
6155 } else if (flags & BTRFS_INODE_COMPRESS) {
6156 inode->flags &= ~BTRFS_INODE_NOCOMPRESS;
6157 inode->flags |= BTRFS_INODE_COMPRESS;
6160 if (flags & BTRFS_INODE_NODATACOW) {
6161 inode->flags |= BTRFS_INODE_NODATACOW;
6162 if (S_ISREG(inode->vfs_inode.i_mode))
6163 inode->flags |= BTRFS_INODE_NODATASUM;
6166 btrfs_sync_inode_flags_to_i_flags(&inode->vfs_inode);
6169 int btrfs_create_new_inode(struct btrfs_trans_handle *trans,
6170 struct btrfs_new_inode_args *args)
6172 struct inode *dir = args->dir;
6173 struct inode *inode = args->inode;
6174 const struct fscrypt_str *name = args->orphan ? NULL : &args->fname.disk_name;
6175 struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
6176 struct btrfs_root *root;
6177 struct btrfs_inode_item *inode_item;
6178 struct btrfs_key *location;
6179 struct btrfs_path *path;
6181 struct btrfs_inode_ref *ref;
6182 struct btrfs_key key[2];
6184 struct btrfs_item_batch batch;
6188 path = btrfs_alloc_path();
6193 BTRFS_I(inode)->root = btrfs_grab_root(BTRFS_I(dir)->root);
6194 root = BTRFS_I(inode)->root;
6196 ret = btrfs_get_free_objectid(root, &objectid);
6199 inode->i_ino = objectid;
6203 * O_TMPFILE, set link count to 0, so that after this point, we
6204 * fill in an inode item with the correct link count.
6206 set_nlink(inode, 0);
6208 trace_btrfs_inode_request(dir);
6210 ret = btrfs_set_inode_index(BTRFS_I(dir), &BTRFS_I(inode)->dir_index);
6214 /* index_cnt is ignored for everything but a dir. */
6215 BTRFS_I(inode)->index_cnt = BTRFS_DIR_START_INDEX;
6216 BTRFS_I(inode)->generation = trans->transid;
6217 inode->i_generation = BTRFS_I(inode)->generation;
6220 * Subvolumes don't inherit flags from their parent directory.
6221 * Originally this was probably by accident, but we probably can't
6222 * change it now without compatibility issues.
6225 btrfs_inherit_iflags(BTRFS_I(inode), BTRFS_I(dir));
6227 if (S_ISREG(inode->i_mode)) {
6228 if (btrfs_test_opt(fs_info, NODATASUM))
6229 BTRFS_I(inode)->flags |= BTRFS_INODE_NODATASUM;
6230 if (btrfs_test_opt(fs_info, NODATACOW))
6231 BTRFS_I(inode)->flags |= BTRFS_INODE_NODATACOW |
6232 BTRFS_INODE_NODATASUM;
6235 location = &BTRFS_I(inode)->location;
6236 location->objectid = objectid;
6237 location->offset = 0;
6238 location->type = BTRFS_INODE_ITEM_KEY;
6240 ret = btrfs_insert_inode_locked(inode);
6243 BTRFS_I(dir)->index_cnt--;
6248 * We could have gotten an inode number from somebody who was fsynced
6249 * and then removed in this same transaction, so let's just set full
6250 * sync since it will be a full sync anyway and this will blow away the
6251 * old info in the log.
6253 btrfs_set_inode_full_sync(BTRFS_I(inode));
6255 key[0].objectid = objectid;
6256 key[0].type = BTRFS_INODE_ITEM_KEY;
6259 sizes[0] = sizeof(struct btrfs_inode_item);
6261 if (!args->orphan) {
6263 * Start new inodes with an inode_ref. This is slightly more
6264 * efficient for small numbers of hard links since they will
6265 * be packed into one item. Extended refs will kick in if we
6266 * add more hard links than can fit in the ref item.
6268 key[1].objectid = objectid;
6269 key[1].type = BTRFS_INODE_REF_KEY;
6271 key[1].offset = objectid;
6272 sizes[1] = 2 + sizeof(*ref);
6274 key[1].offset = btrfs_ino(BTRFS_I(dir));
6275 sizes[1] = name->len + sizeof(*ref);
6279 batch.keys = &key[0];
6280 batch.data_sizes = &sizes[0];
6281 batch.total_data_size = sizes[0] + (args->orphan ? 0 : sizes[1]);
6282 batch.nr = args->orphan ? 1 : 2;
6283 ret = btrfs_insert_empty_items(trans, root, path, &batch);
6285 btrfs_abort_transaction(trans, ret);
6289 inode->i_mtime = inode_set_ctime_current(inode);
6290 inode->i_atime = inode->i_mtime;
6291 BTRFS_I(inode)->i_otime = inode->i_mtime;
6294 * We're going to fill the inode item now, so at this point the inode
6295 * must be fully initialized.
6298 inode_item = btrfs_item_ptr(path->nodes[0], path->slots[0],
6299 struct btrfs_inode_item);
6300 memzero_extent_buffer(path->nodes[0], (unsigned long)inode_item,
6301 sizeof(*inode_item));
6302 fill_inode_item(trans, path->nodes[0], inode_item, inode);
6304 if (!args->orphan) {
6305 ref = btrfs_item_ptr(path->nodes[0], path->slots[0] + 1,
6306 struct btrfs_inode_ref);
6307 ptr = (unsigned long)(ref + 1);
6309 btrfs_set_inode_ref_name_len(path->nodes[0], ref, 2);
6310 btrfs_set_inode_ref_index(path->nodes[0], ref, 0);
6311 write_extent_buffer(path->nodes[0], "..", ptr, 2);
6313 btrfs_set_inode_ref_name_len(path->nodes[0], ref,
6315 btrfs_set_inode_ref_index(path->nodes[0], ref,
6316 BTRFS_I(inode)->dir_index);
6317 write_extent_buffer(path->nodes[0], name->name, ptr,
6322 btrfs_mark_buffer_dirty(trans, path->nodes[0]);
6324 * We don't need the path anymore, plus inheriting properties, adding
6325 * ACLs, security xattrs, orphan item or adding the link, will result in
6326 * allocating yet another path. So just free our path.
6328 btrfs_free_path(path);
6332 struct inode *parent;
6335 * Subvolumes inherit properties from their parent subvolume,
6336 * not the directory they were created in.
6338 parent = btrfs_iget(fs_info->sb, BTRFS_FIRST_FREE_OBJECTID,
6339 BTRFS_I(dir)->root);
6340 if (IS_ERR(parent)) {
6341 ret = PTR_ERR(parent);
6343 ret = btrfs_inode_inherit_props(trans, inode, parent);
6347 ret = btrfs_inode_inherit_props(trans, inode, dir);
6351 "error inheriting props for ino %llu (root %llu): %d",
6352 btrfs_ino(BTRFS_I(inode)), root->root_key.objectid,
6357 * Subvolumes don't inherit ACLs or get passed to the LSM. This is
6360 if (!args->subvol) {
6361 ret = btrfs_init_inode_security(trans, args);
6363 btrfs_abort_transaction(trans, ret);
6368 inode_tree_add(BTRFS_I(inode));
6370 trace_btrfs_inode_new(inode);
6371 btrfs_set_inode_last_trans(trans, BTRFS_I(inode));
6373 btrfs_update_root_times(trans, root);
6376 ret = btrfs_orphan_add(trans, BTRFS_I(inode));
6378 ret = btrfs_add_link(trans, BTRFS_I(dir), BTRFS_I(inode), name,
6379 0, BTRFS_I(inode)->dir_index);
6382 btrfs_abort_transaction(trans, ret);
6390 * discard_new_inode() calls iput(), but the caller owns the reference
6394 discard_new_inode(inode);
6396 btrfs_free_path(path);
6401 * utility function to add 'inode' into 'parent_inode' with
6402 * a give name and a given sequence number.
6403 * if 'add_backref' is true, also insert a backref from the
6404 * inode to the parent directory.
6406 int btrfs_add_link(struct btrfs_trans_handle *trans,
6407 struct btrfs_inode *parent_inode, struct btrfs_inode *inode,
6408 const struct fscrypt_str *name, int add_backref, u64 index)
6411 struct btrfs_key key;
6412 struct btrfs_root *root = parent_inode->root;
6413 u64 ino = btrfs_ino(inode);
6414 u64 parent_ino = btrfs_ino(parent_inode);
6416 if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) {
6417 memcpy(&key, &inode->root->root_key, sizeof(key));
6420 key.type = BTRFS_INODE_ITEM_KEY;
6424 if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) {
6425 ret = btrfs_add_root_ref(trans, key.objectid,
6426 root->root_key.objectid, parent_ino,
6428 } else if (add_backref) {
6429 ret = btrfs_insert_inode_ref(trans, root, name,
6430 ino, parent_ino, index);
6433 /* Nothing to clean up yet */
6437 ret = btrfs_insert_dir_item(trans, name, parent_inode, &key,
6438 btrfs_inode_type(&inode->vfs_inode), index);
6439 if (ret == -EEXIST || ret == -EOVERFLOW)
6442 btrfs_abort_transaction(trans, ret);
6446 btrfs_i_size_write(parent_inode, parent_inode->vfs_inode.i_size +
6448 inode_inc_iversion(&parent_inode->vfs_inode);
6450 * If we are replaying a log tree, we do not want to update the mtime
6451 * and ctime of the parent directory with the current time, since the
6452 * log replay procedure is responsible for setting them to their correct
6453 * values (the ones it had when the fsync was done).
6455 if (!test_bit(BTRFS_FS_LOG_RECOVERING, &root->fs_info->flags))
6456 parent_inode->vfs_inode.i_mtime =
6457 inode_set_ctime_current(&parent_inode->vfs_inode);
6459 ret = btrfs_update_inode(trans, parent_inode);
6461 btrfs_abort_transaction(trans, ret);
6465 if (unlikely(ino == BTRFS_FIRST_FREE_OBJECTID)) {
6468 err = btrfs_del_root_ref(trans, key.objectid,
6469 root->root_key.objectid, parent_ino,
6470 &local_index, name);
6472 btrfs_abort_transaction(trans, err);
6473 } else if (add_backref) {
6477 err = btrfs_del_inode_ref(trans, root, name, ino, parent_ino,
6480 btrfs_abort_transaction(trans, err);
6483 /* Return the original error code */
6487 static int btrfs_create_common(struct inode *dir, struct dentry *dentry,
6488 struct inode *inode)
6490 struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
6491 struct btrfs_root *root = BTRFS_I(dir)->root;
6492 struct btrfs_new_inode_args new_inode_args = {
6497 unsigned int trans_num_items;
6498 struct btrfs_trans_handle *trans;
6501 err = btrfs_new_inode_prepare(&new_inode_args, &trans_num_items);
6505 trans = btrfs_start_transaction(root, trans_num_items);
6506 if (IS_ERR(trans)) {
6507 err = PTR_ERR(trans);
6508 goto out_new_inode_args;
6511 err = btrfs_create_new_inode(trans, &new_inode_args);
6513 d_instantiate_new(dentry, inode);
6515 btrfs_end_transaction(trans);
6516 btrfs_btree_balance_dirty(fs_info);
6518 btrfs_new_inode_args_destroy(&new_inode_args);
6525 static int btrfs_mknod(struct mnt_idmap *idmap, struct inode *dir,
6526 struct dentry *dentry, umode_t mode, dev_t rdev)
6528 struct inode *inode;
6530 inode = new_inode(dir->i_sb);
6533 inode_init_owner(idmap, inode, dir, mode);
6534 inode->i_op = &btrfs_special_inode_operations;
6535 init_special_inode(inode, inode->i_mode, rdev);
6536 return btrfs_create_common(dir, dentry, inode);
6539 static int btrfs_create(struct mnt_idmap *idmap, struct inode *dir,
6540 struct dentry *dentry, umode_t mode, bool excl)
6542 struct inode *inode;
6544 inode = new_inode(dir->i_sb);
6547 inode_init_owner(idmap, inode, dir, mode);
6548 inode->i_fop = &btrfs_file_operations;
6549 inode->i_op = &btrfs_file_inode_operations;
6550 inode->i_mapping->a_ops = &btrfs_aops;
6551 return btrfs_create_common(dir, dentry, inode);
6554 static int btrfs_link(struct dentry *old_dentry, struct inode *dir,
6555 struct dentry *dentry)
6557 struct btrfs_trans_handle *trans = NULL;
6558 struct btrfs_root *root = BTRFS_I(dir)->root;
6559 struct inode *inode = d_inode(old_dentry);
6560 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
6561 struct fscrypt_name fname;
6566 /* do not allow sys_link's with other subvols of the same device */
6567 if (root->root_key.objectid != BTRFS_I(inode)->root->root_key.objectid)
6570 if (inode->i_nlink >= BTRFS_LINK_MAX)
6573 err = fscrypt_setup_filename(dir, &dentry->d_name, 0, &fname);
6577 err = btrfs_set_inode_index(BTRFS_I(dir), &index);
6582 * 2 items for inode and inode ref
6583 * 2 items for dir items
6584 * 1 item for parent inode
6585 * 1 item for orphan item deletion if O_TMPFILE
6587 trans = btrfs_start_transaction(root, inode->i_nlink ? 5 : 6);
6588 if (IS_ERR(trans)) {
6589 err = PTR_ERR(trans);
6594 /* There are several dir indexes for this inode, clear the cache. */
6595 BTRFS_I(inode)->dir_index = 0ULL;
6597 inode_inc_iversion(inode);
6598 inode_set_ctime_current(inode);
6600 set_bit(BTRFS_INODE_COPY_EVERYTHING, &BTRFS_I(inode)->runtime_flags);
6602 err = btrfs_add_link(trans, BTRFS_I(dir), BTRFS_I(inode),
6603 &fname.disk_name, 1, index);
6608 struct dentry *parent = dentry->d_parent;
6610 err = btrfs_update_inode(trans, BTRFS_I(inode));
6613 if (inode->i_nlink == 1) {
6615 * If new hard link count is 1, it's a file created
6616 * with open(2) O_TMPFILE flag.
6618 err = btrfs_orphan_del(trans, BTRFS_I(inode));
6622 d_instantiate(dentry, inode);
6623 btrfs_log_new_name(trans, old_dentry, NULL, 0, parent);
6627 fscrypt_free_filename(&fname);
6629 btrfs_end_transaction(trans);
6631 inode_dec_link_count(inode);
6634 btrfs_btree_balance_dirty(fs_info);
6638 static int btrfs_mkdir(struct mnt_idmap *idmap, struct inode *dir,
6639 struct dentry *dentry, umode_t mode)
6641 struct inode *inode;
6643 inode = new_inode(dir->i_sb);
6646 inode_init_owner(idmap, inode, dir, S_IFDIR | mode);
6647 inode->i_op = &btrfs_dir_inode_operations;
6648 inode->i_fop = &btrfs_dir_file_operations;
6649 return btrfs_create_common(dir, dentry, inode);
6652 static noinline int uncompress_inline(struct btrfs_path *path,
6654 struct btrfs_file_extent_item *item)
6657 struct extent_buffer *leaf = path->nodes[0];
6660 unsigned long inline_size;
6664 compress_type = btrfs_file_extent_compression(leaf, item);
6665 max_size = btrfs_file_extent_ram_bytes(leaf, item);
6666 inline_size = btrfs_file_extent_inline_item_len(leaf, path->slots[0]);
6667 tmp = kmalloc(inline_size, GFP_NOFS);
6670 ptr = btrfs_file_extent_inline_start(item);
6672 read_extent_buffer(leaf, tmp, ptr, inline_size);
6674 max_size = min_t(unsigned long, PAGE_SIZE, max_size);
6675 ret = btrfs_decompress(compress_type, tmp, page, 0, inline_size, max_size);
6678 * decompression code contains a memset to fill in any space between the end
6679 * of the uncompressed data and the end of max_size in case the decompressed
6680 * data ends up shorter than ram_bytes. That doesn't cover the hole between
6681 * the end of an inline extent and the beginning of the next block, so we
6682 * cover that region here.
6685 if (max_size < PAGE_SIZE)
6686 memzero_page(page, max_size, PAGE_SIZE - max_size);
6691 static int read_inline_extent(struct btrfs_inode *inode, struct btrfs_path *path,
6694 struct btrfs_file_extent_item *fi;
6698 if (!page || PageUptodate(page))
6701 ASSERT(page_offset(page) == 0);
6703 fi = btrfs_item_ptr(path->nodes[0], path->slots[0],
6704 struct btrfs_file_extent_item);
6705 if (btrfs_file_extent_compression(path->nodes[0], fi) != BTRFS_COMPRESS_NONE)
6706 return uncompress_inline(path, page, fi);
6708 copy_size = min_t(u64, PAGE_SIZE,
6709 btrfs_file_extent_ram_bytes(path->nodes[0], fi));
6710 kaddr = kmap_local_page(page);
6711 read_extent_buffer(path->nodes[0], kaddr,
6712 btrfs_file_extent_inline_start(fi), copy_size);
6713 kunmap_local(kaddr);
6714 if (copy_size < PAGE_SIZE)
6715 memzero_page(page, copy_size, PAGE_SIZE - copy_size);
6720 * Lookup the first extent overlapping a range in a file.
6722 * @inode: file to search in
6723 * @page: page to read extent data into if the extent is inline
6724 * @pg_offset: offset into @page to copy to
6725 * @start: file offset
6726 * @len: length of range starting at @start
6728 * Return the first &struct extent_map which overlaps the given range, reading
6729 * it from the B-tree and caching it if necessary. Note that there may be more
6730 * extents which overlap the given range after the returned extent_map.
6732 * If @page is not NULL and the extent is inline, this also reads the extent
6733 * data directly into the page and marks the extent up to date in the io_tree.
6735 * Return: ERR_PTR on error, non-NULL extent_map on success.
6737 struct extent_map *btrfs_get_extent(struct btrfs_inode *inode,
6738 struct page *page, size_t pg_offset,
6741 struct btrfs_fs_info *fs_info = inode->root->fs_info;
6743 u64 extent_start = 0;
6745 u64 objectid = btrfs_ino(inode);
6746 int extent_type = -1;
6747 struct btrfs_path *path = NULL;
6748 struct btrfs_root *root = inode->root;
6749 struct btrfs_file_extent_item *item;
6750 struct extent_buffer *leaf;
6751 struct btrfs_key found_key;
6752 struct extent_map *em = NULL;
6753 struct extent_map_tree *em_tree = &inode->extent_tree;
6755 read_lock(&em_tree->lock);
6756 em = lookup_extent_mapping(em_tree, start, len);
6757 read_unlock(&em_tree->lock);
6760 if (em->start > start || em->start + em->len <= start)
6761 free_extent_map(em);
6762 else if (em->block_start == EXTENT_MAP_INLINE && page)
6763 free_extent_map(em);
6767 em = alloc_extent_map();
6772 em->start = EXTENT_MAP_HOLE;
6773 em->orig_start = EXTENT_MAP_HOLE;
6775 em->block_len = (u64)-1;
6777 path = btrfs_alloc_path();
6783 /* Chances are we'll be called again, so go ahead and do readahead */
6784 path->reada = READA_FORWARD;
6787 * The same explanation in load_free_space_cache applies here as well,
6788 * we only read when we're loading the free space cache, and at that
6789 * point the commit_root has everything we need.
6791 if (btrfs_is_free_space_inode(inode)) {
6792 path->search_commit_root = 1;
6793 path->skip_locking = 1;
6796 ret = btrfs_lookup_file_extent(NULL, root, path, objectid, start, 0);
6799 } else if (ret > 0) {
6800 if (path->slots[0] == 0)
6806 leaf = path->nodes[0];
6807 item = btrfs_item_ptr(leaf, path->slots[0],
6808 struct btrfs_file_extent_item);
6809 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
6810 if (found_key.objectid != objectid ||
6811 found_key.type != BTRFS_EXTENT_DATA_KEY) {
6813 * If we backup past the first extent we want to move forward
6814 * and see if there is an extent in front of us, otherwise we'll
6815 * say there is a hole for our whole search range which can
6822 extent_type = btrfs_file_extent_type(leaf, item);
6823 extent_start = found_key.offset;
6824 extent_end = btrfs_file_extent_end(path);
6825 if (extent_type == BTRFS_FILE_EXTENT_REG ||
6826 extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
6827 /* Only regular file could have regular/prealloc extent */
6828 if (!S_ISREG(inode->vfs_inode.i_mode)) {
6831 "regular/prealloc extent found for non-regular inode %llu",
6835 trace_btrfs_get_extent_show_fi_regular(inode, leaf, item,
6837 } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
6838 trace_btrfs_get_extent_show_fi_inline(inode, leaf, item,
6843 if (start >= extent_end) {
6845 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
6846 ret = btrfs_next_leaf(root, path);
6852 leaf = path->nodes[0];
6854 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
6855 if (found_key.objectid != objectid ||
6856 found_key.type != BTRFS_EXTENT_DATA_KEY)
6858 if (start + len <= found_key.offset)
6860 if (start > found_key.offset)
6863 /* New extent overlaps with existing one */
6865 em->orig_start = start;
6866 em->len = found_key.offset - start;
6867 em->block_start = EXTENT_MAP_HOLE;
6871 btrfs_extent_item_to_extent_map(inode, path, item, em);
6873 if (extent_type == BTRFS_FILE_EXTENT_REG ||
6874 extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
6876 } else if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
6878 * Inline extent can only exist at file offset 0. This is
6879 * ensured by tree-checker and inline extent creation path.
6880 * Thus all members representing file offsets should be zero.
6882 ASSERT(pg_offset == 0);
6883 ASSERT(extent_start == 0);
6884 ASSERT(em->start == 0);
6887 * btrfs_extent_item_to_extent_map() should have properly
6888 * initialized em members already.
6890 * Other members are not utilized for inline extents.
6892 ASSERT(em->block_start == EXTENT_MAP_INLINE);
6893 ASSERT(em->len == fs_info->sectorsize);
6895 ret = read_inline_extent(inode, path, page);
6902 em->orig_start = start;
6904 em->block_start = EXTENT_MAP_HOLE;
6907 btrfs_release_path(path);
6908 if (em->start > start || extent_map_end(em) <= start) {
6910 "bad extent! em: [%llu %llu] passed [%llu %llu]",
6911 em->start, em->len, start, len);
6916 write_lock(&em_tree->lock);
6917 ret = btrfs_add_extent_mapping(fs_info, em_tree, &em, start, len);
6918 write_unlock(&em_tree->lock);
6920 btrfs_free_path(path);
6922 trace_btrfs_get_extent(root, inode, em);
6925 free_extent_map(em);
6926 return ERR_PTR(ret);
6931 static struct extent_map *btrfs_create_dio_extent(struct btrfs_inode *inode,
6932 struct btrfs_dio_data *dio_data,
6935 const u64 orig_start,
6936 const u64 block_start,
6937 const u64 block_len,
6938 const u64 orig_block_len,
6939 const u64 ram_bytes,
6942 struct extent_map *em = NULL;
6943 struct btrfs_ordered_extent *ordered;
6945 if (type != BTRFS_ORDERED_NOCOW) {
6946 em = create_io_em(inode, start, len, orig_start, block_start,
6947 block_len, orig_block_len, ram_bytes,
6948 BTRFS_COMPRESS_NONE, /* compress_type */
6953 ordered = btrfs_alloc_ordered_extent(inode, start, len, len,
6954 block_start, block_len, 0,
6956 (1 << BTRFS_ORDERED_DIRECT),
6957 BTRFS_COMPRESS_NONE);
6958 if (IS_ERR(ordered)) {
6960 free_extent_map(em);
6961 btrfs_drop_extent_map_range(inode, start,
6962 start + len - 1, false);
6964 em = ERR_CAST(ordered);
6966 ASSERT(!dio_data->ordered);
6967 dio_data->ordered = ordered;
6974 static struct extent_map *btrfs_new_extent_direct(struct btrfs_inode *inode,
6975 struct btrfs_dio_data *dio_data,
6978 struct btrfs_root *root = inode->root;
6979 struct btrfs_fs_info *fs_info = root->fs_info;
6980 struct extent_map *em;
6981 struct btrfs_key ins;
6985 alloc_hint = get_extent_allocation_hint(inode, start, len);
6986 ret = btrfs_reserve_extent(root, len, len, fs_info->sectorsize,
6987 0, alloc_hint, &ins, 1, 1);
6989 return ERR_PTR(ret);
6991 em = btrfs_create_dio_extent(inode, dio_data, start, ins.offset, start,
6992 ins.objectid, ins.offset, ins.offset,
6993 ins.offset, BTRFS_ORDERED_REGULAR);
6994 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
6996 btrfs_free_reserved_extent(fs_info, ins.objectid, ins.offset,
7002 static bool btrfs_extent_readonly(struct btrfs_fs_info *fs_info, u64 bytenr)
7004 struct btrfs_block_group *block_group;
7005 bool readonly = false;
7007 block_group = btrfs_lookup_block_group(fs_info, bytenr);
7008 if (!block_group || block_group->ro)
7011 btrfs_put_block_group(block_group);
7016 * Check if we can do nocow write into the range [@offset, @offset + @len)
7018 * @offset: File offset
7019 * @len: The length to write, will be updated to the nocow writeable
7021 * @orig_start: (optional) Return the original file offset of the file extent
7022 * @orig_len: (optional) Return the original on-disk length of the file extent
7023 * @ram_bytes: (optional) Return the ram_bytes of the file extent
7024 * @strict: if true, omit optimizations that might force us into unnecessary
7025 * cow. e.g., don't trust generation number.
7028 * >0 and update @len if we can do nocow write
7029 * 0 if we can't do nocow write
7030 * <0 if error happened
7032 * NOTE: This only checks the file extents, caller is responsible to wait for
7033 * any ordered extents.
7035 noinline int can_nocow_extent(struct inode *inode, u64 offset, u64 *len,
7036 u64 *orig_start, u64 *orig_block_len,
7037 u64 *ram_bytes, bool nowait, bool strict)
7039 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
7040 struct can_nocow_file_extent_args nocow_args = { 0 };
7041 struct btrfs_path *path;
7043 struct extent_buffer *leaf;
7044 struct btrfs_root *root = BTRFS_I(inode)->root;
7045 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
7046 struct btrfs_file_extent_item *fi;
7047 struct btrfs_key key;
7050 path = btrfs_alloc_path();
7053 path->nowait = nowait;
7055 ret = btrfs_lookup_file_extent(NULL, root, path,
7056 btrfs_ino(BTRFS_I(inode)), offset, 0);
7061 if (path->slots[0] == 0) {
7062 /* can't find the item, must cow */
7069 leaf = path->nodes[0];
7070 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
7071 if (key.objectid != btrfs_ino(BTRFS_I(inode)) ||
7072 key.type != BTRFS_EXTENT_DATA_KEY) {
7073 /* not our file or wrong item type, must cow */
7077 if (key.offset > offset) {
7078 /* Wrong offset, must cow */
7082 if (btrfs_file_extent_end(path) <= offset)
7085 fi = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_file_extent_item);
7086 found_type = btrfs_file_extent_type(leaf, fi);
7088 *ram_bytes = btrfs_file_extent_ram_bytes(leaf, fi);
7090 nocow_args.start = offset;
7091 nocow_args.end = offset + *len - 1;
7092 nocow_args.strict = strict;
7093 nocow_args.free_path = true;
7095 ret = can_nocow_file_extent(path, &key, BTRFS_I(inode), &nocow_args);
7096 /* can_nocow_file_extent() has freed the path. */
7100 /* Treat errors as not being able to NOCOW. */
7106 if (btrfs_extent_readonly(fs_info, nocow_args.disk_bytenr))
7109 if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW) &&
7110 found_type == BTRFS_FILE_EXTENT_PREALLOC) {
7113 range_end = round_up(offset + nocow_args.num_bytes,
7114 root->fs_info->sectorsize) - 1;
7115 ret = test_range_bit(io_tree, offset, range_end,
7116 EXTENT_DELALLOC, 0, NULL);
7124 *orig_start = key.offset - nocow_args.extent_offset;
7126 *orig_block_len = nocow_args.disk_num_bytes;
7128 *len = nocow_args.num_bytes;
7131 btrfs_free_path(path);
7135 static int lock_extent_direct(struct inode *inode, u64 lockstart, u64 lockend,
7136 struct extent_state **cached_state,
7137 unsigned int iomap_flags)
7139 const bool writing = (iomap_flags & IOMAP_WRITE);
7140 const bool nowait = (iomap_flags & IOMAP_NOWAIT);
7141 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
7142 struct btrfs_ordered_extent *ordered;
7147 if (!try_lock_extent(io_tree, lockstart, lockend,
7151 lock_extent(io_tree, lockstart, lockend, cached_state);
7154 * We're concerned with the entire range that we're going to be
7155 * doing DIO to, so we need to make sure there's no ordered
7156 * extents in this range.
7158 ordered = btrfs_lookup_ordered_range(BTRFS_I(inode), lockstart,
7159 lockend - lockstart + 1);
7162 * We need to make sure there are no buffered pages in this
7163 * range either, we could have raced between the invalidate in
7164 * generic_file_direct_write and locking the extent. The
7165 * invalidate needs to happen so that reads after a write do not
7169 (!writing || !filemap_range_has_page(inode->i_mapping,
7170 lockstart, lockend)))
7173 unlock_extent(io_tree, lockstart, lockend, cached_state);
7177 btrfs_put_ordered_extent(ordered);
7182 * If we are doing a DIO read and the ordered extent we
7183 * found is for a buffered write, we can not wait for it
7184 * to complete and retry, because if we do so we can
7185 * deadlock with concurrent buffered writes on page
7186 * locks. This happens only if our DIO read covers more
7187 * than one extent map, if at this point has already
7188 * created an ordered extent for a previous extent map
7189 * and locked its range in the inode's io tree, and a
7190 * concurrent write against that previous extent map's
7191 * range and this range started (we unlock the ranges
7192 * in the io tree only when the bios complete and
7193 * buffered writes always lock pages before attempting
7194 * to lock range in the io tree).
7197 test_bit(BTRFS_ORDERED_DIRECT, &ordered->flags))
7198 btrfs_start_ordered_extent(ordered);
7200 ret = nowait ? -EAGAIN : -ENOTBLK;
7201 btrfs_put_ordered_extent(ordered);
7204 * We could trigger writeback for this range (and wait
7205 * for it to complete) and then invalidate the pages for
7206 * this range (through invalidate_inode_pages2_range()),
7207 * but that can lead us to a deadlock with a concurrent
7208 * call to readahead (a buffered read or a defrag call
7209 * triggered a readahead) on a page lock due to an
7210 * ordered dio extent we created before but did not have
7211 * yet a corresponding bio submitted (whence it can not
7212 * complete), which makes readahead wait for that
7213 * ordered extent to complete while holding a lock on
7216 ret = nowait ? -EAGAIN : -ENOTBLK;
7228 /* The callers of this must take lock_extent() */
7229 static struct extent_map *create_io_em(struct btrfs_inode *inode, u64 start,
7230 u64 len, u64 orig_start, u64 block_start,
7231 u64 block_len, u64 orig_block_len,
7232 u64 ram_bytes, int compress_type,
7235 struct extent_map *em;
7238 ASSERT(type == BTRFS_ORDERED_PREALLOC ||
7239 type == BTRFS_ORDERED_COMPRESSED ||
7240 type == BTRFS_ORDERED_NOCOW ||
7241 type == BTRFS_ORDERED_REGULAR);
7243 em = alloc_extent_map();
7245 return ERR_PTR(-ENOMEM);
7248 em->orig_start = orig_start;
7250 em->block_len = block_len;
7251 em->block_start = block_start;
7252 em->orig_block_len = orig_block_len;
7253 em->ram_bytes = ram_bytes;
7254 em->generation = -1;
7255 set_bit(EXTENT_FLAG_PINNED, &em->flags);
7256 if (type == BTRFS_ORDERED_PREALLOC) {
7257 set_bit(EXTENT_FLAG_FILLING, &em->flags);
7258 } else if (type == BTRFS_ORDERED_COMPRESSED) {
7259 set_bit(EXTENT_FLAG_COMPRESSED, &em->flags);
7260 em->compress_type = compress_type;
7263 ret = btrfs_replace_extent_map_range(inode, em, true);
7265 free_extent_map(em);
7266 return ERR_PTR(ret);
7269 /* em got 2 refs now, callers needs to do free_extent_map once. */
7274 static int btrfs_get_blocks_direct_write(struct extent_map **map,
7275 struct inode *inode,
7276 struct btrfs_dio_data *dio_data,
7277 u64 start, u64 *lenp,
7278 unsigned int iomap_flags)
7280 const bool nowait = (iomap_flags & IOMAP_NOWAIT);
7281 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
7282 struct extent_map *em = *map;
7284 u64 block_start, orig_start, orig_block_len, ram_bytes;
7285 struct btrfs_block_group *bg;
7286 bool can_nocow = false;
7287 bool space_reserved = false;
7293 * We don't allocate a new extent in the following cases
7295 * 1) The inode is marked as NODATACOW. In this case we'll just use the
7297 * 2) The extent is marked as PREALLOC. We're good to go here and can
7298 * just use the extent.
7301 if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags) ||
7302 ((BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW) &&
7303 em->block_start != EXTENT_MAP_HOLE)) {
7304 if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags))
7305 type = BTRFS_ORDERED_PREALLOC;
7307 type = BTRFS_ORDERED_NOCOW;
7308 len = min(len, em->len - (start - em->start));
7309 block_start = em->block_start + (start - em->start);
7311 if (can_nocow_extent(inode, start, &len, &orig_start,
7312 &orig_block_len, &ram_bytes, false, false) == 1) {
7313 bg = btrfs_inc_nocow_writers(fs_info, block_start);
7321 struct extent_map *em2;
7323 /* We can NOCOW, so only need to reserve metadata space. */
7324 ret = btrfs_delalloc_reserve_metadata(BTRFS_I(inode), len, len,
7327 /* Our caller expects us to free the input extent map. */
7328 free_extent_map(em);
7330 btrfs_dec_nocow_writers(bg);
7331 if (nowait && (ret == -ENOSPC || ret == -EDQUOT))
7335 space_reserved = true;
7337 em2 = btrfs_create_dio_extent(BTRFS_I(inode), dio_data, start, len,
7338 orig_start, block_start,
7339 len, orig_block_len,
7341 btrfs_dec_nocow_writers(bg);
7342 if (type == BTRFS_ORDERED_PREALLOC) {
7343 free_extent_map(em);
7353 dio_data->nocow_done = true;
7355 /* Our caller expects us to free the input extent map. */
7356 free_extent_map(em);
7365 * If we could not allocate data space before locking the file
7366 * range and we can't do a NOCOW write, then we have to fail.
7368 if (!dio_data->data_space_reserved) {
7374 * We have to COW and we have already reserved data space before,
7375 * so now we reserve only metadata.
7377 ret = btrfs_delalloc_reserve_metadata(BTRFS_I(inode), len, len,
7381 space_reserved = true;
7383 em = btrfs_new_extent_direct(BTRFS_I(inode), dio_data, start, len);
7389 len = min(len, em->len - (start - em->start));
7391 btrfs_delalloc_release_metadata(BTRFS_I(inode),
7392 prev_len - len, true);
7396 * We have created our ordered extent, so we can now release our reservation
7397 * for an outstanding extent.
7399 btrfs_delalloc_release_extents(BTRFS_I(inode), prev_len);
7402 * Need to update the i_size under the extent lock so buffered
7403 * readers will get the updated i_size when we unlock.
7405 if (start + len > i_size_read(inode))
7406 i_size_write(inode, start + len);
7408 if (ret && space_reserved) {
7409 btrfs_delalloc_release_extents(BTRFS_I(inode), len);
7410 btrfs_delalloc_release_metadata(BTRFS_I(inode), len, true);
7416 static int btrfs_dio_iomap_begin(struct inode *inode, loff_t start,
7417 loff_t length, unsigned int flags, struct iomap *iomap,
7418 struct iomap *srcmap)
7420 struct iomap_iter *iter = container_of(iomap, struct iomap_iter, iomap);
7421 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
7422 struct extent_map *em;
7423 struct extent_state *cached_state = NULL;
7424 struct btrfs_dio_data *dio_data = iter->private;
7425 u64 lockstart, lockend;
7426 const bool write = !!(flags & IOMAP_WRITE);
7429 const u64 data_alloc_len = length;
7430 bool unlock_extents = false;
7433 * We could potentially fault if we have a buffer > PAGE_SIZE, and if
7434 * we're NOWAIT we may submit a bio for a partial range and return
7435 * EIOCBQUEUED, which would result in an errant short read.
7437 * The best way to handle this would be to allow for partial completions
7438 * of iocb's, so we could submit the partial bio, return and fault in
7439 * the rest of the pages, and then submit the io for the rest of the
7440 * range. However we don't have that currently, so simply return
7441 * -EAGAIN at this point so that the normal path is used.
7443 if (!write && (flags & IOMAP_NOWAIT) && length > PAGE_SIZE)
7447 * Cap the size of reads to that usually seen in buffered I/O as we need
7448 * to allocate a contiguous array for the checksums.
7451 len = min_t(u64, len, fs_info->sectorsize * BTRFS_MAX_BIO_SECTORS);
7454 lockend = start + len - 1;
7457 * iomap_dio_rw() only does filemap_write_and_wait_range(), which isn't
7458 * enough if we've written compressed pages to this area, so we need to
7459 * flush the dirty pages again to make absolutely sure that any
7460 * outstanding dirty pages are on disk - the first flush only starts
7461 * compression on the data, while keeping the pages locked, so by the
7462 * time the second flush returns we know bios for the compressed pages
7463 * were submitted and finished, and the pages no longer under writeback.
7465 * If we have a NOWAIT request and we have any pages in the range that
7466 * are locked, likely due to compression still in progress, we don't want
7467 * to block on page locks. We also don't want to block on pages marked as
7468 * dirty or under writeback (same as for the non-compression case).
7469 * iomap_dio_rw() did the same check, but after that and before we got
7470 * here, mmap'ed writes may have happened or buffered reads started
7471 * (readpage() and readahead(), which lock pages), as we haven't locked
7472 * the file range yet.
7474 if (test_bit(BTRFS_INODE_HAS_ASYNC_EXTENT,
7475 &BTRFS_I(inode)->runtime_flags)) {
7476 if (flags & IOMAP_NOWAIT) {
7477 if (filemap_range_needs_writeback(inode->i_mapping,
7478 lockstart, lockend))
7481 ret = filemap_fdatawrite_range(inode->i_mapping, start,
7482 start + length - 1);
7488 memset(dio_data, 0, sizeof(*dio_data));
7491 * We always try to allocate data space and must do it before locking
7492 * the file range, to avoid deadlocks with concurrent writes to the same
7493 * range if the range has several extents and the writes don't expand the
7494 * current i_size (the inode lock is taken in shared mode). If we fail to
7495 * allocate data space here we continue and later, after locking the
7496 * file range, we fail with ENOSPC only if we figure out we can not do a
7499 if (write && !(flags & IOMAP_NOWAIT)) {
7500 ret = btrfs_check_data_free_space(BTRFS_I(inode),
7501 &dio_data->data_reserved,
7502 start, data_alloc_len, false);
7504 dio_data->data_space_reserved = true;
7505 else if (ret && !(BTRFS_I(inode)->flags &
7506 (BTRFS_INODE_NODATACOW | BTRFS_INODE_PREALLOC)))
7511 * If this errors out it's because we couldn't invalidate pagecache for
7512 * this range and we need to fallback to buffered IO, or we are doing a
7513 * NOWAIT read/write and we need to block.
7515 ret = lock_extent_direct(inode, lockstart, lockend, &cached_state, flags);
7519 em = btrfs_get_extent(BTRFS_I(inode), NULL, 0, start, len);
7526 * Ok for INLINE and COMPRESSED extents we need to fallback on buffered
7527 * io. INLINE is special, and we could probably kludge it in here, but
7528 * it's still buffered so for safety lets just fall back to the generic
7531 * For COMPRESSED we _have_ to read the entire extent in so we can
7532 * decompress it, so there will be buffering required no matter what we
7533 * do, so go ahead and fallback to buffered.
7535 * We return -ENOTBLK because that's what makes DIO go ahead and go back
7536 * to buffered IO. Don't blame me, this is the price we pay for using
7539 if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags) ||
7540 em->block_start == EXTENT_MAP_INLINE) {
7541 free_extent_map(em);
7543 * If we are in a NOWAIT context, return -EAGAIN in order to
7544 * fallback to buffered IO. This is not only because we can
7545 * block with buffered IO (no support for NOWAIT semantics at
7546 * the moment) but also to avoid returning short reads to user
7547 * space - this happens if we were able to read some data from
7548 * previous non-compressed extents and then when we fallback to
7549 * buffered IO, at btrfs_file_read_iter() by calling
7550 * filemap_read(), we fail to fault in pages for the read buffer,
7551 * in which case filemap_read() returns a short read (the number
7552 * of bytes previously read is > 0, so it does not return -EFAULT).
7554 ret = (flags & IOMAP_NOWAIT) ? -EAGAIN : -ENOTBLK;
7558 len = min(len, em->len - (start - em->start));
7561 * If we have a NOWAIT request and the range contains multiple extents
7562 * (or a mix of extents and holes), then we return -EAGAIN to make the
7563 * caller fallback to a context where it can do a blocking (without
7564 * NOWAIT) request. This way we avoid doing partial IO and returning
7565 * success to the caller, which is not optimal for writes and for reads
7566 * it can result in unexpected behaviour for an application.
7568 * When doing a read, because we use IOMAP_DIO_PARTIAL when calling
7569 * iomap_dio_rw(), we can end up returning less data then what the caller
7570 * asked for, resulting in an unexpected, and incorrect, short read.
7571 * That is, the caller asked to read N bytes and we return less than that,
7572 * which is wrong unless we are crossing EOF. This happens if we get a
7573 * page fault error when trying to fault in pages for the buffer that is
7574 * associated to the struct iov_iter passed to iomap_dio_rw(), and we
7575 * have previously submitted bios for other extents in the range, in
7576 * which case iomap_dio_rw() may return us EIOCBQUEUED if not all of
7577 * those bios have completed by the time we get the page fault error,
7578 * which we return back to our caller - we should only return EIOCBQUEUED
7579 * after we have submitted bios for all the extents in the range.
7581 if ((flags & IOMAP_NOWAIT) && len < length) {
7582 free_extent_map(em);
7588 ret = btrfs_get_blocks_direct_write(&em, inode, dio_data,
7589 start, &len, flags);
7592 unlock_extents = true;
7593 /* Recalc len in case the new em is smaller than requested */
7594 len = min(len, em->len - (start - em->start));
7595 if (dio_data->data_space_reserved) {
7597 u64 release_len = 0;
7599 if (dio_data->nocow_done) {
7600 release_offset = start;
7601 release_len = data_alloc_len;
7602 } else if (len < data_alloc_len) {
7603 release_offset = start + len;
7604 release_len = data_alloc_len - len;
7607 if (release_len > 0)
7608 btrfs_free_reserved_data_space(BTRFS_I(inode),
7609 dio_data->data_reserved,
7615 * We need to unlock only the end area that we aren't using.
7616 * The rest is going to be unlocked by the endio routine.
7618 lockstart = start + len;
7619 if (lockstart < lockend)
7620 unlock_extents = true;
7624 unlock_extent(&BTRFS_I(inode)->io_tree, lockstart, lockend,
7627 free_extent_state(cached_state);
7630 * Translate extent map information to iomap.
7631 * We trim the extents (and move the addr) even though iomap code does
7632 * that, since we have locked only the parts we are performing I/O in.
7634 if ((em->block_start == EXTENT_MAP_HOLE) ||
7635 (test_bit(EXTENT_FLAG_PREALLOC, &em->flags) && !write)) {
7636 iomap->addr = IOMAP_NULL_ADDR;
7637 iomap->type = IOMAP_HOLE;
7639 iomap->addr = em->block_start + (start - em->start);
7640 iomap->type = IOMAP_MAPPED;
7642 iomap->offset = start;
7643 iomap->bdev = fs_info->fs_devices->latest_dev->bdev;
7644 iomap->length = len;
7645 free_extent_map(em);
7650 unlock_extent(&BTRFS_I(inode)->io_tree, lockstart, lockend,
7653 if (dio_data->data_space_reserved) {
7654 btrfs_free_reserved_data_space(BTRFS_I(inode),
7655 dio_data->data_reserved,
7656 start, data_alloc_len);
7657 extent_changeset_free(dio_data->data_reserved);
7663 static int btrfs_dio_iomap_end(struct inode *inode, loff_t pos, loff_t length,
7664 ssize_t written, unsigned int flags, struct iomap *iomap)
7666 struct iomap_iter *iter = container_of(iomap, struct iomap_iter, iomap);
7667 struct btrfs_dio_data *dio_data = iter->private;
7668 size_t submitted = dio_data->submitted;
7669 const bool write = !!(flags & IOMAP_WRITE);
7672 if (!write && (iomap->type == IOMAP_HOLE)) {
7673 /* If reading from a hole, unlock and return */
7674 unlock_extent(&BTRFS_I(inode)->io_tree, pos, pos + length - 1,
7679 if (submitted < length) {
7681 length -= submitted;
7683 btrfs_finish_ordered_extent(dio_data->ordered, NULL,
7684 pos, length, false);
7686 unlock_extent(&BTRFS_I(inode)->io_tree, pos,
7687 pos + length - 1, NULL);
7691 btrfs_put_ordered_extent(dio_data->ordered);
7692 dio_data->ordered = NULL;
7696 extent_changeset_free(dio_data->data_reserved);
7700 static void btrfs_dio_end_io(struct btrfs_bio *bbio)
7702 struct btrfs_dio_private *dip =
7703 container_of(bbio, struct btrfs_dio_private, bbio);
7704 struct btrfs_inode *inode = bbio->inode;
7705 struct bio *bio = &bbio->bio;
7707 if (bio->bi_status) {
7708 btrfs_warn(inode->root->fs_info,
7709 "direct IO failed ino %llu op 0x%0x offset %#llx len %u err no %d",
7710 btrfs_ino(inode), bio->bi_opf,
7711 dip->file_offset, dip->bytes, bio->bi_status);
7714 if (btrfs_op(bio) == BTRFS_MAP_WRITE) {
7715 btrfs_finish_ordered_extent(bbio->ordered, NULL,
7716 dip->file_offset, dip->bytes,
7719 unlock_extent(&inode->io_tree, dip->file_offset,
7720 dip->file_offset + dip->bytes - 1, NULL);
7723 bbio->bio.bi_private = bbio->private;
7724 iomap_dio_bio_end_io(bio);
7727 static void btrfs_dio_submit_io(const struct iomap_iter *iter, struct bio *bio,
7730 struct btrfs_bio *bbio = btrfs_bio(bio);
7731 struct btrfs_dio_private *dip =
7732 container_of(bbio, struct btrfs_dio_private, bbio);
7733 struct btrfs_dio_data *dio_data = iter->private;
7735 btrfs_bio_init(bbio, BTRFS_I(iter->inode)->root->fs_info,
7736 btrfs_dio_end_io, bio->bi_private);
7737 bbio->inode = BTRFS_I(iter->inode);
7738 bbio->file_offset = file_offset;
7740 dip->file_offset = file_offset;
7741 dip->bytes = bio->bi_iter.bi_size;
7743 dio_data->submitted += bio->bi_iter.bi_size;
7746 * Check if we are doing a partial write. If we are, we need to split
7747 * the ordered extent to match the submitted bio. Hang on to the
7748 * remaining unfinishable ordered_extent in dio_data so that it can be
7749 * cancelled in iomap_end to avoid a deadlock wherein faulting the
7750 * remaining pages is blocked on the outstanding ordered extent.
7752 if (iter->flags & IOMAP_WRITE) {
7755 ret = btrfs_extract_ordered_extent(bbio, dio_data->ordered);
7757 btrfs_finish_ordered_extent(dio_data->ordered, NULL,
7758 file_offset, dip->bytes,
7760 bio->bi_status = errno_to_blk_status(ret);
7761 iomap_dio_bio_end_io(bio);
7766 btrfs_submit_bio(bbio, 0);
7769 static const struct iomap_ops btrfs_dio_iomap_ops = {
7770 .iomap_begin = btrfs_dio_iomap_begin,
7771 .iomap_end = btrfs_dio_iomap_end,
7774 static const struct iomap_dio_ops btrfs_dio_ops = {
7775 .submit_io = btrfs_dio_submit_io,
7776 .bio_set = &btrfs_dio_bioset,
7779 ssize_t btrfs_dio_read(struct kiocb *iocb, struct iov_iter *iter, size_t done_before)
7781 struct btrfs_dio_data data = { 0 };
7783 return iomap_dio_rw(iocb, iter, &btrfs_dio_iomap_ops, &btrfs_dio_ops,
7784 IOMAP_DIO_PARTIAL, &data, done_before);
7787 struct iomap_dio *btrfs_dio_write(struct kiocb *iocb, struct iov_iter *iter,
7790 struct btrfs_dio_data data = { 0 };
7792 return __iomap_dio_rw(iocb, iter, &btrfs_dio_iomap_ops, &btrfs_dio_ops,
7793 IOMAP_DIO_PARTIAL, &data, done_before);
7796 static int btrfs_fiemap(struct inode *inode, struct fiemap_extent_info *fieinfo,
7801 ret = fiemap_prep(inode, fieinfo, start, &len, 0);
7806 * fiemap_prep() called filemap_write_and_wait() for the whole possible
7807 * file range (0 to LLONG_MAX), but that is not enough if we have
7808 * compression enabled. The first filemap_fdatawrite_range() only kicks
7809 * in the compression of data (in an async thread) and will return
7810 * before the compression is done and writeback is started. A second
7811 * filemap_fdatawrite_range() is needed to wait for the compression to
7812 * complete and writeback to start. We also need to wait for ordered
7813 * extents to complete, because our fiemap implementation uses mainly
7814 * file extent items to list the extents, searching for extent maps
7815 * only for file ranges with holes or prealloc extents to figure out
7816 * if we have delalloc in those ranges.
7818 if (fieinfo->fi_flags & FIEMAP_FLAG_SYNC) {
7819 ret = btrfs_wait_ordered_range(inode, 0, LLONG_MAX);
7824 return extent_fiemap(BTRFS_I(inode), fieinfo, start, len);
7827 static int btrfs_writepages(struct address_space *mapping,
7828 struct writeback_control *wbc)
7830 return extent_writepages(mapping, wbc);
7833 static void btrfs_readahead(struct readahead_control *rac)
7835 extent_readahead(rac);
7839 * For release_folio() and invalidate_folio() we have a race window where
7840 * folio_end_writeback() is called but the subpage spinlock is not yet released.
7841 * If we continue to release/invalidate the page, we could cause use-after-free
7842 * for subpage spinlock. So this function is to spin and wait for subpage
7845 static void wait_subpage_spinlock(struct page *page)
7847 struct btrfs_fs_info *fs_info = btrfs_sb(page->mapping->host->i_sb);
7848 struct btrfs_subpage *subpage;
7850 if (!btrfs_is_subpage(fs_info, page))
7853 ASSERT(PagePrivate(page) && page->private);
7854 subpage = (struct btrfs_subpage *)page->private;
7857 * This may look insane as we just acquire the spinlock and release it,
7858 * without doing anything. But we just want to make sure no one is
7859 * still holding the subpage spinlock.
7860 * And since the page is not dirty nor writeback, and we have page
7861 * locked, the only possible way to hold a spinlock is from the endio
7862 * function to clear page writeback.
7864 * Here we just acquire the spinlock so that all existing callers
7865 * should exit and we're safe to release/invalidate the page.
7867 spin_lock_irq(&subpage->lock);
7868 spin_unlock_irq(&subpage->lock);
7871 static bool __btrfs_release_folio(struct folio *folio, gfp_t gfp_flags)
7873 int ret = try_release_extent_mapping(&folio->page, gfp_flags);
7876 wait_subpage_spinlock(&folio->page);
7877 clear_page_extent_mapped(&folio->page);
7882 static bool btrfs_release_folio(struct folio *folio, gfp_t gfp_flags)
7884 if (folio_test_writeback(folio) || folio_test_dirty(folio))
7886 return __btrfs_release_folio(folio, gfp_flags);
7889 #ifdef CONFIG_MIGRATION
7890 static int btrfs_migrate_folio(struct address_space *mapping,
7891 struct folio *dst, struct folio *src,
7892 enum migrate_mode mode)
7894 int ret = filemap_migrate_folio(mapping, dst, src, mode);
7896 if (ret != MIGRATEPAGE_SUCCESS)
7899 if (folio_test_ordered(src)) {
7900 folio_clear_ordered(src);
7901 folio_set_ordered(dst);
7904 return MIGRATEPAGE_SUCCESS;
7907 #define btrfs_migrate_folio NULL
7910 static void btrfs_invalidate_folio(struct folio *folio, size_t offset,
7913 struct btrfs_inode *inode = BTRFS_I(folio->mapping->host);
7914 struct btrfs_fs_info *fs_info = inode->root->fs_info;
7915 struct extent_io_tree *tree = &inode->io_tree;
7916 struct extent_state *cached_state = NULL;
7917 u64 page_start = folio_pos(folio);
7918 u64 page_end = page_start + folio_size(folio) - 1;
7920 int inode_evicting = inode->vfs_inode.i_state & I_FREEING;
7923 * We have folio locked so no new ordered extent can be created on this
7924 * page, nor bio can be submitted for this folio.
7926 * But already submitted bio can still be finished on this folio.
7927 * Furthermore, endio function won't skip folio which has Ordered
7928 * (Private2) already cleared, so it's possible for endio and
7929 * invalidate_folio to do the same ordered extent accounting twice
7932 * So here we wait for any submitted bios to finish, so that we won't
7933 * do double ordered extent accounting on the same folio.
7935 folio_wait_writeback(folio);
7936 wait_subpage_spinlock(&folio->page);
7939 * For subpage case, we have call sites like
7940 * btrfs_punch_hole_lock_range() which passes range not aligned to
7942 * If the range doesn't cover the full folio, we don't need to and
7943 * shouldn't clear page extent mapped, as folio->private can still
7944 * record subpage dirty bits for other part of the range.
7946 * For cases that invalidate the full folio even the range doesn't
7947 * cover the full folio, like invalidating the last folio, we're
7948 * still safe to wait for ordered extent to finish.
7950 if (!(offset == 0 && length == folio_size(folio))) {
7951 btrfs_release_folio(folio, GFP_NOFS);
7955 if (!inode_evicting)
7956 lock_extent(tree, page_start, page_end, &cached_state);
7959 while (cur < page_end) {
7960 struct btrfs_ordered_extent *ordered;
7963 u32 extra_flags = 0;
7965 ordered = btrfs_lookup_first_ordered_range(inode, cur,
7966 page_end + 1 - cur);
7968 range_end = page_end;
7970 * No ordered extent covering this range, we are safe
7971 * to delete all extent states in the range.
7973 extra_flags = EXTENT_CLEAR_ALL_BITS;
7976 if (ordered->file_offset > cur) {
7978 * There is a range between [cur, oe->file_offset) not
7979 * covered by any ordered extent.
7980 * We are safe to delete all extent states, and handle
7981 * the ordered extent in the next iteration.
7983 range_end = ordered->file_offset - 1;
7984 extra_flags = EXTENT_CLEAR_ALL_BITS;
7988 range_end = min(ordered->file_offset + ordered->num_bytes - 1,
7990 ASSERT(range_end + 1 - cur < U32_MAX);
7991 range_len = range_end + 1 - cur;
7992 if (!btrfs_page_test_ordered(fs_info, &folio->page, cur, range_len)) {
7994 * If Ordered (Private2) is cleared, it means endio has
7995 * already been executed for the range.
7996 * We can't delete the extent states as
7997 * btrfs_finish_ordered_io() may still use some of them.
8001 btrfs_page_clear_ordered(fs_info, &folio->page, cur, range_len);
8004 * IO on this page will never be started, so we need to account
8005 * for any ordered extents now. Don't clear EXTENT_DELALLOC_NEW
8006 * here, must leave that up for the ordered extent completion.
8008 * This will also unlock the range for incoming
8009 * btrfs_finish_ordered_io().
8011 if (!inode_evicting)
8012 clear_extent_bit(tree, cur, range_end,
8014 EXTENT_LOCKED | EXTENT_DO_ACCOUNTING |
8015 EXTENT_DEFRAG, &cached_state);
8017 spin_lock_irq(&inode->ordered_tree.lock);
8018 set_bit(BTRFS_ORDERED_TRUNCATED, &ordered->flags);
8019 ordered->truncated_len = min(ordered->truncated_len,
8020 cur - ordered->file_offset);
8021 spin_unlock_irq(&inode->ordered_tree.lock);
8024 * If the ordered extent has finished, we're safe to delete all
8025 * the extent states of the range, otherwise
8026 * btrfs_finish_ordered_io() will get executed by endio for
8027 * other pages, so we can't delete extent states.
8029 if (btrfs_dec_test_ordered_pending(inode, &ordered,
8030 cur, range_end + 1 - cur)) {
8031 btrfs_finish_ordered_io(ordered);
8033 * The ordered extent has finished, now we're again
8034 * safe to delete all extent states of the range.
8036 extra_flags = EXTENT_CLEAR_ALL_BITS;
8040 btrfs_put_ordered_extent(ordered);
8042 * Qgroup reserved space handler
8043 * Sector(s) here will be either:
8045 * 1) Already written to disk or bio already finished
8046 * Then its QGROUP_RESERVED bit in io_tree is already cleared.
8047 * Qgroup will be handled by its qgroup_record then.
8048 * btrfs_qgroup_free_data() call will do nothing here.
8050 * 2) Not written to disk yet
8051 * Then btrfs_qgroup_free_data() call will clear the
8052 * QGROUP_RESERVED bit of its io_tree, and free the qgroup
8053 * reserved data space.
8054 * Since the IO will never happen for this page.
8056 btrfs_qgroup_free_data(inode, NULL, cur, range_end + 1 - cur);
8057 if (!inode_evicting) {
8058 clear_extent_bit(tree, cur, range_end, EXTENT_LOCKED |
8059 EXTENT_DELALLOC | EXTENT_UPTODATE |
8060 EXTENT_DO_ACCOUNTING | EXTENT_DEFRAG |
8061 extra_flags, &cached_state);
8063 cur = range_end + 1;
8066 * We have iterated through all ordered extents of the page, the page
8067 * should not have Ordered (Private2) anymore, or the above iteration
8068 * did something wrong.
8070 ASSERT(!folio_test_ordered(folio));
8071 btrfs_page_clear_checked(fs_info, &folio->page, folio_pos(folio), folio_size(folio));
8072 if (!inode_evicting)
8073 __btrfs_release_folio(folio, GFP_NOFS);
8074 clear_page_extent_mapped(&folio->page);
8078 * btrfs_page_mkwrite() is not allowed to change the file size as it gets
8079 * called from a page fault handler when a page is first dirtied. Hence we must
8080 * be careful to check for EOF conditions here. We set the page up correctly
8081 * for a written page which means we get ENOSPC checking when writing into
8082 * holes and correct delalloc and unwritten extent mapping on filesystems that
8083 * support these features.
8085 * We are not allowed to take the i_mutex here so we have to play games to
8086 * protect against truncate races as the page could now be beyond EOF. Because
8087 * truncate_setsize() writes the inode size before removing pages, once we have
8088 * the page lock we can determine safely if the page is beyond EOF. If it is not
8089 * beyond EOF, then the page is guaranteed safe against truncation until we
8092 vm_fault_t btrfs_page_mkwrite(struct vm_fault *vmf)
8094 struct page *page = vmf->page;
8095 struct inode *inode = file_inode(vmf->vma->vm_file);
8096 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
8097 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
8098 struct btrfs_ordered_extent *ordered;
8099 struct extent_state *cached_state = NULL;
8100 struct extent_changeset *data_reserved = NULL;
8101 unsigned long zero_start;
8111 reserved_space = PAGE_SIZE;
8113 sb_start_pagefault(inode->i_sb);
8114 page_start = page_offset(page);
8115 page_end = page_start + PAGE_SIZE - 1;
8119 * Reserving delalloc space after obtaining the page lock can lead to
8120 * deadlock. For example, if a dirty page is locked by this function
8121 * and the call to btrfs_delalloc_reserve_space() ends up triggering
8122 * dirty page write out, then the btrfs_writepages() function could
8123 * end up waiting indefinitely to get a lock on the page currently
8124 * being processed by btrfs_page_mkwrite() function.
8126 ret2 = btrfs_delalloc_reserve_space(BTRFS_I(inode), &data_reserved,
8127 page_start, reserved_space);
8129 ret2 = file_update_time(vmf->vma->vm_file);
8133 ret = vmf_error(ret2);
8139 ret = VM_FAULT_NOPAGE; /* make the VM retry the fault */
8141 down_read(&BTRFS_I(inode)->i_mmap_lock);
8143 size = i_size_read(inode);
8145 if ((page->mapping != inode->i_mapping) ||
8146 (page_start >= size)) {
8147 /* page got truncated out from underneath us */
8150 wait_on_page_writeback(page);
8152 lock_extent(io_tree, page_start, page_end, &cached_state);
8153 ret2 = set_page_extent_mapped(page);
8155 ret = vmf_error(ret2);
8156 unlock_extent(io_tree, page_start, page_end, &cached_state);
8161 * we can't set the delalloc bits if there are pending ordered
8162 * extents. Drop our locks and wait for them to finish
8164 ordered = btrfs_lookup_ordered_range(BTRFS_I(inode), page_start,
8167 unlock_extent(io_tree, page_start, page_end, &cached_state);
8169 up_read(&BTRFS_I(inode)->i_mmap_lock);
8170 btrfs_start_ordered_extent(ordered);
8171 btrfs_put_ordered_extent(ordered);
8175 if (page->index == ((size - 1) >> PAGE_SHIFT)) {
8176 reserved_space = round_up(size - page_start,
8177 fs_info->sectorsize);
8178 if (reserved_space < PAGE_SIZE) {
8179 end = page_start + reserved_space - 1;
8180 btrfs_delalloc_release_space(BTRFS_I(inode),
8181 data_reserved, page_start,
8182 PAGE_SIZE - reserved_space, true);
8187 * page_mkwrite gets called when the page is firstly dirtied after it's
8188 * faulted in, but write(2) could also dirty a page and set delalloc
8189 * bits, thus in this case for space account reason, we still need to
8190 * clear any delalloc bits within this page range since we have to
8191 * reserve data&meta space before lock_page() (see above comments).
8193 clear_extent_bit(&BTRFS_I(inode)->io_tree, page_start, end,
8194 EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING |
8195 EXTENT_DEFRAG, &cached_state);
8197 ret2 = btrfs_set_extent_delalloc(BTRFS_I(inode), page_start, end, 0,
8200 unlock_extent(io_tree, page_start, page_end, &cached_state);
8201 ret = VM_FAULT_SIGBUS;
8205 /* page is wholly or partially inside EOF */
8206 if (page_start + PAGE_SIZE > size)
8207 zero_start = offset_in_page(size);
8209 zero_start = PAGE_SIZE;
8211 if (zero_start != PAGE_SIZE)
8212 memzero_page(page, zero_start, PAGE_SIZE - zero_start);
8214 btrfs_page_clear_checked(fs_info, page, page_start, PAGE_SIZE);
8215 btrfs_page_set_dirty(fs_info, page, page_start, end + 1 - page_start);
8216 btrfs_page_set_uptodate(fs_info, page, page_start, end + 1 - page_start);
8218 btrfs_set_inode_last_sub_trans(BTRFS_I(inode));
8220 unlock_extent(io_tree, page_start, page_end, &cached_state);
8221 up_read(&BTRFS_I(inode)->i_mmap_lock);
8223 btrfs_delalloc_release_extents(BTRFS_I(inode), PAGE_SIZE);
8224 sb_end_pagefault(inode->i_sb);
8225 extent_changeset_free(data_reserved);
8226 return VM_FAULT_LOCKED;
8230 up_read(&BTRFS_I(inode)->i_mmap_lock);
8232 btrfs_delalloc_release_extents(BTRFS_I(inode), PAGE_SIZE);
8233 btrfs_delalloc_release_space(BTRFS_I(inode), data_reserved, page_start,
8234 reserved_space, (ret != 0));
8236 sb_end_pagefault(inode->i_sb);
8237 extent_changeset_free(data_reserved);
8241 static int btrfs_truncate(struct btrfs_inode *inode, bool skip_writeback)
8243 struct btrfs_truncate_control control = {
8245 .ino = btrfs_ino(inode),
8246 .min_type = BTRFS_EXTENT_DATA_KEY,
8247 .clear_extent_range = true,
8249 struct btrfs_root *root = inode->root;
8250 struct btrfs_fs_info *fs_info = root->fs_info;
8251 struct btrfs_block_rsv *rsv;
8253 struct btrfs_trans_handle *trans;
8254 u64 mask = fs_info->sectorsize - 1;
8255 const u64 min_size = btrfs_calc_metadata_size(fs_info, 1);
8257 if (!skip_writeback) {
8258 ret = btrfs_wait_ordered_range(&inode->vfs_inode,
8259 inode->vfs_inode.i_size & (~mask),
8266 * Yes ladies and gentlemen, this is indeed ugly. We have a couple of
8267 * things going on here:
8269 * 1) We need to reserve space to update our inode.
8271 * 2) We need to have something to cache all the space that is going to
8272 * be free'd up by the truncate operation, but also have some slack
8273 * space reserved in case it uses space during the truncate (thank you
8274 * very much snapshotting).
8276 * And we need these to be separate. The fact is we can use a lot of
8277 * space doing the truncate, and we have no earthly idea how much space
8278 * we will use, so we need the truncate reservation to be separate so it
8279 * doesn't end up using space reserved for updating the inode. We also
8280 * need to be able to stop the transaction and start a new one, which
8281 * means we need to be able to update the inode several times, and we
8282 * have no idea of knowing how many times that will be, so we can't just
8283 * reserve 1 item for the entirety of the operation, so that has to be
8284 * done separately as well.
8286 * So that leaves us with
8288 * 1) rsv - for the truncate reservation, which we will steal from the
8289 * transaction reservation.
8290 * 2) fs_info->trans_block_rsv - this will have 1 items worth left for
8291 * updating the inode.
8293 rsv = btrfs_alloc_block_rsv(fs_info, BTRFS_BLOCK_RSV_TEMP);
8296 rsv->size = min_size;
8297 rsv->failfast = true;
8300 * 1 for the truncate slack space
8301 * 1 for updating the inode.
8303 trans = btrfs_start_transaction(root, 2);
8304 if (IS_ERR(trans)) {
8305 ret = PTR_ERR(trans);
8309 /* Migrate the slack space for the truncate to our reserve */
8310 ret = btrfs_block_rsv_migrate(&fs_info->trans_block_rsv, rsv,
8313 * We have reserved 2 metadata units when we started the transaction and
8314 * min_size matches 1 unit, so this should never fail, but if it does,
8315 * it's not critical we just fail truncation.
8318 btrfs_end_transaction(trans);
8322 trans->block_rsv = rsv;
8325 struct extent_state *cached_state = NULL;
8326 const u64 new_size = inode->vfs_inode.i_size;
8327 const u64 lock_start = ALIGN_DOWN(new_size, fs_info->sectorsize);
8329 control.new_size = new_size;
8330 lock_extent(&inode->io_tree, lock_start, (u64)-1, &cached_state);
8332 * We want to drop from the next block forward in case this new
8333 * size is not block aligned since we will be keeping the last
8334 * block of the extent just the way it is.
8336 btrfs_drop_extent_map_range(inode,
8337 ALIGN(new_size, fs_info->sectorsize),
8340 ret = btrfs_truncate_inode_items(trans, root, &control);
8342 inode_sub_bytes(&inode->vfs_inode, control.sub_bytes);
8343 btrfs_inode_safe_disk_i_size_write(inode, control.last_size);
8345 unlock_extent(&inode->io_tree, lock_start, (u64)-1, &cached_state);
8347 trans->block_rsv = &fs_info->trans_block_rsv;
8348 if (ret != -ENOSPC && ret != -EAGAIN)
8351 ret = btrfs_update_inode(trans, inode);
8355 btrfs_end_transaction(trans);
8356 btrfs_btree_balance_dirty(fs_info);
8358 trans = btrfs_start_transaction(root, 2);
8359 if (IS_ERR(trans)) {
8360 ret = PTR_ERR(trans);
8365 btrfs_block_rsv_release(fs_info, rsv, -1, NULL);
8366 ret = btrfs_block_rsv_migrate(&fs_info->trans_block_rsv,
8367 rsv, min_size, false);
8369 * We have reserved 2 metadata units when we started the
8370 * transaction and min_size matches 1 unit, so this should never
8371 * fail, but if it does, it's not critical we just fail truncation.
8376 trans->block_rsv = rsv;
8380 * We can't call btrfs_truncate_block inside a trans handle as we could
8381 * deadlock with freeze, if we got BTRFS_NEED_TRUNCATE_BLOCK then we
8382 * know we've truncated everything except the last little bit, and can
8383 * do btrfs_truncate_block and then update the disk_i_size.
8385 if (ret == BTRFS_NEED_TRUNCATE_BLOCK) {
8386 btrfs_end_transaction(trans);
8387 btrfs_btree_balance_dirty(fs_info);
8389 ret = btrfs_truncate_block(inode, inode->vfs_inode.i_size, 0, 0);
8392 trans = btrfs_start_transaction(root, 1);
8393 if (IS_ERR(trans)) {
8394 ret = PTR_ERR(trans);
8397 btrfs_inode_safe_disk_i_size_write(inode, 0);
8403 trans->block_rsv = &fs_info->trans_block_rsv;
8404 ret2 = btrfs_update_inode(trans, inode);
8408 ret2 = btrfs_end_transaction(trans);
8411 btrfs_btree_balance_dirty(fs_info);
8414 btrfs_free_block_rsv(fs_info, rsv);
8416 * So if we truncate and then write and fsync we normally would just
8417 * write the extents that changed, which is a problem if we need to
8418 * first truncate that entire inode. So set this flag so we write out
8419 * all of the extents in the inode to the sync log so we're completely
8422 * If no extents were dropped or trimmed we don't need to force the next
8423 * fsync to truncate all the inode's items from the log and re-log them
8424 * all. This means the truncate operation did not change the file size,
8425 * or changed it to a smaller size but there was only an implicit hole
8426 * between the old i_size and the new i_size, and there were no prealloc
8427 * extents beyond i_size to drop.
8429 if (control.extents_found > 0)
8430 btrfs_set_inode_full_sync(inode);
8435 struct inode *btrfs_new_subvol_inode(struct mnt_idmap *idmap,
8438 struct inode *inode;
8440 inode = new_inode(dir->i_sb);
8443 * Subvolumes don't inherit the sgid bit or the parent's gid if
8444 * the parent's sgid bit is set. This is probably a bug.
8446 inode_init_owner(idmap, inode, NULL,
8447 S_IFDIR | (~current_umask() & S_IRWXUGO));
8448 inode->i_op = &btrfs_dir_inode_operations;
8449 inode->i_fop = &btrfs_dir_file_operations;
8454 struct inode *btrfs_alloc_inode(struct super_block *sb)
8456 struct btrfs_fs_info *fs_info = btrfs_sb(sb);
8457 struct btrfs_inode *ei;
8458 struct inode *inode;
8460 ei = alloc_inode_sb(sb, btrfs_inode_cachep, GFP_KERNEL);
8467 ei->last_sub_trans = 0;
8468 ei->logged_trans = 0;
8469 ei->delalloc_bytes = 0;
8470 ei->new_delalloc_bytes = 0;
8471 ei->defrag_bytes = 0;
8472 ei->disk_i_size = 0;
8476 ei->index_cnt = (u64)-1;
8478 ei->last_unlink_trans = 0;
8479 ei->last_reflink_trans = 0;
8480 ei->last_log_commit = 0;
8482 spin_lock_init(&ei->lock);
8483 ei->outstanding_extents = 0;
8484 if (sb->s_magic != BTRFS_TEST_MAGIC)
8485 btrfs_init_metadata_block_rsv(fs_info, &ei->block_rsv,
8486 BTRFS_BLOCK_RSV_DELALLOC);
8487 ei->runtime_flags = 0;
8488 ei->prop_compress = BTRFS_COMPRESS_NONE;
8489 ei->defrag_compress = BTRFS_COMPRESS_NONE;
8491 ei->delayed_node = NULL;
8493 ei->i_otime.tv_sec = 0;
8494 ei->i_otime.tv_nsec = 0;
8496 inode = &ei->vfs_inode;
8497 extent_map_tree_init(&ei->extent_tree);
8498 extent_io_tree_init(fs_info, &ei->io_tree, IO_TREE_INODE_IO);
8499 ei->io_tree.inode = ei;
8500 extent_io_tree_init(fs_info, &ei->file_extent_tree,
8501 IO_TREE_INODE_FILE_EXTENT);
8502 mutex_init(&ei->log_mutex);
8503 btrfs_ordered_inode_tree_init(&ei->ordered_tree);
8504 INIT_LIST_HEAD(&ei->delalloc_inodes);
8505 INIT_LIST_HEAD(&ei->delayed_iput);
8506 RB_CLEAR_NODE(&ei->rb_node);
8507 init_rwsem(&ei->i_mmap_lock);
8512 #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
8513 void btrfs_test_destroy_inode(struct inode *inode)
8515 btrfs_drop_extent_map_range(BTRFS_I(inode), 0, (u64)-1, false);
8516 kmem_cache_free(btrfs_inode_cachep, BTRFS_I(inode));
8520 void btrfs_free_inode(struct inode *inode)
8522 kmem_cache_free(btrfs_inode_cachep, BTRFS_I(inode));
8525 void btrfs_destroy_inode(struct inode *vfs_inode)
8527 struct btrfs_ordered_extent *ordered;
8528 struct btrfs_inode *inode = BTRFS_I(vfs_inode);
8529 struct btrfs_root *root = inode->root;
8530 bool freespace_inode;
8532 WARN_ON(!hlist_empty(&vfs_inode->i_dentry));
8533 WARN_ON(vfs_inode->i_data.nrpages);
8534 WARN_ON(inode->block_rsv.reserved);
8535 WARN_ON(inode->block_rsv.size);
8536 WARN_ON(inode->outstanding_extents);
8537 if (!S_ISDIR(vfs_inode->i_mode)) {
8538 WARN_ON(inode->delalloc_bytes);
8539 WARN_ON(inode->new_delalloc_bytes);
8541 WARN_ON(inode->csum_bytes);
8542 WARN_ON(inode->defrag_bytes);
8545 * This can happen where we create an inode, but somebody else also
8546 * created the same inode and we need to destroy the one we already
8553 * If this is a free space inode do not take the ordered extents lockdep
8556 freespace_inode = btrfs_is_free_space_inode(inode);
8559 ordered = btrfs_lookup_first_ordered_extent(inode, (u64)-1);
8563 btrfs_err(root->fs_info,
8564 "found ordered extent %llu %llu on inode cleanup",
8565 ordered->file_offset, ordered->num_bytes);
8567 if (!freespace_inode)
8568 btrfs_lockdep_acquire(root->fs_info, btrfs_ordered_extent);
8570 btrfs_remove_ordered_extent(inode, ordered);
8571 btrfs_put_ordered_extent(ordered);
8572 btrfs_put_ordered_extent(ordered);
8575 btrfs_qgroup_check_reserved_leak(inode);
8576 inode_tree_del(inode);
8577 btrfs_drop_extent_map_range(inode, 0, (u64)-1, false);
8578 btrfs_inode_clear_file_extent_range(inode, 0, (u64)-1);
8579 btrfs_put_root(inode->root);
8582 int btrfs_drop_inode(struct inode *inode)
8584 struct btrfs_root *root = BTRFS_I(inode)->root;
8589 /* the snap/subvol tree is on deleting */
8590 if (btrfs_root_refs(&root->root_item) == 0)
8593 return generic_drop_inode(inode);
8596 static void init_once(void *foo)
8598 struct btrfs_inode *ei = foo;
8600 inode_init_once(&ei->vfs_inode);
8603 void __cold btrfs_destroy_cachep(void)
8606 * Make sure all delayed rcu free inodes are flushed before we
8610 bioset_exit(&btrfs_dio_bioset);
8611 kmem_cache_destroy(btrfs_inode_cachep);
8614 int __init btrfs_init_cachep(void)
8616 btrfs_inode_cachep = kmem_cache_create("btrfs_inode",
8617 sizeof(struct btrfs_inode), 0,
8618 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD | SLAB_ACCOUNT,
8620 if (!btrfs_inode_cachep)
8623 if (bioset_init(&btrfs_dio_bioset, BIO_POOL_SIZE,
8624 offsetof(struct btrfs_dio_private, bbio.bio),
8630 btrfs_destroy_cachep();
8634 static int btrfs_getattr(struct mnt_idmap *idmap,
8635 const struct path *path, struct kstat *stat,
8636 u32 request_mask, unsigned int flags)
8640 struct inode *inode = d_inode(path->dentry);
8641 u32 blocksize = inode->i_sb->s_blocksize;
8642 u32 bi_flags = BTRFS_I(inode)->flags;
8643 u32 bi_ro_flags = BTRFS_I(inode)->ro_flags;
8645 stat->result_mask |= STATX_BTIME;
8646 stat->btime.tv_sec = BTRFS_I(inode)->i_otime.tv_sec;
8647 stat->btime.tv_nsec = BTRFS_I(inode)->i_otime.tv_nsec;
8648 if (bi_flags & BTRFS_INODE_APPEND)
8649 stat->attributes |= STATX_ATTR_APPEND;
8650 if (bi_flags & BTRFS_INODE_COMPRESS)
8651 stat->attributes |= STATX_ATTR_COMPRESSED;
8652 if (bi_flags & BTRFS_INODE_IMMUTABLE)
8653 stat->attributes |= STATX_ATTR_IMMUTABLE;
8654 if (bi_flags & BTRFS_INODE_NODUMP)
8655 stat->attributes |= STATX_ATTR_NODUMP;
8656 if (bi_ro_flags & BTRFS_INODE_RO_VERITY)
8657 stat->attributes |= STATX_ATTR_VERITY;
8659 stat->attributes_mask |= (STATX_ATTR_APPEND |
8660 STATX_ATTR_COMPRESSED |
8661 STATX_ATTR_IMMUTABLE |
8664 generic_fillattr(idmap, request_mask, inode, stat);
8665 stat->dev = BTRFS_I(inode)->root->anon_dev;
8667 spin_lock(&BTRFS_I(inode)->lock);
8668 delalloc_bytes = BTRFS_I(inode)->new_delalloc_bytes;
8669 inode_bytes = inode_get_bytes(inode);
8670 spin_unlock(&BTRFS_I(inode)->lock);
8671 stat->blocks = (ALIGN(inode_bytes, blocksize) +
8672 ALIGN(delalloc_bytes, blocksize)) >> SECTOR_SHIFT;
8676 static int btrfs_rename_exchange(struct inode *old_dir,
8677 struct dentry *old_dentry,
8678 struct inode *new_dir,
8679 struct dentry *new_dentry)
8681 struct btrfs_fs_info *fs_info = btrfs_sb(old_dir->i_sb);
8682 struct btrfs_trans_handle *trans;
8683 unsigned int trans_num_items;
8684 struct btrfs_root *root = BTRFS_I(old_dir)->root;
8685 struct btrfs_root *dest = BTRFS_I(new_dir)->root;
8686 struct inode *new_inode = new_dentry->d_inode;
8687 struct inode *old_inode = old_dentry->d_inode;
8688 struct btrfs_rename_ctx old_rename_ctx;
8689 struct btrfs_rename_ctx new_rename_ctx;
8690 u64 old_ino = btrfs_ino(BTRFS_I(old_inode));
8691 u64 new_ino = btrfs_ino(BTRFS_I(new_inode));
8696 bool need_abort = false;
8697 struct fscrypt_name old_fname, new_fname;
8698 struct fscrypt_str *old_name, *new_name;
8701 * For non-subvolumes allow exchange only within one subvolume, in the
8702 * same inode namespace. Two subvolumes (represented as directory) can
8703 * be exchanged as they're a logical link and have a fixed inode number.
8706 (old_ino != BTRFS_FIRST_FREE_OBJECTID ||
8707 new_ino != BTRFS_FIRST_FREE_OBJECTID))
8710 ret = fscrypt_setup_filename(old_dir, &old_dentry->d_name, 0, &old_fname);
8714 ret = fscrypt_setup_filename(new_dir, &new_dentry->d_name, 0, &new_fname);
8716 fscrypt_free_filename(&old_fname);
8720 old_name = &old_fname.disk_name;
8721 new_name = &new_fname.disk_name;
8723 /* close the race window with snapshot create/destroy ioctl */
8724 if (old_ino == BTRFS_FIRST_FREE_OBJECTID ||
8725 new_ino == BTRFS_FIRST_FREE_OBJECTID)
8726 down_read(&fs_info->subvol_sem);
8730 * 1 to remove old dir item
8731 * 1 to remove old dir index
8732 * 1 to add new dir item
8733 * 1 to add new dir index
8734 * 1 to update parent inode
8736 * If the parents are the same, we only need to account for one
8738 trans_num_items = (old_dir == new_dir ? 9 : 10);
8739 if (old_ino == BTRFS_FIRST_FREE_OBJECTID) {
8741 * 1 to remove old root ref
8742 * 1 to remove old root backref
8743 * 1 to add new root ref
8744 * 1 to add new root backref
8746 trans_num_items += 4;
8749 * 1 to update inode item
8750 * 1 to remove old inode ref
8751 * 1 to add new inode ref
8753 trans_num_items += 3;
8755 if (new_ino == BTRFS_FIRST_FREE_OBJECTID)
8756 trans_num_items += 4;
8758 trans_num_items += 3;
8759 trans = btrfs_start_transaction(root, trans_num_items);
8760 if (IS_ERR(trans)) {
8761 ret = PTR_ERR(trans);
8766 ret = btrfs_record_root_in_trans(trans, dest);
8772 * We need to find a free sequence number both in the source and
8773 * in the destination directory for the exchange.
8775 ret = btrfs_set_inode_index(BTRFS_I(new_dir), &old_idx);
8778 ret = btrfs_set_inode_index(BTRFS_I(old_dir), &new_idx);
8782 BTRFS_I(old_inode)->dir_index = 0ULL;
8783 BTRFS_I(new_inode)->dir_index = 0ULL;
8785 /* Reference for the source. */
8786 if (old_ino == BTRFS_FIRST_FREE_OBJECTID) {
8787 /* force full log commit if subvolume involved. */
8788 btrfs_set_log_full_commit(trans);
8790 ret = btrfs_insert_inode_ref(trans, dest, new_name, old_ino,
8791 btrfs_ino(BTRFS_I(new_dir)),
8798 /* And now for the dest. */
8799 if (new_ino == BTRFS_FIRST_FREE_OBJECTID) {
8800 /* force full log commit if subvolume involved. */
8801 btrfs_set_log_full_commit(trans);
8803 ret = btrfs_insert_inode_ref(trans, root, old_name, new_ino,
8804 btrfs_ino(BTRFS_I(old_dir)),
8808 btrfs_abort_transaction(trans, ret);
8813 /* Update inode version and ctime/mtime. */
8814 inode_inc_iversion(old_dir);
8815 inode_inc_iversion(new_dir);
8816 inode_inc_iversion(old_inode);
8817 inode_inc_iversion(new_inode);
8818 simple_rename_timestamp(old_dir, old_dentry, new_dir, new_dentry);
8820 if (old_dentry->d_parent != new_dentry->d_parent) {
8821 btrfs_record_unlink_dir(trans, BTRFS_I(old_dir),
8822 BTRFS_I(old_inode), true);
8823 btrfs_record_unlink_dir(trans, BTRFS_I(new_dir),
8824 BTRFS_I(new_inode), true);
8827 /* src is a subvolume */
8828 if (old_ino == BTRFS_FIRST_FREE_OBJECTID) {
8829 ret = btrfs_unlink_subvol(trans, BTRFS_I(old_dir), old_dentry);
8830 } else { /* src is an inode */
8831 ret = __btrfs_unlink_inode(trans, BTRFS_I(old_dir),
8832 BTRFS_I(old_dentry->d_inode),
8833 old_name, &old_rename_ctx);
8835 ret = btrfs_update_inode(trans, BTRFS_I(old_inode));
8838 btrfs_abort_transaction(trans, ret);
8842 /* dest is a subvolume */
8843 if (new_ino == BTRFS_FIRST_FREE_OBJECTID) {
8844 ret = btrfs_unlink_subvol(trans, BTRFS_I(new_dir), new_dentry);
8845 } else { /* dest is an inode */
8846 ret = __btrfs_unlink_inode(trans, BTRFS_I(new_dir),
8847 BTRFS_I(new_dentry->d_inode),
8848 new_name, &new_rename_ctx);
8850 ret = btrfs_update_inode(trans, BTRFS_I(new_inode));
8853 btrfs_abort_transaction(trans, ret);
8857 ret = btrfs_add_link(trans, BTRFS_I(new_dir), BTRFS_I(old_inode),
8858 new_name, 0, old_idx);
8860 btrfs_abort_transaction(trans, ret);
8864 ret = btrfs_add_link(trans, BTRFS_I(old_dir), BTRFS_I(new_inode),
8865 old_name, 0, new_idx);
8867 btrfs_abort_transaction(trans, ret);
8871 if (old_inode->i_nlink == 1)
8872 BTRFS_I(old_inode)->dir_index = old_idx;
8873 if (new_inode->i_nlink == 1)
8874 BTRFS_I(new_inode)->dir_index = new_idx;
8877 * Now pin the logs of the roots. We do it to ensure that no other task
8878 * can sync the logs while we are in progress with the rename, because
8879 * that could result in an inconsistency in case any of the inodes that
8880 * are part of this rename operation were logged before.
8882 if (old_ino != BTRFS_FIRST_FREE_OBJECTID)
8883 btrfs_pin_log_trans(root);
8884 if (new_ino != BTRFS_FIRST_FREE_OBJECTID)
8885 btrfs_pin_log_trans(dest);
8887 /* Do the log updates for all inodes. */
8888 if (old_ino != BTRFS_FIRST_FREE_OBJECTID)
8889 btrfs_log_new_name(trans, old_dentry, BTRFS_I(old_dir),
8890 old_rename_ctx.index, new_dentry->d_parent);
8891 if (new_ino != BTRFS_FIRST_FREE_OBJECTID)
8892 btrfs_log_new_name(trans, new_dentry, BTRFS_I(new_dir),
8893 new_rename_ctx.index, old_dentry->d_parent);
8895 /* Now unpin the logs. */
8896 if (old_ino != BTRFS_FIRST_FREE_OBJECTID)
8897 btrfs_end_log_trans(root);
8898 if (new_ino != BTRFS_FIRST_FREE_OBJECTID)
8899 btrfs_end_log_trans(dest);
8901 ret2 = btrfs_end_transaction(trans);
8902 ret = ret ? ret : ret2;
8904 if (new_ino == BTRFS_FIRST_FREE_OBJECTID ||
8905 old_ino == BTRFS_FIRST_FREE_OBJECTID)
8906 up_read(&fs_info->subvol_sem);
8908 fscrypt_free_filename(&new_fname);
8909 fscrypt_free_filename(&old_fname);
8913 static struct inode *new_whiteout_inode(struct mnt_idmap *idmap,
8916 struct inode *inode;
8918 inode = new_inode(dir->i_sb);
8920 inode_init_owner(idmap, inode, dir,
8921 S_IFCHR | WHITEOUT_MODE);
8922 inode->i_op = &btrfs_special_inode_operations;
8923 init_special_inode(inode, inode->i_mode, WHITEOUT_DEV);
8928 static int btrfs_rename(struct mnt_idmap *idmap,
8929 struct inode *old_dir, struct dentry *old_dentry,
8930 struct inode *new_dir, struct dentry *new_dentry,
8933 struct btrfs_fs_info *fs_info = btrfs_sb(old_dir->i_sb);
8934 struct btrfs_new_inode_args whiteout_args = {
8936 .dentry = old_dentry,
8938 struct btrfs_trans_handle *trans;
8939 unsigned int trans_num_items;
8940 struct btrfs_root *root = BTRFS_I(old_dir)->root;
8941 struct btrfs_root *dest = BTRFS_I(new_dir)->root;
8942 struct inode *new_inode = d_inode(new_dentry);
8943 struct inode *old_inode = d_inode(old_dentry);
8944 struct btrfs_rename_ctx rename_ctx;
8948 u64 old_ino = btrfs_ino(BTRFS_I(old_inode));
8949 struct fscrypt_name old_fname, new_fname;
8951 if (btrfs_ino(BTRFS_I(new_dir)) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)
8954 /* we only allow rename subvolume link between subvolumes */
8955 if (old_ino != BTRFS_FIRST_FREE_OBJECTID && root != dest)
8958 if (old_ino == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID ||
8959 (new_inode && btrfs_ino(BTRFS_I(new_inode)) == BTRFS_FIRST_FREE_OBJECTID))
8962 if (S_ISDIR(old_inode->i_mode) && new_inode &&
8963 new_inode->i_size > BTRFS_EMPTY_DIR_SIZE)
8966 ret = fscrypt_setup_filename(old_dir, &old_dentry->d_name, 0, &old_fname);
8970 ret = fscrypt_setup_filename(new_dir, &new_dentry->d_name, 0, &new_fname);
8972 fscrypt_free_filename(&old_fname);
8976 /* check for collisions, even if the name isn't there */
8977 ret = btrfs_check_dir_item_collision(dest, new_dir->i_ino, &new_fname.disk_name);
8979 if (ret == -EEXIST) {
8981 * eexist without a new_inode */
8982 if (WARN_ON(!new_inode)) {
8983 goto out_fscrypt_names;
8986 /* maybe -EOVERFLOW */
8987 goto out_fscrypt_names;
8993 * we're using rename to replace one file with another. Start IO on it
8994 * now so we don't add too much work to the end of the transaction
8996 if (new_inode && S_ISREG(old_inode->i_mode) && new_inode->i_size)
8997 filemap_flush(old_inode->i_mapping);
8999 if (flags & RENAME_WHITEOUT) {
9000 whiteout_args.inode = new_whiteout_inode(idmap, old_dir);
9001 if (!whiteout_args.inode) {
9003 goto out_fscrypt_names;
9005 ret = btrfs_new_inode_prepare(&whiteout_args, &trans_num_items);
9007 goto out_whiteout_inode;
9009 /* 1 to update the old parent inode. */
9010 trans_num_items = 1;
9013 if (old_ino == BTRFS_FIRST_FREE_OBJECTID) {
9014 /* Close the race window with snapshot create/destroy ioctl */
9015 down_read(&fs_info->subvol_sem);
9017 * 1 to remove old root ref
9018 * 1 to remove old root backref
9019 * 1 to add new root ref
9020 * 1 to add new root backref
9022 trans_num_items += 4;
9026 * 1 to remove old inode ref
9027 * 1 to add new inode ref
9029 trans_num_items += 3;
9032 * 1 to remove old dir item
9033 * 1 to remove old dir index
9034 * 1 to add new dir item
9035 * 1 to add new dir index
9037 trans_num_items += 4;
9038 /* 1 to update new parent inode if it's not the same as the old parent */
9039 if (new_dir != old_dir)
9044 * 1 to remove inode ref
9045 * 1 to remove dir item
9046 * 1 to remove dir index
9047 * 1 to possibly add orphan item
9049 trans_num_items += 5;
9051 trans = btrfs_start_transaction(root, trans_num_items);
9052 if (IS_ERR(trans)) {
9053 ret = PTR_ERR(trans);
9058 ret = btrfs_record_root_in_trans(trans, dest);
9063 ret = btrfs_set_inode_index(BTRFS_I(new_dir), &index);
9067 BTRFS_I(old_inode)->dir_index = 0ULL;
9068 if (unlikely(old_ino == BTRFS_FIRST_FREE_OBJECTID)) {
9069 /* force full log commit if subvolume involved. */
9070 btrfs_set_log_full_commit(trans);
9072 ret = btrfs_insert_inode_ref(trans, dest, &new_fname.disk_name,
9073 old_ino, btrfs_ino(BTRFS_I(new_dir)),
9079 inode_inc_iversion(old_dir);
9080 inode_inc_iversion(new_dir);
9081 inode_inc_iversion(old_inode);
9082 simple_rename_timestamp(old_dir, old_dentry, new_dir, new_dentry);
9084 if (old_dentry->d_parent != new_dentry->d_parent)
9085 btrfs_record_unlink_dir(trans, BTRFS_I(old_dir),
9086 BTRFS_I(old_inode), true);
9088 if (unlikely(old_ino == BTRFS_FIRST_FREE_OBJECTID)) {
9089 ret = btrfs_unlink_subvol(trans, BTRFS_I(old_dir), old_dentry);
9091 ret = __btrfs_unlink_inode(trans, BTRFS_I(old_dir),
9092 BTRFS_I(d_inode(old_dentry)),
9093 &old_fname.disk_name, &rename_ctx);
9095 ret = btrfs_update_inode(trans, BTRFS_I(old_inode));
9098 btrfs_abort_transaction(trans, ret);
9103 inode_inc_iversion(new_inode);
9104 if (unlikely(btrfs_ino(BTRFS_I(new_inode)) ==
9105 BTRFS_EMPTY_SUBVOL_DIR_OBJECTID)) {
9106 ret = btrfs_unlink_subvol(trans, BTRFS_I(new_dir), new_dentry);
9107 BUG_ON(new_inode->i_nlink == 0);
9109 ret = btrfs_unlink_inode(trans, BTRFS_I(new_dir),
9110 BTRFS_I(d_inode(new_dentry)),
9111 &new_fname.disk_name);
9113 if (!ret && new_inode->i_nlink == 0)
9114 ret = btrfs_orphan_add(trans,
9115 BTRFS_I(d_inode(new_dentry)));
9117 btrfs_abort_transaction(trans, ret);
9122 ret = btrfs_add_link(trans, BTRFS_I(new_dir), BTRFS_I(old_inode),
9123 &new_fname.disk_name, 0, index);
9125 btrfs_abort_transaction(trans, ret);
9129 if (old_inode->i_nlink == 1)
9130 BTRFS_I(old_inode)->dir_index = index;
9132 if (old_ino != BTRFS_FIRST_FREE_OBJECTID)
9133 btrfs_log_new_name(trans, old_dentry, BTRFS_I(old_dir),
9134 rename_ctx.index, new_dentry->d_parent);
9136 if (flags & RENAME_WHITEOUT) {
9137 ret = btrfs_create_new_inode(trans, &whiteout_args);
9139 btrfs_abort_transaction(trans, ret);
9142 unlock_new_inode(whiteout_args.inode);
9143 iput(whiteout_args.inode);
9144 whiteout_args.inode = NULL;
9148 ret2 = btrfs_end_transaction(trans);
9149 ret = ret ? ret : ret2;
9151 if (old_ino == BTRFS_FIRST_FREE_OBJECTID)
9152 up_read(&fs_info->subvol_sem);
9153 if (flags & RENAME_WHITEOUT)
9154 btrfs_new_inode_args_destroy(&whiteout_args);
9156 if (flags & RENAME_WHITEOUT)
9157 iput(whiteout_args.inode);
9159 fscrypt_free_filename(&old_fname);
9160 fscrypt_free_filename(&new_fname);
9164 static int btrfs_rename2(struct mnt_idmap *idmap, struct inode *old_dir,
9165 struct dentry *old_dentry, struct inode *new_dir,
9166 struct dentry *new_dentry, unsigned int flags)
9170 if (flags & ~(RENAME_NOREPLACE | RENAME_EXCHANGE | RENAME_WHITEOUT))
9173 if (flags & RENAME_EXCHANGE)
9174 ret = btrfs_rename_exchange(old_dir, old_dentry, new_dir,
9177 ret = btrfs_rename(idmap, old_dir, old_dentry, new_dir,
9180 btrfs_btree_balance_dirty(BTRFS_I(new_dir)->root->fs_info);
9185 struct btrfs_delalloc_work {
9186 struct inode *inode;
9187 struct completion completion;
9188 struct list_head list;
9189 struct btrfs_work work;
9192 static void btrfs_run_delalloc_work(struct btrfs_work *work)
9194 struct btrfs_delalloc_work *delalloc_work;
9195 struct inode *inode;
9197 delalloc_work = container_of(work, struct btrfs_delalloc_work,
9199 inode = delalloc_work->inode;
9200 filemap_flush(inode->i_mapping);
9201 if (test_bit(BTRFS_INODE_HAS_ASYNC_EXTENT,
9202 &BTRFS_I(inode)->runtime_flags))
9203 filemap_flush(inode->i_mapping);
9206 complete(&delalloc_work->completion);
9209 static struct btrfs_delalloc_work *btrfs_alloc_delalloc_work(struct inode *inode)
9211 struct btrfs_delalloc_work *work;
9213 work = kmalloc(sizeof(*work), GFP_NOFS);
9217 init_completion(&work->completion);
9218 INIT_LIST_HEAD(&work->list);
9219 work->inode = inode;
9220 btrfs_init_work(&work->work, btrfs_run_delalloc_work, NULL);
9226 * some fairly slow code that needs optimization. This walks the list
9227 * of all the inodes with pending delalloc and forces them to disk.
9229 static int start_delalloc_inodes(struct btrfs_root *root,
9230 struct writeback_control *wbc, bool snapshot,
9231 bool in_reclaim_context)
9233 struct btrfs_inode *binode;
9234 struct inode *inode;
9235 struct btrfs_delalloc_work *work, *next;
9239 bool full_flush = wbc->nr_to_write == LONG_MAX;
9241 mutex_lock(&root->delalloc_mutex);
9242 spin_lock(&root->delalloc_lock);
9243 list_splice_init(&root->delalloc_inodes, &splice);
9244 while (!list_empty(&splice)) {
9245 binode = list_entry(splice.next, struct btrfs_inode,
9248 list_move_tail(&binode->delalloc_inodes,
9249 &root->delalloc_inodes);
9251 if (in_reclaim_context &&
9252 test_bit(BTRFS_INODE_NO_DELALLOC_FLUSH, &binode->runtime_flags))
9255 inode = igrab(&binode->vfs_inode);
9257 cond_resched_lock(&root->delalloc_lock);
9260 spin_unlock(&root->delalloc_lock);
9263 set_bit(BTRFS_INODE_SNAPSHOT_FLUSH,
9264 &binode->runtime_flags);
9266 work = btrfs_alloc_delalloc_work(inode);
9272 list_add_tail(&work->list, &works);
9273 btrfs_queue_work(root->fs_info->flush_workers,
9276 ret = filemap_fdatawrite_wbc(inode->i_mapping, wbc);
9277 btrfs_add_delayed_iput(BTRFS_I(inode));
9278 if (ret || wbc->nr_to_write <= 0)
9282 spin_lock(&root->delalloc_lock);
9284 spin_unlock(&root->delalloc_lock);
9287 list_for_each_entry_safe(work, next, &works, list) {
9288 list_del_init(&work->list);
9289 wait_for_completion(&work->completion);
9293 if (!list_empty(&splice)) {
9294 spin_lock(&root->delalloc_lock);
9295 list_splice_tail(&splice, &root->delalloc_inodes);
9296 spin_unlock(&root->delalloc_lock);
9298 mutex_unlock(&root->delalloc_mutex);
9302 int btrfs_start_delalloc_snapshot(struct btrfs_root *root, bool in_reclaim_context)
9304 struct writeback_control wbc = {
9305 .nr_to_write = LONG_MAX,
9306 .sync_mode = WB_SYNC_NONE,
9308 .range_end = LLONG_MAX,
9310 struct btrfs_fs_info *fs_info = root->fs_info;
9312 if (BTRFS_FS_ERROR(fs_info))
9315 return start_delalloc_inodes(root, &wbc, true, in_reclaim_context);
9318 int btrfs_start_delalloc_roots(struct btrfs_fs_info *fs_info, long nr,
9319 bool in_reclaim_context)
9321 struct writeback_control wbc = {
9323 .sync_mode = WB_SYNC_NONE,
9325 .range_end = LLONG_MAX,
9327 struct btrfs_root *root;
9331 if (BTRFS_FS_ERROR(fs_info))
9334 mutex_lock(&fs_info->delalloc_root_mutex);
9335 spin_lock(&fs_info->delalloc_root_lock);
9336 list_splice_init(&fs_info->delalloc_roots, &splice);
9337 while (!list_empty(&splice)) {
9339 * Reset nr_to_write here so we know that we're doing a full
9343 wbc.nr_to_write = LONG_MAX;
9345 root = list_first_entry(&splice, struct btrfs_root,
9347 root = btrfs_grab_root(root);
9349 list_move_tail(&root->delalloc_root,
9350 &fs_info->delalloc_roots);
9351 spin_unlock(&fs_info->delalloc_root_lock);
9353 ret = start_delalloc_inodes(root, &wbc, false, in_reclaim_context);
9354 btrfs_put_root(root);
9355 if (ret < 0 || wbc.nr_to_write <= 0)
9357 spin_lock(&fs_info->delalloc_root_lock);
9359 spin_unlock(&fs_info->delalloc_root_lock);
9363 if (!list_empty(&splice)) {
9364 spin_lock(&fs_info->delalloc_root_lock);
9365 list_splice_tail(&splice, &fs_info->delalloc_roots);
9366 spin_unlock(&fs_info->delalloc_root_lock);
9368 mutex_unlock(&fs_info->delalloc_root_mutex);
9372 static int btrfs_symlink(struct mnt_idmap *idmap, struct inode *dir,
9373 struct dentry *dentry, const char *symname)
9375 struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
9376 struct btrfs_trans_handle *trans;
9377 struct btrfs_root *root = BTRFS_I(dir)->root;
9378 struct btrfs_path *path;
9379 struct btrfs_key key;
9380 struct inode *inode;
9381 struct btrfs_new_inode_args new_inode_args = {
9385 unsigned int trans_num_items;
9390 struct btrfs_file_extent_item *ei;
9391 struct extent_buffer *leaf;
9393 name_len = strlen(symname);
9394 if (name_len > BTRFS_MAX_INLINE_DATA_SIZE(fs_info))
9395 return -ENAMETOOLONG;
9397 inode = new_inode(dir->i_sb);
9400 inode_init_owner(idmap, inode, dir, S_IFLNK | S_IRWXUGO);
9401 inode->i_op = &btrfs_symlink_inode_operations;
9402 inode_nohighmem(inode);
9403 inode->i_mapping->a_ops = &btrfs_aops;
9404 btrfs_i_size_write(BTRFS_I(inode), name_len);
9405 inode_set_bytes(inode, name_len);
9407 new_inode_args.inode = inode;
9408 err = btrfs_new_inode_prepare(&new_inode_args, &trans_num_items);
9411 /* 1 additional item for the inline extent */
9414 trans = btrfs_start_transaction(root, trans_num_items);
9415 if (IS_ERR(trans)) {
9416 err = PTR_ERR(trans);
9417 goto out_new_inode_args;
9420 err = btrfs_create_new_inode(trans, &new_inode_args);
9424 path = btrfs_alloc_path();
9427 btrfs_abort_transaction(trans, err);
9428 discard_new_inode(inode);
9432 key.objectid = btrfs_ino(BTRFS_I(inode));
9434 key.type = BTRFS_EXTENT_DATA_KEY;
9435 datasize = btrfs_file_extent_calc_inline_size(name_len);
9436 err = btrfs_insert_empty_item(trans, root, path, &key,
9439 btrfs_abort_transaction(trans, err);
9440 btrfs_free_path(path);
9441 discard_new_inode(inode);
9445 leaf = path->nodes[0];
9446 ei = btrfs_item_ptr(leaf, path->slots[0],
9447 struct btrfs_file_extent_item);
9448 btrfs_set_file_extent_generation(leaf, ei, trans->transid);
9449 btrfs_set_file_extent_type(leaf, ei,
9450 BTRFS_FILE_EXTENT_INLINE);
9451 btrfs_set_file_extent_encryption(leaf, ei, 0);
9452 btrfs_set_file_extent_compression(leaf, ei, 0);
9453 btrfs_set_file_extent_other_encoding(leaf, ei, 0);
9454 btrfs_set_file_extent_ram_bytes(leaf, ei, name_len);
9456 ptr = btrfs_file_extent_inline_start(ei);
9457 write_extent_buffer(leaf, symname, ptr, name_len);
9458 btrfs_mark_buffer_dirty(trans, leaf);
9459 btrfs_free_path(path);
9461 d_instantiate_new(dentry, inode);
9464 btrfs_end_transaction(trans);
9465 btrfs_btree_balance_dirty(fs_info);
9467 btrfs_new_inode_args_destroy(&new_inode_args);
9474 static struct btrfs_trans_handle *insert_prealloc_file_extent(
9475 struct btrfs_trans_handle *trans_in,
9476 struct btrfs_inode *inode,
9477 struct btrfs_key *ins,
9480 struct btrfs_file_extent_item stack_fi;
9481 struct btrfs_replace_extent_info extent_info;
9482 struct btrfs_trans_handle *trans = trans_in;
9483 struct btrfs_path *path;
9484 u64 start = ins->objectid;
9485 u64 len = ins->offset;
9486 int qgroup_released;
9489 memset(&stack_fi, 0, sizeof(stack_fi));
9491 btrfs_set_stack_file_extent_type(&stack_fi, BTRFS_FILE_EXTENT_PREALLOC);
9492 btrfs_set_stack_file_extent_disk_bytenr(&stack_fi, start);
9493 btrfs_set_stack_file_extent_disk_num_bytes(&stack_fi, len);
9494 btrfs_set_stack_file_extent_num_bytes(&stack_fi, len);
9495 btrfs_set_stack_file_extent_ram_bytes(&stack_fi, len);
9496 btrfs_set_stack_file_extent_compression(&stack_fi, BTRFS_COMPRESS_NONE);
9497 /* Encryption and other encoding is reserved and all 0 */
9499 qgroup_released = btrfs_qgroup_release_data(inode, file_offset, len);
9500 if (qgroup_released < 0)
9501 return ERR_PTR(qgroup_released);
9504 ret = insert_reserved_file_extent(trans, inode,
9505 file_offset, &stack_fi,
9506 true, qgroup_released);
9512 extent_info.disk_offset = start;
9513 extent_info.disk_len = len;
9514 extent_info.data_offset = 0;
9515 extent_info.data_len = len;
9516 extent_info.file_offset = file_offset;
9517 extent_info.extent_buf = (char *)&stack_fi;
9518 extent_info.is_new_extent = true;
9519 extent_info.update_times = true;
9520 extent_info.qgroup_reserved = qgroup_released;
9521 extent_info.insertions = 0;
9523 path = btrfs_alloc_path();
9529 ret = btrfs_replace_file_extents(inode, path, file_offset,
9530 file_offset + len - 1, &extent_info,
9532 btrfs_free_path(path);
9539 * We have released qgroup data range at the beginning of the function,
9540 * and normally qgroup_released bytes will be freed when committing
9542 * But if we error out early, we have to free what we have released
9543 * or we leak qgroup data reservation.
9545 btrfs_qgroup_free_refroot(inode->root->fs_info,
9546 inode->root->root_key.objectid, qgroup_released,
9547 BTRFS_QGROUP_RSV_DATA);
9548 return ERR_PTR(ret);
9551 static int __btrfs_prealloc_file_range(struct inode *inode, int mode,
9552 u64 start, u64 num_bytes, u64 min_size,
9553 loff_t actual_len, u64 *alloc_hint,
9554 struct btrfs_trans_handle *trans)
9556 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
9557 struct extent_map *em;
9558 struct btrfs_root *root = BTRFS_I(inode)->root;
9559 struct btrfs_key ins;
9560 u64 cur_offset = start;
9561 u64 clear_offset = start;
9564 u64 last_alloc = (u64)-1;
9566 bool own_trans = true;
9567 u64 end = start + num_bytes - 1;
9571 while (num_bytes > 0) {
9572 cur_bytes = min_t(u64, num_bytes, SZ_256M);
9573 cur_bytes = max(cur_bytes, min_size);
9575 * If we are severely fragmented we could end up with really
9576 * small allocations, so if the allocator is returning small
9577 * chunks lets make its job easier by only searching for those
9580 cur_bytes = min(cur_bytes, last_alloc);
9581 ret = btrfs_reserve_extent(root, cur_bytes, cur_bytes,
9582 min_size, 0, *alloc_hint, &ins, 1, 0);
9587 * We've reserved this space, and thus converted it from
9588 * ->bytes_may_use to ->bytes_reserved. Any error that happens
9589 * from here on out we will only need to clear our reservation
9590 * for the remaining unreserved area, so advance our
9591 * clear_offset by our extent size.
9593 clear_offset += ins.offset;
9595 last_alloc = ins.offset;
9596 trans = insert_prealloc_file_extent(trans, BTRFS_I(inode),
9599 * Now that we inserted the prealloc extent we can finally
9600 * decrement the number of reservations in the block group.
9601 * If we did it before, we could race with relocation and have
9602 * relocation miss the reserved extent, making it fail later.
9604 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
9605 if (IS_ERR(trans)) {
9606 ret = PTR_ERR(trans);
9607 btrfs_free_reserved_extent(fs_info, ins.objectid,
9612 em = alloc_extent_map();
9614 btrfs_drop_extent_map_range(BTRFS_I(inode), cur_offset,
9615 cur_offset + ins.offset - 1, false);
9616 btrfs_set_inode_full_sync(BTRFS_I(inode));
9620 em->start = cur_offset;
9621 em->orig_start = cur_offset;
9622 em->len = ins.offset;
9623 em->block_start = ins.objectid;
9624 em->block_len = ins.offset;
9625 em->orig_block_len = ins.offset;
9626 em->ram_bytes = ins.offset;
9627 set_bit(EXTENT_FLAG_PREALLOC, &em->flags);
9628 em->generation = trans->transid;
9630 ret = btrfs_replace_extent_map_range(BTRFS_I(inode), em, true);
9631 free_extent_map(em);
9633 num_bytes -= ins.offset;
9634 cur_offset += ins.offset;
9635 *alloc_hint = ins.objectid + ins.offset;
9637 inode_inc_iversion(inode);
9638 inode_set_ctime_current(inode);
9639 BTRFS_I(inode)->flags |= BTRFS_INODE_PREALLOC;
9640 if (!(mode & FALLOC_FL_KEEP_SIZE) &&
9641 (actual_len > inode->i_size) &&
9642 (cur_offset > inode->i_size)) {
9643 if (cur_offset > actual_len)
9644 i_size = actual_len;
9646 i_size = cur_offset;
9647 i_size_write(inode, i_size);
9648 btrfs_inode_safe_disk_i_size_write(BTRFS_I(inode), 0);
9651 ret = btrfs_update_inode(trans, BTRFS_I(inode));
9654 btrfs_abort_transaction(trans, ret);
9656 btrfs_end_transaction(trans);
9661 btrfs_end_transaction(trans);
9665 if (clear_offset < end)
9666 btrfs_free_reserved_data_space(BTRFS_I(inode), NULL, clear_offset,
9667 end - clear_offset + 1);
9671 int btrfs_prealloc_file_range(struct inode *inode, int mode,
9672 u64 start, u64 num_bytes, u64 min_size,
9673 loff_t actual_len, u64 *alloc_hint)
9675 return __btrfs_prealloc_file_range(inode, mode, start, num_bytes,
9676 min_size, actual_len, alloc_hint,
9680 int btrfs_prealloc_file_range_trans(struct inode *inode,
9681 struct btrfs_trans_handle *trans, int mode,
9682 u64 start, u64 num_bytes, u64 min_size,
9683 loff_t actual_len, u64 *alloc_hint)
9685 return __btrfs_prealloc_file_range(inode, mode, start, num_bytes,
9686 min_size, actual_len, alloc_hint, trans);
9689 static int btrfs_permission(struct mnt_idmap *idmap,
9690 struct inode *inode, int mask)
9692 struct btrfs_root *root = BTRFS_I(inode)->root;
9693 umode_t mode = inode->i_mode;
9695 if (mask & MAY_WRITE &&
9696 (S_ISREG(mode) || S_ISDIR(mode) || S_ISLNK(mode))) {
9697 if (btrfs_root_readonly(root))
9699 if (BTRFS_I(inode)->flags & BTRFS_INODE_READONLY)
9702 return generic_permission(idmap, inode, mask);
9705 static int btrfs_tmpfile(struct mnt_idmap *idmap, struct inode *dir,
9706 struct file *file, umode_t mode)
9708 struct btrfs_fs_info *fs_info = btrfs_sb(dir->i_sb);
9709 struct btrfs_trans_handle *trans;
9710 struct btrfs_root *root = BTRFS_I(dir)->root;
9711 struct inode *inode;
9712 struct btrfs_new_inode_args new_inode_args = {
9714 .dentry = file->f_path.dentry,
9717 unsigned int trans_num_items;
9720 inode = new_inode(dir->i_sb);
9723 inode_init_owner(idmap, inode, dir, mode);
9724 inode->i_fop = &btrfs_file_operations;
9725 inode->i_op = &btrfs_file_inode_operations;
9726 inode->i_mapping->a_ops = &btrfs_aops;
9728 new_inode_args.inode = inode;
9729 ret = btrfs_new_inode_prepare(&new_inode_args, &trans_num_items);
9733 trans = btrfs_start_transaction(root, trans_num_items);
9734 if (IS_ERR(trans)) {
9735 ret = PTR_ERR(trans);
9736 goto out_new_inode_args;
9739 ret = btrfs_create_new_inode(trans, &new_inode_args);
9742 * We set number of links to 0 in btrfs_create_new_inode(), and here we
9743 * set it to 1 because d_tmpfile() will issue a warning if the count is
9746 * d_tmpfile() -> inode_dec_link_count() -> drop_nlink()
9748 set_nlink(inode, 1);
9751 d_tmpfile(file, inode);
9752 unlock_new_inode(inode);
9753 mark_inode_dirty(inode);
9756 btrfs_end_transaction(trans);
9757 btrfs_btree_balance_dirty(fs_info);
9759 btrfs_new_inode_args_destroy(&new_inode_args);
9763 return finish_open_simple(file, ret);
9766 void btrfs_set_range_writeback(struct btrfs_inode *inode, u64 start, u64 end)
9768 struct btrfs_fs_info *fs_info = inode->root->fs_info;
9769 unsigned long index = start >> PAGE_SHIFT;
9770 unsigned long end_index = end >> PAGE_SHIFT;
9774 ASSERT(end + 1 - start <= U32_MAX);
9775 len = end + 1 - start;
9776 while (index <= end_index) {
9777 page = find_get_page(inode->vfs_inode.i_mapping, index);
9778 ASSERT(page); /* Pages should be in the extent_io_tree */
9780 btrfs_page_set_writeback(fs_info, page, start, len);
9786 int btrfs_encoded_io_compression_from_extent(struct btrfs_fs_info *fs_info,
9789 switch (compress_type) {
9790 case BTRFS_COMPRESS_NONE:
9791 return BTRFS_ENCODED_IO_COMPRESSION_NONE;
9792 case BTRFS_COMPRESS_ZLIB:
9793 return BTRFS_ENCODED_IO_COMPRESSION_ZLIB;
9794 case BTRFS_COMPRESS_LZO:
9796 * The LZO format depends on the sector size. 64K is the maximum
9797 * sector size that we support.
9799 if (fs_info->sectorsize < SZ_4K || fs_info->sectorsize > SZ_64K)
9801 return BTRFS_ENCODED_IO_COMPRESSION_LZO_4K +
9802 (fs_info->sectorsize_bits - 12);
9803 case BTRFS_COMPRESS_ZSTD:
9804 return BTRFS_ENCODED_IO_COMPRESSION_ZSTD;
9810 static ssize_t btrfs_encoded_read_inline(
9812 struct iov_iter *iter, u64 start,
9814 struct extent_state **cached_state,
9815 u64 extent_start, size_t count,
9816 struct btrfs_ioctl_encoded_io_args *encoded,
9819 struct btrfs_inode *inode = BTRFS_I(file_inode(iocb->ki_filp));
9820 struct btrfs_root *root = inode->root;
9821 struct btrfs_fs_info *fs_info = root->fs_info;
9822 struct extent_io_tree *io_tree = &inode->io_tree;
9823 struct btrfs_path *path;
9824 struct extent_buffer *leaf;
9825 struct btrfs_file_extent_item *item;
9831 path = btrfs_alloc_path();
9836 ret = btrfs_lookup_file_extent(NULL, root, path, btrfs_ino(inode),
9840 /* The extent item disappeared? */
9845 leaf = path->nodes[0];
9846 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_file_extent_item);
9848 ram_bytes = btrfs_file_extent_ram_bytes(leaf, item);
9849 ptr = btrfs_file_extent_inline_start(item);
9851 encoded->len = min_t(u64, extent_start + ram_bytes,
9852 inode->vfs_inode.i_size) - iocb->ki_pos;
9853 ret = btrfs_encoded_io_compression_from_extent(fs_info,
9854 btrfs_file_extent_compression(leaf, item));
9857 encoded->compression = ret;
9858 if (encoded->compression) {
9861 inline_size = btrfs_file_extent_inline_item_len(leaf,
9863 if (inline_size > count) {
9867 count = inline_size;
9868 encoded->unencoded_len = ram_bytes;
9869 encoded->unencoded_offset = iocb->ki_pos - extent_start;
9871 count = min_t(u64, count, encoded->len);
9872 encoded->len = count;
9873 encoded->unencoded_len = count;
9874 ptr += iocb->ki_pos - extent_start;
9877 tmp = kmalloc(count, GFP_NOFS);
9882 read_extent_buffer(leaf, tmp, ptr, count);
9883 btrfs_release_path(path);
9884 unlock_extent(io_tree, start, lockend, cached_state);
9885 btrfs_inode_unlock(inode, BTRFS_ILOCK_SHARED);
9888 ret = copy_to_iter(tmp, count, iter);
9893 btrfs_free_path(path);
9897 struct btrfs_encoded_read_private {
9898 wait_queue_head_t wait;
9900 blk_status_t status;
9903 static void btrfs_encoded_read_endio(struct btrfs_bio *bbio)
9905 struct btrfs_encoded_read_private *priv = bbio->private;
9907 if (bbio->bio.bi_status) {
9909 * The memory barrier implied by the atomic_dec_return() here
9910 * pairs with the memory barrier implied by the
9911 * atomic_dec_return() or io_wait_event() in
9912 * btrfs_encoded_read_regular_fill_pages() to ensure that this
9913 * write is observed before the load of status in
9914 * btrfs_encoded_read_regular_fill_pages().
9916 WRITE_ONCE(priv->status, bbio->bio.bi_status);
9918 if (!atomic_dec_return(&priv->pending))
9919 wake_up(&priv->wait);
9920 bio_put(&bbio->bio);
9923 int btrfs_encoded_read_regular_fill_pages(struct btrfs_inode *inode,
9924 u64 file_offset, u64 disk_bytenr,
9925 u64 disk_io_size, struct page **pages)
9927 struct btrfs_fs_info *fs_info = inode->root->fs_info;
9928 struct btrfs_encoded_read_private priv = {
9929 .pending = ATOMIC_INIT(1),
9931 unsigned long i = 0;
9932 struct btrfs_bio *bbio;
9934 init_waitqueue_head(&priv.wait);
9936 bbio = btrfs_bio_alloc(BIO_MAX_VECS, REQ_OP_READ, fs_info,
9937 btrfs_encoded_read_endio, &priv);
9938 bbio->bio.bi_iter.bi_sector = disk_bytenr >> SECTOR_SHIFT;
9939 bbio->inode = inode;
9942 size_t bytes = min_t(u64, disk_io_size, PAGE_SIZE);
9944 if (bio_add_page(&bbio->bio, pages[i], bytes, 0) < bytes) {
9945 atomic_inc(&priv.pending);
9946 btrfs_submit_bio(bbio, 0);
9948 bbio = btrfs_bio_alloc(BIO_MAX_VECS, REQ_OP_READ, fs_info,
9949 btrfs_encoded_read_endio, &priv);
9950 bbio->bio.bi_iter.bi_sector = disk_bytenr >> SECTOR_SHIFT;
9951 bbio->inode = inode;
9956 disk_bytenr += bytes;
9957 disk_io_size -= bytes;
9958 } while (disk_io_size);
9960 atomic_inc(&priv.pending);
9961 btrfs_submit_bio(bbio, 0);
9963 if (atomic_dec_return(&priv.pending))
9964 io_wait_event(priv.wait, !atomic_read(&priv.pending));
9965 /* See btrfs_encoded_read_endio() for ordering. */
9966 return blk_status_to_errno(READ_ONCE(priv.status));
9969 static ssize_t btrfs_encoded_read_regular(struct kiocb *iocb,
9970 struct iov_iter *iter,
9971 u64 start, u64 lockend,
9972 struct extent_state **cached_state,
9973 u64 disk_bytenr, u64 disk_io_size,
9974 size_t count, bool compressed,
9977 struct btrfs_inode *inode = BTRFS_I(file_inode(iocb->ki_filp));
9978 struct extent_io_tree *io_tree = &inode->io_tree;
9979 struct page **pages;
9980 unsigned long nr_pages, i;
9985 nr_pages = DIV_ROUND_UP(disk_io_size, PAGE_SIZE);
9986 pages = kcalloc(nr_pages, sizeof(struct page *), GFP_NOFS);
9989 ret = btrfs_alloc_page_array(nr_pages, pages);
9995 ret = btrfs_encoded_read_regular_fill_pages(inode, start, disk_bytenr,
9996 disk_io_size, pages);
10000 unlock_extent(io_tree, start, lockend, cached_state);
10001 btrfs_inode_unlock(inode, BTRFS_ILOCK_SHARED);
10008 i = (iocb->ki_pos - start) >> PAGE_SHIFT;
10009 page_offset = (iocb->ki_pos - start) & (PAGE_SIZE - 1);
10012 while (cur < count) {
10013 size_t bytes = min_t(size_t, count - cur,
10014 PAGE_SIZE - page_offset);
10016 if (copy_page_to_iter(pages[i], page_offset, bytes,
10027 for (i = 0; i < nr_pages; i++) {
10029 __free_page(pages[i]);
10035 ssize_t btrfs_encoded_read(struct kiocb *iocb, struct iov_iter *iter,
10036 struct btrfs_ioctl_encoded_io_args *encoded)
10038 struct btrfs_inode *inode = BTRFS_I(file_inode(iocb->ki_filp));
10039 struct btrfs_fs_info *fs_info = inode->root->fs_info;
10040 struct extent_io_tree *io_tree = &inode->io_tree;
10042 size_t count = iov_iter_count(iter);
10043 u64 start, lockend, disk_bytenr, disk_io_size;
10044 struct extent_state *cached_state = NULL;
10045 struct extent_map *em;
10046 bool unlocked = false;
10048 file_accessed(iocb->ki_filp);
10050 btrfs_inode_lock(inode, BTRFS_ILOCK_SHARED);
10052 if (iocb->ki_pos >= inode->vfs_inode.i_size) {
10053 btrfs_inode_unlock(inode, BTRFS_ILOCK_SHARED);
10056 start = ALIGN_DOWN(iocb->ki_pos, fs_info->sectorsize);
10058 * We don't know how long the extent containing iocb->ki_pos is, but if
10059 * it's compressed we know that it won't be longer than this.
10061 lockend = start + BTRFS_MAX_UNCOMPRESSED - 1;
10064 struct btrfs_ordered_extent *ordered;
10066 ret = btrfs_wait_ordered_range(&inode->vfs_inode, start,
10067 lockend - start + 1);
10069 goto out_unlock_inode;
10070 lock_extent(io_tree, start, lockend, &cached_state);
10071 ordered = btrfs_lookup_ordered_range(inode, start,
10072 lockend - start + 1);
10075 btrfs_put_ordered_extent(ordered);
10076 unlock_extent(io_tree, start, lockend, &cached_state);
10080 em = btrfs_get_extent(inode, NULL, 0, start, lockend - start + 1);
10083 goto out_unlock_extent;
10086 if (em->block_start == EXTENT_MAP_INLINE) {
10087 u64 extent_start = em->start;
10090 * For inline extents we get everything we need out of the
10093 free_extent_map(em);
10095 ret = btrfs_encoded_read_inline(iocb, iter, start, lockend,
10096 &cached_state, extent_start,
10097 count, encoded, &unlocked);
10102 * We only want to return up to EOF even if the extent extends beyond
10105 encoded->len = min_t(u64, extent_map_end(em),
10106 inode->vfs_inode.i_size) - iocb->ki_pos;
10107 if (em->block_start == EXTENT_MAP_HOLE ||
10108 test_bit(EXTENT_FLAG_PREALLOC, &em->flags)) {
10109 disk_bytenr = EXTENT_MAP_HOLE;
10110 count = min_t(u64, count, encoded->len);
10111 encoded->len = count;
10112 encoded->unencoded_len = count;
10113 } else if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) {
10114 disk_bytenr = em->block_start;
10116 * Bail if the buffer isn't large enough to return the whole
10117 * compressed extent.
10119 if (em->block_len > count) {
10123 disk_io_size = em->block_len;
10124 count = em->block_len;
10125 encoded->unencoded_len = em->ram_bytes;
10126 encoded->unencoded_offset = iocb->ki_pos - em->orig_start;
10127 ret = btrfs_encoded_io_compression_from_extent(fs_info,
10128 em->compress_type);
10131 encoded->compression = ret;
10133 disk_bytenr = em->block_start + (start - em->start);
10134 if (encoded->len > count)
10135 encoded->len = count;
10137 * Don't read beyond what we locked. This also limits the page
10138 * allocations that we'll do.
10140 disk_io_size = min(lockend + 1, iocb->ki_pos + encoded->len) - start;
10141 count = start + disk_io_size - iocb->ki_pos;
10142 encoded->len = count;
10143 encoded->unencoded_len = count;
10144 disk_io_size = ALIGN(disk_io_size, fs_info->sectorsize);
10146 free_extent_map(em);
10149 if (disk_bytenr == EXTENT_MAP_HOLE) {
10150 unlock_extent(io_tree, start, lockend, &cached_state);
10151 btrfs_inode_unlock(inode, BTRFS_ILOCK_SHARED);
10153 ret = iov_iter_zero(count, iter);
10157 ret = btrfs_encoded_read_regular(iocb, iter, start, lockend,
10158 &cached_state, disk_bytenr,
10159 disk_io_size, count,
10160 encoded->compression,
10166 iocb->ki_pos += encoded->len;
10168 free_extent_map(em);
10171 unlock_extent(io_tree, start, lockend, &cached_state);
10174 btrfs_inode_unlock(inode, BTRFS_ILOCK_SHARED);
10178 ssize_t btrfs_do_encoded_write(struct kiocb *iocb, struct iov_iter *from,
10179 const struct btrfs_ioctl_encoded_io_args *encoded)
10181 struct btrfs_inode *inode = BTRFS_I(file_inode(iocb->ki_filp));
10182 struct btrfs_root *root = inode->root;
10183 struct btrfs_fs_info *fs_info = root->fs_info;
10184 struct extent_io_tree *io_tree = &inode->io_tree;
10185 struct extent_changeset *data_reserved = NULL;
10186 struct extent_state *cached_state = NULL;
10187 struct btrfs_ordered_extent *ordered;
10191 u64 num_bytes, ram_bytes, disk_num_bytes;
10192 unsigned long nr_pages, i;
10193 struct page **pages;
10194 struct btrfs_key ins;
10195 bool extent_reserved = false;
10196 struct extent_map *em;
10199 switch (encoded->compression) {
10200 case BTRFS_ENCODED_IO_COMPRESSION_ZLIB:
10201 compression = BTRFS_COMPRESS_ZLIB;
10203 case BTRFS_ENCODED_IO_COMPRESSION_ZSTD:
10204 compression = BTRFS_COMPRESS_ZSTD;
10206 case BTRFS_ENCODED_IO_COMPRESSION_LZO_4K:
10207 case BTRFS_ENCODED_IO_COMPRESSION_LZO_8K:
10208 case BTRFS_ENCODED_IO_COMPRESSION_LZO_16K:
10209 case BTRFS_ENCODED_IO_COMPRESSION_LZO_32K:
10210 case BTRFS_ENCODED_IO_COMPRESSION_LZO_64K:
10211 /* The sector size must match for LZO. */
10212 if (encoded->compression -
10213 BTRFS_ENCODED_IO_COMPRESSION_LZO_4K + 12 !=
10214 fs_info->sectorsize_bits)
10216 compression = BTRFS_COMPRESS_LZO;
10221 if (encoded->encryption != BTRFS_ENCODED_IO_ENCRYPTION_NONE)
10224 orig_count = iov_iter_count(from);
10226 /* The extent size must be sane. */
10227 if (encoded->unencoded_len > BTRFS_MAX_UNCOMPRESSED ||
10228 orig_count > BTRFS_MAX_COMPRESSED || orig_count == 0)
10232 * The compressed data must be smaller than the decompressed data.
10234 * It's of course possible for data to compress to larger or the same
10235 * size, but the buffered I/O path falls back to no compression for such
10236 * data, and we don't want to break any assumptions by creating these
10239 * Note that this is less strict than the current check we have that the
10240 * compressed data must be at least one sector smaller than the
10241 * decompressed data. We only want to enforce the weaker requirement
10242 * from old kernels that it is at least one byte smaller.
10244 if (orig_count >= encoded->unencoded_len)
10247 /* The extent must start on a sector boundary. */
10248 start = iocb->ki_pos;
10249 if (!IS_ALIGNED(start, fs_info->sectorsize))
10253 * The extent must end on a sector boundary. However, we allow a write
10254 * which ends at or extends i_size to have an unaligned length; we round
10255 * up the extent size and set i_size to the unaligned end.
10257 if (start + encoded->len < inode->vfs_inode.i_size &&
10258 !IS_ALIGNED(start + encoded->len, fs_info->sectorsize))
10261 /* Finally, the offset in the unencoded data must be sector-aligned. */
10262 if (!IS_ALIGNED(encoded->unencoded_offset, fs_info->sectorsize))
10265 num_bytes = ALIGN(encoded->len, fs_info->sectorsize);
10266 ram_bytes = ALIGN(encoded->unencoded_len, fs_info->sectorsize);
10267 end = start + num_bytes - 1;
10270 * If the extent cannot be inline, the compressed data on disk must be
10271 * sector-aligned. For convenience, we extend it with zeroes if it
10274 disk_num_bytes = ALIGN(orig_count, fs_info->sectorsize);
10275 nr_pages = DIV_ROUND_UP(disk_num_bytes, PAGE_SIZE);
10276 pages = kvcalloc(nr_pages, sizeof(struct page *), GFP_KERNEL_ACCOUNT);
10279 for (i = 0; i < nr_pages; i++) {
10280 size_t bytes = min_t(size_t, PAGE_SIZE, iov_iter_count(from));
10283 pages[i] = alloc_page(GFP_KERNEL_ACCOUNT);
10288 kaddr = kmap_local_page(pages[i]);
10289 if (copy_from_iter(kaddr, bytes, from) != bytes) {
10290 kunmap_local(kaddr);
10294 if (bytes < PAGE_SIZE)
10295 memset(kaddr + bytes, 0, PAGE_SIZE - bytes);
10296 kunmap_local(kaddr);
10300 struct btrfs_ordered_extent *ordered;
10302 ret = btrfs_wait_ordered_range(&inode->vfs_inode, start, num_bytes);
10305 ret = invalidate_inode_pages2_range(inode->vfs_inode.i_mapping,
10306 start >> PAGE_SHIFT,
10307 end >> PAGE_SHIFT);
10310 lock_extent(io_tree, start, end, &cached_state);
10311 ordered = btrfs_lookup_ordered_range(inode, start, num_bytes);
10313 !filemap_range_has_page(inode->vfs_inode.i_mapping, start, end))
10316 btrfs_put_ordered_extent(ordered);
10317 unlock_extent(io_tree, start, end, &cached_state);
10322 * We don't use the higher-level delalloc space functions because our
10323 * num_bytes and disk_num_bytes are different.
10325 ret = btrfs_alloc_data_chunk_ondemand(inode, disk_num_bytes);
10328 ret = btrfs_qgroup_reserve_data(inode, &data_reserved, start, num_bytes);
10330 goto out_free_data_space;
10331 ret = btrfs_delalloc_reserve_metadata(inode, num_bytes, disk_num_bytes,
10334 goto out_qgroup_free_data;
10336 /* Try an inline extent first. */
10337 if (start == 0 && encoded->unencoded_len == encoded->len &&
10338 encoded->unencoded_offset == 0) {
10339 ret = cow_file_range_inline(inode, encoded->len, orig_count,
10340 compression, pages, true);
10344 goto out_delalloc_release;
10348 ret = btrfs_reserve_extent(root, disk_num_bytes, disk_num_bytes,
10349 disk_num_bytes, 0, 0, &ins, 1, 1);
10351 goto out_delalloc_release;
10352 extent_reserved = true;
10354 em = create_io_em(inode, start, num_bytes,
10355 start - encoded->unencoded_offset, ins.objectid,
10356 ins.offset, ins.offset, ram_bytes, compression,
10357 BTRFS_ORDERED_COMPRESSED);
10360 goto out_free_reserved;
10362 free_extent_map(em);
10364 ordered = btrfs_alloc_ordered_extent(inode, start, num_bytes, ram_bytes,
10365 ins.objectid, ins.offset,
10366 encoded->unencoded_offset,
10367 (1 << BTRFS_ORDERED_ENCODED) |
10368 (1 << BTRFS_ORDERED_COMPRESSED),
10370 if (IS_ERR(ordered)) {
10371 btrfs_drop_extent_map_range(inode, start, end, false);
10372 ret = PTR_ERR(ordered);
10373 goto out_free_reserved;
10375 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
10377 if (start + encoded->len > inode->vfs_inode.i_size)
10378 i_size_write(&inode->vfs_inode, start + encoded->len);
10380 unlock_extent(io_tree, start, end, &cached_state);
10382 btrfs_delalloc_release_extents(inode, num_bytes);
10384 btrfs_submit_compressed_write(ordered, pages, nr_pages, 0, false);
10389 btrfs_dec_block_group_reservations(fs_info, ins.objectid);
10390 btrfs_free_reserved_extent(fs_info, ins.objectid, ins.offset, 1);
10391 out_delalloc_release:
10392 btrfs_delalloc_release_extents(inode, num_bytes);
10393 btrfs_delalloc_release_metadata(inode, disk_num_bytes, ret < 0);
10394 out_qgroup_free_data:
10396 btrfs_qgroup_free_data(inode, data_reserved, start, num_bytes);
10397 out_free_data_space:
10399 * If btrfs_reserve_extent() succeeded, then we already decremented
10402 if (!extent_reserved)
10403 btrfs_free_reserved_data_space_noquota(fs_info, disk_num_bytes);
10405 unlock_extent(io_tree, start, end, &cached_state);
10407 for (i = 0; i < nr_pages; i++) {
10409 __free_page(pages[i]);
10414 iocb->ki_pos += encoded->len;
10420 * Add an entry indicating a block group or device which is pinned by a
10421 * swapfile. Returns 0 on success, 1 if there is already an entry for it, or a
10422 * negative errno on failure.
10424 static int btrfs_add_swapfile_pin(struct inode *inode, void *ptr,
10425 bool is_block_group)
10427 struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info;
10428 struct btrfs_swapfile_pin *sp, *entry;
10429 struct rb_node **p;
10430 struct rb_node *parent = NULL;
10432 sp = kmalloc(sizeof(*sp), GFP_NOFS);
10437 sp->is_block_group = is_block_group;
10438 sp->bg_extent_count = 1;
10440 spin_lock(&fs_info->swapfile_pins_lock);
10441 p = &fs_info->swapfile_pins.rb_node;
10444 entry = rb_entry(parent, struct btrfs_swapfile_pin, node);
10445 if (sp->ptr < entry->ptr ||
10446 (sp->ptr == entry->ptr && sp->inode < entry->inode)) {
10447 p = &(*p)->rb_left;
10448 } else if (sp->ptr > entry->ptr ||
10449 (sp->ptr == entry->ptr && sp->inode > entry->inode)) {
10450 p = &(*p)->rb_right;
10452 if (is_block_group)
10453 entry->bg_extent_count++;
10454 spin_unlock(&fs_info->swapfile_pins_lock);
10459 rb_link_node(&sp->node, parent, p);
10460 rb_insert_color(&sp->node, &fs_info->swapfile_pins);
10461 spin_unlock(&fs_info->swapfile_pins_lock);
10465 /* Free all of the entries pinned by this swapfile. */
10466 static void btrfs_free_swapfile_pins(struct inode *inode)
10468 struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info;
10469 struct btrfs_swapfile_pin *sp;
10470 struct rb_node *node, *next;
10472 spin_lock(&fs_info->swapfile_pins_lock);
10473 node = rb_first(&fs_info->swapfile_pins);
10475 next = rb_next(node);
10476 sp = rb_entry(node, struct btrfs_swapfile_pin, node);
10477 if (sp->inode == inode) {
10478 rb_erase(&sp->node, &fs_info->swapfile_pins);
10479 if (sp->is_block_group) {
10480 btrfs_dec_block_group_swap_extents(sp->ptr,
10481 sp->bg_extent_count);
10482 btrfs_put_block_group(sp->ptr);
10488 spin_unlock(&fs_info->swapfile_pins_lock);
10491 struct btrfs_swap_info {
10497 unsigned long nr_pages;
10501 static int btrfs_add_swap_extent(struct swap_info_struct *sis,
10502 struct btrfs_swap_info *bsi)
10504 unsigned long nr_pages;
10505 unsigned long max_pages;
10506 u64 first_ppage, first_ppage_reported, next_ppage;
10510 * Our swapfile may have had its size extended after the swap header was
10511 * written. In that case activating the swapfile should not go beyond
10512 * the max size set in the swap header.
10514 if (bsi->nr_pages >= sis->max)
10517 max_pages = sis->max - bsi->nr_pages;
10518 first_ppage = PAGE_ALIGN(bsi->block_start) >> PAGE_SHIFT;
10519 next_ppage = PAGE_ALIGN_DOWN(bsi->block_start + bsi->block_len) >> PAGE_SHIFT;
10521 if (first_ppage >= next_ppage)
10523 nr_pages = next_ppage - first_ppage;
10524 nr_pages = min(nr_pages, max_pages);
10526 first_ppage_reported = first_ppage;
10527 if (bsi->start == 0)
10528 first_ppage_reported++;
10529 if (bsi->lowest_ppage > first_ppage_reported)
10530 bsi->lowest_ppage = first_ppage_reported;
10531 if (bsi->highest_ppage < (next_ppage - 1))
10532 bsi->highest_ppage = next_ppage - 1;
10534 ret = add_swap_extent(sis, bsi->nr_pages, nr_pages, first_ppage);
10537 bsi->nr_extents += ret;
10538 bsi->nr_pages += nr_pages;
10542 static void btrfs_swap_deactivate(struct file *file)
10544 struct inode *inode = file_inode(file);
10546 btrfs_free_swapfile_pins(inode);
10547 atomic_dec(&BTRFS_I(inode)->root->nr_swapfiles);
10550 static int btrfs_swap_activate(struct swap_info_struct *sis, struct file *file,
10553 struct inode *inode = file_inode(file);
10554 struct btrfs_root *root = BTRFS_I(inode)->root;
10555 struct btrfs_fs_info *fs_info = root->fs_info;
10556 struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
10557 struct extent_state *cached_state = NULL;
10558 struct extent_map *em = NULL;
10559 struct btrfs_device *device = NULL;
10560 struct btrfs_swap_info bsi = {
10561 .lowest_ppage = (sector_t)-1ULL,
10568 * If the swap file was just created, make sure delalloc is done. If the
10569 * file changes again after this, the user is doing something stupid and
10570 * we don't really care.
10572 ret = btrfs_wait_ordered_range(inode, 0, (u64)-1);
10577 * The inode is locked, so these flags won't change after we check them.
10579 if (BTRFS_I(inode)->flags & BTRFS_INODE_COMPRESS) {
10580 btrfs_warn(fs_info, "swapfile must not be compressed");
10583 if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NODATACOW)) {
10584 btrfs_warn(fs_info, "swapfile must not be copy-on-write");
10587 if (!(BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM)) {
10588 btrfs_warn(fs_info, "swapfile must not be checksummed");
10593 * Balance or device remove/replace/resize can move stuff around from
10594 * under us. The exclop protection makes sure they aren't running/won't
10595 * run concurrently while we are mapping the swap extents, and
10596 * fs_info->swapfile_pins prevents them from running while the swap
10597 * file is active and moving the extents. Note that this also prevents
10598 * a concurrent device add which isn't actually necessary, but it's not
10599 * really worth the trouble to allow it.
10601 if (!btrfs_exclop_start(fs_info, BTRFS_EXCLOP_SWAP_ACTIVATE)) {
10602 btrfs_warn(fs_info,
10603 "cannot activate swapfile while exclusive operation is running");
10608 * Prevent snapshot creation while we are activating the swap file.
10609 * We do not want to race with snapshot creation. If snapshot creation
10610 * already started before we bumped nr_swapfiles from 0 to 1 and
10611 * completes before the first write into the swap file after it is
10612 * activated, than that write would fallback to COW.
10614 if (!btrfs_drew_try_write_lock(&root->snapshot_lock)) {
10615 btrfs_exclop_finish(fs_info);
10616 btrfs_warn(fs_info,
10617 "cannot activate swapfile because snapshot creation is in progress");
10621 * Snapshots can create extents which require COW even if NODATACOW is
10622 * set. We use this counter to prevent snapshots. We must increment it
10623 * before walking the extents because we don't want a concurrent
10624 * snapshot to run after we've already checked the extents.
10626 * It is possible that subvolume is marked for deletion but still not
10627 * removed yet. To prevent this race, we check the root status before
10628 * activating the swapfile.
10630 spin_lock(&root->root_item_lock);
10631 if (btrfs_root_dead(root)) {
10632 spin_unlock(&root->root_item_lock);
10634 btrfs_exclop_finish(fs_info);
10635 btrfs_warn(fs_info,
10636 "cannot activate swapfile because subvolume %llu is being deleted",
10637 root->root_key.objectid);
10640 atomic_inc(&root->nr_swapfiles);
10641 spin_unlock(&root->root_item_lock);
10643 isize = ALIGN_DOWN(inode->i_size, fs_info->sectorsize);
10645 lock_extent(io_tree, 0, isize - 1, &cached_state);
10647 while (start < isize) {
10648 u64 logical_block_start, physical_block_start;
10649 struct btrfs_block_group *bg;
10650 u64 len = isize - start;
10652 em = btrfs_get_extent(BTRFS_I(inode), NULL, 0, start, len);
10658 if (em->block_start == EXTENT_MAP_HOLE) {
10659 btrfs_warn(fs_info, "swapfile must not have holes");
10663 if (em->block_start == EXTENT_MAP_INLINE) {
10665 * It's unlikely we'll ever actually find ourselves
10666 * here, as a file small enough to fit inline won't be
10667 * big enough to store more than the swap header, but in
10668 * case something changes in the future, let's catch it
10669 * here rather than later.
10671 btrfs_warn(fs_info, "swapfile must not be inline");
10675 if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) {
10676 btrfs_warn(fs_info, "swapfile must not be compressed");
10681 logical_block_start = em->block_start + (start - em->start);
10682 len = min(len, em->len - (start - em->start));
10683 free_extent_map(em);
10686 ret = can_nocow_extent(inode, start, &len, NULL, NULL, NULL, false, true);
10692 btrfs_warn(fs_info,
10693 "swapfile must not be copy-on-write");
10698 em = btrfs_get_chunk_map(fs_info, logical_block_start, len);
10704 if (em->map_lookup->type & BTRFS_BLOCK_GROUP_PROFILE_MASK) {
10705 btrfs_warn(fs_info,
10706 "swapfile must have single data profile");
10711 if (device == NULL) {
10712 device = em->map_lookup->stripes[0].dev;
10713 ret = btrfs_add_swapfile_pin(inode, device, false);
10718 } else if (device != em->map_lookup->stripes[0].dev) {
10719 btrfs_warn(fs_info, "swapfile must be on one device");
10724 physical_block_start = (em->map_lookup->stripes[0].physical +
10725 (logical_block_start - em->start));
10726 len = min(len, em->len - (logical_block_start - em->start));
10727 free_extent_map(em);
10730 bg = btrfs_lookup_block_group(fs_info, logical_block_start);
10732 btrfs_warn(fs_info,
10733 "could not find block group containing swapfile");
10738 if (!btrfs_inc_block_group_swap_extents(bg)) {
10739 btrfs_warn(fs_info,
10740 "block group for swapfile at %llu is read-only%s",
10742 atomic_read(&fs_info->scrubs_running) ?
10743 " (scrub running)" : "");
10744 btrfs_put_block_group(bg);
10749 ret = btrfs_add_swapfile_pin(inode, bg, true);
10751 btrfs_put_block_group(bg);
10758 if (bsi.block_len &&
10759 bsi.block_start + bsi.block_len == physical_block_start) {
10760 bsi.block_len += len;
10762 if (bsi.block_len) {
10763 ret = btrfs_add_swap_extent(sis, &bsi);
10768 bsi.block_start = physical_block_start;
10769 bsi.block_len = len;
10776 ret = btrfs_add_swap_extent(sis, &bsi);
10779 if (!IS_ERR_OR_NULL(em))
10780 free_extent_map(em);
10782 unlock_extent(io_tree, 0, isize - 1, &cached_state);
10785 btrfs_swap_deactivate(file);
10787 btrfs_drew_write_unlock(&root->snapshot_lock);
10789 btrfs_exclop_finish(fs_info);
10795 sis->bdev = device->bdev;
10796 *span = bsi.highest_ppage - bsi.lowest_ppage + 1;
10797 sis->max = bsi.nr_pages;
10798 sis->pages = bsi.nr_pages - 1;
10799 sis->highest_bit = bsi.nr_pages - 1;
10800 return bsi.nr_extents;
10803 static void btrfs_swap_deactivate(struct file *file)
10807 static int btrfs_swap_activate(struct swap_info_struct *sis, struct file *file,
10810 return -EOPNOTSUPP;
10815 * Update the number of bytes used in the VFS' inode. When we replace extents in
10816 * a range (clone, dedupe, fallocate's zero range), we must update the number of
10817 * bytes used by the inode in an atomic manner, so that concurrent stat(2) calls
10818 * always get a correct value.
10820 void btrfs_update_inode_bytes(struct btrfs_inode *inode,
10821 const u64 add_bytes,
10822 const u64 del_bytes)
10824 if (add_bytes == del_bytes)
10827 spin_lock(&inode->lock);
10829 inode_sub_bytes(&inode->vfs_inode, del_bytes);
10831 inode_add_bytes(&inode->vfs_inode, add_bytes);
10832 spin_unlock(&inode->lock);
10836 * Verify that there are no ordered extents for a given file range.
10838 * @inode: The target inode.
10839 * @start: Start offset of the file range, should be sector size aligned.
10840 * @end: End offset (inclusive) of the file range, its value +1 should be
10841 * sector size aligned.
10843 * This should typically be used for cases where we locked an inode's VFS lock in
10844 * exclusive mode, we have also locked the inode's i_mmap_lock in exclusive mode,
10845 * we have flushed all delalloc in the range, we have waited for all ordered
10846 * extents in the range to complete and finally we have locked the file range in
10847 * the inode's io_tree.
10849 void btrfs_assert_inode_range_clean(struct btrfs_inode *inode, u64 start, u64 end)
10851 struct btrfs_root *root = inode->root;
10852 struct btrfs_ordered_extent *ordered;
10854 if (!IS_ENABLED(CONFIG_BTRFS_ASSERT))
10857 ordered = btrfs_lookup_first_ordered_range(inode, start, end + 1 - start);
10859 btrfs_err(root->fs_info,
10860 "found unexpected ordered extent in file range [%llu, %llu] for inode %llu root %llu (ordered range [%llu, %llu])",
10861 start, end, btrfs_ino(inode), root->root_key.objectid,
10862 ordered->file_offset,
10863 ordered->file_offset + ordered->num_bytes - 1);
10864 btrfs_put_ordered_extent(ordered);
10867 ASSERT(ordered == NULL);
10870 static const struct inode_operations btrfs_dir_inode_operations = {
10871 .getattr = btrfs_getattr,
10872 .lookup = btrfs_lookup,
10873 .create = btrfs_create,
10874 .unlink = btrfs_unlink,
10875 .link = btrfs_link,
10876 .mkdir = btrfs_mkdir,
10877 .rmdir = btrfs_rmdir,
10878 .rename = btrfs_rename2,
10879 .symlink = btrfs_symlink,
10880 .setattr = btrfs_setattr,
10881 .mknod = btrfs_mknod,
10882 .listxattr = btrfs_listxattr,
10883 .permission = btrfs_permission,
10884 .get_inode_acl = btrfs_get_acl,
10885 .set_acl = btrfs_set_acl,
10886 .update_time = btrfs_update_time,
10887 .tmpfile = btrfs_tmpfile,
10888 .fileattr_get = btrfs_fileattr_get,
10889 .fileattr_set = btrfs_fileattr_set,
10892 static const struct file_operations btrfs_dir_file_operations = {
10893 .llseek = btrfs_dir_llseek,
10894 .read = generic_read_dir,
10895 .iterate_shared = btrfs_real_readdir,
10896 .open = btrfs_opendir,
10897 .unlocked_ioctl = btrfs_ioctl,
10898 #ifdef CONFIG_COMPAT
10899 .compat_ioctl = btrfs_compat_ioctl,
10901 .release = btrfs_release_file,
10902 .fsync = btrfs_sync_file,
10906 * btrfs doesn't support the bmap operation because swapfiles
10907 * use bmap to make a mapping of extents in the file. They assume
10908 * these extents won't change over the life of the file and they
10909 * use the bmap result to do IO directly to the drive.
10911 * the btrfs bmap call would return logical addresses that aren't
10912 * suitable for IO and they also will change frequently as COW
10913 * operations happen. So, swapfile + btrfs == corruption.
10915 * For now we're avoiding this by dropping bmap.
10917 static const struct address_space_operations btrfs_aops = {
10918 .read_folio = btrfs_read_folio,
10919 .writepages = btrfs_writepages,
10920 .readahead = btrfs_readahead,
10921 .invalidate_folio = btrfs_invalidate_folio,
10922 .release_folio = btrfs_release_folio,
10923 .migrate_folio = btrfs_migrate_folio,
10924 .dirty_folio = filemap_dirty_folio,
10925 .error_remove_page = generic_error_remove_page,
10926 .swap_activate = btrfs_swap_activate,
10927 .swap_deactivate = btrfs_swap_deactivate,
10930 static const struct inode_operations btrfs_file_inode_operations = {
10931 .getattr = btrfs_getattr,
10932 .setattr = btrfs_setattr,
10933 .listxattr = btrfs_listxattr,
10934 .permission = btrfs_permission,
10935 .fiemap = btrfs_fiemap,
10936 .get_inode_acl = btrfs_get_acl,
10937 .set_acl = btrfs_set_acl,
10938 .update_time = btrfs_update_time,
10939 .fileattr_get = btrfs_fileattr_get,
10940 .fileattr_set = btrfs_fileattr_set,
10942 static const struct inode_operations btrfs_special_inode_operations = {
10943 .getattr = btrfs_getattr,
10944 .setattr = btrfs_setattr,
10945 .permission = btrfs_permission,
10946 .listxattr = btrfs_listxattr,
10947 .get_inode_acl = btrfs_get_acl,
10948 .set_acl = btrfs_set_acl,
10949 .update_time = btrfs_update_time,
10951 static const struct inode_operations btrfs_symlink_inode_operations = {
10952 .get_link = page_get_link,
10953 .getattr = btrfs_getattr,
10954 .setattr = btrfs_setattr,
10955 .permission = btrfs_permission,
10956 .listxattr = btrfs_listxattr,
10957 .update_time = btrfs_update_time,
10960 const struct dentry_operations btrfs_dentry_operations = {
10961 .d_delete = btrfs_dentry_delete,