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_map.h"
17 /* temporary define until extent_map moves out of btrfs */
18 struct kmem_cache *btrfs_cache_create(const char *name, size_t size,
19 unsigned long extra_flags,
20 void (*ctor)(void *, struct kmem_cache *,
23 static struct kmem_cache *extent_map_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);
30 static spinlock_t state_lock = SPIN_LOCK_UNLOCKED;
31 #define BUFFER_LRU_MAX 64
37 struct rb_node rb_node;
40 struct extent_page_data {
42 struct extent_map_tree *tree;
43 get_extent_t *get_extent;
46 int __init extent_map_init(void)
48 extent_map_cache = btrfs_cache_create("extent_map",
49 sizeof(struct extent_map), 0,
51 if (!extent_map_cache)
53 extent_state_cache = btrfs_cache_create("extent_state",
54 sizeof(struct extent_state), 0,
56 if (!extent_state_cache)
58 extent_buffer_cache = btrfs_cache_create("extent_buffers",
59 sizeof(struct extent_buffer), 0,
61 if (!extent_buffer_cache)
62 goto free_state_cache;
66 kmem_cache_destroy(extent_state_cache);
68 kmem_cache_destroy(extent_map_cache);
72 void extent_map_exit(void)
74 struct extent_state *state;
76 while (!list_empty(&states)) {
77 state = list_entry(states.next, struct extent_state, list);
78 printk("state leak: start %Lu end %Lu state %lu in tree %d refs %d\n", state->start, state->end, state->state, state->in_tree, atomic_read(&state->refs));
79 list_del(&state->list);
80 kmem_cache_free(extent_state_cache, state);
85 kmem_cache_destroy(extent_map_cache);
86 if (extent_state_cache)
87 kmem_cache_destroy(extent_state_cache);
88 if (extent_buffer_cache)
89 kmem_cache_destroy(extent_buffer_cache);
92 void extent_map_tree_init(struct extent_map_tree *tree,
93 struct address_space *mapping, gfp_t mask)
95 tree->map.rb_node = NULL;
96 tree->state.rb_node = NULL;
98 tree->dirty_bytes = 0;
99 rwlock_init(&tree->lock);
100 spin_lock_init(&tree->lru_lock);
101 tree->mapping = mapping;
102 INIT_LIST_HEAD(&tree->buffer_lru);
105 EXPORT_SYMBOL(extent_map_tree_init);
107 void extent_map_tree_empty_lru(struct extent_map_tree *tree)
109 struct extent_buffer *eb;
110 while(!list_empty(&tree->buffer_lru)) {
111 eb = list_entry(tree->buffer_lru.next, struct extent_buffer,
113 list_del_init(&eb->lru);
114 free_extent_buffer(eb);
117 EXPORT_SYMBOL(extent_map_tree_empty_lru);
119 struct extent_map *alloc_extent_map(gfp_t mask)
121 struct extent_map *em;
122 em = kmem_cache_alloc(extent_map_cache, mask);
123 if (!em || IS_ERR(em))
126 atomic_set(&em->refs, 1);
129 EXPORT_SYMBOL(alloc_extent_map);
131 void free_extent_map(struct extent_map *em)
135 if (atomic_dec_and_test(&em->refs)) {
136 WARN_ON(em->in_tree);
137 kmem_cache_free(extent_map_cache, em);
140 EXPORT_SYMBOL(free_extent_map);
143 struct extent_state *alloc_extent_state(gfp_t mask)
145 struct extent_state *state;
148 state = kmem_cache_alloc(extent_state_cache, mask);
149 if (!state || IS_ERR(state))
155 spin_lock_irqsave(&state_lock, flags);
156 list_add(&state->list, &states);
157 spin_unlock_irqrestore(&state_lock, flags);
159 atomic_set(&state->refs, 1);
160 init_waitqueue_head(&state->wq);
163 EXPORT_SYMBOL(alloc_extent_state);
165 void free_extent_state(struct extent_state *state)
170 if (atomic_dec_and_test(&state->refs)) {
171 WARN_ON(state->in_tree);
172 spin_lock_irqsave(&state_lock, flags);
173 list_del(&state->list);
174 spin_unlock_irqrestore(&state_lock, flags);
175 kmem_cache_free(extent_state_cache, state);
178 EXPORT_SYMBOL(free_extent_state);
180 static struct rb_node *tree_insert(struct rb_root *root, u64 offset,
181 struct rb_node *node)
183 struct rb_node ** p = &root->rb_node;
184 struct rb_node * parent = NULL;
185 struct tree_entry *entry;
189 entry = rb_entry(parent, struct tree_entry, rb_node);
191 if (offset < entry->start)
193 else if (offset > entry->end)
199 entry = rb_entry(node, struct tree_entry, rb_node);
201 rb_link_node(node, parent, p);
202 rb_insert_color(node, root);
206 static struct rb_node *__tree_search(struct rb_root *root, u64 offset,
207 struct rb_node **prev_ret)
209 struct rb_node * n = root->rb_node;
210 struct rb_node *prev = NULL;
211 struct tree_entry *entry;
212 struct tree_entry *prev_entry = NULL;
215 entry = rb_entry(n, struct tree_entry, rb_node);
219 if (offset < entry->start)
221 else if (offset > entry->end)
228 while(prev && offset > prev_entry->end) {
229 prev = rb_next(prev);
230 prev_entry = rb_entry(prev, struct tree_entry, rb_node);
236 static inline struct rb_node *tree_search(struct rb_root *root, u64 offset)
238 struct rb_node *prev;
240 ret = __tree_search(root, offset, &prev);
246 static int tree_delete(struct rb_root *root, u64 offset)
248 struct rb_node *node;
249 struct tree_entry *entry;
251 node = __tree_search(root, offset, NULL);
254 entry = rb_entry(node, struct tree_entry, rb_node);
256 rb_erase(node, root);
261 * add_extent_mapping tries a simple backward merge with existing
262 * mappings. The extent_map struct passed in will be inserted into
263 * the tree directly (no copies made, just a reference taken).
265 int add_extent_mapping(struct extent_map_tree *tree,
266 struct extent_map *em)
269 struct extent_map *prev = NULL;
272 write_lock_irq(&tree->lock);
273 rb = tree_insert(&tree->map, em->end, &em->rb_node);
275 prev = rb_entry(rb, struct extent_map, rb_node);
276 printk("found extent map %Lu %Lu on insert of %Lu %Lu\n", prev->start, prev->end, em->start, em->end);
280 atomic_inc(&em->refs);
281 if (em->start != 0) {
282 rb = rb_prev(&em->rb_node);
284 prev = rb_entry(rb, struct extent_map, rb_node);
285 if (prev && prev->end + 1 == em->start &&
286 ((em->block_start == EXTENT_MAP_HOLE &&
287 prev->block_start == EXTENT_MAP_HOLE) ||
288 (em->block_start == EXTENT_MAP_INLINE &&
289 prev->block_start == EXTENT_MAP_INLINE) ||
290 (em->block_start == EXTENT_MAP_DELALLOC &&
291 prev->block_start == EXTENT_MAP_DELALLOC) ||
292 (em->block_start < EXTENT_MAP_DELALLOC - 1 &&
293 em->block_start == prev->block_end + 1))) {
294 em->start = prev->start;
295 em->block_start = prev->block_start;
296 rb_erase(&prev->rb_node, &tree->map);
298 free_extent_map(prev);
302 write_unlock_irq(&tree->lock);
305 EXPORT_SYMBOL(add_extent_mapping);
308 * lookup_extent_mapping returns the first extent_map struct in the
309 * tree that intersects the [start, end] (inclusive) range. There may
310 * be additional objects in the tree that intersect, so check the object
311 * returned carefully to make sure you don't need additional lookups.
313 struct extent_map *lookup_extent_mapping(struct extent_map_tree *tree,
316 struct extent_map *em;
317 struct rb_node *rb_node;
319 read_lock_irq(&tree->lock);
320 rb_node = tree_search(&tree->map, start);
325 if (IS_ERR(rb_node)) {
326 em = ERR_PTR(PTR_ERR(rb_node));
329 em = rb_entry(rb_node, struct extent_map, rb_node);
330 if (em->end < start || em->start > end) {
334 atomic_inc(&em->refs);
336 read_unlock_irq(&tree->lock);
339 EXPORT_SYMBOL(lookup_extent_mapping);
342 * removes an extent_map struct from the tree. No reference counts are
343 * dropped, and no checks are done to see if the range is in use
345 int remove_extent_mapping(struct extent_map_tree *tree, struct extent_map *em)
349 write_lock_irq(&tree->lock);
350 ret = tree_delete(&tree->map, em->end);
351 write_unlock_irq(&tree->lock);
354 EXPORT_SYMBOL(remove_extent_mapping);
357 * utility function to look for merge candidates inside a given range.
358 * Any extents with matching state are merged together into a single
359 * extent in the tree. Extents with EXTENT_IO in their state field
360 * are not merged because the end_io handlers need to be able to do
361 * operations on them without sleeping (or doing allocations/splits).
363 * This should be called with the tree lock held.
365 static int merge_state(struct extent_map_tree *tree,
366 struct extent_state *state)
368 struct extent_state *other;
369 struct rb_node *other_node;
371 if (state->state & EXTENT_IOBITS)
374 other_node = rb_prev(&state->rb_node);
376 other = rb_entry(other_node, struct extent_state, rb_node);
377 if (other->end == state->start - 1 &&
378 other->state == state->state) {
379 state->start = other->start;
381 rb_erase(&other->rb_node, &tree->state);
382 free_extent_state(other);
385 other_node = rb_next(&state->rb_node);
387 other = rb_entry(other_node, struct extent_state, rb_node);
388 if (other->start == state->end + 1 &&
389 other->state == state->state) {
390 other->start = state->start;
392 rb_erase(&state->rb_node, &tree->state);
393 free_extent_state(state);
400 * insert an extent_state struct into the tree. 'bits' are set on the
401 * struct before it is inserted.
403 * This may return -EEXIST if the extent is already there, in which case the
404 * state struct is freed.
406 * The tree lock is not taken internally. This is a utility function and
407 * probably isn't what you want to call (see set/clear_extent_bit).
409 static int insert_state(struct extent_map_tree *tree,
410 struct extent_state *state, u64 start, u64 end,
413 struct rb_node *node;
416 printk("end < start %Lu %Lu\n", end, start);
419 if (bits & EXTENT_DIRTY)
420 tree->dirty_bytes += end - start + 1;
421 state->state |= bits;
422 state->start = start;
424 node = tree_insert(&tree->state, end, &state->rb_node);
426 struct extent_state *found;
427 found = rb_entry(node, struct extent_state, rb_node);
428 printk("found node %Lu %Lu on insert of %Lu %Lu\n", found->start, found->end, start, end);
429 free_extent_state(state);
432 merge_state(tree, state);
437 * split a given extent state struct in two, inserting the preallocated
438 * struct 'prealloc' as the newly created second half. 'split' indicates an
439 * offset inside 'orig' where it should be split.
442 * the tree has 'orig' at [orig->start, orig->end]. After calling, there
443 * are two extent state structs in the tree:
444 * prealloc: [orig->start, split - 1]
445 * orig: [ split, orig->end ]
447 * The tree locks are not taken by this function. They need to be held
450 static int split_state(struct extent_map_tree *tree, struct extent_state *orig,
451 struct extent_state *prealloc, u64 split)
453 struct rb_node *node;
454 prealloc->start = orig->start;
455 prealloc->end = split - 1;
456 prealloc->state = orig->state;
459 node = tree_insert(&tree->state, prealloc->end, &prealloc->rb_node);
461 struct extent_state *found;
462 found = rb_entry(node, struct extent_state, rb_node);
463 printk("found node %Lu %Lu on insert of %Lu %Lu\n", found->start, found->end, prealloc->start, prealloc->end);
464 free_extent_state(prealloc);
471 * utility function to clear some bits in an extent state struct.
472 * it will optionally wake up any one waiting on this state (wake == 1), or
473 * forcibly remove the state from the tree (delete == 1).
475 * If no bits are set on the state struct after clearing things, the
476 * struct is freed and removed from the tree
478 static int clear_state_bit(struct extent_map_tree *tree,
479 struct extent_state *state, int bits, int wake,
482 int ret = state->state & bits;
484 if ((bits & EXTENT_DIRTY) && (state->state & EXTENT_DIRTY)) {
485 u64 range = state->end - state->start + 1;
486 WARN_ON(range > tree->dirty_bytes);
487 tree->dirty_bytes -= range;
489 state->state &= ~bits;
492 if (delete || state->state == 0) {
493 if (state->in_tree) {
494 rb_erase(&state->rb_node, &tree->state);
496 free_extent_state(state);
501 merge_state(tree, state);
507 * clear some bits on a range in the tree. This may require splitting
508 * or inserting elements in the tree, so the gfp mask is used to
509 * indicate which allocations or sleeping are allowed.
511 * pass 'wake' == 1 to kick any sleepers, and 'delete' == 1 to remove
512 * the given range from the tree regardless of state (ie for truncate).
514 * the range [start, end] is inclusive.
516 * This takes the tree lock, and returns < 0 on error, > 0 if any of the
517 * bits were already set, or zero if none of the bits were already set.
519 int clear_extent_bit(struct extent_map_tree *tree, u64 start, u64 end,
520 int bits, int wake, int delete, gfp_t mask)
522 struct extent_state *state;
523 struct extent_state *prealloc = NULL;
524 struct rb_node *node;
530 if (!prealloc && (mask & __GFP_WAIT)) {
531 prealloc = alloc_extent_state(mask);
536 write_lock_irqsave(&tree->lock, flags);
538 * this search will find the extents that end after
541 node = tree_search(&tree->state, start);
544 state = rb_entry(node, struct extent_state, rb_node);
545 if (state->start > end)
547 WARN_ON(state->end < start);
550 * | ---- desired range ---- |
552 * | ------------- state -------------- |
554 * We need to split the extent we found, and may flip
555 * bits on second half.
557 * If the extent we found extends past our range, we
558 * just split and search again. It'll get split again
559 * the next time though.
561 * If the extent we found is inside our range, we clear
562 * the desired bit on it.
565 if (state->start < start) {
566 err = split_state(tree, state, prealloc, start);
567 BUG_ON(err == -EEXIST);
571 if (state->end <= end) {
572 start = state->end + 1;
573 set |= clear_state_bit(tree, state, bits,
576 start = state->start;
581 * | ---- desired range ---- |
583 * We need to split the extent, and clear the bit
586 if (state->start <= end && state->end > end) {
587 err = split_state(tree, state, prealloc, end + 1);
588 BUG_ON(err == -EEXIST);
592 set |= clear_state_bit(tree, prealloc, bits,
598 start = state->end + 1;
599 set |= clear_state_bit(tree, state, bits, wake, delete);
603 write_unlock_irqrestore(&tree->lock, flags);
605 free_extent_state(prealloc);
612 write_unlock_irqrestore(&tree->lock, flags);
613 if (mask & __GFP_WAIT)
617 EXPORT_SYMBOL(clear_extent_bit);
619 static int wait_on_state(struct extent_map_tree *tree,
620 struct extent_state *state)
623 prepare_to_wait(&state->wq, &wait, TASK_UNINTERRUPTIBLE);
624 read_unlock_irq(&tree->lock);
626 read_lock_irq(&tree->lock);
627 finish_wait(&state->wq, &wait);
632 * waits for one or more bits to clear on a range in the state tree.
633 * The range [start, end] is inclusive.
634 * The tree lock is taken by this function
636 int wait_extent_bit(struct extent_map_tree *tree, u64 start, u64 end, int bits)
638 struct extent_state *state;
639 struct rb_node *node;
641 read_lock_irq(&tree->lock);
645 * this search will find all the extents that end after
648 node = tree_search(&tree->state, start);
652 state = rb_entry(node, struct extent_state, rb_node);
654 if (state->start > end)
657 if (state->state & bits) {
658 start = state->start;
659 atomic_inc(&state->refs);
660 wait_on_state(tree, state);
661 free_extent_state(state);
664 start = state->end + 1;
669 if (need_resched()) {
670 read_unlock_irq(&tree->lock);
672 read_lock_irq(&tree->lock);
676 read_unlock_irq(&tree->lock);
679 EXPORT_SYMBOL(wait_extent_bit);
681 static void set_state_bits(struct extent_map_tree *tree,
682 struct extent_state *state,
685 if ((bits & EXTENT_DIRTY) && !(state->state & EXTENT_DIRTY)) {
686 u64 range = state->end - state->start + 1;
687 tree->dirty_bytes += range;
689 state->state |= bits;
693 * set some bits on a range in the tree. This may require allocations
694 * or sleeping, so the gfp mask is used to indicate what is allowed.
696 * If 'exclusive' == 1, this will fail with -EEXIST if some part of the
697 * range already has the desired bits set. The start of the existing
698 * range is returned in failed_start in this case.
700 * [start, end] is inclusive
701 * This takes the tree lock.
703 int set_extent_bit(struct extent_map_tree *tree, u64 start, u64 end, int bits,
704 int exclusive, u64 *failed_start, gfp_t mask)
706 struct extent_state *state;
707 struct extent_state *prealloc = NULL;
708 struct rb_node *node;
715 if (!prealloc && (mask & __GFP_WAIT)) {
716 prealloc = alloc_extent_state(mask);
721 write_lock_irqsave(&tree->lock, flags);
723 * this search will find all the extents that end after
726 node = tree_search(&tree->state, start);
728 err = insert_state(tree, prealloc, start, end, bits);
730 BUG_ON(err == -EEXIST);
734 state = rb_entry(node, struct extent_state, rb_node);
735 last_start = state->start;
736 last_end = state->end;
739 * | ---- desired range ---- |
742 * Just lock what we found and keep going
744 if (state->start == start && state->end <= end) {
745 set = state->state & bits;
746 if (set && exclusive) {
747 *failed_start = state->start;
751 set_state_bits(tree, state, bits);
752 start = state->end + 1;
753 merge_state(tree, state);
758 * | ---- desired range ---- |
761 * | ------------- state -------------- |
763 * We need to split the extent we found, and may flip bits on
766 * If the extent we found extends past our
767 * range, we just split and search again. It'll get split
768 * again the next time though.
770 * If the extent we found is inside our range, we set the
773 if (state->start < start) {
774 set = state->state & bits;
775 if (exclusive && set) {
776 *failed_start = start;
780 err = split_state(tree, state, prealloc, start);
781 BUG_ON(err == -EEXIST);
785 if (state->end <= end) {
786 set_state_bits(tree, state, bits);
787 start = state->end + 1;
788 merge_state(tree, state);
790 start = state->start;
795 * | ---- desired range ---- |
796 * | state | or | state |
798 * There's a hole, we need to insert something in it and
799 * ignore the extent we found.
801 if (state->start > start) {
803 if (end < last_start)
806 this_end = last_start -1;
807 err = insert_state(tree, prealloc, start, this_end,
810 BUG_ON(err == -EEXIST);
813 start = this_end + 1;
817 * | ---- desired range ---- |
819 * We need to split the extent, and set the bit
822 if (state->start <= end && state->end > end) {
823 set = state->state & bits;
824 if (exclusive && set) {
825 *failed_start = start;
829 err = split_state(tree, state, prealloc, end + 1);
830 BUG_ON(err == -EEXIST);
832 set_state_bits(tree, prealloc, bits);
833 merge_state(tree, prealloc);
841 write_unlock_irqrestore(&tree->lock, flags);
843 free_extent_state(prealloc);
850 write_unlock_irqrestore(&tree->lock, flags);
851 if (mask & __GFP_WAIT)
855 EXPORT_SYMBOL(set_extent_bit);
857 /* wrappers around set/clear extent bit */
858 int set_extent_dirty(struct extent_map_tree *tree, u64 start, u64 end,
861 return set_extent_bit(tree, start, end, EXTENT_DIRTY, 0, NULL,
864 EXPORT_SYMBOL(set_extent_dirty);
866 int set_extent_bits(struct extent_map_tree *tree, u64 start, u64 end,
867 int bits, gfp_t mask)
869 return set_extent_bit(tree, start, end, bits, 0, NULL,
872 EXPORT_SYMBOL(set_extent_bits);
874 int clear_extent_bits(struct extent_map_tree *tree, u64 start, u64 end,
875 int bits, gfp_t mask)
877 return clear_extent_bit(tree, start, end, bits, 0, 0, mask);
879 EXPORT_SYMBOL(clear_extent_bits);
881 int set_extent_delalloc(struct extent_map_tree *tree, u64 start, u64 end,
884 return set_extent_bit(tree, start, end,
885 EXTENT_DELALLOC | EXTENT_DIRTY, 0, NULL,
888 EXPORT_SYMBOL(set_extent_delalloc);
890 int clear_extent_dirty(struct extent_map_tree *tree, u64 start, u64 end,
893 return clear_extent_bit(tree, start, end,
894 EXTENT_DIRTY | EXTENT_DELALLOC, 0, 0, mask);
896 EXPORT_SYMBOL(clear_extent_dirty);
898 int set_extent_new(struct extent_map_tree *tree, u64 start, u64 end,
901 return set_extent_bit(tree, start, end, EXTENT_NEW, 0, NULL,
904 EXPORT_SYMBOL(set_extent_new);
906 int clear_extent_new(struct extent_map_tree *tree, u64 start, u64 end,
909 return clear_extent_bit(tree, start, end, EXTENT_NEW, 0, 0, mask);
911 EXPORT_SYMBOL(clear_extent_new);
913 int set_extent_uptodate(struct extent_map_tree *tree, u64 start, u64 end,
916 return set_extent_bit(tree, start, end, EXTENT_UPTODATE, 0, NULL,
919 EXPORT_SYMBOL(set_extent_uptodate);
921 int clear_extent_uptodate(struct extent_map_tree *tree, u64 start, u64 end,
924 return clear_extent_bit(tree, start, end, EXTENT_UPTODATE, 0, 0, mask);
926 EXPORT_SYMBOL(clear_extent_uptodate);
928 int set_extent_writeback(struct extent_map_tree *tree, u64 start, u64 end,
931 return set_extent_bit(tree, start, end, EXTENT_WRITEBACK,
934 EXPORT_SYMBOL(set_extent_writeback);
936 int clear_extent_writeback(struct extent_map_tree *tree, u64 start, u64 end,
939 return clear_extent_bit(tree, start, end, EXTENT_WRITEBACK, 1, 0, mask);
941 EXPORT_SYMBOL(clear_extent_writeback);
943 int wait_on_extent_writeback(struct extent_map_tree *tree, u64 start, u64 end)
945 return wait_extent_bit(tree, start, end, EXTENT_WRITEBACK);
947 EXPORT_SYMBOL(wait_on_extent_writeback);
950 * locks a range in ascending order, waiting for any locked regions
951 * it hits on the way. [start,end] are inclusive, and this will sleep.
953 int lock_extent(struct extent_map_tree *tree, u64 start, u64 end, gfp_t mask)
958 err = set_extent_bit(tree, start, end, EXTENT_LOCKED, 1,
959 &failed_start, mask);
960 if (err == -EEXIST && (mask & __GFP_WAIT)) {
961 wait_extent_bit(tree, failed_start, end, EXTENT_LOCKED);
962 start = failed_start;
966 WARN_ON(start > end);
970 EXPORT_SYMBOL(lock_extent);
972 int unlock_extent(struct extent_map_tree *tree, u64 start, u64 end,
975 return clear_extent_bit(tree, start, end, EXTENT_LOCKED, 1, 0, mask);
977 EXPORT_SYMBOL(unlock_extent);
980 * helper function to set pages and extents in the tree dirty
982 int set_range_dirty(struct extent_map_tree *tree, u64 start, u64 end)
984 unsigned long index = start >> PAGE_CACHE_SHIFT;
985 unsigned long end_index = end >> PAGE_CACHE_SHIFT;
988 while (index <= end_index) {
989 page = find_get_page(tree->mapping, index);
991 __set_page_dirty_nobuffers(page);
992 page_cache_release(page);
995 set_extent_dirty(tree, start, end, GFP_NOFS);
998 EXPORT_SYMBOL(set_range_dirty);
1001 * helper function to set both pages and extents in the tree writeback
1003 int set_range_writeback(struct extent_map_tree *tree, u64 start, u64 end)
1005 unsigned long index = start >> PAGE_CACHE_SHIFT;
1006 unsigned long end_index = end >> PAGE_CACHE_SHIFT;
1009 while (index <= end_index) {
1010 page = find_get_page(tree->mapping, index);
1012 set_page_writeback(page);
1013 page_cache_release(page);
1016 set_extent_writeback(tree, start, end, GFP_NOFS);
1019 EXPORT_SYMBOL(set_range_writeback);
1021 int find_first_extent_bit(struct extent_map_tree *tree, u64 start,
1022 u64 *start_ret, u64 *end_ret, int bits)
1024 struct rb_node *node;
1025 struct extent_state *state;
1028 read_lock_irq(&tree->lock);
1030 * this search will find all the extents that end after
1033 node = tree_search(&tree->state, start);
1034 if (!node || IS_ERR(node)) {
1039 state = rb_entry(node, struct extent_state, rb_node);
1040 if (state->end >= start && (state->state & bits)) {
1041 *start_ret = state->start;
1042 *end_ret = state->end;
1046 node = rb_next(node);
1051 read_unlock_irq(&tree->lock);
1054 EXPORT_SYMBOL(find_first_extent_bit);
1056 u64 find_lock_delalloc_range(struct extent_map_tree *tree,
1057 u64 *start, u64 *end, u64 max_bytes)
1059 struct rb_node *node;
1060 struct extent_state *state;
1061 u64 cur_start = *start;
1063 u64 total_bytes = 0;
1065 write_lock_irq(&tree->lock);
1067 * this search will find all the extents that end after
1071 node = tree_search(&tree->state, cur_start);
1072 if (!node || IS_ERR(node)) {
1077 state = rb_entry(node, struct extent_state, rb_node);
1078 if (found && state->start != cur_start) {
1081 if (!(state->state & EXTENT_DELALLOC)) {
1085 struct extent_state *prev_state;
1086 struct rb_node *prev_node = node;
1088 prev_node = rb_prev(prev_node);
1091 prev_state = rb_entry(prev_node,
1092 struct extent_state,
1094 if (!(prev_state->state & EXTENT_DELALLOC))
1100 if (state->state & EXTENT_LOCKED) {
1102 atomic_inc(&state->refs);
1103 prepare_to_wait(&state->wq, &wait,
1104 TASK_UNINTERRUPTIBLE);
1105 write_unlock_irq(&tree->lock);
1107 write_lock_irq(&tree->lock);
1108 finish_wait(&state->wq, &wait);
1109 free_extent_state(state);
1112 state->state |= EXTENT_LOCKED;
1114 *start = state->start;
1117 cur_start = state->end + 1;
1118 node = rb_next(node);
1121 total_bytes += state->end - state->start + 1;
1122 if (total_bytes >= max_bytes)
1126 write_unlock_irq(&tree->lock);
1130 u64 count_range_bits(struct extent_map_tree *tree,
1131 u64 *start, u64 max_bytes, unsigned long bits)
1133 struct rb_node *node;
1134 struct extent_state *state;
1135 u64 cur_start = *start;
1136 u64 total_bytes = 0;
1139 write_lock_irq(&tree->lock);
1140 if (bits == EXTENT_DIRTY) {
1142 total_bytes = tree->dirty_bytes;
1146 * this search will find all the extents that end after
1149 node = tree_search(&tree->state, cur_start);
1150 if (!node || IS_ERR(node)) {
1155 state = rb_entry(node, struct extent_state, rb_node);
1156 if ((state->state & bits)) {
1157 total_bytes += state->end - state->start + 1;
1158 if (total_bytes >= max_bytes)
1161 *start = state->start;
1165 node = rb_next(node);
1170 write_unlock_irq(&tree->lock);
1175 * helper function to lock both pages and extents in the tree.
1176 * pages must be locked first.
1178 int lock_range(struct extent_map_tree *tree, u64 start, u64 end)
1180 unsigned long index = start >> PAGE_CACHE_SHIFT;
1181 unsigned long end_index = end >> PAGE_CACHE_SHIFT;
1185 while (index <= end_index) {
1186 page = grab_cache_page(tree->mapping, index);
1192 err = PTR_ERR(page);
1197 lock_extent(tree, start, end, GFP_NOFS);
1202 * we failed above in getting the page at 'index', so we undo here
1203 * up to but not including the page at 'index'
1206 index = start >> PAGE_CACHE_SHIFT;
1207 while (index < end_index) {
1208 page = find_get_page(tree->mapping, index);
1210 page_cache_release(page);
1215 EXPORT_SYMBOL(lock_range);
1218 * helper function to unlock both pages and extents in the tree.
1220 int unlock_range(struct extent_map_tree *tree, u64 start, u64 end)
1222 unsigned long index = start >> PAGE_CACHE_SHIFT;
1223 unsigned long end_index = end >> PAGE_CACHE_SHIFT;
1226 while (index <= end_index) {
1227 page = find_get_page(tree->mapping, index);
1229 page_cache_release(page);
1232 unlock_extent(tree, start, end, GFP_NOFS);
1235 EXPORT_SYMBOL(unlock_range);
1237 int set_state_private(struct extent_map_tree *tree, u64 start, u64 private)
1239 struct rb_node *node;
1240 struct extent_state *state;
1243 write_lock_irq(&tree->lock);
1245 * this search will find all the extents that end after
1248 node = tree_search(&tree->state, start);
1249 if (!node || IS_ERR(node)) {
1253 state = rb_entry(node, struct extent_state, rb_node);
1254 if (state->start != start) {
1258 state->private = private;
1260 write_unlock_irq(&tree->lock);
1264 int get_state_private(struct extent_map_tree *tree, u64 start, u64 *private)
1266 struct rb_node *node;
1267 struct extent_state *state;
1270 read_lock_irq(&tree->lock);
1272 * this search will find all the extents that end after
1275 node = tree_search(&tree->state, start);
1276 if (!node || IS_ERR(node)) {
1280 state = rb_entry(node, struct extent_state, rb_node);
1281 if (state->start != start) {
1285 *private = state->private;
1287 read_unlock_irq(&tree->lock);
1292 * searches a range in the state tree for a given mask.
1293 * If 'filled' == 1, this returns 1 only if ever extent in the tree
1294 * has the bits set. Otherwise, 1 is returned if any bit in the
1295 * range is found set.
1297 int test_range_bit(struct extent_map_tree *tree, u64 start, u64 end,
1298 int bits, int filled)
1300 struct extent_state *state = NULL;
1301 struct rb_node *node;
1304 read_lock_irq(&tree->lock);
1305 node = tree_search(&tree->state, start);
1306 while (node && start <= end) {
1307 state = rb_entry(node, struct extent_state, rb_node);
1309 if (filled && state->start > start) {
1314 if (state->start > end)
1317 if (state->state & bits) {
1321 } else if (filled) {
1325 start = state->end + 1;
1328 node = rb_next(node);
1330 read_unlock_irq(&tree->lock);
1333 EXPORT_SYMBOL(test_range_bit);
1336 * helper function to set a given page up to date if all the
1337 * extents in the tree for that page are up to date
1339 static int check_page_uptodate(struct extent_map_tree *tree,
1342 u64 start = (u64)page->index << PAGE_CACHE_SHIFT;
1343 u64 end = start + PAGE_CACHE_SIZE - 1;
1344 if (test_range_bit(tree, start, end, EXTENT_UPTODATE, 1))
1345 SetPageUptodate(page);
1350 * helper function to unlock a page if all the extents in the tree
1351 * for that page are unlocked
1353 static int check_page_locked(struct extent_map_tree *tree,
1356 u64 start = (u64)page->index << PAGE_CACHE_SHIFT;
1357 u64 end = start + PAGE_CACHE_SIZE - 1;
1358 if (!test_range_bit(tree, start, end, EXTENT_LOCKED, 0))
1364 * helper function to end page writeback if all the extents
1365 * in the tree for that page are done with writeback
1367 static int check_page_writeback(struct extent_map_tree *tree,
1370 u64 start = (u64)page->index << PAGE_CACHE_SHIFT;
1371 u64 end = start + PAGE_CACHE_SIZE - 1;
1372 if (!test_range_bit(tree, start, end, EXTENT_WRITEBACK, 0))
1373 end_page_writeback(page);
1377 /* lots and lots of room for performance fixes in the end_bio funcs */
1380 * after a writepage IO is done, we need to:
1381 * clear the uptodate bits on error
1382 * clear the writeback bits in the extent tree for this IO
1383 * end_page_writeback if the page has no more pending IO
1385 * Scheduling is not allowed, so the extent state tree is expected
1386 * to have one and only one object corresponding to this IO.
1388 #if LINUX_VERSION_CODE > KERNEL_VERSION(2,6,23)
1389 static void end_bio_extent_writepage(struct bio *bio, int err)
1391 static int end_bio_extent_writepage(struct bio *bio,
1392 unsigned int bytes_done, int err)
1395 const int uptodate = test_bit(BIO_UPTODATE, &bio->bi_flags);
1396 struct bio_vec *bvec = bio->bi_io_vec + bio->bi_vcnt - 1;
1397 struct extent_map_tree *tree = bio->bi_private;
1402 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23)
1408 struct page *page = bvec->bv_page;
1409 start = ((u64)page->index << PAGE_CACHE_SHIFT) +
1411 end = start + bvec->bv_len - 1;
1413 if (bvec->bv_offset == 0 && bvec->bv_len == PAGE_CACHE_SIZE)
1418 if (--bvec >= bio->bi_io_vec)
1419 prefetchw(&bvec->bv_page->flags);
1422 clear_extent_uptodate(tree, start, end, GFP_ATOMIC);
1423 ClearPageUptodate(page);
1426 clear_extent_writeback(tree, start, end, GFP_ATOMIC);
1429 end_page_writeback(page);
1431 check_page_writeback(tree, page);
1432 if (tree->ops && tree->ops->writepage_end_io_hook)
1433 tree->ops->writepage_end_io_hook(page, start, end);
1434 } while (bvec >= bio->bi_io_vec);
1437 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23)
1443 * after a readpage IO is done, we need to:
1444 * clear the uptodate bits on error
1445 * set the uptodate bits if things worked
1446 * set the page up to date if all extents in the tree are uptodate
1447 * clear the lock bit in the extent tree
1448 * unlock the page if there are no other extents locked for it
1450 * Scheduling is not allowed, so the extent state tree is expected
1451 * to have one and only one object corresponding to this IO.
1453 #if LINUX_VERSION_CODE > KERNEL_VERSION(2,6,23)
1454 static void end_bio_extent_readpage(struct bio *bio, int err)
1456 static int end_bio_extent_readpage(struct bio *bio,
1457 unsigned int bytes_done, int err)
1460 int uptodate = test_bit(BIO_UPTODATE, &bio->bi_flags);
1461 struct bio_vec *bvec = bio->bi_io_vec + bio->bi_vcnt - 1;
1462 struct extent_map_tree *tree = bio->bi_private;
1468 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23)
1474 struct page *page = bvec->bv_page;
1475 start = ((u64)page->index << PAGE_CACHE_SHIFT) +
1477 end = start + bvec->bv_len - 1;
1479 if (bvec->bv_offset == 0 && bvec->bv_len == PAGE_CACHE_SIZE)
1484 if (--bvec >= bio->bi_io_vec)
1485 prefetchw(&bvec->bv_page->flags);
1487 if (uptodate && tree->ops && tree->ops->readpage_end_io_hook) {
1488 ret = tree->ops->readpage_end_io_hook(page, start, end);
1493 set_extent_uptodate(tree, start, end, GFP_ATOMIC);
1495 SetPageUptodate(page);
1497 check_page_uptodate(tree, page);
1499 ClearPageUptodate(page);
1503 unlock_extent(tree, start, end, GFP_ATOMIC);
1508 check_page_locked(tree, page);
1509 } while (bvec >= bio->bi_io_vec);
1512 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23)
1518 * IO done from prepare_write is pretty simple, we just unlock
1519 * the structs in the extent tree when done, and set the uptodate bits
1522 #if LINUX_VERSION_CODE > KERNEL_VERSION(2,6,23)
1523 static void end_bio_extent_preparewrite(struct bio *bio, int err)
1525 static int end_bio_extent_preparewrite(struct bio *bio,
1526 unsigned int bytes_done, int err)
1529 const int uptodate = test_bit(BIO_UPTODATE, &bio->bi_flags);
1530 struct bio_vec *bvec = bio->bi_io_vec + bio->bi_vcnt - 1;
1531 struct extent_map_tree *tree = bio->bi_private;
1535 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23)
1541 struct page *page = bvec->bv_page;
1542 start = ((u64)page->index << PAGE_CACHE_SHIFT) +
1544 end = start + bvec->bv_len - 1;
1546 if (--bvec >= bio->bi_io_vec)
1547 prefetchw(&bvec->bv_page->flags);
1550 set_extent_uptodate(tree, start, end, GFP_ATOMIC);
1552 ClearPageUptodate(page);
1556 unlock_extent(tree, start, end, GFP_ATOMIC);
1558 } while (bvec >= bio->bi_io_vec);
1561 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23)
1567 extent_bio_alloc(struct block_device *bdev, u64 first_sector, int nr_vecs,
1572 bio = bio_alloc(gfp_flags, nr_vecs);
1574 if (bio == NULL && (current->flags & PF_MEMALLOC)) {
1575 while (!bio && (nr_vecs /= 2))
1576 bio = bio_alloc(gfp_flags, nr_vecs);
1580 bio->bi_bdev = bdev;
1581 bio->bi_sector = first_sector;
1586 static int submit_one_bio(int rw, struct bio *bio)
1590 submit_bio(rw, bio);
1591 if (bio_flagged(bio, BIO_EOPNOTSUPP))
1597 static int submit_extent_page(int rw, struct extent_map_tree *tree,
1598 struct page *page, sector_t sector,
1599 size_t size, unsigned long offset,
1600 struct block_device *bdev,
1601 struct bio **bio_ret,
1602 unsigned long max_pages,
1603 bio_end_io_t end_io_func)
1609 if (bio_ret && *bio_ret) {
1611 if (bio->bi_sector + (bio->bi_size >> 9) != sector ||
1612 bio_add_page(bio, page, size, offset) < size) {
1613 ret = submit_one_bio(rw, bio);
1619 nr = min_t(int, max_pages, bio_get_nr_vecs(bdev));
1620 bio = extent_bio_alloc(bdev, sector, nr, GFP_NOFS | __GFP_HIGH);
1622 printk("failed to allocate bio nr %d\n", nr);
1624 bio_add_page(bio, page, size, offset);
1625 bio->bi_end_io = end_io_func;
1626 bio->bi_private = tree;
1630 ret = submit_one_bio(rw, bio);
1636 void set_page_extent_mapped(struct page *page)
1638 if (!PagePrivate(page)) {
1639 SetPagePrivate(page);
1640 WARN_ON(!page->mapping->a_ops->invalidatepage);
1641 set_page_private(page, EXTENT_PAGE_PRIVATE);
1642 page_cache_get(page);
1647 * basic readpage implementation. Locked extent state structs are inserted
1648 * into the tree that are removed when the IO is done (by the end_io
1651 static int __extent_read_full_page(struct extent_map_tree *tree,
1653 get_extent_t *get_extent,
1656 struct inode *inode = page->mapping->host;
1657 u64 start = (u64)page->index << PAGE_CACHE_SHIFT;
1658 u64 page_end = start + PAGE_CACHE_SIZE - 1;
1662 u64 last_byte = i_size_read(inode);
1666 struct extent_map *em;
1667 struct block_device *bdev;
1670 size_t page_offset = 0;
1672 size_t blocksize = inode->i_sb->s_blocksize;
1674 set_page_extent_mapped(page);
1677 lock_extent(tree, start, end, GFP_NOFS);
1679 while (cur <= end) {
1680 if (cur >= last_byte) {
1681 iosize = PAGE_CACHE_SIZE - page_offset;
1682 zero_user_page(page, page_offset, iosize, KM_USER0);
1683 set_extent_uptodate(tree, cur, cur + iosize - 1,
1685 unlock_extent(tree, cur, cur + iosize - 1, GFP_NOFS);
1688 em = get_extent(inode, page, page_offset, cur, end, 0);
1689 if (IS_ERR(em) || !em) {
1691 unlock_extent(tree, cur, end, GFP_NOFS);
1695 extent_offset = cur - em->start;
1696 BUG_ON(em->end < cur);
1699 iosize = min(em->end - cur, end - cur) + 1;
1700 cur_end = min(em->end, end);
1701 iosize = (iosize + blocksize - 1) & ~((u64)blocksize - 1);
1702 sector = (em->block_start + extent_offset) >> 9;
1704 block_start = em->block_start;
1705 free_extent_map(em);
1708 /* we've found a hole, just zero and go on */
1709 if (block_start == EXTENT_MAP_HOLE) {
1710 zero_user_page(page, page_offset, iosize, KM_USER0);
1711 set_extent_uptodate(tree, cur, cur + iosize - 1,
1713 unlock_extent(tree, cur, cur + iosize - 1, GFP_NOFS);
1715 page_offset += iosize;
1718 /* the get_extent function already copied into the page */
1719 if (test_range_bit(tree, cur, cur_end, EXTENT_UPTODATE, 1)) {
1720 unlock_extent(tree, cur, cur + iosize - 1, GFP_NOFS);
1722 page_offset += iosize;
1727 if (tree->ops && tree->ops->readpage_io_hook) {
1728 ret = tree->ops->readpage_io_hook(page, cur,
1732 unsigned long nr = (last_byte >> PAGE_CACHE_SHIFT) + 1;
1734 ret = submit_extent_page(READ, tree, page,
1735 sector, iosize, page_offset,
1737 end_bio_extent_readpage);
1742 page_offset += iosize;
1746 if (!PageError(page))
1747 SetPageUptodate(page);
1753 int extent_read_full_page(struct extent_map_tree *tree, struct page *page,
1754 get_extent_t *get_extent)
1756 struct bio *bio = NULL;
1759 ret = __extent_read_full_page(tree, page, get_extent, &bio);
1761 submit_one_bio(READ, bio);
1764 EXPORT_SYMBOL(extent_read_full_page);
1767 * the writepage semantics are similar to regular writepage. extent
1768 * records are inserted to lock ranges in the tree, and as dirty areas
1769 * are found, they are marked writeback. Then the lock bits are removed
1770 * and the end_io handler clears the writeback ranges
1772 static int __extent_writepage(struct page *page, struct writeback_control *wbc,
1775 struct inode *inode = page->mapping->host;
1776 struct extent_page_data *epd = data;
1777 struct extent_map_tree *tree = epd->tree;
1778 u64 start = (u64)page->index << PAGE_CACHE_SHIFT;
1780 u64 page_end = start + PAGE_CACHE_SIZE - 1;
1784 u64 last_byte = i_size_read(inode);
1788 struct extent_map *em;
1789 struct block_device *bdev;
1792 size_t page_offset = 0;
1794 loff_t i_size = i_size_read(inode);
1795 unsigned long end_index = i_size >> PAGE_CACHE_SHIFT;
1799 WARN_ON(!PageLocked(page));
1800 if (page->index > end_index) {
1801 clear_extent_dirty(tree, start, page_end, GFP_NOFS);
1806 if (page->index == end_index) {
1807 size_t offset = i_size & (PAGE_CACHE_SIZE - 1);
1808 zero_user_page(page, offset,
1809 PAGE_CACHE_SIZE - offset, KM_USER0);
1812 set_page_extent_mapped(page);
1814 delalloc_start = start;
1816 while(delalloc_end < page_end) {
1817 nr_delalloc = find_lock_delalloc_range(tree, &delalloc_start,
1820 if (nr_delalloc <= 0)
1822 tree->ops->fill_delalloc(inode, delalloc_start,
1824 clear_extent_bit(tree, delalloc_start,
1826 EXTENT_LOCKED | EXTENT_DELALLOC,
1828 delalloc_start = delalloc_end + 1;
1830 lock_extent(tree, start, page_end, GFP_NOFS);
1833 if (test_range_bit(tree, start, page_end, EXTENT_DELALLOC, 0)) {
1834 printk("found delalloc bits after lock_extent\n");
1837 if (last_byte <= start) {
1838 clear_extent_dirty(tree, start, page_end, GFP_NOFS);
1842 set_extent_uptodate(tree, start, page_end, GFP_NOFS);
1843 blocksize = inode->i_sb->s_blocksize;
1845 while (cur <= end) {
1846 if (cur >= last_byte) {
1847 clear_extent_dirty(tree, cur, page_end, GFP_NOFS);
1850 em = epd->get_extent(inode, page, page_offset, cur, end, 1);
1851 if (IS_ERR(em) || !em) {
1856 extent_offset = cur - em->start;
1857 BUG_ON(em->end < cur);
1859 iosize = min(em->end - cur, end - cur) + 1;
1860 iosize = (iosize + blocksize - 1) & ~((u64)blocksize - 1);
1861 sector = (em->block_start + extent_offset) >> 9;
1863 block_start = em->block_start;
1864 free_extent_map(em);
1867 if (block_start == EXTENT_MAP_HOLE ||
1868 block_start == EXTENT_MAP_INLINE) {
1869 clear_extent_dirty(tree, cur,
1870 cur + iosize - 1, GFP_NOFS);
1872 page_offset += iosize;
1876 /* leave this out until we have a page_mkwrite call */
1877 if (0 && !test_range_bit(tree, cur, cur + iosize - 1,
1880 page_offset += iosize;
1883 clear_extent_dirty(tree, cur, cur + iosize - 1, GFP_NOFS);
1884 if (tree->ops && tree->ops->writepage_io_hook) {
1885 ret = tree->ops->writepage_io_hook(page, cur,
1893 unsigned long max_nr = end_index + 1;
1894 set_range_writeback(tree, cur, cur + iosize - 1);
1895 if (!PageWriteback(page)) {
1896 printk("warning page %lu not writeback, "
1897 "cur %llu end %llu\n", page->index,
1898 (unsigned long long)cur,
1899 (unsigned long long)end);
1902 ret = submit_extent_page(WRITE, tree, page, sector,
1903 iosize, page_offset, bdev,
1905 end_bio_extent_writepage);
1910 page_offset += iosize;
1915 /* make sure the mapping tag for page dirty gets cleared */
1916 set_page_writeback(page);
1917 end_page_writeback(page);
1919 unlock_extent(tree, start, page_end, GFP_NOFS);
1924 int extent_write_full_page(struct extent_map_tree *tree, struct page *page,
1925 get_extent_t *get_extent,
1926 struct writeback_control *wbc)
1929 struct address_space *mapping = page->mapping;
1930 struct extent_page_data epd = {
1933 .get_extent = get_extent,
1935 struct writeback_control wbc_writepages = {
1937 .sync_mode = WB_SYNC_NONE,
1938 .older_than_this = NULL,
1940 .range_start = page_offset(page) + PAGE_CACHE_SIZE,
1941 .range_end = (loff_t)-1,
1945 ret = __extent_writepage(page, wbc, &epd);
1947 write_cache_pages(mapping, &wbc_writepages, __extent_writepage, &epd);
1949 submit_one_bio(WRITE, epd.bio);
1952 EXPORT_SYMBOL(extent_write_full_page);
1954 int extent_writepages(struct extent_map_tree *tree,
1955 struct address_space *mapping,
1956 get_extent_t *get_extent,
1957 struct writeback_control *wbc)
1960 struct extent_page_data epd = {
1963 .get_extent = get_extent,
1966 ret = write_cache_pages(mapping, wbc, __extent_writepage, &epd);
1968 submit_one_bio(WRITE, epd.bio);
1971 EXPORT_SYMBOL(extent_writepages);
1973 int extent_readpages(struct extent_map_tree *tree,
1974 struct address_space *mapping,
1975 struct list_head *pages, unsigned nr_pages,
1976 get_extent_t get_extent)
1978 struct bio *bio = NULL;
1980 struct pagevec pvec;
1982 pagevec_init(&pvec, 0);
1983 for (page_idx = 0; page_idx < nr_pages; page_idx++) {
1984 struct page *page = list_entry(pages->prev, struct page, lru);
1986 prefetchw(&page->flags);
1987 list_del(&page->lru);
1989 * what we want to do here is call add_to_page_cache_lru,
1990 * but that isn't exported, so we reproduce it here
1992 if (!add_to_page_cache(page, mapping,
1993 page->index, GFP_KERNEL)) {
1995 /* open coding of lru_cache_add, also not exported */
1996 page_cache_get(page);
1997 if (!pagevec_add(&pvec, page))
1998 __pagevec_lru_add(&pvec);
1999 __extent_read_full_page(tree, page, get_extent, &bio);
2001 page_cache_release(page);
2003 if (pagevec_count(&pvec))
2004 __pagevec_lru_add(&pvec);
2005 BUG_ON(!list_empty(pages));
2007 submit_one_bio(READ, bio);
2010 EXPORT_SYMBOL(extent_readpages);
2013 * basic invalidatepage code, this waits on any locked or writeback
2014 * ranges corresponding to the page, and then deletes any extent state
2015 * records from the tree
2017 int extent_invalidatepage(struct extent_map_tree *tree,
2018 struct page *page, unsigned long offset)
2020 u64 start = ((u64)page->index << PAGE_CACHE_SHIFT);
2021 u64 end = start + PAGE_CACHE_SIZE - 1;
2022 size_t blocksize = page->mapping->host->i_sb->s_blocksize;
2024 start += (offset + blocksize -1) & ~(blocksize - 1);
2028 lock_extent(tree, start, end, GFP_NOFS);
2029 wait_on_extent_writeback(tree, start, end);
2030 clear_extent_bit(tree, start, end,
2031 EXTENT_LOCKED | EXTENT_DIRTY | EXTENT_DELALLOC,
2035 EXPORT_SYMBOL(extent_invalidatepage);
2038 * simple commit_write call, set_range_dirty is used to mark both
2039 * the pages and the extent records as dirty
2041 int extent_commit_write(struct extent_map_tree *tree,
2042 struct inode *inode, struct page *page,
2043 unsigned from, unsigned to)
2045 loff_t pos = ((loff_t)page->index << PAGE_CACHE_SHIFT) + to;
2047 set_page_extent_mapped(page);
2048 set_page_dirty(page);
2050 if (pos > inode->i_size) {
2051 i_size_write(inode, pos);
2052 mark_inode_dirty(inode);
2056 EXPORT_SYMBOL(extent_commit_write);
2058 int extent_prepare_write(struct extent_map_tree *tree,
2059 struct inode *inode, struct page *page,
2060 unsigned from, unsigned to, get_extent_t *get_extent)
2062 u64 page_start = (u64)page->index << PAGE_CACHE_SHIFT;
2063 u64 page_end = page_start + PAGE_CACHE_SIZE - 1;
2065 u64 orig_block_start;
2068 struct extent_map *em;
2069 unsigned blocksize = 1 << inode->i_blkbits;
2070 size_t page_offset = 0;
2071 size_t block_off_start;
2072 size_t block_off_end;
2078 set_page_extent_mapped(page);
2080 block_start = (page_start + from) & ~((u64)blocksize - 1);
2081 block_end = (page_start + to - 1) | (blocksize - 1);
2082 orig_block_start = block_start;
2084 lock_extent(tree, page_start, page_end, GFP_NOFS);
2085 while(block_start <= block_end) {
2086 em = get_extent(inode, page, page_offset, block_start,
2088 if (IS_ERR(em) || !em) {
2091 cur_end = min(block_end, em->end);
2092 block_off_start = block_start & (PAGE_CACHE_SIZE - 1);
2093 block_off_end = block_off_start + blocksize;
2094 isnew = clear_extent_new(tree, block_start, cur_end, GFP_NOFS);
2096 if (!PageUptodate(page) && isnew &&
2097 (block_off_end > to || block_off_start < from)) {
2100 kaddr = kmap_atomic(page, KM_USER0);
2101 if (block_off_end > to)
2102 memset(kaddr + to, 0, block_off_end - to);
2103 if (block_off_start < from)
2104 memset(kaddr + block_off_start, 0,
2105 from - block_off_start);
2106 flush_dcache_page(page);
2107 kunmap_atomic(kaddr, KM_USER0);
2109 if (!isnew && !PageUptodate(page) &&
2110 (block_off_end > to || block_off_start < from) &&
2111 !test_range_bit(tree, block_start, cur_end,
2112 EXTENT_UPTODATE, 1)) {
2114 u64 extent_offset = block_start - em->start;
2116 sector = (em->block_start + extent_offset) >> 9;
2117 iosize = (cur_end - block_start + blocksize - 1) &
2118 ~((u64)blocksize - 1);
2120 * we've already got the extent locked, but we
2121 * need to split the state such that our end_bio
2122 * handler can clear the lock.
2124 set_extent_bit(tree, block_start,
2125 block_start + iosize - 1,
2126 EXTENT_LOCKED, 0, NULL, GFP_NOFS);
2127 ret = submit_extent_page(READ, tree, page,
2128 sector, iosize, page_offset, em->bdev,
2130 end_bio_extent_preparewrite);
2132 block_start = block_start + iosize;
2134 set_extent_uptodate(tree, block_start, cur_end,
2136 unlock_extent(tree, block_start, cur_end, GFP_NOFS);
2137 block_start = cur_end + 1;
2139 page_offset = block_start & (PAGE_CACHE_SIZE - 1);
2140 free_extent_map(em);
2143 wait_extent_bit(tree, orig_block_start,
2144 block_end, EXTENT_LOCKED);
2146 check_page_uptodate(tree, page);
2148 /* FIXME, zero out newly allocated blocks on error */
2151 EXPORT_SYMBOL(extent_prepare_write);
2154 * a helper for releasepage. As long as there are no locked extents
2155 * in the range corresponding to the page, both state records and extent
2156 * map records are removed
2158 int try_release_extent_mapping(struct extent_map_tree *tree, struct page *page)
2160 struct extent_map *em;
2161 u64 start = (u64)page->index << PAGE_CACHE_SHIFT;
2162 u64 end = start + PAGE_CACHE_SIZE - 1;
2163 u64 orig_start = start;
2166 while (start <= end) {
2167 em = lookup_extent_mapping(tree, start, end);
2168 if (!em || IS_ERR(em))
2170 if (!test_range_bit(tree, em->start, em->end,
2171 EXTENT_LOCKED, 0)) {
2172 remove_extent_mapping(tree, em);
2173 /* once for the rb tree */
2174 free_extent_map(em);
2176 start = em->end + 1;
2178 free_extent_map(em);
2180 if (test_range_bit(tree, orig_start, end, EXTENT_LOCKED, 0))
2183 clear_extent_bit(tree, orig_start, end, EXTENT_UPTODATE,
2187 EXPORT_SYMBOL(try_release_extent_mapping);
2189 sector_t extent_bmap(struct address_space *mapping, sector_t iblock,
2190 get_extent_t *get_extent)
2192 struct inode *inode = mapping->host;
2193 u64 start = iblock << inode->i_blkbits;
2194 u64 end = start + (1 << inode->i_blkbits) - 1;
2195 sector_t sector = 0;
2196 struct extent_map *em;
2198 em = get_extent(inode, NULL, 0, start, end, 0);
2199 if (!em || IS_ERR(em))
2202 if (em->block_start == EXTENT_MAP_INLINE ||
2203 em->block_start == EXTENT_MAP_HOLE)
2206 sector = (em->block_start + start - em->start) >> inode->i_blkbits;
2208 free_extent_map(em);
2212 static int add_lru(struct extent_map_tree *tree, struct extent_buffer *eb)
2214 if (list_empty(&eb->lru)) {
2215 extent_buffer_get(eb);
2216 list_add(&eb->lru, &tree->buffer_lru);
2218 if (tree->lru_size >= BUFFER_LRU_MAX) {
2219 struct extent_buffer *rm;
2220 rm = list_entry(tree->buffer_lru.prev,
2221 struct extent_buffer, lru);
2223 list_del_init(&rm->lru);
2224 free_extent_buffer(rm);
2227 list_move(&eb->lru, &tree->buffer_lru);
2230 static struct extent_buffer *find_lru(struct extent_map_tree *tree,
2231 u64 start, unsigned long len)
2233 struct list_head *lru = &tree->buffer_lru;
2234 struct list_head *cur = lru->next;
2235 struct extent_buffer *eb;
2237 if (list_empty(lru))
2241 eb = list_entry(cur, struct extent_buffer, lru);
2242 if (eb->start == start && eb->len == len) {
2243 extent_buffer_get(eb);
2247 } while (cur != lru);
2251 static inline unsigned long num_extent_pages(u64 start, u64 len)
2253 return ((start + len + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT) -
2254 (start >> PAGE_CACHE_SHIFT);
2257 static inline struct page *extent_buffer_page(struct extent_buffer *eb,
2261 struct address_space *mapping;
2264 return eb->first_page;
2265 i += eb->start >> PAGE_CACHE_SHIFT;
2266 mapping = eb->first_page->mapping;
2267 read_lock_irq(&mapping->tree_lock);
2268 p = radix_tree_lookup(&mapping->page_tree, i);
2269 read_unlock_irq(&mapping->tree_lock);
2273 static struct extent_buffer *__alloc_extent_buffer(struct extent_map_tree *tree,
2278 struct extent_buffer *eb = NULL;
2280 spin_lock(&tree->lru_lock);
2281 eb = find_lru(tree, start, len);
2282 spin_unlock(&tree->lru_lock);
2287 eb = kmem_cache_zalloc(extent_buffer_cache, mask);
2288 INIT_LIST_HEAD(&eb->lru);
2291 atomic_set(&eb->refs, 1);
2296 static void __free_extent_buffer(struct extent_buffer *eb)
2298 kmem_cache_free(extent_buffer_cache, eb);
2301 struct extent_buffer *alloc_extent_buffer(struct extent_map_tree *tree,
2302 u64 start, unsigned long len,
2306 unsigned long num_pages = num_extent_pages(start, len);
2308 unsigned long index = start >> PAGE_CACHE_SHIFT;
2309 struct extent_buffer *eb;
2311 struct address_space *mapping = tree->mapping;
2314 eb = __alloc_extent_buffer(tree, start, len, mask);
2315 if (!eb || IS_ERR(eb))
2318 if (eb->flags & EXTENT_BUFFER_FILLED)
2322 eb->first_page = page0;
2325 page_cache_get(page0);
2326 mark_page_accessed(page0);
2327 set_page_extent_mapped(page0);
2328 WARN_ON(!PageUptodate(page0));
2329 set_page_private(page0, EXTENT_PAGE_PRIVATE_FIRST_PAGE |
2334 for (; i < num_pages; i++, index++) {
2335 p = find_or_create_page(mapping, index, mask | __GFP_HIGHMEM);
2340 set_page_extent_mapped(p);
2341 mark_page_accessed(p);
2344 set_page_private(p, EXTENT_PAGE_PRIVATE_FIRST_PAGE |
2347 set_page_private(p, EXTENT_PAGE_PRIVATE);
2349 if (!PageUptodate(p))
2354 eb->flags |= EXTENT_UPTODATE;
2355 eb->flags |= EXTENT_BUFFER_FILLED;
2358 spin_lock(&tree->lru_lock);
2360 spin_unlock(&tree->lru_lock);
2364 spin_lock(&tree->lru_lock);
2365 list_del_init(&eb->lru);
2366 spin_unlock(&tree->lru_lock);
2367 if (!atomic_dec_and_test(&eb->refs))
2369 for (index = 1; index < i; index++) {
2370 page_cache_release(extent_buffer_page(eb, index));
2373 page_cache_release(extent_buffer_page(eb, 0));
2374 __free_extent_buffer(eb);
2377 EXPORT_SYMBOL(alloc_extent_buffer);
2379 struct extent_buffer *find_extent_buffer(struct extent_map_tree *tree,
2380 u64 start, unsigned long len,
2383 unsigned long num_pages = num_extent_pages(start, len);
2385 unsigned long index = start >> PAGE_CACHE_SHIFT;
2386 struct extent_buffer *eb;
2388 struct address_space *mapping = tree->mapping;
2391 eb = __alloc_extent_buffer(tree, start, len, mask);
2392 if (!eb || IS_ERR(eb))
2395 if (eb->flags & EXTENT_BUFFER_FILLED)
2398 for (i = 0; i < num_pages; i++, index++) {
2399 p = find_lock_page(mapping, index);
2403 set_page_extent_mapped(p);
2404 mark_page_accessed(p);
2408 set_page_private(p, EXTENT_PAGE_PRIVATE_FIRST_PAGE |
2411 set_page_private(p, EXTENT_PAGE_PRIVATE);
2414 if (!PageUptodate(p))
2419 eb->flags |= EXTENT_UPTODATE;
2420 eb->flags |= EXTENT_BUFFER_FILLED;
2423 spin_lock(&tree->lru_lock);
2425 spin_unlock(&tree->lru_lock);
2428 spin_lock(&tree->lru_lock);
2429 list_del_init(&eb->lru);
2430 spin_unlock(&tree->lru_lock);
2431 if (!atomic_dec_and_test(&eb->refs))
2433 for (index = 1; index < i; index++) {
2434 page_cache_release(extent_buffer_page(eb, index));
2437 page_cache_release(extent_buffer_page(eb, 0));
2438 __free_extent_buffer(eb);
2441 EXPORT_SYMBOL(find_extent_buffer);
2443 void free_extent_buffer(struct extent_buffer *eb)
2446 unsigned long num_pages;
2451 if (!atomic_dec_and_test(&eb->refs))
2454 WARN_ON(!list_empty(&eb->lru));
2455 num_pages = num_extent_pages(eb->start, eb->len);
2457 for (i = 1; i < num_pages; i++) {
2458 page_cache_release(extent_buffer_page(eb, i));
2460 page_cache_release(extent_buffer_page(eb, 0));
2461 __free_extent_buffer(eb);
2463 EXPORT_SYMBOL(free_extent_buffer);
2465 int clear_extent_buffer_dirty(struct extent_map_tree *tree,
2466 struct extent_buffer *eb)
2470 unsigned long num_pages;
2473 u64 start = eb->start;
2474 u64 end = start + eb->len - 1;
2476 set = clear_extent_dirty(tree, start, end, GFP_NOFS);
2477 num_pages = num_extent_pages(eb->start, eb->len);
2479 for (i = 0; i < num_pages; i++) {
2480 page = extent_buffer_page(eb, i);
2483 * if we're on the last page or the first page and the
2484 * block isn't aligned on a page boundary, do extra checks
2485 * to make sure we don't clean page that is partially dirty
2487 if ((i == 0 && (eb->start & (PAGE_CACHE_SIZE - 1))) ||
2488 ((i == num_pages - 1) &&
2489 ((eb->start + eb->len) & (PAGE_CACHE_SIZE - 1)))) {
2490 start = (u64)page->index << PAGE_CACHE_SHIFT;
2491 end = start + PAGE_CACHE_SIZE - 1;
2492 if (test_range_bit(tree, start, end,
2498 clear_page_dirty_for_io(page);
2499 write_lock_irq(&page->mapping->tree_lock);
2500 if (!PageDirty(page)) {
2501 radix_tree_tag_clear(&page->mapping->page_tree,
2503 PAGECACHE_TAG_DIRTY);
2505 write_unlock_irq(&page->mapping->tree_lock);
2510 EXPORT_SYMBOL(clear_extent_buffer_dirty);
2512 int wait_on_extent_buffer_writeback(struct extent_map_tree *tree,
2513 struct extent_buffer *eb)
2515 return wait_on_extent_writeback(tree, eb->start,
2516 eb->start + eb->len - 1);
2518 EXPORT_SYMBOL(wait_on_extent_buffer_writeback);
2520 int set_extent_buffer_dirty(struct extent_map_tree *tree,
2521 struct extent_buffer *eb)
2524 unsigned long num_pages;
2526 num_pages = num_extent_pages(eb->start, eb->len);
2527 for (i = 0; i < num_pages; i++) {
2528 struct page *page = extent_buffer_page(eb, i);
2529 /* writepage may need to do something special for the
2530 * first page, we have to make sure page->private is
2531 * properly set. releasepage may drop page->private
2532 * on us if the page isn't already dirty.
2536 set_page_private(page,
2537 EXTENT_PAGE_PRIVATE_FIRST_PAGE |
2540 __set_page_dirty_nobuffers(extent_buffer_page(eb, i));
2544 return set_extent_dirty(tree, eb->start,
2545 eb->start + eb->len - 1, GFP_NOFS);
2547 EXPORT_SYMBOL(set_extent_buffer_dirty);
2549 int set_extent_buffer_uptodate(struct extent_map_tree *tree,
2550 struct extent_buffer *eb)
2554 unsigned long num_pages;
2556 num_pages = num_extent_pages(eb->start, eb->len);
2558 set_extent_uptodate(tree, eb->start, eb->start + eb->len - 1,
2560 for (i = 0; i < num_pages; i++) {
2561 page = extent_buffer_page(eb, i);
2562 if ((i == 0 && (eb->start & (PAGE_CACHE_SIZE - 1))) ||
2563 ((i == num_pages - 1) &&
2564 ((eb->start + eb->len) & (PAGE_CACHE_SIZE - 1)))) {
2565 check_page_uptodate(tree, page);
2568 SetPageUptodate(page);
2572 EXPORT_SYMBOL(set_extent_buffer_uptodate);
2574 int extent_buffer_uptodate(struct extent_map_tree *tree,
2575 struct extent_buffer *eb)
2577 if (eb->flags & EXTENT_UPTODATE)
2579 return test_range_bit(tree, eb->start, eb->start + eb->len - 1,
2580 EXTENT_UPTODATE, 1);
2582 EXPORT_SYMBOL(extent_buffer_uptodate);
2584 int read_extent_buffer_pages(struct extent_map_tree *tree,
2585 struct extent_buffer *eb,
2590 unsigned long start_i;
2594 unsigned long num_pages;
2596 if (eb->flags & EXTENT_UPTODATE)
2599 if (0 && test_range_bit(tree, eb->start, eb->start + eb->len - 1,
2600 EXTENT_UPTODATE, 1)) {
2605 WARN_ON(start < eb->start);
2606 start_i = (start >> PAGE_CACHE_SHIFT) -
2607 (eb->start >> PAGE_CACHE_SHIFT);
2612 num_pages = num_extent_pages(eb->start, eb->len);
2613 for (i = start_i; i < num_pages; i++) {
2614 page = extent_buffer_page(eb, i);
2615 if (PageUptodate(page)) {
2619 if (TestSetPageLocked(page)) {
2625 if (!PageUptodate(page)) {
2626 err = page->mapping->a_ops->readpage(NULL, page);
2639 for (i = start_i; i < num_pages; i++) {
2640 page = extent_buffer_page(eb, i);
2641 wait_on_page_locked(page);
2642 if (!PageUptodate(page)) {
2647 eb->flags |= EXTENT_UPTODATE;
2650 EXPORT_SYMBOL(read_extent_buffer_pages);
2652 void read_extent_buffer(struct extent_buffer *eb, void *dstv,
2653 unsigned long start,
2660 char *dst = (char *)dstv;
2661 size_t start_offset = eb->start & ((u64)PAGE_CACHE_SIZE - 1);
2662 unsigned long i = (start_offset + start) >> PAGE_CACHE_SHIFT;
2663 unsigned long num_pages = num_extent_pages(eb->start, eb->len);
2665 WARN_ON(start > eb->len);
2666 WARN_ON(start + len > eb->start + eb->len);
2668 offset = (start_offset + start) & ((unsigned long)PAGE_CACHE_SIZE - 1);
2671 page = extent_buffer_page(eb, i);
2672 if (!PageUptodate(page)) {
2673 printk("page %lu not up to date i %lu, total %lu, len %lu\n", page->index, i, num_pages, eb->len);
2676 WARN_ON(!PageUptodate(page));
2678 cur = min(len, (PAGE_CACHE_SIZE - offset));
2679 kaddr = kmap_atomic(page, KM_USER1);
2680 memcpy(dst, kaddr + offset, cur);
2681 kunmap_atomic(kaddr, KM_USER1);
2689 EXPORT_SYMBOL(read_extent_buffer);
2691 int map_private_extent_buffer(struct extent_buffer *eb, unsigned long start,
2692 unsigned long min_len, char **token, char **map,
2693 unsigned long *map_start,
2694 unsigned long *map_len, int km)
2696 size_t offset = start & (PAGE_CACHE_SIZE - 1);
2699 size_t start_offset = eb->start & ((u64)PAGE_CACHE_SIZE - 1);
2700 unsigned long i = (start_offset + start) >> PAGE_CACHE_SHIFT;
2701 unsigned long end_i = (start_offset + start + min_len - 1) >>
2708 offset = start_offset;
2712 *map_start = ((u64)i << PAGE_CACHE_SHIFT) - start_offset;
2714 if (start + min_len > eb->len) {
2715 printk("bad mapping eb start %Lu len %lu, wanted %lu %lu\n", eb->start, eb->len, start, min_len);
2719 p = extent_buffer_page(eb, i);
2720 WARN_ON(!PageUptodate(p));
2721 kaddr = kmap_atomic(p, km);
2723 *map = kaddr + offset;
2724 *map_len = PAGE_CACHE_SIZE - offset;
2727 EXPORT_SYMBOL(map_private_extent_buffer);
2729 int map_extent_buffer(struct extent_buffer *eb, unsigned long start,
2730 unsigned long min_len,
2731 char **token, char **map,
2732 unsigned long *map_start,
2733 unsigned long *map_len, int km)
2737 if (eb->map_token) {
2738 unmap_extent_buffer(eb, eb->map_token, km);
2739 eb->map_token = NULL;
2742 err = map_private_extent_buffer(eb, start, min_len, token, map,
2743 map_start, map_len, km);
2745 eb->map_token = *token;
2747 eb->map_start = *map_start;
2748 eb->map_len = *map_len;
2752 EXPORT_SYMBOL(map_extent_buffer);
2754 void unmap_extent_buffer(struct extent_buffer *eb, char *token, int km)
2756 kunmap_atomic(token, km);
2758 EXPORT_SYMBOL(unmap_extent_buffer);
2760 int memcmp_extent_buffer(struct extent_buffer *eb, const void *ptrv,
2761 unsigned long start,
2768 char *ptr = (char *)ptrv;
2769 size_t start_offset = eb->start & ((u64)PAGE_CACHE_SIZE - 1);
2770 unsigned long i = (start_offset + start) >> PAGE_CACHE_SHIFT;
2773 WARN_ON(start > eb->len);
2774 WARN_ON(start + len > eb->start + eb->len);
2776 offset = (start_offset + start) & ((unsigned long)PAGE_CACHE_SIZE - 1);
2779 page = extent_buffer_page(eb, i);
2780 WARN_ON(!PageUptodate(page));
2782 cur = min(len, (PAGE_CACHE_SIZE - offset));
2784 kaddr = kmap_atomic(page, KM_USER0);
2785 ret = memcmp(ptr, kaddr + offset, cur);
2786 kunmap_atomic(kaddr, KM_USER0);
2797 EXPORT_SYMBOL(memcmp_extent_buffer);
2799 void write_extent_buffer(struct extent_buffer *eb, const void *srcv,
2800 unsigned long start, unsigned long len)
2806 char *src = (char *)srcv;
2807 size_t start_offset = eb->start & ((u64)PAGE_CACHE_SIZE - 1);
2808 unsigned long i = (start_offset + start) >> PAGE_CACHE_SHIFT;
2810 WARN_ON(start > eb->len);
2811 WARN_ON(start + len > eb->start + eb->len);
2813 offset = (start_offset + start) & ((unsigned long)PAGE_CACHE_SIZE - 1);
2816 page = extent_buffer_page(eb, i);
2817 WARN_ON(!PageUptodate(page));
2819 cur = min(len, PAGE_CACHE_SIZE - offset);
2820 kaddr = kmap_atomic(page, KM_USER1);
2821 memcpy(kaddr + offset, src, cur);
2822 kunmap_atomic(kaddr, KM_USER1);
2830 EXPORT_SYMBOL(write_extent_buffer);
2832 void memset_extent_buffer(struct extent_buffer *eb, char c,
2833 unsigned long start, unsigned long len)
2839 size_t start_offset = eb->start & ((u64)PAGE_CACHE_SIZE - 1);
2840 unsigned long i = (start_offset + start) >> PAGE_CACHE_SHIFT;
2842 WARN_ON(start > eb->len);
2843 WARN_ON(start + len > eb->start + eb->len);
2845 offset = (start_offset + start) & ((unsigned long)PAGE_CACHE_SIZE - 1);
2848 page = extent_buffer_page(eb, i);
2849 WARN_ON(!PageUptodate(page));
2851 cur = min(len, PAGE_CACHE_SIZE - offset);
2852 kaddr = kmap_atomic(page, KM_USER0);
2853 memset(kaddr + offset, c, cur);
2854 kunmap_atomic(kaddr, KM_USER0);
2861 EXPORT_SYMBOL(memset_extent_buffer);
2863 void copy_extent_buffer(struct extent_buffer *dst, struct extent_buffer *src,
2864 unsigned long dst_offset, unsigned long src_offset,
2867 u64 dst_len = dst->len;
2872 size_t start_offset = dst->start & ((u64)PAGE_CACHE_SIZE - 1);
2873 unsigned long i = (start_offset + dst_offset) >> PAGE_CACHE_SHIFT;
2875 WARN_ON(src->len != dst_len);
2877 offset = (start_offset + dst_offset) &
2878 ((unsigned long)PAGE_CACHE_SIZE - 1);
2881 page = extent_buffer_page(dst, i);
2882 WARN_ON(!PageUptodate(page));
2884 cur = min(len, (unsigned long)(PAGE_CACHE_SIZE - offset));
2886 kaddr = kmap_atomic(page, KM_USER0);
2887 read_extent_buffer(src, kaddr + offset, src_offset, cur);
2888 kunmap_atomic(kaddr, KM_USER0);
2896 EXPORT_SYMBOL(copy_extent_buffer);
2898 static void move_pages(struct page *dst_page, struct page *src_page,
2899 unsigned long dst_off, unsigned long src_off,
2902 char *dst_kaddr = kmap_atomic(dst_page, KM_USER0);
2903 if (dst_page == src_page) {
2904 memmove(dst_kaddr + dst_off, dst_kaddr + src_off, len);
2906 char *src_kaddr = kmap_atomic(src_page, KM_USER1);
2907 char *p = dst_kaddr + dst_off + len;
2908 char *s = src_kaddr + src_off + len;
2913 kunmap_atomic(src_kaddr, KM_USER1);
2915 kunmap_atomic(dst_kaddr, KM_USER0);
2918 static void copy_pages(struct page *dst_page, struct page *src_page,
2919 unsigned long dst_off, unsigned long src_off,
2922 char *dst_kaddr = kmap_atomic(dst_page, KM_USER0);
2925 if (dst_page != src_page)
2926 src_kaddr = kmap_atomic(src_page, KM_USER1);
2928 src_kaddr = dst_kaddr;
2930 memcpy(dst_kaddr + dst_off, src_kaddr + src_off, len);
2931 kunmap_atomic(dst_kaddr, KM_USER0);
2932 if (dst_page != src_page)
2933 kunmap_atomic(src_kaddr, KM_USER1);
2936 void memcpy_extent_buffer(struct extent_buffer *dst, unsigned long dst_offset,
2937 unsigned long src_offset, unsigned long len)
2940 size_t dst_off_in_page;
2941 size_t src_off_in_page;
2942 size_t start_offset = dst->start & ((u64)PAGE_CACHE_SIZE - 1);
2943 unsigned long dst_i;
2944 unsigned long src_i;
2946 if (src_offset + len > dst->len) {
2947 printk("memmove bogus src_offset %lu move len %lu len %lu\n",
2948 src_offset, len, dst->len);
2951 if (dst_offset + len > dst->len) {
2952 printk("memmove bogus dst_offset %lu move len %lu len %lu\n",
2953 dst_offset, len, dst->len);
2958 dst_off_in_page = (start_offset + dst_offset) &
2959 ((unsigned long)PAGE_CACHE_SIZE - 1);
2960 src_off_in_page = (start_offset + src_offset) &
2961 ((unsigned long)PAGE_CACHE_SIZE - 1);
2963 dst_i = (start_offset + dst_offset) >> PAGE_CACHE_SHIFT;
2964 src_i = (start_offset + src_offset) >> PAGE_CACHE_SHIFT;
2966 cur = min(len, (unsigned long)(PAGE_CACHE_SIZE -
2968 cur = min_t(unsigned long, cur,
2969 (unsigned long)(PAGE_CACHE_SIZE - dst_off_in_page));
2971 copy_pages(extent_buffer_page(dst, dst_i),
2972 extent_buffer_page(dst, src_i),
2973 dst_off_in_page, src_off_in_page, cur);
2980 EXPORT_SYMBOL(memcpy_extent_buffer);
2982 void memmove_extent_buffer(struct extent_buffer *dst, unsigned long dst_offset,
2983 unsigned long src_offset, unsigned long len)
2986 size_t dst_off_in_page;
2987 size_t src_off_in_page;
2988 unsigned long dst_end = dst_offset + len - 1;
2989 unsigned long src_end = src_offset + len - 1;
2990 size_t start_offset = dst->start & ((u64)PAGE_CACHE_SIZE - 1);
2991 unsigned long dst_i;
2992 unsigned long src_i;
2994 if (src_offset + len > dst->len) {
2995 printk("memmove bogus src_offset %lu move len %lu len %lu\n",
2996 src_offset, len, dst->len);
2999 if (dst_offset + len > dst->len) {
3000 printk("memmove bogus dst_offset %lu move len %lu len %lu\n",
3001 dst_offset, len, dst->len);
3004 if (dst_offset < src_offset) {
3005 memcpy_extent_buffer(dst, dst_offset, src_offset, len);
3009 dst_i = (start_offset + dst_end) >> PAGE_CACHE_SHIFT;
3010 src_i = (start_offset + src_end) >> PAGE_CACHE_SHIFT;
3012 dst_off_in_page = (start_offset + dst_end) &
3013 ((unsigned long)PAGE_CACHE_SIZE - 1);
3014 src_off_in_page = (start_offset + src_end) &
3015 ((unsigned long)PAGE_CACHE_SIZE - 1);
3017 cur = min_t(unsigned long, len, src_off_in_page + 1);
3018 cur = min(cur, dst_off_in_page + 1);
3019 move_pages(extent_buffer_page(dst, dst_i),
3020 extent_buffer_page(dst, src_i),
3021 dst_off_in_page - cur + 1,
3022 src_off_in_page - cur + 1, cur);
3029 EXPORT_SYMBOL(memmove_extent_buffer);