1 #include <linux/bitops.h>
2 #include <linux/slab.h>
6 #include <linux/pagemap.h>
7 #include <linux/page-flags.h>
8 #include <linux/module.h>
9 #include <linux/spinlock.h>
10 #include <linux/blkdev.h>
11 #include <linux/swap.h>
12 #include <linux/version.h>
13 #include <linux/writeback.h>
14 #include <linux/pagevec.h>
15 #include "extent_io.h"
16 #include "extent_map.h"
18 /* temporary define until extent_map moves out of btrfs */
19 struct kmem_cache
*btrfs_cache_create(const char *name
, size_t size
,
20 unsigned long extra_flags
,
21 void (*ctor
)(void *, struct kmem_cache
*,
24 static struct kmem_cache
*extent_state_cache
;
25 static struct kmem_cache
*extent_buffer_cache
;
27 static LIST_HEAD(buffers
);
28 static LIST_HEAD(states
);
29 static spinlock_t leak_lock
= SPIN_LOCK_UNLOCKED
;
31 #define BUFFER_LRU_MAX 64
36 struct rb_node rb_node
;
39 struct extent_page_data
{
41 struct extent_io_tree
*tree
;
42 get_extent_t
*get_extent
;
45 int __init
extent_io_init(void)
47 extent_state_cache
= btrfs_cache_create("extent_state",
48 sizeof(struct extent_state
), 0,
50 if (!extent_state_cache
)
53 extent_buffer_cache
= btrfs_cache_create("extent_buffers",
54 sizeof(struct extent_buffer
), 0,
56 if (!extent_buffer_cache
)
57 goto free_state_cache
;
61 kmem_cache_destroy(extent_state_cache
);
65 void extent_io_exit(void)
67 struct extent_state
*state
;
68 struct extent_buffer
*eb
;
70 while (!list_empty(&states
)) {
71 state
= list_entry(states
.next
, struct extent_state
, leak_list
);
72 printk("state leak: start %Lu end %Lu state %lu in tree %p refs %d\n", state
->start
, state
->end
, state
->state
, state
->tree
, atomic_read(&state
->refs
));
73 list_del(&state
->leak_list
);
74 kmem_cache_free(extent_state_cache
, state
);
78 while (!list_empty(&buffers
)) {
79 eb
= list_entry(buffers
.next
, struct extent_buffer
, leak_list
);
80 printk("buffer leak start %Lu len %lu refs %d\n", eb
->start
, eb
->len
, atomic_read(&eb
->refs
));
81 list_del(&eb
->leak_list
);
82 kmem_cache_free(extent_buffer_cache
, eb
);
84 if (extent_state_cache
)
85 kmem_cache_destroy(extent_state_cache
);
86 if (extent_buffer_cache
)
87 kmem_cache_destroy(extent_buffer_cache
);
90 void extent_io_tree_init(struct extent_io_tree
*tree
,
91 struct address_space
*mapping
, gfp_t mask
)
93 tree
->state
.rb_node
= NULL
;
95 tree
->dirty_bytes
= 0;
96 spin_lock_init(&tree
->lock
);
97 spin_lock_init(&tree
->lru_lock
);
98 tree
->mapping
= mapping
;
99 INIT_LIST_HEAD(&tree
->buffer_lru
);
103 EXPORT_SYMBOL(extent_io_tree_init
);
105 void extent_io_tree_empty_lru(struct extent_io_tree
*tree
)
107 struct extent_buffer
*eb
;
108 while(!list_empty(&tree
->buffer_lru
)) {
109 eb
= list_entry(tree
->buffer_lru
.next
, struct extent_buffer
,
111 list_del_init(&eb
->lru
);
112 free_extent_buffer(eb
);
115 EXPORT_SYMBOL(extent_io_tree_empty_lru
);
117 struct extent_state
*alloc_extent_state(gfp_t mask
)
119 struct extent_state
*state
;
122 state
= kmem_cache_alloc(extent_state_cache
, mask
);
128 spin_lock_irqsave(&leak_lock
, flags
);
129 list_add(&state
->leak_list
, &states
);
130 spin_unlock_irqrestore(&leak_lock
, flags
);
132 atomic_set(&state
->refs
, 1);
133 init_waitqueue_head(&state
->wq
);
136 EXPORT_SYMBOL(alloc_extent_state
);
138 void free_extent_state(struct extent_state
*state
)
142 if (atomic_dec_and_test(&state
->refs
)) {
144 WARN_ON(state
->tree
);
145 spin_lock_irqsave(&leak_lock
, flags
);
146 list_del(&state
->leak_list
);
147 spin_unlock_irqrestore(&leak_lock
, flags
);
148 kmem_cache_free(extent_state_cache
, state
);
151 EXPORT_SYMBOL(free_extent_state
);
153 static struct rb_node
*tree_insert(struct rb_root
*root
, u64 offset
,
154 struct rb_node
*node
)
156 struct rb_node
** p
= &root
->rb_node
;
157 struct rb_node
* parent
= NULL
;
158 struct tree_entry
*entry
;
162 entry
= rb_entry(parent
, struct tree_entry
, rb_node
);
164 if (offset
< entry
->start
)
166 else if (offset
> entry
->end
)
172 entry
= rb_entry(node
, struct tree_entry
, rb_node
);
173 rb_link_node(node
, parent
, p
);
174 rb_insert_color(node
, root
);
178 static struct rb_node
*__etree_search(struct extent_io_tree
*tree
, u64 offset
,
179 struct rb_node
**prev_ret
,
180 struct rb_node
**next_ret
)
182 struct rb_root
*root
= &tree
->state
;
183 struct rb_node
* n
= root
->rb_node
;
184 struct rb_node
*prev
= NULL
;
185 struct rb_node
*orig_prev
= NULL
;
186 struct tree_entry
*entry
;
187 struct tree_entry
*prev_entry
= NULL
;
190 struct extent_state
*state
;
192 if (state
->start
<= offset
&& offset
<= state
->end
)
193 return &tree
->last
->rb_node
;
196 entry
= rb_entry(n
, struct tree_entry
, rb_node
);
200 if (offset
< entry
->start
)
202 else if (offset
> entry
->end
)
205 tree
->last
= rb_entry(n
, struct extent_state
, rb_node
);
212 while(prev
&& offset
> prev_entry
->end
) {
213 prev
= rb_next(prev
);
214 prev_entry
= rb_entry(prev
, struct tree_entry
, rb_node
);
221 prev_entry
= rb_entry(prev
, struct tree_entry
, rb_node
);
222 while(prev
&& offset
< prev_entry
->start
) {
223 prev
= rb_prev(prev
);
224 prev_entry
= rb_entry(prev
, struct tree_entry
, rb_node
);
231 static inline struct rb_node
*tree_search(struct extent_io_tree
*tree
,
234 struct rb_node
*prev
= NULL
;
237 ret
= __etree_search(tree
, offset
, &prev
, NULL
);
240 tree
->last
= rb_entry(prev
, struct extent_state
,
249 * utility function to look for merge candidates inside a given range.
250 * Any extents with matching state are merged together into a single
251 * extent in the tree. Extents with EXTENT_IO in their state field
252 * are not merged because the end_io handlers need to be able to do
253 * operations on them without sleeping (or doing allocations/splits).
255 * This should be called with the tree lock held.
257 static int merge_state(struct extent_io_tree
*tree
,
258 struct extent_state
*state
)
260 struct extent_state
*other
;
261 struct rb_node
*other_node
;
263 if (state
->state
& EXTENT_IOBITS
)
266 other_node
= rb_prev(&state
->rb_node
);
268 other
= rb_entry(other_node
, struct extent_state
, rb_node
);
269 if (other
->end
== state
->start
- 1 &&
270 other
->state
== state
->state
) {
271 state
->start
= other
->start
;
273 if (tree
->last
== other
)
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 other
->start
= state
->start
;
286 if (tree
->last
== state
)
288 rb_erase(&state
->rb_node
, &tree
->state
);
289 free_extent_state(state
);
295 static void set_state_cb(struct extent_io_tree
*tree
,
296 struct extent_state
*state
,
299 if (tree
->ops
&& tree
->ops
->set_bit_hook
) {
300 tree
->ops
->set_bit_hook(tree
->mapping
->host
, state
->start
,
301 state
->end
, state
->state
, bits
);
305 static void clear_state_cb(struct extent_io_tree
*tree
,
306 struct extent_state
*state
,
309 if (tree
->ops
&& tree
->ops
->set_bit_hook
) {
310 tree
->ops
->clear_bit_hook(tree
->mapping
->host
, state
->start
,
311 state
->end
, state
->state
, bits
);
316 * insert an extent_state struct into the tree. 'bits' are set on the
317 * struct before it is inserted.
319 * This may return -EEXIST if the extent is already there, in which case the
320 * state struct is freed.
322 * The tree lock is not taken internally. This is a utility function and
323 * probably isn't what you want to call (see set/clear_extent_bit).
325 static int insert_state(struct extent_io_tree
*tree
,
326 struct extent_state
*state
, u64 start
, u64 end
,
329 struct rb_node
*node
;
332 printk("end < start %Lu %Lu\n", end
, start
);
335 if (bits
& EXTENT_DIRTY
)
336 tree
->dirty_bytes
+= end
- start
+ 1;
337 set_state_cb(tree
, state
, bits
);
338 state
->state
|= bits
;
339 state
->start
= start
;
341 node
= tree_insert(&tree
->state
, end
, &state
->rb_node
);
343 struct extent_state
*found
;
344 found
= rb_entry(node
, struct extent_state
, rb_node
);
345 printk("found node %Lu %Lu on insert of %Lu %Lu\n", found
->start
, found
->end
, start
, end
);
346 free_extent_state(state
);
351 merge_state(tree
, state
);
356 * split a given extent state struct in two, inserting the preallocated
357 * struct 'prealloc' as the newly created second half. 'split' indicates an
358 * offset inside 'orig' where it should be split.
361 * the tree has 'orig' at [orig->start, orig->end]. After calling, there
362 * are two extent state structs in the tree:
363 * prealloc: [orig->start, split - 1]
364 * orig: [ split, orig->end ]
366 * The tree locks are not taken by this function. They need to be held
369 static int split_state(struct extent_io_tree
*tree
, struct extent_state
*orig
,
370 struct extent_state
*prealloc
, u64 split
)
372 struct rb_node
*node
;
373 prealloc
->start
= orig
->start
;
374 prealloc
->end
= split
- 1;
375 prealloc
->state
= orig
->state
;
378 node
= tree_insert(&tree
->state
, prealloc
->end
, &prealloc
->rb_node
);
380 struct extent_state
*found
;
381 found
= rb_entry(node
, struct extent_state
, rb_node
);
382 printk("found node %Lu %Lu on insert of %Lu %Lu\n", found
->start
, found
->end
, prealloc
->start
, prealloc
->end
);
383 free_extent_state(prealloc
);
386 prealloc
->tree
= tree
;
391 * utility function to clear some bits in an extent state struct.
392 * it will optionally wake up any one waiting on this state (wake == 1), or
393 * forcibly remove the state from the tree (delete == 1).
395 * If no bits are set on the state struct after clearing things, the
396 * struct is freed and removed from the tree
398 static int clear_state_bit(struct extent_io_tree
*tree
,
399 struct extent_state
*state
, int bits
, int wake
,
402 int ret
= state
->state
& bits
;
404 if ((bits
& EXTENT_DIRTY
) && (state
->state
& EXTENT_DIRTY
)) {
405 u64 range
= state
->end
- state
->start
+ 1;
406 WARN_ON(range
> tree
->dirty_bytes
);
407 tree
->dirty_bytes
-= range
;
409 clear_state_cb(tree
, state
, bits
);
410 state
->state
&= ~bits
;
413 if (delete || state
->state
== 0) {
415 clear_state_cb(tree
, state
, state
->state
);
416 if (tree
->last
== state
) {
417 tree
->last
= extent_state_next(state
);
419 rb_erase(&state
->rb_node
, &tree
->state
);
421 free_extent_state(state
);
426 merge_state(tree
, state
);
432 * clear some bits on a range in the tree. This may require splitting
433 * or inserting elements in the tree, so the gfp mask is used to
434 * indicate which allocations or sleeping are allowed.
436 * pass 'wake' == 1 to kick any sleepers, and 'delete' == 1 to remove
437 * the given range from the tree regardless of state (ie for truncate).
439 * the range [start, end] is inclusive.
441 * This takes the tree lock, and returns < 0 on error, > 0 if any of the
442 * bits were already set, or zero if none of the bits were already set.
444 int clear_extent_bit(struct extent_io_tree
*tree
, u64 start
, u64 end
,
445 int bits
, int wake
, int delete, gfp_t mask
)
447 struct extent_state
*state
;
448 struct extent_state
*prealloc
= NULL
;
449 struct rb_node
*node
;
455 if (!prealloc
&& (mask
& __GFP_WAIT
)) {
456 prealloc
= alloc_extent_state(mask
);
461 spin_lock_irqsave(&tree
->lock
, flags
);
463 * this search will find the extents that end after
466 node
= tree_search(tree
, start
);
469 state
= rb_entry(node
, struct extent_state
, rb_node
);
470 if (state
->start
> end
)
472 WARN_ON(state
->end
< start
);
475 * | ---- desired range ---- |
477 * | ------------- state -------------- |
479 * We need to split the extent we found, and may flip
480 * bits on second half.
482 * If the extent we found extends past our range, we
483 * just split and search again. It'll get split again
484 * the next time though.
486 * If the extent we found is inside our range, we clear
487 * the desired bit on it.
490 if (state
->start
< start
) {
492 prealloc
= alloc_extent_state(GFP_ATOMIC
);
493 err
= split_state(tree
, state
, prealloc
, start
);
494 BUG_ON(err
== -EEXIST
);
498 if (state
->end
<= end
) {
499 start
= state
->end
+ 1;
500 set
|= clear_state_bit(tree
, state
, bits
,
503 start
= state
->start
;
508 * | ---- desired range ---- |
510 * We need to split the extent, and clear the bit
513 if (state
->start
<= end
&& state
->end
> end
) {
515 prealloc
= alloc_extent_state(GFP_ATOMIC
);
516 err
= split_state(tree
, state
, prealloc
, end
+ 1);
517 BUG_ON(err
== -EEXIST
);
521 set
|= clear_state_bit(tree
, prealloc
, bits
,
527 start
= state
->end
+ 1;
528 set
|= clear_state_bit(tree
, state
, bits
, wake
, delete);
532 spin_unlock_irqrestore(&tree
->lock
, flags
);
534 free_extent_state(prealloc
);
541 spin_unlock_irqrestore(&tree
->lock
, flags
);
542 if (mask
& __GFP_WAIT
)
546 EXPORT_SYMBOL(clear_extent_bit
);
548 static int wait_on_state(struct extent_io_tree
*tree
,
549 struct extent_state
*state
)
552 prepare_to_wait(&state
->wq
, &wait
, TASK_UNINTERRUPTIBLE
);
553 spin_unlock_irq(&tree
->lock
);
555 spin_lock_irq(&tree
->lock
);
556 finish_wait(&state
->wq
, &wait
);
561 * waits for one or more bits to clear on a range in the state tree.
562 * The range [start, end] is inclusive.
563 * The tree lock is taken by this function
565 int wait_extent_bit(struct extent_io_tree
*tree
, u64 start
, u64 end
, int bits
)
567 struct extent_state
*state
;
568 struct rb_node
*node
;
570 spin_lock_irq(&tree
->lock
);
574 * this search will find all the extents that end after
577 node
= tree_search(tree
, start
);
581 state
= rb_entry(node
, struct extent_state
, rb_node
);
583 if (state
->start
> end
)
586 if (state
->state
& bits
) {
587 start
= state
->start
;
588 atomic_inc(&state
->refs
);
589 wait_on_state(tree
, state
);
590 free_extent_state(state
);
593 start
= state
->end
+ 1;
598 if (need_resched()) {
599 spin_unlock_irq(&tree
->lock
);
601 spin_lock_irq(&tree
->lock
);
605 spin_unlock_irq(&tree
->lock
);
608 EXPORT_SYMBOL(wait_extent_bit
);
610 static void set_state_bits(struct extent_io_tree
*tree
,
611 struct extent_state
*state
,
614 if ((bits
& EXTENT_DIRTY
) && !(state
->state
& EXTENT_DIRTY
)) {
615 u64 range
= state
->end
- state
->start
+ 1;
616 tree
->dirty_bytes
+= range
;
618 set_state_cb(tree
, state
, bits
);
619 state
->state
|= bits
;
623 * set some bits on a range in the tree. This may require allocations
624 * or sleeping, so the gfp mask is used to indicate what is allowed.
626 * If 'exclusive' == 1, this will fail with -EEXIST if some part of the
627 * range already has the desired bits set. The start of the existing
628 * range is returned in failed_start in this case.
630 * [start, end] is inclusive
631 * This takes the tree lock.
633 int set_extent_bit(struct extent_io_tree
*tree
, u64 start
, u64 end
, int bits
,
634 int exclusive
, u64
*failed_start
, gfp_t mask
)
636 struct extent_state
*state
;
637 struct extent_state
*prealloc
= NULL
;
638 struct rb_node
*node
;
645 if (!prealloc
&& (mask
& __GFP_WAIT
)) {
646 prealloc
= alloc_extent_state(mask
);
651 spin_lock_irqsave(&tree
->lock
, flags
);
653 * this search will find all the extents that end after
656 node
= tree_search(tree
, start
);
658 err
= insert_state(tree
, prealloc
, start
, end
, bits
);
660 BUG_ON(err
== -EEXIST
);
664 state
= rb_entry(node
, struct extent_state
, rb_node
);
665 last_start
= state
->start
;
666 last_end
= state
->end
;
669 * | ---- desired range ---- |
672 * Just lock what we found and keep going
674 if (state
->start
== start
&& state
->end
<= end
) {
675 set
= state
->state
& bits
;
676 if (set
&& exclusive
) {
677 *failed_start
= state
->start
;
681 set_state_bits(tree
, state
, bits
);
682 start
= state
->end
+ 1;
683 merge_state(tree
, state
);
688 * | ---- desired range ---- |
691 * | ------------- state -------------- |
693 * We need to split the extent we found, and may flip bits on
696 * If the extent we found extends past our
697 * range, we just split and search again. It'll get split
698 * again the next time though.
700 * If the extent we found is inside our range, we set the
703 if (state
->start
< start
) {
704 set
= state
->state
& bits
;
705 if (exclusive
&& set
) {
706 *failed_start
= start
;
710 err
= split_state(tree
, state
, prealloc
, start
);
711 BUG_ON(err
== -EEXIST
);
715 if (state
->end
<= end
) {
716 set_state_bits(tree
, state
, bits
);
717 start
= state
->end
+ 1;
718 merge_state(tree
, state
);
720 start
= state
->start
;
725 * | ---- desired range ---- |
726 * | state | or | state |
728 * There's a hole, we need to insert something in it and
729 * ignore the extent we found.
731 if (state
->start
> start
) {
733 if (end
< last_start
)
736 this_end
= last_start
-1;
737 err
= insert_state(tree
, prealloc
, start
, this_end
,
740 BUG_ON(err
== -EEXIST
);
743 start
= this_end
+ 1;
747 * | ---- desired range ---- |
749 * We need to split the extent, and set the bit
752 if (state
->start
<= end
&& state
->end
> end
) {
753 set
= state
->state
& bits
;
754 if (exclusive
&& set
) {
755 *failed_start
= start
;
759 err
= split_state(tree
, state
, prealloc
, end
+ 1);
760 BUG_ON(err
== -EEXIST
);
762 set_state_bits(tree
, prealloc
, bits
);
763 merge_state(tree
, prealloc
);
771 spin_unlock_irqrestore(&tree
->lock
, flags
);
773 free_extent_state(prealloc
);
780 spin_unlock_irqrestore(&tree
->lock
, flags
);
781 if (mask
& __GFP_WAIT
)
785 EXPORT_SYMBOL(set_extent_bit
);
787 /* wrappers around set/clear extent bit */
788 int set_extent_dirty(struct extent_io_tree
*tree
, u64 start
, u64 end
,
791 return set_extent_bit(tree
, start
, end
, EXTENT_DIRTY
, 0, NULL
,
794 EXPORT_SYMBOL(set_extent_dirty
);
796 int set_extent_bits(struct extent_io_tree
*tree
, u64 start
, u64 end
,
797 int bits
, gfp_t mask
)
799 return set_extent_bit(tree
, start
, end
, bits
, 0, NULL
,
802 EXPORT_SYMBOL(set_extent_bits
);
804 int clear_extent_bits(struct extent_io_tree
*tree
, u64 start
, u64 end
,
805 int bits
, gfp_t mask
)
807 return clear_extent_bit(tree
, start
, end
, bits
, 0, 0, mask
);
809 EXPORT_SYMBOL(clear_extent_bits
);
811 int set_extent_delalloc(struct extent_io_tree
*tree
, u64 start
, u64 end
,
814 return set_extent_bit(tree
, start
, end
,
815 EXTENT_DELALLOC
| EXTENT_DIRTY
, 0, NULL
,
818 EXPORT_SYMBOL(set_extent_delalloc
);
820 int clear_extent_dirty(struct extent_io_tree
*tree
, u64 start
, u64 end
,
823 return clear_extent_bit(tree
, start
, end
,
824 EXTENT_DIRTY
| EXTENT_DELALLOC
, 0, 0, mask
);
826 EXPORT_SYMBOL(clear_extent_dirty
);
828 int set_extent_new(struct extent_io_tree
*tree
, u64 start
, u64 end
,
831 return set_extent_bit(tree
, start
, end
, EXTENT_NEW
, 0, NULL
,
834 EXPORT_SYMBOL(set_extent_new
);
836 int clear_extent_new(struct extent_io_tree
*tree
, u64 start
, u64 end
,
839 return clear_extent_bit(tree
, start
, end
, EXTENT_NEW
, 0, 0, mask
);
841 EXPORT_SYMBOL(clear_extent_new
);
843 int set_extent_uptodate(struct extent_io_tree
*tree
, u64 start
, u64 end
,
846 return set_extent_bit(tree
, start
, end
, EXTENT_UPTODATE
, 0, NULL
,
849 EXPORT_SYMBOL(set_extent_uptodate
);
851 int clear_extent_uptodate(struct extent_io_tree
*tree
, u64 start
, u64 end
,
854 return clear_extent_bit(tree
, start
, end
, EXTENT_UPTODATE
, 0, 0, mask
);
856 EXPORT_SYMBOL(clear_extent_uptodate
);
858 int set_extent_writeback(struct extent_io_tree
*tree
, u64 start
, u64 end
,
861 return set_extent_bit(tree
, start
, end
, EXTENT_WRITEBACK
,
864 EXPORT_SYMBOL(set_extent_writeback
);
866 int clear_extent_writeback(struct extent_io_tree
*tree
, u64 start
, u64 end
,
869 return clear_extent_bit(tree
, start
, end
, EXTENT_WRITEBACK
, 1, 0, mask
);
871 EXPORT_SYMBOL(clear_extent_writeback
);
873 int wait_on_extent_writeback(struct extent_io_tree
*tree
, u64 start
, u64 end
)
875 return wait_extent_bit(tree
, start
, end
, EXTENT_WRITEBACK
);
877 EXPORT_SYMBOL(wait_on_extent_writeback
);
879 int lock_extent(struct extent_io_tree
*tree
, u64 start
, u64 end
, gfp_t mask
)
884 err
= set_extent_bit(tree
, start
, end
, EXTENT_LOCKED
, 1,
885 &failed_start
, mask
);
886 if (err
== -EEXIST
&& (mask
& __GFP_WAIT
)) {
887 wait_extent_bit(tree
, failed_start
, end
, EXTENT_LOCKED
);
888 start
= failed_start
;
892 WARN_ON(start
> end
);
896 EXPORT_SYMBOL(lock_extent
);
898 int unlock_extent(struct extent_io_tree
*tree
, u64 start
, u64 end
,
901 return clear_extent_bit(tree
, start
, end
, EXTENT_LOCKED
, 1, 0, mask
);
903 EXPORT_SYMBOL(unlock_extent
);
906 * helper function to set pages and extents in the tree dirty
908 int set_range_dirty(struct extent_io_tree
*tree
, u64 start
, u64 end
)
910 unsigned long index
= start
>> PAGE_CACHE_SHIFT
;
911 unsigned long end_index
= end
>> PAGE_CACHE_SHIFT
;
914 while (index
<= end_index
) {
915 page
= find_get_page(tree
->mapping
, index
);
917 __set_page_dirty_nobuffers(page
);
918 page_cache_release(page
);
921 set_extent_dirty(tree
, start
, end
, GFP_NOFS
);
924 EXPORT_SYMBOL(set_range_dirty
);
927 * helper function to set both pages and extents in the tree writeback
929 int set_range_writeback(struct extent_io_tree
*tree
, u64 start
, u64 end
)
931 unsigned long index
= start
>> PAGE_CACHE_SHIFT
;
932 unsigned long end_index
= end
>> PAGE_CACHE_SHIFT
;
935 while (index
<= end_index
) {
936 page
= find_get_page(tree
->mapping
, index
);
938 set_page_writeback(page
);
939 page_cache_release(page
);
942 set_extent_writeback(tree
, start
, end
, GFP_NOFS
);
945 EXPORT_SYMBOL(set_range_writeback
);
947 int find_first_extent_bit(struct extent_io_tree
*tree
, u64 start
,
948 u64
*start_ret
, u64
*end_ret
, int bits
)
950 struct rb_node
*node
;
951 struct extent_state
*state
;
954 spin_lock_irq(&tree
->lock
);
956 * this search will find all the extents that end after
959 node
= tree_search(tree
, start
);
965 state
= rb_entry(node
, struct extent_state
, rb_node
);
966 if (state
->end
>= start
&& (state
->state
& bits
)) {
967 *start_ret
= state
->start
;
968 *end_ret
= state
->end
;
972 node
= rb_next(node
);
977 spin_unlock_irq(&tree
->lock
);
980 EXPORT_SYMBOL(find_first_extent_bit
);
982 struct extent_state
*find_first_extent_bit_state(struct extent_io_tree
*tree
,
985 struct rb_node
*node
;
986 struct extent_state
*state
;
989 * this search will find all the extents that end after
992 node
= tree_search(tree
, start
);
998 state
= rb_entry(node
, struct extent_state
, rb_node
);
999 if (state
->end
>= start
&& (state
->state
& bits
)) {
1002 node
= rb_next(node
);
1009 EXPORT_SYMBOL(find_first_extent_bit_state
);
1011 u64
find_lock_delalloc_range(struct extent_io_tree
*tree
,
1012 u64
*start
, u64
*end
, u64 max_bytes
)
1014 struct rb_node
*node
;
1015 struct extent_state
*state
;
1016 u64 cur_start
= *start
;
1018 u64 total_bytes
= 0;
1020 spin_lock_irq(&tree
->lock
);
1022 * this search will find all the extents that end after
1026 node
= tree_search(tree
, cur_start
);
1034 state
= rb_entry(node
, struct extent_state
, rb_node
);
1035 if (found
&& state
->start
!= cur_start
) {
1038 if (!(state
->state
& EXTENT_DELALLOC
)) {
1044 struct extent_state
*prev_state
;
1045 struct rb_node
*prev_node
= node
;
1047 prev_node
= rb_prev(prev_node
);
1050 prev_state
= rb_entry(prev_node
,
1051 struct extent_state
,
1053 if (!(prev_state
->state
& EXTENT_DELALLOC
))
1059 if (state
->state
& EXTENT_LOCKED
) {
1061 atomic_inc(&state
->refs
);
1062 prepare_to_wait(&state
->wq
, &wait
,
1063 TASK_UNINTERRUPTIBLE
);
1064 spin_unlock_irq(&tree
->lock
);
1066 spin_lock_irq(&tree
->lock
);
1067 finish_wait(&state
->wq
, &wait
);
1068 free_extent_state(state
);
1071 set_state_cb(tree
, state
, EXTENT_LOCKED
);
1072 state
->state
|= EXTENT_LOCKED
;
1074 *start
= state
->start
;
1077 cur_start
= state
->end
+ 1;
1078 node
= rb_next(node
);
1081 total_bytes
+= state
->end
- state
->start
+ 1;
1082 if (total_bytes
>= max_bytes
)
1086 spin_unlock_irq(&tree
->lock
);
1090 u64
count_range_bits(struct extent_io_tree
*tree
,
1091 u64
*start
, u64 search_end
, u64 max_bytes
,
1094 struct rb_node
*node
;
1095 struct extent_state
*state
;
1096 u64 cur_start
= *start
;
1097 u64 total_bytes
= 0;
1100 if (search_end
<= cur_start
) {
1101 printk("search_end %Lu start %Lu\n", search_end
, cur_start
);
1106 spin_lock_irq(&tree
->lock
);
1107 if (cur_start
== 0 && bits
== EXTENT_DIRTY
) {
1108 total_bytes
= tree
->dirty_bytes
;
1112 * this search will find all the extents that end after
1115 node
= tree_search(tree
, cur_start
);
1121 state
= rb_entry(node
, struct extent_state
, rb_node
);
1122 if (state
->start
> search_end
)
1124 if (state
->end
>= cur_start
&& (state
->state
& bits
)) {
1125 total_bytes
+= min(search_end
, state
->end
) + 1 -
1126 max(cur_start
, state
->start
);
1127 if (total_bytes
>= max_bytes
)
1130 *start
= state
->start
;
1134 node
= rb_next(node
);
1139 spin_unlock_irq(&tree
->lock
);
1143 * helper function to lock both pages and extents in the tree.
1144 * pages must be locked first.
1146 int lock_range(struct extent_io_tree
*tree
, u64 start
, u64 end
)
1148 unsigned long index
= start
>> PAGE_CACHE_SHIFT
;
1149 unsigned long end_index
= end
>> PAGE_CACHE_SHIFT
;
1153 while (index
<= end_index
) {
1154 page
= grab_cache_page(tree
->mapping
, index
);
1160 err
= PTR_ERR(page
);
1165 lock_extent(tree
, start
, end
, GFP_NOFS
);
1170 * we failed above in getting the page at 'index', so we undo here
1171 * up to but not including the page at 'index'
1174 index
= start
>> PAGE_CACHE_SHIFT
;
1175 while (index
< end_index
) {
1176 page
= find_get_page(tree
->mapping
, index
);
1178 page_cache_release(page
);
1183 EXPORT_SYMBOL(lock_range
);
1186 * helper function to unlock both pages and extents in the tree.
1188 int unlock_range(struct extent_io_tree
*tree
, u64 start
, u64 end
)
1190 unsigned long index
= start
>> PAGE_CACHE_SHIFT
;
1191 unsigned long end_index
= end
>> PAGE_CACHE_SHIFT
;
1194 while (index
<= end_index
) {
1195 page
= find_get_page(tree
->mapping
, index
);
1197 page_cache_release(page
);
1200 unlock_extent(tree
, start
, end
, GFP_NOFS
);
1203 EXPORT_SYMBOL(unlock_range
);
1205 int set_state_private(struct extent_io_tree
*tree
, u64 start
, u64
private)
1207 struct rb_node
*node
;
1208 struct extent_state
*state
;
1211 spin_lock_irq(&tree
->lock
);
1213 * this search will find all the extents that end after
1216 node
= tree_search(tree
, start
);
1221 state
= rb_entry(node
, struct extent_state
, rb_node
);
1222 if (state
->start
!= start
) {
1226 state
->private = private;
1228 spin_unlock_irq(&tree
->lock
);
1232 int get_state_private(struct extent_io_tree
*tree
, u64 start
, u64
*private)
1234 struct rb_node
*node
;
1235 struct extent_state
*state
;
1238 spin_lock_irq(&tree
->lock
);
1240 * this search will find all the extents that end after
1243 node
= tree_search(tree
, start
);
1248 state
= rb_entry(node
, struct extent_state
, rb_node
);
1249 if (state
->start
!= start
) {
1253 *private = state
->private;
1255 spin_unlock_irq(&tree
->lock
);
1260 * searches a range in the state tree for a given mask.
1261 * If 'filled' == 1, this returns 1 only if every extent in the tree
1262 * has the bits set. Otherwise, 1 is returned if any bit in the
1263 * range is found set.
1265 int test_range_bit(struct extent_io_tree
*tree
, u64 start
, u64 end
,
1266 int bits
, int filled
)
1268 struct extent_state
*state
= NULL
;
1269 struct rb_node
*node
;
1271 unsigned long flags
;
1273 spin_lock_irqsave(&tree
->lock
, flags
);
1274 node
= tree_search(tree
, start
);
1275 while (node
&& start
<= end
) {
1276 state
= rb_entry(node
, struct extent_state
, rb_node
);
1278 if (filled
&& state
->start
> start
) {
1283 if (state
->start
> end
)
1286 if (state
->state
& bits
) {
1290 } else if (filled
) {
1294 start
= state
->end
+ 1;
1297 node
= rb_next(node
);
1304 spin_unlock_irqrestore(&tree
->lock
, flags
);
1307 EXPORT_SYMBOL(test_range_bit
);
1310 * helper function to set a given page up to date if all the
1311 * extents in the tree for that page are up to date
1313 static int check_page_uptodate(struct extent_io_tree
*tree
,
1316 u64 start
= (u64
)page
->index
<< PAGE_CACHE_SHIFT
;
1317 u64 end
= start
+ PAGE_CACHE_SIZE
- 1;
1318 if (test_range_bit(tree
, start
, end
, EXTENT_UPTODATE
, 1))
1319 SetPageUptodate(page
);
1324 * helper function to unlock a page if all the extents in the tree
1325 * for that page are unlocked
1327 static int check_page_locked(struct extent_io_tree
*tree
,
1330 u64 start
= (u64
)page
->index
<< PAGE_CACHE_SHIFT
;
1331 u64 end
= start
+ PAGE_CACHE_SIZE
- 1;
1332 if (!test_range_bit(tree
, start
, end
, EXTENT_LOCKED
, 0))
1338 * helper function to end page writeback if all the extents
1339 * in the tree for that page are done with writeback
1341 static int check_page_writeback(struct extent_io_tree
*tree
,
1344 u64 start
= (u64
)page
->index
<< PAGE_CACHE_SHIFT
;
1345 u64 end
= start
+ PAGE_CACHE_SIZE
- 1;
1346 if (!test_range_bit(tree
, start
, end
, EXTENT_WRITEBACK
, 0))
1347 end_page_writeback(page
);
1351 /* lots and lots of room for performance fixes in the end_bio funcs */
1354 * after a writepage IO is done, we need to:
1355 * clear the uptodate bits on error
1356 * clear the writeback bits in the extent tree for this IO
1357 * end_page_writeback if the page has no more pending IO
1359 * Scheduling is not allowed, so the extent state tree is expected
1360 * to have one and only one object corresponding to this IO.
1362 #if LINUX_VERSION_CODE > KERNEL_VERSION(2,6,23)
1363 static void end_bio_extent_writepage(struct bio
*bio
, int err
)
1365 static int end_bio_extent_writepage(struct bio
*bio
,
1366 unsigned int bytes_done
, int err
)
1369 const int uptodate
= test_bit(BIO_UPTODATE
, &bio
->bi_flags
);
1370 struct bio_vec
*bvec
= bio
->bi_io_vec
+ bio
->bi_vcnt
- 1;
1371 struct extent_state
*state
= bio
->bi_private
;
1372 struct extent_io_tree
*tree
= state
->tree
;
1373 struct rb_node
*node
;
1378 unsigned long flags
;
1380 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23)
1385 struct page
*page
= bvec
->bv_page
;
1386 start
= ((u64
)page
->index
<< PAGE_CACHE_SHIFT
) +
1388 end
= start
+ bvec
->bv_len
- 1;
1390 if (bvec
->bv_offset
== 0 && bvec
->bv_len
== PAGE_CACHE_SIZE
)
1395 if (--bvec
>= bio
->bi_io_vec
)
1396 prefetchw(&bvec
->bv_page
->flags
);
1399 clear_extent_uptodate(tree
, start
, end
, GFP_ATOMIC
);
1400 ClearPageUptodate(page
);
1404 if (tree
->ops
&& tree
->ops
->writepage_end_io_hook
) {
1405 tree
->ops
->writepage_end_io_hook(page
, start
, end
,
1410 * bios can get merged in funny ways, and so we need to
1411 * be careful with the state variable. We know the
1412 * state won't be merged with others because it has
1413 * WRITEBACK set, but we can't be sure each biovec is
1414 * sequential in the file. So, if our cached state
1415 * doesn't match the expected end, search the tree
1416 * for the correct one.
1419 spin_lock_irqsave(&tree
->lock
, flags
);
1420 if (!state
|| state
->end
!= end
) {
1422 node
= __etree_search(tree
, start
, NULL
, NULL
);
1424 state
= rb_entry(node
, struct extent_state
,
1426 if (state
->end
!= end
||
1427 !(state
->state
& EXTENT_WRITEBACK
))
1431 spin_unlock_irqrestore(&tree
->lock
, flags
);
1432 clear_extent_writeback(tree
, start
,
1439 struct extent_state
*clear
= state
;
1441 node
= rb_prev(&state
->rb_node
);
1443 state
= rb_entry(node
,
1444 struct extent_state
,
1450 clear_state_bit(tree
, clear
, EXTENT_WRITEBACK
,
1461 /* before releasing the lock, make sure the next state
1462 * variable has the expected bits set and corresponds
1463 * to the correct offsets in the file
1465 if (state
&& (state
->end
+ 1 != start
||
1466 !(state
->state
& EXTENT_WRITEBACK
))) {
1469 spin_unlock_irqrestore(&tree
->lock
, flags
);
1473 end_page_writeback(page
);
1475 check_page_writeback(tree
, page
);
1476 } while (bvec
>= bio
->bi_io_vec
);
1478 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23)
1484 * after a readpage IO is done, we need to:
1485 * clear the uptodate bits on error
1486 * set the uptodate bits if things worked
1487 * set the page up to date if all extents in the tree are uptodate
1488 * clear the lock bit in the extent tree
1489 * unlock the page if there are no other extents locked for it
1491 * Scheduling is not allowed, so the extent state tree is expected
1492 * to have one and only one object corresponding to this IO.
1494 #if LINUX_VERSION_CODE > KERNEL_VERSION(2,6,23)
1495 static void end_bio_extent_readpage(struct bio
*bio
, int err
)
1497 static int end_bio_extent_readpage(struct bio
*bio
,
1498 unsigned int bytes_done
, int err
)
1501 int uptodate
= test_bit(BIO_UPTODATE
, &bio
->bi_flags
);
1502 struct bio_vec
*bvec
= bio
->bi_io_vec
+ bio
->bi_vcnt
- 1;
1503 struct extent_state
*state
= bio
->bi_private
;
1504 struct extent_io_tree
*tree
= state
->tree
;
1505 struct rb_node
*node
;
1509 unsigned long flags
;
1513 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23)
1519 struct page
*page
= bvec
->bv_page
;
1520 start
= ((u64
)page
->index
<< PAGE_CACHE_SHIFT
) +
1522 end
= start
+ bvec
->bv_len
- 1;
1524 if (bvec
->bv_offset
== 0 && bvec
->bv_len
== PAGE_CACHE_SIZE
)
1529 if (--bvec
>= bio
->bi_io_vec
)
1530 prefetchw(&bvec
->bv_page
->flags
);
1532 if (uptodate
&& tree
->ops
&& tree
->ops
->readpage_end_io_hook
) {
1533 ret
= tree
->ops
->readpage_end_io_hook(page
, start
, end
,
1538 if (!uptodate
&& tree
->ops
&&
1539 tree
->ops
->readpage_io_failed_hook
) {
1540 ret
= tree
->ops
->readpage_io_failed_hook(bio
, page
,
1545 test_bit(BIO_UPTODATE
, &bio
->bi_flags
);
1550 spin_lock_irqsave(&tree
->lock
, flags
);
1551 if (!state
|| state
->end
!= end
) {
1553 node
= __etree_search(tree
, start
, NULL
, NULL
);
1555 state
= rb_entry(node
, struct extent_state
,
1557 if (state
->end
!= end
||
1558 !(state
->state
& EXTENT_LOCKED
))
1562 spin_unlock_irqrestore(&tree
->lock
, flags
);
1564 set_extent_uptodate(tree
, start
, end
,
1566 unlock_extent(tree
, start
, end
, GFP_ATOMIC
);
1573 struct extent_state
*clear
= state
;
1575 node
= rb_prev(&state
->rb_node
);
1577 state
= rb_entry(node
,
1578 struct extent_state
,
1584 set_state_cb(tree
, clear
, EXTENT_UPTODATE
);
1585 clear
->state
|= EXTENT_UPTODATE
;
1587 clear_state_bit(tree
, clear
, EXTENT_LOCKED
,
1598 /* before releasing the lock, make sure the next state
1599 * variable has the expected bits set and corresponds
1600 * to the correct offsets in the file
1602 if (state
&& (state
->end
+ 1 != start
||
1603 !(state
->state
& EXTENT_LOCKED
))) {
1606 spin_unlock_irqrestore(&tree
->lock
, flags
);
1610 SetPageUptodate(page
);
1612 ClearPageUptodate(page
);
1618 check_page_uptodate(tree
, page
);
1620 ClearPageUptodate(page
);
1623 check_page_locked(tree
, page
);
1625 } while (bvec
>= bio
->bi_io_vec
);
1628 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23)
1634 * IO done from prepare_write is pretty simple, we just unlock
1635 * the structs in the extent tree when done, and set the uptodate bits
1638 #if LINUX_VERSION_CODE > KERNEL_VERSION(2,6,23)
1639 static void end_bio_extent_preparewrite(struct bio
*bio
, int err
)
1641 static int end_bio_extent_preparewrite(struct bio
*bio
,
1642 unsigned int bytes_done
, int err
)
1645 const int uptodate
= test_bit(BIO_UPTODATE
, &bio
->bi_flags
);
1646 struct bio_vec
*bvec
= bio
->bi_io_vec
+ bio
->bi_vcnt
- 1;
1647 struct extent_state
*state
= bio
->bi_private
;
1648 struct extent_io_tree
*tree
= state
->tree
;
1652 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23)
1658 struct page
*page
= bvec
->bv_page
;
1659 start
= ((u64
)page
->index
<< PAGE_CACHE_SHIFT
) +
1661 end
= start
+ bvec
->bv_len
- 1;
1663 if (--bvec
>= bio
->bi_io_vec
)
1664 prefetchw(&bvec
->bv_page
->flags
);
1667 set_extent_uptodate(tree
, start
, end
, GFP_ATOMIC
);
1669 ClearPageUptodate(page
);
1673 unlock_extent(tree
, start
, end
, GFP_ATOMIC
);
1675 } while (bvec
>= bio
->bi_io_vec
);
1678 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23)
1684 extent_bio_alloc(struct block_device
*bdev
, u64 first_sector
, int nr_vecs
,
1689 bio
= bio_alloc(gfp_flags
, nr_vecs
);
1691 if (bio
== NULL
&& (current
->flags
& PF_MEMALLOC
)) {
1692 while (!bio
&& (nr_vecs
/= 2))
1693 bio
= bio_alloc(gfp_flags
, nr_vecs
);
1697 bio
->bi_bdev
= bdev
;
1698 bio
->bi_sector
= first_sector
;
1703 static int submit_one_bio(int rw
, struct bio
*bio
, int mirror_num
)
1706 struct bio_vec
*bvec
= bio
->bi_io_vec
+ bio
->bi_vcnt
- 1;
1707 struct page
*page
= bvec
->bv_page
;
1708 struct extent_io_tree
*tree
= bio
->bi_private
;
1709 struct rb_node
*node
;
1710 struct extent_state
*state
;
1714 start
= ((u64
)page
->index
<< PAGE_CACHE_SHIFT
) + bvec
->bv_offset
;
1715 end
= start
+ bvec
->bv_len
- 1;
1717 spin_lock_irq(&tree
->lock
);
1718 node
= __etree_search(tree
, start
, NULL
, NULL
);
1720 state
= rb_entry(node
, struct extent_state
, rb_node
);
1721 while(state
->end
< end
) {
1722 node
= rb_next(node
);
1723 state
= rb_entry(node
, struct extent_state
, rb_node
);
1725 BUG_ON(state
->end
!= end
);
1726 spin_unlock_irq(&tree
->lock
);
1728 bio
->bi_private
= state
;
1732 if (tree
->ops
&& tree
->ops
->submit_bio_hook
)
1733 tree
->ops
->submit_bio_hook(page
->mapping
->host
, rw
, bio
,
1736 submit_bio(rw
, bio
);
1737 if (bio_flagged(bio
, BIO_EOPNOTSUPP
))
1743 static int submit_extent_page(int rw
, struct extent_io_tree
*tree
,
1744 struct page
*page
, sector_t sector
,
1745 size_t size
, unsigned long offset
,
1746 struct block_device
*bdev
,
1747 struct bio
**bio_ret
,
1748 unsigned long max_pages
,
1749 bio_end_io_t end_io_func
,
1756 if (bio_ret
&& *bio_ret
) {
1758 if (bio
->bi_sector
+ (bio
->bi_size
>> 9) != sector
||
1759 (tree
->ops
&& tree
->ops
->merge_bio_hook
&&
1760 tree
->ops
->merge_bio_hook(page
, offset
, size
, bio
)) ||
1761 bio_add_page(bio
, page
, size
, offset
) < size
) {
1762 ret
= submit_one_bio(rw
, bio
, mirror_num
);
1768 nr
= bio_get_nr_vecs(bdev
);
1769 bio
= extent_bio_alloc(bdev
, sector
, nr
, GFP_NOFS
| __GFP_HIGH
);
1771 printk("failed to allocate bio nr %d\n", nr
);
1775 bio_add_page(bio
, page
, size
, offset
);
1776 bio
->bi_end_io
= end_io_func
;
1777 bio
->bi_private
= tree
;
1782 ret
= submit_one_bio(rw
, bio
, mirror_num
);
1788 void set_page_extent_mapped(struct page
*page
)
1790 if (!PagePrivate(page
)) {
1791 SetPagePrivate(page
);
1792 WARN_ON(!page
->mapping
->a_ops
->invalidatepage
);
1793 set_page_private(page
, EXTENT_PAGE_PRIVATE
);
1794 page_cache_get(page
);
1798 void set_page_extent_head(struct page
*page
, unsigned long len
)
1800 set_page_private(page
, EXTENT_PAGE_PRIVATE_FIRST_PAGE
| len
<< 2);
1804 * basic readpage implementation. Locked extent state structs are inserted
1805 * into the tree that are removed when the IO is done (by the end_io
1808 static int __extent_read_full_page(struct extent_io_tree
*tree
,
1810 get_extent_t
*get_extent
,
1811 struct bio
**bio
, int mirror_num
)
1813 struct inode
*inode
= page
->mapping
->host
;
1814 u64 start
= (u64
)page
->index
<< PAGE_CACHE_SHIFT
;
1815 u64 page_end
= start
+ PAGE_CACHE_SIZE
- 1;
1819 u64 last_byte
= i_size_read(inode
);
1823 struct extent_map
*em
;
1824 struct block_device
*bdev
;
1827 size_t page_offset
= 0;
1829 size_t blocksize
= inode
->i_sb
->s_blocksize
;
1831 set_page_extent_mapped(page
);
1834 lock_extent(tree
, start
, end
, GFP_NOFS
);
1836 while (cur
<= end
) {
1837 if (cur
>= last_byte
) {
1839 iosize
= PAGE_CACHE_SIZE
- page_offset
;
1840 userpage
= kmap_atomic(page
, KM_USER0
);
1841 memset(userpage
+ page_offset
, 0, iosize
);
1842 flush_dcache_page(page
);
1843 kunmap_atomic(userpage
, KM_USER0
);
1844 set_extent_uptodate(tree
, cur
, cur
+ iosize
- 1,
1846 unlock_extent(tree
, cur
, cur
+ iosize
- 1, GFP_NOFS
);
1849 em
= get_extent(inode
, page
, page_offset
, cur
,
1851 if (IS_ERR(em
) || !em
) {
1853 unlock_extent(tree
, cur
, end
, GFP_NOFS
);
1857 extent_offset
= cur
- em
->start
;
1858 BUG_ON(extent_map_end(em
) <= cur
);
1861 iosize
= min(extent_map_end(em
) - cur
, end
- cur
+ 1);
1862 cur_end
= min(extent_map_end(em
) - 1, end
);
1863 iosize
= (iosize
+ blocksize
- 1) & ~((u64
)blocksize
- 1);
1864 sector
= (em
->block_start
+ extent_offset
) >> 9;
1866 block_start
= em
->block_start
;
1867 free_extent_map(em
);
1870 /* we've found a hole, just zero and go on */
1871 if (block_start
== EXTENT_MAP_HOLE
) {
1873 userpage
= kmap_atomic(page
, KM_USER0
);
1874 memset(userpage
+ page_offset
, 0, iosize
);
1875 flush_dcache_page(page
);
1876 kunmap_atomic(userpage
, KM_USER0
);
1878 set_extent_uptodate(tree
, cur
, cur
+ iosize
- 1,
1880 unlock_extent(tree
, cur
, cur
+ iosize
- 1, GFP_NOFS
);
1882 page_offset
+= iosize
;
1885 /* the get_extent function already copied into the page */
1886 if (test_range_bit(tree
, cur
, cur_end
, EXTENT_UPTODATE
, 1)) {
1887 unlock_extent(tree
, cur
, cur
+ iosize
- 1, GFP_NOFS
);
1889 page_offset
+= iosize
;
1892 /* we have an inline extent but it didn't get marked up
1893 * to date. Error out
1895 if (block_start
== EXTENT_MAP_INLINE
) {
1897 unlock_extent(tree
, cur
, cur
+ iosize
- 1, GFP_NOFS
);
1899 page_offset
+= iosize
;
1904 if (tree
->ops
&& tree
->ops
->readpage_io_hook
) {
1905 ret
= tree
->ops
->readpage_io_hook(page
, cur
,
1909 unsigned long nr
= (last_byte
>> PAGE_CACHE_SHIFT
) + 1;
1911 ret
= submit_extent_page(READ
, tree
, page
,
1912 sector
, iosize
, page_offset
,
1914 end_bio_extent_readpage
, mirror_num
);
1919 page_offset
+= iosize
;
1923 if (!PageError(page
))
1924 SetPageUptodate(page
);
1930 int extent_read_full_page(struct extent_io_tree
*tree
, struct page
*page
,
1931 get_extent_t
*get_extent
)
1933 struct bio
*bio
= NULL
;
1936 ret
= __extent_read_full_page(tree
, page
, get_extent
, &bio
, 0);
1938 submit_one_bio(READ
, bio
, 0);
1941 EXPORT_SYMBOL(extent_read_full_page
);
1944 * the writepage semantics are similar to regular writepage. extent
1945 * records are inserted to lock ranges in the tree, and as dirty areas
1946 * are found, they are marked writeback. Then the lock bits are removed
1947 * and the end_io handler clears the writeback ranges
1949 static int __extent_writepage(struct page
*page
, struct writeback_control
*wbc
,
1952 struct inode
*inode
= page
->mapping
->host
;
1953 struct extent_page_data
*epd
= data
;
1954 struct extent_io_tree
*tree
= epd
->tree
;
1955 u64 start
= (u64
)page
->index
<< PAGE_CACHE_SHIFT
;
1957 u64 page_end
= start
+ PAGE_CACHE_SIZE
- 1;
1961 u64 last_byte
= i_size_read(inode
);
1965 struct extent_map
*em
;
1966 struct block_device
*bdev
;
1969 size_t page_offset
= 0;
1971 loff_t i_size
= i_size_read(inode
);
1972 unsigned long end_index
= i_size
>> PAGE_CACHE_SHIFT
;
1976 WARN_ON(!PageLocked(page
));
1977 if (page
->index
> end_index
) {
1978 clear_extent_dirty(tree
, start
, page_end
, GFP_NOFS
);
1983 if (page
->index
== end_index
) {
1986 size_t offset
= i_size
& (PAGE_CACHE_SIZE
- 1);
1988 userpage
= kmap_atomic(page
, KM_USER0
);
1989 memset(userpage
+ offset
, 0, PAGE_CACHE_SIZE
- offset
);
1990 flush_dcache_page(page
);
1991 kunmap_atomic(userpage
, KM_USER0
);
1994 set_page_extent_mapped(page
);
1996 delalloc_start
= start
;
1998 while(delalloc_end
< page_end
) {
1999 nr_delalloc
= find_lock_delalloc_range(tree
, &delalloc_start
,
2002 if (nr_delalloc
== 0) {
2003 delalloc_start
= delalloc_end
+ 1;
2006 tree
->ops
->fill_delalloc(inode
, delalloc_start
,
2008 clear_extent_bit(tree
, delalloc_start
,
2010 EXTENT_LOCKED
| EXTENT_DELALLOC
,
2012 delalloc_start
= delalloc_end
+ 1;
2014 lock_extent(tree
, start
, page_end
, GFP_NOFS
);
2017 if (test_range_bit(tree
, start
, page_end
, EXTENT_DELALLOC
, 0)) {
2018 printk("found delalloc bits after lock_extent\n");
2021 if (last_byte
<= start
) {
2022 clear_extent_dirty(tree
, start
, page_end
, GFP_NOFS
);
2026 set_extent_uptodate(tree
, start
, page_end
, GFP_NOFS
);
2027 blocksize
= inode
->i_sb
->s_blocksize
;
2029 while (cur
<= end
) {
2030 if (cur
>= last_byte
) {
2031 clear_extent_dirty(tree
, cur
, page_end
, GFP_NOFS
);
2034 em
= epd
->get_extent(inode
, page
, page_offset
, cur
,
2036 if (IS_ERR(em
) || !em
) {
2041 extent_offset
= cur
- em
->start
;
2042 BUG_ON(extent_map_end(em
) <= cur
);
2044 iosize
= min(extent_map_end(em
) - cur
, end
- cur
+ 1);
2045 iosize
= (iosize
+ blocksize
- 1) & ~((u64
)blocksize
- 1);
2046 sector
= (em
->block_start
+ extent_offset
) >> 9;
2048 block_start
= em
->block_start
;
2049 free_extent_map(em
);
2052 if (block_start
== EXTENT_MAP_HOLE
||
2053 block_start
== EXTENT_MAP_INLINE
) {
2054 clear_extent_dirty(tree
, cur
,
2055 cur
+ iosize
- 1, GFP_NOFS
);
2057 page_offset
+= iosize
;
2061 /* leave this out until we have a page_mkwrite call */
2062 if (0 && !test_range_bit(tree
, cur
, cur
+ iosize
- 1,
2065 page_offset
+= iosize
;
2068 clear_extent_dirty(tree
, cur
, cur
+ iosize
- 1, GFP_NOFS
);
2069 if (tree
->ops
&& tree
->ops
->writepage_io_hook
) {
2070 ret
= tree
->ops
->writepage_io_hook(page
, cur
,
2078 unsigned long max_nr
= end_index
+ 1;
2079 set_range_writeback(tree
, cur
, cur
+ iosize
- 1);
2080 if (!PageWriteback(page
)) {
2081 printk("warning page %lu not writeback, "
2082 "cur %llu end %llu\n", page
->index
,
2083 (unsigned long long)cur
,
2084 (unsigned long long)end
);
2087 ret
= submit_extent_page(WRITE
, tree
, page
, sector
,
2088 iosize
, page_offset
, bdev
,
2090 end_bio_extent_writepage
, 0);
2095 page_offset
+= iosize
;
2100 /* make sure the mapping tag for page dirty gets cleared */
2101 set_page_writeback(page
);
2102 end_page_writeback(page
);
2104 unlock_extent(tree
, start
, page_end
, GFP_NOFS
);
2109 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,20)
2110 /* Taken directly from 2.6.23 for 2.6.18 back port */
2111 typedef int (*writepage_t
)(struct page
*page
, struct writeback_control
*wbc
,
2115 * write_cache_pages - walk the list of dirty pages of the given address space
2116 * and write all of them.
2117 * @mapping: address space structure to write
2118 * @wbc: subtract the number of written pages from *@wbc->nr_to_write
2119 * @writepage: function called for each page
2120 * @data: data passed to writepage function
2122 * If a page is already under I/O, write_cache_pages() skips it, even
2123 * if it's dirty. This is desirable behaviour for memory-cleaning writeback,
2124 * but it is INCORRECT for data-integrity system calls such as fsync(). fsync()
2125 * and msync() need to guarantee that all the data which was dirty at the time
2126 * the call was made get new I/O started against them. If wbc->sync_mode is
2127 * WB_SYNC_ALL then we were called for data integrity and we must wait for
2128 * existing IO to complete.
2130 static int write_cache_pages(struct address_space
*mapping
,
2131 struct writeback_control
*wbc
, writepage_t writepage
,
2134 struct backing_dev_info
*bdi
= mapping
->backing_dev_info
;
2137 struct pagevec pvec
;
2140 pgoff_t end
; /* Inclusive */
2142 int range_whole
= 0;
2144 if (wbc
->nonblocking
&& bdi_write_congested(bdi
)) {
2145 wbc
->encountered_congestion
= 1;
2149 pagevec_init(&pvec
, 0);
2150 if (wbc
->range_cyclic
) {
2151 index
= mapping
->writeback_index
; /* Start from prev offset */
2154 index
= wbc
->range_start
>> PAGE_CACHE_SHIFT
;
2155 end
= wbc
->range_end
>> PAGE_CACHE_SHIFT
;
2156 if (wbc
->range_start
== 0 && wbc
->range_end
== LLONG_MAX
)
2161 while (!done
&& (index
<= end
) &&
2162 (nr_pages
= pagevec_lookup_tag(&pvec
, mapping
, &index
,
2163 PAGECACHE_TAG_DIRTY
,
2164 min(end
- index
, (pgoff_t
)PAGEVEC_SIZE
-1) + 1))) {
2168 for (i
= 0; i
< nr_pages
; i
++) {
2169 struct page
*page
= pvec
.pages
[i
];
2172 * At this point we hold neither mapping->tree_lock nor
2173 * lock on the page itself: the page may be truncated or
2174 * invalidated (changing page->mapping to NULL), or even
2175 * swizzled back from swapper_space to tmpfs file
2180 if (unlikely(page
->mapping
!= mapping
)) {
2185 if (!wbc
->range_cyclic
&& page
->index
> end
) {
2191 if (wbc
->sync_mode
!= WB_SYNC_NONE
)
2192 wait_on_page_writeback(page
);
2194 if (PageWriteback(page
) ||
2195 !clear_page_dirty_for_io(page
)) {
2200 ret
= (*writepage
)(page
, wbc
, data
);
2202 if (unlikely(ret
== AOP_WRITEPAGE_ACTIVATE
)) {
2206 if (ret
|| (--(wbc
->nr_to_write
) <= 0))
2208 if (wbc
->nonblocking
&& bdi_write_congested(bdi
)) {
2209 wbc
->encountered_congestion
= 1;
2213 pagevec_release(&pvec
);
2216 if (!scanned
&& !done
) {
2218 * We hit the last page and there is more work to be done: wrap
2219 * back to the start of the file
2225 if (wbc
->range_cyclic
|| (range_whole
&& wbc
->nr_to_write
> 0))
2226 mapping
->writeback_index
= index
;
2231 int extent_write_full_page(struct extent_io_tree
*tree
, struct page
*page
,
2232 get_extent_t
*get_extent
,
2233 struct writeback_control
*wbc
)
2236 struct address_space
*mapping
= page
->mapping
;
2237 struct extent_page_data epd
= {
2240 .get_extent
= get_extent
,
2242 struct writeback_control wbc_writepages
= {
2244 .sync_mode
= WB_SYNC_NONE
,
2245 .older_than_this
= NULL
,
2247 .range_start
= page_offset(page
) + PAGE_CACHE_SIZE
,
2248 .range_end
= (loff_t
)-1,
2252 ret
= __extent_writepage(page
, wbc
, &epd
);
2254 write_cache_pages(mapping
, &wbc_writepages
, __extent_writepage
, &epd
);
2256 submit_one_bio(WRITE
, epd
.bio
, 0);
2260 EXPORT_SYMBOL(extent_write_full_page
);
2263 int extent_writepages(struct extent_io_tree
*tree
,
2264 struct address_space
*mapping
,
2265 get_extent_t
*get_extent
,
2266 struct writeback_control
*wbc
)
2269 struct extent_page_data epd
= {
2272 .get_extent
= get_extent
,
2275 ret
= write_cache_pages(mapping
, wbc
, __extent_writepage
, &epd
);
2277 submit_one_bio(WRITE
, epd
.bio
, 0);
2281 EXPORT_SYMBOL(extent_writepages
);
2283 int extent_readpages(struct extent_io_tree
*tree
,
2284 struct address_space
*mapping
,
2285 struct list_head
*pages
, unsigned nr_pages
,
2286 get_extent_t get_extent
)
2288 struct bio
*bio
= NULL
;
2290 struct pagevec pvec
;
2292 pagevec_init(&pvec
, 0);
2293 for (page_idx
= 0; page_idx
< nr_pages
; page_idx
++) {
2294 struct page
*page
= list_entry(pages
->prev
, struct page
, lru
);
2296 prefetchw(&page
->flags
);
2297 list_del(&page
->lru
);
2299 * what we want to do here is call add_to_page_cache_lru,
2300 * but that isn't exported, so we reproduce it here
2302 if (!add_to_page_cache(page
, mapping
,
2303 page
->index
, GFP_KERNEL
)) {
2305 /* open coding of lru_cache_add, also not exported */
2306 page_cache_get(page
);
2307 if (!pagevec_add(&pvec
, page
))
2308 __pagevec_lru_add(&pvec
);
2309 __extent_read_full_page(tree
, page
, get_extent
,
2312 page_cache_release(page
);
2314 if (pagevec_count(&pvec
))
2315 __pagevec_lru_add(&pvec
);
2316 BUG_ON(!list_empty(pages
));
2318 submit_one_bio(READ
, bio
, 0);
2321 EXPORT_SYMBOL(extent_readpages
);
2324 * basic invalidatepage code, this waits on any locked or writeback
2325 * ranges corresponding to the page, and then deletes any extent state
2326 * records from the tree
2328 int extent_invalidatepage(struct extent_io_tree
*tree
,
2329 struct page
*page
, unsigned long offset
)
2331 u64 start
= ((u64
)page
->index
<< PAGE_CACHE_SHIFT
);
2332 u64 end
= start
+ PAGE_CACHE_SIZE
- 1;
2333 size_t blocksize
= page
->mapping
->host
->i_sb
->s_blocksize
;
2335 start
+= (offset
+ blocksize
-1) & ~(blocksize
- 1);
2339 lock_extent(tree
, start
, end
, GFP_NOFS
);
2340 wait_on_extent_writeback(tree
, start
, end
);
2341 clear_extent_bit(tree
, start
, end
,
2342 EXTENT_LOCKED
| EXTENT_DIRTY
| EXTENT_DELALLOC
,
2346 EXPORT_SYMBOL(extent_invalidatepage
);
2349 * simple commit_write call, set_range_dirty is used to mark both
2350 * the pages and the extent records as dirty
2352 int extent_commit_write(struct extent_io_tree
*tree
,
2353 struct inode
*inode
, struct page
*page
,
2354 unsigned from
, unsigned to
)
2356 loff_t pos
= ((loff_t
)page
->index
<< PAGE_CACHE_SHIFT
) + to
;
2358 set_page_extent_mapped(page
);
2359 set_page_dirty(page
);
2361 if (pos
> inode
->i_size
) {
2362 i_size_write(inode
, pos
);
2363 mark_inode_dirty(inode
);
2367 EXPORT_SYMBOL(extent_commit_write
);
2369 int extent_prepare_write(struct extent_io_tree
*tree
,
2370 struct inode
*inode
, struct page
*page
,
2371 unsigned from
, unsigned to
, get_extent_t
*get_extent
)
2373 u64 page_start
= (u64
)page
->index
<< PAGE_CACHE_SHIFT
;
2374 u64 page_end
= page_start
+ PAGE_CACHE_SIZE
- 1;
2376 u64 orig_block_start
;
2379 struct extent_map
*em
;
2380 unsigned blocksize
= 1 << inode
->i_blkbits
;
2381 size_t page_offset
= 0;
2382 size_t block_off_start
;
2383 size_t block_off_end
;
2389 set_page_extent_mapped(page
);
2391 block_start
= (page_start
+ from
) & ~((u64
)blocksize
- 1);
2392 block_end
= (page_start
+ to
- 1) | (blocksize
- 1);
2393 orig_block_start
= block_start
;
2395 lock_extent(tree
, page_start
, page_end
, GFP_NOFS
);
2396 while(block_start
<= block_end
) {
2397 em
= get_extent(inode
, page
, page_offset
, block_start
,
2398 block_end
- block_start
+ 1, 1);
2399 if (IS_ERR(em
) || !em
) {
2402 cur_end
= min(block_end
, extent_map_end(em
) - 1);
2403 block_off_start
= block_start
& (PAGE_CACHE_SIZE
- 1);
2404 block_off_end
= block_off_start
+ blocksize
;
2405 isnew
= clear_extent_new(tree
, block_start
, cur_end
, GFP_NOFS
);
2407 if (!PageUptodate(page
) && isnew
&&
2408 (block_off_end
> to
|| block_off_start
< from
)) {
2411 kaddr
= kmap_atomic(page
, KM_USER0
);
2412 if (block_off_end
> to
)
2413 memset(kaddr
+ to
, 0, block_off_end
- to
);
2414 if (block_off_start
< from
)
2415 memset(kaddr
+ block_off_start
, 0,
2416 from
- block_off_start
);
2417 flush_dcache_page(page
);
2418 kunmap_atomic(kaddr
, KM_USER0
);
2420 if ((em
->block_start
!= EXTENT_MAP_HOLE
&&
2421 em
->block_start
!= EXTENT_MAP_INLINE
) &&
2422 !isnew
&& !PageUptodate(page
) &&
2423 (block_off_end
> to
|| block_off_start
< from
) &&
2424 !test_range_bit(tree
, block_start
, cur_end
,
2425 EXTENT_UPTODATE
, 1)) {
2427 u64 extent_offset
= block_start
- em
->start
;
2429 sector
= (em
->block_start
+ extent_offset
) >> 9;
2430 iosize
= (cur_end
- block_start
+ blocksize
) &
2431 ~((u64
)blocksize
- 1);
2433 * we've already got the extent locked, but we
2434 * need to split the state such that our end_bio
2435 * handler can clear the lock.
2437 set_extent_bit(tree
, block_start
,
2438 block_start
+ iosize
- 1,
2439 EXTENT_LOCKED
, 0, NULL
, GFP_NOFS
);
2440 ret
= submit_extent_page(READ
, tree
, page
,
2441 sector
, iosize
, page_offset
, em
->bdev
,
2443 end_bio_extent_preparewrite
, 0);
2445 block_start
= block_start
+ iosize
;
2447 set_extent_uptodate(tree
, block_start
, cur_end
,
2449 unlock_extent(tree
, block_start
, cur_end
, GFP_NOFS
);
2450 block_start
= cur_end
+ 1;
2452 page_offset
= block_start
& (PAGE_CACHE_SIZE
- 1);
2453 free_extent_map(em
);
2456 wait_extent_bit(tree
, orig_block_start
,
2457 block_end
, EXTENT_LOCKED
);
2459 check_page_uptodate(tree
, page
);
2461 /* FIXME, zero out newly allocated blocks on error */
2464 EXPORT_SYMBOL(extent_prepare_write
);
2467 * a helper for releasepage. As long as there are no locked extents
2468 * in the range corresponding to the page, both state records and extent
2469 * map records are removed
2471 int try_release_extent_mapping(struct extent_map_tree
*map
,
2472 struct extent_io_tree
*tree
, struct page
*page
,
2475 struct extent_map
*em
;
2476 u64 start
= (u64
)page
->index
<< PAGE_CACHE_SHIFT
;
2477 u64 end
= start
+ PAGE_CACHE_SIZE
- 1;
2478 u64 orig_start
= start
;
2480 if ((mask
& __GFP_WAIT
) &&
2481 page
->mapping
->host
->i_size
> 16 * 1024 * 1024) {
2483 while (start
<= end
) {
2484 len
= end
- start
+ 1;
2485 spin_lock(&map
->lock
);
2486 em
= lookup_extent_mapping(map
, start
, len
);
2487 if (!em
|| IS_ERR(em
)) {
2488 spin_unlock(&map
->lock
);
2491 if (em
->start
!= start
) {
2492 spin_unlock(&map
->lock
);
2493 free_extent_map(em
);
2496 if (!test_range_bit(tree
, em
->start
,
2497 extent_map_end(em
) - 1,
2498 EXTENT_LOCKED
, 0)) {
2499 remove_extent_mapping(map
, em
);
2500 /* once for the rb tree */
2501 free_extent_map(em
);
2503 start
= extent_map_end(em
);
2504 spin_unlock(&map
->lock
);
2507 free_extent_map(em
);
2510 if (test_range_bit(tree
, orig_start
, end
, EXTENT_IOBITS
, 0))
2513 if ((mask
& GFP_NOFS
) == GFP_NOFS
)
2515 clear_extent_bit(tree
, orig_start
, end
, EXTENT_UPTODATE
,
2520 EXPORT_SYMBOL(try_release_extent_mapping
);
2522 sector_t
extent_bmap(struct address_space
*mapping
, sector_t iblock
,
2523 get_extent_t
*get_extent
)
2525 struct inode
*inode
= mapping
->host
;
2526 u64 start
= iblock
<< inode
->i_blkbits
;
2527 sector_t sector
= 0;
2528 struct extent_map
*em
;
2530 em
= get_extent(inode
, NULL
, 0, start
, (1 << inode
->i_blkbits
), 0);
2531 if (!em
|| IS_ERR(em
))
2534 if (em
->block_start
== EXTENT_MAP_INLINE
||
2535 em
->block_start
== EXTENT_MAP_HOLE
)
2538 sector
= (em
->block_start
+ start
- em
->start
) >> inode
->i_blkbits
;
2540 free_extent_map(em
);
2544 static int add_lru(struct extent_io_tree
*tree
, struct extent_buffer
*eb
)
2546 if (list_empty(&eb
->lru
)) {
2547 extent_buffer_get(eb
);
2548 list_add(&eb
->lru
, &tree
->buffer_lru
);
2550 if (tree
->lru_size
>= BUFFER_LRU_MAX
) {
2551 struct extent_buffer
*rm
;
2552 rm
= list_entry(tree
->buffer_lru
.prev
,
2553 struct extent_buffer
, lru
);
2555 list_del_init(&rm
->lru
);
2556 free_extent_buffer(rm
);
2559 list_move(&eb
->lru
, &tree
->buffer_lru
);
2562 static struct extent_buffer
*find_lru(struct extent_io_tree
*tree
,
2563 u64 start
, unsigned long len
)
2565 struct list_head
*lru
= &tree
->buffer_lru
;
2566 struct list_head
*cur
= lru
->next
;
2567 struct extent_buffer
*eb
;
2569 if (list_empty(lru
))
2573 eb
= list_entry(cur
, struct extent_buffer
, lru
);
2574 if (eb
->start
== start
&& eb
->len
== len
) {
2575 extent_buffer_get(eb
);
2579 } while (cur
!= lru
);
2583 static inline unsigned long num_extent_pages(u64 start
, u64 len
)
2585 return ((start
+ len
+ PAGE_CACHE_SIZE
- 1) >> PAGE_CACHE_SHIFT
) -
2586 (start
>> PAGE_CACHE_SHIFT
);
2589 static inline struct page
*extent_buffer_page(struct extent_buffer
*eb
,
2593 struct address_space
*mapping
;
2596 return eb
->first_page
;
2597 i
+= eb
->start
>> PAGE_CACHE_SHIFT
;
2598 mapping
= eb
->first_page
->mapping
;
2599 read_lock_irq(&mapping
->tree_lock
);
2600 p
= radix_tree_lookup(&mapping
->page_tree
, i
);
2601 read_unlock_irq(&mapping
->tree_lock
);
2605 int release_extent_buffer_tail_pages(struct extent_buffer
*eb
)
2607 unsigned long num_pages
= num_extent_pages(eb
->start
, eb
->len
);
2613 for (i
= 1; i
< num_pages
; i
++) {
2614 page
= extent_buffer_page(eb
, i
);
2615 page_cache_release(page
);
2621 int invalidate_extent_lru(struct extent_io_tree
*tree
, u64 start
,
2624 struct list_head
*lru
= &tree
->buffer_lru
;
2625 struct list_head
*cur
= lru
->next
;
2626 struct extent_buffer
*eb
;
2629 spin_lock(&tree
->lru_lock
);
2630 if (list_empty(lru
))
2634 eb
= list_entry(cur
, struct extent_buffer
, lru
);
2635 if (eb
->start
<= start
&& eb
->start
+ eb
->len
> start
) {
2636 eb
->flags
&= ~EXTENT_UPTODATE
;
2639 } while (cur
!= lru
);
2641 spin_unlock(&tree
->lru_lock
);
2645 static struct extent_buffer
*__alloc_extent_buffer(struct extent_io_tree
*tree
,
2650 struct extent_buffer
*eb
= NULL
;
2651 unsigned long flags
;
2653 spin_lock(&tree
->lru_lock
);
2654 eb
= find_lru(tree
, start
, len
);
2655 spin_unlock(&tree
->lru_lock
);
2660 eb
= kmem_cache_zalloc(extent_buffer_cache
, mask
);
2661 INIT_LIST_HEAD(&eb
->lru
);
2664 spin_lock_irqsave(&leak_lock
, flags
);
2665 list_add(&eb
->leak_list
, &buffers
);
2666 spin_unlock_irqrestore(&leak_lock
, flags
);
2667 atomic_set(&eb
->refs
, 1);
2672 static void __free_extent_buffer(struct extent_buffer
*eb
)
2674 unsigned long flags
;
2675 spin_lock_irqsave(&leak_lock
, flags
);
2676 list_del(&eb
->leak_list
);
2677 spin_unlock_irqrestore(&leak_lock
, flags
);
2678 kmem_cache_free(extent_buffer_cache
, eb
);
2681 struct extent_buffer
*alloc_extent_buffer(struct extent_io_tree
*tree
,
2682 u64 start
, unsigned long len
,
2686 unsigned long num_pages
= num_extent_pages(start
, len
);
2688 unsigned long index
= start
>> PAGE_CACHE_SHIFT
;
2689 struct extent_buffer
*eb
;
2691 struct address_space
*mapping
= tree
->mapping
;
2694 eb
= __alloc_extent_buffer(tree
, start
, len
, mask
);
2698 if (eb
->flags
& EXTENT_BUFFER_FILLED
)
2702 eb
->first_page
= page0
;
2705 page_cache_get(page0
);
2706 mark_page_accessed(page0
);
2707 set_page_extent_mapped(page0
);
2708 set_page_extent_head(page0
, len
);
2709 uptodate
= PageUptodate(page0
);
2713 for (; i
< num_pages
; i
++, index
++) {
2714 p
= find_or_create_page(mapping
, index
, mask
| __GFP_HIGHMEM
);
2719 set_page_extent_mapped(p
);
2720 mark_page_accessed(p
);
2723 set_page_extent_head(p
, len
);
2725 set_page_private(p
, EXTENT_PAGE_PRIVATE
);
2727 if (!PageUptodate(p
))
2732 eb
->flags
|= EXTENT_UPTODATE
;
2733 eb
->flags
|= EXTENT_BUFFER_FILLED
;
2736 spin_lock(&tree
->lru_lock
);
2738 spin_unlock(&tree
->lru_lock
);
2742 spin_lock(&tree
->lru_lock
);
2743 list_del_init(&eb
->lru
);
2744 spin_unlock(&tree
->lru_lock
);
2745 if (!atomic_dec_and_test(&eb
->refs
))
2747 for (index
= 1; index
< i
; index
++) {
2748 page_cache_release(extent_buffer_page(eb
, index
));
2751 page_cache_release(extent_buffer_page(eb
, 0));
2752 __free_extent_buffer(eb
);
2755 EXPORT_SYMBOL(alloc_extent_buffer
);
2757 struct extent_buffer
*find_extent_buffer(struct extent_io_tree
*tree
,
2758 u64 start
, unsigned long len
,
2761 unsigned long num_pages
= num_extent_pages(start
, len
);
2763 unsigned long index
= start
>> PAGE_CACHE_SHIFT
;
2764 struct extent_buffer
*eb
;
2766 struct address_space
*mapping
= tree
->mapping
;
2769 eb
= __alloc_extent_buffer(tree
, start
, len
, mask
);
2773 if (eb
->flags
& EXTENT_BUFFER_FILLED
)
2776 for (i
= 0; i
< num_pages
; i
++, index
++) {
2777 p
= find_lock_page(mapping
, index
);
2781 set_page_extent_mapped(p
);
2782 mark_page_accessed(p
);
2786 set_page_extent_head(p
, len
);
2788 set_page_private(p
, EXTENT_PAGE_PRIVATE
);
2791 if (!PageUptodate(p
))
2796 eb
->flags
|= EXTENT_UPTODATE
;
2797 eb
->flags
|= EXTENT_BUFFER_FILLED
;
2800 spin_lock(&tree
->lru_lock
);
2802 spin_unlock(&tree
->lru_lock
);
2805 spin_lock(&tree
->lru_lock
);
2806 list_del_init(&eb
->lru
);
2807 spin_unlock(&tree
->lru_lock
);
2808 if (!atomic_dec_and_test(&eb
->refs
))
2810 for (index
= 1; index
< i
; index
++) {
2811 page_cache_release(extent_buffer_page(eb
, index
));
2814 page_cache_release(extent_buffer_page(eb
, 0));
2815 __free_extent_buffer(eb
);
2818 EXPORT_SYMBOL(find_extent_buffer
);
2820 void free_extent_buffer(struct extent_buffer
*eb
)
2823 unsigned long num_pages
;
2828 if (!atomic_dec_and_test(&eb
->refs
))
2831 WARN_ON(!list_empty(&eb
->lru
));
2832 num_pages
= num_extent_pages(eb
->start
, eb
->len
);
2834 for (i
= 1; i
< num_pages
; i
++) {
2835 page_cache_release(extent_buffer_page(eb
, i
));
2837 page_cache_release(extent_buffer_page(eb
, 0));
2838 __free_extent_buffer(eb
);
2840 EXPORT_SYMBOL(free_extent_buffer
);
2842 int clear_extent_buffer_dirty(struct extent_io_tree
*tree
,
2843 struct extent_buffer
*eb
)
2847 unsigned long num_pages
;
2850 u64 start
= eb
->start
;
2851 u64 end
= start
+ eb
->len
- 1;
2853 set
= clear_extent_dirty(tree
, start
, end
, GFP_NOFS
);
2854 num_pages
= num_extent_pages(eb
->start
, eb
->len
);
2856 for (i
= 0; i
< num_pages
; i
++) {
2857 page
= extent_buffer_page(eb
, i
);
2860 set_page_extent_head(page
, eb
->len
);
2862 set_page_private(page
, EXTENT_PAGE_PRIVATE
);
2865 * if we're on the last page or the first page and the
2866 * block isn't aligned on a page boundary, do extra checks
2867 * to make sure we don't clean page that is partially dirty
2869 if ((i
== 0 && (eb
->start
& (PAGE_CACHE_SIZE
- 1))) ||
2870 ((i
== num_pages
- 1) &&
2871 ((eb
->start
+ eb
->len
) & (PAGE_CACHE_SIZE
- 1)))) {
2872 start
= (u64
)page
->index
<< PAGE_CACHE_SHIFT
;
2873 end
= start
+ PAGE_CACHE_SIZE
- 1;
2874 if (test_range_bit(tree
, start
, end
,
2880 clear_page_dirty_for_io(page
);
2881 read_lock_irq(&page
->mapping
->tree_lock
);
2882 if (!PageDirty(page
)) {
2883 radix_tree_tag_clear(&page
->mapping
->page_tree
,
2885 PAGECACHE_TAG_DIRTY
);
2887 read_unlock_irq(&page
->mapping
->tree_lock
);
2892 EXPORT_SYMBOL(clear_extent_buffer_dirty
);
2894 int wait_on_extent_buffer_writeback(struct extent_io_tree
*tree
,
2895 struct extent_buffer
*eb
)
2897 return wait_on_extent_writeback(tree
, eb
->start
,
2898 eb
->start
+ eb
->len
- 1);
2900 EXPORT_SYMBOL(wait_on_extent_buffer_writeback
);
2902 int set_extent_buffer_dirty(struct extent_io_tree
*tree
,
2903 struct extent_buffer
*eb
)
2906 unsigned long num_pages
;
2908 num_pages
= num_extent_pages(eb
->start
, eb
->len
);
2909 for (i
= 0; i
< num_pages
; i
++) {
2910 struct page
*page
= extent_buffer_page(eb
, i
);
2911 /* writepage may need to do something special for the
2912 * first page, we have to make sure page->private is
2913 * properly set. releasepage may drop page->private
2914 * on us if the page isn't already dirty.
2918 set_page_extent_head(page
, eb
->len
);
2919 } else if (PagePrivate(page
) &&
2920 page
->private != EXTENT_PAGE_PRIVATE
) {
2922 set_page_extent_mapped(page
);
2925 __set_page_dirty_nobuffers(extent_buffer_page(eb
, i
));
2929 return set_extent_dirty(tree
, eb
->start
,
2930 eb
->start
+ eb
->len
- 1, GFP_NOFS
);
2932 EXPORT_SYMBOL(set_extent_buffer_dirty
);
2934 int set_extent_buffer_uptodate(struct extent_io_tree
*tree
,
2935 struct extent_buffer
*eb
)
2939 unsigned long num_pages
;
2941 num_pages
= num_extent_pages(eb
->start
, eb
->len
);
2943 set_extent_uptodate(tree
, eb
->start
, eb
->start
+ eb
->len
- 1,
2945 for (i
= 0; i
< num_pages
; i
++) {
2946 page
= extent_buffer_page(eb
, i
);
2947 if ((i
== 0 && (eb
->start
& (PAGE_CACHE_SIZE
- 1))) ||
2948 ((i
== num_pages
- 1) &&
2949 ((eb
->start
+ eb
->len
) & (PAGE_CACHE_SIZE
- 1)))) {
2950 check_page_uptodate(tree
, page
);
2953 SetPageUptodate(page
);
2957 EXPORT_SYMBOL(set_extent_buffer_uptodate
);
2959 int extent_range_uptodate(struct extent_io_tree
*tree
,
2964 int pg_uptodate
= 1;
2966 unsigned long index
;
2968 ret
= test_range_bit(tree
, start
, end
, EXTENT_UPTODATE
, 1);
2971 while(start
<= end
) {
2972 index
= start
>> PAGE_CACHE_SHIFT
;
2973 page
= find_get_page(tree
->mapping
, index
);
2974 uptodate
= PageUptodate(page
);
2975 page_cache_release(page
);
2980 start
+= PAGE_CACHE_SIZE
;
2985 int extent_buffer_uptodate(struct extent_io_tree
*tree
,
2986 struct extent_buffer
*eb
)
2990 unsigned long num_pages
;
2993 int pg_uptodate
= 1;
2995 if (eb
->flags
& EXTENT_UPTODATE
)
2998 ret2
= test_range_bit(tree
, eb
->start
, eb
->start
+ eb
->len
- 1,
2999 EXTENT_UPTODATE
, 1);
3001 num_pages
= num_extent_pages(eb
->start
, eb
->len
);
3002 for (i
= 0; i
< num_pages
; i
++) {
3003 page
= extent_buffer_page(eb
, i
);
3004 if (!PageUptodate(page
)) {
3009 if ((ret
|| ret2
) && !pg_uptodate
) {
3010 printk("uptodate error2 eb %Lu ret %d ret2 %d pg_uptodate %d\n", eb
->start
, ret
, ret2
, pg_uptodate
);
3013 return (ret
|| ret2
);
3015 EXPORT_SYMBOL(extent_buffer_uptodate
);
3017 int read_extent_buffer_pages(struct extent_io_tree
*tree
,
3018 struct extent_buffer
*eb
,
3019 u64 start
, int wait
,
3020 get_extent_t
*get_extent
, int mirror_num
)
3023 unsigned long start_i
;
3027 int locked_pages
= 0;
3028 int all_uptodate
= 1;
3029 int inc_all_pages
= 0;
3030 unsigned long num_pages
;
3031 struct bio
*bio
= NULL
;
3033 if (eb
->flags
& EXTENT_UPTODATE
)
3036 if (test_range_bit(tree
, eb
->start
, eb
->start
+ eb
->len
- 1,
3037 EXTENT_UPTODATE
, 1)) {
3042 WARN_ON(start
< eb
->start
);
3043 start_i
= (start
>> PAGE_CACHE_SHIFT
) -
3044 (eb
->start
>> PAGE_CACHE_SHIFT
);
3049 num_pages
= num_extent_pages(eb
->start
, eb
->len
);
3050 for (i
= start_i
; i
< num_pages
; i
++) {
3051 page
= extent_buffer_page(eb
, i
);
3053 if (TestSetPageLocked(page
))
3059 if (!PageUptodate(page
)) {
3065 eb
->flags
|= EXTENT_UPTODATE
;
3069 for (i
= start_i
; i
< num_pages
; i
++) {
3070 page
= extent_buffer_page(eb
, i
);
3072 page_cache_get(page
);
3073 if (!PageUptodate(page
)) {
3076 ClearPageError(page
);
3077 err
= __extent_read_full_page(tree
, page
,
3089 submit_one_bio(READ
, bio
, mirror_num
);
3094 for (i
= start_i
; i
< num_pages
; i
++) {
3095 page
= extent_buffer_page(eb
, i
);
3096 wait_on_page_locked(page
);
3097 if (!PageUptodate(page
)) {
3102 eb
->flags
|= EXTENT_UPTODATE
;
3107 while(locked_pages
> 0) {
3108 page
= extent_buffer_page(eb
, i
);
3115 EXPORT_SYMBOL(read_extent_buffer_pages
);
3117 void read_extent_buffer(struct extent_buffer
*eb
, void *dstv
,
3118 unsigned long start
,
3125 char *dst
= (char *)dstv
;
3126 size_t start_offset
= eb
->start
& ((u64
)PAGE_CACHE_SIZE
- 1);
3127 unsigned long i
= (start_offset
+ start
) >> PAGE_CACHE_SHIFT
;
3129 WARN_ON(start
> eb
->len
);
3130 WARN_ON(start
+ len
> eb
->start
+ eb
->len
);
3132 offset
= (start_offset
+ start
) & ((unsigned long)PAGE_CACHE_SIZE
- 1);
3135 page
= extent_buffer_page(eb
, i
);
3137 cur
= min(len
, (PAGE_CACHE_SIZE
- offset
));
3138 kaddr
= kmap_atomic(page
, KM_USER1
);
3139 memcpy(dst
, kaddr
+ offset
, cur
);
3140 kunmap_atomic(kaddr
, KM_USER1
);
3148 EXPORT_SYMBOL(read_extent_buffer
);
3150 int map_private_extent_buffer(struct extent_buffer
*eb
, unsigned long start
,
3151 unsigned long min_len
, char **token
, char **map
,
3152 unsigned long *map_start
,
3153 unsigned long *map_len
, int km
)
3155 size_t offset
= start
& (PAGE_CACHE_SIZE
- 1);
3158 size_t start_offset
= eb
->start
& ((u64
)PAGE_CACHE_SIZE
- 1);
3159 unsigned long i
= (start_offset
+ start
) >> PAGE_CACHE_SHIFT
;
3160 unsigned long end_i
= (start_offset
+ start
+ min_len
- 1) >>
3167 offset
= start_offset
;
3171 *map_start
= ((u64
)i
<< PAGE_CACHE_SHIFT
) - start_offset
;
3173 if (start
+ min_len
> eb
->len
) {
3174 printk("bad mapping eb start %Lu len %lu, wanted %lu %lu\n", eb
->start
, eb
->len
, start
, min_len
);
3178 p
= extent_buffer_page(eb
, i
);
3179 kaddr
= kmap_atomic(p
, km
);
3181 *map
= kaddr
+ offset
;
3182 *map_len
= PAGE_CACHE_SIZE
- offset
;
3185 EXPORT_SYMBOL(map_private_extent_buffer
);
3187 int map_extent_buffer(struct extent_buffer
*eb
, unsigned long start
,
3188 unsigned long min_len
,
3189 char **token
, char **map
,
3190 unsigned long *map_start
,
3191 unsigned long *map_len
, int km
)
3195 if (eb
->map_token
) {
3196 unmap_extent_buffer(eb
, eb
->map_token
, km
);
3197 eb
->map_token
= NULL
;
3200 err
= map_private_extent_buffer(eb
, start
, min_len
, token
, map
,
3201 map_start
, map_len
, km
);
3203 eb
->map_token
= *token
;
3205 eb
->map_start
= *map_start
;
3206 eb
->map_len
= *map_len
;
3210 EXPORT_SYMBOL(map_extent_buffer
);
3212 void unmap_extent_buffer(struct extent_buffer
*eb
, char *token
, int km
)
3214 kunmap_atomic(token
, km
);
3216 EXPORT_SYMBOL(unmap_extent_buffer
);
3218 int memcmp_extent_buffer(struct extent_buffer
*eb
, const void *ptrv
,
3219 unsigned long start
,
3226 char *ptr
= (char *)ptrv
;
3227 size_t start_offset
= eb
->start
& ((u64
)PAGE_CACHE_SIZE
- 1);
3228 unsigned long i
= (start_offset
+ start
) >> PAGE_CACHE_SHIFT
;
3231 WARN_ON(start
> eb
->len
);
3232 WARN_ON(start
+ len
> eb
->start
+ eb
->len
);
3234 offset
= (start_offset
+ start
) & ((unsigned long)PAGE_CACHE_SIZE
- 1);
3237 page
= extent_buffer_page(eb
, i
);
3239 cur
= min(len
, (PAGE_CACHE_SIZE
- offset
));
3241 kaddr
= kmap_atomic(page
, KM_USER0
);
3242 ret
= memcmp(ptr
, kaddr
+ offset
, cur
);
3243 kunmap_atomic(kaddr
, KM_USER0
);
3254 EXPORT_SYMBOL(memcmp_extent_buffer
);
3256 void write_extent_buffer(struct extent_buffer
*eb
, const void *srcv
,
3257 unsigned long start
, unsigned long len
)
3263 char *src
= (char *)srcv
;
3264 size_t start_offset
= eb
->start
& ((u64
)PAGE_CACHE_SIZE
- 1);
3265 unsigned long i
= (start_offset
+ start
) >> PAGE_CACHE_SHIFT
;
3267 WARN_ON(start
> eb
->len
);
3268 WARN_ON(start
+ len
> eb
->start
+ eb
->len
);
3270 offset
= (start_offset
+ start
) & ((unsigned long)PAGE_CACHE_SIZE
- 1);
3273 page
= extent_buffer_page(eb
, i
);
3274 WARN_ON(!PageUptodate(page
));
3276 cur
= min(len
, PAGE_CACHE_SIZE
- offset
);
3277 kaddr
= kmap_atomic(page
, KM_USER1
);
3278 memcpy(kaddr
+ offset
, src
, cur
);
3279 kunmap_atomic(kaddr
, KM_USER1
);
3287 EXPORT_SYMBOL(write_extent_buffer
);
3289 void memset_extent_buffer(struct extent_buffer
*eb
, char c
,
3290 unsigned long start
, unsigned long len
)
3296 size_t start_offset
= eb
->start
& ((u64
)PAGE_CACHE_SIZE
- 1);
3297 unsigned long i
= (start_offset
+ start
) >> PAGE_CACHE_SHIFT
;
3299 WARN_ON(start
> eb
->len
);
3300 WARN_ON(start
+ len
> eb
->start
+ eb
->len
);
3302 offset
= (start_offset
+ start
) & ((unsigned long)PAGE_CACHE_SIZE
- 1);
3305 page
= extent_buffer_page(eb
, i
);
3306 WARN_ON(!PageUptodate(page
));
3308 cur
= min(len
, PAGE_CACHE_SIZE
- offset
);
3309 kaddr
= kmap_atomic(page
, KM_USER0
);
3310 memset(kaddr
+ offset
, c
, cur
);
3311 kunmap_atomic(kaddr
, KM_USER0
);
3318 EXPORT_SYMBOL(memset_extent_buffer
);
3320 void copy_extent_buffer(struct extent_buffer
*dst
, struct extent_buffer
*src
,
3321 unsigned long dst_offset
, unsigned long src_offset
,
3324 u64 dst_len
= dst
->len
;
3329 size_t start_offset
= dst
->start
& ((u64
)PAGE_CACHE_SIZE
- 1);
3330 unsigned long i
= (start_offset
+ dst_offset
) >> PAGE_CACHE_SHIFT
;
3332 WARN_ON(src
->len
!= dst_len
);
3334 offset
= (start_offset
+ dst_offset
) &
3335 ((unsigned long)PAGE_CACHE_SIZE
- 1);
3338 page
= extent_buffer_page(dst
, i
);
3339 WARN_ON(!PageUptodate(page
));
3341 cur
= min(len
, (unsigned long)(PAGE_CACHE_SIZE
- offset
));
3343 kaddr
= kmap_atomic(page
, KM_USER0
);
3344 read_extent_buffer(src
, kaddr
+ offset
, src_offset
, cur
);
3345 kunmap_atomic(kaddr
, KM_USER0
);
3353 EXPORT_SYMBOL(copy_extent_buffer
);
3355 static void move_pages(struct page
*dst_page
, struct page
*src_page
,
3356 unsigned long dst_off
, unsigned long src_off
,
3359 char *dst_kaddr
= kmap_atomic(dst_page
, KM_USER0
);
3360 if (dst_page
== src_page
) {
3361 memmove(dst_kaddr
+ dst_off
, dst_kaddr
+ src_off
, len
);
3363 char *src_kaddr
= kmap_atomic(src_page
, KM_USER1
);
3364 char *p
= dst_kaddr
+ dst_off
+ len
;
3365 char *s
= src_kaddr
+ src_off
+ len
;
3370 kunmap_atomic(src_kaddr
, KM_USER1
);
3372 kunmap_atomic(dst_kaddr
, KM_USER0
);
3375 static void copy_pages(struct page
*dst_page
, struct page
*src_page
,
3376 unsigned long dst_off
, unsigned long src_off
,
3379 char *dst_kaddr
= kmap_atomic(dst_page
, KM_USER0
);
3382 if (dst_page
!= src_page
)
3383 src_kaddr
= kmap_atomic(src_page
, KM_USER1
);
3385 src_kaddr
= dst_kaddr
;
3387 memcpy(dst_kaddr
+ dst_off
, src_kaddr
+ src_off
, len
);
3388 kunmap_atomic(dst_kaddr
, KM_USER0
);
3389 if (dst_page
!= src_page
)
3390 kunmap_atomic(src_kaddr
, KM_USER1
);
3393 void memcpy_extent_buffer(struct extent_buffer
*dst
, unsigned long dst_offset
,
3394 unsigned long src_offset
, unsigned long len
)
3397 size_t dst_off_in_page
;
3398 size_t src_off_in_page
;
3399 size_t start_offset
= dst
->start
& ((u64
)PAGE_CACHE_SIZE
- 1);
3400 unsigned long dst_i
;
3401 unsigned long src_i
;
3403 if (src_offset
+ len
> dst
->len
) {
3404 printk("memmove bogus src_offset %lu move len %lu len %lu\n",
3405 src_offset
, len
, dst
->len
);
3408 if (dst_offset
+ len
> dst
->len
) {
3409 printk("memmove bogus dst_offset %lu move len %lu len %lu\n",
3410 dst_offset
, len
, dst
->len
);
3415 dst_off_in_page
= (start_offset
+ dst_offset
) &
3416 ((unsigned long)PAGE_CACHE_SIZE
- 1);
3417 src_off_in_page
= (start_offset
+ src_offset
) &
3418 ((unsigned long)PAGE_CACHE_SIZE
- 1);
3420 dst_i
= (start_offset
+ dst_offset
) >> PAGE_CACHE_SHIFT
;
3421 src_i
= (start_offset
+ src_offset
) >> PAGE_CACHE_SHIFT
;
3423 cur
= min(len
, (unsigned long)(PAGE_CACHE_SIZE
-
3425 cur
= min_t(unsigned long, cur
,
3426 (unsigned long)(PAGE_CACHE_SIZE
- dst_off_in_page
));
3428 copy_pages(extent_buffer_page(dst
, dst_i
),
3429 extent_buffer_page(dst
, src_i
),
3430 dst_off_in_page
, src_off_in_page
, cur
);
3437 EXPORT_SYMBOL(memcpy_extent_buffer
);
3439 void memmove_extent_buffer(struct extent_buffer
*dst
, unsigned long dst_offset
,
3440 unsigned long src_offset
, unsigned long len
)
3443 size_t dst_off_in_page
;
3444 size_t src_off_in_page
;
3445 unsigned long dst_end
= dst_offset
+ len
- 1;
3446 unsigned long src_end
= src_offset
+ len
- 1;
3447 size_t start_offset
= dst
->start
& ((u64
)PAGE_CACHE_SIZE
- 1);
3448 unsigned long dst_i
;
3449 unsigned long src_i
;
3451 if (src_offset
+ len
> dst
->len
) {
3452 printk("memmove bogus src_offset %lu move len %lu len %lu\n",
3453 src_offset
, len
, dst
->len
);
3456 if (dst_offset
+ len
> dst
->len
) {
3457 printk("memmove bogus dst_offset %lu move len %lu len %lu\n",
3458 dst_offset
, len
, dst
->len
);
3461 if (dst_offset
< src_offset
) {
3462 memcpy_extent_buffer(dst
, dst_offset
, src_offset
, len
);
3466 dst_i
= (start_offset
+ dst_end
) >> PAGE_CACHE_SHIFT
;
3467 src_i
= (start_offset
+ src_end
) >> PAGE_CACHE_SHIFT
;
3469 dst_off_in_page
= (start_offset
+ dst_end
) &
3470 ((unsigned long)PAGE_CACHE_SIZE
- 1);
3471 src_off_in_page
= (start_offset
+ src_end
) &
3472 ((unsigned long)PAGE_CACHE_SIZE
- 1);
3474 cur
= min_t(unsigned long, len
, src_off_in_page
+ 1);
3475 cur
= min(cur
, dst_off_in_page
+ 1);
3476 move_pages(extent_buffer_page(dst
, dst_i
),
3477 extent_buffer_page(dst
, src_i
),
3478 dst_off_in_page
- cur
+ 1,
3479 src_off_in_page
- cur
+ 1, cur
);
3486 EXPORT_SYMBOL(memmove_extent_buffer
);