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"
24 static struct kmem_cache
*extent_state_cache
;
25 static struct kmem_cache
*extent_buffer_cache
;
26 static struct bio_set
*btrfs_bioset
;
28 static inline bool extent_state_in_tree(const struct extent_state
*state
)
30 return !RB_EMPTY_NODE(&state
->rb_node
);
33 #ifdef CONFIG_BTRFS_DEBUG
34 static LIST_HEAD(buffers
);
35 static LIST_HEAD(states
);
37 static DEFINE_SPINLOCK(leak_lock
);
40 void btrfs_leak_debug_add(struct list_head
*new, struct list_head
*head
)
44 spin_lock_irqsave(&leak_lock
, flags
);
46 spin_unlock_irqrestore(&leak_lock
, flags
);
50 void btrfs_leak_debug_del(struct list_head
*entry
)
54 spin_lock_irqsave(&leak_lock
, flags
);
56 spin_unlock_irqrestore(&leak_lock
, flags
);
60 void btrfs_leak_debug_check(void)
62 struct extent_state
*state
;
63 struct extent_buffer
*eb
;
65 while (!list_empty(&states
)) {
66 state
= list_entry(states
.next
, struct extent_state
, leak_list
);
67 pr_err("BTRFS: state leak: start %llu end %llu state %u in tree %d refs %d\n",
68 state
->start
, state
->end
, state
->state
,
69 extent_state_in_tree(state
),
70 atomic_read(&state
->refs
));
71 list_del(&state
->leak_list
);
72 kmem_cache_free(extent_state_cache
, state
);
75 while (!list_empty(&buffers
)) {
76 eb
= list_entry(buffers
.next
, struct extent_buffer
, leak_list
);
77 printk(KERN_ERR
"BTRFS: buffer leak start %llu len %lu "
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 printk_ratelimited(KERN_DEBUG
100 "BTRFS: %s: ino %llu isize %llu odd range [%llu,%llu]\n",
101 caller
, btrfs_ino(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 a WRITE_SYNC */
131 unsigned int sync_io
:1;
134 static noinline
void flush_write_bio(void *data
);
135 static inline struct btrfs_fs_info
*
136 tree_fs_info(struct extent_io_tree
*tree
)
140 return btrfs_sb(tree
->mapping
->host
->i_sb
);
143 int __init
extent_io_init(void)
145 extent_state_cache
= kmem_cache_create("btrfs_extent_state",
146 sizeof(struct extent_state
), 0,
147 SLAB_RECLAIM_ACCOUNT
| SLAB_MEM_SPREAD
, NULL
);
148 if (!extent_state_cache
)
151 extent_buffer_cache
= kmem_cache_create("btrfs_extent_buffer",
152 sizeof(struct extent_buffer
), 0,
153 SLAB_RECLAIM_ACCOUNT
| SLAB_MEM_SPREAD
, NULL
);
154 if (!extent_buffer_cache
)
155 goto free_state_cache
;
157 btrfs_bioset
= bioset_create(BIO_POOL_SIZE
,
158 offsetof(struct btrfs_io_bio
, bio
));
160 goto free_buffer_cache
;
162 if (bioset_integrity_create(btrfs_bioset
, BIO_POOL_SIZE
))
168 bioset_free(btrfs_bioset
);
172 kmem_cache_destroy(extent_buffer_cache
);
173 extent_buffer_cache
= NULL
;
176 kmem_cache_destroy(extent_state_cache
);
177 extent_state_cache
= NULL
;
181 void extent_io_exit(void)
183 btrfs_leak_debug_check();
186 * Make sure all delayed rcu free are flushed before we
190 if (extent_state_cache
)
191 kmem_cache_destroy(extent_state_cache
);
192 if (extent_buffer_cache
)
193 kmem_cache_destroy(extent_buffer_cache
);
195 bioset_free(btrfs_bioset
);
198 void extent_io_tree_init(struct extent_io_tree
*tree
,
199 struct address_space
*mapping
)
201 tree
->state
= RB_ROOT
;
203 tree
->dirty_bytes
= 0;
204 spin_lock_init(&tree
->lock
);
205 tree
->mapping
= mapping
;
208 static struct extent_state
*alloc_extent_state(gfp_t mask
)
210 struct extent_state
*state
;
212 state
= kmem_cache_alloc(extent_state_cache
, mask
);
217 RB_CLEAR_NODE(&state
->rb_node
);
218 btrfs_leak_debug_add(&state
->leak_list
, &states
);
219 atomic_set(&state
->refs
, 1);
220 init_waitqueue_head(&state
->wq
);
221 trace_alloc_extent_state(state
, mask
, _RET_IP_
);
225 void free_extent_state(struct extent_state
*state
)
229 if (atomic_dec_and_test(&state
->refs
)) {
230 WARN_ON(extent_state_in_tree(state
));
231 btrfs_leak_debug_del(&state
->leak_list
);
232 trace_free_extent_state(state
, _RET_IP_
);
233 kmem_cache_free(extent_state_cache
, state
);
237 static struct rb_node
*tree_insert(struct rb_root
*root
,
238 struct rb_node
*search_start
,
240 struct rb_node
*node
,
241 struct rb_node
***p_in
,
242 struct rb_node
**parent_in
)
245 struct rb_node
*parent
= NULL
;
246 struct tree_entry
*entry
;
248 if (p_in
&& parent_in
) {
254 p
= search_start
? &search_start
: &root
->rb_node
;
257 entry
= rb_entry(parent
, struct tree_entry
, rb_node
);
259 if (offset
< entry
->start
)
261 else if (offset
> entry
->end
)
268 rb_link_node(node
, parent
, p
);
269 rb_insert_color(node
, root
);
273 static struct rb_node
*__etree_search(struct extent_io_tree
*tree
, u64 offset
,
274 struct rb_node
**prev_ret
,
275 struct rb_node
**next_ret
,
276 struct rb_node
***p_ret
,
277 struct rb_node
**parent_ret
)
279 struct rb_root
*root
= &tree
->state
;
280 struct rb_node
**n
= &root
->rb_node
;
281 struct rb_node
*prev
= NULL
;
282 struct rb_node
*orig_prev
= NULL
;
283 struct tree_entry
*entry
;
284 struct tree_entry
*prev_entry
= NULL
;
288 entry
= rb_entry(prev
, struct tree_entry
, rb_node
);
291 if (offset
< entry
->start
)
293 else if (offset
> entry
->end
)
306 while (prev
&& offset
> prev_entry
->end
) {
307 prev
= rb_next(prev
);
308 prev_entry
= rb_entry(prev
, struct tree_entry
, rb_node
);
315 prev_entry
= rb_entry(prev
, struct tree_entry
, rb_node
);
316 while (prev
&& offset
< prev_entry
->start
) {
317 prev
= rb_prev(prev
);
318 prev_entry
= rb_entry(prev
, struct tree_entry
, rb_node
);
325 static inline struct rb_node
*
326 tree_search_for_insert(struct extent_io_tree
*tree
,
328 struct rb_node
***p_ret
,
329 struct rb_node
**parent_ret
)
331 struct rb_node
*prev
= NULL
;
334 ret
= __etree_search(tree
, offset
, &prev
, NULL
, p_ret
, parent_ret
);
340 static inline struct rb_node
*tree_search(struct extent_io_tree
*tree
,
343 return tree_search_for_insert(tree
, offset
, NULL
, NULL
);
346 static void merge_cb(struct extent_io_tree
*tree
, struct extent_state
*new,
347 struct extent_state
*other
)
349 if (tree
->ops
&& tree
->ops
->merge_extent_hook
)
350 tree
->ops
->merge_extent_hook(tree
->mapping
->host
, new,
355 * utility function to look for merge candidates inside a given range.
356 * Any extents with matching state are merged together into a single
357 * extent in the tree. Extents with EXTENT_IO in their state field
358 * are not merged because the end_io handlers need to be able to do
359 * operations on them without sleeping (or doing allocations/splits).
361 * This should be called with the tree lock held.
363 static void merge_state(struct extent_io_tree
*tree
,
364 struct extent_state
*state
)
366 struct extent_state
*other
;
367 struct rb_node
*other_node
;
369 if (state
->state
& (EXTENT_IOBITS
| EXTENT_BOUNDARY
))
372 other_node
= rb_prev(&state
->rb_node
);
374 other
= rb_entry(other_node
, struct extent_state
, rb_node
);
375 if (other
->end
== state
->start
- 1 &&
376 other
->state
== state
->state
) {
377 merge_cb(tree
, state
, other
);
378 state
->start
= other
->start
;
379 rb_erase(&other
->rb_node
, &tree
->state
);
380 RB_CLEAR_NODE(&other
->rb_node
);
381 free_extent_state(other
);
384 other_node
= rb_next(&state
->rb_node
);
386 other
= rb_entry(other_node
, struct extent_state
, rb_node
);
387 if (other
->start
== state
->end
+ 1 &&
388 other
->state
== state
->state
) {
389 merge_cb(tree
, state
, other
);
390 state
->end
= other
->end
;
391 rb_erase(&other
->rb_node
, &tree
->state
);
392 RB_CLEAR_NODE(&other
->rb_node
);
393 free_extent_state(other
);
398 static void set_state_cb(struct extent_io_tree
*tree
,
399 struct extent_state
*state
, unsigned *bits
)
401 if (tree
->ops
&& tree
->ops
->set_bit_hook
)
402 tree
->ops
->set_bit_hook(tree
->mapping
->host
, state
, bits
);
405 static void clear_state_cb(struct extent_io_tree
*tree
,
406 struct extent_state
*state
, unsigned *bits
)
408 if (tree
->ops
&& tree
->ops
->clear_bit_hook
)
409 tree
->ops
->clear_bit_hook(tree
->mapping
->host
, state
, bits
);
412 static void set_state_bits(struct extent_io_tree
*tree
,
413 struct extent_state
*state
, unsigned *bits
);
416 * insert an extent_state struct into the tree. 'bits' are set on the
417 * struct before it is inserted.
419 * This may return -EEXIST if the extent is already there, in which case the
420 * state struct is freed.
422 * The tree lock is not taken internally. This is a utility function and
423 * probably isn't what you want to call (see set/clear_extent_bit).
425 static int insert_state(struct extent_io_tree
*tree
,
426 struct extent_state
*state
, u64 start
, u64 end
,
428 struct rb_node
**parent
,
431 struct rb_node
*node
;
434 WARN(1, KERN_ERR
"BTRFS: end < start %llu %llu\n",
436 state
->start
= start
;
439 set_state_bits(tree
, state
, bits
);
441 node
= tree_insert(&tree
->state
, NULL
, end
, &state
->rb_node
, p
, parent
);
443 struct extent_state
*found
;
444 found
= rb_entry(node
, struct extent_state
, rb_node
);
445 printk(KERN_ERR
"BTRFS: found node %llu %llu on insert of "
447 found
->start
, found
->end
, start
, end
);
450 merge_state(tree
, state
);
454 static void split_cb(struct extent_io_tree
*tree
, struct extent_state
*orig
,
457 if (tree
->ops
&& tree
->ops
->split_extent_hook
)
458 tree
->ops
->split_extent_hook(tree
->mapping
->host
, orig
, split
);
462 * split a given extent state struct in two, inserting the preallocated
463 * struct 'prealloc' as the newly created second half. 'split' indicates an
464 * offset inside 'orig' where it should be split.
467 * the tree has 'orig' at [orig->start, orig->end]. After calling, there
468 * are two extent state structs in the tree:
469 * prealloc: [orig->start, split - 1]
470 * orig: [ split, orig->end ]
472 * The tree locks are not taken by this function. They need to be held
475 static int split_state(struct extent_io_tree
*tree
, struct extent_state
*orig
,
476 struct extent_state
*prealloc
, u64 split
)
478 struct rb_node
*node
;
480 split_cb(tree
, orig
, split
);
482 prealloc
->start
= orig
->start
;
483 prealloc
->end
= split
- 1;
484 prealloc
->state
= orig
->state
;
487 node
= tree_insert(&tree
->state
, &orig
->rb_node
, prealloc
->end
,
488 &prealloc
->rb_node
, NULL
, NULL
);
490 free_extent_state(prealloc
);
496 static struct extent_state
*next_state(struct extent_state
*state
)
498 struct rb_node
*next
= rb_next(&state
->rb_node
);
500 return rb_entry(next
, struct extent_state
, rb_node
);
506 * utility function to clear some bits in an extent state struct.
507 * it will optionally wake up any one waiting on this state (wake == 1).
509 * If no bits are set on the state struct after clearing things, the
510 * struct is freed and removed from the tree
512 static struct extent_state
*clear_state_bit(struct extent_io_tree
*tree
,
513 struct extent_state
*state
,
514 unsigned *bits
, int wake
)
516 struct extent_state
*next
;
517 unsigned bits_to_clear
= *bits
& ~EXTENT_CTLBITS
;
519 if ((bits_to_clear
& EXTENT_DIRTY
) && (state
->state
& EXTENT_DIRTY
)) {
520 u64 range
= state
->end
- state
->start
+ 1;
521 WARN_ON(range
> tree
->dirty_bytes
);
522 tree
->dirty_bytes
-= range
;
524 clear_state_cb(tree
, state
, bits
);
525 state
->state
&= ~bits_to_clear
;
528 if (state
->state
== 0) {
529 next
= next_state(state
);
530 if (extent_state_in_tree(state
)) {
531 rb_erase(&state
->rb_node
, &tree
->state
);
532 RB_CLEAR_NODE(&state
->rb_node
);
533 free_extent_state(state
);
538 merge_state(tree
, state
);
539 next
= next_state(state
);
544 static struct extent_state
*
545 alloc_extent_state_atomic(struct extent_state
*prealloc
)
548 prealloc
= alloc_extent_state(GFP_ATOMIC
);
553 static void extent_io_tree_panic(struct extent_io_tree
*tree
, int err
)
555 btrfs_panic(tree_fs_info(tree
), err
, "Locking error: "
556 "Extent tree was modified by another "
557 "thread while locked.");
561 * clear some bits on a range in the tree. This may require splitting
562 * or inserting elements in the tree, so the gfp mask is used to
563 * indicate which allocations or sleeping are allowed.
565 * pass 'wake' == 1 to kick any sleepers, and 'delete' == 1 to remove
566 * the given range from the tree regardless of state (ie for truncate).
568 * the range [start, end] is inclusive.
570 * This takes the tree lock, and returns 0 on success and < 0 on error.
572 int clear_extent_bit(struct extent_io_tree
*tree
, u64 start
, u64 end
,
573 unsigned bits
, int wake
, int delete,
574 struct extent_state
**cached_state
,
577 struct extent_state
*state
;
578 struct extent_state
*cached
;
579 struct extent_state
*prealloc
= NULL
;
580 struct rb_node
*node
;
585 btrfs_debug_check_extent_io_range(tree
, start
, end
);
587 if (bits
& EXTENT_DELALLOC
)
588 bits
|= EXTENT_NORESERVE
;
591 bits
|= ~EXTENT_CTLBITS
;
592 bits
|= EXTENT_FIRST_DELALLOC
;
594 if (bits
& (EXTENT_IOBITS
| EXTENT_BOUNDARY
))
597 if (!prealloc
&& (mask
& __GFP_WAIT
)) {
599 * Don't care for allocation failure here because we might end
600 * up not needing the pre-allocated extent state at all, which
601 * is the case if we only have in the tree extent states that
602 * cover our input range and don't cover too any other range.
603 * If we end up needing a new extent state we allocate it later.
605 prealloc
= alloc_extent_state(mask
);
608 spin_lock(&tree
->lock
);
610 cached
= *cached_state
;
613 *cached_state
= NULL
;
617 if (cached
&& extent_state_in_tree(cached
) &&
618 cached
->start
<= start
&& cached
->end
> start
) {
620 atomic_dec(&cached
->refs
);
625 free_extent_state(cached
);
628 * this search will find the extents that end after
631 node
= tree_search(tree
, start
);
634 state
= rb_entry(node
, struct extent_state
, rb_node
);
636 if (state
->start
> end
)
638 WARN_ON(state
->end
< start
);
639 last_end
= state
->end
;
641 /* the state doesn't have the wanted bits, go ahead */
642 if (!(state
->state
& bits
)) {
643 state
= next_state(state
);
648 * | ---- desired range ---- |
650 * | ------------- state -------------- |
652 * We need to split the extent we found, and may flip
653 * bits on second half.
655 * If the extent we found extends past our range, we
656 * just split and search again. It'll get split again
657 * the next time though.
659 * If the extent we found is inside our range, we clear
660 * the desired bit on it.
663 if (state
->start
< start
) {
664 prealloc
= alloc_extent_state_atomic(prealloc
);
666 err
= split_state(tree
, state
, prealloc
, start
);
668 extent_io_tree_panic(tree
, err
);
673 if (state
->end
<= end
) {
674 state
= clear_state_bit(tree
, state
, &bits
, wake
);
680 * | ---- desired range ---- |
682 * We need to split the extent, and clear the bit
685 if (state
->start
<= end
&& state
->end
> end
) {
686 prealloc
= alloc_extent_state_atomic(prealloc
);
688 err
= split_state(tree
, state
, prealloc
, end
+ 1);
690 extent_io_tree_panic(tree
, err
);
695 clear_state_bit(tree
, prealloc
, &bits
, wake
);
701 state
= clear_state_bit(tree
, state
, &bits
, wake
);
703 if (last_end
== (u64
)-1)
705 start
= last_end
+ 1;
706 if (start
<= end
&& state
&& !need_resched())
711 spin_unlock(&tree
->lock
);
713 free_extent_state(prealloc
);
720 spin_unlock(&tree
->lock
);
721 if (mask
& __GFP_WAIT
)
726 static void wait_on_state(struct extent_io_tree
*tree
,
727 struct extent_state
*state
)
728 __releases(tree
->lock
)
729 __acquires(tree
->lock
)
732 prepare_to_wait(&state
->wq
, &wait
, TASK_UNINTERRUPTIBLE
);
733 spin_unlock(&tree
->lock
);
735 spin_lock(&tree
->lock
);
736 finish_wait(&state
->wq
, &wait
);
740 * waits for one or more bits to clear on a range in the state tree.
741 * The range [start, end] is inclusive.
742 * The tree lock is taken by this function
744 static void wait_extent_bit(struct extent_io_tree
*tree
, u64 start
, u64 end
,
747 struct extent_state
*state
;
748 struct rb_node
*node
;
750 btrfs_debug_check_extent_io_range(tree
, start
, end
);
752 spin_lock(&tree
->lock
);
756 * this search will find all the extents that end after
759 node
= tree_search(tree
, start
);
764 state
= rb_entry(node
, struct extent_state
, rb_node
);
766 if (state
->start
> end
)
769 if (state
->state
& bits
) {
770 start
= state
->start
;
771 atomic_inc(&state
->refs
);
772 wait_on_state(tree
, state
);
773 free_extent_state(state
);
776 start
= state
->end
+ 1;
781 if (!cond_resched_lock(&tree
->lock
)) {
782 node
= rb_next(node
);
787 spin_unlock(&tree
->lock
);
790 static void set_state_bits(struct extent_io_tree
*tree
,
791 struct extent_state
*state
,
794 unsigned bits_to_set
= *bits
& ~EXTENT_CTLBITS
;
796 set_state_cb(tree
, state
, bits
);
797 if ((bits_to_set
& EXTENT_DIRTY
) && !(state
->state
& EXTENT_DIRTY
)) {
798 u64 range
= state
->end
- state
->start
+ 1;
799 tree
->dirty_bytes
+= range
;
801 state
->state
|= bits_to_set
;
804 static void cache_state_if_flags(struct extent_state
*state
,
805 struct extent_state
**cached_ptr
,
808 if (cached_ptr
&& !(*cached_ptr
)) {
809 if (!flags
|| (state
->state
& flags
)) {
811 atomic_inc(&state
->refs
);
816 static void cache_state(struct extent_state
*state
,
817 struct extent_state
**cached_ptr
)
819 return cache_state_if_flags(state
, cached_ptr
,
820 EXTENT_IOBITS
| EXTENT_BOUNDARY
);
824 * set some bits on a range in the tree. This may require allocations or
825 * sleeping, so the gfp mask is used to indicate what is allowed.
827 * If any of the exclusive bits are set, this will fail with -EEXIST if some
828 * part of the range already has the desired bits set. The start of the
829 * existing range is returned in failed_start in this case.
831 * [start, end] is inclusive This takes the tree lock.
834 static int __must_check
835 __set_extent_bit(struct extent_io_tree
*tree
, u64 start
, u64 end
,
836 unsigned bits
, unsigned exclusive_bits
,
837 u64
*failed_start
, struct extent_state
**cached_state
,
840 struct extent_state
*state
;
841 struct extent_state
*prealloc
= NULL
;
842 struct rb_node
*node
;
844 struct rb_node
*parent
;
849 btrfs_debug_check_extent_io_range(tree
, start
, end
);
851 bits
|= EXTENT_FIRST_DELALLOC
;
853 if (!prealloc
&& (mask
& __GFP_WAIT
)) {
854 prealloc
= alloc_extent_state(mask
);
858 spin_lock(&tree
->lock
);
859 if (cached_state
&& *cached_state
) {
860 state
= *cached_state
;
861 if (state
->start
<= start
&& state
->end
> start
&&
862 extent_state_in_tree(state
)) {
863 node
= &state
->rb_node
;
868 * this search will find all the extents that end after
871 node
= tree_search_for_insert(tree
, start
, &p
, &parent
);
873 prealloc
= alloc_extent_state_atomic(prealloc
);
875 err
= insert_state(tree
, prealloc
, start
, end
,
878 extent_io_tree_panic(tree
, err
);
880 cache_state(prealloc
, cached_state
);
884 state
= rb_entry(node
, struct extent_state
, rb_node
);
886 last_start
= state
->start
;
887 last_end
= state
->end
;
890 * | ---- desired range ---- |
893 * Just lock what we found and keep going
895 if (state
->start
== start
&& state
->end
<= end
) {
896 if (state
->state
& exclusive_bits
) {
897 *failed_start
= state
->start
;
902 set_state_bits(tree
, state
, &bits
);
903 cache_state(state
, cached_state
);
904 merge_state(tree
, state
);
905 if (last_end
== (u64
)-1)
907 start
= last_end
+ 1;
908 state
= next_state(state
);
909 if (start
< end
&& state
&& state
->start
== start
&&
916 * | ---- desired range ---- |
919 * | ------------- state -------------- |
921 * We need to split the extent we found, and may flip bits on
924 * If the extent we found extends past our
925 * range, we just split and search again. It'll get split
926 * again the next time though.
928 * If the extent we found is inside our range, we set the
931 if (state
->start
< start
) {
932 if (state
->state
& exclusive_bits
) {
933 *failed_start
= start
;
938 prealloc
= alloc_extent_state_atomic(prealloc
);
940 err
= split_state(tree
, state
, prealloc
, start
);
942 extent_io_tree_panic(tree
, err
);
947 if (state
->end
<= end
) {
948 set_state_bits(tree
, state
, &bits
);
949 cache_state(state
, cached_state
);
950 merge_state(tree
, state
);
951 if (last_end
== (u64
)-1)
953 start
= last_end
+ 1;
954 state
= next_state(state
);
955 if (start
< end
&& state
&& state
->start
== start
&&
962 * | ---- desired range ---- |
963 * | state | or | state |
965 * There's a hole, we need to insert something in it and
966 * ignore the extent we found.
968 if (state
->start
> start
) {
970 if (end
< last_start
)
973 this_end
= last_start
- 1;
975 prealloc
= alloc_extent_state_atomic(prealloc
);
979 * Avoid to free 'prealloc' if it can be merged with
982 err
= insert_state(tree
, prealloc
, start
, this_end
,
985 extent_io_tree_panic(tree
, err
);
987 cache_state(prealloc
, cached_state
);
989 start
= this_end
+ 1;
993 * | ---- desired range ---- |
995 * We need to split the extent, and set the bit
998 if (state
->start
<= end
&& state
->end
> end
) {
999 if (state
->state
& exclusive_bits
) {
1000 *failed_start
= start
;
1005 prealloc
= alloc_extent_state_atomic(prealloc
);
1007 err
= split_state(tree
, state
, prealloc
, end
+ 1);
1009 extent_io_tree_panic(tree
, err
);
1011 set_state_bits(tree
, prealloc
, &bits
);
1012 cache_state(prealloc
, cached_state
);
1013 merge_state(tree
, prealloc
);
1021 spin_unlock(&tree
->lock
);
1023 free_extent_state(prealloc
);
1030 spin_unlock(&tree
->lock
);
1031 if (mask
& __GFP_WAIT
)
1036 int set_extent_bit(struct extent_io_tree
*tree
, u64 start
, u64 end
,
1037 unsigned bits
, u64
* failed_start
,
1038 struct extent_state
**cached_state
, gfp_t mask
)
1040 return __set_extent_bit(tree
, start
, end
, bits
, 0, failed_start
,
1041 cached_state
, mask
);
1046 * convert_extent_bit - convert all bits in a given range from one bit to
1048 * @tree: the io tree to search
1049 * @start: the start offset in bytes
1050 * @end: the end offset in bytes (inclusive)
1051 * @bits: the bits to set in this range
1052 * @clear_bits: the bits to clear in this range
1053 * @cached_state: state that we're going to cache
1054 * @mask: the allocation mask
1056 * This will go through and set bits for the given range. If any states exist
1057 * already in this range they are set with the given bit and cleared of the
1058 * clear_bits. This is only meant to be used by things that are mergeable, ie
1059 * converting from say DELALLOC to DIRTY. This is not meant to be used with
1060 * boundary bits like LOCK.
1062 int convert_extent_bit(struct extent_io_tree
*tree
, u64 start
, u64 end
,
1063 unsigned bits
, unsigned clear_bits
,
1064 struct extent_state
**cached_state
, gfp_t mask
)
1066 struct extent_state
*state
;
1067 struct extent_state
*prealloc
= NULL
;
1068 struct rb_node
*node
;
1070 struct rb_node
*parent
;
1074 bool first_iteration
= true;
1076 btrfs_debug_check_extent_io_range(tree
, start
, end
);
1079 if (!prealloc
&& (mask
& __GFP_WAIT
)) {
1081 * Best effort, don't worry if extent state allocation fails
1082 * here for the first iteration. We might have a cached state
1083 * that matches exactly the target range, in which case no
1084 * extent state allocations are needed. We'll only know this
1085 * after locking the tree.
1087 prealloc
= alloc_extent_state(mask
);
1088 if (!prealloc
&& !first_iteration
)
1092 spin_lock(&tree
->lock
);
1093 if (cached_state
&& *cached_state
) {
1094 state
= *cached_state
;
1095 if (state
->start
<= start
&& state
->end
> start
&&
1096 extent_state_in_tree(state
)) {
1097 node
= &state
->rb_node
;
1103 * this search will find all the extents that end after
1106 node
= tree_search_for_insert(tree
, start
, &p
, &parent
);
1108 prealloc
= alloc_extent_state_atomic(prealloc
);
1113 err
= insert_state(tree
, prealloc
, start
, end
,
1114 &p
, &parent
, &bits
);
1116 extent_io_tree_panic(tree
, err
);
1117 cache_state(prealloc
, cached_state
);
1121 state
= rb_entry(node
, struct extent_state
, rb_node
);
1123 last_start
= state
->start
;
1124 last_end
= state
->end
;
1127 * | ---- desired range ---- |
1130 * Just lock what we found and keep going
1132 if (state
->start
== start
&& state
->end
<= end
) {
1133 set_state_bits(tree
, state
, &bits
);
1134 cache_state(state
, cached_state
);
1135 state
= clear_state_bit(tree
, state
, &clear_bits
, 0);
1136 if (last_end
== (u64
)-1)
1138 start
= last_end
+ 1;
1139 if (start
< end
&& state
&& state
->start
== start
&&
1146 * | ---- desired range ---- |
1149 * | ------------- state -------------- |
1151 * We need to split the extent we found, and may flip bits on
1154 * If the extent we found extends past our
1155 * range, we just split and search again. It'll get split
1156 * again the next time though.
1158 * If the extent we found is inside our range, we set the
1159 * desired bit on it.
1161 if (state
->start
< start
) {
1162 prealloc
= alloc_extent_state_atomic(prealloc
);
1167 err
= split_state(tree
, state
, prealloc
, start
);
1169 extent_io_tree_panic(tree
, err
);
1173 if (state
->end
<= end
) {
1174 set_state_bits(tree
, state
, &bits
);
1175 cache_state(state
, cached_state
);
1176 state
= clear_state_bit(tree
, state
, &clear_bits
, 0);
1177 if (last_end
== (u64
)-1)
1179 start
= last_end
+ 1;
1180 if (start
< end
&& state
&& state
->start
== start
&&
1187 * | ---- desired range ---- |
1188 * | state | or | state |
1190 * There's a hole, we need to insert something in it and
1191 * ignore the extent we found.
1193 if (state
->start
> start
) {
1195 if (end
< last_start
)
1198 this_end
= last_start
- 1;
1200 prealloc
= alloc_extent_state_atomic(prealloc
);
1207 * Avoid to free 'prealloc' if it can be merged with
1210 err
= insert_state(tree
, prealloc
, start
, this_end
,
1213 extent_io_tree_panic(tree
, err
);
1214 cache_state(prealloc
, cached_state
);
1216 start
= this_end
+ 1;
1220 * | ---- desired range ---- |
1222 * We need to split the extent, and set the bit
1225 if (state
->start
<= end
&& state
->end
> end
) {
1226 prealloc
= alloc_extent_state_atomic(prealloc
);
1232 err
= split_state(tree
, state
, prealloc
, end
+ 1);
1234 extent_io_tree_panic(tree
, err
);
1236 set_state_bits(tree
, prealloc
, &bits
);
1237 cache_state(prealloc
, cached_state
);
1238 clear_state_bit(tree
, prealloc
, &clear_bits
, 0);
1246 spin_unlock(&tree
->lock
);
1248 free_extent_state(prealloc
);
1255 spin_unlock(&tree
->lock
);
1256 if (mask
& __GFP_WAIT
)
1258 first_iteration
= false;
1262 /* wrappers around set/clear extent bit */
1263 int set_extent_dirty(struct extent_io_tree
*tree
, u64 start
, u64 end
,
1266 return set_extent_bit(tree
, start
, end
, EXTENT_DIRTY
, NULL
,
1270 int set_extent_bits(struct extent_io_tree
*tree
, u64 start
, u64 end
,
1271 unsigned bits
, gfp_t mask
)
1273 return set_extent_bit(tree
, start
, end
, bits
, NULL
,
1277 int clear_extent_bits(struct extent_io_tree
*tree
, u64 start
, u64 end
,
1278 unsigned bits
, gfp_t mask
)
1282 if (bits
& EXTENT_LOCKED
)
1285 return clear_extent_bit(tree
, start
, end
, bits
, wake
, 0, NULL
, mask
);
1288 int set_extent_delalloc(struct extent_io_tree
*tree
, u64 start
, u64 end
,
1289 struct extent_state
**cached_state
, gfp_t mask
)
1291 return set_extent_bit(tree
, start
, end
,
1292 EXTENT_DELALLOC
| EXTENT_UPTODATE
,
1293 NULL
, cached_state
, mask
);
1296 int set_extent_defrag(struct extent_io_tree
*tree
, u64 start
, u64 end
,
1297 struct extent_state
**cached_state
, gfp_t mask
)
1299 return set_extent_bit(tree
, start
, end
,
1300 EXTENT_DELALLOC
| EXTENT_UPTODATE
| EXTENT_DEFRAG
,
1301 NULL
, cached_state
, mask
);
1304 int clear_extent_dirty(struct extent_io_tree
*tree
, u64 start
, u64 end
,
1307 return clear_extent_bit(tree
, start
, end
,
1308 EXTENT_DIRTY
| EXTENT_DELALLOC
|
1309 EXTENT_DO_ACCOUNTING
, 0, 0, NULL
, mask
);
1312 int set_extent_new(struct extent_io_tree
*tree
, u64 start
, u64 end
,
1315 return set_extent_bit(tree
, start
, end
, EXTENT_NEW
, NULL
,
1319 int set_extent_uptodate(struct extent_io_tree
*tree
, u64 start
, u64 end
,
1320 struct extent_state
**cached_state
, gfp_t mask
)
1322 return set_extent_bit(tree
, start
, end
, EXTENT_UPTODATE
, NULL
,
1323 cached_state
, mask
);
1326 int clear_extent_uptodate(struct extent_io_tree
*tree
, u64 start
, u64 end
,
1327 struct extent_state
**cached_state
, gfp_t mask
)
1329 return clear_extent_bit(tree
, start
, end
, EXTENT_UPTODATE
, 0, 0,
1330 cached_state
, mask
);
1334 * either insert or lock state struct between start and end use mask to tell
1335 * us if waiting is desired.
1337 int lock_extent_bits(struct extent_io_tree
*tree
, u64 start
, u64 end
,
1338 unsigned bits
, struct extent_state
**cached_state
)
1344 err
= __set_extent_bit(tree
, start
, end
, EXTENT_LOCKED
| bits
,
1345 EXTENT_LOCKED
, &failed_start
,
1346 cached_state
, GFP_NOFS
);
1347 if (err
== -EEXIST
) {
1348 wait_extent_bit(tree
, failed_start
, end
, EXTENT_LOCKED
);
1349 start
= failed_start
;
1352 WARN_ON(start
> end
);
1357 int lock_extent(struct extent_io_tree
*tree
, u64 start
, u64 end
)
1359 return lock_extent_bits(tree
, start
, end
, 0, NULL
);
1362 int try_lock_extent(struct extent_io_tree
*tree
, u64 start
, u64 end
)
1367 err
= __set_extent_bit(tree
, start
, end
, EXTENT_LOCKED
, EXTENT_LOCKED
,
1368 &failed_start
, NULL
, GFP_NOFS
);
1369 if (err
== -EEXIST
) {
1370 if (failed_start
> start
)
1371 clear_extent_bit(tree
, start
, failed_start
- 1,
1372 EXTENT_LOCKED
, 1, 0, NULL
, GFP_NOFS
);
1378 int unlock_extent_cached(struct extent_io_tree
*tree
, u64 start
, u64 end
,
1379 struct extent_state
**cached
, gfp_t mask
)
1381 return clear_extent_bit(tree
, start
, end
, EXTENT_LOCKED
, 1, 0, cached
,
1385 int unlock_extent(struct extent_io_tree
*tree
, u64 start
, u64 end
)
1387 return clear_extent_bit(tree
, start
, end
, EXTENT_LOCKED
, 1, 0, NULL
,
1391 int extent_range_clear_dirty_for_io(struct inode
*inode
, u64 start
, u64 end
)
1393 unsigned long index
= start
>> PAGE_CACHE_SHIFT
;
1394 unsigned long end_index
= end
>> PAGE_CACHE_SHIFT
;
1397 while (index
<= end_index
) {
1398 page
= find_get_page(inode
->i_mapping
, index
);
1399 BUG_ON(!page
); /* Pages should be in the extent_io_tree */
1400 clear_page_dirty_for_io(page
);
1401 page_cache_release(page
);
1407 int extent_range_redirty_for_io(struct inode
*inode
, u64 start
, u64 end
)
1409 unsigned long index
= start
>> PAGE_CACHE_SHIFT
;
1410 unsigned long end_index
= end
>> PAGE_CACHE_SHIFT
;
1413 while (index
<= end_index
) {
1414 page
= find_get_page(inode
->i_mapping
, index
);
1415 BUG_ON(!page
); /* Pages should be in the extent_io_tree */
1416 __set_page_dirty_nobuffers(page
);
1417 account_page_redirty(page
);
1418 page_cache_release(page
);
1425 * helper function to set both pages and extents in the tree writeback
1427 static int set_range_writeback(struct extent_io_tree
*tree
, u64 start
, u64 end
)
1429 unsigned long index
= start
>> PAGE_CACHE_SHIFT
;
1430 unsigned long end_index
= end
>> PAGE_CACHE_SHIFT
;
1433 while (index
<= end_index
) {
1434 page
= find_get_page(tree
->mapping
, index
);
1435 BUG_ON(!page
); /* Pages should be in the extent_io_tree */
1436 set_page_writeback(page
);
1437 page_cache_release(page
);
1443 /* find the first state struct with 'bits' set after 'start', and
1444 * return it. tree->lock must be held. NULL will returned if
1445 * nothing was found after 'start'
1447 static struct extent_state
*
1448 find_first_extent_bit_state(struct extent_io_tree
*tree
,
1449 u64 start
, unsigned bits
)
1451 struct rb_node
*node
;
1452 struct extent_state
*state
;
1455 * this search will find all the extents that end after
1458 node
= tree_search(tree
, start
);
1463 state
= rb_entry(node
, struct extent_state
, rb_node
);
1464 if (state
->end
>= start
&& (state
->state
& bits
))
1467 node
= rb_next(node
);
1476 * find the first offset in the io tree with 'bits' set. zero is
1477 * returned if we find something, and *start_ret and *end_ret are
1478 * set to reflect the state struct that was found.
1480 * If nothing was found, 1 is returned. If found something, return 0.
1482 int find_first_extent_bit(struct extent_io_tree
*tree
, u64 start
,
1483 u64
*start_ret
, u64
*end_ret
, unsigned bits
,
1484 struct extent_state
**cached_state
)
1486 struct extent_state
*state
;
1490 spin_lock(&tree
->lock
);
1491 if (cached_state
&& *cached_state
) {
1492 state
= *cached_state
;
1493 if (state
->end
== start
- 1 && extent_state_in_tree(state
)) {
1494 n
= rb_next(&state
->rb_node
);
1496 state
= rb_entry(n
, struct extent_state
,
1498 if (state
->state
& bits
)
1502 free_extent_state(*cached_state
);
1503 *cached_state
= NULL
;
1506 free_extent_state(*cached_state
);
1507 *cached_state
= NULL
;
1510 state
= find_first_extent_bit_state(tree
, start
, bits
);
1513 cache_state_if_flags(state
, cached_state
, 0);
1514 *start_ret
= state
->start
;
1515 *end_ret
= state
->end
;
1519 spin_unlock(&tree
->lock
);
1524 * find a contiguous range of bytes in the file marked as delalloc, not
1525 * more than 'max_bytes'. start and end are used to return the range,
1527 * 1 is returned if we find something, 0 if nothing was in the tree
1529 static noinline u64
find_delalloc_range(struct extent_io_tree
*tree
,
1530 u64
*start
, u64
*end
, u64 max_bytes
,
1531 struct extent_state
**cached_state
)
1533 struct rb_node
*node
;
1534 struct extent_state
*state
;
1535 u64 cur_start
= *start
;
1537 u64 total_bytes
= 0;
1539 spin_lock(&tree
->lock
);
1542 * this search will find all the extents that end after
1545 node
= tree_search(tree
, cur_start
);
1553 state
= rb_entry(node
, struct extent_state
, rb_node
);
1554 if (found
&& (state
->start
!= cur_start
||
1555 (state
->state
& EXTENT_BOUNDARY
))) {
1558 if (!(state
->state
& EXTENT_DELALLOC
)) {
1564 *start
= state
->start
;
1565 *cached_state
= state
;
1566 atomic_inc(&state
->refs
);
1570 cur_start
= state
->end
+ 1;
1571 node
= rb_next(node
);
1572 total_bytes
+= state
->end
- state
->start
+ 1;
1573 if (total_bytes
>= max_bytes
)
1579 spin_unlock(&tree
->lock
);
1583 static noinline
void __unlock_for_delalloc(struct inode
*inode
,
1584 struct page
*locked_page
,
1588 struct page
*pages
[16];
1589 unsigned long index
= start
>> PAGE_CACHE_SHIFT
;
1590 unsigned long end_index
= end
>> PAGE_CACHE_SHIFT
;
1591 unsigned long nr_pages
= end_index
- index
+ 1;
1594 if (index
== locked_page
->index
&& end_index
== index
)
1597 while (nr_pages
> 0) {
1598 ret
= find_get_pages_contig(inode
->i_mapping
, index
,
1599 min_t(unsigned long, nr_pages
,
1600 ARRAY_SIZE(pages
)), pages
);
1601 for (i
= 0; i
< ret
; i
++) {
1602 if (pages
[i
] != locked_page
)
1603 unlock_page(pages
[i
]);
1604 page_cache_release(pages
[i
]);
1612 static noinline
int lock_delalloc_pages(struct inode
*inode
,
1613 struct page
*locked_page
,
1617 unsigned long index
= delalloc_start
>> PAGE_CACHE_SHIFT
;
1618 unsigned long start_index
= index
;
1619 unsigned long end_index
= delalloc_end
>> PAGE_CACHE_SHIFT
;
1620 unsigned long pages_locked
= 0;
1621 struct page
*pages
[16];
1622 unsigned long nrpages
;
1626 /* the caller is responsible for locking the start index */
1627 if (index
== locked_page
->index
&& index
== end_index
)
1630 /* skip the page at the start index */
1631 nrpages
= end_index
- index
+ 1;
1632 while (nrpages
> 0) {
1633 ret
= find_get_pages_contig(inode
->i_mapping
, index
,
1634 min_t(unsigned long,
1635 nrpages
, ARRAY_SIZE(pages
)), pages
);
1640 /* now we have an array of pages, lock them all */
1641 for (i
= 0; i
< ret
; i
++) {
1643 * the caller is taking responsibility for
1646 if (pages
[i
] != locked_page
) {
1647 lock_page(pages
[i
]);
1648 if (!PageDirty(pages
[i
]) ||
1649 pages
[i
]->mapping
!= inode
->i_mapping
) {
1651 unlock_page(pages
[i
]);
1652 page_cache_release(pages
[i
]);
1656 page_cache_release(pages
[i
]);
1665 if (ret
&& pages_locked
) {
1666 __unlock_for_delalloc(inode
, locked_page
,
1668 ((u64
)(start_index
+ pages_locked
- 1)) <<
1675 * find a contiguous range of bytes in the file marked as delalloc, not
1676 * more than 'max_bytes'. start and end are used to return the range,
1678 * 1 is returned if we find something, 0 if nothing was in the tree
1680 STATIC u64
find_lock_delalloc_range(struct inode
*inode
,
1681 struct extent_io_tree
*tree
,
1682 struct page
*locked_page
, u64
*start
,
1683 u64
*end
, u64 max_bytes
)
1688 struct extent_state
*cached_state
= NULL
;
1693 /* step one, find a bunch of delalloc bytes starting at start */
1694 delalloc_start
= *start
;
1696 found
= find_delalloc_range(tree
, &delalloc_start
, &delalloc_end
,
1697 max_bytes
, &cached_state
);
1698 if (!found
|| delalloc_end
<= *start
) {
1699 *start
= delalloc_start
;
1700 *end
= delalloc_end
;
1701 free_extent_state(cached_state
);
1706 * start comes from the offset of locked_page. We have to lock
1707 * pages in order, so we can't process delalloc bytes before
1710 if (delalloc_start
< *start
)
1711 delalloc_start
= *start
;
1714 * make sure to limit the number of pages we try to lock down
1716 if (delalloc_end
+ 1 - delalloc_start
> max_bytes
)
1717 delalloc_end
= delalloc_start
+ max_bytes
- 1;
1719 /* step two, lock all the pages after the page that has start */
1720 ret
= lock_delalloc_pages(inode
, locked_page
,
1721 delalloc_start
, delalloc_end
);
1722 if (ret
== -EAGAIN
) {
1723 /* some of the pages are gone, lets avoid looping by
1724 * shortening the size of the delalloc range we're searching
1726 free_extent_state(cached_state
);
1727 cached_state
= NULL
;
1729 max_bytes
= PAGE_CACHE_SIZE
;
1737 BUG_ON(ret
); /* Only valid values are 0 and -EAGAIN */
1739 /* step three, lock the state bits for the whole range */
1740 lock_extent_bits(tree
, delalloc_start
, delalloc_end
, 0, &cached_state
);
1742 /* then test to make sure it is all still delalloc */
1743 ret
= test_range_bit(tree
, delalloc_start
, delalloc_end
,
1744 EXTENT_DELALLOC
, 1, cached_state
);
1746 unlock_extent_cached(tree
, delalloc_start
, delalloc_end
,
1747 &cached_state
, GFP_NOFS
);
1748 __unlock_for_delalloc(inode
, locked_page
,
1749 delalloc_start
, delalloc_end
);
1753 free_extent_state(cached_state
);
1754 *start
= delalloc_start
;
1755 *end
= delalloc_end
;
1760 int extent_clear_unlock_delalloc(struct inode
*inode
, u64 start
, u64 end
,
1761 struct page
*locked_page
,
1762 unsigned clear_bits
,
1763 unsigned long page_ops
)
1765 struct extent_io_tree
*tree
= &BTRFS_I(inode
)->io_tree
;
1767 struct page
*pages
[16];
1768 unsigned long index
= start
>> PAGE_CACHE_SHIFT
;
1769 unsigned long end_index
= end
>> PAGE_CACHE_SHIFT
;
1770 unsigned long nr_pages
= end_index
- index
+ 1;
1773 clear_extent_bit(tree
, start
, end
, clear_bits
, 1, 0, NULL
, GFP_NOFS
);
1777 if ((page_ops
& PAGE_SET_ERROR
) && nr_pages
> 0)
1778 mapping_set_error(inode
->i_mapping
, -EIO
);
1780 while (nr_pages
> 0) {
1781 ret
= find_get_pages_contig(inode
->i_mapping
, index
,
1782 min_t(unsigned long,
1783 nr_pages
, ARRAY_SIZE(pages
)), pages
);
1784 for (i
= 0; i
< ret
; i
++) {
1786 if (page_ops
& PAGE_SET_PRIVATE2
)
1787 SetPagePrivate2(pages
[i
]);
1789 if (pages
[i
] == locked_page
) {
1790 page_cache_release(pages
[i
]);
1793 if (page_ops
& PAGE_CLEAR_DIRTY
)
1794 clear_page_dirty_for_io(pages
[i
]);
1795 if (page_ops
& PAGE_SET_WRITEBACK
)
1796 set_page_writeback(pages
[i
]);
1797 if (page_ops
& PAGE_SET_ERROR
)
1798 SetPageError(pages
[i
]);
1799 if (page_ops
& PAGE_END_WRITEBACK
)
1800 end_page_writeback(pages
[i
]);
1801 if (page_ops
& PAGE_UNLOCK
)
1802 unlock_page(pages
[i
]);
1803 page_cache_release(pages
[i
]);
1813 * count the number of bytes in the tree that have a given bit(s)
1814 * set. This can be fairly slow, except for EXTENT_DIRTY which is
1815 * cached. The total number found is returned.
1817 u64
count_range_bits(struct extent_io_tree
*tree
,
1818 u64
*start
, u64 search_end
, u64 max_bytes
,
1819 unsigned bits
, int contig
)
1821 struct rb_node
*node
;
1822 struct extent_state
*state
;
1823 u64 cur_start
= *start
;
1824 u64 total_bytes
= 0;
1828 if (WARN_ON(search_end
<= cur_start
))
1831 spin_lock(&tree
->lock
);
1832 if (cur_start
== 0 && bits
== EXTENT_DIRTY
) {
1833 total_bytes
= tree
->dirty_bytes
;
1837 * this search will find all the extents that end after
1840 node
= tree_search(tree
, cur_start
);
1845 state
= rb_entry(node
, struct extent_state
, rb_node
);
1846 if (state
->start
> search_end
)
1848 if (contig
&& found
&& state
->start
> last
+ 1)
1850 if (state
->end
>= cur_start
&& (state
->state
& bits
) == bits
) {
1851 total_bytes
+= min(search_end
, state
->end
) + 1 -
1852 max(cur_start
, state
->start
);
1853 if (total_bytes
>= max_bytes
)
1856 *start
= max(cur_start
, state
->start
);
1860 } else if (contig
&& found
) {
1863 node
= rb_next(node
);
1868 spin_unlock(&tree
->lock
);
1873 * set the private field for a given byte offset in the tree. If there isn't
1874 * an extent_state there already, this does nothing.
1876 static int set_state_private(struct extent_io_tree
*tree
, u64 start
, u64
private)
1878 struct rb_node
*node
;
1879 struct extent_state
*state
;
1882 spin_lock(&tree
->lock
);
1884 * this search will find all the extents that end after
1887 node
= tree_search(tree
, start
);
1892 state
= rb_entry(node
, struct extent_state
, rb_node
);
1893 if (state
->start
!= start
) {
1897 state
->private = private;
1899 spin_unlock(&tree
->lock
);
1903 int get_state_private(struct extent_io_tree
*tree
, u64 start
, u64
*private)
1905 struct rb_node
*node
;
1906 struct extent_state
*state
;
1909 spin_lock(&tree
->lock
);
1911 * this search will find all the extents that end after
1914 node
= tree_search(tree
, start
);
1919 state
= rb_entry(node
, struct extent_state
, rb_node
);
1920 if (state
->start
!= start
) {
1924 *private = state
->private;
1926 spin_unlock(&tree
->lock
);
1931 * searches a range in the state tree for a given mask.
1932 * If 'filled' == 1, this returns 1 only if every extent in the tree
1933 * has the bits set. Otherwise, 1 is returned if any bit in the
1934 * range is found set.
1936 int test_range_bit(struct extent_io_tree
*tree
, u64 start
, u64 end
,
1937 unsigned bits
, int filled
, struct extent_state
*cached
)
1939 struct extent_state
*state
= NULL
;
1940 struct rb_node
*node
;
1943 spin_lock(&tree
->lock
);
1944 if (cached
&& extent_state_in_tree(cached
) && cached
->start
<= start
&&
1945 cached
->end
> start
)
1946 node
= &cached
->rb_node
;
1948 node
= tree_search(tree
, start
);
1949 while (node
&& start
<= end
) {
1950 state
= rb_entry(node
, struct extent_state
, rb_node
);
1952 if (filled
&& state
->start
> start
) {
1957 if (state
->start
> end
)
1960 if (state
->state
& bits
) {
1964 } else if (filled
) {
1969 if (state
->end
== (u64
)-1)
1972 start
= state
->end
+ 1;
1975 node
= rb_next(node
);
1982 spin_unlock(&tree
->lock
);
1987 * helper function to set a given page up to date if all the
1988 * extents in the tree for that page are up to date
1990 static void check_page_uptodate(struct extent_io_tree
*tree
, struct page
*page
)
1992 u64 start
= page_offset(page
);
1993 u64 end
= start
+ PAGE_CACHE_SIZE
- 1;
1994 if (test_range_bit(tree
, start
, end
, EXTENT_UPTODATE
, 1, NULL
))
1995 SetPageUptodate(page
);
1998 int free_io_failure(struct inode
*inode
, struct io_failure_record
*rec
)
2002 struct extent_io_tree
*failure_tree
= &BTRFS_I(inode
)->io_failure_tree
;
2004 set_state_private(failure_tree
, rec
->start
, 0);
2005 ret
= clear_extent_bits(failure_tree
, rec
->start
,
2006 rec
->start
+ rec
->len
- 1,
2007 EXTENT_LOCKED
| EXTENT_DIRTY
, GFP_NOFS
);
2011 ret
= clear_extent_bits(&BTRFS_I(inode
)->io_tree
, rec
->start
,
2012 rec
->start
+ rec
->len
- 1,
2013 EXTENT_DAMAGED
, GFP_NOFS
);
2022 * this bypasses the standard btrfs submit functions deliberately, as
2023 * the standard behavior is to write all copies in a raid setup. here we only
2024 * want to write the one bad copy. so we do the mapping for ourselves and issue
2025 * submit_bio directly.
2026 * to avoid any synchronization issues, wait for the data after writing, which
2027 * actually prevents the read that triggered the error from finishing.
2028 * currently, there can be no more than two copies of every data bit. thus,
2029 * exactly one rewrite is required.
2031 int repair_io_failure(struct inode
*inode
, u64 start
, u64 length
, u64 logical
,
2032 struct page
*page
, unsigned int pg_offset
, int mirror_num
)
2034 struct btrfs_fs_info
*fs_info
= BTRFS_I(inode
)->root
->fs_info
;
2036 struct btrfs_device
*dev
;
2039 struct btrfs_bio
*bbio
= NULL
;
2040 struct btrfs_mapping_tree
*map_tree
= &fs_info
->mapping_tree
;
2043 ASSERT(!(fs_info
->sb
->s_flags
& MS_RDONLY
));
2044 BUG_ON(!mirror_num
);
2046 /* we can't repair anything in raid56 yet */
2047 if (btrfs_is_parity_mirror(map_tree
, logical
, length
, mirror_num
))
2050 bio
= btrfs_io_bio_alloc(GFP_NOFS
, 1);
2053 bio
->bi_iter
.bi_size
= 0;
2054 map_length
= length
;
2056 ret
= btrfs_map_block(fs_info
, WRITE
, logical
,
2057 &map_length
, &bbio
, mirror_num
);
2062 BUG_ON(mirror_num
!= bbio
->mirror_num
);
2063 sector
= bbio
->stripes
[mirror_num
-1].physical
>> 9;
2064 bio
->bi_iter
.bi_sector
= sector
;
2065 dev
= bbio
->stripes
[mirror_num
-1].dev
;
2066 btrfs_put_bbio(bbio
);
2067 if (!dev
|| !dev
->bdev
|| !dev
->writeable
) {
2071 bio
->bi_bdev
= dev
->bdev
;
2072 bio_add_page(bio
, page
, length
, pg_offset
);
2074 if (btrfsic_submit_bio_wait(WRITE_SYNC
, bio
)) {
2075 /* try to remap that extent elsewhere? */
2077 btrfs_dev_stat_inc_and_print(dev
, BTRFS_DEV_STAT_WRITE_ERRS
);
2081 printk_ratelimited_in_rcu(KERN_INFO
2082 "BTRFS: read error corrected: ino %llu off %llu (dev %s sector %llu)\n",
2083 btrfs_ino(inode
), start
,
2084 rcu_str_deref(dev
->name
), sector
);
2089 int repair_eb_io_failure(struct btrfs_root
*root
, struct extent_buffer
*eb
,
2092 u64 start
= eb
->start
;
2093 unsigned long i
, num_pages
= num_extent_pages(eb
->start
, eb
->len
);
2096 if (root
->fs_info
->sb
->s_flags
& MS_RDONLY
)
2099 for (i
= 0; i
< num_pages
; i
++) {
2100 struct page
*p
= eb
->pages
[i
];
2102 ret
= repair_io_failure(root
->fs_info
->btree_inode
, start
,
2103 PAGE_CACHE_SIZE
, start
, p
,
2104 start
- page_offset(p
), mirror_num
);
2107 start
+= PAGE_CACHE_SIZE
;
2114 * each time an IO finishes, we do a fast check in the IO failure tree
2115 * to see if we need to process or clean up an io_failure_record
2117 int clean_io_failure(struct inode
*inode
, u64 start
, struct page
*page
,
2118 unsigned int pg_offset
)
2121 u64 private_failure
;
2122 struct io_failure_record
*failrec
;
2123 struct btrfs_fs_info
*fs_info
= BTRFS_I(inode
)->root
->fs_info
;
2124 struct extent_state
*state
;
2129 ret
= count_range_bits(&BTRFS_I(inode
)->io_failure_tree
, &private,
2130 (u64
)-1, 1, EXTENT_DIRTY
, 0);
2134 ret
= get_state_private(&BTRFS_I(inode
)->io_failure_tree
, start
,
2139 failrec
= (struct io_failure_record
*)(unsigned long) private_failure
;
2140 BUG_ON(!failrec
->this_mirror
);
2142 if (failrec
->in_validation
) {
2143 /* there was no real error, just free the record */
2144 pr_debug("clean_io_failure: freeing dummy error at %llu\n",
2148 if (fs_info
->sb
->s_flags
& MS_RDONLY
)
2151 spin_lock(&BTRFS_I(inode
)->io_tree
.lock
);
2152 state
= find_first_extent_bit_state(&BTRFS_I(inode
)->io_tree
,
2155 spin_unlock(&BTRFS_I(inode
)->io_tree
.lock
);
2157 if (state
&& state
->start
<= failrec
->start
&&
2158 state
->end
>= failrec
->start
+ failrec
->len
- 1) {
2159 num_copies
= btrfs_num_copies(fs_info
, failrec
->logical
,
2161 if (num_copies
> 1) {
2162 repair_io_failure(inode
, start
, failrec
->len
,
2163 failrec
->logical
, page
,
2164 pg_offset
, failrec
->failed_mirror
);
2169 free_io_failure(inode
, failrec
);
2175 * Can be called when
2176 * - hold extent lock
2177 * - under ordered extent
2178 * - the inode is freeing
2180 void btrfs_free_io_failure_record(struct inode
*inode
, u64 start
, u64 end
)
2182 struct extent_io_tree
*failure_tree
= &BTRFS_I(inode
)->io_failure_tree
;
2183 struct io_failure_record
*failrec
;
2184 struct extent_state
*state
, *next
;
2186 if (RB_EMPTY_ROOT(&failure_tree
->state
))
2189 spin_lock(&failure_tree
->lock
);
2190 state
= find_first_extent_bit_state(failure_tree
, start
, EXTENT_DIRTY
);
2192 if (state
->start
> end
)
2195 ASSERT(state
->end
<= end
);
2197 next
= next_state(state
);
2199 failrec
= (struct io_failure_record
*)(unsigned long)state
->private;
2200 free_extent_state(state
);
2205 spin_unlock(&failure_tree
->lock
);
2208 int btrfs_get_io_failure_record(struct inode
*inode
, u64 start
, u64 end
,
2209 struct io_failure_record
**failrec_ret
)
2211 struct io_failure_record
*failrec
;
2213 struct extent_map
*em
;
2214 struct extent_io_tree
*failure_tree
= &BTRFS_I(inode
)->io_failure_tree
;
2215 struct extent_io_tree
*tree
= &BTRFS_I(inode
)->io_tree
;
2216 struct extent_map_tree
*em_tree
= &BTRFS_I(inode
)->extent_tree
;
2220 ret
= get_state_private(failure_tree
, start
, &private);
2222 failrec
= kzalloc(sizeof(*failrec
), GFP_NOFS
);
2226 failrec
->start
= start
;
2227 failrec
->len
= end
- start
+ 1;
2228 failrec
->this_mirror
= 0;
2229 failrec
->bio_flags
= 0;
2230 failrec
->in_validation
= 0;
2232 read_lock(&em_tree
->lock
);
2233 em
= lookup_extent_mapping(em_tree
, start
, failrec
->len
);
2235 read_unlock(&em_tree
->lock
);
2240 if (em
->start
> start
|| em
->start
+ em
->len
<= start
) {
2241 free_extent_map(em
);
2244 read_unlock(&em_tree
->lock
);
2250 logical
= start
- em
->start
;
2251 logical
= em
->block_start
+ logical
;
2252 if (test_bit(EXTENT_FLAG_COMPRESSED
, &em
->flags
)) {
2253 logical
= em
->block_start
;
2254 failrec
->bio_flags
= EXTENT_BIO_COMPRESSED
;
2255 extent_set_compress_type(&failrec
->bio_flags
,
2259 pr_debug("Get IO Failure Record: (new) logical=%llu, start=%llu, len=%llu\n",
2260 logical
, start
, failrec
->len
);
2262 failrec
->logical
= logical
;
2263 free_extent_map(em
);
2265 /* set the bits in the private failure tree */
2266 ret
= set_extent_bits(failure_tree
, start
, end
,
2267 EXTENT_LOCKED
| EXTENT_DIRTY
, GFP_NOFS
);
2269 ret
= set_state_private(failure_tree
, start
,
2270 (u64
)(unsigned long)failrec
);
2271 /* set the bits in the inode's tree */
2273 ret
= set_extent_bits(tree
, start
, end
, EXTENT_DAMAGED
,
2280 failrec
= (struct io_failure_record
*)(unsigned long)private;
2281 pr_debug("Get IO Failure Record: (found) logical=%llu, start=%llu, len=%llu, validation=%d\n",
2282 failrec
->logical
, failrec
->start
, failrec
->len
,
2283 failrec
->in_validation
);
2285 * when data can be on disk more than twice, add to failrec here
2286 * (e.g. with a list for failed_mirror) to make
2287 * clean_io_failure() clean all those errors at once.
2291 *failrec_ret
= failrec
;
2296 int btrfs_check_repairable(struct inode
*inode
, struct bio
*failed_bio
,
2297 struct io_failure_record
*failrec
, int failed_mirror
)
2301 num_copies
= btrfs_num_copies(BTRFS_I(inode
)->root
->fs_info
,
2302 failrec
->logical
, failrec
->len
);
2303 if (num_copies
== 1) {
2305 * we only have a single copy of the data, so don't bother with
2306 * all the retry and error correction code that follows. no
2307 * matter what the error is, it is very likely to persist.
2309 pr_debug("Check Repairable: cannot repair, num_copies=%d, next_mirror %d, failed_mirror %d\n",
2310 num_copies
, failrec
->this_mirror
, failed_mirror
);
2315 * there are two premises:
2316 * a) deliver good data to the caller
2317 * b) correct the bad sectors on disk
2319 if (failed_bio
->bi_vcnt
> 1) {
2321 * to fulfill b), we need to know the exact failing sectors, as
2322 * we don't want to rewrite any more than the failed ones. thus,
2323 * we need separate read requests for the failed bio
2325 * if the following BUG_ON triggers, our validation request got
2326 * merged. we need separate requests for our algorithm to work.
2328 BUG_ON(failrec
->in_validation
);
2329 failrec
->in_validation
= 1;
2330 failrec
->this_mirror
= failed_mirror
;
2333 * we're ready to fulfill a) and b) alongside. get a good copy
2334 * of the failed sector and if we succeed, we have setup
2335 * everything for repair_io_failure to do the rest for us.
2337 if (failrec
->in_validation
) {
2338 BUG_ON(failrec
->this_mirror
!= failed_mirror
);
2339 failrec
->in_validation
= 0;
2340 failrec
->this_mirror
= 0;
2342 failrec
->failed_mirror
= failed_mirror
;
2343 failrec
->this_mirror
++;
2344 if (failrec
->this_mirror
== failed_mirror
)
2345 failrec
->this_mirror
++;
2348 if (failrec
->this_mirror
> num_copies
) {
2349 pr_debug("Check Repairable: (fail) num_copies=%d, next_mirror %d, failed_mirror %d\n",
2350 num_copies
, failrec
->this_mirror
, failed_mirror
);
2358 struct bio
*btrfs_create_repair_bio(struct inode
*inode
, struct bio
*failed_bio
,
2359 struct io_failure_record
*failrec
,
2360 struct page
*page
, int pg_offset
, int icsum
,
2361 bio_end_io_t
*endio_func
, void *data
)
2364 struct btrfs_io_bio
*btrfs_failed_bio
;
2365 struct btrfs_io_bio
*btrfs_bio
;
2367 bio
= btrfs_io_bio_alloc(GFP_NOFS
, 1);
2371 bio
->bi_end_io
= endio_func
;
2372 bio
->bi_iter
.bi_sector
= failrec
->logical
>> 9;
2373 bio
->bi_bdev
= BTRFS_I(inode
)->root
->fs_info
->fs_devices
->latest_bdev
;
2374 bio
->bi_iter
.bi_size
= 0;
2375 bio
->bi_private
= data
;
2377 btrfs_failed_bio
= btrfs_io_bio(failed_bio
);
2378 if (btrfs_failed_bio
->csum
) {
2379 struct btrfs_fs_info
*fs_info
= BTRFS_I(inode
)->root
->fs_info
;
2380 u16 csum_size
= btrfs_super_csum_size(fs_info
->super_copy
);
2382 btrfs_bio
= btrfs_io_bio(bio
);
2383 btrfs_bio
->csum
= btrfs_bio
->csum_inline
;
2385 memcpy(btrfs_bio
->csum
, btrfs_failed_bio
->csum
+ icsum
,
2389 bio_add_page(bio
, page
, failrec
->len
, pg_offset
);
2395 * this is a generic handler for readpage errors (default
2396 * readpage_io_failed_hook). if other copies exist, read those and write back
2397 * good data to the failed position. does not investigate in remapping the
2398 * failed extent elsewhere, hoping the device will be smart enough to do this as
2402 static int bio_readpage_error(struct bio
*failed_bio
, u64 phy_offset
,
2403 struct page
*page
, u64 start
, u64 end
,
2406 struct io_failure_record
*failrec
;
2407 struct inode
*inode
= page
->mapping
->host
;
2408 struct extent_io_tree
*tree
= &BTRFS_I(inode
)->io_tree
;
2413 BUG_ON(failed_bio
->bi_rw
& REQ_WRITE
);
2415 ret
= btrfs_get_io_failure_record(inode
, start
, end
, &failrec
);
2419 ret
= btrfs_check_repairable(inode
, failed_bio
, failrec
, failed_mirror
);
2421 free_io_failure(inode
, failrec
);
2425 if (failed_bio
->bi_vcnt
> 1)
2426 read_mode
= READ_SYNC
| REQ_FAILFAST_DEV
;
2428 read_mode
= READ_SYNC
;
2430 phy_offset
>>= inode
->i_sb
->s_blocksize_bits
;
2431 bio
= btrfs_create_repair_bio(inode
, failed_bio
, failrec
, page
,
2432 start
- page_offset(page
),
2433 (int)phy_offset
, failed_bio
->bi_end_io
,
2436 free_io_failure(inode
, failrec
);
2440 pr_debug("Repair Read Error: submitting new read[%#x] to this_mirror=%d, in_validation=%d\n",
2441 read_mode
, failrec
->this_mirror
, failrec
->in_validation
);
2443 ret
= tree
->ops
->submit_bio_hook(inode
, read_mode
, bio
,
2444 failrec
->this_mirror
,
2445 failrec
->bio_flags
, 0);
2447 free_io_failure(inode
, failrec
);
2454 /* lots and lots of room for performance fixes in the end_bio funcs */
2456 int end_extent_writepage(struct page
*page
, int err
, u64 start
, u64 end
)
2458 int uptodate
= (err
== 0);
2459 struct extent_io_tree
*tree
;
2462 tree
= &BTRFS_I(page
->mapping
->host
)->io_tree
;
2464 if (tree
->ops
&& tree
->ops
->writepage_end_io_hook
) {
2465 ret
= tree
->ops
->writepage_end_io_hook(page
, start
,
2466 end
, NULL
, uptodate
);
2472 ClearPageUptodate(page
);
2474 ret
= ret
< 0 ? ret
: -EIO
;
2475 mapping_set_error(page
->mapping
, ret
);
2481 * after a writepage IO is done, we need to:
2482 * clear the uptodate bits on error
2483 * clear the writeback bits in the extent tree for this IO
2484 * end_page_writeback if the page has no more pending IO
2486 * Scheduling is not allowed, so the extent state tree is expected
2487 * to have one and only one object corresponding to this IO.
2489 static void end_bio_extent_writepage(struct bio
*bio
, int err
)
2491 struct bio_vec
*bvec
;
2496 bio_for_each_segment_all(bvec
, bio
, i
) {
2497 struct page
*page
= bvec
->bv_page
;
2499 /* We always issue full-page reads, but if some block
2500 * in a page fails to read, blk_update_request() will
2501 * advance bv_offset and adjust bv_len to compensate.
2502 * Print a warning for nonzero offsets, and an error
2503 * if they don't add up to a full page. */
2504 if (bvec
->bv_offset
|| bvec
->bv_len
!= PAGE_CACHE_SIZE
) {
2505 if (bvec
->bv_offset
+ bvec
->bv_len
!= PAGE_CACHE_SIZE
)
2506 btrfs_err(BTRFS_I(page
->mapping
->host
)->root
->fs_info
,
2507 "partial page write in btrfs with offset %u and length %u",
2508 bvec
->bv_offset
, bvec
->bv_len
);
2510 btrfs_info(BTRFS_I(page
->mapping
->host
)->root
->fs_info
,
2511 "incomplete page write in btrfs with offset %u and "
2513 bvec
->bv_offset
, bvec
->bv_len
);
2516 start
= page_offset(page
);
2517 end
= start
+ bvec
->bv_offset
+ bvec
->bv_len
- 1;
2519 if (end_extent_writepage(page
, err
, start
, end
))
2522 end_page_writeback(page
);
2529 endio_readpage_release_extent(struct extent_io_tree
*tree
, u64 start
, u64 len
,
2532 struct extent_state
*cached
= NULL
;
2533 u64 end
= start
+ len
- 1;
2535 if (uptodate
&& tree
->track_uptodate
)
2536 set_extent_uptodate(tree
, start
, end
, &cached
, GFP_ATOMIC
);
2537 unlock_extent_cached(tree
, start
, end
, &cached
, GFP_ATOMIC
);
2541 * after a readpage IO is done, we need to:
2542 * clear the uptodate bits on error
2543 * set the uptodate bits if things worked
2544 * set the page up to date if all extents in the tree are uptodate
2545 * clear the lock bit in the extent tree
2546 * unlock the page if there are no other extents locked for it
2548 * Scheduling is not allowed, so the extent state tree is expected
2549 * to have one and only one object corresponding to this IO.
2551 static void end_bio_extent_readpage(struct bio
*bio
, int err
)
2553 struct bio_vec
*bvec
;
2554 int uptodate
= test_bit(BIO_UPTODATE
, &bio
->bi_flags
);
2555 struct btrfs_io_bio
*io_bio
= btrfs_io_bio(bio
);
2556 struct extent_io_tree
*tree
;
2561 u64 extent_start
= 0;
2570 bio_for_each_segment_all(bvec
, bio
, i
) {
2571 struct page
*page
= bvec
->bv_page
;
2572 struct inode
*inode
= page
->mapping
->host
;
2574 pr_debug("end_bio_extent_readpage: bi_sector=%llu, err=%d, "
2575 "mirror=%u\n", (u64
)bio
->bi_iter
.bi_sector
, err
,
2576 io_bio
->mirror_num
);
2577 tree
= &BTRFS_I(inode
)->io_tree
;
2579 /* We always issue full-page reads, but if some block
2580 * in a page fails to read, blk_update_request() will
2581 * advance bv_offset and adjust bv_len to compensate.
2582 * Print a warning for nonzero offsets, and an error
2583 * if they don't add up to a full page. */
2584 if (bvec
->bv_offset
|| bvec
->bv_len
!= PAGE_CACHE_SIZE
) {
2585 if (bvec
->bv_offset
+ bvec
->bv_len
!= PAGE_CACHE_SIZE
)
2586 btrfs_err(BTRFS_I(page
->mapping
->host
)->root
->fs_info
,
2587 "partial page read in btrfs with offset %u and length %u",
2588 bvec
->bv_offset
, bvec
->bv_len
);
2590 btrfs_info(BTRFS_I(page
->mapping
->host
)->root
->fs_info
,
2591 "incomplete page read in btrfs with offset %u and "
2593 bvec
->bv_offset
, bvec
->bv_len
);
2596 start
= page_offset(page
);
2597 end
= start
+ bvec
->bv_offset
+ bvec
->bv_len
- 1;
2600 mirror
= io_bio
->mirror_num
;
2601 if (likely(uptodate
&& tree
->ops
&&
2602 tree
->ops
->readpage_end_io_hook
)) {
2603 ret
= tree
->ops
->readpage_end_io_hook(io_bio
, offset
,
2609 clean_io_failure(inode
, start
, page
, 0);
2612 if (likely(uptodate
))
2615 if (tree
->ops
&& tree
->ops
->readpage_io_failed_hook
) {
2616 ret
= tree
->ops
->readpage_io_failed_hook(page
, mirror
);
2618 test_bit(BIO_UPTODATE
, &bio
->bi_flags
))
2622 * The generic bio_readpage_error handles errors the
2623 * following way: If possible, new read requests are
2624 * created and submitted and will end up in
2625 * end_bio_extent_readpage as well (if we're lucky, not
2626 * in the !uptodate case). In that case it returns 0 and
2627 * we just go on with the next page in our bio. If it
2628 * can't handle the error it will return -EIO and we
2629 * remain responsible for that page.
2631 ret
= bio_readpage_error(bio
, offset
, page
, start
, end
,
2635 test_bit(BIO_UPTODATE
, &bio
->bi_flags
);
2643 if (likely(uptodate
)) {
2644 loff_t i_size
= i_size_read(inode
);
2645 pgoff_t end_index
= i_size
>> PAGE_CACHE_SHIFT
;
2648 /* Zero out the end if this page straddles i_size */
2649 off
= i_size
& (PAGE_CACHE_SIZE
-1);
2650 if (page
->index
== end_index
&& off
)
2651 zero_user_segment(page
, off
, PAGE_CACHE_SIZE
);
2652 SetPageUptodate(page
);
2654 ClearPageUptodate(page
);
2660 if (unlikely(!uptodate
)) {
2662 endio_readpage_release_extent(tree
,
2668 endio_readpage_release_extent(tree
, start
,
2669 end
- start
+ 1, 0);
2670 } else if (!extent_len
) {
2671 extent_start
= start
;
2672 extent_len
= end
+ 1 - start
;
2673 } else if (extent_start
+ extent_len
== start
) {
2674 extent_len
+= end
+ 1 - start
;
2676 endio_readpage_release_extent(tree
, extent_start
,
2677 extent_len
, uptodate
);
2678 extent_start
= start
;
2679 extent_len
= end
+ 1 - start
;
2684 endio_readpage_release_extent(tree
, extent_start
, extent_len
,
2687 io_bio
->end_io(io_bio
, err
);
2692 * this allocates from the btrfs_bioset. We're returning a bio right now
2693 * but you can call btrfs_io_bio for the appropriate container_of magic
2696 btrfs_bio_alloc(struct block_device
*bdev
, u64 first_sector
, int nr_vecs
,
2699 struct btrfs_io_bio
*btrfs_bio
;
2702 bio
= bio_alloc_bioset(gfp_flags
, nr_vecs
, btrfs_bioset
);
2704 if (bio
== NULL
&& (current
->flags
& PF_MEMALLOC
)) {
2705 while (!bio
&& (nr_vecs
/= 2)) {
2706 bio
= bio_alloc_bioset(gfp_flags
,
2707 nr_vecs
, btrfs_bioset
);
2712 bio
->bi_bdev
= bdev
;
2713 bio
->bi_iter
.bi_sector
= first_sector
;
2714 btrfs_bio
= btrfs_io_bio(bio
);
2715 btrfs_bio
->csum
= NULL
;
2716 btrfs_bio
->csum_allocated
= NULL
;
2717 btrfs_bio
->end_io
= NULL
;
2722 struct bio
*btrfs_bio_clone(struct bio
*bio
, gfp_t gfp_mask
)
2724 struct btrfs_io_bio
*btrfs_bio
;
2727 new = bio_clone_bioset(bio
, gfp_mask
, btrfs_bioset
);
2729 btrfs_bio
= btrfs_io_bio(new);
2730 btrfs_bio
->csum
= NULL
;
2731 btrfs_bio
->csum_allocated
= NULL
;
2732 btrfs_bio
->end_io
= NULL
;
2733 /* FIXME, put this into bio_clone_bioset */
2735 bio_associate_blkcg(new, bio
->bi_css
);
2740 /* this also allocates from the btrfs_bioset */
2741 struct bio
*btrfs_io_bio_alloc(gfp_t gfp_mask
, unsigned int nr_iovecs
)
2743 struct btrfs_io_bio
*btrfs_bio
;
2746 bio
= bio_alloc_bioset(gfp_mask
, nr_iovecs
, btrfs_bioset
);
2748 btrfs_bio
= btrfs_io_bio(bio
);
2749 btrfs_bio
->csum
= NULL
;
2750 btrfs_bio
->csum_allocated
= NULL
;
2751 btrfs_bio
->end_io
= NULL
;
2757 static int __must_check
submit_one_bio(int rw
, struct bio
*bio
,
2758 int mirror_num
, unsigned long bio_flags
)
2761 struct bio_vec
*bvec
= bio
->bi_io_vec
+ bio
->bi_vcnt
- 1;
2762 struct page
*page
= bvec
->bv_page
;
2763 struct extent_io_tree
*tree
= bio
->bi_private
;
2766 start
= page_offset(page
) + bvec
->bv_offset
;
2768 bio
->bi_private
= NULL
;
2772 if (tree
->ops
&& tree
->ops
->submit_bio_hook
)
2773 ret
= tree
->ops
->submit_bio_hook(page
->mapping
->host
, rw
, bio
,
2774 mirror_num
, bio_flags
, start
);
2776 btrfsic_submit_bio(rw
, bio
);
2782 static int merge_bio(int rw
, struct extent_io_tree
*tree
, struct page
*page
,
2783 unsigned long offset
, size_t size
, struct bio
*bio
,
2784 unsigned long bio_flags
)
2787 if (tree
->ops
&& tree
->ops
->merge_bio_hook
)
2788 ret
= tree
->ops
->merge_bio_hook(rw
, page
, offset
, size
, bio
,
2795 static int submit_extent_page(int rw
, struct extent_io_tree
*tree
,
2796 struct writeback_control
*wbc
,
2797 struct page
*page
, sector_t sector
,
2798 size_t size
, unsigned long offset
,
2799 struct block_device
*bdev
,
2800 struct bio
**bio_ret
,
2801 unsigned long max_pages
,
2802 bio_end_io_t end_io_func
,
2804 unsigned long prev_bio_flags
,
2805 unsigned long bio_flags
)
2811 int this_compressed
= bio_flags
& EXTENT_BIO_COMPRESSED
;
2812 int old_compressed
= prev_bio_flags
& EXTENT_BIO_COMPRESSED
;
2813 size_t page_size
= min_t(size_t, size
, PAGE_CACHE_SIZE
);
2815 if (bio_ret
&& *bio_ret
) {
2818 contig
= bio
->bi_iter
.bi_sector
== sector
;
2820 contig
= bio_end_sector(bio
) == sector
;
2822 if (prev_bio_flags
!= bio_flags
|| !contig
||
2823 merge_bio(rw
, tree
, page
, offset
, page_size
, bio
, bio_flags
) ||
2824 bio_add_page(bio
, page
, page_size
, offset
) < page_size
) {
2825 ret
= submit_one_bio(rw
, bio
, mirror_num
,
2834 wbc_account_io(wbc
, page
, page_size
);
2838 if (this_compressed
)
2841 nr
= bio_get_nr_vecs(bdev
);
2843 bio
= btrfs_bio_alloc(bdev
, sector
, nr
, GFP_NOFS
| __GFP_HIGH
);
2847 bio_add_page(bio
, page
, page_size
, offset
);
2848 bio
->bi_end_io
= end_io_func
;
2849 bio
->bi_private
= tree
;
2851 wbc_init_bio(wbc
, bio
);
2852 wbc_account_io(wbc
, page
, page_size
);
2858 ret
= submit_one_bio(rw
, bio
, mirror_num
, bio_flags
);
2863 static void attach_extent_buffer_page(struct extent_buffer
*eb
,
2866 if (!PagePrivate(page
)) {
2867 SetPagePrivate(page
);
2868 page_cache_get(page
);
2869 set_page_private(page
, (unsigned long)eb
);
2871 WARN_ON(page
->private != (unsigned long)eb
);
2875 void set_page_extent_mapped(struct page
*page
)
2877 if (!PagePrivate(page
)) {
2878 SetPagePrivate(page
);
2879 page_cache_get(page
);
2880 set_page_private(page
, EXTENT_PAGE_PRIVATE
);
2884 static struct extent_map
*
2885 __get_extent_map(struct inode
*inode
, struct page
*page
, size_t pg_offset
,
2886 u64 start
, u64 len
, get_extent_t
*get_extent
,
2887 struct extent_map
**em_cached
)
2889 struct extent_map
*em
;
2891 if (em_cached
&& *em_cached
) {
2893 if (extent_map_in_tree(em
) && start
>= em
->start
&&
2894 start
< extent_map_end(em
)) {
2895 atomic_inc(&em
->refs
);
2899 free_extent_map(em
);
2903 em
= get_extent(inode
, page
, pg_offset
, start
, len
, 0);
2904 if (em_cached
&& !IS_ERR_OR_NULL(em
)) {
2906 atomic_inc(&em
->refs
);
2912 * basic readpage implementation. Locked extent state structs are inserted
2913 * into the tree that are removed when the IO is done (by the end_io
2915 * XXX JDM: This needs looking at to ensure proper page locking
2917 static int __do_readpage(struct extent_io_tree
*tree
,
2919 get_extent_t
*get_extent
,
2920 struct extent_map
**em_cached
,
2921 struct bio
**bio
, int mirror_num
,
2922 unsigned long *bio_flags
, int rw
)
2924 struct inode
*inode
= page
->mapping
->host
;
2925 u64 start
= page_offset(page
);
2926 u64 page_end
= start
+ PAGE_CACHE_SIZE
- 1;
2930 u64 last_byte
= i_size_read(inode
);
2934 struct extent_map
*em
;
2935 struct block_device
*bdev
;
2938 int parent_locked
= *bio_flags
& EXTENT_BIO_PARENT_LOCKED
;
2939 size_t pg_offset
= 0;
2941 size_t disk_io_size
;
2942 size_t blocksize
= inode
->i_sb
->s_blocksize
;
2943 unsigned long this_bio_flag
= *bio_flags
& EXTENT_BIO_PARENT_LOCKED
;
2945 set_page_extent_mapped(page
);
2948 if (!PageUptodate(page
)) {
2949 if (cleancache_get_page(page
) == 0) {
2950 BUG_ON(blocksize
!= PAGE_SIZE
);
2951 unlock_extent(tree
, start
, end
);
2956 if (page
->index
== last_byte
>> PAGE_CACHE_SHIFT
) {
2958 size_t zero_offset
= last_byte
& (PAGE_CACHE_SIZE
- 1);
2961 iosize
= PAGE_CACHE_SIZE
- zero_offset
;
2962 userpage
= kmap_atomic(page
);
2963 memset(userpage
+ zero_offset
, 0, iosize
);
2964 flush_dcache_page(page
);
2965 kunmap_atomic(userpage
);
2968 while (cur
<= end
) {
2969 unsigned long pnr
= (last_byte
>> PAGE_CACHE_SHIFT
) + 1;
2971 if (cur
>= last_byte
) {
2973 struct extent_state
*cached
= NULL
;
2975 iosize
= PAGE_CACHE_SIZE
- pg_offset
;
2976 userpage
= kmap_atomic(page
);
2977 memset(userpage
+ pg_offset
, 0, iosize
);
2978 flush_dcache_page(page
);
2979 kunmap_atomic(userpage
);
2980 set_extent_uptodate(tree
, cur
, cur
+ iosize
- 1,
2983 unlock_extent_cached(tree
, cur
,
2988 em
= __get_extent_map(inode
, page
, pg_offset
, cur
,
2989 end
- cur
+ 1, get_extent
, em_cached
);
2990 if (IS_ERR_OR_NULL(em
)) {
2993 unlock_extent(tree
, cur
, end
);
2996 extent_offset
= cur
- em
->start
;
2997 BUG_ON(extent_map_end(em
) <= cur
);
3000 if (test_bit(EXTENT_FLAG_COMPRESSED
, &em
->flags
)) {
3001 this_bio_flag
|= EXTENT_BIO_COMPRESSED
;
3002 extent_set_compress_type(&this_bio_flag
,
3006 iosize
= min(extent_map_end(em
) - cur
, end
- cur
+ 1);
3007 cur_end
= min(extent_map_end(em
) - 1, end
);
3008 iosize
= ALIGN(iosize
, blocksize
);
3009 if (this_bio_flag
& EXTENT_BIO_COMPRESSED
) {
3010 disk_io_size
= em
->block_len
;
3011 sector
= em
->block_start
>> 9;
3013 sector
= (em
->block_start
+ extent_offset
) >> 9;
3014 disk_io_size
= iosize
;
3017 block_start
= em
->block_start
;
3018 if (test_bit(EXTENT_FLAG_PREALLOC
, &em
->flags
))
3019 block_start
= EXTENT_MAP_HOLE
;
3020 free_extent_map(em
);
3023 /* we've found a hole, just zero and go on */
3024 if (block_start
== EXTENT_MAP_HOLE
) {
3026 struct extent_state
*cached
= NULL
;
3028 userpage
= kmap_atomic(page
);
3029 memset(userpage
+ pg_offset
, 0, iosize
);
3030 flush_dcache_page(page
);
3031 kunmap_atomic(userpage
);
3033 set_extent_uptodate(tree
, cur
, cur
+ iosize
- 1,
3035 unlock_extent_cached(tree
, cur
, cur
+ iosize
- 1,
3038 pg_offset
+= iosize
;
3041 /* the get_extent function already copied into the page */
3042 if (test_range_bit(tree
, cur
, cur_end
,
3043 EXTENT_UPTODATE
, 1, NULL
)) {
3044 check_page_uptodate(tree
, page
);
3046 unlock_extent(tree
, cur
, cur
+ iosize
- 1);
3048 pg_offset
+= iosize
;
3051 /* we have an inline extent but it didn't get marked up
3052 * to date. Error out
3054 if (block_start
== EXTENT_MAP_INLINE
) {
3057 unlock_extent(tree
, cur
, cur
+ iosize
- 1);
3059 pg_offset
+= iosize
;
3064 ret
= submit_extent_page(rw
, tree
, NULL
, page
,
3065 sector
, disk_io_size
, pg_offset
,
3067 end_bio_extent_readpage
, mirror_num
,
3072 *bio_flags
= this_bio_flag
;
3076 unlock_extent(tree
, cur
, cur
+ iosize
- 1);
3079 pg_offset
+= iosize
;
3083 if (!PageError(page
))
3084 SetPageUptodate(page
);
3090 static inline void __do_contiguous_readpages(struct extent_io_tree
*tree
,
3091 struct page
*pages
[], int nr_pages
,
3093 get_extent_t
*get_extent
,
3094 struct extent_map
**em_cached
,
3095 struct bio
**bio
, int mirror_num
,
3096 unsigned long *bio_flags
, int rw
)
3098 struct inode
*inode
;
3099 struct btrfs_ordered_extent
*ordered
;
3102 inode
= pages
[0]->mapping
->host
;
3104 lock_extent(tree
, start
, end
);
3105 ordered
= btrfs_lookup_ordered_range(inode
, start
,
3109 unlock_extent(tree
, start
, end
);
3110 btrfs_start_ordered_extent(inode
, ordered
, 1);
3111 btrfs_put_ordered_extent(ordered
);
3114 for (index
= 0; index
< nr_pages
; index
++) {
3115 __do_readpage(tree
, pages
[index
], get_extent
, em_cached
, bio
,
3116 mirror_num
, bio_flags
, rw
);
3117 page_cache_release(pages
[index
]);
3121 static void __extent_readpages(struct extent_io_tree
*tree
,
3122 struct page
*pages
[],
3123 int nr_pages
, get_extent_t
*get_extent
,
3124 struct extent_map
**em_cached
,
3125 struct bio
**bio
, int mirror_num
,
3126 unsigned long *bio_flags
, int rw
)
3132 int first_index
= 0;
3134 for (index
= 0; index
< nr_pages
; index
++) {
3135 page_start
= page_offset(pages
[index
]);
3138 end
= start
+ PAGE_CACHE_SIZE
- 1;
3139 first_index
= index
;
3140 } else if (end
+ 1 == page_start
) {
3141 end
+= PAGE_CACHE_SIZE
;
3143 __do_contiguous_readpages(tree
, &pages
[first_index
],
3144 index
- first_index
, start
,
3145 end
, get_extent
, em_cached
,
3146 bio
, mirror_num
, bio_flags
,
3149 end
= start
+ PAGE_CACHE_SIZE
- 1;
3150 first_index
= index
;
3155 __do_contiguous_readpages(tree
, &pages
[first_index
],
3156 index
- first_index
, start
,
3157 end
, get_extent
, em_cached
, bio
,
3158 mirror_num
, bio_flags
, rw
);
3161 static int __extent_read_full_page(struct extent_io_tree
*tree
,
3163 get_extent_t
*get_extent
,
3164 struct bio
**bio
, int mirror_num
,
3165 unsigned long *bio_flags
, int rw
)
3167 struct inode
*inode
= page
->mapping
->host
;
3168 struct btrfs_ordered_extent
*ordered
;
3169 u64 start
= page_offset(page
);
3170 u64 end
= start
+ PAGE_CACHE_SIZE
- 1;
3174 lock_extent(tree
, start
, end
);
3175 ordered
= btrfs_lookup_ordered_extent(inode
, start
);
3178 unlock_extent(tree
, start
, end
);
3179 btrfs_start_ordered_extent(inode
, ordered
, 1);
3180 btrfs_put_ordered_extent(ordered
);
3183 ret
= __do_readpage(tree
, page
, get_extent
, NULL
, bio
, mirror_num
,
3188 int extent_read_full_page(struct extent_io_tree
*tree
, struct page
*page
,
3189 get_extent_t
*get_extent
, int mirror_num
)
3191 struct bio
*bio
= NULL
;
3192 unsigned long bio_flags
= 0;
3195 ret
= __extent_read_full_page(tree
, page
, get_extent
, &bio
, mirror_num
,
3198 ret
= submit_one_bio(READ
, bio
, mirror_num
, bio_flags
);
3202 int extent_read_full_page_nolock(struct extent_io_tree
*tree
, struct page
*page
,
3203 get_extent_t
*get_extent
, int mirror_num
)
3205 struct bio
*bio
= NULL
;
3206 unsigned long bio_flags
= EXTENT_BIO_PARENT_LOCKED
;
3209 ret
= __do_readpage(tree
, page
, get_extent
, NULL
, &bio
, mirror_num
,
3212 ret
= submit_one_bio(READ
, bio
, mirror_num
, bio_flags
);
3216 static noinline
void update_nr_written(struct page
*page
,
3217 struct writeback_control
*wbc
,
3218 unsigned long nr_written
)
3220 wbc
->nr_to_write
-= nr_written
;
3221 if (wbc
->range_cyclic
|| (wbc
->nr_to_write
> 0 &&
3222 wbc
->range_start
== 0 && wbc
->range_end
== LLONG_MAX
))
3223 page
->mapping
->writeback_index
= page
->index
+ nr_written
;
3227 * helper for __extent_writepage, doing all of the delayed allocation setup.
3229 * This returns 1 if our fill_delalloc function did all the work required
3230 * to write the page (copy into inline extent). In this case the IO has
3231 * been started and the page is already unlocked.
3233 * This returns 0 if all went well (page still locked)
3234 * This returns < 0 if there were errors (page still locked)
3236 static noinline_for_stack
int writepage_delalloc(struct inode
*inode
,
3237 struct page
*page
, struct writeback_control
*wbc
,
3238 struct extent_page_data
*epd
,
3240 unsigned long *nr_written
)
3242 struct extent_io_tree
*tree
= epd
->tree
;
3243 u64 page_end
= delalloc_start
+ PAGE_CACHE_SIZE
- 1;
3245 u64 delalloc_to_write
= 0;
3246 u64 delalloc_end
= 0;
3248 int page_started
= 0;
3250 if (epd
->extent_locked
|| !tree
->ops
|| !tree
->ops
->fill_delalloc
)
3253 while (delalloc_end
< page_end
) {
3254 nr_delalloc
= find_lock_delalloc_range(inode
, tree
,
3258 BTRFS_MAX_EXTENT_SIZE
);
3259 if (nr_delalloc
== 0) {
3260 delalloc_start
= delalloc_end
+ 1;
3263 ret
= tree
->ops
->fill_delalloc(inode
, page
,
3268 /* File system has been set read-only */
3271 /* fill_delalloc should be return < 0 for error
3272 * but just in case, we use > 0 here meaning the
3273 * IO is started, so we don't want to return > 0
3274 * unless things are going well.
3276 ret
= ret
< 0 ? ret
: -EIO
;
3280 * delalloc_end is already one less than the total
3281 * length, so we don't subtract one from
3284 delalloc_to_write
+= (delalloc_end
- delalloc_start
+
3287 delalloc_start
= delalloc_end
+ 1;
3289 if (wbc
->nr_to_write
< delalloc_to_write
) {
3292 if (delalloc_to_write
< thresh
* 2)
3293 thresh
= delalloc_to_write
;
3294 wbc
->nr_to_write
= min_t(u64
, delalloc_to_write
,
3298 /* did the fill delalloc function already unlock and start
3303 * we've unlocked the page, so we can't update
3304 * the mapping's writeback index, just update
3307 wbc
->nr_to_write
-= *nr_written
;
3318 * helper for __extent_writepage. This calls the writepage start hooks,
3319 * and does the loop to map the page into extents and bios.
3321 * We return 1 if the IO is started and the page is unlocked,
3322 * 0 if all went well (page still locked)
3323 * < 0 if there were errors (page still locked)
3325 static noinline_for_stack
int __extent_writepage_io(struct inode
*inode
,
3327 struct writeback_control
*wbc
,
3328 struct extent_page_data
*epd
,
3330 unsigned long nr_written
,
3331 int write_flags
, int *nr_ret
)
3333 struct extent_io_tree
*tree
= epd
->tree
;
3334 u64 start
= page_offset(page
);
3335 u64 page_end
= start
+ PAGE_CACHE_SIZE
- 1;
3342 struct extent_state
*cached_state
= NULL
;
3343 struct extent_map
*em
;
3344 struct block_device
*bdev
;
3345 size_t pg_offset
= 0;
3351 if (tree
->ops
&& tree
->ops
->writepage_start_hook
) {
3352 ret
= tree
->ops
->writepage_start_hook(page
, start
,
3355 /* Fixup worker will requeue */
3357 wbc
->pages_skipped
++;
3359 redirty_page_for_writepage(wbc
, page
);
3361 update_nr_written(page
, wbc
, nr_written
);
3369 * we don't want to touch the inode after unlocking the page,
3370 * so we update the mapping writeback index now
3372 update_nr_written(page
, wbc
, nr_written
+ 1);
3375 if (i_size
<= start
) {
3376 if (tree
->ops
&& tree
->ops
->writepage_end_io_hook
)
3377 tree
->ops
->writepage_end_io_hook(page
, start
,
3382 blocksize
= inode
->i_sb
->s_blocksize
;
3384 while (cur
<= end
) {
3386 if (cur
>= i_size
) {
3387 if (tree
->ops
&& tree
->ops
->writepage_end_io_hook
)
3388 tree
->ops
->writepage_end_io_hook(page
, cur
,
3392 em
= epd
->get_extent(inode
, page
, pg_offset
, cur
,
3394 if (IS_ERR_OR_NULL(em
)) {
3396 ret
= PTR_ERR_OR_ZERO(em
);
3400 extent_offset
= cur
- em
->start
;
3401 em_end
= extent_map_end(em
);
3402 BUG_ON(em_end
<= cur
);
3404 iosize
= min(em_end
- cur
, end
- cur
+ 1);
3405 iosize
= ALIGN(iosize
, blocksize
);
3406 sector
= (em
->block_start
+ extent_offset
) >> 9;
3408 block_start
= em
->block_start
;
3409 compressed
= test_bit(EXTENT_FLAG_COMPRESSED
, &em
->flags
);
3410 free_extent_map(em
);
3414 * compressed and inline extents are written through other
3417 if (compressed
|| block_start
== EXTENT_MAP_HOLE
||
3418 block_start
== EXTENT_MAP_INLINE
) {
3420 * end_io notification does not happen here for
3421 * compressed extents
3423 if (!compressed
&& tree
->ops
&&
3424 tree
->ops
->writepage_end_io_hook
)
3425 tree
->ops
->writepage_end_io_hook(page
, cur
,
3428 else if (compressed
) {
3429 /* we don't want to end_page_writeback on
3430 * a compressed extent. this happens
3437 pg_offset
+= iosize
;
3441 if (tree
->ops
&& tree
->ops
->writepage_io_hook
) {
3442 ret
= tree
->ops
->writepage_io_hook(page
, cur
,
3450 unsigned long max_nr
= (i_size
>> PAGE_CACHE_SHIFT
) + 1;
3452 set_range_writeback(tree
, cur
, cur
+ iosize
- 1);
3453 if (!PageWriteback(page
)) {
3454 btrfs_err(BTRFS_I(inode
)->root
->fs_info
,
3455 "page %lu not writeback, cur %llu end %llu",
3456 page
->index
, cur
, end
);
3459 ret
= submit_extent_page(write_flags
, tree
, wbc
, page
,
3460 sector
, iosize
, pg_offset
,
3461 bdev
, &epd
->bio
, max_nr
,
3462 end_bio_extent_writepage
,
3468 pg_offset
+= iosize
;
3476 /* drop our reference on any cached states */
3477 free_extent_state(cached_state
);
3482 * the writepage semantics are similar to regular writepage. extent
3483 * records are inserted to lock ranges in the tree, and as dirty areas
3484 * are found, they are marked writeback. Then the lock bits are removed
3485 * and the end_io handler clears the writeback ranges
3487 static int __extent_writepage(struct page
*page
, struct writeback_control
*wbc
,
3490 struct inode
*inode
= page
->mapping
->host
;
3491 struct extent_page_data
*epd
= data
;
3492 u64 start
= page_offset(page
);
3493 u64 page_end
= start
+ PAGE_CACHE_SIZE
- 1;
3496 size_t pg_offset
= 0;
3497 loff_t i_size
= i_size_read(inode
);
3498 unsigned long end_index
= i_size
>> PAGE_CACHE_SHIFT
;
3500 unsigned long nr_written
= 0;
3502 if (wbc
->sync_mode
== WB_SYNC_ALL
)
3503 write_flags
= WRITE_SYNC
;
3505 write_flags
= WRITE
;
3507 trace___extent_writepage(page
, inode
, wbc
);
3509 WARN_ON(!PageLocked(page
));
3511 ClearPageError(page
);
3513 pg_offset
= i_size
& (PAGE_CACHE_SIZE
- 1);
3514 if (page
->index
> end_index
||
3515 (page
->index
== end_index
&& !pg_offset
)) {
3516 page
->mapping
->a_ops
->invalidatepage(page
, 0, PAGE_CACHE_SIZE
);
3521 if (page
->index
== end_index
) {
3524 userpage
= kmap_atomic(page
);
3525 memset(userpage
+ pg_offset
, 0,
3526 PAGE_CACHE_SIZE
- pg_offset
);
3527 kunmap_atomic(userpage
);
3528 flush_dcache_page(page
);
3533 set_page_extent_mapped(page
);
3535 ret
= writepage_delalloc(inode
, page
, wbc
, epd
, start
, &nr_written
);
3541 ret
= __extent_writepage_io(inode
, page
, wbc
, epd
,
3542 i_size
, nr_written
, write_flags
, &nr
);
3548 /* make sure the mapping tag for page dirty gets cleared */
3549 set_page_writeback(page
);
3550 end_page_writeback(page
);
3552 if (PageError(page
)) {
3553 ret
= ret
< 0 ? ret
: -EIO
;
3554 end_extent_writepage(page
, ret
, start
, page_end
);
3563 void wait_on_extent_buffer_writeback(struct extent_buffer
*eb
)
3565 wait_on_bit_io(&eb
->bflags
, EXTENT_BUFFER_WRITEBACK
,
3566 TASK_UNINTERRUPTIBLE
);
3569 static noinline_for_stack
int
3570 lock_extent_buffer_for_io(struct extent_buffer
*eb
,
3571 struct btrfs_fs_info
*fs_info
,
3572 struct extent_page_data
*epd
)
3574 unsigned long i
, num_pages
;
3578 if (!btrfs_try_tree_write_lock(eb
)) {
3580 flush_write_bio(epd
);
3581 btrfs_tree_lock(eb
);
3584 if (test_bit(EXTENT_BUFFER_WRITEBACK
, &eb
->bflags
)) {
3585 btrfs_tree_unlock(eb
);
3589 flush_write_bio(epd
);
3593 wait_on_extent_buffer_writeback(eb
);
3594 btrfs_tree_lock(eb
);
3595 if (!test_bit(EXTENT_BUFFER_WRITEBACK
, &eb
->bflags
))
3597 btrfs_tree_unlock(eb
);
3602 * We need to do this to prevent races in people who check if the eb is
3603 * under IO since we can end up having no IO bits set for a short period
3606 spin_lock(&eb
->refs_lock
);
3607 if (test_and_clear_bit(EXTENT_BUFFER_DIRTY
, &eb
->bflags
)) {
3608 set_bit(EXTENT_BUFFER_WRITEBACK
, &eb
->bflags
);
3609 spin_unlock(&eb
->refs_lock
);
3610 btrfs_set_header_flag(eb
, BTRFS_HEADER_FLAG_WRITTEN
);
3611 __percpu_counter_add(&fs_info
->dirty_metadata_bytes
,
3613 fs_info
->dirty_metadata_batch
);
3616 spin_unlock(&eb
->refs_lock
);
3619 btrfs_tree_unlock(eb
);
3624 num_pages
= num_extent_pages(eb
->start
, eb
->len
);
3625 for (i
= 0; i
< num_pages
; i
++) {
3626 struct page
*p
= eb
->pages
[i
];
3628 if (!trylock_page(p
)) {
3630 flush_write_bio(epd
);
3640 static void end_extent_buffer_writeback(struct extent_buffer
*eb
)
3642 clear_bit(EXTENT_BUFFER_WRITEBACK
, &eb
->bflags
);
3643 smp_mb__after_atomic();
3644 wake_up_bit(&eb
->bflags
, EXTENT_BUFFER_WRITEBACK
);
3647 static void set_btree_ioerr(struct page
*page
)
3649 struct extent_buffer
*eb
= (struct extent_buffer
*)page
->private;
3650 struct btrfs_inode
*btree_ino
= BTRFS_I(eb
->fs_info
->btree_inode
);
3653 if (test_and_set_bit(EXTENT_BUFFER_WRITE_ERR
, &eb
->bflags
))
3657 * If writeback for a btree extent that doesn't belong to a log tree
3658 * failed, increment the counter transaction->eb_write_errors.
3659 * We do this because while the transaction is running and before it's
3660 * committing (when we call filemap_fdata[write|wait]_range against
3661 * the btree inode), we might have
3662 * btree_inode->i_mapping->a_ops->writepages() called by the VM - if it
3663 * returns an error or an error happens during writeback, when we're
3664 * committing the transaction we wouldn't know about it, since the pages
3665 * can be no longer dirty nor marked anymore for writeback (if a
3666 * subsequent modification to the extent buffer didn't happen before the
3667 * transaction commit), which makes filemap_fdata[write|wait]_range not
3668 * able to find the pages tagged with SetPageError at transaction
3669 * commit time. So if this happens we must abort the transaction,
3670 * otherwise we commit a super block with btree roots that point to
3671 * btree nodes/leafs whose content on disk is invalid - either garbage
3672 * or the content of some node/leaf from a past generation that got
3673 * cowed or deleted and is no longer valid.
3675 * Note: setting AS_EIO/AS_ENOSPC in the btree inode's i_mapping would
3676 * not be enough - we need to distinguish between log tree extents vs
3677 * non-log tree extents, and the next filemap_fdatawait_range() call
3678 * will catch and clear such errors in the mapping - and that call might
3679 * be from a log sync and not from a transaction commit. Also, checking
3680 * for the eb flag EXTENT_BUFFER_WRITE_ERR at transaction commit time is
3681 * not done and would not be reliable - the eb might have been released
3682 * from memory and reading it back again means that flag would not be
3683 * set (since it's a runtime flag, not persisted on disk).
3685 * Using the flags below in the btree inode also makes us achieve the
3686 * goal of AS_EIO/AS_ENOSPC when writepages() returns success, started
3687 * writeback for all dirty pages and before filemap_fdatawait_range()
3688 * is called, the writeback for all dirty pages had already finished
3689 * with errors - because we were not using AS_EIO/AS_ENOSPC,
3690 * filemap_fdatawait_range() would return success, as it could not know
3691 * that writeback errors happened (the pages were no longer tagged for
3694 switch (eb
->log_index
) {
3696 set_bit(BTRFS_INODE_BTREE_ERR
, &btree_ino
->runtime_flags
);
3699 set_bit(BTRFS_INODE_BTREE_LOG1_ERR
, &btree_ino
->runtime_flags
);
3702 set_bit(BTRFS_INODE_BTREE_LOG2_ERR
, &btree_ino
->runtime_flags
);
3705 BUG(); /* unexpected, logic error */
3709 static void end_bio_extent_buffer_writepage(struct bio
*bio
, int err
)
3711 struct bio_vec
*bvec
;
3712 struct extent_buffer
*eb
;
3715 bio_for_each_segment_all(bvec
, bio
, i
) {
3716 struct page
*page
= bvec
->bv_page
;
3718 eb
= (struct extent_buffer
*)page
->private;
3720 done
= atomic_dec_and_test(&eb
->io_pages
);
3722 if (err
|| test_bit(EXTENT_BUFFER_WRITE_ERR
, &eb
->bflags
)) {
3723 ClearPageUptodate(page
);
3724 set_btree_ioerr(page
);
3727 end_page_writeback(page
);
3732 end_extent_buffer_writeback(eb
);
3738 static noinline_for_stack
int write_one_eb(struct extent_buffer
*eb
,
3739 struct btrfs_fs_info
*fs_info
,
3740 struct writeback_control
*wbc
,
3741 struct extent_page_data
*epd
)
3743 struct block_device
*bdev
= fs_info
->fs_devices
->latest_bdev
;
3744 struct extent_io_tree
*tree
= &BTRFS_I(fs_info
->btree_inode
)->io_tree
;
3745 u64 offset
= eb
->start
;
3746 unsigned long i
, num_pages
;
3747 unsigned long bio_flags
= 0;
3748 int rw
= (epd
->sync_io
? WRITE_SYNC
: WRITE
) | REQ_META
;
3751 clear_bit(EXTENT_BUFFER_WRITE_ERR
, &eb
->bflags
);
3752 num_pages
= num_extent_pages(eb
->start
, eb
->len
);
3753 atomic_set(&eb
->io_pages
, num_pages
);
3754 if (btrfs_header_owner(eb
) == BTRFS_TREE_LOG_OBJECTID
)
3755 bio_flags
= EXTENT_BIO_TREE_LOG
;
3757 for (i
= 0; i
< num_pages
; i
++) {
3758 struct page
*p
= eb
->pages
[i
];
3760 clear_page_dirty_for_io(p
);
3761 set_page_writeback(p
);
3762 ret
= submit_extent_page(rw
, tree
, wbc
, p
, offset
>> 9,
3763 PAGE_CACHE_SIZE
, 0, bdev
, &epd
->bio
,
3764 -1, end_bio_extent_buffer_writepage
,
3765 0, epd
->bio_flags
, bio_flags
);
3766 epd
->bio_flags
= bio_flags
;
3769 end_page_writeback(p
);
3770 if (atomic_sub_and_test(num_pages
- i
, &eb
->io_pages
))
3771 end_extent_buffer_writeback(eb
);
3775 offset
+= PAGE_CACHE_SIZE
;
3776 update_nr_written(p
, wbc
, 1);
3780 if (unlikely(ret
)) {
3781 for (; i
< num_pages
; i
++) {
3782 struct page
*p
= eb
->pages
[i
];
3783 clear_page_dirty_for_io(p
);
3791 int btree_write_cache_pages(struct address_space
*mapping
,
3792 struct writeback_control
*wbc
)
3794 struct extent_io_tree
*tree
= &BTRFS_I(mapping
->host
)->io_tree
;
3795 struct btrfs_fs_info
*fs_info
= BTRFS_I(mapping
->host
)->root
->fs_info
;
3796 struct extent_buffer
*eb
, *prev_eb
= NULL
;
3797 struct extent_page_data epd
= {
3801 .sync_io
= wbc
->sync_mode
== WB_SYNC_ALL
,
3806 int nr_to_write_done
= 0;
3807 struct pagevec pvec
;
3810 pgoff_t end
; /* Inclusive */
3814 pagevec_init(&pvec
, 0);
3815 if (wbc
->range_cyclic
) {
3816 index
= mapping
->writeback_index
; /* Start from prev offset */
3819 index
= wbc
->range_start
>> PAGE_CACHE_SHIFT
;
3820 end
= wbc
->range_end
>> PAGE_CACHE_SHIFT
;
3823 if (wbc
->sync_mode
== WB_SYNC_ALL
)
3824 tag
= PAGECACHE_TAG_TOWRITE
;
3826 tag
= PAGECACHE_TAG_DIRTY
;
3828 if (wbc
->sync_mode
== WB_SYNC_ALL
)
3829 tag_pages_for_writeback(mapping
, index
, end
);
3830 while (!done
&& !nr_to_write_done
&& (index
<= end
) &&
3831 (nr_pages
= pagevec_lookup_tag(&pvec
, mapping
, &index
, tag
,
3832 min(end
- index
, (pgoff_t
)PAGEVEC_SIZE
-1) + 1))) {
3836 for (i
= 0; i
< nr_pages
; i
++) {
3837 struct page
*page
= pvec
.pages
[i
];
3839 if (!PagePrivate(page
))
3842 if (!wbc
->range_cyclic
&& page
->index
> end
) {
3847 spin_lock(&mapping
->private_lock
);
3848 if (!PagePrivate(page
)) {
3849 spin_unlock(&mapping
->private_lock
);
3853 eb
= (struct extent_buffer
*)page
->private;
3856 * Shouldn't happen and normally this would be a BUG_ON
3857 * but no sense in crashing the users box for something
3858 * we can survive anyway.
3861 spin_unlock(&mapping
->private_lock
);
3865 if (eb
== prev_eb
) {
3866 spin_unlock(&mapping
->private_lock
);
3870 ret
= atomic_inc_not_zero(&eb
->refs
);
3871 spin_unlock(&mapping
->private_lock
);
3876 ret
= lock_extent_buffer_for_io(eb
, fs_info
, &epd
);
3878 free_extent_buffer(eb
);
3882 ret
= write_one_eb(eb
, fs_info
, wbc
, &epd
);
3885 free_extent_buffer(eb
);
3888 free_extent_buffer(eb
);
3891 * the filesystem may choose to bump up nr_to_write.
3892 * We have to make sure to honor the new nr_to_write
3895 nr_to_write_done
= wbc
->nr_to_write
<= 0;
3897 pagevec_release(&pvec
);
3900 if (!scanned
&& !done
) {
3902 * We hit the last page and there is more work to be done: wrap
3903 * back to the start of the file
3909 flush_write_bio(&epd
);
3914 * write_cache_pages - walk the list of dirty pages of the given address space and write all of them.
3915 * @mapping: address space structure to write
3916 * @wbc: subtract the number of written pages from *@wbc->nr_to_write
3917 * @writepage: function called for each page
3918 * @data: data passed to writepage function
3920 * If a page is already under I/O, write_cache_pages() skips it, even
3921 * if it's dirty. This is desirable behaviour for memory-cleaning writeback,
3922 * but it is INCORRECT for data-integrity system calls such as fsync(). fsync()
3923 * and msync() need to guarantee that all the data which was dirty at the time
3924 * the call was made get new I/O started against them. If wbc->sync_mode is
3925 * WB_SYNC_ALL then we were called for data integrity and we must wait for
3926 * existing IO to complete.
3928 static int extent_write_cache_pages(struct extent_io_tree
*tree
,
3929 struct address_space
*mapping
,
3930 struct writeback_control
*wbc
,
3931 writepage_t writepage
, void *data
,
3932 void (*flush_fn
)(void *))
3934 struct inode
*inode
= mapping
->host
;
3938 int nr_to_write_done
= 0;
3939 struct pagevec pvec
;
3942 pgoff_t end
; /* Inclusive */
3947 * We have to hold onto the inode so that ordered extents can do their
3948 * work when the IO finishes. The alternative to this is failing to add
3949 * an ordered extent if the igrab() fails there and that is a huge pain
3950 * to deal with, so instead just hold onto the inode throughout the
3951 * writepages operation. If it fails here we are freeing up the inode
3952 * anyway and we'd rather not waste our time writing out stuff that is
3953 * going to be truncated anyway.
3958 pagevec_init(&pvec
, 0);
3959 if (wbc
->range_cyclic
) {
3960 index
= mapping
->writeback_index
; /* Start from prev offset */
3963 index
= wbc
->range_start
>> PAGE_CACHE_SHIFT
;
3964 end
= wbc
->range_end
>> PAGE_CACHE_SHIFT
;
3967 if (wbc
->sync_mode
== WB_SYNC_ALL
)
3968 tag
= PAGECACHE_TAG_TOWRITE
;
3970 tag
= PAGECACHE_TAG_DIRTY
;
3972 if (wbc
->sync_mode
== WB_SYNC_ALL
)
3973 tag_pages_for_writeback(mapping
, index
, end
);
3974 while (!done
&& !nr_to_write_done
&& (index
<= end
) &&
3975 (nr_pages
= pagevec_lookup_tag(&pvec
, mapping
, &index
, tag
,
3976 min(end
- index
, (pgoff_t
)PAGEVEC_SIZE
-1) + 1))) {
3980 for (i
= 0; i
< nr_pages
; i
++) {
3981 struct page
*page
= pvec
.pages
[i
];
3984 * At this point we hold neither mapping->tree_lock nor
3985 * lock on the page itself: the page may be truncated or
3986 * invalidated (changing page->mapping to NULL), or even
3987 * swizzled back from swapper_space to tmpfs file
3990 if (!trylock_page(page
)) {
3995 if (unlikely(page
->mapping
!= mapping
)) {
4000 if (!wbc
->range_cyclic
&& page
->index
> end
) {
4006 if (wbc
->sync_mode
!= WB_SYNC_NONE
) {
4007 if (PageWriteback(page
))
4009 wait_on_page_writeback(page
);
4012 if (PageWriteback(page
) ||
4013 !clear_page_dirty_for_io(page
)) {
4018 ret
= (*writepage
)(page
, wbc
, data
);
4020 if (unlikely(ret
== AOP_WRITEPAGE_ACTIVATE
)) {
4024 if (!err
&& ret
< 0)
4028 * the filesystem may choose to bump up nr_to_write.
4029 * We have to make sure to honor the new nr_to_write
4032 nr_to_write_done
= wbc
->nr_to_write
<= 0;
4034 pagevec_release(&pvec
);
4037 if (!scanned
&& !done
&& !err
) {
4039 * We hit the last page and there is more work to be done: wrap
4040 * back to the start of the file
4046 btrfs_add_delayed_iput(inode
);
4050 static void flush_epd_write_bio(struct extent_page_data
*epd
)
4059 ret
= submit_one_bio(rw
, epd
->bio
, 0, epd
->bio_flags
);
4060 BUG_ON(ret
< 0); /* -ENOMEM */
4065 static noinline
void flush_write_bio(void *data
)
4067 struct extent_page_data
*epd
= data
;
4068 flush_epd_write_bio(epd
);
4071 int extent_write_full_page(struct extent_io_tree
*tree
, struct page
*page
,
4072 get_extent_t
*get_extent
,
4073 struct writeback_control
*wbc
)
4076 struct extent_page_data epd
= {
4079 .get_extent
= get_extent
,
4081 .sync_io
= wbc
->sync_mode
== WB_SYNC_ALL
,
4085 ret
= __extent_writepage(page
, wbc
, &epd
);
4087 flush_epd_write_bio(&epd
);
4091 int extent_write_locked_range(struct extent_io_tree
*tree
, struct inode
*inode
,
4092 u64 start
, u64 end
, get_extent_t
*get_extent
,
4096 struct address_space
*mapping
= inode
->i_mapping
;
4098 unsigned long nr_pages
= (end
- start
+ PAGE_CACHE_SIZE
) >>
4101 struct extent_page_data epd
= {
4104 .get_extent
= get_extent
,
4106 .sync_io
= mode
== WB_SYNC_ALL
,
4109 struct writeback_control wbc_writepages
= {
4111 .nr_to_write
= nr_pages
* 2,
4112 .range_start
= start
,
4113 .range_end
= end
+ 1,
4116 while (start
<= end
) {
4117 page
= find_get_page(mapping
, start
>> PAGE_CACHE_SHIFT
);
4118 if (clear_page_dirty_for_io(page
))
4119 ret
= __extent_writepage(page
, &wbc_writepages
, &epd
);
4121 if (tree
->ops
&& tree
->ops
->writepage_end_io_hook
)
4122 tree
->ops
->writepage_end_io_hook(page
, start
,
4123 start
+ PAGE_CACHE_SIZE
- 1,
4127 page_cache_release(page
);
4128 start
+= PAGE_CACHE_SIZE
;
4131 flush_epd_write_bio(&epd
);
4135 int extent_writepages(struct extent_io_tree
*tree
,
4136 struct address_space
*mapping
,
4137 get_extent_t
*get_extent
,
4138 struct writeback_control
*wbc
)
4141 struct extent_page_data epd
= {
4144 .get_extent
= get_extent
,
4146 .sync_io
= wbc
->sync_mode
== WB_SYNC_ALL
,
4150 ret
= extent_write_cache_pages(tree
, mapping
, wbc
,
4151 __extent_writepage
, &epd
,
4153 flush_epd_write_bio(&epd
);
4157 int extent_readpages(struct extent_io_tree
*tree
,
4158 struct address_space
*mapping
,
4159 struct list_head
*pages
, unsigned nr_pages
,
4160 get_extent_t get_extent
)
4162 struct bio
*bio
= NULL
;
4164 unsigned long bio_flags
= 0;
4165 struct page
*pagepool
[16];
4167 struct extent_map
*em_cached
= NULL
;
4170 for (page_idx
= 0; page_idx
< nr_pages
; page_idx
++) {
4171 page
= list_entry(pages
->prev
, struct page
, lru
);
4173 prefetchw(&page
->flags
);
4174 list_del(&page
->lru
);
4175 if (add_to_page_cache_lru(page
, mapping
,
4176 page
->index
, GFP_NOFS
)) {
4177 page_cache_release(page
);
4181 pagepool
[nr
++] = page
;
4182 if (nr
< ARRAY_SIZE(pagepool
))
4184 __extent_readpages(tree
, pagepool
, nr
, get_extent
, &em_cached
,
4185 &bio
, 0, &bio_flags
, READ
);
4189 __extent_readpages(tree
, pagepool
, nr
, get_extent
, &em_cached
,
4190 &bio
, 0, &bio_flags
, READ
);
4193 free_extent_map(em_cached
);
4195 BUG_ON(!list_empty(pages
));
4197 return submit_one_bio(READ
, bio
, 0, bio_flags
);
4202 * basic invalidatepage code, this waits on any locked or writeback
4203 * ranges corresponding to the page, and then deletes any extent state
4204 * records from the tree
4206 int extent_invalidatepage(struct extent_io_tree
*tree
,
4207 struct page
*page
, unsigned long offset
)
4209 struct extent_state
*cached_state
= NULL
;
4210 u64 start
= page_offset(page
);
4211 u64 end
= start
+ PAGE_CACHE_SIZE
- 1;
4212 size_t blocksize
= page
->mapping
->host
->i_sb
->s_blocksize
;
4214 start
+= ALIGN(offset
, blocksize
);
4218 lock_extent_bits(tree
, start
, end
, 0, &cached_state
);
4219 wait_on_page_writeback(page
);
4220 clear_extent_bit(tree
, start
, end
,
4221 EXTENT_LOCKED
| EXTENT_DIRTY
| EXTENT_DELALLOC
|
4222 EXTENT_DO_ACCOUNTING
,
4223 1, 1, &cached_state
, GFP_NOFS
);
4228 * a helper for releasepage, this tests for areas of the page that
4229 * are locked or under IO and drops the related state bits if it is safe
4232 static int try_release_extent_state(struct extent_map_tree
*map
,
4233 struct extent_io_tree
*tree
,
4234 struct page
*page
, gfp_t mask
)
4236 u64 start
= page_offset(page
);
4237 u64 end
= start
+ PAGE_CACHE_SIZE
- 1;
4240 if (test_range_bit(tree
, start
, end
,
4241 EXTENT_IOBITS
, 0, NULL
))
4244 if ((mask
& GFP_NOFS
) == GFP_NOFS
)
4247 * at this point we can safely clear everything except the
4248 * locked bit and the nodatasum bit
4250 ret
= clear_extent_bit(tree
, start
, end
,
4251 ~(EXTENT_LOCKED
| EXTENT_NODATASUM
),
4254 /* if clear_extent_bit failed for enomem reasons,
4255 * we can't allow the release to continue.
4266 * a helper for releasepage. As long as there are no locked extents
4267 * in the range corresponding to the page, both state records and extent
4268 * map records are removed
4270 int try_release_extent_mapping(struct extent_map_tree
*map
,
4271 struct extent_io_tree
*tree
, struct page
*page
,
4274 struct extent_map
*em
;
4275 u64 start
= page_offset(page
);
4276 u64 end
= start
+ PAGE_CACHE_SIZE
- 1;
4278 if ((mask
& __GFP_WAIT
) &&
4279 page
->mapping
->host
->i_size
> 16 * 1024 * 1024) {
4281 while (start
<= end
) {
4282 len
= end
- start
+ 1;
4283 write_lock(&map
->lock
);
4284 em
= lookup_extent_mapping(map
, start
, len
);
4286 write_unlock(&map
->lock
);
4289 if (test_bit(EXTENT_FLAG_PINNED
, &em
->flags
) ||
4290 em
->start
!= start
) {
4291 write_unlock(&map
->lock
);
4292 free_extent_map(em
);
4295 if (!test_range_bit(tree
, em
->start
,
4296 extent_map_end(em
) - 1,
4297 EXTENT_LOCKED
| EXTENT_WRITEBACK
,
4299 remove_extent_mapping(map
, em
);
4300 /* once for the rb tree */
4301 free_extent_map(em
);
4303 start
= extent_map_end(em
);
4304 write_unlock(&map
->lock
);
4307 free_extent_map(em
);
4310 return try_release_extent_state(map
, tree
, page
, mask
);
4314 * helper function for fiemap, which doesn't want to see any holes.
4315 * This maps until we find something past 'last'
4317 static struct extent_map
*get_extent_skip_holes(struct inode
*inode
,
4320 get_extent_t
*get_extent
)
4322 u64 sectorsize
= BTRFS_I(inode
)->root
->sectorsize
;
4323 struct extent_map
*em
;
4330 len
= last
- offset
;
4333 len
= ALIGN(len
, sectorsize
);
4334 em
= get_extent(inode
, NULL
, 0, offset
, len
, 0);
4335 if (IS_ERR_OR_NULL(em
))
4338 /* if this isn't a hole return it */
4339 if (!test_bit(EXTENT_FLAG_VACANCY
, &em
->flags
) &&
4340 em
->block_start
!= EXTENT_MAP_HOLE
) {
4344 /* this is a hole, advance to the next extent */
4345 offset
= extent_map_end(em
);
4346 free_extent_map(em
);
4353 int extent_fiemap(struct inode
*inode
, struct fiemap_extent_info
*fieinfo
,
4354 __u64 start
, __u64 len
, get_extent_t
*get_extent
)
4358 u64 max
= start
+ len
;
4362 u64 last_for_get_extent
= 0;
4364 u64 isize
= i_size_read(inode
);
4365 struct btrfs_key found_key
;
4366 struct extent_map
*em
= NULL
;
4367 struct extent_state
*cached_state
= NULL
;
4368 struct btrfs_path
*path
;
4369 struct btrfs_root
*root
= BTRFS_I(inode
)->root
;
4378 path
= btrfs_alloc_path();
4381 path
->leave_spinning
= 1;
4383 start
= round_down(start
, BTRFS_I(inode
)->root
->sectorsize
);
4384 len
= round_up(max
, BTRFS_I(inode
)->root
->sectorsize
) - start
;
4387 * lookup the last file extent. We're not using i_size here
4388 * because there might be preallocation past i_size
4390 ret
= btrfs_lookup_file_extent(NULL
, root
, path
, btrfs_ino(inode
), -1,
4393 btrfs_free_path(path
);
4398 btrfs_item_key_to_cpu(path
->nodes
[0], &found_key
, path
->slots
[0]);
4399 found_type
= found_key
.type
;
4401 /* No extents, but there might be delalloc bits */
4402 if (found_key
.objectid
!= btrfs_ino(inode
) ||
4403 found_type
!= BTRFS_EXTENT_DATA_KEY
) {
4404 /* have to trust i_size as the end */
4406 last_for_get_extent
= isize
;
4409 * remember the start of the last extent. There are a
4410 * bunch of different factors that go into the length of the
4411 * extent, so its much less complex to remember where it started
4413 last
= found_key
.offset
;
4414 last_for_get_extent
= last
+ 1;
4416 btrfs_release_path(path
);
4419 * we might have some extents allocated but more delalloc past those
4420 * extents. so, we trust isize unless the start of the last extent is
4425 last_for_get_extent
= isize
;
4428 lock_extent_bits(&BTRFS_I(inode
)->io_tree
, start
, start
+ len
- 1, 0,
4431 em
= get_extent_skip_holes(inode
, start
, last_for_get_extent
,
4441 u64 offset_in_extent
= 0;
4443 /* break if the extent we found is outside the range */
4444 if (em
->start
>= max
|| extent_map_end(em
) < off
)
4448 * get_extent may return an extent that starts before our
4449 * requested range. We have to make sure the ranges
4450 * we return to fiemap always move forward and don't
4451 * overlap, so adjust the offsets here
4453 em_start
= max(em
->start
, off
);
4456 * record the offset from the start of the extent
4457 * for adjusting the disk offset below. Only do this if the
4458 * extent isn't compressed since our in ram offset may be past
4459 * what we have actually allocated on disk.
4461 if (!test_bit(EXTENT_FLAG_COMPRESSED
, &em
->flags
))
4462 offset_in_extent
= em_start
- em
->start
;
4463 em_end
= extent_map_end(em
);
4464 em_len
= em_end
- em_start
;
4469 * bump off for our next call to get_extent
4471 off
= extent_map_end(em
);
4475 if (em
->block_start
== EXTENT_MAP_LAST_BYTE
) {
4477 flags
|= FIEMAP_EXTENT_LAST
;
4478 } else if (em
->block_start
== EXTENT_MAP_INLINE
) {
4479 flags
|= (FIEMAP_EXTENT_DATA_INLINE
|
4480 FIEMAP_EXTENT_NOT_ALIGNED
);
4481 } else if (em
->block_start
== EXTENT_MAP_DELALLOC
) {
4482 flags
|= (FIEMAP_EXTENT_DELALLOC
|
4483 FIEMAP_EXTENT_UNKNOWN
);
4484 } else if (fieinfo
->fi_extents_max
) {
4485 u64 bytenr
= em
->block_start
-
4486 (em
->start
- em
->orig_start
);
4488 disko
= em
->block_start
+ offset_in_extent
;
4491 * As btrfs supports shared space, this information
4492 * can be exported to userspace tools via
4493 * flag FIEMAP_EXTENT_SHARED. If fi_extents_max == 0
4494 * then we're just getting a count and we can skip the
4497 ret
= btrfs_check_shared(NULL
, root
->fs_info
,
4499 btrfs_ino(inode
), bytenr
);
4503 flags
|= FIEMAP_EXTENT_SHARED
;
4506 if (test_bit(EXTENT_FLAG_COMPRESSED
, &em
->flags
))
4507 flags
|= FIEMAP_EXTENT_ENCODED
;
4508 if (test_bit(EXTENT_FLAG_PREALLOC
, &em
->flags
))
4509 flags
|= FIEMAP_EXTENT_UNWRITTEN
;
4511 free_extent_map(em
);
4513 if ((em_start
>= last
) || em_len
== (u64
)-1 ||
4514 (last
== (u64
)-1 && isize
<= em_end
)) {
4515 flags
|= FIEMAP_EXTENT_LAST
;
4519 /* now scan forward to see if this is really the last extent. */
4520 em
= get_extent_skip_holes(inode
, off
, last_for_get_extent
,
4527 flags
|= FIEMAP_EXTENT_LAST
;
4530 ret
= fiemap_fill_next_extent(fieinfo
, em_start
, disko
,
4539 free_extent_map(em
);
4541 btrfs_free_path(path
);
4542 unlock_extent_cached(&BTRFS_I(inode
)->io_tree
, start
, start
+ len
- 1,
4543 &cached_state
, GFP_NOFS
);
4547 static void __free_extent_buffer(struct extent_buffer
*eb
)
4549 btrfs_leak_debug_del(&eb
->leak_list
);
4550 kmem_cache_free(extent_buffer_cache
, eb
);
4553 int extent_buffer_under_io(struct extent_buffer
*eb
)
4555 return (atomic_read(&eb
->io_pages
) ||
4556 test_bit(EXTENT_BUFFER_WRITEBACK
, &eb
->bflags
) ||
4557 test_bit(EXTENT_BUFFER_DIRTY
, &eb
->bflags
));
4561 * Helper for releasing extent buffer page.
4563 static void btrfs_release_extent_buffer_page(struct extent_buffer
*eb
)
4565 unsigned long index
;
4567 int mapped
= !test_bit(EXTENT_BUFFER_DUMMY
, &eb
->bflags
);
4569 BUG_ON(extent_buffer_under_io(eb
));
4571 index
= num_extent_pages(eb
->start
, eb
->len
);
4577 page
= eb
->pages
[index
];
4581 spin_lock(&page
->mapping
->private_lock
);
4583 * We do this since we'll remove the pages after we've
4584 * removed the eb from the radix tree, so we could race
4585 * and have this page now attached to the new eb. So
4586 * only clear page_private if it's still connected to
4589 if (PagePrivate(page
) &&
4590 page
->private == (unsigned long)eb
) {
4591 BUG_ON(test_bit(EXTENT_BUFFER_DIRTY
, &eb
->bflags
));
4592 BUG_ON(PageDirty(page
));
4593 BUG_ON(PageWriteback(page
));
4595 * We need to make sure we haven't be attached
4598 ClearPagePrivate(page
);
4599 set_page_private(page
, 0);
4600 /* One for the page private */
4601 page_cache_release(page
);
4605 spin_unlock(&page
->mapping
->private_lock
);
4607 /* One for when we alloced the page */
4608 page_cache_release(page
);
4609 } while (index
!= 0);
4613 * Helper for releasing the extent buffer.
4615 static inline void btrfs_release_extent_buffer(struct extent_buffer
*eb
)
4617 btrfs_release_extent_buffer_page(eb
);
4618 __free_extent_buffer(eb
);
4621 static struct extent_buffer
*
4622 __alloc_extent_buffer(struct btrfs_fs_info
*fs_info
, u64 start
,
4625 struct extent_buffer
*eb
= NULL
;
4627 eb
= kmem_cache_zalloc(extent_buffer_cache
, GFP_NOFS
);
4632 eb
->fs_info
= fs_info
;
4634 rwlock_init(&eb
->lock
);
4635 atomic_set(&eb
->write_locks
, 0);
4636 atomic_set(&eb
->read_locks
, 0);
4637 atomic_set(&eb
->blocking_readers
, 0);
4638 atomic_set(&eb
->blocking_writers
, 0);
4639 atomic_set(&eb
->spinning_readers
, 0);
4640 atomic_set(&eb
->spinning_writers
, 0);
4641 eb
->lock_nested
= 0;
4642 init_waitqueue_head(&eb
->write_lock_wq
);
4643 init_waitqueue_head(&eb
->read_lock_wq
);
4645 btrfs_leak_debug_add(&eb
->leak_list
, &buffers
);
4647 spin_lock_init(&eb
->refs_lock
);
4648 atomic_set(&eb
->refs
, 1);
4649 atomic_set(&eb
->io_pages
, 0);
4652 * Sanity checks, currently the maximum is 64k covered by 16x 4k pages
4654 BUILD_BUG_ON(BTRFS_MAX_METADATA_BLOCKSIZE
4655 > MAX_INLINE_EXTENT_BUFFER_SIZE
);
4656 BUG_ON(len
> MAX_INLINE_EXTENT_BUFFER_SIZE
);
4661 struct extent_buffer
*btrfs_clone_extent_buffer(struct extent_buffer
*src
)
4665 struct extent_buffer
*new;
4666 unsigned long num_pages
= num_extent_pages(src
->start
, src
->len
);
4668 new = __alloc_extent_buffer(src
->fs_info
, src
->start
, src
->len
);
4672 for (i
= 0; i
< num_pages
; i
++) {
4673 p
= alloc_page(GFP_NOFS
);
4675 btrfs_release_extent_buffer(new);
4678 attach_extent_buffer_page(new, p
);
4679 WARN_ON(PageDirty(p
));
4684 copy_extent_buffer(new, src
, 0, 0, src
->len
);
4685 set_bit(EXTENT_BUFFER_UPTODATE
, &new->bflags
);
4686 set_bit(EXTENT_BUFFER_DUMMY
, &new->bflags
);
4691 struct extent_buffer
*alloc_dummy_extent_buffer(struct btrfs_fs_info
*fs_info
,
4694 struct extent_buffer
*eb
;
4696 unsigned long num_pages
;
4701 * Called only from tests that don't always have a fs_info
4702 * available, but we know that nodesize is 4096
4706 len
= fs_info
->tree_root
->nodesize
;
4708 num_pages
= num_extent_pages(0, len
);
4710 eb
= __alloc_extent_buffer(fs_info
, start
, len
);
4714 for (i
= 0; i
< num_pages
; i
++) {
4715 eb
->pages
[i
] = alloc_page(GFP_NOFS
);
4719 set_extent_buffer_uptodate(eb
);
4720 btrfs_set_header_nritems(eb
, 0);
4721 set_bit(EXTENT_BUFFER_DUMMY
, &eb
->bflags
);
4726 __free_page(eb
->pages
[i
- 1]);
4727 __free_extent_buffer(eb
);
4731 static void check_buffer_tree_ref(struct extent_buffer
*eb
)
4734 /* the ref bit is tricky. We have to make sure it is set
4735 * if we have the buffer dirty. Otherwise the
4736 * code to free a buffer can end up dropping a dirty
4739 * Once the ref bit is set, it won't go away while the
4740 * buffer is dirty or in writeback, and it also won't
4741 * go away while we have the reference count on the
4744 * We can't just set the ref bit without bumping the
4745 * ref on the eb because free_extent_buffer might
4746 * see the ref bit and try to clear it. If this happens
4747 * free_extent_buffer might end up dropping our original
4748 * ref by mistake and freeing the page before we are able
4749 * to add one more ref.
4751 * So bump the ref count first, then set the bit. If someone
4752 * beat us to it, drop the ref we added.
4754 refs
= atomic_read(&eb
->refs
);
4755 if (refs
>= 2 && test_bit(EXTENT_BUFFER_TREE_REF
, &eb
->bflags
))
4758 spin_lock(&eb
->refs_lock
);
4759 if (!test_and_set_bit(EXTENT_BUFFER_TREE_REF
, &eb
->bflags
))
4760 atomic_inc(&eb
->refs
);
4761 spin_unlock(&eb
->refs_lock
);
4764 static void mark_extent_buffer_accessed(struct extent_buffer
*eb
,
4765 struct page
*accessed
)
4767 unsigned long num_pages
, i
;
4769 check_buffer_tree_ref(eb
);
4771 num_pages
= num_extent_pages(eb
->start
, eb
->len
);
4772 for (i
= 0; i
< num_pages
; i
++) {
4773 struct page
*p
= eb
->pages
[i
];
4776 mark_page_accessed(p
);
4780 struct extent_buffer
*find_extent_buffer(struct btrfs_fs_info
*fs_info
,
4783 struct extent_buffer
*eb
;
4786 eb
= radix_tree_lookup(&fs_info
->buffer_radix
,
4787 start
>> PAGE_CACHE_SHIFT
);
4788 if (eb
&& atomic_inc_not_zero(&eb
->refs
)) {
4791 * Lock our eb's refs_lock to avoid races with
4792 * free_extent_buffer. When we get our eb it might be flagged
4793 * with EXTENT_BUFFER_STALE and another task running
4794 * free_extent_buffer might have seen that flag set,
4795 * eb->refs == 2, that the buffer isn't under IO (dirty and
4796 * writeback flags not set) and it's still in the tree (flag
4797 * EXTENT_BUFFER_TREE_REF set), therefore being in the process
4798 * of decrementing the extent buffer's reference count twice.
4799 * So here we could race and increment the eb's reference count,
4800 * clear its stale flag, mark it as dirty and drop our reference
4801 * before the other task finishes executing free_extent_buffer,
4802 * which would later result in an attempt to free an extent
4803 * buffer that is dirty.
4805 if (test_bit(EXTENT_BUFFER_STALE
, &eb
->bflags
)) {
4806 spin_lock(&eb
->refs_lock
);
4807 spin_unlock(&eb
->refs_lock
);
4809 mark_extent_buffer_accessed(eb
, NULL
);
4817 #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
4818 struct extent_buffer
*alloc_test_extent_buffer(struct btrfs_fs_info
*fs_info
,
4821 struct extent_buffer
*eb
, *exists
= NULL
;
4824 eb
= find_extent_buffer(fs_info
, start
);
4827 eb
= alloc_dummy_extent_buffer(fs_info
, start
);
4830 eb
->fs_info
= fs_info
;
4832 ret
= radix_tree_preload(GFP_NOFS
& ~__GFP_HIGHMEM
);
4835 spin_lock(&fs_info
->buffer_lock
);
4836 ret
= radix_tree_insert(&fs_info
->buffer_radix
,
4837 start
>> PAGE_CACHE_SHIFT
, eb
);
4838 spin_unlock(&fs_info
->buffer_lock
);
4839 radix_tree_preload_end();
4840 if (ret
== -EEXIST
) {
4841 exists
= find_extent_buffer(fs_info
, start
);
4847 check_buffer_tree_ref(eb
);
4848 set_bit(EXTENT_BUFFER_IN_TREE
, &eb
->bflags
);
4851 * We will free dummy extent buffer's if they come into
4852 * free_extent_buffer with a ref count of 2, but if we are using this we
4853 * want the buffers to stay in memory until we're done with them, so
4854 * bump the ref count again.
4856 atomic_inc(&eb
->refs
);
4859 btrfs_release_extent_buffer(eb
);
4864 struct extent_buffer
*alloc_extent_buffer(struct btrfs_fs_info
*fs_info
,
4867 unsigned long len
= fs_info
->tree_root
->nodesize
;
4868 unsigned long num_pages
= num_extent_pages(start
, len
);
4870 unsigned long index
= start
>> PAGE_CACHE_SHIFT
;
4871 struct extent_buffer
*eb
;
4872 struct extent_buffer
*exists
= NULL
;
4874 struct address_space
*mapping
= fs_info
->btree_inode
->i_mapping
;
4878 eb
= find_extent_buffer(fs_info
, start
);
4882 eb
= __alloc_extent_buffer(fs_info
, start
, len
);
4886 for (i
= 0; i
< num_pages
; i
++, index
++) {
4887 p
= find_or_create_page(mapping
, index
, GFP_NOFS
);
4891 spin_lock(&mapping
->private_lock
);
4892 if (PagePrivate(p
)) {
4894 * We could have already allocated an eb for this page
4895 * and attached one so lets see if we can get a ref on
4896 * the existing eb, and if we can we know it's good and
4897 * we can just return that one, else we know we can just
4898 * overwrite page->private.
4900 exists
= (struct extent_buffer
*)p
->private;
4901 if (atomic_inc_not_zero(&exists
->refs
)) {
4902 spin_unlock(&mapping
->private_lock
);
4904 page_cache_release(p
);
4905 mark_extent_buffer_accessed(exists
, p
);
4911 * Do this so attach doesn't complain and we need to
4912 * drop the ref the old guy had.
4914 ClearPagePrivate(p
);
4915 WARN_ON(PageDirty(p
));
4916 page_cache_release(p
);
4918 attach_extent_buffer_page(eb
, p
);
4919 spin_unlock(&mapping
->private_lock
);
4920 WARN_ON(PageDirty(p
));
4922 if (!PageUptodate(p
))
4926 * see below about how we avoid a nasty race with release page
4927 * and why we unlock later
4931 set_bit(EXTENT_BUFFER_UPTODATE
, &eb
->bflags
);
4933 ret
= radix_tree_preload(GFP_NOFS
& ~__GFP_HIGHMEM
);
4937 spin_lock(&fs_info
->buffer_lock
);
4938 ret
= radix_tree_insert(&fs_info
->buffer_radix
,
4939 start
>> PAGE_CACHE_SHIFT
, eb
);
4940 spin_unlock(&fs_info
->buffer_lock
);
4941 radix_tree_preload_end();
4942 if (ret
== -EEXIST
) {
4943 exists
= find_extent_buffer(fs_info
, start
);
4949 /* add one reference for the tree */
4950 check_buffer_tree_ref(eb
);
4951 set_bit(EXTENT_BUFFER_IN_TREE
, &eb
->bflags
);
4954 * there is a race where release page may have
4955 * tried to find this extent buffer in the radix
4956 * but failed. It will tell the VM it is safe to
4957 * reclaim the, and it will clear the page private bit.
4958 * We must make sure to set the page private bit properly
4959 * after the extent buffer is in the radix tree so
4960 * it doesn't get lost
4962 SetPageChecked(eb
->pages
[0]);
4963 for (i
= 1; i
< num_pages
; i
++) {
4965 ClearPageChecked(p
);
4968 unlock_page(eb
->pages
[0]);
4972 WARN_ON(!atomic_dec_and_test(&eb
->refs
));
4973 for (i
= 0; i
< num_pages
; i
++) {
4975 unlock_page(eb
->pages
[i
]);
4978 btrfs_release_extent_buffer(eb
);
4982 static inline void btrfs_release_extent_buffer_rcu(struct rcu_head
*head
)
4984 struct extent_buffer
*eb
=
4985 container_of(head
, struct extent_buffer
, rcu_head
);
4987 __free_extent_buffer(eb
);
4990 /* Expects to have eb->eb_lock already held */
4991 static int release_extent_buffer(struct extent_buffer
*eb
)
4993 WARN_ON(atomic_read(&eb
->refs
) == 0);
4994 if (atomic_dec_and_test(&eb
->refs
)) {
4995 if (test_and_clear_bit(EXTENT_BUFFER_IN_TREE
, &eb
->bflags
)) {
4996 struct btrfs_fs_info
*fs_info
= eb
->fs_info
;
4998 spin_unlock(&eb
->refs_lock
);
5000 spin_lock(&fs_info
->buffer_lock
);
5001 radix_tree_delete(&fs_info
->buffer_radix
,
5002 eb
->start
>> PAGE_CACHE_SHIFT
);
5003 spin_unlock(&fs_info
->buffer_lock
);
5005 spin_unlock(&eb
->refs_lock
);
5008 /* Should be safe to release our pages at this point */
5009 btrfs_release_extent_buffer_page(eb
);
5010 #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
5011 if (unlikely(test_bit(EXTENT_BUFFER_DUMMY
, &eb
->bflags
))) {
5012 __free_extent_buffer(eb
);
5016 call_rcu(&eb
->rcu_head
, btrfs_release_extent_buffer_rcu
);
5019 spin_unlock(&eb
->refs_lock
);
5024 void free_extent_buffer(struct extent_buffer
*eb
)
5032 refs
= atomic_read(&eb
->refs
);
5035 old
= atomic_cmpxchg(&eb
->refs
, refs
, refs
- 1);
5040 spin_lock(&eb
->refs_lock
);
5041 if (atomic_read(&eb
->refs
) == 2 &&
5042 test_bit(EXTENT_BUFFER_DUMMY
, &eb
->bflags
))
5043 atomic_dec(&eb
->refs
);
5045 if (atomic_read(&eb
->refs
) == 2 &&
5046 test_bit(EXTENT_BUFFER_STALE
, &eb
->bflags
) &&
5047 !extent_buffer_under_io(eb
) &&
5048 test_and_clear_bit(EXTENT_BUFFER_TREE_REF
, &eb
->bflags
))
5049 atomic_dec(&eb
->refs
);
5052 * I know this is terrible, but it's temporary until we stop tracking
5053 * the uptodate bits and such for the extent buffers.
5055 release_extent_buffer(eb
);
5058 void free_extent_buffer_stale(struct extent_buffer
*eb
)
5063 spin_lock(&eb
->refs_lock
);
5064 set_bit(EXTENT_BUFFER_STALE
, &eb
->bflags
);
5066 if (atomic_read(&eb
->refs
) == 2 && !extent_buffer_under_io(eb
) &&
5067 test_and_clear_bit(EXTENT_BUFFER_TREE_REF
, &eb
->bflags
))
5068 atomic_dec(&eb
->refs
);
5069 release_extent_buffer(eb
);
5072 void clear_extent_buffer_dirty(struct extent_buffer
*eb
)
5075 unsigned long num_pages
;
5078 num_pages
= num_extent_pages(eb
->start
, eb
->len
);
5080 for (i
= 0; i
< num_pages
; i
++) {
5081 page
= eb
->pages
[i
];
5082 if (!PageDirty(page
))
5086 WARN_ON(!PagePrivate(page
));
5088 clear_page_dirty_for_io(page
);
5089 spin_lock_irq(&page
->mapping
->tree_lock
);
5090 if (!PageDirty(page
)) {
5091 radix_tree_tag_clear(&page
->mapping
->page_tree
,
5093 PAGECACHE_TAG_DIRTY
);
5095 spin_unlock_irq(&page
->mapping
->tree_lock
);
5096 ClearPageError(page
);
5099 WARN_ON(atomic_read(&eb
->refs
) == 0);
5102 int set_extent_buffer_dirty(struct extent_buffer
*eb
)
5105 unsigned long num_pages
;
5108 check_buffer_tree_ref(eb
);
5110 was_dirty
= test_and_set_bit(EXTENT_BUFFER_DIRTY
, &eb
->bflags
);
5112 num_pages
= num_extent_pages(eb
->start
, eb
->len
);
5113 WARN_ON(atomic_read(&eb
->refs
) == 0);
5114 WARN_ON(!test_bit(EXTENT_BUFFER_TREE_REF
, &eb
->bflags
));
5116 for (i
= 0; i
< num_pages
; i
++)
5117 set_page_dirty(eb
->pages
[i
]);
5121 int clear_extent_buffer_uptodate(struct extent_buffer
*eb
)
5125 unsigned long num_pages
;
5127 clear_bit(EXTENT_BUFFER_UPTODATE
, &eb
->bflags
);
5128 num_pages
= num_extent_pages(eb
->start
, eb
->len
);
5129 for (i
= 0; i
< num_pages
; i
++) {
5130 page
= eb
->pages
[i
];
5132 ClearPageUptodate(page
);
5137 int set_extent_buffer_uptodate(struct extent_buffer
*eb
)
5141 unsigned long num_pages
;
5143 set_bit(EXTENT_BUFFER_UPTODATE
, &eb
->bflags
);
5144 num_pages
= num_extent_pages(eb
->start
, eb
->len
);
5145 for (i
= 0; i
< num_pages
; i
++) {
5146 page
= eb
->pages
[i
];
5147 SetPageUptodate(page
);
5152 int extent_buffer_uptodate(struct extent_buffer
*eb
)
5154 return test_bit(EXTENT_BUFFER_UPTODATE
, &eb
->bflags
);
5157 int read_extent_buffer_pages(struct extent_io_tree
*tree
,
5158 struct extent_buffer
*eb
, u64 start
, int wait
,
5159 get_extent_t
*get_extent
, int mirror_num
)
5162 unsigned long start_i
;
5166 int locked_pages
= 0;
5167 int all_uptodate
= 1;
5168 unsigned long num_pages
;
5169 unsigned long num_reads
= 0;
5170 struct bio
*bio
= NULL
;
5171 unsigned long bio_flags
= 0;
5173 if (test_bit(EXTENT_BUFFER_UPTODATE
, &eb
->bflags
))
5177 WARN_ON(start
< eb
->start
);
5178 start_i
= (start
>> PAGE_CACHE_SHIFT
) -
5179 (eb
->start
>> PAGE_CACHE_SHIFT
);
5184 num_pages
= num_extent_pages(eb
->start
, eb
->len
);
5185 for (i
= start_i
; i
< num_pages
; i
++) {
5186 page
= eb
->pages
[i
];
5187 if (wait
== WAIT_NONE
) {
5188 if (!trylock_page(page
))
5194 if (!PageUptodate(page
)) {
5201 set_bit(EXTENT_BUFFER_UPTODATE
, &eb
->bflags
);
5205 clear_bit(EXTENT_BUFFER_READ_ERR
, &eb
->bflags
);
5206 eb
->read_mirror
= 0;
5207 atomic_set(&eb
->io_pages
, num_reads
);
5208 for (i
= start_i
; i
< num_pages
; i
++) {
5209 page
= eb
->pages
[i
];
5210 if (!PageUptodate(page
)) {
5211 ClearPageError(page
);
5212 err
= __extent_read_full_page(tree
, page
,
5214 mirror_num
, &bio_flags
,
5224 err
= submit_one_bio(READ
| REQ_META
, bio
, mirror_num
,
5230 if (ret
|| wait
!= WAIT_COMPLETE
)
5233 for (i
= start_i
; i
< num_pages
; i
++) {
5234 page
= eb
->pages
[i
];
5235 wait_on_page_locked(page
);
5236 if (!PageUptodate(page
))
5244 while (locked_pages
> 0) {
5245 page
= eb
->pages
[i
];
5253 void read_extent_buffer(struct extent_buffer
*eb
, void *dstv
,
5254 unsigned long start
,
5261 char *dst
= (char *)dstv
;
5262 size_t start_offset
= eb
->start
& ((u64
)PAGE_CACHE_SIZE
- 1);
5263 unsigned long i
= (start_offset
+ start
) >> PAGE_CACHE_SHIFT
;
5265 WARN_ON(start
> eb
->len
);
5266 WARN_ON(start
+ len
> eb
->start
+ eb
->len
);
5268 offset
= (start_offset
+ start
) & (PAGE_CACHE_SIZE
- 1);
5271 page
= eb
->pages
[i
];
5273 cur
= min(len
, (PAGE_CACHE_SIZE
- offset
));
5274 kaddr
= page_address(page
);
5275 memcpy(dst
, kaddr
+ offset
, cur
);
5284 int read_extent_buffer_to_user(struct extent_buffer
*eb
, void __user
*dstv
,
5285 unsigned long start
,
5292 char __user
*dst
= (char __user
*)dstv
;
5293 size_t start_offset
= eb
->start
& ((u64
)PAGE_CACHE_SIZE
- 1);
5294 unsigned long i
= (start_offset
+ start
) >> PAGE_CACHE_SHIFT
;
5297 WARN_ON(start
> eb
->len
);
5298 WARN_ON(start
+ len
> eb
->start
+ eb
->len
);
5300 offset
= (start_offset
+ start
) & (PAGE_CACHE_SIZE
- 1);
5303 page
= eb
->pages
[i
];
5305 cur
= min(len
, (PAGE_CACHE_SIZE
- offset
));
5306 kaddr
= page_address(page
);
5307 if (copy_to_user(dst
, kaddr
+ offset
, cur
)) {
5321 int map_private_extent_buffer(struct extent_buffer
*eb
, unsigned long start
,
5322 unsigned long min_len
, char **map
,
5323 unsigned long *map_start
,
5324 unsigned long *map_len
)
5326 size_t offset
= start
& (PAGE_CACHE_SIZE
- 1);
5329 size_t start_offset
= eb
->start
& ((u64
)PAGE_CACHE_SIZE
- 1);
5330 unsigned long i
= (start_offset
+ start
) >> PAGE_CACHE_SHIFT
;
5331 unsigned long end_i
= (start_offset
+ start
+ min_len
- 1) >>
5338 offset
= start_offset
;
5342 *map_start
= ((u64
)i
<< PAGE_CACHE_SHIFT
) - start_offset
;
5345 if (start
+ min_len
> eb
->len
) {
5346 WARN(1, KERN_ERR
"btrfs bad mapping eb start %llu len %lu, "
5348 eb
->start
, eb
->len
, start
, min_len
);
5353 kaddr
= page_address(p
);
5354 *map
= kaddr
+ offset
;
5355 *map_len
= PAGE_CACHE_SIZE
- offset
;
5359 int memcmp_extent_buffer(struct extent_buffer
*eb
, const void *ptrv
,
5360 unsigned long start
,
5367 char *ptr
= (char *)ptrv
;
5368 size_t start_offset
= eb
->start
& ((u64
)PAGE_CACHE_SIZE
- 1);
5369 unsigned long i
= (start_offset
+ start
) >> PAGE_CACHE_SHIFT
;
5372 WARN_ON(start
> eb
->len
);
5373 WARN_ON(start
+ len
> eb
->start
+ eb
->len
);
5375 offset
= (start_offset
+ start
) & (PAGE_CACHE_SIZE
- 1);
5378 page
= eb
->pages
[i
];
5380 cur
= min(len
, (PAGE_CACHE_SIZE
- offset
));
5382 kaddr
= page_address(page
);
5383 ret
= memcmp(ptr
, kaddr
+ offset
, cur
);
5395 void write_extent_buffer(struct extent_buffer
*eb
, const void *srcv
,
5396 unsigned long start
, unsigned long len
)
5402 char *src
= (char *)srcv
;
5403 size_t start_offset
= eb
->start
& ((u64
)PAGE_CACHE_SIZE
- 1);
5404 unsigned long i
= (start_offset
+ start
) >> PAGE_CACHE_SHIFT
;
5406 WARN_ON(start
> eb
->len
);
5407 WARN_ON(start
+ len
> eb
->start
+ eb
->len
);
5409 offset
= (start_offset
+ start
) & (PAGE_CACHE_SIZE
- 1);
5412 page
= eb
->pages
[i
];
5413 WARN_ON(!PageUptodate(page
));
5415 cur
= min(len
, PAGE_CACHE_SIZE
- offset
);
5416 kaddr
= page_address(page
);
5417 memcpy(kaddr
+ offset
, src
, cur
);
5426 void memset_extent_buffer(struct extent_buffer
*eb
, char c
,
5427 unsigned long start
, unsigned long len
)
5433 size_t start_offset
= eb
->start
& ((u64
)PAGE_CACHE_SIZE
- 1);
5434 unsigned long i
= (start_offset
+ start
) >> PAGE_CACHE_SHIFT
;
5436 WARN_ON(start
> eb
->len
);
5437 WARN_ON(start
+ len
> eb
->start
+ eb
->len
);
5439 offset
= (start_offset
+ start
) & (PAGE_CACHE_SIZE
- 1);
5442 page
= eb
->pages
[i
];
5443 WARN_ON(!PageUptodate(page
));
5445 cur
= min(len
, PAGE_CACHE_SIZE
- offset
);
5446 kaddr
= page_address(page
);
5447 memset(kaddr
+ offset
, c
, cur
);
5455 void copy_extent_buffer(struct extent_buffer
*dst
, struct extent_buffer
*src
,
5456 unsigned long dst_offset
, unsigned long src_offset
,
5459 u64 dst_len
= dst
->len
;
5464 size_t start_offset
= dst
->start
& ((u64
)PAGE_CACHE_SIZE
- 1);
5465 unsigned long i
= (start_offset
+ dst_offset
) >> PAGE_CACHE_SHIFT
;
5467 WARN_ON(src
->len
!= dst_len
);
5469 offset
= (start_offset
+ dst_offset
) &
5470 (PAGE_CACHE_SIZE
- 1);
5473 page
= dst
->pages
[i
];
5474 WARN_ON(!PageUptodate(page
));
5476 cur
= min(len
, (unsigned long)(PAGE_CACHE_SIZE
- offset
));
5478 kaddr
= page_address(page
);
5479 read_extent_buffer(src
, kaddr
+ offset
, src_offset
, cur
);
5488 static inline bool areas_overlap(unsigned long src
, unsigned long dst
, unsigned long len
)
5490 unsigned long distance
= (src
> dst
) ? src
- dst
: dst
- src
;
5491 return distance
< len
;
5494 static void copy_pages(struct page
*dst_page
, struct page
*src_page
,
5495 unsigned long dst_off
, unsigned long src_off
,
5498 char *dst_kaddr
= page_address(dst_page
);
5500 int must_memmove
= 0;
5502 if (dst_page
!= src_page
) {
5503 src_kaddr
= page_address(src_page
);
5505 src_kaddr
= dst_kaddr
;
5506 if (areas_overlap(src_off
, dst_off
, len
))
5511 memmove(dst_kaddr
+ dst_off
, src_kaddr
+ src_off
, len
);
5513 memcpy(dst_kaddr
+ dst_off
, src_kaddr
+ src_off
, len
);
5516 void memcpy_extent_buffer(struct extent_buffer
*dst
, unsigned long dst_offset
,
5517 unsigned long src_offset
, unsigned long len
)
5520 size_t dst_off_in_page
;
5521 size_t src_off_in_page
;
5522 size_t start_offset
= dst
->start
& ((u64
)PAGE_CACHE_SIZE
- 1);
5523 unsigned long dst_i
;
5524 unsigned long src_i
;
5526 if (src_offset
+ len
> dst
->len
) {
5527 printk(KERN_ERR
"BTRFS: memmove bogus src_offset %lu move "
5528 "len %lu dst len %lu\n", src_offset
, len
, dst
->len
);
5531 if (dst_offset
+ len
> dst
->len
) {
5532 printk(KERN_ERR
"BTRFS: memmove bogus dst_offset %lu move "
5533 "len %lu dst len %lu\n", dst_offset
, len
, dst
->len
);
5538 dst_off_in_page
= (start_offset
+ dst_offset
) &
5539 (PAGE_CACHE_SIZE
- 1);
5540 src_off_in_page
= (start_offset
+ src_offset
) &
5541 (PAGE_CACHE_SIZE
- 1);
5543 dst_i
= (start_offset
+ dst_offset
) >> PAGE_CACHE_SHIFT
;
5544 src_i
= (start_offset
+ src_offset
) >> PAGE_CACHE_SHIFT
;
5546 cur
= min(len
, (unsigned long)(PAGE_CACHE_SIZE
-
5548 cur
= min_t(unsigned long, cur
,
5549 (unsigned long)(PAGE_CACHE_SIZE
- dst_off_in_page
));
5551 copy_pages(dst
->pages
[dst_i
], dst
->pages
[src_i
],
5552 dst_off_in_page
, src_off_in_page
, cur
);
5560 void memmove_extent_buffer(struct extent_buffer
*dst
, unsigned long dst_offset
,
5561 unsigned long src_offset
, unsigned long len
)
5564 size_t dst_off_in_page
;
5565 size_t src_off_in_page
;
5566 unsigned long dst_end
= dst_offset
+ len
- 1;
5567 unsigned long src_end
= src_offset
+ len
- 1;
5568 size_t start_offset
= dst
->start
& ((u64
)PAGE_CACHE_SIZE
- 1);
5569 unsigned long dst_i
;
5570 unsigned long src_i
;
5572 if (src_offset
+ len
> dst
->len
) {
5573 printk(KERN_ERR
"BTRFS: memmove bogus src_offset %lu move "
5574 "len %lu len %lu\n", src_offset
, len
, dst
->len
);
5577 if (dst_offset
+ len
> dst
->len
) {
5578 printk(KERN_ERR
"BTRFS: memmove bogus dst_offset %lu move "
5579 "len %lu len %lu\n", dst_offset
, len
, dst
->len
);
5582 if (dst_offset
< src_offset
) {
5583 memcpy_extent_buffer(dst
, dst_offset
, src_offset
, len
);
5587 dst_i
= (start_offset
+ dst_end
) >> PAGE_CACHE_SHIFT
;
5588 src_i
= (start_offset
+ src_end
) >> PAGE_CACHE_SHIFT
;
5590 dst_off_in_page
= (start_offset
+ dst_end
) &
5591 (PAGE_CACHE_SIZE
- 1);
5592 src_off_in_page
= (start_offset
+ src_end
) &
5593 (PAGE_CACHE_SIZE
- 1);
5595 cur
= min_t(unsigned long, len
, src_off_in_page
+ 1);
5596 cur
= min(cur
, dst_off_in_page
+ 1);
5597 copy_pages(dst
->pages
[dst_i
], dst
->pages
[src_i
],
5598 dst_off_in_page
- cur
+ 1,
5599 src_off_in_page
- cur
+ 1, cur
);
5607 int try_release_extent_buffer(struct page
*page
)
5609 struct extent_buffer
*eb
;
5612 * We need to make sure noboody is attaching this page to an eb right
5615 spin_lock(&page
->mapping
->private_lock
);
5616 if (!PagePrivate(page
)) {
5617 spin_unlock(&page
->mapping
->private_lock
);
5621 eb
= (struct extent_buffer
*)page
->private;
5625 * This is a little awful but should be ok, we need to make sure that
5626 * the eb doesn't disappear out from under us while we're looking at
5629 spin_lock(&eb
->refs_lock
);
5630 if (atomic_read(&eb
->refs
) != 1 || extent_buffer_under_io(eb
)) {
5631 spin_unlock(&eb
->refs_lock
);
5632 spin_unlock(&page
->mapping
->private_lock
);
5635 spin_unlock(&page
->mapping
->private_lock
);
5638 * If tree ref isn't set then we know the ref on this eb is a real ref,
5639 * so just return, this page will likely be freed soon anyway.
5641 if (!test_and_clear_bit(EXTENT_BUFFER_TREE_REF
, &eb
->bflags
)) {
5642 spin_unlock(&eb
->refs_lock
);
5646 return release_extent_buffer(eb
);