|
@@ -573,8 +573,8 @@ retry:
|
|
|
unsigned long nr_written = 0;
|
|
|
|
|
|
lock_extent(io_tree, async_extent->start,
|
|
|
- async_extent->start +
|
|
|
- async_extent->ram_size - 1, GFP_NOFS);
|
|
|
+ async_extent->start +
|
|
|
+ async_extent->ram_size - 1, GFP_NOFS);
|
|
|
|
|
|
/* allocate blocks */
|
|
|
ret = cow_file_range(inode, async_cow->locked_page,
|
|
@@ -1512,12 +1512,13 @@ static noinline int add_pending_csums(struct btrfs_trans_handle *trans,
|
|
|
return 0;
|
|
|
}
|
|
|
|
|
|
-int btrfs_set_extent_delalloc(struct inode *inode, u64 start, u64 end)
|
|
|
+int btrfs_set_extent_delalloc(struct inode *inode, u64 start, u64 end,
|
|
|
+ struct extent_state **cached_state)
|
|
|
{
|
|
|
if ((end & (PAGE_CACHE_SIZE - 1)) == 0)
|
|
|
WARN_ON(1);
|
|
|
return set_extent_delalloc(&BTRFS_I(inode)->io_tree, start, end,
|
|
|
- GFP_NOFS);
|
|
|
+ cached_state, GFP_NOFS);
|
|
|
}
|
|
|
|
|
|
/* see btrfs_writepage_start_hook for details on why this is required */
|
|
@@ -1530,6 +1531,7 @@ static void btrfs_writepage_fixup_worker(struct btrfs_work *work)
|
|
|
{
|
|
|
struct btrfs_writepage_fixup *fixup;
|
|
|
struct btrfs_ordered_extent *ordered;
|
|
|
+ struct extent_state *cached_state = NULL;
|
|
|
struct page *page;
|
|
|
struct inode *inode;
|
|
|
u64 page_start;
|
|
@@ -1548,7 +1550,8 @@ again:
|
|
|
page_start = page_offset(page);
|
|
|
page_end = page_offset(page) + PAGE_CACHE_SIZE - 1;
|
|
|
|
|
|
- lock_extent(&BTRFS_I(inode)->io_tree, page_start, page_end, GFP_NOFS);
|
|
|
+ lock_extent_bits(&BTRFS_I(inode)->io_tree, page_start, page_end, 0,
|
|
|
+ &cached_state, GFP_NOFS);
|
|
|
|
|
|
/* already ordered? We're done */
|
|
|
if (PagePrivate2(page))
|
|
@@ -1556,17 +1559,18 @@ again:
|
|
|
|
|
|
ordered = btrfs_lookup_ordered_extent(inode, page_start);
|
|
|
if (ordered) {
|
|
|
- unlock_extent(&BTRFS_I(inode)->io_tree, page_start,
|
|
|
- page_end, GFP_NOFS);
|
|
|
+ unlock_extent_cached(&BTRFS_I(inode)->io_tree, page_start,
|
|
|
+ page_end, &cached_state, GFP_NOFS);
|
|
|
unlock_page(page);
|
|
|
btrfs_start_ordered_extent(inode, ordered, 1);
|
|
|
goto again;
|
|
|
}
|
|
|
|
|
|
- btrfs_set_extent_delalloc(inode, page_start, page_end);
|
|
|
+ btrfs_set_extent_delalloc(inode, page_start, page_end, &cached_state);
|
|
|
ClearPageChecked(page);
|
|
|
out:
|
|
|
- unlock_extent(&BTRFS_I(inode)->io_tree, page_start, page_end, GFP_NOFS);
|
|
|
+ unlock_extent_cached(&BTRFS_I(inode)->io_tree, page_start, page_end,
|
|
|
+ &cached_state, GFP_NOFS);
|
|
|
out_page:
|
|
|
unlock_page(page);
|
|
|
page_cache_release(page);
|
|
@@ -1695,6 +1699,7 @@ static int btrfs_finish_ordered_io(struct inode *inode, u64 start, u64 end)
|
|
|
struct btrfs_trans_handle *trans;
|
|
|
struct btrfs_ordered_extent *ordered_extent = NULL;
|
|
|
struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
|
|
|
+ struct extent_state *cached_state = NULL;
|
|
|
int compressed = 0;
|
|
|
int ret;
|
|
|
|
|
@@ -1716,9 +1721,9 @@ static int btrfs_finish_ordered_io(struct inode *inode, u64 start, u64 end)
|
|
|
goto out;
|
|
|
}
|
|
|
|
|
|
- lock_extent(io_tree, ordered_extent->file_offset,
|
|
|
- ordered_extent->file_offset + ordered_extent->len - 1,
|
|
|
- GFP_NOFS);
|
|
|
+ lock_extent_bits(io_tree, ordered_extent->file_offset,
|
|
|
+ ordered_extent->file_offset + ordered_extent->len - 1,
|
|
|
+ 0, &cached_state, GFP_NOFS);
|
|
|
|
|
|
trans = btrfs_join_transaction(root, 1);
|
|
|
|
|
@@ -1745,9 +1750,10 @@ static int btrfs_finish_ordered_io(struct inode *inode, u64 start, u64 end)
|
|
|
ordered_extent->len);
|
|
|
BUG_ON(ret);
|
|
|
}
|
|
|
- unlock_extent(io_tree, ordered_extent->file_offset,
|
|
|
- ordered_extent->file_offset + ordered_extent->len - 1,
|
|
|
- GFP_NOFS);
|
|
|
+ unlock_extent_cached(io_tree, ordered_extent->file_offset,
|
|
|
+ ordered_extent->file_offset +
|
|
|
+ ordered_extent->len - 1, &cached_state, GFP_NOFS);
|
|
|
+
|
|
|
add_pending_csums(trans, inode, ordered_extent->file_offset,
|
|
|
&ordered_extent->list);
|
|
|
|
|
@@ -3084,6 +3090,7 @@ static int btrfs_truncate_page(struct address_space *mapping, loff_t from)
|
|
|
struct btrfs_root *root = BTRFS_I(inode)->root;
|
|
|
struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
|
|
|
struct btrfs_ordered_extent *ordered;
|
|
|
+ struct extent_state *cached_state = NULL;
|
|
|
char *kaddr;
|
|
|
u32 blocksize = root->sectorsize;
|
|
|
pgoff_t index = from >> PAGE_CACHE_SHIFT;
|
|
@@ -3130,12 +3137,14 @@ again:
|
|
|
}
|
|
|
wait_on_page_writeback(page);
|
|
|
|
|
|
- lock_extent(io_tree, page_start, page_end, GFP_NOFS);
|
|
|
+ lock_extent_bits(io_tree, page_start, page_end, 0, &cached_state,
|
|
|
+ GFP_NOFS);
|
|
|
set_page_extent_mapped(page);
|
|
|
|
|
|
ordered = btrfs_lookup_ordered_extent(inode, page_start);
|
|
|
if (ordered) {
|
|
|
- unlock_extent(io_tree, page_start, page_end, GFP_NOFS);
|
|
|
+ unlock_extent_cached(io_tree, page_start, page_end,
|
|
|
+ &cached_state, GFP_NOFS);
|
|
|
unlock_page(page);
|
|
|
page_cache_release(page);
|
|
|
btrfs_start_ordered_extent(inode, ordered, 1);
|
|
@@ -3143,13 +3152,15 @@ again:
|
|
|
goto again;
|
|
|
}
|
|
|
|
|
|
- clear_extent_bits(&BTRFS_I(inode)->io_tree, page_start, page_end,
|
|
|
+ clear_extent_bit(&BTRFS_I(inode)->io_tree, page_start, page_end,
|
|
|
EXTENT_DIRTY | EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING,
|
|
|
- GFP_NOFS);
|
|
|
+ 0, 0, &cached_state, GFP_NOFS);
|
|
|
|
|
|
- ret = btrfs_set_extent_delalloc(inode, page_start, page_end);
|
|
|
+ ret = btrfs_set_extent_delalloc(inode, page_start, page_end,
|
|
|
+ &cached_state);
|
|
|
if (ret) {
|
|
|
- unlock_extent(io_tree, page_start, page_end, GFP_NOFS);
|
|
|
+ unlock_extent_cached(io_tree, page_start, page_end,
|
|
|
+ &cached_state, GFP_NOFS);
|
|
|
goto out_unlock;
|
|
|
}
|
|
|
|
|
@@ -3162,7 +3173,8 @@ again:
|
|
|
}
|
|
|
ClearPageChecked(page);
|
|
|
set_page_dirty(page);
|
|
|
- unlock_extent(io_tree, page_start, page_end, GFP_NOFS);
|
|
|
+ unlock_extent_cached(io_tree, page_start, page_end, &cached_state,
|
|
|
+ GFP_NOFS);
|
|
|
|
|
|
out_unlock:
|
|
|
if (ret)
|
|
@@ -3180,6 +3192,7 @@ int btrfs_cont_expand(struct inode *inode, loff_t size)
|
|
|
struct btrfs_root *root = BTRFS_I(inode)->root;
|
|
|
struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
|
|
|
struct extent_map *em;
|
|
|
+ struct extent_state *cached_state = NULL;
|
|
|
u64 mask = root->sectorsize - 1;
|
|
|
u64 hole_start = (inode->i_size + mask) & ~mask;
|
|
|
u64 block_end = (size + mask) & ~mask;
|
|
@@ -3195,11 +3208,13 @@ int btrfs_cont_expand(struct inode *inode, loff_t size)
|
|
|
struct btrfs_ordered_extent *ordered;
|
|
|
btrfs_wait_ordered_range(inode, hole_start,
|
|
|
block_end - hole_start);
|
|
|
- lock_extent(io_tree, hole_start, block_end - 1, GFP_NOFS);
|
|
|
+ lock_extent_bits(io_tree, hole_start, block_end - 1, 0,
|
|
|
+ &cached_state, GFP_NOFS);
|
|
|
ordered = btrfs_lookup_ordered_extent(inode, hole_start);
|
|
|
if (!ordered)
|
|
|
break;
|
|
|
- unlock_extent(io_tree, hole_start, block_end - 1, GFP_NOFS);
|
|
|
+ unlock_extent_cached(io_tree, hole_start, block_end - 1,
|
|
|
+ &cached_state, GFP_NOFS);
|
|
|
btrfs_put_ordered_extent(ordered);
|
|
|
}
|
|
|
|
|
@@ -3244,7 +3259,8 @@ int btrfs_cont_expand(struct inode *inode, loff_t size)
|
|
|
break;
|
|
|
}
|
|
|
|
|
|
- unlock_extent(io_tree, hole_start, block_end - 1, GFP_NOFS);
|
|
|
+ unlock_extent_cached(io_tree, hole_start, block_end - 1, &cached_state,
|
|
|
+ GFP_NOFS);
|
|
|
return err;
|
|
|
}
|
|
|
|
|
@@ -4985,6 +5001,7 @@ static void btrfs_invalidatepage(struct page *page, unsigned long offset)
|
|
|
{
|
|
|
struct extent_io_tree *tree;
|
|
|
struct btrfs_ordered_extent *ordered;
|
|
|
+ struct extent_state *cached_state = NULL;
|
|
|
u64 page_start = page_offset(page);
|
|
|
u64 page_end = page_start + PAGE_CACHE_SIZE - 1;
|
|
|
|
|
@@ -5003,7 +5020,8 @@ static void btrfs_invalidatepage(struct page *page, unsigned long offset)
|
|
|
btrfs_releasepage(page, GFP_NOFS);
|
|
|
return;
|
|
|
}
|
|
|
- lock_extent(tree, page_start, page_end, GFP_NOFS);
|
|
|
+ lock_extent_bits(tree, page_start, page_end, 0, &cached_state,
|
|
|
+ GFP_NOFS);
|
|
|
ordered = btrfs_lookup_ordered_extent(page->mapping->host,
|
|
|
page_offset(page));
|
|
|
if (ordered) {
|
|
@@ -5014,7 +5032,7 @@ static void btrfs_invalidatepage(struct page *page, unsigned long offset)
|
|
|
clear_extent_bit(tree, page_start, page_end,
|
|
|
EXTENT_DIRTY | EXTENT_DELALLOC |
|
|
|
EXTENT_LOCKED | EXTENT_DO_ACCOUNTING, 1, 0,
|
|
|
- NULL, GFP_NOFS);
|
|
|
+ &cached_state, GFP_NOFS);
|
|
|
/*
|
|
|
* whoever cleared the private bit is responsible
|
|
|
* for the finish_ordered_io
|
|
@@ -5024,11 +5042,13 @@ static void btrfs_invalidatepage(struct page *page, unsigned long offset)
|
|
|
page_start, page_end);
|
|
|
}
|
|
|
btrfs_put_ordered_extent(ordered);
|
|
|
- lock_extent(tree, page_start, page_end, GFP_NOFS);
|
|
|
+ cached_state = NULL;
|
|
|
+ lock_extent_bits(tree, page_start, page_end, 0, &cached_state,
|
|
|
+ GFP_NOFS);
|
|
|
}
|
|
|
clear_extent_bit(tree, page_start, page_end,
|
|
|
EXTENT_LOCKED | EXTENT_DIRTY | EXTENT_DELALLOC |
|
|
|
- EXTENT_DO_ACCOUNTING, 1, 1, NULL, GFP_NOFS);
|
|
|
+ EXTENT_DO_ACCOUNTING, 1, 1, &cached_state, GFP_NOFS);
|
|
|
__btrfs_releasepage(page, GFP_NOFS);
|
|
|
|
|
|
ClearPageChecked(page);
|
|
@@ -5061,6 +5081,7 @@ int btrfs_page_mkwrite(struct vm_area_struct *vma, struct vm_fault *vmf)
|
|
|
struct btrfs_root *root = BTRFS_I(inode)->root;
|
|
|
struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
|
|
|
struct btrfs_ordered_extent *ordered;
|
|
|
+ struct extent_state *cached_state = NULL;
|
|
|
char *kaddr;
|
|
|
unsigned long zero_start;
|
|
|
loff_t size;
|
|
@@ -5099,7 +5120,8 @@ again:
|
|
|
}
|
|
|
wait_on_page_writeback(page);
|
|
|
|
|
|
- lock_extent(io_tree, page_start, page_end, GFP_NOFS);
|
|
|
+ lock_extent_bits(io_tree, page_start, page_end, 0, &cached_state,
|
|
|
+ GFP_NOFS);
|
|
|
set_page_extent_mapped(page);
|
|
|
|
|
|
/*
|
|
@@ -5108,7 +5130,8 @@ again:
|
|
|
*/
|
|
|
ordered = btrfs_lookup_ordered_extent(inode, page_start);
|
|
|
if (ordered) {
|
|
|
- unlock_extent(io_tree, page_start, page_end, GFP_NOFS);
|
|
|
+ unlock_extent_cached(io_tree, page_start, page_end,
|
|
|
+ &cached_state, GFP_NOFS);
|
|
|
unlock_page(page);
|
|
|
btrfs_start_ordered_extent(inode, ordered, 1);
|
|
|
btrfs_put_ordered_extent(ordered);
|
|
@@ -5122,13 +5145,15 @@ again:
|
|
|
* is probably a better way to do this, but for now keep consistent with
|
|
|
* prepare_pages in the normal write path.
|
|
|
*/
|
|
|
- clear_extent_bits(&BTRFS_I(inode)->io_tree, page_start, page_end,
|
|
|
+ clear_extent_bit(&BTRFS_I(inode)->io_tree, page_start, page_end,
|
|
|
EXTENT_DIRTY | EXTENT_DELALLOC | EXTENT_DO_ACCOUNTING,
|
|
|
- GFP_NOFS);
|
|
|
+ 0, 0, &cached_state, GFP_NOFS);
|
|
|
|
|
|
- ret = btrfs_set_extent_delalloc(inode, page_start, page_end);
|
|
|
+ ret = btrfs_set_extent_delalloc(inode, page_start, page_end,
|
|
|
+ &cached_state);
|
|
|
if (ret) {
|
|
|
- unlock_extent(io_tree, page_start, page_end, GFP_NOFS);
|
|
|
+ unlock_extent_cached(io_tree, page_start, page_end,
|
|
|
+ &cached_state, GFP_NOFS);
|
|
|
ret = VM_FAULT_SIGBUS;
|
|
|
btrfs_free_reserved_data_space(root, inode, PAGE_CACHE_SIZE);
|
|
|
goto out_unlock;
|
|
@@ -5154,7 +5179,7 @@ again:
|
|
|
BTRFS_I(inode)->last_trans = root->fs_info->generation;
|
|
|
BTRFS_I(inode)->last_sub_trans = BTRFS_I(inode)->root->log_transid;
|
|
|
|
|
|
- unlock_extent(io_tree, page_start, page_end, GFP_NOFS);
|
|
|
+ unlock_extent_cached(io_tree, page_start, page_end, &cached_state, GFP_NOFS);
|
|
|
|
|
|
out_unlock:
|
|
|
btrfs_unreserve_metadata_for_delalloc(root, inode, 1);
|
|
@@ -5833,6 +5858,7 @@ stop_trans:
|
|
|
static long btrfs_fallocate(struct inode *inode, int mode,
|
|
|
loff_t offset, loff_t len)
|
|
|
{
|
|
|
+ struct extent_state *cached_state = NULL;
|
|
|
u64 cur_offset;
|
|
|
u64 last_byte;
|
|
|
u64 alloc_start;
|
|
@@ -5871,16 +5897,17 @@ static long btrfs_fallocate(struct inode *inode, int mode,
|
|
|
/* the extent lock is ordered inside the running
|
|
|
* transaction
|
|
|
*/
|
|
|
- lock_extent(&BTRFS_I(inode)->io_tree, alloc_start, locked_end,
|
|
|
- GFP_NOFS);
|
|
|
+ lock_extent_bits(&BTRFS_I(inode)->io_tree, alloc_start,
|
|
|
+ locked_end, 0, &cached_state, GFP_NOFS);
|
|
|
ordered = btrfs_lookup_first_ordered_extent(inode,
|
|
|
alloc_end - 1);
|
|
|
if (ordered &&
|
|
|
ordered->file_offset + ordered->len > alloc_start &&
|
|
|
ordered->file_offset < alloc_end) {
|
|
|
btrfs_put_ordered_extent(ordered);
|
|
|
- unlock_extent(&BTRFS_I(inode)->io_tree,
|
|
|
- alloc_start, locked_end, GFP_NOFS);
|
|
|
+ unlock_extent_cached(&BTRFS_I(inode)->io_tree,
|
|
|
+ alloc_start, locked_end,
|
|
|
+ &cached_state, GFP_NOFS);
|
|
|
/*
|
|
|
* we can't wait on the range with the transaction
|
|
|
* running or with the extent lock held
|
|
@@ -5922,8 +5949,8 @@ static long btrfs_fallocate(struct inode *inode, int mode,
|
|
|
break;
|
|
|
}
|
|
|
}
|
|
|
- unlock_extent(&BTRFS_I(inode)->io_tree, alloc_start, locked_end,
|
|
|
- GFP_NOFS);
|
|
|
+ unlock_extent_cached(&BTRFS_I(inode)->io_tree, alloc_start, locked_end,
|
|
|
+ &cached_state, GFP_NOFS);
|
|
|
|
|
|
btrfs_free_reserved_data_space(BTRFS_I(inode)->root, inode,
|
|
|
alloc_end - alloc_start);
|