1 #include <linux/bitops.h>
2 #include <linux/slab.h>
5 #include <linux/pagemap.h>
6 #include <linux/page-flags.h>
7 #include <linux/module.h>
8 #include <linux/spinlock.h>
9 #include <linux/blkdev.h>
10 #include <linux/swap.h>
11 #include <linux/writeback.h>
12 #include <linux/pagevec.h>
13 #include <linux/prefetch.h>
14 #include <linux/cleancache.h>
15 #include "extent_io.h"
16 #include "extent_map.h"
19 #include "btrfs_inode.h"
22 static struct kmem_cache *extent_state_cache;
23 static struct kmem_cache *extent_buffer_cache;
25 static LIST_HEAD(buffers);
26 static LIST_HEAD(states);
30 static DEFINE_SPINLOCK(leak_lock);
33 #define BUFFER_LRU_MAX 64
38 struct rb_node rb_node;
41 struct extent_page_data {
43 struct extent_io_tree *tree;
44 get_extent_t *get_extent;
46 /* tells writepage not to lock the state bits for this range
47 * it still does the unlocking
49 unsigned int extent_locked:1;
51 /* tells the submit_bio code to use a WRITE_SYNC */
52 unsigned int sync_io:1;
55 int __init extent_io_init(void)
57 extent_state_cache = kmem_cache_create("extent_state",
58 sizeof(struct extent_state), 0,
59 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL);
60 if (!extent_state_cache)
63 extent_buffer_cache = kmem_cache_create("extent_buffers",
64 sizeof(struct extent_buffer), 0,
65 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL);
66 if (!extent_buffer_cache)
67 goto free_state_cache;
71 kmem_cache_destroy(extent_state_cache);
75 void extent_io_exit(void)
77 struct extent_state *state;
78 struct extent_buffer *eb;
80 while (!list_empty(&states)) {
81 state = list_entry(states.next, struct extent_state, leak_list);
82 printk(KERN_ERR "btrfs state leak: start %llu end %llu "
83 "state %lu in tree %p refs %d\n",
84 (unsigned long long)state->start,
85 (unsigned long long)state->end,
86 state->state, state->tree, atomic_read(&state->refs));
87 list_del(&state->leak_list);
88 kmem_cache_free(extent_state_cache, state);
92 while (!list_empty(&buffers)) {
93 eb = list_entry(buffers.next, struct extent_buffer, leak_list);
94 printk(KERN_ERR "btrfs buffer leak start %llu len %lu "
95 "refs %d\n", (unsigned long long)eb->start,
96 eb->len, atomic_read(&eb->refs));
97 list_del(&eb->leak_list);
98 kmem_cache_free(extent_buffer_cache, eb);
100 if (extent_state_cache)
101 kmem_cache_destroy(extent_state_cache);
102 if (extent_buffer_cache)
103 kmem_cache_destroy(extent_buffer_cache);
106 void extent_io_tree_init(struct extent_io_tree *tree,
107 struct address_space *mapping)
109 tree->state = RB_ROOT;
110 INIT_RADIX_TREE(&tree->buffer, GFP_ATOMIC);
112 tree->dirty_bytes = 0;
113 spin_lock_init(&tree->lock);
114 spin_lock_init(&tree->buffer_lock);
115 tree->mapping = mapping;
118 static struct extent_state *alloc_extent_state(gfp_t mask)
120 struct extent_state *state;
125 state = kmem_cache_alloc(extent_state_cache, mask);
132 spin_lock_irqsave(&leak_lock, flags);
133 list_add(&state->leak_list, &states);
134 spin_unlock_irqrestore(&leak_lock, flags);
136 atomic_set(&state->refs, 1);
137 init_waitqueue_head(&state->wq);
141 void free_extent_state(struct extent_state *state)
145 if (atomic_dec_and_test(&state->refs)) {
149 WARN_ON(state->tree);
151 spin_lock_irqsave(&leak_lock, flags);
152 list_del(&state->leak_list);
153 spin_unlock_irqrestore(&leak_lock, flags);
155 kmem_cache_free(extent_state_cache, state);
159 static struct rb_node *tree_insert(struct rb_root *root, u64 offset,
160 struct rb_node *node)
162 struct rb_node **p = &root->rb_node;
163 struct rb_node *parent = NULL;
164 struct tree_entry *entry;
168 entry = rb_entry(parent, struct tree_entry, rb_node);
170 if (offset < entry->start)
172 else if (offset > entry->end)
178 entry = rb_entry(node, struct tree_entry, rb_node);
179 rb_link_node(node, parent, p);
180 rb_insert_color(node, root);
184 static struct rb_node *__etree_search(struct extent_io_tree *tree, u64 offset,
185 struct rb_node **prev_ret,
186 struct rb_node **next_ret)
188 struct rb_root *root = &tree->state;
189 struct rb_node *n = root->rb_node;
190 struct rb_node *prev = NULL;
191 struct rb_node *orig_prev = NULL;
192 struct tree_entry *entry;
193 struct tree_entry *prev_entry = NULL;
196 entry = rb_entry(n, struct tree_entry, rb_node);
200 if (offset < entry->start)
202 else if (offset > entry->end)
210 while (prev && offset > prev_entry->end) {
211 prev = rb_next(prev);
212 prev_entry = rb_entry(prev, struct tree_entry, rb_node);
219 prev_entry = rb_entry(prev, struct tree_entry, rb_node);
220 while (prev && offset < prev_entry->start) {
221 prev = rb_prev(prev);
222 prev_entry = rb_entry(prev, struct tree_entry, rb_node);
229 static inline struct rb_node *tree_search(struct extent_io_tree *tree,
232 struct rb_node *prev = NULL;
235 ret = __etree_search(tree, offset, &prev, NULL);
241 static void merge_cb(struct extent_io_tree *tree, struct extent_state *new,
242 struct extent_state *other)
244 if (tree->ops && tree->ops->merge_extent_hook)
245 tree->ops->merge_extent_hook(tree->mapping->host, new,
250 * utility function to look for merge candidates inside a given range.
251 * Any extents with matching state are merged together into a single
252 * extent in the tree. Extents with EXTENT_IO in their state field
253 * are not merged because the end_io handlers need to be able to do
254 * operations on them without sleeping (or doing allocations/splits).
256 * This should be called with the tree lock held.
258 static void merge_state(struct extent_io_tree *tree,
259 struct extent_state *state)
261 struct extent_state *other;
262 struct rb_node *other_node;
264 if (state->state & (EXTENT_IOBITS | EXTENT_BOUNDARY))
267 other_node = rb_prev(&state->rb_node);
269 other = rb_entry(other_node, struct extent_state, rb_node);
270 if (other->end == state->start - 1 &&
271 other->state == state->state) {
272 merge_cb(tree, state, other);
273 state->start = other->start;
275 rb_erase(&other->rb_node, &tree->state);
276 free_extent_state(other);
279 other_node = rb_next(&state->rb_node);
281 other = rb_entry(other_node, struct extent_state, rb_node);
282 if (other->start == state->end + 1 &&
283 other->state == state->state) {
284 merge_cb(tree, state, other);
285 state->end = other->end;
287 rb_erase(&other->rb_node, &tree->state);
288 free_extent_state(other);
293 static void set_state_cb(struct extent_io_tree *tree,
294 struct extent_state *state, int *bits)
296 if (tree->ops && tree->ops->set_bit_hook)
297 tree->ops->set_bit_hook(tree->mapping->host, state, bits);
300 static void clear_state_cb(struct extent_io_tree *tree,
301 struct extent_state *state, int *bits)
303 if (tree->ops && tree->ops->clear_bit_hook)
304 tree->ops->clear_bit_hook(tree->mapping->host, state, bits);
307 static void set_state_bits(struct extent_io_tree *tree,
308 struct extent_state *state, int *bits);
311 * insert an extent_state struct into the tree. 'bits' are set on the
312 * struct before it is inserted.
314 * This may return -EEXIST if the extent is already there, in which case the
315 * state struct is freed.
317 * The tree lock is not taken internally. This is a utility function and
318 * probably isn't what you want to call (see set/clear_extent_bit).
320 static int insert_state(struct extent_io_tree *tree,
321 struct extent_state *state, u64 start, u64 end,
324 struct rb_node *node;
327 printk(KERN_ERR "btrfs end < start %llu %llu\n",
328 (unsigned long long)end,
329 (unsigned long long)start);
332 state->start = start;
335 set_state_bits(tree, state, bits);
337 node = tree_insert(&tree->state, end, &state->rb_node);
339 struct extent_state *found;
340 found = rb_entry(node, struct extent_state, rb_node);
341 printk(KERN_ERR "btrfs found node %llu %llu on insert of "
342 "%llu %llu\n", (unsigned long long)found->start,
343 (unsigned long long)found->end,
344 (unsigned long long)start, (unsigned long long)end);
348 merge_state(tree, state);
352 static void split_cb(struct extent_io_tree *tree, struct extent_state *orig,
355 if (tree->ops && tree->ops->split_extent_hook)
356 tree->ops->split_extent_hook(tree->mapping->host, orig, split);
360 * split a given extent state struct in two, inserting the preallocated
361 * struct 'prealloc' as the newly created second half. 'split' indicates an
362 * offset inside 'orig' where it should be split.
365 * the tree has 'orig' at [orig->start, orig->end]. After calling, there
366 * are two extent state structs in the tree:
367 * prealloc: [orig->start, split - 1]
368 * orig: [ split, orig->end ]
370 * The tree locks are not taken by this function. They need to be held
373 static int split_state(struct extent_io_tree *tree, struct extent_state *orig,
374 struct extent_state *prealloc, u64 split)
376 struct rb_node *node;
378 split_cb(tree, orig, split);
380 prealloc->start = orig->start;
381 prealloc->end = split - 1;
382 prealloc->state = orig->state;
385 node = tree_insert(&tree->state, prealloc->end, &prealloc->rb_node);
387 free_extent_state(prealloc);
390 prealloc->tree = tree;
395 * utility function to clear some bits in an extent state struct.
396 * it will optionally wake up any one waiting on this state (wake == 1), or
397 * forcibly remove the state from the tree (delete == 1).
399 * If no bits are set on the state struct after clearing things, the
400 * struct is freed and removed from the tree
402 static int clear_state_bit(struct extent_io_tree *tree,
403 struct extent_state *state,
406 int bits_to_clear = *bits & ~EXTENT_CTLBITS;
407 int ret = state->state & bits_to_clear;
409 if ((bits_to_clear & EXTENT_DIRTY) && (state->state & EXTENT_DIRTY)) {
410 u64 range = state->end - state->start + 1;
411 WARN_ON(range > tree->dirty_bytes);
412 tree->dirty_bytes -= range;
414 clear_state_cb(tree, state, bits);
415 state->state &= ~bits_to_clear;
418 if (state->state == 0) {
420 rb_erase(&state->rb_node, &tree->state);
422 free_extent_state(state);
427 merge_state(tree, state);
432 static struct extent_state *
433 alloc_extent_state_atomic(struct extent_state *prealloc)
436 prealloc = alloc_extent_state(GFP_ATOMIC);
442 * clear some bits on a range in the tree. This may require splitting
443 * or inserting elements in the tree, so the gfp mask is used to
444 * indicate which allocations or sleeping are allowed.
446 * pass 'wake' == 1 to kick any sleepers, and 'delete' == 1 to remove
447 * the given range from the tree regardless of state (ie for truncate).
449 * the range [start, end] is inclusive.
451 * This takes the tree lock, and returns < 0 on error, > 0 if any of the
452 * bits were already set, or zero if none of the bits were already set.
454 int clear_extent_bit(struct extent_io_tree *tree, u64 start, u64 end,
455 int bits, int wake, int delete,
456 struct extent_state **cached_state,
459 struct extent_state *state;
460 struct extent_state *cached;
461 struct extent_state *prealloc = NULL;
462 struct rb_node *next_node;
463 struct rb_node *node;
470 bits |= ~EXTENT_CTLBITS;
471 bits |= EXTENT_FIRST_DELALLOC;
473 if (bits & (EXTENT_IOBITS | EXTENT_BOUNDARY))
476 if (!prealloc && (mask & __GFP_WAIT)) {
477 prealloc = alloc_extent_state(mask);
482 spin_lock(&tree->lock);
484 cached = *cached_state;
487 *cached_state = NULL;
491 if (cached && cached->tree && cached->start <= start &&
492 cached->end > start) {
494 atomic_dec(&cached->refs);
499 free_extent_state(cached);
502 * this search will find the extents that end after
505 node = tree_search(tree, start);
508 state = rb_entry(node, struct extent_state, rb_node);
510 if (state->start > end)
512 WARN_ON(state->end < start);
513 last_end = state->end;
516 * | ---- desired range ---- |
518 * | ------------- state -------------- |
520 * We need to split the extent we found, and may flip
521 * bits on second half.
523 * If the extent we found extends past our range, we
524 * just split and search again. It'll get split again
525 * the next time though.
527 * If the extent we found is inside our range, we clear
528 * the desired bit on it.
531 if (state->start < start) {
532 prealloc = alloc_extent_state_atomic(prealloc);
534 err = split_state(tree, state, prealloc, start);
535 BUG_ON(err == -EEXIST);
539 if (state->end <= end) {
540 set |= clear_state_bit(tree, state, &bits, wake);
541 if (last_end == (u64)-1)
543 start = last_end + 1;
548 * | ---- desired range ---- |
550 * We need to split the extent, and clear the bit
553 if (state->start <= end && state->end > end) {
554 prealloc = alloc_extent_state_atomic(prealloc);
556 err = split_state(tree, state, prealloc, end + 1);
557 BUG_ON(err == -EEXIST);
561 set |= clear_state_bit(tree, prealloc, &bits, wake);
567 if (state->end < end && prealloc && !need_resched())
568 next_node = rb_next(&state->rb_node);
572 set |= clear_state_bit(tree, state, &bits, wake);
573 if (last_end == (u64)-1)
575 start = last_end + 1;
576 if (start <= end && next_node) {
577 state = rb_entry(next_node, struct extent_state,
579 if (state->start == start)
585 spin_unlock(&tree->lock);
587 free_extent_state(prealloc);
594 spin_unlock(&tree->lock);
595 if (mask & __GFP_WAIT)
600 static int wait_on_state(struct extent_io_tree *tree,
601 struct extent_state *state)
602 __releases(tree->lock)
603 __acquires(tree->lock)
606 prepare_to_wait(&state->wq, &wait, TASK_UNINTERRUPTIBLE);
607 spin_unlock(&tree->lock);
609 spin_lock(&tree->lock);
610 finish_wait(&state->wq, &wait);
615 * waits for one or more bits to clear on a range in the state tree.
616 * The range [start, end] is inclusive.
617 * The tree lock is taken by this function
619 int wait_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, int bits)
621 struct extent_state *state;
622 struct rb_node *node;
624 spin_lock(&tree->lock);
628 * this search will find all the extents that end after
631 node = tree_search(tree, start);
635 state = rb_entry(node, struct extent_state, rb_node);
637 if (state->start > end)
640 if (state->state & bits) {
641 start = state->start;
642 atomic_inc(&state->refs);
643 wait_on_state(tree, state);
644 free_extent_state(state);
647 start = state->end + 1;
652 cond_resched_lock(&tree->lock);
655 spin_unlock(&tree->lock);
659 static void set_state_bits(struct extent_io_tree *tree,
660 struct extent_state *state,
663 int bits_to_set = *bits & ~EXTENT_CTLBITS;
665 set_state_cb(tree, state, bits);
666 if ((bits_to_set & EXTENT_DIRTY) && !(state->state & EXTENT_DIRTY)) {
667 u64 range = state->end - state->start + 1;
668 tree->dirty_bytes += range;
670 state->state |= bits_to_set;
673 static void cache_state(struct extent_state *state,
674 struct extent_state **cached_ptr)
676 if (cached_ptr && !(*cached_ptr)) {
677 if (state->state & (EXTENT_IOBITS | EXTENT_BOUNDARY)) {
679 atomic_inc(&state->refs);
684 static void uncache_state(struct extent_state **cached_ptr)
686 if (cached_ptr && (*cached_ptr)) {
687 struct extent_state *state = *cached_ptr;
689 free_extent_state(state);
694 * set some bits on a range in the tree. This may require allocations or
695 * sleeping, so the gfp mask is used to indicate what is allowed.
697 * If any of the exclusive bits are set, this will fail with -EEXIST if some
698 * part of the range already has the desired bits set. The start of the
699 * existing range is returned in failed_start in this case.
701 * [start, end] is inclusive This takes the tree lock.
704 int set_extent_bit(struct extent_io_tree *tree, u64 start, u64 end,
705 int bits, int exclusive_bits, u64 *failed_start,
706 struct extent_state **cached_state, gfp_t mask)
708 struct extent_state *state;
709 struct extent_state *prealloc = NULL;
710 struct rb_node *node;
715 bits |= EXTENT_FIRST_DELALLOC;
717 if (!prealloc && (mask & __GFP_WAIT)) {
718 prealloc = alloc_extent_state(mask);
722 spin_lock(&tree->lock);
723 if (cached_state && *cached_state) {
724 state = *cached_state;
725 if (state->start <= start && state->end > start &&
727 node = &state->rb_node;
732 * this search will find all the extents that end after
735 node = tree_search(tree, start);
737 prealloc = alloc_extent_state_atomic(prealloc);
739 err = insert_state(tree, prealloc, start, end, &bits);
741 BUG_ON(err == -EEXIST);
744 state = rb_entry(node, struct extent_state, rb_node);
746 last_start = state->start;
747 last_end = state->end;
750 * | ---- desired range ---- |
753 * Just lock what we found and keep going
755 if (state->start == start && state->end <= end) {
756 struct rb_node *next_node;
757 if (state->state & exclusive_bits) {
758 *failed_start = state->start;
763 set_state_bits(tree, state, &bits);
765 cache_state(state, cached_state);
766 merge_state(tree, state);
767 if (last_end == (u64)-1)
770 start = last_end + 1;
771 next_node = rb_next(&state->rb_node);
772 if (next_node && start < end && prealloc && !need_resched()) {
773 state = rb_entry(next_node, struct extent_state,
775 if (state->start == start)
782 * | ---- desired range ---- |
785 * | ------------- state -------------- |
787 * We need to split the extent we found, and may flip bits on
790 * If the extent we found extends past our
791 * range, we just split and search again. It'll get split
792 * again the next time though.
794 * If the extent we found is inside our range, we set the
797 if (state->start < start) {
798 if (state->state & exclusive_bits) {
799 *failed_start = start;
804 prealloc = alloc_extent_state_atomic(prealloc);
806 err = split_state(tree, state, prealloc, start);
807 BUG_ON(err == -EEXIST);
811 if (state->end <= end) {
812 set_state_bits(tree, state, &bits);
813 cache_state(state, cached_state);
814 merge_state(tree, state);
815 if (last_end == (u64)-1)
817 start = last_end + 1;
822 * | ---- desired range ---- |
823 * | state | or | state |
825 * There's a hole, we need to insert something in it and
826 * ignore the extent we found.
828 if (state->start > start) {
830 if (end < last_start)
833 this_end = last_start - 1;
835 prealloc = alloc_extent_state_atomic(prealloc);
839 * Avoid to free 'prealloc' if it can be merged with
842 err = insert_state(tree, prealloc, start, this_end,
844 BUG_ON(err == -EEXIST);
846 free_extent_state(prealloc);
850 cache_state(prealloc, cached_state);
852 start = this_end + 1;
856 * | ---- desired range ---- |
858 * We need to split the extent, and set the bit
861 if (state->start <= end && state->end > end) {
862 if (state->state & exclusive_bits) {
863 *failed_start = start;
868 prealloc = alloc_extent_state_atomic(prealloc);
870 err = split_state(tree, state, prealloc, end + 1);
871 BUG_ON(err == -EEXIST);
873 set_state_bits(tree, prealloc, &bits);
874 cache_state(prealloc, cached_state);
875 merge_state(tree, prealloc);
883 spin_unlock(&tree->lock);
885 free_extent_state(prealloc);
892 spin_unlock(&tree->lock);
893 if (mask & __GFP_WAIT)
899 * convert_extent - convert all bits in a given range from one bit to another
900 * @tree: the io tree to search
901 * @start: the start offset in bytes
902 * @end: the end offset in bytes (inclusive)
903 * @bits: the bits to set in this range
904 * @clear_bits: the bits to clear in this range
905 * @mask: the allocation mask
907 * This will go through and set bits for the given range. If any states exist
908 * already in this range they are set with the given bit and cleared of the
909 * clear_bits. This is only meant to be used by things that are mergeable, ie
910 * converting from say DELALLOC to DIRTY. This is not meant to be used with
911 * boundary bits like LOCK.
913 int convert_extent_bit(struct extent_io_tree *tree, u64 start, u64 end,
914 int bits, int clear_bits, gfp_t mask)
916 struct extent_state *state;
917 struct extent_state *prealloc = NULL;
918 struct rb_node *node;
924 if (!prealloc && (mask & __GFP_WAIT)) {
925 prealloc = alloc_extent_state(mask);
930 spin_lock(&tree->lock);
932 * this search will find all the extents that end after
935 node = tree_search(tree, start);
937 prealloc = alloc_extent_state_atomic(prealloc);
942 err = insert_state(tree, prealloc, start, end, &bits);
944 BUG_ON(err == -EEXIST);
947 state = rb_entry(node, struct extent_state, rb_node);
949 last_start = state->start;
950 last_end = state->end;
953 * | ---- desired range ---- |
956 * Just lock what we found and keep going
958 if (state->start == start && state->end <= end) {
959 struct rb_node *next_node;
961 set_state_bits(tree, state, &bits);
962 clear_state_bit(tree, state, &clear_bits, 0);
964 merge_state(tree, state);
965 if (last_end == (u64)-1)
968 start = last_end + 1;
969 next_node = rb_next(&state->rb_node);
970 if (next_node && start < end && prealloc && !need_resched()) {
971 state = rb_entry(next_node, struct extent_state,
973 if (state->start == start)
980 * | ---- desired range ---- |
983 * | ------------- state -------------- |
985 * We need to split the extent we found, and may flip bits on
988 * If the extent we found extends past our
989 * range, we just split and search again. It'll get split
990 * again the next time though.
992 * If the extent we found is inside our range, we set the
995 if (state->start < start) {
996 prealloc = alloc_extent_state_atomic(prealloc);
1001 err = split_state(tree, state, prealloc, start);
1002 BUG_ON(err == -EEXIST);
1006 if (state->end <= end) {
1007 set_state_bits(tree, state, &bits);
1008 clear_state_bit(tree, state, &clear_bits, 0);
1009 merge_state(tree, state);
1010 if (last_end == (u64)-1)
1012 start = last_end + 1;
1017 * | ---- desired range ---- |
1018 * | state | or | state |
1020 * There's a hole, we need to insert something in it and
1021 * ignore the extent we found.
1023 if (state->start > start) {
1025 if (end < last_start)
1028 this_end = last_start - 1;
1030 prealloc = alloc_extent_state_atomic(prealloc);
1037 * Avoid to free 'prealloc' if it can be merged with
1040 err = insert_state(tree, prealloc, start, this_end,
1042 BUG_ON(err == -EEXIST);
1044 free_extent_state(prealloc);
1049 start = this_end + 1;
1053 * | ---- desired range ---- |
1055 * We need to split the extent, and set the bit
1058 if (state->start <= end && state->end > end) {
1059 prealloc = alloc_extent_state_atomic(prealloc);
1065 err = split_state(tree, state, prealloc, end + 1);
1066 BUG_ON(err == -EEXIST);
1068 set_state_bits(tree, prealloc, &bits);
1069 clear_state_bit(tree, prealloc, &clear_bits, 0);
1071 merge_state(tree, prealloc);
1079 spin_unlock(&tree->lock);
1081 free_extent_state(prealloc);
1088 spin_unlock(&tree->lock);
1089 if (mask & __GFP_WAIT)
1094 /* wrappers around set/clear extent bit */
1095 int set_extent_dirty(struct extent_io_tree *tree, u64 start, u64 end,
1098 return set_extent_bit(tree, start, end, EXTENT_DIRTY, 0, NULL,
1102 int set_extent_bits(struct extent_io_tree *tree, u64 start, u64 end,
1103 int bits, gfp_t mask)
1105 return set_extent_bit(tree, start, end, bits, 0, NULL,
1109 int clear_extent_bits(struct extent_io_tree *tree, u64 start, u64 end,
1110 int bits, gfp_t mask)
1112 return clear_extent_bit(tree, start, end, bits, 0, 0, NULL, mask);
1115 int set_extent_delalloc(struct extent_io_tree *tree, u64 start, u64 end,
1116 struct extent_state **cached_state, gfp_t mask)
1118 return set_extent_bit(tree, start, end,
1119 EXTENT_DELALLOC | EXTENT_UPTODATE,
1120 0, NULL, cached_state, mask);
1123 int clear_extent_dirty(struct extent_io_tree *tree, u64 start, u64 end,
1126 return clear_extent_bit(tree, start, end,
1127 EXTENT_DIRTY | EXTENT_DELALLOC |
1128 EXTENT_DO_ACCOUNTING, 0, 0, NULL, mask);
1131 int set_extent_new(struct extent_io_tree *tree, u64 start, u64 end,
1134 return set_extent_bit(tree, start, end, EXTENT_NEW, 0, NULL,
1138 int set_extent_uptodate(struct extent_io_tree *tree, u64 start, u64 end,
1139 struct extent_state **cached_state, gfp_t mask)
1141 return set_extent_bit(tree, start, end, EXTENT_UPTODATE, 0,
1142 NULL, cached_state, mask);
1145 static int clear_extent_uptodate(struct extent_io_tree *tree, u64 start,
1146 u64 end, struct extent_state **cached_state,
1149 return clear_extent_bit(tree, start, end, EXTENT_UPTODATE, 0, 0,
1150 cached_state, mask);
1154 * either insert or lock state struct between start and end use mask to tell
1155 * us if waiting is desired.
1157 int lock_extent_bits(struct extent_io_tree *tree, u64 start, u64 end,
1158 int bits, struct extent_state **cached_state, gfp_t mask)
1163 err = set_extent_bit(tree, start, end, EXTENT_LOCKED | bits,
1164 EXTENT_LOCKED, &failed_start,
1165 cached_state, mask);
1166 if (err == -EEXIST && (mask & __GFP_WAIT)) {
1167 wait_extent_bit(tree, failed_start, end, EXTENT_LOCKED);
1168 start = failed_start;
1172 WARN_ON(start > end);
1177 int lock_extent(struct extent_io_tree *tree, u64 start, u64 end, gfp_t mask)
1179 return lock_extent_bits(tree, start, end, 0, NULL, mask);
1182 int try_lock_extent(struct extent_io_tree *tree, u64 start, u64 end,
1188 err = set_extent_bit(tree, start, end, EXTENT_LOCKED, EXTENT_LOCKED,
1189 &failed_start, NULL, mask);
1190 if (err == -EEXIST) {
1191 if (failed_start > start)
1192 clear_extent_bit(tree, start, failed_start - 1,
1193 EXTENT_LOCKED, 1, 0, NULL, mask);
1199 int unlock_extent_cached(struct extent_io_tree *tree, u64 start, u64 end,
1200 struct extent_state **cached, gfp_t mask)
1202 return clear_extent_bit(tree, start, end, EXTENT_LOCKED, 1, 0, cached,
1206 int unlock_extent(struct extent_io_tree *tree, u64 start, u64 end, gfp_t mask)
1208 return clear_extent_bit(tree, start, end, EXTENT_LOCKED, 1, 0, NULL,
1212 int extent_range_clear_dirty_for_io(struct inode *inode, u64 start, u64 end)
1214 unsigned long index = start >> PAGE_CACHE_SHIFT;
1215 unsigned long end_index = end >> PAGE_CACHE_SHIFT;
1218 while (index <= end_index) {
1219 page = find_get_page(inode->i_mapping, index);
1220 BUG_ON(!page); /* Pages should be in the extent_io_tree */
1221 clear_page_dirty_for_io(page);
1222 page_cache_release(page);
1228 int extent_range_redirty_for_io(struct inode *inode, u64 start, u64 end)
1230 unsigned long index = start >> PAGE_CACHE_SHIFT;
1231 unsigned long end_index = end >> PAGE_CACHE_SHIFT;
1234 while (index <= end_index) {
1235 page = find_get_page(inode->i_mapping, index);
1236 BUG_ON(!page); /* Pages should be in the extent_io_tree */
1237 account_page_redirty(page);
1238 __set_page_dirty_nobuffers(page);
1239 page_cache_release(page);
1246 * helper function to set both pages and extents in the tree writeback
1248 static int set_range_writeback(struct extent_io_tree *tree, u64 start, u64 end)
1250 unsigned long index = start >> PAGE_CACHE_SHIFT;
1251 unsigned long end_index = end >> PAGE_CACHE_SHIFT;
1254 while (index <= end_index) {
1255 page = find_get_page(tree->mapping, index);
1257 set_page_writeback(page);
1258 page_cache_release(page);
1264 /* find the first state struct with 'bits' set after 'start', and
1265 * return it. tree->lock must be held. NULL will returned if
1266 * nothing was found after 'start'
1268 struct extent_state *find_first_extent_bit_state(struct extent_io_tree *tree,
1269 u64 start, int bits)
1271 struct rb_node *node;
1272 struct extent_state *state;
1275 * this search will find all the extents that end after
1278 node = tree_search(tree, start);
1283 state = rb_entry(node, struct extent_state, rb_node);
1284 if (state->end >= start && (state->state & bits))
1287 node = rb_next(node);
1296 * find the first offset in the io tree with 'bits' set. zero is
1297 * returned if we find something, and *start_ret and *end_ret are
1298 * set to reflect the state struct that was found.
1300 * If nothing was found, 1 is returned, < 0 on error
1302 int find_first_extent_bit(struct extent_io_tree *tree, u64 start,
1303 u64 *start_ret, u64 *end_ret, int bits)
1305 struct extent_state *state;
1308 spin_lock(&tree->lock);
1309 state = find_first_extent_bit_state(tree, start, bits);
1311 *start_ret = state->start;
1312 *end_ret = state->end;
1315 spin_unlock(&tree->lock);
1320 * find a contiguous range of bytes in the file marked as delalloc, not
1321 * more than 'max_bytes'. start and end are used to return the range,
1323 * 1 is returned if we find something, 0 if nothing was in the tree
1325 static noinline u64 find_delalloc_range(struct extent_io_tree *tree,
1326 u64 *start, u64 *end, u64 max_bytes,
1327 struct extent_state **cached_state)
1329 struct rb_node *node;
1330 struct extent_state *state;
1331 u64 cur_start = *start;
1333 u64 total_bytes = 0;
1335 spin_lock(&tree->lock);
1338 * this search will find all the extents that end after
1341 node = tree_search(tree, cur_start);
1349 state = rb_entry(node, struct extent_state, rb_node);
1350 if (found && (state->start != cur_start ||
1351 (state->state & EXTENT_BOUNDARY))) {
1354 if (!(state->state & EXTENT_DELALLOC)) {
1360 *start = state->start;
1361 *cached_state = state;
1362 atomic_inc(&state->refs);
1366 cur_start = state->end + 1;
1367 node = rb_next(node);
1370 total_bytes += state->end - state->start + 1;
1371 if (total_bytes >= max_bytes)
1375 spin_unlock(&tree->lock);
1379 static noinline int __unlock_for_delalloc(struct inode *inode,
1380 struct page *locked_page,
1384 struct page *pages[16];
1385 unsigned long index = start >> PAGE_CACHE_SHIFT;
1386 unsigned long end_index = end >> PAGE_CACHE_SHIFT;
1387 unsigned long nr_pages = end_index - index + 1;
1390 if (index == locked_page->index && end_index == index)
1393 while (nr_pages > 0) {
1394 ret = find_get_pages_contig(inode->i_mapping, index,
1395 min_t(unsigned long, nr_pages,
1396 ARRAY_SIZE(pages)), pages);
1397 for (i = 0; i < ret; i++) {
1398 if (pages[i] != locked_page)
1399 unlock_page(pages[i]);
1400 page_cache_release(pages[i]);
1409 static noinline int lock_delalloc_pages(struct inode *inode,
1410 struct page *locked_page,
1414 unsigned long index = delalloc_start >> PAGE_CACHE_SHIFT;
1415 unsigned long start_index = index;
1416 unsigned long end_index = delalloc_end >> PAGE_CACHE_SHIFT;
1417 unsigned long pages_locked = 0;
1418 struct page *pages[16];
1419 unsigned long nrpages;
1423 /* the caller is responsible for locking the start index */
1424 if (index == locked_page->index && index == end_index)
1427 /* skip the page at the start index */
1428 nrpages = end_index - index + 1;
1429 while (nrpages > 0) {
1430 ret = find_get_pages_contig(inode->i_mapping, index,
1431 min_t(unsigned long,
1432 nrpages, ARRAY_SIZE(pages)), pages);
1437 /* now we have an array of pages, lock them all */
1438 for (i = 0; i < ret; i++) {
1440 * the caller is taking responsibility for
1443 if (pages[i] != locked_page) {
1444 lock_page(pages[i]);
1445 if (!PageDirty(pages[i]) ||
1446 pages[i]->mapping != inode->i_mapping) {
1448 unlock_page(pages[i]);
1449 page_cache_release(pages[i]);
1453 page_cache_release(pages[i]);
1462 if (ret && pages_locked) {
1463 __unlock_for_delalloc(inode, locked_page,
1465 ((u64)(start_index + pages_locked - 1)) <<
1472 * find a contiguous range of bytes in the file marked as delalloc, not
1473 * more than 'max_bytes'. start and end are used to return the range,
1475 * 1 is returned if we find something, 0 if nothing was in the tree
1477 static noinline u64 find_lock_delalloc_range(struct inode *inode,
1478 struct extent_io_tree *tree,
1479 struct page *locked_page,
1480 u64 *start, u64 *end,
1486 struct extent_state *cached_state = NULL;
1491 /* step one, find a bunch of delalloc bytes starting at start */
1492 delalloc_start = *start;
1494 found = find_delalloc_range(tree, &delalloc_start, &delalloc_end,
1495 max_bytes, &cached_state);
1496 if (!found || delalloc_end <= *start) {
1497 *start = delalloc_start;
1498 *end = delalloc_end;
1499 free_extent_state(cached_state);
1504 * start comes from the offset of locked_page. We have to lock
1505 * pages in order, so we can't process delalloc bytes before
1508 if (delalloc_start < *start)
1509 delalloc_start = *start;
1512 * make sure to limit the number of pages we try to lock down
1515 if (delalloc_end + 1 - delalloc_start > max_bytes && loops)
1516 delalloc_end = delalloc_start + PAGE_CACHE_SIZE - 1;
1518 /* step two, lock all the pages after the page that has start */
1519 ret = lock_delalloc_pages(inode, locked_page,
1520 delalloc_start, delalloc_end);
1521 if (ret == -EAGAIN) {
1522 /* some of the pages are gone, lets avoid looping by
1523 * shortening the size of the delalloc range we're searching
1525 free_extent_state(cached_state);
1527 unsigned long offset = (*start) & (PAGE_CACHE_SIZE - 1);
1528 max_bytes = PAGE_CACHE_SIZE - offset;
1538 /* step three, lock the state bits for the whole range */
1539 lock_extent_bits(tree, delalloc_start, delalloc_end,
1540 0, &cached_state, GFP_NOFS);
1542 /* then test to make sure it is all still delalloc */
1543 ret = test_range_bit(tree, delalloc_start, delalloc_end,
1544 EXTENT_DELALLOC, 1, cached_state);
1546 unlock_extent_cached(tree, delalloc_start, delalloc_end,
1547 &cached_state, GFP_NOFS);
1548 __unlock_for_delalloc(inode, locked_page,
1549 delalloc_start, delalloc_end);
1553 free_extent_state(cached_state);
1554 *start = delalloc_start;
1555 *end = delalloc_end;
1560 int extent_clear_unlock_delalloc(struct inode *inode,
1561 struct extent_io_tree *tree,
1562 u64 start, u64 end, struct page *locked_page,
1566 struct page *pages[16];
1567 unsigned long index = start >> PAGE_CACHE_SHIFT;
1568 unsigned long end_index = end >> PAGE_CACHE_SHIFT;
1569 unsigned long nr_pages = end_index - index + 1;
1573 if (op & EXTENT_CLEAR_UNLOCK)
1574 clear_bits |= EXTENT_LOCKED;
1575 if (op & EXTENT_CLEAR_DIRTY)
1576 clear_bits |= EXTENT_DIRTY;
1578 if (op & EXTENT_CLEAR_DELALLOC)
1579 clear_bits |= EXTENT_DELALLOC;
1581 clear_extent_bit(tree, start, end, clear_bits, 1, 0, NULL, GFP_NOFS);
1582 if (!(op & (EXTENT_CLEAR_UNLOCK_PAGE | EXTENT_CLEAR_DIRTY |
1583 EXTENT_SET_WRITEBACK | EXTENT_END_WRITEBACK |
1584 EXTENT_SET_PRIVATE2)))
1587 while (nr_pages > 0) {
1588 ret = find_get_pages_contig(inode->i_mapping, index,
1589 min_t(unsigned long,
1590 nr_pages, ARRAY_SIZE(pages)), pages);
1591 for (i = 0; i < ret; i++) {
1593 if (op & EXTENT_SET_PRIVATE2)
1594 SetPagePrivate2(pages[i]);
1596 if (pages[i] == locked_page) {
1597 page_cache_release(pages[i]);
1600 if (op & EXTENT_CLEAR_DIRTY)
1601 clear_page_dirty_for_io(pages[i]);
1602 if (op & EXTENT_SET_WRITEBACK)
1603 set_page_writeback(pages[i]);
1604 if (op & EXTENT_END_WRITEBACK)
1605 end_page_writeback(pages[i]);
1606 if (op & EXTENT_CLEAR_UNLOCK_PAGE)
1607 unlock_page(pages[i]);
1608 page_cache_release(pages[i]);
1618 * count the number of bytes in the tree that have a given bit(s)
1619 * set. This can be fairly slow, except for EXTENT_DIRTY which is
1620 * cached. The total number found is returned.
1622 u64 count_range_bits(struct extent_io_tree *tree,
1623 u64 *start, u64 search_end, u64 max_bytes,
1624 unsigned long bits, int contig)
1626 struct rb_node *node;
1627 struct extent_state *state;
1628 u64 cur_start = *start;
1629 u64 total_bytes = 0;
1633 if (search_end <= cur_start) {
1638 spin_lock(&tree->lock);
1639 if (cur_start == 0 && bits == EXTENT_DIRTY) {
1640 total_bytes = tree->dirty_bytes;
1644 * this search will find all the extents that end after
1647 node = tree_search(tree, cur_start);
1652 state = rb_entry(node, struct extent_state, rb_node);
1653 if (state->start > search_end)
1655 if (contig && found && state->start > last + 1)
1657 if (state->end >= cur_start && (state->state & bits) == bits) {
1658 total_bytes += min(search_end, state->end) + 1 -
1659 max(cur_start, state->start);
1660 if (total_bytes >= max_bytes)
1663 *start = max(cur_start, state->start);
1667 } else if (contig && found) {
1670 node = rb_next(node);
1675 spin_unlock(&tree->lock);
1680 * set the private field for a given byte offset in the tree. If there isn't
1681 * an extent_state there already, this does nothing.
1683 int set_state_private(struct extent_io_tree *tree, u64 start, u64 private)
1685 struct rb_node *node;
1686 struct extent_state *state;
1689 spin_lock(&tree->lock);
1691 * this search will find all the extents that end after
1694 node = tree_search(tree, start);
1699 state = rb_entry(node, struct extent_state, rb_node);
1700 if (state->start != start) {
1704 state->private = private;
1706 spin_unlock(&tree->lock);
1710 int get_state_private(struct extent_io_tree *tree, u64 start, u64 *private)
1712 struct rb_node *node;
1713 struct extent_state *state;
1716 spin_lock(&tree->lock);
1718 * this search will find all the extents that end after
1721 node = tree_search(tree, start);
1726 state = rb_entry(node, struct extent_state, rb_node);
1727 if (state->start != start) {
1731 *private = state->private;
1733 spin_unlock(&tree->lock);
1738 * searches a range in the state tree for a given mask.
1739 * If 'filled' == 1, this returns 1 only if every extent in the tree
1740 * has the bits set. Otherwise, 1 is returned if any bit in the
1741 * range is found set.
1743 int test_range_bit(struct extent_io_tree *tree, u64 start, u64 end,
1744 int bits, int filled, struct extent_state *cached)
1746 struct extent_state *state = NULL;
1747 struct rb_node *node;
1750 spin_lock(&tree->lock);
1751 if (cached && cached->tree && cached->start <= start &&
1752 cached->end > start)
1753 node = &cached->rb_node;
1755 node = tree_search(tree, start);
1756 while (node && start <= end) {
1757 state = rb_entry(node, struct extent_state, rb_node);
1759 if (filled && state->start > start) {
1764 if (state->start > end)
1767 if (state->state & bits) {
1771 } else if (filled) {
1776 if (state->end == (u64)-1)
1779 start = state->end + 1;
1782 node = rb_next(node);
1789 spin_unlock(&tree->lock);
1794 * helper function to set a given page up to date if all the
1795 * extents in the tree for that page are up to date
1797 static int check_page_uptodate(struct extent_io_tree *tree,
1800 u64 start = (u64)page->index << PAGE_CACHE_SHIFT;
1801 u64 end = start + PAGE_CACHE_SIZE - 1;
1802 if (test_range_bit(tree, start, end, EXTENT_UPTODATE, 1, NULL))
1803 SetPageUptodate(page);
1808 * helper function to unlock a page if all the extents in the tree
1809 * for that page are unlocked
1811 static int check_page_locked(struct extent_io_tree *tree,
1814 u64 start = (u64)page->index << PAGE_CACHE_SHIFT;
1815 u64 end = start + PAGE_CACHE_SIZE - 1;
1816 if (!test_range_bit(tree, start, end, EXTENT_LOCKED, 0, NULL))
1822 * helper function to end page writeback if all the extents
1823 * in the tree for that page are done with writeback
1825 static int check_page_writeback(struct extent_io_tree *tree,
1828 end_page_writeback(page);
1833 * When IO fails, either with EIO or csum verification fails, we
1834 * try other mirrors that might have a good copy of the data. This
1835 * io_failure_record is used to record state as we go through all the
1836 * mirrors. If another mirror has good data, the page is set up to date
1837 * and things continue. If a good mirror can't be found, the original
1838 * bio end_io callback is called to indicate things have failed.
1840 struct io_failure_record {
1845 unsigned long bio_flags;
1851 static int free_io_failure(struct inode *inode, struct io_failure_record *rec,
1856 struct extent_io_tree *failure_tree = &BTRFS_I(inode)->io_failure_tree;
1858 set_state_private(failure_tree, rec->start, 0);
1859 ret = clear_extent_bits(failure_tree, rec->start,
1860 rec->start + rec->len - 1,
1861 EXTENT_LOCKED | EXTENT_DIRTY, GFP_NOFS);
1866 ret = clear_extent_bits(&BTRFS_I(inode)->io_tree, rec->start,
1867 rec->start + rec->len - 1,
1868 EXTENT_DAMAGED, GFP_NOFS);
1877 static void repair_io_failure_callback(struct bio *bio, int err)
1879 complete(bio->bi_private);
1883 * this bypasses the standard btrfs submit functions deliberately, as
1884 * the standard behavior is to write all copies in a raid setup. here we only
1885 * want to write the one bad copy. so we do the mapping for ourselves and issue
1886 * submit_bio directly.
1887 * to avoid any synchonization issues, wait for the data after writing, which
1888 * actually prevents the read that triggered the error from finishing.
1889 * currently, there can be no more than two copies of every data bit. thus,
1890 * exactly one rewrite is required.
1892 int repair_io_failure(struct btrfs_mapping_tree *map_tree, u64 start,
1893 u64 length, u64 logical, struct page *page,
1897 struct btrfs_device *dev;
1898 DECLARE_COMPLETION_ONSTACK(compl);
1901 struct btrfs_bio *bbio = NULL;
1904 BUG_ON(!mirror_num);
1906 bio = bio_alloc(GFP_NOFS, 1);
1909 bio->bi_private = &compl;
1910 bio->bi_end_io = repair_io_failure_callback;
1912 map_length = length;
1914 ret = btrfs_map_block(map_tree, WRITE, logical,
1915 &map_length, &bbio, mirror_num);
1920 BUG_ON(mirror_num != bbio->mirror_num);
1921 sector = bbio->stripes[mirror_num-1].physical >> 9;
1922 bio->bi_sector = sector;
1923 dev = bbio->stripes[mirror_num-1].dev;
1925 if (!dev || !dev->bdev || !dev->writeable) {
1929 bio->bi_bdev = dev->bdev;
1930 bio_add_page(bio, page, length, start-page_offset(page));
1931 submit_bio(WRITE_SYNC, bio);
1932 wait_for_completion(&compl);
1934 if (!test_bit(BIO_UPTODATE, &bio->bi_flags)) {
1935 /* try to remap that extent elsewhere? */
1940 printk(KERN_INFO "btrfs read error corrected: ino %lu off %llu (dev %s "
1941 "sector %llu)\n", page->mapping->host->i_ino, start,
1949 * each time an IO finishes, we do a fast check in the IO failure tree
1950 * to see if we need to process or clean up an io_failure_record
1952 static int clean_io_failure(u64 start, struct page *page)
1955 u64 private_failure;
1956 struct io_failure_record *failrec;
1957 struct btrfs_mapping_tree *map_tree;
1958 struct extent_state *state;
1962 struct inode *inode = page->mapping->host;
1965 ret = count_range_bits(&BTRFS_I(inode)->io_failure_tree, &private,
1966 (u64)-1, 1, EXTENT_DIRTY, 0);
1970 ret = get_state_private(&BTRFS_I(inode)->io_failure_tree, start,
1975 failrec = (struct io_failure_record *)(unsigned long) private_failure;
1976 BUG_ON(!failrec->this_mirror);
1978 if (failrec->in_validation) {
1979 /* there was no real error, just free the record */
1980 pr_debug("clean_io_failure: freeing dummy error at %llu\n",
1986 spin_lock(&BTRFS_I(inode)->io_tree.lock);
1987 state = find_first_extent_bit_state(&BTRFS_I(inode)->io_tree,
1990 spin_unlock(&BTRFS_I(inode)->io_tree.lock);
1992 if (state && state->start == failrec->start) {
1993 map_tree = &BTRFS_I(inode)->root->fs_info->mapping_tree;
1994 num_copies = btrfs_num_copies(map_tree, failrec->logical,
1996 if (num_copies > 1) {
1997 ret = repair_io_failure(map_tree, start, failrec->len,
1998 failrec->logical, page,
1999 failrec->failed_mirror);
2006 ret = free_io_failure(inode, failrec, did_repair);
2012 * this is a generic handler for readpage errors (default
2013 * readpage_io_failed_hook). if other copies exist, read those and write back
2014 * good data to the failed position. does not investigate in remapping the
2015 * failed extent elsewhere, hoping the device will be smart enough to do this as
2019 static int bio_readpage_error(struct bio *failed_bio, struct page *page,
2020 u64 start, u64 end, int failed_mirror,
2021 struct extent_state *state)
2023 struct io_failure_record *failrec = NULL;
2025 struct extent_map *em;
2026 struct inode *inode = page->mapping->host;
2027 struct extent_io_tree *failure_tree = &BTRFS_I(inode)->io_failure_tree;
2028 struct extent_io_tree *tree = &BTRFS_I(inode)->io_tree;
2029 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
2036 BUG_ON(failed_bio->bi_rw & REQ_WRITE);
2038 ret = get_state_private(failure_tree, start, &private);
2040 failrec = kzalloc(sizeof(*failrec), GFP_NOFS);
2043 failrec->start = start;
2044 failrec->len = end - start + 1;
2045 failrec->this_mirror = 0;
2046 failrec->bio_flags = 0;
2047 failrec->in_validation = 0;
2049 read_lock(&em_tree->lock);
2050 em = lookup_extent_mapping(em_tree, start, failrec->len);
2052 read_unlock(&em_tree->lock);
2057 if (em->start > start || em->start + em->len < start) {
2058 free_extent_map(em);
2061 read_unlock(&em_tree->lock);
2063 if (!em || IS_ERR(em)) {
2067 logical = start - em->start;
2068 logical = em->block_start + logical;
2069 if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) {
2070 logical = em->block_start;
2071 failrec->bio_flags = EXTENT_BIO_COMPRESSED;
2072 extent_set_compress_type(&failrec->bio_flags,
2075 pr_debug("bio_readpage_error: (new) logical=%llu, start=%llu, "
2076 "len=%llu\n", logical, start, failrec->len);
2077 failrec->logical = logical;
2078 free_extent_map(em);
2080 /* set the bits in the private failure tree */
2081 ret = set_extent_bits(failure_tree, start, end,
2082 EXTENT_LOCKED | EXTENT_DIRTY, GFP_NOFS);
2084 ret = set_state_private(failure_tree, start,
2085 (u64)(unsigned long)failrec);
2086 /* set the bits in the inode's tree */
2088 ret = set_extent_bits(tree, start, end, EXTENT_DAMAGED,
2095 failrec = (struct io_failure_record *)(unsigned long)private;
2096 pr_debug("bio_readpage_error: (found) logical=%llu, "
2097 "start=%llu, len=%llu, validation=%d\n",
2098 failrec->logical, failrec->start, failrec->len,
2099 failrec->in_validation);
2101 * when data can be on disk more than twice, add to failrec here
2102 * (e.g. with a list for failed_mirror) to make
2103 * clean_io_failure() clean all those errors at once.
2106 num_copies = btrfs_num_copies(
2107 &BTRFS_I(inode)->root->fs_info->mapping_tree,
2108 failrec->logical, failrec->len);
2109 if (num_copies == 1) {
2111 * we only have a single copy of the data, so don't bother with
2112 * all the retry and error correction code that follows. no
2113 * matter what the error is, it is very likely to persist.
2115 pr_debug("bio_readpage_error: cannot repair, num_copies == 1. "
2116 "state=%p, num_copies=%d, next_mirror %d, "
2117 "failed_mirror %d\n", state, num_copies,
2118 failrec->this_mirror, failed_mirror);
2119 free_io_failure(inode, failrec, 0);
2124 spin_lock(&tree->lock);
2125 state = find_first_extent_bit_state(tree, failrec->start,
2127 if (state && state->start != failrec->start)
2129 spin_unlock(&tree->lock);
2133 * there are two premises:
2134 * a) deliver good data to the caller
2135 * b) correct the bad sectors on disk
2137 if (failed_bio->bi_vcnt > 1) {
2139 * to fulfill b), we need to know the exact failing sectors, as
2140 * we don't want to rewrite any more than the failed ones. thus,
2141 * we need separate read requests for the failed bio
2143 * if the following BUG_ON triggers, our validation request got
2144 * merged. we need separate requests for our algorithm to work.
2146 BUG_ON(failrec->in_validation);
2147 failrec->in_validation = 1;
2148 failrec->this_mirror = failed_mirror;
2149 read_mode = READ_SYNC | REQ_FAILFAST_DEV;
2152 * we're ready to fulfill a) and b) alongside. get a good copy
2153 * of the failed sector and if we succeed, we have setup
2154 * everything for repair_io_failure to do the rest for us.
2156 if (failrec->in_validation) {
2157 BUG_ON(failrec->this_mirror != failed_mirror);
2158 failrec->in_validation = 0;
2159 failrec->this_mirror = 0;
2161 failrec->failed_mirror = failed_mirror;
2162 failrec->this_mirror++;
2163 if (failrec->this_mirror == failed_mirror)
2164 failrec->this_mirror++;
2165 read_mode = READ_SYNC;
2168 if (!state || failrec->this_mirror > num_copies) {
2169 pr_debug("bio_readpage_error: (fail) state=%p, num_copies=%d, "
2170 "next_mirror %d, failed_mirror %d\n", state,
2171 num_copies, failrec->this_mirror, failed_mirror);
2172 free_io_failure(inode, failrec, 0);
2176 bio = bio_alloc(GFP_NOFS, 1);
2177 bio->bi_private = state;
2178 bio->bi_end_io = failed_bio->bi_end_io;
2179 bio->bi_sector = failrec->logical >> 9;
2180 bio->bi_bdev = BTRFS_I(inode)->root->fs_info->fs_devices->latest_bdev;
2183 bio_add_page(bio, page, failrec->len, start - page_offset(page));
2185 pr_debug("bio_readpage_error: submitting new read[%#x] to "
2186 "this_mirror=%d, num_copies=%d, in_validation=%d\n", read_mode,
2187 failrec->this_mirror, num_copies, failrec->in_validation);
2189 tree->ops->submit_bio_hook(inode, read_mode, bio, failrec->this_mirror,
2190 failrec->bio_flags, 0);
2194 /* lots and lots of room for performance fixes in the end_bio funcs */
2197 * after a writepage IO is done, we need to:
2198 * clear the uptodate bits on error
2199 * clear the writeback bits in the extent tree for this IO
2200 * end_page_writeback if the page has no more pending IO
2202 * Scheduling is not allowed, so the extent state tree is expected
2203 * to have one and only one object corresponding to this IO.
2205 static void end_bio_extent_writepage(struct bio *bio, int err)
2207 int uptodate = err == 0;
2208 struct bio_vec *bvec = bio->bi_io_vec + bio->bi_vcnt - 1;
2209 struct extent_io_tree *tree;
2216 struct page *page = bvec->bv_page;
2217 tree = &BTRFS_I(page->mapping->host)->io_tree;
2219 start = ((u64)page->index << PAGE_CACHE_SHIFT) +
2221 end = start + bvec->bv_len - 1;
2223 if (bvec->bv_offset == 0 && bvec->bv_len == PAGE_CACHE_SIZE)
2228 if (--bvec >= bio->bi_io_vec)
2229 prefetchw(&bvec->bv_page->flags);
2230 if (tree->ops && tree->ops->writepage_end_io_hook) {
2231 ret = tree->ops->writepage_end_io_hook(page, start,
2232 end, NULL, uptodate);
2237 if (!uptodate && tree->ops &&
2238 tree->ops->writepage_io_failed_hook) {
2239 ret = tree->ops->writepage_io_failed_hook(bio, page,
2242 uptodate = (err == 0);
2248 clear_extent_uptodate(tree, start, end, NULL, GFP_NOFS);
2249 ClearPageUptodate(page);
2254 end_page_writeback(page);
2256 check_page_writeback(tree, page);
2257 } while (bvec >= bio->bi_io_vec);
2263 * after a readpage IO is done, we need to:
2264 * clear the uptodate bits on error
2265 * set the uptodate bits if things worked
2266 * set the page up to date if all extents in the tree are uptodate
2267 * clear the lock bit in the extent tree
2268 * unlock the page if there are no other extents locked for it
2270 * Scheduling is not allowed, so the extent state tree is expected
2271 * to have one and only one object corresponding to this IO.
2273 static void end_bio_extent_readpage(struct bio *bio, int err)
2275 int uptodate = test_bit(BIO_UPTODATE, &bio->bi_flags);
2276 struct bio_vec *bvec_end = bio->bi_io_vec + bio->bi_vcnt - 1;
2277 struct bio_vec *bvec = bio->bi_io_vec;
2278 struct extent_io_tree *tree;
2288 struct page *page = bvec->bv_page;
2289 struct extent_state *cached = NULL;
2290 struct extent_state *state;
2292 pr_debug("end_bio_extent_readpage: bi_vcnt=%d, idx=%d, err=%d, "
2293 "mirror=%ld\n", bio->bi_vcnt, bio->bi_idx, err,
2294 (long int)bio->bi_bdev);
2295 tree = &BTRFS_I(page->mapping->host)->io_tree;
2297 start = ((u64)page->index << PAGE_CACHE_SHIFT) +
2299 end = start + bvec->bv_len - 1;
2301 if (bvec->bv_offset == 0 && bvec->bv_len == PAGE_CACHE_SIZE)
2306 if (++bvec <= bvec_end)
2307 prefetchw(&bvec->bv_page->flags);
2309 spin_lock(&tree->lock);
2310 state = find_first_extent_bit_state(tree, start, EXTENT_LOCKED);
2311 if (state && state->start == start) {
2313 * take a reference on the state, unlock will drop
2316 cache_state(state, &cached);
2318 spin_unlock(&tree->lock);
2320 if (uptodate && tree->ops && tree->ops->readpage_end_io_hook) {
2321 ret = tree->ops->readpage_end_io_hook(page, start, end,
2326 clean_io_failure(start, page);
2330 failed_mirror = (int)(unsigned long)bio->bi_bdev;
2332 * The generic bio_readpage_error handles errors the
2333 * following way: If possible, new read requests are
2334 * created and submitted and will end up in
2335 * end_bio_extent_readpage as well (if we're lucky, not
2336 * in the !uptodate case). In that case it returns 0 and
2337 * we just go on with the next page in our bio. If it
2338 * can't handle the error it will return -EIO and we
2339 * remain responsible for that page.
2341 ret = bio_readpage_error(bio, page, start, end,
2342 failed_mirror, NULL);
2346 test_bit(BIO_UPTODATE, &bio->bi_flags);
2349 uncache_state(&cached);
2352 if (tree->ops && tree->ops->readpage_io_failed_hook) {
2353 ret = tree->ops->readpage_io_failed_hook(
2354 bio, page, start, end,
2355 failed_mirror, state);
2362 set_extent_uptodate(tree, start, end, &cached,
2365 unlock_extent_cached(tree, start, end, &cached, GFP_ATOMIC);
2369 SetPageUptodate(page);
2371 ClearPageUptodate(page);
2377 check_page_uptodate(tree, page);
2379 ClearPageUptodate(page);
2382 check_page_locked(tree, page);
2384 } while (bvec <= bvec_end);
2390 btrfs_bio_alloc(struct block_device *bdev, u64 first_sector, int nr_vecs,
2395 bio = bio_alloc(gfp_flags, nr_vecs);
2397 if (bio == NULL && (current->flags & PF_MEMALLOC)) {
2398 while (!bio && (nr_vecs /= 2))
2399 bio = bio_alloc(gfp_flags, nr_vecs);
2404 bio->bi_bdev = bdev;
2405 bio->bi_sector = first_sector;
2410 static int submit_one_bio(int rw, struct bio *bio, int mirror_num,
2411 unsigned long bio_flags)
2414 struct bio_vec *bvec = bio->bi_io_vec + bio->bi_vcnt - 1;
2415 struct page *page = bvec->bv_page;
2416 struct extent_io_tree *tree = bio->bi_private;
2419 start = ((u64)page->index << PAGE_CACHE_SHIFT) + bvec->bv_offset;
2421 bio->bi_private = NULL;
2425 if (tree->ops && tree->ops->submit_bio_hook)
2426 ret = tree->ops->submit_bio_hook(page->mapping->host, rw, bio,
2427 mirror_num, bio_flags, start);
2429 submit_bio(rw, bio);
2431 if (bio_flagged(bio, BIO_EOPNOTSUPP))
2437 static int submit_extent_page(int rw, struct extent_io_tree *tree,
2438 struct page *page, sector_t sector,
2439 size_t size, unsigned long offset,
2440 struct block_device *bdev,
2441 struct bio **bio_ret,
2442 unsigned long max_pages,
2443 bio_end_io_t end_io_func,
2445 unsigned long prev_bio_flags,
2446 unsigned long bio_flags)
2452 int this_compressed = bio_flags & EXTENT_BIO_COMPRESSED;
2453 int old_compressed = prev_bio_flags & EXTENT_BIO_COMPRESSED;
2454 size_t page_size = min_t(size_t, size, PAGE_CACHE_SIZE);
2456 if (bio_ret && *bio_ret) {
2459 contig = bio->bi_sector == sector;
2461 contig = bio->bi_sector + (bio->bi_size >> 9) ==
2464 if (prev_bio_flags != bio_flags || !contig ||
2465 (tree->ops && tree->ops->merge_bio_hook &&
2466 tree->ops->merge_bio_hook(page, offset, page_size, bio,
2468 bio_add_page(bio, page, page_size, offset) < page_size) {
2469 ret = submit_one_bio(rw, bio, mirror_num,
2476 if (this_compressed)
2479 nr = bio_get_nr_vecs(bdev);
2481 bio = btrfs_bio_alloc(bdev, sector, nr, GFP_NOFS | __GFP_HIGH);
2485 bio_add_page(bio, page, page_size, offset);
2486 bio->bi_end_io = end_io_func;
2487 bio->bi_private = tree;
2492 ret = submit_one_bio(rw, bio, mirror_num, bio_flags);
2497 void set_page_extent_mapped(struct page *page)
2499 if (!PagePrivate(page)) {
2500 SetPagePrivate(page);
2501 page_cache_get(page);
2502 set_page_private(page, EXTENT_PAGE_PRIVATE);
2506 static void set_page_extent_head(struct page *page, unsigned long len)
2508 WARN_ON(!PagePrivate(page));
2509 set_page_private(page, EXTENT_PAGE_PRIVATE_FIRST_PAGE | len << 2);
2513 * basic readpage implementation. Locked extent state structs are inserted
2514 * into the tree that are removed when the IO is done (by the end_io
2517 static int __extent_read_full_page(struct extent_io_tree *tree,
2519 get_extent_t *get_extent,
2520 struct bio **bio, int mirror_num,
2521 unsigned long *bio_flags)
2523 struct inode *inode = page->mapping->host;
2524 u64 start = (u64)page->index << PAGE_CACHE_SHIFT;
2525 u64 page_end = start + PAGE_CACHE_SIZE - 1;
2529 u64 last_byte = i_size_read(inode);
2533 struct extent_map *em;
2534 struct block_device *bdev;
2535 struct btrfs_ordered_extent *ordered;
2538 size_t pg_offset = 0;
2540 size_t disk_io_size;
2541 size_t blocksize = inode->i_sb->s_blocksize;
2542 unsigned long this_bio_flag = 0;
2544 set_page_extent_mapped(page);
2546 if (!PageUptodate(page)) {
2547 if (cleancache_get_page(page) == 0) {
2548 BUG_ON(blocksize != PAGE_SIZE);
2555 lock_extent(tree, start, end, GFP_NOFS);
2556 ordered = btrfs_lookup_ordered_extent(inode, start);
2559 unlock_extent(tree, start, end, GFP_NOFS);
2560 btrfs_start_ordered_extent(inode, ordered, 1);
2561 btrfs_put_ordered_extent(ordered);
2564 if (page->index == last_byte >> PAGE_CACHE_SHIFT) {
2566 size_t zero_offset = last_byte & (PAGE_CACHE_SIZE - 1);
2569 iosize = PAGE_CACHE_SIZE - zero_offset;
2570 userpage = kmap_atomic(page, KM_USER0);
2571 memset(userpage + zero_offset, 0, iosize);
2572 flush_dcache_page(page);
2573 kunmap_atomic(userpage, KM_USER0);
2576 while (cur <= end) {
2577 if (cur >= last_byte) {
2579 struct extent_state *cached = NULL;
2581 iosize = PAGE_CACHE_SIZE - pg_offset;
2582 userpage = kmap_atomic(page, KM_USER0);
2583 memset(userpage + pg_offset, 0, iosize);
2584 flush_dcache_page(page);
2585 kunmap_atomic(userpage, KM_USER0);
2586 set_extent_uptodate(tree, cur, cur + iosize - 1,
2588 unlock_extent_cached(tree, cur, cur + iosize - 1,
2592 em = get_extent(inode, page, pg_offset, cur,
2594 if (IS_ERR_OR_NULL(em)) {
2596 unlock_extent(tree, cur, end, GFP_NOFS);
2599 extent_offset = cur - em->start;
2600 BUG_ON(extent_map_end(em) <= cur);
2603 if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) {
2604 this_bio_flag = EXTENT_BIO_COMPRESSED;
2605 extent_set_compress_type(&this_bio_flag,
2609 iosize = min(extent_map_end(em) - cur, end - cur + 1);
2610 cur_end = min(extent_map_end(em) - 1, end);
2611 iosize = (iosize + blocksize - 1) & ~((u64)blocksize - 1);
2612 if (this_bio_flag & EXTENT_BIO_COMPRESSED) {
2613 disk_io_size = em->block_len;
2614 sector = em->block_start >> 9;
2616 sector = (em->block_start + extent_offset) >> 9;
2617 disk_io_size = iosize;
2620 block_start = em->block_start;
2621 if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags))
2622 block_start = EXTENT_MAP_HOLE;
2623 free_extent_map(em);
2626 /* we've found a hole, just zero and go on */
2627 if (block_start == EXTENT_MAP_HOLE) {
2629 struct extent_state *cached = NULL;
2631 userpage = kmap_atomic(page, KM_USER0);
2632 memset(userpage + pg_offset, 0, iosize);
2633 flush_dcache_page(page);
2634 kunmap_atomic(userpage, KM_USER0);
2636 set_extent_uptodate(tree, cur, cur + iosize - 1,
2638 unlock_extent_cached(tree, cur, cur + iosize - 1,
2641 pg_offset += iosize;
2644 /* the get_extent function already copied into the page */
2645 if (test_range_bit(tree, cur, cur_end,
2646 EXTENT_UPTODATE, 1, NULL)) {
2647 check_page_uptodate(tree, page);
2648 unlock_extent(tree, cur, cur + iosize - 1, GFP_NOFS);
2650 pg_offset += iosize;
2653 /* we have an inline extent but it didn't get marked up
2654 * to date. Error out
2656 if (block_start == EXTENT_MAP_INLINE) {
2658 unlock_extent(tree, cur, cur + iosize - 1, GFP_NOFS);
2660 pg_offset += iosize;
2665 if (tree->ops && tree->ops->readpage_io_hook) {
2666 ret = tree->ops->readpage_io_hook(page, cur,
2670 unsigned long pnr = (last_byte >> PAGE_CACHE_SHIFT) + 1;
2672 ret = submit_extent_page(READ, tree, page,
2673 sector, disk_io_size, pg_offset,
2675 end_bio_extent_readpage, mirror_num,
2679 *bio_flags = this_bio_flag;
2684 pg_offset += iosize;
2688 if (!PageError(page))
2689 SetPageUptodate(page);
2695 int extent_read_full_page(struct extent_io_tree *tree, struct page *page,
2696 get_extent_t *get_extent, int mirror_num)
2698 struct bio *bio = NULL;
2699 unsigned long bio_flags = 0;
2702 ret = __extent_read_full_page(tree, page, get_extent, &bio, mirror_num,
2705 ret = submit_one_bio(READ, bio, mirror_num, bio_flags);
2709 static noinline void update_nr_written(struct page *page,
2710 struct writeback_control *wbc,
2711 unsigned long nr_written)
2713 wbc->nr_to_write -= nr_written;
2714 if (wbc->range_cyclic || (wbc->nr_to_write > 0 &&
2715 wbc->range_start == 0 && wbc->range_end == LLONG_MAX))
2716 page->mapping->writeback_index = page->index + nr_written;
2720 * the writepage semantics are similar to regular writepage. extent
2721 * records are inserted to lock ranges in the tree, and as dirty areas
2722 * are found, they are marked writeback. Then the lock bits are removed
2723 * and the end_io handler clears the writeback ranges
2725 static int __extent_writepage(struct page *page, struct writeback_control *wbc,
2728 struct inode *inode = page->mapping->host;
2729 struct extent_page_data *epd = data;
2730 struct extent_io_tree *tree = epd->tree;
2731 u64 start = (u64)page->index << PAGE_CACHE_SHIFT;
2733 u64 page_end = start + PAGE_CACHE_SIZE - 1;
2737 u64 last_byte = i_size_read(inode);
2741 struct extent_state *cached_state = NULL;
2742 struct extent_map *em;
2743 struct block_device *bdev;
2746 size_t pg_offset = 0;
2748 loff_t i_size = i_size_read(inode);
2749 unsigned long end_index = i_size >> PAGE_CACHE_SHIFT;
2755 unsigned long nr_written = 0;
2756 bool fill_delalloc = true;
2758 if (wbc->sync_mode == WB_SYNC_ALL)
2759 write_flags = WRITE_SYNC;
2761 write_flags = WRITE;
2763 trace___extent_writepage(page, inode, wbc);
2765 WARN_ON(!PageLocked(page));
2767 ClearPageError(page);
2769 pg_offset = i_size & (PAGE_CACHE_SIZE - 1);
2770 if (page->index > end_index ||
2771 (page->index == end_index && !pg_offset)) {
2772 page->mapping->a_ops->invalidatepage(page, 0);
2777 if (page->index == end_index) {
2780 userpage = kmap_atomic(page, KM_USER0);
2781 memset(userpage + pg_offset, 0,
2782 PAGE_CACHE_SIZE - pg_offset);
2783 kunmap_atomic(userpage, KM_USER0);
2784 flush_dcache_page(page);
2788 set_page_extent_mapped(page);
2790 if (!tree->ops || !tree->ops->fill_delalloc)
2791 fill_delalloc = false;
2793 delalloc_start = start;
2796 if (!epd->extent_locked && fill_delalloc) {
2797 u64 delalloc_to_write = 0;
2799 * make sure the wbc mapping index is at least updated
2802 update_nr_written(page, wbc, 0);
2804 while (delalloc_end < page_end) {
2805 nr_delalloc = find_lock_delalloc_range(inode, tree,
2810 if (nr_delalloc == 0) {
2811 delalloc_start = delalloc_end + 1;
2814 tree->ops->fill_delalloc(inode, page, delalloc_start,
2815 delalloc_end, &page_started,
2818 * delalloc_end is already one less than the total
2819 * length, so we don't subtract one from
2822 delalloc_to_write += (delalloc_end - delalloc_start +
2825 delalloc_start = delalloc_end + 1;
2827 if (wbc->nr_to_write < delalloc_to_write) {
2830 if (delalloc_to_write < thresh * 2)
2831 thresh = delalloc_to_write;
2832 wbc->nr_to_write = min_t(u64, delalloc_to_write,
2836 /* did the fill delalloc function already unlock and start
2842 * we've unlocked the page, so we can't update
2843 * the mapping's writeback index, just update
2846 wbc->nr_to_write -= nr_written;
2850 if (tree->ops && tree->ops->writepage_start_hook) {
2851 ret = tree->ops->writepage_start_hook(page, start,
2853 if (ret == -EAGAIN) {
2854 redirty_page_for_writepage(wbc, page);
2855 update_nr_written(page, wbc, nr_written);
2863 * we don't want to touch the inode after unlocking the page,
2864 * so we update the mapping writeback index now
2866 update_nr_written(page, wbc, nr_written + 1);
2869 if (last_byte <= start) {
2870 if (tree->ops && tree->ops->writepage_end_io_hook)
2871 tree->ops->writepage_end_io_hook(page, start,
2876 blocksize = inode->i_sb->s_blocksize;
2878 while (cur <= end) {
2879 if (cur >= last_byte) {
2880 if (tree->ops && tree->ops->writepage_end_io_hook)
2881 tree->ops->writepage_end_io_hook(page, cur,
2885 em = epd->get_extent(inode, page, pg_offset, cur,
2887 if (IS_ERR_OR_NULL(em)) {
2892 extent_offset = cur - em->start;
2893 BUG_ON(extent_map_end(em) <= cur);
2895 iosize = min(extent_map_end(em) - cur, end - cur + 1);
2896 iosize = (iosize + blocksize - 1) & ~((u64)blocksize - 1);
2897 sector = (em->block_start + extent_offset) >> 9;
2899 block_start = em->block_start;
2900 compressed = test_bit(EXTENT_FLAG_COMPRESSED, &em->flags);
2901 free_extent_map(em);
2905 * compressed and inline extents are written through other
2908 if (compressed || block_start == EXTENT_MAP_HOLE ||
2909 block_start == EXTENT_MAP_INLINE) {
2911 * end_io notification does not happen here for
2912 * compressed extents
2914 if (!compressed && tree->ops &&
2915 tree->ops->writepage_end_io_hook)
2916 tree->ops->writepage_end_io_hook(page, cur,
2919 else if (compressed) {
2920 /* we don't want to end_page_writeback on
2921 * a compressed extent. this happens
2928 pg_offset += iosize;
2931 /* leave this out until we have a page_mkwrite call */
2932 if (0 && !test_range_bit(tree, cur, cur + iosize - 1,
2933 EXTENT_DIRTY, 0, NULL)) {
2935 pg_offset += iosize;
2939 if (tree->ops && tree->ops->writepage_io_hook) {
2940 ret = tree->ops->writepage_io_hook(page, cur,
2948 unsigned long max_nr = end_index + 1;
2950 set_range_writeback(tree, cur, cur + iosize - 1);
2951 if (!PageWriteback(page)) {
2952 printk(KERN_ERR "btrfs warning page %lu not "
2953 "writeback, cur %llu end %llu\n",
2954 page->index, (unsigned long long)cur,
2955 (unsigned long long)end);
2958 ret = submit_extent_page(write_flags, tree, page,
2959 sector, iosize, pg_offset,
2960 bdev, &epd->bio, max_nr,
2961 end_bio_extent_writepage,
2967 pg_offset += iosize;
2972 /* make sure the mapping tag for page dirty gets cleared */
2973 set_page_writeback(page);
2974 end_page_writeback(page);
2980 /* drop our reference on any cached states */
2981 free_extent_state(cached_state);
2986 * write_cache_pages - walk the list of dirty pages of the given address space and write all of them.
2987 * @mapping: address space structure to write
2988 * @wbc: subtract the number of written pages from *@wbc->nr_to_write
2989 * @writepage: function called for each page
2990 * @data: data passed to writepage function
2992 * If a page is already under I/O, write_cache_pages() skips it, even
2993 * if it's dirty. This is desirable behaviour for memory-cleaning writeback,
2994 * but it is INCORRECT for data-integrity system calls such as fsync(). fsync()
2995 * and msync() need to guarantee that all the data which was dirty at the time
2996 * the call was made get new I/O started against them. If wbc->sync_mode is
2997 * WB_SYNC_ALL then we were called for data integrity and we must wait for
2998 * existing IO to complete.
3000 static int extent_write_cache_pages(struct extent_io_tree *tree,
3001 struct address_space *mapping,
3002 struct writeback_control *wbc,
3003 writepage_t writepage, void *data,
3004 void (*flush_fn)(void *))
3008 int nr_to_write_done = 0;
3009 struct pagevec pvec;
3012 pgoff_t end; /* Inclusive */
3016 pagevec_init(&pvec, 0);
3017 if (wbc->range_cyclic) {
3018 index = mapping->writeback_index; /* Start from prev offset */
3021 index = wbc->range_start >> PAGE_CACHE_SHIFT;
3022 end = wbc->range_end >> PAGE_CACHE_SHIFT;
3025 if (wbc->sync_mode == WB_SYNC_ALL)
3026 tag = PAGECACHE_TAG_TOWRITE;
3028 tag = PAGECACHE_TAG_DIRTY;
3030 if (wbc->sync_mode == WB_SYNC_ALL)
3031 tag_pages_for_writeback(mapping, index, end);
3032 while (!done && !nr_to_write_done && (index <= end) &&
3033 (nr_pages = pagevec_lookup_tag(&pvec, mapping, &index, tag,
3034 min(end - index, (pgoff_t)PAGEVEC_SIZE-1) + 1))) {
3038 for (i = 0; i < nr_pages; i++) {
3039 struct page *page = pvec.pages[i];
3042 * At this point we hold neither mapping->tree_lock nor
3043 * lock on the page itself: the page may be truncated or
3044 * invalidated (changing page->mapping to NULL), or even
3045 * swizzled back from swapper_space to tmpfs file
3049 tree->ops->write_cache_pages_lock_hook) {
3050 tree->ops->write_cache_pages_lock_hook(page,
3053 if (!trylock_page(page)) {
3059 if (unlikely(page->mapping != mapping)) {
3064 if (!wbc->range_cyclic && page->index > end) {
3070 if (wbc->sync_mode != WB_SYNC_NONE) {
3071 if (PageWriteback(page))
3073 wait_on_page_writeback(page);
3076 if (PageWriteback(page) ||
3077 !clear_page_dirty_for_io(page)) {
3082 ret = (*writepage)(page, wbc, data);
3084 if (unlikely(ret == AOP_WRITEPAGE_ACTIVATE)) {
3092 * the filesystem may choose to bump up nr_to_write.
3093 * We have to make sure to honor the new nr_to_write
3096 nr_to_write_done = wbc->nr_to_write <= 0;
3098 pagevec_release(&pvec);
3101 if (!scanned && !done) {
3103 * We hit the last page and there is more work to be done: wrap
3104 * back to the start of the file
3113 static void flush_epd_write_bio(struct extent_page_data *epd)
3117 submit_one_bio(WRITE_SYNC, epd->bio, 0, 0);
3119 submit_one_bio(WRITE, epd->bio, 0, 0);
3124 static noinline void flush_write_bio(void *data)
3126 struct extent_page_data *epd = data;
3127 flush_epd_write_bio(epd);
3130 int extent_write_full_page(struct extent_io_tree *tree, struct page *page,
3131 get_extent_t *get_extent,
3132 struct writeback_control *wbc)
3135 struct extent_page_data epd = {
3138 .get_extent = get_extent,
3140 .sync_io = wbc->sync_mode == WB_SYNC_ALL,
3143 ret = __extent_writepage(page, wbc, &epd);
3145 flush_epd_write_bio(&epd);
3149 int extent_write_locked_range(struct extent_io_tree *tree, struct inode *inode,
3150 u64 start, u64 end, get_extent_t *get_extent,
3154 struct address_space *mapping = inode->i_mapping;
3156 unsigned long nr_pages = (end - start + PAGE_CACHE_SIZE) >>
3159 struct extent_page_data epd = {
3162 .get_extent = get_extent,
3164 .sync_io = mode == WB_SYNC_ALL,
3166 struct writeback_control wbc_writepages = {
3168 .nr_to_write = nr_pages * 2,
3169 .range_start = start,
3170 .range_end = end + 1,
3173 while (start <= end) {
3174 page = find_get_page(mapping, start >> PAGE_CACHE_SHIFT);
3175 if (clear_page_dirty_for_io(page))
3176 ret = __extent_writepage(page, &wbc_writepages, &epd);
3178 if (tree->ops && tree->ops->writepage_end_io_hook)
3179 tree->ops->writepage_end_io_hook(page, start,
3180 start + PAGE_CACHE_SIZE - 1,
3184 page_cache_release(page);
3185 start += PAGE_CACHE_SIZE;
3188 flush_epd_write_bio(&epd);
3192 int extent_writepages(struct extent_io_tree *tree,
3193 struct address_space *mapping,
3194 get_extent_t *get_extent,
3195 struct writeback_control *wbc)
3198 struct extent_page_data epd = {
3201 .get_extent = get_extent,
3203 .sync_io = wbc->sync_mode == WB_SYNC_ALL,
3206 ret = extent_write_cache_pages(tree, mapping, wbc,
3207 __extent_writepage, &epd,
3209 flush_epd_write_bio(&epd);
3213 int extent_readpages(struct extent_io_tree *tree,
3214 struct address_space *mapping,
3215 struct list_head *pages, unsigned nr_pages,
3216 get_extent_t get_extent)
3218 struct bio *bio = NULL;
3220 unsigned long bio_flags = 0;
3222 for (page_idx = 0; page_idx < nr_pages; page_idx++) {
3223 struct page *page = list_entry(pages->prev, struct page, lru);
3225 prefetchw(&page->flags);
3226 list_del(&page->lru);
3227 if (!add_to_page_cache_lru(page, mapping,
3228 page->index, GFP_NOFS)) {
3229 __extent_read_full_page(tree, page, get_extent,
3230 &bio, 0, &bio_flags);
3232 page_cache_release(page);
3234 BUG_ON(!list_empty(pages));
3236 submit_one_bio(READ, bio, 0, bio_flags);
3241 * basic invalidatepage code, this waits on any locked or writeback
3242 * ranges corresponding to the page, and then deletes any extent state
3243 * records from the tree
3245 int extent_invalidatepage(struct extent_io_tree *tree,
3246 struct page *page, unsigned long offset)
3248 struct extent_state *cached_state = NULL;
3249 u64 start = ((u64)page->index << PAGE_CACHE_SHIFT);
3250 u64 end = start + PAGE_CACHE_SIZE - 1;
3251 size_t blocksize = page->mapping->host->i_sb->s_blocksize;
3253 start += (offset + blocksize - 1) & ~(blocksize - 1);
3257 lock_extent_bits(tree, start, end, 0, &cached_state, GFP_NOFS);
3258 wait_on_page_writeback(page);
3259 clear_extent_bit(tree, start, end,
3260 EXTENT_LOCKED | EXTENT_DIRTY | EXTENT_DELALLOC |
3261 EXTENT_DO_ACCOUNTING,
3262 1, 1, &cached_state, GFP_NOFS);
3267 * a helper for releasepage, this tests for areas of the page that
3268 * are locked or under IO and drops the related state bits if it is safe
3271 int try_release_extent_state(struct extent_map_tree *map,
3272 struct extent_io_tree *tree, struct page *page,
3275 u64 start = (u64)page->index << PAGE_CACHE_SHIFT;
3276 u64 end = start + PAGE_CACHE_SIZE - 1;
3279 if (test_range_bit(tree, start, end,
3280 EXTENT_IOBITS, 0, NULL))
3283 if ((mask & GFP_NOFS) == GFP_NOFS)
3286 * at this point we can safely clear everything except the
3287 * locked bit and the nodatasum bit
3289 ret = clear_extent_bit(tree, start, end,
3290 ~(EXTENT_LOCKED | EXTENT_NODATASUM),
3293 /* if clear_extent_bit failed for enomem reasons,
3294 * we can't allow the release to continue.
3305 * a helper for releasepage. As long as there are no locked extents
3306 * in the range corresponding to the page, both state records and extent
3307 * map records are removed
3309 int try_release_extent_mapping(struct extent_map_tree *map,
3310 struct extent_io_tree *tree, struct page *page,
3313 struct extent_map *em;
3314 u64 start = (u64)page->index << PAGE_CACHE_SHIFT;
3315 u64 end = start + PAGE_CACHE_SIZE - 1;
3317 if ((mask & __GFP_WAIT) &&
3318 page->mapping->host->i_size > 16 * 1024 * 1024) {
3320 while (start <= end) {
3321 len = end - start + 1;
3322 write_lock(&map->lock);
3323 em = lookup_extent_mapping(map, start, len);
3324 if (IS_ERR_OR_NULL(em)) {
3325 write_unlock(&map->lock);
3328 if (test_bit(EXTENT_FLAG_PINNED, &em->flags) ||
3329 em->start != start) {
3330 write_unlock(&map->lock);
3331 free_extent_map(em);
3334 if (!test_range_bit(tree, em->start,
3335 extent_map_end(em) - 1,
3336 EXTENT_LOCKED | EXTENT_WRITEBACK,
3338 remove_extent_mapping(map, em);
3339 /* once for the rb tree */
3340 free_extent_map(em);
3342 start = extent_map_end(em);
3343 write_unlock(&map->lock);
3346 free_extent_map(em);
3349 return try_release_extent_state(map, tree, page, mask);
3353 * helper function for fiemap, which doesn't want to see any holes.
3354 * This maps until we find something past 'last'
3356 static struct extent_map *get_extent_skip_holes(struct inode *inode,
3359 get_extent_t *get_extent)
3361 u64 sectorsize = BTRFS_I(inode)->root->sectorsize;
3362 struct extent_map *em;
3369 len = last - offset;
3372 len = (len + sectorsize - 1) & ~(sectorsize - 1);
3373 em = get_extent(inode, NULL, 0, offset, len, 0);
3374 if (IS_ERR_OR_NULL(em))
3377 /* if this isn't a hole return it */
3378 if (!test_bit(EXTENT_FLAG_VACANCY, &em->flags) &&
3379 em->block_start != EXTENT_MAP_HOLE) {
3383 /* this is a hole, advance to the next extent */
3384 offset = extent_map_end(em);
3385 free_extent_map(em);
3392 int extent_fiemap(struct inode *inode, struct fiemap_extent_info *fieinfo,
3393 __u64 start, __u64 len, get_extent_t *get_extent)
3397 u64 max = start + len;
3401 u64 last_for_get_extent = 0;
3403 u64 isize = i_size_read(inode);
3404 struct btrfs_key found_key;
3405 struct extent_map *em = NULL;
3406 struct extent_state *cached_state = NULL;
3407 struct btrfs_path *path;
3408 struct btrfs_file_extent_item *item;
3413 unsigned long emflags;
3418 path = btrfs_alloc_path();
3421 path->leave_spinning = 1;
3423 start = ALIGN(start, BTRFS_I(inode)->root->sectorsize);
3424 len = ALIGN(len, BTRFS_I(inode)->root->sectorsize);
3427 * lookup the last file extent. We're not using i_size here
3428 * because there might be preallocation past i_size
3430 ret = btrfs_lookup_file_extent(NULL, BTRFS_I(inode)->root,
3431 path, btrfs_ino(inode), -1, 0);
3433 btrfs_free_path(path);
3438 item = btrfs_item_ptr(path->nodes[0], path->slots[0],
3439 struct btrfs_file_extent_item);
3440 btrfs_item_key_to_cpu(path->nodes[0], &found_key, path->slots[0]);
3441 found_type = btrfs_key_type(&found_key);
3443 /* No extents, but there might be delalloc bits */
3444 if (found_key.objectid != btrfs_ino(inode) ||
3445 found_type != BTRFS_EXTENT_DATA_KEY) {
3446 /* have to trust i_size as the end */
3448 last_for_get_extent = isize;
3451 * remember the start of the last extent. There are a
3452 * bunch of different factors that go into the length of the
3453 * extent, so its much less complex to remember where it started
3455 last = found_key.offset;
3456 last_for_get_extent = last + 1;
3458 btrfs_free_path(path);
3461 * we might have some extents allocated but more delalloc past those
3462 * extents. so, we trust isize unless the start of the last extent is
3467 last_for_get_extent = isize;
3470 lock_extent_bits(&BTRFS_I(inode)->io_tree, start, start + len, 0,
3471 &cached_state, GFP_NOFS);
3473 em = get_extent_skip_holes(inode, start, last_for_get_extent,
3483 u64 offset_in_extent;
3485 /* break if the extent we found is outside the range */
3486 if (em->start >= max || extent_map_end(em) < off)
3490 * get_extent may return an extent that starts before our
3491 * requested range. We have to make sure the ranges
3492 * we return to fiemap always move forward and don't
3493 * overlap, so adjust the offsets here
3495 em_start = max(em->start, off);
3498 * record the offset from the start of the extent
3499 * for adjusting the disk offset below
3501 offset_in_extent = em_start - em->start;
3502 em_end = extent_map_end(em);
3503 em_len = em_end - em_start;
3504 emflags = em->flags;
3509 * bump off for our next call to get_extent
3511 off = extent_map_end(em);
3515 if (em->block_start == EXTENT_MAP_LAST_BYTE) {
3517 flags |= FIEMAP_EXTENT_LAST;
3518 } else if (em->block_start == EXTENT_MAP_INLINE) {
3519 flags |= (FIEMAP_EXTENT_DATA_INLINE |
3520 FIEMAP_EXTENT_NOT_ALIGNED);
3521 } else if (em->block_start == EXTENT_MAP_DELALLOC) {
3522 flags |= (FIEMAP_EXTENT_DELALLOC |
3523 FIEMAP_EXTENT_UNKNOWN);
3525 disko = em->block_start + offset_in_extent;
3527 if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags))
3528 flags |= FIEMAP_EXTENT_ENCODED;
3530 free_extent_map(em);
3532 if ((em_start >= last) || em_len == (u64)-1 ||
3533 (last == (u64)-1 && isize <= em_end)) {
3534 flags |= FIEMAP_EXTENT_LAST;
3538 /* now scan forward to see if this is really the last extent. */
3539 em = get_extent_skip_holes(inode, off, last_for_get_extent,
3546 flags |= FIEMAP_EXTENT_LAST;
3549 ret = fiemap_fill_next_extent(fieinfo, em_start, disko,
3555 free_extent_map(em);
3557 unlock_extent_cached(&BTRFS_I(inode)->io_tree, start, start + len,
3558 &cached_state, GFP_NOFS);
3562 inline struct page *extent_buffer_page(struct extent_buffer *eb,
3566 struct address_space *mapping;
3569 return eb->first_page;
3570 i += eb->start >> PAGE_CACHE_SHIFT;
3571 mapping = eb->first_page->mapping;
3576 * extent_buffer_page is only called after pinning the page
3577 * by increasing the reference count. So we know the page must
3578 * be in the radix tree.
3581 p = radix_tree_lookup(&mapping->page_tree, i);
3587 inline unsigned long num_extent_pages(u64 start, u64 len)
3589 return ((start + len + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT) -
3590 (start >> PAGE_CACHE_SHIFT);
3593 static struct extent_buffer *__alloc_extent_buffer(struct extent_io_tree *tree,
3598 struct extent_buffer *eb = NULL;
3600 unsigned long flags;
3603 eb = kmem_cache_zalloc(extent_buffer_cache, mask);
3608 rwlock_init(&eb->lock);
3609 atomic_set(&eb->write_locks, 0);
3610 atomic_set(&eb->read_locks, 0);
3611 atomic_set(&eb->blocking_readers, 0);
3612 atomic_set(&eb->blocking_writers, 0);
3613 atomic_set(&eb->spinning_readers, 0);
3614 atomic_set(&eb->spinning_writers, 0);
3615 init_waitqueue_head(&eb->write_lock_wq);
3616 init_waitqueue_head(&eb->read_lock_wq);
3619 spin_lock_irqsave(&leak_lock, flags);
3620 list_add(&eb->leak_list, &buffers);
3621 spin_unlock_irqrestore(&leak_lock, flags);
3623 atomic_set(&eb->refs, 1);
3628 static void __free_extent_buffer(struct extent_buffer *eb)
3631 unsigned long flags;
3632 spin_lock_irqsave(&leak_lock, flags);
3633 list_del(&eb->leak_list);
3634 spin_unlock_irqrestore(&leak_lock, flags);
3636 kmem_cache_free(extent_buffer_cache, eb);
3640 * Helper for releasing extent buffer page.
3642 static void btrfs_release_extent_buffer_page(struct extent_buffer *eb,
3643 unsigned long start_idx)
3645 unsigned long index;
3648 if (!eb->first_page)
3651 index = num_extent_pages(eb->start, eb->len);
3652 if (start_idx >= index)
3657 page = extent_buffer_page(eb, index);
3659 page_cache_release(page);
3660 } while (index != start_idx);
3664 * Helper for releasing the extent buffer.
3666 static inline void btrfs_release_extent_buffer(struct extent_buffer *eb)
3668 btrfs_release_extent_buffer_page(eb, 0);
3669 __free_extent_buffer(eb);
3672 struct extent_buffer *alloc_extent_buffer(struct extent_io_tree *tree,
3673 u64 start, unsigned long len,
3676 unsigned long num_pages = num_extent_pages(start, len);
3678 unsigned long index = start >> PAGE_CACHE_SHIFT;
3679 struct extent_buffer *eb;
3680 struct extent_buffer *exists = NULL;
3682 struct address_space *mapping = tree->mapping;
3687 eb = radix_tree_lookup(&tree->buffer, start >> PAGE_CACHE_SHIFT);
3688 if (eb && atomic_inc_not_zero(&eb->refs)) {
3690 mark_page_accessed(eb->first_page);
3695 eb = __alloc_extent_buffer(tree, start, len, GFP_NOFS);
3700 eb->first_page = page0;
3703 page_cache_get(page0);
3704 mark_page_accessed(page0);
3705 set_page_extent_mapped(page0);
3706 set_page_extent_head(page0, len);
3707 uptodate = PageUptodate(page0);
3711 for (; i < num_pages; i++, index++) {
3712 p = find_or_create_page(mapping, index, GFP_NOFS);
3717 set_page_extent_mapped(p);
3718 mark_page_accessed(p);
3721 set_page_extent_head(p, len);
3723 set_page_private(p, EXTENT_PAGE_PRIVATE);
3725 if (!PageUptodate(p))
3729 * see below about how we avoid a nasty race with release page
3730 * and why we unlock later
3736 set_bit(EXTENT_BUFFER_UPTODATE, &eb->bflags);
3738 ret = radix_tree_preload(GFP_NOFS & ~__GFP_HIGHMEM);
3742 spin_lock(&tree->buffer_lock);
3743 ret = radix_tree_insert(&tree->buffer, start >> PAGE_CACHE_SHIFT, eb);
3744 if (ret == -EEXIST) {
3745 exists = radix_tree_lookup(&tree->buffer,
3746 start >> PAGE_CACHE_SHIFT);
3747 /* add one reference for the caller */
3748 atomic_inc(&exists->refs);
3749 spin_unlock(&tree->buffer_lock);
3750 radix_tree_preload_end();
3753 /* add one reference for the tree */
3754 atomic_inc(&eb->refs);
3755 spin_unlock(&tree->buffer_lock);
3756 radix_tree_preload_end();
3759 * there is a race where release page may have
3760 * tried to find this extent buffer in the radix
3761 * but failed. It will tell the VM it is safe to
3762 * reclaim the, and it will clear the page private bit.
3763 * We must make sure to set the page private bit properly
3764 * after the extent buffer is in the radix tree so
3765 * it doesn't get lost
3767 set_page_extent_mapped(eb->first_page);
3768 set_page_extent_head(eb->first_page, eb->len);
3770 unlock_page(eb->first_page);
3774 if (eb->first_page && !page0)
3775 unlock_page(eb->first_page);
3777 if (!atomic_dec_and_test(&eb->refs))
3779 btrfs_release_extent_buffer(eb);
3783 struct extent_buffer *find_extent_buffer(struct extent_io_tree *tree,
3784 u64 start, unsigned long len)
3786 struct extent_buffer *eb;
3789 eb = radix_tree_lookup(&tree->buffer, start >> PAGE_CACHE_SHIFT);
3790 if (eb && atomic_inc_not_zero(&eb->refs)) {
3792 mark_page_accessed(eb->first_page);
3800 void free_extent_buffer(struct extent_buffer *eb)
3805 if (!atomic_dec_and_test(&eb->refs))
3811 int clear_extent_buffer_dirty(struct extent_io_tree *tree,
3812 struct extent_buffer *eb)
3815 unsigned long num_pages;
3818 num_pages = num_extent_pages(eb->start, eb->len);
3820 for (i = 0; i < num_pages; i++) {
3821 page = extent_buffer_page(eb, i);
3822 if (!PageDirty(page))
3826 WARN_ON(!PagePrivate(page));
3828 set_page_extent_mapped(page);
3830 set_page_extent_head(page, eb->len);
3832 clear_page_dirty_for_io(page);
3833 spin_lock_irq(&page->mapping->tree_lock);
3834 if (!PageDirty(page)) {
3835 radix_tree_tag_clear(&page->mapping->page_tree,
3837 PAGECACHE_TAG_DIRTY);
3839 spin_unlock_irq(&page->mapping->tree_lock);
3840 ClearPageError(page);
3846 int set_extent_buffer_dirty(struct extent_io_tree *tree,
3847 struct extent_buffer *eb)
3850 unsigned long num_pages;
3853 was_dirty = test_and_set_bit(EXTENT_BUFFER_DIRTY, &eb->bflags);
3854 num_pages = num_extent_pages(eb->start, eb->len);
3855 for (i = 0; i < num_pages; i++)
3856 __set_page_dirty_nobuffers(extent_buffer_page(eb, i));
3860 static int __eb_straddles_pages(u64 start, u64 len)
3862 if (len < PAGE_CACHE_SIZE)
3864 if (start & (PAGE_CACHE_SIZE - 1))
3866 if ((start + len) & (PAGE_CACHE_SIZE - 1))
3871 static int eb_straddles_pages(struct extent_buffer *eb)
3873 return __eb_straddles_pages(eb->start, eb->len);
3876 int clear_extent_buffer_uptodate(struct extent_io_tree *tree,
3877 struct extent_buffer *eb,
3878 struct extent_state **cached_state)
3882 unsigned long num_pages;
3884 num_pages = num_extent_pages(eb->start, eb->len);
3885 clear_bit(EXTENT_BUFFER_UPTODATE, &eb->bflags);
3887 if (eb_straddles_pages(eb)) {
3888 clear_extent_uptodate(tree, eb->start, eb->start + eb->len - 1,
3889 cached_state, GFP_NOFS);
3891 for (i = 0; i < num_pages; i++) {
3892 page = extent_buffer_page(eb, i);
3894 ClearPageUptodate(page);
3899 int set_extent_buffer_uptodate(struct extent_io_tree *tree,
3900 struct extent_buffer *eb)
3904 unsigned long num_pages;
3906 num_pages = num_extent_pages(eb->start, eb->len);
3908 if (eb_straddles_pages(eb)) {
3909 set_extent_uptodate(tree, eb->start, eb->start + eb->len - 1,
3912 for (i = 0; i < num_pages; i++) {
3913 page = extent_buffer_page(eb, i);
3914 if ((i == 0 && (eb->start & (PAGE_CACHE_SIZE - 1))) ||
3915 ((i == num_pages - 1) &&
3916 ((eb->start + eb->len) & (PAGE_CACHE_SIZE - 1)))) {
3917 check_page_uptodate(tree, page);
3920 SetPageUptodate(page);
3925 int extent_range_uptodate(struct extent_io_tree *tree,
3930 int pg_uptodate = 1;
3932 unsigned long index;
3934 if (__eb_straddles_pages(start, end - start + 1)) {
3935 ret = test_range_bit(tree, start, end,
3936 EXTENT_UPTODATE, 1, NULL);
3940 while (start <= end) {
3941 index = start >> PAGE_CACHE_SHIFT;
3942 page = find_get_page(tree->mapping, index);
3943 uptodate = PageUptodate(page);
3944 page_cache_release(page);
3949 start += PAGE_CACHE_SIZE;
3954 int extent_buffer_uptodate(struct extent_io_tree *tree,
3955 struct extent_buffer *eb,
3956 struct extent_state *cached_state)
3959 unsigned long num_pages;
3962 int pg_uptodate = 1;
3964 if (test_bit(EXTENT_BUFFER_UPTODATE, &eb->bflags))
3967 if (eb_straddles_pages(eb)) {
3968 ret = test_range_bit(tree, eb->start, eb->start + eb->len - 1,
3969 EXTENT_UPTODATE, 1, cached_state);
3974 num_pages = num_extent_pages(eb->start, eb->len);
3975 for (i = 0; i < num_pages; i++) {
3976 page = extent_buffer_page(eb, i);
3977 if (!PageUptodate(page)) {
3985 int read_extent_buffer_pages(struct extent_io_tree *tree,
3986 struct extent_buffer *eb, u64 start, int wait,
3987 get_extent_t *get_extent, int mirror_num)
3990 unsigned long start_i;
3994 int locked_pages = 0;
3995 int all_uptodate = 1;
3996 int inc_all_pages = 0;
3997 unsigned long num_pages;
3998 struct bio *bio = NULL;
3999 unsigned long bio_flags = 0;
4001 if (test_bit(EXTENT_BUFFER_UPTODATE, &eb->bflags))
4004 if (eb_straddles_pages(eb)) {
4005 if (test_range_bit(tree, eb->start, eb->start + eb->len - 1,
4006 EXTENT_UPTODATE, 1, NULL)) {
4012 WARN_ON(start < eb->start);
4013 start_i = (start >> PAGE_CACHE_SHIFT) -
4014 (eb->start >> PAGE_CACHE_SHIFT);
4019 num_pages = num_extent_pages(eb->start, eb->len);
4020 for (i = start_i; i < num_pages; i++) {
4021 page = extent_buffer_page(eb, i);
4022 if (wait == WAIT_NONE) {
4023 if (!trylock_page(page))
4029 if (!PageUptodate(page))
4034 set_bit(EXTENT_BUFFER_UPTODATE, &eb->bflags);
4038 for (i = start_i; i < num_pages; i++) {
4039 page = extent_buffer_page(eb, i);
4041 WARN_ON(!PagePrivate(page));
4043 set_page_extent_mapped(page);
4045 set_page_extent_head(page, eb->len);
4048 page_cache_get(page);
4049 if (!PageUptodate(page)) {
4052 ClearPageError(page);
4053 err = __extent_read_full_page(tree, page,
4055 mirror_num, &bio_flags);
4064 submit_one_bio(READ, bio, mirror_num, bio_flags);
4066 if (ret || wait != WAIT_COMPLETE)
4069 for (i = start_i; i < num_pages; i++) {
4070 page = extent_buffer_page(eb, i);
4071 wait_on_page_locked(page);
4072 if (!PageUptodate(page))
4077 set_bit(EXTENT_BUFFER_UPTODATE, &eb->bflags);
4082 while (locked_pages > 0) {
4083 page = extent_buffer_page(eb, i);
4091 void read_extent_buffer(struct extent_buffer *eb, void *dstv,
4092 unsigned long start,
4099 char *dst = (char *)dstv;
4100 size_t start_offset = eb->start & ((u64)PAGE_CACHE_SIZE - 1);
4101 unsigned long i = (start_offset + start) >> PAGE_CACHE_SHIFT;
4103 WARN_ON(start > eb->len);
4104 WARN_ON(start + len > eb->start + eb->len);
4106 offset = (start_offset + start) & ((unsigned long)PAGE_CACHE_SIZE - 1);
4109 page = extent_buffer_page(eb, i);
4111 cur = min(len, (PAGE_CACHE_SIZE - offset));
4112 kaddr = page_address(page);
4113 memcpy(dst, kaddr + offset, cur);
4122 int map_private_extent_buffer(struct extent_buffer *eb, unsigned long start,
4123 unsigned long min_len, char **map,
4124 unsigned long *map_start,
4125 unsigned long *map_len)
4127 size_t offset = start & (PAGE_CACHE_SIZE - 1);
4130 size_t start_offset = eb->start & ((u64)PAGE_CACHE_SIZE - 1);
4131 unsigned long i = (start_offset + start) >> PAGE_CACHE_SHIFT;
4132 unsigned long end_i = (start_offset + start + min_len - 1) >>
4139 offset = start_offset;
4143 *map_start = ((u64)i << PAGE_CACHE_SHIFT) - start_offset;
4146 if (start + min_len > eb->len) {
4147 printk(KERN_ERR "btrfs bad mapping eb start %llu len %lu, "
4148 "wanted %lu %lu\n", (unsigned long long)eb->start,
4149 eb->len, start, min_len);
4154 p = extent_buffer_page(eb, i);
4155 kaddr = page_address(p);
4156 *map = kaddr + offset;
4157 *map_len = PAGE_CACHE_SIZE - offset;
4161 int memcmp_extent_buffer(struct extent_buffer *eb, const void *ptrv,
4162 unsigned long start,
4169 char *ptr = (char *)ptrv;
4170 size_t start_offset = eb->start & ((u64)PAGE_CACHE_SIZE - 1);
4171 unsigned long i = (start_offset + start) >> PAGE_CACHE_SHIFT;
4174 WARN_ON(start > eb->len);
4175 WARN_ON(start + len > eb->start + eb->len);
4177 offset = (start_offset + start) & ((unsigned long)PAGE_CACHE_SIZE - 1);
4180 page = extent_buffer_page(eb, i);
4182 cur = min(len, (PAGE_CACHE_SIZE - offset));
4184 kaddr = page_address(page);
4185 ret = memcmp(ptr, kaddr + offset, cur);
4197 void write_extent_buffer(struct extent_buffer *eb, const void *srcv,
4198 unsigned long start, unsigned long len)
4204 char *src = (char *)srcv;
4205 size_t start_offset = eb->start & ((u64)PAGE_CACHE_SIZE - 1);
4206 unsigned long i = (start_offset + start) >> PAGE_CACHE_SHIFT;
4208 WARN_ON(start > eb->len);
4209 WARN_ON(start + len > eb->start + eb->len);
4211 offset = (start_offset + start) & ((unsigned long)PAGE_CACHE_SIZE - 1);
4214 page = extent_buffer_page(eb, i);
4215 WARN_ON(!PageUptodate(page));
4217 cur = min(len, PAGE_CACHE_SIZE - offset);
4218 kaddr = page_address(page);
4219 memcpy(kaddr + offset, src, cur);
4228 void memset_extent_buffer(struct extent_buffer *eb, char c,
4229 unsigned long start, unsigned long len)
4235 size_t start_offset = eb->start & ((u64)PAGE_CACHE_SIZE - 1);
4236 unsigned long i = (start_offset + start) >> PAGE_CACHE_SHIFT;
4238 WARN_ON(start > eb->len);
4239 WARN_ON(start + len > eb->start + eb->len);
4241 offset = (start_offset + start) & ((unsigned long)PAGE_CACHE_SIZE - 1);
4244 page = extent_buffer_page(eb, i);
4245 WARN_ON(!PageUptodate(page));
4247 cur = min(len, PAGE_CACHE_SIZE - offset);
4248 kaddr = page_address(page);
4249 memset(kaddr + offset, c, cur);
4257 void copy_extent_buffer(struct extent_buffer *dst, struct extent_buffer *src,
4258 unsigned long dst_offset, unsigned long src_offset,
4261 u64 dst_len = dst->len;
4266 size_t start_offset = dst->start & ((u64)PAGE_CACHE_SIZE - 1);
4267 unsigned long i = (start_offset + dst_offset) >> PAGE_CACHE_SHIFT;
4269 WARN_ON(src->len != dst_len);
4271 offset = (start_offset + dst_offset) &
4272 ((unsigned long)PAGE_CACHE_SIZE - 1);
4275 page = extent_buffer_page(dst, i);
4276 WARN_ON(!PageUptodate(page));
4278 cur = min(len, (unsigned long)(PAGE_CACHE_SIZE - offset));
4280 kaddr = page_address(page);
4281 read_extent_buffer(src, kaddr + offset, src_offset, cur);
4290 static void move_pages(struct page *dst_page, struct page *src_page,
4291 unsigned long dst_off, unsigned long src_off,
4294 char *dst_kaddr = page_address(dst_page);
4295 if (dst_page == src_page) {
4296 memmove(dst_kaddr + dst_off, dst_kaddr + src_off, len);
4298 char *src_kaddr = page_address(src_page);
4299 char *p = dst_kaddr + dst_off + len;
4300 char *s = src_kaddr + src_off + len;
4307 static inline bool areas_overlap(unsigned long src, unsigned long dst, unsigned long len)
4309 unsigned long distance = (src > dst) ? src - dst : dst - src;
4310 return distance < len;
4313 static void copy_pages(struct page *dst_page, struct page *src_page,
4314 unsigned long dst_off, unsigned long src_off,
4317 char *dst_kaddr = page_address(dst_page);
4320 if (dst_page != src_page) {
4321 src_kaddr = page_address(src_page);
4323 src_kaddr = dst_kaddr;
4324 BUG_ON(areas_overlap(src_off, dst_off, len));
4327 memcpy(dst_kaddr + dst_off, src_kaddr + src_off, len);
4330 void memcpy_extent_buffer(struct extent_buffer *dst, unsigned long dst_offset,
4331 unsigned long src_offset, unsigned long len)
4334 size_t dst_off_in_page;
4335 size_t src_off_in_page;
4336 size_t start_offset = dst->start & ((u64)PAGE_CACHE_SIZE - 1);
4337 unsigned long dst_i;
4338 unsigned long src_i;
4340 if (src_offset + len > dst->len) {
4341 printk(KERN_ERR "btrfs memmove bogus src_offset %lu move "
4342 "len %lu dst len %lu\n", src_offset, len, dst->len);
4345 if (dst_offset + len > dst->len) {
4346 printk(KERN_ERR "btrfs memmove bogus dst_offset %lu move "
4347 "len %lu dst len %lu\n", dst_offset, len, dst->len);
4352 dst_off_in_page = (start_offset + dst_offset) &
4353 ((unsigned long)PAGE_CACHE_SIZE - 1);
4354 src_off_in_page = (start_offset + src_offset) &
4355 ((unsigned long)PAGE_CACHE_SIZE - 1);
4357 dst_i = (start_offset + dst_offset) >> PAGE_CACHE_SHIFT;
4358 src_i = (start_offset + src_offset) >> PAGE_CACHE_SHIFT;
4360 cur = min(len, (unsigned long)(PAGE_CACHE_SIZE -
4362 cur = min_t(unsigned long, cur,
4363 (unsigned long)(PAGE_CACHE_SIZE - dst_off_in_page));
4365 copy_pages(extent_buffer_page(dst, dst_i),
4366 extent_buffer_page(dst, src_i),
4367 dst_off_in_page, src_off_in_page, cur);
4375 void memmove_extent_buffer(struct extent_buffer *dst, unsigned long dst_offset,
4376 unsigned long src_offset, unsigned long len)
4379 size_t dst_off_in_page;
4380 size_t src_off_in_page;
4381 unsigned long dst_end = dst_offset + len - 1;
4382 unsigned long src_end = src_offset + len - 1;
4383 size_t start_offset = dst->start & ((u64)PAGE_CACHE_SIZE - 1);
4384 unsigned long dst_i;
4385 unsigned long src_i;
4387 if (src_offset + len > dst->len) {
4388 printk(KERN_ERR "btrfs memmove bogus src_offset %lu move "
4389 "len %lu len %lu\n", src_offset, len, dst->len);
4392 if (dst_offset + len > dst->len) {
4393 printk(KERN_ERR "btrfs memmove bogus dst_offset %lu move "
4394 "len %lu len %lu\n", dst_offset, len, dst->len);
4397 if (!areas_overlap(src_offset, dst_offset, len)) {
4398 memcpy_extent_buffer(dst, dst_offset, src_offset, len);
4402 dst_i = (start_offset + dst_end) >> PAGE_CACHE_SHIFT;
4403 src_i = (start_offset + src_end) >> PAGE_CACHE_SHIFT;
4405 dst_off_in_page = (start_offset + dst_end) &
4406 ((unsigned long)PAGE_CACHE_SIZE - 1);
4407 src_off_in_page = (start_offset + src_end) &
4408 ((unsigned long)PAGE_CACHE_SIZE - 1);
4410 cur = min_t(unsigned long, len, src_off_in_page + 1);
4411 cur = min(cur, dst_off_in_page + 1);
4412 move_pages(extent_buffer_page(dst, dst_i),
4413 extent_buffer_page(dst, src_i),
4414 dst_off_in_page - cur + 1,
4415 src_off_in_page - cur + 1, cur);
4423 static inline void btrfs_release_extent_buffer_rcu(struct rcu_head *head)
4425 struct extent_buffer *eb =
4426 container_of(head, struct extent_buffer, rcu_head);
4428 btrfs_release_extent_buffer(eb);
4431 int try_release_extent_buffer(struct extent_io_tree *tree, struct page *page)
4433 u64 start = page_offset(page);
4434 struct extent_buffer *eb;
4437 spin_lock(&tree->buffer_lock);
4438 eb = radix_tree_lookup(&tree->buffer, start >> PAGE_CACHE_SHIFT);
4440 spin_unlock(&tree->buffer_lock);
4444 if (test_bit(EXTENT_BUFFER_DIRTY, &eb->bflags)) {
4450 * set @eb->refs to 0 if it is already 1, and then release the @eb.
4453 if (atomic_cmpxchg(&eb->refs, 1, 0) != 1) {
4458 radix_tree_delete(&tree->buffer, start >> PAGE_CACHE_SHIFT);
4460 spin_unlock(&tree->buffer_lock);
4462 /* at this point we can safely release the extent buffer */
4463 if (atomic_read(&eb->refs) == 0)
4464 call_rcu(&eb->rcu_head, btrfs_release_extent_buffer_rcu);