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/statfs.h>
34 #include <linux/compat.h>
35 #include <linux/bit_spinlock.h>
36 #include <linux/xattr.h>
37 #include <linux/posix_acl.h>
38 #include <linux/falloc.h>
39 #include <linux/slab.h>
40 #include <linux/ratelimit.h>
41 #include <linux/mount.h>
45 #include "transaction.h"
46 #include "btrfs_inode.h"
48 #include "print-tree.h"
49 #include "ordered-data.h"
53 #include "compression.h"
55 #include "free-space-cache.h"
56 #include "inode-map.h"
58 struct btrfs_iget_args
{
60 struct btrfs_root
*root
;
63 static const struct inode_operations btrfs_dir_inode_operations
;
64 static const struct inode_operations btrfs_symlink_inode_operations
;
65 static const struct inode_operations btrfs_dir_ro_inode_operations
;
66 static const struct inode_operations btrfs_special_inode_operations
;
67 static const struct inode_operations btrfs_file_inode_operations
;
68 static const struct address_space_operations btrfs_aops
;
69 static const struct address_space_operations btrfs_symlink_aops
;
70 static const struct file_operations btrfs_dir_file_operations
;
71 static struct extent_io_ops btrfs_extent_io_ops
;
73 static struct kmem_cache
*btrfs_inode_cachep
;
74 struct kmem_cache
*btrfs_trans_handle_cachep
;
75 struct kmem_cache
*btrfs_transaction_cachep
;
76 struct kmem_cache
*btrfs_path_cachep
;
77 struct kmem_cache
*btrfs_free_space_cachep
;
80 static unsigned char btrfs_type_by_mode
[S_IFMT
>> S_SHIFT
] = {
81 [S_IFREG
>> S_SHIFT
] = BTRFS_FT_REG_FILE
,
82 [S_IFDIR
>> S_SHIFT
] = BTRFS_FT_DIR
,
83 [S_IFCHR
>> S_SHIFT
] = BTRFS_FT_CHRDEV
,
84 [S_IFBLK
>> S_SHIFT
] = BTRFS_FT_BLKDEV
,
85 [S_IFIFO
>> S_SHIFT
] = BTRFS_FT_FIFO
,
86 [S_IFSOCK
>> S_SHIFT
] = BTRFS_FT_SOCK
,
87 [S_IFLNK
>> S_SHIFT
] = BTRFS_FT_SYMLINK
,
90 static int btrfs_setsize(struct inode
*inode
, loff_t newsize
);
91 static int btrfs_truncate(struct inode
*inode
);
92 static int btrfs_finish_ordered_io(struct btrfs_ordered_extent
*ordered_extent
);
93 static noinline
int cow_file_range(struct inode
*inode
,
94 struct page
*locked_page
,
95 u64 start
, u64 end
, int *page_started
,
96 unsigned long *nr_written
, int unlock
);
97 static noinline
int btrfs_update_inode_fallback(struct btrfs_trans_handle
*trans
,
98 struct btrfs_root
*root
, struct inode
*inode
);
100 static int btrfs_init_inode_security(struct btrfs_trans_handle
*trans
,
101 struct inode
*inode
, struct inode
*dir
,
102 const struct qstr
*qstr
)
106 err
= btrfs_init_acl(trans
, inode
, dir
);
108 err
= btrfs_xattr_security_init(trans
, inode
, dir
, qstr
);
113 * this does all the hard work for inserting an inline extent into
114 * the btree. The caller should have done a btrfs_drop_extents so that
115 * no overlapping inline items exist in the btree
117 static noinline
int insert_inline_extent(struct btrfs_trans_handle
*trans
,
118 struct btrfs_root
*root
, struct inode
*inode
,
119 u64 start
, size_t size
, size_t compressed_size
,
121 struct page
**compressed_pages
)
123 struct btrfs_key key
;
124 struct btrfs_path
*path
;
125 struct extent_buffer
*leaf
;
126 struct page
*page
= NULL
;
129 struct btrfs_file_extent_item
*ei
;
132 size_t cur_size
= size
;
134 unsigned long offset
;
136 if (compressed_size
&& compressed_pages
)
137 cur_size
= compressed_size
;
139 path
= btrfs_alloc_path();
143 path
->leave_spinning
= 1;
145 key
.objectid
= btrfs_ino(inode
);
147 btrfs_set_key_type(&key
, BTRFS_EXTENT_DATA_KEY
);
148 datasize
= btrfs_file_extent_calc_inline_size(cur_size
);
150 inode_add_bytes(inode
, size
);
151 ret
= btrfs_insert_empty_item(trans
, root
, path
, &key
,
157 leaf
= path
->nodes
[0];
158 ei
= btrfs_item_ptr(leaf
, path
->slots
[0],
159 struct btrfs_file_extent_item
);
160 btrfs_set_file_extent_generation(leaf
, ei
, trans
->transid
);
161 btrfs_set_file_extent_type(leaf
, ei
, BTRFS_FILE_EXTENT_INLINE
);
162 btrfs_set_file_extent_encryption(leaf
, ei
, 0);
163 btrfs_set_file_extent_other_encoding(leaf
, ei
, 0);
164 btrfs_set_file_extent_ram_bytes(leaf
, ei
, size
);
165 ptr
= btrfs_file_extent_inline_start(ei
);
167 if (compress_type
!= BTRFS_COMPRESS_NONE
) {
170 while (compressed_size
> 0) {
171 cpage
= compressed_pages
[i
];
172 cur_size
= min_t(unsigned long, compressed_size
,
175 kaddr
= kmap_atomic(cpage
);
176 write_extent_buffer(leaf
, kaddr
, ptr
, cur_size
);
177 kunmap_atomic(kaddr
);
181 compressed_size
-= cur_size
;
183 btrfs_set_file_extent_compression(leaf
, ei
,
186 page
= find_get_page(inode
->i_mapping
,
187 start
>> PAGE_CACHE_SHIFT
);
188 btrfs_set_file_extent_compression(leaf
, ei
, 0);
189 kaddr
= kmap_atomic(page
);
190 offset
= start
& (PAGE_CACHE_SIZE
- 1);
191 write_extent_buffer(leaf
, kaddr
+ offset
, ptr
, size
);
192 kunmap_atomic(kaddr
);
193 page_cache_release(page
);
195 btrfs_mark_buffer_dirty(leaf
);
196 btrfs_free_path(path
);
199 * we're an inline extent, so nobody can
200 * extend the file past i_size without locking
201 * a page we already have locked.
203 * We must do any isize and inode updates
204 * before we unlock the pages. Otherwise we
205 * could end up racing with unlink.
207 BTRFS_I(inode
)->disk_i_size
= inode
->i_size
;
208 ret
= btrfs_update_inode(trans
, root
, inode
);
212 btrfs_free_path(path
);
218 * conditionally insert an inline extent into the file. This
219 * does the checks required to make sure the data is small enough
220 * to fit as an inline extent.
222 static noinline
int cow_file_range_inline(struct btrfs_trans_handle
*trans
,
223 struct btrfs_root
*root
,
224 struct inode
*inode
, u64 start
, u64 end
,
225 size_t compressed_size
, int compress_type
,
226 struct page
**compressed_pages
)
228 u64 isize
= i_size_read(inode
);
229 u64 actual_end
= min(end
+ 1, isize
);
230 u64 inline_len
= actual_end
- start
;
231 u64 aligned_end
= (end
+ root
->sectorsize
- 1) &
232 ~((u64
)root
->sectorsize
- 1);
234 u64 data_len
= inline_len
;
238 data_len
= compressed_size
;
241 actual_end
>= PAGE_CACHE_SIZE
||
242 data_len
>= BTRFS_MAX_INLINE_DATA_SIZE(root
) ||
244 (actual_end
& (root
->sectorsize
- 1)) == 0) ||
246 data_len
> root
->fs_info
->max_inline
) {
250 ret
= btrfs_drop_extents(trans
, inode
, start
, aligned_end
,
255 if (isize
> actual_end
)
256 inline_len
= min_t(u64
, isize
, actual_end
);
257 ret
= insert_inline_extent(trans
, root
, inode
, start
,
258 inline_len
, compressed_size
,
259 compress_type
, compressed_pages
);
260 if (ret
&& ret
!= -ENOSPC
) {
261 btrfs_abort_transaction(trans
, root
, ret
);
263 } else if (ret
== -ENOSPC
) {
267 btrfs_delalloc_release_metadata(inode
, end
+ 1 - start
);
268 btrfs_drop_extent_cache(inode
, start
, aligned_end
- 1, 0);
272 struct async_extent
{
277 unsigned long nr_pages
;
279 struct list_head list
;
284 struct btrfs_root
*root
;
285 struct page
*locked_page
;
288 struct list_head extents
;
289 struct btrfs_work work
;
292 static noinline
int add_async_extent(struct async_cow
*cow
,
293 u64 start
, u64 ram_size
,
296 unsigned long nr_pages
,
299 struct async_extent
*async_extent
;
301 async_extent
= kmalloc(sizeof(*async_extent
), GFP_NOFS
);
302 BUG_ON(!async_extent
); /* -ENOMEM */
303 async_extent
->start
= start
;
304 async_extent
->ram_size
= ram_size
;
305 async_extent
->compressed_size
= compressed_size
;
306 async_extent
->pages
= pages
;
307 async_extent
->nr_pages
= nr_pages
;
308 async_extent
->compress_type
= compress_type
;
309 list_add_tail(&async_extent
->list
, &cow
->extents
);
314 * we create compressed extents in two phases. The first
315 * phase compresses a range of pages that have already been
316 * locked (both pages and state bits are locked).
318 * This is done inside an ordered work queue, and the compression
319 * is spread across many cpus. The actual IO submission is step
320 * two, and the ordered work queue takes care of making sure that
321 * happens in the same order things were put onto the queue by
322 * writepages and friends.
324 * If this code finds it can't get good compression, it puts an
325 * entry onto the work queue to write the uncompressed bytes. This
326 * makes sure that both compressed inodes and uncompressed inodes
327 * are written in the same order that pdflush sent them down.
329 static noinline
int compress_file_range(struct inode
*inode
,
330 struct page
*locked_page
,
332 struct async_cow
*async_cow
,
335 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
336 struct btrfs_trans_handle
*trans
;
338 u64 blocksize
= root
->sectorsize
;
340 u64 isize
= i_size_read(inode
);
342 struct page
**pages
= NULL
;
343 unsigned long nr_pages
;
344 unsigned long nr_pages_ret
= 0;
345 unsigned long total_compressed
= 0;
346 unsigned long total_in
= 0;
347 unsigned long max_compressed
= 128 * 1024;
348 unsigned long max_uncompressed
= 128 * 1024;
351 int compress_type
= root
->fs_info
->compress_type
;
353 /* if this is a small write inside eof, kick off a defrag */
354 if ((end
- start
+ 1) < 16 * 1024 &&
355 (start
> 0 || end
+ 1 < BTRFS_I(inode
)->disk_i_size
))
356 btrfs_add_inode_defrag(NULL
, inode
);
358 actual_end
= min_t(u64
, isize
, end
+ 1);
361 nr_pages
= (end
>> PAGE_CACHE_SHIFT
) - (start
>> PAGE_CACHE_SHIFT
) + 1;
362 nr_pages
= min(nr_pages
, (128 * 1024UL) / PAGE_CACHE_SIZE
);
365 * we don't want to send crud past the end of i_size through
366 * compression, that's just a waste of CPU time. So, if the
367 * end of the file is before the start of our current
368 * requested range of bytes, we bail out to the uncompressed
369 * cleanup code that can deal with all of this.
371 * It isn't really the fastest way to fix things, but this is a
372 * very uncommon corner.
374 if (actual_end
<= start
)
375 goto cleanup_and_bail_uncompressed
;
377 total_compressed
= actual_end
- start
;
379 /* we want to make sure that amount of ram required to uncompress
380 * an extent is reasonable, so we limit the total size in ram
381 * of a compressed extent to 128k. This is a crucial number
382 * because it also controls how easily we can spread reads across
383 * cpus for decompression.
385 * We also want to make sure the amount of IO required to do
386 * a random read is reasonably small, so we limit the size of
387 * a compressed extent to 128k.
389 total_compressed
= min(total_compressed
, max_uncompressed
);
390 num_bytes
= (end
- start
+ blocksize
) & ~(blocksize
- 1);
391 num_bytes
= max(blocksize
, num_bytes
);
396 * we do compression for mount -o compress and when the
397 * inode has not been flagged as nocompress. This flag can
398 * change at any time if we discover bad compression ratios.
400 if (!(BTRFS_I(inode
)->flags
& BTRFS_INODE_NOCOMPRESS
) &&
401 (btrfs_test_opt(root
, COMPRESS
) ||
402 (BTRFS_I(inode
)->force_compress
) ||
403 (BTRFS_I(inode
)->flags
& BTRFS_INODE_COMPRESS
))) {
405 pages
= kzalloc(sizeof(struct page
*) * nr_pages
, GFP_NOFS
);
407 /* just bail out to the uncompressed code */
411 if (BTRFS_I(inode
)->force_compress
)
412 compress_type
= BTRFS_I(inode
)->force_compress
;
414 ret
= btrfs_compress_pages(compress_type
,
415 inode
->i_mapping
, start
,
416 total_compressed
, pages
,
417 nr_pages
, &nr_pages_ret
,
423 unsigned long offset
= total_compressed
&
424 (PAGE_CACHE_SIZE
- 1);
425 struct page
*page
= pages
[nr_pages_ret
- 1];
428 /* zero the tail end of the last page, we might be
429 * sending it down to disk
432 kaddr
= kmap_atomic(page
);
433 memset(kaddr
+ offset
, 0,
434 PAGE_CACHE_SIZE
- offset
);
435 kunmap_atomic(kaddr
);
442 trans
= btrfs_join_transaction(root
);
444 ret
= PTR_ERR(trans
);
446 goto cleanup_and_out
;
448 trans
->block_rsv
= &root
->fs_info
->delalloc_block_rsv
;
450 /* lets try to make an inline extent */
451 if (ret
|| total_in
< (actual_end
- start
)) {
452 /* we didn't compress the entire range, try
453 * to make an uncompressed inline extent.
455 ret
= cow_file_range_inline(trans
, root
, inode
,
456 start
, end
, 0, 0, NULL
);
458 /* try making a compressed inline extent */
459 ret
= cow_file_range_inline(trans
, root
, inode
,
462 compress_type
, pages
);
466 * inline extent creation worked or returned error,
467 * we don't need to create any more async work items.
468 * Unlock and free up our temp pages.
470 extent_clear_unlock_delalloc(inode
,
471 &BTRFS_I(inode
)->io_tree
,
473 EXTENT_CLEAR_UNLOCK_PAGE
| EXTENT_CLEAR_DIRTY
|
474 EXTENT_CLEAR_DELALLOC
|
475 EXTENT_SET_WRITEBACK
| EXTENT_END_WRITEBACK
);
477 btrfs_end_transaction(trans
, root
);
480 btrfs_end_transaction(trans
, root
);
485 * we aren't doing an inline extent round the compressed size
486 * up to a block size boundary so the allocator does sane
489 total_compressed
= (total_compressed
+ blocksize
- 1) &
493 * one last check to make sure the compression is really a
494 * win, compare the page count read with the blocks on disk
496 total_in
= (total_in
+ PAGE_CACHE_SIZE
- 1) &
497 ~(PAGE_CACHE_SIZE
- 1);
498 if (total_compressed
>= total_in
) {
501 num_bytes
= total_in
;
504 if (!will_compress
&& pages
) {
506 * the compression code ran but failed to make things smaller,
507 * free any pages it allocated and our page pointer array
509 for (i
= 0; i
< nr_pages_ret
; i
++) {
510 WARN_ON(pages
[i
]->mapping
);
511 page_cache_release(pages
[i
]);
515 total_compressed
= 0;
518 /* flag the file so we don't compress in the future */
519 if (!btrfs_test_opt(root
, FORCE_COMPRESS
) &&
520 !(BTRFS_I(inode
)->force_compress
)) {
521 BTRFS_I(inode
)->flags
|= BTRFS_INODE_NOCOMPRESS
;
527 /* the async work queues will take care of doing actual
528 * allocation on disk for these compressed pages,
529 * and will submit them to the elevator.
531 add_async_extent(async_cow
, start
, num_bytes
,
532 total_compressed
, pages
, nr_pages_ret
,
535 if (start
+ num_bytes
< end
) {
542 cleanup_and_bail_uncompressed
:
544 * No compression, but we still need to write the pages in
545 * the file we've been given so far. redirty the locked
546 * page if it corresponds to our extent and set things up
547 * for the async work queue to run cow_file_range to do
548 * the normal delalloc dance
550 if (page_offset(locked_page
) >= start
&&
551 page_offset(locked_page
) <= end
) {
552 __set_page_dirty_nobuffers(locked_page
);
553 /* unlocked later on in the async handlers */
555 add_async_extent(async_cow
, start
, end
- start
+ 1,
556 0, NULL
, 0, BTRFS_COMPRESS_NONE
);
564 for (i
= 0; i
< nr_pages_ret
; i
++) {
565 WARN_ON(pages
[i
]->mapping
);
566 page_cache_release(pages
[i
]);
573 extent_clear_unlock_delalloc(inode
, &BTRFS_I(inode
)->io_tree
,
575 EXTENT_CLEAR_UNLOCK_PAGE
|
577 EXTENT_CLEAR_DELALLOC
|
578 EXTENT_SET_WRITEBACK
|
579 EXTENT_END_WRITEBACK
);
580 if (!trans
|| IS_ERR(trans
))
581 btrfs_error(root
->fs_info
, ret
, "Failed to join transaction");
583 btrfs_abort_transaction(trans
, root
, ret
);
588 * phase two of compressed writeback. This is the ordered portion
589 * of the code, which only gets called in the order the work was
590 * queued. We walk all the async extents created by compress_file_range
591 * and send them down to the disk.
593 static noinline
int submit_compressed_extents(struct inode
*inode
,
594 struct async_cow
*async_cow
)
596 struct async_extent
*async_extent
;
598 struct btrfs_trans_handle
*trans
;
599 struct btrfs_key ins
;
600 struct extent_map
*em
;
601 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
602 struct extent_map_tree
*em_tree
= &BTRFS_I(inode
)->extent_tree
;
603 struct extent_io_tree
*io_tree
;
606 if (list_empty(&async_cow
->extents
))
610 while (!list_empty(&async_cow
->extents
)) {
611 async_extent
= list_entry(async_cow
->extents
.next
,
612 struct async_extent
, list
);
613 list_del(&async_extent
->list
);
615 io_tree
= &BTRFS_I(inode
)->io_tree
;
618 /* did the compression code fall back to uncompressed IO? */
619 if (!async_extent
->pages
) {
620 int page_started
= 0;
621 unsigned long nr_written
= 0;
623 lock_extent(io_tree
, async_extent
->start
,
624 async_extent
->start
+
625 async_extent
->ram_size
- 1);
627 /* allocate blocks */
628 ret
= cow_file_range(inode
, async_cow
->locked_page
,
630 async_extent
->start
+
631 async_extent
->ram_size
- 1,
632 &page_started
, &nr_written
, 0);
637 * if page_started, cow_file_range inserted an
638 * inline extent and took care of all the unlocking
639 * and IO for us. Otherwise, we need to submit
640 * all those pages down to the drive.
642 if (!page_started
&& !ret
)
643 extent_write_locked_range(io_tree
,
644 inode
, async_extent
->start
,
645 async_extent
->start
+
646 async_extent
->ram_size
- 1,
654 lock_extent(io_tree
, async_extent
->start
,
655 async_extent
->start
+ async_extent
->ram_size
- 1);
657 trans
= btrfs_join_transaction(root
);
659 ret
= PTR_ERR(trans
);
661 trans
->block_rsv
= &root
->fs_info
->delalloc_block_rsv
;
662 ret
= btrfs_reserve_extent(trans
, root
,
663 async_extent
->compressed_size
,
664 async_extent
->compressed_size
,
665 0, alloc_hint
, &ins
, 1);
667 btrfs_abort_transaction(trans
, root
, ret
);
668 btrfs_end_transaction(trans
, root
);
673 for (i
= 0; i
< async_extent
->nr_pages
; i
++) {
674 WARN_ON(async_extent
->pages
[i
]->mapping
);
675 page_cache_release(async_extent
->pages
[i
]);
677 kfree(async_extent
->pages
);
678 async_extent
->nr_pages
= 0;
679 async_extent
->pages
= NULL
;
680 unlock_extent(io_tree
, async_extent
->start
,
681 async_extent
->start
+
682 async_extent
->ram_size
- 1);
685 goto out_free
; /* JDM: Requeue? */
689 * here we're doing allocation and writeback of the
692 btrfs_drop_extent_cache(inode
, async_extent
->start
,
693 async_extent
->start
+
694 async_extent
->ram_size
- 1, 0);
696 em
= alloc_extent_map();
697 BUG_ON(!em
); /* -ENOMEM */
698 em
->start
= async_extent
->start
;
699 em
->len
= async_extent
->ram_size
;
700 em
->orig_start
= em
->start
;
702 em
->block_start
= ins
.objectid
;
703 em
->block_len
= ins
.offset
;
704 em
->bdev
= root
->fs_info
->fs_devices
->latest_bdev
;
705 em
->compress_type
= async_extent
->compress_type
;
706 set_bit(EXTENT_FLAG_PINNED
, &em
->flags
);
707 set_bit(EXTENT_FLAG_COMPRESSED
, &em
->flags
);
710 write_lock(&em_tree
->lock
);
711 ret
= add_extent_mapping(em_tree
, em
);
712 write_unlock(&em_tree
->lock
);
713 if (ret
!= -EEXIST
) {
717 btrfs_drop_extent_cache(inode
, async_extent
->start
,
718 async_extent
->start
+
719 async_extent
->ram_size
- 1, 0);
722 ret
= btrfs_add_ordered_extent_compress(inode
,
725 async_extent
->ram_size
,
727 BTRFS_ORDERED_COMPRESSED
,
728 async_extent
->compress_type
);
729 BUG_ON(ret
); /* -ENOMEM */
732 * clear dirty, set writeback and unlock the pages.
734 extent_clear_unlock_delalloc(inode
,
735 &BTRFS_I(inode
)->io_tree
,
737 async_extent
->start
+
738 async_extent
->ram_size
- 1,
739 NULL
, EXTENT_CLEAR_UNLOCK_PAGE
|
740 EXTENT_CLEAR_UNLOCK
|
741 EXTENT_CLEAR_DELALLOC
|
742 EXTENT_CLEAR_DIRTY
| EXTENT_SET_WRITEBACK
);
744 ret
= btrfs_submit_compressed_write(inode
,
746 async_extent
->ram_size
,
748 ins
.offset
, async_extent
->pages
,
749 async_extent
->nr_pages
);
751 BUG_ON(ret
); /* -ENOMEM */
752 alloc_hint
= ins
.objectid
+ ins
.offset
;
764 static u64
get_extent_allocation_hint(struct inode
*inode
, u64 start
,
767 struct extent_map_tree
*em_tree
= &BTRFS_I(inode
)->extent_tree
;
768 struct extent_map
*em
;
771 read_lock(&em_tree
->lock
);
772 em
= search_extent_mapping(em_tree
, start
, num_bytes
);
775 * if block start isn't an actual block number then find the
776 * first block in this inode and use that as a hint. If that
777 * block is also bogus then just don't worry about it.
779 if (em
->block_start
>= EXTENT_MAP_LAST_BYTE
) {
781 em
= search_extent_mapping(em_tree
, 0, 0);
782 if (em
&& em
->block_start
< EXTENT_MAP_LAST_BYTE
)
783 alloc_hint
= em
->block_start
;
787 alloc_hint
= em
->block_start
;
791 read_unlock(&em_tree
->lock
);
797 * when extent_io.c finds a delayed allocation range in the file,
798 * the call backs end up in this code. The basic idea is to
799 * allocate extents on disk for the range, and create ordered data structs
800 * in ram to track those extents.
802 * locked_page is the page that writepage had locked already. We use
803 * it to make sure we don't do extra locks or unlocks.
805 * *page_started is set to one if we unlock locked_page and do everything
806 * required to start IO on it. It may be clean and already done with
809 static noinline
int cow_file_range(struct inode
*inode
,
810 struct page
*locked_page
,
811 u64 start
, u64 end
, int *page_started
,
812 unsigned long *nr_written
,
815 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
816 struct btrfs_trans_handle
*trans
;
819 unsigned long ram_size
;
822 u64 blocksize
= root
->sectorsize
;
823 struct btrfs_key ins
;
824 struct extent_map
*em
;
825 struct extent_map_tree
*em_tree
= &BTRFS_I(inode
)->extent_tree
;
828 BUG_ON(btrfs_is_free_space_inode(inode
));
829 trans
= btrfs_join_transaction(root
);
831 extent_clear_unlock_delalloc(inode
,
832 &BTRFS_I(inode
)->io_tree
,
833 start
, end
, locked_page
,
834 EXTENT_CLEAR_UNLOCK_PAGE
|
835 EXTENT_CLEAR_UNLOCK
|
836 EXTENT_CLEAR_DELALLOC
|
838 EXTENT_SET_WRITEBACK
|
839 EXTENT_END_WRITEBACK
);
840 return PTR_ERR(trans
);
842 trans
->block_rsv
= &root
->fs_info
->delalloc_block_rsv
;
844 num_bytes
= (end
- start
+ blocksize
) & ~(blocksize
- 1);
845 num_bytes
= max(blocksize
, num_bytes
);
846 disk_num_bytes
= num_bytes
;
849 /* if this is a small write inside eof, kick off defrag */
850 if (num_bytes
< 64 * 1024 &&
851 (start
> 0 || end
+ 1 < BTRFS_I(inode
)->disk_i_size
))
852 btrfs_add_inode_defrag(trans
, inode
);
855 /* lets try to make an inline extent */
856 ret
= cow_file_range_inline(trans
, root
, inode
,
857 start
, end
, 0, 0, NULL
);
859 extent_clear_unlock_delalloc(inode
,
860 &BTRFS_I(inode
)->io_tree
,
862 EXTENT_CLEAR_UNLOCK_PAGE
|
863 EXTENT_CLEAR_UNLOCK
|
864 EXTENT_CLEAR_DELALLOC
|
866 EXTENT_SET_WRITEBACK
|
867 EXTENT_END_WRITEBACK
);
869 *nr_written
= *nr_written
+
870 (end
- start
+ PAGE_CACHE_SIZE
) / PAGE_CACHE_SIZE
;
873 } else if (ret
< 0) {
874 btrfs_abort_transaction(trans
, root
, ret
);
879 BUG_ON(disk_num_bytes
>
880 btrfs_super_total_bytes(root
->fs_info
->super_copy
));
882 alloc_hint
= get_extent_allocation_hint(inode
, start
, num_bytes
);
883 btrfs_drop_extent_cache(inode
, start
, start
+ num_bytes
- 1, 0);
885 while (disk_num_bytes
> 0) {
888 cur_alloc_size
= disk_num_bytes
;
889 ret
= btrfs_reserve_extent(trans
, root
, cur_alloc_size
,
890 root
->sectorsize
, 0, alloc_hint
,
893 btrfs_abort_transaction(trans
, root
, ret
);
897 em
= alloc_extent_map();
898 BUG_ON(!em
); /* -ENOMEM */
900 em
->orig_start
= em
->start
;
901 ram_size
= ins
.offset
;
902 em
->len
= ins
.offset
;
904 em
->block_start
= ins
.objectid
;
905 em
->block_len
= ins
.offset
;
906 em
->bdev
= root
->fs_info
->fs_devices
->latest_bdev
;
907 set_bit(EXTENT_FLAG_PINNED
, &em
->flags
);
910 write_lock(&em_tree
->lock
);
911 ret
= add_extent_mapping(em_tree
, em
);
912 write_unlock(&em_tree
->lock
);
913 if (ret
!= -EEXIST
) {
917 btrfs_drop_extent_cache(inode
, start
,
918 start
+ ram_size
- 1, 0);
921 cur_alloc_size
= ins
.offset
;
922 ret
= btrfs_add_ordered_extent(inode
, start
, ins
.objectid
,
923 ram_size
, cur_alloc_size
, 0);
924 BUG_ON(ret
); /* -ENOMEM */
926 if (root
->root_key
.objectid
==
927 BTRFS_DATA_RELOC_TREE_OBJECTID
) {
928 ret
= btrfs_reloc_clone_csums(inode
, start
,
931 btrfs_abort_transaction(trans
, root
, ret
);
936 if (disk_num_bytes
< cur_alloc_size
)
939 /* we're not doing compressed IO, don't unlock the first
940 * page (which the caller expects to stay locked), don't
941 * clear any dirty bits and don't set any writeback bits
943 * Do set the Private2 bit so we know this page was properly
944 * setup for writepage
946 op
= unlock
? EXTENT_CLEAR_UNLOCK_PAGE
: 0;
947 op
|= EXTENT_CLEAR_UNLOCK
| EXTENT_CLEAR_DELALLOC
|
950 extent_clear_unlock_delalloc(inode
, &BTRFS_I(inode
)->io_tree
,
951 start
, start
+ ram_size
- 1,
953 disk_num_bytes
-= cur_alloc_size
;
954 num_bytes
-= cur_alloc_size
;
955 alloc_hint
= ins
.objectid
+ ins
.offset
;
956 start
+= cur_alloc_size
;
960 btrfs_end_transaction(trans
, root
);
964 extent_clear_unlock_delalloc(inode
,
965 &BTRFS_I(inode
)->io_tree
,
966 start
, end
, locked_page
,
967 EXTENT_CLEAR_UNLOCK_PAGE
|
968 EXTENT_CLEAR_UNLOCK
|
969 EXTENT_CLEAR_DELALLOC
|
971 EXTENT_SET_WRITEBACK
|
972 EXTENT_END_WRITEBACK
);
978 * work queue call back to started compression on a file and pages
980 static noinline
void async_cow_start(struct btrfs_work
*work
)
982 struct async_cow
*async_cow
;
984 async_cow
= container_of(work
, struct async_cow
, work
);
986 compress_file_range(async_cow
->inode
, async_cow
->locked_page
,
987 async_cow
->start
, async_cow
->end
, async_cow
,
989 if (num_added
== 0) {
990 btrfs_add_delayed_iput(async_cow
->inode
);
991 async_cow
->inode
= NULL
;
996 * work queue call back to submit previously compressed pages
998 static noinline
void async_cow_submit(struct btrfs_work
*work
)
1000 struct async_cow
*async_cow
;
1001 struct btrfs_root
*root
;
1002 unsigned long nr_pages
;
1004 async_cow
= container_of(work
, struct async_cow
, work
);
1006 root
= async_cow
->root
;
1007 nr_pages
= (async_cow
->end
- async_cow
->start
+ PAGE_CACHE_SIZE
) >>
1010 if (atomic_sub_return(nr_pages
, &root
->fs_info
->async_delalloc_pages
) <
1012 waitqueue_active(&root
->fs_info
->async_submit_wait
))
1013 wake_up(&root
->fs_info
->async_submit_wait
);
1015 if (async_cow
->inode
)
1016 submit_compressed_extents(async_cow
->inode
, async_cow
);
1019 static noinline
void async_cow_free(struct btrfs_work
*work
)
1021 struct async_cow
*async_cow
;
1022 async_cow
= container_of(work
, struct async_cow
, work
);
1023 if (async_cow
->inode
)
1024 btrfs_add_delayed_iput(async_cow
->inode
);
1028 static int cow_file_range_async(struct inode
*inode
, struct page
*locked_page
,
1029 u64 start
, u64 end
, int *page_started
,
1030 unsigned long *nr_written
)
1032 struct async_cow
*async_cow
;
1033 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1034 unsigned long nr_pages
;
1036 int limit
= 10 * 1024 * 1024;
1038 clear_extent_bit(&BTRFS_I(inode
)->io_tree
, start
, end
, EXTENT_LOCKED
,
1039 1, 0, NULL
, GFP_NOFS
);
1040 while (start
< end
) {
1041 async_cow
= kmalloc(sizeof(*async_cow
), GFP_NOFS
);
1042 BUG_ON(!async_cow
); /* -ENOMEM */
1043 async_cow
->inode
= igrab(inode
);
1044 async_cow
->root
= root
;
1045 async_cow
->locked_page
= locked_page
;
1046 async_cow
->start
= start
;
1048 if (BTRFS_I(inode
)->flags
& BTRFS_INODE_NOCOMPRESS
)
1051 cur_end
= min(end
, start
+ 512 * 1024 - 1);
1053 async_cow
->end
= cur_end
;
1054 INIT_LIST_HEAD(&async_cow
->extents
);
1056 async_cow
->work
.func
= async_cow_start
;
1057 async_cow
->work
.ordered_func
= async_cow_submit
;
1058 async_cow
->work
.ordered_free
= async_cow_free
;
1059 async_cow
->work
.flags
= 0;
1061 nr_pages
= (cur_end
- start
+ PAGE_CACHE_SIZE
) >>
1063 atomic_add(nr_pages
, &root
->fs_info
->async_delalloc_pages
);
1065 btrfs_queue_worker(&root
->fs_info
->delalloc_workers
,
1068 if (atomic_read(&root
->fs_info
->async_delalloc_pages
) > limit
) {
1069 wait_event(root
->fs_info
->async_submit_wait
,
1070 (atomic_read(&root
->fs_info
->async_delalloc_pages
) <
1074 while (atomic_read(&root
->fs_info
->async_submit_draining
) &&
1075 atomic_read(&root
->fs_info
->async_delalloc_pages
)) {
1076 wait_event(root
->fs_info
->async_submit_wait
,
1077 (atomic_read(&root
->fs_info
->async_delalloc_pages
) ==
1081 *nr_written
+= nr_pages
;
1082 start
= cur_end
+ 1;
1088 static noinline
int csum_exist_in_range(struct btrfs_root
*root
,
1089 u64 bytenr
, u64 num_bytes
)
1092 struct btrfs_ordered_sum
*sums
;
1095 ret
= btrfs_lookup_csums_range(root
->fs_info
->csum_root
, bytenr
,
1096 bytenr
+ num_bytes
- 1, &list
, 0);
1097 if (ret
== 0 && list_empty(&list
))
1100 while (!list_empty(&list
)) {
1101 sums
= list_entry(list
.next
, struct btrfs_ordered_sum
, list
);
1102 list_del(&sums
->list
);
1109 * when nowcow writeback call back. This checks for snapshots or COW copies
1110 * of the extents that exist in the file, and COWs the file as required.
1112 * If no cow copies or snapshots exist, we write directly to the existing
1115 static noinline
int run_delalloc_nocow(struct inode
*inode
,
1116 struct page
*locked_page
,
1117 u64 start
, u64 end
, int *page_started
, int force
,
1118 unsigned long *nr_written
)
1120 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1121 struct btrfs_trans_handle
*trans
;
1122 struct extent_buffer
*leaf
;
1123 struct btrfs_path
*path
;
1124 struct btrfs_file_extent_item
*fi
;
1125 struct btrfs_key found_key
;
1138 u64 ino
= btrfs_ino(inode
);
1140 path
= btrfs_alloc_path();
1142 extent_clear_unlock_delalloc(inode
,
1143 &BTRFS_I(inode
)->io_tree
,
1144 start
, end
, locked_page
,
1145 EXTENT_CLEAR_UNLOCK_PAGE
|
1146 EXTENT_CLEAR_UNLOCK
|
1147 EXTENT_CLEAR_DELALLOC
|
1148 EXTENT_CLEAR_DIRTY
|
1149 EXTENT_SET_WRITEBACK
|
1150 EXTENT_END_WRITEBACK
);
1154 nolock
= btrfs_is_free_space_inode(inode
);
1157 trans
= btrfs_join_transaction_nolock(root
);
1159 trans
= btrfs_join_transaction(root
);
1161 if (IS_ERR(trans
)) {
1162 extent_clear_unlock_delalloc(inode
,
1163 &BTRFS_I(inode
)->io_tree
,
1164 start
, end
, locked_page
,
1165 EXTENT_CLEAR_UNLOCK_PAGE
|
1166 EXTENT_CLEAR_UNLOCK
|
1167 EXTENT_CLEAR_DELALLOC
|
1168 EXTENT_CLEAR_DIRTY
|
1169 EXTENT_SET_WRITEBACK
|
1170 EXTENT_END_WRITEBACK
);
1171 btrfs_free_path(path
);
1172 return PTR_ERR(trans
);
1175 trans
->block_rsv
= &root
->fs_info
->delalloc_block_rsv
;
1177 cow_start
= (u64
)-1;
1180 ret
= btrfs_lookup_file_extent(trans
, root
, path
, ino
,
1183 btrfs_abort_transaction(trans
, root
, ret
);
1186 if (ret
> 0 && path
->slots
[0] > 0 && check_prev
) {
1187 leaf
= path
->nodes
[0];
1188 btrfs_item_key_to_cpu(leaf
, &found_key
,
1189 path
->slots
[0] - 1);
1190 if (found_key
.objectid
== ino
&&
1191 found_key
.type
== BTRFS_EXTENT_DATA_KEY
)
1196 leaf
= path
->nodes
[0];
1197 if (path
->slots
[0] >= btrfs_header_nritems(leaf
)) {
1198 ret
= btrfs_next_leaf(root
, path
);
1200 btrfs_abort_transaction(trans
, root
, ret
);
1205 leaf
= path
->nodes
[0];
1211 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
1213 if (found_key
.objectid
> ino
||
1214 found_key
.type
> BTRFS_EXTENT_DATA_KEY
||
1215 found_key
.offset
> end
)
1218 if (found_key
.offset
> cur_offset
) {
1219 extent_end
= found_key
.offset
;
1224 fi
= btrfs_item_ptr(leaf
, path
->slots
[0],
1225 struct btrfs_file_extent_item
);
1226 extent_type
= btrfs_file_extent_type(leaf
, fi
);
1228 if (extent_type
== BTRFS_FILE_EXTENT_REG
||
1229 extent_type
== BTRFS_FILE_EXTENT_PREALLOC
) {
1230 disk_bytenr
= btrfs_file_extent_disk_bytenr(leaf
, fi
);
1231 extent_offset
= btrfs_file_extent_offset(leaf
, fi
);
1232 extent_end
= found_key
.offset
+
1233 btrfs_file_extent_num_bytes(leaf
, fi
);
1234 if (extent_end
<= start
) {
1238 if (disk_bytenr
== 0)
1240 if (btrfs_file_extent_compression(leaf
, fi
) ||
1241 btrfs_file_extent_encryption(leaf
, fi
) ||
1242 btrfs_file_extent_other_encoding(leaf
, fi
))
1244 if (extent_type
== BTRFS_FILE_EXTENT_REG
&& !force
)
1246 if (btrfs_extent_readonly(root
, disk_bytenr
))
1248 if (btrfs_cross_ref_exist(trans
, root
, ino
,
1250 extent_offset
, disk_bytenr
))
1252 disk_bytenr
+= extent_offset
;
1253 disk_bytenr
+= cur_offset
- found_key
.offset
;
1254 num_bytes
= min(end
+ 1, extent_end
) - cur_offset
;
1256 * force cow if csum exists in the range.
1257 * this ensure that csum for a given extent are
1258 * either valid or do not exist.
1260 if (csum_exist_in_range(root
, disk_bytenr
, num_bytes
))
1263 } else if (extent_type
== BTRFS_FILE_EXTENT_INLINE
) {
1264 extent_end
= found_key
.offset
+
1265 btrfs_file_extent_inline_len(leaf
, fi
);
1266 extent_end
= ALIGN(extent_end
, root
->sectorsize
);
1271 if (extent_end
<= start
) {
1276 if (cow_start
== (u64
)-1)
1277 cow_start
= cur_offset
;
1278 cur_offset
= extent_end
;
1279 if (cur_offset
> end
)
1285 btrfs_release_path(path
);
1286 if (cow_start
!= (u64
)-1) {
1287 ret
= cow_file_range(inode
, locked_page
, cow_start
,
1288 found_key
.offset
- 1, page_started
,
1291 btrfs_abort_transaction(trans
, root
, ret
);
1294 cow_start
= (u64
)-1;
1297 if (extent_type
== BTRFS_FILE_EXTENT_PREALLOC
) {
1298 struct extent_map
*em
;
1299 struct extent_map_tree
*em_tree
;
1300 em_tree
= &BTRFS_I(inode
)->extent_tree
;
1301 em
= alloc_extent_map();
1302 BUG_ON(!em
); /* -ENOMEM */
1303 em
->start
= cur_offset
;
1304 em
->orig_start
= em
->start
;
1305 em
->len
= num_bytes
;
1306 em
->block_len
= num_bytes
;
1307 em
->block_start
= disk_bytenr
;
1308 em
->bdev
= root
->fs_info
->fs_devices
->latest_bdev
;
1309 set_bit(EXTENT_FLAG_PINNED
, &em
->flags
);
1311 write_lock(&em_tree
->lock
);
1312 ret
= add_extent_mapping(em_tree
, em
);
1313 write_unlock(&em_tree
->lock
);
1314 if (ret
!= -EEXIST
) {
1315 free_extent_map(em
);
1318 btrfs_drop_extent_cache(inode
, em
->start
,
1319 em
->start
+ em
->len
- 1, 0);
1321 type
= BTRFS_ORDERED_PREALLOC
;
1323 type
= BTRFS_ORDERED_NOCOW
;
1326 ret
= btrfs_add_ordered_extent(inode
, cur_offset
, disk_bytenr
,
1327 num_bytes
, num_bytes
, type
);
1328 BUG_ON(ret
); /* -ENOMEM */
1330 if (root
->root_key
.objectid
==
1331 BTRFS_DATA_RELOC_TREE_OBJECTID
) {
1332 ret
= btrfs_reloc_clone_csums(inode
, cur_offset
,
1335 btrfs_abort_transaction(trans
, root
, ret
);
1340 extent_clear_unlock_delalloc(inode
, &BTRFS_I(inode
)->io_tree
,
1341 cur_offset
, cur_offset
+ num_bytes
- 1,
1342 locked_page
, EXTENT_CLEAR_UNLOCK_PAGE
|
1343 EXTENT_CLEAR_UNLOCK
| EXTENT_CLEAR_DELALLOC
|
1344 EXTENT_SET_PRIVATE2
);
1345 cur_offset
= extent_end
;
1346 if (cur_offset
> end
)
1349 btrfs_release_path(path
);
1351 if (cur_offset
<= end
&& cow_start
== (u64
)-1) {
1352 cow_start
= cur_offset
;
1356 if (cow_start
!= (u64
)-1) {
1357 ret
= cow_file_range(inode
, locked_page
, cow_start
, end
,
1358 page_started
, nr_written
, 1);
1360 btrfs_abort_transaction(trans
, root
, ret
);
1367 err
= btrfs_end_transaction_nolock(trans
, root
);
1369 err
= btrfs_end_transaction(trans
, root
);
1374 if (ret
&& cur_offset
< end
)
1375 extent_clear_unlock_delalloc(inode
,
1376 &BTRFS_I(inode
)->io_tree
,
1377 cur_offset
, end
, locked_page
,
1378 EXTENT_CLEAR_UNLOCK_PAGE
|
1379 EXTENT_CLEAR_UNLOCK
|
1380 EXTENT_CLEAR_DELALLOC
|
1381 EXTENT_CLEAR_DIRTY
|
1382 EXTENT_SET_WRITEBACK
|
1383 EXTENT_END_WRITEBACK
);
1385 btrfs_free_path(path
);
1390 * extent_io.c call back to do delayed allocation processing
1392 static int run_delalloc_range(struct inode
*inode
, struct page
*locked_page
,
1393 u64 start
, u64 end
, int *page_started
,
1394 unsigned long *nr_written
)
1397 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1399 if (BTRFS_I(inode
)->flags
& BTRFS_INODE_NODATACOW
) {
1400 ret
= run_delalloc_nocow(inode
, locked_page
, start
, end
,
1401 page_started
, 1, nr_written
);
1402 } else if (BTRFS_I(inode
)->flags
& BTRFS_INODE_PREALLOC
) {
1403 ret
= run_delalloc_nocow(inode
, locked_page
, start
, end
,
1404 page_started
, 0, nr_written
);
1405 } else if (!btrfs_test_opt(root
, COMPRESS
) &&
1406 !(BTRFS_I(inode
)->force_compress
) &&
1407 !(BTRFS_I(inode
)->flags
& BTRFS_INODE_COMPRESS
)) {
1408 ret
= cow_file_range(inode
, locked_page
, start
, end
,
1409 page_started
, nr_written
, 1);
1411 set_bit(BTRFS_INODE_HAS_ASYNC_EXTENT
,
1412 &BTRFS_I(inode
)->runtime_flags
);
1413 ret
= cow_file_range_async(inode
, locked_page
, start
, end
,
1414 page_started
, nr_written
);
1419 static void btrfs_split_extent_hook(struct inode
*inode
,
1420 struct extent_state
*orig
, u64 split
)
1422 /* not delalloc, ignore it */
1423 if (!(orig
->state
& EXTENT_DELALLOC
))
1426 spin_lock(&BTRFS_I(inode
)->lock
);
1427 BTRFS_I(inode
)->outstanding_extents
++;
1428 spin_unlock(&BTRFS_I(inode
)->lock
);
1432 * extent_io.c merge_extent_hook, used to track merged delayed allocation
1433 * extents so we can keep track of new extents that are just merged onto old
1434 * extents, such as when we are doing sequential writes, so we can properly
1435 * account for the metadata space we'll need.
1437 static void btrfs_merge_extent_hook(struct inode
*inode
,
1438 struct extent_state
*new,
1439 struct extent_state
*other
)
1441 /* not delalloc, ignore it */
1442 if (!(other
->state
& EXTENT_DELALLOC
))
1445 spin_lock(&BTRFS_I(inode
)->lock
);
1446 BTRFS_I(inode
)->outstanding_extents
--;
1447 spin_unlock(&BTRFS_I(inode
)->lock
);
1451 * extent_io.c set_bit_hook, used to track delayed allocation
1452 * bytes in this file, and to maintain the list of inodes that
1453 * have pending delalloc work to be done.
1455 static void btrfs_set_bit_hook(struct inode
*inode
,
1456 struct extent_state
*state
, int *bits
)
1460 * set_bit and clear bit hooks normally require _irqsave/restore
1461 * but in this case, we are only testing for the DELALLOC
1462 * bit, which is only set or cleared with irqs on
1464 if (!(state
->state
& EXTENT_DELALLOC
) && (*bits
& EXTENT_DELALLOC
)) {
1465 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1466 u64 len
= state
->end
+ 1 - state
->start
;
1467 bool do_list
= !btrfs_is_free_space_inode(inode
);
1469 if (*bits
& EXTENT_FIRST_DELALLOC
) {
1470 *bits
&= ~EXTENT_FIRST_DELALLOC
;
1472 spin_lock(&BTRFS_I(inode
)->lock
);
1473 BTRFS_I(inode
)->outstanding_extents
++;
1474 spin_unlock(&BTRFS_I(inode
)->lock
);
1477 spin_lock(&root
->fs_info
->delalloc_lock
);
1478 BTRFS_I(inode
)->delalloc_bytes
+= len
;
1479 root
->fs_info
->delalloc_bytes
+= len
;
1480 if (do_list
&& list_empty(&BTRFS_I(inode
)->delalloc_inodes
)) {
1481 list_add_tail(&BTRFS_I(inode
)->delalloc_inodes
,
1482 &root
->fs_info
->delalloc_inodes
);
1484 spin_unlock(&root
->fs_info
->delalloc_lock
);
1489 * extent_io.c clear_bit_hook, see set_bit_hook for why
1491 static void btrfs_clear_bit_hook(struct inode
*inode
,
1492 struct extent_state
*state
, int *bits
)
1495 * set_bit and clear bit hooks normally require _irqsave/restore
1496 * but in this case, we are only testing for the DELALLOC
1497 * bit, which is only set or cleared with irqs on
1499 if ((state
->state
& EXTENT_DELALLOC
) && (*bits
& EXTENT_DELALLOC
)) {
1500 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1501 u64 len
= state
->end
+ 1 - state
->start
;
1502 bool do_list
= !btrfs_is_free_space_inode(inode
);
1504 if (*bits
& EXTENT_FIRST_DELALLOC
) {
1505 *bits
&= ~EXTENT_FIRST_DELALLOC
;
1506 } else if (!(*bits
& EXTENT_DO_ACCOUNTING
)) {
1507 spin_lock(&BTRFS_I(inode
)->lock
);
1508 BTRFS_I(inode
)->outstanding_extents
--;
1509 spin_unlock(&BTRFS_I(inode
)->lock
);
1512 if (*bits
& EXTENT_DO_ACCOUNTING
)
1513 btrfs_delalloc_release_metadata(inode
, len
);
1515 if (root
->root_key
.objectid
!= BTRFS_DATA_RELOC_TREE_OBJECTID
1517 btrfs_free_reserved_data_space(inode
, len
);
1519 spin_lock(&root
->fs_info
->delalloc_lock
);
1520 root
->fs_info
->delalloc_bytes
-= len
;
1521 BTRFS_I(inode
)->delalloc_bytes
-= len
;
1523 if (do_list
&& BTRFS_I(inode
)->delalloc_bytes
== 0 &&
1524 !list_empty(&BTRFS_I(inode
)->delalloc_inodes
)) {
1525 list_del_init(&BTRFS_I(inode
)->delalloc_inodes
);
1527 spin_unlock(&root
->fs_info
->delalloc_lock
);
1532 * extent_io.c merge_bio_hook, this must check the chunk tree to make sure
1533 * we don't create bios that span stripes or chunks
1535 int btrfs_merge_bio_hook(struct page
*page
, unsigned long offset
,
1536 size_t size
, struct bio
*bio
,
1537 unsigned long bio_flags
)
1539 struct btrfs_root
*root
= BTRFS_I(page
->mapping
->host
)->root
;
1540 struct btrfs_mapping_tree
*map_tree
;
1541 u64 logical
= (u64
)bio
->bi_sector
<< 9;
1546 if (bio_flags
& EXTENT_BIO_COMPRESSED
)
1549 length
= bio
->bi_size
;
1550 map_tree
= &root
->fs_info
->mapping_tree
;
1551 map_length
= length
;
1552 ret
= btrfs_map_block(map_tree
, READ
, logical
,
1553 &map_length
, NULL
, 0);
1554 /* Will always return 0 or 1 with map_multi == NULL */
1556 if (map_length
< length
+ size
)
1562 * in order to insert checksums into the metadata in large chunks,
1563 * we wait until bio submission time. All the pages in the bio are
1564 * checksummed and sums are attached onto the ordered extent record.
1566 * At IO completion time the cums attached on the ordered extent record
1567 * are inserted into the btree
1569 static int __btrfs_submit_bio_start(struct inode
*inode
, int rw
,
1570 struct bio
*bio
, int mirror_num
,
1571 unsigned long bio_flags
,
1574 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1577 ret
= btrfs_csum_one_bio(root
, inode
, bio
, 0, 0);
1578 BUG_ON(ret
); /* -ENOMEM */
1583 * in order to insert checksums into the metadata in large chunks,
1584 * we wait until bio submission time. All the pages in the bio are
1585 * checksummed and sums are attached onto the ordered extent record.
1587 * At IO completion time the cums attached on the ordered extent record
1588 * are inserted into the btree
1590 static int __btrfs_submit_bio_done(struct inode
*inode
, int rw
, struct bio
*bio
,
1591 int mirror_num
, unsigned long bio_flags
,
1594 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1595 return btrfs_map_bio(root
, rw
, bio
, mirror_num
, 1);
1599 * extent_io.c submission hook. This does the right thing for csum calculation
1600 * on write, or reading the csums from the tree before a read
1602 static int btrfs_submit_bio_hook(struct inode
*inode
, int rw
, struct bio
*bio
,
1603 int mirror_num
, unsigned long bio_flags
,
1606 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1611 skip_sum
= BTRFS_I(inode
)->flags
& BTRFS_INODE_NODATASUM
;
1613 if (btrfs_is_free_space_inode(inode
))
1616 if (!(rw
& REQ_WRITE
)) {
1617 ret
= btrfs_bio_wq_end_io(root
->fs_info
, bio
, metadata
);
1621 if (bio_flags
& EXTENT_BIO_COMPRESSED
) {
1622 return btrfs_submit_compressed_read(inode
, bio
,
1623 mirror_num
, bio_flags
);
1624 } else if (!skip_sum
) {
1625 ret
= btrfs_lookup_bio_sums(root
, inode
, bio
, NULL
);
1630 } else if (!skip_sum
) {
1631 /* csum items have already been cloned */
1632 if (root
->root_key
.objectid
== BTRFS_DATA_RELOC_TREE_OBJECTID
)
1634 /* we're doing a write, do the async checksumming */
1635 return btrfs_wq_submit_bio(BTRFS_I(inode
)->root
->fs_info
,
1636 inode
, rw
, bio
, mirror_num
,
1637 bio_flags
, bio_offset
,
1638 __btrfs_submit_bio_start
,
1639 __btrfs_submit_bio_done
);
1643 return btrfs_map_bio(root
, rw
, bio
, mirror_num
, 0);
1647 * given a list of ordered sums record them in the inode. This happens
1648 * at IO completion time based on sums calculated at bio submission time.
1650 static noinline
int add_pending_csums(struct btrfs_trans_handle
*trans
,
1651 struct inode
*inode
, u64 file_offset
,
1652 struct list_head
*list
)
1654 struct btrfs_ordered_sum
*sum
;
1656 list_for_each_entry(sum
, list
, list
) {
1657 btrfs_csum_file_blocks(trans
,
1658 BTRFS_I(inode
)->root
->fs_info
->csum_root
, sum
);
1663 int btrfs_set_extent_delalloc(struct inode
*inode
, u64 start
, u64 end
,
1664 struct extent_state
**cached_state
)
1666 if ((end
& (PAGE_CACHE_SIZE
- 1)) == 0)
1668 return set_extent_delalloc(&BTRFS_I(inode
)->io_tree
, start
, end
,
1669 cached_state
, GFP_NOFS
);
1672 /* see btrfs_writepage_start_hook for details on why this is required */
1673 struct btrfs_writepage_fixup
{
1675 struct btrfs_work work
;
1678 static void btrfs_writepage_fixup_worker(struct btrfs_work
*work
)
1680 struct btrfs_writepage_fixup
*fixup
;
1681 struct btrfs_ordered_extent
*ordered
;
1682 struct extent_state
*cached_state
= NULL
;
1684 struct inode
*inode
;
1689 fixup
= container_of(work
, struct btrfs_writepage_fixup
, work
);
1693 if (!page
->mapping
|| !PageDirty(page
) || !PageChecked(page
)) {
1694 ClearPageChecked(page
);
1698 inode
= page
->mapping
->host
;
1699 page_start
= page_offset(page
);
1700 page_end
= page_offset(page
) + PAGE_CACHE_SIZE
- 1;
1702 lock_extent_bits(&BTRFS_I(inode
)->io_tree
, page_start
, page_end
, 0,
1705 /* already ordered? We're done */
1706 if (PagePrivate2(page
))
1709 ordered
= btrfs_lookup_ordered_extent(inode
, page_start
);
1711 unlock_extent_cached(&BTRFS_I(inode
)->io_tree
, page_start
,
1712 page_end
, &cached_state
, GFP_NOFS
);
1714 btrfs_start_ordered_extent(inode
, ordered
, 1);
1715 btrfs_put_ordered_extent(ordered
);
1719 ret
= btrfs_delalloc_reserve_space(inode
, PAGE_CACHE_SIZE
);
1721 mapping_set_error(page
->mapping
, ret
);
1722 end_extent_writepage(page
, ret
, page_start
, page_end
);
1723 ClearPageChecked(page
);
1727 btrfs_set_extent_delalloc(inode
, page_start
, page_end
, &cached_state
);
1728 ClearPageChecked(page
);
1729 set_page_dirty(page
);
1731 unlock_extent_cached(&BTRFS_I(inode
)->io_tree
, page_start
, page_end
,
1732 &cached_state
, GFP_NOFS
);
1735 page_cache_release(page
);
1740 * There are a few paths in the higher layers of the kernel that directly
1741 * set the page dirty bit without asking the filesystem if it is a
1742 * good idea. This causes problems because we want to make sure COW
1743 * properly happens and the data=ordered rules are followed.
1745 * In our case any range that doesn't have the ORDERED bit set
1746 * hasn't been properly setup for IO. We kick off an async process
1747 * to fix it up. The async helper will wait for ordered extents, set
1748 * the delalloc bit and make it safe to write the page.
1750 static int btrfs_writepage_start_hook(struct page
*page
, u64 start
, u64 end
)
1752 struct inode
*inode
= page
->mapping
->host
;
1753 struct btrfs_writepage_fixup
*fixup
;
1754 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1756 /* this page is properly in the ordered list */
1757 if (TestClearPagePrivate2(page
))
1760 if (PageChecked(page
))
1763 fixup
= kzalloc(sizeof(*fixup
), GFP_NOFS
);
1767 SetPageChecked(page
);
1768 page_cache_get(page
);
1769 fixup
->work
.func
= btrfs_writepage_fixup_worker
;
1771 btrfs_queue_worker(&root
->fs_info
->fixup_workers
, &fixup
->work
);
1775 static int insert_reserved_file_extent(struct btrfs_trans_handle
*trans
,
1776 struct inode
*inode
, u64 file_pos
,
1777 u64 disk_bytenr
, u64 disk_num_bytes
,
1778 u64 num_bytes
, u64 ram_bytes
,
1779 u8 compression
, u8 encryption
,
1780 u16 other_encoding
, int extent_type
)
1782 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1783 struct btrfs_file_extent_item
*fi
;
1784 struct btrfs_path
*path
;
1785 struct extent_buffer
*leaf
;
1786 struct btrfs_key ins
;
1790 path
= btrfs_alloc_path();
1794 path
->leave_spinning
= 1;
1797 * we may be replacing one extent in the tree with another.
1798 * The new extent is pinned in the extent map, and we don't want
1799 * to drop it from the cache until it is completely in the btree.
1801 * So, tell btrfs_drop_extents to leave this extent in the cache.
1802 * the caller is expected to unpin it and allow it to be merged
1805 ret
= btrfs_drop_extents(trans
, inode
, file_pos
, file_pos
+ num_bytes
,
1810 ins
.objectid
= btrfs_ino(inode
);
1811 ins
.offset
= file_pos
;
1812 ins
.type
= BTRFS_EXTENT_DATA_KEY
;
1813 ret
= btrfs_insert_empty_item(trans
, root
, path
, &ins
, sizeof(*fi
));
1816 leaf
= path
->nodes
[0];
1817 fi
= btrfs_item_ptr(leaf
, path
->slots
[0],
1818 struct btrfs_file_extent_item
);
1819 btrfs_set_file_extent_generation(leaf
, fi
, trans
->transid
);
1820 btrfs_set_file_extent_type(leaf
, fi
, extent_type
);
1821 btrfs_set_file_extent_disk_bytenr(leaf
, fi
, disk_bytenr
);
1822 btrfs_set_file_extent_disk_num_bytes(leaf
, fi
, disk_num_bytes
);
1823 btrfs_set_file_extent_offset(leaf
, fi
, 0);
1824 btrfs_set_file_extent_num_bytes(leaf
, fi
, num_bytes
);
1825 btrfs_set_file_extent_ram_bytes(leaf
, fi
, ram_bytes
);
1826 btrfs_set_file_extent_compression(leaf
, fi
, compression
);
1827 btrfs_set_file_extent_encryption(leaf
, fi
, encryption
);
1828 btrfs_set_file_extent_other_encoding(leaf
, fi
, other_encoding
);
1830 btrfs_unlock_up_safe(path
, 1);
1831 btrfs_set_lock_blocking(leaf
);
1833 btrfs_mark_buffer_dirty(leaf
);
1835 inode_add_bytes(inode
, num_bytes
);
1837 ins
.objectid
= disk_bytenr
;
1838 ins
.offset
= disk_num_bytes
;
1839 ins
.type
= BTRFS_EXTENT_ITEM_KEY
;
1840 ret
= btrfs_alloc_reserved_file_extent(trans
, root
,
1841 root
->root_key
.objectid
,
1842 btrfs_ino(inode
), file_pos
, &ins
);
1844 btrfs_free_path(path
);
1850 * helper function for btrfs_finish_ordered_io, this
1851 * just reads in some of the csum leaves to prime them into ram
1852 * before we start the transaction. It limits the amount of btree
1853 * reads required while inside the transaction.
1855 /* as ordered data IO finishes, this gets called so we can finish
1856 * an ordered extent if the range of bytes in the file it covers are
1859 static int btrfs_finish_ordered_io(struct btrfs_ordered_extent
*ordered_extent
)
1861 struct inode
*inode
= ordered_extent
->inode
;
1862 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1863 struct btrfs_trans_handle
*trans
= NULL
;
1864 struct extent_io_tree
*io_tree
= &BTRFS_I(inode
)->io_tree
;
1865 struct extent_state
*cached_state
= NULL
;
1866 int compress_type
= 0;
1870 nolock
= btrfs_is_free_space_inode(inode
);
1872 if (test_bit(BTRFS_ORDERED_IOERR
, &ordered_extent
->flags
)) {
1877 if (test_bit(BTRFS_ORDERED_NOCOW
, &ordered_extent
->flags
)) {
1878 BUG_ON(!list_empty(&ordered_extent
->list
)); /* Logic error */
1879 ret
= btrfs_ordered_update_i_size(inode
, 0, ordered_extent
);
1882 trans
= btrfs_join_transaction_nolock(root
);
1884 trans
= btrfs_join_transaction(root
);
1886 return PTR_ERR(trans
);
1887 trans
->block_rsv
= &root
->fs_info
->delalloc_block_rsv
;
1888 ret
= btrfs_update_inode_fallback(trans
, root
, inode
);
1889 if (ret
) /* -ENOMEM or corruption */
1890 btrfs_abort_transaction(trans
, root
, ret
);
1895 lock_extent_bits(io_tree
, ordered_extent
->file_offset
,
1896 ordered_extent
->file_offset
+ ordered_extent
->len
- 1,
1900 trans
= btrfs_join_transaction_nolock(root
);
1902 trans
= btrfs_join_transaction(root
);
1903 if (IS_ERR(trans
)) {
1904 ret
= PTR_ERR(trans
);
1908 trans
->block_rsv
= &root
->fs_info
->delalloc_block_rsv
;
1910 if (test_bit(BTRFS_ORDERED_COMPRESSED
, &ordered_extent
->flags
))
1911 compress_type
= ordered_extent
->compress_type
;
1912 if (test_bit(BTRFS_ORDERED_PREALLOC
, &ordered_extent
->flags
)) {
1913 BUG_ON(compress_type
);
1914 ret
= btrfs_mark_extent_written(trans
, inode
,
1915 ordered_extent
->file_offset
,
1916 ordered_extent
->file_offset
+
1917 ordered_extent
->len
);
1919 BUG_ON(root
== root
->fs_info
->tree_root
);
1920 ret
= insert_reserved_file_extent(trans
, inode
,
1921 ordered_extent
->file_offset
,
1922 ordered_extent
->start
,
1923 ordered_extent
->disk_len
,
1924 ordered_extent
->len
,
1925 ordered_extent
->len
,
1926 compress_type
, 0, 0,
1927 BTRFS_FILE_EXTENT_REG
);
1928 unpin_extent_cache(&BTRFS_I(inode
)->extent_tree
,
1929 ordered_extent
->file_offset
,
1930 ordered_extent
->len
);
1934 btrfs_abort_transaction(trans
, root
, ret
);
1938 add_pending_csums(trans
, inode
, ordered_extent
->file_offset
,
1939 &ordered_extent
->list
);
1941 ret
= btrfs_ordered_update_i_size(inode
, 0, ordered_extent
);
1942 if (!ret
|| !test_bit(BTRFS_ORDERED_PREALLOC
, &ordered_extent
->flags
)) {
1943 ret
= btrfs_update_inode_fallback(trans
, root
, inode
);
1944 if (ret
) { /* -ENOMEM or corruption */
1945 btrfs_abort_transaction(trans
, root
, ret
);
1951 unlock_extent_cached(io_tree
, ordered_extent
->file_offset
,
1952 ordered_extent
->file_offset
+
1953 ordered_extent
->len
- 1, &cached_state
, GFP_NOFS
);
1955 if (root
!= root
->fs_info
->tree_root
)
1956 btrfs_delalloc_release_metadata(inode
, ordered_extent
->len
);
1959 btrfs_end_transaction_nolock(trans
, root
);
1961 btrfs_end_transaction(trans
, root
);
1965 clear_extent_uptodate(io_tree
, ordered_extent
->file_offset
,
1966 ordered_extent
->file_offset
+
1967 ordered_extent
->len
- 1, NULL
, GFP_NOFS
);
1970 * This needs to be dont to make sure anybody waiting knows we are done
1971 * upating everything for this ordered extent.
1973 btrfs_remove_ordered_extent(inode
, ordered_extent
);
1976 btrfs_put_ordered_extent(ordered_extent
);
1977 /* once for the tree */
1978 btrfs_put_ordered_extent(ordered_extent
);
1983 static void finish_ordered_fn(struct btrfs_work
*work
)
1985 struct btrfs_ordered_extent
*ordered_extent
;
1986 ordered_extent
= container_of(work
, struct btrfs_ordered_extent
, work
);
1987 btrfs_finish_ordered_io(ordered_extent
);
1990 static int btrfs_writepage_end_io_hook(struct page
*page
, u64 start
, u64 end
,
1991 struct extent_state
*state
, int uptodate
)
1993 struct inode
*inode
= page
->mapping
->host
;
1994 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
1995 struct btrfs_ordered_extent
*ordered_extent
= NULL
;
1996 struct btrfs_workers
*workers
;
1998 trace_btrfs_writepage_end_io_hook(page
, start
, end
, uptodate
);
2000 ClearPagePrivate2(page
);
2001 if (!btrfs_dec_test_ordered_pending(inode
, &ordered_extent
, start
,
2002 end
- start
+ 1, uptodate
))
2005 ordered_extent
->work
.func
= finish_ordered_fn
;
2006 ordered_extent
->work
.flags
= 0;
2008 if (btrfs_is_free_space_inode(inode
))
2009 workers
= &root
->fs_info
->endio_freespace_worker
;
2011 workers
= &root
->fs_info
->endio_write_workers
;
2012 btrfs_queue_worker(workers
, &ordered_extent
->work
);
2018 * when reads are done, we need to check csums to verify the data is correct
2019 * if there's a match, we allow the bio to finish. If not, the code in
2020 * extent_io.c will try to find good copies for us.
2022 static int btrfs_readpage_end_io_hook(struct page
*page
, u64 start
, u64 end
,
2023 struct extent_state
*state
, int mirror
)
2025 size_t offset
= start
- ((u64
)page
->index
<< PAGE_CACHE_SHIFT
);
2026 struct inode
*inode
= page
->mapping
->host
;
2027 struct extent_io_tree
*io_tree
= &BTRFS_I(inode
)->io_tree
;
2029 u64
private = ~(u32
)0;
2031 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
2034 if (PageChecked(page
)) {
2035 ClearPageChecked(page
);
2039 if (BTRFS_I(inode
)->flags
& BTRFS_INODE_NODATASUM
)
2042 if (root
->root_key
.objectid
== BTRFS_DATA_RELOC_TREE_OBJECTID
&&
2043 test_range_bit(io_tree
, start
, end
, EXTENT_NODATASUM
, 1, NULL
)) {
2044 clear_extent_bits(io_tree
, start
, end
, EXTENT_NODATASUM
,
2049 if (state
&& state
->start
== start
) {
2050 private = state
->private;
2053 ret
= get_state_private(io_tree
, start
, &private);
2055 kaddr
= kmap_atomic(page
);
2059 csum
= btrfs_csum_data(root
, kaddr
+ offset
, csum
, end
- start
+ 1);
2060 btrfs_csum_final(csum
, (char *)&csum
);
2061 if (csum
!= private)
2064 kunmap_atomic(kaddr
);
2069 printk_ratelimited(KERN_INFO
"btrfs csum failed ino %llu off %llu csum %u "
2071 (unsigned long long)btrfs_ino(page
->mapping
->host
),
2072 (unsigned long long)start
, csum
,
2073 (unsigned long long)private);
2074 memset(kaddr
+ offset
, 1, end
- start
+ 1);
2075 flush_dcache_page(page
);
2076 kunmap_atomic(kaddr
);
2082 struct delayed_iput
{
2083 struct list_head list
;
2084 struct inode
*inode
;
2087 /* JDM: If this is fs-wide, why can't we add a pointer to
2088 * btrfs_inode instead and avoid the allocation? */
2089 void btrfs_add_delayed_iput(struct inode
*inode
)
2091 struct btrfs_fs_info
*fs_info
= BTRFS_I(inode
)->root
->fs_info
;
2092 struct delayed_iput
*delayed
;
2094 if (atomic_add_unless(&inode
->i_count
, -1, 1))
2097 delayed
= kmalloc(sizeof(*delayed
), GFP_NOFS
| __GFP_NOFAIL
);
2098 delayed
->inode
= inode
;
2100 spin_lock(&fs_info
->delayed_iput_lock
);
2101 list_add_tail(&delayed
->list
, &fs_info
->delayed_iputs
);
2102 spin_unlock(&fs_info
->delayed_iput_lock
);
2105 void btrfs_run_delayed_iputs(struct btrfs_root
*root
)
2108 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
2109 struct delayed_iput
*delayed
;
2112 spin_lock(&fs_info
->delayed_iput_lock
);
2113 empty
= list_empty(&fs_info
->delayed_iputs
);
2114 spin_unlock(&fs_info
->delayed_iput_lock
);
2118 down_read(&root
->fs_info
->cleanup_work_sem
);
2119 spin_lock(&fs_info
->delayed_iput_lock
);
2120 list_splice_init(&fs_info
->delayed_iputs
, &list
);
2121 spin_unlock(&fs_info
->delayed_iput_lock
);
2123 while (!list_empty(&list
)) {
2124 delayed
= list_entry(list
.next
, struct delayed_iput
, list
);
2125 list_del(&delayed
->list
);
2126 iput(delayed
->inode
);
2129 up_read(&root
->fs_info
->cleanup_work_sem
);
2132 enum btrfs_orphan_cleanup_state
{
2133 ORPHAN_CLEANUP_STARTED
= 1,
2134 ORPHAN_CLEANUP_DONE
= 2,
2138 * This is called in transaction commit time. If there are no orphan
2139 * files in the subvolume, it removes orphan item and frees block_rsv
2142 void btrfs_orphan_commit_root(struct btrfs_trans_handle
*trans
,
2143 struct btrfs_root
*root
)
2145 struct btrfs_block_rsv
*block_rsv
;
2148 if (atomic_read(&root
->orphan_inodes
) ||
2149 root
->orphan_cleanup_state
!= ORPHAN_CLEANUP_DONE
)
2152 spin_lock(&root
->orphan_lock
);
2153 if (atomic_read(&root
->orphan_inodes
)) {
2154 spin_unlock(&root
->orphan_lock
);
2158 if (root
->orphan_cleanup_state
!= ORPHAN_CLEANUP_DONE
) {
2159 spin_unlock(&root
->orphan_lock
);
2163 block_rsv
= root
->orphan_block_rsv
;
2164 root
->orphan_block_rsv
= NULL
;
2165 spin_unlock(&root
->orphan_lock
);
2167 if (root
->orphan_item_inserted
&&
2168 btrfs_root_refs(&root
->root_item
) > 0) {
2169 ret
= btrfs_del_orphan_item(trans
, root
->fs_info
->tree_root
,
2170 root
->root_key
.objectid
);
2172 root
->orphan_item_inserted
= 0;
2176 WARN_ON(block_rsv
->size
> 0);
2177 btrfs_free_block_rsv(root
, block_rsv
);
2182 * This creates an orphan entry for the given inode in case something goes
2183 * wrong in the middle of an unlink/truncate.
2185 * NOTE: caller of this function should reserve 5 units of metadata for
2188 int btrfs_orphan_add(struct btrfs_trans_handle
*trans
, struct inode
*inode
)
2190 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
2191 struct btrfs_block_rsv
*block_rsv
= NULL
;
2196 if (!root
->orphan_block_rsv
) {
2197 block_rsv
= btrfs_alloc_block_rsv(root
);
2202 spin_lock(&root
->orphan_lock
);
2203 if (!root
->orphan_block_rsv
) {
2204 root
->orphan_block_rsv
= block_rsv
;
2205 } else if (block_rsv
) {
2206 btrfs_free_block_rsv(root
, block_rsv
);
2210 if (!test_and_set_bit(BTRFS_INODE_HAS_ORPHAN_ITEM
,
2211 &BTRFS_I(inode
)->runtime_flags
)) {
2214 * For proper ENOSPC handling, we should do orphan
2215 * cleanup when mounting. But this introduces backward
2216 * compatibility issue.
2218 if (!xchg(&root
->orphan_item_inserted
, 1))
2224 atomic_dec(&root
->orphan_inodes
);
2227 if (!test_and_set_bit(BTRFS_INODE_ORPHAN_META_RESERVED
,
2228 &BTRFS_I(inode
)->runtime_flags
))
2230 spin_unlock(&root
->orphan_lock
);
2232 /* grab metadata reservation from transaction handle */
2234 ret
= btrfs_orphan_reserve_metadata(trans
, inode
);
2235 BUG_ON(ret
); /* -ENOSPC in reservation; Logic error? JDM */
2238 /* insert an orphan item to track this unlinked/truncated file */
2240 ret
= btrfs_insert_orphan_item(trans
, root
, btrfs_ino(inode
));
2241 if (ret
&& ret
!= -EEXIST
) {
2242 clear_bit(BTRFS_INODE_HAS_ORPHAN_ITEM
,
2243 &BTRFS_I(inode
)->runtime_flags
);
2244 btrfs_abort_transaction(trans
, root
, ret
);
2250 /* insert an orphan item to track subvolume contains orphan files */
2252 ret
= btrfs_insert_orphan_item(trans
, root
->fs_info
->tree_root
,
2253 root
->root_key
.objectid
);
2254 if (ret
&& ret
!= -EEXIST
) {
2255 btrfs_abort_transaction(trans
, root
, ret
);
2263 * We have done the truncate/delete so we can go ahead and remove the orphan
2264 * item for this particular inode.
2266 int btrfs_orphan_del(struct btrfs_trans_handle
*trans
, struct inode
*inode
)
2268 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
2269 int delete_item
= 0;
2270 int release_rsv
= 0;
2273 spin_lock(&root
->orphan_lock
);
2274 if (test_and_clear_bit(BTRFS_INODE_HAS_ORPHAN_ITEM
,
2275 &BTRFS_I(inode
)->runtime_flags
))
2278 if (test_and_clear_bit(BTRFS_INODE_ORPHAN_META_RESERVED
,
2279 &BTRFS_I(inode
)->runtime_flags
))
2281 spin_unlock(&root
->orphan_lock
);
2283 if (trans
&& delete_item
) {
2284 ret
= btrfs_del_orphan_item(trans
, root
, btrfs_ino(inode
));
2285 BUG_ON(ret
); /* -ENOMEM or corruption (JDM: Recheck) */
2289 btrfs_orphan_release_metadata(inode
);
2290 atomic_dec(&root
->orphan_inodes
);
2297 * this cleans up any orphans that may be left on the list from the last use
2300 int btrfs_orphan_cleanup(struct btrfs_root
*root
)
2302 struct btrfs_path
*path
;
2303 struct extent_buffer
*leaf
;
2304 struct btrfs_key key
, found_key
;
2305 struct btrfs_trans_handle
*trans
;
2306 struct inode
*inode
;
2307 u64 last_objectid
= 0;
2308 int ret
= 0, nr_unlink
= 0, nr_truncate
= 0;
2310 if (cmpxchg(&root
->orphan_cleanup_state
, 0, ORPHAN_CLEANUP_STARTED
))
2313 path
= btrfs_alloc_path();
2320 key
.objectid
= BTRFS_ORPHAN_OBJECTID
;
2321 btrfs_set_key_type(&key
, BTRFS_ORPHAN_ITEM_KEY
);
2322 key
.offset
= (u64
)-1;
2325 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
2330 * if ret == 0 means we found what we were searching for, which
2331 * is weird, but possible, so only screw with path if we didn't
2332 * find the key and see if we have stuff that matches
2336 if (path
->slots
[0] == 0)
2341 /* pull out the item */
2342 leaf
= path
->nodes
[0];
2343 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
2345 /* make sure the item matches what we want */
2346 if (found_key
.objectid
!= BTRFS_ORPHAN_OBJECTID
)
2348 if (btrfs_key_type(&found_key
) != BTRFS_ORPHAN_ITEM_KEY
)
2351 /* release the path since we're done with it */
2352 btrfs_release_path(path
);
2355 * this is where we are basically btrfs_lookup, without the
2356 * crossing root thing. we store the inode number in the
2357 * offset of the orphan item.
2360 if (found_key
.offset
== last_objectid
) {
2361 printk(KERN_ERR
"btrfs: Error removing orphan entry, "
2362 "stopping orphan cleanup\n");
2367 last_objectid
= found_key
.offset
;
2369 found_key
.objectid
= found_key
.offset
;
2370 found_key
.type
= BTRFS_INODE_ITEM_KEY
;
2371 found_key
.offset
= 0;
2372 inode
= btrfs_iget(root
->fs_info
->sb
, &found_key
, root
, NULL
);
2373 ret
= PTR_RET(inode
);
2374 if (ret
&& ret
!= -ESTALE
)
2377 if (ret
== -ESTALE
&& root
== root
->fs_info
->tree_root
) {
2378 struct btrfs_root
*dead_root
;
2379 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
2380 int is_dead_root
= 0;
2383 * this is an orphan in the tree root. Currently these
2384 * could come from 2 sources:
2385 * a) a snapshot deletion in progress
2386 * b) a free space cache inode
2387 * We need to distinguish those two, as the snapshot
2388 * orphan must not get deleted.
2389 * find_dead_roots already ran before us, so if this
2390 * is a snapshot deletion, we should find the root
2391 * in the dead_roots list
2393 spin_lock(&fs_info
->trans_lock
);
2394 list_for_each_entry(dead_root
, &fs_info
->dead_roots
,
2396 if (dead_root
->root_key
.objectid
==
2397 found_key
.objectid
) {
2402 spin_unlock(&fs_info
->trans_lock
);
2404 /* prevent this orphan from being found again */
2405 key
.offset
= found_key
.objectid
- 1;
2410 * Inode is already gone but the orphan item is still there,
2411 * kill the orphan item.
2413 if (ret
== -ESTALE
) {
2414 trans
= btrfs_start_transaction(root
, 1);
2415 if (IS_ERR(trans
)) {
2416 ret
= PTR_ERR(trans
);
2419 printk(KERN_ERR
"auto deleting %Lu\n",
2420 found_key
.objectid
);
2421 ret
= btrfs_del_orphan_item(trans
, root
,
2422 found_key
.objectid
);
2423 BUG_ON(ret
); /* -ENOMEM or corruption (JDM: Recheck) */
2424 btrfs_end_transaction(trans
, root
);
2429 * add this inode to the orphan list so btrfs_orphan_del does
2430 * the proper thing when we hit it
2432 set_bit(BTRFS_INODE_HAS_ORPHAN_ITEM
,
2433 &BTRFS_I(inode
)->runtime_flags
);
2435 /* if we have links, this was a truncate, lets do that */
2436 if (inode
->i_nlink
) {
2437 if (!S_ISREG(inode
->i_mode
)) {
2443 ret
= btrfs_truncate(inode
);
2448 /* this will do delete_inode and everything for us */
2453 /* release the path since we're done with it */
2454 btrfs_release_path(path
);
2456 root
->orphan_cleanup_state
= ORPHAN_CLEANUP_DONE
;
2458 if (root
->orphan_block_rsv
)
2459 btrfs_block_rsv_release(root
, root
->orphan_block_rsv
,
2462 if (root
->orphan_block_rsv
|| root
->orphan_item_inserted
) {
2463 trans
= btrfs_join_transaction(root
);
2465 btrfs_end_transaction(trans
, root
);
2469 printk(KERN_INFO
"btrfs: unlinked %d orphans\n", nr_unlink
);
2471 printk(KERN_INFO
"btrfs: truncated %d orphans\n", nr_truncate
);
2475 printk(KERN_CRIT
"btrfs: could not do orphan cleanup %d\n", ret
);
2476 btrfs_free_path(path
);
2481 * very simple check to peek ahead in the leaf looking for xattrs. If we
2482 * don't find any xattrs, we know there can't be any acls.
2484 * slot is the slot the inode is in, objectid is the objectid of the inode
2486 static noinline
int acls_after_inode_item(struct extent_buffer
*leaf
,
2487 int slot
, u64 objectid
)
2489 u32 nritems
= btrfs_header_nritems(leaf
);
2490 struct btrfs_key found_key
;
2494 while (slot
< nritems
) {
2495 btrfs_item_key_to_cpu(leaf
, &found_key
, slot
);
2497 /* we found a different objectid, there must not be acls */
2498 if (found_key
.objectid
!= objectid
)
2501 /* we found an xattr, assume we've got an acl */
2502 if (found_key
.type
== BTRFS_XATTR_ITEM_KEY
)
2506 * we found a key greater than an xattr key, there can't
2507 * be any acls later on
2509 if (found_key
.type
> BTRFS_XATTR_ITEM_KEY
)
2516 * it goes inode, inode backrefs, xattrs, extents,
2517 * so if there are a ton of hard links to an inode there can
2518 * be a lot of backrefs. Don't waste time searching too hard,
2519 * this is just an optimization
2524 /* we hit the end of the leaf before we found an xattr or
2525 * something larger than an xattr. We have to assume the inode
2532 * read an inode from the btree into the in-memory inode
2534 static void btrfs_read_locked_inode(struct inode
*inode
)
2536 struct btrfs_path
*path
;
2537 struct extent_buffer
*leaf
;
2538 struct btrfs_inode_item
*inode_item
;
2539 struct btrfs_timespec
*tspec
;
2540 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
2541 struct btrfs_key location
;
2545 bool filled
= false;
2547 ret
= btrfs_fill_inode(inode
, &rdev
);
2551 path
= btrfs_alloc_path();
2555 path
->leave_spinning
= 1;
2556 memcpy(&location
, &BTRFS_I(inode
)->location
, sizeof(location
));
2558 ret
= btrfs_lookup_inode(NULL
, root
, path
, &location
, 0);
2562 leaf
= path
->nodes
[0];
2567 inode_item
= btrfs_item_ptr(leaf
, path
->slots
[0],
2568 struct btrfs_inode_item
);
2569 inode
->i_mode
= btrfs_inode_mode(leaf
, inode_item
);
2570 set_nlink(inode
, btrfs_inode_nlink(leaf
, inode_item
));
2571 inode
->i_uid
= btrfs_inode_uid(leaf
, inode_item
);
2572 inode
->i_gid
= btrfs_inode_gid(leaf
, inode_item
);
2573 btrfs_i_size_write(inode
, btrfs_inode_size(leaf
, inode_item
));
2575 tspec
= btrfs_inode_atime(inode_item
);
2576 inode
->i_atime
.tv_sec
= btrfs_timespec_sec(leaf
, tspec
);
2577 inode
->i_atime
.tv_nsec
= btrfs_timespec_nsec(leaf
, tspec
);
2579 tspec
= btrfs_inode_mtime(inode_item
);
2580 inode
->i_mtime
.tv_sec
= btrfs_timespec_sec(leaf
, tspec
);
2581 inode
->i_mtime
.tv_nsec
= btrfs_timespec_nsec(leaf
, tspec
);
2583 tspec
= btrfs_inode_ctime(inode_item
);
2584 inode
->i_ctime
.tv_sec
= btrfs_timespec_sec(leaf
, tspec
);
2585 inode
->i_ctime
.tv_nsec
= btrfs_timespec_nsec(leaf
, tspec
);
2587 inode_set_bytes(inode
, btrfs_inode_nbytes(leaf
, inode_item
));
2588 BTRFS_I(inode
)->generation
= btrfs_inode_generation(leaf
, inode_item
);
2589 inode
->i_version
= btrfs_inode_sequence(leaf
, inode_item
);
2590 inode
->i_generation
= BTRFS_I(inode
)->generation
;
2592 rdev
= btrfs_inode_rdev(leaf
, inode_item
);
2594 BTRFS_I(inode
)->index_cnt
= (u64
)-1;
2595 BTRFS_I(inode
)->flags
= btrfs_inode_flags(leaf
, inode_item
);
2598 * try to precache a NULL acl entry for files that don't have
2599 * any xattrs or acls
2601 maybe_acls
= acls_after_inode_item(leaf
, path
->slots
[0],
2604 cache_no_acl(inode
);
2606 btrfs_free_path(path
);
2608 switch (inode
->i_mode
& S_IFMT
) {
2610 inode
->i_mapping
->a_ops
= &btrfs_aops
;
2611 inode
->i_mapping
->backing_dev_info
= &root
->fs_info
->bdi
;
2612 BTRFS_I(inode
)->io_tree
.ops
= &btrfs_extent_io_ops
;
2613 inode
->i_fop
= &btrfs_file_operations
;
2614 inode
->i_op
= &btrfs_file_inode_operations
;
2617 inode
->i_fop
= &btrfs_dir_file_operations
;
2618 if (root
== root
->fs_info
->tree_root
)
2619 inode
->i_op
= &btrfs_dir_ro_inode_operations
;
2621 inode
->i_op
= &btrfs_dir_inode_operations
;
2624 inode
->i_op
= &btrfs_symlink_inode_operations
;
2625 inode
->i_mapping
->a_ops
= &btrfs_symlink_aops
;
2626 inode
->i_mapping
->backing_dev_info
= &root
->fs_info
->bdi
;
2629 inode
->i_op
= &btrfs_special_inode_operations
;
2630 init_special_inode(inode
, inode
->i_mode
, rdev
);
2634 btrfs_update_iflags(inode
);
2638 btrfs_free_path(path
);
2639 make_bad_inode(inode
);
2643 * given a leaf and an inode, copy the inode fields into the leaf
2645 static void fill_inode_item(struct btrfs_trans_handle
*trans
,
2646 struct extent_buffer
*leaf
,
2647 struct btrfs_inode_item
*item
,
2648 struct inode
*inode
)
2650 btrfs_set_inode_uid(leaf
, item
, inode
->i_uid
);
2651 btrfs_set_inode_gid(leaf
, item
, inode
->i_gid
);
2652 btrfs_set_inode_size(leaf
, item
, BTRFS_I(inode
)->disk_i_size
);
2653 btrfs_set_inode_mode(leaf
, item
, inode
->i_mode
);
2654 btrfs_set_inode_nlink(leaf
, item
, inode
->i_nlink
);
2656 btrfs_set_timespec_sec(leaf
, btrfs_inode_atime(item
),
2657 inode
->i_atime
.tv_sec
);
2658 btrfs_set_timespec_nsec(leaf
, btrfs_inode_atime(item
),
2659 inode
->i_atime
.tv_nsec
);
2661 btrfs_set_timespec_sec(leaf
, btrfs_inode_mtime(item
),
2662 inode
->i_mtime
.tv_sec
);
2663 btrfs_set_timespec_nsec(leaf
, btrfs_inode_mtime(item
),
2664 inode
->i_mtime
.tv_nsec
);
2666 btrfs_set_timespec_sec(leaf
, btrfs_inode_ctime(item
),
2667 inode
->i_ctime
.tv_sec
);
2668 btrfs_set_timespec_nsec(leaf
, btrfs_inode_ctime(item
),
2669 inode
->i_ctime
.tv_nsec
);
2671 btrfs_set_inode_nbytes(leaf
, item
, inode_get_bytes(inode
));
2672 btrfs_set_inode_generation(leaf
, item
, BTRFS_I(inode
)->generation
);
2673 btrfs_set_inode_sequence(leaf
, item
, inode
->i_version
);
2674 btrfs_set_inode_transid(leaf
, item
, trans
->transid
);
2675 btrfs_set_inode_rdev(leaf
, item
, inode
->i_rdev
);
2676 btrfs_set_inode_flags(leaf
, item
, BTRFS_I(inode
)->flags
);
2677 btrfs_set_inode_block_group(leaf
, item
, 0);
2681 * copy everything in the in-memory inode into the btree.
2683 static noinline
int btrfs_update_inode_item(struct btrfs_trans_handle
*trans
,
2684 struct btrfs_root
*root
, struct inode
*inode
)
2686 struct btrfs_inode_item
*inode_item
;
2687 struct btrfs_path
*path
;
2688 struct extent_buffer
*leaf
;
2691 path
= btrfs_alloc_path();
2695 path
->leave_spinning
= 1;
2696 ret
= btrfs_lookup_inode(trans
, root
, path
, &BTRFS_I(inode
)->location
,
2704 btrfs_unlock_up_safe(path
, 1);
2705 leaf
= path
->nodes
[0];
2706 inode_item
= btrfs_item_ptr(leaf
, path
->slots
[0],
2707 struct btrfs_inode_item
);
2709 fill_inode_item(trans
, leaf
, inode_item
, inode
);
2710 btrfs_mark_buffer_dirty(leaf
);
2711 btrfs_set_inode_last_trans(trans
, inode
);
2714 btrfs_free_path(path
);
2719 * copy everything in the in-memory inode into the btree.
2721 noinline
int btrfs_update_inode(struct btrfs_trans_handle
*trans
,
2722 struct btrfs_root
*root
, struct inode
*inode
)
2727 * If the inode is a free space inode, we can deadlock during commit
2728 * if we put it into the delayed code.
2730 * The data relocation inode should also be directly updated
2733 if (!btrfs_is_free_space_inode(inode
)
2734 && root
->root_key
.objectid
!= BTRFS_DATA_RELOC_TREE_OBJECTID
) {
2735 btrfs_update_root_times(trans
, root
);
2737 ret
= btrfs_delayed_update_inode(trans
, root
, inode
);
2739 btrfs_set_inode_last_trans(trans
, inode
);
2743 return btrfs_update_inode_item(trans
, root
, inode
);
2746 static noinline
int btrfs_update_inode_fallback(struct btrfs_trans_handle
*trans
,
2747 struct btrfs_root
*root
, struct inode
*inode
)
2751 ret
= btrfs_update_inode(trans
, root
, inode
);
2753 return btrfs_update_inode_item(trans
, root
, inode
);
2758 * unlink helper that gets used here in inode.c and in the tree logging
2759 * recovery code. It remove a link in a directory with a given name, and
2760 * also drops the back refs in the inode to the directory
2762 static int __btrfs_unlink_inode(struct btrfs_trans_handle
*trans
,
2763 struct btrfs_root
*root
,
2764 struct inode
*dir
, struct inode
*inode
,
2765 const char *name
, int name_len
)
2767 struct btrfs_path
*path
;
2769 struct extent_buffer
*leaf
;
2770 struct btrfs_dir_item
*di
;
2771 struct btrfs_key key
;
2773 u64 ino
= btrfs_ino(inode
);
2774 u64 dir_ino
= btrfs_ino(dir
);
2776 path
= btrfs_alloc_path();
2782 path
->leave_spinning
= 1;
2783 di
= btrfs_lookup_dir_item(trans
, root
, path
, dir_ino
,
2784 name
, name_len
, -1);
2793 leaf
= path
->nodes
[0];
2794 btrfs_dir_item_key_to_cpu(leaf
, di
, &key
);
2795 ret
= btrfs_delete_one_dir_name(trans
, root
, path
, di
);
2798 btrfs_release_path(path
);
2800 ret
= btrfs_del_inode_ref(trans
, root
, name
, name_len
, ino
,
2803 printk(KERN_INFO
"btrfs failed to delete reference to %.*s, "
2804 "inode %llu parent %llu\n", name_len
, name
,
2805 (unsigned long long)ino
, (unsigned long long)dir_ino
);
2806 btrfs_abort_transaction(trans
, root
, ret
);
2810 ret
= btrfs_delete_delayed_dir_index(trans
, root
, dir
, index
);
2812 btrfs_abort_transaction(trans
, root
, ret
);
2816 ret
= btrfs_del_inode_ref_in_log(trans
, root
, name
, name_len
,
2818 if (ret
!= 0 && ret
!= -ENOENT
) {
2819 btrfs_abort_transaction(trans
, root
, ret
);
2823 ret
= btrfs_del_dir_entries_in_log(trans
, root
, name
, name_len
,
2828 btrfs_free_path(path
);
2832 btrfs_i_size_write(dir
, dir
->i_size
- name_len
* 2);
2833 inode_inc_iversion(inode
);
2834 inode_inc_iversion(dir
);
2835 inode
->i_ctime
= dir
->i_mtime
= dir
->i_ctime
= CURRENT_TIME
;
2836 ret
= btrfs_update_inode(trans
, root
, dir
);
2841 int btrfs_unlink_inode(struct btrfs_trans_handle
*trans
,
2842 struct btrfs_root
*root
,
2843 struct inode
*dir
, struct inode
*inode
,
2844 const char *name
, int name_len
)
2847 ret
= __btrfs_unlink_inode(trans
, root
, dir
, inode
, name
, name_len
);
2849 btrfs_drop_nlink(inode
);
2850 ret
= btrfs_update_inode(trans
, root
, inode
);
2856 /* helper to check if there is any shared block in the path */
2857 static int check_path_shared(struct btrfs_root
*root
,
2858 struct btrfs_path
*path
)
2860 struct extent_buffer
*eb
;
2864 for (level
= 0; level
< BTRFS_MAX_LEVEL
; level
++) {
2867 if (!path
->nodes
[level
])
2869 eb
= path
->nodes
[level
];
2870 if (!btrfs_block_can_be_shared(root
, eb
))
2872 ret
= btrfs_lookup_extent_info(NULL
, root
, eb
->start
, eb
->len
,
2881 * helper to start transaction for unlink and rmdir.
2883 * unlink and rmdir are special in btrfs, they do not always free space.
2884 * so in enospc case, we should make sure they will free space before
2885 * allowing them to use the global metadata reservation.
2887 static struct btrfs_trans_handle
*__unlink_start_trans(struct inode
*dir
,
2888 struct dentry
*dentry
)
2890 struct btrfs_trans_handle
*trans
;
2891 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
2892 struct btrfs_path
*path
;
2893 struct btrfs_inode_ref
*ref
;
2894 struct btrfs_dir_item
*di
;
2895 struct inode
*inode
= dentry
->d_inode
;
2900 u64 ino
= btrfs_ino(inode
);
2901 u64 dir_ino
= btrfs_ino(dir
);
2904 * 1 for the possible orphan item
2905 * 1 for the dir item
2906 * 1 for the dir index
2907 * 1 for the inode ref
2908 * 1 for the inode ref in the tree log
2909 * 2 for the dir entries in the log
2912 trans
= btrfs_start_transaction(root
, 8);
2913 if (!IS_ERR(trans
) || PTR_ERR(trans
) != -ENOSPC
)
2916 if (ino
== BTRFS_EMPTY_SUBVOL_DIR_OBJECTID
)
2917 return ERR_PTR(-ENOSPC
);
2919 /* check if there is someone else holds reference */
2920 if (S_ISDIR(inode
->i_mode
) && atomic_read(&inode
->i_count
) > 1)
2921 return ERR_PTR(-ENOSPC
);
2923 if (atomic_read(&inode
->i_count
) > 2)
2924 return ERR_PTR(-ENOSPC
);
2926 if (xchg(&root
->fs_info
->enospc_unlink
, 1))
2927 return ERR_PTR(-ENOSPC
);
2929 path
= btrfs_alloc_path();
2931 root
->fs_info
->enospc_unlink
= 0;
2932 return ERR_PTR(-ENOMEM
);
2935 /* 1 for the orphan item */
2936 trans
= btrfs_start_transaction(root
, 1);
2937 if (IS_ERR(trans
)) {
2938 btrfs_free_path(path
);
2939 root
->fs_info
->enospc_unlink
= 0;
2943 path
->skip_locking
= 1;
2944 path
->search_commit_root
= 1;
2946 ret
= btrfs_lookup_inode(trans
, root
, path
,
2947 &BTRFS_I(dir
)->location
, 0);
2953 if (check_path_shared(root
, path
))
2958 btrfs_release_path(path
);
2960 ret
= btrfs_lookup_inode(trans
, root
, path
,
2961 &BTRFS_I(inode
)->location
, 0);
2967 if (check_path_shared(root
, path
))
2972 btrfs_release_path(path
);
2974 if (ret
== 0 && S_ISREG(inode
->i_mode
)) {
2975 ret
= btrfs_lookup_file_extent(trans
, root
, path
,
2981 BUG_ON(ret
== 0); /* Corruption */
2982 if (check_path_shared(root
, path
))
2984 btrfs_release_path(path
);
2992 di
= btrfs_lookup_dir_item(trans
, root
, path
, dir_ino
,
2993 dentry
->d_name
.name
, dentry
->d_name
.len
, 0);
2999 if (check_path_shared(root
, path
))
3005 btrfs_release_path(path
);
3007 ref
= btrfs_lookup_inode_ref(trans
, root
, path
,
3008 dentry
->d_name
.name
, dentry
->d_name
.len
,
3014 BUG_ON(!ref
); /* Logic error */
3015 if (check_path_shared(root
, path
))
3017 index
= btrfs_inode_ref_index(path
->nodes
[0], ref
);
3018 btrfs_release_path(path
);
3021 * This is a commit root search, if we can lookup inode item and other
3022 * relative items in the commit root, it means the transaction of
3023 * dir/file creation has been committed, and the dir index item that we
3024 * delay to insert has also been inserted into the commit root. So
3025 * we needn't worry about the delayed insertion of the dir index item
3028 di
= btrfs_lookup_dir_index_item(trans
, root
, path
, dir_ino
, index
,
3029 dentry
->d_name
.name
, dentry
->d_name
.len
, 0);
3034 BUG_ON(ret
== -ENOENT
);
3035 if (check_path_shared(root
, path
))
3040 btrfs_free_path(path
);
3041 /* Migrate the orphan reservation over */
3043 err
= btrfs_block_rsv_migrate(trans
->block_rsv
,
3044 &root
->fs_info
->global_block_rsv
,
3045 trans
->bytes_reserved
);
3048 btrfs_end_transaction(trans
, root
);
3049 root
->fs_info
->enospc_unlink
= 0;
3050 return ERR_PTR(err
);
3053 trans
->block_rsv
= &root
->fs_info
->global_block_rsv
;
3057 static void __unlink_end_trans(struct btrfs_trans_handle
*trans
,
3058 struct btrfs_root
*root
)
3060 if (trans
->block_rsv
== &root
->fs_info
->global_block_rsv
) {
3061 btrfs_block_rsv_release(root
, trans
->block_rsv
,
3062 trans
->bytes_reserved
);
3063 trans
->block_rsv
= &root
->fs_info
->trans_block_rsv
;
3064 BUG_ON(!root
->fs_info
->enospc_unlink
);
3065 root
->fs_info
->enospc_unlink
= 0;
3067 btrfs_end_transaction(trans
, root
);
3070 static int btrfs_unlink(struct inode
*dir
, struct dentry
*dentry
)
3072 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
3073 struct btrfs_trans_handle
*trans
;
3074 struct inode
*inode
= dentry
->d_inode
;
3076 unsigned long nr
= 0;
3078 trans
= __unlink_start_trans(dir
, dentry
);
3080 return PTR_ERR(trans
);
3082 btrfs_record_unlink_dir(trans
, dir
, dentry
->d_inode
, 0);
3084 ret
= btrfs_unlink_inode(trans
, root
, dir
, dentry
->d_inode
,
3085 dentry
->d_name
.name
, dentry
->d_name
.len
);
3089 if (inode
->i_nlink
== 0) {
3090 ret
= btrfs_orphan_add(trans
, inode
);
3096 nr
= trans
->blocks_used
;
3097 __unlink_end_trans(trans
, root
);
3098 btrfs_btree_balance_dirty(root
, nr
);
3102 int btrfs_unlink_subvol(struct btrfs_trans_handle
*trans
,
3103 struct btrfs_root
*root
,
3104 struct inode
*dir
, u64 objectid
,
3105 const char *name
, int name_len
)
3107 struct btrfs_path
*path
;
3108 struct extent_buffer
*leaf
;
3109 struct btrfs_dir_item
*di
;
3110 struct btrfs_key key
;
3113 u64 dir_ino
= btrfs_ino(dir
);
3115 path
= btrfs_alloc_path();
3119 di
= btrfs_lookup_dir_item(trans
, root
, path
, dir_ino
,
3120 name
, name_len
, -1);
3121 if (IS_ERR_OR_NULL(di
)) {
3129 leaf
= path
->nodes
[0];
3130 btrfs_dir_item_key_to_cpu(leaf
, di
, &key
);
3131 WARN_ON(key
.type
!= BTRFS_ROOT_ITEM_KEY
|| key
.objectid
!= objectid
);
3132 ret
= btrfs_delete_one_dir_name(trans
, root
, path
, di
);
3134 btrfs_abort_transaction(trans
, root
, ret
);
3137 btrfs_release_path(path
);
3139 ret
= btrfs_del_root_ref(trans
, root
->fs_info
->tree_root
,
3140 objectid
, root
->root_key
.objectid
,
3141 dir_ino
, &index
, name
, name_len
);
3143 if (ret
!= -ENOENT
) {
3144 btrfs_abort_transaction(trans
, root
, ret
);
3147 di
= btrfs_search_dir_index_item(root
, path
, dir_ino
,
3149 if (IS_ERR_OR_NULL(di
)) {
3154 btrfs_abort_transaction(trans
, root
, ret
);
3158 leaf
= path
->nodes
[0];
3159 btrfs_item_key_to_cpu(leaf
, &key
, path
->slots
[0]);
3160 btrfs_release_path(path
);
3163 btrfs_release_path(path
);
3165 ret
= btrfs_delete_delayed_dir_index(trans
, root
, dir
, index
);
3167 btrfs_abort_transaction(trans
, root
, ret
);
3171 btrfs_i_size_write(dir
, dir
->i_size
- name_len
* 2);
3172 inode_inc_iversion(dir
);
3173 dir
->i_mtime
= dir
->i_ctime
= CURRENT_TIME
;
3174 ret
= btrfs_update_inode_fallback(trans
, root
, dir
);
3176 btrfs_abort_transaction(trans
, root
, ret
);
3178 btrfs_free_path(path
);
3182 static int btrfs_rmdir(struct inode
*dir
, struct dentry
*dentry
)
3184 struct inode
*inode
= dentry
->d_inode
;
3186 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
3187 struct btrfs_trans_handle
*trans
;
3188 unsigned long nr
= 0;
3190 if (inode
->i_size
> BTRFS_EMPTY_DIR_SIZE
||
3191 btrfs_ino(inode
) == BTRFS_FIRST_FREE_OBJECTID
)
3194 trans
= __unlink_start_trans(dir
, dentry
);
3196 return PTR_ERR(trans
);
3198 if (unlikely(btrfs_ino(inode
) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID
)) {
3199 err
= btrfs_unlink_subvol(trans
, root
, dir
,
3200 BTRFS_I(inode
)->location
.objectid
,
3201 dentry
->d_name
.name
,
3202 dentry
->d_name
.len
);
3206 err
= btrfs_orphan_add(trans
, inode
);
3210 /* now the directory is empty */
3211 err
= btrfs_unlink_inode(trans
, root
, dir
, dentry
->d_inode
,
3212 dentry
->d_name
.name
, dentry
->d_name
.len
);
3214 btrfs_i_size_write(inode
, 0);
3216 nr
= trans
->blocks_used
;
3217 __unlink_end_trans(trans
, root
);
3218 btrfs_btree_balance_dirty(root
, nr
);
3224 * this can truncate away extent items, csum items and directory items.
3225 * It starts at a high offset and removes keys until it can't find
3226 * any higher than new_size
3228 * csum items that cross the new i_size are truncated to the new size
3231 * min_type is the minimum key type to truncate down to. If set to 0, this
3232 * will kill all the items on this inode, including the INODE_ITEM_KEY.
3234 int btrfs_truncate_inode_items(struct btrfs_trans_handle
*trans
,
3235 struct btrfs_root
*root
,
3236 struct inode
*inode
,
3237 u64 new_size
, u32 min_type
)
3239 struct btrfs_path
*path
;
3240 struct extent_buffer
*leaf
;
3241 struct btrfs_file_extent_item
*fi
;
3242 struct btrfs_key key
;
3243 struct btrfs_key found_key
;
3244 u64 extent_start
= 0;
3245 u64 extent_num_bytes
= 0;
3246 u64 extent_offset
= 0;
3248 u64 mask
= root
->sectorsize
- 1;
3249 u32 found_type
= (u8
)-1;
3252 int pending_del_nr
= 0;
3253 int pending_del_slot
= 0;
3254 int extent_type
= -1;
3257 u64 ino
= btrfs_ino(inode
);
3259 BUG_ON(new_size
> 0 && min_type
!= BTRFS_EXTENT_DATA_KEY
);
3261 path
= btrfs_alloc_path();
3266 if (root
->ref_cows
|| root
== root
->fs_info
->tree_root
)
3267 btrfs_drop_extent_cache(inode
, new_size
& (~mask
), (u64
)-1, 0);
3270 * This function is also used to drop the items in the log tree before
3271 * we relog the inode, so if root != BTRFS_I(inode)->root, it means
3272 * it is used to drop the loged items. So we shouldn't kill the delayed
3275 if (min_type
== 0 && root
== BTRFS_I(inode
)->root
)
3276 btrfs_kill_delayed_inode_items(inode
);
3279 key
.offset
= (u64
)-1;
3283 path
->leave_spinning
= 1;
3284 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
3291 /* there are no items in the tree for us to truncate, we're
3294 if (path
->slots
[0] == 0)
3301 leaf
= path
->nodes
[0];
3302 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
3303 found_type
= btrfs_key_type(&found_key
);
3305 if (found_key
.objectid
!= ino
)
3308 if (found_type
< min_type
)
3311 item_end
= found_key
.offset
;
3312 if (found_type
== BTRFS_EXTENT_DATA_KEY
) {
3313 fi
= btrfs_item_ptr(leaf
, path
->slots
[0],
3314 struct btrfs_file_extent_item
);
3315 extent_type
= btrfs_file_extent_type(leaf
, fi
);
3316 if (extent_type
!= BTRFS_FILE_EXTENT_INLINE
) {
3318 btrfs_file_extent_num_bytes(leaf
, fi
);
3319 } else if (extent_type
== BTRFS_FILE_EXTENT_INLINE
) {
3320 item_end
+= btrfs_file_extent_inline_len(leaf
,
3325 if (found_type
> min_type
) {
3328 if (item_end
< new_size
)
3330 if (found_key
.offset
>= new_size
)
3336 /* FIXME, shrink the extent if the ref count is only 1 */
3337 if (found_type
!= BTRFS_EXTENT_DATA_KEY
)
3340 if (extent_type
!= BTRFS_FILE_EXTENT_INLINE
) {
3342 extent_start
= btrfs_file_extent_disk_bytenr(leaf
, fi
);
3344 u64 orig_num_bytes
=
3345 btrfs_file_extent_num_bytes(leaf
, fi
);
3346 extent_num_bytes
= new_size
-
3347 found_key
.offset
+ root
->sectorsize
- 1;
3348 extent_num_bytes
= extent_num_bytes
&
3349 ~((u64
)root
->sectorsize
- 1);
3350 btrfs_set_file_extent_num_bytes(leaf
, fi
,
3352 num_dec
= (orig_num_bytes
-
3354 if (root
->ref_cows
&& extent_start
!= 0)
3355 inode_sub_bytes(inode
, num_dec
);
3356 btrfs_mark_buffer_dirty(leaf
);
3359 btrfs_file_extent_disk_num_bytes(leaf
,
3361 extent_offset
= found_key
.offset
-
3362 btrfs_file_extent_offset(leaf
, fi
);
3364 /* FIXME blocksize != 4096 */
3365 num_dec
= btrfs_file_extent_num_bytes(leaf
, fi
);
3366 if (extent_start
!= 0) {
3369 inode_sub_bytes(inode
, num_dec
);
3372 } else if (extent_type
== BTRFS_FILE_EXTENT_INLINE
) {
3374 * we can't truncate inline items that have had
3378 btrfs_file_extent_compression(leaf
, fi
) == 0 &&
3379 btrfs_file_extent_encryption(leaf
, fi
) == 0 &&
3380 btrfs_file_extent_other_encoding(leaf
, fi
) == 0) {
3381 u32 size
= new_size
- found_key
.offset
;
3383 if (root
->ref_cows
) {
3384 inode_sub_bytes(inode
, item_end
+ 1 -
3388 btrfs_file_extent_calc_inline_size(size
);
3389 btrfs_truncate_item(trans
, root
, path
,
3391 } else if (root
->ref_cows
) {
3392 inode_sub_bytes(inode
, item_end
+ 1 -
3398 if (!pending_del_nr
) {
3399 /* no pending yet, add ourselves */
3400 pending_del_slot
= path
->slots
[0];
3402 } else if (pending_del_nr
&&
3403 path
->slots
[0] + 1 == pending_del_slot
) {
3404 /* hop on the pending chunk */
3406 pending_del_slot
= path
->slots
[0];
3413 if (found_extent
&& (root
->ref_cows
||
3414 root
== root
->fs_info
->tree_root
)) {
3415 btrfs_set_path_blocking(path
);
3416 ret
= btrfs_free_extent(trans
, root
, extent_start
,
3417 extent_num_bytes
, 0,
3418 btrfs_header_owner(leaf
),
3419 ino
, extent_offset
, 0);
3423 if (found_type
== BTRFS_INODE_ITEM_KEY
)
3426 if (path
->slots
[0] == 0 ||
3427 path
->slots
[0] != pending_del_slot
) {
3428 if (root
->ref_cows
&&
3429 BTRFS_I(inode
)->location
.objectid
!=
3430 BTRFS_FREE_INO_OBJECTID
) {
3434 if (pending_del_nr
) {
3435 ret
= btrfs_del_items(trans
, root
, path
,
3439 btrfs_abort_transaction(trans
,
3445 btrfs_release_path(path
);
3452 if (pending_del_nr
) {
3453 ret
= btrfs_del_items(trans
, root
, path
, pending_del_slot
,
3456 btrfs_abort_transaction(trans
, root
, ret
);
3459 btrfs_free_path(path
);
3464 * taken from block_truncate_page, but does cow as it zeros out
3465 * any bytes left in the last page in the file.
3467 static int btrfs_truncate_page(struct address_space
*mapping
, loff_t from
)
3469 struct inode
*inode
= mapping
->host
;
3470 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
3471 struct extent_io_tree
*io_tree
= &BTRFS_I(inode
)->io_tree
;
3472 struct btrfs_ordered_extent
*ordered
;
3473 struct extent_state
*cached_state
= NULL
;
3475 u32 blocksize
= root
->sectorsize
;
3476 pgoff_t index
= from
>> PAGE_CACHE_SHIFT
;
3477 unsigned offset
= from
& (PAGE_CACHE_SIZE
-1);
3479 gfp_t mask
= btrfs_alloc_write_mask(mapping
);
3484 if ((offset
& (blocksize
- 1)) == 0)
3486 ret
= btrfs_delalloc_reserve_space(inode
, PAGE_CACHE_SIZE
);
3492 page
= find_or_create_page(mapping
, index
, mask
);
3494 btrfs_delalloc_release_space(inode
, PAGE_CACHE_SIZE
);
3498 page_start
= page_offset(page
);
3499 page_end
= page_start
+ PAGE_CACHE_SIZE
- 1;
3501 if (!PageUptodate(page
)) {
3502 ret
= btrfs_readpage(NULL
, page
);
3504 if (page
->mapping
!= mapping
) {
3506 page_cache_release(page
);
3509 if (!PageUptodate(page
)) {
3514 wait_on_page_writeback(page
);
3516 lock_extent_bits(io_tree
, page_start
, page_end
, 0, &cached_state
);
3517 set_page_extent_mapped(page
);
3519 ordered
= btrfs_lookup_ordered_extent(inode
, page_start
);
3521 unlock_extent_cached(io_tree
, page_start
, page_end
,
3522 &cached_state
, GFP_NOFS
);
3524 page_cache_release(page
);
3525 btrfs_start_ordered_extent(inode
, ordered
, 1);
3526 btrfs_put_ordered_extent(ordered
);
3530 clear_extent_bit(&BTRFS_I(inode
)->io_tree
, page_start
, page_end
,
3531 EXTENT_DIRTY
| EXTENT_DELALLOC
| EXTENT_DO_ACCOUNTING
,
3532 0, 0, &cached_state
, GFP_NOFS
);
3534 ret
= btrfs_set_extent_delalloc(inode
, page_start
, page_end
,
3537 unlock_extent_cached(io_tree
, page_start
, page_end
,
3538 &cached_state
, GFP_NOFS
);
3543 if (offset
!= PAGE_CACHE_SIZE
) {
3545 memset(kaddr
+ offset
, 0, PAGE_CACHE_SIZE
- offset
);
3546 flush_dcache_page(page
);
3549 ClearPageChecked(page
);
3550 set_page_dirty(page
);
3551 unlock_extent_cached(io_tree
, page_start
, page_end
, &cached_state
,
3556 btrfs_delalloc_release_space(inode
, PAGE_CACHE_SIZE
);
3558 page_cache_release(page
);
3564 * This function puts in dummy file extents for the area we're creating a hole
3565 * for. So if we are truncating this file to a larger size we need to insert
3566 * these file extents so that btrfs_get_extent will return a EXTENT_MAP_HOLE for
3567 * the range between oldsize and size
3569 int btrfs_cont_expand(struct inode
*inode
, loff_t oldsize
, loff_t size
)
3571 struct btrfs_trans_handle
*trans
;
3572 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
3573 struct extent_io_tree
*io_tree
= &BTRFS_I(inode
)->io_tree
;
3574 struct extent_map
*em
= NULL
;
3575 struct extent_state
*cached_state
= NULL
;
3576 u64 mask
= root
->sectorsize
- 1;
3577 u64 hole_start
= (oldsize
+ mask
) & ~mask
;
3578 u64 block_end
= (size
+ mask
) & ~mask
;
3584 if (size
<= hole_start
)
3588 struct btrfs_ordered_extent
*ordered
;
3589 btrfs_wait_ordered_range(inode
, hole_start
,
3590 block_end
- hole_start
);
3591 lock_extent_bits(io_tree
, hole_start
, block_end
- 1, 0,
3593 ordered
= btrfs_lookup_ordered_extent(inode
, hole_start
);
3596 unlock_extent_cached(io_tree
, hole_start
, block_end
- 1,
3597 &cached_state
, GFP_NOFS
);
3598 btrfs_put_ordered_extent(ordered
);
3601 cur_offset
= hole_start
;
3603 em
= btrfs_get_extent(inode
, NULL
, 0, cur_offset
,
3604 block_end
- cur_offset
, 0);
3609 last_byte
= min(extent_map_end(em
), block_end
);
3610 last_byte
= (last_byte
+ mask
) & ~mask
;
3611 if (!test_bit(EXTENT_FLAG_PREALLOC
, &em
->flags
)) {
3613 hole_size
= last_byte
- cur_offset
;
3615 trans
= btrfs_start_transaction(root
, 3);
3616 if (IS_ERR(trans
)) {
3617 err
= PTR_ERR(trans
);
3621 err
= btrfs_drop_extents(trans
, inode
, cur_offset
,
3622 cur_offset
+ hole_size
,
3625 btrfs_abort_transaction(trans
, root
, err
);
3626 btrfs_end_transaction(trans
, root
);
3630 err
= btrfs_insert_file_extent(trans
, root
,
3631 btrfs_ino(inode
), cur_offset
, 0,
3632 0, hole_size
, 0, hole_size
,
3635 btrfs_abort_transaction(trans
, root
, err
);
3636 btrfs_end_transaction(trans
, root
);
3640 btrfs_drop_extent_cache(inode
, hole_start
,
3643 btrfs_update_inode(trans
, root
, inode
);
3644 btrfs_end_transaction(trans
, root
);
3646 free_extent_map(em
);
3648 cur_offset
= last_byte
;
3649 if (cur_offset
>= block_end
)
3653 free_extent_map(em
);
3654 unlock_extent_cached(io_tree
, hole_start
, block_end
- 1, &cached_state
,
3659 static int btrfs_setsize(struct inode
*inode
, loff_t newsize
)
3661 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
3662 struct btrfs_trans_handle
*trans
;
3663 loff_t oldsize
= i_size_read(inode
);
3666 if (newsize
== oldsize
)
3669 if (newsize
> oldsize
) {
3670 truncate_pagecache(inode
, oldsize
, newsize
);
3671 ret
= btrfs_cont_expand(inode
, oldsize
, newsize
);
3675 trans
= btrfs_start_transaction(root
, 1);
3677 return PTR_ERR(trans
);
3679 i_size_write(inode
, newsize
);
3680 btrfs_ordered_update_i_size(inode
, i_size_read(inode
), NULL
);
3681 ret
= btrfs_update_inode(trans
, root
, inode
);
3682 btrfs_end_transaction(trans
, root
);
3686 * We're truncating a file that used to have good data down to
3687 * zero. Make sure it gets into the ordered flush list so that
3688 * any new writes get down to disk quickly.
3691 set_bit(BTRFS_INODE_ORDERED_DATA_CLOSE
,
3692 &BTRFS_I(inode
)->runtime_flags
);
3694 /* we don't support swapfiles, so vmtruncate shouldn't fail */
3695 truncate_setsize(inode
, newsize
);
3696 ret
= btrfs_truncate(inode
);
3702 static int btrfs_setattr(struct dentry
*dentry
, struct iattr
*attr
)
3704 struct inode
*inode
= dentry
->d_inode
;
3705 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
3708 if (btrfs_root_readonly(root
))
3711 err
= inode_change_ok(inode
, attr
);
3715 if (S_ISREG(inode
->i_mode
) && (attr
->ia_valid
& ATTR_SIZE
)) {
3716 err
= btrfs_setsize(inode
, attr
->ia_size
);
3721 if (attr
->ia_valid
) {
3722 setattr_copy(inode
, attr
);
3723 inode_inc_iversion(inode
);
3724 err
= btrfs_dirty_inode(inode
);
3726 if (!err
&& attr
->ia_valid
& ATTR_MODE
)
3727 err
= btrfs_acl_chmod(inode
);
3733 void btrfs_evict_inode(struct inode
*inode
)
3735 struct btrfs_trans_handle
*trans
;
3736 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
3737 struct btrfs_block_rsv
*rsv
, *global_rsv
;
3738 u64 min_size
= btrfs_calc_trunc_metadata_size(root
, 1);
3742 trace_btrfs_inode_evict(inode
);
3744 truncate_inode_pages(&inode
->i_data
, 0);
3745 if (inode
->i_nlink
&& (btrfs_root_refs(&root
->root_item
) != 0 ||
3746 btrfs_is_free_space_inode(inode
)))
3749 if (is_bad_inode(inode
)) {
3750 btrfs_orphan_del(NULL
, inode
);
3753 /* do we really want it for ->i_nlink > 0 and zero btrfs_root_refs? */
3754 btrfs_wait_ordered_range(inode
, 0, (u64
)-1);
3756 if (root
->fs_info
->log_root_recovering
) {
3757 BUG_ON(test_bit(BTRFS_INODE_HAS_ORPHAN_ITEM
,
3758 &BTRFS_I(inode
)->runtime_flags
));
3762 if (inode
->i_nlink
> 0) {
3763 BUG_ON(btrfs_root_refs(&root
->root_item
) != 0);
3767 rsv
= btrfs_alloc_block_rsv(root
);
3769 btrfs_orphan_del(NULL
, inode
);
3772 rsv
->size
= min_size
;
3773 global_rsv
= &root
->fs_info
->global_block_rsv
;
3775 btrfs_i_size_write(inode
, 0);
3778 * This is a bit simpler than btrfs_truncate since
3780 * 1) We've already reserved our space for our orphan item in the
3782 * 2) We're going to delete the inode item, so we don't need to update
3785 * So we just need to reserve some slack space in case we add bytes when
3786 * doing the truncate.
3789 ret
= btrfs_block_rsv_refill_noflush(root
, rsv
, min_size
);
3792 * Try and steal from the global reserve since we will
3793 * likely not use this space anyway, we want to try as
3794 * hard as possible to get this to work.
3797 ret
= btrfs_block_rsv_migrate(global_rsv
, rsv
, min_size
);
3800 printk(KERN_WARNING
"Could not get space for a "
3801 "delete, will truncate on mount %d\n", ret
);
3802 btrfs_orphan_del(NULL
, inode
);
3803 btrfs_free_block_rsv(root
, rsv
);
3807 trans
= btrfs_start_transaction(root
, 0);
3808 if (IS_ERR(trans
)) {
3809 btrfs_orphan_del(NULL
, inode
);
3810 btrfs_free_block_rsv(root
, rsv
);
3814 trans
->block_rsv
= rsv
;
3816 ret
= btrfs_truncate_inode_items(trans
, root
, inode
, 0, 0);
3820 nr
= trans
->blocks_used
;
3821 btrfs_end_transaction(trans
, root
);
3823 btrfs_btree_balance_dirty(root
, nr
);
3826 btrfs_free_block_rsv(root
, rsv
);
3829 trans
->block_rsv
= root
->orphan_block_rsv
;
3830 ret
= btrfs_orphan_del(trans
, inode
);
3834 trans
->block_rsv
= &root
->fs_info
->trans_block_rsv
;
3835 if (!(root
== root
->fs_info
->tree_root
||
3836 root
->root_key
.objectid
== BTRFS_TREE_RELOC_OBJECTID
))
3837 btrfs_return_ino(root
, btrfs_ino(inode
));
3839 nr
= trans
->blocks_used
;
3840 btrfs_end_transaction(trans
, root
);
3841 btrfs_btree_balance_dirty(root
, nr
);
3848 * this returns the key found in the dir entry in the location pointer.
3849 * If no dir entries were found, location->objectid is 0.
3851 static int btrfs_inode_by_name(struct inode
*dir
, struct dentry
*dentry
,
3852 struct btrfs_key
*location
)
3854 const char *name
= dentry
->d_name
.name
;
3855 int namelen
= dentry
->d_name
.len
;
3856 struct btrfs_dir_item
*di
;
3857 struct btrfs_path
*path
;
3858 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
3861 path
= btrfs_alloc_path();
3865 di
= btrfs_lookup_dir_item(NULL
, root
, path
, btrfs_ino(dir
), name
,
3870 if (IS_ERR_OR_NULL(di
))
3873 btrfs_dir_item_key_to_cpu(path
->nodes
[0], di
, location
);
3875 btrfs_free_path(path
);
3878 location
->objectid
= 0;
3883 * when we hit a tree root in a directory, the btrfs part of the inode
3884 * needs to be changed to reflect the root directory of the tree root. This
3885 * is kind of like crossing a mount point.
3887 static int fixup_tree_root_location(struct btrfs_root
*root
,
3889 struct dentry
*dentry
,
3890 struct btrfs_key
*location
,
3891 struct btrfs_root
**sub_root
)
3893 struct btrfs_path
*path
;
3894 struct btrfs_root
*new_root
;
3895 struct btrfs_root_ref
*ref
;
3896 struct extent_buffer
*leaf
;
3900 path
= btrfs_alloc_path();
3907 ret
= btrfs_find_root_ref(root
->fs_info
->tree_root
, path
,
3908 BTRFS_I(dir
)->root
->root_key
.objectid
,
3909 location
->objectid
);
3916 leaf
= path
->nodes
[0];
3917 ref
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_root_ref
);
3918 if (btrfs_root_ref_dirid(leaf
, ref
) != btrfs_ino(dir
) ||
3919 btrfs_root_ref_name_len(leaf
, ref
) != dentry
->d_name
.len
)
3922 ret
= memcmp_extent_buffer(leaf
, dentry
->d_name
.name
,
3923 (unsigned long)(ref
+ 1),
3924 dentry
->d_name
.len
);
3928 btrfs_release_path(path
);
3930 new_root
= btrfs_read_fs_root_no_name(root
->fs_info
, location
);
3931 if (IS_ERR(new_root
)) {
3932 err
= PTR_ERR(new_root
);
3936 if (btrfs_root_refs(&new_root
->root_item
) == 0) {
3941 *sub_root
= new_root
;
3942 location
->objectid
= btrfs_root_dirid(&new_root
->root_item
);
3943 location
->type
= BTRFS_INODE_ITEM_KEY
;
3944 location
->offset
= 0;
3947 btrfs_free_path(path
);
3951 static void inode_tree_add(struct inode
*inode
)
3953 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
3954 struct btrfs_inode
*entry
;
3956 struct rb_node
*parent
;
3957 u64 ino
= btrfs_ino(inode
);
3959 p
= &root
->inode_tree
.rb_node
;
3962 if (inode_unhashed(inode
))
3965 spin_lock(&root
->inode_lock
);
3968 entry
= rb_entry(parent
, struct btrfs_inode
, rb_node
);
3970 if (ino
< btrfs_ino(&entry
->vfs_inode
))
3971 p
= &parent
->rb_left
;
3972 else if (ino
> btrfs_ino(&entry
->vfs_inode
))
3973 p
= &parent
->rb_right
;
3975 WARN_ON(!(entry
->vfs_inode
.i_state
&
3976 (I_WILL_FREE
| I_FREEING
)));
3977 rb_erase(parent
, &root
->inode_tree
);
3978 RB_CLEAR_NODE(parent
);
3979 spin_unlock(&root
->inode_lock
);
3983 rb_link_node(&BTRFS_I(inode
)->rb_node
, parent
, p
);
3984 rb_insert_color(&BTRFS_I(inode
)->rb_node
, &root
->inode_tree
);
3985 spin_unlock(&root
->inode_lock
);
3988 static void inode_tree_del(struct inode
*inode
)
3990 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
3993 spin_lock(&root
->inode_lock
);
3994 if (!RB_EMPTY_NODE(&BTRFS_I(inode
)->rb_node
)) {
3995 rb_erase(&BTRFS_I(inode
)->rb_node
, &root
->inode_tree
);
3996 RB_CLEAR_NODE(&BTRFS_I(inode
)->rb_node
);
3997 empty
= RB_EMPTY_ROOT(&root
->inode_tree
);
3999 spin_unlock(&root
->inode_lock
);
4002 * Free space cache has inodes in the tree root, but the tree root has a
4003 * root_refs of 0, so this could end up dropping the tree root as a
4004 * snapshot, so we need the extra !root->fs_info->tree_root check to
4005 * make sure we don't drop it.
4007 if (empty
&& btrfs_root_refs(&root
->root_item
) == 0 &&
4008 root
!= root
->fs_info
->tree_root
) {
4009 synchronize_srcu(&root
->fs_info
->subvol_srcu
);
4010 spin_lock(&root
->inode_lock
);
4011 empty
= RB_EMPTY_ROOT(&root
->inode_tree
);
4012 spin_unlock(&root
->inode_lock
);
4014 btrfs_add_dead_root(root
);
4018 void btrfs_invalidate_inodes(struct btrfs_root
*root
)
4020 struct rb_node
*node
;
4021 struct rb_node
*prev
;
4022 struct btrfs_inode
*entry
;
4023 struct inode
*inode
;
4026 WARN_ON(btrfs_root_refs(&root
->root_item
) != 0);
4028 spin_lock(&root
->inode_lock
);
4030 node
= root
->inode_tree
.rb_node
;
4034 entry
= rb_entry(node
, struct btrfs_inode
, rb_node
);
4036 if (objectid
< btrfs_ino(&entry
->vfs_inode
))
4037 node
= node
->rb_left
;
4038 else if (objectid
> btrfs_ino(&entry
->vfs_inode
))
4039 node
= node
->rb_right
;
4045 entry
= rb_entry(prev
, struct btrfs_inode
, rb_node
);
4046 if (objectid
<= btrfs_ino(&entry
->vfs_inode
)) {
4050 prev
= rb_next(prev
);
4054 entry
= rb_entry(node
, struct btrfs_inode
, rb_node
);
4055 objectid
= btrfs_ino(&entry
->vfs_inode
) + 1;
4056 inode
= igrab(&entry
->vfs_inode
);
4058 spin_unlock(&root
->inode_lock
);
4059 if (atomic_read(&inode
->i_count
) > 1)
4060 d_prune_aliases(inode
);
4062 * btrfs_drop_inode will have it removed from
4063 * the inode cache when its usage count
4068 spin_lock(&root
->inode_lock
);
4072 if (cond_resched_lock(&root
->inode_lock
))
4075 node
= rb_next(node
);
4077 spin_unlock(&root
->inode_lock
);
4080 static int btrfs_init_locked_inode(struct inode
*inode
, void *p
)
4082 struct btrfs_iget_args
*args
= p
;
4083 inode
->i_ino
= args
->ino
;
4084 BTRFS_I(inode
)->root
= args
->root
;
4088 static int btrfs_find_actor(struct inode
*inode
, void *opaque
)
4090 struct btrfs_iget_args
*args
= opaque
;
4091 return args
->ino
== btrfs_ino(inode
) &&
4092 args
->root
== BTRFS_I(inode
)->root
;
4095 static struct inode
*btrfs_iget_locked(struct super_block
*s
,
4097 struct btrfs_root
*root
)
4099 struct inode
*inode
;
4100 struct btrfs_iget_args args
;
4101 args
.ino
= objectid
;
4104 inode
= iget5_locked(s
, objectid
, btrfs_find_actor
,
4105 btrfs_init_locked_inode
,
4110 /* Get an inode object given its location and corresponding root.
4111 * Returns in *is_new if the inode was read from disk
4113 struct inode
*btrfs_iget(struct super_block
*s
, struct btrfs_key
*location
,
4114 struct btrfs_root
*root
, int *new)
4116 struct inode
*inode
;
4118 inode
= btrfs_iget_locked(s
, location
->objectid
, root
);
4120 return ERR_PTR(-ENOMEM
);
4122 if (inode
->i_state
& I_NEW
) {
4123 BTRFS_I(inode
)->root
= root
;
4124 memcpy(&BTRFS_I(inode
)->location
, location
, sizeof(*location
));
4125 btrfs_read_locked_inode(inode
);
4126 if (!is_bad_inode(inode
)) {
4127 inode_tree_add(inode
);
4128 unlock_new_inode(inode
);
4132 unlock_new_inode(inode
);
4134 inode
= ERR_PTR(-ESTALE
);
4141 static struct inode
*new_simple_dir(struct super_block
*s
,
4142 struct btrfs_key
*key
,
4143 struct btrfs_root
*root
)
4145 struct inode
*inode
= new_inode(s
);
4148 return ERR_PTR(-ENOMEM
);
4150 BTRFS_I(inode
)->root
= root
;
4151 memcpy(&BTRFS_I(inode
)->location
, key
, sizeof(*key
));
4152 set_bit(BTRFS_INODE_DUMMY
, &BTRFS_I(inode
)->runtime_flags
);
4154 inode
->i_ino
= BTRFS_EMPTY_SUBVOL_DIR_OBJECTID
;
4155 inode
->i_op
= &btrfs_dir_ro_inode_operations
;
4156 inode
->i_fop
= &simple_dir_operations
;
4157 inode
->i_mode
= S_IFDIR
| S_IRUGO
| S_IWUSR
| S_IXUGO
;
4158 inode
->i_mtime
= inode
->i_atime
= inode
->i_ctime
= CURRENT_TIME
;
4163 struct inode
*btrfs_lookup_dentry(struct inode
*dir
, struct dentry
*dentry
)
4165 struct inode
*inode
;
4166 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
4167 struct btrfs_root
*sub_root
= root
;
4168 struct btrfs_key location
;
4172 if (dentry
->d_name
.len
> BTRFS_NAME_LEN
)
4173 return ERR_PTR(-ENAMETOOLONG
);
4175 if (unlikely(d_need_lookup(dentry
))) {
4176 memcpy(&location
, dentry
->d_fsdata
, sizeof(struct btrfs_key
));
4177 kfree(dentry
->d_fsdata
);
4178 dentry
->d_fsdata
= NULL
;
4179 /* This thing is hashed, drop it for now */
4182 ret
= btrfs_inode_by_name(dir
, dentry
, &location
);
4186 return ERR_PTR(ret
);
4188 if (location
.objectid
== 0)
4191 if (location
.type
== BTRFS_INODE_ITEM_KEY
) {
4192 inode
= btrfs_iget(dir
->i_sb
, &location
, root
, NULL
);
4196 BUG_ON(location
.type
!= BTRFS_ROOT_ITEM_KEY
);
4198 index
= srcu_read_lock(&root
->fs_info
->subvol_srcu
);
4199 ret
= fixup_tree_root_location(root
, dir
, dentry
,
4200 &location
, &sub_root
);
4203 inode
= ERR_PTR(ret
);
4205 inode
= new_simple_dir(dir
->i_sb
, &location
, sub_root
);
4207 inode
= btrfs_iget(dir
->i_sb
, &location
, sub_root
, NULL
);
4209 srcu_read_unlock(&root
->fs_info
->subvol_srcu
, index
);
4211 if (!IS_ERR(inode
) && root
!= sub_root
) {
4212 down_read(&root
->fs_info
->cleanup_work_sem
);
4213 if (!(inode
->i_sb
->s_flags
& MS_RDONLY
))
4214 ret
= btrfs_orphan_cleanup(sub_root
);
4215 up_read(&root
->fs_info
->cleanup_work_sem
);
4217 inode
= ERR_PTR(ret
);
4223 static int btrfs_dentry_delete(const struct dentry
*dentry
)
4225 struct btrfs_root
*root
;
4226 struct inode
*inode
= dentry
->d_inode
;
4228 if (!inode
&& !IS_ROOT(dentry
))
4229 inode
= dentry
->d_parent
->d_inode
;
4232 root
= BTRFS_I(inode
)->root
;
4233 if (btrfs_root_refs(&root
->root_item
) == 0)
4236 if (btrfs_ino(inode
) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID
)
4242 static void btrfs_dentry_release(struct dentry
*dentry
)
4244 if (dentry
->d_fsdata
)
4245 kfree(dentry
->d_fsdata
);
4248 static struct dentry
*btrfs_lookup(struct inode
*dir
, struct dentry
*dentry
,
4249 struct nameidata
*nd
)
4253 ret
= d_splice_alias(btrfs_lookup_dentry(dir
, dentry
), dentry
);
4254 if (unlikely(d_need_lookup(dentry
))) {
4255 spin_lock(&dentry
->d_lock
);
4256 dentry
->d_flags
&= ~DCACHE_NEED_LOOKUP
;
4257 spin_unlock(&dentry
->d_lock
);
4262 unsigned char btrfs_filetype_table
[] = {
4263 DT_UNKNOWN
, DT_REG
, DT_DIR
, DT_CHR
, DT_BLK
, DT_FIFO
, DT_SOCK
, DT_LNK
4266 static int btrfs_real_readdir(struct file
*filp
, void *dirent
,
4269 struct inode
*inode
= filp
->f_dentry
->d_inode
;
4270 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
4271 struct btrfs_item
*item
;
4272 struct btrfs_dir_item
*di
;
4273 struct btrfs_key key
;
4274 struct btrfs_key found_key
;
4275 struct btrfs_path
*path
;
4276 struct list_head ins_list
;
4277 struct list_head del_list
;
4279 struct extent_buffer
*leaf
;
4281 unsigned char d_type
;
4286 int key_type
= BTRFS_DIR_INDEX_KEY
;
4290 int is_curr
= 0; /* filp->f_pos points to the current index? */
4292 /* FIXME, use a real flag for deciding about the key type */
4293 if (root
->fs_info
->tree_root
== root
)
4294 key_type
= BTRFS_DIR_ITEM_KEY
;
4296 /* special case for "." */
4297 if (filp
->f_pos
== 0) {
4298 over
= filldir(dirent
, ".", 1,
4299 filp
->f_pos
, btrfs_ino(inode
), DT_DIR
);
4304 /* special case for .., just use the back ref */
4305 if (filp
->f_pos
== 1) {
4306 u64 pino
= parent_ino(filp
->f_path
.dentry
);
4307 over
= filldir(dirent
, "..", 2,
4308 filp
->f_pos
, pino
, DT_DIR
);
4313 path
= btrfs_alloc_path();
4319 if (key_type
== BTRFS_DIR_INDEX_KEY
) {
4320 INIT_LIST_HEAD(&ins_list
);
4321 INIT_LIST_HEAD(&del_list
);
4322 btrfs_get_delayed_items(inode
, &ins_list
, &del_list
);
4325 btrfs_set_key_type(&key
, key_type
);
4326 key
.offset
= filp
->f_pos
;
4327 key
.objectid
= btrfs_ino(inode
);
4329 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
4334 leaf
= path
->nodes
[0];
4335 slot
= path
->slots
[0];
4336 if (slot
>= btrfs_header_nritems(leaf
)) {
4337 ret
= btrfs_next_leaf(root
, path
);
4345 item
= btrfs_item_nr(leaf
, slot
);
4346 btrfs_item_key_to_cpu(leaf
, &found_key
, slot
);
4348 if (found_key
.objectid
!= key
.objectid
)
4350 if (btrfs_key_type(&found_key
) != key_type
)
4352 if (found_key
.offset
< filp
->f_pos
)
4354 if (key_type
== BTRFS_DIR_INDEX_KEY
&&
4355 btrfs_should_delete_dir_index(&del_list
,
4359 filp
->f_pos
= found_key
.offset
;
4362 di
= btrfs_item_ptr(leaf
, slot
, struct btrfs_dir_item
);
4364 di_total
= btrfs_item_size(leaf
, item
);
4366 while (di_cur
< di_total
) {
4367 struct btrfs_key location
;
4369 if (verify_dir_item(root
, leaf
, di
))
4372 name_len
= btrfs_dir_name_len(leaf
, di
);
4373 if (name_len
<= sizeof(tmp_name
)) {
4374 name_ptr
= tmp_name
;
4376 name_ptr
= kmalloc(name_len
, GFP_NOFS
);
4382 read_extent_buffer(leaf
, name_ptr
,
4383 (unsigned long)(di
+ 1), name_len
);
4385 d_type
= btrfs_filetype_table
[btrfs_dir_type(leaf
, di
)];
4386 btrfs_dir_item_key_to_cpu(leaf
, di
, &location
);
4389 /* is this a reference to our own snapshot? If so
4392 * In contrast to old kernels, we insert the snapshot's
4393 * dir item and dir index after it has been created, so
4394 * we won't find a reference to our own snapshot. We
4395 * still keep the following code for backward
4398 if (location
.type
== BTRFS_ROOT_ITEM_KEY
&&
4399 location
.objectid
== root
->root_key
.objectid
) {
4403 over
= filldir(dirent
, name_ptr
, name_len
,
4404 found_key
.offset
, location
.objectid
,
4408 if (name_ptr
!= tmp_name
)
4413 di_len
= btrfs_dir_name_len(leaf
, di
) +
4414 btrfs_dir_data_len(leaf
, di
) + sizeof(*di
);
4416 di
= (struct btrfs_dir_item
*)((char *)di
+ di_len
);
4422 if (key_type
== BTRFS_DIR_INDEX_KEY
) {
4425 ret
= btrfs_readdir_delayed_dir_index(filp
, dirent
, filldir
,
4431 /* Reached end of directory/root. Bump pos past the last item. */
4432 if (key_type
== BTRFS_DIR_INDEX_KEY
)
4434 * 32-bit glibc will use getdents64, but then strtol -
4435 * so the last number we can serve is this.
4437 filp
->f_pos
= 0x7fffffff;
4443 if (key_type
== BTRFS_DIR_INDEX_KEY
)
4444 btrfs_put_delayed_items(&ins_list
, &del_list
);
4445 btrfs_free_path(path
);
4449 int btrfs_write_inode(struct inode
*inode
, struct writeback_control
*wbc
)
4451 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
4452 struct btrfs_trans_handle
*trans
;
4454 bool nolock
= false;
4456 if (test_bit(BTRFS_INODE_DUMMY
, &BTRFS_I(inode
)->runtime_flags
))
4459 if (btrfs_fs_closing(root
->fs_info
) && btrfs_is_free_space_inode(inode
))
4462 if (wbc
->sync_mode
== WB_SYNC_ALL
) {
4464 trans
= btrfs_join_transaction_nolock(root
);
4466 trans
= btrfs_join_transaction(root
);
4468 return PTR_ERR(trans
);
4470 ret
= btrfs_end_transaction_nolock(trans
, root
);
4472 ret
= btrfs_commit_transaction(trans
, root
);
4478 * This is somewhat expensive, updating the tree every time the
4479 * inode changes. But, it is most likely to find the inode in cache.
4480 * FIXME, needs more benchmarking...there are no reasons other than performance
4481 * to keep or drop this code.
4483 int btrfs_dirty_inode(struct inode
*inode
)
4485 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
4486 struct btrfs_trans_handle
*trans
;
4489 if (test_bit(BTRFS_INODE_DUMMY
, &BTRFS_I(inode
)->runtime_flags
))
4492 trans
= btrfs_join_transaction(root
);
4494 return PTR_ERR(trans
);
4496 ret
= btrfs_update_inode(trans
, root
, inode
);
4497 if (ret
&& ret
== -ENOSPC
) {
4498 /* whoops, lets try again with the full transaction */
4499 btrfs_end_transaction(trans
, root
);
4500 trans
= btrfs_start_transaction(root
, 1);
4502 return PTR_ERR(trans
);
4504 ret
= btrfs_update_inode(trans
, root
, inode
);
4506 btrfs_end_transaction(trans
, root
);
4507 if (BTRFS_I(inode
)->delayed_node
)
4508 btrfs_balance_delayed_items(root
);
4514 * This is a copy of file_update_time. We need this so we can return error on
4515 * ENOSPC for updating the inode in the case of file write and mmap writes.
4517 static int btrfs_update_time(struct inode
*inode
, struct timespec
*now
,
4520 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
4522 if (btrfs_root_readonly(root
))
4525 if (flags
& S_VERSION
)
4526 inode_inc_iversion(inode
);
4527 if (flags
& S_CTIME
)
4528 inode
->i_ctime
= *now
;
4529 if (flags
& S_MTIME
)
4530 inode
->i_mtime
= *now
;
4531 if (flags
& S_ATIME
)
4532 inode
->i_atime
= *now
;
4533 return btrfs_dirty_inode(inode
);
4537 * find the highest existing sequence number in a directory
4538 * and then set the in-memory index_cnt variable to reflect
4539 * free sequence numbers
4541 static int btrfs_set_inode_index_count(struct inode
*inode
)
4543 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
4544 struct btrfs_key key
, found_key
;
4545 struct btrfs_path
*path
;
4546 struct extent_buffer
*leaf
;
4549 key
.objectid
= btrfs_ino(inode
);
4550 btrfs_set_key_type(&key
, BTRFS_DIR_INDEX_KEY
);
4551 key
.offset
= (u64
)-1;
4553 path
= btrfs_alloc_path();
4557 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
4560 /* FIXME: we should be able to handle this */
4566 * MAGIC NUMBER EXPLANATION:
4567 * since we search a directory based on f_pos we have to start at 2
4568 * since '.' and '..' have f_pos of 0 and 1 respectively, so everybody
4569 * else has to start at 2
4571 if (path
->slots
[0] == 0) {
4572 BTRFS_I(inode
)->index_cnt
= 2;
4578 leaf
= path
->nodes
[0];
4579 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
4581 if (found_key
.objectid
!= btrfs_ino(inode
) ||
4582 btrfs_key_type(&found_key
) != BTRFS_DIR_INDEX_KEY
) {
4583 BTRFS_I(inode
)->index_cnt
= 2;
4587 BTRFS_I(inode
)->index_cnt
= found_key
.offset
+ 1;
4589 btrfs_free_path(path
);
4594 * helper to find a free sequence number in a given directory. This current
4595 * code is very simple, later versions will do smarter things in the btree
4597 int btrfs_set_inode_index(struct inode
*dir
, u64
*index
)
4601 if (BTRFS_I(dir
)->index_cnt
== (u64
)-1) {
4602 ret
= btrfs_inode_delayed_dir_index_count(dir
);
4604 ret
= btrfs_set_inode_index_count(dir
);
4610 *index
= BTRFS_I(dir
)->index_cnt
;
4611 BTRFS_I(dir
)->index_cnt
++;
4616 static struct inode
*btrfs_new_inode(struct btrfs_trans_handle
*trans
,
4617 struct btrfs_root
*root
,
4619 const char *name
, int name_len
,
4620 u64 ref_objectid
, u64 objectid
,
4621 umode_t mode
, u64
*index
)
4623 struct inode
*inode
;
4624 struct btrfs_inode_item
*inode_item
;
4625 struct btrfs_key
*location
;
4626 struct btrfs_path
*path
;
4627 struct btrfs_inode_ref
*ref
;
4628 struct btrfs_key key
[2];
4634 path
= btrfs_alloc_path();
4636 return ERR_PTR(-ENOMEM
);
4638 inode
= new_inode(root
->fs_info
->sb
);
4640 btrfs_free_path(path
);
4641 return ERR_PTR(-ENOMEM
);
4645 * we have to initialize this early, so we can reclaim the inode
4646 * number if we fail afterwards in this function.
4648 inode
->i_ino
= objectid
;
4651 trace_btrfs_inode_request(dir
);
4653 ret
= btrfs_set_inode_index(dir
, index
);
4655 btrfs_free_path(path
);
4657 return ERR_PTR(ret
);
4661 * index_cnt is ignored for everything but a dir,
4662 * btrfs_get_inode_index_count has an explanation for the magic
4665 BTRFS_I(inode
)->index_cnt
= 2;
4666 BTRFS_I(inode
)->root
= root
;
4667 BTRFS_I(inode
)->generation
= trans
->transid
;
4668 inode
->i_generation
= BTRFS_I(inode
)->generation
;
4675 key
[0].objectid
= objectid
;
4676 btrfs_set_key_type(&key
[0], BTRFS_INODE_ITEM_KEY
);
4679 key
[1].objectid
= objectid
;
4680 btrfs_set_key_type(&key
[1], BTRFS_INODE_REF_KEY
);
4681 key
[1].offset
= ref_objectid
;
4683 sizes
[0] = sizeof(struct btrfs_inode_item
);
4684 sizes
[1] = name_len
+ sizeof(*ref
);
4686 path
->leave_spinning
= 1;
4687 ret
= btrfs_insert_empty_items(trans
, root
, path
, key
, sizes
, 2);
4691 inode_init_owner(inode
, dir
, mode
);
4692 inode_set_bytes(inode
, 0);
4693 inode
->i_mtime
= inode
->i_atime
= inode
->i_ctime
= CURRENT_TIME
;
4694 inode_item
= btrfs_item_ptr(path
->nodes
[0], path
->slots
[0],
4695 struct btrfs_inode_item
);
4696 memset_extent_buffer(path
->nodes
[0], 0, (unsigned long)inode_item
,
4697 sizeof(*inode_item
));
4698 fill_inode_item(trans
, path
->nodes
[0], inode_item
, inode
);
4700 ref
= btrfs_item_ptr(path
->nodes
[0], path
->slots
[0] + 1,
4701 struct btrfs_inode_ref
);
4702 btrfs_set_inode_ref_name_len(path
->nodes
[0], ref
, name_len
);
4703 btrfs_set_inode_ref_index(path
->nodes
[0], ref
, *index
);
4704 ptr
= (unsigned long)(ref
+ 1);
4705 write_extent_buffer(path
->nodes
[0], name
, ptr
, name_len
);
4707 btrfs_mark_buffer_dirty(path
->nodes
[0]);
4708 btrfs_free_path(path
);
4710 location
= &BTRFS_I(inode
)->location
;
4711 location
->objectid
= objectid
;
4712 location
->offset
= 0;
4713 btrfs_set_key_type(location
, BTRFS_INODE_ITEM_KEY
);
4715 btrfs_inherit_iflags(inode
, dir
);
4717 if (S_ISREG(mode
)) {
4718 if (btrfs_test_opt(root
, NODATASUM
))
4719 BTRFS_I(inode
)->flags
|= BTRFS_INODE_NODATASUM
;
4720 if (btrfs_test_opt(root
, NODATACOW
) ||
4721 (BTRFS_I(dir
)->flags
& BTRFS_INODE_NODATACOW
))
4722 BTRFS_I(inode
)->flags
|= BTRFS_INODE_NODATACOW
;
4725 insert_inode_hash(inode
);
4726 inode_tree_add(inode
);
4728 trace_btrfs_inode_new(inode
);
4729 btrfs_set_inode_last_trans(trans
, inode
);
4731 btrfs_update_root_times(trans
, root
);
4736 BTRFS_I(dir
)->index_cnt
--;
4737 btrfs_free_path(path
);
4739 return ERR_PTR(ret
);
4742 static inline u8
btrfs_inode_type(struct inode
*inode
)
4744 return btrfs_type_by_mode
[(inode
->i_mode
& S_IFMT
) >> S_SHIFT
];
4748 * utility function to add 'inode' into 'parent_inode' with
4749 * a give name and a given sequence number.
4750 * if 'add_backref' is true, also insert a backref from the
4751 * inode to the parent directory.
4753 int btrfs_add_link(struct btrfs_trans_handle
*trans
,
4754 struct inode
*parent_inode
, struct inode
*inode
,
4755 const char *name
, int name_len
, int add_backref
, u64 index
)
4758 struct btrfs_key key
;
4759 struct btrfs_root
*root
= BTRFS_I(parent_inode
)->root
;
4760 u64 ino
= btrfs_ino(inode
);
4761 u64 parent_ino
= btrfs_ino(parent_inode
);
4763 if (unlikely(ino
== BTRFS_FIRST_FREE_OBJECTID
)) {
4764 memcpy(&key
, &BTRFS_I(inode
)->root
->root_key
, sizeof(key
));
4767 btrfs_set_key_type(&key
, BTRFS_INODE_ITEM_KEY
);
4771 if (unlikely(ino
== BTRFS_FIRST_FREE_OBJECTID
)) {
4772 ret
= btrfs_add_root_ref(trans
, root
->fs_info
->tree_root
,
4773 key
.objectid
, root
->root_key
.objectid
,
4774 parent_ino
, index
, name
, name_len
);
4775 } else if (add_backref
) {
4776 ret
= btrfs_insert_inode_ref(trans
, root
, name
, name_len
, ino
,
4780 /* Nothing to clean up yet */
4784 ret
= btrfs_insert_dir_item(trans
, root
, name
, name_len
,
4786 btrfs_inode_type(inode
), index
);
4790 btrfs_abort_transaction(trans
, root
, ret
);
4794 btrfs_i_size_write(parent_inode
, parent_inode
->i_size
+
4796 inode_inc_iversion(parent_inode
);
4797 parent_inode
->i_mtime
= parent_inode
->i_ctime
= CURRENT_TIME
;
4798 ret
= btrfs_update_inode(trans
, root
, parent_inode
);
4800 btrfs_abort_transaction(trans
, root
, ret
);
4804 if (unlikely(ino
== BTRFS_FIRST_FREE_OBJECTID
)) {
4807 err
= btrfs_del_root_ref(trans
, root
->fs_info
->tree_root
,
4808 key
.objectid
, root
->root_key
.objectid
,
4809 parent_ino
, &local_index
, name
, name_len
);
4811 } else if (add_backref
) {
4815 err
= btrfs_del_inode_ref(trans
, root
, name
, name_len
,
4816 ino
, parent_ino
, &local_index
);
4821 static int btrfs_add_nondir(struct btrfs_trans_handle
*trans
,
4822 struct inode
*dir
, struct dentry
*dentry
,
4823 struct inode
*inode
, int backref
, u64 index
)
4825 int err
= btrfs_add_link(trans
, dir
, inode
,
4826 dentry
->d_name
.name
, dentry
->d_name
.len
,
4833 static int btrfs_mknod(struct inode
*dir
, struct dentry
*dentry
,
4834 umode_t mode
, dev_t rdev
)
4836 struct btrfs_trans_handle
*trans
;
4837 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
4838 struct inode
*inode
= NULL
;
4842 unsigned long nr
= 0;
4845 if (!new_valid_dev(rdev
))
4849 * 2 for inode item and ref
4851 * 1 for xattr if selinux is on
4853 trans
= btrfs_start_transaction(root
, 5);
4855 return PTR_ERR(trans
);
4857 err
= btrfs_find_free_ino(root
, &objectid
);
4861 inode
= btrfs_new_inode(trans
, root
, dir
, dentry
->d_name
.name
,
4862 dentry
->d_name
.len
, btrfs_ino(dir
), objectid
,
4864 if (IS_ERR(inode
)) {
4865 err
= PTR_ERR(inode
);
4869 err
= btrfs_init_inode_security(trans
, inode
, dir
, &dentry
->d_name
);
4876 * If the active LSM wants to access the inode during
4877 * d_instantiate it needs these. Smack checks to see
4878 * if the filesystem supports xattrs by looking at the
4882 inode
->i_op
= &btrfs_special_inode_operations
;
4883 err
= btrfs_add_nondir(trans
, dir
, dentry
, inode
, 0, index
);
4887 init_special_inode(inode
, inode
->i_mode
, rdev
);
4888 btrfs_update_inode(trans
, root
, inode
);
4889 d_instantiate(dentry
, inode
);
4892 nr
= trans
->blocks_used
;
4893 btrfs_end_transaction(trans
, root
);
4894 btrfs_btree_balance_dirty(root
, nr
);
4896 inode_dec_link_count(inode
);
4902 static int btrfs_create(struct inode
*dir
, struct dentry
*dentry
,
4903 umode_t mode
, struct nameidata
*nd
)
4905 struct btrfs_trans_handle
*trans
;
4906 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
4907 struct inode
*inode
= NULL
;
4910 unsigned long nr
= 0;
4915 * 2 for inode item and ref
4917 * 1 for xattr if selinux is on
4919 trans
= btrfs_start_transaction(root
, 5);
4921 return PTR_ERR(trans
);
4923 err
= btrfs_find_free_ino(root
, &objectid
);
4927 inode
= btrfs_new_inode(trans
, root
, dir
, dentry
->d_name
.name
,
4928 dentry
->d_name
.len
, btrfs_ino(dir
), objectid
,
4930 if (IS_ERR(inode
)) {
4931 err
= PTR_ERR(inode
);
4935 err
= btrfs_init_inode_security(trans
, inode
, dir
, &dentry
->d_name
);
4942 * If the active LSM wants to access the inode during
4943 * d_instantiate it needs these. Smack checks to see
4944 * if the filesystem supports xattrs by looking at the
4947 inode
->i_fop
= &btrfs_file_operations
;
4948 inode
->i_op
= &btrfs_file_inode_operations
;
4950 err
= btrfs_add_nondir(trans
, dir
, dentry
, inode
, 0, index
);
4954 inode
->i_mapping
->a_ops
= &btrfs_aops
;
4955 inode
->i_mapping
->backing_dev_info
= &root
->fs_info
->bdi
;
4956 BTRFS_I(inode
)->io_tree
.ops
= &btrfs_extent_io_ops
;
4957 d_instantiate(dentry
, inode
);
4960 nr
= trans
->blocks_used
;
4961 btrfs_end_transaction(trans
, root
);
4963 inode_dec_link_count(inode
);
4966 btrfs_btree_balance_dirty(root
, nr
);
4970 static int btrfs_link(struct dentry
*old_dentry
, struct inode
*dir
,
4971 struct dentry
*dentry
)
4973 struct btrfs_trans_handle
*trans
;
4974 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
4975 struct inode
*inode
= old_dentry
->d_inode
;
4977 unsigned long nr
= 0;
4981 /* do not allow sys_link's with other subvols of the same device */
4982 if (root
->objectid
!= BTRFS_I(inode
)->root
->objectid
)
4985 if (inode
->i_nlink
== ~0U)
4988 err
= btrfs_set_inode_index(dir
, &index
);
4993 * 2 items for inode and inode ref
4994 * 2 items for dir items
4995 * 1 item for parent inode
4997 trans
= btrfs_start_transaction(root
, 5);
4998 if (IS_ERR(trans
)) {
4999 err
= PTR_ERR(trans
);
5003 btrfs_inc_nlink(inode
);
5004 inode_inc_iversion(inode
);
5005 inode
->i_ctime
= CURRENT_TIME
;
5008 err
= btrfs_add_nondir(trans
, dir
, dentry
, inode
, 1, index
);
5013 struct dentry
*parent
= dentry
->d_parent
;
5014 err
= btrfs_update_inode(trans
, root
, inode
);
5017 d_instantiate(dentry
, inode
);
5018 btrfs_log_new_name(trans
, inode
, NULL
, parent
);
5021 nr
= trans
->blocks_used
;
5022 btrfs_end_transaction(trans
, root
);
5025 inode_dec_link_count(inode
);
5028 btrfs_btree_balance_dirty(root
, nr
);
5032 static int btrfs_mkdir(struct inode
*dir
, struct dentry
*dentry
, umode_t mode
)
5034 struct inode
*inode
= NULL
;
5035 struct btrfs_trans_handle
*trans
;
5036 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
5038 int drop_on_err
= 0;
5041 unsigned long nr
= 1;
5044 * 2 items for inode and ref
5045 * 2 items for dir items
5046 * 1 for xattr if selinux is on
5048 trans
= btrfs_start_transaction(root
, 5);
5050 return PTR_ERR(trans
);
5052 err
= btrfs_find_free_ino(root
, &objectid
);
5056 inode
= btrfs_new_inode(trans
, root
, dir
, dentry
->d_name
.name
,
5057 dentry
->d_name
.len
, btrfs_ino(dir
), objectid
,
5058 S_IFDIR
| mode
, &index
);
5059 if (IS_ERR(inode
)) {
5060 err
= PTR_ERR(inode
);
5066 err
= btrfs_init_inode_security(trans
, inode
, dir
, &dentry
->d_name
);
5070 inode
->i_op
= &btrfs_dir_inode_operations
;
5071 inode
->i_fop
= &btrfs_dir_file_operations
;
5073 btrfs_i_size_write(inode
, 0);
5074 err
= btrfs_update_inode(trans
, root
, inode
);
5078 err
= btrfs_add_link(trans
, dir
, inode
, dentry
->d_name
.name
,
5079 dentry
->d_name
.len
, 0, index
);
5083 d_instantiate(dentry
, inode
);
5087 nr
= trans
->blocks_used
;
5088 btrfs_end_transaction(trans
, root
);
5091 btrfs_btree_balance_dirty(root
, nr
);
5095 /* helper for btfs_get_extent. Given an existing extent in the tree,
5096 * and an extent that you want to insert, deal with overlap and insert
5097 * the new extent into the tree.
5099 static int merge_extent_mapping(struct extent_map_tree
*em_tree
,
5100 struct extent_map
*existing
,
5101 struct extent_map
*em
,
5102 u64 map_start
, u64 map_len
)
5106 BUG_ON(map_start
< em
->start
|| map_start
>= extent_map_end(em
));
5107 start_diff
= map_start
- em
->start
;
5108 em
->start
= map_start
;
5110 if (em
->block_start
< EXTENT_MAP_LAST_BYTE
&&
5111 !test_bit(EXTENT_FLAG_COMPRESSED
, &em
->flags
)) {
5112 em
->block_start
+= start_diff
;
5113 em
->block_len
-= start_diff
;
5115 return add_extent_mapping(em_tree
, em
);
5118 static noinline
int uncompress_inline(struct btrfs_path
*path
,
5119 struct inode
*inode
, struct page
*page
,
5120 size_t pg_offset
, u64 extent_offset
,
5121 struct btrfs_file_extent_item
*item
)
5124 struct extent_buffer
*leaf
= path
->nodes
[0];
5127 unsigned long inline_size
;
5131 WARN_ON(pg_offset
!= 0);
5132 compress_type
= btrfs_file_extent_compression(leaf
, item
);
5133 max_size
= btrfs_file_extent_ram_bytes(leaf
, item
);
5134 inline_size
= btrfs_file_extent_inline_item_len(leaf
,
5135 btrfs_item_nr(leaf
, path
->slots
[0]));
5136 tmp
= kmalloc(inline_size
, GFP_NOFS
);
5139 ptr
= btrfs_file_extent_inline_start(item
);
5141 read_extent_buffer(leaf
, tmp
, ptr
, inline_size
);
5143 max_size
= min_t(unsigned long, PAGE_CACHE_SIZE
, max_size
);
5144 ret
= btrfs_decompress(compress_type
, tmp
, page
,
5145 extent_offset
, inline_size
, max_size
);
5147 char *kaddr
= kmap_atomic(page
);
5148 unsigned long copy_size
= min_t(u64
,
5149 PAGE_CACHE_SIZE
- pg_offset
,
5150 max_size
- extent_offset
);
5151 memset(kaddr
+ pg_offset
, 0, copy_size
);
5152 kunmap_atomic(kaddr
);
5159 * a bit scary, this does extent mapping from logical file offset to the disk.
5160 * the ugly parts come from merging extents from the disk with the in-ram
5161 * representation. This gets more complex because of the data=ordered code,
5162 * where the in-ram extents might be locked pending data=ordered completion.
5164 * This also copies inline extents directly into the page.
5167 struct extent_map
*btrfs_get_extent(struct inode
*inode
, struct page
*page
,
5168 size_t pg_offset
, u64 start
, u64 len
,
5174 u64 extent_start
= 0;
5176 u64 objectid
= btrfs_ino(inode
);
5178 struct btrfs_path
*path
= NULL
;
5179 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
5180 struct btrfs_file_extent_item
*item
;
5181 struct extent_buffer
*leaf
;
5182 struct btrfs_key found_key
;
5183 struct extent_map
*em
= NULL
;
5184 struct extent_map_tree
*em_tree
= &BTRFS_I(inode
)->extent_tree
;
5185 struct extent_io_tree
*io_tree
= &BTRFS_I(inode
)->io_tree
;
5186 struct btrfs_trans_handle
*trans
= NULL
;
5190 read_lock(&em_tree
->lock
);
5191 em
= lookup_extent_mapping(em_tree
, start
, len
);
5193 em
->bdev
= root
->fs_info
->fs_devices
->latest_bdev
;
5194 read_unlock(&em_tree
->lock
);
5197 if (em
->start
> start
|| em
->start
+ em
->len
<= start
)
5198 free_extent_map(em
);
5199 else if (em
->block_start
== EXTENT_MAP_INLINE
&& page
)
5200 free_extent_map(em
);
5204 em
= alloc_extent_map();
5209 em
->bdev
= root
->fs_info
->fs_devices
->latest_bdev
;
5210 em
->start
= EXTENT_MAP_HOLE
;
5211 em
->orig_start
= EXTENT_MAP_HOLE
;
5213 em
->block_len
= (u64
)-1;
5216 path
= btrfs_alloc_path();
5222 * Chances are we'll be called again, so go ahead and do
5228 ret
= btrfs_lookup_file_extent(trans
, root
, path
,
5229 objectid
, start
, trans
!= NULL
);
5236 if (path
->slots
[0] == 0)
5241 leaf
= path
->nodes
[0];
5242 item
= btrfs_item_ptr(leaf
, path
->slots
[0],
5243 struct btrfs_file_extent_item
);
5244 /* are we inside the extent that was found? */
5245 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
5246 found_type
= btrfs_key_type(&found_key
);
5247 if (found_key
.objectid
!= objectid
||
5248 found_type
!= BTRFS_EXTENT_DATA_KEY
) {
5252 found_type
= btrfs_file_extent_type(leaf
, item
);
5253 extent_start
= found_key
.offset
;
5254 compress_type
= btrfs_file_extent_compression(leaf
, item
);
5255 if (found_type
== BTRFS_FILE_EXTENT_REG
||
5256 found_type
== BTRFS_FILE_EXTENT_PREALLOC
) {
5257 extent_end
= extent_start
+
5258 btrfs_file_extent_num_bytes(leaf
, item
);
5259 } else if (found_type
== BTRFS_FILE_EXTENT_INLINE
) {
5261 size
= btrfs_file_extent_inline_len(leaf
, item
);
5262 extent_end
= (extent_start
+ size
+ root
->sectorsize
- 1) &
5263 ~((u64
)root
->sectorsize
- 1);
5266 if (start
>= extent_end
) {
5268 if (path
->slots
[0] >= btrfs_header_nritems(leaf
)) {
5269 ret
= btrfs_next_leaf(root
, path
);
5276 leaf
= path
->nodes
[0];
5278 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
5279 if (found_key
.objectid
!= objectid
||
5280 found_key
.type
!= BTRFS_EXTENT_DATA_KEY
)
5282 if (start
+ len
<= found_key
.offset
)
5285 em
->len
= found_key
.offset
- start
;
5289 if (found_type
== BTRFS_FILE_EXTENT_REG
||
5290 found_type
== BTRFS_FILE_EXTENT_PREALLOC
) {
5291 em
->start
= extent_start
;
5292 em
->len
= extent_end
- extent_start
;
5293 em
->orig_start
= extent_start
-
5294 btrfs_file_extent_offset(leaf
, item
);
5295 bytenr
= btrfs_file_extent_disk_bytenr(leaf
, item
);
5297 em
->block_start
= EXTENT_MAP_HOLE
;
5300 if (compress_type
!= BTRFS_COMPRESS_NONE
) {
5301 set_bit(EXTENT_FLAG_COMPRESSED
, &em
->flags
);
5302 em
->compress_type
= compress_type
;
5303 em
->block_start
= bytenr
;
5304 em
->block_len
= btrfs_file_extent_disk_num_bytes(leaf
,
5307 bytenr
+= btrfs_file_extent_offset(leaf
, item
);
5308 em
->block_start
= bytenr
;
5309 em
->block_len
= em
->len
;
5310 if (found_type
== BTRFS_FILE_EXTENT_PREALLOC
)
5311 set_bit(EXTENT_FLAG_PREALLOC
, &em
->flags
);
5314 } else if (found_type
== BTRFS_FILE_EXTENT_INLINE
) {
5318 size_t extent_offset
;
5321 em
->block_start
= EXTENT_MAP_INLINE
;
5322 if (!page
|| create
) {
5323 em
->start
= extent_start
;
5324 em
->len
= extent_end
- extent_start
;
5328 size
= btrfs_file_extent_inline_len(leaf
, item
);
5329 extent_offset
= page_offset(page
) + pg_offset
- extent_start
;
5330 copy_size
= min_t(u64
, PAGE_CACHE_SIZE
- pg_offset
,
5331 size
- extent_offset
);
5332 em
->start
= extent_start
+ extent_offset
;
5333 em
->len
= (copy_size
+ root
->sectorsize
- 1) &
5334 ~((u64
)root
->sectorsize
- 1);
5335 em
->orig_start
= EXTENT_MAP_INLINE
;
5336 if (compress_type
) {
5337 set_bit(EXTENT_FLAG_COMPRESSED
, &em
->flags
);
5338 em
->compress_type
= compress_type
;
5340 ptr
= btrfs_file_extent_inline_start(item
) + extent_offset
;
5341 if (create
== 0 && !PageUptodate(page
)) {
5342 if (btrfs_file_extent_compression(leaf
, item
) !=
5343 BTRFS_COMPRESS_NONE
) {
5344 ret
= uncompress_inline(path
, inode
, page
,
5346 extent_offset
, item
);
5347 BUG_ON(ret
); /* -ENOMEM */
5350 read_extent_buffer(leaf
, map
+ pg_offset
, ptr
,
5352 if (pg_offset
+ copy_size
< PAGE_CACHE_SIZE
) {
5353 memset(map
+ pg_offset
+ copy_size
, 0,
5354 PAGE_CACHE_SIZE
- pg_offset
-
5359 flush_dcache_page(page
);
5360 } else if (create
&& PageUptodate(page
)) {
5364 free_extent_map(em
);
5367 btrfs_release_path(path
);
5368 trans
= btrfs_join_transaction(root
);
5371 return ERR_CAST(trans
);
5375 write_extent_buffer(leaf
, map
+ pg_offset
, ptr
,
5378 btrfs_mark_buffer_dirty(leaf
);
5380 set_extent_uptodate(io_tree
, em
->start
,
5381 extent_map_end(em
) - 1, NULL
, GFP_NOFS
);
5384 printk(KERN_ERR
"btrfs unknown found_type %d\n", found_type
);
5391 em
->block_start
= EXTENT_MAP_HOLE
;
5392 set_bit(EXTENT_FLAG_VACANCY
, &em
->flags
);
5394 btrfs_release_path(path
);
5395 if (em
->start
> start
|| extent_map_end(em
) <= start
) {
5396 printk(KERN_ERR
"Btrfs: bad extent! em: [%llu %llu] passed "
5397 "[%llu %llu]\n", (unsigned long long)em
->start
,
5398 (unsigned long long)em
->len
,
5399 (unsigned long long)start
,
5400 (unsigned long long)len
);
5406 write_lock(&em_tree
->lock
);
5407 ret
= add_extent_mapping(em_tree
, em
);
5408 /* it is possible that someone inserted the extent into the tree
5409 * while we had the lock dropped. It is also possible that
5410 * an overlapping map exists in the tree
5412 if (ret
== -EEXIST
) {
5413 struct extent_map
*existing
;
5417 existing
= lookup_extent_mapping(em_tree
, start
, len
);
5418 if (existing
&& (existing
->start
> start
||
5419 existing
->start
+ existing
->len
<= start
)) {
5420 free_extent_map(existing
);
5424 existing
= lookup_extent_mapping(em_tree
, em
->start
,
5427 err
= merge_extent_mapping(em_tree
, existing
,
5430 free_extent_map(existing
);
5432 free_extent_map(em
);
5437 free_extent_map(em
);
5441 free_extent_map(em
);
5446 write_unlock(&em_tree
->lock
);
5449 trace_btrfs_get_extent(root
, em
);
5452 btrfs_free_path(path
);
5454 ret
= btrfs_end_transaction(trans
, root
);
5459 free_extent_map(em
);
5460 return ERR_PTR(err
);
5462 BUG_ON(!em
); /* Error is always set */
5466 struct extent_map
*btrfs_get_extent_fiemap(struct inode
*inode
, struct page
*page
,
5467 size_t pg_offset
, u64 start
, u64 len
,
5470 struct extent_map
*em
;
5471 struct extent_map
*hole_em
= NULL
;
5472 u64 range_start
= start
;
5478 em
= btrfs_get_extent(inode
, page
, pg_offset
, start
, len
, create
);
5483 * if our em maps to a hole, there might
5484 * actually be delalloc bytes behind it
5486 if (em
->block_start
!= EXTENT_MAP_HOLE
)
5492 /* check to see if we've wrapped (len == -1 or similar) */
5501 /* ok, we didn't find anything, lets look for delalloc */
5502 found
= count_range_bits(&BTRFS_I(inode
)->io_tree
, &range_start
,
5503 end
, len
, EXTENT_DELALLOC
, 1);
5504 found_end
= range_start
+ found
;
5505 if (found_end
< range_start
)
5506 found_end
= (u64
)-1;
5509 * we didn't find anything useful, return
5510 * the original results from get_extent()
5512 if (range_start
> end
|| found_end
<= start
) {
5518 /* adjust the range_start to make sure it doesn't
5519 * go backwards from the start they passed in
5521 range_start
= max(start
,range_start
);
5522 found
= found_end
- range_start
;
5525 u64 hole_start
= start
;
5528 em
= alloc_extent_map();
5534 * when btrfs_get_extent can't find anything it
5535 * returns one huge hole
5537 * make sure what it found really fits our range, and
5538 * adjust to make sure it is based on the start from
5542 u64 calc_end
= extent_map_end(hole_em
);
5544 if (calc_end
<= start
|| (hole_em
->start
> end
)) {
5545 free_extent_map(hole_em
);
5548 hole_start
= max(hole_em
->start
, start
);
5549 hole_len
= calc_end
- hole_start
;
5553 if (hole_em
&& range_start
> hole_start
) {
5554 /* our hole starts before our delalloc, so we
5555 * have to return just the parts of the hole
5556 * that go until the delalloc starts
5558 em
->len
= min(hole_len
,
5559 range_start
- hole_start
);
5560 em
->start
= hole_start
;
5561 em
->orig_start
= hole_start
;
5563 * don't adjust block start at all,
5564 * it is fixed at EXTENT_MAP_HOLE
5566 em
->block_start
= hole_em
->block_start
;
5567 em
->block_len
= hole_len
;
5569 em
->start
= range_start
;
5571 em
->orig_start
= range_start
;
5572 em
->block_start
= EXTENT_MAP_DELALLOC
;
5573 em
->block_len
= found
;
5575 } else if (hole_em
) {
5580 free_extent_map(hole_em
);
5582 free_extent_map(em
);
5583 return ERR_PTR(err
);
5588 static struct extent_map
*btrfs_new_extent_direct(struct inode
*inode
,
5589 struct extent_map
*em
,
5592 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
5593 struct btrfs_trans_handle
*trans
;
5594 struct extent_map_tree
*em_tree
= &BTRFS_I(inode
)->extent_tree
;
5595 struct btrfs_key ins
;
5598 bool insert
= false;
5601 * Ok if the extent map we looked up is a hole and is for the exact
5602 * range we want, there is no reason to allocate a new one, however if
5603 * it is not right then we need to free this one and drop the cache for
5606 if (em
->block_start
!= EXTENT_MAP_HOLE
|| em
->start
!= start
||
5608 free_extent_map(em
);
5611 btrfs_drop_extent_cache(inode
, start
, start
+ len
- 1, 0);
5614 trans
= btrfs_join_transaction(root
);
5616 return ERR_CAST(trans
);
5618 if (start
<= BTRFS_I(inode
)->disk_i_size
&& len
< 64 * 1024)
5619 btrfs_add_inode_defrag(trans
, inode
);
5621 trans
->block_rsv
= &root
->fs_info
->delalloc_block_rsv
;
5623 alloc_hint
= get_extent_allocation_hint(inode
, start
, len
);
5624 ret
= btrfs_reserve_extent(trans
, root
, len
, root
->sectorsize
, 0,
5625 alloc_hint
, &ins
, 1);
5632 em
= alloc_extent_map();
5634 em
= ERR_PTR(-ENOMEM
);
5640 em
->orig_start
= em
->start
;
5641 em
->len
= ins
.offset
;
5643 em
->block_start
= ins
.objectid
;
5644 em
->block_len
= ins
.offset
;
5645 em
->bdev
= root
->fs_info
->fs_devices
->latest_bdev
;
5648 * We need to do this because if we're using the original em we searched
5649 * for, we could have EXTENT_FLAG_VACANCY set, and we don't want that.
5652 set_bit(EXTENT_FLAG_PINNED
, &em
->flags
);
5655 write_lock(&em_tree
->lock
);
5656 ret
= add_extent_mapping(em_tree
, em
);
5657 write_unlock(&em_tree
->lock
);
5660 btrfs_drop_extent_cache(inode
, start
, start
+ em
->len
- 1, 0);
5663 ret
= btrfs_add_ordered_extent_dio(inode
, start
, ins
.objectid
,
5664 ins
.offset
, ins
.offset
, 0);
5666 btrfs_free_reserved_extent(root
, ins
.objectid
, ins
.offset
);
5670 btrfs_end_transaction(trans
, root
);
5675 * returns 1 when the nocow is safe, < 1 on error, 0 if the
5676 * block must be cow'd
5678 static noinline
int can_nocow_odirect(struct btrfs_trans_handle
*trans
,
5679 struct inode
*inode
, u64 offset
, u64 len
)
5681 struct btrfs_path
*path
;
5683 struct extent_buffer
*leaf
;
5684 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
5685 struct btrfs_file_extent_item
*fi
;
5686 struct btrfs_key key
;
5694 path
= btrfs_alloc_path();
5698 ret
= btrfs_lookup_file_extent(trans
, root
, path
, btrfs_ino(inode
),
5703 slot
= path
->slots
[0];
5706 /* can't find the item, must cow */
5713 leaf
= path
->nodes
[0];
5714 btrfs_item_key_to_cpu(leaf
, &key
, slot
);
5715 if (key
.objectid
!= btrfs_ino(inode
) ||
5716 key
.type
!= BTRFS_EXTENT_DATA_KEY
) {
5717 /* not our file or wrong item type, must cow */
5721 if (key
.offset
> offset
) {
5722 /* Wrong offset, must cow */
5726 fi
= btrfs_item_ptr(leaf
, slot
, struct btrfs_file_extent_item
);
5727 found_type
= btrfs_file_extent_type(leaf
, fi
);
5728 if (found_type
!= BTRFS_FILE_EXTENT_REG
&&
5729 found_type
!= BTRFS_FILE_EXTENT_PREALLOC
) {
5730 /* not a regular extent, must cow */
5733 disk_bytenr
= btrfs_file_extent_disk_bytenr(leaf
, fi
);
5734 backref_offset
= btrfs_file_extent_offset(leaf
, fi
);
5736 extent_end
= key
.offset
+ btrfs_file_extent_num_bytes(leaf
, fi
);
5737 if (extent_end
< offset
+ len
) {
5738 /* extent doesn't include our full range, must cow */
5742 if (btrfs_extent_readonly(root
, disk_bytenr
))
5746 * look for other files referencing this extent, if we
5747 * find any we must cow
5749 if (btrfs_cross_ref_exist(trans
, root
, btrfs_ino(inode
),
5750 key
.offset
- backref_offset
, disk_bytenr
))
5754 * adjust disk_bytenr and num_bytes to cover just the bytes
5755 * in this extent we are about to write. If there
5756 * are any csums in that range we have to cow in order
5757 * to keep the csums correct
5759 disk_bytenr
+= backref_offset
;
5760 disk_bytenr
+= offset
- key
.offset
;
5761 num_bytes
= min(offset
+ len
, extent_end
) - offset
;
5762 if (csum_exist_in_range(root
, disk_bytenr
, num_bytes
))
5765 * all of the above have passed, it is safe to overwrite this extent
5770 btrfs_free_path(path
);
5774 static int lock_extent_direct(struct inode
*inode
, u64 lockstart
, u64 lockend
,
5775 struct extent_state
**cached_state
, int writing
)
5777 struct btrfs_ordered_extent
*ordered
;
5781 lock_extent_bits(&BTRFS_I(inode
)->io_tree
, lockstart
, lockend
,
5784 * We're concerned with the entire range that we're going to be
5785 * doing DIO to, so we need to make sure theres no ordered
5786 * extents in this range.
5788 ordered
= btrfs_lookup_ordered_range(inode
, lockstart
,
5789 lockend
- lockstart
+ 1);
5792 * We need to make sure there are no buffered pages in this
5793 * range either, we could have raced between the invalidate in
5794 * generic_file_direct_write and locking the extent. The
5795 * invalidate needs to happen so that reads after a write do not
5798 if (!ordered
&& (!writing
||
5799 !test_range_bit(&BTRFS_I(inode
)->io_tree
,
5800 lockstart
, lockend
, EXTENT_UPTODATE
, 0,
5804 unlock_extent_cached(&BTRFS_I(inode
)->io_tree
, lockstart
, lockend
,
5805 cached_state
, GFP_NOFS
);
5808 btrfs_start_ordered_extent(inode
, ordered
, 1);
5809 btrfs_put_ordered_extent(ordered
);
5811 /* Screw you mmap */
5812 ret
= filemap_write_and_wait_range(inode
->i_mapping
,
5819 * If we found a page that couldn't be invalidated just
5820 * fall back to buffered.
5822 ret
= invalidate_inode_pages2_range(inode
->i_mapping
,
5823 lockstart
>> PAGE_CACHE_SHIFT
,
5824 lockend
>> PAGE_CACHE_SHIFT
);
5835 static int btrfs_get_blocks_direct(struct inode
*inode
, sector_t iblock
,
5836 struct buffer_head
*bh_result
, int create
)
5838 struct extent_map
*em
;
5839 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
5840 struct extent_state
*cached_state
= NULL
;
5841 u64 start
= iblock
<< inode
->i_blkbits
;
5842 u64 lockstart
, lockend
;
5843 u64 len
= bh_result
->b_size
;
5844 struct btrfs_trans_handle
*trans
;
5845 int unlock_bits
= EXTENT_LOCKED
;
5849 ret
= btrfs_delalloc_reserve_space(inode
, len
);
5852 unlock_bits
|= EXTENT_DELALLOC
| EXTENT_DIRTY
;
5854 len
= min_t(u64
, len
, root
->sectorsize
);
5858 lockend
= start
+ len
- 1;
5861 * If this errors out it's because we couldn't invalidate pagecache for
5862 * this range and we need to fallback to buffered.
5864 if (lock_extent_direct(inode
, lockstart
, lockend
, &cached_state
, create
))
5868 ret
= set_extent_bit(&BTRFS_I(inode
)->io_tree
, lockstart
,
5869 lockend
, EXTENT_DELALLOC
, NULL
,
5870 &cached_state
, GFP_NOFS
);
5875 em
= btrfs_get_extent(inode
, NULL
, 0, start
, len
, 0);
5882 * Ok for INLINE and COMPRESSED extents we need to fallback on buffered
5883 * io. INLINE is special, and we could probably kludge it in here, but
5884 * it's still buffered so for safety lets just fall back to the generic
5887 * For COMPRESSED we _have_ to read the entire extent in so we can
5888 * decompress it, so there will be buffering required no matter what we
5889 * do, so go ahead and fallback to buffered.
5891 * We return -ENOTBLK because thats what makes DIO go ahead and go back
5892 * to buffered IO. Don't blame me, this is the price we pay for using
5895 if (test_bit(EXTENT_FLAG_COMPRESSED
, &em
->flags
) ||
5896 em
->block_start
== EXTENT_MAP_INLINE
) {
5897 free_extent_map(em
);
5902 /* Just a good old fashioned hole, return */
5903 if (!create
&& (em
->block_start
== EXTENT_MAP_HOLE
||
5904 test_bit(EXTENT_FLAG_PREALLOC
, &em
->flags
))) {
5905 free_extent_map(em
);
5911 * We don't allocate a new extent in the following cases
5913 * 1) The inode is marked as NODATACOW. In this case we'll just use the
5915 * 2) The extent is marked as PREALLOC. We're good to go here and can
5916 * just use the extent.
5920 len
= min(len
, em
->len
- (start
- em
->start
));
5921 lockstart
= start
+ len
;
5925 if (test_bit(EXTENT_FLAG_PREALLOC
, &em
->flags
) ||
5926 ((BTRFS_I(inode
)->flags
& BTRFS_INODE_NODATACOW
) &&
5927 em
->block_start
!= EXTENT_MAP_HOLE
)) {
5932 if (test_bit(EXTENT_FLAG_PREALLOC
, &em
->flags
))
5933 type
= BTRFS_ORDERED_PREALLOC
;
5935 type
= BTRFS_ORDERED_NOCOW
;
5936 len
= min(len
, em
->len
- (start
- em
->start
));
5937 block_start
= em
->block_start
+ (start
- em
->start
);
5940 * we're not going to log anything, but we do need
5941 * to make sure the current transaction stays open
5942 * while we look for nocow cross refs
5944 trans
= btrfs_join_transaction(root
);
5948 if (can_nocow_odirect(trans
, inode
, start
, len
) == 1) {
5949 ret
= btrfs_add_ordered_extent_dio(inode
, start
,
5950 block_start
, len
, len
, type
);
5951 btrfs_end_transaction(trans
, root
);
5953 free_extent_map(em
);
5958 btrfs_end_transaction(trans
, root
);
5962 * this will cow the extent, reset the len in case we changed
5965 len
= bh_result
->b_size
;
5966 em
= btrfs_new_extent_direct(inode
, em
, start
, len
);
5971 len
= min(len
, em
->len
- (start
- em
->start
));
5973 bh_result
->b_blocknr
= (em
->block_start
+ (start
- em
->start
)) >>
5975 bh_result
->b_size
= len
;
5976 bh_result
->b_bdev
= em
->bdev
;
5977 set_buffer_mapped(bh_result
);
5979 if (!test_bit(EXTENT_FLAG_PREALLOC
, &em
->flags
))
5980 set_buffer_new(bh_result
);
5983 * Need to update the i_size under the extent lock so buffered
5984 * readers will get the updated i_size when we unlock.
5986 if (start
+ len
> i_size_read(inode
))
5987 i_size_write(inode
, start
+ len
);
5991 * In the case of write we need to clear and unlock the entire range,
5992 * in the case of read we need to unlock only the end area that we
5993 * aren't using if there is any left over space.
5995 if (lockstart
< lockend
) {
5996 if (create
&& len
< lockend
- lockstart
) {
5997 clear_extent_bit(&BTRFS_I(inode
)->io_tree
, lockstart
,
5998 lockstart
+ len
- 1, unlock_bits
, 1, 0,
5999 &cached_state
, GFP_NOFS
);
6001 * Beside unlock, we also need to cleanup reserved space
6002 * for the left range by attaching EXTENT_DO_ACCOUNTING.
6004 clear_extent_bit(&BTRFS_I(inode
)->io_tree
,
6005 lockstart
+ len
, lockend
,
6006 unlock_bits
| EXTENT_DO_ACCOUNTING
,
6007 1, 0, NULL
, GFP_NOFS
);
6009 clear_extent_bit(&BTRFS_I(inode
)->io_tree
, lockstart
,
6010 lockend
, unlock_bits
, 1, 0,
6011 &cached_state
, GFP_NOFS
);
6014 free_extent_state(cached_state
);
6017 free_extent_map(em
);
6023 unlock_bits
|= EXTENT_DO_ACCOUNTING
;
6025 clear_extent_bit(&BTRFS_I(inode
)->io_tree
, lockstart
, lockend
,
6026 unlock_bits
, 1, 0, &cached_state
, GFP_NOFS
);
6030 struct btrfs_dio_private
{
6031 struct inode
*inode
;
6037 /* number of bios pending for this dio */
6038 atomic_t pending_bios
;
6043 struct bio
*orig_bio
;
6046 static void btrfs_endio_direct_read(struct bio
*bio
, int err
)
6048 struct btrfs_dio_private
*dip
= bio
->bi_private
;
6049 struct bio_vec
*bvec_end
= bio
->bi_io_vec
+ bio
->bi_vcnt
- 1;
6050 struct bio_vec
*bvec
= bio
->bi_io_vec
;
6051 struct inode
*inode
= dip
->inode
;
6052 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
6055 start
= dip
->logical_offset
;
6057 if (!(BTRFS_I(inode
)->flags
& BTRFS_INODE_NODATASUM
)) {
6058 struct page
*page
= bvec
->bv_page
;
6061 u64
private = ~(u32
)0;
6062 unsigned long flags
;
6064 if (get_state_private(&BTRFS_I(inode
)->io_tree
,
6067 local_irq_save(flags
);
6068 kaddr
= kmap_atomic(page
);
6069 csum
= btrfs_csum_data(root
, kaddr
+ bvec
->bv_offset
,
6070 csum
, bvec
->bv_len
);
6071 btrfs_csum_final(csum
, (char *)&csum
);
6072 kunmap_atomic(kaddr
);
6073 local_irq_restore(flags
);
6075 flush_dcache_page(bvec
->bv_page
);
6076 if (csum
!= private) {
6078 printk(KERN_ERR
"btrfs csum failed ino %llu off"
6079 " %llu csum %u private %u\n",
6080 (unsigned long long)btrfs_ino(inode
),
6081 (unsigned long long)start
,
6082 csum
, (unsigned)private);
6087 start
+= bvec
->bv_len
;
6089 } while (bvec
<= bvec_end
);
6091 unlock_extent(&BTRFS_I(inode
)->io_tree
, dip
->logical_offset
,
6092 dip
->logical_offset
+ dip
->bytes
- 1);
6093 bio
->bi_private
= dip
->private;
6097 /* If we had a csum failure make sure to clear the uptodate flag */
6099 clear_bit(BIO_UPTODATE
, &bio
->bi_flags
);
6100 dio_end_io(bio
, err
);
6103 static void btrfs_endio_direct_write(struct bio
*bio
, int err
)
6105 struct btrfs_dio_private
*dip
= bio
->bi_private
;
6106 struct inode
*inode
= dip
->inode
;
6107 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
6108 struct btrfs_ordered_extent
*ordered
= NULL
;
6109 u64 ordered_offset
= dip
->logical_offset
;
6110 u64 ordered_bytes
= dip
->bytes
;
6116 ret
= btrfs_dec_test_first_ordered_pending(inode
, &ordered
,
6118 ordered_bytes
, !err
);
6122 ordered
->work
.func
= finish_ordered_fn
;
6123 ordered
->work
.flags
= 0;
6124 btrfs_queue_worker(&root
->fs_info
->endio_write_workers
,
6128 * our bio might span multiple ordered extents. If we haven't
6129 * completed the accounting for the whole dio, go back and try again
6131 if (ordered_offset
< dip
->logical_offset
+ dip
->bytes
) {
6132 ordered_bytes
= dip
->logical_offset
+ dip
->bytes
-
6138 bio
->bi_private
= dip
->private;
6142 /* If we had an error make sure to clear the uptodate flag */
6144 clear_bit(BIO_UPTODATE
, &bio
->bi_flags
);
6145 dio_end_io(bio
, err
);
6148 static int __btrfs_submit_bio_start_direct_io(struct inode
*inode
, int rw
,
6149 struct bio
*bio
, int mirror_num
,
6150 unsigned long bio_flags
, u64 offset
)
6153 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
6154 ret
= btrfs_csum_one_bio(root
, inode
, bio
, offset
, 1);
6155 BUG_ON(ret
); /* -ENOMEM */
6159 static void btrfs_end_dio_bio(struct bio
*bio
, int err
)
6161 struct btrfs_dio_private
*dip
= bio
->bi_private
;
6164 printk(KERN_ERR
"btrfs direct IO failed ino %llu rw %lu "
6165 "sector %#Lx len %u err no %d\n",
6166 (unsigned long long)btrfs_ino(dip
->inode
), bio
->bi_rw
,
6167 (unsigned long long)bio
->bi_sector
, bio
->bi_size
, err
);
6171 * before atomic variable goto zero, we must make sure
6172 * dip->errors is perceived to be set.
6174 smp_mb__before_atomic_dec();
6177 /* if there are more bios still pending for this dio, just exit */
6178 if (!atomic_dec_and_test(&dip
->pending_bios
))
6182 bio_io_error(dip
->orig_bio
);
6184 set_bit(BIO_UPTODATE
, &dip
->orig_bio
->bi_flags
);
6185 bio_endio(dip
->orig_bio
, 0);
6191 static struct bio
*btrfs_dio_bio_alloc(struct block_device
*bdev
,
6192 u64 first_sector
, gfp_t gfp_flags
)
6194 int nr_vecs
= bio_get_nr_vecs(bdev
);
6195 return btrfs_bio_alloc(bdev
, first_sector
, nr_vecs
, gfp_flags
);
6198 static inline int __btrfs_submit_dio_bio(struct bio
*bio
, struct inode
*inode
,
6199 int rw
, u64 file_offset
, int skip_sum
,
6202 int write
= rw
& REQ_WRITE
;
6203 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
6209 ret
= btrfs_bio_wq_end_io(root
->fs_info
, bio
, 0);
6217 if (write
&& async_submit
) {
6218 ret
= btrfs_wq_submit_bio(root
->fs_info
,
6219 inode
, rw
, bio
, 0, 0,
6221 __btrfs_submit_bio_start_direct_io
,
6222 __btrfs_submit_bio_done
);
6226 * If we aren't doing async submit, calculate the csum of the
6229 ret
= btrfs_csum_one_bio(root
, inode
, bio
, file_offset
, 1);
6232 } else if (!skip_sum
) {
6233 ret
= btrfs_lookup_bio_sums_dio(root
, inode
, bio
, file_offset
);
6239 ret
= btrfs_map_bio(root
, rw
, bio
, 0, async_submit
);
6245 static int btrfs_submit_direct_hook(int rw
, struct btrfs_dio_private
*dip
,
6248 struct inode
*inode
= dip
->inode
;
6249 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
6250 struct btrfs_mapping_tree
*map_tree
= &root
->fs_info
->mapping_tree
;
6252 struct bio
*orig_bio
= dip
->orig_bio
;
6253 struct bio_vec
*bvec
= orig_bio
->bi_io_vec
;
6254 u64 start_sector
= orig_bio
->bi_sector
;
6255 u64 file_offset
= dip
->logical_offset
;
6260 int async_submit
= 0;
6262 map_length
= orig_bio
->bi_size
;
6263 ret
= btrfs_map_block(map_tree
, READ
, start_sector
<< 9,
6264 &map_length
, NULL
, 0);
6270 if (map_length
>= orig_bio
->bi_size
) {
6276 bio
= btrfs_dio_bio_alloc(orig_bio
->bi_bdev
, start_sector
, GFP_NOFS
);
6279 bio
->bi_private
= dip
;
6280 bio
->bi_end_io
= btrfs_end_dio_bio
;
6281 atomic_inc(&dip
->pending_bios
);
6283 while (bvec
<= (orig_bio
->bi_io_vec
+ orig_bio
->bi_vcnt
- 1)) {
6284 if (unlikely(map_length
< submit_len
+ bvec
->bv_len
||
6285 bio_add_page(bio
, bvec
->bv_page
, bvec
->bv_len
,
6286 bvec
->bv_offset
) < bvec
->bv_len
)) {
6288 * inc the count before we submit the bio so
6289 * we know the end IO handler won't happen before
6290 * we inc the count. Otherwise, the dip might get freed
6291 * before we're done setting it up
6293 atomic_inc(&dip
->pending_bios
);
6294 ret
= __btrfs_submit_dio_bio(bio
, inode
, rw
,
6295 file_offset
, skip_sum
,
6299 atomic_dec(&dip
->pending_bios
);
6303 start_sector
+= submit_len
>> 9;
6304 file_offset
+= submit_len
;
6309 bio
= btrfs_dio_bio_alloc(orig_bio
->bi_bdev
,
6310 start_sector
, GFP_NOFS
);
6313 bio
->bi_private
= dip
;
6314 bio
->bi_end_io
= btrfs_end_dio_bio
;
6316 map_length
= orig_bio
->bi_size
;
6317 ret
= btrfs_map_block(map_tree
, READ
, start_sector
<< 9,
6318 &map_length
, NULL
, 0);
6324 submit_len
+= bvec
->bv_len
;
6331 ret
= __btrfs_submit_dio_bio(bio
, inode
, rw
, file_offset
, skip_sum
,
6340 * before atomic variable goto zero, we must
6341 * make sure dip->errors is perceived to be set.
6343 smp_mb__before_atomic_dec();
6344 if (atomic_dec_and_test(&dip
->pending_bios
))
6345 bio_io_error(dip
->orig_bio
);
6347 /* bio_end_io() will handle error, so we needn't return it */
6351 static void btrfs_submit_direct(int rw
, struct bio
*bio
, struct inode
*inode
,
6354 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
6355 struct btrfs_dio_private
*dip
;
6356 struct bio_vec
*bvec
= bio
->bi_io_vec
;
6358 int write
= rw
& REQ_WRITE
;
6361 skip_sum
= BTRFS_I(inode
)->flags
& BTRFS_INODE_NODATASUM
;
6363 dip
= kmalloc(sizeof(*dip
), GFP_NOFS
);
6369 dip
->private = bio
->bi_private
;
6371 dip
->logical_offset
= file_offset
;
6375 dip
->bytes
+= bvec
->bv_len
;
6377 } while (bvec
<= (bio
->bi_io_vec
+ bio
->bi_vcnt
- 1));
6379 dip
->disk_bytenr
= (u64
)bio
->bi_sector
<< 9;
6380 bio
->bi_private
= dip
;
6382 dip
->orig_bio
= bio
;
6383 atomic_set(&dip
->pending_bios
, 0);
6386 bio
->bi_end_io
= btrfs_endio_direct_write
;
6388 bio
->bi_end_io
= btrfs_endio_direct_read
;
6390 ret
= btrfs_submit_direct_hook(rw
, dip
, skip_sum
);
6395 * If this is a write, we need to clean up the reserved space and kill
6396 * the ordered extent.
6399 struct btrfs_ordered_extent
*ordered
;
6400 ordered
= btrfs_lookup_ordered_extent(inode
, file_offset
);
6401 if (!test_bit(BTRFS_ORDERED_PREALLOC
, &ordered
->flags
) &&
6402 !test_bit(BTRFS_ORDERED_NOCOW
, &ordered
->flags
))
6403 btrfs_free_reserved_extent(root
, ordered
->start
,
6405 btrfs_put_ordered_extent(ordered
);
6406 btrfs_put_ordered_extent(ordered
);
6408 bio_endio(bio
, ret
);
6411 static ssize_t
check_direct_IO(struct btrfs_root
*root
, int rw
, struct kiocb
*iocb
,
6412 const struct iovec
*iov
, loff_t offset
,
6413 unsigned long nr_segs
)
6419 unsigned blocksize_mask
= root
->sectorsize
- 1;
6420 ssize_t retval
= -EINVAL
;
6421 loff_t end
= offset
;
6423 if (offset
& blocksize_mask
)
6426 /* Check the memory alignment. Blocks cannot straddle pages */
6427 for (seg
= 0; seg
< nr_segs
; seg
++) {
6428 addr
= (unsigned long)iov
[seg
].iov_base
;
6429 size
= iov
[seg
].iov_len
;
6431 if ((addr
& blocksize_mask
) || (size
& blocksize_mask
))
6434 /* If this is a write we don't need to check anymore */
6439 * Check to make sure we don't have duplicate iov_base's in this
6440 * iovec, if so return EINVAL, otherwise we'll get csum errors
6441 * when reading back.
6443 for (i
= seg
+ 1; i
< nr_segs
; i
++) {
6444 if (iov
[seg
].iov_base
== iov
[i
].iov_base
)
6453 static ssize_t
btrfs_direct_IO(int rw
, struct kiocb
*iocb
,
6454 const struct iovec
*iov
, loff_t offset
,
6455 unsigned long nr_segs
)
6457 struct file
*file
= iocb
->ki_filp
;
6458 struct inode
*inode
= file
->f_mapping
->host
;
6460 if (check_direct_IO(BTRFS_I(inode
)->root
, rw
, iocb
, iov
,
6464 return __blockdev_direct_IO(rw
, iocb
, inode
,
6465 BTRFS_I(inode
)->root
->fs_info
->fs_devices
->latest_bdev
,
6466 iov
, offset
, nr_segs
, btrfs_get_blocks_direct
, NULL
,
6467 btrfs_submit_direct
, 0);
6470 static int btrfs_fiemap(struct inode
*inode
, struct fiemap_extent_info
*fieinfo
,
6471 __u64 start
, __u64 len
)
6473 return extent_fiemap(inode
, fieinfo
, start
, len
, btrfs_get_extent_fiemap
);
6476 int btrfs_readpage(struct file
*file
, struct page
*page
)
6478 struct extent_io_tree
*tree
;
6479 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
6480 return extent_read_full_page(tree
, page
, btrfs_get_extent
, 0);
6483 static int btrfs_writepage(struct page
*page
, struct writeback_control
*wbc
)
6485 struct extent_io_tree
*tree
;
6488 if (current
->flags
& PF_MEMALLOC
) {
6489 redirty_page_for_writepage(wbc
, page
);
6493 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
6494 return extent_write_full_page(tree
, page
, btrfs_get_extent
, wbc
);
6497 int btrfs_writepages(struct address_space
*mapping
,
6498 struct writeback_control
*wbc
)
6500 struct extent_io_tree
*tree
;
6502 tree
= &BTRFS_I(mapping
->host
)->io_tree
;
6503 return extent_writepages(tree
, mapping
, btrfs_get_extent
, wbc
);
6507 btrfs_readpages(struct file
*file
, struct address_space
*mapping
,
6508 struct list_head
*pages
, unsigned nr_pages
)
6510 struct extent_io_tree
*tree
;
6511 tree
= &BTRFS_I(mapping
->host
)->io_tree
;
6512 return extent_readpages(tree
, mapping
, pages
, nr_pages
,
6515 static int __btrfs_releasepage(struct page
*page
, gfp_t gfp_flags
)
6517 struct extent_io_tree
*tree
;
6518 struct extent_map_tree
*map
;
6521 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
6522 map
= &BTRFS_I(page
->mapping
->host
)->extent_tree
;
6523 ret
= try_release_extent_mapping(map
, tree
, page
, gfp_flags
);
6525 ClearPagePrivate(page
);
6526 set_page_private(page
, 0);
6527 page_cache_release(page
);
6532 static int btrfs_releasepage(struct page
*page
, gfp_t gfp_flags
)
6534 if (PageWriteback(page
) || PageDirty(page
))
6536 return __btrfs_releasepage(page
, gfp_flags
& GFP_NOFS
);
6539 static void btrfs_invalidatepage(struct page
*page
, unsigned long offset
)
6541 struct inode
*inode
= page
->mapping
->host
;
6542 struct extent_io_tree
*tree
;
6543 struct btrfs_ordered_extent
*ordered
;
6544 struct extent_state
*cached_state
= NULL
;
6545 u64 page_start
= page_offset(page
);
6546 u64 page_end
= page_start
+ PAGE_CACHE_SIZE
- 1;
6549 * we have the page locked, so new writeback can't start,
6550 * and the dirty bit won't be cleared while we are here.
6552 * Wait for IO on this page so that we can safely clear
6553 * the PagePrivate2 bit and do ordered accounting
6555 wait_on_page_writeback(page
);
6557 tree
= &BTRFS_I(inode
)->io_tree
;
6559 btrfs_releasepage(page
, GFP_NOFS
);
6562 lock_extent_bits(tree
, page_start
, page_end
, 0, &cached_state
);
6563 ordered
= btrfs_lookup_ordered_extent(inode
,
6567 * IO on this page will never be started, so we need
6568 * to account for any ordered extents now
6570 clear_extent_bit(tree
, page_start
, page_end
,
6571 EXTENT_DIRTY
| EXTENT_DELALLOC
|
6572 EXTENT_LOCKED
| EXTENT_DO_ACCOUNTING
, 1, 0,
6573 &cached_state
, GFP_NOFS
);
6575 * whoever cleared the private bit is responsible
6576 * for the finish_ordered_io
6578 if (TestClearPagePrivate2(page
) &&
6579 btrfs_dec_test_ordered_pending(inode
, &ordered
, page_start
,
6580 PAGE_CACHE_SIZE
, 1)) {
6581 btrfs_finish_ordered_io(ordered
);
6583 btrfs_put_ordered_extent(ordered
);
6584 cached_state
= NULL
;
6585 lock_extent_bits(tree
, page_start
, page_end
, 0, &cached_state
);
6587 clear_extent_bit(tree
, page_start
, page_end
,
6588 EXTENT_LOCKED
| EXTENT_DIRTY
| EXTENT_DELALLOC
|
6589 EXTENT_DO_ACCOUNTING
, 1, 1, &cached_state
, GFP_NOFS
);
6590 __btrfs_releasepage(page
, GFP_NOFS
);
6592 ClearPageChecked(page
);
6593 if (PagePrivate(page
)) {
6594 ClearPagePrivate(page
);
6595 set_page_private(page
, 0);
6596 page_cache_release(page
);
6601 * btrfs_page_mkwrite() is not allowed to change the file size as it gets
6602 * called from a page fault handler when a page is first dirtied. Hence we must
6603 * be careful to check for EOF conditions here. We set the page up correctly
6604 * for a written page which means we get ENOSPC checking when writing into
6605 * holes and correct delalloc and unwritten extent mapping on filesystems that
6606 * support these features.
6608 * We are not allowed to take the i_mutex here so we have to play games to
6609 * protect against truncate races as the page could now be beyond EOF. Because
6610 * vmtruncate() writes the inode size before removing pages, once we have the
6611 * page lock we can determine safely if the page is beyond EOF. If it is not
6612 * beyond EOF, then the page is guaranteed safe against truncation until we
6615 int btrfs_page_mkwrite(struct vm_area_struct
*vma
, struct vm_fault
*vmf
)
6617 struct page
*page
= vmf
->page
;
6618 struct inode
*inode
= fdentry(vma
->vm_file
)->d_inode
;
6619 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
6620 struct extent_io_tree
*io_tree
= &BTRFS_I(inode
)->io_tree
;
6621 struct btrfs_ordered_extent
*ordered
;
6622 struct extent_state
*cached_state
= NULL
;
6624 unsigned long zero_start
;
6631 ret
= btrfs_delalloc_reserve_space(inode
, PAGE_CACHE_SIZE
);
6633 ret
= file_update_time(vma
->vm_file
);
6639 else /* -ENOSPC, -EIO, etc */
6640 ret
= VM_FAULT_SIGBUS
;
6646 ret
= VM_FAULT_NOPAGE
; /* make the VM retry the fault */
6649 size
= i_size_read(inode
);
6650 page_start
= page_offset(page
);
6651 page_end
= page_start
+ PAGE_CACHE_SIZE
- 1;
6653 if ((page
->mapping
!= inode
->i_mapping
) ||
6654 (page_start
>= size
)) {
6655 /* page got truncated out from underneath us */
6658 wait_on_page_writeback(page
);
6660 lock_extent_bits(io_tree
, page_start
, page_end
, 0, &cached_state
);
6661 set_page_extent_mapped(page
);
6664 * we can't set the delalloc bits if there are pending ordered
6665 * extents. Drop our locks and wait for them to finish
6667 ordered
= btrfs_lookup_ordered_extent(inode
, page_start
);
6669 unlock_extent_cached(io_tree
, page_start
, page_end
,
6670 &cached_state
, GFP_NOFS
);
6672 btrfs_start_ordered_extent(inode
, ordered
, 1);
6673 btrfs_put_ordered_extent(ordered
);
6678 * XXX - page_mkwrite gets called every time the page is dirtied, even
6679 * if it was already dirty, so for space accounting reasons we need to
6680 * clear any delalloc bits for the range we are fixing to save. There
6681 * is probably a better way to do this, but for now keep consistent with
6682 * prepare_pages in the normal write path.
6684 clear_extent_bit(&BTRFS_I(inode
)->io_tree
, page_start
, page_end
,
6685 EXTENT_DIRTY
| EXTENT_DELALLOC
| EXTENT_DO_ACCOUNTING
,
6686 0, 0, &cached_state
, GFP_NOFS
);
6688 ret
= btrfs_set_extent_delalloc(inode
, page_start
, page_end
,
6691 unlock_extent_cached(io_tree
, page_start
, page_end
,
6692 &cached_state
, GFP_NOFS
);
6693 ret
= VM_FAULT_SIGBUS
;
6698 /* page is wholly or partially inside EOF */
6699 if (page_start
+ PAGE_CACHE_SIZE
> size
)
6700 zero_start
= size
& ~PAGE_CACHE_MASK
;
6702 zero_start
= PAGE_CACHE_SIZE
;
6704 if (zero_start
!= PAGE_CACHE_SIZE
) {
6706 memset(kaddr
+ zero_start
, 0, PAGE_CACHE_SIZE
- zero_start
);
6707 flush_dcache_page(page
);
6710 ClearPageChecked(page
);
6711 set_page_dirty(page
);
6712 SetPageUptodate(page
);
6714 BTRFS_I(inode
)->last_trans
= root
->fs_info
->generation
;
6715 BTRFS_I(inode
)->last_sub_trans
= BTRFS_I(inode
)->root
->log_transid
;
6717 unlock_extent_cached(io_tree
, page_start
, page_end
, &cached_state
, GFP_NOFS
);
6721 return VM_FAULT_LOCKED
;
6724 btrfs_delalloc_release_space(inode
, PAGE_CACHE_SIZE
);
6729 static int btrfs_truncate(struct inode
*inode
)
6731 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
6732 struct btrfs_block_rsv
*rsv
;
6735 struct btrfs_trans_handle
*trans
;
6737 u64 mask
= root
->sectorsize
- 1;
6738 u64 min_size
= btrfs_calc_trunc_metadata_size(root
, 1);
6740 ret
= btrfs_truncate_page(inode
->i_mapping
, inode
->i_size
);
6744 btrfs_wait_ordered_range(inode
, inode
->i_size
& (~mask
), (u64
)-1);
6745 btrfs_ordered_update_i_size(inode
, inode
->i_size
, NULL
);
6748 * Yes ladies and gentelment, this is indeed ugly. The fact is we have
6749 * 3 things going on here
6751 * 1) We need to reserve space for our orphan item and the space to
6752 * delete our orphan item. Lord knows we don't want to have a dangling
6753 * orphan item because we didn't reserve space to remove it.
6755 * 2) We need to reserve space to update our inode.
6757 * 3) We need to have something to cache all the space that is going to
6758 * be free'd up by the truncate operation, but also have some slack
6759 * space reserved in case it uses space during the truncate (thank you
6760 * very much snapshotting).
6762 * And we need these to all be seperate. The fact is we can use alot of
6763 * space doing the truncate, and we have no earthly idea how much space
6764 * we will use, so we need the truncate reservation to be seperate so it
6765 * doesn't end up using space reserved for updating the inode or
6766 * removing the orphan item. We also need to be able to stop the
6767 * transaction and start a new one, which means we need to be able to
6768 * update the inode several times, and we have no idea of knowing how
6769 * many times that will be, so we can't just reserve 1 item for the
6770 * entirety of the opration, so that has to be done seperately as well.
6771 * Then there is the orphan item, which does indeed need to be held on
6772 * to for the whole operation, and we need nobody to touch this reserved
6773 * space except the orphan code.
6775 * So that leaves us with
6777 * 1) root->orphan_block_rsv - for the orphan deletion.
6778 * 2) rsv - for the truncate reservation, which we will steal from the
6779 * transaction reservation.
6780 * 3) fs_info->trans_block_rsv - this will have 1 items worth left for
6781 * updating the inode.
6783 rsv
= btrfs_alloc_block_rsv(root
);
6786 rsv
->size
= min_size
;
6789 * 1 for the truncate slack space
6790 * 1 for the orphan item we're going to add
6791 * 1 for the orphan item deletion
6792 * 1 for updating the inode.
6794 trans
= btrfs_start_transaction(root
, 4);
6795 if (IS_ERR(trans
)) {
6796 err
= PTR_ERR(trans
);
6800 /* Migrate the slack space for the truncate to our reserve */
6801 ret
= btrfs_block_rsv_migrate(&root
->fs_info
->trans_block_rsv
, rsv
,
6805 ret
= btrfs_orphan_add(trans
, inode
);
6807 btrfs_end_transaction(trans
, root
);
6812 * setattr is responsible for setting the ordered_data_close flag,
6813 * but that is only tested during the last file release. That
6814 * could happen well after the next commit, leaving a great big
6815 * window where new writes may get lost if someone chooses to write
6816 * to this file after truncating to zero
6818 * The inode doesn't have any dirty data here, and so if we commit
6819 * this is a noop. If someone immediately starts writing to the inode
6820 * it is very likely we'll catch some of their writes in this
6821 * transaction, and the commit will find this file on the ordered
6822 * data list with good things to send down.
6824 * This is a best effort solution, there is still a window where
6825 * using truncate to replace the contents of the file will
6826 * end up with a zero length file after a crash.
6828 if (inode
->i_size
== 0 && test_bit(BTRFS_INODE_ORDERED_DATA_CLOSE
,
6829 &BTRFS_I(inode
)->runtime_flags
))
6830 btrfs_add_ordered_operation(trans
, root
, inode
);
6833 ret
= btrfs_block_rsv_refill(root
, rsv
, min_size
);
6836 * This can only happen with the original transaction we
6837 * started above, every other time we shouldn't have a
6838 * transaction started yet.
6847 /* Just need the 1 for updating the inode */
6848 trans
= btrfs_start_transaction(root
, 1);
6849 if (IS_ERR(trans
)) {
6850 ret
= err
= PTR_ERR(trans
);
6856 trans
->block_rsv
= rsv
;
6858 ret
= btrfs_truncate_inode_items(trans
, root
, inode
,
6860 BTRFS_EXTENT_DATA_KEY
);
6861 if (ret
!= -EAGAIN
) {
6866 trans
->block_rsv
= &root
->fs_info
->trans_block_rsv
;
6867 ret
= btrfs_update_inode(trans
, root
, inode
);
6873 nr
= trans
->blocks_used
;
6874 btrfs_end_transaction(trans
, root
);
6876 btrfs_btree_balance_dirty(root
, nr
);
6879 if (ret
== 0 && inode
->i_nlink
> 0) {
6880 trans
->block_rsv
= root
->orphan_block_rsv
;
6881 ret
= btrfs_orphan_del(trans
, inode
);
6884 } else if (ret
&& inode
->i_nlink
> 0) {
6886 * Failed to do the truncate, remove us from the in memory
6889 ret
= btrfs_orphan_del(NULL
, inode
);
6893 trans
->block_rsv
= &root
->fs_info
->trans_block_rsv
;
6894 ret
= btrfs_update_inode(trans
, root
, inode
);
6898 nr
= trans
->blocks_used
;
6899 ret
= btrfs_end_transaction(trans
, root
);
6900 btrfs_btree_balance_dirty(root
, nr
);
6904 btrfs_free_block_rsv(root
, rsv
);
6913 * create a new subvolume directory/inode (helper for the ioctl).
6915 int btrfs_create_subvol_root(struct btrfs_trans_handle
*trans
,
6916 struct btrfs_root
*new_root
, u64 new_dirid
)
6918 struct inode
*inode
;
6922 inode
= btrfs_new_inode(trans
, new_root
, NULL
, "..", 2,
6923 new_dirid
, new_dirid
,
6924 S_IFDIR
| (~current_umask() & S_IRWXUGO
),
6927 return PTR_ERR(inode
);
6928 inode
->i_op
= &btrfs_dir_inode_operations
;
6929 inode
->i_fop
= &btrfs_dir_file_operations
;
6931 set_nlink(inode
, 1);
6932 btrfs_i_size_write(inode
, 0);
6934 err
= btrfs_update_inode(trans
, new_root
, inode
);
6940 struct inode
*btrfs_alloc_inode(struct super_block
*sb
)
6942 struct btrfs_inode
*ei
;
6943 struct inode
*inode
;
6945 ei
= kmem_cache_alloc(btrfs_inode_cachep
, GFP_NOFS
);
6952 ei
->last_sub_trans
= 0;
6953 ei
->logged_trans
= 0;
6954 ei
->delalloc_bytes
= 0;
6955 ei
->disk_i_size
= 0;
6958 ei
->index_cnt
= (u64
)-1;
6959 ei
->last_unlink_trans
= 0;
6961 spin_lock_init(&ei
->lock
);
6962 ei
->outstanding_extents
= 0;
6963 ei
->reserved_extents
= 0;
6965 ei
->runtime_flags
= 0;
6966 ei
->force_compress
= BTRFS_COMPRESS_NONE
;
6968 ei
->delayed_node
= NULL
;
6970 inode
= &ei
->vfs_inode
;
6971 extent_map_tree_init(&ei
->extent_tree
);
6972 extent_io_tree_init(&ei
->io_tree
, &inode
->i_data
);
6973 extent_io_tree_init(&ei
->io_failure_tree
, &inode
->i_data
);
6974 ei
->io_tree
.track_uptodate
= 1;
6975 ei
->io_failure_tree
.track_uptodate
= 1;
6976 mutex_init(&ei
->log_mutex
);
6977 mutex_init(&ei
->delalloc_mutex
);
6978 btrfs_ordered_inode_tree_init(&ei
->ordered_tree
);
6979 INIT_LIST_HEAD(&ei
->delalloc_inodes
);
6980 INIT_LIST_HEAD(&ei
->ordered_operations
);
6981 RB_CLEAR_NODE(&ei
->rb_node
);
6986 static void btrfs_i_callback(struct rcu_head
*head
)
6988 struct inode
*inode
= container_of(head
, struct inode
, i_rcu
);
6989 kmem_cache_free(btrfs_inode_cachep
, BTRFS_I(inode
));
6992 void btrfs_destroy_inode(struct inode
*inode
)
6994 struct btrfs_ordered_extent
*ordered
;
6995 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
6997 WARN_ON(!list_empty(&inode
->i_dentry
));
6998 WARN_ON(inode
->i_data
.nrpages
);
6999 WARN_ON(BTRFS_I(inode
)->outstanding_extents
);
7000 WARN_ON(BTRFS_I(inode
)->reserved_extents
);
7001 WARN_ON(BTRFS_I(inode
)->delalloc_bytes
);
7002 WARN_ON(BTRFS_I(inode
)->csum_bytes
);
7005 * This can happen where we create an inode, but somebody else also
7006 * created the same inode and we need to destroy the one we already
7013 * Make sure we're properly removed from the ordered operation
7017 if (!list_empty(&BTRFS_I(inode
)->ordered_operations
)) {
7018 spin_lock(&root
->fs_info
->ordered_extent_lock
);
7019 list_del_init(&BTRFS_I(inode
)->ordered_operations
);
7020 spin_unlock(&root
->fs_info
->ordered_extent_lock
);
7023 if (test_bit(BTRFS_INODE_HAS_ORPHAN_ITEM
,
7024 &BTRFS_I(inode
)->runtime_flags
)) {
7025 printk(KERN_INFO
"BTRFS: inode %llu still on the orphan list\n",
7026 (unsigned long long)btrfs_ino(inode
));
7027 atomic_dec(&root
->orphan_inodes
);
7031 ordered
= btrfs_lookup_first_ordered_extent(inode
, (u64
)-1);
7035 printk(KERN_ERR
"btrfs found ordered "
7036 "extent %llu %llu on inode cleanup\n",
7037 (unsigned long long)ordered
->file_offset
,
7038 (unsigned long long)ordered
->len
);
7039 btrfs_remove_ordered_extent(inode
, ordered
);
7040 btrfs_put_ordered_extent(ordered
);
7041 btrfs_put_ordered_extent(ordered
);
7044 inode_tree_del(inode
);
7045 btrfs_drop_extent_cache(inode
, 0, (u64
)-1, 0);
7047 btrfs_remove_delayed_node(inode
);
7048 call_rcu(&inode
->i_rcu
, btrfs_i_callback
);
7051 int btrfs_drop_inode(struct inode
*inode
)
7053 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
7055 if (btrfs_root_refs(&root
->root_item
) == 0 &&
7056 !btrfs_is_free_space_inode(inode
))
7059 return generic_drop_inode(inode
);
7062 static void init_once(void *foo
)
7064 struct btrfs_inode
*ei
= (struct btrfs_inode
*) foo
;
7066 inode_init_once(&ei
->vfs_inode
);
7069 void btrfs_destroy_cachep(void)
7071 if (btrfs_inode_cachep
)
7072 kmem_cache_destroy(btrfs_inode_cachep
);
7073 if (btrfs_trans_handle_cachep
)
7074 kmem_cache_destroy(btrfs_trans_handle_cachep
);
7075 if (btrfs_transaction_cachep
)
7076 kmem_cache_destroy(btrfs_transaction_cachep
);
7077 if (btrfs_path_cachep
)
7078 kmem_cache_destroy(btrfs_path_cachep
);
7079 if (btrfs_free_space_cachep
)
7080 kmem_cache_destroy(btrfs_free_space_cachep
);
7083 int btrfs_init_cachep(void)
7085 btrfs_inode_cachep
= kmem_cache_create("btrfs_inode_cache",
7086 sizeof(struct btrfs_inode
), 0,
7087 SLAB_RECLAIM_ACCOUNT
| SLAB_MEM_SPREAD
, init_once
);
7088 if (!btrfs_inode_cachep
)
7091 btrfs_trans_handle_cachep
= kmem_cache_create("btrfs_trans_handle_cache",
7092 sizeof(struct btrfs_trans_handle
), 0,
7093 SLAB_RECLAIM_ACCOUNT
| SLAB_MEM_SPREAD
, NULL
);
7094 if (!btrfs_trans_handle_cachep
)
7097 btrfs_transaction_cachep
= kmem_cache_create("btrfs_transaction_cache",
7098 sizeof(struct btrfs_transaction
), 0,
7099 SLAB_RECLAIM_ACCOUNT
| SLAB_MEM_SPREAD
, NULL
);
7100 if (!btrfs_transaction_cachep
)
7103 btrfs_path_cachep
= kmem_cache_create("btrfs_path_cache",
7104 sizeof(struct btrfs_path
), 0,
7105 SLAB_RECLAIM_ACCOUNT
| SLAB_MEM_SPREAD
, NULL
);
7106 if (!btrfs_path_cachep
)
7109 btrfs_free_space_cachep
= kmem_cache_create("btrfs_free_space_cache",
7110 sizeof(struct btrfs_free_space
), 0,
7111 SLAB_RECLAIM_ACCOUNT
| SLAB_MEM_SPREAD
, NULL
);
7112 if (!btrfs_free_space_cachep
)
7117 btrfs_destroy_cachep();
7121 static int btrfs_getattr(struct vfsmount
*mnt
,
7122 struct dentry
*dentry
, struct kstat
*stat
)
7124 struct inode
*inode
= dentry
->d_inode
;
7125 u32 blocksize
= inode
->i_sb
->s_blocksize
;
7127 generic_fillattr(inode
, stat
);
7128 stat
->dev
= BTRFS_I(inode
)->root
->anon_dev
;
7129 stat
->blksize
= PAGE_CACHE_SIZE
;
7130 stat
->blocks
= (ALIGN(inode_get_bytes(inode
), blocksize
) +
7131 ALIGN(BTRFS_I(inode
)->delalloc_bytes
, blocksize
)) >> 9;
7136 * If a file is moved, it will inherit the cow and compression flags of the new
7139 static void fixup_inode_flags(struct inode
*dir
, struct inode
*inode
)
7141 struct btrfs_inode
*b_dir
= BTRFS_I(dir
);
7142 struct btrfs_inode
*b_inode
= BTRFS_I(inode
);
7144 if (b_dir
->flags
& BTRFS_INODE_NODATACOW
)
7145 b_inode
->flags
|= BTRFS_INODE_NODATACOW
;
7147 b_inode
->flags
&= ~BTRFS_INODE_NODATACOW
;
7149 if (b_dir
->flags
& BTRFS_INODE_COMPRESS
) {
7150 b_inode
->flags
|= BTRFS_INODE_COMPRESS
;
7151 b_inode
->flags
&= ~BTRFS_INODE_NOCOMPRESS
;
7153 b_inode
->flags
&= ~(BTRFS_INODE_COMPRESS
|
7154 BTRFS_INODE_NOCOMPRESS
);
7158 static int btrfs_rename(struct inode
*old_dir
, struct dentry
*old_dentry
,
7159 struct inode
*new_dir
, struct dentry
*new_dentry
)
7161 struct btrfs_trans_handle
*trans
;
7162 struct btrfs_root
*root
= BTRFS_I(old_dir
)->root
;
7163 struct btrfs_root
*dest
= BTRFS_I(new_dir
)->root
;
7164 struct inode
*new_inode
= new_dentry
->d_inode
;
7165 struct inode
*old_inode
= old_dentry
->d_inode
;
7166 struct timespec ctime
= CURRENT_TIME
;
7170 u64 old_ino
= btrfs_ino(old_inode
);
7172 if (btrfs_ino(new_dir
) == BTRFS_EMPTY_SUBVOL_DIR_OBJECTID
)
7175 /* we only allow rename subvolume link between subvolumes */
7176 if (old_ino
!= BTRFS_FIRST_FREE_OBJECTID
&& root
!= dest
)
7179 if (old_ino
== BTRFS_EMPTY_SUBVOL_DIR_OBJECTID
||
7180 (new_inode
&& btrfs_ino(new_inode
) == BTRFS_FIRST_FREE_OBJECTID
))
7183 if (S_ISDIR(old_inode
->i_mode
) && new_inode
&&
7184 new_inode
->i_size
> BTRFS_EMPTY_DIR_SIZE
)
7187 * we're using rename to replace one file with another.
7188 * and the replacement file is large. Start IO on it now so
7189 * we don't add too much work to the end of the transaction
7191 if (new_inode
&& S_ISREG(old_inode
->i_mode
) && new_inode
->i_size
&&
7192 old_inode
->i_size
> BTRFS_ORDERED_OPERATIONS_FLUSH_LIMIT
)
7193 filemap_flush(old_inode
->i_mapping
);
7195 /* close the racy window with snapshot create/destroy ioctl */
7196 if (old_ino
== BTRFS_FIRST_FREE_OBJECTID
)
7197 down_read(&root
->fs_info
->subvol_sem
);
7199 * We want to reserve the absolute worst case amount of items. So if
7200 * both inodes are subvols and we need to unlink them then that would
7201 * require 4 item modifications, but if they are both normal inodes it
7202 * would require 5 item modifications, so we'll assume their normal
7203 * inodes. So 5 * 2 is 10, plus 1 for the new link, so 11 total items
7204 * should cover the worst case number of items we'll modify.
7206 trans
= btrfs_start_transaction(root
, 20);
7207 if (IS_ERR(trans
)) {
7208 ret
= PTR_ERR(trans
);
7213 btrfs_record_root_in_trans(trans
, dest
);
7215 ret
= btrfs_set_inode_index(new_dir
, &index
);
7219 if (unlikely(old_ino
== BTRFS_FIRST_FREE_OBJECTID
)) {
7220 /* force full log commit if subvolume involved. */
7221 root
->fs_info
->last_trans_log_full_commit
= trans
->transid
;
7223 ret
= btrfs_insert_inode_ref(trans
, dest
,
7224 new_dentry
->d_name
.name
,
7225 new_dentry
->d_name
.len
,
7227 btrfs_ino(new_dir
), index
);
7231 * this is an ugly little race, but the rename is required
7232 * to make sure that if we crash, the inode is either at the
7233 * old name or the new one. pinning the log transaction lets
7234 * us make sure we don't allow a log commit to come in after
7235 * we unlink the name but before we add the new name back in.
7237 btrfs_pin_log_trans(root
);
7240 * make sure the inode gets flushed if it is replacing
7243 if (new_inode
&& new_inode
->i_size
&& S_ISREG(old_inode
->i_mode
))
7244 btrfs_add_ordered_operation(trans
, root
, old_inode
);
7246 inode_inc_iversion(old_dir
);
7247 inode_inc_iversion(new_dir
);
7248 inode_inc_iversion(old_inode
);
7249 old_dir
->i_ctime
= old_dir
->i_mtime
= ctime
;
7250 new_dir
->i_ctime
= new_dir
->i_mtime
= ctime
;
7251 old_inode
->i_ctime
= ctime
;
7253 if (old_dentry
->d_parent
!= new_dentry
->d_parent
)
7254 btrfs_record_unlink_dir(trans
, old_dir
, old_inode
, 1);
7256 if (unlikely(old_ino
== BTRFS_FIRST_FREE_OBJECTID
)) {
7257 root_objectid
= BTRFS_I(old_inode
)->root
->root_key
.objectid
;
7258 ret
= btrfs_unlink_subvol(trans
, root
, old_dir
, root_objectid
,
7259 old_dentry
->d_name
.name
,
7260 old_dentry
->d_name
.len
);
7262 ret
= __btrfs_unlink_inode(trans
, root
, old_dir
,
7263 old_dentry
->d_inode
,
7264 old_dentry
->d_name
.name
,
7265 old_dentry
->d_name
.len
);
7267 ret
= btrfs_update_inode(trans
, root
, old_inode
);
7270 btrfs_abort_transaction(trans
, root
, ret
);
7275 inode_inc_iversion(new_inode
);
7276 new_inode
->i_ctime
= CURRENT_TIME
;
7277 if (unlikely(btrfs_ino(new_inode
) ==
7278 BTRFS_EMPTY_SUBVOL_DIR_OBJECTID
)) {
7279 root_objectid
= BTRFS_I(new_inode
)->location
.objectid
;
7280 ret
= btrfs_unlink_subvol(trans
, dest
, new_dir
,
7282 new_dentry
->d_name
.name
,
7283 new_dentry
->d_name
.len
);
7284 BUG_ON(new_inode
->i_nlink
== 0);
7286 ret
= btrfs_unlink_inode(trans
, dest
, new_dir
,
7287 new_dentry
->d_inode
,
7288 new_dentry
->d_name
.name
,
7289 new_dentry
->d_name
.len
);
7291 if (!ret
&& new_inode
->i_nlink
== 0) {
7292 ret
= btrfs_orphan_add(trans
, new_dentry
->d_inode
);
7296 btrfs_abort_transaction(trans
, root
, ret
);
7301 fixup_inode_flags(new_dir
, old_inode
);
7303 ret
= btrfs_add_link(trans
, new_dir
, old_inode
,
7304 new_dentry
->d_name
.name
,
7305 new_dentry
->d_name
.len
, 0, index
);
7307 btrfs_abort_transaction(trans
, root
, ret
);
7311 if (old_ino
!= BTRFS_FIRST_FREE_OBJECTID
) {
7312 struct dentry
*parent
= new_dentry
->d_parent
;
7313 btrfs_log_new_name(trans
, old_inode
, old_dir
, parent
);
7314 btrfs_end_log_trans(root
);
7317 btrfs_end_transaction(trans
, root
);
7319 if (old_ino
== BTRFS_FIRST_FREE_OBJECTID
)
7320 up_read(&root
->fs_info
->subvol_sem
);
7326 * some fairly slow code that needs optimization. This walks the list
7327 * of all the inodes with pending delalloc and forces them to disk.
7329 int btrfs_start_delalloc_inodes(struct btrfs_root
*root
, int delay_iput
)
7331 struct list_head
*head
= &root
->fs_info
->delalloc_inodes
;
7332 struct btrfs_inode
*binode
;
7333 struct inode
*inode
;
7335 if (root
->fs_info
->sb
->s_flags
& MS_RDONLY
)
7338 spin_lock(&root
->fs_info
->delalloc_lock
);
7339 while (!list_empty(head
)) {
7340 binode
= list_entry(head
->next
, struct btrfs_inode
,
7342 inode
= igrab(&binode
->vfs_inode
);
7344 list_del_init(&binode
->delalloc_inodes
);
7345 spin_unlock(&root
->fs_info
->delalloc_lock
);
7347 filemap_flush(inode
->i_mapping
);
7349 btrfs_add_delayed_iput(inode
);
7354 spin_lock(&root
->fs_info
->delalloc_lock
);
7356 spin_unlock(&root
->fs_info
->delalloc_lock
);
7358 /* the filemap_flush will queue IO into the worker threads, but
7359 * we have to make sure the IO is actually started and that
7360 * ordered extents get created before we return
7362 atomic_inc(&root
->fs_info
->async_submit_draining
);
7363 while (atomic_read(&root
->fs_info
->nr_async_submits
) ||
7364 atomic_read(&root
->fs_info
->async_delalloc_pages
)) {
7365 wait_event(root
->fs_info
->async_submit_wait
,
7366 (atomic_read(&root
->fs_info
->nr_async_submits
) == 0 &&
7367 atomic_read(&root
->fs_info
->async_delalloc_pages
) == 0));
7369 atomic_dec(&root
->fs_info
->async_submit_draining
);
7373 static int btrfs_symlink(struct inode
*dir
, struct dentry
*dentry
,
7374 const char *symname
)
7376 struct btrfs_trans_handle
*trans
;
7377 struct btrfs_root
*root
= BTRFS_I(dir
)->root
;
7378 struct btrfs_path
*path
;
7379 struct btrfs_key key
;
7380 struct inode
*inode
= NULL
;
7388 struct btrfs_file_extent_item
*ei
;
7389 struct extent_buffer
*leaf
;
7390 unsigned long nr
= 0;
7392 name_len
= strlen(symname
) + 1;
7393 if (name_len
> BTRFS_MAX_INLINE_DATA_SIZE(root
))
7394 return -ENAMETOOLONG
;
7397 * 2 items for inode item and ref
7398 * 2 items for dir items
7399 * 1 item for xattr if selinux is on
7401 trans
= btrfs_start_transaction(root
, 5);
7403 return PTR_ERR(trans
);
7405 err
= btrfs_find_free_ino(root
, &objectid
);
7409 inode
= btrfs_new_inode(trans
, root
, dir
, dentry
->d_name
.name
,
7410 dentry
->d_name
.len
, btrfs_ino(dir
), objectid
,
7411 S_IFLNK
|S_IRWXUGO
, &index
);
7412 if (IS_ERR(inode
)) {
7413 err
= PTR_ERR(inode
);
7417 err
= btrfs_init_inode_security(trans
, inode
, dir
, &dentry
->d_name
);
7424 * If the active LSM wants to access the inode during
7425 * d_instantiate it needs these. Smack checks to see
7426 * if the filesystem supports xattrs by looking at the
7429 inode
->i_fop
= &btrfs_file_operations
;
7430 inode
->i_op
= &btrfs_file_inode_operations
;
7432 err
= btrfs_add_nondir(trans
, dir
, dentry
, inode
, 0, index
);
7436 inode
->i_mapping
->a_ops
= &btrfs_aops
;
7437 inode
->i_mapping
->backing_dev_info
= &root
->fs_info
->bdi
;
7438 BTRFS_I(inode
)->io_tree
.ops
= &btrfs_extent_io_ops
;
7443 path
= btrfs_alloc_path();
7449 key
.objectid
= btrfs_ino(inode
);
7451 btrfs_set_key_type(&key
, BTRFS_EXTENT_DATA_KEY
);
7452 datasize
= btrfs_file_extent_calc_inline_size(name_len
);
7453 err
= btrfs_insert_empty_item(trans
, root
, path
, &key
,
7457 btrfs_free_path(path
);
7460 leaf
= path
->nodes
[0];
7461 ei
= btrfs_item_ptr(leaf
, path
->slots
[0],
7462 struct btrfs_file_extent_item
);
7463 btrfs_set_file_extent_generation(leaf
, ei
, trans
->transid
);
7464 btrfs_set_file_extent_type(leaf
, ei
,
7465 BTRFS_FILE_EXTENT_INLINE
);
7466 btrfs_set_file_extent_encryption(leaf
, ei
, 0);
7467 btrfs_set_file_extent_compression(leaf
, ei
, 0);
7468 btrfs_set_file_extent_other_encoding(leaf
, ei
, 0);
7469 btrfs_set_file_extent_ram_bytes(leaf
, ei
, name_len
);
7471 ptr
= btrfs_file_extent_inline_start(ei
);
7472 write_extent_buffer(leaf
, symname
, ptr
, name_len
);
7473 btrfs_mark_buffer_dirty(leaf
);
7474 btrfs_free_path(path
);
7476 inode
->i_op
= &btrfs_symlink_inode_operations
;
7477 inode
->i_mapping
->a_ops
= &btrfs_symlink_aops
;
7478 inode
->i_mapping
->backing_dev_info
= &root
->fs_info
->bdi
;
7479 inode_set_bytes(inode
, name_len
);
7480 btrfs_i_size_write(inode
, name_len
- 1);
7481 err
= btrfs_update_inode(trans
, root
, inode
);
7487 d_instantiate(dentry
, inode
);
7488 nr
= trans
->blocks_used
;
7489 btrfs_end_transaction(trans
, root
);
7491 inode_dec_link_count(inode
);
7494 btrfs_btree_balance_dirty(root
, nr
);
7498 static int __btrfs_prealloc_file_range(struct inode
*inode
, int mode
,
7499 u64 start
, u64 num_bytes
, u64 min_size
,
7500 loff_t actual_len
, u64
*alloc_hint
,
7501 struct btrfs_trans_handle
*trans
)
7503 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
7504 struct btrfs_key ins
;
7505 u64 cur_offset
= start
;
7508 bool own_trans
= true;
7512 while (num_bytes
> 0) {
7514 trans
= btrfs_start_transaction(root
, 3);
7515 if (IS_ERR(trans
)) {
7516 ret
= PTR_ERR(trans
);
7521 ret
= btrfs_reserve_extent(trans
, root
, num_bytes
, min_size
,
7522 0, *alloc_hint
, &ins
, 1);
7525 btrfs_end_transaction(trans
, root
);
7529 ret
= insert_reserved_file_extent(trans
, inode
,
7530 cur_offset
, ins
.objectid
,
7531 ins
.offset
, ins
.offset
,
7532 ins
.offset
, 0, 0, 0,
7533 BTRFS_FILE_EXTENT_PREALLOC
);
7535 btrfs_abort_transaction(trans
, root
, ret
);
7537 btrfs_end_transaction(trans
, root
);
7540 btrfs_drop_extent_cache(inode
, cur_offset
,
7541 cur_offset
+ ins
.offset
-1, 0);
7543 num_bytes
-= ins
.offset
;
7544 cur_offset
+= ins
.offset
;
7545 *alloc_hint
= ins
.objectid
+ ins
.offset
;
7547 inode_inc_iversion(inode
);
7548 inode
->i_ctime
= CURRENT_TIME
;
7549 BTRFS_I(inode
)->flags
|= BTRFS_INODE_PREALLOC
;
7550 if (!(mode
& FALLOC_FL_KEEP_SIZE
) &&
7551 (actual_len
> inode
->i_size
) &&
7552 (cur_offset
> inode
->i_size
)) {
7553 if (cur_offset
> actual_len
)
7554 i_size
= actual_len
;
7556 i_size
= cur_offset
;
7557 i_size_write(inode
, i_size
);
7558 btrfs_ordered_update_i_size(inode
, i_size
, NULL
);
7561 ret
= btrfs_update_inode(trans
, root
, inode
);
7564 btrfs_abort_transaction(trans
, root
, ret
);
7566 btrfs_end_transaction(trans
, root
);
7571 btrfs_end_transaction(trans
, root
);
7576 int btrfs_prealloc_file_range(struct inode
*inode
, int mode
,
7577 u64 start
, u64 num_bytes
, u64 min_size
,
7578 loff_t actual_len
, u64
*alloc_hint
)
7580 return __btrfs_prealloc_file_range(inode
, mode
, start
, num_bytes
,
7581 min_size
, actual_len
, alloc_hint
,
7585 int btrfs_prealloc_file_range_trans(struct inode
*inode
,
7586 struct btrfs_trans_handle
*trans
, int mode
,
7587 u64 start
, u64 num_bytes
, u64 min_size
,
7588 loff_t actual_len
, u64
*alloc_hint
)
7590 return __btrfs_prealloc_file_range(inode
, mode
, start
, num_bytes
,
7591 min_size
, actual_len
, alloc_hint
, trans
);
7594 static int btrfs_set_page_dirty(struct page
*page
)
7596 return __set_page_dirty_nobuffers(page
);
7599 static int btrfs_permission(struct inode
*inode
, int mask
)
7601 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
7602 umode_t mode
= inode
->i_mode
;
7604 if (mask
& MAY_WRITE
&&
7605 (S_ISREG(mode
) || S_ISDIR(mode
) || S_ISLNK(mode
))) {
7606 if (btrfs_root_readonly(root
))
7608 if (BTRFS_I(inode
)->flags
& BTRFS_INODE_READONLY
)
7611 return generic_permission(inode
, mask
);
7614 static const struct inode_operations btrfs_dir_inode_operations
= {
7615 .getattr
= btrfs_getattr
,
7616 .lookup
= btrfs_lookup
,
7617 .create
= btrfs_create
,
7618 .unlink
= btrfs_unlink
,
7620 .mkdir
= btrfs_mkdir
,
7621 .rmdir
= btrfs_rmdir
,
7622 .rename
= btrfs_rename
,
7623 .symlink
= btrfs_symlink
,
7624 .setattr
= btrfs_setattr
,
7625 .mknod
= btrfs_mknod
,
7626 .setxattr
= btrfs_setxattr
,
7627 .getxattr
= btrfs_getxattr
,
7628 .listxattr
= btrfs_listxattr
,
7629 .removexattr
= btrfs_removexattr
,
7630 .permission
= btrfs_permission
,
7631 .get_acl
= btrfs_get_acl
,
7633 static const struct inode_operations btrfs_dir_ro_inode_operations
= {
7634 .lookup
= btrfs_lookup
,
7635 .permission
= btrfs_permission
,
7636 .get_acl
= btrfs_get_acl
,
7639 static const struct file_operations btrfs_dir_file_operations
= {
7640 .llseek
= generic_file_llseek
,
7641 .read
= generic_read_dir
,
7642 .readdir
= btrfs_real_readdir
,
7643 .unlocked_ioctl
= btrfs_ioctl
,
7644 #ifdef CONFIG_COMPAT
7645 .compat_ioctl
= btrfs_ioctl
,
7647 .release
= btrfs_release_file
,
7648 .fsync
= btrfs_sync_file
,
7651 static struct extent_io_ops btrfs_extent_io_ops
= {
7652 .fill_delalloc
= run_delalloc_range
,
7653 .submit_bio_hook
= btrfs_submit_bio_hook
,
7654 .merge_bio_hook
= btrfs_merge_bio_hook
,
7655 .readpage_end_io_hook
= btrfs_readpage_end_io_hook
,
7656 .writepage_end_io_hook
= btrfs_writepage_end_io_hook
,
7657 .writepage_start_hook
= btrfs_writepage_start_hook
,
7658 .set_bit_hook
= btrfs_set_bit_hook
,
7659 .clear_bit_hook
= btrfs_clear_bit_hook
,
7660 .merge_extent_hook
= btrfs_merge_extent_hook
,
7661 .split_extent_hook
= btrfs_split_extent_hook
,
7665 * btrfs doesn't support the bmap operation because swapfiles
7666 * use bmap to make a mapping of extents in the file. They assume
7667 * these extents won't change over the life of the file and they
7668 * use the bmap result to do IO directly to the drive.
7670 * the btrfs bmap call would return logical addresses that aren't
7671 * suitable for IO and they also will change frequently as COW
7672 * operations happen. So, swapfile + btrfs == corruption.
7674 * For now we're avoiding this by dropping bmap.
7676 static const struct address_space_operations btrfs_aops
= {
7677 .readpage
= btrfs_readpage
,
7678 .writepage
= btrfs_writepage
,
7679 .writepages
= btrfs_writepages
,
7680 .readpages
= btrfs_readpages
,
7681 .direct_IO
= btrfs_direct_IO
,
7682 .invalidatepage
= btrfs_invalidatepage
,
7683 .releasepage
= btrfs_releasepage
,
7684 .set_page_dirty
= btrfs_set_page_dirty
,
7685 .error_remove_page
= generic_error_remove_page
,
7688 static const struct address_space_operations btrfs_symlink_aops
= {
7689 .readpage
= btrfs_readpage
,
7690 .writepage
= btrfs_writepage
,
7691 .invalidatepage
= btrfs_invalidatepage
,
7692 .releasepage
= btrfs_releasepage
,
7695 static const struct inode_operations btrfs_file_inode_operations
= {
7696 .getattr
= btrfs_getattr
,
7697 .setattr
= btrfs_setattr
,
7698 .setxattr
= btrfs_setxattr
,
7699 .getxattr
= btrfs_getxattr
,
7700 .listxattr
= btrfs_listxattr
,
7701 .removexattr
= btrfs_removexattr
,
7702 .permission
= btrfs_permission
,
7703 .fiemap
= btrfs_fiemap
,
7704 .get_acl
= btrfs_get_acl
,
7705 .update_time
= btrfs_update_time
,
7707 static const struct inode_operations btrfs_special_inode_operations
= {
7708 .getattr
= btrfs_getattr
,
7709 .setattr
= btrfs_setattr
,
7710 .permission
= btrfs_permission
,
7711 .setxattr
= btrfs_setxattr
,
7712 .getxattr
= btrfs_getxattr
,
7713 .listxattr
= btrfs_listxattr
,
7714 .removexattr
= btrfs_removexattr
,
7715 .get_acl
= btrfs_get_acl
,
7716 .update_time
= btrfs_update_time
,
7718 static const struct inode_operations btrfs_symlink_inode_operations
= {
7719 .readlink
= generic_readlink
,
7720 .follow_link
= page_follow_link_light
,
7721 .put_link
= page_put_link
,
7722 .getattr
= btrfs_getattr
,
7723 .setattr
= btrfs_setattr
,
7724 .permission
= btrfs_permission
,
7725 .setxattr
= btrfs_setxattr
,
7726 .getxattr
= btrfs_getxattr
,
7727 .listxattr
= btrfs_listxattr
,
7728 .removexattr
= btrfs_removexattr
,
7729 .get_acl
= btrfs_get_acl
,
7730 .update_time
= btrfs_update_time
,
7733 const struct dentry_operations btrfs_dentry_operations
= {
7734 .d_delete
= btrfs_dentry_delete
,
7735 .d_release
= btrfs_dentry_release
,