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 btrfs_debug_rl(BTRFS_I(inode)->root->fs_info,
100 "%s: ino %llu isize %llu odd range [%llu,%llu]",
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 void add_extent_changeset(struct extent_state *state, unsigned bits,
135 struct extent_changeset *changeset,
142 if (set && (state->state & bits) == bits)
144 if (!set && (state->state & bits) == 0)
146 changeset->bytes_changed += state->end - state->start + 1;
147 ret = ulist_add(changeset->range_changed, state->start, state->end,
153 static noinline void flush_write_bio(void *data);
154 static inline struct btrfs_fs_info *
155 tree_fs_info(struct extent_io_tree *tree)
159 return btrfs_sb(tree->mapping->host->i_sb);
162 int __init extent_io_init(void)
164 extent_state_cache = kmem_cache_create("btrfs_extent_state",
165 sizeof(struct extent_state), 0,
166 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL);
167 if (!extent_state_cache)
170 extent_buffer_cache = kmem_cache_create("btrfs_extent_buffer",
171 sizeof(struct extent_buffer), 0,
172 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL);
173 if (!extent_buffer_cache)
174 goto free_state_cache;
176 btrfs_bioset = bioset_create(BIO_POOL_SIZE,
177 offsetof(struct btrfs_io_bio, bio));
179 goto free_buffer_cache;
181 if (bioset_integrity_create(btrfs_bioset, BIO_POOL_SIZE))
187 bioset_free(btrfs_bioset);
191 kmem_cache_destroy(extent_buffer_cache);
192 extent_buffer_cache = NULL;
195 kmem_cache_destroy(extent_state_cache);
196 extent_state_cache = NULL;
200 void extent_io_exit(void)
202 btrfs_leak_debug_check();
205 * Make sure all delayed rcu free are flushed before we
209 kmem_cache_destroy(extent_state_cache);
210 kmem_cache_destroy(extent_buffer_cache);
212 bioset_free(btrfs_bioset);
215 void extent_io_tree_init(struct extent_io_tree *tree,
216 struct address_space *mapping)
218 tree->state = RB_ROOT;
220 tree->dirty_bytes = 0;
221 spin_lock_init(&tree->lock);
222 tree->mapping = mapping;
225 static struct extent_state *alloc_extent_state(gfp_t mask)
227 struct extent_state *state;
229 state = kmem_cache_alloc(extent_state_cache, mask);
233 state->failrec = NULL;
234 RB_CLEAR_NODE(&state->rb_node);
235 btrfs_leak_debug_add(&state->leak_list, &states);
236 atomic_set(&state->refs, 1);
237 init_waitqueue_head(&state->wq);
238 trace_alloc_extent_state(state, mask, _RET_IP_);
242 void free_extent_state(struct extent_state *state)
246 if (atomic_dec_and_test(&state->refs)) {
247 WARN_ON(extent_state_in_tree(state));
248 btrfs_leak_debug_del(&state->leak_list);
249 trace_free_extent_state(state, _RET_IP_);
250 kmem_cache_free(extent_state_cache, state);
254 static struct rb_node *tree_insert(struct rb_root *root,
255 struct rb_node *search_start,
257 struct rb_node *node,
258 struct rb_node ***p_in,
259 struct rb_node **parent_in)
262 struct rb_node *parent = NULL;
263 struct tree_entry *entry;
265 if (p_in && parent_in) {
271 p = search_start ? &search_start : &root->rb_node;
274 entry = rb_entry(parent, struct tree_entry, rb_node);
276 if (offset < entry->start)
278 else if (offset > entry->end)
285 rb_link_node(node, parent, p);
286 rb_insert_color(node, root);
290 static struct rb_node *__etree_search(struct extent_io_tree *tree, u64 offset,
291 struct rb_node **prev_ret,
292 struct rb_node **next_ret,
293 struct rb_node ***p_ret,
294 struct rb_node **parent_ret)
296 struct rb_root *root = &tree->state;
297 struct rb_node **n = &root->rb_node;
298 struct rb_node *prev = NULL;
299 struct rb_node *orig_prev = NULL;
300 struct tree_entry *entry;
301 struct tree_entry *prev_entry = NULL;
305 entry = rb_entry(prev, struct tree_entry, rb_node);
308 if (offset < entry->start)
310 else if (offset > entry->end)
323 while (prev && offset > prev_entry->end) {
324 prev = rb_next(prev);
325 prev_entry = rb_entry(prev, struct tree_entry, rb_node);
332 prev_entry = rb_entry(prev, struct tree_entry, rb_node);
333 while (prev && offset < prev_entry->start) {
334 prev = rb_prev(prev);
335 prev_entry = rb_entry(prev, struct tree_entry, rb_node);
342 static inline struct rb_node *
343 tree_search_for_insert(struct extent_io_tree *tree,
345 struct rb_node ***p_ret,
346 struct rb_node **parent_ret)
348 struct rb_node *prev = NULL;
351 ret = __etree_search(tree, offset, &prev, NULL, p_ret, parent_ret);
357 static inline struct rb_node *tree_search(struct extent_io_tree *tree,
360 return tree_search_for_insert(tree, offset, NULL, NULL);
363 static void merge_cb(struct extent_io_tree *tree, struct extent_state *new,
364 struct extent_state *other)
366 if (tree->ops && tree->ops->merge_extent_hook)
367 tree->ops->merge_extent_hook(tree->mapping->host, new,
372 * utility function to look for merge candidates inside a given range.
373 * Any extents with matching state are merged together into a single
374 * extent in the tree. Extents with EXTENT_IO in their state field
375 * are not merged because the end_io handlers need to be able to do
376 * operations on them without sleeping (or doing allocations/splits).
378 * This should be called with the tree lock held.
380 static void merge_state(struct extent_io_tree *tree,
381 struct extent_state *state)
383 struct extent_state *other;
384 struct rb_node *other_node;
386 if (state->state & (EXTENT_IOBITS | EXTENT_BOUNDARY))
389 other_node = rb_prev(&state->rb_node);
391 other = rb_entry(other_node, struct extent_state, rb_node);
392 if (other->end == state->start - 1 &&
393 other->state == state->state) {
394 merge_cb(tree, state, other);
395 state->start = other->start;
396 rb_erase(&other->rb_node, &tree->state);
397 RB_CLEAR_NODE(&other->rb_node);
398 free_extent_state(other);
401 other_node = rb_next(&state->rb_node);
403 other = rb_entry(other_node, struct extent_state, rb_node);
404 if (other->start == state->end + 1 &&
405 other->state == state->state) {
406 merge_cb(tree, state, other);
407 state->end = other->end;
408 rb_erase(&other->rb_node, &tree->state);
409 RB_CLEAR_NODE(&other->rb_node);
410 free_extent_state(other);
415 static void set_state_cb(struct extent_io_tree *tree,
416 struct extent_state *state, unsigned *bits)
418 if (tree->ops && tree->ops->set_bit_hook)
419 tree->ops->set_bit_hook(tree->mapping->host, state, bits);
422 static void clear_state_cb(struct extent_io_tree *tree,
423 struct extent_state *state, unsigned *bits)
425 if (tree->ops && tree->ops->clear_bit_hook)
426 tree->ops->clear_bit_hook(tree->mapping->host, state, bits);
429 static void set_state_bits(struct extent_io_tree *tree,
430 struct extent_state *state, unsigned *bits,
431 struct extent_changeset *changeset);
434 * insert an extent_state struct into the tree. 'bits' are set on the
435 * struct before it is inserted.
437 * This may return -EEXIST if the extent is already there, in which case the
438 * state struct is freed.
440 * The tree lock is not taken internally. This is a utility function and
441 * probably isn't what you want to call (see set/clear_extent_bit).
443 static int insert_state(struct extent_io_tree *tree,
444 struct extent_state *state, u64 start, u64 end,
446 struct rb_node **parent,
447 unsigned *bits, struct extent_changeset *changeset)
449 struct rb_node *node;
452 WARN(1, KERN_ERR "BTRFS: end < start %llu %llu\n",
454 state->start = start;
457 set_state_bits(tree, state, bits, changeset);
459 node = tree_insert(&tree->state, NULL, end, &state->rb_node, p, parent);
461 struct extent_state *found;
462 found = rb_entry(node, struct extent_state, rb_node);
463 printk(KERN_ERR "BTRFS: found node %llu %llu on insert of "
465 found->start, found->end, start, end);
468 merge_state(tree, state);
472 static void split_cb(struct extent_io_tree *tree, struct extent_state *orig,
475 if (tree->ops && tree->ops->split_extent_hook)
476 tree->ops->split_extent_hook(tree->mapping->host, orig, split);
480 * split a given extent state struct in two, inserting the preallocated
481 * struct 'prealloc' as the newly created second half. 'split' indicates an
482 * offset inside 'orig' where it should be split.
485 * the tree has 'orig' at [orig->start, orig->end]. After calling, there
486 * are two extent state structs in the tree:
487 * prealloc: [orig->start, split - 1]
488 * orig: [ split, orig->end ]
490 * The tree locks are not taken by this function. They need to be held
493 static int split_state(struct extent_io_tree *tree, struct extent_state *orig,
494 struct extent_state *prealloc, u64 split)
496 struct rb_node *node;
498 split_cb(tree, orig, split);
500 prealloc->start = orig->start;
501 prealloc->end = split - 1;
502 prealloc->state = orig->state;
505 node = tree_insert(&tree->state, &orig->rb_node, prealloc->end,
506 &prealloc->rb_node, NULL, NULL);
508 free_extent_state(prealloc);
514 static struct extent_state *next_state(struct extent_state *state)
516 struct rb_node *next = rb_next(&state->rb_node);
518 return rb_entry(next, struct extent_state, rb_node);
524 * utility function to clear some bits in an extent state struct.
525 * it will optionally wake up any one waiting on this state (wake == 1).
527 * If no bits are set on the state struct after clearing things, the
528 * struct is freed and removed from the tree
530 static struct extent_state *clear_state_bit(struct extent_io_tree *tree,
531 struct extent_state *state,
532 unsigned *bits, int wake,
533 struct extent_changeset *changeset)
535 struct extent_state *next;
536 unsigned bits_to_clear = *bits & ~EXTENT_CTLBITS;
538 if ((bits_to_clear & EXTENT_DIRTY) && (state->state & EXTENT_DIRTY)) {
539 u64 range = state->end - state->start + 1;
540 WARN_ON(range > tree->dirty_bytes);
541 tree->dirty_bytes -= range;
543 clear_state_cb(tree, state, bits);
544 add_extent_changeset(state, bits_to_clear, changeset, 0);
545 state->state &= ~bits_to_clear;
548 if (state->state == 0) {
549 next = next_state(state);
550 if (extent_state_in_tree(state)) {
551 rb_erase(&state->rb_node, &tree->state);
552 RB_CLEAR_NODE(&state->rb_node);
553 free_extent_state(state);
558 merge_state(tree, state);
559 next = next_state(state);
564 static struct extent_state *
565 alloc_extent_state_atomic(struct extent_state *prealloc)
568 prealloc = alloc_extent_state(GFP_ATOMIC);
573 static void extent_io_tree_panic(struct extent_io_tree *tree, int err)
575 btrfs_panic(tree_fs_info(tree), err, "Locking error: "
576 "Extent tree was modified by another "
577 "thread while locked.");
581 * clear some bits on a range in the tree. This may require splitting
582 * or inserting elements in the tree, so the gfp mask is used to
583 * indicate which allocations or sleeping are allowed.
585 * pass 'wake' == 1 to kick any sleepers, and 'delete' == 1 to remove
586 * the given range from the tree regardless of state (ie for truncate).
588 * the range [start, end] is inclusive.
590 * This takes the tree lock, and returns 0 on success and < 0 on error.
592 static int __clear_extent_bit(struct extent_io_tree *tree, u64 start, u64 end,
593 unsigned bits, int wake, int delete,
594 struct extent_state **cached_state,
595 gfp_t mask, struct extent_changeset *changeset)
597 struct extent_state *state;
598 struct extent_state *cached;
599 struct extent_state *prealloc = NULL;
600 struct rb_node *node;
605 btrfs_debug_check_extent_io_range(tree, start, end);
607 if (bits & EXTENT_DELALLOC)
608 bits |= EXTENT_NORESERVE;
611 bits |= ~EXTENT_CTLBITS;
612 bits |= EXTENT_FIRST_DELALLOC;
614 if (bits & (EXTENT_IOBITS | EXTENT_BOUNDARY))
617 if (!prealloc && gfpflags_allow_blocking(mask)) {
619 * Don't care for allocation failure here because we might end
620 * up not needing the pre-allocated extent state at all, which
621 * is the case if we only have in the tree extent states that
622 * cover our input range and don't cover too any other range.
623 * If we end up needing a new extent state we allocate it later.
625 prealloc = alloc_extent_state(mask);
628 spin_lock(&tree->lock);
630 cached = *cached_state;
633 *cached_state = NULL;
637 if (cached && extent_state_in_tree(cached) &&
638 cached->start <= start && cached->end > start) {
640 atomic_dec(&cached->refs);
645 free_extent_state(cached);
648 * this search will find the extents that end after
651 node = tree_search(tree, start);
654 state = rb_entry(node, struct extent_state, rb_node);
656 if (state->start > end)
658 WARN_ON(state->end < start);
659 last_end = state->end;
661 /* the state doesn't have the wanted bits, go ahead */
662 if (!(state->state & bits)) {
663 state = next_state(state);
668 * | ---- desired range ---- |
670 * | ------------- state -------------- |
672 * We need to split the extent we found, and may flip
673 * bits on second half.
675 * If the extent we found extends past our range, we
676 * just split and search again. It'll get split again
677 * the next time though.
679 * If the extent we found is inside our range, we clear
680 * the desired bit on it.
683 if (state->start < start) {
684 prealloc = alloc_extent_state_atomic(prealloc);
686 err = split_state(tree, state, prealloc, start);
688 extent_io_tree_panic(tree, err);
693 if (state->end <= end) {
694 state = clear_state_bit(tree, state, &bits, wake,
701 * | ---- desired range ---- |
703 * We need to split the extent, and clear the bit
706 if (state->start <= end && state->end > end) {
707 prealloc = alloc_extent_state_atomic(prealloc);
709 err = split_state(tree, state, prealloc, end + 1);
711 extent_io_tree_panic(tree, err);
716 clear_state_bit(tree, prealloc, &bits, wake, changeset);
722 state = clear_state_bit(tree, state, &bits, wake, changeset);
724 if (last_end == (u64)-1)
726 start = last_end + 1;
727 if (start <= end && state && !need_resched())
733 spin_unlock(&tree->lock);
734 if (gfpflags_allow_blocking(mask))
739 spin_unlock(&tree->lock);
741 free_extent_state(prealloc);
747 static void wait_on_state(struct extent_io_tree *tree,
748 struct extent_state *state)
749 __releases(tree->lock)
750 __acquires(tree->lock)
753 prepare_to_wait(&state->wq, &wait, TASK_UNINTERRUPTIBLE);
754 spin_unlock(&tree->lock);
756 spin_lock(&tree->lock);
757 finish_wait(&state->wq, &wait);
761 * waits for one or more bits to clear on a range in the state tree.
762 * The range [start, end] is inclusive.
763 * The tree lock is taken by this function
765 static void wait_extent_bit(struct extent_io_tree *tree, u64 start, u64 end,
768 struct extent_state *state;
769 struct rb_node *node;
771 btrfs_debug_check_extent_io_range(tree, start, end);
773 spin_lock(&tree->lock);
777 * this search will find all the extents that end after
780 node = tree_search(tree, start);
785 state = rb_entry(node, struct extent_state, rb_node);
787 if (state->start > end)
790 if (state->state & bits) {
791 start = state->start;
792 atomic_inc(&state->refs);
793 wait_on_state(tree, state);
794 free_extent_state(state);
797 start = state->end + 1;
802 if (!cond_resched_lock(&tree->lock)) {
803 node = rb_next(node);
808 spin_unlock(&tree->lock);
811 static void set_state_bits(struct extent_io_tree *tree,
812 struct extent_state *state,
813 unsigned *bits, struct extent_changeset *changeset)
815 unsigned bits_to_set = *bits & ~EXTENT_CTLBITS;
817 set_state_cb(tree, state, bits);
818 if ((bits_to_set & EXTENT_DIRTY) && !(state->state & EXTENT_DIRTY)) {
819 u64 range = state->end - state->start + 1;
820 tree->dirty_bytes += range;
822 add_extent_changeset(state, bits_to_set, changeset, 1);
823 state->state |= bits_to_set;
826 static void cache_state_if_flags(struct extent_state *state,
827 struct extent_state **cached_ptr,
830 if (cached_ptr && !(*cached_ptr)) {
831 if (!flags || (state->state & flags)) {
833 atomic_inc(&state->refs);
838 static void cache_state(struct extent_state *state,
839 struct extent_state **cached_ptr)
841 return cache_state_if_flags(state, cached_ptr,
842 EXTENT_IOBITS | EXTENT_BOUNDARY);
846 * set some bits on a range in the tree. This may require allocations or
847 * sleeping, so the gfp mask is used to indicate what is allowed.
849 * If any of the exclusive bits are set, this will fail with -EEXIST if some
850 * part of the range already has the desired bits set. The start of the
851 * existing range is returned in failed_start in this case.
853 * [start, end] is inclusive This takes the tree lock.
856 static int __must_check
857 __set_extent_bit(struct extent_io_tree *tree, u64 start, u64 end,
858 unsigned bits, unsigned exclusive_bits,
859 u64 *failed_start, struct extent_state **cached_state,
860 gfp_t mask, struct extent_changeset *changeset)
862 struct extent_state *state;
863 struct extent_state *prealloc = NULL;
864 struct rb_node *node;
866 struct rb_node *parent;
871 btrfs_debug_check_extent_io_range(tree, start, end);
873 bits |= EXTENT_FIRST_DELALLOC;
875 if (!prealloc && gfpflags_allow_blocking(mask)) {
877 * Don't care for allocation failure here because we might end
878 * up not needing the pre-allocated extent state at all, which
879 * is the case if we only have in the tree extent states that
880 * cover our input range and don't cover too any other range.
881 * If we end up needing a new extent state we allocate it later.
883 prealloc = alloc_extent_state(mask);
886 spin_lock(&tree->lock);
887 if (cached_state && *cached_state) {
888 state = *cached_state;
889 if (state->start <= start && state->end > start &&
890 extent_state_in_tree(state)) {
891 node = &state->rb_node;
896 * this search will find all the extents that end after
899 node = tree_search_for_insert(tree, start, &p, &parent);
901 prealloc = alloc_extent_state_atomic(prealloc);
903 err = insert_state(tree, prealloc, start, end,
904 &p, &parent, &bits, changeset);
906 extent_io_tree_panic(tree, err);
908 cache_state(prealloc, cached_state);
912 state = rb_entry(node, struct extent_state, rb_node);
914 last_start = state->start;
915 last_end = state->end;
918 * | ---- desired range ---- |
921 * Just lock what we found and keep going
923 if (state->start == start && state->end <= end) {
924 if (state->state & exclusive_bits) {
925 *failed_start = state->start;
930 set_state_bits(tree, state, &bits, changeset);
931 cache_state(state, cached_state);
932 merge_state(tree, state);
933 if (last_end == (u64)-1)
935 start = last_end + 1;
936 state = next_state(state);
937 if (start < end && state && state->start == start &&
944 * | ---- desired range ---- |
947 * | ------------- state -------------- |
949 * We need to split the extent we found, and may flip bits on
952 * If the extent we found extends past our
953 * range, we just split and search again. It'll get split
954 * again the next time though.
956 * If the extent we found is inside our range, we set the
959 if (state->start < start) {
960 if (state->state & exclusive_bits) {
961 *failed_start = start;
966 prealloc = alloc_extent_state_atomic(prealloc);
968 err = split_state(tree, state, prealloc, start);
970 extent_io_tree_panic(tree, err);
975 if (state->end <= end) {
976 set_state_bits(tree, state, &bits, changeset);
977 cache_state(state, cached_state);
978 merge_state(tree, state);
979 if (last_end == (u64)-1)
981 start = last_end + 1;
982 state = next_state(state);
983 if (start < end && state && state->start == start &&
990 * | ---- desired range ---- |
991 * | state | or | state |
993 * There's a hole, we need to insert something in it and
994 * ignore the extent we found.
996 if (state->start > start) {
998 if (end < last_start)
1001 this_end = last_start - 1;
1003 prealloc = alloc_extent_state_atomic(prealloc);
1007 * Avoid to free 'prealloc' if it can be merged with
1010 err = insert_state(tree, prealloc, start, this_end,
1011 NULL, NULL, &bits, changeset);
1013 extent_io_tree_panic(tree, err);
1015 cache_state(prealloc, cached_state);
1017 start = this_end + 1;
1021 * | ---- desired range ---- |
1023 * We need to split the extent, and set the bit
1026 if (state->start <= end && state->end > end) {
1027 if (state->state & exclusive_bits) {
1028 *failed_start = start;
1033 prealloc = alloc_extent_state_atomic(prealloc);
1035 err = split_state(tree, state, prealloc, end + 1);
1037 extent_io_tree_panic(tree, err);
1039 set_state_bits(tree, prealloc, &bits, changeset);
1040 cache_state(prealloc, cached_state);
1041 merge_state(tree, prealloc);
1049 spin_unlock(&tree->lock);
1050 if (gfpflags_allow_blocking(mask))
1055 spin_unlock(&tree->lock);
1057 free_extent_state(prealloc);
1063 int set_extent_bit(struct extent_io_tree *tree, u64 start, u64 end,
1064 unsigned bits, u64 * failed_start,
1065 struct extent_state **cached_state, gfp_t mask)
1067 return __set_extent_bit(tree, start, end, bits, 0, failed_start,
1068 cached_state, mask, NULL);
1073 * convert_extent_bit - convert all bits in a given range from one bit to
1075 * @tree: the io tree to search
1076 * @start: the start offset in bytes
1077 * @end: the end offset in bytes (inclusive)
1078 * @bits: the bits to set in this range
1079 * @clear_bits: the bits to clear in this range
1080 * @cached_state: state that we're going to cache
1082 * This will go through and set bits for the given range. If any states exist
1083 * already in this range they are set with the given bit and cleared of the
1084 * clear_bits. This is only meant to be used by things that are mergeable, ie
1085 * converting from say DELALLOC to DIRTY. This is not meant to be used with
1086 * boundary bits like LOCK.
1088 * All allocations are done with GFP_NOFS.
1090 int convert_extent_bit(struct extent_io_tree *tree, u64 start, u64 end,
1091 unsigned bits, unsigned clear_bits,
1092 struct extent_state **cached_state)
1094 struct extent_state *state;
1095 struct extent_state *prealloc = NULL;
1096 struct rb_node *node;
1098 struct rb_node *parent;
1102 bool first_iteration = true;
1104 btrfs_debug_check_extent_io_range(tree, start, end);
1109 * Best effort, don't worry if extent state allocation fails
1110 * here for the first iteration. We might have a cached state
1111 * that matches exactly the target range, in which case no
1112 * extent state allocations are needed. We'll only know this
1113 * after locking the tree.
1115 prealloc = alloc_extent_state(GFP_NOFS);
1116 if (!prealloc && !first_iteration)
1120 spin_lock(&tree->lock);
1121 if (cached_state && *cached_state) {
1122 state = *cached_state;
1123 if (state->start <= start && state->end > start &&
1124 extent_state_in_tree(state)) {
1125 node = &state->rb_node;
1131 * this search will find all the extents that end after
1134 node = tree_search_for_insert(tree, start, &p, &parent);
1136 prealloc = alloc_extent_state_atomic(prealloc);
1141 err = insert_state(tree, prealloc, start, end,
1142 &p, &parent, &bits, NULL);
1144 extent_io_tree_panic(tree, err);
1145 cache_state(prealloc, cached_state);
1149 state = rb_entry(node, struct extent_state, rb_node);
1151 last_start = state->start;
1152 last_end = state->end;
1155 * | ---- desired range ---- |
1158 * Just lock what we found and keep going
1160 if (state->start == start && state->end <= end) {
1161 set_state_bits(tree, state, &bits, NULL);
1162 cache_state(state, cached_state);
1163 state = clear_state_bit(tree, state, &clear_bits, 0, NULL);
1164 if (last_end == (u64)-1)
1166 start = last_end + 1;
1167 if (start < end && state && state->start == start &&
1174 * | ---- desired range ---- |
1177 * | ------------- state -------------- |
1179 * We need to split the extent we found, and may flip bits on
1182 * If the extent we found extends past our
1183 * range, we just split and search again. It'll get split
1184 * again the next time though.
1186 * If the extent we found is inside our range, we set the
1187 * desired bit on it.
1189 if (state->start < start) {
1190 prealloc = alloc_extent_state_atomic(prealloc);
1195 err = split_state(tree, state, prealloc, start);
1197 extent_io_tree_panic(tree, err);
1201 if (state->end <= end) {
1202 set_state_bits(tree, state, &bits, NULL);
1203 cache_state(state, cached_state);
1204 state = clear_state_bit(tree, state, &clear_bits, 0,
1206 if (last_end == (u64)-1)
1208 start = last_end + 1;
1209 if (start < end && state && state->start == start &&
1216 * | ---- desired range ---- |
1217 * | state | or | state |
1219 * There's a hole, we need to insert something in it and
1220 * ignore the extent we found.
1222 if (state->start > start) {
1224 if (end < last_start)
1227 this_end = last_start - 1;
1229 prealloc = alloc_extent_state_atomic(prealloc);
1236 * Avoid to free 'prealloc' if it can be merged with
1239 err = insert_state(tree, prealloc, start, this_end,
1240 NULL, NULL, &bits, NULL);
1242 extent_io_tree_panic(tree, err);
1243 cache_state(prealloc, cached_state);
1245 start = this_end + 1;
1249 * | ---- desired range ---- |
1251 * We need to split the extent, and set the bit
1254 if (state->start <= end && state->end > end) {
1255 prealloc = alloc_extent_state_atomic(prealloc);
1261 err = split_state(tree, state, prealloc, end + 1);
1263 extent_io_tree_panic(tree, err);
1265 set_state_bits(tree, prealloc, &bits, NULL);
1266 cache_state(prealloc, cached_state);
1267 clear_state_bit(tree, prealloc, &clear_bits, 0, NULL);
1275 spin_unlock(&tree->lock);
1277 first_iteration = false;
1281 spin_unlock(&tree->lock);
1283 free_extent_state(prealloc);
1288 /* wrappers around set/clear extent bit */
1289 int set_record_extent_bits(struct extent_io_tree *tree, u64 start, u64 end,
1290 unsigned bits, struct extent_changeset *changeset)
1293 * We don't support EXTENT_LOCKED yet, as current changeset will
1294 * record any bits changed, so for EXTENT_LOCKED case, it will
1295 * either fail with -EEXIST or changeset will record the whole
1298 BUG_ON(bits & EXTENT_LOCKED);
1300 return __set_extent_bit(tree, start, end, bits, 0, NULL, NULL, GFP_NOFS,
1304 int clear_extent_bit(struct extent_io_tree *tree, u64 start, u64 end,
1305 unsigned bits, int wake, int delete,
1306 struct extent_state **cached, gfp_t mask)
1308 return __clear_extent_bit(tree, start, end, bits, wake, delete,
1309 cached, mask, NULL);
1312 int clear_record_extent_bits(struct extent_io_tree *tree, u64 start, u64 end,
1313 unsigned bits, struct extent_changeset *changeset)
1316 * Don't support EXTENT_LOCKED case, same reason as
1317 * set_record_extent_bits().
1319 BUG_ON(bits & EXTENT_LOCKED);
1321 return __clear_extent_bit(tree, start, end, bits, 0, 0, NULL, GFP_NOFS,
1326 * either insert or lock state struct between start and end use mask to tell
1327 * us if waiting is desired.
1329 int lock_extent_bits(struct extent_io_tree *tree, u64 start, u64 end,
1330 struct extent_state **cached_state)
1336 err = __set_extent_bit(tree, start, end, EXTENT_LOCKED,
1337 EXTENT_LOCKED, &failed_start,
1338 cached_state, GFP_NOFS, NULL);
1339 if (err == -EEXIST) {
1340 wait_extent_bit(tree, failed_start, end, EXTENT_LOCKED);
1341 start = failed_start;
1344 WARN_ON(start > end);
1349 int try_lock_extent(struct extent_io_tree *tree, u64 start, u64 end)
1354 err = __set_extent_bit(tree, start, end, EXTENT_LOCKED, EXTENT_LOCKED,
1355 &failed_start, NULL, GFP_NOFS, NULL);
1356 if (err == -EEXIST) {
1357 if (failed_start > start)
1358 clear_extent_bit(tree, start, failed_start - 1,
1359 EXTENT_LOCKED, 1, 0, NULL, GFP_NOFS);
1365 void extent_range_clear_dirty_for_io(struct inode *inode, u64 start, u64 end)
1367 unsigned long index = start >> PAGE_SHIFT;
1368 unsigned long end_index = end >> PAGE_SHIFT;
1371 while (index <= end_index) {
1372 page = find_get_page(inode->i_mapping, index);
1373 BUG_ON(!page); /* Pages should be in the extent_io_tree */
1374 clear_page_dirty_for_io(page);
1380 void extent_range_redirty_for_io(struct inode *inode, u64 start, u64 end)
1382 unsigned long index = start >> PAGE_SHIFT;
1383 unsigned long end_index = end >> PAGE_SHIFT;
1386 while (index <= end_index) {
1387 page = find_get_page(inode->i_mapping, index);
1388 BUG_ON(!page); /* Pages should be in the extent_io_tree */
1389 __set_page_dirty_nobuffers(page);
1390 account_page_redirty(page);
1397 * helper function to set both pages and extents in the tree writeback
1399 static void set_range_writeback(struct extent_io_tree *tree, u64 start, u64 end)
1401 unsigned long index = start >> PAGE_SHIFT;
1402 unsigned long end_index = end >> PAGE_SHIFT;
1405 while (index <= end_index) {
1406 page = find_get_page(tree->mapping, index);
1407 BUG_ON(!page); /* Pages should be in the extent_io_tree */
1408 set_page_writeback(page);
1414 /* find the first state struct with 'bits' set after 'start', and
1415 * return it. tree->lock must be held. NULL will returned if
1416 * nothing was found after 'start'
1418 static struct extent_state *
1419 find_first_extent_bit_state(struct extent_io_tree *tree,
1420 u64 start, unsigned bits)
1422 struct rb_node *node;
1423 struct extent_state *state;
1426 * this search will find all the extents that end after
1429 node = tree_search(tree, start);
1434 state = rb_entry(node, struct extent_state, rb_node);
1435 if (state->end >= start && (state->state & bits))
1438 node = rb_next(node);
1447 * find the first offset in the io tree with 'bits' set. zero is
1448 * returned if we find something, and *start_ret and *end_ret are
1449 * set to reflect the state struct that was found.
1451 * If nothing was found, 1 is returned. If found something, return 0.
1453 int find_first_extent_bit(struct extent_io_tree *tree, u64 start,
1454 u64 *start_ret, u64 *end_ret, unsigned bits,
1455 struct extent_state **cached_state)
1457 struct extent_state *state;
1461 spin_lock(&tree->lock);
1462 if (cached_state && *cached_state) {
1463 state = *cached_state;
1464 if (state->end == start - 1 && extent_state_in_tree(state)) {
1465 n = rb_next(&state->rb_node);
1467 state = rb_entry(n, struct extent_state,
1469 if (state->state & bits)
1473 free_extent_state(*cached_state);
1474 *cached_state = NULL;
1477 free_extent_state(*cached_state);
1478 *cached_state = NULL;
1481 state = find_first_extent_bit_state(tree, start, bits);
1484 cache_state_if_flags(state, cached_state, 0);
1485 *start_ret = state->start;
1486 *end_ret = state->end;
1490 spin_unlock(&tree->lock);
1495 * find a contiguous range of bytes in the file marked as delalloc, not
1496 * more than 'max_bytes'. start and end are used to return the range,
1498 * 1 is returned if we find something, 0 if nothing was in the tree
1500 static noinline u64 find_delalloc_range(struct extent_io_tree *tree,
1501 u64 *start, u64 *end, u64 max_bytes,
1502 struct extent_state **cached_state)
1504 struct rb_node *node;
1505 struct extent_state *state;
1506 u64 cur_start = *start;
1508 u64 total_bytes = 0;
1510 spin_lock(&tree->lock);
1513 * this search will find all the extents that end after
1516 node = tree_search(tree, cur_start);
1524 state = rb_entry(node, struct extent_state, rb_node);
1525 if (found && (state->start != cur_start ||
1526 (state->state & EXTENT_BOUNDARY))) {
1529 if (!(state->state & EXTENT_DELALLOC)) {
1535 *start = state->start;
1536 *cached_state = state;
1537 atomic_inc(&state->refs);
1541 cur_start = state->end + 1;
1542 node = rb_next(node);
1543 total_bytes += state->end - state->start + 1;
1544 if (total_bytes >= max_bytes)
1550 spin_unlock(&tree->lock);
1554 static noinline void __unlock_for_delalloc(struct inode *inode,
1555 struct page *locked_page,
1559 struct page *pages[16];
1560 unsigned long index = start >> PAGE_SHIFT;
1561 unsigned long end_index = end >> PAGE_SHIFT;
1562 unsigned long nr_pages = end_index - index + 1;
1565 if (index == locked_page->index && end_index == index)
1568 while (nr_pages > 0) {
1569 ret = find_get_pages_contig(inode->i_mapping, index,
1570 min_t(unsigned long, nr_pages,
1571 ARRAY_SIZE(pages)), pages);
1572 for (i = 0; i < ret; i++) {
1573 if (pages[i] != locked_page)
1574 unlock_page(pages[i]);
1583 static noinline int lock_delalloc_pages(struct inode *inode,
1584 struct page *locked_page,
1588 unsigned long index = delalloc_start >> PAGE_SHIFT;
1589 unsigned long start_index = index;
1590 unsigned long end_index = delalloc_end >> PAGE_SHIFT;
1591 unsigned long pages_locked = 0;
1592 struct page *pages[16];
1593 unsigned long nrpages;
1597 /* the caller is responsible for locking the start index */
1598 if (index == locked_page->index && index == end_index)
1601 /* skip the page at the start index */
1602 nrpages = end_index - index + 1;
1603 while (nrpages > 0) {
1604 ret = find_get_pages_contig(inode->i_mapping, index,
1605 min_t(unsigned long,
1606 nrpages, ARRAY_SIZE(pages)), pages);
1611 /* now we have an array of pages, lock them all */
1612 for (i = 0; i < ret; i++) {
1614 * the caller is taking responsibility for
1617 if (pages[i] != locked_page) {
1618 lock_page(pages[i]);
1619 if (!PageDirty(pages[i]) ||
1620 pages[i]->mapping != inode->i_mapping) {
1622 unlock_page(pages[i]);
1636 if (ret && pages_locked) {
1637 __unlock_for_delalloc(inode, locked_page,
1639 ((u64)(start_index + pages_locked - 1)) <<
1646 * find a contiguous range of bytes in the file marked as delalloc, not
1647 * more than 'max_bytes'. start and end are used to return the range,
1649 * 1 is returned if we find something, 0 if nothing was in the tree
1651 STATIC u64 find_lock_delalloc_range(struct inode *inode,
1652 struct extent_io_tree *tree,
1653 struct page *locked_page, u64 *start,
1654 u64 *end, u64 max_bytes)
1659 struct extent_state *cached_state = NULL;
1664 /* step one, find a bunch of delalloc bytes starting at start */
1665 delalloc_start = *start;
1667 found = find_delalloc_range(tree, &delalloc_start, &delalloc_end,
1668 max_bytes, &cached_state);
1669 if (!found || delalloc_end <= *start) {
1670 *start = delalloc_start;
1671 *end = delalloc_end;
1672 free_extent_state(cached_state);
1677 * start comes from the offset of locked_page. We have to lock
1678 * pages in order, so we can't process delalloc bytes before
1681 if (delalloc_start < *start)
1682 delalloc_start = *start;
1685 * make sure to limit the number of pages we try to lock down
1687 if (delalloc_end + 1 - delalloc_start > max_bytes)
1688 delalloc_end = delalloc_start + max_bytes - 1;
1690 /* step two, lock all the pages after the page that has start */
1691 ret = lock_delalloc_pages(inode, locked_page,
1692 delalloc_start, delalloc_end);
1693 if (ret == -EAGAIN) {
1694 /* some of the pages are gone, lets avoid looping by
1695 * shortening the size of the delalloc range we're searching
1697 free_extent_state(cached_state);
1698 cached_state = NULL;
1700 max_bytes = PAGE_SIZE;
1708 BUG_ON(ret); /* Only valid values are 0 and -EAGAIN */
1710 /* step three, lock the state bits for the whole range */
1711 lock_extent_bits(tree, delalloc_start, delalloc_end, &cached_state);
1713 /* then test to make sure it is all still delalloc */
1714 ret = test_range_bit(tree, delalloc_start, delalloc_end,
1715 EXTENT_DELALLOC, 1, cached_state);
1717 unlock_extent_cached(tree, delalloc_start, delalloc_end,
1718 &cached_state, GFP_NOFS);
1719 __unlock_for_delalloc(inode, locked_page,
1720 delalloc_start, delalloc_end);
1724 free_extent_state(cached_state);
1725 *start = delalloc_start;
1726 *end = delalloc_end;
1731 void extent_clear_unlock_delalloc(struct inode *inode, u64 start, u64 end,
1732 struct page *locked_page,
1733 unsigned clear_bits,
1734 unsigned long page_ops)
1736 struct extent_io_tree *tree = &BTRFS_I(inode)->io_tree;
1738 struct page *pages[16];
1739 unsigned long index = start >> PAGE_SHIFT;
1740 unsigned long end_index = end >> PAGE_SHIFT;
1741 unsigned long nr_pages = end_index - index + 1;
1744 clear_extent_bit(tree, start, end, clear_bits, 1, 0, NULL, GFP_NOFS);
1748 if ((page_ops & PAGE_SET_ERROR) && nr_pages > 0)
1749 mapping_set_error(inode->i_mapping, -EIO);
1751 while (nr_pages > 0) {
1752 ret = find_get_pages_contig(inode->i_mapping, index,
1753 min_t(unsigned long,
1754 nr_pages, ARRAY_SIZE(pages)), pages);
1755 for (i = 0; i < ret; i++) {
1757 if (page_ops & PAGE_SET_PRIVATE2)
1758 SetPagePrivate2(pages[i]);
1760 if (pages[i] == locked_page) {
1764 if (page_ops & PAGE_CLEAR_DIRTY)
1765 clear_page_dirty_for_io(pages[i]);
1766 if (page_ops & PAGE_SET_WRITEBACK)
1767 set_page_writeback(pages[i]);
1768 if (page_ops & PAGE_SET_ERROR)
1769 SetPageError(pages[i]);
1770 if (page_ops & PAGE_END_WRITEBACK)
1771 end_page_writeback(pages[i]);
1772 if (page_ops & PAGE_UNLOCK)
1773 unlock_page(pages[i]);
1783 * count the number of bytes in the tree that have a given bit(s)
1784 * set. This can be fairly slow, except for EXTENT_DIRTY which is
1785 * cached. The total number found is returned.
1787 u64 count_range_bits(struct extent_io_tree *tree,
1788 u64 *start, u64 search_end, u64 max_bytes,
1789 unsigned bits, int contig)
1791 struct rb_node *node;
1792 struct extent_state *state;
1793 u64 cur_start = *start;
1794 u64 total_bytes = 0;
1798 if (WARN_ON(search_end <= cur_start))
1801 spin_lock(&tree->lock);
1802 if (cur_start == 0 && bits == EXTENT_DIRTY) {
1803 total_bytes = tree->dirty_bytes;
1807 * this search will find all the extents that end after
1810 node = tree_search(tree, cur_start);
1815 state = rb_entry(node, struct extent_state, rb_node);
1816 if (state->start > search_end)
1818 if (contig && found && state->start > last + 1)
1820 if (state->end >= cur_start && (state->state & bits) == bits) {
1821 total_bytes += min(search_end, state->end) + 1 -
1822 max(cur_start, state->start);
1823 if (total_bytes >= max_bytes)
1826 *start = max(cur_start, state->start);
1830 } else if (contig && found) {
1833 node = rb_next(node);
1838 spin_unlock(&tree->lock);
1843 * set the private field for a given byte offset in the tree. If there isn't
1844 * an extent_state there already, this does nothing.
1846 static noinline int set_state_failrec(struct extent_io_tree *tree, u64 start,
1847 struct io_failure_record *failrec)
1849 struct rb_node *node;
1850 struct extent_state *state;
1853 spin_lock(&tree->lock);
1855 * this search will find all the extents that end after
1858 node = tree_search(tree, start);
1863 state = rb_entry(node, struct extent_state, rb_node);
1864 if (state->start != start) {
1868 state->failrec = failrec;
1870 spin_unlock(&tree->lock);
1874 static noinline int get_state_failrec(struct extent_io_tree *tree, u64 start,
1875 struct io_failure_record **failrec)
1877 struct rb_node *node;
1878 struct extent_state *state;
1881 spin_lock(&tree->lock);
1883 * this search will find all the extents that end after
1886 node = tree_search(tree, start);
1891 state = rb_entry(node, struct extent_state, rb_node);
1892 if (state->start != start) {
1896 *failrec = state->failrec;
1898 spin_unlock(&tree->lock);
1903 * searches a range in the state tree for a given mask.
1904 * If 'filled' == 1, this returns 1 only if every extent in the tree
1905 * has the bits set. Otherwise, 1 is returned if any bit in the
1906 * range is found set.
1908 int test_range_bit(struct extent_io_tree *tree, u64 start, u64 end,
1909 unsigned bits, int filled, struct extent_state *cached)
1911 struct extent_state *state = NULL;
1912 struct rb_node *node;
1915 spin_lock(&tree->lock);
1916 if (cached && extent_state_in_tree(cached) && cached->start <= start &&
1917 cached->end > start)
1918 node = &cached->rb_node;
1920 node = tree_search(tree, start);
1921 while (node && start <= end) {
1922 state = rb_entry(node, struct extent_state, rb_node);
1924 if (filled && state->start > start) {
1929 if (state->start > end)
1932 if (state->state & bits) {
1936 } else if (filled) {
1941 if (state->end == (u64)-1)
1944 start = state->end + 1;
1947 node = rb_next(node);
1954 spin_unlock(&tree->lock);
1959 * helper function to set a given page up to date if all the
1960 * extents in the tree for that page are up to date
1962 static void check_page_uptodate(struct extent_io_tree *tree, struct page *page)
1964 u64 start = page_offset(page);
1965 u64 end = start + PAGE_SIZE - 1;
1966 if (test_range_bit(tree, start, end, EXTENT_UPTODATE, 1, NULL))
1967 SetPageUptodate(page);
1970 int free_io_failure(struct inode *inode, struct io_failure_record *rec)
1974 struct extent_io_tree *failure_tree = &BTRFS_I(inode)->io_failure_tree;
1976 set_state_failrec(failure_tree, rec->start, NULL);
1977 ret = clear_extent_bits(failure_tree, rec->start,
1978 rec->start + rec->len - 1,
1979 EXTENT_LOCKED | EXTENT_DIRTY);
1983 ret = clear_extent_bits(&BTRFS_I(inode)->io_tree, rec->start,
1984 rec->start + rec->len - 1,
1994 * this bypasses the standard btrfs submit functions deliberately, as
1995 * the standard behavior is to write all copies in a raid setup. here we only
1996 * want to write the one bad copy. so we do the mapping for ourselves and issue
1997 * submit_bio directly.
1998 * to avoid any synchronization issues, wait for the data after writing, which
1999 * actually prevents the read that triggered the error from finishing.
2000 * currently, there can be no more than two copies of every data bit. thus,
2001 * exactly one rewrite is required.
2003 int repair_io_failure(struct inode *inode, u64 start, u64 length, u64 logical,
2004 struct page *page, unsigned int pg_offset, int mirror_num)
2006 struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info;
2008 struct btrfs_device *dev;
2011 struct btrfs_bio *bbio = NULL;
2012 struct btrfs_mapping_tree *map_tree = &fs_info->mapping_tree;
2015 ASSERT(!(fs_info->sb->s_flags & MS_RDONLY));
2016 BUG_ON(!mirror_num);
2018 /* we can't repair anything in raid56 yet */
2019 if (btrfs_is_parity_mirror(map_tree, logical, length, mirror_num))
2022 bio = btrfs_io_bio_alloc(GFP_NOFS, 1);
2025 bio->bi_iter.bi_size = 0;
2026 map_length = length;
2029 * Avoid races with device replace and make sure our bbio has devices
2030 * associated to its stripes that don't go away while we are doing the
2031 * read repair operation.
2033 btrfs_bio_counter_inc_blocked(fs_info);
2034 ret = btrfs_map_block(fs_info, WRITE, logical,
2035 &map_length, &bbio, mirror_num);
2037 btrfs_bio_counter_dec(fs_info);
2041 BUG_ON(mirror_num != bbio->mirror_num);
2042 sector = bbio->stripes[mirror_num-1].physical >> 9;
2043 bio->bi_iter.bi_sector = sector;
2044 dev = bbio->stripes[mirror_num-1].dev;
2045 btrfs_put_bbio(bbio);
2046 if (!dev || !dev->bdev || !dev->writeable) {
2047 btrfs_bio_counter_dec(fs_info);
2051 bio->bi_bdev = dev->bdev;
2052 bio->bi_rw = WRITE_SYNC;
2053 bio_add_page(bio, page, length, pg_offset);
2055 if (btrfsic_submit_bio_wait(bio)) {
2056 /* try to remap that extent elsewhere? */
2057 btrfs_bio_counter_dec(fs_info);
2059 btrfs_dev_stat_inc_and_print(dev, BTRFS_DEV_STAT_WRITE_ERRS);
2063 btrfs_info_rl_in_rcu(fs_info,
2064 "read error corrected: ino %llu off %llu (dev %s sector %llu)",
2065 btrfs_ino(inode), start,
2066 rcu_str_deref(dev->name), sector);
2067 btrfs_bio_counter_dec(fs_info);
2072 int repair_eb_io_failure(struct btrfs_root *root, struct extent_buffer *eb,
2075 u64 start = eb->start;
2076 unsigned long i, num_pages = num_extent_pages(eb->start, eb->len);
2079 if (root->fs_info->sb->s_flags & MS_RDONLY)
2082 for (i = 0; i < num_pages; i++) {
2083 struct page *p = eb->pages[i];
2085 ret = repair_io_failure(root->fs_info->btree_inode, start,
2086 PAGE_SIZE, start, p,
2087 start - page_offset(p), mirror_num);
2097 * each time an IO finishes, we do a fast check in the IO failure tree
2098 * to see if we need to process or clean up an io_failure_record
2100 int clean_io_failure(struct inode *inode, u64 start, struct page *page,
2101 unsigned int pg_offset)
2104 struct io_failure_record *failrec;
2105 struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info;
2106 struct extent_state *state;
2111 ret = count_range_bits(&BTRFS_I(inode)->io_failure_tree, &private,
2112 (u64)-1, 1, EXTENT_DIRTY, 0);
2116 ret = get_state_failrec(&BTRFS_I(inode)->io_failure_tree, start,
2121 BUG_ON(!failrec->this_mirror);
2123 if (failrec->in_validation) {
2124 /* there was no real error, just free the record */
2125 pr_debug("clean_io_failure: freeing dummy error at %llu\n",
2129 if (fs_info->sb->s_flags & MS_RDONLY)
2132 spin_lock(&BTRFS_I(inode)->io_tree.lock);
2133 state = find_first_extent_bit_state(&BTRFS_I(inode)->io_tree,
2136 spin_unlock(&BTRFS_I(inode)->io_tree.lock);
2138 if (state && state->start <= failrec->start &&
2139 state->end >= failrec->start + failrec->len - 1) {
2140 num_copies = btrfs_num_copies(fs_info, failrec->logical,
2142 if (num_copies > 1) {
2143 repair_io_failure(inode, start, failrec->len,
2144 failrec->logical, page,
2145 pg_offset, failrec->failed_mirror);
2150 free_io_failure(inode, failrec);
2156 * Can be called when
2157 * - hold extent lock
2158 * - under ordered extent
2159 * - the inode is freeing
2161 void btrfs_free_io_failure_record(struct inode *inode, u64 start, u64 end)
2163 struct extent_io_tree *failure_tree = &BTRFS_I(inode)->io_failure_tree;
2164 struct io_failure_record *failrec;
2165 struct extent_state *state, *next;
2167 if (RB_EMPTY_ROOT(&failure_tree->state))
2170 spin_lock(&failure_tree->lock);
2171 state = find_first_extent_bit_state(failure_tree, start, EXTENT_DIRTY);
2173 if (state->start > end)
2176 ASSERT(state->end <= end);
2178 next = next_state(state);
2180 failrec = state->failrec;
2181 free_extent_state(state);
2186 spin_unlock(&failure_tree->lock);
2189 int btrfs_get_io_failure_record(struct inode *inode, u64 start, u64 end,
2190 struct io_failure_record **failrec_ret)
2192 struct io_failure_record *failrec;
2193 struct extent_map *em;
2194 struct extent_io_tree *failure_tree = &BTRFS_I(inode)->io_failure_tree;
2195 struct extent_io_tree *tree = &BTRFS_I(inode)->io_tree;
2196 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
2200 ret = get_state_failrec(failure_tree, start, &failrec);
2202 failrec = kzalloc(sizeof(*failrec), GFP_NOFS);
2206 failrec->start = start;
2207 failrec->len = end - start + 1;
2208 failrec->this_mirror = 0;
2209 failrec->bio_flags = 0;
2210 failrec->in_validation = 0;
2212 read_lock(&em_tree->lock);
2213 em = lookup_extent_mapping(em_tree, start, failrec->len);
2215 read_unlock(&em_tree->lock);
2220 if (em->start > start || em->start + em->len <= start) {
2221 free_extent_map(em);
2224 read_unlock(&em_tree->lock);
2230 logical = start - em->start;
2231 logical = em->block_start + logical;
2232 if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) {
2233 logical = em->block_start;
2234 failrec->bio_flags = EXTENT_BIO_COMPRESSED;
2235 extent_set_compress_type(&failrec->bio_flags,
2239 pr_debug("Get IO Failure Record: (new) logical=%llu, start=%llu, len=%llu\n",
2240 logical, start, failrec->len);
2242 failrec->logical = logical;
2243 free_extent_map(em);
2245 /* set the bits in the private failure tree */
2246 ret = set_extent_bits(failure_tree, start, end,
2247 EXTENT_LOCKED | EXTENT_DIRTY);
2249 ret = set_state_failrec(failure_tree, start, failrec);
2250 /* set the bits in the inode's tree */
2252 ret = set_extent_bits(tree, start, end, EXTENT_DAMAGED);
2258 pr_debug("Get IO Failure Record: (found) logical=%llu, start=%llu, len=%llu, validation=%d\n",
2259 failrec->logical, failrec->start, failrec->len,
2260 failrec->in_validation);
2262 * when data can be on disk more than twice, add to failrec here
2263 * (e.g. with a list for failed_mirror) to make
2264 * clean_io_failure() clean all those errors at once.
2268 *failrec_ret = failrec;
2273 int btrfs_check_repairable(struct inode *inode, struct bio *failed_bio,
2274 struct io_failure_record *failrec, int failed_mirror)
2278 num_copies = btrfs_num_copies(BTRFS_I(inode)->root->fs_info,
2279 failrec->logical, failrec->len);
2280 if (num_copies == 1) {
2282 * we only have a single copy of the data, so don't bother with
2283 * all the retry and error correction code that follows. no
2284 * matter what the error is, it is very likely to persist.
2286 pr_debug("Check Repairable: cannot repair, num_copies=%d, next_mirror %d, failed_mirror %d\n",
2287 num_copies, failrec->this_mirror, failed_mirror);
2292 * there are two premises:
2293 * a) deliver good data to the caller
2294 * b) correct the bad sectors on disk
2296 if (failed_bio->bi_vcnt > 1) {
2298 * to fulfill b), we need to know the exact failing sectors, as
2299 * we don't want to rewrite any more than the failed ones. thus,
2300 * we need separate read requests for the failed bio
2302 * if the following BUG_ON triggers, our validation request got
2303 * merged. we need separate requests for our algorithm to work.
2305 BUG_ON(failrec->in_validation);
2306 failrec->in_validation = 1;
2307 failrec->this_mirror = failed_mirror;
2310 * we're ready to fulfill a) and b) alongside. get a good copy
2311 * of the failed sector and if we succeed, we have setup
2312 * everything for repair_io_failure to do the rest for us.
2314 if (failrec->in_validation) {
2315 BUG_ON(failrec->this_mirror != failed_mirror);
2316 failrec->in_validation = 0;
2317 failrec->this_mirror = 0;
2319 failrec->failed_mirror = failed_mirror;
2320 failrec->this_mirror++;
2321 if (failrec->this_mirror == failed_mirror)
2322 failrec->this_mirror++;
2325 if (failrec->this_mirror > num_copies) {
2326 pr_debug("Check Repairable: (fail) num_copies=%d, next_mirror %d, failed_mirror %d\n",
2327 num_copies, failrec->this_mirror, failed_mirror);
2335 struct bio *btrfs_create_repair_bio(struct inode *inode, struct bio *failed_bio,
2336 struct io_failure_record *failrec,
2337 struct page *page, int pg_offset, int icsum,
2338 bio_end_io_t *endio_func, void *data)
2341 struct btrfs_io_bio *btrfs_failed_bio;
2342 struct btrfs_io_bio *btrfs_bio;
2344 bio = btrfs_io_bio_alloc(GFP_NOFS, 1);
2348 bio->bi_end_io = endio_func;
2349 bio->bi_iter.bi_sector = failrec->logical >> 9;
2350 bio->bi_bdev = BTRFS_I(inode)->root->fs_info->fs_devices->latest_bdev;
2351 bio->bi_iter.bi_size = 0;
2352 bio->bi_private = data;
2354 btrfs_failed_bio = btrfs_io_bio(failed_bio);
2355 if (btrfs_failed_bio->csum) {
2356 struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info;
2357 u16 csum_size = btrfs_super_csum_size(fs_info->super_copy);
2359 btrfs_bio = btrfs_io_bio(bio);
2360 btrfs_bio->csum = btrfs_bio->csum_inline;
2362 memcpy(btrfs_bio->csum, btrfs_failed_bio->csum + icsum,
2366 bio_add_page(bio, page, failrec->len, pg_offset);
2372 * this is a generic handler for readpage errors (default
2373 * readpage_io_failed_hook). if other copies exist, read those and write back
2374 * good data to the failed position. does not investigate in remapping the
2375 * failed extent elsewhere, hoping the device will be smart enough to do this as
2379 static int bio_readpage_error(struct bio *failed_bio, u64 phy_offset,
2380 struct page *page, u64 start, u64 end,
2383 struct io_failure_record *failrec;
2384 struct inode *inode = page->mapping->host;
2385 struct extent_io_tree *tree = &BTRFS_I(inode)->io_tree;
2390 BUG_ON(failed_bio->bi_rw & REQ_WRITE);
2392 ret = btrfs_get_io_failure_record(inode, start, end, &failrec);
2396 ret = btrfs_check_repairable(inode, failed_bio, failrec, failed_mirror);
2398 free_io_failure(inode, failrec);
2402 if (failed_bio->bi_vcnt > 1)
2403 read_mode = READ_SYNC | REQ_FAILFAST_DEV;
2405 read_mode = READ_SYNC;
2407 phy_offset >>= inode->i_sb->s_blocksize_bits;
2408 bio = btrfs_create_repair_bio(inode, failed_bio, failrec, page,
2409 start - page_offset(page),
2410 (int)phy_offset, failed_bio->bi_end_io,
2413 free_io_failure(inode, failrec);
2417 pr_debug("Repair Read Error: submitting new read[%#x] to this_mirror=%d, in_validation=%d\n",
2418 read_mode, failrec->this_mirror, failrec->in_validation);
2420 ret = tree->ops->submit_bio_hook(inode, read_mode, bio,
2421 failrec->this_mirror,
2422 failrec->bio_flags, 0);
2424 free_io_failure(inode, failrec);
2431 /* lots and lots of room for performance fixes in the end_bio funcs */
2433 void end_extent_writepage(struct page *page, int err, u64 start, u64 end)
2435 int uptodate = (err == 0);
2436 struct extent_io_tree *tree;
2439 tree = &BTRFS_I(page->mapping->host)->io_tree;
2441 if (tree->ops && tree->ops->writepage_end_io_hook) {
2442 ret = tree->ops->writepage_end_io_hook(page, start,
2443 end, NULL, uptodate);
2449 ClearPageUptodate(page);
2451 ret = ret < 0 ? ret : -EIO;
2452 mapping_set_error(page->mapping, ret);
2457 * after a writepage IO is done, we need to:
2458 * clear the uptodate bits on error
2459 * clear the writeback bits in the extent tree for this IO
2460 * end_page_writeback if the page has no more pending IO
2462 * Scheduling is not allowed, so the extent state tree is expected
2463 * to have one and only one object corresponding to this IO.
2465 static void end_bio_extent_writepage(struct bio *bio)
2467 struct bio_vec *bvec;
2472 bio_for_each_segment_all(bvec, bio, i) {
2473 struct page *page = bvec->bv_page;
2475 /* We always issue full-page reads, but if some block
2476 * in a page fails to read, blk_update_request() will
2477 * advance bv_offset and adjust bv_len to compensate.
2478 * Print a warning for nonzero offsets, and an error
2479 * if they don't add up to a full page. */
2480 if (bvec->bv_offset || bvec->bv_len != PAGE_SIZE) {
2481 if (bvec->bv_offset + bvec->bv_len != PAGE_SIZE)
2482 btrfs_err(BTRFS_I(page->mapping->host)->root->fs_info,
2483 "partial page write in btrfs with offset %u and length %u",
2484 bvec->bv_offset, bvec->bv_len);
2486 btrfs_info(BTRFS_I(page->mapping->host)->root->fs_info,
2487 "incomplete page write in btrfs with offset %u and "
2489 bvec->bv_offset, bvec->bv_len);
2492 start = page_offset(page);
2493 end = start + bvec->bv_offset + bvec->bv_len - 1;
2495 end_extent_writepage(page, bio->bi_error, start, end);
2496 end_page_writeback(page);
2503 endio_readpage_release_extent(struct extent_io_tree *tree, u64 start, u64 len,
2506 struct extent_state *cached = NULL;
2507 u64 end = start + len - 1;
2509 if (uptodate && tree->track_uptodate)
2510 set_extent_uptodate(tree, start, end, &cached, GFP_ATOMIC);
2511 unlock_extent_cached(tree, start, end, &cached, GFP_ATOMIC);
2515 * after a readpage IO is done, we need to:
2516 * clear the uptodate bits on error
2517 * set the uptodate bits if things worked
2518 * set the page up to date if all extents in the tree are uptodate
2519 * clear the lock bit in the extent tree
2520 * unlock the page if there are no other extents locked for it
2522 * Scheduling is not allowed, so the extent state tree is expected
2523 * to have one and only one object corresponding to this IO.
2525 static void end_bio_extent_readpage(struct bio *bio)
2527 struct bio_vec *bvec;
2528 int uptodate = !bio->bi_error;
2529 struct btrfs_io_bio *io_bio = btrfs_io_bio(bio);
2530 struct extent_io_tree *tree;
2535 u64 extent_start = 0;
2541 bio_for_each_segment_all(bvec, bio, i) {
2542 struct page *page = bvec->bv_page;
2543 struct inode *inode = page->mapping->host;
2545 pr_debug("end_bio_extent_readpage: bi_sector=%llu, err=%d, "
2546 "mirror=%u\n", (u64)bio->bi_iter.bi_sector,
2547 bio->bi_error, io_bio->mirror_num);
2548 tree = &BTRFS_I(inode)->io_tree;
2550 /* We always issue full-page reads, but if some block
2551 * in a page fails to read, blk_update_request() will
2552 * advance bv_offset and adjust bv_len to compensate.
2553 * Print a warning for nonzero offsets, and an error
2554 * if they don't add up to a full page. */
2555 if (bvec->bv_offset || bvec->bv_len != PAGE_SIZE) {
2556 if (bvec->bv_offset + bvec->bv_len != PAGE_SIZE)
2557 btrfs_err(BTRFS_I(page->mapping->host)->root->fs_info,
2558 "partial page read in btrfs with offset %u and length %u",
2559 bvec->bv_offset, bvec->bv_len);
2561 btrfs_info(BTRFS_I(page->mapping->host)->root->fs_info,
2562 "incomplete page read in btrfs with offset %u and "
2564 bvec->bv_offset, bvec->bv_len);
2567 start = page_offset(page);
2568 end = start + bvec->bv_offset + bvec->bv_len - 1;
2571 mirror = io_bio->mirror_num;
2572 if (likely(uptodate && tree->ops &&
2573 tree->ops->readpage_end_io_hook)) {
2574 ret = tree->ops->readpage_end_io_hook(io_bio, offset,
2580 clean_io_failure(inode, start, page, 0);
2583 if (likely(uptodate))
2586 if (tree->ops && tree->ops->readpage_io_failed_hook) {
2587 ret = tree->ops->readpage_io_failed_hook(page, mirror);
2588 if (!ret && !bio->bi_error)
2592 * The generic bio_readpage_error handles errors the
2593 * following way: If possible, new read requests are
2594 * created and submitted and will end up in
2595 * end_bio_extent_readpage as well (if we're lucky, not
2596 * in the !uptodate case). In that case it returns 0 and
2597 * we just go on with the next page in our bio. If it
2598 * can't handle the error it will return -EIO and we
2599 * remain responsible for that page.
2601 ret = bio_readpage_error(bio, offset, page, start, end,
2604 uptodate = !bio->bi_error;
2610 if (likely(uptodate)) {
2611 loff_t i_size = i_size_read(inode);
2612 pgoff_t end_index = i_size >> PAGE_SHIFT;
2615 /* Zero out the end if this page straddles i_size */
2616 off = i_size & (PAGE_SIZE-1);
2617 if (page->index == end_index && off)
2618 zero_user_segment(page, off, PAGE_SIZE);
2619 SetPageUptodate(page);
2621 ClearPageUptodate(page);
2627 if (unlikely(!uptodate)) {
2629 endio_readpage_release_extent(tree,
2635 endio_readpage_release_extent(tree, start,
2636 end - start + 1, 0);
2637 } else if (!extent_len) {
2638 extent_start = start;
2639 extent_len = end + 1 - start;
2640 } else if (extent_start + extent_len == start) {
2641 extent_len += end + 1 - start;
2643 endio_readpage_release_extent(tree, extent_start,
2644 extent_len, uptodate);
2645 extent_start = start;
2646 extent_len = end + 1 - start;
2651 endio_readpage_release_extent(tree, extent_start, extent_len,
2654 io_bio->end_io(io_bio, bio->bi_error);
2659 * this allocates from the btrfs_bioset. We're returning a bio right now
2660 * but you can call btrfs_io_bio for the appropriate container_of magic
2663 btrfs_bio_alloc(struct block_device *bdev, u64 first_sector, int nr_vecs,
2666 struct btrfs_io_bio *btrfs_bio;
2669 bio = bio_alloc_bioset(gfp_flags, nr_vecs, btrfs_bioset);
2671 if (bio == NULL && (current->flags & PF_MEMALLOC)) {
2672 while (!bio && (nr_vecs /= 2)) {
2673 bio = bio_alloc_bioset(gfp_flags,
2674 nr_vecs, btrfs_bioset);
2679 bio->bi_bdev = bdev;
2680 bio->bi_iter.bi_sector = first_sector;
2681 btrfs_bio = btrfs_io_bio(bio);
2682 btrfs_bio->csum = NULL;
2683 btrfs_bio->csum_allocated = NULL;
2684 btrfs_bio->end_io = NULL;
2689 struct bio *btrfs_bio_clone(struct bio *bio, gfp_t gfp_mask)
2691 struct btrfs_io_bio *btrfs_bio;
2694 new = bio_clone_bioset(bio, gfp_mask, btrfs_bioset);
2696 btrfs_bio = btrfs_io_bio(new);
2697 btrfs_bio->csum = NULL;
2698 btrfs_bio->csum_allocated = NULL;
2699 btrfs_bio->end_io = NULL;
2701 #ifdef CONFIG_BLK_CGROUP
2702 /* FIXME, put this into bio_clone_bioset */
2704 bio_associate_blkcg(new, bio->bi_css);
2710 /* this also allocates from the btrfs_bioset */
2711 struct bio *btrfs_io_bio_alloc(gfp_t gfp_mask, unsigned int nr_iovecs)
2713 struct btrfs_io_bio *btrfs_bio;
2716 bio = bio_alloc_bioset(gfp_mask, nr_iovecs, btrfs_bioset);
2718 btrfs_bio = btrfs_io_bio(bio);
2719 btrfs_bio->csum = NULL;
2720 btrfs_bio->csum_allocated = NULL;
2721 btrfs_bio->end_io = NULL;
2727 static int __must_check submit_one_bio(int rw, struct bio *bio,
2728 int mirror_num, unsigned long bio_flags)
2731 struct bio_vec *bvec = bio->bi_io_vec + bio->bi_vcnt - 1;
2732 struct page *page = bvec->bv_page;
2733 struct extent_io_tree *tree = bio->bi_private;
2736 start = page_offset(page) + bvec->bv_offset;
2738 bio->bi_private = NULL;
2742 if (tree->ops && tree->ops->submit_bio_hook)
2743 ret = tree->ops->submit_bio_hook(page->mapping->host, rw, bio,
2744 mirror_num, bio_flags, start);
2746 btrfsic_submit_bio(bio);
2752 static int merge_bio(int rw, struct extent_io_tree *tree, struct page *page,
2753 unsigned long offset, size_t size, struct bio *bio,
2754 unsigned long bio_flags)
2757 if (tree->ops && tree->ops->merge_bio_hook)
2758 ret = tree->ops->merge_bio_hook(rw, page, offset, size, bio,
2765 static int submit_extent_page(int rw, struct extent_io_tree *tree,
2766 struct writeback_control *wbc,
2767 struct page *page, sector_t sector,
2768 size_t size, unsigned long offset,
2769 struct block_device *bdev,
2770 struct bio **bio_ret,
2771 unsigned long max_pages,
2772 bio_end_io_t end_io_func,
2774 unsigned long prev_bio_flags,
2775 unsigned long bio_flags,
2776 bool force_bio_submit)
2781 int old_compressed = prev_bio_flags & EXTENT_BIO_COMPRESSED;
2782 size_t page_size = min_t(size_t, size, PAGE_SIZE);
2784 if (bio_ret && *bio_ret) {
2787 contig = bio->bi_iter.bi_sector == sector;
2789 contig = bio_end_sector(bio) == sector;
2791 if (prev_bio_flags != bio_flags || !contig ||
2793 merge_bio(rw, tree, page, offset, page_size, bio, bio_flags) ||
2794 bio_add_page(bio, page, page_size, offset) < page_size) {
2795 ret = submit_one_bio(rw, bio, mirror_num,
2804 wbc_account_io(wbc, page, page_size);
2809 bio = btrfs_bio_alloc(bdev, sector, BIO_MAX_PAGES,
2810 GFP_NOFS | __GFP_HIGH);
2814 bio_add_page(bio, page, page_size, offset);
2815 bio->bi_end_io = end_io_func;
2816 bio->bi_private = tree;
2818 wbc_init_bio(wbc, bio);
2819 wbc_account_io(wbc, page, page_size);
2825 ret = submit_one_bio(rw, bio, mirror_num, bio_flags);
2830 static void attach_extent_buffer_page(struct extent_buffer *eb,
2833 if (!PagePrivate(page)) {
2834 SetPagePrivate(page);
2836 set_page_private(page, (unsigned long)eb);
2838 WARN_ON(page->private != (unsigned long)eb);
2842 void set_page_extent_mapped(struct page *page)
2844 if (!PagePrivate(page)) {
2845 SetPagePrivate(page);
2847 set_page_private(page, EXTENT_PAGE_PRIVATE);
2851 static struct extent_map *
2852 __get_extent_map(struct inode *inode, struct page *page, size_t pg_offset,
2853 u64 start, u64 len, get_extent_t *get_extent,
2854 struct extent_map **em_cached)
2856 struct extent_map *em;
2858 if (em_cached && *em_cached) {
2860 if (extent_map_in_tree(em) && start >= em->start &&
2861 start < extent_map_end(em)) {
2862 atomic_inc(&em->refs);
2866 free_extent_map(em);
2870 em = get_extent(inode, page, pg_offset, start, len, 0);
2871 if (em_cached && !IS_ERR_OR_NULL(em)) {
2873 atomic_inc(&em->refs);
2879 * basic readpage implementation. Locked extent state structs are inserted
2880 * into the tree that are removed when the IO is done (by the end_io
2882 * XXX JDM: This needs looking at to ensure proper page locking
2884 static int __do_readpage(struct extent_io_tree *tree,
2886 get_extent_t *get_extent,
2887 struct extent_map **em_cached,
2888 struct bio **bio, int mirror_num,
2889 unsigned long *bio_flags, int rw,
2892 struct inode *inode = page->mapping->host;
2893 u64 start = page_offset(page);
2894 u64 page_end = start + PAGE_SIZE - 1;
2898 u64 last_byte = i_size_read(inode);
2902 struct extent_map *em;
2903 struct block_device *bdev;
2906 size_t pg_offset = 0;
2908 size_t disk_io_size;
2909 size_t blocksize = inode->i_sb->s_blocksize;
2910 unsigned long this_bio_flag = 0;
2912 set_page_extent_mapped(page);
2915 if (!PageUptodate(page)) {
2916 if (cleancache_get_page(page) == 0) {
2917 BUG_ON(blocksize != PAGE_SIZE);
2918 unlock_extent(tree, start, end);
2923 if (page->index == last_byte >> PAGE_SHIFT) {
2925 size_t zero_offset = last_byte & (PAGE_SIZE - 1);
2928 iosize = PAGE_SIZE - zero_offset;
2929 userpage = kmap_atomic(page);
2930 memset(userpage + zero_offset, 0, iosize);
2931 flush_dcache_page(page);
2932 kunmap_atomic(userpage);
2935 while (cur <= end) {
2936 unsigned long pnr = (last_byte >> PAGE_SHIFT) + 1;
2937 bool force_bio_submit = false;
2939 if (cur >= last_byte) {
2941 struct extent_state *cached = NULL;
2943 iosize = PAGE_SIZE - pg_offset;
2944 userpage = kmap_atomic(page);
2945 memset(userpage + pg_offset, 0, iosize);
2946 flush_dcache_page(page);
2947 kunmap_atomic(userpage);
2948 set_extent_uptodate(tree, cur, cur + iosize - 1,
2950 unlock_extent_cached(tree, cur,
2955 em = __get_extent_map(inode, page, pg_offset, cur,
2956 end - cur + 1, get_extent, em_cached);
2957 if (IS_ERR_OR_NULL(em)) {
2959 unlock_extent(tree, cur, end);
2962 extent_offset = cur - em->start;
2963 BUG_ON(extent_map_end(em) <= cur);
2966 if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) {
2967 this_bio_flag |= EXTENT_BIO_COMPRESSED;
2968 extent_set_compress_type(&this_bio_flag,
2972 iosize = min(extent_map_end(em) - cur, end - cur + 1);
2973 cur_end = min(extent_map_end(em) - 1, end);
2974 iosize = ALIGN(iosize, blocksize);
2975 if (this_bio_flag & EXTENT_BIO_COMPRESSED) {
2976 disk_io_size = em->block_len;
2977 sector = em->block_start >> 9;
2979 sector = (em->block_start + extent_offset) >> 9;
2980 disk_io_size = iosize;
2983 block_start = em->block_start;
2984 if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags))
2985 block_start = EXTENT_MAP_HOLE;
2988 * If we have a file range that points to a compressed extent
2989 * and it's followed by a consecutive file range that points to
2990 * to the same compressed extent (possibly with a different
2991 * offset and/or length, so it either points to the whole extent
2992 * or only part of it), we must make sure we do not submit a
2993 * single bio to populate the pages for the 2 ranges because
2994 * this makes the compressed extent read zero out the pages
2995 * belonging to the 2nd range. Imagine the following scenario:
2998 * [0 - 8K] [8K - 24K]
3001 * points to extent X, points to extent X,
3002 * offset 4K, length of 8K offset 0, length 16K
3004 * [extent X, compressed length = 4K uncompressed length = 16K]
3006 * If the bio to read the compressed extent covers both ranges,
3007 * it will decompress extent X into the pages belonging to the
3008 * first range and then it will stop, zeroing out the remaining
3009 * pages that belong to the other range that points to extent X.
3010 * So here we make sure we submit 2 bios, one for the first
3011 * range and another one for the third range. Both will target
3012 * the same physical extent from disk, but we can't currently
3013 * make the compressed bio endio callback populate the pages
3014 * for both ranges because each compressed bio is tightly
3015 * coupled with a single extent map, and each range can have
3016 * an extent map with a different offset value relative to the
3017 * uncompressed data of our extent and different lengths. This
3018 * is a corner case so we prioritize correctness over
3019 * non-optimal behavior (submitting 2 bios for the same extent).
3021 if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags) &&
3022 prev_em_start && *prev_em_start != (u64)-1 &&
3023 *prev_em_start != em->orig_start)
3024 force_bio_submit = true;
3027 *prev_em_start = em->orig_start;
3029 free_extent_map(em);
3032 /* we've found a hole, just zero and go on */
3033 if (block_start == EXTENT_MAP_HOLE) {
3035 struct extent_state *cached = NULL;
3037 userpage = kmap_atomic(page);
3038 memset(userpage + pg_offset, 0, iosize);
3039 flush_dcache_page(page);
3040 kunmap_atomic(userpage);
3042 set_extent_uptodate(tree, cur, cur + iosize - 1,
3044 unlock_extent_cached(tree, cur,
3048 pg_offset += iosize;
3051 /* the get_extent function already copied into the page */
3052 if (test_range_bit(tree, cur, cur_end,
3053 EXTENT_UPTODATE, 1, NULL)) {
3054 check_page_uptodate(tree, page);
3055 unlock_extent(tree, cur, cur + iosize - 1);
3057 pg_offset += iosize;
3060 /* we have an inline extent but it didn't get marked up
3061 * to date. Error out
3063 if (block_start == EXTENT_MAP_INLINE) {
3065 unlock_extent(tree, cur, cur + iosize - 1);
3067 pg_offset += iosize;
3072 ret = submit_extent_page(rw, tree, NULL, page,
3073 sector, disk_io_size, pg_offset,
3075 end_bio_extent_readpage, mirror_num,
3081 *bio_flags = this_bio_flag;
3084 unlock_extent(tree, cur, cur + iosize - 1);
3087 pg_offset += iosize;
3091 if (!PageError(page))
3092 SetPageUptodate(page);
3098 static inline void __do_contiguous_readpages(struct extent_io_tree *tree,
3099 struct page *pages[], int nr_pages,
3101 get_extent_t *get_extent,
3102 struct extent_map **em_cached,
3103 struct bio **bio, int mirror_num,
3104 unsigned long *bio_flags, int rw,
3107 struct inode *inode;
3108 struct btrfs_ordered_extent *ordered;
3111 inode = pages[0]->mapping->host;
3113 lock_extent(tree, start, end);
3114 ordered = btrfs_lookup_ordered_range(inode, start,
3118 unlock_extent(tree, start, end);
3119 btrfs_start_ordered_extent(inode, ordered, 1);
3120 btrfs_put_ordered_extent(ordered);
3123 for (index = 0; index < nr_pages; index++) {
3124 __do_readpage(tree, pages[index], get_extent, em_cached, bio,
3125 mirror_num, bio_flags, rw, prev_em_start);
3126 put_page(pages[index]);
3130 static void __extent_readpages(struct extent_io_tree *tree,
3131 struct page *pages[],
3132 int nr_pages, get_extent_t *get_extent,
3133 struct extent_map **em_cached,
3134 struct bio **bio, int mirror_num,
3135 unsigned long *bio_flags, int rw,
3142 int first_index = 0;
3144 for (index = 0; index < nr_pages; index++) {
3145 page_start = page_offset(pages[index]);
3148 end = start + PAGE_SIZE - 1;
3149 first_index = index;
3150 } else if (end + 1 == page_start) {
3153 __do_contiguous_readpages(tree, &pages[first_index],
3154 index - first_index, start,
3155 end, get_extent, em_cached,
3156 bio, mirror_num, bio_flags,
3159 end = start + PAGE_SIZE - 1;
3160 first_index = index;
3165 __do_contiguous_readpages(tree, &pages[first_index],
3166 index - first_index, start,
3167 end, get_extent, em_cached, bio,
3168 mirror_num, bio_flags, rw,
3172 static int __extent_read_full_page(struct extent_io_tree *tree,
3174 get_extent_t *get_extent,
3175 struct bio **bio, int mirror_num,
3176 unsigned long *bio_flags, int rw)
3178 struct inode *inode = page->mapping->host;
3179 struct btrfs_ordered_extent *ordered;
3180 u64 start = page_offset(page);
3181 u64 end = start + PAGE_SIZE - 1;
3185 lock_extent(tree, start, end);
3186 ordered = btrfs_lookup_ordered_range(inode, start,
3190 unlock_extent(tree, start, end);
3191 btrfs_start_ordered_extent(inode, ordered, 1);
3192 btrfs_put_ordered_extent(ordered);
3195 ret = __do_readpage(tree, page, get_extent, NULL, bio, mirror_num,
3196 bio_flags, rw, NULL);
3200 int extent_read_full_page(struct extent_io_tree *tree, struct page *page,
3201 get_extent_t *get_extent, int mirror_num)
3203 struct bio *bio = NULL;
3204 unsigned long bio_flags = 0;
3207 ret = __extent_read_full_page(tree, page, get_extent, &bio, mirror_num,
3210 ret = submit_one_bio(READ, bio, mirror_num, bio_flags);
3214 static void update_nr_written(struct page *page, struct writeback_control *wbc,
3215 unsigned long nr_written)
3217 wbc->nr_to_write -= nr_written;
3221 * helper for __extent_writepage, doing all of the delayed allocation setup.
3223 * This returns 1 if our fill_delalloc function did all the work required
3224 * to write the page (copy into inline extent). In this case the IO has
3225 * been started and the page is already unlocked.
3227 * This returns 0 if all went well (page still locked)
3228 * This returns < 0 if there were errors (page still locked)
3230 static noinline_for_stack int writepage_delalloc(struct inode *inode,
3231 struct page *page, struct writeback_control *wbc,
3232 struct extent_page_data *epd,
3234 unsigned long *nr_written)
3236 struct extent_io_tree *tree = epd->tree;
3237 u64 page_end = delalloc_start + PAGE_SIZE - 1;
3239 u64 delalloc_to_write = 0;
3240 u64 delalloc_end = 0;
3242 int page_started = 0;
3244 if (epd->extent_locked || !tree->ops || !tree->ops->fill_delalloc)
3247 while (delalloc_end < page_end) {
3248 nr_delalloc = find_lock_delalloc_range(inode, tree,
3252 BTRFS_MAX_EXTENT_SIZE);
3253 if (nr_delalloc == 0) {
3254 delalloc_start = delalloc_end + 1;
3257 ret = tree->ops->fill_delalloc(inode, page,
3262 /* File system has been set read-only */
3265 /* fill_delalloc should be return < 0 for error
3266 * but just in case, we use > 0 here meaning the
3267 * IO is started, so we don't want to return > 0
3268 * unless things are going well.
3270 ret = ret < 0 ? ret : -EIO;
3274 * delalloc_end is already one less than the total length, so
3275 * we don't subtract one from PAGE_SIZE
3277 delalloc_to_write += (delalloc_end - delalloc_start +
3278 PAGE_SIZE) >> PAGE_SHIFT;
3279 delalloc_start = delalloc_end + 1;
3281 if (wbc->nr_to_write < delalloc_to_write) {
3284 if (delalloc_to_write < thresh * 2)
3285 thresh = delalloc_to_write;
3286 wbc->nr_to_write = min_t(u64, delalloc_to_write,
3290 /* did the fill delalloc function already unlock and start
3295 * we've unlocked the page, so we can't update
3296 * the mapping's writeback index, just update
3299 wbc->nr_to_write -= *nr_written;
3310 * helper for __extent_writepage. This calls the writepage start hooks,
3311 * and does the loop to map the page into extents and bios.
3313 * We return 1 if the IO is started and the page is unlocked,
3314 * 0 if all went well (page still locked)
3315 * < 0 if there were errors (page still locked)
3317 static noinline_for_stack int __extent_writepage_io(struct inode *inode,
3319 struct writeback_control *wbc,
3320 struct extent_page_data *epd,
3322 unsigned long nr_written,
3323 int write_flags, int *nr_ret)
3325 struct extent_io_tree *tree = epd->tree;
3326 u64 start = page_offset(page);
3327 u64 page_end = start + PAGE_SIZE - 1;
3334 struct extent_state *cached_state = NULL;
3335 struct extent_map *em;
3336 struct block_device *bdev;
3337 size_t pg_offset = 0;
3343 if (tree->ops && tree->ops->writepage_start_hook) {
3344 ret = tree->ops->writepage_start_hook(page, start,
3347 /* Fixup worker will requeue */
3349 wbc->pages_skipped++;
3351 redirty_page_for_writepage(wbc, page);
3353 update_nr_written(page, wbc, nr_written);
3361 * we don't want to touch the inode after unlocking the page,
3362 * so we update the mapping writeback index now
3364 update_nr_written(page, wbc, nr_written + 1);
3367 if (i_size <= start) {
3368 if (tree->ops && tree->ops->writepage_end_io_hook)
3369 tree->ops->writepage_end_io_hook(page, start,
3374 blocksize = inode->i_sb->s_blocksize;
3376 while (cur <= end) {
3378 unsigned long max_nr;
3380 if (cur >= i_size) {
3381 if (tree->ops && tree->ops->writepage_end_io_hook)
3382 tree->ops->writepage_end_io_hook(page, cur,
3386 em = epd->get_extent(inode, page, pg_offset, cur,
3388 if (IS_ERR_OR_NULL(em)) {
3390 ret = PTR_ERR_OR_ZERO(em);
3394 extent_offset = cur - em->start;
3395 em_end = extent_map_end(em);
3396 BUG_ON(em_end <= cur);
3398 iosize = min(em_end - cur, end - cur + 1);
3399 iosize = ALIGN(iosize, blocksize);
3400 sector = (em->block_start + extent_offset) >> 9;
3402 block_start = em->block_start;
3403 compressed = test_bit(EXTENT_FLAG_COMPRESSED, &em->flags);
3404 free_extent_map(em);
3408 * compressed and inline extents are written through other
3411 if (compressed || block_start == EXTENT_MAP_HOLE ||
3412 block_start == EXTENT_MAP_INLINE) {
3414 * end_io notification does not happen here for
3415 * compressed extents
3417 if (!compressed && tree->ops &&
3418 tree->ops->writepage_end_io_hook)
3419 tree->ops->writepage_end_io_hook(page, cur,
3422 else if (compressed) {
3423 /* we don't want to end_page_writeback on
3424 * a compressed extent. this happens
3431 pg_offset += iosize;
3435 max_nr = (i_size >> PAGE_SHIFT) + 1;
3437 set_range_writeback(tree, cur, cur + iosize - 1);
3438 if (!PageWriteback(page)) {
3439 btrfs_err(BTRFS_I(inode)->root->fs_info,
3440 "page %lu not writeback, cur %llu end %llu",
3441 page->index, cur, end);
3444 ret = submit_extent_page(write_flags, tree, wbc, page,
3445 sector, iosize, pg_offset,
3446 bdev, &epd->bio, max_nr,
3447 end_bio_extent_writepage,
3453 pg_offset += iosize;
3461 /* drop our reference on any cached states */
3462 free_extent_state(cached_state);
3467 * the writepage semantics are similar to regular writepage. extent
3468 * records are inserted to lock ranges in the tree, and as dirty areas
3469 * are found, they are marked writeback. Then the lock bits are removed
3470 * and the end_io handler clears the writeback ranges
3472 static int __extent_writepage(struct page *page, struct writeback_control *wbc,
3475 struct inode *inode = page->mapping->host;
3476 struct extent_page_data *epd = data;
3477 u64 start = page_offset(page);
3478 u64 page_end = start + PAGE_SIZE - 1;
3481 size_t pg_offset = 0;
3482 loff_t i_size = i_size_read(inode);
3483 unsigned long end_index = i_size >> PAGE_SHIFT;
3485 unsigned long nr_written = 0;
3487 if (wbc->sync_mode == WB_SYNC_ALL)
3488 write_flags = WRITE_SYNC;
3490 write_flags = WRITE;
3492 trace___extent_writepage(page, inode, wbc);
3494 WARN_ON(!PageLocked(page));
3496 ClearPageError(page);
3498 pg_offset = i_size & (PAGE_SIZE - 1);
3499 if (page->index > end_index ||
3500 (page->index == end_index && !pg_offset)) {
3501 page->mapping->a_ops->invalidatepage(page, 0, PAGE_SIZE);
3506 if (page->index == end_index) {
3509 userpage = kmap_atomic(page);
3510 memset(userpage + pg_offset, 0,
3511 PAGE_SIZE - pg_offset);
3512 kunmap_atomic(userpage);
3513 flush_dcache_page(page);
3518 set_page_extent_mapped(page);
3520 ret = writepage_delalloc(inode, page, wbc, epd, start, &nr_written);
3526 ret = __extent_writepage_io(inode, page, wbc, epd,
3527 i_size, nr_written, write_flags, &nr);
3533 /* make sure the mapping tag for page dirty gets cleared */
3534 set_page_writeback(page);
3535 end_page_writeback(page);
3537 if (PageError(page)) {
3538 ret = ret < 0 ? ret : -EIO;
3539 end_extent_writepage(page, ret, start, page_end);
3548 void wait_on_extent_buffer_writeback(struct extent_buffer *eb)
3550 wait_on_bit_io(&eb->bflags, EXTENT_BUFFER_WRITEBACK,
3551 TASK_UNINTERRUPTIBLE);
3554 static noinline_for_stack int
3555 lock_extent_buffer_for_io(struct extent_buffer *eb,
3556 struct btrfs_fs_info *fs_info,
3557 struct extent_page_data *epd)
3559 unsigned long i, num_pages;
3563 if (!btrfs_try_tree_write_lock(eb)) {
3565 flush_write_bio(epd);
3566 btrfs_tree_lock(eb);
3569 if (test_bit(EXTENT_BUFFER_WRITEBACK, &eb->bflags)) {
3570 btrfs_tree_unlock(eb);
3574 flush_write_bio(epd);
3578 wait_on_extent_buffer_writeback(eb);
3579 btrfs_tree_lock(eb);
3580 if (!test_bit(EXTENT_BUFFER_WRITEBACK, &eb->bflags))
3582 btrfs_tree_unlock(eb);
3587 * We need to do this to prevent races in people who check if the eb is
3588 * under IO since we can end up having no IO bits set for a short period
3591 spin_lock(&eb->refs_lock);
3592 if (test_and_clear_bit(EXTENT_BUFFER_DIRTY, &eb->bflags)) {
3593 set_bit(EXTENT_BUFFER_WRITEBACK, &eb->bflags);
3594 spin_unlock(&eb->refs_lock);
3595 btrfs_set_header_flag(eb, BTRFS_HEADER_FLAG_WRITTEN);
3596 __percpu_counter_add(&fs_info->dirty_metadata_bytes,
3598 fs_info->dirty_metadata_batch);
3601 spin_unlock(&eb->refs_lock);
3604 btrfs_tree_unlock(eb);
3609 num_pages = num_extent_pages(eb->start, eb->len);
3610 for (i = 0; i < num_pages; i++) {
3611 struct page *p = eb->pages[i];
3613 if (!trylock_page(p)) {
3615 flush_write_bio(epd);
3625 static void end_extent_buffer_writeback(struct extent_buffer *eb)
3627 clear_bit(EXTENT_BUFFER_WRITEBACK, &eb->bflags);
3628 smp_mb__after_atomic();
3629 wake_up_bit(&eb->bflags, EXTENT_BUFFER_WRITEBACK);
3632 static void set_btree_ioerr(struct page *page)
3634 struct extent_buffer *eb = (struct extent_buffer *)page->private;
3635 struct btrfs_inode *btree_ino = BTRFS_I(eb->fs_info->btree_inode);
3638 if (test_and_set_bit(EXTENT_BUFFER_WRITE_ERR, &eb->bflags))
3642 * If writeback for a btree extent that doesn't belong to a log tree
3643 * failed, increment the counter transaction->eb_write_errors.
3644 * We do this because while the transaction is running and before it's
3645 * committing (when we call filemap_fdata[write|wait]_range against
3646 * the btree inode), we might have
3647 * btree_inode->i_mapping->a_ops->writepages() called by the VM - if it
3648 * returns an error or an error happens during writeback, when we're
3649 * committing the transaction we wouldn't know about it, since the pages
3650 * can be no longer dirty nor marked anymore for writeback (if a
3651 * subsequent modification to the extent buffer didn't happen before the
3652 * transaction commit), which makes filemap_fdata[write|wait]_range not
3653 * able to find the pages tagged with SetPageError at transaction
3654 * commit time. So if this happens we must abort the transaction,
3655 * otherwise we commit a super block with btree roots that point to
3656 * btree nodes/leafs whose content on disk is invalid - either garbage
3657 * or the content of some node/leaf from a past generation that got
3658 * cowed or deleted and is no longer valid.
3660 * Note: setting AS_EIO/AS_ENOSPC in the btree inode's i_mapping would
3661 * not be enough - we need to distinguish between log tree extents vs
3662 * non-log tree extents, and the next filemap_fdatawait_range() call
3663 * will catch and clear such errors in the mapping - and that call might
3664 * be from a log sync and not from a transaction commit. Also, checking
3665 * for the eb flag EXTENT_BUFFER_WRITE_ERR at transaction commit time is
3666 * not done and would not be reliable - the eb might have been released
3667 * from memory and reading it back again means that flag would not be
3668 * set (since it's a runtime flag, not persisted on disk).
3670 * Using the flags below in the btree inode also makes us achieve the
3671 * goal of AS_EIO/AS_ENOSPC when writepages() returns success, started
3672 * writeback for all dirty pages and before filemap_fdatawait_range()
3673 * is called, the writeback for all dirty pages had already finished
3674 * with errors - because we were not using AS_EIO/AS_ENOSPC,
3675 * filemap_fdatawait_range() would return success, as it could not know
3676 * that writeback errors happened (the pages were no longer tagged for
3679 switch (eb->log_index) {
3681 set_bit(BTRFS_INODE_BTREE_ERR, &btree_ino->runtime_flags);
3684 set_bit(BTRFS_INODE_BTREE_LOG1_ERR, &btree_ino->runtime_flags);
3687 set_bit(BTRFS_INODE_BTREE_LOG2_ERR, &btree_ino->runtime_flags);
3690 BUG(); /* unexpected, logic error */
3694 static void end_bio_extent_buffer_writepage(struct bio *bio)
3696 struct bio_vec *bvec;
3697 struct extent_buffer *eb;
3700 bio_for_each_segment_all(bvec, bio, i) {
3701 struct page *page = bvec->bv_page;
3703 eb = (struct extent_buffer *)page->private;
3705 done = atomic_dec_and_test(&eb->io_pages);
3707 if (bio->bi_error ||
3708 test_bit(EXTENT_BUFFER_WRITE_ERR, &eb->bflags)) {
3709 ClearPageUptodate(page);
3710 set_btree_ioerr(page);
3713 end_page_writeback(page);
3718 end_extent_buffer_writeback(eb);
3724 static noinline_for_stack int write_one_eb(struct extent_buffer *eb,
3725 struct btrfs_fs_info *fs_info,
3726 struct writeback_control *wbc,
3727 struct extent_page_data *epd)
3729 struct block_device *bdev = fs_info->fs_devices->latest_bdev;
3730 struct extent_io_tree *tree = &BTRFS_I(fs_info->btree_inode)->io_tree;
3731 u64 offset = eb->start;
3732 unsigned long i, num_pages;
3733 unsigned long bio_flags = 0;
3734 int rw = (epd->sync_io ? WRITE_SYNC : WRITE) | REQ_META;
3737 clear_bit(EXTENT_BUFFER_WRITE_ERR, &eb->bflags);
3738 num_pages = num_extent_pages(eb->start, eb->len);
3739 atomic_set(&eb->io_pages, num_pages);
3740 if (btrfs_header_owner(eb) == BTRFS_TREE_LOG_OBJECTID)
3741 bio_flags = EXTENT_BIO_TREE_LOG;
3743 for (i = 0; i < num_pages; i++) {
3744 struct page *p = eb->pages[i];
3746 clear_page_dirty_for_io(p);
3747 set_page_writeback(p);
3748 ret = submit_extent_page(rw, tree, wbc, p, offset >> 9,
3749 PAGE_SIZE, 0, bdev, &epd->bio,
3750 -1, end_bio_extent_buffer_writepage,
3751 0, epd->bio_flags, bio_flags, false);
3752 epd->bio_flags = bio_flags;
3755 end_page_writeback(p);
3756 if (atomic_sub_and_test(num_pages - i, &eb->io_pages))
3757 end_extent_buffer_writeback(eb);
3761 offset += PAGE_SIZE;
3762 update_nr_written(p, wbc, 1);
3766 if (unlikely(ret)) {
3767 for (; i < num_pages; i++) {
3768 struct page *p = eb->pages[i];
3769 clear_page_dirty_for_io(p);
3777 int btree_write_cache_pages(struct address_space *mapping,
3778 struct writeback_control *wbc)
3780 struct extent_io_tree *tree = &BTRFS_I(mapping->host)->io_tree;
3781 struct btrfs_fs_info *fs_info = BTRFS_I(mapping->host)->root->fs_info;
3782 struct extent_buffer *eb, *prev_eb = NULL;
3783 struct extent_page_data epd = {
3787 .sync_io = wbc->sync_mode == WB_SYNC_ALL,
3792 int nr_to_write_done = 0;
3793 struct pagevec pvec;
3796 pgoff_t end; /* Inclusive */
3800 pagevec_init(&pvec, 0);
3801 if (wbc->range_cyclic) {
3802 index = mapping->writeback_index; /* Start from prev offset */
3805 index = wbc->range_start >> PAGE_SHIFT;
3806 end = wbc->range_end >> PAGE_SHIFT;
3809 if (wbc->sync_mode == WB_SYNC_ALL)
3810 tag = PAGECACHE_TAG_TOWRITE;
3812 tag = PAGECACHE_TAG_DIRTY;
3814 if (wbc->sync_mode == WB_SYNC_ALL)
3815 tag_pages_for_writeback(mapping, index, end);
3816 while (!done && !nr_to_write_done && (index <= end) &&
3817 (nr_pages = pagevec_lookup_tag(&pvec, mapping, &index, tag,
3818 min(end - index, (pgoff_t)PAGEVEC_SIZE-1) + 1))) {
3822 for (i = 0; i < nr_pages; i++) {
3823 struct page *page = pvec.pages[i];
3825 if (!PagePrivate(page))
3828 if (!wbc->range_cyclic && page->index > end) {
3833 spin_lock(&mapping->private_lock);
3834 if (!PagePrivate(page)) {
3835 spin_unlock(&mapping->private_lock);
3839 eb = (struct extent_buffer *)page->private;
3842 * Shouldn't happen and normally this would be a BUG_ON
3843 * but no sense in crashing the users box for something
3844 * we can survive anyway.
3847 spin_unlock(&mapping->private_lock);
3851 if (eb == prev_eb) {
3852 spin_unlock(&mapping->private_lock);
3856 ret = atomic_inc_not_zero(&eb->refs);
3857 spin_unlock(&mapping->private_lock);
3862 ret = lock_extent_buffer_for_io(eb, fs_info, &epd);
3864 free_extent_buffer(eb);
3868 ret = write_one_eb(eb, fs_info, wbc, &epd);
3871 free_extent_buffer(eb);
3874 free_extent_buffer(eb);
3877 * the filesystem may choose to bump up nr_to_write.
3878 * We have to make sure to honor the new nr_to_write
3881 nr_to_write_done = wbc->nr_to_write <= 0;
3883 pagevec_release(&pvec);
3886 if (!scanned && !done) {
3888 * We hit the last page and there is more work to be done: wrap
3889 * back to the start of the file
3895 flush_write_bio(&epd);
3900 * write_cache_pages - walk the list of dirty pages of the given address space and write all of them.
3901 * @mapping: address space structure to write
3902 * @wbc: subtract the number of written pages from *@wbc->nr_to_write
3903 * @writepage: function called for each page
3904 * @data: data passed to writepage function
3906 * If a page is already under I/O, write_cache_pages() skips it, even
3907 * if it's dirty. This is desirable behaviour for memory-cleaning writeback,
3908 * but it is INCORRECT for data-integrity system calls such as fsync(). fsync()
3909 * and msync() need to guarantee that all the data which was dirty at the time
3910 * the call was made get new I/O started against them. If wbc->sync_mode is
3911 * WB_SYNC_ALL then we were called for data integrity and we must wait for
3912 * existing IO to complete.
3914 static int extent_write_cache_pages(struct extent_io_tree *tree,
3915 struct address_space *mapping,
3916 struct writeback_control *wbc,
3917 writepage_t writepage, void *data,
3918 void (*flush_fn)(void *))
3920 struct inode *inode = mapping->host;
3923 int nr_to_write_done = 0;
3924 struct pagevec pvec;
3927 pgoff_t end; /* Inclusive */
3929 int range_whole = 0;
3934 * We have to hold onto the inode so that ordered extents can do their
3935 * work when the IO finishes. The alternative to this is failing to add
3936 * an ordered extent if the igrab() fails there and that is a huge pain
3937 * to deal with, so instead just hold onto the inode throughout the
3938 * writepages operation. If it fails here we are freeing up the inode
3939 * anyway and we'd rather not waste our time writing out stuff that is
3940 * going to be truncated anyway.
3945 pagevec_init(&pvec, 0);
3946 if (wbc->range_cyclic) {
3947 index = mapping->writeback_index; /* Start from prev offset */
3950 index = wbc->range_start >> PAGE_SHIFT;
3951 end = wbc->range_end >> PAGE_SHIFT;
3952 if (wbc->range_start == 0 && wbc->range_end == LLONG_MAX)
3956 if (wbc->sync_mode == WB_SYNC_ALL)
3957 tag = PAGECACHE_TAG_TOWRITE;
3959 tag = PAGECACHE_TAG_DIRTY;
3961 if (wbc->sync_mode == WB_SYNC_ALL)
3962 tag_pages_for_writeback(mapping, index, end);
3964 while (!done && !nr_to_write_done && (index <= end) &&
3965 (nr_pages = pagevec_lookup_tag(&pvec, mapping, &index, tag,
3966 min(end - index, (pgoff_t)PAGEVEC_SIZE-1) + 1))) {
3970 for (i = 0; i < nr_pages; i++) {
3971 struct page *page = pvec.pages[i];
3973 done_index = page->index;
3975 * At this point we hold neither mapping->tree_lock nor
3976 * lock on the page itself: the page may be truncated or
3977 * invalidated (changing page->mapping to NULL), or even
3978 * swizzled back from swapper_space to tmpfs file
3981 if (!trylock_page(page)) {
3986 if (unlikely(page->mapping != mapping)) {
3991 if (!wbc->range_cyclic && page->index > end) {
3997 if (wbc->sync_mode != WB_SYNC_NONE) {
3998 if (PageWriteback(page))
4000 wait_on_page_writeback(page);
4003 if (PageWriteback(page) ||
4004 !clear_page_dirty_for_io(page)) {
4009 ret = (*writepage)(page, wbc, data);
4011 if (unlikely(ret == AOP_WRITEPAGE_ACTIVATE)) {
4017 * done_index is set past this page,
4018 * so media errors will not choke
4019 * background writeout for the entire
4020 * file. This has consequences for
4021 * range_cyclic semantics (ie. it may
4022 * not be suitable for data integrity
4025 done_index = page->index + 1;
4031 * the filesystem may choose to bump up nr_to_write.
4032 * We have to make sure to honor the new nr_to_write
4035 nr_to_write_done = wbc->nr_to_write <= 0;
4037 pagevec_release(&pvec);
4040 if (!scanned && !done) {
4042 * We hit the last page and there is more work to be done: wrap
4043 * back to the start of the file
4050 if (wbc->range_cyclic || (wbc->nr_to_write > 0 && range_whole))
4051 mapping->writeback_index = done_index;
4053 btrfs_add_delayed_iput(inode);
4057 static void flush_epd_write_bio(struct extent_page_data *epd)
4066 ret = submit_one_bio(rw, epd->bio, 0, epd->bio_flags);
4067 BUG_ON(ret < 0); /* -ENOMEM */
4072 static noinline void flush_write_bio(void *data)
4074 struct extent_page_data *epd = data;
4075 flush_epd_write_bio(epd);
4078 int extent_write_full_page(struct extent_io_tree *tree, struct page *page,
4079 get_extent_t *get_extent,
4080 struct writeback_control *wbc)
4083 struct extent_page_data epd = {
4086 .get_extent = get_extent,
4088 .sync_io = wbc->sync_mode == WB_SYNC_ALL,
4092 ret = __extent_writepage(page, wbc, &epd);
4094 flush_epd_write_bio(&epd);
4098 int extent_write_locked_range(struct extent_io_tree *tree, struct inode *inode,
4099 u64 start, u64 end, get_extent_t *get_extent,
4103 struct address_space *mapping = inode->i_mapping;
4105 unsigned long nr_pages = (end - start + PAGE_SIZE) >>
4108 struct extent_page_data epd = {
4111 .get_extent = get_extent,
4113 .sync_io = mode == WB_SYNC_ALL,
4116 struct writeback_control wbc_writepages = {
4118 .nr_to_write = nr_pages * 2,
4119 .range_start = start,
4120 .range_end = end + 1,
4123 while (start <= end) {
4124 page = find_get_page(mapping, start >> PAGE_SHIFT);
4125 if (clear_page_dirty_for_io(page))
4126 ret = __extent_writepage(page, &wbc_writepages, &epd);
4128 if (tree->ops && tree->ops->writepage_end_io_hook)
4129 tree->ops->writepage_end_io_hook(page, start,
4130 start + PAGE_SIZE - 1,
4138 flush_epd_write_bio(&epd);
4142 int extent_writepages(struct extent_io_tree *tree,
4143 struct address_space *mapping,
4144 get_extent_t *get_extent,
4145 struct writeback_control *wbc)
4148 struct extent_page_data epd = {
4151 .get_extent = get_extent,
4153 .sync_io = wbc->sync_mode == WB_SYNC_ALL,
4157 ret = extent_write_cache_pages(tree, mapping, wbc,
4158 __extent_writepage, &epd,
4160 flush_epd_write_bio(&epd);
4164 int extent_readpages(struct extent_io_tree *tree,
4165 struct address_space *mapping,
4166 struct list_head *pages, unsigned nr_pages,
4167 get_extent_t get_extent)
4169 struct bio *bio = NULL;
4171 unsigned long bio_flags = 0;
4172 struct page *pagepool[16];
4174 struct extent_map *em_cached = NULL;
4176 u64 prev_em_start = (u64)-1;
4178 for (page_idx = 0; page_idx < nr_pages; page_idx++) {
4179 page = list_entry(pages->prev, struct page, lru);
4181 prefetchw(&page->flags);
4182 list_del(&page->lru);
4183 if (add_to_page_cache_lru(page, mapping,
4184 page->index, GFP_NOFS)) {
4189 pagepool[nr++] = page;
4190 if (nr < ARRAY_SIZE(pagepool))
4192 __extent_readpages(tree, pagepool, nr, get_extent, &em_cached,
4193 &bio, 0, &bio_flags, READ, &prev_em_start);
4197 __extent_readpages(tree, pagepool, nr, get_extent, &em_cached,
4198 &bio, 0, &bio_flags, READ, &prev_em_start);
4201 free_extent_map(em_cached);
4203 BUG_ON(!list_empty(pages));
4205 return submit_one_bio(READ, bio, 0, bio_flags);
4210 * basic invalidatepage code, this waits on any locked or writeback
4211 * ranges corresponding to the page, and then deletes any extent state
4212 * records from the tree
4214 int extent_invalidatepage(struct extent_io_tree *tree,
4215 struct page *page, unsigned long offset)
4217 struct extent_state *cached_state = NULL;
4218 u64 start = page_offset(page);
4219 u64 end = start + PAGE_SIZE - 1;
4220 size_t blocksize = page->mapping->host->i_sb->s_blocksize;
4222 start += ALIGN(offset, blocksize);
4226 lock_extent_bits(tree, start, end, &cached_state);
4227 wait_on_page_writeback(page);
4228 clear_extent_bit(tree, start, end,
4229 EXTENT_LOCKED | EXTENT_DIRTY | EXTENT_DELALLOC |
4230 EXTENT_DO_ACCOUNTING,
4231 1, 1, &cached_state, GFP_NOFS);
4236 * a helper for releasepage, this tests for areas of the page that
4237 * are locked or under IO and drops the related state bits if it is safe
4240 static int try_release_extent_state(struct extent_map_tree *map,
4241 struct extent_io_tree *tree,
4242 struct page *page, gfp_t mask)
4244 u64 start = page_offset(page);
4245 u64 end = start + PAGE_SIZE - 1;
4248 if (test_range_bit(tree, start, end,
4249 EXTENT_IOBITS, 0, NULL))
4252 if ((mask & GFP_NOFS) == GFP_NOFS)
4255 * at this point we can safely clear everything except the
4256 * locked bit and the nodatasum bit
4258 ret = clear_extent_bit(tree, start, end,
4259 ~(EXTENT_LOCKED | EXTENT_NODATASUM),
4262 /* if clear_extent_bit failed for enomem reasons,
4263 * we can't allow the release to continue.
4274 * a helper for releasepage. As long as there are no locked extents
4275 * in the range corresponding to the page, both state records and extent
4276 * map records are removed
4278 int try_release_extent_mapping(struct extent_map_tree *map,
4279 struct extent_io_tree *tree, struct page *page,
4282 struct extent_map *em;
4283 u64 start = page_offset(page);
4284 u64 end = start + PAGE_SIZE - 1;
4286 if (gfpflags_allow_blocking(mask) &&
4287 page->mapping->host->i_size > SZ_16M) {
4289 while (start <= end) {
4290 len = end - start + 1;
4291 write_lock(&map->lock);
4292 em = lookup_extent_mapping(map, start, len);
4294 write_unlock(&map->lock);
4297 if (test_bit(EXTENT_FLAG_PINNED, &em->flags) ||
4298 em->start != start) {
4299 write_unlock(&map->lock);
4300 free_extent_map(em);
4303 if (!test_range_bit(tree, em->start,
4304 extent_map_end(em) - 1,
4305 EXTENT_LOCKED | EXTENT_WRITEBACK,
4307 remove_extent_mapping(map, em);
4308 /* once for the rb tree */
4309 free_extent_map(em);
4311 start = extent_map_end(em);
4312 write_unlock(&map->lock);
4315 free_extent_map(em);
4318 return try_release_extent_state(map, tree, page, mask);
4322 * helper function for fiemap, which doesn't want to see any holes.
4323 * This maps until we find something past 'last'
4325 static struct extent_map *get_extent_skip_holes(struct inode *inode,
4328 get_extent_t *get_extent)
4330 u64 sectorsize = BTRFS_I(inode)->root->sectorsize;
4331 struct extent_map *em;
4338 len = last - offset;
4341 len = ALIGN(len, sectorsize);
4342 em = get_extent(inode, NULL, 0, offset, len, 0);
4343 if (IS_ERR_OR_NULL(em))
4346 /* if this isn't a hole return it */
4347 if (!test_bit(EXTENT_FLAG_VACANCY, &em->flags) &&
4348 em->block_start != EXTENT_MAP_HOLE) {
4352 /* this is a hole, advance to the next extent */
4353 offset = extent_map_end(em);
4354 free_extent_map(em);
4361 int extent_fiemap(struct inode *inode, struct fiemap_extent_info *fieinfo,
4362 __u64 start, __u64 len, get_extent_t *get_extent)
4366 u64 max = start + len;
4370 u64 last_for_get_extent = 0;
4372 u64 isize = i_size_read(inode);
4373 struct btrfs_key found_key;
4374 struct extent_map *em = NULL;
4375 struct extent_state *cached_state = NULL;
4376 struct btrfs_path *path;
4377 struct btrfs_root *root = BTRFS_I(inode)->root;
4386 path = btrfs_alloc_path();
4389 path->leave_spinning = 1;
4391 start = round_down(start, BTRFS_I(inode)->root->sectorsize);
4392 len = round_up(max, BTRFS_I(inode)->root->sectorsize) - start;
4395 * lookup the last file extent. We're not using i_size here
4396 * because there might be preallocation past i_size
4398 ret = btrfs_lookup_file_extent(NULL, root, path, btrfs_ino(inode), -1,
4401 btrfs_free_path(path);
4410 btrfs_item_key_to_cpu(path->nodes[0], &found_key, path->slots[0]);
4411 found_type = found_key.type;
4413 /* No extents, but there might be delalloc bits */
4414 if (found_key.objectid != btrfs_ino(inode) ||
4415 found_type != BTRFS_EXTENT_DATA_KEY) {
4416 /* have to trust i_size as the end */
4418 last_for_get_extent = isize;
4421 * remember the start of the last extent. There are a
4422 * bunch of different factors that go into the length of the
4423 * extent, so its much less complex to remember where it started
4425 last = found_key.offset;
4426 last_for_get_extent = last + 1;
4428 btrfs_release_path(path);
4431 * we might have some extents allocated but more delalloc past those
4432 * extents. so, we trust isize unless the start of the last extent is
4437 last_for_get_extent = isize;
4440 lock_extent_bits(&BTRFS_I(inode)->io_tree, start, start + len - 1,
4443 em = get_extent_skip_holes(inode, start, last_for_get_extent,
4453 u64 offset_in_extent = 0;
4455 /* break if the extent we found is outside the range */
4456 if (em->start >= max || extent_map_end(em) < off)
4460 * get_extent may return an extent that starts before our
4461 * requested range. We have to make sure the ranges
4462 * we return to fiemap always move forward and don't
4463 * overlap, so adjust the offsets here
4465 em_start = max(em->start, off);
4468 * record the offset from the start of the extent
4469 * for adjusting the disk offset below. Only do this if the
4470 * extent isn't compressed since our in ram offset may be past
4471 * what we have actually allocated on disk.
4473 if (!test_bit(EXTENT_FLAG_COMPRESSED, &em->flags))
4474 offset_in_extent = em_start - em->start;
4475 em_end = extent_map_end(em);
4476 em_len = em_end - em_start;
4481 * bump off for our next call to get_extent
4483 off = extent_map_end(em);
4487 if (em->block_start == EXTENT_MAP_LAST_BYTE) {
4489 flags |= FIEMAP_EXTENT_LAST;
4490 } else if (em->block_start == EXTENT_MAP_INLINE) {
4491 flags |= (FIEMAP_EXTENT_DATA_INLINE |
4492 FIEMAP_EXTENT_NOT_ALIGNED);
4493 } else if (em->block_start == EXTENT_MAP_DELALLOC) {
4494 flags |= (FIEMAP_EXTENT_DELALLOC |
4495 FIEMAP_EXTENT_UNKNOWN);
4496 } else if (fieinfo->fi_extents_max) {
4497 u64 bytenr = em->block_start -
4498 (em->start - em->orig_start);
4500 disko = em->block_start + offset_in_extent;
4503 * As btrfs supports shared space, this information
4504 * can be exported to userspace tools via
4505 * flag FIEMAP_EXTENT_SHARED. If fi_extents_max == 0
4506 * then we're just getting a count and we can skip the
4509 ret = btrfs_check_shared(NULL, root->fs_info,
4511 btrfs_ino(inode), bytenr);
4515 flags |= FIEMAP_EXTENT_SHARED;
4518 if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags))
4519 flags |= FIEMAP_EXTENT_ENCODED;
4520 if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags))
4521 flags |= FIEMAP_EXTENT_UNWRITTEN;
4523 free_extent_map(em);
4525 if ((em_start >= last) || em_len == (u64)-1 ||
4526 (last == (u64)-1 && isize <= em_end)) {
4527 flags |= FIEMAP_EXTENT_LAST;
4531 /* now scan forward to see if this is really the last extent. */
4532 em = get_extent_skip_holes(inode, off, last_for_get_extent,
4539 flags |= FIEMAP_EXTENT_LAST;
4542 ret = fiemap_fill_next_extent(fieinfo, em_start, disko,
4551 free_extent_map(em);
4553 btrfs_free_path(path);
4554 unlock_extent_cached(&BTRFS_I(inode)->io_tree, start, start + len - 1,
4555 &cached_state, GFP_NOFS);
4559 static void __free_extent_buffer(struct extent_buffer *eb)
4561 btrfs_leak_debug_del(&eb->leak_list);
4562 kmem_cache_free(extent_buffer_cache, eb);
4565 int extent_buffer_under_io(struct extent_buffer *eb)
4567 return (atomic_read(&eb->io_pages) ||
4568 test_bit(EXTENT_BUFFER_WRITEBACK, &eb->bflags) ||
4569 test_bit(EXTENT_BUFFER_DIRTY, &eb->bflags));
4573 * Helper for releasing extent buffer page.
4575 static void btrfs_release_extent_buffer_page(struct extent_buffer *eb)
4577 unsigned long index;
4579 int mapped = !test_bit(EXTENT_BUFFER_DUMMY, &eb->bflags);
4581 BUG_ON(extent_buffer_under_io(eb));
4583 index = num_extent_pages(eb->start, eb->len);
4589 page = eb->pages[index];
4593 spin_lock(&page->mapping->private_lock);
4595 * We do this since we'll remove the pages after we've
4596 * removed the eb from the radix tree, so we could race
4597 * and have this page now attached to the new eb. So
4598 * only clear page_private if it's still connected to
4601 if (PagePrivate(page) &&
4602 page->private == (unsigned long)eb) {
4603 BUG_ON(test_bit(EXTENT_BUFFER_DIRTY, &eb->bflags));
4604 BUG_ON(PageDirty(page));
4605 BUG_ON(PageWriteback(page));
4607 * We need to make sure we haven't be attached
4610 ClearPagePrivate(page);
4611 set_page_private(page, 0);
4612 /* One for the page private */
4617 spin_unlock(&page->mapping->private_lock);
4619 /* One for when we allocated the page */
4621 } while (index != 0);
4625 * Helper for releasing the extent buffer.
4627 static inline void btrfs_release_extent_buffer(struct extent_buffer *eb)
4629 btrfs_release_extent_buffer_page(eb);
4630 __free_extent_buffer(eb);
4633 static struct extent_buffer *
4634 __alloc_extent_buffer(struct btrfs_fs_info *fs_info, u64 start,
4637 struct extent_buffer *eb = NULL;
4639 eb = kmem_cache_zalloc(extent_buffer_cache, GFP_NOFS|__GFP_NOFAIL);
4642 eb->fs_info = fs_info;
4644 rwlock_init(&eb->lock);
4645 atomic_set(&eb->write_locks, 0);
4646 atomic_set(&eb->read_locks, 0);
4647 atomic_set(&eb->blocking_readers, 0);
4648 atomic_set(&eb->blocking_writers, 0);
4649 atomic_set(&eb->spinning_readers, 0);
4650 atomic_set(&eb->spinning_writers, 0);
4651 eb->lock_nested = 0;
4652 init_waitqueue_head(&eb->write_lock_wq);
4653 init_waitqueue_head(&eb->read_lock_wq);
4655 btrfs_leak_debug_add(&eb->leak_list, &buffers);
4657 spin_lock_init(&eb->refs_lock);
4658 atomic_set(&eb->refs, 1);
4659 atomic_set(&eb->io_pages, 0);
4662 * Sanity checks, currently the maximum is 64k covered by 16x 4k pages
4664 BUILD_BUG_ON(BTRFS_MAX_METADATA_BLOCKSIZE
4665 > MAX_INLINE_EXTENT_BUFFER_SIZE);
4666 BUG_ON(len > MAX_INLINE_EXTENT_BUFFER_SIZE);
4671 struct extent_buffer *btrfs_clone_extent_buffer(struct extent_buffer *src)
4675 struct extent_buffer *new;
4676 unsigned long num_pages = num_extent_pages(src->start, src->len);
4678 new = __alloc_extent_buffer(src->fs_info, src->start, src->len);
4682 for (i = 0; i < num_pages; i++) {
4683 p = alloc_page(GFP_NOFS);
4685 btrfs_release_extent_buffer(new);
4688 attach_extent_buffer_page(new, p);
4689 WARN_ON(PageDirty(p));
4694 copy_extent_buffer(new, src, 0, 0, src->len);
4695 set_bit(EXTENT_BUFFER_UPTODATE, &new->bflags);
4696 set_bit(EXTENT_BUFFER_DUMMY, &new->bflags);
4701 struct extent_buffer *__alloc_dummy_extent_buffer(struct btrfs_fs_info *fs_info,
4702 u64 start, unsigned long len)
4704 struct extent_buffer *eb;
4705 unsigned long num_pages;
4708 num_pages = num_extent_pages(start, 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 struct extent_buffer *alloc_dummy_extent_buffer(struct btrfs_fs_info *fs_info,
4738 * Called only from tests that don't always have a fs_info
4739 * available, but we know that nodesize is 4096
4743 len = fs_info->tree_root->nodesize;
4746 return __alloc_dummy_extent_buffer(fs_info, start, len);
4749 static void check_buffer_tree_ref(struct extent_buffer *eb)
4752 /* the ref bit is tricky. We have to make sure it is set
4753 * if we have the buffer dirty. Otherwise the
4754 * code to free a buffer can end up dropping a dirty
4757 * Once the ref bit is set, it won't go away while the
4758 * buffer is dirty or in writeback, and it also won't
4759 * go away while we have the reference count on the
4762 * We can't just set the ref bit without bumping the
4763 * ref on the eb because free_extent_buffer might
4764 * see the ref bit and try to clear it. If this happens
4765 * free_extent_buffer might end up dropping our original
4766 * ref by mistake and freeing the page before we are able
4767 * to add one more ref.
4769 * So bump the ref count first, then set the bit. If someone
4770 * beat us to it, drop the ref we added.
4772 refs = atomic_read(&eb->refs);
4773 if (refs >= 2 && test_bit(EXTENT_BUFFER_TREE_REF, &eb->bflags))
4776 spin_lock(&eb->refs_lock);
4777 if (!test_and_set_bit(EXTENT_BUFFER_TREE_REF, &eb->bflags))
4778 atomic_inc(&eb->refs);
4779 spin_unlock(&eb->refs_lock);
4782 static void mark_extent_buffer_accessed(struct extent_buffer *eb,
4783 struct page *accessed)
4785 unsigned long num_pages, i;
4787 check_buffer_tree_ref(eb);
4789 num_pages = num_extent_pages(eb->start, eb->len);
4790 for (i = 0; i < num_pages; i++) {
4791 struct page *p = eb->pages[i];
4794 mark_page_accessed(p);
4798 struct extent_buffer *find_extent_buffer(struct btrfs_fs_info *fs_info,
4801 struct extent_buffer *eb;
4804 eb = radix_tree_lookup(&fs_info->buffer_radix,
4805 start >> PAGE_SHIFT);
4806 if (eb && atomic_inc_not_zero(&eb->refs)) {
4809 * Lock our eb's refs_lock to avoid races with
4810 * free_extent_buffer. When we get our eb it might be flagged
4811 * with EXTENT_BUFFER_STALE and another task running
4812 * free_extent_buffer might have seen that flag set,
4813 * eb->refs == 2, that the buffer isn't under IO (dirty and
4814 * writeback flags not set) and it's still in the tree (flag
4815 * EXTENT_BUFFER_TREE_REF set), therefore being in the process
4816 * of decrementing the extent buffer's reference count twice.
4817 * So here we could race and increment the eb's reference count,
4818 * clear its stale flag, mark it as dirty and drop our reference
4819 * before the other task finishes executing free_extent_buffer,
4820 * which would later result in an attempt to free an extent
4821 * buffer that is dirty.
4823 if (test_bit(EXTENT_BUFFER_STALE, &eb->bflags)) {
4824 spin_lock(&eb->refs_lock);
4825 spin_unlock(&eb->refs_lock);
4827 mark_extent_buffer_accessed(eb, NULL);
4835 #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
4836 struct extent_buffer *alloc_test_extent_buffer(struct btrfs_fs_info *fs_info,
4839 struct extent_buffer *eb, *exists = NULL;
4842 eb = find_extent_buffer(fs_info, start);
4845 eb = alloc_dummy_extent_buffer(fs_info, start);
4848 eb->fs_info = fs_info;
4850 ret = radix_tree_preload(GFP_NOFS);
4853 spin_lock(&fs_info->buffer_lock);
4854 ret = radix_tree_insert(&fs_info->buffer_radix,
4855 start >> PAGE_SHIFT, eb);
4856 spin_unlock(&fs_info->buffer_lock);
4857 radix_tree_preload_end();
4858 if (ret == -EEXIST) {
4859 exists = find_extent_buffer(fs_info, start);
4865 check_buffer_tree_ref(eb);
4866 set_bit(EXTENT_BUFFER_IN_TREE, &eb->bflags);
4869 * We will free dummy extent buffer's if they come into
4870 * free_extent_buffer with a ref count of 2, but if we are using this we
4871 * want the buffers to stay in memory until we're done with them, so
4872 * bump the ref count again.
4874 atomic_inc(&eb->refs);
4877 btrfs_release_extent_buffer(eb);
4882 struct extent_buffer *alloc_extent_buffer(struct btrfs_fs_info *fs_info,
4885 unsigned long len = fs_info->tree_root->nodesize;
4886 unsigned long num_pages = num_extent_pages(start, len);
4888 unsigned long index = start >> PAGE_SHIFT;
4889 struct extent_buffer *eb;
4890 struct extent_buffer *exists = NULL;
4892 struct address_space *mapping = fs_info->btree_inode->i_mapping;
4896 eb = find_extent_buffer(fs_info, start);
4900 eb = __alloc_extent_buffer(fs_info, start, len);
4904 for (i = 0; i < num_pages; i++, index++) {
4905 p = find_or_create_page(mapping, index, GFP_NOFS|__GFP_NOFAIL);
4909 spin_lock(&mapping->private_lock);
4910 if (PagePrivate(p)) {
4912 * We could have already allocated an eb for this page
4913 * and attached one so lets see if we can get a ref on
4914 * the existing eb, and if we can we know it's good and
4915 * we can just return that one, else we know we can just
4916 * overwrite page->private.
4918 exists = (struct extent_buffer *)p->private;
4919 if (atomic_inc_not_zero(&exists->refs)) {
4920 spin_unlock(&mapping->private_lock);
4923 mark_extent_buffer_accessed(exists, p);
4929 * Do this so attach doesn't complain and we need to
4930 * drop the ref the old guy had.
4932 ClearPagePrivate(p);
4933 WARN_ON(PageDirty(p));
4936 attach_extent_buffer_page(eb, p);
4937 spin_unlock(&mapping->private_lock);
4938 WARN_ON(PageDirty(p));
4940 if (!PageUptodate(p))
4944 * see below about how we avoid a nasty race with release page
4945 * and why we unlock later
4949 set_bit(EXTENT_BUFFER_UPTODATE, &eb->bflags);
4951 ret = radix_tree_preload(GFP_NOFS);
4955 spin_lock(&fs_info->buffer_lock);
4956 ret = radix_tree_insert(&fs_info->buffer_radix,
4957 start >> PAGE_SHIFT, eb);
4958 spin_unlock(&fs_info->buffer_lock);
4959 radix_tree_preload_end();
4960 if (ret == -EEXIST) {
4961 exists = find_extent_buffer(fs_info, start);
4967 /* add one reference for the tree */
4968 check_buffer_tree_ref(eb);
4969 set_bit(EXTENT_BUFFER_IN_TREE, &eb->bflags);
4972 * there is a race where release page may have
4973 * tried to find this extent buffer in the radix
4974 * but failed. It will tell the VM it is safe to
4975 * reclaim the, and it will clear the page private bit.
4976 * We must make sure to set the page private bit properly
4977 * after the extent buffer is in the radix tree so
4978 * it doesn't get lost
4980 SetPageChecked(eb->pages[0]);
4981 for (i = 1; i < num_pages; i++) {
4983 ClearPageChecked(p);
4986 unlock_page(eb->pages[0]);
4990 WARN_ON(!atomic_dec_and_test(&eb->refs));
4991 for (i = 0; i < num_pages; i++) {
4993 unlock_page(eb->pages[i]);
4996 btrfs_release_extent_buffer(eb);
5000 static inline void btrfs_release_extent_buffer_rcu(struct rcu_head *head)
5002 struct extent_buffer *eb =
5003 container_of(head, struct extent_buffer, rcu_head);
5005 __free_extent_buffer(eb);
5008 /* Expects to have eb->eb_lock already held */
5009 static int release_extent_buffer(struct extent_buffer *eb)
5011 WARN_ON(atomic_read(&eb->refs) == 0);
5012 if (atomic_dec_and_test(&eb->refs)) {
5013 if (test_and_clear_bit(EXTENT_BUFFER_IN_TREE, &eb->bflags)) {
5014 struct btrfs_fs_info *fs_info = eb->fs_info;
5016 spin_unlock(&eb->refs_lock);
5018 spin_lock(&fs_info->buffer_lock);
5019 radix_tree_delete(&fs_info->buffer_radix,
5020 eb->start >> PAGE_SHIFT);
5021 spin_unlock(&fs_info->buffer_lock);
5023 spin_unlock(&eb->refs_lock);
5026 /* Should be safe to release our pages at this point */
5027 btrfs_release_extent_buffer_page(eb);
5028 #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
5029 if (unlikely(test_bit(EXTENT_BUFFER_DUMMY, &eb->bflags))) {
5030 __free_extent_buffer(eb);
5034 call_rcu(&eb->rcu_head, btrfs_release_extent_buffer_rcu);
5037 spin_unlock(&eb->refs_lock);
5042 void free_extent_buffer(struct extent_buffer *eb)
5050 refs = atomic_read(&eb->refs);
5053 old = atomic_cmpxchg(&eb->refs, refs, refs - 1);
5058 spin_lock(&eb->refs_lock);
5059 if (atomic_read(&eb->refs) == 2 &&
5060 test_bit(EXTENT_BUFFER_DUMMY, &eb->bflags))
5061 atomic_dec(&eb->refs);
5063 if (atomic_read(&eb->refs) == 2 &&
5064 test_bit(EXTENT_BUFFER_STALE, &eb->bflags) &&
5065 !extent_buffer_under_io(eb) &&
5066 test_and_clear_bit(EXTENT_BUFFER_TREE_REF, &eb->bflags))
5067 atomic_dec(&eb->refs);
5070 * I know this is terrible, but it's temporary until we stop tracking
5071 * the uptodate bits and such for the extent buffers.
5073 release_extent_buffer(eb);
5076 void free_extent_buffer_stale(struct extent_buffer *eb)
5081 spin_lock(&eb->refs_lock);
5082 set_bit(EXTENT_BUFFER_STALE, &eb->bflags);
5084 if (atomic_read(&eb->refs) == 2 && !extent_buffer_under_io(eb) &&
5085 test_and_clear_bit(EXTENT_BUFFER_TREE_REF, &eb->bflags))
5086 atomic_dec(&eb->refs);
5087 release_extent_buffer(eb);
5090 void clear_extent_buffer_dirty(struct extent_buffer *eb)
5093 unsigned long num_pages;
5096 num_pages = num_extent_pages(eb->start, eb->len);
5098 for (i = 0; i < num_pages; i++) {
5099 page = eb->pages[i];
5100 if (!PageDirty(page))
5104 WARN_ON(!PagePrivate(page));
5106 clear_page_dirty_for_io(page);
5107 spin_lock_irq(&page->mapping->tree_lock);
5108 if (!PageDirty(page)) {
5109 radix_tree_tag_clear(&page->mapping->page_tree,
5111 PAGECACHE_TAG_DIRTY);
5113 spin_unlock_irq(&page->mapping->tree_lock);
5114 ClearPageError(page);
5117 WARN_ON(atomic_read(&eb->refs) == 0);
5120 int set_extent_buffer_dirty(struct extent_buffer *eb)
5123 unsigned long num_pages;
5126 check_buffer_tree_ref(eb);
5128 was_dirty = test_and_set_bit(EXTENT_BUFFER_DIRTY, &eb->bflags);
5130 num_pages = num_extent_pages(eb->start, eb->len);
5131 WARN_ON(atomic_read(&eb->refs) == 0);
5132 WARN_ON(!test_bit(EXTENT_BUFFER_TREE_REF, &eb->bflags));
5134 for (i = 0; i < num_pages; i++)
5135 set_page_dirty(eb->pages[i]);
5139 void clear_extent_buffer_uptodate(struct extent_buffer *eb)
5143 unsigned long num_pages;
5145 clear_bit(EXTENT_BUFFER_UPTODATE, &eb->bflags);
5146 num_pages = num_extent_pages(eb->start, eb->len);
5147 for (i = 0; i < num_pages; i++) {
5148 page = eb->pages[i];
5150 ClearPageUptodate(page);
5154 void set_extent_buffer_uptodate(struct extent_buffer *eb)
5158 unsigned long num_pages;
5160 set_bit(EXTENT_BUFFER_UPTODATE, &eb->bflags);
5161 num_pages = num_extent_pages(eb->start, eb->len);
5162 for (i = 0; i < num_pages; i++) {
5163 page = eb->pages[i];
5164 SetPageUptodate(page);
5168 int extent_buffer_uptodate(struct extent_buffer *eb)
5170 return test_bit(EXTENT_BUFFER_UPTODATE, &eb->bflags);
5173 int read_extent_buffer_pages(struct extent_io_tree *tree,
5174 struct extent_buffer *eb, u64 start, int wait,
5175 get_extent_t *get_extent, int mirror_num)
5178 unsigned long start_i;
5182 int locked_pages = 0;
5183 int all_uptodate = 1;
5184 unsigned long num_pages;
5185 unsigned long num_reads = 0;
5186 struct bio *bio = NULL;
5187 unsigned long bio_flags = 0;
5189 if (test_bit(EXTENT_BUFFER_UPTODATE, &eb->bflags))
5193 WARN_ON(start < eb->start);
5194 start_i = (start >> PAGE_SHIFT) -
5195 (eb->start >> PAGE_SHIFT);
5200 num_pages = num_extent_pages(eb->start, eb->len);
5201 for (i = start_i; i < num_pages; i++) {
5202 page = eb->pages[i];
5203 if (wait == WAIT_NONE) {
5204 if (!trylock_page(page))
5210 if (!PageUptodate(page)) {
5217 set_bit(EXTENT_BUFFER_UPTODATE, &eb->bflags);
5221 clear_bit(EXTENT_BUFFER_READ_ERR, &eb->bflags);
5222 eb->read_mirror = 0;
5223 atomic_set(&eb->io_pages, num_reads);
5224 for (i = start_i; i < num_pages; i++) {
5225 page = eb->pages[i];
5226 if (!PageUptodate(page)) {
5227 ClearPageError(page);
5228 err = __extent_read_full_page(tree, page,
5230 mirror_num, &bio_flags,
5240 err = submit_one_bio(READ | REQ_META, bio, mirror_num,
5246 if (ret || wait != WAIT_COMPLETE)
5249 for (i = start_i; i < num_pages; i++) {
5250 page = eb->pages[i];
5251 wait_on_page_locked(page);
5252 if (!PageUptodate(page))
5260 while (locked_pages > 0) {
5261 page = eb->pages[i];
5269 void read_extent_buffer(struct extent_buffer *eb, void *dstv,
5270 unsigned long start,
5277 char *dst = (char *)dstv;
5278 size_t start_offset = eb->start & ((u64)PAGE_SIZE - 1);
5279 unsigned long i = (start_offset + start) >> PAGE_SHIFT;
5281 WARN_ON(start > eb->len);
5282 WARN_ON(start + len > eb->start + eb->len);
5284 offset = (start_offset + start) & (PAGE_SIZE - 1);
5287 page = eb->pages[i];
5289 cur = min(len, (PAGE_SIZE - offset));
5290 kaddr = page_address(page);
5291 memcpy(dst, kaddr + offset, cur);
5300 int read_extent_buffer_to_user(struct extent_buffer *eb, void __user *dstv,
5301 unsigned long start,
5308 char __user *dst = (char __user *)dstv;
5309 size_t start_offset = eb->start & ((u64)PAGE_SIZE - 1);
5310 unsigned long i = (start_offset + start) >> PAGE_SHIFT;
5313 WARN_ON(start > eb->len);
5314 WARN_ON(start + len > eb->start + eb->len);
5316 offset = (start_offset + start) & (PAGE_SIZE - 1);
5319 page = eb->pages[i];
5321 cur = min(len, (PAGE_SIZE - offset));
5322 kaddr = page_address(page);
5323 if (copy_to_user(dst, kaddr + offset, cur)) {
5337 int map_private_extent_buffer(struct extent_buffer *eb, unsigned long start,
5338 unsigned long min_len, char **map,
5339 unsigned long *map_start,
5340 unsigned long *map_len)
5342 size_t offset = start & (PAGE_SIZE - 1);
5345 size_t start_offset = eb->start & ((u64)PAGE_SIZE - 1);
5346 unsigned long i = (start_offset + start) >> PAGE_SHIFT;
5347 unsigned long end_i = (start_offset + start + min_len - 1) >>
5354 offset = start_offset;
5358 *map_start = ((u64)i << PAGE_SHIFT) - start_offset;
5361 if (start + min_len > eb->len) {
5362 WARN(1, KERN_ERR "btrfs bad mapping eb start %llu len %lu, "
5364 eb->start, eb->len, start, min_len);
5369 kaddr = page_address(p);
5370 *map = kaddr + offset;
5371 *map_len = PAGE_SIZE - offset;
5375 int memcmp_extent_buffer(struct extent_buffer *eb, const void *ptrv,
5376 unsigned long start,
5383 char *ptr = (char *)ptrv;
5384 size_t start_offset = eb->start & ((u64)PAGE_SIZE - 1);
5385 unsigned long i = (start_offset + start) >> PAGE_SHIFT;
5388 WARN_ON(start > eb->len);
5389 WARN_ON(start + len > eb->start + eb->len);
5391 offset = (start_offset + start) & (PAGE_SIZE - 1);
5394 page = eb->pages[i];
5396 cur = min(len, (PAGE_SIZE - offset));
5398 kaddr = page_address(page);
5399 ret = memcmp(ptr, kaddr + offset, cur);
5411 void write_extent_buffer(struct extent_buffer *eb, const void *srcv,
5412 unsigned long start, unsigned long len)
5418 char *src = (char *)srcv;
5419 size_t start_offset = eb->start & ((u64)PAGE_SIZE - 1);
5420 unsigned long i = (start_offset + start) >> PAGE_SHIFT;
5422 WARN_ON(start > eb->len);
5423 WARN_ON(start + len > eb->start + eb->len);
5425 offset = (start_offset + start) & (PAGE_SIZE - 1);
5428 page = eb->pages[i];
5429 WARN_ON(!PageUptodate(page));
5431 cur = min(len, PAGE_SIZE - offset);
5432 kaddr = page_address(page);
5433 memcpy(kaddr + offset, src, cur);
5442 void memset_extent_buffer(struct extent_buffer *eb, char c,
5443 unsigned long start, unsigned long len)
5449 size_t start_offset = eb->start & ((u64)PAGE_SIZE - 1);
5450 unsigned long i = (start_offset + start) >> PAGE_SHIFT;
5452 WARN_ON(start > eb->len);
5453 WARN_ON(start + len > eb->start + eb->len);
5455 offset = (start_offset + start) & (PAGE_SIZE - 1);
5458 page = eb->pages[i];
5459 WARN_ON(!PageUptodate(page));
5461 cur = min(len, PAGE_SIZE - offset);
5462 kaddr = page_address(page);
5463 memset(kaddr + offset, c, cur);
5471 void copy_extent_buffer(struct extent_buffer *dst, struct extent_buffer *src,
5472 unsigned long dst_offset, unsigned long src_offset,
5475 u64 dst_len = dst->len;
5480 size_t start_offset = dst->start & ((u64)PAGE_SIZE - 1);
5481 unsigned long i = (start_offset + dst_offset) >> PAGE_SHIFT;
5483 WARN_ON(src->len != dst_len);
5485 offset = (start_offset + dst_offset) &
5489 page = dst->pages[i];
5490 WARN_ON(!PageUptodate(page));
5492 cur = min(len, (unsigned long)(PAGE_SIZE - offset));
5494 kaddr = page_address(page);
5495 read_extent_buffer(src, kaddr + offset, src_offset, cur);
5505 * The extent buffer bitmap operations are done with byte granularity because
5506 * bitmap items are not guaranteed to be aligned to a word and therefore a
5507 * single word in a bitmap may straddle two pages in the extent buffer.
5509 #define BIT_BYTE(nr) ((nr) / BITS_PER_BYTE)
5510 #define BYTE_MASK ((1 << BITS_PER_BYTE) - 1)
5511 #define BITMAP_FIRST_BYTE_MASK(start) \
5512 ((BYTE_MASK << ((start) & (BITS_PER_BYTE - 1))) & BYTE_MASK)
5513 #define BITMAP_LAST_BYTE_MASK(nbits) \
5514 (BYTE_MASK >> (-(nbits) & (BITS_PER_BYTE - 1)))
5517 * eb_bitmap_offset() - calculate the page and offset of the byte containing the
5519 * @eb: the extent buffer
5520 * @start: offset of the bitmap item in the extent buffer
5522 * @page_index: return index of the page in the extent buffer that contains the
5524 * @page_offset: return offset into the page given by page_index
5526 * This helper hides the ugliness of finding the byte in an extent buffer which
5527 * contains a given bit.
5529 static inline void eb_bitmap_offset(struct extent_buffer *eb,
5530 unsigned long start, unsigned long nr,
5531 unsigned long *page_index,
5532 size_t *page_offset)
5534 size_t start_offset = eb->start & ((u64)PAGE_SIZE - 1);
5535 size_t byte_offset = BIT_BYTE(nr);
5539 * The byte we want is the offset of the extent buffer + the offset of
5540 * the bitmap item in the extent buffer + the offset of the byte in the
5543 offset = start_offset + start + byte_offset;
5545 *page_index = offset >> PAGE_SHIFT;
5546 *page_offset = offset & (PAGE_SIZE - 1);
5550 * extent_buffer_test_bit - determine whether a bit in a bitmap item is set
5551 * @eb: the extent buffer
5552 * @start: offset of the bitmap item in the extent buffer
5553 * @nr: bit number to test
5555 int extent_buffer_test_bit(struct extent_buffer *eb, unsigned long start,
5563 eb_bitmap_offset(eb, start, nr, &i, &offset);
5564 page = eb->pages[i];
5565 WARN_ON(!PageUptodate(page));
5566 kaddr = page_address(page);
5567 return 1U & (kaddr[offset] >> (nr & (BITS_PER_BYTE - 1)));
5571 * extent_buffer_bitmap_set - set an area of a bitmap
5572 * @eb: the extent buffer
5573 * @start: offset of the bitmap item in the extent buffer
5574 * @pos: bit number of the first bit
5575 * @len: number of bits to set
5577 void extent_buffer_bitmap_set(struct extent_buffer *eb, unsigned long start,
5578 unsigned long pos, unsigned long len)
5584 const unsigned int size = pos + len;
5585 int bits_to_set = BITS_PER_BYTE - (pos % BITS_PER_BYTE);
5586 unsigned int mask_to_set = BITMAP_FIRST_BYTE_MASK(pos);
5588 eb_bitmap_offset(eb, start, pos, &i, &offset);
5589 page = eb->pages[i];
5590 WARN_ON(!PageUptodate(page));
5591 kaddr = page_address(page);
5593 while (len >= bits_to_set) {
5594 kaddr[offset] |= mask_to_set;
5596 bits_to_set = BITS_PER_BYTE;
5598 if (++offset >= PAGE_SIZE && len > 0) {
5600 page = eb->pages[++i];
5601 WARN_ON(!PageUptodate(page));
5602 kaddr = page_address(page);
5606 mask_to_set &= BITMAP_LAST_BYTE_MASK(size);
5607 kaddr[offset] |= mask_to_set;
5613 * extent_buffer_bitmap_clear - clear an area of a bitmap
5614 * @eb: the extent buffer
5615 * @start: offset of the bitmap item in the extent buffer
5616 * @pos: bit number of the first bit
5617 * @len: number of bits to clear
5619 void extent_buffer_bitmap_clear(struct extent_buffer *eb, unsigned long start,
5620 unsigned long pos, unsigned long len)
5626 const unsigned int size = pos + len;
5627 int bits_to_clear = BITS_PER_BYTE - (pos % BITS_PER_BYTE);
5628 unsigned int mask_to_clear = BITMAP_FIRST_BYTE_MASK(pos);
5630 eb_bitmap_offset(eb, start, pos, &i, &offset);
5631 page = eb->pages[i];
5632 WARN_ON(!PageUptodate(page));
5633 kaddr = page_address(page);
5635 while (len >= bits_to_clear) {
5636 kaddr[offset] &= ~mask_to_clear;
5637 len -= bits_to_clear;
5638 bits_to_clear = BITS_PER_BYTE;
5639 mask_to_clear = ~0U;
5640 if (++offset >= PAGE_SIZE && len > 0) {
5642 page = eb->pages[++i];
5643 WARN_ON(!PageUptodate(page));
5644 kaddr = page_address(page);
5648 mask_to_clear &= BITMAP_LAST_BYTE_MASK(size);
5649 kaddr[offset] &= ~mask_to_clear;
5653 static inline bool areas_overlap(unsigned long src, unsigned long dst, unsigned long len)
5655 unsigned long distance = (src > dst) ? src - dst : dst - src;
5656 return distance < len;
5659 static void copy_pages(struct page *dst_page, struct page *src_page,
5660 unsigned long dst_off, unsigned long src_off,
5663 char *dst_kaddr = page_address(dst_page);
5665 int must_memmove = 0;
5667 if (dst_page != src_page) {
5668 src_kaddr = page_address(src_page);
5670 src_kaddr = dst_kaddr;
5671 if (areas_overlap(src_off, dst_off, len))
5676 memmove(dst_kaddr + dst_off, src_kaddr + src_off, len);
5678 memcpy(dst_kaddr + dst_off, src_kaddr + src_off, len);
5681 void memcpy_extent_buffer(struct extent_buffer *dst, unsigned long dst_offset,
5682 unsigned long src_offset, unsigned long len)
5685 size_t dst_off_in_page;
5686 size_t src_off_in_page;
5687 size_t start_offset = dst->start & ((u64)PAGE_SIZE - 1);
5688 unsigned long dst_i;
5689 unsigned long src_i;
5691 if (src_offset + len > dst->len) {
5692 btrfs_err(dst->fs_info,
5693 "memmove bogus src_offset %lu move "
5694 "len %lu dst len %lu", src_offset, len, dst->len);
5697 if (dst_offset + len > dst->len) {
5698 btrfs_err(dst->fs_info,
5699 "memmove bogus dst_offset %lu move "
5700 "len %lu dst len %lu", dst_offset, len, dst->len);
5705 dst_off_in_page = (start_offset + dst_offset) &
5707 src_off_in_page = (start_offset + src_offset) &
5710 dst_i = (start_offset + dst_offset) >> PAGE_SHIFT;
5711 src_i = (start_offset + src_offset) >> PAGE_SHIFT;
5713 cur = min(len, (unsigned long)(PAGE_SIZE -
5715 cur = min_t(unsigned long, cur,
5716 (unsigned long)(PAGE_SIZE - dst_off_in_page));
5718 copy_pages(dst->pages[dst_i], dst->pages[src_i],
5719 dst_off_in_page, src_off_in_page, cur);
5727 void memmove_extent_buffer(struct extent_buffer *dst, unsigned long dst_offset,
5728 unsigned long src_offset, unsigned long len)
5731 size_t dst_off_in_page;
5732 size_t src_off_in_page;
5733 unsigned long dst_end = dst_offset + len - 1;
5734 unsigned long src_end = src_offset + len - 1;
5735 size_t start_offset = dst->start & ((u64)PAGE_SIZE - 1);
5736 unsigned long dst_i;
5737 unsigned long src_i;
5739 if (src_offset + len > dst->len) {
5740 btrfs_err(dst->fs_info, "memmove bogus src_offset %lu move "
5741 "len %lu len %lu", src_offset, len, dst->len);
5744 if (dst_offset + len > dst->len) {
5745 btrfs_err(dst->fs_info, "memmove bogus dst_offset %lu move "
5746 "len %lu len %lu", dst_offset, len, dst->len);
5749 if (dst_offset < src_offset) {
5750 memcpy_extent_buffer(dst, dst_offset, src_offset, len);
5754 dst_i = (start_offset + dst_end) >> PAGE_SHIFT;
5755 src_i = (start_offset + src_end) >> PAGE_SHIFT;
5757 dst_off_in_page = (start_offset + dst_end) &
5759 src_off_in_page = (start_offset + src_end) &
5762 cur = min_t(unsigned long, len, src_off_in_page + 1);
5763 cur = min(cur, dst_off_in_page + 1);
5764 copy_pages(dst->pages[dst_i], dst->pages[src_i],
5765 dst_off_in_page - cur + 1,
5766 src_off_in_page - cur + 1, cur);
5774 int try_release_extent_buffer(struct page *page)
5776 struct extent_buffer *eb;
5779 * We need to make sure nobody is attaching this page to an eb right
5782 spin_lock(&page->mapping->private_lock);
5783 if (!PagePrivate(page)) {
5784 spin_unlock(&page->mapping->private_lock);
5788 eb = (struct extent_buffer *)page->private;
5792 * This is a little awful but should be ok, we need to make sure that
5793 * the eb doesn't disappear out from under us while we're looking at
5796 spin_lock(&eb->refs_lock);
5797 if (atomic_read(&eb->refs) != 1 || extent_buffer_under_io(eb)) {
5798 spin_unlock(&eb->refs_lock);
5799 spin_unlock(&page->mapping->private_lock);
5802 spin_unlock(&page->mapping->private_lock);
5805 * If tree ref isn't set then we know the ref on this eb is a real ref,
5806 * so just return, this page will likely be freed soon anyway.
5808 if (!test_and_clear_bit(EXTENT_BUFFER_TREE_REF, &eb->bflags)) {
5809 spin_unlock(&eb->refs_lock);
5813 return release_extent_buffer(eb);