2 * Copyright (C) 2007 Oracle. All rights reserved.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
13 * You should have received a copy of the GNU General Public
14 * License along with this program; if not, write to the
15 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
16 * Boston, MA 021110-1307, USA.
19 #include <linux/kernel.h>
20 #include <linux/bio.h>
21 #include <linux/buffer_head.h>
22 #include <linux/file.h>
24 #include <linux/pagemap.h>
25 #include <linux/highmem.h>
26 #include <linux/time.h>
27 #include <linux/init.h>
28 #include <linux/string.h>
29 #include <linux/backing-dev.h>
30 #include <linux/mpage.h>
31 #include <linux/swap.h>
32 #include <linux/writeback.h>
33 #include <linux/compat.h>
34 #include <linux/bit_spinlock.h>
35 #include <linux/xattr.h>
36 #include <linux/posix_acl.h>
37 #include <linux/falloc.h>
38 #include <linux/slab.h>
39 #include <linux/ratelimit.h>
40 #include <linux/mount.h>
41 #include <linux/btrfs.h>
42 #include <linux/blkdev.h>
43 #include <linux/posix_acl_xattr.h>
44 #include <linux/uio.h>
47 #include "transaction.h"
48 #include "btrfs_inode.h"
49 #include "print-tree.h"
50 #include "ordered-data.h"
54 #include "compression.h"
56 #include "free-space-cache.h"
57 #include "inode-map.h"
64 struct btrfs_iget_args
{
65 struct btrfs_key
*location
;
66 struct btrfs_root
*root
;
69 struct btrfs_dio_data
{
70 u64 outstanding_extents
;
72 u64 unsubmitted_oe_range_start
;
73 u64 unsubmitted_oe_range_end
;
77 static const struct inode_operations btrfs_dir_inode_operations
;
78 static const struct inode_operations btrfs_symlink_inode_operations
;
79 static const struct inode_operations btrfs_dir_ro_inode_operations
;
80 static const struct inode_operations btrfs_special_inode_operations
;
81 static const struct inode_operations btrfs_file_inode_operations
;
82 static const struct address_space_operations btrfs_aops
;
83 static const struct address_space_operations btrfs_symlink_aops
;
84 static const struct file_operations btrfs_dir_file_operations
;
85 static const struct extent_io_ops btrfs_extent_io_ops
;
87 static struct kmem_cache
*btrfs_inode_cachep
;
88 struct kmem_cache
*btrfs_trans_handle_cachep
;
89 struct kmem_cache
*btrfs_path_cachep
;
90 struct kmem_cache
*btrfs_free_space_cachep
;
93 static const unsigned char btrfs_type_by_mode
[S_IFMT
>> S_SHIFT
] = {
94 [S_IFREG
>> S_SHIFT
] = BTRFS_FT_REG_FILE
,
95 [S_IFDIR
>> S_SHIFT
] = BTRFS_FT_DIR
,
96 [S_IFCHR
>> S_SHIFT
] = BTRFS_FT_CHRDEV
,
97 [S_IFBLK
>> S_SHIFT
] = BTRFS_FT_BLKDEV
,
98 [S_IFIFO
>> S_SHIFT
] = BTRFS_FT_FIFO
,
99 [S_IFSOCK
>> S_SHIFT
] = BTRFS_FT_SOCK
,
100 [S_IFLNK
>> S_SHIFT
] = BTRFS_FT_SYMLINK
,
103 static int btrfs_setsize(struct inode
*inode
, struct iattr
*attr
);
104 static int btrfs_truncate(struct inode
*inode
);
105 static int btrfs_finish_ordered_io(struct btrfs_ordered_extent
*ordered_extent
);
106 static noinline
int cow_file_range(struct inode
*inode
,
107 struct page
*locked_page
,
108 u64 start
, u64 end
, u64 delalloc_end
,
109 int *page_started
, unsigned long *nr_written
,
110 int unlock
, struct btrfs_dedupe_hash
*hash
);
111 static struct extent_map
*create_io_em(struct inode
*inode
, u64 start
, u64 len
,
112 u64 orig_start
, u64 block_start
,
113 u64 block_len
, u64 orig_block_len
,
114 u64 ram_bytes
, int compress_type
,
117 static void __endio_write_update_ordered(struct inode
*inode
,
118 const u64 offset
, const u64 bytes
,
119 const bool uptodate
);
122 * Cleanup all submitted ordered extents in specified range to handle errors
123 * from the fill_dellaloc() callback.
125 * NOTE: caller must ensure that when an error happens, it can not call
126 * extent_clear_unlock_delalloc() to clear both the bits EXTENT_DO_ACCOUNTING
127 * and EXTENT_DELALLOC simultaneously, because that causes the reserved metadata
128 * to be released, which we want to happen only when finishing the ordered
129 * extent (btrfs_finish_ordered_io()). Also note that the caller of the
130 * fill_delalloc() callback already does proper cleanup for the first page of
131 * the range, that is, it invokes the callback writepage_end_io_hook() for the
132 * range of the first page.
134 static inline void btrfs_cleanup_ordered_extents(struct inode
*inode
,
138 return __endio_write_update_ordered(inode
, offset
+ PAGE_SIZE
,
139 bytes
- PAGE_SIZE
, false);
142 static int btrfs_dirty_inode(struct inode
*inode
);
144 #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
145 void btrfs_test_inode_set_ops(struct inode
*inode
)
147 BTRFS_I(inode
)->io_tree
.ops
= &btrfs_extent_io_ops
;
151 static int btrfs_init_inode_security(struct btrfs_trans_handle
*trans
,
152 struct inode
*inode
, struct inode
*dir
,
153 const struct qstr
*qstr
)
157 err
= btrfs_init_acl(trans
, inode
, dir
);
159 err
= btrfs_xattr_security_init(trans
, inode
, dir
, qstr
);
164 * this does all the hard work for inserting an inline extent into
165 * the btree. The caller should have done a btrfs_drop_extents so that
166 * no overlapping inline items exist in the btree
168 static int insert_inline_extent(struct btrfs_trans_handle
*trans
,
169 struct btrfs_path
*path
, int extent_inserted
,
170 struct btrfs_root
*root
, struct inode
*inode
,
171 u64 start
, size_t size
, size_t compressed_size
,
173 struct page
**compressed_pages
)
175 struct extent_buffer
*leaf
;
176 struct page
*page
= NULL
;
179 struct btrfs_file_extent_item
*ei
;
181 size_t cur_size
= size
;
182 unsigned long offset
;
184 if (compressed_size
&& compressed_pages
)
185 cur_size
= compressed_size
;
187 inode_add_bytes(inode
, size
);
189 if (!extent_inserted
) {
190 struct btrfs_key key
;
193 key
.objectid
= btrfs_ino(BTRFS_I(inode
));
195 key
.type
= BTRFS_EXTENT_DATA_KEY
;
197 datasize
= btrfs_file_extent_calc_inline_size(cur_size
);
198 path
->leave_spinning
= 1;
199 ret
= btrfs_insert_empty_item(trans
, root
, path
, &key
,
204 leaf
= path
->nodes
[0];
205 ei
= btrfs_item_ptr(leaf
, path
->slots
[0],
206 struct btrfs_file_extent_item
);
207 btrfs_set_file_extent_generation(leaf
, ei
, trans
->transid
);
208 btrfs_set_file_extent_type(leaf
, ei
, BTRFS_FILE_EXTENT_INLINE
);
209 btrfs_set_file_extent_encryption(leaf
, ei
, 0);
210 btrfs_set_file_extent_other_encoding(leaf
, ei
, 0);
211 btrfs_set_file_extent_ram_bytes(leaf
, ei
, size
);
212 ptr
= btrfs_file_extent_inline_start(ei
);
214 if (compress_type
!= BTRFS_COMPRESS_NONE
) {
217 while (compressed_size
> 0) {
218 cpage
= compressed_pages
[i
];
219 cur_size
= min_t(unsigned long, compressed_size
,
222 kaddr
= kmap_atomic(cpage
);
223 write_extent_buffer(leaf
, kaddr
, ptr
, cur_size
);
224 kunmap_atomic(kaddr
);
228 compressed_size
-= cur_size
;
230 btrfs_set_file_extent_compression(leaf
, ei
,
233 page
= find_get_page(inode
->i_mapping
,
234 start
>> PAGE_SHIFT
);
235 btrfs_set_file_extent_compression(leaf
, ei
, 0);
236 kaddr
= kmap_atomic(page
);
237 offset
= start
& (PAGE_SIZE
- 1);
238 write_extent_buffer(leaf
, kaddr
+ offset
, ptr
, size
);
239 kunmap_atomic(kaddr
);
242 btrfs_mark_buffer_dirty(leaf
);
243 btrfs_release_path(path
);
246 * we're an inline extent, so nobody can
247 * extend the file past i_size without locking
248 * a page we already have locked.
250 * We must do any isize and inode updates
251 * before we unlock the pages. Otherwise we
252 * could end up racing with unlink.
254 BTRFS_I(inode
)->disk_i_size
= inode
->i_size
;
255 ret
= btrfs_update_inode(trans
, root
, inode
);
263 * conditionally insert an inline extent into the file. This
264 * does the checks required to make sure the data is small enough
265 * to fit as an inline extent.
267 static noinline
int cow_file_range_inline(struct btrfs_root
*root
,
268 struct inode
*inode
, u64 start
,
269 u64 end
, size_t compressed_size
,
271 struct page
**compressed_pages
)
273 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
274 struct btrfs_trans_handle
*trans
;
275 u64 isize
= i_size_read(inode
);
276 u64 actual_end
= min(end
+ 1, isize
);
277 u64 inline_len
= actual_end
- start
;
278 u64 aligned_end
= ALIGN(end
, fs_info
->sectorsize
);
279 u64 data_len
= inline_len
;
281 struct btrfs_path
*path
;
282 int extent_inserted
= 0;
283 u32 extent_item_size
;
286 data_len
= compressed_size
;
289 actual_end
> fs_info
->sectorsize
||
290 data_len
> BTRFS_MAX_INLINE_DATA_SIZE(fs_info
) ||
292 (actual_end
& (fs_info
->sectorsize
- 1)) == 0) ||
294 data_len
> fs_info
->max_inline
) {
298 path
= btrfs_alloc_path();
302 trans
= btrfs_join_transaction(root
);
304 btrfs_free_path(path
);
305 return PTR_ERR(trans
);
307 trans
->block_rsv
= &fs_info
->delalloc_block_rsv
;
309 if (compressed_size
&& compressed_pages
)
310 extent_item_size
= btrfs_file_extent_calc_inline_size(
313 extent_item_size
= btrfs_file_extent_calc_inline_size(
316 ret
= __btrfs_drop_extents(trans
, root
, inode
, path
,
317 start
, aligned_end
, NULL
,
318 1, 1, extent_item_size
, &extent_inserted
);
320 btrfs_abort_transaction(trans
, ret
);
324 if (isize
> actual_end
)
325 inline_len
= min_t(u64
, isize
, actual_end
);
326 ret
= insert_inline_extent(trans
, path
, extent_inserted
,
328 inline_len
, compressed_size
,
329 compress_type
, compressed_pages
);
330 if (ret
&& ret
!= -ENOSPC
) {
331 btrfs_abort_transaction(trans
, ret
);
333 } else if (ret
== -ENOSPC
) {
338 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC
, &BTRFS_I(inode
)->runtime_flags
);
339 btrfs_delalloc_release_metadata(BTRFS_I(inode
), end
+ 1 - start
);
340 btrfs_drop_extent_cache(BTRFS_I(inode
), start
, aligned_end
- 1, 0);
343 * Don't forget to free the reserved space, as for inlined extent
344 * it won't count as data extent, free them directly here.
345 * And at reserve time, it's always aligned to page size, so
346 * just free one page here.
348 btrfs_qgroup_free_data(inode
, NULL
, 0, PAGE_SIZE
);
349 btrfs_free_path(path
);
350 btrfs_end_transaction(trans
);
354 struct async_extent
{
359 unsigned long nr_pages
;
361 struct list_head list
;
366 struct btrfs_root
*root
;
367 struct page
*locked_page
;
370 struct list_head extents
;
371 struct btrfs_work work
;
374 static noinline
int add_async_extent(struct async_cow
*cow
,
375 u64 start
, u64 ram_size
,
378 unsigned long nr_pages
,
381 struct async_extent
*async_extent
;
383 async_extent
= kmalloc(sizeof(*async_extent
), GFP_NOFS
);
384 BUG_ON(!async_extent
); /* -ENOMEM */
385 async_extent
->start
= start
;
386 async_extent
->ram_size
= ram_size
;
387 async_extent
->compressed_size
= compressed_size
;
388 async_extent
->pages
= pages
;
389 async_extent
->nr_pages
= nr_pages
;
390 async_extent
->compress_type
= compress_type
;
391 list_add_tail(&async_extent
->list
, &cow
->extents
);
395 static inline int inode_need_compress(struct inode
*inode
)
397 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
400 if (btrfs_test_opt(fs_info
, FORCE_COMPRESS
))
402 /* bad compression ratios */
403 if (BTRFS_I(inode
)->flags
& BTRFS_INODE_NOCOMPRESS
)
405 if (btrfs_test_opt(fs_info
, COMPRESS
) ||
406 BTRFS_I(inode
)->flags
& BTRFS_INODE_COMPRESS
||
407 BTRFS_I(inode
)->force_compress
)
412 static inline void inode_should_defrag(struct btrfs_inode
*inode
,
413 u64 start
, u64 end
, u64 num_bytes
, u64 small_write
)
415 /* If this is a small write inside eof, kick off a defrag */
416 if (num_bytes
< small_write
&&
417 (start
> 0 || end
+ 1 < inode
->disk_i_size
))
418 btrfs_add_inode_defrag(NULL
, inode
);
422 * we create compressed extents in two phases. The first
423 * phase compresses a range of pages that have already been
424 * locked (both pages and state bits are locked).
426 * This is done inside an ordered work queue, and the compression
427 * is spread across many cpus. The actual IO submission is step
428 * two, and the ordered work queue takes care of making sure that
429 * happens in the same order things were put onto the queue by
430 * writepages and friends.
432 * If this code finds it can't get good compression, it puts an
433 * entry onto the work queue to write the uncompressed bytes. This
434 * makes sure that both compressed inodes and uncompressed inodes
435 * are written in the same order that the flusher thread sent them
438 static noinline
void compress_file_range(struct inode
*inode
,
439 struct page
*locked_page
,
441 struct async_cow
*async_cow
,
444 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
445 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
447 u64 blocksize
= fs_info
->sectorsize
;
449 u64 isize
= i_size_read(inode
);
451 struct page
**pages
= NULL
;
452 unsigned long nr_pages
;
453 unsigned long total_compressed
= 0;
454 unsigned long total_in
= 0;
457 int compress_type
= fs_info
->compress_type
;
460 inode_should_defrag(BTRFS_I(inode
), start
, end
, end
- start
+ 1,
463 actual_end
= min_t(u64
, isize
, end
+ 1);
466 nr_pages
= (end
>> PAGE_SHIFT
) - (start
>> PAGE_SHIFT
) + 1;
467 BUILD_BUG_ON((BTRFS_MAX_COMPRESSED
% PAGE_SIZE
) != 0);
468 nr_pages
= min_t(unsigned long, nr_pages
,
469 BTRFS_MAX_COMPRESSED
/ PAGE_SIZE
);
472 * we don't want to send crud past the end of i_size through
473 * compression, that's just a waste of CPU time. So, if the
474 * end of the file is before the start of our current
475 * requested range of bytes, we bail out to the uncompressed
476 * cleanup code that can deal with all of this.
478 * It isn't really the fastest way to fix things, but this is a
479 * very uncommon corner.
481 if (actual_end
<= start
)
482 goto cleanup_and_bail_uncompressed
;
484 total_compressed
= actual_end
- start
;
487 * skip compression for a small file range(<=blocksize) that
488 * isn't an inline extent, since it doesn't save disk space at all.
490 if (total_compressed
<= blocksize
&&
491 (start
> 0 || end
+ 1 < BTRFS_I(inode
)->disk_i_size
))
492 goto cleanup_and_bail_uncompressed
;
494 total_compressed
= min_t(unsigned long, total_compressed
,
495 BTRFS_MAX_UNCOMPRESSED
);
496 num_bytes
= ALIGN(end
- start
+ 1, blocksize
);
497 num_bytes
= max(blocksize
, num_bytes
);
502 * we do compression for mount -o compress and when the
503 * inode has not been flagged as nocompress. This flag can
504 * change at any time if we discover bad compression ratios.
506 if (inode_need_compress(inode
)) {
508 pages
= kcalloc(nr_pages
, sizeof(struct page
*), GFP_NOFS
);
510 /* just bail out to the uncompressed code */
514 if (BTRFS_I(inode
)->force_compress
)
515 compress_type
= BTRFS_I(inode
)->force_compress
;
518 * we need to call clear_page_dirty_for_io on each
519 * page in the range. Otherwise applications with the file
520 * mmap'd can wander in and change the page contents while
521 * we are compressing them.
523 * If the compression fails for any reason, we set the pages
524 * dirty again later on.
526 extent_range_clear_dirty_for_io(inode
, start
, end
);
528 ret
= btrfs_compress_pages(compress_type
,
529 inode
->i_mapping
, start
,
536 unsigned long offset
= total_compressed
&
538 struct page
*page
= pages
[nr_pages
- 1];
541 /* zero the tail end of the last page, we might be
542 * sending it down to disk
545 kaddr
= kmap_atomic(page
);
546 memset(kaddr
+ offset
, 0,
548 kunmap_atomic(kaddr
);
555 /* lets try to make an inline extent */
556 if (ret
|| total_in
< (actual_end
- start
)) {
557 /* we didn't compress the entire range, try
558 * to make an uncompressed inline extent.
560 ret
= cow_file_range_inline(root
, inode
, start
, end
,
561 0, BTRFS_COMPRESS_NONE
, NULL
);
563 /* try making a compressed inline extent */
564 ret
= cow_file_range_inline(root
, inode
, start
, end
,
566 compress_type
, pages
);
569 unsigned long clear_flags
= EXTENT_DELALLOC
|
570 EXTENT_DELALLOC_NEW
| EXTENT_DEFRAG
;
571 unsigned long page_error_op
;
573 clear_flags
|= (ret
< 0) ? EXTENT_DO_ACCOUNTING
: 0;
574 page_error_op
= ret
< 0 ? PAGE_SET_ERROR
: 0;
577 * inline extent creation worked or returned error,
578 * we don't need to create any more async work items.
579 * Unlock and free up our temp pages.
581 extent_clear_unlock_delalloc(inode
, start
, end
, end
,
589 btrfs_free_reserved_data_space_noquota(inode
,
598 * we aren't doing an inline extent round the compressed size
599 * up to a block size boundary so the allocator does sane
602 total_compressed
= ALIGN(total_compressed
, blocksize
);
605 * one last check to make sure the compression is really a
606 * win, compare the page count read with the blocks on disk,
607 * compression must free at least one sector size
609 total_in
= ALIGN(total_in
, PAGE_SIZE
);
610 if (total_compressed
+ blocksize
<= total_in
) {
611 num_bytes
= total_in
;
615 * The async work queues will take care of doing actual
616 * allocation on disk for these compressed pages, and
617 * will submit them to the elevator.
619 add_async_extent(async_cow
, start
, num_bytes
,
620 total_compressed
, pages
, nr_pages
,
623 if (start
+ num_bytes
< end
) {
634 * the compression code ran but failed to make things smaller,
635 * free any pages it allocated and our page pointer array
637 for (i
= 0; i
< nr_pages
; i
++) {
638 WARN_ON(pages
[i
]->mapping
);
643 total_compressed
= 0;
646 /* flag the file so we don't compress in the future */
647 if (!btrfs_test_opt(fs_info
, FORCE_COMPRESS
) &&
648 !(BTRFS_I(inode
)->force_compress
)) {
649 BTRFS_I(inode
)->flags
|= BTRFS_INODE_NOCOMPRESS
;
652 cleanup_and_bail_uncompressed
:
654 * No compression, but we still need to write the pages in the file
655 * we've been given so far. redirty the locked page if it corresponds
656 * to our extent and set things up for the async work queue to run
657 * cow_file_range to do the normal delalloc dance.
659 if (page_offset(locked_page
) >= start
&&
660 page_offset(locked_page
) <= end
)
661 __set_page_dirty_nobuffers(locked_page
);
662 /* unlocked later on in the async handlers */
665 extent_range_redirty_for_io(inode
, start
, end
);
666 add_async_extent(async_cow
, start
, end
- start
+ 1, 0, NULL
, 0,
667 BTRFS_COMPRESS_NONE
);
673 for (i
= 0; i
< nr_pages
; i
++) {
674 WARN_ON(pages
[i
]->mapping
);
680 static void free_async_extent_pages(struct async_extent
*async_extent
)
684 if (!async_extent
->pages
)
687 for (i
= 0; i
< async_extent
->nr_pages
; i
++) {
688 WARN_ON(async_extent
->pages
[i
]->mapping
);
689 put_page(async_extent
->pages
[i
]);
691 kfree(async_extent
->pages
);
692 async_extent
->nr_pages
= 0;
693 async_extent
->pages
= NULL
;
697 * phase two of compressed writeback. This is the ordered portion
698 * of the code, which only gets called in the order the work was
699 * queued. We walk all the async extents created by compress_file_range
700 * and send them down to the disk.
702 static noinline
void submit_compressed_extents(struct inode
*inode
,
703 struct async_cow
*async_cow
)
705 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
706 struct async_extent
*async_extent
;
708 struct btrfs_key ins
;
709 struct extent_map
*em
;
710 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
711 struct extent_io_tree
*io_tree
;
715 while (!list_empty(&async_cow
->extents
)) {
716 async_extent
= list_entry(async_cow
->extents
.next
,
717 struct async_extent
, list
);
718 list_del(&async_extent
->list
);
720 io_tree
= &BTRFS_I(inode
)->io_tree
;
723 /* did the compression code fall back to uncompressed IO? */
724 if (!async_extent
->pages
) {
725 int page_started
= 0;
726 unsigned long nr_written
= 0;
728 lock_extent(io_tree
, async_extent
->start
,
729 async_extent
->start
+
730 async_extent
->ram_size
- 1);
732 /* allocate blocks */
733 ret
= cow_file_range(inode
, async_cow
->locked_page
,
735 async_extent
->start
+
736 async_extent
->ram_size
- 1,
737 async_extent
->start
+
738 async_extent
->ram_size
- 1,
739 &page_started
, &nr_written
, 0,
745 * if page_started, cow_file_range inserted an
746 * inline extent and took care of all the unlocking
747 * and IO for us. Otherwise, we need to submit
748 * all those pages down to the drive.
750 if (!page_started
&& !ret
)
751 extent_write_locked_range(io_tree
,
752 inode
, async_extent
->start
,
753 async_extent
->start
+
754 async_extent
->ram_size
- 1,
758 unlock_page(async_cow
->locked_page
);
764 lock_extent(io_tree
, async_extent
->start
,
765 async_extent
->start
+ async_extent
->ram_size
- 1);
767 ret
= btrfs_reserve_extent(root
, async_extent
->ram_size
,
768 async_extent
->compressed_size
,
769 async_extent
->compressed_size
,
770 0, alloc_hint
, &ins
, 1, 1);
772 free_async_extent_pages(async_extent
);
774 if (ret
== -ENOSPC
) {
775 unlock_extent(io_tree
, async_extent
->start
,
776 async_extent
->start
+
777 async_extent
->ram_size
- 1);
780 * we need to redirty the pages if we decide to
781 * fallback to uncompressed IO, otherwise we
782 * will not submit these pages down to lower
785 extent_range_redirty_for_io(inode
,
787 async_extent
->start
+
788 async_extent
->ram_size
- 1);
795 * here we're doing allocation and writeback of the
798 em
= create_io_em(inode
, async_extent
->start
,
799 async_extent
->ram_size
, /* len */
800 async_extent
->start
, /* orig_start */
801 ins
.objectid
, /* block_start */
802 ins
.offset
, /* block_len */
803 ins
.offset
, /* orig_block_len */
804 async_extent
->ram_size
, /* ram_bytes */
805 async_extent
->compress_type
,
806 BTRFS_ORDERED_COMPRESSED
);
808 /* ret value is not necessary due to void function */
809 goto out_free_reserve
;
812 ret
= btrfs_add_ordered_extent_compress(inode
,
815 async_extent
->ram_size
,
817 BTRFS_ORDERED_COMPRESSED
,
818 async_extent
->compress_type
);
820 btrfs_drop_extent_cache(BTRFS_I(inode
),
822 async_extent
->start
+
823 async_extent
->ram_size
- 1, 0);
824 goto out_free_reserve
;
826 btrfs_dec_block_group_reservations(fs_info
, ins
.objectid
);
829 * clear dirty, set writeback and unlock the pages.
831 extent_clear_unlock_delalloc(inode
, async_extent
->start
,
832 async_extent
->start
+
833 async_extent
->ram_size
- 1,
834 async_extent
->start
+
835 async_extent
->ram_size
- 1,
836 NULL
, EXTENT_LOCKED
| EXTENT_DELALLOC
,
837 PAGE_UNLOCK
| PAGE_CLEAR_DIRTY
|
839 ret
= btrfs_submit_compressed_write(inode
,
841 async_extent
->ram_size
,
843 ins
.offset
, async_extent
->pages
,
844 async_extent
->nr_pages
);
846 struct extent_io_tree
*tree
= &BTRFS_I(inode
)->io_tree
;
847 struct page
*p
= async_extent
->pages
[0];
848 const u64 start
= async_extent
->start
;
849 const u64 end
= start
+ async_extent
->ram_size
- 1;
851 p
->mapping
= inode
->i_mapping
;
852 tree
->ops
->writepage_end_io_hook(p
, start
, end
,
855 extent_clear_unlock_delalloc(inode
, start
, end
, end
,
859 free_async_extent_pages(async_extent
);
861 alloc_hint
= ins
.objectid
+ ins
.offset
;
867 btrfs_dec_block_group_reservations(fs_info
, ins
.objectid
);
868 btrfs_free_reserved_extent(fs_info
, ins
.objectid
, ins
.offset
, 1);
870 extent_clear_unlock_delalloc(inode
, async_extent
->start
,
871 async_extent
->start
+
872 async_extent
->ram_size
- 1,
873 async_extent
->start
+
874 async_extent
->ram_size
- 1,
875 NULL
, EXTENT_LOCKED
| EXTENT_DELALLOC
|
876 EXTENT_DELALLOC_NEW
|
877 EXTENT_DEFRAG
| EXTENT_DO_ACCOUNTING
,
878 PAGE_UNLOCK
| PAGE_CLEAR_DIRTY
|
879 PAGE_SET_WRITEBACK
| PAGE_END_WRITEBACK
|
881 free_async_extent_pages(async_extent
);
886 static u64
get_extent_allocation_hint(struct inode
*inode
, u64 start
,
889 struct extent_map_tree
*em_tree
= &BTRFS_I(inode
)->extent_tree
;
890 struct extent_map
*em
;
893 read_lock(&em_tree
->lock
);
894 em
= search_extent_mapping(em_tree
, start
, num_bytes
);
897 * if block start isn't an actual block number then find the
898 * first block in this inode and use that as a hint. If that
899 * block is also bogus then just don't worry about it.
901 if (em
->block_start
>= EXTENT_MAP_LAST_BYTE
) {
903 em
= search_extent_mapping(em_tree
, 0, 0);
904 if (em
&& em
->block_start
< EXTENT_MAP_LAST_BYTE
)
905 alloc_hint
= em
->block_start
;
909 alloc_hint
= em
->block_start
;
913 read_unlock(&em_tree
->lock
);
919 * when extent_io.c finds a delayed allocation range in the file,
920 * the call backs end up in this code. The basic idea is to
921 * allocate extents on disk for the range, and create ordered data structs
922 * in ram to track those extents.
924 * locked_page is the page that writepage had locked already. We use
925 * it to make sure we don't do extra locks or unlocks.
927 * *page_started is set to one if we unlock locked_page and do everything
928 * required to start IO on it. It may be clean and already done with
931 static noinline
int cow_file_range(struct inode
*inode
,
932 struct page
*locked_page
,
933 u64 start
, u64 end
, u64 delalloc_end
,
934 int *page_started
, unsigned long *nr_written
,
935 int unlock
, struct btrfs_dedupe_hash
*hash
)
937 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
938 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
941 unsigned long ram_size
;
943 u64 cur_alloc_size
= 0;
944 u64 blocksize
= fs_info
->sectorsize
;
945 struct btrfs_key ins
;
946 struct extent_map
*em
;
948 unsigned long page_ops
;
949 bool extent_reserved
= false;
952 if (btrfs_is_free_space_inode(BTRFS_I(inode
))) {
958 num_bytes
= ALIGN(end
- start
+ 1, blocksize
);
959 num_bytes
= max(blocksize
, num_bytes
);
960 disk_num_bytes
= num_bytes
;
962 inode_should_defrag(BTRFS_I(inode
), start
, end
, num_bytes
, SZ_64K
);
965 /* lets try to make an inline extent */
966 ret
= cow_file_range_inline(root
, inode
, start
, end
, 0,
967 BTRFS_COMPRESS_NONE
, NULL
);
969 extent_clear_unlock_delalloc(inode
, start
, end
,
971 EXTENT_LOCKED
| EXTENT_DELALLOC
|
972 EXTENT_DELALLOC_NEW
|
973 EXTENT_DEFRAG
, PAGE_UNLOCK
|
974 PAGE_CLEAR_DIRTY
| PAGE_SET_WRITEBACK
|
976 btrfs_free_reserved_data_space_noquota(inode
, start
,
978 *nr_written
= *nr_written
+
979 (end
- start
+ PAGE_SIZE
) / PAGE_SIZE
;
982 } else if (ret
< 0) {
987 BUG_ON(disk_num_bytes
>
988 btrfs_super_total_bytes(fs_info
->super_copy
));
990 alloc_hint
= get_extent_allocation_hint(inode
, start
, num_bytes
);
991 btrfs_drop_extent_cache(BTRFS_I(inode
), start
,
992 start
+ num_bytes
- 1, 0);
994 while (disk_num_bytes
> 0) {
995 cur_alloc_size
= disk_num_bytes
;
996 ret
= btrfs_reserve_extent(root
, cur_alloc_size
, cur_alloc_size
,
997 fs_info
->sectorsize
, 0, alloc_hint
,
1001 cur_alloc_size
= ins
.offset
;
1002 extent_reserved
= true;
1004 ram_size
= ins
.offset
;
1005 em
= create_io_em(inode
, start
, ins
.offset
, /* len */
1006 start
, /* orig_start */
1007 ins
.objectid
, /* block_start */
1008 ins
.offset
, /* block_len */
1009 ins
.offset
, /* orig_block_len */
1010 ram_size
, /* ram_bytes */
1011 BTRFS_COMPRESS_NONE
, /* compress_type */
1012 BTRFS_ORDERED_REGULAR
/* type */);
1015 free_extent_map(em
);
1017 ret
= btrfs_add_ordered_extent(inode
, start
, ins
.objectid
,
1018 ram_size
, cur_alloc_size
, 0);
1020 goto out_drop_extent_cache
;
1022 if (root
->root_key
.objectid
==
1023 BTRFS_DATA_RELOC_TREE_OBJECTID
) {
1024 ret
= btrfs_reloc_clone_csums(inode
, start
,
1027 * Only drop cache here, and process as normal.
1029 * We must not allow extent_clear_unlock_delalloc()
1030 * at out_unlock label to free meta of this ordered
1031 * extent, as its meta should be freed by
1032 * btrfs_finish_ordered_io().
1034 * So we must continue until @start is increased to
1035 * skip current ordered extent.
1038 btrfs_drop_extent_cache(BTRFS_I(inode
), start
,
1039 start
+ ram_size
- 1, 0);
1042 btrfs_dec_block_group_reservations(fs_info
, ins
.objectid
);
1044 /* we're not doing compressed IO, don't unlock the first
1045 * page (which the caller expects to stay locked), don't
1046 * clear any dirty bits and don't set any writeback bits
1048 * Do set the Private2 bit so we know this page was properly
1049 * setup for writepage
1051 page_ops
= unlock
? PAGE_UNLOCK
: 0;
1052 page_ops
|= PAGE_SET_PRIVATE2
;
1054 extent_clear_unlock_delalloc(inode
, start
,
1055 start
+ ram_size
- 1,
1056 delalloc_end
, locked_page
,
1057 EXTENT_LOCKED
| EXTENT_DELALLOC
,
1059 if (disk_num_bytes
< cur_alloc_size
)
1062 disk_num_bytes
-= cur_alloc_size
;
1063 num_bytes
-= cur_alloc_size
;
1064 alloc_hint
= ins
.objectid
+ ins
.offset
;
1065 start
+= cur_alloc_size
;
1066 extent_reserved
= false;
1069 * btrfs_reloc_clone_csums() error, since start is increased
1070 * extent_clear_unlock_delalloc() at out_unlock label won't
1071 * free metadata of current ordered extent, we're OK to exit.
1079 out_drop_extent_cache
:
1080 btrfs_drop_extent_cache(BTRFS_I(inode
), start
, start
+ ram_size
- 1, 0);
1082 btrfs_dec_block_group_reservations(fs_info
, ins
.objectid
);
1083 btrfs_free_reserved_extent(fs_info
, ins
.objectid
, ins
.offset
, 1);
1085 clear_bits
= EXTENT_LOCKED
| EXTENT_DELALLOC
| EXTENT_DELALLOC_NEW
|
1086 EXTENT_DEFRAG
| EXTENT_CLEAR_META_RESV
;
1087 page_ops
= PAGE_UNLOCK
| PAGE_CLEAR_DIRTY
| PAGE_SET_WRITEBACK
|
1090 * If we reserved an extent for our delalloc range (or a subrange) and
1091 * failed to create the respective ordered extent, then it means that
1092 * when we reserved the extent we decremented the extent's size from
1093 * the data space_info's bytes_may_use counter and incremented the
1094 * space_info's bytes_reserved counter by the same amount. We must make
1095 * sure extent_clear_unlock_delalloc() does not try to decrement again
1096 * the data space_info's bytes_may_use counter, therefore we do not pass
1097 * it the flag EXTENT_CLEAR_DATA_RESV.
1099 if (extent_reserved
) {
1100 extent_clear_unlock_delalloc(inode
, start
,
1101 start
+ cur_alloc_size
,
1102 start
+ cur_alloc_size
,
1106 start
+= cur_alloc_size
;
1110 extent_clear_unlock_delalloc(inode
, start
, end
, delalloc_end
,
1112 clear_bits
| EXTENT_CLEAR_DATA_RESV
,
1118 * work queue call back to started compression on a file and pages
1120 static noinline
void async_cow_start(struct btrfs_work
*work
)
1122 struct async_cow
*async_cow
;
1124 async_cow
= container_of(work
, struct async_cow
, work
);
1126 compress_file_range(async_cow
->inode
, async_cow
->locked_page
,
1127 async_cow
->start
, async_cow
->end
, async_cow
,
1129 if (num_added
== 0) {
1130 btrfs_add_delayed_iput(async_cow
->inode
);
1131 async_cow
->inode
= NULL
;
1136 * work queue call back to submit previously compressed pages
1138 static noinline
void async_cow_submit(struct btrfs_work
*work
)
1140 struct btrfs_fs_info
*fs_info
;
1141 struct async_cow
*async_cow
;
1142 struct btrfs_root
*root
;
1143 unsigned long nr_pages
;
1145 async_cow
= container_of(work
, struct async_cow
, work
);
1147 root
= async_cow
->root
;
1148 fs_info
= root
->fs_info
;
1149 nr_pages
= (async_cow
->end
- async_cow
->start
+ PAGE_SIZE
) >>
1153 * atomic_sub_return implies a barrier for waitqueue_active
1155 if (atomic_sub_return(nr_pages
, &fs_info
->async_delalloc_pages
) <
1157 waitqueue_active(&fs_info
->async_submit_wait
))
1158 wake_up(&fs_info
->async_submit_wait
);
1160 if (async_cow
->inode
)
1161 submit_compressed_extents(async_cow
->inode
, async_cow
);
1164 static noinline
void async_cow_free(struct btrfs_work
*work
)
1166 struct async_cow
*async_cow
;
1167 async_cow
= container_of(work
, struct async_cow
, work
);
1168 if (async_cow
->inode
)
1169 btrfs_add_delayed_iput(async_cow
->inode
);
1173 static int cow_file_range_async(struct inode
*inode
, struct page
*locked_page
,
1174 u64 start
, u64 end
, int *page_started
,
1175 unsigned long *nr_written
)
1177 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
1178 struct async_cow
*async_cow
;
1179 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1180 unsigned long nr_pages
;
1183 clear_extent_bit(&BTRFS_I(inode
)->io_tree
, start
, end
, EXTENT_LOCKED
,
1184 1, 0, NULL
, GFP_NOFS
);
1185 while (start
< end
) {
1186 async_cow
= kmalloc(sizeof(*async_cow
), GFP_NOFS
);
1187 BUG_ON(!async_cow
); /* -ENOMEM */
1188 async_cow
->inode
= igrab(inode
);
1189 async_cow
->root
= root
;
1190 async_cow
->locked_page
= locked_page
;
1191 async_cow
->start
= start
;
1193 if (BTRFS_I(inode
)->flags
& BTRFS_INODE_NOCOMPRESS
&&
1194 !btrfs_test_opt(fs_info
, FORCE_COMPRESS
))
1197 cur_end
= min(end
, start
+ SZ_512K
- 1);
1199 async_cow
->end
= cur_end
;
1200 INIT_LIST_HEAD(&async_cow
->extents
);
1202 btrfs_init_work(&async_cow
->work
,
1203 btrfs_delalloc_helper
,
1204 async_cow_start
, async_cow_submit
,
1207 nr_pages
= (cur_end
- start
+ PAGE_SIZE
) >>
1209 atomic_add(nr_pages
, &fs_info
->async_delalloc_pages
);
1211 btrfs_queue_work(fs_info
->delalloc_workers
, &async_cow
->work
);
1213 while (atomic_read(&fs_info
->async_submit_draining
) &&
1214 atomic_read(&fs_info
->async_delalloc_pages
)) {
1215 wait_event(fs_info
->async_submit_wait
,
1216 (atomic_read(&fs_info
->async_delalloc_pages
) ==
1220 *nr_written
+= nr_pages
;
1221 start
= cur_end
+ 1;
1227 static noinline
int csum_exist_in_range(struct btrfs_fs_info
*fs_info
,
1228 u64 bytenr
, u64 num_bytes
)
1231 struct btrfs_ordered_sum
*sums
;
1234 ret
= btrfs_lookup_csums_range(fs_info
->csum_root
, bytenr
,
1235 bytenr
+ num_bytes
- 1, &list
, 0);
1236 if (ret
== 0 && list_empty(&list
))
1239 while (!list_empty(&list
)) {
1240 sums
= list_entry(list
.next
, struct btrfs_ordered_sum
, list
);
1241 list_del(&sums
->list
);
1248 * when nowcow writeback call back. This checks for snapshots or COW copies
1249 * of the extents that exist in the file, and COWs the file as required.
1251 * If no cow copies or snapshots exist, we write directly to the existing
1254 static noinline
int run_delalloc_nocow(struct inode
*inode
,
1255 struct page
*locked_page
,
1256 u64 start
, u64 end
, int *page_started
, int force
,
1257 unsigned long *nr_written
)
1259 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
1260 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1261 struct extent_buffer
*leaf
;
1262 struct btrfs_path
*path
;
1263 struct btrfs_file_extent_item
*fi
;
1264 struct btrfs_key found_key
;
1265 struct extent_map
*em
;
1280 u64 ino
= btrfs_ino(BTRFS_I(inode
));
1282 path
= btrfs_alloc_path();
1284 extent_clear_unlock_delalloc(inode
, start
, end
, end
,
1286 EXTENT_LOCKED
| EXTENT_DELALLOC
|
1287 EXTENT_DO_ACCOUNTING
|
1288 EXTENT_DEFRAG
, PAGE_UNLOCK
|
1290 PAGE_SET_WRITEBACK
|
1291 PAGE_END_WRITEBACK
);
1295 nolock
= btrfs_is_free_space_inode(BTRFS_I(inode
));
1297 cow_start
= (u64
)-1;
1300 ret
= btrfs_lookup_file_extent(NULL
, root
, path
, ino
,
1304 if (ret
> 0 && path
->slots
[0] > 0 && check_prev
) {
1305 leaf
= path
->nodes
[0];
1306 btrfs_item_key_to_cpu(leaf
, &found_key
,
1307 path
->slots
[0] - 1);
1308 if (found_key
.objectid
== ino
&&
1309 found_key
.type
== BTRFS_EXTENT_DATA_KEY
)
1314 leaf
= path
->nodes
[0];
1315 if (path
->slots
[0] >= btrfs_header_nritems(leaf
)) {
1316 ret
= btrfs_next_leaf(root
, path
);
1321 leaf
= path
->nodes
[0];
1327 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
1329 if (found_key
.objectid
> ino
)
1331 if (WARN_ON_ONCE(found_key
.objectid
< ino
) ||
1332 found_key
.type
< BTRFS_EXTENT_DATA_KEY
) {
1336 if (found_key
.type
> BTRFS_EXTENT_DATA_KEY
||
1337 found_key
.offset
> end
)
1340 if (found_key
.offset
> cur_offset
) {
1341 extent_end
= found_key
.offset
;
1346 fi
= btrfs_item_ptr(leaf
, path
->slots
[0],
1347 struct btrfs_file_extent_item
);
1348 extent_type
= btrfs_file_extent_type(leaf
, fi
);
1350 ram_bytes
= btrfs_file_extent_ram_bytes(leaf
, fi
);
1351 if (extent_type
== BTRFS_FILE_EXTENT_REG
||
1352 extent_type
== BTRFS_FILE_EXTENT_PREALLOC
) {
1353 disk_bytenr
= btrfs_file_extent_disk_bytenr(leaf
, fi
);
1354 extent_offset
= btrfs_file_extent_offset(leaf
, fi
);
1355 extent_end
= found_key
.offset
+
1356 btrfs_file_extent_num_bytes(leaf
, fi
);
1358 btrfs_file_extent_disk_num_bytes(leaf
, fi
);
1359 if (extent_end
<= start
) {
1363 if (disk_bytenr
== 0)
1365 if (btrfs_file_extent_compression(leaf
, fi
) ||
1366 btrfs_file_extent_encryption(leaf
, fi
) ||
1367 btrfs_file_extent_other_encoding(leaf
, fi
))
1369 if (extent_type
== BTRFS_FILE_EXTENT_REG
&& !force
)
1371 if (btrfs_extent_readonly(fs_info
, disk_bytenr
))
1373 if (btrfs_cross_ref_exist(root
, ino
,
1375 extent_offset
, disk_bytenr
))
1377 disk_bytenr
+= extent_offset
;
1378 disk_bytenr
+= cur_offset
- found_key
.offset
;
1379 num_bytes
= min(end
+ 1, extent_end
) - cur_offset
;
1381 * if there are pending snapshots for this root,
1382 * we fall into common COW way.
1385 err
= btrfs_start_write_no_snapshoting(root
);
1390 * force cow if csum exists in the range.
1391 * this ensure that csum for a given extent are
1392 * either valid or do not exist.
1394 if (csum_exist_in_range(fs_info
, disk_bytenr
,
1397 btrfs_end_write_no_snapshoting(root
);
1400 if (!btrfs_inc_nocow_writers(fs_info
, disk_bytenr
)) {
1402 btrfs_end_write_no_snapshoting(root
);
1406 } else if (extent_type
== BTRFS_FILE_EXTENT_INLINE
) {
1407 extent_end
= found_key
.offset
+
1408 btrfs_file_extent_inline_len(leaf
,
1409 path
->slots
[0], fi
);
1410 extent_end
= ALIGN(extent_end
,
1411 fs_info
->sectorsize
);
1416 if (extent_end
<= start
) {
1418 if (!nolock
&& nocow
)
1419 btrfs_end_write_no_snapshoting(root
);
1421 btrfs_dec_nocow_writers(fs_info
, disk_bytenr
);
1425 if (cow_start
== (u64
)-1)
1426 cow_start
= cur_offset
;
1427 cur_offset
= extent_end
;
1428 if (cur_offset
> end
)
1434 btrfs_release_path(path
);
1435 if (cow_start
!= (u64
)-1) {
1436 ret
= cow_file_range(inode
, locked_page
,
1437 cow_start
, found_key
.offset
- 1,
1438 end
, page_started
, nr_written
, 1,
1441 if (!nolock
&& nocow
)
1442 btrfs_end_write_no_snapshoting(root
);
1444 btrfs_dec_nocow_writers(fs_info
,
1448 cow_start
= (u64
)-1;
1451 if (extent_type
== BTRFS_FILE_EXTENT_PREALLOC
) {
1452 u64 orig_start
= found_key
.offset
- extent_offset
;
1454 em
= create_io_em(inode
, cur_offset
, num_bytes
,
1456 disk_bytenr
, /* block_start */
1457 num_bytes
, /* block_len */
1458 disk_num_bytes
, /* orig_block_len */
1459 ram_bytes
, BTRFS_COMPRESS_NONE
,
1460 BTRFS_ORDERED_PREALLOC
);
1462 if (!nolock
&& nocow
)
1463 btrfs_end_write_no_snapshoting(root
);
1465 btrfs_dec_nocow_writers(fs_info
,
1470 free_extent_map(em
);
1473 if (extent_type
== BTRFS_FILE_EXTENT_PREALLOC
) {
1474 type
= BTRFS_ORDERED_PREALLOC
;
1476 type
= BTRFS_ORDERED_NOCOW
;
1479 ret
= btrfs_add_ordered_extent(inode
, cur_offset
, disk_bytenr
,
1480 num_bytes
, num_bytes
, type
);
1482 btrfs_dec_nocow_writers(fs_info
, disk_bytenr
);
1483 BUG_ON(ret
); /* -ENOMEM */
1485 if (root
->root_key
.objectid
==
1486 BTRFS_DATA_RELOC_TREE_OBJECTID
)
1488 * Error handled later, as we must prevent
1489 * extent_clear_unlock_delalloc() in error handler
1490 * from freeing metadata of created ordered extent.
1492 ret
= btrfs_reloc_clone_csums(inode
, cur_offset
,
1495 extent_clear_unlock_delalloc(inode
, cur_offset
,
1496 cur_offset
+ num_bytes
- 1, end
,
1497 locked_page
, EXTENT_LOCKED
|
1499 EXTENT_CLEAR_DATA_RESV
,
1500 PAGE_UNLOCK
| PAGE_SET_PRIVATE2
);
1502 if (!nolock
&& nocow
)
1503 btrfs_end_write_no_snapshoting(root
);
1504 cur_offset
= extent_end
;
1507 * btrfs_reloc_clone_csums() error, now we're OK to call error
1508 * handler, as metadata for created ordered extent will only
1509 * be freed by btrfs_finish_ordered_io().
1513 if (cur_offset
> end
)
1516 btrfs_release_path(path
);
1518 if (cur_offset
<= end
&& cow_start
== (u64
)-1) {
1519 cow_start
= cur_offset
;
1523 if (cow_start
!= (u64
)-1) {
1524 ret
= cow_file_range(inode
, locked_page
, cow_start
, end
, end
,
1525 page_started
, nr_written
, 1, NULL
);
1531 if (ret
&& cur_offset
< end
)
1532 extent_clear_unlock_delalloc(inode
, cur_offset
, end
, end
,
1533 locked_page
, EXTENT_LOCKED
|
1534 EXTENT_DELALLOC
| EXTENT_DEFRAG
|
1535 EXTENT_DO_ACCOUNTING
, PAGE_UNLOCK
|
1537 PAGE_SET_WRITEBACK
|
1538 PAGE_END_WRITEBACK
);
1539 btrfs_free_path(path
);
1543 static inline int need_force_cow(struct inode
*inode
, u64 start
, u64 end
)
1546 if (!(BTRFS_I(inode
)->flags
& BTRFS_INODE_NODATACOW
) &&
1547 !(BTRFS_I(inode
)->flags
& BTRFS_INODE_PREALLOC
))
1551 * @defrag_bytes is a hint value, no spinlock held here,
1552 * if is not zero, it means the file is defragging.
1553 * Force cow if given extent needs to be defragged.
1555 if (BTRFS_I(inode
)->defrag_bytes
&&
1556 test_range_bit(&BTRFS_I(inode
)->io_tree
, start
, end
,
1557 EXTENT_DEFRAG
, 0, NULL
))
1564 * extent_io.c call back to do delayed allocation processing
1566 static int run_delalloc_range(void *private_data
, struct page
*locked_page
,
1567 u64 start
, u64 end
, int *page_started
,
1568 unsigned long *nr_written
)
1570 struct inode
*inode
= private_data
;
1572 int force_cow
= need_force_cow(inode
, start
, end
);
1574 if (BTRFS_I(inode
)->flags
& BTRFS_INODE_NODATACOW
&& !force_cow
) {
1575 ret
= run_delalloc_nocow(inode
, locked_page
, start
, end
,
1576 page_started
, 1, nr_written
);
1577 } else if (BTRFS_I(inode
)->flags
& BTRFS_INODE_PREALLOC
&& !force_cow
) {
1578 ret
= run_delalloc_nocow(inode
, locked_page
, start
, end
,
1579 page_started
, 0, nr_written
);
1580 } else if (!inode_need_compress(inode
)) {
1581 ret
= cow_file_range(inode
, locked_page
, start
, end
, end
,
1582 page_started
, nr_written
, 1, NULL
);
1584 set_bit(BTRFS_INODE_HAS_ASYNC_EXTENT
,
1585 &BTRFS_I(inode
)->runtime_flags
);
1586 ret
= cow_file_range_async(inode
, locked_page
, start
, end
,
1587 page_started
, nr_written
);
1590 btrfs_cleanup_ordered_extents(inode
, start
, end
- start
+ 1);
1594 static void btrfs_split_extent_hook(void *private_data
,
1595 struct extent_state
*orig
, u64 split
)
1597 struct inode
*inode
= private_data
;
1600 /* not delalloc, ignore it */
1601 if (!(orig
->state
& EXTENT_DELALLOC
))
1604 size
= orig
->end
- orig
->start
+ 1;
1605 if (size
> BTRFS_MAX_EXTENT_SIZE
) {
1610 * See the explanation in btrfs_merge_extent_hook, the same
1611 * applies here, just in reverse.
1613 new_size
= orig
->end
- split
+ 1;
1614 num_extents
= count_max_extents(new_size
);
1615 new_size
= split
- orig
->start
;
1616 num_extents
+= count_max_extents(new_size
);
1617 if (count_max_extents(size
) >= num_extents
)
1621 spin_lock(&BTRFS_I(inode
)->lock
);
1622 BTRFS_I(inode
)->outstanding_extents
++;
1623 spin_unlock(&BTRFS_I(inode
)->lock
);
1627 * extent_io.c merge_extent_hook, used to track merged delayed allocation
1628 * extents so we can keep track of new extents that are just merged onto old
1629 * extents, such as when we are doing sequential writes, so we can properly
1630 * account for the metadata space we'll need.
1632 static void btrfs_merge_extent_hook(void *private_data
,
1633 struct extent_state
*new,
1634 struct extent_state
*other
)
1636 struct inode
*inode
= private_data
;
1637 u64 new_size
, old_size
;
1640 /* not delalloc, ignore it */
1641 if (!(other
->state
& EXTENT_DELALLOC
))
1644 if (new->start
> other
->start
)
1645 new_size
= new->end
- other
->start
+ 1;
1647 new_size
= other
->end
- new->start
+ 1;
1649 /* we're not bigger than the max, unreserve the space and go */
1650 if (new_size
<= BTRFS_MAX_EXTENT_SIZE
) {
1651 spin_lock(&BTRFS_I(inode
)->lock
);
1652 BTRFS_I(inode
)->outstanding_extents
--;
1653 spin_unlock(&BTRFS_I(inode
)->lock
);
1658 * We have to add up either side to figure out how many extents were
1659 * accounted for before we merged into one big extent. If the number of
1660 * extents we accounted for is <= the amount we need for the new range
1661 * then we can return, otherwise drop. Think of it like this
1665 * So we've grown the extent by a MAX_SIZE extent, this would mean we
1666 * need 2 outstanding extents, on one side we have 1 and the other side
1667 * we have 1 so they are == and we can return. But in this case
1669 * [MAX_SIZE+4k][MAX_SIZE+4k]
1671 * Each range on their own accounts for 2 extents, but merged together
1672 * they are only 3 extents worth of accounting, so we need to drop in
1675 old_size
= other
->end
- other
->start
+ 1;
1676 num_extents
= count_max_extents(old_size
);
1677 old_size
= new->end
- new->start
+ 1;
1678 num_extents
+= count_max_extents(old_size
);
1679 if (count_max_extents(new_size
) >= num_extents
)
1682 spin_lock(&BTRFS_I(inode
)->lock
);
1683 BTRFS_I(inode
)->outstanding_extents
--;
1684 spin_unlock(&BTRFS_I(inode
)->lock
);
1687 static void btrfs_add_delalloc_inodes(struct btrfs_root
*root
,
1688 struct inode
*inode
)
1690 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
1692 spin_lock(&root
->delalloc_lock
);
1693 if (list_empty(&BTRFS_I(inode
)->delalloc_inodes
)) {
1694 list_add_tail(&BTRFS_I(inode
)->delalloc_inodes
,
1695 &root
->delalloc_inodes
);
1696 set_bit(BTRFS_INODE_IN_DELALLOC_LIST
,
1697 &BTRFS_I(inode
)->runtime_flags
);
1698 root
->nr_delalloc_inodes
++;
1699 if (root
->nr_delalloc_inodes
== 1) {
1700 spin_lock(&fs_info
->delalloc_root_lock
);
1701 BUG_ON(!list_empty(&root
->delalloc_root
));
1702 list_add_tail(&root
->delalloc_root
,
1703 &fs_info
->delalloc_roots
);
1704 spin_unlock(&fs_info
->delalloc_root_lock
);
1707 spin_unlock(&root
->delalloc_lock
);
1710 static void btrfs_del_delalloc_inode(struct btrfs_root
*root
,
1711 struct btrfs_inode
*inode
)
1713 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->vfs_inode
.i_sb
);
1715 spin_lock(&root
->delalloc_lock
);
1716 if (!list_empty(&inode
->delalloc_inodes
)) {
1717 list_del_init(&inode
->delalloc_inodes
);
1718 clear_bit(BTRFS_INODE_IN_DELALLOC_LIST
,
1719 &inode
->runtime_flags
);
1720 root
->nr_delalloc_inodes
--;
1721 if (!root
->nr_delalloc_inodes
) {
1722 spin_lock(&fs_info
->delalloc_root_lock
);
1723 BUG_ON(list_empty(&root
->delalloc_root
));
1724 list_del_init(&root
->delalloc_root
);
1725 spin_unlock(&fs_info
->delalloc_root_lock
);
1728 spin_unlock(&root
->delalloc_lock
);
1732 * extent_io.c set_bit_hook, used to track delayed allocation
1733 * bytes in this file, and to maintain the list of inodes that
1734 * have pending delalloc work to be done.
1736 static void btrfs_set_bit_hook(void *private_data
,
1737 struct extent_state
*state
, unsigned *bits
)
1739 struct inode
*inode
= private_data
;
1741 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
1743 if ((*bits
& EXTENT_DEFRAG
) && !(*bits
& EXTENT_DELALLOC
))
1746 * set_bit and clear bit hooks normally require _irqsave/restore
1747 * but in this case, we are only testing for the DELALLOC
1748 * bit, which is only set or cleared with irqs on
1750 if (!(state
->state
& EXTENT_DELALLOC
) && (*bits
& EXTENT_DELALLOC
)) {
1751 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1752 u64 len
= state
->end
+ 1 - state
->start
;
1753 bool do_list
= !btrfs_is_free_space_inode(BTRFS_I(inode
));
1755 if (*bits
& EXTENT_FIRST_DELALLOC
) {
1756 *bits
&= ~EXTENT_FIRST_DELALLOC
;
1758 spin_lock(&BTRFS_I(inode
)->lock
);
1759 BTRFS_I(inode
)->outstanding_extents
++;
1760 spin_unlock(&BTRFS_I(inode
)->lock
);
1763 /* For sanity tests */
1764 if (btrfs_is_testing(fs_info
))
1767 __percpu_counter_add(&fs_info
->delalloc_bytes
, len
,
1768 fs_info
->delalloc_batch
);
1769 spin_lock(&BTRFS_I(inode
)->lock
);
1770 BTRFS_I(inode
)->delalloc_bytes
+= len
;
1771 if (*bits
& EXTENT_DEFRAG
)
1772 BTRFS_I(inode
)->defrag_bytes
+= len
;
1773 if (do_list
&& !test_bit(BTRFS_INODE_IN_DELALLOC_LIST
,
1774 &BTRFS_I(inode
)->runtime_flags
))
1775 btrfs_add_delalloc_inodes(root
, inode
);
1776 spin_unlock(&BTRFS_I(inode
)->lock
);
1779 if (!(state
->state
& EXTENT_DELALLOC_NEW
) &&
1780 (*bits
& EXTENT_DELALLOC_NEW
)) {
1781 spin_lock(&BTRFS_I(inode
)->lock
);
1782 BTRFS_I(inode
)->new_delalloc_bytes
+= state
->end
+ 1 -
1784 spin_unlock(&BTRFS_I(inode
)->lock
);
1789 * extent_io.c clear_bit_hook, see set_bit_hook for why
1791 static void btrfs_clear_bit_hook(void *private_data
,
1792 struct extent_state
*state
,
1795 struct btrfs_inode
*inode
= BTRFS_I((struct inode
*)private_data
);
1796 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->vfs_inode
.i_sb
);
1797 u64 len
= state
->end
+ 1 - state
->start
;
1798 u32 num_extents
= count_max_extents(len
);
1800 spin_lock(&inode
->lock
);
1801 if ((state
->state
& EXTENT_DEFRAG
) && (*bits
& EXTENT_DEFRAG
))
1802 inode
->defrag_bytes
-= len
;
1803 spin_unlock(&inode
->lock
);
1806 * set_bit and clear bit hooks normally require _irqsave/restore
1807 * but in this case, we are only testing for the DELALLOC
1808 * bit, which is only set or cleared with irqs on
1810 if ((state
->state
& EXTENT_DELALLOC
) && (*bits
& EXTENT_DELALLOC
)) {
1811 struct btrfs_root
*root
= inode
->root
;
1812 bool do_list
= !btrfs_is_free_space_inode(inode
);
1814 if (*bits
& EXTENT_FIRST_DELALLOC
) {
1815 *bits
&= ~EXTENT_FIRST_DELALLOC
;
1816 } else if (!(*bits
& EXTENT_CLEAR_META_RESV
)) {
1817 spin_lock(&inode
->lock
);
1818 inode
->outstanding_extents
-= num_extents
;
1819 spin_unlock(&inode
->lock
);
1823 * We don't reserve metadata space for space cache inodes so we
1824 * don't need to call dellalloc_release_metadata if there is an
1827 if (*bits
& EXTENT_CLEAR_META_RESV
&&
1828 root
!= fs_info
->tree_root
)
1829 btrfs_delalloc_release_metadata(inode
, len
);
1831 /* For sanity tests. */
1832 if (btrfs_is_testing(fs_info
))
1835 if (root
->root_key
.objectid
!= BTRFS_DATA_RELOC_TREE_OBJECTID
&&
1836 do_list
&& !(state
->state
& EXTENT_NORESERVE
) &&
1837 (*bits
& EXTENT_CLEAR_DATA_RESV
))
1838 btrfs_free_reserved_data_space_noquota(
1842 __percpu_counter_add(&fs_info
->delalloc_bytes
, -len
,
1843 fs_info
->delalloc_batch
);
1844 spin_lock(&inode
->lock
);
1845 inode
->delalloc_bytes
-= len
;
1846 if (do_list
&& inode
->delalloc_bytes
== 0 &&
1847 test_bit(BTRFS_INODE_IN_DELALLOC_LIST
,
1848 &inode
->runtime_flags
))
1849 btrfs_del_delalloc_inode(root
, inode
);
1850 spin_unlock(&inode
->lock
);
1853 if ((state
->state
& EXTENT_DELALLOC_NEW
) &&
1854 (*bits
& EXTENT_DELALLOC_NEW
)) {
1855 spin_lock(&inode
->lock
);
1856 ASSERT(inode
->new_delalloc_bytes
>= len
);
1857 inode
->new_delalloc_bytes
-= len
;
1858 spin_unlock(&inode
->lock
);
1863 * extent_io.c merge_bio_hook, this must check the chunk tree to make sure
1864 * we don't create bios that span stripes or chunks
1866 * return 1 if page cannot be merged to bio
1867 * return 0 if page can be merged to bio
1868 * return error otherwise
1870 int btrfs_merge_bio_hook(struct page
*page
, unsigned long offset
,
1871 size_t size
, struct bio
*bio
,
1872 unsigned long bio_flags
)
1874 struct inode
*inode
= page
->mapping
->host
;
1875 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
1876 u64 logical
= (u64
)bio
->bi_iter
.bi_sector
<< 9;
1881 if (bio_flags
& EXTENT_BIO_COMPRESSED
)
1884 length
= bio
->bi_iter
.bi_size
;
1885 map_length
= length
;
1886 ret
= btrfs_map_block(fs_info
, btrfs_op(bio
), logical
, &map_length
,
1890 if (map_length
< length
+ size
)
1896 * in order to insert checksums into the metadata in large chunks,
1897 * we wait until bio submission time. All the pages in the bio are
1898 * checksummed and sums are attached onto the ordered extent record.
1900 * At IO completion time the cums attached on the ordered extent record
1901 * are inserted into the btree
1903 static int __btrfs_submit_bio_start(void *private_data
, struct bio
*bio
,
1904 int mirror_num
, unsigned long bio_flags
,
1907 struct inode
*inode
= private_data
;
1910 ret
= btrfs_csum_one_bio(inode
, bio
, 0, 0);
1911 BUG_ON(ret
); /* -ENOMEM */
1916 * in order to insert checksums into the metadata in large chunks,
1917 * we wait until bio submission time. All the pages in the bio are
1918 * checksummed and sums are attached onto the ordered extent record.
1920 * At IO completion time the cums attached on the ordered extent record
1921 * are inserted into the btree
1923 static int __btrfs_submit_bio_done(void *private_data
, struct bio
*bio
,
1924 int mirror_num
, unsigned long bio_flags
,
1927 struct inode
*inode
= private_data
;
1928 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
1931 ret
= btrfs_map_bio(fs_info
, bio
, mirror_num
, 1);
1933 bio
->bi_error
= ret
;
1940 * extent_io.c submission hook. This does the right thing for csum calculation
1941 * on write, or reading the csums from the tree before a read
1943 static int btrfs_submit_bio_hook(void *private_data
, struct bio
*bio
,
1944 int mirror_num
, unsigned long bio_flags
,
1947 struct inode
*inode
= private_data
;
1948 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
1949 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1950 enum btrfs_wq_endio_type metadata
= BTRFS_WQ_ENDIO_DATA
;
1953 int async
= !atomic_read(&BTRFS_I(inode
)->sync_writers
);
1955 skip_sum
= BTRFS_I(inode
)->flags
& BTRFS_INODE_NODATASUM
;
1957 if (btrfs_is_free_space_inode(BTRFS_I(inode
)))
1958 metadata
= BTRFS_WQ_ENDIO_FREE_SPACE
;
1960 if (bio_op(bio
) != REQ_OP_WRITE
) {
1961 ret
= btrfs_bio_wq_end_io(fs_info
, bio
, metadata
);
1965 if (bio_flags
& EXTENT_BIO_COMPRESSED
) {
1966 ret
= btrfs_submit_compressed_read(inode
, bio
,
1970 } else if (!skip_sum
) {
1971 ret
= btrfs_lookup_bio_sums(inode
, bio
, NULL
);
1976 } else if (async
&& !skip_sum
) {
1977 /* csum items have already been cloned */
1978 if (root
->root_key
.objectid
== BTRFS_DATA_RELOC_TREE_OBJECTID
)
1980 /* we're doing a write, do the async checksumming */
1981 ret
= btrfs_wq_submit_bio(fs_info
, bio
, mirror_num
, bio_flags
,
1983 __btrfs_submit_bio_start
,
1984 __btrfs_submit_bio_done
);
1986 } else if (!skip_sum
) {
1987 ret
= btrfs_csum_one_bio(inode
, bio
, 0, 0);
1993 ret
= btrfs_map_bio(fs_info
, bio
, mirror_num
, 0);
1997 bio
->bi_error
= ret
;
2004 * given a list of ordered sums record them in the inode. This happens
2005 * at IO completion time based on sums calculated at bio submission time.
2007 static noinline
int add_pending_csums(struct btrfs_trans_handle
*trans
,
2008 struct inode
*inode
, struct list_head
*list
)
2010 struct btrfs_ordered_sum
*sum
;
2012 list_for_each_entry(sum
, list
, list
) {
2013 trans
->adding_csums
= 1;
2014 btrfs_csum_file_blocks(trans
,
2015 BTRFS_I(inode
)->root
->fs_info
->csum_root
, sum
);
2016 trans
->adding_csums
= 0;
2021 int btrfs_set_extent_delalloc(struct inode
*inode
, u64 start
, u64 end
,
2022 struct extent_state
**cached_state
, int dedupe
)
2024 WARN_ON((end
& (PAGE_SIZE
- 1)) == 0);
2025 return set_extent_delalloc(&BTRFS_I(inode
)->io_tree
, start
, end
,
2029 /* see btrfs_writepage_start_hook for details on why this is required */
2030 struct btrfs_writepage_fixup
{
2032 struct btrfs_work work
;
2035 static void btrfs_writepage_fixup_worker(struct btrfs_work
*work
)
2037 struct btrfs_writepage_fixup
*fixup
;
2038 struct btrfs_ordered_extent
*ordered
;
2039 struct extent_state
*cached_state
= NULL
;
2040 struct extent_changeset
*data_reserved
= NULL
;
2042 struct inode
*inode
;
2047 fixup
= container_of(work
, struct btrfs_writepage_fixup
, work
);
2051 if (!page
->mapping
|| !PageDirty(page
) || !PageChecked(page
)) {
2052 ClearPageChecked(page
);
2056 inode
= page
->mapping
->host
;
2057 page_start
= page_offset(page
);
2058 page_end
= page_offset(page
) + PAGE_SIZE
- 1;
2060 lock_extent_bits(&BTRFS_I(inode
)->io_tree
, page_start
, page_end
,
2063 /* already ordered? We're done */
2064 if (PagePrivate2(page
))
2067 ordered
= btrfs_lookup_ordered_range(BTRFS_I(inode
), page_start
,
2070 unlock_extent_cached(&BTRFS_I(inode
)->io_tree
, page_start
,
2071 page_end
, &cached_state
, GFP_NOFS
);
2073 btrfs_start_ordered_extent(inode
, ordered
, 1);
2074 btrfs_put_ordered_extent(ordered
);
2078 ret
= btrfs_delalloc_reserve_space(inode
, &data_reserved
, page_start
,
2081 mapping_set_error(page
->mapping
, ret
);
2082 end_extent_writepage(page
, ret
, page_start
, page_end
);
2083 ClearPageChecked(page
);
2087 btrfs_set_extent_delalloc(inode
, page_start
, page_end
, &cached_state
,
2089 ClearPageChecked(page
);
2090 set_page_dirty(page
);
2092 unlock_extent_cached(&BTRFS_I(inode
)->io_tree
, page_start
, page_end
,
2093 &cached_state
, GFP_NOFS
);
2098 extent_changeset_free(data_reserved
);
2102 * There are a few paths in the higher layers of the kernel that directly
2103 * set the page dirty bit without asking the filesystem if it is a
2104 * good idea. This causes problems because we want to make sure COW
2105 * properly happens and the data=ordered rules are followed.
2107 * In our case any range that doesn't have the ORDERED bit set
2108 * hasn't been properly setup for IO. We kick off an async process
2109 * to fix it up. The async helper will wait for ordered extents, set
2110 * the delalloc bit and make it safe to write the page.
2112 static int btrfs_writepage_start_hook(struct page
*page
, u64 start
, u64 end
)
2114 struct inode
*inode
= page
->mapping
->host
;
2115 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
2116 struct btrfs_writepage_fixup
*fixup
;
2118 /* this page is properly in the ordered list */
2119 if (TestClearPagePrivate2(page
))
2122 if (PageChecked(page
))
2125 fixup
= kzalloc(sizeof(*fixup
), GFP_NOFS
);
2129 SetPageChecked(page
);
2131 btrfs_init_work(&fixup
->work
, btrfs_fixup_helper
,
2132 btrfs_writepage_fixup_worker
, NULL
, NULL
);
2134 btrfs_queue_work(fs_info
->fixup_workers
, &fixup
->work
);
2138 static int insert_reserved_file_extent(struct btrfs_trans_handle
*trans
,
2139 struct inode
*inode
, u64 file_pos
,
2140 u64 disk_bytenr
, u64 disk_num_bytes
,
2141 u64 num_bytes
, u64 ram_bytes
,
2142 u8 compression
, u8 encryption
,
2143 u16 other_encoding
, int extent_type
)
2145 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
2146 struct btrfs_file_extent_item
*fi
;
2147 struct btrfs_path
*path
;
2148 struct extent_buffer
*leaf
;
2149 struct btrfs_key ins
;
2151 int extent_inserted
= 0;
2154 path
= btrfs_alloc_path();
2159 * we may be replacing one extent in the tree with another.
2160 * The new extent is pinned in the extent map, and we don't want
2161 * to drop it from the cache until it is completely in the btree.
2163 * So, tell btrfs_drop_extents to leave this extent in the cache.
2164 * the caller is expected to unpin it and allow it to be merged
2167 ret
= __btrfs_drop_extents(trans
, root
, inode
, path
, file_pos
,
2168 file_pos
+ num_bytes
, NULL
, 0,
2169 1, sizeof(*fi
), &extent_inserted
);
2173 if (!extent_inserted
) {
2174 ins
.objectid
= btrfs_ino(BTRFS_I(inode
));
2175 ins
.offset
= file_pos
;
2176 ins
.type
= BTRFS_EXTENT_DATA_KEY
;
2178 path
->leave_spinning
= 1;
2179 ret
= btrfs_insert_empty_item(trans
, root
, path
, &ins
,
2184 leaf
= path
->nodes
[0];
2185 fi
= btrfs_item_ptr(leaf
, path
->slots
[0],
2186 struct btrfs_file_extent_item
);
2187 btrfs_set_file_extent_generation(leaf
, fi
, trans
->transid
);
2188 btrfs_set_file_extent_type(leaf
, fi
, extent_type
);
2189 btrfs_set_file_extent_disk_bytenr(leaf
, fi
, disk_bytenr
);
2190 btrfs_set_file_extent_disk_num_bytes(leaf
, fi
, disk_num_bytes
);
2191 btrfs_set_file_extent_offset(leaf
, fi
, 0);
2192 btrfs_set_file_extent_num_bytes(leaf
, fi
, num_bytes
);
2193 btrfs_set_file_extent_ram_bytes(leaf
, fi
, ram_bytes
);
2194 btrfs_set_file_extent_compression(leaf
, fi
, compression
);
2195 btrfs_set_file_extent_encryption(leaf
, fi
, encryption
);
2196 btrfs_set_file_extent_other_encoding(leaf
, fi
, other_encoding
);
2198 btrfs_mark_buffer_dirty(leaf
);
2199 btrfs_release_path(path
);
2201 inode_add_bytes(inode
, num_bytes
);
2203 ins
.objectid
= disk_bytenr
;
2204 ins
.offset
= disk_num_bytes
;
2205 ins
.type
= BTRFS_EXTENT_ITEM_KEY
;
2208 * Release the reserved range from inode dirty range map, as it is
2209 * already moved into delayed_ref_head
2211 ret
= btrfs_qgroup_release_data(inode
, file_pos
, ram_bytes
);
2215 ret
= btrfs_alloc_reserved_file_extent(trans
, root
->root_key
.objectid
,
2216 btrfs_ino(BTRFS_I(inode
)), file_pos
, qg_released
, &ins
);
2218 btrfs_free_path(path
);
2223 /* snapshot-aware defrag */
2224 struct sa_defrag_extent_backref
{
2225 struct rb_node node
;
2226 struct old_sa_defrag_extent
*old
;
2235 struct old_sa_defrag_extent
{
2236 struct list_head list
;
2237 struct new_sa_defrag_extent
*new;
2246 struct new_sa_defrag_extent
{
2247 struct rb_root root
;
2248 struct list_head head
;
2249 struct btrfs_path
*path
;
2250 struct inode
*inode
;
2258 static int backref_comp(struct sa_defrag_extent_backref
*b1
,
2259 struct sa_defrag_extent_backref
*b2
)
2261 if (b1
->root_id
< b2
->root_id
)
2263 else if (b1
->root_id
> b2
->root_id
)
2266 if (b1
->inum
< b2
->inum
)
2268 else if (b1
->inum
> b2
->inum
)
2271 if (b1
->file_pos
< b2
->file_pos
)
2273 else if (b1
->file_pos
> b2
->file_pos
)
2277 * [------------------------------] ===> (a range of space)
2278 * |<--->| |<---->| =============> (fs/file tree A)
2279 * |<---------------------------->| ===> (fs/file tree B)
2281 * A range of space can refer to two file extents in one tree while
2282 * refer to only one file extent in another tree.
2284 * So we may process a disk offset more than one time(two extents in A)
2285 * and locate at the same extent(one extent in B), then insert two same
2286 * backrefs(both refer to the extent in B).
2291 static void backref_insert(struct rb_root
*root
,
2292 struct sa_defrag_extent_backref
*backref
)
2294 struct rb_node
**p
= &root
->rb_node
;
2295 struct rb_node
*parent
= NULL
;
2296 struct sa_defrag_extent_backref
*entry
;
2301 entry
= rb_entry(parent
, struct sa_defrag_extent_backref
, node
);
2303 ret
= backref_comp(backref
, entry
);
2307 p
= &(*p
)->rb_right
;
2310 rb_link_node(&backref
->node
, parent
, p
);
2311 rb_insert_color(&backref
->node
, root
);
2315 * Note the backref might has changed, and in this case we just return 0.
2317 static noinline
int record_one_backref(u64 inum
, u64 offset
, u64 root_id
,
2320 struct btrfs_file_extent_item
*extent
;
2321 struct old_sa_defrag_extent
*old
= ctx
;
2322 struct new_sa_defrag_extent
*new = old
->new;
2323 struct btrfs_path
*path
= new->path
;
2324 struct btrfs_key key
;
2325 struct btrfs_root
*root
;
2326 struct sa_defrag_extent_backref
*backref
;
2327 struct extent_buffer
*leaf
;
2328 struct inode
*inode
= new->inode
;
2329 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
2335 if (BTRFS_I(inode
)->root
->root_key
.objectid
== root_id
&&
2336 inum
== btrfs_ino(BTRFS_I(inode
)))
2339 key
.objectid
= root_id
;
2340 key
.type
= BTRFS_ROOT_ITEM_KEY
;
2341 key
.offset
= (u64
)-1;
2343 root
= btrfs_read_fs_root_no_name(fs_info
, &key
);
2345 if (PTR_ERR(root
) == -ENOENT
)
2348 btrfs_debug(fs_info
, "inum=%llu, offset=%llu, root_id=%llu",
2349 inum
, offset
, root_id
);
2350 return PTR_ERR(root
);
2353 key
.objectid
= inum
;
2354 key
.type
= BTRFS_EXTENT_DATA_KEY
;
2355 if (offset
> (u64
)-1 << 32)
2358 key
.offset
= offset
;
2360 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
2361 if (WARN_ON(ret
< 0))
2368 leaf
= path
->nodes
[0];
2369 slot
= path
->slots
[0];
2371 if (slot
>= btrfs_header_nritems(leaf
)) {
2372 ret
= btrfs_next_leaf(root
, path
);
2375 } else if (ret
> 0) {
2384 btrfs_item_key_to_cpu(leaf
, &key
, slot
);
2386 if (key
.objectid
> inum
)
2389 if (key
.objectid
< inum
|| key
.type
!= BTRFS_EXTENT_DATA_KEY
)
2392 extent
= btrfs_item_ptr(leaf
, slot
,
2393 struct btrfs_file_extent_item
);
2395 if (btrfs_file_extent_disk_bytenr(leaf
, extent
) != old
->bytenr
)
2399 * 'offset' refers to the exact key.offset,
2400 * NOT the 'offset' field in btrfs_extent_data_ref, ie.
2401 * (key.offset - extent_offset).
2403 if (key
.offset
!= offset
)
2406 extent_offset
= btrfs_file_extent_offset(leaf
, extent
);
2407 num_bytes
= btrfs_file_extent_num_bytes(leaf
, extent
);
2409 if (extent_offset
>= old
->extent_offset
+ old
->offset
+
2410 old
->len
|| extent_offset
+ num_bytes
<=
2411 old
->extent_offset
+ old
->offset
)
2416 backref
= kmalloc(sizeof(*backref
), GFP_NOFS
);
2422 backref
->root_id
= root_id
;
2423 backref
->inum
= inum
;
2424 backref
->file_pos
= offset
;
2425 backref
->num_bytes
= num_bytes
;
2426 backref
->extent_offset
= extent_offset
;
2427 backref
->generation
= btrfs_file_extent_generation(leaf
, extent
);
2429 backref_insert(&new->root
, backref
);
2432 btrfs_release_path(path
);
2437 static noinline
bool record_extent_backrefs(struct btrfs_path
*path
,
2438 struct new_sa_defrag_extent
*new)
2440 struct btrfs_fs_info
*fs_info
= btrfs_sb(new->inode
->i_sb
);
2441 struct old_sa_defrag_extent
*old
, *tmp
;
2446 list_for_each_entry_safe(old
, tmp
, &new->head
, list
) {
2447 ret
= iterate_inodes_from_logical(old
->bytenr
+
2448 old
->extent_offset
, fs_info
,
2449 path
, record_one_backref
,
2451 if (ret
< 0 && ret
!= -ENOENT
)
2454 /* no backref to be processed for this extent */
2456 list_del(&old
->list
);
2461 if (list_empty(&new->head
))
2467 static int relink_is_mergable(struct extent_buffer
*leaf
,
2468 struct btrfs_file_extent_item
*fi
,
2469 struct new_sa_defrag_extent
*new)
2471 if (btrfs_file_extent_disk_bytenr(leaf
, fi
) != new->bytenr
)
2474 if (btrfs_file_extent_type(leaf
, fi
) != BTRFS_FILE_EXTENT_REG
)
2477 if (btrfs_file_extent_compression(leaf
, fi
) != new->compress_type
)
2480 if (btrfs_file_extent_encryption(leaf
, fi
) ||
2481 btrfs_file_extent_other_encoding(leaf
, fi
))
2488 * Note the backref might has changed, and in this case we just return 0.
2490 static noinline
int relink_extent_backref(struct btrfs_path
*path
,
2491 struct sa_defrag_extent_backref
*prev
,
2492 struct sa_defrag_extent_backref
*backref
)
2494 struct btrfs_file_extent_item
*extent
;
2495 struct btrfs_file_extent_item
*item
;
2496 struct btrfs_ordered_extent
*ordered
;
2497 struct btrfs_trans_handle
*trans
;
2498 struct btrfs_root
*root
;
2499 struct btrfs_key key
;
2500 struct extent_buffer
*leaf
;
2501 struct old_sa_defrag_extent
*old
= backref
->old
;
2502 struct new_sa_defrag_extent
*new = old
->new;
2503 struct btrfs_fs_info
*fs_info
= btrfs_sb(new->inode
->i_sb
);
2504 struct inode
*inode
;
2505 struct extent_state
*cached
= NULL
;
2514 if (prev
&& prev
->root_id
== backref
->root_id
&&
2515 prev
->inum
== backref
->inum
&&
2516 prev
->file_pos
+ prev
->num_bytes
== backref
->file_pos
)
2519 /* step 1: get root */
2520 key
.objectid
= backref
->root_id
;
2521 key
.type
= BTRFS_ROOT_ITEM_KEY
;
2522 key
.offset
= (u64
)-1;
2524 index
= srcu_read_lock(&fs_info
->subvol_srcu
);
2526 root
= btrfs_read_fs_root_no_name(fs_info
, &key
);
2528 srcu_read_unlock(&fs_info
->subvol_srcu
, index
);
2529 if (PTR_ERR(root
) == -ENOENT
)
2531 return PTR_ERR(root
);
2534 if (btrfs_root_readonly(root
)) {
2535 srcu_read_unlock(&fs_info
->subvol_srcu
, index
);
2539 /* step 2: get inode */
2540 key
.objectid
= backref
->inum
;
2541 key
.type
= BTRFS_INODE_ITEM_KEY
;
2544 inode
= btrfs_iget(fs_info
->sb
, &key
, root
, NULL
);
2545 if (IS_ERR(inode
)) {
2546 srcu_read_unlock(&fs_info
->subvol_srcu
, index
);
2550 srcu_read_unlock(&fs_info
->subvol_srcu
, index
);
2552 /* step 3: relink backref */
2553 lock_start
= backref
->file_pos
;
2554 lock_end
= backref
->file_pos
+ backref
->num_bytes
- 1;
2555 lock_extent_bits(&BTRFS_I(inode
)->io_tree
, lock_start
, lock_end
,
2558 ordered
= btrfs_lookup_first_ordered_extent(inode
, lock_end
);
2560 btrfs_put_ordered_extent(ordered
);
2564 trans
= btrfs_join_transaction(root
);
2565 if (IS_ERR(trans
)) {
2566 ret
= PTR_ERR(trans
);
2570 key
.objectid
= backref
->inum
;
2571 key
.type
= BTRFS_EXTENT_DATA_KEY
;
2572 key
.offset
= backref
->file_pos
;
2574 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
2577 } else if (ret
> 0) {
2582 extent
= btrfs_item_ptr(path
->nodes
[0], path
->slots
[0],
2583 struct btrfs_file_extent_item
);
2585 if (btrfs_file_extent_generation(path
->nodes
[0], extent
) !=
2586 backref
->generation
)
2589 btrfs_release_path(path
);
2591 start
= backref
->file_pos
;
2592 if (backref
->extent_offset
< old
->extent_offset
+ old
->offset
)
2593 start
+= old
->extent_offset
+ old
->offset
-
2594 backref
->extent_offset
;
2596 len
= min(backref
->extent_offset
+ backref
->num_bytes
,
2597 old
->extent_offset
+ old
->offset
+ old
->len
);
2598 len
-= max(backref
->extent_offset
, old
->extent_offset
+ old
->offset
);
2600 ret
= btrfs_drop_extents(trans
, root
, inode
, start
,
2605 key
.objectid
= btrfs_ino(BTRFS_I(inode
));
2606 key
.type
= BTRFS_EXTENT_DATA_KEY
;
2609 path
->leave_spinning
= 1;
2611 struct btrfs_file_extent_item
*fi
;
2613 struct btrfs_key found_key
;
2615 ret
= btrfs_search_slot(trans
, root
, &key
, path
, 0, 1);
2620 leaf
= path
->nodes
[0];
2621 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
2623 fi
= btrfs_item_ptr(leaf
, path
->slots
[0],
2624 struct btrfs_file_extent_item
);
2625 extent_len
= btrfs_file_extent_num_bytes(leaf
, fi
);
2627 if (extent_len
+ found_key
.offset
== start
&&
2628 relink_is_mergable(leaf
, fi
, new)) {
2629 btrfs_set_file_extent_num_bytes(leaf
, fi
,
2631 btrfs_mark_buffer_dirty(leaf
);
2632 inode_add_bytes(inode
, len
);
2638 btrfs_release_path(path
);
2643 ret
= btrfs_insert_empty_item(trans
, root
, path
, &key
,
2646 btrfs_abort_transaction(trans
, ret
);
2650 leaf
= path
->nodes
[0];
2651 item
= btrfs_item_ptr(leaf
, path
->slots
[0],
2652 struct btrfs_file_extent_item
);
2653 btrfs_set_file_extent_disk_bytenr(leaf
, item
, new->bytenr
);
2654 btrfs_set_file_extent_disk_num_bytes(leaf
, item
, new->disk_len
);
2655 btrfs_set_file_extent_offset(leaf
, item
, start
- new->file_pos
);
2656 btrfs_set_file_extent_num_bytes(leaf
, item
, len
);
2657 btrfs_set_file_extent_ram_bytes(leaf
, item
, new->len
);
2658 btrfs_set_file_extent_generation(leaf
, item
, trans
->transid
);
2659 btrfs_set_file_extent_type(leaf
, item
, BTRFS_FILE_EXTENT_REG
);
2660 btrfs_set_file_extent_compression(leaf
, item
, new->compress_type
);
2661 btrfs_set_file_extent_encryption(leaf
, item
, 0);
2662 btrfs_set_file_extent_other_encoding(leaf
, item
, 0);
2664 btrfs_mark_buffer_dirty(leaf
);
2665 inode_add_bytes(inode
, len
);
2666 btrfs_release_path(path
);
2668 ret
= btrfs_inc_extent_ref(trans
, fs_info
, new->bytenr
,
2670 backref
->root_id
, backref
->inum
,
2671 new->file_pos
); /* start - extent_offset */
2673 btrfs_abort_transaction(trans
, ret
);
2679 btrfs_release_path(path
);
2680 path
->leave_spinning
= 0;
2681 btrfs_end_transaction(trans
);
2683 unlock_extent_cached(&BTRFS_I(inode
)->io_tree
, lock_start
, lock_end
,
2689 static void free_sa_defrag_extent(struct new_sa_defrag_extent
*new)
2691 struct old_sa_defrag_extent
*old
, *tmp
;
2696 list_for_each_entry_safe(old
, tmp
, &new->head
, list
) {
2702 static void relink_file_extents(struct new_sa_defrag_extent
*new)
2704 struct btrfs_fs_info
*fs_info
= btrfs_sb(new->inode
->i_sb
);
2705 struct btrfs_path
*path
;
2706 struct sa_defrag_extent_backref
*backref
;
2707 struct sa_defrag_extent_backref
*prev
= NULL
;
2708 struct inode
*inode
;
2709 struct btrfs_root
*root
;
2710 struct rb_node
*node
;
2714 root
= BTRFS_I(inode
)->root
;
2716 path
= btrfs_alloc_path();
2720 if (!record_extent_backrefs(path
, new)) {
2721 btrfs_free_path(path
);
2724 btrfs_release_path(path
);
2727 node
= rb_first(&new->root
);
2730 rb_erase(node
, &new->root
);
2732 backref
= rb_entry(node
, struct sa_defrag_extent_backref
, node
);
2734 ret
= relink_extent_backref(path
, prev
, backref
);
2747 btrfs_free_path(path
);
2749 free_sa_defrag_extent(new);
2751 atomic_dec(&fs_info
->defrag_running
);
2752 wake_up(&fs_info
->transaction_wait
);
2755 static struct new_sa_defrag_extent
*
2756 record_old_file_extents(struct inode
*inode
,
2757 struct btrfs_ordered_extent
*ordered
)
2759 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
2760 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
2761 struct btrfs_path
*path
;
2762 struct btrfs_key key
;
2763 struct old_sa_defrag_extent
*old
;
2764 struct new_sa_defrag_extent
*new;
2767 new = kmalloc(sizeof(*new), GFP_NOFS
);
2772 new->file_pos
= ordered
->file_offset
;
2773 new->len
= ordered
->len
;
2774 new->bytenr
= ordered
->start
;
2775 new->disk_len
= ordered
->disk_len
;
2776 new->compress_type
= ordered
->compress_type
;
2777 new->root
= RB_ROOT
;
2778 INIT_LIST_HEAD(&new->head
);
2780 path
= btrfs_alloc_path();
2784 key
.objectid
= btrfs_ino(BTRFS_I(inode
));
2785 key
.type
= BTRFS_EXTENT_DATA_KEY
;
2786 key
.offset
= new->file_pos
;
2788 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
2791 if (ret
> 0 && path
->slots
[0] > 0)
2794 /* find out all the old extents for the file range */
2796 struct btrfs_file_extent_item
*extent
;
2797 struct extent_buffer
*l
;
2806 slot
= path
->slots
[0];
2808 if (slot
>= btrfs_header_nritems(l
)) {
2809 ret
= btrfs_next_leaf(root
, path
);
2817 btrfs_item_key_to_cpu(l
, &key
, slot
);
2819 if (key
.objectid
!= btrfs_ino(BTRFS_I(inode
)))
2821 if (key
.type
!= BTRFS_EXTENT_DATA_KEY
)
2823 if (key
.offset
>= new->file_pos
+ new->len
)
2826 extent
= btrfs_item_ptr(l
, slot
, struct btrfs_file_extent_item
);
2828 num_bytes
= btrfs_file_extent_num_bytes(l
, extent
);
2829 if (key
.offset
+ num_bytes
< new->file_pos
)
2832 disk_bytenr
= btrfs_file_extent_disk_bytenr(l
, extent
);
2836 extent_offset
= btrfs_file_extent_offset(l
, extent
);
2838 old
= kmalloc(sizeof(*old
), GFP_NOFS
);
2842 offset
= max(new->file_pos
, key
.offset
);
2843 end
= min(new->file_pos
+ new->len
, key
.offset
+ num_bytes
);
2845 old
->bytenr
= disk_bytenr
;
2846 old
->extent_offset
= extent_offset
;
2847 old
->offset
= offset
- key
.offset
;
2848 old
->len
= end
- offset
;
2851 list_add_tail(&old
->list
, &new->head
);
2857 btrfs_free_path(path
);
2858 atomic_inc(&fs_info
->defrag_running
);
2863 btrfs_free_path(path
);
2865 free_sa_defrag_extent(new);
2869 static void btrfs_release_delalloc_bytes(struct btrfs_fs_info
*fs_info
,
2872 struct btrfs_block_group_cache
*cache
;
2874 cache
= btrfs_lookup_block_group(fs_info
, start
);
2877 spin_lock(&cache
->lock
);
2878 cache
->delalloc_bytes
-= len
;
2879 spin_unlock(&cache
->lock
);
2881 btrfs_put_block_group(cache
);
2884 /* as ordered data IO finishes, this gets called so we can finish
2885 * an ordered extent if the range of bytes in the file it covers are
2888 static int btrfs_finish_ordered_io(struct btrfs_ordered_extent
*ordered_extent
)
2890 struct inode
*inode
= ordered_extent
->inode
;
2891 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
2892 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
2893 struct btrfs_trans_handle
*trans
= NULL
;
2894 struct extent_io_tree
*io_tree
= &BTRFS_I(inode
)->io_tree
;
2895 struct extent_state
*cached_state
= NULL
;
2896 struct new_sa_defrag_extent
*new = NULL
;
2897 int compress_type
= 0;
2899 u64 logical_len
= ordered_extent
->len
;
2901 bool truncated
= false;
2902 bool range_locked
= false;
2903 bool clear_new_delalloc_bytes
= false;
2905 if (!test_bit(BTRFS_ORDERED_NOCOW
, &ordered_extent
->flags
) &&
2906 !test_bit(BTRFS_ORDERED_PREALLOC
, &ordered_extent
->flags
) &&
2907 !test_bit(BTRFS_ORDERED_DIRECT
, &ordered_extent
->flags
))
2908 clear_new_delalloc_bytes
= true;
2910 nolock
= btrfs_is_free_space_inode(BTRFS_I(inode
));
2912 if (test_bit(BTRFS_ORDERED_IOERR
, &ordered_extent
->flags
)) {
2917 btrfs_free_io_failure_record(BTRFS_I(inode
),
2918 ordered_extent
->file_offset
,
2919 ordered_extent
->file_offset
+
2920 ordered_extent
->len
- 1);
2922 if (test_bit(BTRFS_ORDERED_TRUNCATED
, &ordered_extent
->flags
)) {
2924 logical_len
= ordered_extent
->truncated_len
;
2925 /* Truncated the entire extent, don't bother adding */
2930 if (test_bit(BTRFS_ORDERED_NOCOW
, &ordered_extent
->flags
)) {
2931 BUG_ON(!list_empty(&ordered_extent
->list
)); /* Logic error */
2934 * For mwrite(mmap + memset to write) case, we still reserve
2935 * space for NOCOW range.
2936 * As NOCOW won't cause a new delayed ref, just free the space
2938 btrfs_qgroup_free_data(inode
, NULL
, ordered_extent
->file_offset
,
2939 ordered_extent
->len
);
2940 btrfs_ordered_update_i_size(inode
, 0, ordered_extent
);
2942 trans
= btrfs_join_transaction_nolock(root
);
2944 trans
= btrfs_join_transaction(root
);
2945 if (IS_ERR(trans
)) {
2946 ret
= PTR_ERR(trans
);
2950 trans
->block_rsv
= &fs_info
->delalloc_block_rsv
;
2951 ret
= btrfs_update_inode_fallback(trans
, root
, inode
);
2952 if (ret
) /* -ENOMEM or corruption */
2953 btrfs_abort_transaction(trans
, ret
);
2957 range_locked
= true;
2958 lock_extent_bits(io_tree
, ordered_extent
->file_offset
,
2959 ordered_extent
->file_offset
+ ordered_extent
->len
- 1,
2962 ret
= test_range_bit(io_tree
, ordered_extent
->file_offset
,
2963 ordered_extent
->file_offset
+ ordered_extent
->len
- 1,
2964 EXTENT_DEFRAG
, 0, cached_state
);
2966 u64 last_snapshot
= btrfs_root_last_snapshot(&root
->root_item
);
2967 if (0 && last_snapshot
>= BTRFS_I(inode
)->generation
)
2968 /* the inode is shared */
2969 new = record_old_file_extents(inode
, ordered_extent
);
2971 clear_extent_bit(io_tree
, ordered_extent
->file_offset
,
2972 ordered_extent
->file_offset
+ ordered_extent
->len
- 1,
2973 EXTENT_DEFRAG
, 0, 0, &cached_state
, GFP_NOFS
);
2977 trans
= btrfs_join_transaction_nolock(root
);
2979 trans
= btrfs_join_transaction(root
);
2980 if (IS_ERR(trans
)) {
2981 ret
= PTR_ERR(trans
);
2986 trans
->block_rsv
= &fs_info
->delalloc_block_rsv
;
2988 if (test_bit(BTRFS_ORDERED_COMPRESSED
, &ordered_extent
->flags
))
2989 compress_type
= ordered_extent
->compress_type
;
2990 if (test_bit(BTRFS_ORDERED_PREALLOC
, &ordered_extent
->flags
)) {
2991 BUG_ON(compress_type
);
2992 ret
= btrfs_mark_extent_written(trans
, BTRFS_I(inode
),
2993 ordered_extent
->file_offset
,
2994 ordered_extent
->file_offset
+
2997 BUG_ON(root
== fs_info
->tree_root
);
2998 ret
= insert_reserved_file_extent(trans
, inode
,
2999 ordered_extent
->file_offset
,
3000 ordered_extent
->start
,
3001 ordered_extent
->disk_len
,
3002 logical_len
, logical_len
,
3003 compress_type
, 0, 0,
3004 BTRFS_FILE_EXTENT_REG
);
3006 btrfs_release_delalloc_bytes(fs_info
,
3007 ordered_extent
->start
,
3008 ordered_extent
->disk_len
);
3010 unpin_extent_cache(&BTRFS_I(inode
)->extent_tree
,
3011 ordered_extent
->file_offset
, ordered_extent
->len
,
3014 btrfs_abort_transaction(trans
, ret
);
3018 add_pending_csums(trans
, inode
, &ordered_extent
->list
);
3020 btrfs_ordered_update_i_size(inode
, 0, ordered_extent
);
3021 ret
= btrfs_update_inode_fallback(trans
, root
, inode
);
3022 if (ret
) { /* -ENOMEM or corruption */
3023 btrfs_abort_transaction(trans
, ret
);
3028 if (range_locked
|| clear_new_delalloc_bytes
) {
3029 unsigned int clear_bits
= 0;
3032 clear_bits
|= EXTENT_LOCKED
;
3033 if (clear_new_delalloc_bytes
)
3034 clear_bits
|= EXTENT_DELALLOC_NEW
;
3035 clear_extent_bit(&BTRFS_I(inode
)->io_tree
,
3036 ordered_extent
->file_offset
,
3037 ordered_extent
->file_offset
+
3038 ordered_extent
->len
- 1,
3040 (clear_bits
& EXTENT_LOCKED
) ? 1 : 0,
3041 0, &cached_state
, GFP_NOFS
);
3044 if (root
!= fs_info
->tree_root
)
3045 btrfs_delalloc_release_metadata(BTRFS_I(inode
),
3046 ordered_extent
->len
);
3048 btrfs_end_transaction(trans
);
3050 if (ret
|| truncated
) {
3054 start
= ordered_extent
->file_offset
+ logical_len
;
3056 start
= ordered_extent
->file_offset
;
3057 end
= ordered_extent
->file_offset
+ ordered_extent
->len
- 1;
3058 clear_extent_uptodate(io_tree
, start
, end
, NULL
, GFP_NOFS
);
3060 /* Drop the cache for the part of the extent we didn't write. */
3061 btrfs_drop_extent_cache(BTRFS_I(inode
), start
, end
, 0);
3064 * If the ordered extent had an IOERR or something else went
3065 * wrong we need to return the space for this ordered extent
3066 * back to the allocator. We only free the extent in the
3067 * truncated case if we didn't write out the extent at all.
3069 if ((ret
|| !logical_len
) &&
3070 !test_bit(BTRFS_ORDERED_NOCOW
, &ordered_extent
->flags
) &&
3071 !test_bit(BTRFS_ORDERED_PREALLOC
, &ordered_extent
->flags
))
3072 btrfs_free_reserved_extent(fs_info
,
3073 ordered_extent
->start
,
3074 ordered_extent
->disk_len
, 1);
3079 * This needs to be done to make sure anybody waiting knows we are done
3080 * updating everything for this ordered extent.
3082 btrfs_remove_ordered_extent(inode
, ordered_extent
);
3084 /* for snapshot-aware defrag */
3087 free_sa_defrag_extent(new);
3088 atomic_dec(&fs_info
->defrag_running
);
3090 relink_file_extents(new);
3095 btrfs_put_ordered_extent(ordered_extent
);
3096 /* once for the tree */
3097 btrfs_put_ordered_extent(ordered_extent
);
3102 static void finish_ordered_fn(struct btrfs_work
*work
)
3104 struct btrfs_ordered_extent
*ordered_extent
;
3105 ordered_extent
= container_of(work
, struct btrfs_ordered_extent
, work
);
3106 btrfs_finish_ordered_io(ordered_extent
);
3109 static void btrfs_writepage_end_io_hook(struct page
*page
, u64 start
, u64 end
,
3110 struct extent_state
*state
, int uptodate
)
3112 struct inode
*inode
= page
->mapping
->host
;
3113 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
3114 struct btrfs_ordered_extent
*ordered_extent
= NULL
;
3115 struct btrfs_workqueue
*wq
;
3116 btrfs_work_func_t func
;
3118 trace_btrfs_writepage_end_io_hook(page
, start
, end
, uptodate
);
3120 ClearPagePrivate2(page
);
3121 if (!btrfs_dec_test_ordered_pending(inode
, &ordered_extent
, start
,
3122 end
- start
+ 1, uptodate
))
3125 if (btrfs_is_free_space_inode(BTRFS_I(inode
))) {
3126 wq
= fs_info
->endio_freespace_worker
;
3127 func
= btrfs_freespace_write_helper
;
3129 wq
= fs_info
->endio_write_workers
;
3130 func
= btrfs_endio_write_helper
;
3133 btrfs_init_work(&ordered_extent
->work
, func
, finish_ordered_fn
, NULL
,
3135 btrfs_queue_work(wq
, &ordered_extent
->work
);
3138 static int __readpage_endio_check(struct inode
*inode
,
3139 struct btrfs_io_bio
*io_bio
,
3140 int icsum
, struct page
*page
,
3141 int pgoff
, u64 start
, size_t len
)
3147 csum_expected
= *(((u32
*)io_bio
->csum
) + icsum
);
3149 kaddr
= kmap_atomic(page
);
3150 csum
= btrfs_csum_data(kaddr
+ pgoff
, csum
, len
);
3151 btrfs_csum_final(csum
, (u8
*)&csum
);
3152 if (csum
!= csum_expected
)
3155 kunmap_atomic(kaddr
);
3158 btrfs_print_data_csum_error(BTRFS_I(inode
), start
, csum
, csum_expected
,
3159 io_bio
->mirror_num
);
3160 memset(kaddr
+ pgoff
, 1, len
);
3161 flush_dcache_page(page
);
3162 kunmap_atomic(kaddr
);
3163 if (csum_expected
== 0)
3169 * when reads are done, we need to check csums to verify the data is correct
3170 * if there's a match, we allow the bio to finish. If not, the code in
3171 * extent_io.c will try to find good copies for us.
3173 static int btrfs_readpage_end_io_hook(struct btrfs_io_bio
*io_bio
,
3174 u64 phy_offset
, struct page
*page
,
3175 u64 start
, u64 end
, int mirror
)
3177 size_t offset
= start
- page_offset(page
);
3178 struct inode
*inode
= page
->mapping
->host
;
3179 struct extent_io_tree
*io_tree
= &BTRFS_I(inode
)->io_tree
;
3180 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
3182 if (PageChecked(page
)) {
3183 ClearPageChecked(page
);
3187 if (BTRFS_I(inode
)->flags
& BTRFS_INODE_NODATASUM
)
3190 if (root
->root_key
.objectid
== BTRFS_DATA_RELOC_TREE_OBJECTID
&&
3191 test_range_bit(io_tree
, start
, end
, EXTENT_NODATASUM
, 1, NULL
)) {
3192 clear_extent_bits(io_tree
, start
, end
, EXTENT_NODATASUM
);
3196 phy_offset
>>= inode
->i_sb
->s_blocksize_bits
;
3197 return __readpage_endio_check(inode
, io_bio
, phy_offset
, page
, offset
,
3198 start
, (size_t)(end
- start
+ 1));
3201 void btrfs_add_delayed_iput(struct inode
*inode
)
3203 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
3204 struct btrfs_inode
*binode
= BTRFS_I(inode
);
3206 if (atomic_add_unless(&inode
->i_count
, -1, 1))
3209 spin_lock(&fs_info
->delayed_iput_lock
);
3210 if (binode
->delayed_iput_count
== 0) {
3211 ASSERT(list_empty(&binode
->delayed_iput
));
3212 list_add_tail(&binode
->delayed_iput
, &fs_info
->delayed_iputs
);
3214 binode
->delayed_iput_count
++;
3216 spin_unlock(&fs_info
->delayed_iput_lock
);
3219 void btrfs_run_delayed_iputs(struct btrfs_fs_info
*fs_info
)
3222 spin_lock(&fs_info
->delayed_iput_lock
);
3223 while (!list_empty(&fs_info
->delayed_iputs
)) {
3224 struct btrfs_inode
*inode
;
3226 inode
= list_first_entry(&fs_info
->delayed_iputs
,
3227 struct btrfs_inode
, delayed_iput
);
3228 if (inode
->delayed_iput_count
) {
3229 inode
->delayed_iput_count
--;
3230 list_move_tail(&inode
->delayed_iput
,
3231 &fs_info
->delayed_iputs
);
3233 list_del_init(&inode
->delayed_iput
);
3235 spin_unlock(&fs_info
->delayed_iput_lock
);
3236 iput(&inode
->vfs_inode
);
3237 spin_lock(&fs_info
->delayed_iput_lock
);
3239 spin_unlock(&fs_info
->delayed_iput_lock
);
3243 * This is called in transaction commit time. If there are no orphan
3244 * files in the subvolume, it removes orphan item and frees block_rsv
3247 void btrfs_orphan_commit_root(struct btrfs_trans_handle
*trans
,
3248 struct btrfs_root
*root
)
3250 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
3251 struct btrfs_block_rsv
*block_rsv
;
3254 if (atomic_read(&root
->orphan_inodes
) ||
3255 root
->orphan_cleanup_state
!= ORPHAN_CLEANUP_DONE
)
3258 spin_lock(&root
->orphan_lock
);
3259 if (atomic_read(&root
->orphan_inodes
)) {
3260 spin_unlock(&root
->orphan_lock
);
3264 if (root
->orphan_cleanup_state
!= ORPHAN_CLEANUP_DONE
) {
3265 spin_unlock(&root
->orphan_lock
);
3269 block_rsv
= root
->orphan_block_rsv
;
3270 root
->orphan_block_rsv
= NULL
;
3271 spin_unlock(&root
->orphan_lock
);
3273 if (test_bit(BTRFS_ROOT_ORPHAN_ITEM_INSERTED
, &root
->state
) &&
3274 btrfs_root_refs(&root
->root_item
) > 0) {
3275 ret
= btrfs_del_orphan_item(trans
, fs_info
->tree_root
,
3276 root
->root_key
.objectid
);
3278 btrfs_abort_transaction(trans
, ret
);
3280 clear_bit(BTRFS_ROOT_ORPHAN_ITEM_INSERTED
,
3285 WARN_ON(block_rsv
->size
> 0);
3286 btrfs_free_block_rsv(fs_info
, block_rsv
);
3291 * This creates an orphan entry for the given inode in case something goes
3292 * wrong in the middle of an unlink/truncate.
3294 * NOTE: caller of this function should reserve 5 units of metadata for
3297 int btrfs_orphan_add(struct btrfs_trans_handle
*trans
,
3298 struct btrfs_inode
*inode
)
3300 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->vfs_inode
.i_sb
);
3301 struct btrfs_root
*root
= inode
->root
;
3302 struct btrfs_block_rsv
*block_rsv
= NULL
;
3307 if (!root
->orphan_block_rsv
) {
3308 block_rsv
= btrfs_alloc_block_rsv(fs_info
,
3309 BTRFS_BLOCK_RSV_TEMP
);
3314 spin_lock(&root
->orphan_lock
);
3315 if (!root
->orphan_block_rsv
) {
3316 root
->orphan_block_rsv
= block_rsv
;
3317 } else if (block_rsv
) {
3318 btrfs_free_block_rsv(fs_info
, block_rsv
);
3322 if (!test_and_set_bit(BTRFS_INODE_HAS_ORPHAN_ITEM
,
3323 &inode
->runtime_flags
)) {
3326 * For proper ENOSPC handling, we should do orphan
3327 * cleanup when mounting. But this introduces backward
3328 * compatibility issue.
3330 if (!xchg(&root
->orphan_item_inserted
, 1))
3336 atomic_inc(&root
->orphan_inodes
);
3339 if (!test_and_set_bit(BTRFS_INODE_ORPHAN_META_RESERVED
,
3340 &inode
->runtime_flags
))
3342 spin_unlock(&root
->orphan_lock
);
3344 /* grab metadata reservation from transaction handle */
3346 ret
= btrfs_orphan_reserve_metadata(trans
, inode
);
3349 atomic_dec(&root
->orphan_inodes
);
3350 clear_bit(BTRFS_INODE_ORPHAN_META_RESERVED
,
3351 &inode
->runtime_flags
);
3353 clear_bit(BTRFS_INODE_HAS_ORPHAN_ITEM
,
3354 &inode
->runtime_flags
);
3359 /* insert an orphan item to track this unlinked/truncated file */
3361 ret
= btrfs_insert_orphan_item(trans
, root
, btrfs_ino(inode
));
3363 atomic_dec(&root
->orphan_inodes
);
3365 clear_bit(BTRFS_INODE_ORPHAN_META_RESERVED
,
3366 &inode
->runtime_flags
);
3367 btrfs_orphan_release_metadata(inode
);
3369 if (ret
!= -EEXIST
) {
3370 clear_bit(BTRFS_INODE_HAS_ORPHAN_ITEM
,
3371 &inode
->runtime_flags
);
3372 btrfs_abort_transaction(trans
, ret
);
3379 /* insert an orphan item to track subvolume contains orphan files */
3381 ret
= btrfs_insert_orphan_item(trans
, fs_info
->tree_root
,
3382 root
->root_key
.objectid
);
3383 if (ret
&& ret
!= -EEXIST
) {
3384 btrfs_abort_transaction(trans
, ret
);
3392 * We have done the truncate/delete so we can go ahead and remove the orphan
3393 * item for this particular inode.
3395 static int btrfs_orphan_del(struct btrfs_trans_handle
*trans
,
3396 struct btrfs_inode
*inode
)
3398 struct btrfs_root
*root
= inode
->root
;
3399 int delete_item
= 0;
3400 int release_rsv
= 0;
3403 spin_lock(&root
->orphan_lock
);
3404 if (test_and_clear_bit(BTRFS_INODE_HAS_ORPHAN_ITEM
,
3405 &inode
->runtime_flags
))
3408 if (test_and_clear_bit(BTRFS_INODE_ORPHAN_META_RESERVED
,
3409 &inode
->runtime_flags
))
3411 spin_unlock(&root
->orphan_lock
);
3414 atomic_dec(&root
->orphan_inodes
);
3416 ret
= btrfs_del_orphan_item(trans
, root
,
3421 btrfs_orphan_release_metadata(inode
);
3427 * this cleans up any orphans that may be left on the list from the last use
3430 int btrfs_orphan_cleanup(struct btrfs_root
*root
)
3432 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
3433 struct btrfs_path
*path
;
3434 struct extent_buffer
*leaf
;
3435 struct btrfs_key key
, found_key
;
3436 struct btrfs_trans_handle
*trans
;
3437 struct inode
*inode
;
3438 u64 last_objectid
= 0;
3439 int ret
= 0, nr_unlink
= 0, nr_truncate
= 0;
3441 if (cmpxchg(&root
->orphan_cleanup_state
, 0, ORPHAN_CLEANUP_STARTED
))
3444 path
= btrfs_alloc_path();
3449 path
->reada
= READA_BACK
;
3451 key
.objectid
= BTRFS_ORPHAN_OBJECTID
;
3452 key
.type
= BTRFS_ORPHAN_ITEM_KEY
;
3453 key
.offset
= (u64
)-1;
3456 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
3461 * if ret == 0 means we found what we were searching for, which
3462 * is weird, but possible, so only screw with path if we didn't
3463 * find the key and see if we have stuff that matches
3467 if (path
->slots
[0] == 0)
3472 /* pull out the item */
3473 leaf
= path
->nodes
[0];
3474 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
3476 /* make sure the item matches what we want */
3477 if (found_key
.objectid
!= BTRFS_ORPHAN_OBJECTID
)
3479 if (found_key
.type
!= BTRFS_ORPHAN_ITEM_KEY
)
3482 /* release the path since we're done with it */
3483 btrfs_release_path(path
);
3486 * this is where we are basically btrfs_lookup, without the
3487 * crossing root thing. we store the inode number in the
3488 * offset of the orphan item.
3491 if (found_key
.offset
== last_objectid
) {
3493 "Error removing orphan entry, stopping orphan cleanup");
3498 last_objectid
= found_key
.offset
;
3500 found_key
.objectid
= found_key
.offset
;
3501 found_key
.type
= BTRFS_INODE_ITEM_KEY
;
3502 found_key
.offset
= 0;
3503 inode
= btrfs_iget(fs_info
->sb
, &found_key
, root
, NULL
);
3504 ret
= PTR_ERR_OR_ZERO(inode
);
3505 if (ret
&& ret
!= -ENOENT
)
3508 if (ret
== -ENOENT
&& root
== fs_info
->tree_root
) {
3509 struct btrfs_root
*dead_root
;
3510 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
3511 int is_dead_root
= 0;
3514 * this is an orphan in the tree root. Currently these
3515 * could come from 2 sources:
3516 * a) a snapshot deletion in progress
3517 * b) a free space cache inode
3518 * We need to distinguish those two, as the snapshot
3519 * orphan must not get deleted.
3520 * find_dead_roots already ran before us, so if this
3521 * is a snapshot deletion, we should find the root
3522 * in the dead_roots list
3524 spin_lock(&fs_info
->trans_lock
);
3525 list_for_each_entry(dead_root
, &fs_info
->dead_roots
,
3527 if (dead_root
->root_key
.objectid
==
3528 found_key
.objectid
) {
3533 spin_unlock(&fs_info
->trans_lock
);
3535 /* prevent this orphan from being found again */
3536 key
.offset
= found_key
.objectid
- 1;
3541 * Inode is already gone but the orphan item is still there,
3542 * kill the orphan item.
3544 if (ret
== -ENOENT
) {
3545 trans
= btrfs_start_transaction(root
, 1);
3546 if (IS_ERR(trans
)) {
3547 ret
= PTR_ERR(trans
);
3550 btrfs_debug(fs_info
, "auto deleting %Lu",
3551 found_key
.objectid
);
3552 ret
= btrfs_del_orphan_item(trans
, root
,
3553 found_key
.objectid
);
3554 btrfs_end_transaction(trans
);
3561 * add this inode to the orphan list so btrfs_orphan_del does
3562 * the proper thing when we hit it
3564 set_bit(BTRFS_INODE_HAS_ORPHAN_ITEM
,
3565 &BTRFS_I(inode
)->runtime_flags
);
3566 atomic_inc(&root
->orphan_inodes
);
3568 /* if we have links, this was a truncate, lets do that */
3569 if (inode
->i_nlink
) {
3570 if (WARN_ON(!S_ISREG(inode
->i_mode
))) {
3576 /* 1 for the orphan item deletion. */
3577 trans
= btrfs_start_transaction(root
, 1);
3578 if (IS_ERR(trans
)) {
3580 ret
= PTR_ERR(trans
);
3583 ret
= btrfs_orphan_add(trans
, BTRFS_I(inode
));
3584 btrfs_end_transaction(trans
);
3590 ret
= btrfs_truncate(inode
);
3592 btrfs_orphan_del(NULL
, BTRFS_I(inode
));
3597 /* this will do delete_inode and everything for us */
3602 /* release the path since we're done with it */
3603 btrfs_release_path(path
);
3605 root
->orphan_cleanup_state
= ORPHAN_CLEANUP_DONE
;
3607 if (root
->orphan_block_rsv
)
3608 btrfs_block_rsv_release(fs_info
, root
->orphan_block_rsv
,
3611 if (root
->orphan_block_rsv
||
3612 test_bit(BTRFS_ROOT_ORPHAN_ITEM_INSERTED
, &root
->state
)) {
3613 trans
= btrfs_join_transaction(root
);
3615 btrfs_end_transaction(trans
);
3619 btrfs_debug(fs_info
, "unlinked %d orphans", nr_unlink
);
3621 btrfs_debug(fs_info
, "truncated %d orphans", nr_truncate
);
3625 btrfs_err(fs_info
, "could not do orphan cleanup %d", ret
);
3626 btrfs_free_path(path
);
3631 * very simple check to peek ahead in the leaf looking for xattrs. If we
3632 * don't find any xattrs, we know there can't be any acls.
3634 * slot is the slot the inode is in, objectid is the objectid of the inode
3636 static noinline
int acls_after_inode_item(struct extent_buffer
*leaf
,
3637 int slot
, u64 objectid
,
3638 int *first_xattr_slot
)
3640 u32 nritems
= btrfs_header_nritems(leaf
);
3641 struct btrfs_key found_key
;
3642 static u64 xattr_access
= 0;
3643 static u64 xattr_default
= 0;
3646 if (!xattr_access
) {
3647 xattr_access
= btrfs_name_hash(XATTR_NAME_POSIX_ACL_ACCESS
,
3648 strlen(XATTR_NAME_POSIX_ACL_ACCESS
));
3649 xattr_default
= btrfs_name_hash(XATTR_NAME_POSIX_ACL_DEFAULT
,
3650 strlen(XATTR_NAME_POSIX_ACL_DEFAULT
));
3654 *first_xattr_slot
= -1;
3655 while (slot
< nritems
) {
3656 btrfs_item_key_to_cpu(leaf
, &found_key
, slot
);
3658 /* we found a different objectid, there must not be acls */
3659 if (found_key
.objectid
!= objectid
)
3662 /* we found an xattr, assume we've got an acl */
3663 if (found_key
.type
== BTRFS_XATTR_ITEM_KEY
) {
3664 if (*first_xattr_slot
== -1)
3665 *first_xattr_slot
= slot
;
3666 if (found_key
.offset
== xattr_access
||
3667 found_key
.offset
== xattr_default
)
3672 * we found a key greater than an xattr key, there can't
3673 * be any acls later on
3675 if (found_key
.type
> BTRFS_XATTR_ITEM_KEY
)
3682 * it goes inode, inode backrefs, xattrs, extents,
3683 * so if there are a ton of hard links to an inode there can
3684 * be a lot of backrefs. Don't waste time searching too hard,
3685 * this is just an optimization
3690 /* we hit the end of the leaf before we found an xattr or
3691 * something larger than an xattr. We have to assume the inode
3694 if (*first_xattr_slot
== -1)
3695 *first_xattr_slot
= slot
;
3700 * read an inode from the btree into the in-memory inode
3702 static int btrfs_read_locked_inode(struct inode
*inode
)
3704 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
3705 struct btrfs_path
*path
;
3706 struct extent_buffer
*leaf
;
3707 struct btrfs_inode_item
*inode_item
;
3708 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
3709 struct btrfs_key location
;
3714 bool filled
= false;
3715 int first_xattr_slot
;
3717 ret
= btrfs_fill_inode(inode
, &rdev
);
3721 path
= btrfs_alloc_path();
3727 memcpy(&location
, &BTRFS_I(inode
)->location
, sizeof(location
));
3729 ret
= btrfs_lookup_inode(NULL
, root
, path
, &location
, 0);
3736 leaf
= path
->nodes
[0];
3741 inode_item
= btrfs_item_ptr(leaf
, path
->slots
[0],
3742 struct btrfs_inode_item
);
3743 inode
->i_mode
= btrfs_inode_mode(leaf
, inode_item
);
3744 set_nlink(inode
, btrfs_inode_nlink(leaf
, inode_item
));
3745 i_uid_write(inode
, btrfs_inode_uid(leaf
, inode_item
));
3746 i_gid_write(inode
, btrfs_inode_gid(leaf
, inode_item
));
3747 btrfs_i_size_write(BTRFS_I(inode
), btrfs_inode_size(leaf
, inode_item
));
3749 inode
->i_atime
.tv_sec
= btrfs_timespec_sec(leaf
, &inode_item
->atime
);
3750 inode
->i_atime
.tv_nsec
= btrfs_timespec_nsec(leaf
, &inode_item
->atime
);
3752 inode
->i_mtime
.tv_sec
= btrfs_timespec_sec(leaf
, &inode_item
->mtime
);
3753 inode
->i_mtime
.tv_nsec
= btrfs_timespec_nsec(leaf
, &inode_item
->mtime
);
3755 inode
->i_ctime
.tv_sec
= btrfs_timespec_sec(leaf
, &inode_item
->ctime
);
3756 inode
->i_ctime
.tv_nsec
= btrfs_timespec_nsec(leaf
, &inode_item
->ctime
);
3758 BTRFS_I(inode
)->i_otime
.tv_sec
=
3759 btrfs_timespec_sec(leaf
, &inode_item
->otime
);
3760 BTRFS_I(inode
)->i_otime
.tv_nsec
=
3761 btrfs_timespec_nsec(leaf
, &inode_item
->otime
);
3763 inode_set_bytes(inode
, btrfs_inode_nbytes(leaf
, inode_item
));
3764 BTRFS_I(inode
)->generation
= btrfs_inode_generation(leaf
, inode_item
);
3765 BTRFS_I(inode
)->last_trans
= btrfs_inode_transid(leaf
, inode_item
);
3767 inode
->i_version
= btrfs_inode_sequence(leaf
, inode_item
);
3768 inode
->i_generation
= BTRFS_I(inode
)->generation
;
3770 rdev
= btrfs_inode_rdev(leaf
, inode_item
);
3772 BTRFS_I(inode
)->index_cnt
= (u64
)-1;
3773 BTRFS_I(inode
)->flags
= btrfs_inode_flags(leaf
, inode_item
);
3777 * If we were modified in the current generation and evicted from memory
3778 * and then re-read we need to do a full sync since we don't have any
3779 * idea about which extents were modified before we were evicted from
3782 * This is required for both inode re-read from disk and delayed inode
3783 * in delayed_nodes_tree.
3785 if (BTRFS_I(inode
)->last_trans
== fs_info
->generation
)
3786 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC
,
3787 &BTRFS_I(inode
)->runtime_flags
);
3790 * We don't persist the id of the transaction where an unlink operation
3791 * against the inode was last made. So here we assume the inode might
3792 * have been evicted, and therefore the exact value of last_unlink_trans
3793 * lost, and set it to last_trans to avoid metadata inconsistencies
3794 * between the inode and its parent if the inode is fsync'ed and the log
3795 * replayed. For example, in the scenario:
3798 * ln mydir/foo mydir/bar
3801 * echo 2 > /proc/sys/vm/drop_caches # evicts inode
3802 * xfs_io -c fsync mydir/foo
3804 * mount fs, triggers fsync log replay
3806 * We must make sure that when we fsync our inode foo we also log its
3807 * parent inode, otherwise after log replay the parent still has the
3808 * dentry with the "bar" name but our inode foo has a link count of 1
3809 * and doesn't have an inode ref with the name "bar" anymore.
3811 * Setting last_unlink_trans to last_trans is a pessimistic approach,
3812 * but it guarantees correctness at the expense of occasional full
3813 * transaction commits on fsync if our inode is a directory, or if our
3814 * inode is not a directory, logging its parent unnecessarily.
3816 BTRFS_I(inode
)->last_unlink_trans
= BTRFS_I(inode
)->last_trans
;
3819 if (inode
->i_nlink
!= 1 ||
3820 path
->slots
[0] >= btrfs_header_nritems(leaf
))
3823 btrfs_item_key_to_cpu(leaf
, &location
, path
->slots
[0]);
3824 if (location
.objectid
!= btrfs_ino(BTRFS_I(inode
)))
3827 ptr
= btrfs_item_ptr_offset(leaf
, path
->slots
[0]);
3828 if (location
.type
== BTRFS_INODE_REF_KEY
) {
3829 struct btrfs_inode_ref
*ref
;
3831 ref
= (struct btrfs_inode_ref
*)ptr
;
3832 BTRFS_I(inode
)->dir_index
= btrfs_inode_ref_index(leaf
, ref
);
3833 } else if (location
.type
== BTRFS_INODE_EXTREF_KEY
) {
3834 struct btrfs_inode_extref
*extref
;
3836 extref
= (struct btrfs_inode_extref
*)ptr
;
3837 BTRFS_I(inode
)->dir_index
= btrfs_inode_extref_index(leaf
,
3842 * try to precache a NULL acl entry for files that don't have
3843 * any xattrs or acls
3845 maybe_acls
= acls_after_inode_item(leaf
, path
->slots
[0],
3846 btrfs_ino(BTRFS_I(inode
)), &first_xattr_slot
);
3847 if (first_xattr_slot
!= -1) {
3848 path
->slots
[0] = first_xattr_slot
;
3849 ret
= btrfs_load_inode_props(inode
, path
);
3852 "error loading props for ino %llu (root %llu): %d",
3853 btrfs_ino(BTRFS_I(inode
)),
3854 root
->root_key
.objectid
, ret
);
3856 btrfs_free_path(path
);
3859 cache_no_acl(inode
);
3861 switch (inode
->i_mode
& S_IFMT
) {
3863 inode
->i_mapping
->a_ops
= &btrfs_aops
;
3864 BTRFS_I(inode
)->io_tree
.ops
= &btrfs_extent_io_ops
;
3865 inode
->i_fop
= &btrfs_file_operations
;
3866 inode
->i_op
= &btrfs_file_inode_operations
;
3869 inode
->i_fop
= &btrfs_dir_file_operations
;
3870 inode
->i_op
= &btrfs_dir_inode_operations
;
3873 inode
->i_op
= &btrfs_symlink_inode_operations
;
3874 inode_nohighmem(inode
);
3875 inode
->i_mapping
->a_ops
= &btrfs_symlink_aops
;
3878 inode
->i_op
= &btrfs_special_inode_operations
;
3879 init_special_inode(inode
, inode
->i_mode
, rdev
);
3883 btrfs_update_iflags(inode
);
3887 btrfs_free_path(path
);
3888 make_bad_inode(inode
);
3893 * given a leaf and an inode, copy the inode fields into the leaf
3895 static void fill_inode_item(struct btrfs_trans_handle
*trans
,
3896 struct extent_buffer
*leaf
,
3897 struct btrfs_inode_item
*item
,
3898 struct inode
*inode
)
3900 struct btrfs_map_token token
;
3902 btrfs_init_map_token(&token
);
3904 btrfs_set_token_inode_uid(leaf
, item
, i_uid_read(inode
), &token
);
3905 btrfs_set_token_inode_gid(leaf
, item
, i_gid_read(inode
), &token
);
3906 btrfs_set_token_inode_size(leaf
, item
, BTRFS_I(inode
)->disk_i_size
,
3908 btrfs_set_token_inode_mode(leaf
, item
, inode
->i_mode
, &token
);
3909 btrfs_set_token_inode_nlink(leaf
, item
, inode
->i_nlink
, &token
);
3911 btrfs_set_token_timespec_sec(leaf
, &item
->atime
,
3912 inode
->i_atime
.tv_sec
, &token
);
3913 btrfs_set_token_timespec_nsec(leaf
, &item
->atime
,
3914 inode
->i_atime
.tv_nsec
, &token
);
3916 btrfs_set_token_timespec_sec(leaf
, &item
->mtime
,
3917 inode
->i_mtime
.tv_sec
, &token
);
3918 btrfs_set_token_timespec_nsec(leaf
, &item
->mtime
,
3919 inode
->i_mtime
.tv_nsec
, &token
);
3921 btrfs_set_token_timespec_sec(leaf
, &item
->ctime
,
3922 inode
->i_ctime
.tv_sec
, &token
);
3923 btrfs_set_token_timespec_nsec(leaf
, &item
->ctime
,
3924 inode
->i_ctime
.tv_nsec
, &token
);
3926 btrfs_set_token_timespec_sec(leaf
, &item
->otime
,
3927 BTRFS_I(inode
)->i_otime
.tv_sec
, &token
);
3928 btrfs_set_token_timespec_nsec(leaf
, &item
->otime
,
3929 BTRFS_I(inode
)->i_otime
.tv_nsec
, &token
);
3931 btrfs_set_token_inode_nbytes(leaf
, item
, inode_get_bytes(inode
),
3933 btrfs_set_token_inode_generation(leaf
, item
, BTRFS_I(inode
)->generation
,
3935 btrfs_set_token_inode_sequence(leaf
, item
, inode
->i_version
, &token
);
3936 btrfs_set_token_inode_transid(leaf
, item
, trans
->transid
, &token
);
3937 btrfs_set_token_inode_rdev(leaf
, item
, inode
->i_rdev
, &token
);
3938 btrfs_set_token_inode_flags(leaf
, item
, BTRFS_I(inode
)->flags
, &token
);
3939 btrfs_set_token_inode_block_group(leaf
, item
, 0, &token
);
3943 * copy everything in the in-memory inode into the btree.
3945 static noinline
int btrfs_update_inode_item(struct btrfs_trans_handle
*trans
,
3946 struct btrfs_root
*root
, struct inode
*inode
)
3948 struct btrfs_inode_item
*inode_item
;
3949 struct btrfs_path
*path
;
3950 struct extent_buffer
*leaf
;
3953 path
= btrfs_alloc_path();
3957 path
->leave_spinning
= 1;
3958 ret
= btrfs_lookup_inode(trans
, root
, path
, &BTRFS_I(inode
)->location
,
3966 leaf
= path
->nodes
[0];
3967 inode_item
= btrfs_item_ptr(leaf
, path
->slots
[0],
3968 struct btrfs_inode_item
);
3970 fill_inode_item(trans
, leaf
, inode_item
, inode
);
3971 btrfs_mark_buffer_dirty(leaf
);
3972 btrfs_set_inode_last_trans(trans
, inode
);
3975 btrfs_free_path(path
);
3980 * copy everything in the in-memory inode into the btree.
3982 noinline
int btrfs_update_inode(struct btrfs_trans_handle
*trans
,
3983 struct btrfs_root
*root
, struct inode
*inode
)
3985 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
3989 * If the inode is a free space inode, we can deadlock during commit
3990 * if we put it into the delayed code.
3992 * The data relocation inode should also be directly updated
3995 if (!btrfs_is_free_space_inode(BTRFS_I(inode
))
3996 && root
->root_key
.objectid
!= BTRFS_DATA_RELOC_TREE_OBJECTID
3997 && !test_bit(BTRFS_FS_LOG_RECOVERING
, &fs_info
->flags
)) {
3998 btrfs_update_root_times(trans
, root
);
4000 ret
= btrfs_delayed_update_inode(trans
, root
, inode
);
4002 btrfs_set_inode_last_trans(trans
, inode
);
4006 return btrfs_update_inode_item(trans
, root
, inode
);
4009 noinline
int btrfs_update_inode_fallback(struct btrfs_trans_handle
*trans
,
4010 struct btrfs_root
*root
,
4011 struct inode
*inode
)
4015 ret
= btrfs_update_inode(trans
, root
, inode
);
4017 return btrfs_update_inode_item(trans
, root
, inode
);
4022 * unlink helper that gets used here in inode.c and in the tree logging
4023 * recovery code. It remove a link in a directory with a given name, and
4024 * also drops the back refs in the inode to the directory
4026 static int __btrfs_unlink_inode(struct btrfs_trans_handle
*trans
,
4027 struct btrfs_root
*root
,
4028 struct btrfs_inode
*dir
,
4029 struct btrfs_inode
*inode
,
4030 const char *name
, int name_len
)
4032 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
4033 struct btrfs_path
*path
;
4035 struct extent_buffer
*leaf
;
4036 struct btrfs_dir_item
*di
;
4037 struct btrfs_key key
;
4039 u64 ino
= btrfs_ino(inode
);
4040 u64 dir_ino
= btrfs_ino(dir
);
4042 path
= btrfs_alloc_path();
4048 path
->leave_spinning
= 1;
4049 di
= btrfs_lookup_dir_item(trans
, root
, path
, dir_ino
,
4050 name
, name_len
, -1);
4059 leaf
= path
->nodes
[0];
4060 btrfs_dir_item_key_to_cpu(leaf
, di
, &key
);
4061 ret
= btrfs_delete_one_dir_name(trans
, root
, path
, di
);
4064 btrfs_release_path(path
);
4067 * If we don't have dir index, we have to get it by looking up
4068 * the inode ref, since we get the inode ref, remove it directly,
4069 * it is unnecessary to do delayed deletion.
4071 * But if we have dir index, needn't search inode ref to get it.
4072 * Since the inode ref is close to the inode item, it is better
4073 * that we delay to delete it, and just do this deletion when
4074 * we update the inode item.
4076 if (inode
->dir_index
) {
4077 ret
= btrfs_delayed_delete_inode_ref(inode
);
4079 index
= inode
->dir_index
;
4084 ret
= btrfs_del_inode_ref(trans
, root
, name
, name_len
, ino
,
4088 "failed to delete reference to %.*s, inode %llu parent %llu",
4089 name_len
, name
, ino
, dir_ino
);
4090 btrfs_abort_transaction(trans
, ret
);
4094 ret
= btrfs_delete_delayed_dir_index(trans
, fs_info
, dir
, index
);
4096 btrfs_abort_transaction(trans
, ret
);
4100 ret
= btrfs_del_inode_ref_in_log(trans
, root
, name
, name_len
, inode
,
4102 if (ret
!= 0 && ret
!= -ENOENT
) {
4103 btrfs_abort_transaction(trans
, ret
);
4107 ret
= btrfs_del_dir_entries_in_log(trans
, root
, name
, name_len
, dir
,
4112 btrfs_abort_transaction(trans
, ret
);
4114 btrfs_free_path(path
);
4118 btrfs_i_size_write(dir
, dir
->vfs_inode
.i_size
- name_len
* 2);
4119 inode_inc_iversion(&inode
->vfs_inode
);
4120 inode_inc_iversion(&dir
->vfs_inode
);
4121 inode
->vfs_inode
.i_ctime
= dir
->vfs_inode
.i_mtime
=
4122 dir
->vfs_inode
.i_ctime
= current_time(&inode
->vfs_inode
);
4123 ret
= btrfs_update_inode(trans
, root
, &dir
->vfs_inode
);
4128 int btrfs_unlink_inode(struct btrfs_trans_handle
*trans
,
4129 struct btrfs_root
*root
,
4130 struct btrfs_inode
*dir
, struct btrfs_inode
*inode
,
4131 const char *name
, int name_len
)
4134 ret
= __btrfs_unlink_inode(trans
, root
, dir
, inode
, name
, name_len
);
4136 drop_nlink(&inode
->vfs_inode
);
4137 ret
= btrfs_update_inode(trans
, root
, &inode
->vfs_inode
);
4143 * helper to start transaction for unlink and rmdir.
4145 * unlink and rmdir are special in btrfs, they do not always free space, so
4146 * if we cannot make our reservations the normal way try and see if there is
4147 * plenty of slack room in the global reserve to migrate, otherwise we cannot
4148 * allow the unlink to occur.
4150 static struct btrfs_trans_handle
*__unlink_start_trans(struct inode
*dir
)
4152 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
4155 * 1 for the possible orphan item
4156 * 1 for the dir item
4157 * 1 for the dir index
4158 * 1 for the inode ref
4161 return btrfs_start_transaction_fallback_global_rsv(root
, 5, 5);
4164 static int btrfs_unlink(struct inode
*dir
, struct dentry
*dentry
)
4166 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
4167 struct btrfs_trans_handle
*trans
;
4168 struct inode
*inode
= d_inode(dentry
);
4171 trans
= __unlink_start_trans(dir
);
4173 return PTR_ERR(trans
);
4175 btrfs_record_unlink_dir(trans
, BTRFS_I(dir
), BTRFS_I(d_inode(dentry
)),
4178 ret
= btrfs_unlink_inode(trans
, root
, BTRFS_I(dir
),
4179 BTRFS_I(d_inode(dentry
)), dentry
->d_name
.name
,
4180 dentry
->d_name
.len
);
4184 if (inode
->i_nlink
== 0) {
4185 ret
= btrfs_orphan_add(trans
, BTRFS_I(inode
));
4191 btrfs_end_transaction(trans
);
4192 btrfs_btree_balance_dirty(root
->fs_info
);
4196 int btrfs_unlink_subvol(struct btrfs_trans_handle
*trans
,
4197 struct btrfs_root
*root
,
4198 struct inode
*dir
, u64 objectid
,
4199 const char *name
, int name_len
)
4201 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
4202 struct btrfs_path
*path
;
4203 struct extent_buffer
*leaf
;
4204 struct btrfs_dir_item
*di
;
4205 struct btrfs_key key
;
4208 u64 dir_ino
= btrfs_ino(BTRFS_I(dir
));
4210 path
= btrfs_alloc_path();
4214 di
= btrfs_lookup_dir_item(trans
, root
, path
, dir_ino
,
4215 name
, name_len
, -1);
4216 if (IS_ERR_OR_NULL(di
)) {
4224 leaf
= path
->nodes
[0];
4225 btrfs_dir_item_key_to_cpu(leaf
, di
, &key
);
4226 WARN_ON(key
.type
!= BTRFS_ROOT_ITEM_KEY
|| key
.objectid
!= objectid
);
4227 ret
= btrfs_delete_one_dir_name(trans
, root
, path
, di
);
4229 btrfs_abort_transaction(trans
, ret
);
4232 btrfs_release_path(path
);
4234 ret
= btrfs_del_root_ref(trans
, fs_info
, objectid
,
4235 root
->root_key
.objectid
, dir_ino
,
4236 &index
, name
, name_len
);
4238 if (ret
!= -ENOENT
) {
4239 btrfs_abort_transaction(trans
, ret
);
4242 di
= btrfs_search_dir_index_item(root
, path
, dir_ino
,
4244 if (IS_ERR_OR_NULL(di
)) {
4249 btrfs_abort_transaction(trans
, ret
);
4253 leaf
= path
->nodes
[0];
4254 btrfs_item_key_to_cpu(leaf
, &key
, path
->slots
[0]);
4255 btrfs_release_path(path
);
4258 btrfs_release_path(path
);
4260 ret
= btrfs_delete_delayed_dir_index(trans
, fs_info
, BTRFS_I(dir
), index
);
4262 btrfs_abort_transaction(trans
, ret
);
4266 btrfs_i_size_write(BTRFS_I(dir
), dir
->i_size
- name_len
* 2);
4267 inode_inc_iversion(dir
);
4268 dir
->i_mtime
= dir
->i_ctime
= current_time(dir
);
4269 ret
= btrfs_update_inode_fallback(trans
, root
, dir
);
4271 btrfs_abort_transaction(trans
, ret
);
4273 btrfs_free_path(path
);
4277 static int btrfs_rmdir(struct inode
*dir
, struct dentry
*dentry
)
4279 struct inode
*inode
= d_inode(dentry
);
4281 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
4282 struct btrfs_trans_handle
*trans
;
4283 u64 last_unlink_trans
;
4285 if (inode
->i_size
> BTRFS_EMPTY_DIR_SIZE
)
4287 if (btrfs_ino(BTRFS_I(inode
)) == BTRFS_FIRST_FREE_OBJECTID
)
4290 trans
= __unlink_start_trans(dir
);
4292 return PTR_ERR(trans
);
4294 if (unlikely(btrfs_ino(BTRFS_I(inode
)) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID
)) {
4295 err
= btrfs_unlink_subvol(trans
, root
, dir
,
4296 BTRFS_I(inode
)->location
.objectid
,
4297 dentry
->d_name
.name
,
4298 dentry
->d_name
.len
);
4302 err
= btrfs_orphan_add(trans
, BTRFS_I(inode
));
4306 last_unlink_trans
= BTRFS_I(inode
)->last_unlink_trans
;
4308 /* now the directory is empty */
4309 err
= btrfs_unlink_inode(trans
, root
, BTRFS_I(dir
),
4310 BTRFS_I(d_inode(dentry
)), dentry
->d_name
.name
,
4311 dentry
->d_name
.len
);
4313 btrfs_i_size_write(BTRFS_I(inode
), 0);
4315 * Propagate the last_unlink_trans value of the deleted dir to
4316 * its parent directory. This is to prevent an unrecoverable
4317 * log tree in the case we do something like this:
4319 * 2) create snapshot under dir foo
4320 * 3) delete the snapshot
4323 * 6) fsync foo or some file inside foo
4325 if (last_unlink_trans
>= trans
->transid
)
4326 BTRFS_I(dir
)->last_unlink_trans
= last_unlink_trans
;
4329 btrfs_end_transaction(trans
);
4330 btrfs_btree_balance_dirty(root
->fs_info
);
4335 static int truncate_space_check(struct btrfs_trans_handle
*trans
,
4336 struct btrfs_root
*root
,
4339 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
4343 * This is only used to apply pressure to the enospc system, we don't
4344 * intend to use this reservation at all.
4346 bytes_deleted
= btrfs_csum_bytes_to_leaves(fs_info
, bytes_deleted
);
4347 bytes_deleted
*= fs_info
->nodesize
;
4348 ret
= btrfs_block_rsv_add(root
, &fs_info
->trans_block_rsv
,
4349 bytes_deleted
, BTRFS_RESERVE_NO_FLUSH
);
4351 trace_btrfs_space_reservation(fs_info
, "transaction",
4354 trans
->bytes_reserved
+= bytes_deleted
;
4360 static int truncate_inline_extent(struct inode
*inode
,
4361 struct btrfs_path
*path
,
4362 struct btrfs_key
*found_key
,
4366 struct extent_buffer
*leaf
= path
->nodes
[0];
4367 int slot
= path
->slots
[0];
4368 struct btrfs_file_extent_item
*fi
;
4369 u32 size
= (u32
)(new_size
- found_key
->offset
);
4370 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
4372 fi
= btrfs_item_ptr(leaf
, slot
, struct btrfs_file_extent_item
);
4374 if (btrfs_file_extent_compression(leaf
, fi
) != BTRFS_COMPRESS_NONE
) {
4375 loff_t offset
= new_size
;
4376 loff_t page_end
= ALIGN(offset
, PAGE_SIZE
);
4379 * Zero out the remaining of the last page of our inline extent,
4380 * instead of directly truncating our inline extent here - that
4381 * would be much more complex (decompressing all the data, then
4382 * compressing the truncated data, which might be bigger than
4383 * the size of the inline extent, resize the extent, etc).
4384 * We release the path because to get the page we might need to
4385 * read the extent item from disk (data not in the page cache).
4387 btrfs_release_path(path
);
4388 return btrfs_truncate_block(inode
, offset
, page_end
- offset
,
4392 btrfs_set_file_extent_ram_bytes(leaf
, fi
, size
);
4393 size
= btrfs_file_extent_calc_inline_size(size
);
4394 btrfs_truncate_item(root
->fs_info
, path
, size
, 1);
4396 if (test_bit(BTRFS_ROOT_REF_COWS
, &root
->state
))
4397 inode_sub_bytes(inode
, item_end
+ 1 - new_size
);
4403 * this can truncate away extent items, csum items and directory items.
4404 * It starts at a high offset and removes keys until it can't find
4405 * any higher than new_size
4407 * csum items that cross the new i_size are truncated to the new size
4410 * min_type is the minimum key type to truncate down to. If set to 0, this
4411 * will kill all the items on this inode, including the INODE_ITEM_KEY.
4413 int btrfs_truncate_inode_items(struct btrfs_trans_handle
*trans
,
4414 struct btrfs_root
*root
,
4415 struct inode
*inode
,
4416 u64 new_size
, u32 min_type
)
4418 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
4419 struct btrfs_path
*path
;
4420 struct extent_buffer
*leaf
;
4421 struct btrfs_file_extent_item
*fi
;
4422 struct btrfs_key key
;
4423 struct btrfs_key found_key
;
4424 u64 extent_start
= 0;
4425 u64 extent_num_bytes
= 0;
4426 u64 extent_offset
= 0;
4428 u64 last_size
= new_size
;
4429 u32 found_type
= (u8
)-1;
4432 int pending_del_nr
= 0;
4433 int pending_del_slot
= 0;
4434 int extent_type
= -1;
4437 u64 ino
= btrfs_ino(BTRFS_I(inode
));
4438 u64 bytes_deleted
= 0;
4440 bool should_throttle
= 0;
4441 bool should_end
= 0;
4443 BUG_ON(new_size
> 0 && min_type
!= BTRFS_EXTENT_DATA_KEY
);
4446 * for non-free space inodes and ref cows, we want to back off from
4449 if (!btrfs_is_free_space_inode(BTRFS_I(inode
)) &&
4450 test_bit(BTRFS_ROOT_REF_COWS
, &root
->state
))
4453 path
= btrfs_alloc_path();
4456 path
->reada
= READA_BACK
;
4459 * We want to drop from the next block forward in case this new size is
4460 * not block aligned since we will be keeping the last block of the
4461 * extent just the way it is.
4463 if (test_bit(BTRFS_ROOT_REF_COWS
, &root
->state
) ||
4464 root
== fs_info
->tree_root
)
4465 btrfs_drop_extent_cache(BTRFS_I(inode
), ALIGN(new_size
,
4466 fs_info
->sectorsize
),
4470 * This function is also used to drop the items in the log tree before
4471 * we relog the inode, so if root != BTRFS_I(inode)->root, it means
4472 * it is used to drop the loged items. So we shouldn't kill the delayed
4475 if (min_type
== 0 && root
== BTRFS_I(inode
)->root
)
4476 btrfs_kill_delayed_inode_items(BTRFS_I(inode
));
4479 key
.offset
= (u64
)-1;
4484 * with a 16K leaf size and 128MB extents, you can actually queue
4485 * up a huge file in a single leaf. Most of the time that
4486 * bytes_deleted is > 0, it will be huge by the time we get here
4488 if (be_nice
&& bytes_deleted
> SZ_32M
) {
4489 if (btrfs_should_end_transaction(trans
)) {
4496 path
->leave_spinning
= 1;
4497 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
4504 /* there are no items in the tree for us to truncate, we're
4507 if (path
->slots
[0] == 0)
4514 leaf
= path
->nodes
[0];
4515 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
4516 found_type
= found_key
.type
;
4518 if (found_key
.objectid
!= ino
)
4521 if (found_type
< min_type
)
4524 item_end
= found_key
.offset
;
4525 if (found_type
== BTRFS_EXTENT_DATA_KEY
) {
4526 fi
= btrfs_item_ptr(leaf
, path
->slots
[0],
4527 struct btrfs_file_extent_item
);
4528 extent_type
= btrfs_file_extent_type(leaf
, fi
);
4529 if (extent_type
!= BTRFS_FILE_EXTENT_INLINE
) {
4531 btrfs_file_extent_num_bytes(leaf
, fi
);
4533 trace_btrfs_truncate_show_fi_regular(
4534 BTRFS_I(inode
), leaf
, fi
,
4536 } else if (extent_type
== BTRFS_FILE_EXTENT_INLINE
) {
4537 item_end
+= btrfs_file_extent_inline_len(leaf
,
4538 path
->slots
[0], fi
);
4540 trace_btrfs_truncate_show_fi_inline(
4541 BTRFS_I(inode
), leaf
, fi
, path
->slots
[0],
4546 if (found_type
> min_type
) {
4549 if (item_end
< new_size
)
4551 if (found_key
.offset
>= new_size
)
4557 /* FIXME, shrink the extent if the ref count is only 1 */
4558 if (found_type
!= BTRFS_EXTENT_DATA_KEY
)
4562 last_size
= found_key
.offset
;
4564 last_size
= new_size
;
4566 if (extent_type
!= BTRFS_FILE_EXTENT_INLINE
) {
4568 extent_start
= btrfs_file_extent_disk_bytenr(leaf
, fi
);
4570 u64 orig_num_bytes
=
4571 btrfs_file_extent_num_bytes(leaf
, fi
);
4572 extent_num_bytes
= ALIGN(new_size
-
4574 fs_info
->sectorsize
);
4575 btrfs_set_file_extent_num_bytes(leaf
, fi
,
4577 num_dec
= (orig_num_bytes
-
4579 if (test_bit(BTRFS_ROOT_REF_COWS
,
4582 inode_sub_bytes(inode
, num_dec
);
4583 btrfs_mark_buffer_dirty(leaf
);
4586 btrfs_file_extent_disk_num_bytes(leaf
,
4588 extent_offset
= found_key
.offset
-
4589 btrfs_file_extent_offset(leaf
, fi
);
4591 /* FIXME blocksize != 4096 */
4592 num_dec
= btrfs_file_extent_num_bytes(leaf
, fi
);
4593 if (extent_start
!= 0) {
4595 if (test_bit(BTRFS_ROOT_REF_COWS
,
4597 inode_sub_bytes(inode
, num_dec
);
4600 } else if (extent_type
== BTRFS_FILE_EXTENT_INLINE
) {
4602 * we can't truncate inline items that have had
4606 btrfs_file_extent_encryption(leaf
, fi
) == 0 &&
4607 btrfs_file_extent_other_encoding(leaf
, fi
) == 0) {
4610 * Need to release path in order to truncate a
4611 * compressed extent. So delete any accumulated
4612 * extent items so far.
4614 if (btrfs_file_extent_compression(leaf
, fi
) !=
4615 BTRFS_COMPRESS_NONE
&& pending_del_nr
) {
4616 err
= btrfs_del_items(trans
, root
, path
,
4620 btrfs_abort_transaction(trans
,
4627 err
= truncate_inline_extent(inode
, path
,
4632 btrfs_abort_transaction(trans
, err
);
4635 } else if (test_bit(BTRFS_ROOT_REF_COWS
,
4637 inode_sub_bytes(inode
, item_end
+ 1 - new_size
);
4642 if (!pending_del_nr
) {
4643 /* no pending yet, add ourselves */
4644 pending_del_slot
= path
->slots
[0];
4646 } else if (pending_del_nr
&&
4647 path
->slots
[0] + 1 == pending_del_slot
) {
4648 /* hop on the pending chunk */
4650 pending_del_slot
= path
->slots
[0];
4657 should_throttle
= 0;
4660 (test_bit(BTRFS_ROOT_REF_COWS
, &root
->state
) ||
4661 root
== fs_info
->tree_root
)) {
4662 btrfs_set_path_blocking(path
);
4663 bytes_deleted
+= extent_num_bytes
;
4664 ret
= btrfs_free_extent(trans
, fs_info
, extent_start
,
4665 extent_num_bytes
, 0,
4666 btrfs_header_owner(leaf
),
4667 ino
, extent_offset
);
4669 if (btrfs_should_throttle_delayed_refs(trans
, fs_info
))
4670 btrfs_async_run_delayed_refs(fs_info
,
4671 trans
->delayed_ref_updates
* 2,
4674 if (truncate_space_check(trans
, root
,
4675 extent_num_bytes
)) {
4678 if (btrfs_should_throttle_delayed_refs(trans
,
4680 should_throttle
= 1;
4684 if (found_type
== BTRFS_INODE_ITEM_KEY
)
4687 if (path
->slots
[0] == 0 ||
4688 path
->slots
[0] != pending_del_slot
||
4689 should_throttle
|| should_end
) {
4690 if (pending_del_nr
) {
4691 ret
= btrfs_del_items(trans
, root
, path
,
4695 btrfs_abort_transaction(trans
, ret
);
4700 btrfs_release_path(path
);
4701 if (should_throttle
) {
4702 unsigned long updates
= trans
->delayed_ref_updates
;
4704 trans
->delayed_ref_updates
= 0;
4705 ret
= btrfs_run_delayed_refs(trans
,
4713 * if we failed to refill our space rsv, bail out
4714 * and let the transaction restart
4726 if (pending_del_nr
) {
4727 ret
= btrfs_del_items(trans
, root
, path
, pending_del_slot
,
4730 btrfs_abort_transaction(trans
, ret
);
4733 if (root
->root_key
.objectid
!= BTRFS_TREE_LOG_OBJECTID
) {
4734 ASSERT(last_size
>= new_size
);
4735 if (!err
&& last_size
> new_size
)
4736 last_size
= new_size
;
4737 btrfs_ordered_update_i_size(inode
, last_size
, NULL
);
4740 btrfs_free_path(path
);
4742 if (be_nice
&& bytes_deleted
> SZ_32M
) {
4743 unsigned long updates
= trans
->delayed_ref_updates
;
4745 trans
->delayed_ref_updates
= 0;
4746 ret
= btrfs_run_delayed_refs(trans
, fs_info
,
4756 * btrfs_truncate_block - read, zero a chunk and write a block
4757 * @inode - inode that we're zeroing
4758 * @from - the offset to start zeroing
4759 * @len - the length to zero, 0 to zero the entire range respective to the
4761 * @front - zero up to the offset instead of from the offset on
4763 * This will find the block for the "from" offset and cow the block and zero the
4764 * part we want to zero. This is used with truncate and hole punching.
4766 int btrfs_truncate_block(struct inode
*inode
, loff_t from
, loff_t len
,
4769 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
4770 struct address_space
*mapping
= inode
->i_mapping
;
4771 struct extent_io_tree
*io_tree
= &BTRFS_I(inode
)->io_tree
;
4772 struct btrfs_ordered_extent
*ordered
;
4773 struct extent_state
*cached_state
= NULL
;
4774 struct extent_changeset
*data_reserved
= NULL
;
4776 u32 blocksize
= fs_info
->sectorsize
;
4777 pgoff_t index
= from
>> PAGE_SHIFT
;
4778 unsigned offset
= from
& (blocksize
- 1);
4780 gfp_t mask
= btrfs_alloc_write_mask(mapping
);
4785 if ((offset
& (blocksize
- 1)) == 0 &&
4786 (!len
|| ((len
& (blocksize
- 1)) == 0)))
4789 ret
= btrfs_delalloc_reserve_space(inode
, &data_reserved
,
4790 round_down(from
, blocksize
), blocksize
);
4795 page
= find_or_create_page(mapping
, index
, mask
);
4797 btrfs_delalloc_release_space(inode
, data_reserved
,
4798 round_down(from
, blocksize
),
4804 block_start
= round_down(from
, blocksize
);
4805 block_end
= block_start
+ blocksize
- 1;
4807 if (!PageUptodate(page
)) {
4808 ret
= btrfs_readpage(NULL
, page
);
4810 if (page
->mapping
!= mapping
) {
4815 if (!PageUptodate(page
)) {
4820 wait_on_page_writeback(page
);
4822 lock_extent_bits(io_tree
, block_start
, block_end
, &cached_state
);
4823 set_page_extent_mapped(page
);
4825 ordered
= btrfs_lookup_ordered_extent(inode
, block_start
);
4827 unlock_extent_cached(io_tree
, block_start
, block_end
,
4828 &cached_state
, GFP_NOFS
);
4831 btrfs_start_ordered_extent(inode
, ordered
, 1);
4832 btrfs_put_ordered_extent(ordered
);
4836 clear_extent_bit(&BTRFS_I(inode
)->io_tree
, block_start
, block_end
,
4837 EXTENT_DIRTY
| EXTENT_DELALLOC
|
4838 EXTENT_DO_ACCOUNTING
| EXTENT_DEFRAG
,
4839 0, 0, &cached_state
, GFP_NOFS
);
4841 ret
= btrfs_set_extent_delalloc(inode
, block_start
, block_end
,
4844 unlock_extent_cached(io_tree
, block_start
, block_end
,
4845 &cached_state
, GFP_NOFS
);
4849 if (offset
!= blocksize
) {
4851 len
= blocksize
- offset
;
4854 memset(kaddr
+ (block_start
- page_offset(page
)),
4857 memset(kaddr
+ (block_start
- page_offset(page
)) + offset
,
4859 flush_dcache_page(page
);
4862 ClearPageChecked(page
);
4863 set_page_dirty(page
);
4864 unlock_extent_cached(io_tree
, block_start
, block_end
, &cached_state
,
4869 btrfs_delalloc_release_space(inode
, data_reserved
, block_start
,
4874 extent_changeset_free(data_reserved
);
4878 static int maybe_insert_hole(struct btrfs_root
*root
, struct inode
*inode
,
4879 u64 offset
, u64 len
)
4881 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
4882 struct btrfs_trans_handle
*trans
;
4886 * Still need to make sure the inode looks like it's been updated so
4887 * that any holes get logged if we fsync.
4889 if (btrfs_fs_incompat(fs_info
, NO_HOLES
)) {
4890 BTRFS_I(inode
)->last_trans
= fs_info
->generation
;
4891 BTRFS_I(inode
)->last_sub_trans
= root
->log_transid
;
4892 BTRFS_I(inode
)->last_log_commit
= root
->last_log_commit
;
4897 * 1 - for the one we're dropping
4898 * 1 - for the one we're adding
4899 * 1 - for updating the inode.
4901 trans
= btrfs_start_transaction(root
, 3);
4903 return PTR_ERR(trans
);
4905 ret
= btrfs_drop_extents(trans
, root
, inode
, offset
, offset
+ len
, 1);
4907 btrfs_abort_transaction(trans
, ret
);
4908 btrfs_end_transaction(trans
);
4912 ret
= btrfs_insert_file_extent(trans
, root
, btrfs_ino(BTRFS_I(inode
)),
4913 offset
, 0, 0, len
, 0, len
, 0, 0, 0);
4915 btrfs_abort_transaction(trans
, ret
);
4917 btrfs_update_inode(trans
, root
, inode
);
4918 btrfs_end_transaction(trans
);
4923 * This function puts in dummy file extents for the area we're creating a hole
4924 * for. So if we are truncating this file to a larger size we need to insert
4925 * these file extents so that btrfs_get_extent will return a EXTENT_MAP_HOLE for
4926 * the range between oldsize and size
4928 int btrfs_cont_expand(struct inode
*inode
, loff_t oldsize
, loff_t size
)
4930 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
4931 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
4932 struct extent_io_tree
*io_tree
= &BTRFS_I(inode
)->io_tree
;
4933 struct extent_map
*em
= NULL
;
4934 struct extent_state
*cached_state
= NULL
;
4935 struct extent_map_tree
*em_tree
= &BTRFS_I(inode
)->extent_tree
;
4936 u64 hole_start
= ALIGN(oldsize
, fs_info
->sectorsize
);
4937 u64 block_end
= ALIGN(size
, fs_info
->sectorsize
);
4944 * If our size started in the middle of a block we need to zero out the
4945 * rest of the block before we expand the i_size, otherwise we could
4946 * expose stale data.
4948 err
= btrfs_truncate_block(inode
, oldsize
, 0, 0);
4952 if (size
<= hole_start
)
4956 struct btrfs_ordered_extent
*ordered
;
4958 lock_extent_bits(io_tree
, hole_start
, block_end
- 1,
4960 ordered
= btrfs_lookup_ordered_range(BTRFS_I(inode
), hole_start
,
4961 block_end
- hole_start
);
4964 unlock_extent_cached(io_tree
, hole_start
, block_end
- 1,
4965 &cached_state
, GFP_NOFS
);
4966 btrfs_start_ordered_extent(inode
, ordered
, 1);
4967 btrfs_put_ordered_extent(ordered
);
4970 cur_offset
= hole_start
;
4972 em
= btrfs_get_extent(BTRFS_I(inode
), NULL
, 0, cur_offset
,
4973 block_end
- cur_offset
, 0);
4979 last_byte
= min(extent_map_end(em
), block_end
);
4980 last_byte
= ALIGN(last_byte
, fs_info
->sectorsize
);
4981 if (!test_bit(EXTENT_FLAG_PREALLOC
, &em
->flags
)) {
4982 struct extent_map
*hole_em
;
4983 hole_size
= last_byte
- cur_offset
;
4985 err
= maybe_insert_hole(root
, inode
, cur_offset
,
4989 btrfs_drop_extent_cache(BTRFS_I(inode
), cur_offset
,
4990 cur_offset
+ hole_size
- 1, 0);
4991 hole_em
= alloc_extent_map();
4993 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC
,
4994 &BTRFS_I(inode
)->runtime_flags
);
4997 hole_em
->start
= cur_offset
;
4998 hole_em
->len
= hole_size
;
4999 hole_em
->orig_start
= cur_offset
;
5001 hole_em
->block_start
= EXTENT_MAP_HOLE
;
5002 hole_em
->block_len
= 0;
5003 hole_em
->orig_block_len
= 0;
5004 hole_em
->ram_bytes
= hole_size
;
5005 hole_em
->bdev
= fs_info
->fs_devices
->latest_bdev
;
5006 hole_em
->compress_type
= BTRFS_COMPRESS_NONE
;
5007 hole_em
->generation
= fs_info
->generation
;
5010 write_lock(&em_tree
->lock
);
5011 err
= add_extent_mapping(em_tree
, hole_em
, 1);
5012 write_unlock(&em_tree
->lock
);
5015 btrfs_drop_extent_cache(BTRFS_I(inode
),
5020 free_extent_map(hole_em
);
5023 free_extent_map(em
);
5025 cur_offset
= last_byte
;
5026 if (cur_offset
>= block_end
)
5029 free_extent_map(em
);
5030 unlock_extent_cached(io_tree
, hole_start
, block_end
- 1, &cached_state
,
5035 static int btrfs_setsize(struct inode
*inode
, struct iattr
*attr
)
5037 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
5038 struct btrfs_trans_handle
*trans
;
5039 loff_t oldsize
= i_size_read(inode
);
5040 loff_t newsize
= attr
->ia_size
;
5041 int mask
= attr
->ia_valid
;
5045 * The regular truncate() case without ATTR_CTIME and ATTR_MTIME is a
5046 * special case where we need to update the times despite not having
5047 * these flags set. For all other operations the VFS set these flags
5048 * explicitly if it wants a timestamp update.
5050 if (newsize
!= oldsize
) {
5051 inode_inc_iversion(inode
);
5052 if (!(mask
& (ATTR_CTIME
| ATTR_MTIME
)))
5053 inode
->i_ctime
= inode
->i_mtime
=
5054 current_time(inode
);
5057 if (newsize
> oldsize
) {
5059 * Don't do an expanding truncate while snapshoting is ongoing.
5060 * This is to ensure the snapshot captures a fully consistent
5061 * state of this file - if the snapshot captures this expanding
5062 * truncation, it must capture all writes that happened before
5065 btrfs_wait_for_snapshot_creation(root
);
5066 ret
= btrfs_cont_expand(inode
, oldsize
, newsize
);
5068 btrfs_end_write_no_snapshoting(root
);
5072 trans
= btrfs_start_transaction(root
, 1);
5073 if (IS_ERR(trans
)) {
5074 btrfs_end_write_no_snapshoting(root
);
5075 return PTR_ERR(trans
);
5078 i_size_write(inode
, newsize
);
5079 btrfs_ordered_update_i_size(inode
, i_size_read(inode
), NULL
);
5080 pagecache_isize_extended(inode
, oldsize
, newsize
);
5081 ret
= btrfs_update_inode(trans
, root
, inode
);
5082 btrfs_end_write_no_snapshoting(root
);
5083 btrfs_end_transaction(trans
);
5087 * We're truncating a file that used to have good data down to
5088 * zero. Make sure it gets into the ordered flush list so that
5089 * any new writes get down to disk quickly.
5092 set_bit(BTRFS_INODE_ORDERED_DATA_CLOSE
,
5093 &BTRFS_I(inode
)->runtime_flags
);
5096 * 1 for the orphan item we're going to add
5097 * 1 for the orphan item deletion.
5099 trans
= btrfs_start_transaction(root
, 2);
5101 return PTR_ERR(trans
);
5104 * We need to do this in case we fail at _any_ point during the
5105 * actual truncate. Once we do the truncate_setsize we could
5106 * invalidate pages which forces any outstanding ordered io to
5107 * be instantly completed which will give us extents that need
5108 * to be truncated. If we fail to get an orphan inode down we
5109 * could have left over extents that were never meant to live,
5110 * so we need to guarantee from this point on that everything
5111 * will be consistent.
5113 ret
= btrfs_orphan_add(trans
, BTRFS_I(inode
));
5114 btrfs_end_transaction(trans
);
5118 /* we don't support swapfiles, so vmtruncate shouldn't fail */
5119 truncate_setsize(inode
, newsize
);
5121 /* Disable nonlocked read DIO to avoid the end less truncate */
5122 btrfs_inode_block_unlocked_dio(BTRFS_I(inode
));
5123 inode_dio_wait(inode
);
5124 btrfs_inode_resume_unlocked_dio(BTRFS_I(inode
));
5126 ret
= btrfs_truncate(inode
);
5127 if (ret
&& inode
->i_nlink
) {
5130 /* To get a stable disk_i_size */
5131 err
= btrfs_wait_ordered_range(inode
, 0, (u64
)-1);
5133 btrfs_orphan_del(NULL
, BTRFS_I(inode
));
5138 * failed to truncate, disk_i_size is only adjusted down
5139 * as we remove extents, so it should represent the true
5140 * size of the inode, so reset the in memory size and
5141 * delete our orphan entry.
5143 trans
= btrfs_join_transaction(root
);
5144 if (IS_ERR(trans
)) {
5145 btrfs_orphan_del(NULL
, BTRFS_I(inode
));
5148 i_size_write(inode
, BTRFS_I(inode
)->disk_i_size
);
5149 err
= btrfs_orphan_del(trans
, BTRFS_I(inode
));
5151 btrfs_abort_transaction(trans
, err
);
5152 btrfs_end_transaction(trans
);
5159 static int btrfs_setattr(struct dentry
*dentry
, struct iattr
*attr
)
5161 struct inode
*inode
= d_inode(dentry
);
5162 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
5165 if (btrfs_root_readonly(root
))
5168 err
= setattr_prepare(dentry
, attr
);
5172 if (S_ISREG(inode
->i_mode
) && (attr
->ia_valid
& ATTR_SIZE
)) {
5173 err
= btrfs_setsize(inode
, attr
);
5178 if (attr
->ia_valid
) {
5179 setattr_copy(inode
, attr
);
5180 inode_inc_iversion(inode
);
5181 err
= btrfs_dirty_inode(inode
);
5183 if (!err
&& attr
->ia_valid
& ATTR_MODE
)
5184 err
= posix_acl_chmod(inode
, inode
->i_mode
);
5191 * While truncating the inode pages during eviction, we get the VFS calling
5192 * btrfs_invalidatepage() against each page of the inode. This is slow because
5193 * the calls to btrfs_invalidatepage() result in a huge amount of calls to
5194 * lock_extent_bits() and clear_extent_bit(), which keep merging and splitting
5195 * extent_state structures over and over, wasting lots of time.
5197 * Therefore if the inode is being evicted, let btrfs_invalidatepage() skip all
5198 * those expensive operations on a per page basis and do only the ordered io
5199 * finishing, while we release here the extent_map and extent_state structures,
5200 * without the excessive merging and splitting.
5202 static void evict_inode_truncate_pages(struct inode
*inode
)
5204 struct extent_io_tree
*io_tree
= &BTRFS_I(inode
)->io_tree
;
5205 struct extent_map_tree
*map_tree
= &BTRFS_I(inode
)->extent_tree
;
5206 struct rb_node
*node
;
5208 ASSERT(inode
->i_state
& I_FREEING
);
5209 truncate_inode_pages_final(&inode
->i_data
);
5211 write_lock(&map_tree
->lock
);
5212 while (!RB_EMPTY_ROOT(&map_tree
->map
)) {
5213 struct extent_map
*em
;
5215 node
= rb_first(&map_tree
->map
);
5216 em
= rb_entry(node
, struct extent_map
, rb_node
);
5217 clear_bit(EXTENT_FLAG_PINNED
, &em
->flags
);
5218 clear_bit(EXTENT_FLAG_LOGGING
, &em
->flags
);
5219 remove_extent_mapping(map_tree
, em
);
5220 free_extent_map(em
);
5221 if (need_resched()) {
5222 write_unlock(&map_tree
->lock
);
5224 write_lock(&map_tree
->lock
);
5227 write_unlock(&map_tree
->lock
);
5230 * Keep looping until we have no more ranges in the io tree.
5231 * We can have ongoing bios started by readpages (called from readahead)
5232 * that have their endio callback (extent_io.c:end_bio_extent_readpage)
5233 * still in progress (unlocked the pages in the bio but did not yet
5234 * unlocked the ranges in the io tree). Therefore this means some
5235 * ranges can still be locked and eviction started because before
5236 * submitting those bios, which are executed by a separate task (work
5237 * queue kthread), inode references (inode->i_count) were not taken
5238 * (which would be dropped in the end io callback of each bio).
5239 * Therefore here we effectively end up waiting for those bios and
5240 * anyone else holding locked ranges without having bumped the inode's
5241 * reference count - if we don't do it, when they access the inode's
5242 * io_tree to unlock a range it may be too late, leading to an
5243 * use-after-free issue.
5245 spin_lock(&io_tree
->lock
);
5246 while (!RB_EMPTY_ROOT(&io_tree
->state
)) {
5247 struct extent_state
*state
;
5248 struct extent_state
*cached_state
= NULL
;
5252 node
= rb_first(&io_tree
->state
);
5253 state
= rb_entry(node
, struct extent_state
, rb_node
);
5254 start
= state
->start
;
5256 spin_unlock(&io_tree
->lock
);
5258 lock_extent_bits(io_tree
, start
, end
, &cached_state
);
5261 * If still has DELALLOC flag, the extent didn't reach disk,
5262 * and its reserved space won't be freed by delayed_ref.
5263 * So we need to free its reserved space here.
5264 * (Refer to comment in btrfs_invalidatepage, case 2)
5266 * Note, end is the bytenr of last byte, so we need + 1 here.
5268 if (state
->state
& EXTENT_DELALLOC
)
5269 btrfs_qgroup_free_data(inode
, NULL
, start
, end
- start
+ 1);
5271 clear_extent_bit(io_tree
, start
, end
,
5272 EXTENT_LOCKED
| EXTENT_DIRTY
|
5273 EXTENT_DELALLOC
| EXTENT_DO_ACCOUNTING
|
5274 EXTENT_DEFRAG
, 1, 1,
5275 &cached_state
, GFP_NOFS
);
5278 spin_lock(&io_tree
->lock
);
5280 spin_unlock(&io_tree
->lock
);
5283 void btrfs_evict_inode(struct inode
*inode
)
5285 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
5286 struct btrfs_trans_handle
*trans
;
5287 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
5288 struct btrfs_block_rsv
*rsv
, *global_rsv
;
5289 int steal_from_global
= 0;
5293 trace_btrfs_inode_evict(inode
);
5296 kmem_cache_free(btrfs_inode_cachep
, BTRFS_I(inode
));
5300 min_size
= btrfs_calc_trunc_metadata_size(fs_info
, 1);
5302 evict_inode_truncate_pages(inode
);
5304 if (inode
->i_nlink
&&
5305 ((btrfs_root_refs(&root
->root_item
) != 0 &&
5306 root
->root_key
.objectid
!= BTRFS_ROOT_TREE_OBJECTID
) ||
5307 btrfs_is_free_space_inode(BTRFS_I(inode
))))
5310 if (is_bad_inode(inode
)) {
5311 btrfs_orphan_del(NULL
, BTRFS_I(inode
));
5314 /* do we really want it for ->i_nlink > 0 and zero btrfs_root_refs? */
5315 if (!special_file(inode
->i_mode
))
5316 btrfs_wait_ordered_range(inode
, 0, (u64
)-1);
5318 btrfs_free_io_failure_record(BTRFS_I(inode
), 0, (u64
)-1);
5320 if (test_bit(BTRFS_FS_LOG_RECOVERING
, &fs_info
->flags
)) {
5321 BUG_ON(test_bit(BTRFS_INODE_HAS_ORPHAN_ITEM
,
5322 &BTRFS_I(inode
)->runtime_flags
));
5326 if (inode
->i_nlink
> 0) {
5327 BUG_ON(btrfs_root_refs(&root
->root_item
) != 0 &&
5328 root
->root_key
.objectid
!= BTRFS_ROOT_TREE_OBJECTID
);
5332 ret
= btrfs_commit_inode_delayed_inode(BTRFS_I(inode
));
5334 btrfs_orphan_del(NULL
, BTRFS_I(inode
));
5338 rsv
= btrfs_alloc_block_rsv(fs_info
, BTRFS_BLOCK_RSV_TEMP
);
5340 btrfs_orphan_del(NULL
, BTRFS_I(inode
));
5343 rsv
->size
= min_size
;
5345 global_rsv
= &fs_info
->global_block_rsv
;
5347 btrfs_i_size_write(BTRFS_I(inode
), 0);
5350 * This is a bit simpler than btrfs_truncate since we've already
5351 * reserved our space for our orphan item in the unlink, so we just
5352 * need to reserve some slack space in case we add bytes and update
5353 * inode item when doing the truncate.
5356 ret
= btrfs_block_rsv_refill(root
, rsv
, min_size
,
5357 BTRFS_RESERVE_FLUSH_LIMIT
);
5360 * Try and steal from the global reserve since we will
5361 * likely not use this space anyway, we want to try as
5362 * hard as possible to get this to work.
5365 steal_from_global
++;
5367 steal_from_global
= 0;
5371 * steal_from_global == 0: we reserved stuff, hooray!
5372 * steal_from_global == 1: we didn't reserve stuff, boo!
5373 * steal_from_global == 2: we've committed, still not a lot of
5374 * room but maybe we'll have room in the global reserve this
5376 * steal_from_global == 3: abandon all hope!
5378 if (steal_from_global
> 2) {
5380 "Could not get space for a delete, will truncate on mount %d",
5382 btrfs_orphan_del(NULL
, BTRFS_I(inode
));
5383 btrfs_free_block_rsv(fs_info
, rsv
);
5387 trans
= btrfs_join_transaction(root
);
5388 if (IS_ERR(trans
)) {
5389 btrfs_orphan_del(NULL
, BTRFS_I(inode
));
5390 btrfs_free_block_rsv(fs_info
, rsv
);
5395 * We can't just steal from the global reserve, we need to make
5396 * sure there is room to do it, if not we need to commit and try
5399 if (steal_from_global
) {
5400 if (!btrfs_check_space_for_delayed_refs(trans
, fs_info
))
5401 ret
= btrfs_block_rsv_migrate(global_rsv
, rsv
,
5408 * Couldn't steal from the global reserve, we have too much
5409 * pending stuff built up, commit the transaction and try it
5413 ret
= btrfs_commit_transaction(trans
);
5415 btrfs_orphan_del(NULL
, BTRFS_I(inode
));
5416 btrfs_free_block_rsv(fs_info
, rsv
);
5421 steal_from_global
= 0;
5424 trans
->block_rsv
= rsv
;
5426 ret
= btrfs_truncate_inode_items(trans
, root
, inode
, 0, 0);
5427 if (ret
!= -ENOSPC
&& ret
!= -EAGAIN
)
5430 trans
->block_rsv
= &fs_info
->trans_block_rsv
;
5431 btrfs_end_transaction(trans
);
5433 btrfs_btree_balance_dirty(fs_info
);
5436 btrfs_free_block_rsv(fs_info
, rsv
);
5439 * Errors here aren't a big deal, it just means we leave orphan items
5440 * in the tree. They will be cleaned up on the next mount.
5443 trans
->block_rsv
= root
->orphan_block_rsv
;
5444 btrfs_orphan_del(trans
, BTRFS_I(inode
));
5446 btrfs_orphan_del(NULL
, BTRFS_I(inode
));
5449 trans
->block_rsv
= &fs_info
->trans_block_rsv
;
5450 if (!(root
== fs_info
->tree_root
||
5451 root
->root_key
.objectid
== BTRFS_TREE_RELOC_OBJECTID
))
5452 btrfs_return_ino(root
, btrfs_ino(BTRFS_I(inode
)));
5454 btrfs_end_transaction(trans
);
5455 btrfs_btree_balance_dirty(fs_info
);
5457 btrfs_remove_delayed_node(BTRFS_I(inode
));
5462 * this returns the key found in the dir entry in the location pointer.
5463 * If no dir entries were found, location->objectid is 0.
5465 static int btrfs_inode_by_name(struct inode
*dir
, struct dentry
*dentry
,
5466 struct btrfs_key
*location
)
5468 const char *name
= dentry
->d_name
.name
;
5469 int namelen
= dentry
->d_name
.len
;
5470 struct btrfs_dir_item
*di
;
5471 struct btrfs_path
*path
;
5472 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
5475 path
= btrfs_alloc_path();
5479 di
= btrfs_lookup_dir_item(NULL
, root
, path
, btrfs_ino(BTRFS_I(dir
)),
5484 if (IS_ERR_OR_NULL(di
))
5487 btrfs_dir_item_key_to_cpu(path
->nodes
[0], di
, location
);
5489 btrfs_free_path(path
);
5492 location
->objectid
= 0;
5497 * when we hit a tree root in a directory, the btrfs part of the inode
5498 * needs to be changed to reflect the root directory of the tree root. This
5499 * is kind of like crossing a mount point.
5501 static int fixup_tree_root_location(struct btrfs_fs_info
*fs_info
,
5503 struct dentry
*dentry
,
5504 struct btrfs_key
*location
,
5505 struct btrfs_root
**sub_root
)
5507 struct btrfs_path
*path
;
5508 struct btrfs_root
*new_root
;
5509 struct btrfs_root_ref
*ref
;
5510 struct extent_buffer
*leaf
;
5511 struct btrfs_key key
;
5515 path
= btrfs_alloc_path();
5522 key
.objectid
= BTRFS_I(dir
)->root
->root_key
.objectid
;
5523 key
.type
= BTRFS_ROOT_REF_KEY
;
5524 key
.offset
= location
->objectid
;
5526 ret
= btrfs_search_slot(NULL
, fs_info
->tree_root
, &key
, path
, 0, 0);
5533 leaf
= path
->nodes
[0];
5534 ref
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_root_ref
);
5535 if (btrfs_root_ref_dirid(leaf
, ref
) != btrfs_ino(BTRFS_I(dir
)) ||
5536 btrfs_root_ref_name_len(leaf
, ref
) != dentry
->d_name
.len
)
5539 ret
= memcmp_extent_buffer(leaf
, dentry
->d_name
.name
,
5540 (unsigned long)(ref
+ 1),
5541 dentry
->d_name
.len
);
5545 btrfs_release_path(path
);
5547 new_root
= btrfs_read_fs_root_no_name(fs_info
, location
);
5548 if (IS_ERR(new_root
)) {
5549 err
= PTR_ERR(new_root
);
5553 *sub_root
= new_root
;
5554 location
->objectid
= btrfs_root_dirid(&new_root
->root_item
);
5555 location
->type
= BTRFS_INODE_ITEM_KEY
;
5556 location
->offset
= 0;
5559 btrfs_free_path(path
);
5563 static void inode_tree_add(struct inode
*inode
)
5565 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
5566 struct btrfs_inode
*entry
;
5568 struct rb_node
*parent
;
5569 struct rb_node
*new = &BTRFS_I(inode
)->rb_node
;
5570 u64 ino
= btrfs_ino(BTRFS_I(inode
));
5572 if (inode_unhashed(inode
))
5575 spin_lock(&root
->inode_lock
);
5576 p
= &root
->inode_tree
.rb_node
;
5579 entry
= rb_entry(parent
, struct btrfs_inode
, rb_node
);
5581 if (ino
< btrfs_ino(BTRFS_I(&entry
->vfs_inode
)))
5582 p
= &parent
->rb_left
;
5583 else if (ino
> btrfs_ino(BTRFS_I(&entry
->vfs_inode
)))
5584 p
= &parent
->rb_right
;
5586 WARN_ON(!(entry
->vfs_inode
.i_state
&
5587 (I_WILL_FREE
| I_FREEING
)));
5588 rb_replace_node(parent
, new, &root
->inode_tree
);
5589 RB_CLEAR_NODE(parent
);
5590 spin_unlock(&root
->inode_lock
);
5594 rb_link_node(new, parent
, p
);
5595 rb_insert_color(new, &root
->inode_tree
);
5596 spin_unlock(&root
->inode_lock
);
5599 static void inode_tree_del(struct inode
*inode
)
5601 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
5602 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
5605 spin_lock(&root
->inode_lock
);
5606 if (!RB_EMPTY_NODE(&BTRFS_I(inode
)->rb_node
)) {
5607 rb_erase(&BTRFS_I(inode
)->rb_node
, &root
->inode_tree
);
5608 RB_CLEAR_NODE(&BTRFS_I(inode
)->rb_node
);
5609 empty
= RB_EMPTY_ROOT(&root
->inode_tree
);
5611 spin_unlock(&root
->inode_lock
);
5613 if (empty
&& btrfs_root_refs(&root
->root_item
) == 0) {
5614 synchronize_srcu(&fs_info
->subvol_srcu
);
5615 spin_lock(&root
->inode_lock
);
5616 empty
= RB_EMPTY_ROOT(&root
->inode_tree
);
5617 spin_unlock(&root
->inode_lock
);
5619 btrfs_add_dead_root(root
);
5623 void btrfs_invalidate_inodes(struct btrfs_root
*root
)
5625 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
5626 struct rb_node
*node
;
5627 struct rb_node
*prev
;
5628 struct btrfs_inode
*entry
;
5629 struct inode
*inode
;
5632 if (!test_bit(BTRFS_FS_STATE_ERROR
, &fs_info
->fs_state
))
5633 WARN_ON(btrfs_root_refs(&root
->root_item
) != 0);
5635 spin_lock(&root
->inode_lock
);
5637 node
= root
->inode_tree
.rb_node
;
5641 entry
= rb_entry(node
, struct btrfs_inode
, rb_node
);
5643 if (objectid
< btrfs_ino(BTRFS_I(&entry
->vfs_inode
)))
5644 node
= node
->rb_left
;
5645 else if (objectid
> btrfs_ino(BTRFS_I(&entry
->vfs_inode
)))
5646 node
= node
->rb_right
;
5652 entry
= rb_entry(prev
, struct btrfs_inode
, rb_node
);
5653 if (objectid
<= btrfs_ino(BTRFS_I(&entry
->vfs_inode
))) {
5657 prev
= rb_next(prev
);
5661 entry
= rb_entry(node
, struct btrfs_inode
, rb_node
);
5662 objectid
= btrfs_ino(BTRFS_I(&entry
->vfs_inode
)) + 1;
5663 inode
= igrab(&entry
->vfs_inode
);
5665 spin_unlock(&root
->inode_lock
);
5666 if (atomic_read(&inode
->i_count
) > 1)
5667 d_prune_aliases(inode
);
5669 * btrfs_drop_inode will have it removed from
5670 * the inode cache when its usage count
5675 spin_lock(&root
->inode_lock
);
5679 if (cond_resched_lock(&root
->inode_lock
))
5682 node
= rb_next(node
);
5684 spin_unlock(&root
->inode_lock
);
5687 static int btrfs_init_locked_inode(struct inode
*inode
, void *p
)
5689 struct btrfs_iget_args
*args
= p
;
5690 inode
->i_ino
= args
->location
->objectid
;
5691 memcpy(&BTRFS_I(inode
)->location
, args
->location
,
5692 sizeof(*args
->location
));
5693 BTRFS_I(inode
)->root
= args
->root
;
5697 static int btrfs_find_actor(struct inode
*inode
, void *opaque
)
5699 struct btrfs_iget_args
*args
= opaque
;
5700 return args
->location
->objectid
== BTRFS_I(inode
)->location
.objectid
&&
5701 args
->root
== BTRFS_I(inode
)->root
;
5704 static struct inode
*btrfs_iget_locked(struct super_block
*s
,
5705 struct btrfs_key
*location
,
5706 struct btrfs_root
*root
)
5708 struct inode
*inode
;
5709 struct btrfs_iget_args args
;
5710 unsigned long hashval
= btrfs_inode_hash(location
->objectid
, root
);
5712 args
.location
= location
;
5715 inode
= iget5_locked(s
, hashval
, btrfs_find_actor
,
5716 btrfs_init_locked_inode
,
5721 /* Get an inode object given its location and corresponding root.
5722 * Returns in *is_new if the inode was read from disk
5724 struct inode
*btrfs_iget(struct super_block
*s
, struct btrfs_key
*location
,
5725 struct btrfs_root
*root
, int *new)
5727 struct inode
*inode
;
5729 inode
= btrfs_iget_locked(s
, location
, root
);
5731 return ERR_PTR(-ENOMEM
);
5733 if (inode
->i_state
& I_NEW
) {
5736 ret
= btrfs_read_locked_inode(inode
);
5737 if (!is_bad_inode(inode
)) {
5738 inode_tree_add(inode
);
5739 unlock_new_inode(inode
);
5743 unlock_new_inode(inode
);
5746 inode
= ERR_PTR(ret
< 0 ? ret
: -ESTALE
);
5753 static struct inode
*new_simple_dir(struct super_block
*s
,
5754 struct btrfs_key
*key
,
5755 struct btrfs_root
*root
)
5757 struct inode
*inode
= new_inode(s
);
5760 return ERR_PTR(-ENOMEM
);
5762 BTRFS_I(inode
)->root
= root
;
5763 memcpy(&BTRFS_I(inode
)->location
, key
, sizeof(*key
));
5764 set_bit(BTRFS_INODE_DUMMY
, &BTRFS_I(inode
)->runtime_flags
);
5766 inode
->i_ino
= BTRFS_EMPTY_SUBVOL_DIR_OBJECTID
;
5767 inode
->i_op
= &btrfs_dir_ro_inode_operations
;
5768 inode
->i_opflags
&= ~IOP_XATTR
;
5769 inode
->i_fop
= &simple_dir_operations
;
5770 inode
->i_mode
= S_IFDIR
| S_IRUGO
| S_IWUSR
| S_IXUGO
;
5771 inode
->i_mtime
= current_time(inode
);
5772 inode
->i_atime
= inode
->i_mtime
;
5773 inode
->i_ctime
= inode
->i_mtime
;
5774 BTRFS_I(inode
)->i_otime
= inode
->i_mtime
;
5779 struct inode
*btrfs_lookup_dentry(struct inode
*dir
, struct dentry
*dentry
)
5781 struct btrfs_fs_info
*fs_info
= btrfs_sb(dir
->i_sb
);
5782 struct inode
*inode
;
5783 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
5784 struct btrfs_root
*sub_root
= root
;
5785 struct btrfs_key location
;
5789 if (dentry
->d_name
.len
> BTRFS_NAME_LEN
)
5790 return ERR_PTR(-ENAMETOOLONG
);
5792 ret
= btrfs_inode_by_name(dir
, dentry
, &location
);
5794 return ERR_PTR(ret
);
5796 if (location
.objectid
== 0)
5797 return ERR_PTR(-ENOENT
);
5799 if (location
.type
== BTRFS_INODE_ITEM_KEY
) {
5800 inode
= btrfs_iget(dir
->i_sb
, &location
, root
, NULL
);
5804 BUG_ON(location
.type
!= BTRFS_ROOT_ITEM_KEY
);
5806 index
= srcu_read_lock(&fs_info
->subvol_srcu
);
5807 ret
= fixup_tree_root_location(fs_info
, dir
, dentry
,
5808 &location
, &sub_root
);
5811 inode
= ERR_PTR(ret
);
5813 inode
= new_simple_dir(dir
->i_sb
, &location
, sub_root
);
5815 inode
= btrfs_iget(dir
->i_sb
, &location
, sub_root
, NULL
);
5817 srcu_read_unlock(&fs_info
->subvol_srcu
, index
);
5819 if (!IS_ERR(inode
) && root
!= sub_root
) {
5820 down_read(&fs_info
->cleanup_work_sem
);
5821 if (!(inode
->i_sb
->s_flags
& MS_RDONLY
))
5822 ret
= btrfs_orphan_cleanup(sub_root
);
5823 up_read(&fs_info
->cleanup_work_sem
);
5826 inode
= ERR_PTR(ret
);
5833 static int btrfs_dentry_delete(const struct dentry
*dentry
)
5835 struct btrfs_root
*root
;
5836 struct inode
*inode
= d_inode(dentry
);
5838 if (!inode
&& !IS_ROOT(dentry
))
5839 inode
= d_inode(dentry
->d_parent
);
5842 root
= BTRFS_I(inode
)->root
;
5843 if (btrfs_root_refs(&root
->root_item
) == 0)
5846 if (btrfs_ino(BTRFS_I(inode
)) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID
)
5852 static void btrfs_dentry_release(struct dentry
*dentry
)
5854 kfree(dentry
->d_fsdata
);
5857 static struct dentry
*btrfs_lookup(struct inode
*dir
, struct dentry
*dentry
,
5860 struct inode
*inode
;
5862 inode
= btrfs_lookup_dentry(dir
, dentry
);
5863 if (IS_ERR(inode
)) {
5864 if (PTR_ERR(inode
) == -ENOENT
)
5867 return ERR_CAST(inode
);
5870 return d_splice_alias(inode
, dentry
);
5873 unsigned char btrfs_filetype_table
[] = {
5874 DT_UNKNOWN
, DT_REG
, DT_DIR
, DT_CHR
, DT_BLK
, DT_FIFO
, DT_SOCK
, DT_LNK
5877 static int btrfs_real_readdir(struct file
*file
, struct dir_context
*ctx
)
5879 struct inode
*inode
= file_inode(file
);
5880 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
5881 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
5882 struct btrfs_dir_item
*di
;
5883 struct btrfs_key key
;
5884 struct btrfs_key found_key
;
5885 struct btrfs_path
*path
;
5886 struct list_head ins_list
;
5887 struct list_head del_list
;
5889 struct extent_buffer
*leaf
;
5891 unsigned char d_type
;
5897 struct btrfs_key location
;
5899 if (!dir_emit_dots(file
, ctx
))
5902 path
= btrfs_alloc_path();
5906 path
->reada
= READA_FORWARD
;
5908 INIT_LIST_HEAD(&ins_list
);
5909 INIT_LIST_HEAD(&del_list
);
5910 put
= btrfs_readdir_get_delayed_items(inode
, &ins_list
, &del_list
);
5912 key
.type
= BTRFS_DIR_INDEX_KEY
;
5913 key
.offset
= ctx
->pos
;
5914 key
.objectid
= btrfs_ino(BTRFS_I(inode
));
5916 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
5921 leaf
= path
->nodes
[0];
5922 slot
= path
->slots
[0];
5923 if (slot
>= btrfs_header_nritems(leaf
)) {
5924 ret
= btrfs_next_leaf(root
, path
);
5932 btrfs_item_key_to_cpu(leaf
, &found_key
, slot
);
5934 if (found_key
.objectid
!= key
.objectid
)
5936 if (found_key
.type
!= BTRFS_DIR_INDEX_KEY
)
5938 if (found_key
.offset
< ctx
->pos
)
5940 if (btrfs_should_delete_dir_index(&del_list
, found_key
.offset
))
5943 ctx
->pos
= found_key
.offset
;
5945 di
= btrfs_item_ptr(leaf
, slot
, struct btrfs_dir_item
);
5946 if (verify_dir_item(fs_info
, leaf
, slot
, di
))
5949 name_len
= btrfs_dir_name_len(leaf
, di
);
5950 if (name_len
<= sizeof(tmp_name
)) {
5951 name_ptr
= tmp_name
;
5953 name_ptr
= kmalloc(name_len
, GFP_KERNEL
);
5959 read_extent_buffer(leaf
, name_ptr
, (unsigned long)(di
+ 1),
5962 d_type
= btrfs_filetype_table
[btrfs_dir_type(leaf
, di
)];
5963 btrfs_dir_item_key_to_cpu(leaf
, di
, &location
);
5965 over
= !dir_emit(ctx
, name_ptr
, name_len
, location
.objectid
,
5968 if (name_ptr
!= tmp_name
)
5978 ret
= btrfs_readdir_delayed_dir_index(ctx
, &ins_list
);
5983 * Stop new entries from being returned after we return the last
5986 * New directory entries are assigned a strictly increasing
5987 * offset. This means that new entries created during readdir
5988 * are *guaranteed* to be seen in the future by that readdir.
5989 * This has broken buggy programs which operate on names as
5990 * they're returned by readdir. Until we re-use freed offsets
5991 * we have this hack to stop new entries from being returned
5992 * under the assumption that they'll never reach this huge
5995 * This is being careful not to overflow 32bit loff_t unless the
5996 * last entry requires it because doing so has broken 32bit apps
5999 if (ctx
->pos
>= INT_MAX
)
6000 ctx
->pos
= LLONG_MAX
;
6007 btrfs_readdir_put_delayed_items(inode
, &ins_list
, &del_list
);
6008 btrfs_free_path(path
);
6012 int btrfs_write_inode(struct inode
*inode
, struct writeback_control
*wbc
)
6014 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
6015 struct btrfs_trans_handle
*trans
;
6017 bool nolock
= false;
6019 if (test_bit(BTRFS_INODE_DUMMY
, &BTRFS_I(inode
)->runtime_flags
))
6022 if (btrfs_fs_closing(root
->fs_info
) &&
6023 btrfs_is_free_space_inode(BTRFS_I(inode
)))
6026 if (wbc
->sync_mode
== WB_SYNC_ALL
) {
6028 trans
= btrfs_join_transaction_nolock(root
);
6030 trans
= btrfs_join_transaction(root
);
6032 return PTR_ERR(trans
);
6033 ret
= btrfs_commit_transaction(trans
);
6039 * This is somewhat expensive, updating the tree every time the
6040 * inode changes. But, it is most likely to find the inode in cache.
6041 * FIXME, needs more benchmarking...there are no reasons other than performance
6042 * to keep or drop this code.
6044 static int btrfs_dirty_inode(struct inode
*inode
)
6046 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
6047 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
6048 struct btrfs_trans_handle
*trans
;
6051 if (test_bit(BTRFS_INODE_DUMMY
, &BTRFS_I(inode
)->runtime_flags
))
6054 trans
= btrfs_join_transaction(root
);
6056 return PTR_ERR(trans
);
6058 ret
= btrfs_update_inode(trans
, root
, inode
);
6059 if (ret
&& ret
== -ENOSPC
) {
6060 /* whoops, lets try again with the full transaction */
6061 btrfs_end_transaction(trans
);
6062 trans
= btrfs_start_transaction(root
, 1);
6064 return PTR_ERR(trans
);
6066 ret
= btrfs_update_inode(trans
, root
, inode
);
6068 btrfs_end_transaction(trans
);
6069 if (BTRFS_I(inode
)->delayed_node
)
6070 btrfs_balance_delayed_items(fs_info
);
6076 * This is a copy of file_update_time. We need this so we can return error on
6077 * ENOSPC for updating the inode in the case of file write and mmap writes.
6079 static int btrfs_update_time(struct inode
*inode
, struct timespec
*now
,
6082 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
6084 if (btrfs_root_readonly(root
))
6087 if (flags
& S_VERSION
)
6088 inode_inc_iversion(inode
);
6089 if (flags
& S_CTIME
)
6090 inode
->i_ctime
= *now
;
6091 if (flags
& S_MTIME
)
6092 inode
->i_mtime
= *now
;
6093 if (flags
& S_ATIME
)
6094 inode
->i_atime
= *now
;
6095 return btrfs_dirty_inode(inode
);
6099 * find the highest existing sequence number in a directory
6100 * and then set the in-memory index_cnt variable to reflect
6101 * free sequence numbers
6103 static int btrfs_set_inode_index_count(struct btrfs_inode
*inode
)
6105 struct btrfs_root
*root
= inode
->root
;
6106 struct btrfs_key key
, found_key
;
6107 struct btrfs_path
*path
;
6108 struct extent_buffer
*leaf
;
6111 key
.objectid
= btrfs_ino(inode
);
6112 key
.type
= BTRFS_DIR_INDEX_KEY
;
6113 key
.offset
= (u64
)-1;
6115 path
= btrfs_alloc_path();
6119 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
6122 /* FIXME: we should be able to handle this */
6128 * MAGIC NUMBER EXPLANATION:
6129 * since we search a directory based on f_pos we have to start at 2
6130 * since '.' and '..' have f_pos of 0 and 1 respectively, so everybody
6131 * else has to start at 2
6133 if (path
->slots
[0] == 0) {
6134 inode
->index_cnt
= 2;
6140 leaf
= path
->nodes
[0];
6141 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
6143 if (found_key
.objectid
!= btrfs_ino(inode
) ||
6144 found_key
.type
!= BTRFS_DIR_INDEX_KEY
) {
6145 inode
->index_cnt
= 2;
6149 inode
->index_cnt
= found_key
.offset
+ 1;
6151 btrfs_free_path(path
);
6156 * helper to find a free sequence number in a given directory. This current
6157 * code is very simple, later versions will do smarter things in the btree
6159 int btrfs_set_inode_index(struct btrfs_inode
*dir
, u64
*index
)
6163 if (dir
->index_cnt
== (u64
)-1) {
6164 ret
= btrfs_inode_delayed_dir_index_count(dir
);
6166 ret
= btrfs_set_inode_index_count(dir
);
6172 *index
= dir
->index_cnt
;
6178 static int btrfs_insert_inode_locked(struct inode
*inode
)
6180 struct btrfs_iget_args args
;
6181 args
.location
= &BTRFS_I(inode
)->location
;
6182 args
.root
= BTRFS_I(inode
)->root
;
6184 return insert_inode_locked4(inode
,
6185 btrfs_inode_hash(inode
->i_ino
, BTRFS_I(inode
)->root
),
6186 btrfs_find_actor
, &args
);
6189 static struct inode
*btrfs_new_inode(struct btrfs_trans_handle
*trans
,
6190 struct btrfs_root
*root
,
6192 const char *name
, int name_len
,
6193 u64 ref_objectid
, u64 objectid
,
6194 umode_t mode
, u64
*index
)
6196 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
6197 struct inode
*inode
;
6198 struct btrfs_inode_item
*inode_item
;
6199 struct btrfs_key
*location
;
6200 struct btrfs_path
*path
;
6201 struct btrfs_inode_ref
*ref
;
6202 struct btrfs_key key
[2];
6204 int nitems
= name
? 2 : 1;
6208 path
= btrfs_alloc_path();
6210 return ERR_PTR(-ENOMEM
);
6212 inode
= new_inode(fs_info
->sb
);
6214 btrfs_free_path(path
);
6215 return ERR_PTR(-ENOMEM
);
6219 * O_TMPFILE, set link count to 0, so that after this point,
6220 * we fill in an inode item with the correct link count.
6223 set_nlink(inode
, 0);
6226 * we have to initialize this early, so we can reclaim the inode
6227 * number if we fail afterwards in this function.
6229 inode
->i_ino
= objectid
;
6232 trace_btrfs_inode_request(dir
);
6234 ret
= btrfs_set_inode_index(BTRFS_I(dir
), index
);
6236 btrfs_free_path(path
);
6238 return ERR_PTR(ret
);
6244 * index_cnt is ignored for everything but a dir,
6245 * btrfs_get_inode_index_count has an explanation for the magic
6248 BTRFS_I(inode
)->index_cnt
= 2;
6249 BTRFS_I(inode
)->dir_index
= *index
;
6250 BTRFS_I(inode
)->root
= root
;
6251 BTRFS_I(inode
)->generation
= trans
->transid
;
6252 inode
->i_generation
= BTRFS_I(inode
)->generation
;
6255 * We could have gotten an inode number from somebody who was fsynced
6256 * and then removed in this same transaction, so let's just set full
6257 * sync since it will be a full sync anyway and this will blow away the
6258 * old info in the log.
6260 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC
, &BTRFS_I(inode
)->runtime_flags
);
6262 key
[0].objectid
= objectid
;
6263 key
[0].type
= BTRFS_INODE_ITEM_KEY
;
6266 sizes
[0] = sizeof(struct btrfs_inode_item
);
6270 * Start new inodes with an inode_ref. This is slightly more
6271 * efficient for small numbers of hard links since they will
6272 * be packed into one item. Extended refs will kick in if we
6273 * add more hard links than can fit in the ref item.
6275 key
[1].objectid
= objectid
;
6276 key
[1].type
= BTRFS_INODE_REF_KEY
;
6277 key
[1].offset
= ref_objectid
;
6279 sizes
[1] = name_len
+ sizeof(*ref
);
6282 location
= &BTRFS_I(inode
)->location
;
6283 location
->objectid
= objectid
;
6284 location
->offset
= 0;
6285 location
->type
= BTRFS_INODE_ITEM_KEY
;
6287 ret
= btrfs_insert_inode_locked(inode
);
6291 path
->leave_spinning
= 1;
6292 ret
= btrfs_insert_empty_items(trans
, root
, path
, key
, sizes
, nitems
);
6296 inode_init_owner(inode
, dir
, mode
);
6297 inode_set_bytes(inode
, 0);
6299 inode
->i_mtime
= current_time(inode
);
6300 inode
->i_atime
= inode
->i_mtime
;
6301 inode
->i_ctime
= inode
->i_mtime
;
6302 BTRFS_I(inode
)->i_otime
= inode
->i_mtime
;
6304 inode_item
= btrfs_item_ptr(path
->nodes
[0], path
->slots
[0],
6305 struct btrfs_inode_item
);
6306 memzero_extent_buffer(path
->nodes
[0], (unsigned long)inode_item
,
6307 sizeof(*inode_item
));
6308 fill_inode_item(trans
, path
->nodes
[0], inode_item
, inode
);
6311 ref
= btrfs_item_ptr(path
->nodes
[0], path
->slots
[0] + 1,
6312 struct btrfs_inode_ref
);
6313 btrfs_set_inode_ref_name_len(path
->nodes
[0], ref
, name_len
);
6314 btrfs_set_inode_ref_index(path
->nodes
[0], ref
, *index
);
6315 ptr
= (unsigned long)(ref
+ 1);
6316 write_extent_buffer(path
->nodes
[0], name
, ptr
, name_len
);
6319 btrfs_mark_buffer_dirty(path
->nodes
[0]);
6320 btrfs_free_path(path
);
6322 btrfs_inherit_iflags(inode
, dir
);
6324 if (S_ISREG(mode
)) {
6325 if (btrfs_test_opt(fs_info
, NODATASUM
))
6326 BTRFS_I(inode
)->flags
|= BTRFS_INODE_NODATASUM
;
6327 if (btrfs_test_opt(fs_info
, NODATACOW
))
6328 BTRFS_I(inode
)->flags
|= BTRFS_INODE_NODATACOW
|
6329 BTRFS_INODE_NODATASUM
;
6332 inode_tree_add(inode
);
6334 trace_btrfs_inode_new(inode
);
6335 btrfs_set_inode_last_trans(trans
, inode
);
6337 btrfs_update_root_times(trans
, root
);
6339 ret
= btrfs_inode_inherit_props(trans
, inode
, dir
);
6342 "error inheriting props for ino %llu (root %llu): %d",
6343 btrfs_ino(BTRFS_I(inode
)), root
->root_key
.objectid
, ret
);
6348 unlock_new_inode(inode
);
6351 BTRFS_I(dir
)->index_cnt
--;
6352 btrfs_free_path(path
);
6354 return ERR_PTR(ret
);
6357 static inline u8
btrfs_inode_type(struct inode
*inode
)
6359 return btrfs_type_by_mode
[(inode
->i_mode
& S_IFMT
) >> S_SHIFT
];
6363 * utility function to add 'inode' into 'parent_inode' with
6364 * a give name and a given sequence number.
6365 * if 'add_backref' is true, also insert a backref from the
6366 * inode to the parent directory.
6368 int btrfs_add_link(struct btrfs_trans_handle
*trans
,
6369 struct btrfs_inode
*parent_inode
, struct btrfs_inode
*inode
,
6370 const char *name
, int name_len
, int add_backref
, u64 index
)
6372 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->vfs_inode
.i_sb
);
6374 struct btrfs_key key
;
6375 struct btrfs_root
*root
= parent_inode
->root
;
6376 u64 ino
= btrfs_ino(inode
);
6377 u64 parent_ino
= btrfs_ino(parent_inode
);
6379 if (unlikely(ino
== BTRFS_FIRST_FREE_OBJECTID
)) {
6380 memcpy(&key
, &inode
->root
->root_key
, sizeof(key
));
6383 key
.type
= BTRFS_INODE_ITEM_KEY
;
6387 if (unlikely(ino
== BTRFS_FIRST_FREE_OBJECTID
)) {
6388 ret
= btrfs_add_root_ref(trans
, fs_info
, key
.objectid
,
6389 root
->root_key
.objectid
, parent_ino
,
6390 index
, name
, name_len
);
6391 } else if (add_backref
) {
6392 ret
= btrfs_insert_inode_ref(trans
, root
, name
, name_len
, ino
,
6396 /* Nothing to clean up yet */
6400 ret
= btrfs_insert_dir_item(trans
, root
, name
, name_len
,
6402 btrfs_inode_type(&inode
->vfs_inode
), index
);
6403 if (ret
== -EEXIST
|| ret
== -EOVERFLOW
)
6406 btrfs_abort_transaction(trans
, ret
);
6410 btrfs_i_size_write(parent_inode
, parent_inode
->vfs_inode
.i_size
+
6412 inode_inc_iversion(&parent_inode
->vfs_inode
);
6413 parent_inode
->vfs_inode
.i_mtime
= parent_inode
->vfs_inode
.i_ctime
=
6414 current_time(&parent_inode
->vfs_inode
);
6415 ret
= btrfs_update_inode(trans
, root
, &parent_inode
->vfs_inode
);
6417 btrfs_abort_transaction(trans
, ret
);
6421 if (unlikely(ino
== BTRFS_FIRST_FREE_OBJECTID
)) {
6424 err
= btrfs_del_root_ref(trans
, fs_info
, key
.objectid
,
6425 root
->root_key
.objectid
, parent_ino
,
6426 &local_index
, name
, name_len
);
6428 } else if (add_backref
) {
6432 err
= btrfs_del_inode_ref(trans
, root
, name
, name_len
,
6433 ino
, parent_ino
, &local_index
);
6438 static int btrfs_add_nondir(struct btrfs_trans_handle
*trans
,
6439 struct btrfs_inode
*dir
, struct dentry
*dentry
,
6440 struct btrfs_inode
*inode
, int backref
, u64 index
)
6442 int err
= btrfs_add_link(trans
, dir
, inode
,
6443 dentry
->d_name
.name
, dentry
->d_name
.len
,
6450 static int btrfs_mknod(struct inode
*dir
, struct dentry
*dentry
,
6451 umode_t mode
, dev_t rdev
)
6453 struct btrfs_fs_info
*fs_info
= btrfs_sb(dir
->i_sb
);
6454 struct btrfs_trans_handle
*trans
;
6455 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
6456 struct inode
*inode
= NULL
;
6463 * 2 for inode item and ref
6465 * 1 for xattr if selinux is on
6467 trans
= btrfs_start_transaction(root
, 5);
6469 return PTR_ERR(trans
);
6471 err
= btrfs_find_free_ino(root
, &objectid
);
6475 inode
= btrfs_new_inode(trans
, root
, dir
, dentry
->d_name
.name
,
6476 dentry
->d_name
.len
, btrfs_ino(BTRFS_I(dir
)), objectid
,
6478 if (IS_ERR(inode
)) {
6479 err
= PTR_ERR(inode
);
6484 * If the active LSM wants to access the inode during
6485 * d_instantiate it needs these. Smack checks to see
6486 * if the filesystem supports xattrs by looking at the
6489 inode
->i_op
= &btrfs_special_inode_operations
;
6490 init_special_inode(inode
, inode
->i_mode
, rdev
);
6492 err
= btrfs_init_inode_security(trans
, inode
, dir
, &dentry
->d_name
);
6494 goto out_unlock_inode
;
6496 err
= btrfs_add_nondir(trans
, BTRFS_I(dir
), dentry
, BTRFS_I(inode
),
6499 goto out_unlock_inode
;
6501 btrfs_update_inode(trans
, root
, inode
);
6502 unlock_new_inode(inode
);
6503 d_instantiate(dentry
, inode
);
6507 btrfs_end_transaction(trans
);
6508 btrfs_balance_delayed_items(fs_info
);
6509 btrfs_btree_balance_dirty(fs_info
);
6511 inode_dec_link_count(inode
);
6518 unlock_new_inode(inode
);
6523 static int btrfs_create(struct inode
*dir
, struct dentry
*dentry
,
6524 umode_t mode
, bool excl
)
6526 struct btrfs_fs_info
*fs_info
= btrfs_sb(dir
->i_sb
);
6527 struct btrfs_trans_handle
*trans
;
6528 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
6529 struct inode
*inode
= NULL
;
6530 int drop_inode_on_err
= 0;
6536 * 2 for inode item and ref
6538 * 1 for xattr if selinux is on
6540 trans
= btrfs_start_transaction(root
, 5);
6542 return PTR_ERR(trans
);
6544 err
= btrfs_find_free_ino(root
, &objectid
);
6548 inode
= btrfs_new_inode(trans
, root
, dir
, dentry
->d_name
.name
,
6549 dentry
->d_name
.len
, btrfs_ino(BTRFS_I(dir
)), objectid
,
6551 if (IS_ERR(inode
)) {
6552 err
= PTR_ERR(inode
);
6555 drop_inode_on_err
= 1;
6557 * If the active LSM wants to access the inode during
6558 * d_instantiate it needs these. Smack checks to see
6559 * if the filesystem supports xattrs by looking at the
6562 inode
->i_fop
= &btrfs_file_operations
;
6563 inode
->i_op
= &btrfs_file_inode_operations
;
6564 inode
->i_mapping
->a_ops
= &btrfs_aops
;
6566 err
= btrfs_init_inode_security(trans
, inode
, dir
, &dentry
->d_name
);
6568 goto out_unlock_inode
;
6570 err
= btrfs_update_inode(trans
, root
, inode
);
6572 goto out_unlock_inode
;
6574 err
= btrfs_add_nondir(trans
, BTRFS_I(dir
), dentry
, BTRFS_I(inode
),
6577 goto out_unlock_inode
;
6579 BTRFS_I(inode
)->io_tree
.ops
= &btrfs_extent_io_ops
;
6580 unlock_new_inode(inode
);
6581 d_instantiate(dentry
, inode
);
6584 btrfs_end_transaction(trans
);
6585 if (err
&& drop_inode_on_err
) {
6586 inode_dec_link_count(inode
);
6589 btrfs_balance_delayed_items(fs_info
);
6590 btrfs_btree_balance_dirty(fs_info
);
6594 unlock_new_inode(inode
);
6599 static int btrfs_link(struct dentry
*old_dentry
, struct inode
*dir
,
6600 struct dentry
*dentry
)
6602 struct btrfs_trans_handle
*trans
= NULL
;
6603 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
6604 struct inode
*inode
= d_inode(old_dentry
);
6605 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
6610 /* do not allow sys_link's with other subvols of the same device */
6611 if (root
->objectid
!= BTRFS_I(inode
)->root
->objectid
)
6614 if (inode
->i_nlink
>= BTRFS_LINK_MAX
)
6617 err
= btrfs_set_inode_index(BTRFS_I(dir
), &index
);
6622 * 2 items for inode and inode ref
6623 * 2 items for dir items
6624 * 1 item for parent inode
6626 trans
= btrfs_start_transaction(root
, 5);
6627 if (IS_ERR(trans
)) {
6628 err
= PTR_ERR(trans
);
6633 /* There are several dir indexes for this inode, clear the cache. */
6634 BTRFS_I(inode
)->dir_index
= 0ULL;
6636 inode_inc_iversion(inode
);
6637 inode
->i_ctime
= current_time(inode
);
6639 set_bit(BTRFS_INODE_COPY_EVERYTHING
, &BTRFS_I(inode
)->runtime_flags
);
6641 err
= btrfs_add_nondir(trans
, BTRFS_I(dir
), dentry
, BTRFS_I(inode
),
6647 struct dentry
*parent
= dentry
->d_parent
;
6648 err
= btrfs_update_inode(trans
, root
, inode
);
6651 if (inode
->i_nlink
== 1) {
6653 * If new hard link count is 1, it's a file created
6654 * with open(2) O_TMPFILE flag.
6656 err
= btrfs_orphan_del(trans
, BTRFS_I(inode
));
6660 d_instantiate(dentry
, inode
);
6661 btrfs_log_new_name(trans
, BTRFS_I(inode
), NULL
, parent
);
6664 btrfs_balance_delayed_items(fs_info
);
6667 btrfs_end_transaction(trans
);
6669 inode_dec_link_count(inode
);
6672 btrfs_btree_balance_dirty(fs_info
);
6676 static int btrfs_mkdir(struct inode
*dir
, struct dentry
*dentry
, umode_t mode
)
6678 struct btrfs_fs_info
*fs_info
= btrfs_sb(dir
->i_sb
);
6679 struct inode
*inode
= NULL
;
6680 struct btrfs_trans_handle
*trans
;
6681 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
6683 int drop_on_err
= 0;
6688 * 2 items for inode and ref
6689 * 2 items for dir items
6690 * 1 for xattr if selinux is on
6692 trans
= btrfs_start_transaction(root
, 5);
6694 return PTR_ERR(trans
);
6696 err
= btrfs_find_free_ino(root
, &objectid
);
6700 inode
= btrfs_new_inode(trans
, root
, dir
, dentry
->d_name
.name
,
6701 dentry
->d_name
.len
, btrfs_ino(BTRFS_I(dir
)), objectid
,
6702 S_IFDIR
| mode
, &index
);
6703 if (IS_ERR(inode
)) {
6704 err
= PTR_ERR(inode
);
6709 /* these must be set before we unlock the inode */
6710 inode
->i_op
= &btrfs_dir_inode_operations
;
6711 inode
->i_fop
= &btrfs_dir_file_operations
;
6713 err
= btrfs_init_inode_security(trans
, inode
, dir
, &dentry
->d_name
);
6715 goto out_fail_inode
;
6717 btrfs_i_size_write(BTRFS_I(inode
), 0);
6718 err
= btrfs_update_inode(trans
, root
, inode
);
6720 goto out_fail_inode
;
6722 err
= btrfs_add_link(trans
, BTRFS_I(dir
), BTRFS_I(inode
),
6723 dentry
->d_name
.name
,
6724 dentry
->d_name
.len
, 0, index
);
6726 goto out_fail_inode
;
6728 d_instantiate(dentry
, inode
);
6730 * mkdir is special. We're unlocking after we call d_instantiate
6731 * to avoid a race with nfsd calling d_instantiate.
6733 unlock_new_inode(inode
);
6737 btrfs_end_transaction(trans
);
6739 inode_dec_link_count(inode
);
6742 btrfs_balance_delayed_items(fs_info
);
6743 btrfs_btree_balance_dirty(fs_info
);
6747 unlock_new_inode(inode
);
6751 /* Find next extent map of a given extent map, caller needs to ensure locks */
6752 static struct extent_map
*next_extent_map(struct extent_map
*em
)
6754 struct rb_node
*next
;
6756 next
= rb_next(&em
->rb_node
);
6759 return container_of(next
, struct extent_map
, rb_node
);
6762 static struct extent_map
*prev_extent_map(struct extent_map
*em
)
6764 struct rb_node
*prev
;
6766 prev
= rb_prev(&em
->rb_node
);
6769 return container_of(prev
, struct extent_map
, rb_node
);
6772 /* helper for btfs_get_extent. Given an existing extent in the tree,
6773 * the existing extent is the nearest extent to map_start,
6774 * and an extent that you want to insert, deal with overlap and insert
6775 * the best fitted new extent into the tree.
6777 static int merge_extent_mapping(struct extent_map_tree
*em_tree
,
6778 struct extent_map
*existing
,
6779 struct extent_map
*em
,
6782 struct extent_map
*prev
;
6783 struct extent_map
*next
;
6788 BUG_ON(map_start
< em
->start
|| map_start
>= extent_map_end(em
));
6790 if (existing
->start
> map_start
) {
6792 prev
= prev_extent_map(next
);
6795 next
= next_extent_map(prev
);
6798 start
= prev
? extent_map_end(prev
) : em
->start
;
6799 start
= max_t(u64
, start
, em
->start
);
6800 end
= next
? next
->start
: extent_map_end(em
);
6801 end
= min_t(u64
, end
, extent_map_end(em
));
6802 start_diff
= start
- em
->start
;
6804 em
->len
= end
- start
;
6805 if (em
->block_start
< EXTENT_MAP_LAST_BYTE
&&
6806 !test_bit(EXTENT_FLAG_COMPRESSED
, &em
->flags
)) {
6807 em
->block_start
+= start_diff
;
6808 em
->block_len
-= start_diff
;
6810 return add_extent_mapping(em_tree
, em
, 0);
6813 static noinline
int uncompress_inline(struct btrfs_path
*path
,
6815 size_t pg_offset
, u64 extent_offset
,
6816 struct btrfs_file_extent_item
*item
)
6819 struct extent_buffer
*leaf
= path
->nodes
[0];
6822 unsigned long inline_size
;
6826 WARN_ON(pg_offset
!= 0);
6827 compress_type
= btrfs_file_extent_compression(leaf
, item
);
6828 max_size
= btrfs_file_extent_ram_bytes(leaf
, item
);
6829 inline_size
= btrfs_file_extent_inline_item_len(leaf
,
6830 btrfs_item_nr(path
->slots
[0]));
6831 tmp
= kmalloc(inline_size
, GFP_NOFS
);
6834 ptr
= btrfs_file_extent_inline_start(item
);
6836 read_extent_buffer(leaf
, tmp
, ptr
, inline_size
);
6838 max_size
= min_t(unsigned long, PAGE_SIZE
, max_size
);
6839 ret
= btrfs_decompress(compress_type
, tmp
, page
,
6840 extent_offset
, inline_size
, max_size
);
6843 * decompression code contains a memset to fill in any space between the end
6844 * of the uncompressed data and the end of max_size in case the decompressed
6845 * data ends up shorter than ram_bytes. That doesn't cover the hole between
6846 * the end of an inline extent and the beginning of the next block, so we
6847 * cover that region here.
6850 if (max_size
+ pg_offset
< PAGE_SIZE
) {
6851 char *map
= kmap(page
);
6852 memset(map
+ pg_offset
+ max_size
, 0, PAGE_SIZE
- max_size
- pg_offset
);
6860 * a bit scary, this does extent mapping from logical file offset to the disk.
6861 * the ugly parts come from merging extents from the disk with the in-ram
6862 * representation. This gets more complex because of the data=ordered code,
6863 * where the in-ram extents might be locked pending data=ordered completion.
6865 * This also copies inline extents directly into the page.
6867 struct extent_map
*btrfs_get_extent(struct btrfs_inode
*inode
,
6869 size_t pg_offset
, u64 start
, u64 len
,
6872 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->vfs_inode
.i_sb
);
6875 u64 extent_start
= 0;
6877 u64 objectid
= btrfs_ino(inode
);
6879 struct btrfs_path
*path
= NULL
;
6880 struct btrfs_root
*root
= inode
->root
;
6881 struct btrfs_file_extent_item
*item
;
6882 struct extent_buffer
*leaf
;
6883 struct btrfs_key found_key
;
6884 struct extent_map
*em
= NULL
;
6885 struct extent_map_tree
*em_tree
= &inode
->extent_tree
;
6886 struct extent_io_tree
*io_tree
= &inode
->io_tree
;
6887 struct btrfs_trans_handle
*trans
= NULL
;
6888 const bool new_inline
= !page
|| create
;
6891 read_lock(&em_tree
->lock
);
6892 em
= lookup_extent_mapping(em_tree
, start
, len
);
6894 em
->bdev
= fs_info
->fs_devices
->latest_bdev
;
6895 read_unlock(&em_tree
->lock
);
6898 if (em
->start
> start
|| em
->start
+ em
->len
<= start
)
6899 free_extent_map(em
);
6900 else if (em
->block_start
== EXTENT_MAP_INLINE
&& page
)
6901 free_extent_map(em
);
6905 em
= alloc_extent_map();
6910 em
->bdev
= fs_info
->fs_devices
->latest_bdev
;
6911 em
->start
= EXTENT_MAP_HOLE
;
6912 em
->orig_start
= EXTENT_MAP_HOLE
;
6914 em
->block_len
= (u64
)-1;
6917 path
= btrfs_alloc_path();
6923 * Chances are we'll be called again, so go ahead and do
6926 path
->reada
= READA_FORWARD
;
6929 ret
= btrfs_lookup_file_extent(trans
, root
, path
,
6930 objectid
, start
, trans
!= NULL
);
6937 if (path
->slots
[0] == 0)
6942 leaf
= path
->nodes
[0];
6943 item
= btrfs_item_ptr(leaf
, path
->slots
[0],
6944 struct btrfs_file_extent_item
);
6945 /* are we inside the extent that was found? */
6946 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
6947 found_type
= found_key
.type
;
6948 if (found_key
.objectid
!= objectid
||
6949 found_type
!= BTRFS_EXTENT_DATA_KEY
) {
6951 * If we backup past the first extent we want to move forward
6952 * and see if there is an extent in front of us, otherwise we'll
6953 * say there is a hole for our whole search range which can
6960 found_type
= btrfs_file_extent_type(leaf
, item
);
6961 extent_start
= found_key
.offset
;
6962 if (found_type
== BTRFS_FILE_EXTENT_REG
||
6963 found_type
== BTRFS_FILE_EXTENT_PREALLOC
) {
6964 extent_end
= extent_start
+
6965 btrfs_file_extent_num_bytes(leaf
, item
);
6967 trace_btrfs_get_extent_show_fi_regular(inode
, leaf
, item
,
6969 } else if (found_type
== BTRFS_FILE_EXTENT_INLINE
) {
6971 size
= btrfs_file_extent_inline_len(leaf
, path
->slots
[0], item
);
6972 extent_end
= ALIGN(extent_start
+ size
,
6973 fs_info
->sectorsize
);
6975 trace_btrfs_get_extent_show_fi_inline(inode
, leaf
, item
,
6980 if (start
>= extent_end
) {
6982 if (path
->slots
[0] >= btrfs_header_nritems(leaf
)) {
6983 ret
= btrfs_next_leaf(root
, path
);
6990 leaf
= path
->nodes
[0];
6992 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
6993 if (found_key
.objectid
!= objectid
||
6994 found_key
.type
!= BTRFS_EXTENT_DATA_KEY
)
6996 if (start
+ len
<= found_key
.offset
)
6998 if (start
> found_key
.offset
)
7001 em
->orig_start
= start
;
7002 em
->len
= found_key
.offset
- start
;
7006 btrfs_extent_item_to_extent_map(inode
, path
, item
,
7009 if (found_type
== BTRFS_FILE_EXTENT_REG
||
7010 found_type
== BTRFS_FILE_EXTENT_PREALLOC
) {
7012 } else if (found_type
== BTRFS_FILE_EXTENT_INLINE
) {
7016 size_t extent_offset
;
7022 size
= btrfs_file_extent_inline_len(leaf
, path
->slots
[0], item
);
7023 extent_offset
= page_offset(page
) + pg_offset
- extent_start
;
7024 copy_size
= min_t(u64
, PAGE_SIZE
- pg_offset
,
7025 size
- extent_offset
);
7026 em
->start
= extent_start
+ extent_offset
;
7027 em
->len
= ALIGN(copy_size
, fs_info
->sectorsize
);
7028 em
->orig_block_len
= em
->len
;
7029 em
->orig_start
= em
->start
;
7030 ptr
= btrfs_file_extent_inline_start(item
) + extent_offset
;
7031 if (create
== 0 && !PageUptodate(page
)) {
7032 if (btrfs_file_extent_compression(leaf
, item
) !=
7033 BTRFS_COMPRESS_NONE
) {
7034 ret
= uncompress_inline(path
, page
, pg_offset
,
7035 extent_offset
, item
);
7042 read_extent_buffer(leaf
, map
+ pg_offset
, ptr
,
7044 if (pg_offset
+ copy_size
< PAGE_SIZE
) {
7045 memset(map
+ pg_offset
+ copy_size
, 0,
7046 PAGE_SIZE
- pg_offset
-
7051 flush_dcache_page(page
);
7052 } else if (create
&& PageUptodate(page
)) {
7056 free_extent_map(em
);
7059 btrfs_release_path(path
);
7060 trans
= btrfs_join_transaction(root
);
7063 return ERR_CAST(trans
);
7067 write_extent_buffer(leaf
, map
+ pg_offset
, ptr
,
7070 btrfs_mark_buffer_dirty(leaf
);
7072 set_extent_uptodate(io_tree
, em
->start
,
7073 extent_map_end(em
) - 1, NULL
, GFP_NOFS
);
7078 em
->orig_start
= start
;
7081 em
->block_start
= EXTENT_MAP_HOLE
;
7082 set_bit(EXTENT_FLAG_VACANCY
, &em
->flags
);
7084 btrfs_release_path(path
);
7085 if (em
->start
> start
|| extent_map_end(em
) <= start
) {
7087 "bad extent! em: [%llu %llu] passed [%llu %llu]",
7088 em
->start
, em
->len
, start
, len
);
7094 write_lock(&em_tree
->lock
);
7095 ret
= add_extent_mapping(em_tree
, em
, 0);
7096 /* it is possible that someone inserted the extent into the tree
7097 * while we had the lock dropped. It is also possible that
7098 * an overlapping map exists in the tree
7100 if (ret
== -EEXIST
) {
7101 struct extent_map
*existing
;
7105 existing
= search_extent_mapping(em_tree
, start
, len
);
7107 * existing will always be non-NULL, since there must be
7108 * extent causing the -EEXIST.
7110 if (existing
->start
== em
->start
&&
7111 extent_map_end(existing
) >= extent_map_end(em
) &&
7112 em
->block_start
== existing
->block_start
) {
7114 * The existing extent map already encompasses the
7115 * entire extent map we tried to add.
7117 free_extent_map(em
);
7121 } else if (start
>= extent_map_end(existing
) ||
7122 start
<= existing
->start
) {
7124 * The existing extent map is the one nearest to
7125 * the [start, start + len) range which overlaps
7127 err
= merge_extent_mapping(em_tree
, existing
,
7129 free_extent_map(existing
);
7131 free_extent_map(em
);
7135 free_extent_map(em
);
7140 write_unlock(&em_tree
->lock
);
7143 trace_btrfs_get_extent(root
, inode
, em
);
7145 btrfs_free_path(path
);
7147 ret
= btrfs_end_transaction(trans
);
7152 free_extent_map(em
);
7153 return ERR_PTR(err
);
7155 BUG_ON(!em
); /* Error is always set */
7159 struct extent_map
*btrfs_get_extent_fiemap(struct btrfs_inode
*inode
,
7161 size_t pg_offset
, u64 start
, u64 len
,
7164 struct extent_map
*em
;
7165 struct extent_map
*hole_em
= NULL
;
7166 u64 range_start
= start
;
7172 em
= btrfs_get_extent(inode
, page
, pg_offset
, start
, len
, create
);
7176 * If our em maps to:
7178 * - a pre-alloc extent,
7179 * there might actually be delalloc bytes behind it.
7181 if (em
->block_start
!= EXTENT_MAP_HOLE
&&
7182 !test_bit(EXTENT_FLAG_PREALLOC
, &em
->flags
))
7187 /* check to see if we've wrapped (len == -1 or similar) */
7196 /* ok, we didn't find anything, lets look for delalloc */
7197 found
= count_range_bits(&inode
->io_tree
, &range_start
,
7198 end
, len
, EXTENT_DELALLOC
, 1);
7199 found_end
= range_start
+ found
;
7200 if (found_end
< range_start
)
7201 found_end
= (u64
)-1;
7204 * we didn't find anything useful, return
7205 * the original results from get_extent()
7207 if (range_start
> end
|| found_end
<= start
) {
7213 /* adjust the range_start to make sure it doesn't
7214 * go backwards from the start they passed in
7216 range_start
= max(start
, range_start
);
7217 found
= found_end
- range_start
;
7220 u64 hole_start
= start
;
7223 em
= alloc_extent_map();
7229 * when btrfs_get_extent can't find anything it
7230 * returns one huge hole
7232 * make sure what it found really fits our range, and
7233 * adjust to make sure it is based on the start from
7237 u64 calc_end
= extent_map_end(hole_em
);
7239 if (calc_end
<= start
|| (hole_em
->start
> end
)) {
7240 free_extent_map(hole_em
);
7243 hole_start
= max(hole_em
->start
, start
);
7244 hole_len
= calc_end
- hole_start
;
7248 if (hole_em
&& range_start
> hole_start
) {
7249 /* our hole starts before our delalloc, so we
7250 * have to return just the parts of the hole
7251 * that go until the delalloc starts
7253 em
->len
= min(hole_len
,
7254 range_start
- hole_start
);
7255 em
->start
= hole_start
;
7256 em
->orig_start
= hole_start
;
7258 * don't adjust block start at all,
7259 * it is fixed at EXTENT_MAP_HOLE
7261 em
->block_start
= hole_em
->block_start
;
7262 em
->block_len
= hole_len
;
7263 if (test_bit(EXTENT_FLAG_PREALLOC
, &hole_em
->flags
))
7264 set_bit(EXTENT_FLAG_PREALLOC
, &em
->flags
);
7266 em
->start
= range_start
;
7268 em
->orig_start
= range_start
;
7269 em
->block_start
= EXTENT_MAP_DELALLOC
;
7270 em
->block_len
= found
;
7272 } else if (hole_em
) {
7277 free_extent_map(hole_em
);
7279 free_extent_map(em
);
7280 return ERR_PTR(err
);
7285 static struct extent_map
*btrfs_create_dio_extent(struct inode
*inode
,
7288 const u64 orig_start
,
7289 const u64 block_start
,
7290 const u64 block_len
,
7291 const u64 orig_block_len
,
7292 const u64 ram_bytes
,
7295 struct extent_map
*em
= NULL
;
7298 if (type
!= BTRFS_ORDERED_NOCOW
) {
7299 em
= create_io_em(inode
, start
, len
, orig_start
,
7300 block_start
, block_len
, orig_block_len
,
7302 BTRFS_COMPRESS_NONE
, /* compress_type */
7307 ret
= btrfs_add_ordered_extent_dio(inode
, start
, block_start
,
7308 len
, block_len
, type
);
7311 free_extent_map(em
);
7312 btrfs_drop_extent_cache(BTRFS_I(inode
), start
,
7313 start
+ len
- 1, 0);
7322 static struct extent_map
*btrfs_new_extent_direct(struct inode
*inode
,
7325 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
7326 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
7327 struct extent_map
*em
;
7328 struct btrfs_key ins
;
7332 alloc_hint
= get_extent_allocation_hint(inode
, start
, len
);
7333 ret
= btrfs_reserve_extent(root
, len
, len
, fs_info
->sectorsize
,
7334 0, alloc_hint
, &ins
, 1, 1);
7336 return ERR_PTR(ret
);
7338 em
= btrfs_create_dio_extent(inode
, start
, ins
.offset
, start
,
7339 ins
.objectid
, ins
.offset
, ins
.offset
,
7340 ins
.offset
, BTRFS_ORDERED_REGULAR
);
7341 btrfs_dec_block_group_reservations(fs_info
, ins
.objectid
);
7343 btrfs_free_reserved_extent(fs_info
, ins
.objectid
,
7350 * returns 1 when the nocow is safe, < 1 on error, 0 if the
7351 * block must be cow'd
7353 noinline
int can_nocow_extent(struct inode
*inode
, u64 offset
, u64
*len
,
7354 u64
*orig_start
, u64
*orig_block_len
,
7357 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
7358 struct btrfs_path
*path
;
7360 struct extent_buffer
*leaf
;
7361 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
7362 struct extent_io_tree
*io_tree
= &BTRFS_I(inode
)->io_tree
;
7363 struct btrfs_file_extent_item
*fi
;
7364 struct btrfs_key key
;
7371 bool nocow
= (BTRFS_I(inode
)->flags
& BTRFS_INODE_NODATACOW
);
7373 path
= btrfs_alloc_path();
7377 ret
= btrfs_lookup_file_extent(NULL
, root
, path
,
7378 btrfs_ino(BTRFS_I(inode
)), offset
, 0);
7382 slot
= path
->slots
[0];
7385 /* can't find the item, must cow */
7392 leaf
= path
->nodes
[0];
7393 btrfs_item_key_to_cpu(leaf
, &key
, slot
);
7394 if (key
.objectid
!= btrfs_ino(BTRFS_I(inode
)) ||
7395 key
.type
!= BTRFS_EXTENT_DATA_KEY
) {
7396 /* not our file or wrong item type, must cow */
7400 if (key
.offset
> offset
) {
7401 /* Wrong offset, must cow */
7405 fi
= btrfs_item_ptr(leaf
, slot
, struct btrfs_file_extent_item
);
7406 found_type
= btrfs_file_extent_type(leaf
, fi
);
7407 if (found_type
!= BTRFS_FILE_EXTENT_REG
&&
7408 found_type
!= BTRFS_FILE_EXTENT_PREALLOC
) {
7409 /* not a regular extent, must cow */
7413 if (!nocow
&& found_type
== BTRFS_FILE_EXTENT_REG
)
7416 extent_end
= key
.offset
+ btrfs_file_extent_num_bytes(leaf
, fi
);
7417 if (extent_end
<= offset
)
7420 disk_bytenr
= btrfs_file_extent_disk_bytenr(leaf
, fi
);
7421 if (disk_bytenr
== 0)
7424 if (btrfs_file_extent_compression(leaf
, fi
) ||
7425 btrfs_file_extent_encryption(leaf
, fi
) ||
7426 btrfs_file_extent_other_encoding(leaf
, fi
))
7429 backref_offset
= btrfs_file_extent_offset(leaf
, fi
);
7432 *orig_start
= key
.offset
- backref_offset
;
7433 *orig_block_len
= btrfs_file_extent_disk_num_bytes(leaf
, fi
);
7434 *ram_bytes
= btrfs_file_extent_ram_bytes(leaf
, fi
);
7437 if (btrfs_extent_readonly(fs_info
, disk_bytenr
))
7440 num_bytes
= min(offset
+ *len
, extent_end
) - offset
;
7441 if (!nocow
&& found_type
== BTRFS_FILE_EXTENT_PREALLOC
) {
7444 range_end
= round_up(offset
+ num_bytes
,
7445 root
->fs_info
->sectorsize
) - 1;
7446 ret
= test_range_bit(io_tree
, offset
, range_end
,
7447 EXTENT_DELALLOC
, 0, NULL
);
7454 btrfs_release_path(path
);
7457 * look for other files referencing this extent, if we
7458 * find any we must cow
7461 ret
= btrfs_cross_ref_exist(root
, btrfs_ino(BTRFS_I(inode
)),
7462 key
.offset
- backref_offset
, disk_bytenr
);
7469 * adjust disk_bytenr and num_bytes to cover just the bytes
7470 * in this extent we are about to write. If there
7471 * are any csums in that range we have to cow in order
7472 * to keep the csums correct
7474 disk_bytenr
+= backref_offset
;
7475 disk_bytenr
+= offset
- key
.offset
;
7476 if (csum_exist_in_range(fs_info
, disk_bytenr
, num_bytes
))
7479 * all of the above have passed, it is safe to overwrite this extent
7485 btrfs_free_path(path
);
7489 bool btrfs_page_exists_in_range(struct inode
*inode
, loff_t start
, loff_t end
)
7491 struct radix_tree_root
*root
= &inode
->i_mapping
->page_tree
;
7493 void **pagep
= NULL
;
7494 struct page
*page
= NULL
;
7495 unsigned long start_idx
;
7496 unsigned long end_idx
;
7498 start_idx
= start
>> PAGE_SHIFT
;
7501 * end is the last byte in the last page. end == start is legal
7503 end_idx
= end
>> PAGE_SHIFT
;
7507 /* Most of the code in this while loop is lifted from
7508 * find_get_page. It's been modified to begin searching from a
7509 * page and return just the first page found in that range. If the
7510 * found idx is less than or equal to the end idx then we know that
7511 * a page exists. If no pages are found or if those pages are
7512 * outside of the range then we're fine (yay!) */
7513 while (page
== NULL
&&
7514 radix_tree_gang_lookup_slot(root
, &pagep
, NULL
, start_idx
, 1)) {
7515 page
= radix_tree_deref_slot(pagep
);
7516 if (unlikely(!page
))
7519 if (radix_tree_exception(page
)) {
7520 if (radix_tree_deref_retry(page
)) {
7525 * Otherwise, shmem/tmpfs must be storing a swap entry
7526 * here as an exceptional entry: so return it without
7527 * attempting to raise page count.
7530 break; /* TODO: Is this relevant for this use case? */
7533 if (!page_cache_get_speculative(page
)) {
7539 * Has the page moved?
7540 * This is part of the lockless pagecache protocol. See
7541 * include/linux/pagemap.h for details.
7543 if (unlikely(page
!= *pagep
)) {
7550 if (page
->index
<= end_idx
)
7559 static int lock_extent_direct(struct inode
*inode
, u64 lockstart
, u64 lockend
,
7560 struct extent_state
**cached_state
, int writing
)
7562 struct btrfs_ordered_extent
*ordered
;
7566 lock_extent_bits(&BTRFS_I(inode
)->io_tree
, lockstart
, lockend
,
7569 * We're concerned with the entire range that we're going to be
7570 * doing DIO to, so we need to make sure there's no ordered
7571 * extents in this range.
7573 ordered
= btrfs_lookup_ordered_range(BTRFS_I(inode
), lockstart
,
7574 lockend
- lockstart
+ 1);
7577 * We need to make sure there are no buffered pages in this
7578 * range either, we could have raced between the invalidate in
7579 * generic_file_direct_write and locking the extent. The
7580 * invalidate needs to happen so that reads after a write do not
7585 !btrfs_page_exists_in_range(inode
, lockstart
, lockend
)))
7588 unlock_extent_cached(&BTRFS_I(inode
)->io_tree
, lockstart
, lockend
,
7589 cached_state
, GFP_NOFS
);
7593 * If we are doing a DIO read and the ordered extent we
7594 * found is for a buffered write, we can not wait for it
7595 * to complete and retry, because if we do so we can
7596 * deadlock with concurrent buffered writes on page
7597 * locks. This happens only if our DIO read covers more
7598 * than one extent map, if at this point has already
7599 * created an ordered extent for a previous extent map
7600 * and locked its range in the inode's io tree, and a
7601 * concurrent write against that previous extent map's
7602 * range and this range started (we unlock the ranges
7603 * in the io tree only when the bios complete and
7604 * buffered writes always lock pages before attempting
7605 * to lock range in the io tree).
7608 test_bit(BTRFS_ORDERED_DIRECT
, &ordered
->flags
))
7609 btrfs_start_ordered_extent(inode
, ordered
, 1);
7612 btrfs_put_ordered_extent(ordered
);
7615 * We could trigger writeback for this range (and wait
7616 * for it to complete) and then invalidate the pages for
7617 * this range (through invalidate_inode_pages2_range()),
7618 * but that can lead us to a deadlock with a concurrent
7619 * call to readpages() (a buffered read or a defrag call
7620 * triggered a readahead) on a page lock due to an
7621 * ordered dio extent we created before but did not have
7622 * yet a corresponding bio submitted (whence it can not
7623 * complete), which makes readpages() wait for that
7624 * ordered extent to complete while holding a lock on
7639 /* The callers of this must take lock_extent() */
7640 static struct extent_map
*create_io_em(struct inode
*inode
, u64 start
, u64 len
,
7641 u64 orig_start
, u64 block_start
,
7642 u64 block_len
, u64 orig_block_len
,
7643 u64 ram_bytes
, int compress_type
,
7646 struct extent_map_tree
*em_tree
;
7647 struct extent_map
*em
;
7648 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
7651 ASSERT(type
== BTRFS_ORDERED_PREALLOC
||
7652 type
== BTRFS_ORDERED_COMPRESSED
||
7653 type
== BTRFS_ORDERED_NOCOW
||
7654 type
== BTRFS_ORDERED_REGULAR
);
7656 em_tree
= &BTRFS_I(inode
)->extent_tree
;
7657 em
= alloc_extent_map();
7659 return ERR_PTR(-ENOMEM
);
7662 em
->orig_start
= orig_start
;
7664 em
->block_len
= block_len
;
7665 em
->block_start
= block_start
;
7666 em
->bdev
= root
->fs_info
->fs_devices
->latest_bdev
;
7667 em
->orig_block_len
= orig_block_len
;
7668 em
->ram_bytes
= ram_bytes
;
7669 em
->generation
= -1;
7670 set_bit(EXTENT_FLAG_PINNED
, &em
->flags
);
7671 if (type
== BTRFS_ORDERED_PREALLOC
) {
7672 set_bit(EXTENT_FLAG_FILLING
, &em
->flags
);
7673 } else if (type
== BTRFS_ORDERED_COMPRESSED
) {
7674 set_bit(EXTENT_FLAG_COMPRESSED
, &em
->flags
);
7675 em
->compress_type
= compress_type
;
7679 btrfs_drop_extent_cache(BTRFS_I(inode
), em
->start
,
7680 em
->start
+ em
->len
- 1, 0);
7681 write_lock(&em_tree
->lock
);
7682 ret
= add_extent_mapping(em_tree
, em
, 1);
7683 write_unlock(&em_tree
->lock
);
7685 * The caller has taken lock_extent(), who could race with us
7688 } while (ret
== -EEXIST
);
7691 free_extent_map(em
);
7692 return ERR_PTR(ret
);
7695 /* em got 2 refs now, callers needs to do free_extent_map once. */
7699 static void adjust_dio_outstanding_extents(struct inode
*inode
,
7700 struct btrfs_dio_data
*dio_data
,
7703 unsigned num_extents
= count_max_extents(len
);
7706 * If we have an outstanding_extents count still set then we're
7707 * within our reservation, otherwise we need to adjust our inode
7708 * counter appropriately.
7710 if (dio_data
->outstanding_extents
>= num_extents
) {
7711 dio_data
->outstanding_extents
-= num_extents
;
7714 * If dio write length has been split due to no large enough
7715 * contiguous space, we need to compensate our inode counter
7718 u64 num_needed
= num_extents
- dio_data
->outstanding_extents
;
7720 spin_lock(&BTRFS_I(inode
)->lock
);
7721 BTRFS_I(inode
)->outstanding_extents
+= num_needed
;
7722 spin_unlock(&BTRFS_I(inode
)->lock
);
7726 static int btrfs_get_blocks_direct(struct inode
*inode
, sector_t iblock
,
7727 struct buffer_head
*bh_result
, int create
)
7729 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
7730 struct extent_map
*em
;
7731 struct extent_state
*cached_state
= NULL
;
7732 struct btrfs_dio_data
*dio_data
= NULL
;
7733 u64 start
= iblock
<< inode
->i_blkbits
;
7734 u64 lockstart
, lockend
;
7735 u64 len
= bh_result
->b_size
;
7736 int unlock_bits
= EXTENT_LOCKED
;
7740 unlock_bits
|= EXTENT_DIRTY
;
7742 len
= min_t(u64
, len
, fs_info
->sectorsize
);
7745 lockend
= start
+ len
- 1;
7747 if (current
->journal_info
) {
7749 * Need to pull our outstanding extents and set journal_info to NULL so
7750 * that anything that needs to check if there's a transaction doesn't get
7753 dio_data
= current
->journal_info
;
7754 current
->journal_info
= NULL
;
7758 * If this errors out it's because we couldn't invalidate pagecache for
7759 * this range and we need to fallback to buffered.
7761 if (lock_extent_direct(inode
, lockstart
, lockend
, &cached_state
,
7767 em
= btrfs_get_extent(BTRFS_I(inode
), NULL
, 0, start
, len
, 0);
7774 * Ok for INLINE and COMPRESSED extents we need to fallback on buffered
7775 * io. INLINE is special, and we could probably kludge it in here, but
7776 * it's still buffered so for safety lets just fall back to the generic
7779 * For COMPRESSED we _have_ to read the entire extent in so we can
7780 * decompress it, so there will be buffering required no matter what we
7781 * do, so go ahead and fallback to buffered.
7783 * We return -ENOTBLK because that's what makes DIO go ahead and go back
7784 * to buffered IO. Don't blame me, this is the price we pay for using
7787 if (test_bit(EXTENT_FLAG_COMPRESSED
, &em
->flags
) ||
7788 em
->block_start
== EXTENT_MAP_INLINE
) {
7789 free_extent_map(em
);
7794 /* Just a good old fashioned hole, return */
7795 if (!create
&& (em
->block_start
== EXTENT_MAP_HOLE
||
7796 test_bit(EXTENT_FLAG_PREALLOC
, &em
->flags
))) {
7797 free_extent_map(em
);
7802 * We don't allocate a new extent in the following cases
7804 * 1) The inode is marked as NODATACOW. In this case we'll just use the
7806 * 2) The extent is marked as PREALLOC. We're good to go here and can
7807 * just use the extent.
7811 len
= min(len
, em
->len
- (start
- em
->start
));
7812 lockstart
= start
+ len
;
7816 if (test_bit(EXTENT_FLAG_PREALLOC
, &em
->flags
) ||
7817 ((BTRFS_I(inode
)->flags
& BTRFS_INODE_NODATACOW
) &&
7818 em
->block_start
!= EXTENT_MAP_HOLE
)) {
7820 u64 block_start
, orig_start
, orig_block_len
, ram_bytes
;
7822 if (test_bit(EXTENT_FLAG_PREALLOC
, &em
->flags
))
7823 type
= BTRFS_ORDERED_PREALLOC
;
7825 type
= BTRFS_ORDERED_NOCOW
;
7826 len
= min(len
, em
->len
- (start
- em
->start
));
7827 block_start
= em
->block_start
+ (start
- em
->start
);
7829 if (can_nocow_extent(inode
, start
, &len
, &orig_start
,
7830 &orig_block_len
, &ram_bytes
) == 1 &&
7831 btrfs_inc_nocow_writers(fs_info
, block_start
)) {
7832 struct extent_map
*em2
;
7834 em2
= btrfs_create_dio_extent(inode
, start
, len
,
7835 orig_start
, block_start
,
7836 len
, orig_block_len
,
7838 btrfs_dec_nocow_writers(fs_info
, block_start
);
7839 if (type
== BTRFS_ORDERED_PREALLOC
) {
7840 free_extent_map(em
);
7843 if (em2
&& IS_ERR(em2
)) {
7848 * For inode marked NODATACOW or extent marked PREALLOC,
7849 * use the existing or preallocated extent, so does not
7850 * need to adjust btrfs_space_info's bytes_may_use.
7852 btrfs_free_reserved_data_space_noquota(inode
,
7859 * this will cow the extent, reset the len in case we changed
7862 len
= bh_result
->b_size
;
7863 free_extent_map(em
);
7864 em
= btrfs_new_extent_direct(inode
, start
, len
);
7869 len
= min(len
, em
->len
- (start
- em
->start
));
7871 bh_result
->b_blocknr
= (em
->block_start
+ (start
- em
->start
)) >>
7873 bh_result
->b_size
= len
;
7874 bh_result
->b_bdev
= em
->bdev
;
7875 set_buffer_mapped(bh_result
);
7877 if (!test_bit(EXTENT_FLAG_PREALLOC
, &em
->flags
))
7878 set_buffer_new(bh_result
);
7881 * Need to update the i_size under the extent lock so buffered
7882 * readers will get the updated i_size when we unlock.
7884 if (!dio_data
->overwrite
&& start
+ len
> i_size_read(inode
))
7885 i_size_write(inode
, start
+ len
);
7887 adjust_dio_outstanding_extents(inode
, dio_data
, len
);
7888 WARN_ON(dio_data
->reserve
< len
);
7889 dio_data
->reserve
-= len
;
7890 dio_data
->unsubmitted_oe_range_end
= start
+ len
;
7891 current
->journal_info
= dio_data
;
7895 * In the case of write we need to clear and unlock the entire range,
7896 * in the case of read we need to unlock only the end area that we
7897 * aren't using if there is any left over space.
7899 if (lockstart
< lockend
) {
7900 clear_extent_bit(&BTRFS_I(inode
)->io_tree
, lockstart
,
7901 lockend
, unlock_bits
, 1, 0,
7902 &cached_state
, GFP_NOFS
);
7904 free_extent_state(cached_state
);
7907 free_extent_map(em
);
7912 clear_extent_bit(&BTRFS_I(inode
)->io_tree
, lockstart
, lockend
,
7913 unlock_bits
, 1, 0, &cached_state
, GFP_NOFS
);
7916 current
->journal_info
= dio_data
;
7918 * Compensate the delalloc release we do in btrfs_direct_IO() when we
7919 * write less data then expected, so that we don't underflow our inode's
7920 * outstanding extents counter.
7922 if (create
&& dio_data
)
7923 adjust_dio_outstanding_extents(inode
, dio_data
, len
);
7928 static inline int submit_dio_repair_bio(struct inode
*inode
, struct bio
*bio
,
7931 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
7934 BUG_ON(bio_op(bio
) == REQ_OP_WRITE
);
7938 ret
= btrfs_bio_wq_end_io(fs_info
, bio
, BTRFS_WQ_ENDIO_DIO_REPAIR
);
7942 ret
= btrfs_map_bio(fs_info
, bio
, mirror_num
, 0);
7948 static int btrfs_check_dio_repairable(struct inode
*inode
,
7949 struct bio
*failed_bio
,
7950 struct io_failure_record
*failrec
,
7953 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
7956 num_copies
= btrfs_num_copies(fs_info
, failrec
->logical
, failrec
->len
);
7957 if (num_copies
== 1) {
7959 * we only have a single copy of the data, so don't bother with
7960 * all the retry and error correction code that follows. no
7961 * matter what the error is, it is very likely to persist.
7963 btrfs_debug(fs_info
,
7964 "Check DIO Repairable: cannot repair, num_copies=%d, next_mirror %d, failed_mirror %d",
7965 num_copies
, failrec
->this_mirror
, failed_mirror
);
7969 failrec
->failed_mirror
= failed_mirror
;
7970 failrec
->this_mirror
++;
7971 if (failrec
->this_mirror
== failed_mirror
)
7972 failrec
->this_mirror
++;
7974 if (failrec
->this_mirror
> num_copies
) {
7975 btrfs_debug(fs_info
,
7976 "Check DIO Repairable: (fail) num_copies=%d, next_mirror %d, failed_mirror %d",
7977 num_copies
, failrec
->this_mirror
, failed_mirror
);
7984 static int dio_read_error(struct inode
*inode
, struct bio
*failed_bio
,
7985 struct page
*page
, unsigned int pgoff
,
7986 u64 start
, u64 end
, int failed_mirror
,
7987 bio_end_io_t
*repair_endio
, void *repair_arg
)
7989 struct io_failure_record
*failrec
;
7990 struct extent_io_tree
*io_tree
= &BTRFS_I(inode
)->io_tree
;
7991 struct extent_io_tree
*failure_tree
= &BTRFS_I(inode
)->io_failure_tree
;
7998 BUG_ON(bio_op(failed_bio
) == REQ_OP_WRITE
);
8000 ret
= btrfs_get_io_failure_record(inode
, start
, end
, &failrec
);
8004 ret
= btrfs_check_dio_repairable(inode
, failed_bio
, failrec
,
8007 free_io_failure(failure_tree
, io_tree
, failrec
);
8011 segs
= bio_segments(failed_bio
);
8013 (failed_bio
->bi_io_vec
->bv_len
> btrfs_inode_sectorsize(inode
)))
8014 read_mode
|= REQ_FAILFAST_DEV
;
8016 isector
= start
- btrfs_io_bio(failed_bio
)->logical
;
8017 isector
>>= inode
->i_sb
->s_blocksize_bits
;
8018 bio
= btrfs_create_repair_bio(inode
, failed_bio
, failrec
, page
,
8019 pgoff
, isector
, repair_endio
, repair_arg
);
8021 free_io_failure(failure_tree
, io_tree
, failrec
);
8024 bio_set_op_attrs(bio
, REQ_OP_READ
, read_mode
);
8026 btrfs_debug(BTRFS_I(inode
)->root
->fs_info
,
8027 "Repair DIO Read Error: submitting new dio read[%#x] to this_mirror=%d, in_validation=%d\n",
8028 read_mode
, failrec
->this_mirror
, failrec
->in_validation
);
8030 ret
= submit_dio_repair_bio(inode
, bio
, failrec
->this_mirror
);
8032 free_io_failure(failure_tree
, io_tree
, failrec
);
8039 struct btrfs_retry_complete
{
8040 struct completion done
;
8041 struct inode
*inode
;
8046 static void btrfs_retry_endio_nocsum(struct bio
*bio
)
8048 struct btrfs_retry_complete
*done
= bio
->bi_private
;
8049 struct inode
*inode
= done
->inode
;
8050 struct bio_vec
*bvec
;
8051 struct extent_io_tree
*io_tree
, *failure_tree
;
8057 ASSERT(bio
->bi_vcnt
== 1);
8058 io_tree
= &BTRFS_I(inode
)->io_tree
;
8059 failure_tree
= &BTRFS_I(inode
)->io_failure_tree
;
8060 ASSERT(bio
->bi_io_vec
->bv_len
== btrfs_inode_sectorsize(inode
));
8063 bio_for_each_segment_all(bvec
, bio
, i
)
8064 clean_io_failure(BTRFS_I(inode
)->root
->fs_info
, failure_tree
,
8065 io_tree
, done
->start
, bvec
->bv_page
,
8066 btrfs_ino(BTRFS_I(inode
)), 0);
8068 complete(&done
->done
);
8072 static int __btrfs_correct_data_nocsum(struct inode
*inode
,
8073 struct btrfs_io_bio
*io_bio
)
8075 struct btrfs_fs_info
*fs_info
;
8076 struct bio_vec bvec
;
8077 struct bvec_iter iter
;
8078 struct btrfs_retry_complete done
;
8086 fs_info
= BTRFS_I(inode
)->root
->fs_info
;
8087 sectorsize
= fs_info
->sectorsize
;
8089 start
= io_bio
->logical
;
8091 io_bio
->bio
.bi_iter
= io_bio
->iter
;
8093 bio_for_each_segment(bvec
, &io_bio
->bio
, iter
) {
8094 nr_sectors
= BTRFS_BYTES_TO_BLKS(fs_info
, bvec
.bv_len
);
8095 pgoff
= bvec
.bv_offset
;
8097 next_block_or_try_again
:
8100 init_completion(&done
.done
);
8102 ret
= dio_read_error(inode
, &io_bio
->bio
, bvec
.bv_page
,
8103 pgoff
, start
, start
+ sectorsize
- 1,
8105 btrfs_retry_endio_nocsum
, &done
);
8111 wait_for_completion(&done
.done
);
8113 if (!done
.uptodate
) {
8114 /* We might have another mirror, so try again */
8115 goto next_block_or_try_again
;
8119 start
+= sectorsize
;
8123 pgoff
+= sectorsize
;
8124 ASSERT(pgoff
< PAGE_SIZE
);
8125 goto next_block_or_try_again
;
8132 static void btrfs_retry_endio(struct bio
*bio
)
8134 struct btrfs_retry_complete
*done
= bio
->bi_private
;
8135 struct btrfs_io_bio
*io_bio
= btrfs_io_bio(bio
);
8136 struct extent_io_tree
*io_tree
, *failure_tree
;
8137 struct inode
*inode
= done
->inode
;
8138 struct bio_vec
*bvec
;
8148 ASSERT(bio
->bi_vcnt
== 1);
8149 ASSERT(bio
->bi_io_vec
->bv_len
== btrfs_inode_sectorsize(done
->inode
));
8151 io_tree
= &BTRFS_I(inode
)->io_tree
;
8152 failure_tree
= &BTRFS_I(inode
)->io_failure_tree
;
8154 bio_for_each_segment_all(bvec
, bio
, i
) {
8155 ret
= __readpage_endio_check(inode
, io_bio
, i
, bvec
->bv_page
,
8156 bvec
->bv_offset
, done
->start
,
8159 clean_io_failure(BTRFS_I(inode
)->root
->fs_info
,
8160 failure_tree
, io_tree
, done
->start
,
8162 btrfs_ino(BTRFS_I(inode
)),
8168 done
->uptodate
= uptodate
;
8170 complete(&done
->done
);
8174 static int __btrfs_subio_endio_read(struct inode
*inode
,
8175 struct btrfs_io_bio
*io_bio
, int err
)
8177 struct btrfs_fs_info
*fs_info
;
8178 struct bio_vec bvec
;
8179 struct bvec_iter iter
;
8180 struct btrfs_retry_complete done
;
8187 bool uptodate
= (err
== 0);
8190 fs_info
= BTRFS_I(inode
)->root
->fs_info
;
8191 sectorsize
= fs_info
->sectorsize
;
8194 start
= io_bio
->logical
;
8196 io_bio
->bio
.bi_iter
= io_bio
->iter
;
8198 bio_for_each_segment(bvec
, &io_bio
->bio
, iter
) {
8199 nr_sectors
= BTRFS_BYTES_TO_BLKS(fs_info
, bvec
.bv_len
);
8201 pgoff
= bvec
.bv_offset
;
8204 csum_pos
= BTRFS_BYTES_TO_BLKS(fs_info
, offset
);
8205 ret
= __readpage_endio_check(inode
, io_bio
, csum_pos
,
8206 bvec
.bv_page
, pgoff
, start
, sectorsize
);
8213 init_completion(&done
.done
);
8215 ret
= dio_read_error(inode
, &io_bio
->bio
, bvec
.bv_page
,
8216 pgoff
, start
, start
+ sectorsize
- 1,
8218 btrfs_retry_endio
, &done
);
8224 wait_for_completion(&done
.done
);
8226 if (!done
.uptodate
) {
8227 /* We might have another mirror, so try again */
8231 offset
+= sectorsize
;
8232 start
+= sectorsize
;
8238 pgoff
+= sectorsize
;
8239 ASSERT(pgoff
< PAGE_SIZE
);
8247 static int btrfs_subio_endio_read(struct inode
*inode
,
8248 struct btrfs_io_bio
*io_bio
, int err
)
8250 bool skip_csum
= BTRFS_I(inode
)->flags
& BTRFS_INODE_NODATASUM
;
8254 return __btrfs_correct_data_nocsum(inode
, io_bio
);
8258 return __btrfs_subio_endio_read(inode
, io_bio
, err
);
8262 static void btrfs_endio_direct_read(struct bio
*bio
)
8264 struct btrfs_dio_private
*dip
= bio
->bi_private
;
8265 struct inode
*inode
= dip
->inode
;
8266 struct bio
*dio_bio
;
8267 struct btrfs_io_bio
*io_bio
= btrfs_io_bio(bio
);
8268 int err
= bio
->bi_error
;
8270 if (dip
->flags
& BTRFS_DIO_ORIG_BIO_SUBMITTED
) {
8271 err
= btrfs_subio_endio_read(inode
, io_bio
, err
);
8276 unlock_extent(&BTRFS_I(inode
)->io_tree
, dip
->logical_offset
,
8277 dip
->logical_offset
+ dip
->bytes
- 1);
8278 dio_bio
= dip
->dio_bio
;
8282 dio_bio
->bi_error
= bio
->bi_error
;
8283 dio_end_io(dio_bio
, bio
->bi_error
);
8286 io_bio
->end_io(io_bio
, err
);
8290 static void __endio_write_update_ordered(struct inode
*inode
,
8291 const u64 offset
, const u64 bytes
,
8292 const bool uptodate
)
8294 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
8295 struct btrfs_ordered_extent
*ordered
= NULL
;
8296 struct btrfs_workqueue
*wq
;
8297 btrfs_work_func_t func
;
8298 u64 ordered_offset
= offset
;
8299 u64 ordered_bytes
= bytes
;
8302 if (btrfs_is_free_space_inode(BTRFS_I(inode
))) {
8303 wq
= fs_info
->endio_freespace_worker
;
8304 func
= btrfs_freespace_write_helper
;
8306 wq
= fs_info
->endio_write_workers
;
8307 func
= btrfs_endio_write_helper
;
8311 ret
= btrfs_dec_test_first_ordered_pending(inode
, &ordered
,
8318 btrfs_init_work(&ordered
->work
, func
, finish_ordered_fn
, NULL
, NULL
);
8319 btrfs_queue_work(wq
, &ordered
->work
);
8322 * our bio might span multiple ordered extents. If we haven't
8323 * completed the accounting for the whole dio, go back and try again
8325 if (ordered_offset
< offset
+ bytes
) {
8326 ordered_bytes
= offset
+ bytes
- ordered_offset
;
8332 static void btrfs_endio_direct_write(struct bio
*bio
)
8334 struct btrfs_dio_private
*dip
= bio
->bi_private
;
8335 struct bio
*dio_bio
= dip
->dio_bio
;
8337 __endio_write_update_ordered(dip
->inode
, dip
->logical_offset
,
8338 dip
->bytes
, !bio
->bi_error
);
8342 dio_bio
->bi_error
= bio
->bi_error
;
8343 dio_end_io(dio_bio
, bio
->bi_error
);
8347 static int __btrfs_submit_bio_start_direct_io(void *private_data
,
8348 struct bio
*bio
, int mirror_num
,
8349 unsigned long bio_flags
, u64 offset
)
8351 struct inode
*inode
= private_data
;
8353 ret
= btrfs_csum_one_bio(inode
, bio
, offset
, 1);
8354 BUG_ON(ret
); /* -ENOMEM */
8358 static void btrfs_end_dio_bio(struct bio
*bio
)
8360 struct btrfs_dio_private
*dip
= bio
->bi_private
;
8361 int err
= bio
->bi_error
;
8364 btrfs_warn(BTRFS_I(dip
->inode
)->root
->fs_info
,
8365 "direct IO failed ino %llu rw %d,%u sector %#Lx len %u err no %d",
8366 btrfs_ino(BTRFS_I(dip
->inode
)), bio_op(bio
),
8368 (unsigned long long)bio
->bi_iter
.bi_sector
,
8369 bio
->bi_iter
.bi_size
, err
);
8371 if (dip
->subio_endio
)
8372 err
= dip
->subio_endio(dip
->inode
, btrfs_io_bio(bio
), err
);
8378 * before atomic variable goto zero, we must make sure
8379 * dip->errors is perceived to be set.
8381 smp_mb__before_atomic();
8384 /* if there are more bios still pending for this dio, just exit */
8385 if (!atomic_dec_and_test(&dip
->pending_bios
))
8389 bio_io_error(dip
->orig_bio
);
8391 dip
->dio_bio
->bi_error
= 0;
8392 bio_endio(dip
->orig_bio
);
8398 static inline int btrfs_lookup_and_bind_dio_csum(struct inode
*inode
,
8399 struct btrfs_dio_private
*dip
,
8403 struct btrfs_io_bio
*io_bio
= btrfs_io_bio(bio
);
8404 struct btrfs_io_bio
*orig_io_bio
= btrfs_io_bio(dip
->orig_bio
);
8408 * We load all the csum data we need when we submit
8409 * the first bio to reduce the csum tree search and
8412 if (dip
->logical_offset
== file_offset
) {
8413 ret
= btrfs_lookup_bio_sums_dio(inode
, dip
->orig_bio
,
8419 if (bio
== dip
->orig_bio
)
8422 file_offset
-= dip
->logical_offset
;
8423 file_offset
>>= inode
->i_sb
->s_blocksize_bits
;
8424 io_bio
->csum
= (u8
*)(((u32
*)orig_io_bio
->csum
) + file_offset
);
8429 static inline int __btrfs_submit_dio_bio(struct bio
*bio
, struct inode
*inode
,
8430 u64 file_offset
, int skip_sum
,
8433 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
8434 struct btrfs_dio_private
*dip
= bio
->bi_private
;
8435 bool write
= bio_op(bio
) == REQ_OP_WRITE
;
8439 async_submit
= !atomic_read(&BTRFS_I(inode
)->sync_writers
);
8444 ret
= btrfs_bio_wq_end_io(fs_info
, bio
, BTRFS_WQ_ENDIO_DATA
);
8452 if (write
&& async_submit
) {
8453 ret
= btrfs_wq_submit_bio(fs_info
, bio
, 0, 0,
8455 __btrfs_submit_bio_start_direct_io
,
8456 __btrfs_submit_bio_done
);
8460 * If we aren't doing async submit, calculate the csum of the
8463 ret
= btrfs_csum_one_bio(inode
, bio
, file_offset
, 1);
8467 ret
= btrfs_lookup_and_bind_dio_csum(inode
, dip
, bio
,
8473 ret
= btrfs_map_bio(fs_info
, bio
, 0, async_submit
);
8479 static int btrfs_submit_direct_hook(struct btrfs_dio_private
*dip
,
8482 struct inode
*inode
= dip
->inode
;
8483 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
8485 struct bio
*orig_bio
= dip
->orig_bio
;
8486 u64 start_sector
= orig_bio
->bi_iter
.bi_sector
;
8487 u64 file_offset
= dip
->logical_offset
;
8489 int async_submit
= 0;
8491 int clone_offset
= 0;
8495 map_length
= orig_bio
->bi_iter
.bi_size
;
8496 submit_len
= map_length
;
8497 ret
= btrfs_map_block(fs_info
, btrfs_op(orig_bio
), start_sector
<< 9,
8498 &map_length
, NULL
, 0);
8502 if (map_length
>= submit_len
) {
8504 dip
->flags
|= BTRFS_DIO_ORIG_BIO_SUBMITTED
;
8508 /* async crcs make it difficult to collect full stripe writes. */
8509 if (btrfs_data_alloc_profile(fs_info
) & BTRFS_BLOCK_GROUP_RAID56_MASK
)
8515 ASSERT(map_length
<= INT_MAX
);
8516 atomic_inc(&dip
->pending_bios
);
8518 clone_len
= min_t(int, submit_len
, map_length
);
8521 * This will never fail as it's passing GPF_NOFS and
8522 * the allocation is backed by btrfs_bioset.
8524 bio
= btrfs_bio_clone_partial(orig_bio
, clone_offset
,
8526 bio
->bi_private
= dip
;
8527 bio
->bi_end_io
= btrfs_end_dio_bio
;
8528 btrfs_io_bio(bio
)->logical
= file_offset
;
8530 ASSERT(submit_len
>= clone_len
);
8531 submit_len
-= clone_len
;
8532 if (submit_len
== 0)
8536 * Increase the count before we submit the bio so we know
8537 * the end IO handler won't happen before we increase the
8538 * count. Otherwise, the dip might get freed before we're
8539 * done setting it up.
8541 atomic_inc(&dip
->pending_bios
);
8543 ret
= __btrfs_submit_dio_bio(bio
, inode
, file_offset
, skip_sum
,
8547 atomic_dec(&dip
->pending_bios
);
8551 clone_offset
+= clone_len
;
8552 start_sector
+= clone_len
>> 9;
8553 file_offset
+= clone_len
;
8555 map_length
= submit_len
;
8556 ret
= btrfs_map_block(fs_info
, btrfs_op(orig_bio
),
8557 start_sector
<< 9, &map_length
, NULL
, 0);
8560 } while (submit_len
> 0);
8563 ret
= __btrfs_submit_dio_bio(bio
, inode
, file_offset
, skip_sum
,
8572 * before atomic variable goto zero, we must
8573 * make sure dip->errors is perceived to be set.
8575 smp_mb__before_atomic();
8576 if (atomic_dec_and_test(&dip
->pending_bios
))
8577 bio_io_error(dip
->orig_bio
);
8579 /* bio_end_io() will handle error, so we needn't return it */
8583 static void btrfs_submit_direct(struct bio
*dio_bio
, struct inode
*inode
,
8586 struct btrfs_dio_private
*dip
= NULL
;
8587 struct bio
*bio
= NULL
;
8588 struct btrfs_io_bio
*io_bio
;
8590 bool write
= (bio_op(dio_bio
) == REQ_OP_WRITE
);
8593 skip_sum
= BTRFS_I(inode
)->flags
& BTRFS_INODE_NODATASUM
;
8595 bio
= btrfs_bio_clone(dio_bio
);
8597 dip
= kzalloc(sizeof(*dip
), GFP_NOFS
);
8603 dip
->private = dio_bio
->bi_private
;
8605 dip
->logical_offset
= file_offset
;
8606 dip
->bytes
= dio_bio
->bi_iter
.bi_size
;
8607 dip
->disk_bytenr
= (u64
)dio_bio
->bi_iter
.bi_sector
<< 9;
8608 bio
->bi_private
= dip
;
8609 dip
->orig_bio
= bio
;
8610 dip
->dio_bio
= dio_bio
;
8611 atomic_set(&dip
->pending_bios
, 0);
8612 io_bio
= btrfs_io_bio(bio
);
8613 io_bio
->logical
= file_offset
;
8616 bio
->bi_end_io
= btrfs_endio_direct_write
;
8618 bio
->bi_end_io
= btrfs_endio_direct_read
;
8619 dip
->subio_endio
= btrfs_subio_endio_read
;
8623 * Reset the range for unsubmitted ordered extents (to a 0 length range)
8624 * even if we fail to submit a bio, because in such case we do the
8625 * corresponding error handling below and it must not be done a second
8626 * time by btrfs_direct_IO().
8629 struct btrfs_dio_data
*dio_data
= current
->journal_info
;
8631 dio_data
->unsubmitted_oe_range_end
= dip
->logical_offset
+
8633 dio_data
->unsubmitted_oe_range_start
=
8634 dio_data
->unsubmitted_oe_range_end
;
8637 ret
= btrfs_submit_direct_hook(dip
, skip_sum
);
8642 io_bio
->end_io(io_bio
, ret
);
8646 * If we arrived here it means either we failed to submit the dip
8647 * or we either failed to clone the dio_bio or failed to allocate the
8648 * dip. If we cloned the dio_bio and allocated the dip, we can just
8649 * call bio_endio against our io_bio so that we get proper resource
8650 * cleanup if we fail to submit the dip, otherwise, we must do the
8651 * same as btrfs_endio_direct_[write|read] because we can't call these
8652 * callbacks - they require an allocated dip and a clone of dio_bio.
8657 * The end io callbacks free our dip, do the final put on bio
8658 * and all the cleanup and final put for dio_bio (through
8665 __endio_write_update_ordered(inode
,
8667 dio_bio
->bi_iter
.bi_size
,
8670 unlock_extent(&BTRFS_I(inode
)->io_tree
, file_offset
,
8671 file_offset
+ dio_bio
->bi_iter
.bi_size
- 1);
8673 dio_bio
->bi_error
= -EIO
;
8675 * Releases and cleans up our dio_bio, no need to bio_put()
8676 * nor bio_endio()/bio_io_error() against dio_bio.
8678 dio_end_io(dio_bio
, ret
);
8685 static ssize_t
check_direct_IO(struct btrfs_fs_info
*fs_info
,
8687 const struct iov_iter
*iter
, loff_t offset
)
8691 unsigned int blocksize_mask
= fs_info
->sectorsize
- 1;
8692 ssize_t retval
= -EINVAL
;
8694 if (offset
& blocksize_mask
)
8697 if (iov_iter_alignment(iter
) & blocksize_mask
)
8700 /* If this is a write we don't need to check anymore */
8701 if (iov_iter_rw(iter
) != READ
|| !iter_is_iovec(iter
))
8704 * Check to make sure we don't have duplicate iov_base's in this
8705 * iovec, if so return EINVAL, otherwise we'll get csum errors
8706 * when reading back.
8708 for (seg
= 0; seg
< iter
->nr_segs
; seg
++) {
8709 for (i
= seg
+ 1; i
< iter
->nr_segs
; i
++) {
8710 if (iter
->iov
[seg
].iov_base
== iter
->iov
[i
].iov_base
)
8719 static ssize_t
btrfs_direct_IO(struct kiocb
*iocb
, struct iov_iter
*iter
)
8721 struct file
*file
= iocb
->ki_filp
;
8722 struct inode
*inode
= file
->f_mapping
->host
;
8723 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
8724 struct btrfs_dio_data dio_data
= { 0 };
8725 struct extent_changeset
*data_reserved
= NULL
;
8726 loff_t offset
= iocb
->ki_pos
;
8730 bool relock
= false;
8733 if (check_direct_IO(fs_info
, iocb
, iter
, offset
))
8736 inode_dio_begin(inode
);
8737 smp_mb__after_atomic();
8740 * The generic stuff only does filemap_write_and_wait_range, which
8741 * isn't enough if we've written compressed pages to this area, so
8742 * we need to flush the dirty pages again to make absolutely sure
8743 * that any outstanding dirty pages are on disk.
8745 count
= iov_iter_count(iter
);
8746 if (test_bit(BTRFS_INODE_HAS_ASYNC_EXTENT
,
8747 &BTRFS_I(inode
)->runtime_flags
))
8748 filemap_fdatawrite_range(inode
->i_mapping
, offset
,
8749 offset
+ count
- 1);
8751 if (iov_iter_rw(iter
) == WRITE
) {
8753 * If the write DIO is beyond the EOF, we need update
8754 * the isize, but it is protected by i_mutex. So we can
8755 * not unlock the i_mutex at this case.
8757 if (offset
+ count
<= inode
->i_size
) {
8758 dio_data
.overwrite
= 1;
8759 inode_unlock(inode
);
8762 ret
= btrfs_delalloc_reserve_space(inode
, &data_reserved
,
8766 dio_data
.outstanding_extents
= count_max_extents(count
);
8769 * We need to know how many extents we reserved so that we can
8770 * do the accounting properly if we go over the number we
8771 * originally calculated. Abuse current->journal_info for this.
8773 dio_data
.reserve
= round_up(count
,
8774 fs_info
->sectorsize
);
8775 dio_data
.unsubmitted_oe_range_start
= (u64
)offset
;
8776 dio_data
.unsubmitted_oe_range_end
= (u64
)offset
;
8777 current
->journal_info
= &dio_data
;
8778 down_read(&BTRFS_I(inode
)->dio_sem
);
8779 } else if (test_bit(BTRFS_INODE_READDIO_NEED_LOCK
,
8780 &BTRFS_I(inode
)->runtime_flags
)) {
8781 inode_dio_end(inode
);
8782 flags
= DIO_LOCKING
| DIO_SKIP_HOLES
;
8786 ret
= __blockdev_direct_IO(iocb
, inode
,
8787 fs_info
->fs_devices
->latest_bdev
,
8788 iter
, btrfs_get_blocks_direct
, NULL
,
8789 btrfs_submit_direct
, flags
);
8790 if (iov_iter_rw(iter
) == WRITE
) {
8791 up_read(&BTRFS_I(inode
)->dio_sem
);
8792 current
->journal_info
= NULL
;
8793 if (ret
< 0 && ret
!= -EIOCBQUEUED
) {
8794 if (dio_data
.reserve
)
8795 btrfs_delalloc_release_space(inode
, data_reserved
,
8796 offset
, dio_data
.reserve
);
8798 * On error we might have left some ordered extents
8799 * without submitting corresponding bios for them, so
8800 * cleanup them up to avoid other tasks getting them
8801 * and waiting for them to complete forever.
8803 if (dio_data
.unsubmitted_oe_range_start
<
8804 dio_data
.unsubmitted_oe_range_end
)
8805 __endio_write_update_ordered(inode
,
8806 dio_data
.unsubmitted_oe_range_start
,
8807 dio_data
.unsubmitted_oe_range_end
-
8808 dio_data
.unsubmitted_oe_range_start
,
8810 } else if (ret
>= 0 && (size_t)ret
< count
)
8811 btrfs_delalloc_release_space(inode
, data_reserved
,
8812 offset
, count
- (size_t)ret
);
8816 inode_dio_end(inode
);
8820 extent_changeset_free(data_reserved
);
8824 #define BTRFS_FIEMAP_FLAGS (FIEMAP_FLAG_SYNC)
8826 static int btrfs_fiemap(struct inode
*inode
, struct fiemap_extent_info
*fieinfo
,
8827 __u64 start
, __u64 len
)
8831 ret
= fiemap_check_flags(fieinfo
, BTRFS_FIEMAP_FLAGS
);
8835 return extent_fiemap(inode
, fieinfo
, start
, len
, btrfs_get_extent_fiemap
);
8838 int btrfs_readpage(struct file
*file
, struct page
*page
)
8840 struct extent_io_tree
*tree
;
8841 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
8842 return extent_read_full_page(tree
, page
, btrfs_get_extent
, 0);
8845 static int btrfs_writepage(struct page
*page
, struct writeback_control
*wbc
)
8847 struct extent_io_tree
*tree
;
8848 struct inode
*inode
= page
->mapping
->host
;
8851 if (current
->flags
& PF_MEMALLOC
) {
8852 redirty_page_for_writepage(wbc
, page
);
8858 * If we are under memory pressure we will call this directly from the
8859 * VM, we need to make sure we have the inode referenced for the ordered
8860 * extent. If not just return like we didn't do anything.
8862 if (!igrab(inode
)) {
8863 redirty_page_for_writepage(wbc
, page
);
8864 return AOP_WRITEPAGE_ACTIVATE
;
8866 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
8867 ret
= extent_write_full_page(tree
, page
, btrfs_get_extent
, wbc
);
8868 btrfs_add_delayed_iput(inode
);
8872 static int btrfs_writepages(struct address_space
*mapping
,
8873 struct writeback_control
*wbc
)
8875 struct extent_io_tree
*tree
;
8877 tree
= &BTRFS_I(mapping
->host
)->io_tree
;
8878 return extent_writepages(tree
, mapping
, btrfs_get_extent
, wbc
);
8882 btrfs_readpages(struct file
*file
, struct address_space
*mapping
,
8883 struct list_head
*pages
, unsigned nr_pages
)
8885 struct extent_io_tree
*tree
;
8886 tree
= &BTRFS_I(mapping
->host
)->io_tree
;
8887 return extent_readpages(tree
, mapping
, pages
, nr_pages
,
8890 static int __btrfs_releasepage(struct page
*page
, gfp_t gfp_flags
)
8892 struct extent_io_tree
*tree
;
8893 struct extent_map_tree
*map
;
8896 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
8897 map
= &BTRFS_I(page
->mapping
->host
)->extent_tree
;
8898 ret
= try_release_extent_mapping(map
, tree
, page
, gfp_flags
);
8900 ClearPagePrivate(page
);
8901 set_page_private(page
, 0);
8907 static int btrfs_releasepage(struct page
*page
, gfp_t gfp_flags
)
8909 if (PageWriteback(page
) || PageDirty(page
))
8911 return __btrfs_releasepage(page
, gfp_flags
);
8914 static void btrfs_invalidatepage(struct page
*page
, unsigned int offset
,
8915 unsigned int length
)
8917 struct inode
*inode
= page
->mapping
->host
;
8918 struct extent_io_tree
*tree
;
8919 struct btrfs_ordered_extent
*ordered
;
8920 struct extent_state
*cached_state
= NULL
;
8921 u64 page_start
= page_offset(page
);
8922 u64 page_end
= page_start
+ PAGE_SIZE
- 1;
8925 int inode_evicting
= inode
->i_state
& I_FREEING
;
8928 * we have the page locked, so new writeback can't start,
8929 * and the dirty bit won't be cleared while we are here.
8931 * Wait for IO on this page so that we can safely clear
8932 * the PagePrivate2 bit and do ordered accounting
8934 wait_on_page_writeback(page
);
8936 tree
= &BTRFS_I(inode
)->io_tree
;
8938 btrfs_releasepage(page
, GFP_NOFS
);
8942 if (!inode_evicting
)
8943 lock_extent_bits(tree
, page_start
, page_end
, &cached_state
);
8946 ordered
= btrfs_lookup_ordered_range(BTRFS_I(inode
), start
,
8947 page_end
- start
+ 1);
8949 end
= min(page_end
, ordered
->file_offset
+ ordered
->len
- 1);
8951 * IO on this page will never be started, so we need
8952 * to account for any ordered extents now
8954 if (!inode_evicting
)
8955 clear_extent_bit(tree
, start
, end
,
8956 EXTENT_DIRTY
| EXTENT_DELALLOC
|
8957 EXTENT_DELALLOC_NEW
|
8958 EXTENT_LOCKED
| EXTENT_DO_ACCOUNTING
|
8959 EXTENT_DEFRAG
, 1, 0, &cached_state
,
8962 * whoever cleared the private bit is responsible
8963 * for the finish_ordered_io
8965 if (TestClearPagePrivate2(page
)) {
8966 struct btrfs_ordered_inode_tree
*tree
;
8969 tree
= &BTRFS_I(inode
)->ordered_tree
;
8971 spin_lock_irq(&tree
->lock
);
8972 set_bit(BTRFS_ORDERED_TRUNCATED
, &ordered
->flags
);
8973 new_len
= start
- ordered
->file_offset
;
8974 if (new_len
< ordered
->truncated_len
)
8975 ordered
->truncated_len
= new_len
;
8976 spin_unlock_irq(&tree
->lock
);
8978 if (btrfs_dec_test_ordered_pending(inode
, &ordered
,
8980 end
- start
+ 1, 1))
8981 btrfs_finish_ordered_io(ordered
);
8983 btrfs_put_ordered_extent(ordered
);
8984 if (!inode_evicting
) {
8985 cached_state
= NULL
;
8986 lock_extent_bits(tree
, start
, end
,
8991 if (start
< page_end
)
8996 * Qgroup reserved space handler
8997 * Page here will be either
8998 * 1) Already written to disk
8999 * In this case, its reserved space is released from data rsv map
9000 * and will be freed by delayed_ref handler finally.
9001 * So even we call qgroup_free_data(), it won't decrease reserved
9003 * 2) Not written to disk
9004 * This means the reserved space should be freed here. However,
9005 * if a truncate invalidates the page (by clearing PageDirty)
9006 * and the page is accounted for while allocating extent
9007 * in btrfs_check_data_free_space() we let delayed_ref to
9008 * free the entire extent.
9010 if (PageDirty(page
))
9011 btrfs_qgroup_free_data(inode
, NULL
, page_start
, PAGE_SIZE
);
9012 if (!inode_evicting
) {
9013 clear_extent_bit(tree
, page_start
, page_end
,
9014 EXTENT_LOCKED
| EXTENT_DIRTY
|
9015 EXTENT_DELALLOC
| EXTENT_DELALLOC_NEW
|
9016 EXTENT_DO_ACCOUNTING
| EXTENT_DEFRAG
, 1, 1,
9017 &cached_state
, GFP_NOFS
);
9019 __btrfs_releasepage(page
, GFP_NOFS
);
9022 ClearPageChecked(page
);
9023 if (PagePrivate(page
)) {
9024 ClearPagePrivate(page
);
9025 set_page_private(page
, 0);
9031 * btrfs_page_mkwrite() is not allowed to change the file size as it gets
9032 * called from a page fault handler when a page is first dirtied. Hence we must
9033 * be careful to check for EOF conditions here. We set the page up correctly
9034 * for a written page which means we get ENOSPC checking when writing into
9035 * holes and correct delalloc and unwritten extent mapping on filesystems that
9036 * support these features.
9038 * We are not allowed to take the i_mutex here so we have to play games to
9039 * protect against truncate races as the page could now be beyond EOF. Because
9040 * vmtruncate() writes the inode size before removing pages, once we have the
9041 * page lock we can determine safely if the page is beyond EOF. If it is not
9042 * beyond EOF, then the page is guaranteed safe against truncation until we
9045 int btrfs_page_mkwrite(struct vm_fault
*vmf
)
9047 struct page
*page
= vmf
->page
;
9048 struct inode
*inode
= file_inode(vmf
->vma
->vm_file
);
9049 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
9050 struct extent_io_tree
*io_tree
= &BTRFS_I(inode
)->io_tree
;
9051 struct btrfs_ordered_extent
*ordered
;
9052 struct extent_state
*cached_state
= NULL
;
9053 struct extent_changeset
*data_reserved
= NULL
;
9055 unsigned long zero_start
;
9064 reserved_space
= PAGE_SIZE
;
9066 sb_start_pagefault(inode
->i_sb
);
9067 page_start
= page_offset(page
);
9068 page_end
= page_start
+ PAGE_SIZE
- 1;
9072 * Reserving delalloc space after obtaining the page lock can lead to
9073 * deadlock. For example, if a dirty page is locked by this function
9074 * and the call to btrfs_delalloc_reserve_space() ends up triggering
9075 * dirty page write out, then the btrfs_writepage() function could
9076 * end up waiting indefinitely to get a lock on the page currently
9077 * being processed by btrfs_page_mkwrite() function.
9079 ret
= btrfs_delalloc_reserve_space(inode
, &data_reserved
, page_start
,
9082 ret
= file_update_time(vmf
->vma
->vm_file
);
9088 else /* -ENOSPC, -EIO, etc */
9089 ret
= VM_FAULT_SIGBUS
;
9095 ret
= VM_FAULT_NOPAGE
; /* make the VM retry the fault */
9098 size
= i_size_read(inode
);
9100 if ((page
->mapping
!= inode
->i_mapping
) ||
9101 (page_start
>= size
)) {
9102 /* page got truncated out from underneath us */
9105 wait_on_page_writeback(page
);
9107 lock_extent_bits(io_tree
, page_start
, page_end
, &cached_state
);
9108 set_page_extent_mapped(page
);
9111 * we can't set the delalloc bits if there are pending ordered
9112 * extents. Drop our locks and wait for them to finish
9114 ordered
= btrfs_lookup_ordered_range(BTRFS_I(inode
), page_start
,
9117 unlock_extent_cached(io_tree
, page_start
, page_end
,
9118 &cached_state
, GFP_NOFS
);
9120 btrfs_start_ordered_extent(inode
, ordered
, 1);
9121 btrfs_put_ordered_extent(ordered
);
9125 if (page
->index
== ((size
- 1) >> PAGE_SHIFT
)) {
9126 reserved_space
= round_up(size
- page_start
,
9127 fs_info
->sectorsize
);
9128 if (reserved_space
< PAGE_SIZE
) {
9129 end
= page_start
+ reserved_space
- 1;
9130 spin_lock(&BTRFS_I(inode
)->lock
);
9131 BTRFS_I(inode
)->outstanding_extents
++;
9132 spin_unlock(&BTRFS_I(inode
)->lock
);
9133 btrfs_delalloc_release_space(inode
, data_reserved
,
9134 page_start
, PAGE_SIZE
- reserved_space
);
9139 * page_mkwrite gets called when the page is firstly dirtied after it's
9140 * faulted in, but write(2) could also dirty a page and set delalloc
9141 * bits, thus in this case for space account reason, we still need to
9142 * clear any delalloc bits within this page range since we have to
9143 * reserve data&meta space before lock_page() (see above comments).
9145 clear_extent_bit(&BTRFS_I(inode
)->io_tree
, page_start
, end
,
9146 EXTENT_DIRTY
| EXTENT_DELALLOC
|
9147 EXTENT_DO_ACCOUNTING
| EXTENT_DEFRAG
,
9148 0, 0, &cached_state
, GFP_NOFS
);
9150 ret
= btrfs_set_extent_delalloc(inode
, page_start
, end
,
9153 unlock_extent_cached(io_tree
, page_start
, page_end
,
9154 &cached_state
, GFP_NOFS
);
9155 ret
= VM_FAULT_SIGBUS
;
9160 /* page is wholly or partially inside EOF */
9161 if (page_start
+ PAGE_SIZE
> size
)
9162 zero_start
= size
& ~PAGE_MASK
;
9164 zero_start
= PAGE_SIZE
;
9166 if (zero_start
!= PAGE_SIZE
) {
9168 memset(kaddr
+ zero_start
, 0, PAGE_SIZE
- zero_start
);
9169 flush_dcache_page(page
);
9172 ClearPageChecked(page
);
9173 set_page_dirty(page
);
9174 SetPageUptodate(page
);
9176 BTRFS_I(inode
)->last_trans
= fs_info
->generation
;
9177 BTRFS_I(inode
)->last_sub_trans
= BTRFS_I(inode
)->root
->log_transid
;
9178 BTRFS_I(inode
)->last_log_commit
= BTRFS_I(inode
)->root
->last_log_commit
;
9180 unlock_extent_cached(io_tree
, page_start
, page_end
, &cached_state
, GFP_NOFS
);
9184 sb_end_pagefault(inode
->i_sb
);
9185 extent_changeset_free(data_reserved
);
9186 return VM_FAULT_LOCKED
;
9190 btrfs_delalloc_release_space(inode
, data_reserved
, page_start
,
9193 sb_end_pagefault(inode
->i_sb
);
9194 extent_changeset_free(data_reserved
);
9198 static int btrfs_truncate(struct inode
*inode
)
9200 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
9201 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
9202 struct btrfs_block_rsv
*rsv
;
9205 struct btrfs_trans_handle
*trans
;
9206 u64 mask
= fs_info
->sectorsize
- 1;
9207 u64 min_size
= btrfs_calc_trunc_metadata_size(fs_info
, 1);
9209 ret
= btrfs_wait_ordered_range(inode
, inode
->i_size
& (~mask
),
9215 * Yes ladies and gentlemen, this is indeed ugly. The fact is we have
9216 * 3 things going on here
9218 * 1) We need to reserve space for our orphan item and the space to
9219 * delete our orphan item. Lord knows we don't want to have a dangling
9220 * orphan item because we didn't reserve space to remove it.
9222 * 2) We need to reserve space to update our inode.
9224 * 3) We need to have something to cache all the space that is going to
9225 * be free'd up by the truncate operation, but also have some slack
9226 * space reserved in case it uses space during the truncate (thank you
9227 * very much snapshotting).
9229 * And we need these to all be separate. The fact is we can use a lot of
9230 * space doing the truncate, and we have no earthly idea how much space
9231 * we will use, so we need the truncate reservation to be separate so it
9232 * doesn't end up using space reserved for updating the inode or
9233 * removing the orphan item. We also need to be able to stop the
9234 * transaction and start a new one, which means we need to be able to
9235 * update the inode several times, and we have no idea of knowing how
9236 * many times that will be, so we can't just reserve 1 item for the
9237 * entirety of the operation, so that has to be done separately as well.
9238 * Then there is the orphan item, which does indeed need to be held on
9239 * to for the whole operation, and we need nobody to touch this reserved
9240 * space except the orphan code.
9242 * So that leaves us with
9244 * 1) root->orphan_block_rsv - for the orphan deletion.
9245 * 2) rsv - for the truncate reservation, which we will steal from the
9246 * transaction reservation.
9247 * 3) fs_info->trans_block_rsv - this will have 1 items worth left for
9248 * updating the inode.
9250 rsv
= btrfs_alloc_block_rsv(fs_info
, BTRFS_BLOCK_RSV_TEMP
);
9253 rsv
->size
= min_size
;
9257 * 1 for the truncate slack space
9258 * 1 for updating the inode.
9260 trans
= btrfs_start_transaction(root
, 2);
9261 if (IS_ERR(trans
)) {
9262 err
= PTR_ERR(trans
);
9266 /* Migrate the slack space for the truncate to our reserve */
9267 ret
= btrfs_block_rsv_migrate(&fs_info
->trans_block_rsv
, rsv
,
9272 * So if we truncate and then write and fsync we normally would just
9273 * write the extents that changed, which is a problem if we need to
9274 * first truncate that entire inode. So set this flag so we write out
9275 * all of the extents in the inode to the sync log so we're completely
9278 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC
, &BTRFS_I(inode
)->runtime_flags
);
9279 trans
->block_rsv
= rsv
;
9282 ret
= btrfs_truncate_inode_items(trans
, root
, inode
,
9284 BTRFS_EXTENT_DATA_KEY
);
9285 if (ret
!= -ENOSPC
&& ret
!= -EAGAIN
) {
9290 trans
->block_rsv
= &fs_info
->trans_block_rsv
;
9291 ret
= btrfs_update_inode(trans
, root
, inode
);
9297 btrfs_end_transaction(trans
);
9298 btrfs_btree_balance_dirty(fs_info
);
9300 trans
= btrfs_start_transaction(root
, 2);
9301 if (IS_ERR(trans
)) {
9302 ret
= err
= PTR_ERR(trans
);
9307 btrfs_block_rsv_release(fs_info
, rsv
, -1);
9308 ret
= btrfs_block_rsv_migrate(&fs_info
->trans_block_rsv
,
9310 BUG_ON(ret
); /* shouldn't happen */
9311 trans
->block_rsv
= rsv
;
9314 if (ret
== 0 && inode
->i_nlink
> 0) {
9315 trans
->block_rsv
= root
->orphan_block_rsv
;
9316 ret
= btrfs_orphan_del(trans
, BTRFS_I(inode
));
9322 trans
->block_rsv
= &fs_info
->trans_block_rsv
;
9323 ret
= btrfs_update_inode(trans
, root
, inode
);
9327 ret
= btrfs_end_transaction(trans
);
9328 btrfs_btree_balance_dirty(fs_info
);
9331 btrfs_free_block_rsv(fs_info
, rsv
);
9340 * create a new subvolume directory/inode (helper for the ioctl).
9342 int btrfs_create_subvol_root(struct btrfs_trans_handle
*trans
,
9343 struct btrfs_root
*new_root
,
9344 struct btrfs_root
*parent_root
,
9347 struct inode
*inode
;
9351 inode
= btrfs_new_inode(trans
, new_root
, NULL
, "..", 2,
9352 new_dirid
, new_dirid
,
9353 S_IFDIR
| (~current_umask() & S_IRWXUGO
),
9356 return PTR_ERR(inode
);
9357 inode
->i_op
= &btrfs_dir_inode_operations
;
9358 inode
->i_fop
= &btrfs_dir_file_operations
;
9360 set_nlink(inode
, 1);
9361 btrfs_i_size_write(BTRFS_I(inode
), 0);
9362 unlock_new_inode(inode
);
9364 err
= btrfs_subvol_inherit_props(trans
, new_root
, parent_root
);
9366 btrfs_err(new_root
->fs_info
,
9367 "error inheriting subvolume %llu properties: %d",
9368 new_root
->root_key
.objectid
, err
);
9370 err
= btrfs_update_inode(trans
, new_root
, inode
);
9376 struct inode
*btrfs_alloc_inode(struct super_block
*sb
)
9378 struct btrfs_inode
*ei
;
9379 struct inode
*inode
;
9381 ei
= kmem_cache_alloc(btrfs_inode_cachep
, GFP_NOFS
);
9388 ei
->last_sub_trans
= 0;
9389 ei
->logged_trans
= 0;
9390 ei
->delalloc_bytes
= 0;
9391 ei
->new_delalloc_bytes
= 0;
9392 ei
->defrag_bytes
= 0;
9393 ei
->disk_i_size
= 0;
9396 ei
->index_cnt
= (u64
)-1;
9398 ei
->last_unlink_trans
= 0;
9399 ei
->last_log_commit
= 0;
9400 ei
->delayed_iput_count
= 0;
9402 spin_lock_init(&ei
->lock
);
9403 ei
->outstanding_extents
= 0;
9404 ei
->reserved_extents
= 0;
9406 ei
->runtime_flags
= 0;
9407 ei
->force_compress
= BTRFS_COMPRESS_NONE
;
9409 ei
->delayed_node
= NULL
;
9411 ei
->i_otime
.tv_sec
= 0;
9412 ei
->i_otime
.tv_nsec
= 0;
9414 inode
= &ei
->vfs_inode
;
9415 extent_map_tree_init(&ei
->extent_tree
);
9416 extent_io_tree_init(&ei
->io_tree
, inode
);
9417 extent_io_tree_init(&ei
->io_failure_tree
, inode
);
9418 ei
->io_tree
.track_uptodate
= 1;
9419 ei
->io_failure_tree
.track_uptodate
= 1;
9420 atomic_set(&ei
->sync_writers
, 0);
9421 mutex_init(&ei
->log_mutex
);
9422 mutex_init(&ei
->delalloc_mutex
);
9423 btrfs_ordered_inode_tree_init(&ei
->ordered_tree
);
9424 INIT_LIST_HEAD(&ei
->delalloc_inodes
);
9425 INIT_LIST_HEAD(&ei
->delayed_iput
);
9426 RB_CLEAR_NODE(&ei
->rb_node
);
9427 init_rwsem(&ei
->dio_sem
);
9432 #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
9433 void btrfs_test_destroy_inode(struct inode
*inode
)
9435 btrfs_drop_extent_cache(BTRFS_I(inode
), 0, (u64
)-1, 0);
9436 kmem_cache_free(btrfs_inode_cachep
, BTRFS_I(inode
));
9440 static void btrfs_i_callback(struct rcu_head
*head
)
9442 struct inode
*inode
= container_of(head
, struct inode
, i_rcu
);
9443 kmem_cache_free(btrfs_inode_cachep
, BTRFS_I(inode
));
9446 void btrfs_destroy_inode(struct inode
*inode
)
9448 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
9449 struct btrfs_ordered_extent
*ordered
;
9450 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
9452 WARN_ON(!hlist_empty(&inode
->i_dentry
));
9453 WARN_ON(inode
->i_data
.nrpages
);
9454 WARN_ON(BTRFS_I(inode
)->outstanding_extents
);
9455 WARN_ON(BTRFS_I(inode
)->reserved_extents
);
9456 WARN_ON(BTRFS_I(inode
)->delalloc_bytes
);
9457 WARN_ON(BTRFS_I(inode
)->new_delalloc_bytes
);
9458 WARN_ON(BTRFS_I(inode
)->csum_bytes
);
9459 WARN_ON(BTRFS_I(inode
)->defrag_bytes
);
9462 * This can happen where we create an inode, but somebody else also
9463 * created the same inode and we need to destroy the one we already
9469 if (test_bit(BTRFS_INODE_HAS_ORPHAN_ITEM
,
9470 &BTRFS_I(inode
)->runtime_flags
)) {
9471 btrfs_info(fs_info
, "inode %llu still on the orphan list",
9472 btrfs_ino(BTRFS_I(inode
)));
9473 atomic_dec(&root
->orphan_inodes
);
9477 ordered
= btrfs_lookup_first_ordered_extent(inode
, (u64
)-1);
9482 "found ordered extent %llu %llu on inode cleanup",
9483 ordered
->file_offset
, ordered
->len
);
9484 btrfs_remove_ordered_extent(inode
, ordered
);
9485 btrfs_put_ordered_extent(ordered
);
9486 btrfs_put_ordered_extent(ordered
);
9489 btrfs_qgroup_check_reserved_leak(inode
);
9490 inode_tree_del(inode
);
9491 btrfs_drop_extent_cache(BTRFS_I(inode
), 0, (u64
)-1, 0);
9493 call_rcu(&inode
->i_rcu
, btrfs_i_callback
);
9496 int btrfs_drop_inode(struct inode
*inode
)
9498 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
9503 /* the snap/subvol tree is on deleting */
9504 if (btrfs_root_refs(&root
->root_item
) == 0)
9507 return generic_drop_inode(inode
);
9510 static void init_once(void *foo
)
9512 struct btrfs_inode
*ei
= (struct btrfs_inode
*) foo
;
9514 inode_init_once(&ei
->vfs_inode
);
9517 void btrfs_destroy_cachep(void)
9520 * Make sure all delayed rcu free inodes are flushed before we
9524 kmem_cache_destroy(btrfs_inode_cachep
);
9525 kmem_cache_destroy(btrfs_trans_handle_cachep
);
9526 kmem_cache_destroy(btrfs_path_cachep
);
9527 kmem_cache_destroy(btrfs_free_space_cachep
);
9530 int btrfs_init_cachep(void)
9532 btrfs_inode_cachep
= kmem_cache_create("btrfs_inode",
9533 sizeof(struct btrfs_inode
), 0,
9534 SLAB_RECLAIM_ACCOUNT
| SLAB_MEM_SPREAD
| SLAB_ACCOUNT
,
9536 if (!btrfs_inode_cachep
)
9539 btrfs_trans_handle_cachep
= kmem_cache_create("btrfs_trans_handle",
9540 sizeof(struct btrfs_trans_handle
), 0,
9541 SLAB_TEMPORARY
| SLAB_MEM_SPREAD
, NULL
);
9542 if (!btrfs_trans_handle_cachep
)
9545 btrfs_path_cachep
= kmem_cache_create("btrfs_path",
9546 sizeof(struct btrfs_path
), 0,
9547 SLAB_MEM_SPREAD
, NULL
);
9548 if (!btrfs_path_cachep
)
9551 btrfs_free_space_cachep
= kmem_cache_create("btrfs_free_space",
9552 sizeof(struct btrfs_free_space
), 0,
9553 SLAB_MEM_SPREAD
, NULL
);
9554 if (!btrfs_free_space_cachep
)
9559 btrfs_destroy_cachep();
9563 static int btrfs_getattr(const struct path
*path
, struct kstat
*stat
,
9564 u32 request_mask
, unsigned int flags
)
9567 struct inode
*inode
= d_inode(path
->dentry
);
9568 u32 blocksize
= inode
->i_sb
->s_blocksize
;
9569 u32 bi_flags
= BTRFS_I(inode
)->flags
;
9571 stat
->result_mask
|= STATX_BTIME
;
9572 stat
->btime
.tv_sec
= BTRFS_I(inode
)->i_otime
.tv_sec
;
9573 stat
->btime
.tv_nsec
= BTRFS_I(inode
)->i_otime
.tv_nsec
;
9574 if (bi_flags
& BTRFS_INODE_APPEND
)
9575 stat
->attributes
|= STATX_ATTR_APPEND
;
9576 if (bi_flags
& BTRFS_INODE_COMPRESS
)
9577 stat
->attributes
|= STATX_ATTR_COMPRESSED
;
9578 if (bi_flags
& BTRFS_INODE_IMMUTABLE
)
9579 stat
->attributes
|= STATX_ATTR_IMMUTABLE
;
9580 if (bi_flags
& BTRFS_INODE_NODUMP
)
9581 stat
->attributes
|= STATX_ATTR_NODUMP
;
9583 stat
->attributes_mask
|= (STATX_ATTR_APPEND
|
9584 STATX_ATTR_COMPRESSED
|
9585 STATX_ATTR_IMMUTABLE
|
9588 generic_fillattr(inode
, stat
);
9589 stat
->dev
= BTRFS_I(inode
)->root
->anon_dev
;
9591 spin_lock(&BTRFS_I(inode
)->lock
);
9592 delalloc_bytes
= BTRFS_I(inode
)->new_delalloc_bytes
;
9593 spin_unlock(&BTRFS_I(inode
)->lock
);
9594 stat
->blocks
= (ALIGN(inode_get_bytes(inode
), blocksize
) +
9595 ALIGN(delalloc_bytes
, blocksize
)) >> 9;
9599 static int btrfs_rename_exchange(struct inode
*old_dir
,
9600 struct dentry
*old_dentry
,
9601 struct inode
*new_dir
,
9602 struct dentry
*new_dentry
)
9604 struct btrfs_fs_info
*fs_info
= btrfs_sb(old_dir
->i_sb
);
9605 struct btrfs_trans_handle
*trans
;
9606 struct btrfs_root
*root
= BTRFS_I(old_dir
)->root
;
9607 struct btrfs_root
*dest
= BTRFS_I(new_dir
)->root
;
9608 struct inode
*new_inode
= new_dentry
->d_inode
;
9609 struct inode
*old_inode
= old_dentry
->d_inode
;
9610 struct timespec ctime
= current_time(old_inode
);
9611 struct dentry
*parent
;
9612 u64 old_ino
= btrfs_ino(BTRFS_I(old_inode
));
9613 u64 new_ino
= btrfs_ino(BTRFS_I(new_inode
));
9618 bool root_log_pinned
= false;
9619 bool dest_log_pinned
= false;
9621 /* we only allow rename subvolume link between subvolumes */
9622 if (old_ino
!= BTRFS_FIRST_FREE_OBJECTID
&& root
!= dest
)
9625 /* close the race window with snapshot create/destroy ioctl */
9626 if (old_ino
== BTRFS_FIRST_FREE_OBJECTID
)
9627 down_read(&fs_info
->subvol_sem
);
9628 if (new_ino
== BTRFS_FIRST_FREE_OBJECTID
)
9629 down_read(&fs_info
->subvol_sem
);
9632 * We want to reserve the absolute worst case amount of items. So if
9633 * both inodes are subvols and we need to unlink them then that would
9634 * require 4 item modifications, but if they are both normal inodes it
9635 * would require 5 item modifications, so we'll assume their normal
9636 * inodes. So 5 * 2 is 10, plus 2 for the new links, so 12 total items
9637 * should cover the worst case number of items we'll modify.
9639 trans
= btrfs_start_transaction(root
, 12);
9640 if (IS_ERR(trans
)) {
9641 ret
= PTR_ERR(trans
);
9646 * We need to find a free sequence number both in the source and
9647 * in the destination directory for the exchange.
9649 ret
= btrfs_set_inode_index(BTRFS_I(new_dir
), &old_idx
);
9652 ret
= btrfs_set_inode_index(BTRFS_I(old_dir
), &new_idx
);
9656 BTRFS_I(old_inode
)->dir_index
= 0ULL;
9657 BTRFS_I(new_inode
)->dir_index
= 0ULL;
9659 /* Reference for the source. */
9660 if (old_ino
== BTRFS_FIRST_FREE_OBJECTID
) {
9661 /* force full log commit if subvolume involved. */
9662 btrfs_set_log_full_commit(fs_info
, trans
);
9664 btrfs_pin_log_trans(root
);
9665 root_log_pinned
= true;
9666 ret
= btrfs_insert_inode_ref(trans
, dest
,
9667 new_dentry
->d_name
.name
,
9668 new_dentry
->d_name
.len
,
9670 btrfs_ino(BTRFS_I(new_dir
)),
9676 /* And now for the dest. */
9677 if (new_ino
== BTRFS_FIRST_FREE_OBJECTID
) {
9678 /* force full log commit if subvolume involved. */
9679 btrfs_set_log_full_commit(fs_info
, trans
);
9681 btrfs_pin_log_trans(dest
);
9682 dest_log_pinned
= true;
9683 ret
= btrfs_insert_inode_ref(trans
, root
,
9684 old_dentry
->d_name
.name
,
9685 old_dentry
->d_name
.len
,
9687 btrfs_ino(BTRFS_I(old_dir
)),
9693 /* Update inode version and ctime/mtime. */
9694 inode_inc_iversion(old_dir
);
9695 inode_inc_iversion(new_dir
);
9696 inode_inc_iversion(old_inode
);
9697 inode_inc_iversion(new_inode
);
9698 old_dir
->i_ctime
= old_dir
->i_mtime
= ctime
;
9699 new_dir
->i_ctime
= new_dir
->i_mtime
= ctime
;
9700 old_inode
->i_ctime
= ctime
;
9701 new_inode
->i_ctime
= ctime
;
9703 if (old_dentry
->d_parent
!= new_dentry
->d_parent
) {
9704 btrfs_record_unlink_dir(trans
, BTRFS_I(old_dir
),
9705 BTRFS_I(old_inode
), 1);
9706 btrfs_record_unlink_dir(trans
, BTRFS_I(new_dir
),
9707 BTRFS_I(new_inode
), 1);
9710 /* src is a subvolume */
9711 if (old_ino
== BTRFS_FIRST_FREE_OBJECTID
) {
9712 root_objectid
= BTRFS_I(old_inode
)->root
->root_key
.objectid
;
9713 ret
= btrfs_unlink_subvol(trans
, root
, old_dir
,
9715 old_dentry
->d_name
.name
,
9716 old_dentry
->d_name
.len
);
9717 } else { /* src is an inode */
9718 ret
= __btrfs_unlink_inode(trans
, root
, BTRFS_I(old_dir
),
9719 BTRFS_I(old_dentry
->d_inode
),
9720 old_dentry
->d_name
.name
,
9721 old_dentry
->d_name
.len
);
9723 ret
= btrfs_update_inode(trans
, root
, old_inode
);
9726 btrfs_abort_transaction(trans
, ret
);
9730 /* dest is a subvolume */
9731 if (new_ino
== BTRFS_FIRST_FREE_OBJECTID
) {
9732 root_objectid
= BTRFS_I(new_inode
)->root
->root_key
.objectid
;
9733 ret
= btrfs_unlink_subvol(trans
, dest
, new_dir
,
9735 new_dentry
->d_name
.name
,
9736 new_dentry
->d_name
.len
);
9737 } else { /* dest is an inode */
9738 ret
= __btrfs_unlink_inode(trans
, dest
, BTRFS_I(new_dir
),
9739 BTRFS_I(new_dentry
->d_inode
),
9740 new_dentry
->d_name
.name
,
9741 new_dentry
->d_name
.len
);
9743 ret
= btrfs_update_inode(trans
, dest
, new_inode
);
9746 btrfs_abort_transaction(trans
, ret
);
9750 ret
= btrfs_add_link(trans
, BTRFS_I(new_dir
), BTRFS_I(old_inode
),
9751 new_dentry
->d_name
.name
,
9752 new_dentry
->d_name
.len
, 0, old_idx
);
9754 btrfs_abort_transaction(trans
, ret
);
9758 ret
= btrfs_add_link(trans
, BTRFS_I(old_dir
), BTRFS_I(new_inode
),
9759 old_dentry
->d_name
.name
,
9760 old_dentry
->d_name
.len
, 0, new_idx
);
9762 btrfs_abort_transaction(trans
, ret
);
9766 if (old_inode
->i_nlink
== 1)
9767 BTRFS_I(old_inode
)->dir_index
= old_idx
;
9768 if (new_inode
->i_nlink
== 1)
9769 BTRFS_I(new_inode
)->dir_index
= new_idx
;
9771 if (root_log_pinned
) {
9772 parent
= new_dentry
->d_parent
;
9773 btrfs_log_new_name(trans
, BTRFS_I(old_inode
), BTRFS_I(old_dir
),
9775 btrfs_end_log_trans(root
);
9776 root_log_pinned
= false;
9778 if (dest_log_pinned
) {
9779 parent
= old_dentry
->d_parent
;
9780 btrfs_log_new_name(trans
, BTRFS_I(new_inode
), BTRFS_I(new_dir
),
9782 btrfs_end_log_trans(dest
);
9783 dest_log_pinned
= false;
9787 * If we have pinned a log and an error happened, we unpin tasks
9788 * trying to sync the log and force them to fallback to a transaction
9789 * commit if the log currently contains any of the inodes involved in
9790 * this rename operation (to ensure we do not persist a log with an
9791 * inconsistent state for any of these inodes or leading to any
9792 * inconsistencies when replayed). If the transaction was aborted, the
9793 * abortion reason is propagated to userspace when attempting to commit
9794 * the transaction. If the log does not contain any of these inodes, we
9795 * allow the tasks to sync it.
9797 if (ret
&& (root_log_pinned
|| dest_log_pinned
)) {
9798 if (btrfs_inode_in_log(BTRFS_I(old_dir
), fs_info
->generation
) ||
9799 btrfs_inode_in_log(BTRFS_I(new_dir
), fs_info
->generation
) ||
9800 btrfs_inode_in_log(BTRFS_I(old_inode
), fs_info
->generation
) ||
9802 btrfs_inode_in_log(BTRFS_I(new_inode
), fs_info
->generation
)))
9803 btrfs_set_log_full_commit(fs_info
, trans
);
9805 if (root_log_pinned
) {
9806 btrfs_end_log_trans(root
);
9807 root_log_pinned
= false;
9809 if (dest_log_pinned
) {
9810 btrfs_end_log_trans(dest
);
9811 dest_log_pinned
= false;
9814 ret
= btrfs_end_transaction(trans
);
9816 if (new_ino
== BTRFS_FIRST_FREE_OBJECTID
)
9817 up_read(&fs_info
->subvol_sem
);
9818 if (old_ino
== BTRFS_FIRST_FREE_OBJECTID
)
9819 up_read(&fs_info
->subvol_sem
);
9824 static int btrfs_whiteout_for_rename(struct btrfs_trans_handle
*trans
,
9825 struct btrfs_root
*root
,
9827 struct dentry
*dentry
)
9830 struct inode
*inode
;
9834 ret
= btrfs_find_free_ino(root
, &objectid
);
9838 inode
= btrfs_new_inode(trans
, root
, dir
,
9839 dentry
->d_name
.name
,
9841 btrfs_ino(BTRFS_I(dir
)),
9843 S_IFCHR
| WHITEOUT_MODE
,
9846 if (IS_ERR(inode
)) {
9847 ret
= PTR_ERR(inode
);
9851 inode
->i_op
= &btrfs_special_inode_operations
;
9852 init_special_inode(inode
, inode
->i_mode
,
9855 ret
= btrfs_init_inode_security(trans
, inode
, dir
,
9860 ret
= btrfs_add_nondir(trans
, BTRFS_I(dir
), dentry
,
9861 BTRFS_I(inode
), 0, index
);
9865 ret
= btrfs_update_inode(trans
, root
, inode
);
9867 unlock_new_inode(inode
);
9869 inode_dec_link_count(inode
);
9875 static int btrfs_rename(struct inode
*old_dir
, struct dentry
*old_dentry
,
9876 struct inode
*new_dir
, struct dentry
*new_dentry
,
9879 struct btrfs_fs_info
*fs_info
= btrfs_sb(old_dir
->i_sb
);
9880 struct btrfs_trans_handle
*trans
;
9881 unsigned int trans_num_items
;
9882 struct btrfs_root
*root
= BTRFS_I(old_dir
)->root
;
9883 struct btrfs_root
*dest
= BTRFS_I(new_dir
)->root
;
9884 struct inode
*new_inode
= d_inode(new_dentry
);
9885 struct inode
*old_inode
= d_inode(old_dentry
);
9889 u64 old_ino
= btrfs_ino(BTRFS_I(old_inode
));
9890 bool log_pinned
= false;
9892 if (btrfs_ino(BTRFS_I(new_dir
)) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID
)
9895 /* we only allow rename subvolume link between subvolumes */
9896 if (old_ino
!= BTRFS_FIRST_FREE_OBJECTID
&& root
!= dest
)
9899 if (old_ino
== BTRFS_EMPTY_SUBVOL_DIR_OBJECTID
||
9900 (new_inode
&& btrfs_ino(BTRFS_I(new_inode
)) == BTRFS_FIRST_FREE_OBJECTID
))
9903 if (S_ISDIR(old_inode
->i_mode
) && new_inode
&&
9904 new_inode
->i_size
> BTRFS_EMPTY_DIR_SIZE
)
9908 /* check for collisions, even if the name isn't there */
9909 ret
= btrfs_check_dir_item_collision(dest
, new_dir
->i_ino
,
9910 new_dentry
->d_name
.name
,
9911 new_dentry
->d_name
.len
);
9914 if (ret
== -EEXIST
) {
9916 * eexist without a new_inode */
9917 if (WARN_ON(!new_inode
)) {
9921 /* maybe -EOVERFLOW */
9928 * we're using rename to replace one file with another. Start IO on it
9929 * now so we don't add too much work to the end of the transaction
9931 if (new_inode
&& S_ISREG(old_inode
->i_mode
) && new_inode
->i_size
)
9932 filemap_flush(old_inode
->i_mapping
);
9934 /* close the racy window with snapshot create/destroy ioctl */
9935 if (old_ino
== BTRFS_FIRST_FREE_OBJECTID
)
9936 down_read(&fs_info
->subvol_sem
);
9938 * We want to reserve the absolute worst case amount of items. So if
9939 * both inodes are subvols and we need to unlink them then that would
9940 * require 4 item modifications, but if they are both normal inodes it
9941 * would require 5 item modifications, so we'll assume they are normal
9942 * inodes. So 5 * 2 is 10, plus 1 for the new link, so 11 total items
9943 * should cover the worst case number of items we'll modify.
9944 * If our rename has the whiteout flag, we need more 5 units for the
9945 * new inode (1 inode item, 1 inode ref, 2 dir items and 1 xattr item
9946 * when selinux is enabled).
9948 trans_num_items
= 11;
9949 if (flags
& RENAME_WHITEOUT
)
9950 trans_num_items
+= 5;
9951 trans
= btrfs_start_transaction(root
, trans_num_items
);
9952 if (IS_ERR(trans
)) {
9953 ret
= PTR_ERR(trans
);
9958 btrfs_record_root_in_trans(trans
, dest
);
9960 ret
= btrfs_set_inode_index(BTRFS_I(new_dir
), &index
);
9964 BTRFS_I(old_inode
)->dir_index
= 0ULL;
9965 if (unlikely(old_ino
== BTRFS_FIRST_FREE_OBJECTID
)) {
9966 /* force full log commit if subvolume involved. */
9967 btrfs_set_log_full_commit(fs_info
, trans
);
9969 btrfs_pin_log_trans(root
);
9971 ret
= btrfs_insert_inode_ref(trans
, dest
,
9972 new_dentry
->d_name
.name
,
9973 new_dentry
->d_name
.len
,
9975 btrfs_ino(BTRFS_I(new_dir
)), index
);
9980 inode_inc_iversion(old_dir
);
9981 inode_inc_iversion(new_dir
);
9982 inode_inc_iversion(old_inode
);
9983 old_dir
->i_ctime
= old_dir
->i_mtime
=
9984 new_dir
->i_ctime
= new_dir
->i_mtime
=
9985 old_inode
->i_ctime
= current_time(old_dir
);
9987 if (old_dentry
->d_parent
!= new_dentry
->d_parent
)
9988 btrfs_record_unlink_dir(trans
, BTRFS_I(old_dir
),
9989 BTRFS_I(old_inode
), 1);
9991 if (unlikely(old_ino
== BTRFS_FIRST_FREE_OBJECTID
)) {
9992 root_objectid
= BTRFS_I(old_inode
)->root
->root_key
.objectid
;
9993 ret
= btrfs_unlink_subvol(trans
, root
, old_dir
, root_objectid
,
9994 old_dentry
->d_name
.name
,
9995 old_dentry
->d_name
.len
);
9997 ret
= __btrfs_unlink_inode(trans
, root
, BTRFS_I(old_dir
),
9998 BTRFS_I(d_inode(old_dentry
)),
9999 old_dentry
->d_name
.name
,
10000 old_dentry
->d_name
.len
);
10002 ret
= btrfs_update_inode(trans
, root
, old_inode
);
10005 btrfs_abort_transaction(trans
, ret
);
10010 inode_inc_iversion(new_inode
);
10011 new_inode
->i_ctime
= current_time(new_inode
);
10012 if (unlikely(btrfs_ino(BTRFS_I(new_inode
)) ==
10013 BTRFS_EMPTY_SUBVOL_DIR_OBJECTID
)) {
10014 root_objectid
= BTRFS_I(new_inode
)->location
.objectid
;
10015 ret
= btrfs_unlink_subvol(trans
, dest
, new_dir
,
10017 new_dentry
->d_name
.name
,
10018 new_dentry
->d_name
.len
);
10019 BUG_ON(new_inode
->i_nlink
== 0);
10021 ret
= btrfs_unlink_inode(trans
, dest
, BTRFS_I(new_dir
),
10022 BTRFS_I(d_inode(new_dentry
)),
10023 new_dentry
->d_name
.name
,
10024 new_dentry
->d_name
.len
);
10026 if (!ret
&& new_inode
->i_nlink
== 0)
10027 ret
= btrfs_orphan_add(trans
,
10028 BTRFS_I(d_inode(new_dentry
)));
10030 btrfs_abort_transaction(trans
, ret
);
10035 ret
= btrfs_add_link(trans
, BTRFS_I(new_dir
), BTRFS_I(old_inode
),
10036 new_dentry
->d_name
.name
,
10037 new_dentry
->d_name
.len
, 0, index
);
10039 btrfs_abort_transaction(trans
, ret
);
10043 if (old_inode
->i_nlink
== 1)
10044 BTRFS_I(old_inode
)->dir_index
= index
;
10047 struct dentry
*parent
= new_dentry
->d_parent
;
10049 btrfs_log_new_name(trans
, BTRFS_I(old_inode
), BTRFS_I(old_dir
),
10051 btrfs_end_log_trans(root
);
10052 log_pinned
= false;
10055 if (flags
& RENAME_WHITEOUT
) {
10056 ret
= btrfs_whiteout_for_rename(trans
, root
, old_dir
,
10060 btrfs_abort_transaction(trans
, ret
);
10066 * If we have pinned the log and an error happened, we unpin tasks
10067 * trying to sync the log and force them to fallback to a transaction
10068 * commit if the log currently contains any of the inodes involved in
10069 * this rename operation (to ensure we do not persist a log with an
10070 * inconsistent state for any of these inodes or leading to any
10071 * inconsistencies when replayed). If the transaction was aborted, the
10072 * abortion reason is propagated to userspace when attempting to commit
10073 * the transaction. If the log does not contain any of these inodes, we
10074 * allow the tasks to sync it.
10076 if (ret
&& log_pinned
) {
10077 if (btrfs_inode_in_log(BTRFS_I(old_dir
), fs_info
->generation
) ||
10078 btrfs_inode_in_log(BTRFS_I(new_dir
), fs_info
->generation
) ||
10079 btrfs_inode_in_log(BTRFS_I(old_inode
), fs_info
->generation
) ||
10081 btrfs_inode_in_log(BTRFS_I(new_inode
), fs_info
->generation
)))
10082 btrfs_set_log_full_commit(fs_info
, trans
);
10084 btrfs_end_log_trans(root
);
10085 log_pinned
= false;
10087 btrfs_end_transaction(trans
);
10089 if (old_ino
== BTRFS_FIRST_FREE_OBJECTID
)
10090 up_read(&fs_info
->subvol_sem
);
10095 static int btrfs_rename2(struct inode
*old_dir
, struct dentry
*old_dentry
,
10096 struct inode
*new_dir
, struct dentry
*new_dentry
,
10097 unsigned int flags
)
10099 if (flags
& ~(RENAME_NOREPLACE
| RENAME_EXCHANGE
| RENAME_WHITEOUT
))
10102 if (flags
& RENAME_EXCHANGE
)
10103 return btrfs_rename_exchange(old_dir
, old_dentry
, new_dir
,
10106 return btrfs_rename(old_dir
, old_dentry
, new_dir
, new_dentry
, flags
);
10109 static void btrfs_run_delalloc_work(struct btrfs_work
*work
)
10111 struct btrfs_delalloc_work
*delalloc_work
;
10112 struct inode
*inode
;
10114 delalloc_work
= container_of(work
, struct btrfs_delalloc_work
,
10116 inode
= delalloc_work
->inode
;
10117 filemap_flush(inode
->i_mapping
);
10118 if (test_bit(BTRFS_INODE_HAS_ASYNC_EXTENT
,
10119 &BTRFS_I(inode
)->runtime_flags
))
10120 filemap_flush(inode
->i_mapping
);
10122 if (delalloc_work
->delay_iput
)
10123 btrfs_add_delayed_iput(inode
);
10126 complete(&delalloc_work
->completion
);
10129 struct btrfs_delalloc_work
*btrfs_alloc_delalloc_work(struct inode
*inode
,
10132 struct btrfs_delalloc_work
*work
;
10134 work
= kmalloc(sizeof(*work
), GFP_NOFS
);
10138 init_completion(&work
->completion
);
10139 INIT_LIST_HEAD(&work
->list
);
10140 work
->inode
= inode
;
10141 work
->delay_iput
= delay_iput
;
10142 WARN_ON_ONCE(!inode
);
10143 btrfs_init_work(&work
->work
, btrfs_flush_delalloc_helper
,
10144 btrfs_run_delalloc_work
, NULL
, NULL
);
10149 void btrfs_wait_and_free_delalloc_work(struct btrfs_delalloc_work
*work
)
10151 wait_for_completion(&work
->completion
);
10156 * some fairly slow code that needs optimization. This walks the list
10157 * of all the inodes with pending delalloc and forces them to disk.
10159 static int __start_delalloc_inodes(struct btrfs_root
*root
, int delay_iput
,
10162 struct btrfs_inode
*binode
;
10163 struct inode
*inode
;
10164 struct btrfs_delalloc_work
*work
, *next
;
10165 struct list_head works
;
10166 struct list_head splice
;
10169 INIT_LIST_HEAD(&works
);
10170 INIT_LIST_HEAD(&splice
);
10172 mutex_lock(&root
->delalloc_mutex
);
10173 spin_lock(&root
->delalloc_lock
);
10174 list_splice_init(&root
->delalloc_inodes
, &splice
);
10175 while (!list_empty(&splice
)) {
10176 binode
= list_entry(splice
.next
, struct btrfs_inode
,
10179 list_move_tail(&binode
->delalloc_inodes
,
10180 &root
->delalloc_inodes
);
10181 inode
= igrab(&binode
->vfs_inode
);
10183 cond_resched_lock(&root
->delalloc_lock
);
10186 spin_unlock(&root
->delalloc_lock
);
10188 work
= btrfs_alloc_delalloc_work(inode
, delay_iput
);
10191 btrfs_add_delayed_iput(inode
);
10197 list_add_tail(&work
->list
, &works
);
10198 btrfs_queue_work(root
->fs_info
->flush_workers
,
10201 if (nr
!= -1 && ret
>= nr
)
10204 spin_lock(&root
->delalloc_lock
);
10206 spin_unlock(&root
->delalloc_lock
);
10209 list_for_each_entry_safe(work
, next
, &works
, list
) {
10210 list_del_init(&work
->list
);
10211 btrfs_wait_and_free_delalloc_work(work
);
10214 if (!list_empty_careful(&splice
)) {
10215 spin_lock(&root
->delalloc_lock
);
10216 list_splice_tail(&splice
, &root
->delalloc_inodes
);
10217 spin_unlock(&root
->delalloc_lock
);
10219 mutex_unlock(&root
->delalloc_mutex
);
10223 int btrfs_start_delalloc_inodes(struct btrfs_root
*root
, int delay_iput
)
10225 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
10228 if (test_bit(BTRFS_FS_STATE_ERROR
, &fs_info
->fs_state
))
10231 ret
= __start_delalloc_inodes(root
, delay_iput
, -1);
10235 * the filemap_flush will queue IO into the worker threads, but
10236 * we have to make sure the IO is actually started and that
10237 * ordered extents get created before we return
10239 atomic_inc(&fs_info
->async_submit_draining
);
10240 while (atomic_read(&fs_info
->nr_async_submits
) ||
10241 atomic_read(&fs_info
->async_delalloc_pages
)) {
10242 wait_event(fs_info
->async_submit_wait
,
10243 (atomic_read(&fs_info
->nr_async_submits
) == 0 &&
10244 atomic_read(&fs_info
->async_delalloc_pages
) == 0));
10246 atomic_dec(&fs_info
->async_submit_draining
);
10250 int btrfs_start_delalloc_roots(struct btrfs_fs_info
*fs_info
, int delay_iput
,
10253 struct btrfs_root
*root
;
10254 struct list_head splice
;
10257 if (test_bit(BTRFS_FS_STATE_ERROR
, &fs_info
->fs_state
))
10260 INIT_LIST_HEAD(&splice
);
10262 mutex_lock(&fs_info
->delalloc_root_mutex
);
10263 spin_lock(&fs_info
->delalloc_root_lock
);
10264 list_splice_init(&fs_info
->delalloc_roots
, &splice
);
10265 while (!list_empty(&splice
) && nr
) {
10266 root
= list_first_entry(&splice
, struct btrfs_root
,
10268 root
= btrfs_grab_fs_root(root
);
10270 list_move_tail(&root
->delalloc_root
,
10271 &fs_info
->delalloc_roots
);
10272 spin_unlock(&fs_info
->delalloc_root_lock
);
10274 ret
= __start_delalloc_inodes(root
, delay_iput
, nr
);
10275 btrfs_put_fs_root(root
);
10283 spin_lock(&fs_info
->delalloc_root_lock
);
10285 spin_unlock(&fs_info
->delalloc_root_lock
);
10288 atomic_inc(&fs_info
->async_submit_draining
);
10289 while (atomic_read(&fs_info
->nr_async_submits
) ||
10290 atomic_read(&fs_info
->async_delalloc_pages
)) {
10291 wait_event(fs_info
->async_submit_wait
,
10292 (atomic_read(&fs_info
->nr_async_submits
) == 0 &&
10293 atomic_read(&fs_info
->async_delalloc_pages
) == 0));
10295 atomic_dec(&fs_info
->async_submit_draining
);
10297 if (!list_empty_careful(&splice
)) {
10298 spin_lock(&fs_info
->delalloc_root_lock
);
10299 list_splice_tail(&splice
, &fs_info
->delalloc_roots
);
10300 spin_unlock(&fs_info
->delalloc_root_lock
);
10302 mutex_unlock(&fs_info
->delalloc_root_mutex
);
10306 static int btrfs_symlink(struct inode
*dir
, struct dentry
*dentry
,
10307 const char *symname
)
10309 struct btrfs_fs_info
*fs_info
= btrfs_sb(dir
->i_sb
);
10310 struct btrfs_trans_handle
*trans
;
10311 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
10312 struct btrfs_path
*path
;
10313 struct btrfs_key key
;
10314 struct inode
*inode
= NULL
;
10316 int drop_inode
= 0;
10322 struct btrfs_file_extent_item
*ei
;
10323 struct extent_buffer
*leaf
;
10325 name_len
= strlen(symname
);
10326 if (name_len
> BTRFS_MAX_INLINE_DATA_SIZE(fs_info
))
10327 return -ENAMETOOLONG
;
10330 * 2 items for inode item and ref
10331 * 2 items for dir items
10332 * 1 item for updating parent inode item
10333 * 1 item for the inline extent item
10334 * 1 item for xattr if selinux is on
10336 trans
= btrfs_start_transaction(root
, 7);
10338 return PTR_ERR(trans
);
10340 err
= btrfs_find_free_ino(root
, &objectid
);
10344 inode
= btrfs_new_inode(trans
, root
, dir
, dentry
->d_name
.name
,
10345 dentry
->d_name
.len
, btrfs_ino(BTRFS_I(dir
)),
10346 objectid
, S_IFLNK
|S_IRWXUGO
, &index
);
10347 if (IS_ERR(inode
)) {
10348 err
= PTR_ERR(inode
);
10353 * If the active LSM wants to access the inode during
10354 * d_instantiate it needs these. Smack checks to see
10355 * if the filesystem supports xattrs by looking at the
10358 inode
->i_fop
= &btrfs_file_operations
;
10359 inode
->i_op
= &btrfs_file_inode_operations
;
10360 inode
->i_mapping
->a_ops
= &btrfs_aops
;
10361 BTRFS_I(inode
)->io_tree
.ops
= &btrfs_extent_io_ops
;
10363 err
= btrfs_init_inode_security(trans
, inode
, dir
, &dentry
->d_name
);
10365 goto out_unlock_inode
;
10367 path
= btrfs_alloc_path();
10370 goto out_unlock_inode
;
10372 key
.objectid
= btrfs_ino(BTRFS_I(inode
));
10374 key
.type
= BTRFS_EXTENT_DATA_KEY
;
10375 datasize
= btrfs_file_extent_calc_inline_size(name_len
);
10376 err
= btrfs_insert_empty_item(trans
, root
, path
, &key
,
10379 btrfs_free_path(path
);
10380 goto out_unlock_inode
;
10382 leaf
= path
->nodes
[0];
10383 ei
= btrfs_item_ptr(leaf
, path
->slots
[0],
10384 struct btrfs_file_extent_item
);
10385 btrfs_set_file_extent_generation(leaf
, ei
, trans
->transid
);
10386 btrfs_set_file_extent_type(leaf
, ei
,
10387 BTRFS_FILE_EXTENT_INLINE
);
10388 btrfs_set_file_extent_encryption(leaf
, ei
, 0);
10389 btrfs_set_file_extent_compression(leaf
, ei
, 0);
10390 btrfs_set_file_extent_other_encoding(leaf
, ei
, 0);
10391 btrfs_set_file_extent_ram_bytes(leaf
, ei
, name_len
);
10393 ptr
= btrfs_file_extent_inline_start(ei
);
10394 write_extent_buffer(leaf
, symname
, ptr
, name_len
);
10395 btrfs_mark_buffer_dirty(leaf
);
10396 btrfs_free_path(path
);
10398 inode
->i_op
= &btrfs_symlink_inode_operations
;
10399 inode_nohighmem(inode
);
10400 inode
->i_mapping
->a_ops
= &btrfs_symlink_aops
;
10401 inode_set_bytes(inode
, name_len
);
10402 btrfs_i_size_write(BTRFS_I(inode
), name_len
);
10403 err
= btrfs_update_inode(trans
, root
, inode
);
10405 * Last step, add directory indexes for our symlink inode. This is the
10406 * last step to avoid extra cleanup of these indexes if an error happens
10410 err
= btrfs_add_nondir(trans
, BTRFS_I(dir
), dentry
,
10411 BTRFS_I(inode
), 0, index
);
10414 goto out_unlock_inode
;
10417 unlock_new_inode(inode
);
10418 d_instantiate(dentry
, inode
);
10421 btrfs_end_transaction(trans
);
10423 inode_dec_link_count(inode
);
10426 btrfs_btree_balance_dirty(fs_info
);
10431 unlock_new_inode(inode
);
10435 static int __btrfs_prealloc_file_range(struct inode
*inode
, int mode
,
10436 u64 start
, u64 num_bytes
, u64 min_size
,
10437 loff_t actual_len
, u64
*alloc_hint
,
10438 struct btrfs_trans_handle
*trans
)
10440 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
10441 struct extent_map_tree
*em_tree
= &BTRFS_I(inode
)->extent_tree
;
10442 struct extent_map
*em
;
10443 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
10444 struct btrfs_key ins
;
10445 u64 cur_offset
= start
;
10448 u64 last_alloc
= (u64
)-1;
10450 bool own_trans
= true;
10451 u64 end
= start
+ num_bytes
- 1;
10455 while (num_bytes
> 0) {
10457 trans
= btrfs_start_transaction(root
, 3);
10458 if (IS_ERR(trans
)) {
10459 ret
= PTR_ERR(trans
);
10464 cur_bytes
= min_t(u64
, num_bytes
, SZ_256M
);
10465 cur_bytes
= max(cur_bytes
, min_size
);
10467 * If we are severely fragmented we could end up with really
10468 * small allocations, so if the allocator is returning small
10469 * chunks lets make its job easier by only searching for those
10472 cur_bytes
= min(cur_bytes
, last_alloc
);
10473 ret
= btrfs_reserve_extent(root
, cur_bytes
, cur_bytes
,
10474 min_size
, 0, *alloc_hint
, &ins
, 1, 0);
10477 btrfs_end_transaction(trans
);
10480 btrfs_dec_block_group_reservations(fs_info
, ins
.objectid
);
10482 last_alloc
= ins
.offset
;
10483 ret
= insert_reserved_file_extent(trans
, inode
,
10484 cur_offset
, ins
.objectid
,
10485 ins
.offset
, ins
.offset
,
10486 ins
.offset
, 0, 0, 0,
10487 BTRFS_FILE_EXTENT_PREALLOC
);
10489 btrfs_free_reserved_extent(fs_info
, ins
.objectid
,
10491 btrfs_abort_transaction(trans
, ret
);
10493 btrfs_end_transaction(trans
);
10497 btrfs_drop_extent_cache(BTRFS_I(inode
), cur_offset
,
10498 cur_offset
+ ins
.offset
-1, 0);
10500 em
= alloc_extent_map();
10502 set_bit(BTRFS_INODE_NEEDS_FULL_SYNC
,
10503 &BTRFS_I(inode
)->runtime_flags
);
10507 em
->start
= cur_offset
;
10508 em
->orig_start
= cur_offset
;
10509 em
->len
= ins
.offset
;
10510 em
->block_start
= ins
.objectid
;
10511 em
->block_len
= ins
.offset
;
10512 em
->orig_block_len
= ins
.offset
;
10513 em
->ram_bytes
= ins
.offset
;
10514 em
->bdev
= fs_info
->fs_devices
->latest_bdev
;
10515 set_bit(EXTENT_FLAG_PREALLOC
, &em
->flags
);
10516 em
->generation
= trans
->transid
;
10519 write_lock(&em_tree
->lock
);
10520 ret
= add_extent_mapping(em_tree
, em
, 1);
10521 write_unlock(&em_tree
->lock
);
10522 if (ret
!= -EEXIST
)
10524 btrfs_drop_extent_cache(BTRFS_I(inode
), cur_offset
,
10525 cur_offset
+ ins
.offset
- 1,
10528 free_extent_map(em
);
10530 num_bytes
-= ins
.offset
;
10531 cur_offset
+= ins
.offset
;
10532 *alloc_hint
= ins
.objectid
+ ins
.offset
;
10534 inode_inc_iversion(inode
);
10535 inode
->i_ctime
= current_time(inode
);
10536 BTRFS_I(inode
)->flags
|= BTRFS_INODE_PREALLOC
;
10537 if (!(mode
& FALLOC_FL_KEEP_SIZE
) &&
10538 (actual_len
> inode
->i_size
) &&
10539 (cur_offset
> inode
->i_size
)) {
10540 if (cur_offset
> actual_len
)
10541 i_size
= actual_len
;
10543 i_size
= cur_offset
;
10544 i_size_write(inode
, i_size
);
10545 btrfs_ordered_update_i_size(inode
, i_size
, NULL
);
10548 ret
= btrfs_update_inode(trans
, root
, inode
);
10551 btrfs_abort_transaction(trans
, ret
);
10553 btrfs_end_transaction(trans
);
10558 btrfs_end_transaction(trans
);
10560 if (cur_offset
< end
)
10561 btrfs_free_reserved_data_space(inode
, NULL
, cur_offset
,
10562 end
- cur_offset
+ 1);
10566 int btrfs_prealloc_file_range(struct inode
*inode
, int mode
,
10567 u64 start
, u64 num_bytes
, u64 min_size
,
10568 loff_t actual_len
, u64
*alloc_hint
)
10570 return __btrfs_prealloc_file_range(inode
, mode
, start
, num_bytes
,
10571 min_size
, actual_len
, alloc_hint
,
10575 int btrfs_prealloc_file_range_trans(struct inode
*inode
,
10576 struct btrfs_trans_handle
*trans
, int mode
,
10577 u64 start
, u64 num_bytes
, u64 min_size
,
10578 loff_t actual_len
, u64
*alloc_hint
)
10580 return __btrfs_prealloc_file_range(inode
, mode
, start
, num_bytes
,
10581 min_size
, actual_len
, alloc_hint
, trans
);
10584 static int btrfs_set_page_dirty(struct page
*page
)
10586 return __set_page_dirty_nobuffers(page
);
10589 static int btrfs_permission(struct inode
*inode
, int mask
)
10591 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
10592 umode_t mode
= inode
->i_mode
;
10594 if (mask
& MAY_WRITE
&&
10595 (S_ISREG(mode
) || S_ISDIR(mode
) || S_ISLNK(mode
))) {
10596 if (btrfs_root_readonly(root
))
10598 if (BTRFS_I(inode
)->flags
& BTRFS_INODE_READONLY
)
10601 return generic_permission(inode
, mask
);
10604 static int btrfs_tmpfile(struct inode
*dir
, struct dentry
*dentry
, umode_t mode
)
10606 struct btrfs_fs_info
*fs_info
= btrfs_sb(dir
->i_sb
);
10607 struct btrfs_trans_handle
*trans
;
10608 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
10609 struct inode
*inode
= NULL
;
10615 * 5 units required for adding orphan entry
10617 trans
= btrfs_start_transaction(root
, 5);
10619 return PTR_ERR(trans
);
10621 ret
= btrfs_find_free_ino(root
, &objectid
);
10625 inode
= btrfs_new_inode(trans
, root
, dir
, NULL
, 0,
10626 btrfs_ino(BTRFS_I(dir
)), objectid
, mode
, &index
);
10627 if (IS_ERR(inode
)) {
10628 ret
= PTR_ERR(inode
);
10633 inode
->i_fop
= &btrfs_file_operations
;
10634 inode
->i_op
= &btrfs_file_inode_operations
;
10636 inode
->i_mapping
->a_ops
= &btrfs_aops
;
10637 BTRFS_I(inode
)->io_tree
.ops
= &btrfs_extent_io_ops
;
10639 ret
= btrfs_init_inode_security(trans
, inode
, dir
, NULL
);
10643 ret
= btrfs_update_inode(trans
, root
, inode
);
10646 ret
= btrfs_orphan_add(trans
, BTRFS_I(inode
));
10651 * We set number of links to 0 in btrfs_new_inode(), and here we set
10652 * it to 1 because d_tmpfile() will issue a warning if the count is 0,
10655 * d_tmpfile() -> inode_dec_link_count() -> drop_nlink()
10657 set_nlink(inode
, 1);
10658 unlock_new_inode(inode
);
10659 d_tmpfile(dentry
, inode
);
10660 mark_inode_dirty(inode
);
10663 btrfs_end_transaction(trans
);
10666 btrfs_balance_delayed_items(fs_info
);
10667 btrfs_btree_balance_dirty(fs_info
);
10671 unlock_new_inode(inode
);
10676 __attribute__((const))
10677 static int btrfs_readpage_io_failed_hook(struct page
*page
, int failed_mirror
)
10682 static struct btrfs_fs_info
*iotree_fs_info(void *private_data
)
10684 struct inode
*inode
= private_data
;
10685 return btrfs_sb(inode
->i_sb
);
10688 static void btrfs_check_extent_io_range(void *private_data
, const char *caller
,
10689 u64 start
, u64 end
)
10691 struct inode
*inode
= private_data
;
10694 isize
= i_size_read(inode
);
10695 if (end
>= PAGE_SIZE
&& (end
% 2) == 0 && end
!= isize
- 1) {
10696 btrfs_debug_rl(BTRFS_I(inode
)->root
->fs_info
,
10697 "%s: ino %llu isize %llu odd range [%llu,%llu]",
10698 caller
, btrfs_ino(BTRFS_I(inode
)), isize
, start
, end
);
10702 void btrfs_set_range_writeback(void *private_data
, u64 start
, u64 end
)
10704 struct inode
*inode
= private_data
;
10705 unsigned long index
= start
>> PAGE_SHIFT
;
10706 unsigned long end_index
= end
>> PAGE_SHIFT
;
10709 while (index
<= end_index
) {
10710 page
= find_get_page(inode
->i_mapping
, index
);
10711 ASSERT(page
); /* Pages should be in the extent_io_tree */
10712 set_page_writeback(page
);
10718 static const struct inode_operations btrfs_dir_inode_operations
= {
10719 .getattr
= btrfs_getattr
,
10720 .lookup
= btrfs_lookup
,
10721 .create
= btrfs_create
,
10722 .unlink
= btrfs_unlink
,
10723 .link
= btrfs_link
,
10724 .mkdir
= btrfs_mkdir
,
10725 .rmdir
= btrfs_rmdir
,
10726 .rename
= btrfs_rename2
,
10727 .symlink
= btrfs_symlink
,
10728 .setattr
= btrfs_setattr
,
10729 .mknod
= btrfs_mknod
,
10730 .listxattr
= btrfs_listxattr
,
10731 .permission
= btrfs_permission
,
10732 .get_acl
= btrfs_get_acl
,
10733 .set_acl
= btrfs_set_acl
,
10734 .update_time
= btrfs_update_time
,
10735 .tmpfile
= btrfs_tmpfile
,
10737 static const struct inode_operations btrfs_dir_ro_inode_operations
= {
10738 .lookup
= btrfs_lookup
,
10739 .permission
= btrfs_permission
,
10740 .update_time
= btrfs_update_time
,
10743 static const struct file_operations btrfs_dir_file_operations
= {
10744 .llseek
= generic_file_llseek
,
10745 .read
= generic_read_dir
,
10746 .iterate_shared
= btrfs_real_readdir
,
10747 .unlocked_ioctl
= btrfs_ioctl
,
10748 #ifdef CONFIG_COMPAT
10749 .compat_ioctl
= btrfs_compat_ioctl
,
10751 .release
= btrfs_release_file
,
10752 .fsync
= btrfs_sync_file
,
10755 static const struct extent_io_ops btrfs_extent_io_ops
= {
10756 /* mandatory callbacks */
10757 .submit_bio_hook
= btrfs_submit_bio_hook
,
10758 .readpage_end_io_hook
= btrfs_readpage_end_io_hook
,
10759 .merge_bio_hook
= btrfs_merge_bio_hook
,
10760 .readpage_io_failed_hook
= btrfs_readpage_io_failed_hook
,
10761 .tree_fs_info
= iotree_fs_info
,
10762 .set_range_writeback
= btrfs_set_range_writeback
,
10764 /* optional callbacks */
10765 .fill_delalloc
= run_delalloc_range
,
10766 .writepage_end_io_hook
= btrfs_writepage_end_io_hook
,
10767 .writepage_start_hook
= btrfs_writepage_start_hook
,
10768 .set_bit_hook
= btrfs_set_bit_hook
,
10769 .clear_bit_hook
= btrfs_clear_bit_hook
,
10770 .merge_extent_hook
= btrfs_merge_extent_hook
,
10771 .split_extent_hook
= btrfs_split_extent_hook
,
10772 .check_extent_io_range
= btrfs_check_extent_io_range
,
10776 * btrfs doesn't support the bmap operation because swapfiles
10777 * use bmap to make a mapping of extents in the file. They assume
10778 * these extents won't change over the life of the file and they
10779 * use the bmap result to do IO directly to the drive.
10781 * the btrfs bmap call would return logical addresses that aren't
10782 * suitable for IO and they also will change frequently as COW
10783 * operations happen. So, swapfile + btrfs == corruption.
10785 * For now we're avoiding this by dropping bmap.
10787 static const struct address_space_operations btrfs_aops
= {
10788 .readpage
= btrfs_readpage
,
10789 .writepage
= btrfs_writepage
,
10790 .writepages
= btrfs_writepages
,
10791 .readpages
= btrfs_readpages
,
10792 .direct_IO
= btrfs_direct_IO
,
10793 .invalidatepage
= btrfs_invalidatepage
,
10794 .releasepage
= btrfs_releasepage
,
10795 .set_page_dirty
= btrfs_set_page_dirty
,
10796 .error_remove_page
= generic_error_remove_page
,
10799 static const struct address_space_operations btrfs_symlink_aops
= {
10800 .readpage
= btrfs_readpage
,
10801 .writepage
= btrfs_writepage
,
10802 .invalidatepage
= btrfs_invalidatepage
,
10803 .releasepage
= btrfs_releasepage
,
10806 static const struct inode_operations btrfs_file_inode_operations
= {
10807 .getattr
= btrfs_getattr
,
10808 .setattr
= btrfs_setattr
,
10809 .listxattr
= btrfs_listxattr
,
10810 .permission
= btrfs_permission
,
10811 .fiemap
= btrfs_fiemap
,
10812 .get_acl
= btrfs_get_acl
,
10813 .set_acl
= btrfs_set_acl
,
10814 .update_time
= btrfs_update_time
,
10816 static const struct inode_operations btrfs_special_inode_operations
= {
10817 .getattr
= btrfs_getattr
,
10818 .setattr
= btrfs_setattr
,
10819 .permission
= btrfs_permission
,
10820 .listxattr
= btrfs_listxattr
,
10821 .get_acl
= btrfs_get_acl
,
10822 .set_acl
= btrfs_set_acl
,
10823 .update_time
= btrfs_update_time
,
10825 static const struct inode_operations btrfs_symlink_inode_operations
= {
10826 .get_link
= page_get_link
,
10827 .getattr
= btrfs_getattr
,
10828 .setattr
= btrfs_setattr
,
10829 .permission
= btrfs_permission
,
10830 .listxattr
= btrfs_listxattr
,
10831 .update_time
= btrfs_update_time
,
10834 const struct dentry_operations btrfs_dentry_operations
= {
10835 .d_delete
= btrfs_dentry_delete
,
10836 .d_release
= btrfs_dentry_release
,