1 #include <linux/bitops.h>
2 #include <linux/slab.h>
5 #include <linux/pagemap.h>
6 #include <linux/page-flags.h>
7 #include <linux/spinlock.h>
8 #include <linux/blkdev.h>
9 #include <linux/swap.h>
10 #include <linux/writeback.h>
11 #include <linux/pagevec.h>
12 #include <linux/prefetch.h>
13 #include <linux/cleancache.h>
14 #include "extent_io.h"
15 #include "extent_map.h"
17 #include "btrfs_inode.h"
19 #include "check-integrity.h"
21 #include "rcu-string.h"
23 #include "transaction.h"
25 static struct kmem_cache
*extent_state_cache
;
26 static struct kmem_cache
*extent_buffer_cache
;
27 static struct bio_set
*btrfs_bioset
;
29 static inline bool extent_state_in_tree(const struct extent_state
*state
)
31 return !RB_EMPTY_NODE(&state
->rb_node
);
34 #ifdef CONFIG_BTRFS_DEBUG
35 static LIST_HEAD(buffers
);
36 static LIST_HEAD(states
);
38 static DEFINE_SPINLOCK(leak_lock
);
41 void btrfs_leak_debug_add(struct list_head
*new, struct list_head
*head
)
45 spin_lock_irqsave(&leak_lock
, flags
);
47 spin_unlock_irqrestore(&leak_lock
, flags
);
51 void btrfs_leak_debug_del(struct list_head
*entry
)
55 spin_lock_irqsave(&leak_lock
, flags
);
57 spin_unlock_irqrestore(&leak_lock
, flags
);
61 void btrfs_leak_debug_check(void)
63 struct extent_state
*state
;
64 struct extent_buffer
*eb
;
66 while (!list_empty(&states
)) {
67 state
= list_entry(states
.next
, struct extent_state
, leak_list
);
68 pr_err("BTRFS: state leak: start %llu end %llu state %u in tree %d refs %d\n",
69 state
->start
, state
->end
, state
->state
,
70 extent_state_in_tree(state
),
71 atomic_read(&state
->refs
));
72 list_del(&state
->leak_list
);
73 kmem_cache_free(extent_state_cache
, state
);
76 while (!list_empty(&buffers
)) {
77 eb
= list_entry(buffers
.next
, struct extent_buffer
, leak_list
);
78 pr_err("BTRFS: buffer leak start %llu len %lu refs %d\n",
79 eb
->start
, eb
->len
, atomic_read(&eb
->refs
));
80 list_del(&eb
->leak_list
);
81 kmem_cache_free(extent_buffer_cache
, eb
);
85 #define btrfs_debug_check_extent_io_range(tree, start, end) \
86 __btrfs_debug_check_extent_io_range(__func__, (tree), (start), (end))
87 static inline void __btrfs_debug_check_extent_io_range(const char *caller
,
88 struct extent_io_tree
*tree
, u64 start
, u64 end
)
96 inode
= tree
->mapping
->host
;
97 isize
= i_size_read(inode
);
98 if (end
>= PAGE_SIZE
&& (end
% 2) == 0 && end
!= isize
- 1) {
99 btrfs_debug_rl(BTRFS_I(inode
)->root
->fs_info
,
100 "%s: ino %llu isize %llu odd range [%llu,%llu]",
101 caller
, btrfs_ino(BTRFS_I(inode
)), isize
, start
, end
);
105 #define btrfs_leak_debug_add(new, head) do {} while (0)
106 #define btrfs_leak_debug_del(entry) do {} while (0)
107 #define btrfs_leak_debug_check() do {} while (0)
108 #define btrfs_debug_check_extent_io_range(c, s, e) do {} while (0)
111 #define BUFFER_LRU_MAX 64
116 struct rb_node rb_node
;
119 struct extent_page_data
{
121 struct extent_io_tree
*tree
;
122 get_extent_t
*get_extent
;
123 unsigned long bio_flags
;
125 /* tells writepage not to lock the state bits for this range
126 * it still does the unlocking
128 unsigned int extent_locked
:1;
130 /* tells the submit_bio code to use REQ_SYNC */
131 unsigned int sync_io
:1;
134 static void add_extent_changeset(struct extent_state
*state
, unsigned bits
,
135 struct extent_changeset
*changeset
,
142 if (set
&& (state
->state
& bits
) == bits
)
144 if (!set
&& (state
->state
& bits
) == 0)
146 changeset
->bytes_changed
+= state
->end
- state
->start
+ 1;
147 ret
= ulist_add(&changeset
->range_changed
, state
->start
, state
->end
,
153 static noinline
void flush_write_bio(void *data
);
154 static inline struct btrfs_fs_info
*
155 tree_fs_info(struct extent_io_tree
*tree
)
159 return btrfs_sb(tree
->mapping
->host
->i_sb
);
162 int __init
extent_io_init(void)
164 extent_state_cache
= kmem_cache_create("btrfs_extent_state",
165 sizeof(struct extent_state
), 0,
166 SLAB_MEM_SPREAD
, NULL
);
167 if (!extent_state_cache
)
170 extent_buffer_cache
= kmem_cache_create("btrfs_extent_buffer",
171 sizeof(struct extent_buffer
), 0,
172 SLAB_MEM_SPREAD
, NULL
);
173 if (!extent_buffer_cache
)
174 goto free_state_cache
;
176 btrfs_bioset
= bioset_create(BIO_POOL_SIZE
,
177 offsetof(struct btrfs_io_bio
, bio
));
179 goto free_buffer_cache
;
181 if (bioset_integrity_create(btrfs_bioset
, BIO_POOL_SIZE
))
187 bioset_free(btrfs_bioset
);
191 kmem_cache_destroy(extent_buffer_cache
);
192 extent_buffer_cache
= NULL
;
195 kmem_cache_destroy(extent_state_cache
);
196 extent_state_cache
= NULL
;
200 void extent_io_exit(void)
202 btrfs_leak_debug_check();
205 * Make sure all delayed rcu free are flushed before we
209 kmem_cache_destroy(extent_state_cache
);
210 kmem_cache_destroy(extent_buffer_cache
);
212 bioset_free(btrfs_bioset
);
215 void extent_io_tree_init(struct extent_io_tree
*tree
,
216 struct address_space
*mapping
)
218 tree
->state
= RB_ROOT
;
220 tree
->dirty_bytes
= 0;
221 spin_lock_init(&tree
->lock
);
222 tree
->mapping
= mapping
;
225 static struct extent_state
*alloc_extent_state(gfp_t mask
)
227 struct extent_state
*state
;
230 * The given mask might be not appropriate for the slab allocator,
231 * drop the unsupported bits
233 mask
&= ~(__GFP_DMA32
|__GFP_HIGHMEM
);
234 state
= kmem_cache_alloc(extent_state_cache
, mask
);
238 state
->failrec
= NULL
;
239 RB_CLEAR_NODE(&state
->rb_node
);
240 btrfs_leak_debug_add(&state
->leak_list
, &states
);
241 atomic_set(&state
->refs
, 1);
242 init_waitqueue_head(&state
->wq
);
243 trace_alloc_extent_state(state
, mask
, _RET_IP_
);
247 void free_extent_state(struct extent_state
*state
)
251 if (atomic_dec_and_test(&state
->refs
)) {
252 WARN_ON(extent_state_in_tree(state
));
253 btrfs_leak_debug_del(&state
->leak_list
);
254 trace_free_extent_state(state
, _RET_IP_
);
255 kmem_cache_free(extent_state_cache
, state
);
259 static struct rb_node
*tree_insert(struct rb_root
*root
,
260 struct rb_node
*search_start
,
262 struct rb_node
*node
,
263 struct rb_node
***p_in
,
264 struct rb_node
**parent_in
)
267 struct rb_node
*parent
= NULL
;
268 struct tree_entry
*entry
;
270 if (p_in
&& parent_in
) {
276 p
= search_start
? &search_start
: &root
->rb_node
;
279 entry
= rb_entry(parent
, struct tree_entry
, rb_node
);
281 if (offset
< entry
->start
)
283 else if (offset
> entry
->end
)
290 rb_link_node(node
, parent
, p
);
291 rb_insert_color(node
, root
);
295 static struct rb_node
*__etree_search(struct extent_io_tree
*tree
, u64 offset
,
296 struct rb_node
**prev_ret
,
297 struct rb_node
**next_ret
,
298 struct rb_node
***p_ret
,
299 struct rb_node
**parent_ret
)
301 struct rb_root
*root
= &tree
->state
;
302 struct rb_node
**n
= &root
->rb_node
;
303 struct rb_node
*prev
= NULL
;
304 struct rb_node
*orig_prev
= NULL
;
305 struct tree_entry
*entry
;
306 struct tree_entry
*prev_entry
= NULL
;
310 entry
= rb_entry(prev
, struct tree_entry
, rb_node
);
313 if (offset
< entry
->start
)
315 else if (offset
> entry
->end
)
328 while (prev
&& offset
> prev_entry
->end
) {
329 prev
= rb_next(prev
);
330 prev_entry
= rb_entry(prev
, struct tree_entry
, rb_node
);
337 prev_entry
= rb_entry(prev
, struct tree_entry
, rb_node
);
338 while (prev
&& offset
< prev_entry
->start
) {
339 prev
= rb_prev(prev
);
340 prev_entry
= rb_entry(prev
, struct tree_entry
, rb_node
);
347 static inline struct rb_node
*
348 tree_search_for_insert(struct extent_io_tree
*tree
,
350 struct rb_node
***p_ret
,
351 struct rb_node
**parent_ret
)
353 struct rb_node
*prev
= NULL
;
356 ret
= __etree_search(tree
, offset
, &prev
, NULL
, p_ret
, parent_ret
);
362 static inline struct rb_node
*tree_search(struct extent_io_tree
*tree
,
365 return tree_search_for_insert(tree
, offset
, NULL
, NULL
);
368 static void merge_cb(struct extent_io_tree
*tree
, struct extent_state
*new,
369 struct extent_state
*other
)
371 if (tree
->ops
&& tree
->ops
->merge_extent_hook
)
372 tree
->ops
->merge_extent_hook(tree
->mapping
->host
, new,
377 * utility function to look for merge candidates inside a given range.
378 * Any extents with matching state are merged together into a single
379 * extent in the tree. Extents with EXTENT_IO in their state field
380 * are not merged because the end_io handlers need to be able to do
381 * operations on them without sleeping (or doing allocations/splits).
383 * This should be called with the tree lock held.
385 static void merge_state(struct extent_io_tree
*tree
,
386 struct extent_state
*state
)
388 struct extent_state
*other
;
389 struct rb_node
*other_node
;
391 if (state
->state
& (EXTENT_IOBITS
| EXTENT_BOUNDARY
))
394 other_node
= rb_prev(&state
->rb_node
);
396 other
= rb_entry(other_node
, struct extent_state
, rb_node
);
397 if (other
->end
== state
->start
- 1 &&
398 other
->state
== state
->state
) {
399 merge_cb(tree
, state
, other
);
400 state
->start
= other
->start
;
401 rb_erase(&other
->rb_node
, &tree
->state
);
402 RB_CLEAR_NODE(&other
->rb_node
);
403 free_extent_state(other
);
406 other_node
= rb_next(&state
->rb_node
);
408 other
= rb_entry(other_node
, struct extent_state
, rb_node
);
409 if (other
->start
== state
->end
+ 1 &&
410 other
->state
== state
->state
) {
411 merge_cb(tree
, state
, other
);
412 state
->end
= other
->end
;
413 rb_erase(&other
->rb_node
, &tree
->state
);
414 RB_CLEAR_NODE(&other
->rb_node
);
415 free_extent_state(other
);
420 static void set_state_cb(struct extent_io_tree
*tree
,
421 struct extent_state
*state
, unsigned *bits
)
423 if (tree
->ops
&& tree
->ops
->set_bit_hook
)
424 tree
->ops
->set_bit_hook(tree
->mapping
->host
, state
, bits
);
427 static void clear_state_cb(struct extent_io_tree
*tree
,
428 struct extent_state
*state
, unsigned *bits
)
430 if (tree
->ops
&& tree
->ops
->clear_bit_hook
)
431 tree
->ops
->clear_bit_hook(BTRFS_I(tree
->mapping
->host
),
435 static void set_state_bits(struct extent_io_tree
*tree
,
436 struct extent_state
*state
, unsigned *bits
,
437 struct extent_changeset
*changeset
);
440 * insert an extent_state struct into the tree. 'bits' are set on the
441 * struct before it is inserted.
443 * This may return -EEXIST if the extent is already there, in which case the
444 * state struct is freed.
446 * The tree lock is not taken internally. This is a utility function and
447 * probably isn't what you want to call (see set/clear_extent_bit).
449 static int insert_state(struct extent_io_tree
*tree
,
450 struct extent_state
*state
, u64 start
, u64 end
,
452 struct rb_node
**parent
,
453 unsigned *bits
, struct extent_changeset
*changeset
)
455 struct rb_node
*node
;
458 WARN(1, KERN_ERR
"BTRFS: end < start %llu %llu\n",
460 state
->start
= start
;
463 set_state_bits(tree
, state
, bits
, changeset
);
465 node
= tree_insert(&tree
->state
, NULL
, end
, &state
->rb_node
, p
, parent
);
467 struct extent_state
*found
;
468 found
= rb_entry(node
, struct extent_state
, rb_node
);
469 pr_err("BTRFS: found node %llu %llu on insert of %llu %llu\n",
470 found
->start
, found
->end
, start
, end
);
473 merge_state(tree
, state
);
477 static void split_cb(struct extent_io_tree
*tree
, struct extent_state
*orig
,
480 if (tree
->ops
&& tree
->ops
->split_extent_hook
)
481 tree
->ops
->split_extent_hook(tree
->mapping
->host
, orig
, split
);
485 * split a given extent state struct in two, inserting the preallocated
486 * struct 'prealloc' as the newly created second half. 'split' indicates an
487 * offset inside 'orig' where it should be split.
490 * the tree has 'orig' at [orig->start, orig->end]. After calling, there
491 * are two extent state structs in the tree:
492 * prealloc: [orig->start, split - 1]
493 * orig: [ split, orig->end ]
495 * The tree locks are not taken by this function. They need to be held
498 static int split_state(struct extent_io_tree
*tree
, struct extent_state
*orig
,
499 struct extent_state
*prealloc
, u64 split
)
501 struct rb_node
*node
;
503 split_cb(tree
, orig
, split
);
505 prealloc
->start
= orig
->start
;
506 prealloc
->end
= split
- 1;
507 prealloc
->state
= orig
->state
;
510 node
= tree_insert(&tree
->state
, &orig
->rb_node
, prealloc
->end
,
511 &prealloc
->rb_node
, NULL
, NULL
);
513 free_extent_state(prealloc
);
519 static struct extent_state
*next_state(struct extent_state
*state
)
521 struct rb_node
*next
= rb_next(&state
->rb_node
);
523 return rb_entry(next
, struct extent_state
, rb_node
);
529 * utility function to clear some bits in an extent state struct.
530 * it will optionally wake up any one waiting on this state (wake == 1).
532 * If no bits are set on the state struct after clearing things, the
533 * struct is freed and removed from the tree
535 static struct extent_state
*clear_state_bit(struct extent_io_tree
*tree
,
536 struct extent_state
*state
,
537 unsigned *bits
, int wake
,
538 struct extent_changeset
*changeset
)
540 struct extent_state
*next
;
541 unsigned bits_to_clear
= *bits
& ~EXTENT_CTLBITS
;
543 if ((bits_to_clear
& EXTENT_DIRTY
) && (state
->state
& EXTENT_DIRTY
)) {
544 u64 range
= state
->end
- state
->start
+ 1;
545 WARN_ON(range
> tree
->dirty_bytes
);
546 tree
->dirty_bytes
-= range
;
548 clear_state_cb(tree
, state
, bits
);
549 add_extent_changeset(state
, bits_to_clear
, changeset
, 0);
550 state
->state
&= ~bits_to_clear
;
553 if (state
->state
== 0) {
554 next
= next_state(state
);
555 if (extent_state_in_tree(state
)) {
556 rb_erase(&state
->rb_node
, &tree
->state
);
557 RB_CLEAR_NODE(&state
->rb_node
);
558 free_extent_state(state
);
563 merge_state(tree
, state
);
564 next
= next_state(state
);
569 static struct extent_state
*
570 alloc_extent_state_atomic(struct extent_state
*prealloc
)
573 prealloc
= alloc_extent_state(GFP_ATOMIC
);
578 static void extent_io_tree_panic(struct extent_io_tree
*tree
, int err
)
580 btrfs_panic(tree_fs_info(tree
), err
,
581 "Locking error: Extent tree was modified by another thread while locked.");
585 * clear some bits on a range in the tree. This may require splitting
586 * or inserting elements in the tree, so the gfp mask is used to
587 * indicate which allocations or sleeping are allowed.
589 * pass 'wake' == 1 to kick any sleepers, and 'delete' == 1 to remove
590 * the given range from the tree regardless of state (ie for truncate).
592 * the range [start, end] is inclusive.
594 * This takes the tree lock, and returns 0 on success and < 0 on error.
596 static int __clear_extent_bit(struct extent_io_tree
*tree
, u64 start
, u64 end
,
597 unsigned bits
, int wake
, int delete,
598 struct extent_state
**cached_state
,
599 gfp_t mask
, struct extent_changeset
*changeset
)
601 struct extent_state
*state
;
602 struct extent_state
*cached
;
603 struct extent_state
*prealloc
= NULL
;
604 struct rb_node
*node
;
609 btrfs_debug_check_extent_io_range(tree
, start
, end
);
611 if (bits
& EXTENT_DELALLOC
)
612 bits
|= EXTENT_NORESERVE
;
615 bits
|= ~EXTENT_CTLBITS
;
616 bits
|= EXTENT_FIRST_DELALLOC
;
618 if (bits
& (EXTENT_IOBITS
| EXTENT_BOUNDARY
))
621 if (!prealloc
&& gfpflags_allow_blocking(mask
)) {
623 * Don't care for allocation failure here because we might end
624 * up not needing the pre-allocated extent state at all, which
625 * is the case if we only have in the tree extent states that
626 * cover our input range and don't cover too any other range.
627 * If we end up needing a new extent state we allocate it later.
629 prealloc
= alloc_extent_state(mask
);
632 spin_lock(&tree
->lock
);
634 cached
= *cached_state
;
637 *cached_state
= NULL
;
641 if (cached
&& extent_state_in_tree(cached
) &&
642 cached
->start
<= start
&& cached
->end
> start
) {
644 atomic_dec(&cached
->refs
);
649 free_extent_state(cached
);
652 * this search will find the extents that end after
655 node
= tree_search(tree
, start
);
658 state
= rb_entry(node
, struct extent_state
, rb_node
);
660 if (state
->start
> end
)
662 WARN_ON(state
->end
< start
);
663 last_end
= state
->end
;
665 /* the state doesn't have the wanted bits, go ahead */
666 if (!(state
->state
& bits
)) {
667 state
= next_state(state
);
672 * | ---- desired range ---- |
674 * | ------------- state -------------- |
676 * We need to split the extent we found, and may flip
677 * bits on second half.
679 * If the extent we found extends past our range, we
680 * just split and search again. It'll get split again
681 * the next time though.
683 * If the extent we found is inside our range, we clear
684 * the desired bit on it.
687 if (state
->start
< start
) {
688 prealloc
= alloc_extent_state_atomic(prealloc
);
690 err
= split_state(tree
, state
, prealloc
, start
);
692 extent_io_tree_panic(tree
, err
);
697 if (state
->end
<= end
) {
698 state
= clear_state_bit(tree
, state
, &bits
, wake
,
705 * | ---- desired range ---- |
707 * We need to split the extent, and clear the bit
710 if (state
->start
<= end
&& state
->end
> end
) {
711 prealloc
= alloc_extent_state_atomic(prealloc
);
713 err
= split_state(tree
, state
, prealloc
, end
+ 1);
715 extent_io_tree_panic(tree
, err
);
720 clear_state_bit(tree
, prealloc
, &bits
, wake
, changeset
);
726 state
= clear_state_bit(tree
, state
, &bits
, wake
, changeset
);
728 if (last_end
== (u64
)-1)
730 start
= last_end
+ 1;
731 if (start
<= end
&& state
&& !need_resched())
737 spin_unlock(&tree
->lock
);
738 if (gfpflags_allow_blocking(mask
))
743 spin_unlock(&tree
->lock
);
745 free_extent_state(prealloc
);
751 static void wait_on_state(struct extent_io_tree
*tree
,
752 struct extent_state
*state
)
753 __releases(tree
->lock
)
754 __acquires(tree
->lock
)
757 prepare_to_wait(&state
->wq
, &wait
, TASK_UNINTERRUPTIBLE
);
758 spin_unlock(&tree
->lock
);
760 spin_lock(&tree
->lock
);
761 finish_wait(&state
->wq
, &wait
);
765 * waits for one or more bits to clear on a range in the state tree.
766 * The range [start, end] is inclusive.
767 * The tree lock is taken by this function
769 static void wait_extent_bit(struct extent_io_tree
*tree
, u64 start
, u64 end
,
772 struct extent_state
*state
;
773 struct rb_node
*node
;
775 btrfs_debug_check_extent_io_range(tree
, start
, end
);
777 spin_lock(&tree
->lock
);
781 * this search will find all the extents that end after
784 node
= tree_search(tree
, start
);
789 state
= rb_entry(node
, struct extent_state
, rb_node
);
791 if (state
->start
> end
)
794 if (state
->state
& bits
) {
795 start
= state
->start
;
796 atomic_inc(&state
->refs
);
797 wait_on_state(tree
, state
);
798 free_extent_state(state
);
801 start
= state
->end
+ 1;
806 if (!cond_resched_lock(&tree
->lock
)) {
807 node
= rb_next(node
);
812 spin_unlock(&tree
->lock
);
815 static void set_state_bits(struct extent_io_tree
*tree
,
816 struct extent_state
*state
,
817 unsigned *bits
, struct extent_changeset
*changeset
)
819 unsigned bits_to_set
= *bits
& ~EXTENT_CTLBITS
;
821 set_state_cb(tree
, state
, bits
);
822 if ((bits_to_set
& EXTENT_DIRTY
) && !(state
->state
& EXTENT_DIRTY
)) {
823 u64 range
= state
->end
- state
->start
+ 1;
824 tree
->dirty_bytes
+= range
;
826 add_extent_changeset(state
, bits_to_set
, changeset
, 1);
827 state
->state
|= bits_to_set
;
830 static void cache_state_if_flags(struct extent_state
*state
,
831 struct extent_state
**cached_ptr
,
834 if (cached_ptr
&& !(*cached_ptr
)) {
835 if (!flags
|| (state
->state
& flags
)) {
837 atomic_inc(&state
->refs
);
842 static void cache_state(struct extent_state
*state
,
843 struct extent_state
**cached_ptr
)
845 return cache_state_if_flags(state
, cached_ptr
,
846 EXTENT_IOBITS
| EXTENT_BOUNDARY
);
850 * set some bits on a range in the tree. This may require allocations or
851 * sleeping, so the gfp mask is used to indicate what is allowed.
853 * If any of the exclusive bits are set, this will fail with -EEXIST if some
854 * part of the range already has the desired bits set. The start of the
855 * existing range is returned in failed_start in this case.
857 * [start, end] is inclusive This takes the tree lock.
860 static int __must_check
861 __set_extent_bit(struct extent_io_tree
*tree
, u64 start
, u64 end
,
862 unsigned bits
, unsigned exclusive_bits
,
863 u64
*failed_start
, struct extent_state
**cached_state
,
864 gfp_t mask
, struct extent_changeset
*changeset
)
866 struct extent_state
*state
;
867 struct extent_state
*prealloc
= NULL
;
868 struct rb_node
*node
;
870 struct rb_node
*parent
;
875 btrfs_debug_check_extent_io_range(tree
, start
, end
);
877 bits
|= EXTENT_FIRST_DELALLOC
;
879 if (!prealloc
&& gfpflags_allow_blocking(mask
)) {
881 * Don't care for allocation failure here because we might end
882 * up not needing the pre-allocated extent state at all, which
883 * is the case if we only have in the tree extent states that
884 * cover our input range and don't cover too any other range.
885 * If we end up needing a new extent state we allocate it later.
887 prealloc
= alloc_extent_state(mask
);
890 spin_lock(&tree
->lock
);
891 if (cached_state
&& *cached_state
) {
892 state
= *cached_state
;
893 if (state
->start
<= start
&& state
->end
> start
&&
894 extent_state_in_tree(state
)) {
895 node
= &state
->rb_node
;
900 * this search will find all the extents that end after
903 node
= tree_search_for_insert(tree
, start
, &p
, &parent
);
905 prealloc
= alloc_extent_state_atomic(prealloc
);
907 err
= insert_state(tree
, prealloc
, start
, end
,
908 &p
, &parent
, &bits
, changeset
);
910 extent_io_tree_panic(tree
, err
);
912 cache_state(prealloc
, cached_state
);
916 state
= rb_entry(node
, struct extent_state
, rb_node
);
918 last_start
= state
->start
;
919 last_end
= state
->end
;
922 * | ---- desired range ---- |
925 * Just lock what we found and keep going
927 if (state
->start
== start
&& state
->end
<= end
) {
928 if (state
->state
& exclusive_bits
) {
929 *failed_start
= state
->start
;
934 set_state_bits(tree
, state
, &bits
, changeset
);
935 cache_state(state
, cached_state
);
936 merge_state(tree
, state
);
937 if (last_end
== (u64
)-1)
939 start
= last_end
+ 1;
940 state
= next_state(state
);
941 if (start
< end
&& state
&& state
->start
== start
&&
948 * | ---- desired range ---- |
951 * | ------------- state -------------- |
953 * We need to split the extent we found, and may flip bits on
956 * If the extent we found extends past our
957 * range, we just split and search again. It'll get split
958 * again the next time though.
960 * If the extent we found is inside our range, we set the
963 if (state
->start
< start
) {
964 if (state
->state
& exclusive_bits
) {
965 *failed_start
= start
;
970 prealloc
= alloc_extent_state_atomic(prealloc
);
972 err
= split_state(tree
, state
, prealloc
, start
);
974 extent_io_tree_panic(tree
, err
);
979 if (state
->end
<= end
) {
980 set_state_bits(tree
, state
, &bits
, changeset
);
981 cache_state(state
, cached_state
);
982 merge_state(tree
, state
);
983 if (last_end
== (u64
)-1)
985 start
= last_end
+ 1;
986 state
= next_state(state
);
987 if (start
< end
&& state
&& state
->start
== start
&&
994 * | ---- desired range ---- |
995 * | state | or | state |
997 * There's a hole, we need to insert something in it and
998 * ignore the extent we found.
1000 if (state
->start
> start
) {
1002 if (end
< last_start
)
1005 this_end
= last_start
- 1;
1007 prealloc
= alloc_extent_state_atomic(prealloc
);
1011 * Avoid to free 'prealloc' if it can be merged with
1014 err
= insert_state(tree
, prealloc
, start
, this_end
,
1015 NULL
, NULL
, &bits
, changeset
);
1017 extent_io_tree_panic(tree
, err
);
1019 cache_state(prealloc
, cached_state
);
1021 start
= this_end
+ 1;
1025 * | ---- desired range ---- |
1027 * We need to split the extent, and set the bit
1030 if (state
->start
<= end
&& state
->end
> end
) {
1031 if (state
->state
& exclusive_bits
) {
1032 *failed_start
= start
;
1037 prealloc
= alloc_extent_state_atomic(prealloc
);
1039 err
= split_state(tree
, state
, prealloc
, end
+ 1);
1041 extent_io_tree_panic(tree
, err
);
1043 set_state_bits(tree
, prealloc
, &bits
, changeset
);
1044 cache_state(prealloc
, cached_state
);
1045 merge_state(tree
, prealloc
);
1053 spin_unlock(&tree
->lock
);
1054 if (gfpflags_allow_blocking(mask
))
1059 spin_unlock(&tree
->lock
);
1061 free_extent_state(prealloc
);
1067 int set_extent_bit(struct extent_io_tree
*tree
, u64 start
, u64 end
,
1068 unsigned bits
, u64
* failed_start
,
1069 struct extent_state
**cached_state
, gfp_t mask
)
1071 return __set_extent_bit(tree
, start
, end
, bits
, 0, failed_start
,
1072 cached_state
, mask
, NULL
);
1077 * convert_extent_bit - convert all bits in a given range from one bit to
1079 * @tree: the io tree to search
1080 * @start: the start offset in bytes
1081 * @end: the end offset in bytes (inclusive)
1082 * @bits: the bits to set in this range
1083 * @clear_bits: the bits to clear in this range
1084 * @cached_state: state that we're going to cache
1086 * This will go through and set bits for the given range. If any states exist
1087 * already in this range they are set with the given bit and cleared of the
1088 * clear_bits. This is only meant to be used by things that are mergeable, ie
1089 * converting from say DELALLOC to DIRTY. This is not meant to be used with
1090 * boundary bits like LOCK.
1092 * All allocations are done with GFP_NOFS.
1094 int convert_extent_bit(struct extent_io_tree
*tree
, u64 start
, u64 end
,
1095 unsigned bits
, unsigned clear_bits
,
1096 struct extent_state
**cached_state
)
1098 struct extent_state
*state
;
1099 struct extent_state
*prealloc
= NULL
;
1100 struct rb_node
*node
;
1102 struct rb_node
*parent
;
1106 bool first_iteration
= true;
1108 btrfs_debug_check_extent_io_range(tree
, start
, end
);
1113 * Best effort, don't worry if extent state allocation fails
1114 * here for the first iteration. We might have a cached state
1115 * that matches exactly the target range, in which case no
1116 * extent state allocations are needed. We'll only know this
1117 * after locking the tree.
1119 prealloc
= alloc_extent_state(GFP_NOFS
);
1120 if (!prealloc
&& !first_iteration
)
1124 spin_lock(&tree
->lock
);
1125 if (cached_state
&& *cached_state
) {
1126 state
= *cached_state
;
1127 if (state
->start
<= start
&& state
->end
> start
&&
1128 extent_state_in_tree(state
)) {
1129 node
= &state
->rb_node
;
1135 * this search will find all the extents that end after
1138 node
= tree_search_for_insert(tree
, start
, &p
, &parent
);
1140 prealloc
= alloc_extent_state_atomic(prealloc
);
1145 err
= insert_state(tree
, prealloc
, start
, end
,
1146 &p
, &parent
, &bits
, NULL
);
1148 extent_io_tree_panic(tree
, err
);
1149 cache_state(prealloc
, cached_state
);
1153 state
= rb_entry(node
, struct extent_state
, rb_node
);
1155 last_start
= state
->start
;
1156 last_end
= state
->end
;
1159 * | ---- desired range ---- |
1162 * Just lock what we found and keep going
1164 if (state
->start
== start
&& state
->end
<= end
) {
1165 set_state_bits(tree
, state
, &bits
, NULL
);
1166 cache_state(state
, cached_state
);
1167 state
= clear_state_bit(tree
, state
, &clear_bits
, 0, NULL
);
1168 if (last_end
== (u64
)-1)
1170 start
= last_end
+ 1;
1171 if (start
< end
&& state
&& state
->start
== start
&&
1178 * | ---- desired range ---- |
1181 * | ------------- state -------------- |
1183 * We need to split the extent we found, and may flip bits on
1186 * If the extent we found extends past our
1187 * range, we just split and search again. It'll get split
1188 * again the next time though.
1190 * If the extent we found is inside our range, we set the
1191 * desired bit on it.
1193 if (state
->start
< start
) {
1194 prealloc
= alloc_extent_state_atomic(prealloc
);
1199 err
= split_state(tree
, state
, prealloc
, start
);
1201 extent_io_tree_panic(tree
, err
);
1205 if (state
->end
<= end
) {
1206 set_state_bits(tree
, state
, &bits
, NULL
);
1207 cache_state(state
, cached_state
);
1208 state
= clear_state_bit(tree
, state
, &clear_bits
, 0,
1210 if (last_end
== (u64
)-1)
1212 start
= last_end
+ 1;
1213 if (start
< end
&& state
&& state
->start
== start
&&
1220 * | ---- desired range ---- |
1221 * | state | or | state |
1223 * There's a hole, we need to insert something in it and
1224 * ignore the extent we found.
1226 if (state
->start
> start
) {
1228 if (end
< last_start
)
1231 this_end
= last_start
- 1;
1233 prealloc
= alloc_extent_state_atomic(prealloc
);
1240 * Avoid to free 'prealloc' if it can be merged with
1243 err
= insert_state(tree
, prealloc
, start
, this_end
,
1244 NULL
, NULL
, &bits
, NULL
);
1246 extent_io_tree_panic(tree
, err
);
1247 cache_state(prealloc
, cached_state
);
1249 start
= this_end
+ 1;
1253 * | ---- desired range ---- |
1255 * We need to split the extent, and set the bit
1258 if (state
->start
<= end
&& state
->end
> end
) {
1259 prealloc
= alloc_extent_state_atomic(prealloc
);
1265 err
= split_state(tree
, state
, prealloc
, end
+ 1);
1267 extent_io_tree_panic(tree
, err
);
1269 set_state_bits(tree
, prealloc
, &bits
, NULL
);
1270 cache_state(prealloc
, cached_state
);
1271 clear_state_bit(tree
, prealloc
, &clear_bits
, 0, NULL
);
1279 spin_unlock(&tree
->lock
);
1281 first_iteration
= false;
1285 spin_unlock(&tree
->lock
);
1287 free_extent_state(prealloc
);
1292 /* wrappers around set/clear extent bit */
1293 int set_record_extent_bits(struct extent_io_tree
*tree
, u64 start
, u64 end
,
1294 unsigned bits
, struct extent_changeset
*changeset
)
1297 * We don't support EXTENT_LOCKED yet, as current changeset will
1298 * record any bits changed, so for EXTENT_LOCKED case, it will
1299 * either fail with -EEXIST or changeset will record the whole
1302 BUG_ON(bits
& EXTENT_LOCKED
);
1304 return __set_extent_bit(tree
, start
, end
, bits
, 0, NULL
, NULL
, GFP_NOFS
,
1308 int clear_extent_bit(struct extent_io_tree
*tree
, u64 start
, u64 end
,
1309 unsigned bits
, int wake
, int delete,
1310 struct extent_state
**cached
, gfp_t mask
)
1312 return __clear_extent_bit(tree
, start
, end
, bits
, wake
, delete,
1313 cached
, mask
, NULL
);
1316 int clear_record_extent_bits(struct extent_io_tree
*tree
, u64 start
, u64 end
,
1317 unsigned bits
, struct extent_changeset
*changeset
)
1320 * Don't support EXTENT_LOCKED case, same reason as
1321 * set_record_extent_bits().
1323 BUG_ON(bits
& EXTENT_LOCKED
);
1325 return __clear_extent_bit(tree
, start
, end
, bits
, 0, 0, NULL
, GFP_NOFS
,
1330 * either insert or lock state struct between start and end use mask to tell
1331 * us if waiting is desired.
1333 int lock_extent_bits(struct extent_io_tree
*tree
, u64 start
, u64 end
,
1334 struct extent_state
**cached_state
)
1340 err
= __set_extent_bit(tree
, start
, end
, EXTENT_LOCKED
,
1341 EXTENT_LOCKED
, &failed_start
,
1342 cached_state
, GFP_NOFS
, NULL
);
1343 if (err
== -EEXIST
) {
1344 wait_extent_bit(tree
, failed_start
, end
, EXTENT_LOCKED
);
1345 start
= failed_start
;
1348 WARN_ON(start
> end
);
1353 int try_lock_extent(struct extent_io_tree
*tree
, u64 start
, u64 end
)
1358 err
= __set_extent_bit(tree
, start
, end
, EXTENT_LOCKED
, EXTENT_LOCKED
,
1359 &failed_start
, NULL
, GFP_NOFS
, NULL
);
1360 if (err
== -EEXIST
) {
1361 if (failed_start
> start
)
1362 clear_extent_bit(tree
, start
, failed_start
- 1,
1363 EXTENT_LOCKED
, 1, 0, NULL
, GFP_NOFS
);
1369 void extent_range_clear_dirty_for_io(struct inode
*inode
, u64 start
, u64 end
)
1371 unsigned long index
= start
>> PAGE_SHIFT
;
1372 unsigned long end_index
= end
>> PAGE_SHIFT
;
1375 while (index
<= end_index
) {
1376 page
= find_get_page(inode
->i_mapping
, index
);
1377 BUG_ON(!page
); /* Pages should be in the extent_io_tree */
1378 clear_page_dirty_for_io(page
);
1384 void extent_range_redirty_for_io(struct inode
*inode
, u64 start
, u64 end
)
1386 unsigned long index
= start
>> PAGE_SHIFT
;
1387 unsigned long end_index
= end
>> PAGE_SHIFT
;
1390 while (index
<= end_index
) {
1391 page
= find_get_page(inode
->i_mapping
, index
);
1392 BUG_ON(!page
); /* Pages should be in the extent_io_tree */
1393 __set_page_dirty_nobuffers(page
);
1394 account_page_redirty(page
);
1401 * helper function to set both pages and extents in the tree writeback
1403 static void set_range_writeback(struct extent_io_tree
*tree
, u64 start
, u64 end
)
1405 unsigned long index
= start
>> PAGE_SHIFT
;
1406 unsigned long end_index
= end
>> PAGE_SHIFT
;
1409 while (index
<= end_index
) {
1410 page
= find_get_page(tree
->mapping
, index
);
1411 BUG_ON(!page
); /* Pages should be in the extent_io_tree */
1412 set_page_writeback(page
);
1418 /* find the first state struct with 'bits' set after 'start', and
1419 * return it. tree->lock must be held. NULL will returned if
1420 * nothing was found after 'start'
1422 static struct extent_state
*
1423 find_first_extent_bit_state(struct extent_io_tree
*tree
,
1424 u64 start
, unsigned bits
)
1426 struct rb_node
*node
;
1427 struct extent_state
*state
;
1430 * this search will find all the extents that end after
1433 node
= tree_search(tree
, start
);
1438 state
= rb_entry(node
, struct extent_state
, rb_node
);
1439 if (state
->end
>= start
&& (state
->state
& bits
))
1442 node
= rb_next(node
);
1451 * find the first offset in the io tree with 'bits' set. zero is
1452 * returned if we find something, and *start_ret and *end_ret are
1453 * set to reflect the state struct that was found.
1455 * If nothing was found, 1 is returned. If found something, return 0.
1457 int find_first_extent_bit(struct extent_io_tree
*tree
, u64 start
,
1458 u64
*start_ret
, u64
*end_ret
, unsigned bits
,
1459 struct extent_state
**cached_state
)
1461 struct extent_state
*state
;
1465 spin_lock(&tree
->lock
);
1466 if (cached_state
&& *cached_state
) {
1467 state
= *cached_state
;
1468 if (state
->end
== start
- 1 && extent_state_in_tree(state
)) {
1469 n
= rb_next(&state
->rb_node
);
1471 state
= rb_entry(n
, struct extent_state
,
1473 if (state
->state
& bits
)
1477 free_extent_state(*cached_state
);
1478 *cached_state
= NULL
;
1481 free_extent_state(*cached_state
);
1482 *cached_state
= NULL
;
1485 state
= find_first_extent_bit_state(tree
, start
, bits
);
1488 cache_state_if_flags(state
, cached_state
, 0);
1489 *start_ret
= state
->start
;
1490 *end_ret
= state
->end
;
1494 spin_unlock(&tree
->lock
);
1499 * find a contiguous range of bytes in the file marked as delalloc, not
1500 * more than 'max_bytes'. start and end are used to return the range,
1502 * 1 is returned if we find something, 0 if nothing was in the tree
1504 static noinline u64
find_delalloc_range(struct extent_io_tree
*tree
,
1505 u64
*start
, u64
*end
, u64 max_bytes
,
1506 struct extent_state
**cached_state
)
1508 struct rb_node
*node
;
1509 struct extent_state
*state
;
1510 u64 cur_start
= *start
;
1512 u64 total_bytes
= 0;
1514 spin_lock(&tree
->lock
);
1517 * this search will find all the extents that end after
1520 node
= tree_search(tree
, cur_start
);
1528 state
= rb_entry(node
, struct extent_state
, rb_node
);
1529 if (found
&& (state
->start
!= cur_start
||
1530 (state
->state
& EXTENT_BOUNDARY
))) {
1533 if (!(state
->state
& EXTENT_DELALLOC
)) {
1539 *start
= state
->start
;
1540 *cached_state
= state
;
1541 atomic_inc(&state
->refs
);
1545 cur_start
= state
->end
+ 1;
1546 node
= rb_next(node
);
1547 total_bytes
+= state
->end
- state
->start
+ 1;
1548 if (total_bytes
>= max_bytes
)
1554 spin_unlock(&tree
->lock
);
1558 static int __process_pages_contig(struct address_space
*mapping
,
1559 struct page
*locked_page
,
1560 pgoff_t start_index
, pgoff_t end_index
,
1561 unsigned long page_ops
, pgoff_t
*index_ret
);
1563 static noinline
void __unlock_for_delalloc(struct inode
*inode
,
1564 struct page
*locked_page
,
1567 unsigned long index
= start
>> PAGE_SHIFT
;
1568 unsigned long end_index
= end
>> PAGE_SHIFT
;
1570 ASSERT(locked_page
);
1571 if (index
== locked_page
->index
&& end_index
== index
)
1574 __process_pages_contig(inode
->i_mapping
, locked_page
, index
, end_index
,
1578 static noinline
int lock_delalloc_pages(struct inode
*inode
,
1579 struct page
*locked_page
,
1583 unsigned long index
= delalloc_start
>> PAGE_SHIFT
;
1584 unsigned long index_ret
= index
;
1585 unsigned long end_index
= delalloc_end
>> PAGE_SHIFT
;
1588 ASSERT(locked_page
);
1589 if (index
== locked_page
->index
&& index
== end_index
)
1592 ret
= __process_pages_contig(inode
->i_mapping
, locked_page
, index
,
1593 end_index
, PAGE_LOCK
, &index_ret
);
1595 __unlock_for_delalloc(inode
, locked_page
, delalloc_start
,
1596 (u64
)index_ret
<< PAGE_SHIFT
);
1601 * find a contiguous range of bytes in the file marked as delalloc, not
1602 * more than 'max_bytes'. start and end are used to return the range,
1604 * 1 is returned if we find something, 0 if nothing was in the tree
1606 STATIC u64
find_lock_delalloc_range(struct inode
*inode
,
1607 struct extent_io_tree
*tree
,
1608 struct page
*locked_page
, u64
*start
,
1609 u64
*end
, u64 max_bytes
)
1614 struct extent_state
*cached_state
= NULL
;
1619 /* step one, find a bunch of delalloc bytes starting at start */
1620 delalloc_start
= *start
;
1622 found
= find_delalloc_range(tree
, &delalloc_start
, &delalloc_end
,
1623 max_bytes
, &cached_state
);
1624 if (!found
|| delalloc_end
<= *start
) {
1625 *start
= delalloc_start
;
1626 *end
= delalloc_end
;
1627 free_extent_state(cached_state
);
1632 * start comes from the offset of locked_page. We have to lock
1633 * pages in order, so we can't process delalloc bytes before
1636 if (delalloc_start
< *start
)
1637 delalloc_start
= *start
;
1640 * make sure to limit the number of pages we try to lock down
1642 if (delalloc_end
+ 1 - delalloc_start
> max_bytes
)
1643 delalloc_end
= delalloc_start
+ max_bytes
- 1;
1645 /* step two, lock all the pages after the page that has start */
1646 ret
= lock_delalloc_pages(inode
, locked_page
,
1647 delalloc_start
, delalloc_end
);
1648 if (ret
== -EAGAIN
) {
1649 /* some of the pages are gone, lets avoid looping by
1650 * shortening the size of the delalloc range we're searching
1652 free_extent_state(cached_state
);
1653 cached_state
= NULL
;
1655 max_bytes
= PAGE_SIZE
;
1663 BUG_ON(ret
); /* Only valid values are 0 and -EAGAIN */
1665 /* step three, lock the state bits for the whole range */
1666 lock_extent_bits(tree
, delalloc_start
, delalloc_end
, &cached_state
);
1668 /* then test to make sure it is all still delalloc */
1669 ret
= test_range_bit(tree
, delalloc_start
, delalloc_end
,
1670 EXTENT_DELALLOC
, 1, cached_state
);
1672 unlock_extent_cached(tree
, delalloc_start
, delalloc_end
,
1673 &cached_state
, GFP_NOFS
);
1674 __unlock_for_delalloc(inode
, locked_page
,
1675 delalloc_start
, delalloc_end
);
1679 free_extent_state(cached_state
);
1680 *start
= delalloc_start
;
1681 *end
= delalloc_end
;
1686 static int __process_pages_contig(struct address_space
*mapping
,
1687 struct page
*locked_page
,
1688 pgoff_t start_index
, pgoff_t end_index
,
1689 unsigned long page_ops
, pgoff_t
*index_ret
)
1691 unsigned long nr_pages
= end_index
- start_index
+ 1;
1692 unsigned long pages_locked
= 0;
1693 pgoff_t index
= start_index
;
1694 struct page
*pages
[16];
1699 if (page_ops
& PAGE_LOCK
) {
1700 ASSERT(page_ops
== PAGE_LOCK
);
1701 ASSERT(index_ret
&& *index_ret
== start_index
);
1704 if ((page_ops
& PAGE_SET_ERROR
) && nr_pages
> 0)
1705 mapping_set_error(mapping
, -EIO
);
1707 while (nr_pages
> 0) {
1708 ret
= find_get_pages_contig(mapping
, index
,
1709 min_t(unsigned long,
1710 nr_pages
, ARRAY_SIZE(pages
)), pages
);
1713 * Only if we're going to lock these pages,
1714 * can we find nothing at @index.
1716 ASSERT(page_ops
& PAGE_LOCK
);
1720 for (i
= 0; i
< ret
; i
++) {
1721 if (page_ops
& PAGE_SET_PRIVATE2
)
1722 SetPagePrivate2(pages
[i
]);
1724 if (pages
[i
] == locked_page
) {
1729 if (page_ops
& PAGE_CLEAR_DIRTY
)
1730 clear_page_dirty_for_io(pages
[i
]);
1731 if (page_ops
& PAGE_SET_WRITEBACK
)
1732 set_page_writeback(pages
[i
]);
1733 if (page_ops
& PAGE_SET_ERROR
)
1734 SetPageError(pages
[i
]);
1735 if (page_ops
& PAGE_END_WRITEBACK
)
1736 end_page_writeback(pages
[i
]);
1737 if (page_ops
& PAGE_UNLOCK
)
1738 unlock_page(pages
[i
]);
1739 if (page_ops
& PAGE_LOCK
) {
1740 lock_page(pages
[i
]);
1741 if (!PageDirty(pages
[i
]) ||
1742 pages
[i
]->mapping
!= mapping
) {
1743 unlock_page(pages
[i
]);
1757 if (err
&& index_ret
)
1758 *index_ret
= start_index
+ pages_locked
- 1;
1762 void extent_clear_unlock_delalloc(struct inode
*inode
, u64 start
, u64 end
,
1763 u64 delalloc_end
, struct page
*locked_page
,
1764 unsigned clear_bits
,
1765 unsigned long page_ops
)
1767 clear_extent_bit(&BTRFS_I(inode
)->io_tree
, start
, end
, clear_bits
, 1, 0,
1770 __process_pages_contig(inode
->i_mapping
, locked_page
,
1771 start
>> PAGE_SHIFT
, end
>> PAGE_SHIFT
,
1776 * count the number of bytes in the tree that have a given bit(s)
1777 * set. This can be fairly slow, except for EXTENT_DIRTY which is
1778 * cached. The total number found is returned.
1780 u64
count_range_bits(struct extent_io_tree
*tree
,
1781 u64
*start
, u64 search_end
, u64 max_bytes
,
1782 unsigned bits
, int contig
)
1784 struct rb_node
*node
;
1785 struct extent_state
*state
;
1786 u64 cur_start
= *start
;
1787 u64 total_bytes
= 0;
1791 if (WARN_ON(search_end
<= cur_start
))
1794 spin_lock(&tree
->lock
);
1795 if (cur_start
== 0 && bits
== EXTENT_DIRTY
) {
1796 total_bytes
= tree
->dirty_bytes
;
1800 * this search will find all the extents that end after
1803 node
= tree_search(tree
, cur_start
);
1808 state
= rb_entry(node
, struct extent_state
, rb_node
);
1809 if (state
->start
> search_end
)
1811 if (contig
&& found
&& state
->start
> last
+ 1)
1813 if (state
->end
>= cur_start
&& (state
->state
& bits
) == bits
) {
1814 total_bytes
+= min(search_end
, state
->end
) + 1 -
1815 max(cur_start
, state
->start
);
1816 if (total_bytes
>= max_bytes
)
1819 *start
= max(cur_start
, state
->start
);
1823 } else if (contig
&& found
) {
1826 node
= rb_next(node
);
1831 spin_unlock(&tree
->lock
);
1836 * set the private field for a given byte offset in the tree. If there isn't
1837 * an extent_state there already, this does nothing.
1839 static noinline
int set_state_failrec(struct extent_io_tree
*tree
, u64 start
,
1840 struct io_failure_record
*failrec
)
1842 struct rb_node
*node
;
1843 struct extent_state
*state
;
1846 spin_lock(&tree
->lock
);
1848 * this search will find all the extents that end after
1851 node
= tree_search(tree
, start
);
1856 state
= rb_entry(node
, struct extent_state
, rb_node
);
1857 if (state
->start
!= start
) {
1861 state
->failrec
= failrec
;
1863 spin_unlock(&tree
->lock
);
1867 static noinline
int get_state_failrec(struct extent_io_tree
*tree
, u64 start
,
1868 struct io_failure_record
**failrec
)
1870 struct rb_node
*node
;
1871 struct extent_state
*state
;
1874 spin_lock(&tree
->lock
);
1876 * this search will find all the extents that end after
1879 node
= tree_search(tree
, start
);
1884 state
= rb_entry(node
, struct extent_state
, rb_node
);
1885 if (state
->start
!= start
) {
1889 *failrec
= state
->failrec
;
1891 spin_unlock(&tree
->lock
);
1896 * searches a range in the state tree for a given mask.
1897 * If 'filled' == 1, this returns 1 only if every extent in the tree
1898 * has the bits set. Otherwise, 1 is returned if any bit in the
1899 * range is found set.
1901 int test_range_bit(struct extent_io_tree
*tree
, u64 start
, u64 end
,
1902 unsigned bits
, int filled
, struct extent_state
*cached
)
1904 struct extent_state
*state
= NULL
;
1905 struct rb_node
*node
;
1908 spin_lock(&tree
->lock
);
1909 if (cached
&& extent_state_in_tree(cached
) && cached
->start
<= start
&&
1910 cached
->end
> start
)
1911 node
= &cached
->rb_node
;
1913 node
= tree_search(tree
, start
);
1914 while (node
&& start
<= end
) {
1915 state
= rb_entry(node
, struct extent_state
, rb_node
);
1917 if (filled
&& state
->start
> start
) {
1922 if (state
->start
> end
)
1925 if (state
->state
& bits
) {
1929 } else if (filled
) {
1934 if (state
->end
== (u64
)-1)
1937 start
= state
->end
+ 1;
1940 node
= rb_next(node
);
1947 spin_unlock(&tree
->lock
);
1952 * helper function to set a given page up to date if all the
1953 * extents in the tree for that page are up to date
1955 static void check_page_uptodate(struct extent_io_tree
*tree
, struct page
*page
)
1957 u64 start
= page_offset(page
);
1958 u64 end
= start
+ PAGE_SIZE
- 1;
1959 if (test_range_bit(tree
, start
, end
, EXTENT_UPTODATE
, 1, NULL
))
1960 SetPageUptodate(page
);
1963 int free_io_failure(struct btrfs_inode
*inode
, struct io_failure_record
*rec
)
1967 struct extent_io_tree
*failure_tree
= &inode
->io_failure_tree
;
1969 set_state_failrec(failure_tree
, rec
->start
, NULL
);
1970 ret
= clear_extent_bits(failure_tree
, rec
->start
,
1971 rec
->start
+ rec
->len
- 1,
1972 EXTENT_LOCKED
| EXTENT_DIRTY
);
1976 ret
= clear_extent_bits(&inode
->io_tree
, rec
->start
,
1977 rec
->start
+ rec
->len
- 1,
1987 * this bypasses the standard btrfs submit functions deliberately, as
1988 * the standard behavior is to write all copies in a raid setup. here we only
1989 * want to write the one bad copy. so we do the mapping for ourselves and issue
1990 * submit_bio directly.
1991 * to avoid any synchronization issues, wait for the data after writing, which
1992 * actually prevents the read that triggered the error from finishing.
1993 * currently, there can be no more than two copies of every data bit. thus,
1994 * exactly one rewrite is required.
1996 int repair_io_failure(struct btrfs_inode
*inode
, u64 start
, u64 length
,
1997 u64 logical
, struct page
*page
,
1998 unsigned int pg_offset
, int mirror_num
)
2000 struct btrfs_fs_info
*fs_info
= inode
->root
->fs_info
;
2002 struct btrfs_device
*dev
;
2005 struct btrfs_bio
*bbio
= NULL
;
2006 struct btrfs_mapping_tree
*map_tree
= &fs_info
->mapping_tree
;
2009 ASSERT(!(fs_info
->sb
->s_flags
& MS_RDONLY
));
2010 BUG_ON(!mirror_num
);
2012 /* we can't repair anything in raid56 yet */
2013 if (btrfs_is_parity_mirror(map_tree
, logical
, length
, mirror_num
))
2016 bio
= btrfs_io_bio_alloc(GFP_NOFS
, 1);
2019 bio
->bi_iter
.bi_size
= 0;
2020 map_length
= length
;
2023 * Avoid races with device replace and make sure our bbio has devices
2024 * associated to its stripes that don't go away while we are doing the
2025 * read repair operation.
2027 btrfs_bio_counter_inc_blocked(fs_info
);
2028 ret
= btrfs_map_block(fs_info
, BTRFS_MAP_WRITE
, logical
,
2029 &map_length
, &bbio
, mirror_num
);
2031 btrfs_bio_counter_dec(fs_info
);
2035 BUG_ON(mirror_num
!= bbio
->mirror_num
);
2036 sector
= bbio
->stripes
[mirror_num
-1].physical
>> 9;
2037 bio
->bi_iter
.bi_sector
= sector
;
2038 dev
= bbio
->stripes
[mirror_num
-1].dev
;
2039 btrfs_put_bbio(bbio
);
2040 if (!dev
|| !dev
->bdev
|| !dev
->writeable
) {
2041 btrfs_bio_counter_dec(fs_info
);
2045 bio
->bi_bdev
= dev
->bdev
;
2046 bio
->bi_opf
= REQ_OP_WRITE
| REQ_SYNC
;
2047 bio_add_page(bio
, page
, length
, pg_offset
);
2049 if (btrfsic_submit_bio_wait(bio
)) {
2050 /* try to remap that extent elsewhere? */
2051 btrfs_bio_counter_dec(fs_info
);
2053 btrfs_dev_stat_inc_and_print(dev
, BTRFS_DEV_STAT_WRITE_ERRS
);
2057 btrfs_info_rl_in_rcu(fs_info
,
2058 "read error corrected: ino %llu off %llu (dev %s sector %llu)",
2059 btrfs_ino(inode
), start
,
2060 rcu_str_deref(dev
->name
), sector
);
2061 btrfs_bio_counter_dec(fs_info
);
2066 int repair_eb_io_failure(struct btrfs_fs_info
*fs_info
,
2067 struct extent_buffer
*eb
, int mirror_num
)
2069 u64 start
= eb
->start
;
2070 unsigned long i
, num_pages
= num_extent_pages(eb
->start
, eb
->len
);
2073 if (fs_info
->sb
->s_flags
& MS_RDONLY
)
2076 for (i
= 0; i
< num_pages
; i
++) {
2077 struct page
*p
= eb
->pages
[i
];
2079 ret
= repair_io_failure(BTRFS_I(fs_info
->btree_inode
), start
,
2080 PAGE_SIZE
, start
, p
,
2081 start
- page_offset(p
), mirror_num
);
2091 * each time an IO finishes, we do a fast check in the IO failure tree
2092 * to see if we need to process or clean up an io_failure_record
2094 int clean_io_failure(struct btrfs_inode
*inode
, u64 start
, struct page
*page
,
2095 unsigned int pg_offset
)
2098 struct io_failure_record
*failrec
;
2099 struct btrfs_fs_info
*fs_info
= inode
->root
->fs_info
;
2100 struct extent_state
*state
;
2105 ret
= count_range_bits(&inode
->io_failure_tree
, &private,
2106 (u64
)-1, 1, EXTENT_DIRTY
, 0);
2110 ret
= get_state_failrec(&inode
->io_failure_tree
, start
,
2115 BUG_ON(!failrec
->this_mirror
);
2117 if (failrec
->in_validation
) {
2118 /* there was no real error, just free the record */
2119 btrfs_debug(fs_info
,
2120 "clean_io_failure: freeing dummy error at %llu",
2124 if (fs_info
->sb
->s_flags
& MS_RDONLY
)
2127 spin_lock(&inode
->io_tree
.lock
);
2128 state
= find_first_extent_bit_state(&inode
->io_tree
,
2131 spin_unlock(&inode
->io_tree
.lock
);
2133 if (state
&& state
->start
<= failrec
->start
&&
2134 state
->end
>= failrec
->start
+ failrec
->len
- 1) {
2135 num_copies
= btrfs_num_copies(fs_info
, failrec
->logical
,
2137 if (num_copies
> 1) {
2138 repair_io_failure(inode
, start
, failrec
->len
,
2139 failrec
->logical
, page
,
2140 pg_offset
, failrec
->failed_mirror
);
2145 free_io_failure(inode
, failrec
);
2151 * Can be called when
2152 * - hold extent lock
2153 * - under ordered extent
2154 * - the inode is freeing
2156 void btrfs_free_io_failure_record(struct btrfs_inode
*inode
, u64 start
, u64 end
)
2158 struct extent_io_tree
*failure_tree
= &inode
->io_failure_tree
;
2159 struct io_failure_record
*failrec
;
2160 struct extent_state
*state
, *next
;
2162 if (RB_EMPTY_ROOT(&failure_tree
->state
))
2165 spin_lock(&failure_tree
->lock
);
2166 state
= find_first_extent_bit_state(failure_tree
, start
, EXTENT_DIRTY
);
2168 if (state
->start
> end
)
2171 ASSERT(state
->end
<= end
);
2173 next
= next_state(state
);
2175 failrec
= state
->failrec
;
2176 free_extent_state(state
);
2181 spin_unlock(&failure_tree
->lock
);
2184 int btrfs_get_io_failure_record(struct inode
*inode
, u64 start
, u64 end
,
2185 struct io_failure_record
**failrec_ret
)
2187 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
2188 struct io_failure_record
*failrec
;
2189 struct extent_map
*em
;
2190 struct extent_io_tree
*failure_tree
= &BTRFS_I(inode
)->io_failure_tree
;
2191 struct extent_io_tree
*tree
= &BTRFS_I(inode
)->io_tree
;
2192 struct extent_map_tree
*em_tree
= &BTRFS_I(inode
)->extent_tree
;
2196 ret
= get_state_failrec(failure_tree
, start
, &failrec
);
2198 failrec
= kzalloc(sizeof(*failrec
), GFP_NOFS
);
2202 failrec
->start
= start
;
2203 failrec
->len
= end
- start
+ 1;
2204 failrec
->this_mirror
= 0;
2205 failrec
->bio_flags
= 0;
2206 failrec
->in_validation
= 0;
2208 read_lock(&em_tree
->lock
);
2209 em
= lookup_extent_mapping(em_tree
, start
, failrec
->len
);
2211 read_unlock(&em_tree
->lock
);
2216 if (em
->start
> start
|| em
->start
+ em
->len
<= start
) {
2217 free_extent_map(em
);
2220 read_unlock(&em_tree
->lock
);
2226 logical
= start
- em
->start
;
2227 logical
= em
->block_start
+ logical
;
2228 if (test_bit(EXTENT_FLAG_COMPRESSED
, &em
->flags
)) {
2229 logical
= em
->block_start
;
2230 failrec
->bio_flags
= EXTENT_BIO_COMPRESSED
;
2231 extent_set_compress_type(&failrec
->bio_flags
,
2235 btrfs_debug(fs_info
,
2236 "Get IO Failure Record: (new) logical=%llu, start=%llu, len=%llu",
2237 logical
, start
, failrec
->len
);
2239 failrec
->logical
= logical
;
2240 free_extent_map(em
);
2242 /* set the bits in the private failure tree */
2243 ret
= set_extent_bits(failure_tree
, start
, end
,
2244 EXTENT_LOCKED
| EXTENT_DIRTY
);
2246 ret
= set_state_failrec(failure_tree
, start
, failrec
);
2247 /* set the bits in the inode's tree */
2249 ret
= set_extent_bits(tree
, start
, end
, EXTENT_DAMAGED
);
2255 btrfs_debug(fs_info
,
2256 "Get IO Failure Record: (found) logical=%llu, start=%llu, len=%llu, validation=%d",
2257 failrec
->logical
, failrec
->start
, failrec
->len
,
2258 failrec
->in_validation
);
2260 * when data can be on disk more than twice, add to failrec here
2261 * (e.g. with a list for failed_mirror) to make
2262 * clean_io_failure() clean all those errors at once.
2266 *failrec_ret
= failrec
;
2271 int btrfs_check_repairable(struct inode
*inode
, struct bio
*failed_bio
,
2272 struct io_failure_record
*failrec
, int failed_mirror
)
2274 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
2277 num_copies
= btrfs_num_copies(fs_info
, failrec
->logical
, failrec
->len
);
2278 if (num_copies
== 1) {
2280 * we only have a single copy of the data, so don't bother with
2281 * all the retry and error correction code that follows. no
2282 * matter what the error is, it is very likely to persist.
2284 btrfs_debug(fs_info
,
2285 "Check Repairable: cannot repair, num_copies=%d, next_mirror %d, failed_mirror %d",
2286 num_copies
, failrec
->this_mirror
, failed_mirror
);
2291 * there are two premises:
2292 * a) deliver good data to the caller
2293 * b) correct the bad sectors on disk
2295 if (failed_bio
->bi_vcnt
> 1) {
2297 * to fulfill b), we need to know the exact failing sectors, as
2298 * we don't want to rewrite any more than the failed ones. thus,
2299 * we need separate read requests for the failed bio
2301 * if the following BUG_ON triggers, our validation request got
2302 * merged. we need separate requests for our algorithm to work.
2304 BUG_ON(failrec
->in_validation
);
2305 failrec
->in_validation
= 1;
2306 failrec
->this_mirror
= failed_mirror
;
2309 * we're ready to fulfill a) and b) alongside. get a good copy
2310 * of the failed sector and if we succeed, we have setup
2311 * everything for repair_io_failure to do the rest for us.
2313 if (failrec
->in_validation
) {
2314 BUG_ON(failrec
->this_mirror
!= failed_mirror
);
2315 failrec
->in_validation
= 0;
2316 failrec
->this_mirror
= 0;
2318 failrec
->failed_mirror
= failed_mirror
;
2319 failrec
->this_mirror
++;
2320 if (failrec
->this_mirror
== failed_mirror
)
2321 failrec
->this_mirror
++;
2324 if (failrec
->this_mirror
> num_copies
) {
2325 btrfs_debug(fs_info
,
2326 "Check Repairable: (fail) num_copies=%d, next_mirror %d, failed_mirror %d",
2327 num_copies
, failrec
->this_mirror
, failed_mirror
);
2335 struct bio
*btrfs_create_repair_bio(struct inode
*inode
, struct bio
*failed_bio
,
2336 struct io_failure_record
*failrec
,
2337 struct page
*page
, int pg_offset
, int icsum
,
2338 bio_end_io_t
*endio_func
, void *data
)
2340 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
2342 struct btrfs_io_bio
*btrfs_failed_bio
;
2343 struct btrfs_io_bio
*btrfs_bio
;
2345 bio
= btrfs_io_bio_alloc(GFP_NOFS
, 1);
2349 bio
->bi_end_io
= endio_func
;
2350 bio
->bi_iter
.bi_sector
= failrec
->logical
>> 9;
2351 bio
->bi_bdev
= fs_info
->fs_devices
->latest_bdev
;
2352 bio
->bi_iter
.bi_size
= 0;
2353 bio
->bi_private
= data
;
2355 btrfs_failed_bio
= btrfs_io_bio(failed_bio
);
2356 if (btrfs_failed_bio
->csum
) {
2357 u16 csum_size
= btrfs_super_csum_size(fs_info
->super_copy
);
2359 btrfs_bio
= btrfs_io_bio(bio
);
2360 btrfs_bio
->csum
= btrfs_bio
->csum_inline
;
2362 memcpy(btrfs_bio
->csum
, btrfs_failed_bio
->csum
+ icsum
,
2366 bio_add_page(bio
, page
, failrec
->len
, pg_offset
);
2372 * this is a generic handler for readpage errors (default
2373 * readpage_io_failed_hook). if other copies exist, read those and write back
2374 * good data to the failed position. does not investigate in remapping the
2375 * failed extent elsewhere, hoping the device will be smart enough to do this as
2379 static int bio_readpage_error(struct bio
*failed_bio
, u64 phy_offset
,
2380 struct page
*page
, u64 start
, u64 end
,
2383 struct io_failure_record
*failrec
;
2384 struct inode
*inode
= page
->mapping
->host
;
2385 struct extent_io_tree
*tree
= &BTRFS_I(inode
)->io_tree
;
2390 BUG_ON(bio_op(failed_bio
) == REQ_OP_WRITE
);
2392 ret
= btrfs_get_io_failure_record(inode
, start
, end
, &failrec
);
2396 ret
= btrfs_check_repairable(inode
, failed_bio
, failrec
, failed_mirror
);
2398 free_io_failure(BTRFS_I(inode
), failrec
);
2402 if (failed_bio
->bi_vcnt
> 1)
2403 read_mode
|= REQ_FAILFAST_DEV
;
2405 phy_offset
>>= inode
->i_sb
->s_blocksize_bits
;
2406 bio
= btrfs_create_repair_bio(inode
, failed_bio
, failrec
, page
,
2407 start
- page_offset(page
),
2408 (int)phy_offset
, failed_bio
->bi_end_io
,
2411 free_io_failure(BTRFS_I(inode
), failrec
);
2414 bio_set_op_attrs(bio
, REQ_OP_READ
, read_mode
);
2416 btrfs_debug(btrfs_sb(inode
->i_sb
),
2417 "Repair Read Error: submitting new read[%#x] to this_mirror=%d, in_validation=%d",
2418 read_mode
, failrec
->this_mirror
, failrec
->in_validation
);
2420 ret
= tree
->ops
->submit_bio_hook(inode
, bio
, failrec
->this_mirror
,
2421 failrec
->bio_flags
, 0);
2423 free_io_failure(BTRFS_I(inode
), failrec
);
2430 /* lots and lots of room for performance fixes in the end_bio funcs */
2432 void end_extent_writepage(struct page
*page
, int err
, u64 start
, u64 end
)
2434 int uptodate
= (err
== 0);
2435 struct extent_io_tree
*tree
;
2438 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
2440 if (tree
->ops
&& tree
->ops
->writepage_end_io_hook
) {
2441 ret
= tree
->ops
->writepage_end_io_hook(page
, start
,
2442 end
, NULL
, uptodate
);
2448 ClearPageUptodate(page
);
2450 ret
= ret
< 0 ? ret
: -EIO
;
2451 mapping_set_error(page
->mapping
, ret
);
2456 * after a writepage IO is done, we need to:
2457 * clear the uptodate bits on error
2458 * clear the writeback bits in the extent tree for this IO
2459 * end_page_writeback if the page has no more pending IO
2461 * Scheduling is not allowed, so the extent state tree is expected
2462 * to have one and only one object corresponding to this IO.
2464 static void end_bio_extent_writepage(struct bio
*bio
)
2466 struct bio_vec
*bvec
;
2471 bio_for_each_segment_all(bvec
, bio
, i
) {
2472 struct page
*page
= bvec
->bv_page
;
2473 struct inode
*inode
= page
->mapping
->host
;
2474 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
2476 /* We always issue full-page reads, but if some block
2477 * in a page fails to read, blk_update_request() will
2478 * advance bv_offset and adjust bv_len to compensate.
2479 * Print a warning for nonzero offsets, and an error
2480 * if they don't add up to a full page. */
2481 if (bvec
->bv_offset
|| bvec
->bv_len
!= PAGE_SIZE
) {
2482 if (bvec
->bv_offset
+ bvec
->bv_len
!= PAGE_SIZE
)
2484 "partial page write in btrfs with offset %u and length %u",
2485 bvec
->bv_offset
, bvec
->bv_len
);
2488 "incomplete page write in btrfs with offset %u and length %u",
2489 bvec
->bv_offset
, bvec
->bv_len
);
2492 start
= page_offset(page
);
2493 end
= start
+ bvec
->bv_offset
+ bvec
->bv_len
- 1;
2495 end_extent_writepage(page
, bio
->bi_error
, start
, end
);
2496 end_page_writeback(page
);
2503 endio_readpage_release_extent(struct extent_io_tree
*tree
, u64 start
, u64 len
,
2506 struct extent_state
*cached
= NULL
;
2507 u64 end
= start
+ len
- 1;
2509 if (uptodate
&& tree
->track_uptodate
)
2510 set_extent_uptodate(tree
, start
, end
, &cached
, GFP_ATOMIC
);
2511 unlock_extent_cached(tree
, start
, end
, &cached
, GFP_ATOMIC
);
2515 * after a readpage IO is done, we need to:
2516 * clear the uptodate bits on error
2517 * set the uptodate bits if things worked
2518 * set the page up to date if all extents in the tree are uptodate
2519 * clear the lock bit in the extent tree
2520 * unlock the page if there are no other extents locked for it
2522 * Scheduling is not allowed, so the extent state tree is expected
2523 * to have one and only one object corresponding to this IO.
2525 static void end_bio_extent_readpage(struct bio
*bio
)
2527 struct bio_vec
*bvec
;
2528 int uptodate
= !bio
->bi_error
;
2529 struct btrfs_io_bio
*io_bio
= btrfs_io_bio(bio
);
2530 struct extent_io_tree
*tree
;
2535 u64 extent_start
= 0;
2541 bio_for_each_segment_all(bvec
, bio
, i
) {
2542 struct page
*page
= bvec
->bv_page
;
2543 struct inode
*inode
= page
->mapping
->host
;
2544 struct btrfs_fs_info
*fs_info
= btrfs_sb(inode
->i_sb
);
2546 btrfs_debug(fs_info
,
2547 "end_bio_extent_readpage: bi_sector=%llu, err=%d, mirror=%u",
2548 (u64
)bio
->bi_iter
.bi_sector
, bio
->bi_error
,
2549 io_bio
->mirror_num
);
2550 tree
= &BTRFS_I(inode
)->io_tree
;
2552 /* We always issue full-page reads, but if some block
2553 * in a page fails to read, blk_update_request() will
2554 * advance bv_offset and adjust bv_len to compensate.
2555 * Print a warning for nonzero offsets, and an error
2556 * if they don't add up to a full page. */
2557 if (bvec
->bv_offset
|| bvec
->bv_len
!= PAGE_SIZE
) {
2558 if (bvec
->bv_offset
+ bvec
->bv_len
!= PAGE_SIZE
)
2560 "partial page read in btrfs with offset %u and length %u",
2561 bvec
->bv_offset
, bvec
->bv_len
);
2564 "incomplete page read in btrfs with offset %u and length %u",
2565 bvec
->bv_offset
, bvec
->bv_len
);
2568 start
= page_offset(page
);
2569 end
= start
+ bvec
->bv_offset
+ bvec
->bv_len
- 1;
2572 mirror
= io_bio
->mirror_num
;
2573 if (likely(uptodate
&& tree
->ops
&&
2574 tree
->ops
->readpage_end_io_hook
)) {
2575 ret
= tree
->ops
->readpage_end_io_hook(io_bio
, offset
,
2581 clean_io_failure(BTRFS_I(inode
), start
,
2585 if (likely(uptodate
))
2588 if (tree
->ops
&& tree
->ops
->readpage_io_failed_hook
) {
2589 ret
= tree
->ops
->readpage_io_failed_hook(page
, mirror
);
2590 if (!ret
&& !bio
->bi_error
)
2594 * The generic bio_readpage_error handles errors the
2595 * following way: If possible, new read requests are
2596 * created and submitted and will end up in
2597 * end_bio_extent_readpage as well (if we're lucky, not
2598 * in the !uptodate case). In that case it returns 0 and
2599 * we just go on with the next page in our bio. If it
2600 * can't handle the error it will return -EIO and we
2601 * remain responsible for that page.
2603 ret
= bio_readpage_error(bio
, offset
, page
, start
, end
,
2606 uptodate
= !bio
->bi_error
;
2612 if (likely(uptodate
)) {
2613 loff_t i_size
= i_size_read(inode
);
2614 pgoff_t end_index
= i_size
>> PAGE_SHIFT
;
2617 /* Zero out the end if this page straddles i_size */
2618 off
= i_size
& (PAGE_SIZE
-1);
2619 if (page
->index
== end_index
&& off
)
2620 zero_user_segment(page
, off
, PAGE_SIZE
);
2621 SetPageUptodate(page
);
2623 ClearPageUptodate(page
);
2629 if (unlikely(!uptodate
)) {
2631 endio_readpage_release_extent(tree
,
2637 endio_readpage_release_extent(tree
, start
,
2638 end
- start
+ 1, 0);
2639 } else if (!extent_len
) {
2640 extent_start
= start
;
2641 extent_len
= end
+ 1 - start
;
2642 } else if (extent_start
+ extent_len
== start
) {
2643 extent_len
+= end
+ 1 - start
;
2645 endio_readpage_release_extent(tree
, extent_start
,
2646 extent_len
, uptodate
);
2647 extent_start
= start
;
2648 extent_len
= end
+ 1 - start
;
2653 endio_readpage_release_extent(tree
, extent_start
, extent_len
,
2656 io_bio
->end_io(io_bio
, bio
->bi_error
);
2661 * this allocates from the btrfs_bioset. We're returning a bio right now
2662 * but you can call btrfs_io_bio for the appropriate container_of magic
2665 btrfs_bio_alloc(struct block_device
*bdev
, u64 first_sector
, int nr_vecs
,
2668 struct btrfs_io_bio
*btrfs_bio
;
2671 bio
= bio_alloc_bioset(gfp_flags
, nr_vecs
, btrfs_bioset
);
2673 if (bio
== NULL
&& (current
->flags
& PF_MEMALLOC
)) {
2674 while (!bio
&& (nr_vecs
/= 2)) {
2675 bio
= bio_alloc_bioset(gfp_flags
,
2676 nr_vecs
, btrfs_bioset
);
2681 bio
->bi_bdev
= bdev
;
2682 bio
->bi_iter
.bi_sector
= first_sector
;
2683 btrfs_bio
= btrfs_io_bio(bio
);
2684 btrfs_bio
->csum
= NULL
;
2685 btrfs_bio
->csum_allocated
= NULL
;
2686 btrfs_bio
->end_io
= NULL
;
2691 struct bio
*btrfs_bio_clone(struct bio
*bio
, gfp_t gfp_mask
)
2693 struct btrfs_io_bio
*btrfs_bio
;
2696 new = bio_clone_bioset(bio
, gfp_mask
, btrfs_bioset
);
2698 btrfs_bio
= btrfs_io_bio(new);
2699 btrfs_bio
->csum
= NULL
;
2700 btrfs_bio
->csum_allocated
= NULL
;
2701 btrfs_bio
->end_io
= NULL
;
2706 /* this also allocates from the btrfs_bioset */
2707 struct bio
*btrfs_io_bio_alloc(gfp_t gfp_mask
, unsigned int nr_iovecs
)
2709 struct btrfs_io_bio
*btrfs_bio
;
2712 bio
= bio_alloc_bioset(gfp_mask
, nr_iovecs
, btrfs_bioset
);
2714 btrfs_bio
= btrfs_io_bio(bio
);
2715 btrfs_bio
->csum
= NULL
;
2716 btrfs_bio
->csum_allocated
= NULL
;
2717 btrfs_bio
->end_io
= NULL
;
2723 static int __must_check
submit_one_bio(struct bio
*bio
, int mirror_num
,
2724 unsigned long bio_flags
)
2727 struct bio_vec
*bvec
= bio
->bi_io_vec
+ bio
->bi_vcnt
- 1;
2728 struct page
*page
= bvec
->bv_page
;
2729 struct extent_io_tree
*tree
= bio
->bi_private
;
2732 start
= page_offset(page
) + bvec
->bv_offset
;
2734 bio
->bi_private
= NULL
;
2737 if (tree
->ops
&& tree
->ops
->submit_bio_hook
)
2738 ret
= tree
->ops
->submit_bio_hook(page
->mapping
->host
, bio
,
2739 mirror_num
, bio_flags
, start
);
2741 btrfsic_submit_bio(bio
);
2747 static int merge_bio(struct extent_io_tree
*tree
, struct page
*page
,
2748 unsigned long offset
, size_t size
, struct bio
*bio
,
2749 unsigned long bio_flags
)
2752 if (tree
->ops
&& tree
->ops
->merge_bio_hook
)
2753 ret
= tree
->ops
->merge_bio_hook(page
, offset
, size
, bio
,
2759 static int submit_extent_page(int op
, int op_flags
, struct extent_io_tree
*tree
,
2760 struct writeback_control
*wbc
,
2761 struct page
*page
, sector_t sector
,
2762 size_t size
, unsigned long offset
,
2763 struct block_device
*bdev
,
2764 struct bio
**bio_ret
,
2765 bio_end_io_t end_io_func
,
2767 unsigned long prev_bio_flags
,
2768 unsigned long bio_flags
,
2769 bool force_bio_submit
)
2774 int old_compressed
= prev_bio_flags
& EXTENT_BIO_COMPRESSED
;
2775 size_t page_size
= min_t(size_t, size
, PAGE_SIZE
);
2777 if (bio_ret
&& *bio_ret
) {
2780 contig
= bio
->bi_iter
.bi_sector
== sector
;
2782 contig
= bio_end_sector(bio
) == sector
;
2784 if (prev_bio_flags
!= bio_flags
|| !contig
||
2786 merge_bio(tree
, page
, offset
, page_size
, bio
, bio_flags
) ||
2787 bio_add_page(bio
, page
, page_size
, offset
) < page_size
) {
2788 ret
= submit_one_bio(bio
, mirror_num
, prev_bio_flags
);
2796 wbc_account_io(wbc
, page
, page_size
);
2801 bio
= btrfs_bio_alloc(bdev
, sector
, BIO_MAX_PAGES
,
2802 GFP_NOFS
| __GFP_HIGH
);
2806 bio_add_page(bio
, page
, page_size
, offset
);
2807 bio
->bi_end_io
= end_io_func
;
2808 bio
->bi_private
= tree
;
2809 bio_set_op_attrs(bio
, op
, op_flags
);
2811 wbc_init_bio(wbc
, bio
);
2812 wbc_account_io(wbc
, page
, page_size
);
2818 ret
= submit_one_bio(bio
, mirror_num
, bio_flags
);
2823 static void attach_extent_buffer_page(struct extent_buffer
*eb
,
2826 if (!PagePrivate(page
)) {
2827 SetPagePrivate(page
);
2829 set_page_private(page
, (unsigned long)eb
);
2831 WARN_ON(page
->private != (unsigned long)eb
);
2835 void set_page_extent_mapped(struct page
*page
)
2837 if (!PagePrivate(page
)) {
2838 SetPagePrivate(page
);
2840 set_page_private(page
, EXTENT_PAGE_PRIVATE
);
2844 static struct extent_map
*
2845 __get_extent_map(struct inode
*inode
, struct page
*page
, size_t pg_offset
,
2846 u64 start
, u64 len
, get_extent_t
*get_extent
,
2847 struct extent_map
**em_cached
)
2849 struct extent_map
*em
;
2851 if (em_cached
&& *em_cached
) {
2853 if (extent_map_in_tree(em
) && start
>= em
->start
&&
2854 start
< extent_map_end(em
)) {
2855 atomic_inc(&em
->refs
);
2859 free_extent_map(em
);
2863 em
= get_extent(BTRFS_I(inode
), page
, pg_offset
, start
, len
, 0);
2864 if (em_cached
&& !IS_ERR_OR_NULL(em
)) {
2866 atomic_inc(&em
->refs
);
2872 * basic readpage implementation. Locked extent state structs are inserted
2873 * into the tree that are removed when the IO is done (by the end_io
2875 * XXX JDM: This needs looking at to ensure proper page locking
2876 * return 0 on success, otherwise return error
2878 static int __do_readpage(struct extent_io_tree
*tree
,
2880 get_extent_t
*get_extent
,
2881 struct extent_map
**em_cached
,
2882 struct bio
**bio
, int mirror_num
,
2883 unsigned long *bio_flags
, int read_flags
,
2886 struct inode
*inode
= page
->mapping
->host
;
2887 u64 start
= page_offset(page
);
2888 u64 page_end
= start
+ PAGE_SIZE
- 1;
2892 u64 last_byte
= i_size_read(inode
);
2896 struct extent_map
*em
;
2897 struct block_device
*bdev
;
2900 size_t pg_offset
= 0;
2902 size_t disk_io_size
;
2903 size_t blocksize
= inode
->i_sb
->s_blocksize
;
2904 unsigned long this_bio_flag
= 0;
2906 set_page_extent_mapped(page
);
2909 if (!PageUptodate(page
)) {
2910 if (cleancache_get_page(page
) == 0) {
2911 BUG_ON(blocksize
!= PAGE_SIZE
);
2912 unlock_extent(tree
, start
, end
);
2917 if (page
->index
== last_byte
>> PAGE_SHIFT
) {
2919 size_t zero_offset
= last_byte
& (PAGE_SIZE
- 1);
2922 iosize
= PAGE_SIZE
- zero_offset
;
2923 userpage
= kmap_atomic(page
);
2924 memset(userpage
+ zero_offset
, 0, iosize
);
2925 flush_dcache_page(page
);
2926 kunmap_atomic(userpage
);
2929 while (cur
<= end
) {
2930 bool force_bio_submit
= false;
2932 if (cur
>= last_byte
) {
2934 struct extent_state
*cached
= NULL
;
2936 iosize
= PAGE_SIZE
- pg_offset
;
2937 userpage
= kmap_atomic(page
);
2938 memset(userpage
+ pg_offset
, 0, iosize
);
2939 flush_dcache_page(page
);
2940 kunmap_atomic(userpage
);
2941 set_extent_uptodate(tree
, cur
, cur
+ iosize
- 1,
2943 unlock_extent_cached(tree
, cur
,
2948 em
= __get_extent_map(inode
, page
, pg_offset
, cur
,
2949 end
- cur
+ 1, get_extent
, em_cached
);
2950 if (IS_ERR_OR_NULL(em
)) {
2952 unlock_extent(tree
, cur
, end
);
2955 extent_offset
= cur
- em
->start
;
2956 BUG_ON(extent_map_end(em
) <= cur
);
2959 if (test_bit(EXTENT_FLAG_COMPRESSED
, &em
->flags
)) {
2960 this_bio_flag
|= EXTENT_BIO_COMPRESSED
;
2961 extent_set_compress_type(&this_bio_flag
,
2965 iosize
= min(extent_map_end(em
) - cur
, end
- cur
+ 1);
2966 cur_end
= min(extent_map_end(em
) - 1, end
);
2967 iosize
= ALIGN(iosize
, blocksize
);
2968 if (this_bio_flag
& EXTENT_BIO_COMPRESSED
) {
2969 disk_io_size
= em
->block_len
;
2970 sector
= em
->block_start
>> 9;
2972 sector
= (em
->block_start
+ extent_offset
) >> 9;
2973 disk_io_size
= iosize
;
2976 block_start
= em
->block_start
;
2977 if (test_bit(EXTENT_FLAG_PREALLOC
, &em
->flags
))
2978 block_start
= EXTENT_MAP_HOLE
;
2981 * If we have a file range that points to a compressed extent
2982 * and it's followed by a consecutive file range that points to
2983 * to the same compressed extent (possibly with a different
2984 * offset and/or length, so it either points to the whole extent
2985 * or only part of it), we must make sure we do not submit a
2986 * single bio to populate the pages for the 2 ranges because
2987 * this makes the compressed extent read zero out the pages
2988 * belonging to the 2nd range. Imagine the following scenario:
2991 * [0 - 8K] [8K - 24K]
2994 * points to extent X, points to extent X,
2995 * offset 4K, length of 8K offset 0, length 16K
2997 * [extent X, compressed length = 4K uncompressed length = 16K]
2999 * If the bio to read the compressed extent covers both ranges,
3000 * it will decompress extent X into the pages belonging to the
3001 * first range and then it will stop, zeroing out the remaining
3002 * pages that belong to the other range that points to extent X.
3003 * So here we make sure we submit 2 bios, one for the first
3004 * range and another one for the third range. Both will target
3005 * the same physical extent from disk, but we can't currently
3006 * make the compressed bio endio callback populate the pages
3007 * for both ranges because each compressed bio is tightly
3008 * coupled with a single extent map, and each range can have
3009 * an extent map with a different offset value relative to the
3010 * uncompressed data of our extent and different lengths. This
3011 * is a corner case so we prioritize correctness over
3012 * non-optimal behavior (submitting 2 bios for the same extent).
3014 if (test_bit(EXTENT_FLAG_COMPRESSED
, &em
->flags
) &&
3015 prev_em_start
&& *prev_em_start
!= (u64
)-1 &&
3016 *prev_em_start
!= em
->orig_start
)
3017 force_bio_submit
= true;
3020 *prev_em_start
= em
->orig_start
;
3022 free_extent_map(em
);
3025 /* we've found a hole, just zero and go on */
3026 if (block_start
== EXTENT_MAP_HOLE
) {
3028 struct extent_state
*cached
= NULL
;
3030 userpage
= kmap_atomic(page
);
3031 memset(userpage
+ pg_offset
, 0, iosize
);
3032 flush_dcache_page(page
);
3033 kunmap_atomic(userpage
);
3035 set_extent_uptodate(tree
, cur
, cur
+ iosize
- 1,
3037 unlock_extent_cached(tree
, cur
,
3041 pg_offset
+= iosize
;
3044 /* the get_extent function already copied into the page */
3045 if (test_range_bit(tree
, cur
, cur_end
,
3046 EXTENT_UPTODATE
, 1, NULL
)) {
3047 check_page_uptodate(tree
, page
);
3048 unlock_extent(tree
, cur
, cur
+ iosize
- 1);
3050 pg_offset
+= iosize
;
3053 /* we have an inline extent but it didn't get marked up
3054 * to date. Error out
3056 if (block_start
== EXTENT_MAP_INLINE
) {
3058 unlock_extent(tree
, cur
, cur
+ iosize
- 1);
3060 pg_offset
+= iosize
;
3064 ret
= submit_extent_page(REQ_OP_READ
, read_flags
, tree
, NULL
,
3065 page
, sector
, disk_io_size
, pg_offset
,
3067 end_bio_extent_readpage
, mirror_num
,
3073 *bio_flags
= this_bio_flag
;
3076 unlock_extent(tree
, cur
, cur
+ iosize
- 1);
3080 pg_offset
+= iosize
;
3084 if (!PageError(page
))
3085 SetPageUptodate(page
);
3091 static inline void __do_contiguous_readpages(struct extent_io_tree
*tree
,
3092 struct page
*pages
[], int nr_pages
,
3094 get_extent_t
*get_extent
,
3095 struct extent_map
**em_cached
,
3096 struct bio
**bio
, int mirror_num
,
3097 unsigned long *bio_flags
,
3100 struct inode
*inode
;
3101 struct btrfs_ordered_extent
*ordered
;
3104 inode
= pages
[0]->mapping
->host
;
3106 lock_extent(tree
, start
, end
);
3107 ordered
= btrfs_lookup_ordered_range(BTRFS_I(inode
), start
,
3111 unlock_extent(tree
, start
, end
);
3112 btrfs_start_ordered_extent(inode
, ordered
, 1);
3113 btrfs_put_ordered_extent(ordered
);
3116 for (index
= 0; index
< nr_pages
; index
++) {
3117 __do_readpage(tree
, pages
[index
], get_extent
, em_cached
, bio
,
3118 mirror_num
, bio_flags
, 0, prev_em_start
);
3119 put_page(pages
[index
]);
3123 static void __extent_readpages(struct extent_io_tree
*tree
,
3124 struct page
*pages
[],
3125 int nr_pages
, get_extent_t
*get_extent
,
3126 struct extent_map
**em_cached
,
3127 struct bio
**bio
, int mirror_num
,
3128 unsigned long *bio_flags
,
3135 int first_index
= 0;
3137 for (index
= 0; index
< nr_pages
; index
++) {
3138 page_start
= page_offset(pages
[index
]);
3141 end
= start
+ PAGE_SIZE
- 1;
3142 first_index
= index
;
3143 } else if (end
+ 1 == page_start
) {
3146 __do_contiguous_readpages(tree
, &pages
[first_index
],
3147 index
- first_index
, start
,
3148 end
, get_extent
, em_cached
,
3149 bio
, mirror_num
, bio_flags
,
3152 end
= start
+ PAGE_SIZE
- 1;
3153 first_index
= index
;
3158 __do_contiguous_readpages(tree
, &pages
[first_index
],
3159 index
- first_index
, start
,
3160 end
, get_extent
, em_cached
, bio
,
3161 mirror_num
, bio_flags
,
3165 static int __extent_read_full_page(struct extent_io_tree
*tree
,
3167 get_extent_t
*get_extent
,
3168 struct bio
**bio
, int mirror_num
,
3169 unsigned long *bio_flags
, int read_flags
)
3171 struct inode
*inode
= page
->mapping
->host
;
3172 struct btrfs_ordered_extent
*ordered
;
3173 u64 start
= page_offset(page
);
3174 u64 end
= start
+ PAGE_SIZE
- 1;
3178 lock_extent(tree
, start
, end
);
3179 ordered
= btrfs_lookup_ordered_range(BTRFS_I(inode
), start
,
3183 unlock_extent(tree
, start
, end
);
3184 btrfs_start_ordered_extent(inode
, ordered
, 1);
3185 btrfs_put_ordered_extent(ordered
);
3188 ret
= __do_readpage(tree
, page
, get_extent
, NULL
, bio
, mirror_num
,
3189 bio_flags
, read_flags
, NULL
);
3193 int extent_read_full_page(struct extent_io_tree
*tree
, struct page
*page
,
3194 get_extent_t
*get_extent
, int mirror_num
)
3196 struct bio
*bio
= NULL
;
3197 unsigned long bio_flags
= 0;
3200 ret
= __extent_read_full_page(tree
, page
, get_extent
, &bio
, mirror_num
,
3203 ret
= submit_one_bio(bio
, mirror_num
, bio_flags
);
3207 static void update_nr_written(struct writeback_control
*wbc
,
3208 unsigned long nr_written
)
3210 wbc
->nr_to_write
-= nr_written
;
3214 * helper for __extent_writepage, doing all of the delayed allocation setup.
3216 * This returns 1 if our fill_delalloc function did all the work required
3217 * to write the page (copy into inline extent). In this case the IO has
3218 * been started and the page is already unlocked.
3220 * This returns 0 if all went well (page still locked)
3221 * This returns < 0 if there were errors (page still locked)
3223 static noinline_for_stack
int writepage_delalloc(struct inode
*inode
,
3224 struct page
*page
, struct writeback_control
*wbc
,
3225 struct extent_page_data
*epd
,
3227 unsigned long *nr_written
)
3229 struct extent_io_tree
*tree
= epd
->tree
;
3230 u64 page_end
= delalloc_start
+ PAGE_SIZE
- 1;
3232 u64 delalloc_to_write
= 0;
3233 u64 delalloc_end
= 0;
3235 int page_started
= 0;
3237 if (epd
->extent_locked
|| !tree
->ops
|| !tree
->ops
->fill_delalloc
)
3240 while (delalloc_end
< page_end
) {
3241 nr_delalloc
= find_lock_delalloc_range(inode
, tree
,
3245 BTRFS_MAX_EXTENT_SIZE
);
3246 if (nr_delalloc
== 0) {
3247 delalloc_start
= delalloc_end
+ 1;
3250 ret
= tree
->ops
->fill_delalloc(inode
, page
,
3255 /* File system has been set read-only */
3258 /* fill_delalloc should be return < 0 for error
3259 * but just in case, we use > 0 here meaning the
3260 * IO is started, so we don't want to return > 0
3261 * unless things are going well.
3263 ret
= ret
< 0 ? ret
: -EIO
;
3267 * delalloc_end is already one less than the total length, so
3268 * we don't subtract one from PAGE_SIZE
3270 delalloc_to_write
+= (delalloc_end
- delalloc_start
+
3271 PAGE_SIZE
) >> PAGE_SHIFT
;
3272 delalloc_start
= delalloc_end
+ 1;
3274 if (wbc
->nr_to_write
< delalloc_to_write
) {
3277 if (delalloc_to_write
< thresh
* 2)
3278 thresh
= delalloc_to_write
;
3279 wbc
->nr_to_write
= min_t(u64
, delalloc_to_write
,
3283 /* did the fill delalloc function already unlock and start
3288 * we've unlocked the page, so we can't update
3289 * the mapping's writeback index, just update
3292 wbc
->nr_to_write
-= *nr_written
;
3303 * helper for __extent_writepage. This calls the writepage start hooks,
3304 * and does the loop to map the page into extents and bios.
3306 * We return 1 if the IO is started and the page is unlocked,
3307 * 0 if all went well (page still locked)
3308 * < 0 if there were errors (page still locked)
3310 static noinline_for_stack
int __extent_writepage_io(struct inode
*inode
,
3312 struct writeback_control
*wbc
,
3313 struct extent_page_data
*epd
,
3315 unsigned long nr_written
,
3316 int write_flags
, int *nr_ret
)
3318 struct extent_io_tree
*tree
= epd
->tree
;
3319 u64 start
= page_offset(page
);
3320 u64 page_end
= start
+ PAGE_SIZE
- 1;
3327 struct extent_map
*em
;
3328 struct block_device
*bdev
;
3329 size_t pg_offset
= 0;
3335 if (tree
->ops
&& tree
->ops
->writepage_start_hook
) {
3336 ret
= tree
->ops
->writepage_start_hook(page
, start
,
3339 /* Fixup worker will requeue */
3341 wbc
->pages_skipped
++;
3343 redirty_page_for_writepage(wbc
, page
);
3345 update_nr_written(wbc
, nr_written
);
3352 * we don't want to touch the inode after unlocking the page,
3353 * so we update the mapping writeback index now
3355 update_nr_written(wbc
, nr_written
+ 1);
3358 if (i_size
<= start
) {
3359 if (tree
->ops
&& tree
->ops
->writepage_end_io_hook
)
3360 tree
->ops
->writepage_end_io_hook(page
, start
,
3365 blocksize
= inode
->i_sb
->s_blocksize
;
3367 while (cur
<= end
) {
3370 if (cur
>= i_size
) {
3371 if (tree
->ops
&& tree
->ops
->writepage_end_io_hook
)
3372 tree
->ops
->writepage_end_io_hook(page
, cur
,
3376 em
= epd
->get_extent(BTRFS_I(inode
), page
, pg_offset
, cur
,
3378 if (IS_ERR_OR_NULL(em
)) {
3380 ret
= PTR_ERR_OR_ZERO(em
);
3384 extent_offset
= cur
- em
->start
;
3385 em_end
= extent_map_end(em
);
3386 BUG_ON(em_end
<= cur
);
3388 iosize
= min(em_end
- cur
, end
- cur
+ 1);
3389 iosize
= ALIGN(iosize
, blocksize
);
3390 sector
= (em
->block_start
+ extent_offset
) >> 9;
3392 block_start
= em
->block_start
;
3393 compressed
= test_bit(EXTENT_FLAG_COMPRESSED
, &em
->flags
);
3394 free_extent_map(em
);
3398 * compressed and inline extents are written through other
3401 if (compressed
|| block_start
== EXTENT_MAP_HOLE
||
3402 block_start
== EXTENT_MAP_INLINE
) {
3404 * end_io notification does not happen here for
3405 * compressed extents
3407 if (!compressed
&& tree
->ops
&&
3408 tree
->ops
->writepage_end_io_hook
)
3409 tree
->ops
->writepage_end_io_hook(page
, cur
,
3412 else if (compressed
) {
3413 /* we don't want to end_page_writeback on
3414 * a compressed extent. this happens
3421 pg_offset
+= iosize
;
3425 set_range_writeback(tree
, cur
, cur
+ iosize
- 1);
3426 if (!PageWriteback(page
)) {
3427 btrfs_err(BTRFS_I(inode
)->root
->fs_info
,
3428 "page %lu not writeback, cur %llu end %llu",
3429 page
->index
, cur
, end
);
3432 ret
= submit_extent_page(REQ_OP_WRITE
, write_flags
, tree
, wbc
,
3433 page
, sector
, iosize
, pg_offset
,
3435 end_bio_extent_writepage
,
3439 if (PageWriteback(page
))
3440 end_page_writeback(page
);
3444 pg_offset
+= iosize
;
3453 * the writepage semantics are similar to regular writepage. extent
3454 * records are inserted to lock ranges in the tree, and as dirty areas
3455 * are found, they are marked writeback. Then the lock bits are removed
3456 * and the end_io handler clears the writeback ranges
3458 static int __extent_writepage(struct page
*page
, struct writeback_control
*wbc
,
3461 struct inode
*inode
= page
->mapping
->host
;
3462 struct extent_page_data
*epd
= data
;
3463 u64 start
= page_offset(page
);
3464 u64 page_end
= start
+ PAGE_SIZE
- 1;
3467 size_t pg_offset
= 0;
3468 loff_t i_size
= i_size_read(inode
);
3469 unsigned long end_index
= i_size
>> PAGE_SHIFT
;
3470 int write_flags
= 0;
3471 unsigned long nr_written
= 0;
3473 if (wbc
->sync_mode
== WB_SYNC_ALL
)
3474 write_flags
= REQ_SYNC
;
3476 trace___extent_writepage(page
, inode
, wbc
);
3478 WARN_ON(!PageLocked(page
));
3480 ClearPageError(page
);
3482 pg_offset
= i_size
& (PAGE_SIZE
- 1);
3483 if (page
->index
> end_index
||
3484 (page
->index
== end_index
&& !pg_offset
)) {
3485 page
->mapping
->a_ops
->invalidatepage(page
, 0, PAGE_SIZE
);
3490 if (page
->index
== end_index
) {
3493 userpage
= kmap_atomic(page
);
3494 memset(userpage
+ pg_offset
, 0,
3495 PAGE_SIZE
- pg_offset
);
3496 kunmap_atomic(userpage
);
3497 flush_dcache_page(page
);
3502 set_page_extent_mapped(page
);
3504 ret
= writepage_delalloc(inode
, page
, wbc
, epd
, start
, &nr_written
);
3510 ret
= __extent_writepage_io(inode
, page
, wbc
, epd
,
3511 i_size
, nr_written
, write_flags
, &nr
);
3517 /* make sure the mapping tag for page dirty gets cleared */
3518 set_page_writeback(page
);
3519 end_page_writeback(page
);
3521 if (PageError(page
)) {
3522 ret
= ret
< 0 ? ret
: -EIO
;
3523 end_extent_writepage(page
, ret
, start
, page_end
);
3532 void wait_on_extent_buffer_writeback(struct extent_buffer
*eb
)
3534 wait_on_bit_io(&eb
->bflags
, EXTENT_BUFFER_WRITEBACK
,
3535 TASK_UNINTERRUPTIBLE
);
3538 static noinline_for_stack
int
3539 lock_extent_buffer_for_io(struct extent_buffer
*eb
,
3540 struct btrfs_fs_info
*fs_info
,
3541 struct extent_page_data
*epd
)
3543 unsigned long i
, num_pages
;
3547 if (!btrfs_try_tree_write_lock(eb
)) {
3549 flush_write_bio(epd
);
3550 btrfs_tree_lock(eb
);
3553 if (test_bit(EXTENT_BUFFER_WRITEBACK
, &eb
->bflags
)) {
3554 btrfs_tree_unlock(eb
);
3558 flush_write_bio(epd
);
3562 wait_on_extent_buffer_writeback(eb
);
3563 btrfs_tree_lock(eb
);
3564 if (!test_bit(EXTENT_BUFFER_WRITEBACK
, &eb
->bflags
))
3566 btrfs_tree_unlock(eb
);
3571 * We need to do this to prevent races in people who check if the eb is
3572 * under IO since we can end up having no IO bits set for a short period
3575 spin_lock(&eb
->refs_lock
);
3576 if (test_and_clear_bit(EXTENT_BUFFER_DIRTY
, &eb
->bflags
)) {
3577 set_bit(EXTENT_BUFFER_WRITEBACK
, &eb
->bflags
);
3578 spin_unlock(&eb
->refs_lock
);
3579 btrfs_set_header_flag(eb
, BTRFS_HEADER_FLAG_WRITTEN
);
3580 __percpu_counter_add(&fs_info
->dirty_metadata_bytes
,
3582 fs_info
->dirty_metadata_batch
);
3585 spin_unlock(&eb
->refs_lock
);
3588 btrfs_tree_unlock(eb
);
3593 num_pages
= num_extent_pages(eb
->start
, eb
->len
);
3594 for (i
= 0; i
< num_pages
; i
++) {
3595 struct page
*p
= eb
->pages
[i
];
3597 if (!trylock_page(p
)) {
3599 flush_write_bio(epd
);
3609 static void end_extent_buffer_writeback(struct extent_buffer
*eb
)
3611 clear_bit(EXTENT_BUFFER_WRITEBACK
, &eb
->bflags
);
3612 smp_mb__after_atomic();
3613 wake_up_bit(&eb
->bflags
, EXTENT_BUFFER_WRITEBACK
);
3616 static void set_btree_ioerr(struct page
*page
)
3618 struct extent_buffer
*eb
= (struct extent_buffer
*)page
->private;
3621 if (test_and_set_bit(EXTENT_BUFFER_WRITE_ERR
, &eb
->bflags
))
3625 * If writeback for a btree extent that doesn't belong to a log tree
3626 * failed, increment the counter transaction->eb_write_errors.
3627 * We do this because while the transaction is running and before it's
3628 * committing (when we call filemap_fdata[write|wait]_range against
3629 * the btree inode), we might have
3630 * btree_inode->i_mapping->a_ops->writepages() called by the VM - if it
3631 * returns an error or an error happens during writeback, when we're
3632 * committing the transaction we wouldn't know about it, since the pages
3633 * can be no longer dirty nor marked anymore for writeback (if a
3634 * subsequent modification to the extent buffer didn't happen before the
3635 * transaction commit), which makes filemap_fdata[write|wait]_range not
3636 * able to find the pages tagged with SetPageError at transaction
3637 * commit time. So if this happens we must abort the transaction,
3638 * otherwise we commit a super block with btree roots that point to
3639 * btree nodes/leafs whose content on disk is invalid - either garbage
3640 * or the content of some node/leaf from a past generation that got
3641 * cowed or deleted and is no longer valid.
3643 * Note: setting AS_EIO/AS_ENOSPC in the btree inode's i_mapping would
3644 * not be enough - we need to distinguish between log tree extents vs
3645 * non-log tree extents, and the next filemap_fdatawait_range() call
3646 * will catch and clear such errors in the mapping - and that call might
3647 * be from a log sync and not from a transaction commit. Also, checking
3648 * for the eb flag EXTENT_BUFFER_WRITE_ERR at transaction commit time is
3649 * not done and would not be reliable - the eb might have been released
3650 * from memory and reading it back again means that flag would not be
3651 * set (since it's a runtime flag, not persisted on disk).
3653 * Using the flags below in the btree inode also makes us achieve the
3654 * goal of AS_EIO/AS_ENOSPC when writepages() returns success, started
3655 * writeback for all dirty pages and before filemap_fdatawait_range()
3656 * is called, the writeback for all dirty pages had already finished
3657 * with errors - because we were not using AS_EIO/AS_ENOSPC,
3658 * filemap_fdatawait_range() would return success, as it could not know
3659 * that writeback errors happened (the pages were no longer tagged for
3662 switch (eb
->log_index
) {
3664 set_bit(BTRFS_FS_BTREE_ERR
, &eb
->fs_info
->flags
);
3667 set_bit(BTRFS_FS_LOG1_ERR
, &eb
->fs_info
->flags
);
3670 set_bit(BTRFS_FS_LOG2_ERR
, &eb
->fs_info
->flags
);
3673 BUG(); /* unexpected, logic error */
3677 static void end_bio_extent_buffer_writepage(struct bio
*bio
)
3679 struct bio_vec
*bvec
;
3680 struct extent_buffer
*eb
;
3683 bio_for_each_segment_all(bvec
, bio
, i
) {
3684 struct page
*page
= bvec
->bv_page
;
3686 eb
= (struct extent_buffer
*)page
->private;
3688 done
= atomic_dec_and_test(&eb
->io_pages
);
3690 if (bio
->bi_error
||
3691 test_bit(EXTENT_BUFFER_WRITE_ERR
, &eb
->bflags
)) {
3692 ClearPageUptodate(page
);
3693 set_btree_ioerr(page
);
3696 end_page_writeback(page
);
3701 end_extent_buffer_writeback(eb
);
3707 static noinline_for_stack
int write_one_eb(struct extent_buffer
*eb
,
3708 struct btrfs_fs_info
*fs_info
,
3709 struct writeback_control
*wbc
,
3710 struct extent_page_data
*epd
)
3712 struct block_device
*bdev
= fs_info
->fs_devices
->latest_bdev
;
3713 struct extent_io_tree
*tree
= &BTRFS_I(fs_info
->btree_inode
)->io_tree
;
3714 u64 offset
= eb
->start
;
3716 unsigned long i
, num_pages
;
3717 unsigned long bio_flags
= 0;
3718 unsigned long start
, end
;
3719 int write_flags
= (epd
->sync_io
? REQ_SYNC
: 0) | REQ_META
;
3722 clear_bit(EXTENT_BUFFER_WRITE_ERR
, &eb
->bflags
);
3723 num_pages
= num_extent_pages(eb
->start
, eb
->len
);
3724 atomic_set(&eb
->io_pages
, num_pages
);
3725 if (btrfs_header_owner(eb
) == BTRFS_TREE_LOG_OBJECTID
)
3726 bio_flags
= EXTENT_BIO_TREE_LOG
;
3728 /* set btree blocks beyond nritems with 0 to avoid stale content. */
3729 nritems
= btrfs_header_nritems(eb
);
3730 if (btrfs_header_level(eb
) > 0) {
3731 end
= btrfs_node_key_ptr_offset(nritems
);
3733 memzero_extent_buffer(eb
, end
, eb
->len
- end
);
3737 * header 0 1 2 .. N ... data_N .. data_2 data_1 data_0
3739 start
= btrfs_item_nr_offset(nritems
);
3740 end
= btrfs_leaf_data(eb
) + leaf_data_end(fs_info
, eb
);
3741 memzero_extent_buffer(eb
, start
, end
- start
);
3744 for (i
= 0; i
< num_pages
; i
++) {
3745 struct page
*p
= eb
->pages
[i
];
3747 clear_page_dirty_for_io(p
);
3748 set_page_writeback(p
);
3749 ret
= submit_extent_page(REQ_OP_WRITE
, write_flags
, tree
, wbc
,
3750 p
, offset
>> 9, PAGE_SIZE
, 0, bdev
,
3752 end_bio_extent_buffer_writepage
,
3753 0, epd
->bio_flags
, bio_flags
, false);
3754 epd
->bio_flags
= bio_flags
;
3757 if (PageWriteback(p
))
3758 end_page_writeback(p
);
3759 if (atomic_sub_and_test(num_pages
- i
, &eb
->io_pages
))
3760 end_extent_buffer_writeback(eb
);
3764 offset
+= PAGE_SIZE
;
3765 update_nr_written(wbc
, 1);
3769 if (unlikely(ret
)) {
3770 for (; i
< num_pages
; i
++) {
3771 struct page
*p
= eb
->pages
[i
];
3772 clear_page_dirty_for_io(p
);
3780 int btree_write_cache_pages(struct address_space
*mapping
,
3781 struct writeback_control
*wbc
)
3783 struct extent_io_tree
*tree
= &BTRFS_I(mapping
->host
)->io_tree
;
3784 struct btrfs_fs_info
*fs_info
= BTRFS_I(mapping
->host
)->root
->fs_info
;
3785 struct extent_buffer
*eb
, *prev_eb
= NULL
;
3786 struct extent_page_data epd
= {
3790 .sync_io
= wbc
->sync_mode
== WB_SYNC_ALL
,
3795 int nr_to_write_done
= 0;
3796 struct pagevec pvec
;
3799 pgoff_t end
; /* Inclusive */
3803 pagevec_init(&pvec
, 0);
3804 if (wbc
->range_cyclic
) {
3805 index
= mapping
->writeback_index
; /* Start from prev offset */
3808 index
= wbc
->range_start
>> PAGE_SHIFT
;
3809 end
= wbc
->range_end
>> PAGE_SHIFT
;
3812 if (wbc
->sync_mode
== WB_SYNC_ALL
)
3813 tag
= PAGECACHE_TAG_TOWRITE
;
3815 tag
= PAGECACHE_TAG_DIRTY
;
3817 if (wbc
->sync_mode
== WB_SYNC_ALL
)
3818 tag_pages_for_writeback(mapping
, index
, end
);
3819 while (!done
&& !nr_to_write_done
&& (index
<= end
) &&
3820 (nr_pages
= pagevec_lookup_tag(&pvec
, mapping
, &index
, tag
,
3821 min(end
- index
, (pgoff_t
)PAGEVEC_SIZE
-1) + 1))) {
3825 for (i
= 0; i
< nr_pages
; i
++) {
3826 struct page
*page
= pvec
.pages
[i
];
3828 if (!PagePrivate(page
))
3831 if (!wbc
->range_cyclic
&& page
->index
> end
) {
3836 spin_lock(&mapping
->private_lock
);
3837 if (!PagePrivate(page
)) {
3838 spin_unlock(&mapping
->private_lock
);
3842 eb
= (struct extent_buffer
*)page
->private;
3845 * Shouldn't happen and normally this would be a BUG_ON
3846 * but no sense in crashing the users box for something
3847 * we can survive anyway.
3850 spin_unlock(&mapping
->private_lock
);
3854 if (eb
== prev_eb
) {
3855 spin_unlock(&mapping
->private_lock
);
3859 ret
= atomic_inc_not_zero(&eb
->refs
);
3860 spin_unlock(&mapping
->private_lock
);
3865 ret
= lock_extent_buffer_for_io(eb
, fs_info
, &epd
);
3867 free_extent_buffer(eb
);
3871 ret
= write_one_eb(eb
, fs_info
, wbc
, &epd
);
3874 free_extent_buffer(eb
);
3877 free_extent_buffer(eb
);
3880 * the filesystem may choose to bump up nr_to_write.
3881 * We have to make sure to honor the new nr_to_write
3884 nr_to_write_done
= wbc
->nr_to_write
<= 0;
3886 pagevec_release(&pvec
);
3889 if (!scanned
&& !done
) {
3891 * We hit the last page and there is more work to be done: wrap
3892 * back to the start of the file
3898 flush_write_bio(&epd
);
3903 * write_cache_pages - walk the list of dirty pages of the given address space and write all of them.
3904 * @mapping: address space structure to write
3905 * @wbc: subtract the number of written pages from *@wbc->nr_to_write
3906 * @writepage: function called for each page
3907 * @data: data passed to writepage function
3909 * If a page is already under I/O, write_cache_pages() skips it, even
3910 * if it's dirty. This is desirable behaviour for memory-cleaning writeback,
3911 * but it is INCORRECT for data-integrity system calls such as fsync(). fsync()
3912 * and msync() need to guarantee that all the data which was dirty at the time
3913 * the call was made get new I/O started against them. If wbc->sync_mode is
3914 * WB_SYNC_ALL then we were called for data integrity and we must wait for
3915 * existing IO to complete.
3917 static int extent_write_cache_pages(struct address_space
*mapping
,
3918 struct writeback_control
*wbc
,
3919 writepage_t writepage
, void *data
,
3920 void (*flush_fn
)(void *))
3922 struct inode
*inode
= mapping
->host
;
3925 int nr_to_write_done
= 0;
3926 struct pagevec pvec
;
3929 pgoff_t end
; /* Inclusive */
3931 int range_whole
= 0;
3936 * We have to hold onto the inode so that ordered extents can do their
3937 * work when the IO finishes. The alternative to this is failing to add
3938 * an ordered extent if the igrab() fails there and that is a huge pain
3939 * to deal with, so instead just hold onto the inode throughout the
3940 * writepages operation. If it fails here we are freeing up the inode
3941 * anyway and we'd rather not waste our time writing out stuff that is
3942 * going to be truncated anyway.
3947 pagevec_init(&pvec
, 0);
3948 if (wbc
->range_cyclic
) {
3949 index
= mapping
->writeback_index
; /* Start from prev offset */
3952 index
= wbc
->range_start
>> PAGE_SHIFT
;
3953 end
= wbc
->range_end
>> PAGE_SHIFT
;
3954 if (wbc
->range_start
== 0 && wbc
->range_end
== LLONG_MAX
)
3958 if (wbc
->sync_mode
== WB_SYNC_ALL
)
3959 tag
= PAGECACHE_TAG_TOWRITE
;
3961 tag
= PAGECACHE_TAG_DIRTY
;
3963 if (wbc
->sync_mode
== WB_SYNC_ALL
)
3964 tag_pages_for_writeback(mapping
, index
, end
);
3966 while (!done
&& !nr_to_write_done
&& (index
<= end
) &&
3967 (nr_pages
= pagevec_lookup_tag(&pvec
, mapping
, &index
, tag
,
3968 min(end
- index
, (pgoff_t
)PAGEVEC_SIZE
-1) + 1))) {
3972 for (i
= 0; i
< nr_pages
; i
++) {
3973 struct page
*page
= pvec
.pages
[i
];
3975 done_index
= page
->index
;
3977 * At this point we hold neither mapping->tree_lock nor
3978 * lock on the page itself: the page may be truncated or
3979 * invalidated (changing page->mapping to NULL), or even
3980 * swizzled back from swapper_space to tmpfs file
3983 if (!trylock_page(page
)) {
3988 if (unlikely(page
->mapping
!= mapping
)) {
3993 if (!wbc
->range_cyclic
&& page
->index
> end
) {
3999 if (wbc
->sync_mode
!= WB_SYNC_NONE
) {
4000 if (PageWriteback(page
))
4002 wait_on_page_writeback(page
);
4005 if (PageWriteback(page
) ||
4006 !clear_page_dirty_for_io(page
)) {
4011 ret
= (*writepage
)(page
, wbc
, data
);
4013 if (unlikely(ret
== AOP_WRITEPAGE_ACTIVATE
)) {
4019 * done_index is set past this page,
4020 * so media errors will not choke
4021 * background writeout for the entire
4022 * file. This has consequences for
4023 * range_cyclic semantics (ie. it may
4024 * not be suitable for data integrity
4027 done_index
= page
->index
+ 1;
4033 * the filesystem may choose to bump up nr_to_write.
4034 * We have to make sure to honor the new nr_to_write
4037 nr_to_write_done
= wbc
->nr_to_write
<= 0;
4039 pagevec_release(&pvec
);
4042 if (!scanned
&& !done
) {
4044 * We hit the last page and there is more work to be done: wrap
4045 * back to the start of the file
4052 if (wbc
->range_cyclic
|| (wbc
->nr_to_write
> 0 && range_whole
))
4053 mapping
->writeback_index
= done_index
;
4055 btrfs_add_delayed_iput(inode
);
4059 static void flush_epd_write_bio(struct extent_page_data
*epd
)
4064 bio_set_op_attrs(epd
->bio
, REQ_OP_WRITE
,
4065 epd
->sync_io
? REQ_SYNC
: 0);
4067 ret
= submit_one_bio(epd
->bio
, 0, epd
->bio_flags
);
4068 BUG_ON(ret
< 0); /* -ENOMEM */
4073 static noinline
void flush_write_bio(void *data
)
4075 struct extent_page_data
*epd
= data
;
4076 flush_epd_write_bio(epd
);
4079 int extent_write_full_page(struct extent_io_tree
*tree
, struct page
*page
,
4080 get_extent_t
*get_extent
,
4081 struct writeback_control
*wbc
)
4084 struct extent_page_data epd
= {
4087 .get_extent
= get_extent
,
4089 .sync_io
= wbc
->sync_mode
== WB_SYNC_ALL
,
4093 ret
= __extent_writepage(page
, wbc
, &epd
);
4095 flush_epd_write_bio(&epd
);
4099 int extent_write_locked_range(struct extent_io_tree
*tree
, struct inode
*inode
,
4100 u64 start
, u64 end
, get_extent_t
*get_extent
,
4104 struct address_space
*mapping
= inode
->i_mapping
;
4106 unsigned long nr_pages
= (end
- start
+ PAGE_SIZE
) >>
4109 struct extent_page_data epd
= {
4112 .get_extent
= get_extent
,
4114 .sync_io
= mode
== WB_SYNC_ALL
,
4117 struct writeback_control wbc_writepages
= {
4119 .nr_to_write
= nr_pages
* 2,
4120 .range_start
= start
,
4121 .range_end
= end
+ 1,
4124 while (start
<= end
) {
4125 page
= find_get_page(mapping
, start
>> PAGE_SHIFT
);
4126 if (clear_page_dirty_for_io(page
))
4127 ret
= __extent_writepage(page
, &wbc_writepages
, &epd
);
4129 if (tree
->ops
&& tree
->ops
->writepage_end_io_hook
)
4130 tree
->ops
->writepage_end_io_hook(page
, start
,
4131 start
+ PAGE_SIZE
- 1,
4139 flush_epd_write_bio(&epd
);
4143 int extent_writepages(struct extent_io_tree
*tree
,
4144 struct address_space
*mapping
,
4145 get_extent_t
*get_extent
,
4146 struct writeback_control
*wbc
)
4149 struct extent_page_data epd
= {
4152 .get_extent
= get_extent
,
4154 .sync_io
= wbc
->sync_mode
== WB_SYNC_ALL
,
4158 ret
= extent_write_cache_pages(mapping
, wbc
, __extent_writepage
, &epd
,
4160 flush_epd_write_bio(&epd
);
4164 int extent_readpages(struct extent_io_tree
*tree
,
4165 struct address_space
*mapping
,
4166 struct list_head
*pages
, unsigned nr_pages
,
4167 get_extent_t get_extent
)
4169 struct bio
*bio
= NULL
;
4171 unsigned long bio_flags
= 0;
4172 struct page
*pagepool
[16];
4174 struct extent_map
*em_cached
= NULL
;
4176 u64 prev_em_start
= (u64
)-1;
4178 for (page_idx
= 0; page_idx
< nr_pages
; page_idx
++) {
4179 page
= list_entry(pages
->prev
, struct page
, lru
);
4181 prefetchw(&page
->flags
);
4182 list_del(&page
->lru
);
4183 if (add_to_page_cache_lru(page
, mapping
,
4185 readahead_gfp_mask(mapping
))) {
4190 pagepool
[nr
++] = page
;
4191 if (nr
< ARRAY_SIZE(pagepool
))
4193 __extent_readpages(tree
, pagepool
, nr
, get_extent
, &em_cached
,
4194 &bio
, 0, &bio_flags
, &prev_em_start
);
4198 __extent_readpages(tree
, pagepool
, nr
, get_extent
, &em_cached
,
4199 &bio
, 0, &bio_flags
, &prev_em_start
);
4202 free_extent_map(em_cached
);
4204 BUG_ON(!list_empty(pages
));
4206 return submit_one_bio(bio
, 0, bio_flags
);
4211 * basic invalidatepage code, this waits on any locked or writeback
4212 * ranges corresponding to the page, and then deletes any extent state
4213 * records from the tree
4215 int extent_invalidatepage(struct extent_io_tree
*tree
,
4216 struct page
*page
, unsigned long offset
)
4218 struct extent_state
*cached_state
= NULL
;
4219 u64 start
= page_offset(page
);
4220 u64 end
= start
+ PAGE_SIZE
- 1;
4221 size_t blocksize
= page
->mapping
->host
->i_sb
->s_blocksize
;
4223 start
+= ALIGN(offset
, blocksize
);
4227 lock_extent_bits(tree
, start
, end
, &cached_state
);
4228 wait_on_page_writeback(page
);
4229 clear_extent_bit(tree
, start
, end
,
4230 EXTENT_LOCKED
| EXTENT_DIRTY
| EXTENT_DELALLOC
|
4231 EXTENT_DO_ACCOUNTING
,
4232 1, 1, &cached_state
, GFP_NOFS
);
4237 * a helper for releasepage, this tests for areas of the page that
4238 * are locked or under IO and drops the related state bits if it is safe
4241 static int try_release_extent_state(struct extent_map_tree
*map
,
4242 struct extent_io_tree
*tree
,
4243 struct page
*page
, gfp_t mask
)
4245 u64 start
= page_offset(page
);
4246 u64 end
= start
+ PAGE_SIZE
- 1;
4249 if (test_range_bit(tree
, start
, end
,
4250 EXTENT_IOBITS
, 0, NULL
))
4254 * at this point we can safely clear everything except the
4255 * locked bit and the nodatasum bit
4257 ret
= clear_extent_bit(tree
, start
, end
,
4258 ~(EXTENT_LOCKED
| EXTENT_NODATASUM
),
4261 /* if clear_extent_bit failed for enomem reasons,
4262 * we can't allow the release to continue.
4273 * a helper for releasepage. As long as there are no locked extents
4274 * in the range corresponding to the page, both state records and extent
4275 * map records are removed
4277 int try_release_extent_mapping(struct extent_map_tree
*map
,
4278 struct extent_io_tree
*tree
, struct page
*page
,
4281 struct extent_map
*em
;
4282 u64 start
= page_offset(page
);
4283 u64 end
= start
+ PAGE_SIZE
- 1;
4285 if (gfpflags_allow_blocking(mask
) &&
4286 page
->mapping
->host
->i_size
> SZ_16M
) {
4288 while (start
<= end
) {
4289 len
= end
- start
+ 1;
4290 write_lock(&map
->lock
);
4291 em
= lookup_extent_mapping(map
, start
, len
);
4293 write_unlock(&map
->lock
);
4296 if (test_bit(EXTENT_FLAG_PINNED
, &em
->flags
) ||
4297 em
->start
!= start
) {
4298 write_unlock(&map
->lock
);
4299 free_extent_map(em
);
4302 if (!test_range_bit(tree
, em
->start
,
4303 extent_map_end(em
) - 1,
4304 EXTENT_LOCKED
| EXTENT_WRITEBACK
,
4306 remove_extent_mapping(map
, em
);
4307 /* once for the rb tree */
4308 free_extent_map(em
);
4310 start
= extent_map_end(em
);
4311 write_unlock(&map
->lock
);
4314 free_extent_map(em
);
4317 return try_release_extent_state(map
, tree
, page
, mask
);
4321 * helper function for fiemap, which doesn't want to see any holes.
4322 * This maps until we find something past 'last'
4324 static struct extent_map
*get_extent_skip_holes(struct inode
*inode
,
4327 get_extent_t
*get_extent
)
4329 u64 sectorsize
= btrfs_inode_sectorsize(inode
);
4330 struct extent_map
*em
;
4337 len
= last
- offset
;
4340 len
= ALIGN(len
, sectorsize
);
4341 em
= get_extent(BTRFS_I(inode
), NULL
, 0, offset
, len
, 0);
4342 if (IS_ERR_OR_NULL(em
))
4345 /* if this isn't a hole return it */
4346 if (!test_bit(EXTENT_FLAG_VACANCY
, &em
->flags
) &&
4347 em
->block_start
!= EXTENT_MAP_HOLE
) {
4351 /* this is a hole, advance to the next extent */
4352 offset
= extent_map_end(em
);
4353 free_extent_map(em
);
4360 int extent_fiemap(struct inode
*inode
, struct fiemap_extent_info
*fieinfo
,
4361 __u64 start
, __u64 len
, get_extent_t
*get_extent
)
4365 u64 max
= start
+ len
;
4369 u64 last_for_get_extent
= 0;
4371 u64 isize
= i_size_read(inode
);
4372 struct btrfs_key found_key
;
4373 struct extent_map
*em
= NULL
;
4374 struct extent_state
*cached_state
= NULL
;
4375 struct btrfs_path
*path
;
4376 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
4385 path
= btrfs_alloc_path();
4388 path
->leave_spinning
= 1;
4390 start
= round_down(start
, btrfs_inode_sectorsize(inode
));
4391 len
= round_up(max
, btrfs_inode_sectorsize(inode
)) - start
;
4394 * lookup the last file extent. We're not using i_size here
4395 * because there might be preallocation past i_size
4397 ret
= btrfs_lookup_file_extent(NULL
, root
, path
,
4398 btrfs_ino(BTRFS_I(inode
)), -1, 0);
4400 btrfs_free_path(path
);
4409 btrfs_item_key_to_cpu(path
->nodes
[0], &found_key
, path
->slots
[0]);
4410 found_type
= found_key
.type
;
4412 /* No extents, but there might be delalloc bits */
4413 if (found_key
.objectid
!= btrfs_ino(BTRFS_I(inode
)) ||
4414 found_type
!= BTRFS_EXTENT_DATA_KEY
) {
4415 /* have to trust i_size as the end */
4417 last_for_get_extent
= isize
;
4420 * remember the start of the last extent. There are a
4421 * bunch of different factors that go into the length of the
4422 * extent, so its much less complex to remember where it started
4424 last
= found_key
.offset
;
4425 last_for_get_extent
= last
+ 1;
4427 btrfs_release_path(path
);
4430 * we might have some extents allocated but more delalloc past those
4431 * extents. so, we trust isize unless the start of the last extent is
4436 last_for_get_extent
= isize
;
4439 lock_extent_bits(&BTRFS_I(inode
)->io_tree
, start
, start
+ len
- 1,
4442 em
= get_extent_skip_holes(inode
, start
, last_for_get_extent
,
4452 u64 offset_in_extent
= 0;
4454 /* break if the extent we found is outside the range */
4455 if (em
->start
>= max
|| extent_map_end(em
) < off
)
4459 * get_extent may return an extent that starts before our
4460 * requested range. We have to make sure the ranges
4461 * we return to fiemap always move forward and don't
4462 * overlap, so adjust the offsets here
4464 em_start
= max(em
->start
, off
);
4467 * record the offset from the start of the extent
4468 * for adjusting the disk offset below. Only do this if the
4469 * extent isn't compressed since our in ram offset may be past
4470 * what we have actually allocated on disk.
4472 if (!test_bit(EXTENT_FLAG_COMPRESSED
, &em
->flags
))
4473 offset_in_extent
= em_start
- em
->start
;
4474 em_end
= extent_map_end(em
);
4475 em_len
= em_end
- em_start
;
4480 * bump off for our next call to get_extent
4482 off
= extent_map_end(em
);
4486 if (em
->block_start
== EXTENT_MAP_LAST_BYTE
) {
4488 flags
|= FIEMAP_EXTENT_LAST
;
4489 } else if (em
->block_start
== EXTENT_MAP_INLINE
) {
4490 flags
|= (FIEMAP_EXTENT_DATA_INLINE
|
4491 FIEMAP_EXTENT_NOT_ALIGNED
);
4492 } else if (em
->block_start
== EXTENT_MAP_DELALLOC
) {
4493 flags
|= (FIEMAP_EXTENT_DELALLOC
|
4494 FIEMAP_EXTENT_UNKNOWN
);
4495 } else if (fieinfo
->fi_extents_max
) {
4496 struct btrfs_trans_handle
*trans
;
4498 u64 bytenr
= em
->block_start
-
4499 (em
->start
- em
->orig_start
);
4501 disko
= em
->block_start
+ offset_in_extent
;
4504 * We need a trans handle to get delayed refs
4506 trans
= btrfs_join_transaction(root
);
4508 * It's OK if we can't start a trans we can still check
4515 * As btrfs supports shared space, this information
4516 * can be exported to userspace tools via
4517 * flag FIEMAP_EXTENT_SHARED. If fi_extents_max == 0
4518 * then we're just getting a count and we can skip the
4521 ret
= btrfs_check_shared(trans
, root
->fs_info
,
4523 btrfs_ino(BTRFS_I(inode
)), bytenr
);
4525 btrfs_end_transaction(trans
);
4529 flags
|= FIEMAP_EXTENT_SHARED
;
4532 if (test_bit(EXTENT_FLAG_COMPRESSED
, &em
->flags
))
4533 flags
|= FIEMAP_EXTENT_ENCODED
;
4534 if (test_bit(EXTENT_FLAG_PREALLOC
, &em
->flags
))
4535 flags
|= FIEMAP_EXTENT_UNWRITTEN
;
4537 free_extent_map(em
);
4539 if ((em_start
>= last
) || em_len
== (u64
)-1 ||
4540 (last
== (u64
)-1 && isize
<= em_end
)) {
4541 flags
|= FIEMAP_EXTENT_LAST
;
4545 /* now scan forward to see if this is really the last extent. */
4546 em
= get_extent_skip_holes(inode
, off
, last_for_get_extent
,
4553 flags
|= FIEMAP_EXTENT_LAST
;
4556 ret
= fiemap_fill_next_extent(fieinfo
, em_start
, disko
,
4565 free_extent_map(em
);
4567 btrfs_free_path(path
);
4568 unlock_extent_cached(&BTRFS_I(inode
)->io_tree
, start
, start
+ len
- 1,
4569 &cached_state
, GFP_NOFS
);
4573 static void __free_extent_buffer(struct extent_buffer
*eb
)
4575 btrfs_leak_debug_del(&eb
->leak_list
);
4576 kmem_cache_free(extent_buffer_cache
, eb
);
4579 int extent_buffer_under_io(struct extent_buffer
*eb
)
4581 return (atomic_read(&eb
->io_pages
) ||
4582 test_bit(EXTENT_BUFFER_WRITEBACK
, &eb
->bflags
) ||
4583 test_bit(EXTENT_BUFFER_DIRTY
, &eb
->bflags
));
4587 * Helper for releasing extent buffer page.
4589 static void btrfs_release_extent_buffer_page(struct extent_buffer
*eb
)
4591 unsigned long index
;
4593 int mapped
= !test_bit(EXTENT_BUFFER_DUMMY
, &eb
->bflags
);
4595 BUG_ON(extent_buffer_under_io(eb
));
4597 index
= num_extent_pages(eb
->start
, eb
->len
);
4603 page
= eb
->pages
[index
];
4607 spin_lock(&page
->mapping
->private_lock
);
4609 * We do this since we'll remove the pages after we've
4610 * removed the eb from the radix tree, so we could race
4611 * and have this page now attached to the new eb. So
4612 * only clear page_private if it's still connected to
4615 if (PagePrivate(page
) &&
4616 page
->private == (unsigned long)eb
) {
4617 BUG_ON(test_bit(EXTENT_BUFFER_DIRTY
, &eb
->bflags
));
4618 BUG_ON(PageDirty(page
));
4619 BUG_ON(PageWriteback(page
));
4621 * We need to make sure we haven't be attached
4624 ClearPagePrivate(page
);
4625 set_page_private(page
, 0);
4626 /* One for the page private */
4631 spin_unlock(&page
->mapping
->private_lock
);
4633 /* One for when we allocated the page */
4635 } while (index
!= 0);
4639 * Helper for releasing the extent buffer.
4641 static inline void btrfs_release_extent_buffer(struct extent_buffer
*eb
)
4643 btrfs_release_extent_buffer_page(eb
);
4644 __free_extent_buffer(eb
);
4647 static struct extent_buffer
*
4648 __alloc_extent_buffer(struct btrfs_fs_info
*fs_info
, u64 start
,
4651 struct extent_buffer
*eb
= NULL
;
4653 eb
= kmem_cache_zalloc(extent_buffer_cache
, GFP_NOFS
|__GFP_NOFAIL
);
4656 eb
->fs_info
= fs_info
;
4658 rwlock_init(&eb
->lock
);
4659 atomic_set(&eb
->write_locks
, 0);
4660 atomic_set(&eb
->read_locks
, 0);
4661 atomic_set(&eb
->blocking_readers
, 0);
4662 atomic_set(&eb
->blocking_writers
, 0);
4663 atomic_set(&eb
->spinning_readers
, 0);
4664 atomic_set(&eb
->spinning_writers
, 0);
4665 eb
->lock_nested
= 0;
4666 init_waitqueue_head(&eb
->write_lock_wq
);
4667 init_waitqueue_head(&eb
->read_lock_wq
);
4669 btrfs_leak_debug_add(&eb
->leak_list
, &buffers
);
4671 spin_lock_init(&eb
->refs_lock
);
4672 atomic_set(&eb
->refs
, 1);
4673 atomic_set(&eb
->io_pages
, 0);
4676 * Sanity checks, currently the maximum is 64k covered by 16x 4k pages
4678 BUILD_BUG_ON(BTRFS_MAX_METADATA_BLOCKSIZE
4679 > MAX_INLINE_EXTENT_BUFFER_SIZE
);
4680 BUG_ON(len
> MAX_INLINE_EXTENT_BUFFER_SIZE
);
4685 struct extent_buffer
*btrfs_clone_extent_buffer(struct extent_buffer
*src
)
4689 struct extent_buffer
*new;
4690 unsigned long num_pages
= num_extent_pages(src
->start
, src
->len
);
4692 new = __alloc_extent_buffer(src
->fs_info
, src
->start
, src
->len
);
4696 for (i
= 0; i
< num_pages
; i
++) {
4697 p
= alloc_page(GFP_NOFS
);
4699 btrfs_release_extent_buffer(new);
4702 attach_extent_buffer_page(new, p
);
4703 WARN_ON(PageDirty(p
));
4706 copy_page(page_address(p
), page_address(src
->pages
[i
]));
4709 set_bit(EXTENT_BUFFER_UPTODATE
, &new->bflags
);
4710 set_bit(EXTENT_BUFFER_DUMMY
, &new->bflags
);
4715 struct extent_buffer
*__alloc_dummy_extent_buffer(struct btrfs_fs_info
*fs_info
,
4716 u64 start
, unsigned long len
)
4718 struct extent_buffer
*eb
;
4719 unsigned long num_pages
;
4722 num_pages
= num_extent_pages(start
, len
);
4724 eb
= __alloc_extent_buffer(fs_info
, start
, len
);
4728 for (i
= 0; i
< num_pages
; i
++) {
4729 eb
->pages
[i
] = alloc_page(GFP_NOFS
);
4733 set_extent_buffer_uptodate(eb
);
4734 btrfs_set_header_nritems(eb
, 0);
4735 set_bit(EXTENT_BUFFER_DUMMY
, &eb
->bflags
);
4740 __free_page(eb
->pages
[i
- 1]);
4741 __free_extent_buffer(eb
);
4745 struct extent_buffer
*alloc_dummy_extent_buffer(struct btrfs_fs_info
*fs_info
,
4748 return __alloc_dummy_extent_buffer(fs_info
, start
, fs_info
->nodesize
);
4751 static void check_buffer_tree_ref(struct extent_buffer
*eb
)
4754 /* the ref bit is tricky. We have to make sure it is set
4755 * if we have the buffer dirty. Otherwise the
4756 * code to free a buffer can end up dropping a dirty
4759 * Once the ref bit is set, it won't go away while the
4760 * buffer is dirty or in writeback, and it also won't
4761 * go away while we have the reference count on the
4764 * We can't just set the ref bit without bumping the
4765 * ref on the eb because free_extent_buffer might
4766 * see the ref bit and try to clear it. If this happens
4767 * free_extent_buffer might end up dropping our original
4768 * ref by mistake and freeing the page before we are able
4769 * to add one more ref.
4771 * So bump the ref count first, then set the bit. If someone
4772 * beat us to it, drop the ref we added.
4774 refs
= atomic_read(&eb
->refs
);
4775 if (refs
>= 2 && test_bit(EXTENT_BUFFER_TREE_REF
, &eb
->bflags
))
4778 spin_lock(&eb
->refs_lock
);
4779 if (!test_and_set_bit(EXTENT_BUFFER_TREE_REF
, &eb
->bflags
))
4780 atomic_inc(&eb
->refs
);
4781 spin_unlock(&eb
->refs_lock
);
4784 static void mark_extent_buffer_accessed(struct extent_buffer
*eb
,
4785 struct page
*accessed
)
4787 unsigned long num_pages
, i
;
4789 check_buffer_tree_ref(eb
);
4791 num_pages
= num_extent_pages(eb
->start
, eb
->len
);
4792 for (i
= 0; i
< num_pages
; i
++) {
4793 struct page
*p
= eb
->pages
[i
];
4796 mark_page_accessed(p
);
4800 struct extent_buffer
*find_extent_buffer(struct btrfs_fs_info
*fs_info
,
4803 struct extent_buffer
*eb
;
4806 eb
= radix_tree_lookup(&fs_info
->buffer_radix
,
4807 start
>> PAGE_SHIFT
);
4808 if (eb
&& atomic_inc_not_zero(&eb
->refs
)) {
4811 * Lock our eb's refs_lock to avoid races with
4812 * free_extent_buffer. When we get our eb it might be flagged
4813 * with EXTENT_BUFFER_STALE and another task running
4814 * free_extent_buffer might have seen that flag set,
4815 * eb->refs == 2, that the buffer isn't under IO (dirty and
4816 * writeback flags not set) and it's still in the tree (flag
4817 * EXTENT_BUFFER_TREE_REF set), therefore being in the process
4818 * of decrementing the extent buffer's reference count twice.
4819 * So here we could race and increment the eb's reference count,
4820 * clear its stale flag, mark it as dirty and drop our reference
4821 * before the other task finishes executing free_extent_buffer,
4822 * which would later result in an attempt to free an extent
4823 * buffer that is dirty.
4825 if (test_bit(EXTENT_BUFFER_STALE
, &eb
->bflags
)) {
4826 spin_lock(&eb
->refs_lock
);
4827 spin_unlock(&eb
->refs_lock
);
4829 mark_extent_buffer_accessed(eb
, NULL
);
4837 #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
4838 struct extent_buffer
*alloc_test_extent_buffer(struct btrfs_fs_info
*fs_info
,
4841 struct extent_buffer
*eb
, *exists
= NULL
;
4844 eb
= find_extent_buffer(fs_info
, start
);
4847 eb
= alloc_dummy_extent_buffer(fs_info
, start
);
4850 eb
->fs_info
= fs_info
;
4852 ret
= radix_tree_preload(GFP_NOFS
);
4855 spin_lock(&fs_info
->buffer_lock
);
4856 ret
= radix_tree_insert(&fs_info
->buffer_radix
,
4857 start
>> PAGE_SHIFT
, eb
);
4858 spin_unlock(&fs_info
->buffer_lock
);
4859 radix_tree_preload_end();
4860 if (ret
== -EEXIST
) {
4861 exists
= find_extent_buffer(fs_info
, start
);
4867 check_buffer_tree_ref(eb
);
4868 set_bit(EXTENT_BUFFER_IN_TREE
, &eb
->bflags
);
4871 * We will free dummy extent buffer's if they come into
4872 * free_extent_buffer with a ref count of 2, but if we are using this we
4873 * want the buffers to stay in memory until we're done with them, so
4874 * bump the ref count again.
4876 atomic_inc(&eb
->refs
);
4879 btrfs_release_extent_buffer(eb
);
4884 struct extent_buffer
*alloc_extent_buffer(struct btrfs_fs_info
*fs_info
,
4887 unsigned long len
= fs_info
->nodesize
;
4888 unsigned long num_pages
= num_extent_pages(start
, len
);
4890 unsigned long index
= start
>> PAGE_SHIFT
;
4891 struct extent_buffer
*eb
;
4892 struct extent_buffer
*exists
= NULL
;
4894 struct address_space
*mapping
= fs_info
->btree_inode
->i_mapping
;
4898 if (!IS_ALIGNED(start
, fs_info
->sectorsize
)) {
4899 btrfs_err(fs_info
, "bad tree block start %llu", start
);
4900 return ERR_PTR(-EINVAL
);
4903 eb
= find_extent_buffer(fs_info
, start
);
4907 eb
= __alloc_extent_buffer(fs_info
, start
, len
);
4909 return ERR_PTR(-ENOMEM
);
4911 for (i
= 0; i
< num_pages
; i
++, index
++) {
4912 p
= find_or_create_page(mapping
, index
, GFP_NOFS
|__GFP_NOFAIL
);
4914 exists
= ERR_PTR(-ENOMEM
);
4918 spin_lock(&mapping
->private_lock
);
4919 if (PagePrivate(p
)) {
4921 * We could have already allocated an eb for this page
4922 * and attached one so lets see if we can get a ref on
4923 * the existing eb, and if we can we know it's good and
4924 * we can just return that one, else we know we can just
4925 * overwrite page->private.
4927 exists
= (struct extent_buffer
*)p
->private;
4928 if (atomic_inc_not_zero(&exists
->refs
)) {
4929 spin_unlock(&mapping
->private_lock
);
4932 mark_extent_buffer_accessed(exists
, p
);
4938 * Do this so attach doesn't complain and we need to
4939 * drop the ref the old guy had.
4941 ClearPagePrivate(p
);
4942 WARN_ON(PageDirty(p
));
4945 attach_extent_buffer_page(eb
, p
);
4946 spin_unlock(&mapping
->private_lock
);
4947 WARN_ON(PageDirty(p
));
4949 if (!PageUptodate(p
))
4953 * see below about how we avoid a nasty race with release page
4954 * and why we unlock later
4958 set_bit(EXTENT_BUFFER_UPTODATE
, &eb
->bflags
);
4960 ret
= radix_tree_preload(GFP_NOFS
);
4962 exists
= ERR_PTR(ret
);
4966 spin_lock(&fs_info
->buffer_lock
);
4967 ret
= radix_tree_insert(&fs_info
->buffer_radix
,
4968 start
>> PAGE_SHIFT
, eb
);
4969 spin_unlock(&fs_info
->buffer_lock
);
4970 radix_tree_preload_end();
4971 if (ret
== -EEXIST
) {
4972 exists
= find_extent_buffer(fs_info
, start
);
4978 /* add one reference for the tree */
4979 check_buffer_tree_ref(eb
);
4980 set_bit(EXTENT_BUFFER_IN_TREE
, &eb
->bflags
);
4983 * there is a race where release page may have
4984 * tried to find this extent buffer in the radix
4985 * but failed. It will tell the VM it is safe to
4986 * reclaim the, and it will clear the page private bit.
4987 * We must make sure to set the page private bit properly
4988 * after the extent buffer is in the radix tree so
4989 * it doesn't get lost
4991 SetPageChecked(eb
->pages
[0]);
4992 for (i
= 1; i
< num_pages
; i
++) {
4994 ClearPageChecked(p
);
4997 unlock_page(eb
->pages
[0]);
5001 WARN_ON(!atomic_dec_and_test(&eb
->refs
));
5002 for (i
= 0; i
< num_pages
; i
++) {
5004 unlock_page(eb
->pages
[i
]);
5007 btrfs_release_extent_buffer(eb
);
5011 static inline void btrfs_release_extent_buffer_rcu(struct rcu_head
*head
)
5013 struct extent_buffer
*eb
=
5014 container_of(head
, struct extent_buffer
, rcu_head
);
5016 __free_extent_buffer(eb
);
5019 /* Expects to have eb->eb_lock already held */
5020 static int release_extent_buffer(struct extent_buffer
*eb
)
5022 WARN_ON(atomic_read(&eb
->refs
) == 0);
5023 if (atomic_dec_and_test(&eb
->refs
)) {
5024 if (test_and_clear_bit(EXTENT_BUFFER_IN_TREE
, &eb
->bflags
)) {
5025 struct btrfs_fs_info
*fs_info
= eb
->fs_info
;
5027 spin_unlock(&eb
->refs_lock
);
5029 spin_lock(&fs_info
->buffer_lock
);
5030 radix_tree_delete(&fs_info
->buffer_radix
,
5031 eb
->start
>> PAGE_SHIFT
);
5032 spin_unlock(&fs_info
->buffer_lock
);
5034 spin_unlock(&eb
->refs_lock
);
5037 /* Should be safe to release our pages at this point */
5038 btrfs_release_extent_buffer_page(eb
);
5039 #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
5040 if (unlikely(test_bit(EXTENT_BUFFER_DUMMY
, &eb
->bflags
))) {
5041 __free_extent_buffer(eb
);
5045 call_rcu(&eb
->rcu_head
, btrfs_release_extent_buffer_rcu
);
5048 spin_unlock(&eb
->refs_lock
);
5053 void free_extent_buffer(struct extent_buffer
*eb
)
5061 refs
= atomic_read(&eb
->refs
);
5064 old
= atomic_cmpxchg(&eb
->refs
, refs
, refs
- 1);
5069 spin_lock(&eb
->refs_lock
);
5070 if (atomic_read(&eb
->refs
) == 2 &&
5071 test_bit(EXTENT_BUFFER_DUMMY
, &eb
->bflags
))
5072 atomic_dec(&eb
->refs
);
5074 if (atomic_read(&eb
->refs
) == 2 &&
5075 test_bit(EXTENT_BUFFER_STALE
, &eb
->bflags
) &&
5076 !extent_buffer_under_io(eb
) &&
5077 test_and_clear_bit(EXTENT_BUFFER_TREE_REF
, &eb
->bflags
))
5078 atomic_dec(&eb
->refs
);
5081 * I know this is terrible, but it's temporary until we stop tracking
5082 * the uptodate bits and such for the extent buffers.
5084 release_extent_buffer(eb
);
5087 void free_extent_buffer_stale(struct extent_buffer
*eb
)
5092 spin_lock(&eb
->refs_lock
);
5093 set_bit(EXTENT_BUFFER_STALE
, &eb
->bflags
);
5095 if (atomic_read(&eb
->refs
) == 2 && !extent_buffer_under_io(eb
) &&
5096 test_and_clear_bit(EXTENT_BUFFER_TREE_REF
, &eb
->bflags
))
5097 atomic_dec(&eb
->refs
);
5098 release_extent_buffer(eb
);
5101 void clear_extent_buffer_dirty(struct extent_buffer
*eb
)
5104 unsigned long num_pages
;
5107 num_pages
= num_extent_pages(eb
->start
, eb
->len
);
5109 for (i
= 0; i
< num_pages
; i
++) {
5110 page
= eb
->pages
[i
];
5111 if (!PageDirty(page
))
5115 WARN_ON(!PagePrivate(page
));
5117 clear_page_dirty_for_io(page
);
5118 spin_lock_irq(&page
->mapping
->tree_lock
);
5119 if (!PageDirty(page
)) {
5120 radix_tree_tag_clear(&page
->mapping
->page_tree
,
5122 PAGECACHE_TAG_DIRTY
);
5124 spin_unlock_irq(&page
->mapping
->tree_lock
);
5125 ClearPageError(page
);
5128 WARN_ON(atomic_read(&eb
->refs
) == 0);
5131 int set_extent_buffer_dirty(struct extent_buffer
*eb
)
5134 unsigned long num_pages
;
5137 check_buffer_tree_ref(eb
);
5139 was_dirty
= test_and_set_bit(EXTENT_BUFFER_DIRTY
, &eb
->bflags
);
5141 num_pages
= num_extent_pages(eb
->start
, eb
->len
);
5142 WARN_ON(atomic_read(&eb
->refs
) == 0);
5143 WARN_ON(!test_bit(EXTENT_BUFFER_TREE_REF
, &eb
->bflags
));
5145 for (i
= 0; i
< num_pages
; i
++)
5146 set_page_dirty(eb
->pages
[i
]);
5150 void clear_extent_buffer_uptodate(struct extent_buffer
*eb
)
5154 unsigned long num_pages
;
5156 clear_bit(EXTENT_BUFFER_UPTODATE
, &eb
->bflags
);
5157 num_pages
= num_extent_pages(eb
->start
, eb
->len
);
5158 for (i
= 0; i
< num_pages
; i
++) {
5159 page
= eb
->pages
[i
];
5161 ClearPageUptodate(page
);
5165 void set_extent_buffer_uptodate(struct extent_buffer
*eb
)
5169 unsigned long num_pages
;
5171 set_bit(EXTENT_BUFFER_UPTODATE
, &eb
->bflags
);
5172 num_pages
= num_extent_pages(eb
->start
, eb
->len
);
5173 for (i
= 0; i
< num_pages
; i
++) {
5174 page
= eb
->pages
[i
];
5175 SetPageUptodate(page
);
5179 int extent_buffer_uptodate(struct extent_buffer
*eb
)
5181 return test_bit(EXTENT_BUFFER_UPTODATE
, &eb
->bflags
);
5184 int read_extent_buffer_pages(struct extent_io_tree
*tree
,
5185 struct extent_buffer
*eb
, int wait
,
5186 get_extent_t
*get_extent
, int mirror_num
)
5192 int locked_pages
= 0;
5193 int all_uptodate
= 1;
5194 unsigned long num_pages
;
5195 unsigned long num_reads
= 0;
5196 struct bio
*bio
= NULL
;
5197 unsigned long bio_flags
= 0;
5199 if (test_bit(EXTENT_BUFFER_UPTODATE
, &eb
->bflags
))
5202 num_pages
= num_extent_pages(eb
->start
, eb
->len
);
5203 for (i
= 0; i
< num_pages
; i
++) {
5204 page
= eb
->pages
[i
];
5205 if (wait
== WAIT_NONE
) {
5206 if (!trylock_page(page
))
5214 * We need to firstly lock all pages to make sure that
5215 * the uptodate bit of our pages won't be affected by
5216 * clear_extent_buffer_uptodate().
5218 for (i
= 0; i
< num_pages
; i
++) {
5219 page
= eb
->pages
[i
];
5220 if (!PageUptodate(page
)) {
5227 set_bit(EXTENT_BUFFER_UPTODATE
, &eb
->bflags
);
5231 clear_bit(EXTENT_BUFFER_READ_ERR
, &eb
->bflags
);
5232 eb
->read_mirror
= 0;
5233 atomic_set(&eb
->io_pages
, num_reads
);
5234 for (i
= 0; i
< num_pages
; i
++) {
5235 page
= eb
->pages
[i
];
5237 if (!PageUptodate(page
)) {
5239 atomic_dec(&eb
->io_pages
);
5244 ClearPageError(page
);
5245 err
= __extent_read_full_page(tree
, page
,
5247 mirror_num
, &bio_flags
,
5252 * We use &bio in above __extent_read_full_page,
5253 * so we ensure that if it returns error, the
5254 * current page fails to add itself to bio and
5255 * it's been unlocked.
5257 * We must dec io_pages by ourselves.
5259 atomic_dec(&eb
->io_pages
);
5267 err
= submit_one_bio(bio
, mirror_num
, bio_flags
);
5272 if (ret
|| wait
!= WAIT_COMPLETE
)
5275 for (i
= 0; i
< num_pages
; i
++) {
5276 page
= eb
->pages
[i
];
5277 wait_on_page_locked(page
);
5278 if (!PageUptodate(page
))
5285 while (locked_pages
> 0) {
5287 page
= eb
->pages
[locked_pages
];
5293 void read_extent_buffer(struct extent_buffer
*eb
, void *dstv
,
5294 unsigned long start
,
5301 char *dst
= (char *)dstv
;
5302 size_t start_offset
= eb
->start
& ((u64
)PAGE_SIZE
- 1);
5303 unsigned long i
= (start_offset
+ start
) >> PAGE_SHIFT
;
5305 WARN_ON(start
> eb
->len
);
5306 WARN_ON(start
+ len
> eb
->start
+ eb
->len
);
5308 offset
= (start_offset
+ start
) & (PAGE_SIZE
- 1);
5311 page
= eb
->pages
[i
];
5313 cur
= min(len
, (PAGE_SIZE
- offset
));
5314 kaddr
= page_address(page
);
5315 memcpy(dst
, kaddr
+ offset
, cur
);
5324 int read_extent_buffer_to_user(struct extent_buffer
*eb
, void __user
*dstv
,
5325 unsigned long start
,
5332 char __user
*dst
= (char __user
*)dstv
;
5333 size_t start_offset
= eb
->start
& ((u64
)PAGE_SIZE
- 1);
5334 unsigned long i
= (start_offset
+ start
) >> PAGE_SHIFT
;
5337 WARN_ON(start
> eb
->len
);
5338 WARN_ON(start
+ len
> eb
->start
+ eb
->len
);
5340 offset
= (start_offset
+ start
) & (PAGE_SIZE
- 1);
5343 page
= eb
->pages
[i
];
5345 cur
= min(len
, (PAGE_SIZE
- offset
));
5346 kaddr
= page_address(page
);
5347 if (copy_to_user(dst
, kaddr
+ offset
, cur
)) {
5362 * return 0 if the item is found within a page.
5363 * return 1 if the item spans two pages.
5364 * return -EINVAL otherwise.
5366 int map_private_extent_buffer(struct extent_buffer
*eb
, unsigned long start
,
5367 unsigned long min_len
, char **map
,
5368 unsigned long *map_start
,
5369 unsigned long *map_len
)
5371 size_t offset
= start
& (PAGE_SIZE
- 1);
5374 size_t start_offset
= eb
->start
& ((u64
)PAGE_SIZE
- 1);
5375 unsigned long i
= (start_offset
+ start
) >> PAGE_SHIFT
;
5376 unsigned long end_i
= (start_offset
+ start
+ min_len
- 1) >>
5383 offset
= start_offset
;
5387 *map_start
= ((u64
)i
<< PAGE_SHIFT
) - start_offset
;
5390 if (start
+ min_len
> eb
->len
) {
5391 WARN(1, KERN_ERR
"btrfs bad mapping eb start %llu len %lu, wanted %lu %lu\n",
5392 eb
->start
, eb
->len
, start
, min_len
);
5397 kaddr
= page_address(p
);
5398 *map
= kaddr
+ offset
;
5399 *map_len
= PAGE_SIZE
- offset
;
5403 int memcmp_extent_buffer(struct extent_buffer
*eb
, const void *ptrv
,
5404 unsigned long start
,
5411 char *ptr
= (char *)ptrv
;
5412 size_t start_offset
= eb
->start
& ((u64
)PAGE_SIZE
- 1);
5413 unsigned long i
= (start_offset
+ start
) >> PAGE_SHIFT
;
5416 WARN_ON(start
> eb
->len
);
5417 WARN_ON(start
+ len
> eb
->start
+ eb
->len
);
5419 offset
= (start_offset
+ start
) & (PAGE_SIZE
- 1);
5422 page
= eb
->pages
[i
];
5424 cur
= min(len
, (PAGE_SIZE
- offset
));
5426 kaddr
= page_address(page
);
5427 ret
= memcmp(ptr
, kaddr
+ offset
, cur
);
5439 void write_extent_buffer_chunk_tree_uuid(struct extent_buffer
*eb
,
5444 WARN_ON(!PageUptodate(eb
->pages
[0]));
5445 kaddr
= page_address(eb
->pages
[0]);
5446 memcpy(kaddr
+ offsetof(struct btrfs_header
, chunk_tree_uuid
), srcv
,
5450 void write_extent_buffer_fsid(struct extent_buffer
*eb
, const void *srcv
)
5454 WARN_ON(!PageUptodate(eb
->pages
[0]));
5455 kaddr
= page_address(eb
->pages
[0]);
5456 memcpy(kaddr
+ offsetof(struct btrfs_header
, fsid
), srcv
,
5460 void write_extent_buffer(struct extent_buffer
*eb
, const void *srcv
,
5461 unsigned long start
, unsigned long len
)
5467 char *src
= (char *)srcv
;
5468 size_t start_offset
= eb
->start
& ((u64
)PAGE_SIZE
- 1);
5469 unsigned long i
= (start_offset
+ start
) >> PAGE_SHIFT
;
5471 WARN_ON(start
> eb
->len
);
5472 WARN_ON(start
+ len
> eb
->start
+ eb
->len
);
5474 offset
= (start_offset
+ start
) & (PAGE_SIZE
- 1);
5477 page
= eb
->pages
[i
];
5478 WARN_ON(!PageUptodate(page
));
5480 cur
= min(len
, PAGE_SIZE
- offset
);
5481 kaddr
= page_address(page
);
5482 memcpy(kaddr
+ offset
, src
, cur
);
5491 void memzero_extent_buffer(struct extent_buffer
*eb
, unsigned long start
,
5498 size_t start_offset
= eb
->start
& ((u64
)PAGE_SIZE
- 1);
5499 unsigned long i
= (start_offset
+ start
) >> PAGE_SHIFT
;
5501 WARN_ON(start
> eb
->len
);
5502 WARN_ON(start
+ len
> eb
->start
+ eb
->len
);
5504 offset
= (start_offset
+ start
) & (PAGE_SIZE
- 1);
5507 page
= eb
->pages
[i
];
5508 WARN_ON(!PageUptodate(page
));
5510 cur
= min(len
, PAGE_SIZE
- offset
);
5511 kaddr
= page_address(page
);
5512 memset(kaddr
+ offset
, 0, cur
);
5520 void copy_extent_buffer_full(struct extent_buffer
*dst
,
5521 struct extent_buffer
*src
)
5526 ASSERT(dst
->len
== src
->len
);
5528 num_pages
= num_extent_pages(dst
->start
, dst
->len
);
5529 for (i
= 0; i
< num_pages
; i
++)
5530 copy_page(page_address(dst
->pages
[i
]),
5531 page_address(src
->pages
[i
]));
5534 void copy_extent_buffer(struct extent_buffer
*dst
, struct extent_buffer
*src
,
5535 unsigned long dst_offset
, unsigned long src_offset
,
5538 u64 dst_len
= dst
->len
;
5543 size_t start_offset
= dst
->start
& ((u64
)PAGE_SIZE
- 1);
5544 unsigned long i
= (start_offset
+ dst_offset
) >> PAGE_SHIFT
;
5546 WARN_ON(src
->len
!= dst_len
);
5548 offset
= (start_offset
+ dst_offset
) &
5552 page
= dst
->pages
[i
];
5553 WARN_ON(!PageUptodate(page
));
5555 cur
= min(len
, (unsigned long)(PAGE_SIZE
- offset
));
5557 kaddr
= page_address(page
);
5558 read_extent_buffer(src
, kaddr
+ offset
, src_offset
, cur
);
5567 void le_bitmap_set(u8
*map
, unsigned int start
, int len
)
5569 u8
*p
= map
+ BIT_BYTE(start
);
5570 const unsigned int size
= start
+ len
;
5571 int bits_to_set
= BITS_PER_BYTE
- (start
% BITS_PER_BYTE
);
5572 u8 mask_to_set
= BITMAP_FIRST_BYTE_MASK(start
);
5574 while (len
- bits_to_set
>= 0) {
5577 bits_to_set
= BITS_PER_BYTE
;
5582 mask_to_set
&= BITMAP_LAST_BYTE_MASK(size
);
5587 void le_bitmap_clear(u8
*map
, unsigned int start
, int len
)
5589 u8
*p
= map
+ BIT_BYTE(start
);
5590 const unsigned int size
= start
+ len
;
5591 int bits_to_clear
= BITS_PER_BYTE
- (start
% BITS_PER_BYTE
);
5592 u8 mask_to_clear
= BITMAP_FIRST_BYTE_MASK(start
);
5594 while (len
- bits_to_clear
>= 0) {
5595 *p
&= ~mask_to_clear
;
5596 len
-= bits_to_clear
;
5597 bits_to_clear
= BITS_PER_BYTE
;
5602 mask_to_clear
&= BITMAP_LAST_BYTE_MASK(size
);
5603 *p
&= ~mask_to_clear
;
5608 * eb_bitmap_offset() - calculate the page and offset of the byte containing the
5610 * @eb: the extent buffer
5611 * @start: offset of the bitmap item in the extent buffer
5613 * @page_index: return index of the page in the extent buffer that contains the
5615 * @page_offset: return offset into the page given by page_index
5617 * This helper hides the ugliness of finding the byte in an extent buffer which
5618 * contains a given bit.
5620 static inline void eb_bitmap_offset(struct extent_buffer
*eb
,
5621 unsigned long start
, unsigned long nr
,
5622 unsigned long *page_index
,
5623 size_t *page_offset
)
5625 size_t start_offset
= eb
->start
& ((u64
)PAGE_SIZE
- 1);
5626 size_t byte_offset
= BIT_BYTE(nr
);
5630 * The byte we want is the offset of the extent buffer + the offset of
5631 * the bitmap item in the extent buffer + the offset of the byte in the
5634 offset
= start_offset
+ start
+ byte_offset
;
5636 *page_index
= offset
>> PAGE_SHIFT
;
5637 *page_offset
= offset
& (PAGE_SIZE
- 1);
5641 * extent_buffer_test_bit - determine whether a bit in a bitmap item is set
5642 * @eb: the extent buffer
5643 * @start: offset of the bitmap item in the extent buffer
5644 * @nr: bit number to test
5646 int extent_buffer_test_bit(struct extent_buffer
*eb
, unsigned long start
,
5654 eb_bitmap_offset(eb
, start
, nr
, &i
, &offset
);
5655 page
= eb
->pages
[i
];
5656 WARN_ON(!PageUptodate(page
));
5657 kaddr
= page_address(page
);
5658 return 1U & (kaddr
[offset
] >> (nr
& (BITS_PER_BYTE
- 1)));
5662 * extent_buffer_bitmap_set - set an area of a bitmap
5663 * @eb: the extent buffer
5664 * @start: offset of the bitmap item in the extent buffer
5665 * @pos: bit number of the first bit
5666 * @len: number of bits to set
5668 void extent_buffer_bitmap_set(struct extent_buffer
*eb
, unsigned long start
,
5669 unsigned long pos
, unsigned long len
)
5675 const unsigned int size
= pos
+ len
;
5676 int bits_to_set
= BITS_PER_BYTE
- (pos
% BITS_PER_BYTE
);
5677 u8 mask_to_set
= BITMAP_FIRST_BYTE_MASK(pos
);
5679 eb_bitmap_offset(eb
, start
, pos
, &i
, &offset
);
5680 page
= eb
->pages
[i
];
5681 WARN_ON(!PageUptodate(page
));
5682 kaddr
= page_address(page
);
5684 while (len
>= bits_to_set
) {
5685 kaddr
[offset
] |= mask_to_set
;
5687 bits_to_set
= BITS_PER_BYTE
;
5689 if (++offset
>= PAGE_SIZE
&& len
> 0) {
5691 page
= eb
->pages
[++i
];
5692 WARN_ON(!PageUptodate(page
));
5693 kaddr
= page_address(page
);
5697 mask_to_set
&= BITMAP_LAST_BYTE_MASK(size
);
5698 kaddr
[offset
] |= mask_to_set
;
5704 * extent_buffer_bitmap_clear - clear an area of a bitmap
5705 * @eb: the extent buffer
5706 * @start: offset of the bitmap item in the extent buffer
5707 * @pos: bit number of the first bit
5708 * @len: number of bits to clear
5710 void extent_buffer_bitmap_clear(struct extent_buffer
*eb
, unsigned long start
,
5711 unsigned long pos
, unsigned long len
)
5717 const unsigned int size
= pos
+ len
;
5718 int bits_to_clear
= BITS_PER_BYTE
- (pos
% BITS_PER_BYTE
);
5719 u8 mask_to_clear
= BITMAP_FIRST_BYTE_MASK(pos
);
5721 eb_bitmap_offset(eb
, start
, pos
, &i
, &offset
);
5722 page
= eb
->pages
[i
];
5723 WARN_ON(!PageUptodate(page
));
5724 kaddr
= page_address(page
);
5726 while (len
>= bits_to_clear
) {
5727 kaddr
[offset
] &= ~mask_to_clear
;
5728 len
-= bits_to_clear
;
5729 bits_to_clear
= BITS_PER_BYTE
;
5731 if (++offset
>= PAGE_SIZE
&& len
> 0) {
5733 page
= eb
->pages
[++i
];
5734 WARN_ON(!PageUptodate(page
));
5735 kaddr
= page_address(page
);
5739 mask_to_clear
&= BITMAP_LAST_BYTE_MASK(size
);
5740 kaddr
[offset
] &= ~mask_to_clear
;
5744 static inline bool areas_overlap(unsigned long src
, unsigned long dst
, unsigned long len
)
5746 unsigned long distance
= (src
> dst
) ? src
- dst
: dst
- src
;
5747 return distance
< len
;
5750 static void copy_pages(struct page
*dst_page
, struct page
*src_page
,
5751 unsigned long dst_off
, unsigned long src_off
,
5754 char *dst_kaddr
= page_address(dst_page
);
5756 int must_memmove
= 0;
5758 if (dst_page
!= src_page
) {
5759 src_kaddr
= page_address(src_page
);
5761 src_kaddr
= dst_kaddr
;
5762 if (areas_overlap(src_off
, dst_off
, len
))
5767 memmove(dst_kaddr
+ dst_off
, src_kaddr
+ src_off
, len
);
5769 memcpy(dst_kaddr
+ dst_off
, src_kaddr
+ src_off
, len
);
5772 void memcpy_extent_buffer(struct extent_buffer
*dst
, unsigned long dst_offset
,
5773 unsigned long src_offset
, unsigned long len
)
5775 struct btrfs_fs_info
*fs_info
= dst
->fs_info
;
5777 size_t dst_off_in_page
;
5778 size_t src_off_in_page
;
5779 size_t start_offset
= dst
->start
& ((u64
)PAGE_SIZE
- 1);
5780 unsigned long dst_i
;
5781 unsigned long src_i
;
5783 if (src_offset
+ len
> dst
->len
) {
5785 "memmove bogus src_offset %lu move len %lu dst len %lu",
5786 src_offset
, len
, dst
->len
);
5789 if (dst_offset
+ len
> dst
->len
) {
5791 "memmove bogus dst_offset %lu move len %lu dst len %lu",
5792 dst_offset
, len
, dst
->len
);
5797 dst_off_in_page
= (start_offset
+ dst_offset
) &
5799 src_off_in_page
= (start_offset
+ src_offset
) &
5802 dst_i
= (start_offset
+ dst_offset
) >> PAGE_SHIFT
;
5803 src_i
= (start_offset
+ src_offset
) >> PAGE_SHIFT
;
5805 cur
= min(len
, (unsigned long)(PAGE_SIZE
-
5807 cur
= min_t(unsigned long, cur
,
5808 (unsigned long)(PAGE_SIZE
- dst_off_in_page
));
5810 copy_pages(dst
->pages
[dst_i
], dst
->pages
[src_i
],
5811 dst_off_in_page
, src_off_in_page
, cur
);
5819 void memmove_extent_buffer(struct extent_buffer
*dst
, unsigned long dst_offset
,
5820 unsigned long src_offset
, unsigned long len
)
5822 struct btrfs_fs_info
*fs_info
= dst
->fs_info
;
5824 size_t dst_off_in_page
;
5825 size_t src_off_in_page
;
5826 unsigned long dst_end
= dst_offset
+ len
- 1;
5827 unsigned long src_end
= src_offset
+ len
- 1;
5828 size_t start_offset
= dst
->start
& ((u64
)PAGE_SIZE
- 1);
5829 unsigned long dst_i
;
5830 unsigned long src_i
;
5832 if (src_offset
+ len
> dst
->len
) {
5834 "memmove bogus src_offset %lu move len %lu len %lu",
5835 src_offset
, len
, dst
->len
);
5838 if (dst_offset
+ len
> dst
->len
) {
5840 "memmove bogus dst_offset %lu move len %lu len %lu",
5841 dst_offset
, len
, dst
->len
);
5844 if (dst_offset
< src_offset
) {
5845 memcpy_extent_buffer(dst
, dst_offset
, src_offset
, len
);
5849 dst_i
= (start_offset
+ dst_end
) >> PAGE_SHIFT
;
5850 src_i
= (start_offset
+ src_end
) >> PAGE_SHIFT
;
5852 dst_off_in_page
= (start_offset
+ dst_end
) &
5854 src_off_in_page
= (start_offset
+ src_end
) &
5857 cur
= min_t(unsigned long, len
, src_off_in_page
+ 1);
5858 cur
= min(cur
, dst_off_in_page
+ 1);
5859 copy_pages(dst
->pages
[dst_i
], dst
->pages
[src_i
],
5860 dst_off_in_page
- cur
+ 1,
5861 src_off_in_page
- cur
+ 1, cur
);
5869 int try_release_extent_buffer(struct page
*page
)
5871 struct extent_buffer
*eb
;
5874 * We need to make sure nobody is attaching this page to an eb right
5877 spin_lock(&page
->mapping
->private_lock
);
5878 if (!PagePrivate(page
)) {
5879 spin_unlock(&page
->mapping
->private_lock
);
5883 eb
= (struct extent_buffer
*)page
->private;
5887 * This is a little awful but should be ok, we need to make sure that
5888 * the eb doesn't disappear out from under us while we're looking at
5891 spin_lock(&eb
->refs_lock
);
5892 if (atomic_read(&eb
->refs
) != 1 || extent_buffer_under_io(eb
)) {
5893 spin_unlock(&eb
->refs_lock
);
5894 spin_unlock(&page
->mapping
->private_lock
);
5897 spin_unlock(&page
->mapping
->private_lock
);
5900 * If tree ref isn't set then we know the ref on this eb is a real ref,
5901 * so just return, this page will likely be freed soon anyway.
5903 if (!test_and_clear_bit(EXTENT_BUFFER_TREE_REF
, &eb
->bflags
)) {
5904 spin_unlock(&eb
->refs_lock
);
5908 return release_extent_buffer(eb
);