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;
45 int __init extent_map_init(void)
47 extent_map_cache = btrfs_cache_create("extent_map",
48 sizeof(struct extent_map), 0,
50 if (!extent_map_cache)
52 extent_state_cache = btrfs_cache_create("extent_state",
53 sizeof(struct extent_state), 0,
55 if (!extent_state_cache)
57 extent_buffer_cache = btrfs_cache_create("extent_buffers",
58 sizeof(struct extent_buffer), 0,
60 if (!extent_buffer_cache)
61 goto free_state_cache;
65 kmem_cache_destroy(extent_state_cache);
67 kmem_cache_destroy(extent_map_cache);
71 void __exit extent_map_exit(void)
73 struct extent_state *state;
75 while (!list_empty(&states)) {
76 state = list_entry(states.next, struct extent_state, list);
77 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));
78 list_del(&state->list);
79 kmem_cache_free(extent_state_cache, state);
84 kmem_cache_destroy(extent_map_cache);
85 if (extent_state_cache)
86 kmem_cache_destroy(extent_state_cache);
87 if (extent_buffer_cache)
88 kmem_cache_destroy(extent_buffer_cache);
91 void extent_map_tree_init(struct extent_map_tree *tree,
92 struct address_space *mapping, gfp_t mask)
94 tree->map.rb_node = NULL;
95 tree->state.rb_node = NULL;
97 rwlock_init(&tree->lock);
98 spin_lock_init(&tree->lru_lock);
99 tree->mapping = mapping;
100 INIT_LIST_HEAD(&tree->buffer_lru);
103 EXPORT_SYMBOL(extent_map_tree_init);
105 void extent_map_tree_empty_lru(struct extent_map_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_map_tree_empty_lru);
117 struct extent_map *alloc_extent_map(gfp_t mask)
119 struct extent_map *em;
120 em = kmem_cache_alloc(extent_map_cache, mask);
121 if (!em || IS_ERR(em))
124 atomic_set(&em->refs, 1);
127 EXPORT_SYMBOL(alloc_extent_map);
129 void free_extent_map(struct extent_map *em)
133 if (atomic_dec_and_test(&em->refs)) {
134 WARN_ON(em->in_tree);
135 kmem_cache_free(extent_map_cache, em);
138 EXPORT_SYMBOL(free_extent_map);
141 struct extent_state *alloc_extent_state(gfp_t mask)
143 struct extent_state *state;
146 state = kmem_cache_alloc(extent_state_cache, mask);
147 if (!state || IS_ERR(state))
153 spin_lock_irqsave(&state_lock, flags);
154 list_add(&state->list, &states);
155 spin_unlock_irqrestore(&state_lock, flags);
157 atomic_set(&state->refs, 1);
158 init_waitqueue_head(&state->wq);
161 EXPORT_SYMBOL(alloc_extent_state);
163 void free_extent_state(struct extent_state *state)
168 if (atomic_dec_and_test(&state->refs)) {
169 WARN_ON(state->in_tree);
170 spin_lock_irqsave(&state_lock, flags);
171 list_del(&state->list);
172 spin_unlock_irqrestore(&state_lock, flags);
173 kmem_cache_free(extent_state_cache, state);
176 EXPORT_SYMBOL(free_extent_state);
178 static struct rb_node *tree_insert(struct rb_root *root, u64 offset,
179 struct rb_node *node)
181 struct rb_node ** p = &root->rb_node;
182 struct rb_node * parent = NULL;
183 struct tree_entry *entry;
187 entry = rb_entry(parent, struct tree_entry, rb_node);
189 if (offset < entry->start)
191 else if (offset > entry->end)
197 entry = rb_entry(node, struct tree_entry, rb_node);
199 rb_link_node(node, parent, p);
200 rb_insert_color(node, root);
204 static struct rb_node *__tree_search(struct rb_root *root, u64 offset,
205 struct rb_node **prev_ret)
207 struct rb_node * n = root->rb_node;
208 struct rb_node *prev = NULL;
209 struct tree_entry *entry;
210 struct tree_entry *prev_entry = NULL;
213 entry = rb_entry(n, struct tree_entry, rb_node);
217 if (offset < entry->start)
219 else if (offset > entry->end)
226 while(prev && offset > prev_entry->end) {
227 prev = rb_next(prev);
228 prev_entry = rb_entry(prev, struct tree_entry, rb_node);
234 static inline struct rb_node *tree_search(struct rb_root *root, u64 offset)
236 struct rb_node *prev;
238 ret = __tree_search(root, offset, &prev);
244 static int tree_delete(struct rb_root *root, u64 offset)
246 struct rb_node *node;
247 struct tree_entry *entry;
249 node = __tree_search(root, offset, NULL);
252 entry = rb_entry(node, struct tree_entry, rb_node);
254 rb_erase(node, root);
259 * add_extent_mapping tries a simple backward merge with existing
260 * mappings. The extent_map struct passed in will be inserted into
261 * the tree directly (no copies made, just a reference taken).
263 int add_extent_mapping(struct extent_map_tree *tree,
264 struct extent_map *em)
267 struct extent_map *prev = NULL;
270 write_lock_irq(&tree->lock);
271 rb = tree_insert(&tree->map, em->end, &em->rb_node);
273 prev = rb_entry(rb, struct extent_map, rb_node);
274 printk("found extent map %Lu %Lu on insert of %Lu %Lu\n", prev->start, prev->end, em->start, em->end);
278 atomic_inc(&em->refs);
279 if (em->start != 0) {
280 rb = rb_prev(&em->rb_node);
282 prev = rb_entry(rb, struct extent_map, rb_node);
283 if (prev && prev->end + 1 == em->start &&
284 ((em->block_start == EXTENT_MAP_HOLE &&
285 prev->block_start == EXTENT_MAP_HOLE) ||
286 (em->block_start == EXTENT_MAP_INLINE &&
287 prev->block_start == EXTENT_MAP_INLINE) ||
288 (em->block_start == EXTENT_MAP_DELALLOC &&
289 prev->block_start == EXTENT_MAP_DELALLOC) ||
290 (em->block_start < EXTENT_MAP_DELALLOC - 1 &&
291 em->block_start == prev->block_end + 1))) {
292 em->start = prev->start;
293 em->block_start = prev->block_start;
294 rb_erase(&prev->rb_node, &tree->map);
296 free_extent_map(prev);
300 write_unlock_irq(&tree->lock);
303 EXPORT_SYMBOL(add_extent_mapping);
306 * lookup_extent_mapping returns the first extent_map struct in the
307 * tree that intersects the [start, end] (inclusive) range. There may
308 * be additional objects in the tree that intersect, so check the object
309 * returned carefully to make sure you don't need additional lookups.
311 struct extent_map *lookup_extent_mapping(struct extent_map_tree *tree,
314 struct extent_map *em;
315 struct rb_node *rb_node;
317 read_lock_irq(&tree->lock);
318 rb_node = tree_search(&tree->map, start);
323 if (IS_ERR(rb_node)) {
324 em = ERR_PTR(PTR_ERR(rb_node));
327 em = rb_entry(rb_node, struct extent_map, rb_node);
328 if (em->end < start || em->start > end) {
332 atomic_inc(&em->refs);
334 read_unlock_irq(&tree->lock);
337 EXPORT_SYMBOL(lookup_extent_mapping);
340 * removes an extent_map struct from the tree. No reference counts are
341 * dropped, and no checks are done to see if the range is in use
343 int remove_extent_mapping(struct extent_map_tree *tree, struct extent_map *em)
347 write_lock_irq(&tree->lock);
348 ret = tree_delete(&tree->map, em->end);
349 write_unlock_irq(&tree->lock);
352 EXPORT_SYMBOL(remove_extent_mapping);
355 * utility function to look for merge candidates inside a given range.
356 * Any extents with matching state are merged together into a single
357 * extent in the tree. Extents with EXTENT_IO in their state field
358 * are not merged because the end_io handlers need to be able to do
359 * operations on them without sleeping (or doing allocations/splits).
361 * This should be called with the tree lock held.
363 static int merge_state(struct extent_map_tree *tree,
364 struct extent_state *state)
366 struct extent_state *other;
367 struct rb_node *other_node;
369 if (state->state & EXTENT_IOBITS)
372 other_node = rb_prev(&state->rb_node);
374 other = rb_entry(other_node, struct extent_state, rb_node);
375 if (other->end == state->start - 1 &&
376 other->state == state->state) {
377 state->start = other->start;
379 rb_erase(&other->rb_node, &tree->state);
380 free_extent_state(other);
383 other_node = rb_next(&state->rb_node);
385 other = rb_entry(other_node, struct extent_state, rb_node);
386 if (other->start == state->end + 1 &&
387 other->state == state->state) {
388 other->start = state->start;
390 rb_erase(&state->rb_node, &tree->state);
391 free_extent_state(state);
398 * insert an extent_state struct into the tree. 'bits' are set on the
399 * struct before it is inserted.
401 * This may return -EEXIST if the extent is already there, in which case the
402 * state struct is freed.
404 * The tree lock is not taken internally. This is a utility function and
405 * probably isn't what you want to call (see set/clear_extent_bit).
407 static int insert_state(struct extent_map_tree *tree,
408 struct extent_state *state, u64 start, u64 end,
411 struct rb_node *node;
414 printk("end < start %Lu %Lu\n", end, start);
417 state->state |= bits;
418 state->start = start;
420 node = tree_insert(&tree->state, end, &state->rb_node);
422 struct extent_state *found;
423 found = rb_entry(node, struct extent_state, rb_node);
424 printk("found node %Lu %Lu on insert of %Lu %Lu\n", found->start, found->end, start, end);
425 free_extent_state(state);
428 merge_state(tree, state);
433 * split a given extent state struct in two, inserting the preallocated
434 * struct 'prealloc' as the newly created second half. 'split' indicates an
435 * offset inside 'orig' where it should be split.
438 * the tree has 'orig' at [orig->start, orig->end]. After calling, there
439 * are two extent state structs in the tree:
440 * prealloc: [orig->start, split - 1]
441 * orig: [ split, orig->end ]
443 * The tree locks are not taken by this function. They need to be held
446 static int split_state(struct extent_map_tree *tree, struct extent_state *orig,
447 struct extent_state *prealloc, u64 split)
449 struct rb_node *node;
450 prealloc->start = orig->start;
451 prealloc->end = split - 1;
452 prealloc->state = orig->state;
455 node = tree_insert(&tree->state, prealloc->end, &prealloc->rb_node);
457 struct extent_state *found;
458 found = rb_entry(node, struct extent_state, rb_node);
459 printk("found node %Lu %Lu on insert of %Lu %Lu\n", found->start, found->end, prealloc->start, prealloc->end);
460 free_extent_state(prealloc);
467 * utility function to clear some bits in an extent state struct.
468 * it will optionally wake up any one waiting on this state (wake == 1), or
469 * forcibly remove the state from the tree (delete == 1).
471 * If no bits are set on the state struct after clearing things, the
472 * struct is freed and removed from the tree
474 static int clear_state_bit(struct extent_map_tree *tree,
475 struct extent_state *state, int bits, int wake,
478 int ret = state->state & bits;
479 state->state &= ~bits;
482 if (delete || state->state == 0) {
483 if (state->in_tree) {
484 rb_erase(&state->rb_node, &tree->state);
486 free_extent_state(state);
491 merge_state(tree, state);
497 * clear some bits on a range in the tree. This may require splitting
498 * or inserting elements in the tree, so the gfp mask is used to
499 * indicate which allocations or sleeping are allowed.
501 * pass 'wake' == 1 to kick any sleepers, and 'delete' == 1 to remove
502 * the given range from the tree regardless of state (ie for truncate).
504 * the range [start, end] is inclusive.
506 * This takes the tree lock, and returns < 0 on error, > 0 if any of the
507 * bits were already set, or zero if none of the bits were already set.
509 int clear_extent_bit(struct extent_map_tree *tree, u64 start, u64 end,
510 int bits, int wake, int delete, gfp_t mask)
512 struct extent_state *state;
513 struct extent_state *prealloc = NULL;
514 struct rb_node *node;
520 if (!prealloc && (mask & __GFP_WAIT)) {
521 prealloc = alloc_extent_state(mask);
526 write_lock_irqsave(&tree->lock, flags);
528 * this search will find the extents that end after
531 node = tree_search(&tree->state, start);
534 state = rb_entry(node, struct extent_state, rb_node);
535 if (state->start > end)
537 WARN_ON(state->end < start);
540 * | ---- desired range ---- |
542 * | ------------- state -------------- |
544 * We need to split the extent we found, and may flip
545 * bits on second half.
547 * If the extent we found extends past our range, we
548 * just split and search again. It'll get split again
549 * the next time though.
551 * If the extent we found is inside our range, we clear
552 * the desired bit on it.
555 if (state->start < start) {
556 err = split_state(tree, state, prealloc, start);
557 BUG_ON(err == -EEXIST);
561 if (state->end <= end) {
562 start = state->end + 1;
563 set |= clear_state_bit(tree, state, bits,
566 start = state->start;
571 * | ---- desired range ---- |
573 * We need to split the extent, and clear the bit
576 if (state->start <= end && state->end > end) {
577 err = split_state(tree, state, prealloc, end + 1);
578 BUG_ON(err == -EEXIST);
582 set |= clear_state_bit(tree, prealloc, bits,
588 start = state->end + 1;
589 set |= clear_state_bit(tree, state, bits, wake, delete);
593 write_unlock_irqrestore(&tree->lock, flags);
595 free_extent_state(prealloc);
602 write_unlock_irqrestore(&tree->lock, flags);
603 if (mask & __GFP_WAIT)
607 EXPORT_SYMBOL(clear_extent_bit);
609 static int wait_on_state(struct extent_map_tree *tree,
610 struct extent_state *state)
613 prepare_to_wait(&state->wq, &wait, TASK_UNINTERRUPTIBLE);
614 read_unlock_irq(&tree->lock);
616 read_lock_irq(&tree->lock);
617 finish_wait(&state->wq, &wait);
622 * waits for one or more bits to clear on a range in the state tree.
623 * The range [start, end] is inclusive.
624 * The tree lock is taken by this function
626 int wait_extent_bit(struct extent_map_tree *tree, u64 start, u64 end, int bits)
628 struct extent_state *state;
629 struct rb_node *node;
631 read_lock_irq(&tree->lock);
635 * this search will find all the extents that end after
638 node = tree_search(&tree->state, start);
642 state = rb_entry(node, struct extent_state, rb_node);
644 if (state->start > end)
647 if (state->state & bits) {
648 start = state->start;
649 atomic_inc(&state->refs);
650 wait_on_state(tree, state);
651 free_extent_state(state);
654 start = state->end + 1;
659 if (need_resched()) {
660 read_unlock_irq(&tree->lock);
662 read_lock_irq(&tree->lock);
666 read_unlock_irq(&tree->lock);
669 EXPORT_SYMBOL(wait_extent_bit);
672 * set some bits on a range in the tree. This may require allocations
673 * or sleeping, so the gfp mask is used to indicate what is allowed.
675 * If 'exclusive' == 1, this will fail with -EEXIST if some part of the
676 * range already has the desired bits set. The start of the existing
677 * range is returned in failed_start in this case.
679 * [start, end] is inclusive
680 * This takes the tree lock.
682 int set_extent_bit(struct extent_map_tree *tree, u64 start, u64 end, int bits,
683 int exclusive, u64 *failed_start, gfp_t mask)
685 struct extent_state *state;
686 struct extent_state *prealloc = NULL;
687 struct rb_node *node;
694 if (!prealloc && (mask & __GFP_WAIT)) {
695 prealloc = alloc_extent_state(mask);
700 write_lock_irqsave(&tree->lock, flags);
702 * this search will find all the extents that end after
705 node = tree_search(&tree->state, start);
707 err = insert_state(tree, prealloc, start, end, bits);
709 BUG_ON(err == -EEXIST);
713 state = rb_entry(node, struct extent_state, rb_node);
714 last_start = state->start;
715 last_end = state->end;
718 * | ---- desired range ---- |
721 * Just lock what we found and keep going
723 if (state->start == start && state->end <= end) {
724 set = state->state & bits;
725 if (set && exclusive) {
726 *failed_start = state->start;
730 state->state |= bits;
731 start = state->end + 1;
732 merge_state(tree, state);
737 * | ---- desired range ---- |
740 * | ------------- state -------------- |
742 * We need to split the extent we found, and may flip bits on
745 * If the extent we found extends past our
746 * range, we just split and search again. It'll get split
747 * again the next time though.
749 * If the extent we found is inside our range, we set the
752 if (state->start < start) {
753 set = state->state & bits;
754 if (exclusive && set) {
755 *failed_start = start;
759 err = split_state(tree, state, prealloc, start);
760 BUG_ON(err == -EEXIST);
764 if (state->end <= end) {
765 state->state |= bits;
766 start = state->end + 1;
767 merge_state(tree, state);
769 start = state->start;
774 * | ---- desired range ---- |
775 * | state | or | state |
777 * There's a hole, we need to insert something in it and
778 * ignore the extent we found.
780 if (state->start > start) {
782 if (end < last_start)
785 this_end = last_start -1;
786 err = insert_state(tree, prealloc, start, this_end,
789 BUG_ON(err == -EEXIST);
792 start = this_end + 1;
796 * | ---- desired range ---- |
798 * We need to split the extent, and set the bit
801 if (state->start <= end && state->end > end) {
802 set = state->state & bits;
803 if (exclusive && set) {
804 *failed_start = start;
808 err = split_state(tree, state, prealloc, end + 1);
809 BUG_ON(err == -EEXIST);
811 prealloc->state |= bits;
812 merge_state(tree, prealloc);
820 write_unlock_irqrestore(&tree->lock, flags);
822 free_extent_state(prealloc);
829 write_unlock_irqrestore(&tree->lock, flags);
830 if (mask & __GFP_WAIT)
834 EXPORT_SYMBOL(set_extent_bit);
836 /* wrappers around set/clear extent bit */
837 int set_extent_dirty(struct extent_map_tree *tree, u64 start, u64 end,
840 return set_extent_bit(tree, start, end, EXTENT_DIRTY, 0, NULL,
843 EXPORT_SYMBOL(set_extent_dirty);
845 int set_extent_bits(struct extent_map_tree *tree, u64 start, u64 end,
846 int bits, gfp_t mask)
848 return set_extent_bit(tree, start, end, bits, 0, NULL,
851 EXPORT_SYMBOL(set_extent_bits);
853 int clear_extent_bits(struct extent_map_tree *tree, u64 start, u64 end,
854 int bits, gfp_t mask)
856 return clear_extent_bit(tree, start, end, bits, 0, 0, mask);
858 EXPORT_SYMBOL(clear_extent_bits);
860 int set_extent_delalloc(struct extent_map_tree *tree, u64 start, u64 end,
863 return set_extent_bit(tree, start, end,
864 EXTENT_DELALLOC | EXTENT_DIRTY, 0, NULL,
867 EXPORT_SYMBOL(set_extent_delalloc);
869 int clear_extent_dirty(struct extent_map_tree *tree, u64 start, u64 end,
872 return clear_extent_bit(tree, start, end,
873 EXTENT_DIRTY | EXTENT_DELALLOC, 0, 0, mask);
875 EXPORT_SYMBOL(clear_extent_dirty);
877 int set_extent_new(struct extent_map_tree *tree, u64 start, u64 end,
880 return set_extent_bit(tree, start, end, EXTENT_NEW, 0, NULL,
883 EXPORT_SYMBOL(set_extent_new);
885 int clear_extent_new(struct extent_map_tree *tree, u64 start, u64 end,
888 return clear_extent_bit(tree, start, end, EXTENT_NEW, 0, 0, mask);
890 EXPORT_SYMBOL(clear_extent_new);
892 int set_extent_uptodate(struct extent_map_tree *tree, u64 start, u64 end,
895 return set_extent_bit(tree, start, end, EXTENT_UPTODATE, 0, NULL,
898 EXPORT_SYMBOL(set_extent_uptodate);
900 int clear_extent_uptodate(struct extent_map_tree *tree, u64 start, u64 end,
903 return clear_extent_bit(tree, start, end, EXTENT_UPTODATE, 0, 0, mask);
905 EXPORT_SYMBOL(clear_extent_uptodate);
907 int set_extent_writeback(struct extent_map_tree *tree, u64 start, u64 end,
910 return set_extent_bit(tree, start, end, EXTENT_WRITEBACK,
913 EXPORT_SYMBOL(set_extent_writeback);
915 int clear_extent_writeback(struct extent_map_tree *tree, u64 start, u64 end,
918 return clear_extent_bit(tree, start, end, EXTENT_WRITEBACK, 1, 0, mask);
920 EXPORT_SYMBOL(clear_extent_writeback);
922 int wait_on_extent_writeback(struct extent_map_tree *tree, u64 start, u64 end)
924 return wait_extent_bit(tree, start, end, EXTENT_WRITEBACK);
926 EXPORT_SYMBOL(wait_on_extent_writeback);
929 * locks a range in ascending order, waiting for any locked regions
930 * it hits on the way. [start,end] are inclusive, and this will sleep.
932 int lock_extent(struct extent_map_tree *tree, u64 start, u64 end, gfp_t mask)
937 err = set_extent_bit(tree, start, end, EXTENT_LOCKED, 1,
938 &failed_start, mask);
939 if (err == -EEXIST && (mask & __GFP_WAIT)) {
940 wait_extent_bit(tree, failed_start, end, EXTENT_LOCKED);
941 start = failed_start;
945 WARN_ON(start > end);
949 EXPORT_SYMBOL(lock_extent);
951 int unlock_extent(struct extent_map_tree *tree, u64 start, u64 end,
954 return clear_extent_bit(tree, start, end, EXTENT_LOCKED, 1, 0, mask);
956 EXPORT_SYMBOL(unlock_extent);
959 * helper function to set pages and extents in the tree dirty
961 int set_range_dirty(struct extent_map_tree *tree, u64 start, u64 end)
963 unsigned long index = start >> PAGE_CACHE_SHIFT;
964 unsigned long end_index = end >> PAGE_CACHE_SHIFT;
967 while (index <= end_index) {
968 page = find_get_page(tree->mapping, index);
970 __set_page_dirty_nobuffers(page);
971 page_cache_release(page);
974 set_extent_dirty(tree, start, end, GFP_NOFS);
977 EXPORT_SYMBOL(set_range_dirty);
980 * helper function to set both pages and extents in the tree writeback
982 int set_range_writeback(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_writeback(page);
992 page_cache_release(page);
995 set_extent_writeback(tree, start, end, GFP_NOFS);
998 EXPORT_SYMBOL(set_range_writeback);
1000 int find_first_extent_bit(struct extent_map_tree *tree, u64 start,
1001 u64 *start_ret, u64 *end_ret, int bits)
1003 struct rb_node *node;
1004 struct extent_state *state;
1007 read_lock_irq(&tree->lock);
1009 * this search will find all the extents that end after
1012 node = tree_search(&tree->state, start);
1013 if (!node || IS_ERR(node)) {
1018 state = rb_entry(node, struct extent_state, rb_node);
1019 if (state->end >= start && (state->state & bits)) {
1020 *start_ret = state->start;
1021 *end_ret = state->end;
1025 node = rb_next(node);
1030 read_unlock_irq(&tree->lock);
1033 EXPORT_SYMBOL(find_first_extent_bit);
1035 u64 find_lock_delalloc_range(struct extent_map_tree *tree,
1036 u64 *start, u64 *end, u64 max_bytes)
1038 struct rb_node *node;
1039 struct extent_state *state;
1040 u64 cur_start = *start;
1042 u64 total_bytes = 0;
1044 write_lock_irq(&tree->lock);
1046 * this search will find all the extents that end after
1050 node = tree_search(&tree->state, cur_start);
1051 if (!node || IS_ERR(node)) {
1056 state = rb_entry(node, struct extent_state, rb_node);
1057 if (found && state->start != cur_start) {
1060 if (!(state->state & EXTENT_DELALLOC)) {
1064 struct extent_state *prev_state;
1065 struct rb_node *prev_node = node;
1067 prev_node = rb_prev(prev_node);
1070 prev_state = rb_entry(prev_node,
1071 struct extent_state,
1073 if (!(prev_state->state & EXTENT_DELALLOC))
1079 if (state->state & EXTENT_LOCKED) {
1081 atomic_inc(&state->refs);
1082 prepare_to_wait(&state->wq, &wait,
1083 TASK_UNINTERRUPTIBLE);
1084 write_unlock_irq(&tree->lock);
1086 write_lock_irq(&tree->lock);
1087 finish_wait(&state->wq, &wait);
1088 free_extent_state(state);
1091 state->state |= EXTENT_LOCKED;
1093 *start = state->start;
1096 cur_start = state->end + 1;
1097 node = rb_next(node);
1100 total_bytes += state->end - state->start + 1;
1101 if (total_bytes >= max_bytes)
1105 write_unlock_irq(&tree->lock);
1110 * helper function to lock both pages and extents in the tree.
1111 * pages must be locked first.
1113 int lock_range(struct extent_map_tree *tree, u64 start, u64 end)
1115 unsigned long index = start >> PAGE_CACHE_SHIFT;
1116 unsigned long end_index = end >> PAGE_CACHE_SHIFT;
1120 while (index <= end_index) {
1121 page = grab_cache_page(tree->mapping, index);
1127 err = PTR_ERR(page);
1132 lock_extent(tree, start, end, GFP_NOFS);
1137 * we failed above in getting the page at 'index', so we undo here
1138 * up to but not including the page at 'index'
1141 index = start >> PAGE_CACHE_SHIFT;
1142 while (index < end_index) {
1143 page = find_get_page(tree->mapping, index);
1145 page_cache_release(page);
1150 EXPORT_SYMBOL(lock_range);
1153 * helper function to unlock both pages and extents in the tree.
1155 int unlock_range(struct extent_map_tree *tree, u64 start, u64 end)
1157 unsigned long index = start >> PAGE_CACHE_SHIFT;
1158 unsigned long end_index = end >> PAGE_CACHE_SHIFT;
1161 while (index <= end_index) {
1162 page = find_get_page(tree->mapping, index);
1164 page_cache_release(page);
1167 unlock_extent(tree, start, end, GFP_NOFS);
1170 EXPORT_SYMBOL(unlock_range);
1172 int set_state_private(struct extent_map_tree *tree, u64 start, u64 private)
1174 struct rb_node *node;
1175 struct extent_state *state;
1178 write_lock_irq(&tree->lock);
1180 * this search will find all the extents that end after
1183 node = tree_search(&tree->state, start);
1184 if (!node || IS_ERR(node)) {
1188 state = rb_entry(node, struct extent_state, rb_node);
1189 if (state->start != start) {
1193 state->private = private;
1195 write_unlock_irq(&tree->lock);
1199 int get_state_private(struct extent_map_tree *tree, u64 start, u64 *private)
1201 struct rb_node *node;
1202 struct extent_state *state;
1205 read_lock_irq(&tree->lock);
1207 * this search will find all the extents that end after
1210 node = tree_search(&tree->state, start);
1211 if (!node || IS_ERR(node)) {
1215 state = rb_entry(node, struct extent_state, rb_node);
1216 if (state->start != start) {
1220 *private = state->private;
1222 read_unlock_irq(&tree->lock);
1227 * searches a range in the state tree for a given mask.
1228 * If 'filled' == 1, this returns 1 only if ever extent in the tree
1229 * has the bits set. Otherwise, 1 is returned if any bit in the
1230 * range is found set.
1232 int test_range_bit(struct extent_map_tree *tree, u64 start, u64 end,
1233 int bits, int filled)
1235 struct extent_state *state = NULL;
1236 struct rb_node *node;
1239 read_lock_irq(&tree->lock);
1240 node = tree_search(&tree->state, start);
1241 while (node && start <= end) {
1242 state = rb_entry(node, struct extent_state, rb_node);
1244 if (filled && state->start > start) {
1249 if (state->start > end)
1252 if (state->state & bits) {
1256 } else if (filled) {
1260 start = state->end + 1;
1263 node = rb_next(node);
1265 read_unlock_irq(&tree->lock);
1268 EXPORT_SYMBOL(test_range_bit);
1271 * helper function to set a given page up to date if all the
1272 * extents in the tree for that page are up to date
1274 static int check_page_uptodate(struct extent_map_tree *tree,
1277 u64 start = (u64)page->index << PAGE_CACHE_SHIFT;
1278 u64 end = start + PAGE_CACHE_SIZE - 1;
1279 if (test_range_bit(tree, start, end, EXTENT_UPTODATE, 1))
1280 SetPageUptodate(page);
1285 * helper function to unlock a page if all the extents in the tree
1286 * for that page are unlocked
1288 static int check_page_locked(struct extent_map_tree *tree,
1291 u64 start = (u64)page->index << PAGE_CACHE_SHIFT;
1292 u64 end = start + PAGE_CACHE_SIZE - 1;
1293 if (!test_range_bit(tree, start, end, EXTENT_LOCKED, 0))
1299 * helper function to end page writeback if all the extents
1300 * in the tree for that page are done with writeback
1302 static int check_page_writeback(struct extent_map_tree *tree,
1305 u64 start = (u64)page->index << PAGE_CACHE_SHIFT;
1306 u64 end = start + PAGE_CACHE_SIZE - 1;
1307 if (!test_range_bit(tree, start, end, EXTENT_WRITEBACK, 0))
1308 end_page_writeback(page);
1312 /* lots and lots of room for performance fixes in the end_bio funcs */
1315 * after a writepage IO is done, we need to:
1316 * clear the uptodate bits on error
1317 * clear the writeback bits in the extent tree for this IO
1318 * end_page_writeback if the page has no more pending IO
1320 * Scheduling is not allowed, so the extent state tree is expected
1321 * to have one and only one object corresponding to this IO.
1323 #if LINUX_VERSION_CODE > KERNEL_VERSION(2,6,23)
1324 static void end_bio_extent_writepage(struct bio *bio, int err)
1326 static int end_bio_extent_writepage(struct bio *bio,
1327 unsigned int bytes_done, int err)
1330 const int uptodate = test_bit(BIO_UPTODATE, &bio->bi_flags);
1331 struct bio_vec *bvec = bio->bi_io_vec + bio->bi_vcnt - 1;
1332 struct extent_map_tree *tree = bio->bi_private;
1337 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23)
1343 struct page *page = bvec->bv_page;
1344 start = ((u64)page->index << PAGE_CACHE_SHIFT) +
1346 end = start + bvec->bv_len - 1;
1348 if (bvec->bv_offset == 0 && bvec->bv_len == PAGE_CACHE_SIZE)
1353 if (--bvec >= bio->bi_io_vec)
1354 prefetchw(&bvec->bv_page->flags);
1357 clear_extent_uptodate(tree, start, end, GFP_ATOMIC);
1358 ClearPageUptodate(page);
1361 clear_extent_writeback(tree, start, end, GFP_ATOMIC);
1364 end_page_writeback(page);
1366 check_page_writeback(tree, page);
1367 if (tree->ops && tree->ops->writepage_end_io_hook)
1368 tree->ops->writepage_end_io_hook(page, start, end);
1369 } while (bvec >= bio->bi_io_vec);
1372 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23)
1378 * after a readpage IO is done, we need to:
1379 * clear the uptodate bits on error
1380 * set the uptodate bits if things worked
1381 * set the page up to date if all extents in the tree are uptodate
1382 * clear the lock bit in the extent tree
1383 * unlock the page if there are no other extents locked for it
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_readpage(struct bio *bio, int err)
1391 static int end_bio_extent_readpage(struct bio *bio,
1392 unsigned int bytes_done, int err)
1395 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;
1403 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23)
1409 struct page *page = bvec->bv_page;
1410 start = ((u64)page->index << PAGE_CACHE_SHIFT) +
1412 end = start + bvec->bv_len - 1;
1414 if (bvec->bv_offset == 0 && bvec->bv_len == PAGE_CACHE_SIZE)
1419 if (--bvec >= bio->bi_io_vec)
1420 prefetchw(&bvec->bv_page->flags);
1422 if (uptodate && tree->ops && tree->ops->readpage_end_io_hook) {
1423 ret = tree->ops->readpage_end_io_hook(page, start, end);
1428 set_extent_uptodate(tree, start, end, GFP_ATOMIC);
1430 SetPageUptodate(page);
1432 check_page_uptodate(tree, page);
1434 ClearPageUptodate(page);
1438 unlock_extent(tree, start, end, GFP_ATOMIC);
1443 check_page_locked(tree, page);
1444 } while (bvec >= bio->bi_io_vec);
1447 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23)
1453 * IO done from prepare_write is pretty simple, we just unlock
1454 * the structs in the extent tree when done, and set the uptodate bits
1457 #if LINUX_VERSION_CODE > KERNEL_VERSION(2,6,23)
1458 static void end_bio_extent_preparewrite(struct bio *bio, int err)
1460 static int end_bio_extent_preparewrite(struct bio *bio,
1461 unsigned int bytes_done, int err)
1464 const int uptodate = test_bit(BIO_UPTODATE, &bio->bi_flags);
1465 struct bio_vec *bvec = bio->bi_io_vec + bio->bi_vcnt - 1;
1466 struct extent_map_tree *tree = bio->bi_private;
1470 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23)
1476 struct page *page = bvec->bv_page;
1477 start = ((u64)page->index << PAGE_CACHE_SHIFT) +
1479 end = start + bvec->bv_len - 1;
1481 if (--bvec >= bio->bi_io_vec)
1482 prefetchw(&bvec->bv_page->flags);
1485 set_extent_uptodate(tree, start, end, GFP_ATOMIC);
1487 ClearPageUptodate(page);
1491 unlock_extent(tree, start, end, GFP_ATOMIC);
1493 } while (bvec >= bio->bi_io_vec);
1496 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23)
1502 extent_bio_alloc(struct block_device *bdev, u64 first_sector, int nr_vecs,
1507 bio = bio_alloc(gfp_flags, nr_vecs);
1509 if (bio == NULL && (current->flags & PF_MEMALLOC)) {
1510 while (!bio && (nr_vecs /= 2))
1511 bio = bio_alloc(gfp_flags, nr_vecs);
1515 bio->bi_bdev = bdev;
1516 bio->bi_sector = first_sector;
1521 static int submit_one_bio(int rw, struct bio *bio)
1525 submit_bio(rw, bio);
1526 if (bio_flagged(bio, BIO_EOPNOTSUPP))
1532 static int submit_extent_page(int rw, struct extent_map_tree *tree,
1533 struct page *page, sector_t sector,
1534 size_t size, unsigned long offset,
1535 struct block_device *bdev,
1536 struct bio **bio_ret,
1537 unsigned long max_pages,
1538 bio_end_io_t end_io_func)
1544 if (bio_ret && *bio_ret) {
1546 if (bio->bi_sector + (bio->bi_size >> 9) != sector ||
1547 bio_add_page(bio, page, size, offset) < size) {
1548 ret = submit_one_bio(rw, bio);
1554 nr = min_t(int, max_pages, bio_get_nr_vecs(bdev));
1555 bio = extent_bio_alloc(bdev, sector, nr, GFP_NOFS | __GFP_HIGH);
1557 printk("failed to allocate bio nr %d\n", nr);
1559 bio_add_page(bio, page, size, offset);
1560 bio->bi_end_io = end_io_func;
1561 bio->bi_private = tree;
1565 ret = submit_one_bio(rw, bio);
1571 void set_page_extent_mapped(struct page *page)
1573 if (!PagePrivate(page)) {
1574 SetPagePrivate(page);
1575 WARN_ON(!page->mapping->a_ops->invalidatepage);
1576 set_page_private(page, EXTENT_PAGE_PRIVATE);
1577 page_cache_get(page);
1582 * basic readpage implementation. Locked extent state structs are inserted
1583 * into the tree that are removed when the IO is done (by the end_io
1586 static int __extent_read_full_page(struct extent_map_tree *tree,
1588 get_extent_t *get_extent,
1591 struct inode *inode = page->mapping->host;
1592 u64 start = (u64)page->index << PAGE_CACHE_SHIFT;
1593 u64 page_end = start + PAGE_CACHE_SIZE - 1;
1597 u64 last_byte = i_size_read(inode);
1601 struct extent_map *em;
1602 struct block_device *bdev;
1605 size_t page_offset = 0;
1607 size_t blocksize = inode->i_sb->s_blocksize;
1609 set_page_extent_mapped(page);
1612 lock_extent(tree, start, end, GFP_NOFS);
1614 while (cur <= end) {
1615 if (cur >= last_byte) {
1616 iosize = PAGE_CACHE_SIZE - page_offset;
1617 zero_user_page(page, page_offset, iosize, KM_USER0);
1618 set_extent_uptodate(tree, cur, cur + iosize - 1,
1620 unlock_extent(tree, cur, cur + iosize - 1, GFP_NOFS);
1623 em = get_extent(inode, page, page_offset, cur, end, 0);
1624 if (IS_ERR(em) || !em) {
1626 unlock_extent(tree, cur, end, GFP_NOFS);
1630 extent_offset = cur - em->start;
1631 BUG_ON(em->end < cur);
1634 iosize = min(em->end - cur, end - cur) + 1;
1635 cur_end = min(em->end, end);
1636 iosize = (iosize + blocksize - 1) & ~((u64)blocksize - 1);
1637 sector = (em->block_start + extent_offset) >> 9;
1639 block_start = em->block_start;
1640 free_extent_map(em);
1643 /* we've found a hole, just zero and go on */
1644 if (block_start == EXTENT_MAP_HOLE) {
1645 zero_user_page(page, page_offset, iosize, KM_USER0);
1646 set_extent_uptodate(tree, cur, cur + iosize - 1,
1648 unlock_extent(tree, cur, cur + iosize - 1, GFP_NOFS);
1650 page_offset += iosize;
1653 /* the get_extent function already copied into the page */
1654 if (test_range_bit(tree, cur, cur_end, EXTENT_UPTODATE, 1)) {
1655 unlock_extent(tree, cur, cur + iosize - 1, GFP_NOFS);
1657 page_offset += iosize;
1662 if (tree->ops && tree->ops->readpage_io_hook) {
1663 ret = tree->ops->readpage_io_hook(page, cur,
1667 unsigned long nr = (last_byte >> PAGE_CACHE_SHIFT) + 1;
1669 ret = submit_extent_page(READ, tree, page,
1670 sector, iosize, page_offset,
1672 end_bio_extent_readpage);
1677 page_offset += iosize;
1681 if (!PageError(page))
1682 SetPageUptodate(page);
1688 int extent_read_full_page(struct extent_map_tree *tree, struct page *page,
1689 get_extent_t *get_extent)
1691 struct bio *bio = NULL;
1694 ret = __extent_read_full_page(tree, page, get_extent, &bio);
1696 submit_one_bio(READ, bio);
1699 EXPORT_SYMBOL(extent_read_full_page);
1702 * the writepage semantics are similar to regular writepage. extent
1703 * records are inserted to lock ranges in the tree, and as dirty areas
1704 * are found, they are marked writeback. Then the lock bits are removed
1705 * and the end_io handler clears the writeback ranges
1707 static int __extent_writepage(struct page *page, struct writeback_control *wbc,
1710 struct inode *inode = page->mapping->host;
1711 struct extent_page_data *epd = data;
1712 struct extent_map_tree *tree = epd->tree;
1713 u64 start = (u64)page->index << PAGE_CACHE_SHIFT;
1715 u64 page_end = start + PAGE_CACHE_SIZE - 1;
1719 u64 last_byte = i_size_read(inode);
1723 struct extent_map *em;
1724 struct block_device *bdev;
1727 size_t page_offset = 0;
1729 loff_t i_size = i_size_read(inode);
1730 unsigned long end_index = i_size >> PAGE_CACHE_SHIFT;
1734 WARN_ON(!PageLocked(page));
1735 if (page->index > end_index) {
1736 clear_extent_dirty(tree, start, page_end, GFP_NOFS);
1741 if (page->index == end_index) {
1742 size_t offset = i_size & (PAGE_CACHE_SIZE - 1);
1743 zero_user_page(page, offset,
1744 PAGE_CACHE_SIZE - offset, KM_USER0);
1747 set_page_extent_mapped(page);
1749 delalloc_start = start;
1751 while(delalloc_end < page_end) {
1752 nr_delalloc = find_lock_delalloc_range(tree, &delalloc_start,
1755 if (nr_delalloc <= 0)
1757 tree->ops->fill_delalloc(inode, delalloc_start,
1759 clear_extent_bit(tree, delalloc_start,
1761 EXTENT_LOCKED | EXTENT_DELALLOC,
1763 delalloc_start = delalloc_end + 1;
1765 lock_extent(tree, start, page_end, GFP_NOFS);
1768 if (test_range_bit(tree, start, page_end, EXTENT_DELALLOC, 0)) {
1769 printk("found delalloc bits after lock_extent\n");
1772 if (last_byte <= start) {
1773 clear_extent_dirty(tree, start, page_end, GFP_NOFS);
1777 set_extent_uptodate(tree, start, page_end, GFP_NOFS);
1778 blocksize = inode->i_sb->s_blocksize;
1780 while (cur <= end) {
1781 if (cur >= last_byte) {
1782 clear_extent_dirty(tree, cur, page_end, GFP_NOFS);
1785 em = epd->get_extent(inode, page, page_offset, cur, end, 1);
1786 if (IS_ERR(em) || !em) {
1791 extent_offset = cur - em->start;
1792 BUG_ON(em->end < cur);
1794 iosize = min(em->end - cur, end - cur) + 1;
1795 iosize = (iosize + blocksize - 1) & ~((u64)blocksize - 1);
1796 sector = (em->block_start + extent_offset) >> 9;
1798 block_start = em->block_start;
1799 free_extent_map(em);
1802 if (block_start == EXTENT_MAP_HOLE ||
1803 block_start == EXTENT_MAP_INLINE) {
1804 clear_extent_dirty(tree, cur,
1805 cur + iosize - 1, GFP_NOFS);
1807 page_offset += iosize;
1811 /* leave this out until we have a page_mkwrite call */
1812 if (0 && !test_range_bit(tree, cur, cur + iosize - 1,
1815 page_offset += iosize;
1818 clear_extent_dirty(tree, cur, cur + iosize - 1, GFP_NOFS);
1819 if (tree->ops && tree->ops->writepage_io_hook) {
1820 ret = tree->ops->writepage_io_hook(page, cur,
1828 unsigned long max_nr = end_index + 1;
1829 set_range_writeback(tree, cur, cur + iosize - 1);
1830 if (!PageWriteback(page)) {
1831 printk("warning page %lu not writeback, "
1832 "cur %llu end %llu\n", page->index,
1833 (unsigned long long)cur,
1834 (unsigned long long)end);
1837 ret = submit_extent_page(WRITE, tree, page, sector,
1838 iosize, page_offset, bdev,
1840 end_bio_extent_writepage);
1845 page_offset += iosize;
1850 /* make sure the mapping tag for page dirty gets cleared */
1851 set_page_writeback(page);
1852 end_page_writeback(page);
1854 unlock_extent(tree, start, page_end, GFP_NOFS);
1859 int extent_write_full_page(struct extent_map_tree *tree, struct page *page,
1860 get_extent_t *get_extent,
1861 struct writeback_control *wbc)
1864 struct extent_page_data epd = {
1867 .get_extent = get_extent,
1870 ret = __extent_writepage(page, wbc, &epd);
1872 submit_one_bio(WRITE, epd.bio);
1875 EXPORT_SYMBOL(extent_write_full_page);
1877 int extent_writepages(struct extent_map_tree *tree,
1878 struct address_space *mapping,
1879 get_extent_t *get_extent,
1880 struct writeback_control *wbc)
1883 struct extent_page_data epd = {
1886 .get_extent = get_extent,
1889 ret = write_cache_pages(mapping, wbc, __extent_writepage, &epd);
1891 submit_one_bio(WRITE, epd.bio);
1894 EXPORT_SYMBOL(extent_writepages);
1896 int extent_readpages(struct extent_map_tree *tree,
1897 struct address_space *mapping,
1898 struct list_head *pages, unsigned nr_pages,
1899 get_extent_t get_extent)
1901 struct bio *bio = NULL;
1903 struct pagevec pvec;
1905 pagevec_init(&pvec, 0);
1906 for (page_idx = 0; page_idx < nr_pages; page_idx++) {
1907 struct page *page = list_entry(pages->prev, struct page, lru);
1909 prefetchw(&page->flags);
1910 list_del(&page->lru);
1912 * what we want to do here is call add_to_page_cache_lru,
1913 * but that isn't exported, so we reproduce it here
1915 if (!add_to_page_cache(page, mapping,
1916 page->index, GFP_KERNEL)) {
1918 /* open coding of lru_cache_add, also not exported */
1919 page_cache_get(page);
1920 if (!pagevec_add(&pvec, page))
1921 __pagevec_lru_add(&pvec);
1922 __extent_read_full_page(tree, page, get_extent, &bio);
1924 page_cache_release(page);
1926 if (pagevec_count(&pvec))
1927 __pagevec_lru_add(&pvec);
1928 BUG_ON(!list_empty(pages));
1930 submit_one_bio(READ, bio);
1933 EXPORT_SYMBOL(extent_readpages);
1936 * basic invalidatepage code, this waits on any locked or writeback
1937 * ranges corresponding to the page, and then deletes any extent state
1938 * records from the tree
1940 int extent_invalidatepage(struct extent_map_tree *tree,
1941 struct page *page, unsigned long offset)
1943 u64 start = ((u64)page->index << PAGE_CACHE_SHIFT);
1944 u64 end = start + PAGE_CACHE_SIZE - 1;
1945 size_t blocksize = page->mapping->host->i_sb->s_blocksize;
1947 start += (offset + blocksize -1) & ~(blocksize - 1);
1951 lock_extent(tree, start, end, GFP_NOFS);
1952 wait_on_extent_writeback(tree, start, end);
1953 clear_extent_bit(tree, start, end,
1954 EXTENT_LOCKED | EXTENT_DIRTY | EXTENT_DELALLOC,
1958 EXPORT_SYMBOL(extent_invalidatepage);
1961 * simple commit_write call, set_range_dirty is used to mark both
1962 * the pages and the extent records as dirty
1964 int extent_commit_write(struct extent_map_tree *tree,
1965 struct inode *inode, struct page *page,
1966 unsigned from, unsigned to)
1968 loff_t pos = ((loff_t)page->index << PAGE_CACHE_SHIFT) + to;
1970 set_page_extent_mapped(page);
1971 set_page_dirty(page);
1973 if (pos > inode->i_size) {
1974 i_size_write(inode, pos);
1975 mark_inode_dirty(inode);
1979 EXPORT_SYMBOL(extent_commit_write);
1981 int extent_prepare_write(struct extent_map_tree *tree,
1982 struct inode *inode, struct page *page,
1983 unsigned from, unsigned to, get_extent_t *get_extent)
1985 u64 page_start = (u64)page->index << PAGE_CACHE_SHIFT;
1986 u64 page_end = page_start + PAGE_CACHE_SIZE - 1;
1988 u64 orig_block_start;
1991 struct extent_map *em;
1992 unsigned blocksize = 1 << inode->i_blkbits;
1993 size_t page_offset = 0;
1994 size_t block_off_start;
1995 size_t block_off_end;
2001 set_page_extent_mapped(page);
2003 block_start = (page_start + from) & ~((u64)blocksize - 1);
2004 block_end = (page_start + to - 1) | (blocksize - 1);
2005 orig_block_start = block_start;
2007 lock_extent(tree, page_start, page_end, GFP_NOFS);
2008 while(block_start <= block_end) {
2009 em = get_extent(inode, page, page_offset, block_start,
2011 if (IS_ERR(em) || !em) {
2014 cur_end = min(block_end, em->end);
2015 block_off_start = block_start & (PAGE_CACHE_SIZE - 1);
2016 block_off_end = block_off_start + blocksize;
2017 isnew = clear_extent_new(tree, block_start, cur_end, GFP_NOFS);
2019 if (!PageUptodate(page) && isnew &&
2020 (block_off_end > to || block_off_start < from)) {
2023 kaddr = kmap_atomic(page, KM_USER0);
2024 if (block_off_end > to)
2025 memset(kaddr + to, 0, block_off_end - to);
2026 if (block_off_start < from)
2027 memset(kaddr + block_off_start, 0,
2028 from - block_off_start);
2029 flush_dcache_page(page);
2030 kunmap_atomic(kaddr, KM_USER0);
2032 if (!isnew && !PageUptodate(page) &&
2033 (block_off_end > to || block_off_start < from) &&
2034 !test_range_bit(tree, block_start, cur_end,
2035 EXTENT_UPTODATE, 1)) {
2037 u64 extent_offset = block_start - em->start;
2039 sector = (em->block_start + extent_offset) >> 9;
2040 iosize = (cur_end - block_start + blocksize - 1) &
2041 ~((u64)blocksize - 1);
2043 * we've already got the extent locked, but we
2044 * need to split the state such that our end_bio
2045 * handler can clear the lock.
2047 set_extent_bit(tree, block_start,
2048 block_start + iosize - 1,
2049 EXTENT_LOCKED, 0, NULL, GFP_NOFS);
2050 ret = submit_extent_page(READ, tree, page,
2051 sector, iosize, page_offset, em->bdev,
2053 end_bio_extent_preparewrite);
2055 block_start = block_start + iosize;
2057 set_extent_uptodate(tree, block_start, cur_end,
2059 unlock_extent(tree, block_start, cur_end, GFP_NOFS);
2060 block_start = cur_end + 1;
2062 page_offset = block_start & (PAGE_CACHE_SIZE - 1);
2063 free_extent_map(em);
2066 wait_extent_bit(tree, orig_block_start,
2067 block_end, EXTENT_LOCKED);
2069 check_page_uptodate(tree, page);
2071 /* FIXME, zero out newly allocated blocks on error */
2074 EXPORT_SYMBOL(extent_prepare_write);
2077 * a helper for releasepage. As long as there are no locked extents
2078 * in the range corresponding to the page, both state records and extent
2079 * map records are removed
2081 int try_release_extent_mapping(struct extent_map_tree *tree, struct page *page)
2083 struct extent_map *em;
2084 u64 start = (u64)page->index << PAGE_CACHE_SHIFT;
2085 u64 end = start + PAGE_CACHE_SIZE - 1;
2086 u64 orig_start = start;
2089 while (start <= end) {
2090 em = lookup_extent_mapping(tree, start, end);
2091 if (!em || IS_ERR(em))
2093 if (!test_range_bit(tree, em->start, em->end,
2094 EXTENT_LOCKED, 0)) {
2095 remove_extent_mapping(tree, em);
2096 /* once for the rb tree */
2097 free_extent_map(em);
2099 start = em->end + 1;
2101 free_extent_map(em);
2103 if (test_range_bit(tree, orig_start, end, EXTENT_LOCKED, 0))
2106 clear_extent_bit(tree, orig_start, end, EXTENT_UPTODATE,
2110 EXPORT_SYMBOL(try_release_extent_mapping);
2112 sector_t extent_bmap(struct address_space *mapping, sector_t iblock,
2113 get_extent_t *get_extent)
2115 struct inode *inode = mapping->host;
2116 u64 start = iblock << inode->i_blkbits;
2117 u64 end = start + (1 << inode->i_blkbits) - 1;
2118 sector_t sector = 0;
2119 struct extent_map *em;
2121 em = get_extent(inode, NULL, 0, start, end, 0);
2122 if (!em || IS_ERR(em))
2125 if (em->block_start == EXTENT_MAP_INLINE ||
2126 em->block_start == EXTENT_MAP_HOLE)
2129 sector = (em->block_start + start - em->start) >> inode->i_blkbits;
2131 free_extent_map(em);
2135 static int add_lru(struct extent_map_tree *tree, struct extent_buffer *eb)
2137 if (list_empty(&eb->lru)) {
2138 extent_buffer_get(eb);
2139 list_add(&eb->lru, &tree->buffer_lru);
2141 if (tree->lru_size >= BUFFER_LRU_MAX) {
2142 struct extent_buffer *rm;
2143 rm = list_entry(tree->buffer_lru.prev,
2144 struct extent_buffer, lru);
2146 list_del_init(&rm->lru);
2147 free_extent_buffer(rm);
2150 list_move(&eb->lru, &tree->buffer_lru);
2153 static struct extent_buffer *find_lru(struct extent_map_tree *tree,
2154 u64 start, unsigned long len)
2156 struct list_head *lru = &tree->buffer_lru;
2157 struct list_head *cur = lru->next;
2158 struct extent_buffer *eb;
2160 if (list_empty(lru))
2164 eb = list_entry(cur, struct extent_buffer, lru);
2165 if (eb->start == start && eb->len == len) {
2166 extent_buffer_get(eb);
2170 } while (cur != lru);
2174 static inline unsigned long num_extent_pages(u64 start, u64 len)
2176 return ((start + len + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT) -
2177 (start >> PAGE_CACHE_SHIFT);
2180 static inline struct page *extent_buffer_page(struct extent_buffer *eb,
2184 struct address_space *mapping;
2187 return eb->first_page;
2188 i += eb->start >> PAGE_CACHE_SHIFT;
2189 mapping = eb->first_page->mapping;
2190 read_lock_irq(&mapping->tree_lock);
2191 p = radix_tree_lookup(&mapping->page_tree, i);
2192 read_unlock_irq(&mapping->tree_lock);
2196 static struct extent_buffer *__alloc_extent_buffer(struct extent_map_tree *tree,
2201 struct extent_buffer *eb = NULL;
2203 spin_lock(&tree->lru_lock);
2204 eb = find_lru(tree, start, len);
2205 spin_unlock(&tree->lru_lock);
2210 eb = kmem_cache_zalloc(extent_buffer_cache, mask);
2211 INIT_LIST_HEAD(&eb->lru);
2214 atomic_set(&eb->refs, 1);
2219 static void __free_extent_buffer(struct extent_buffer *eb)
2221 kmem_cache_free(extent_buffer_cache, eb);
2224 struct extent_buffer *alloc_extent_buffer(struct extent_map_tree *tree,
2225 u64 start, unsigned long len,
2229 unsigned long num_pages = num_extent_pages(start, len);
2231 unsigned long index = start >> PAGE_CACHE_SHIFT;
2232 struct extent_buffer *eb;
2234 struct address_space *mapping = tree->mapping;
2237 eb = __alloc_extent_buffer(tree, start, len, mask);
2238 if (!eb || IS_ERR(eb))
2241 if (eb->flags & EXTENT_BUFFER_FILLED)
2245 eb->first_page = page0;
2248 page_cache_get(page0);
2249 mark_page_accessed(page0);
2250 set_page_extent_mapped(page0);
2251 WARN_ON(!PageUptodate(page0));
2252 set_page_private(page0, EXTENT_PAGE_PRIVATE_FIRST_PAGE |
2257 for (; i < num_pages; i++, index++) {
2258 p = find_or_create_page(mapping, index, mask | __GFP_HIGHMEM);
2263 set_page_extent_mapped(p);
2264 mark_page_accessed(p);
2267 set_page_private(p, EXTENT_PAGE_PRIVATE_FIRST_PAGE |
2270 set_page_private(p, EXTENT_PAGE_PRIVATE);
2272 if (!PageUptodate(p))
2277 eb->flags |= EXTENT_UPTODATE;
2278 eb->flags |= EXTENT_BUFFER_FILLED;
2281 spin_lock(&tree->lru_lock);
2283 spin_unlock(&tree->lru_lock);
2287 spin_lock(&tree->lru_lock);
2288 list_del_init(&eb->lru);
2289 spin_unlock(&tree->lru_lock);
2290 if (!atomic_dec_and_test(&eb->refs))
2292 for (index = 1; index < i; index++) {
2293 page_cache_release(extent_buffer_page(eb, index));
2296 page_cache_release(extent_buffer_page(eb, 0));
2297 __free_extent_buffer(eb);
2300 EXPORT_SYMBOL(alloc_extent_buffer);
2302 struct extent_buffer *find_extent_buffer(struct extent_map_tree *tree,
2303 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)
2321 for (i = 0; i < num_pages; i++, index++) {
2322 p = find_lock_page(mapping, index);
2326 set_page_extent_mapped(p);
2327 mark_page_accessed(p);
2331 set_page_private(p, EXTENT_PAGE_PRIVATE_FIRST_PAGE |
2334 set_page_private(p, EXTENT_PAGE_PRIVATE);
2337 if (!PageUptodate(p))
2342 eb->flags |= EXTENT_UPTODATE;
2343 eb->flags |= EXTENT_BUFFER_FILLED;
2346 spin_lock(&tree->lru_lock);
2348 spin_unlock(&tree->lru_lock);
2351 spin_lock(&tree->lru_lock);
2352 list_del_init(&eb->lru);
2353 spin_unlock(&tree->lru_lock);
2354 if (!atomic_dec_and_test(&eb->refs))
2356 for (index = 1; index < i; index++) {
2357 page_cache_release(extent_buffer_page(eb, index));
2360 page_cache_release(extent_buffer_page(eb, 0));
2361 __free_extent_buffer(eb);
2364 EXPORT_SYMBOL(find_extent_buffer);
2366 void free_extent_buffer(struct extent_buffer *eb)
2369 unsigned long num_pages;
2374 if (!atomic_dec_and_test(&eb->refs))
2377 WARN_ON(!list_empty(&eb->lru));
2378 num_pages = num_extent_pages(eb->start, eb->len);
2380 for (i = 1; i < num_pages; i++) {
2381 page_cache_release(extent_buffer_page(eb, i));
2383 page_cache_release(extent_buffer_page(eb, 0));
2384 __free_extent_buffer(eb);
2386 EXPORT_SYMBOL(free_extent_buffer);
2388 int clear_extent_buffer_dirty(struct extent_map_tree *tree,
2389 struct extent_buffer *eb)
2393 unsigned long num_pages;
2396 u64 start = eb->start;
2397 u64 end = start + eb->len - 1;
2399 set = clear_extent_dirty(tree, start, end, GFP_NOFS);
2400 num_pages = num_extent_pages(eb->start, eb->len);
2402 for (i = 0; i < num_pages; i++) {
2403 page = extent_buffer_page(eb, i);
2406 * if we're on the last page or the first page and the
2407 * block isn't aligned on a page boundary, do extra checks
2408 * to make sure we don't clean page that is partially dirty
2410 if ((i == 0 && (eb->start & (PAGE_CACHE_SIZE - 1))) ||
2411 ((i == num_pages - 1) &&
2412 ((eb->start + eb->len) & (PAGE_CACHE_SIZE - 1)))) {
2413 start = (u64)page->index << PAGE_CACHE_SHIFT;
2414 end = start + PAGE_CACHE_SIZE - 1;
2415 if (test_range_bit(tree, start, end,
2421 clear_page_dirty_for_io(page);
2422 write_lock_irq(&page->mapping->tree_lock);
2423 if (!PageDirty(page)) {
2424 radix_tree_tag_clear(&page->mapping->page_tree,
2426 PAGECACHE_TAG_DIRTY);
2428 write_unlock_irq(&page->mapping->tree_lock);
2433 EXPORT_SYMBOL(clear_extent_buffer_dirty);
2435 int wait_on_extent_buffer_writeback(struct extent_map_tree *tree,
2436 struct extent_buffer *eb)
2438 return wait_on_extent_writeback(tree, eb->start,
2439 eb->start + eb->len - 1);
2441 EXPORT_SYMBOL(wait_on_extent_buffer_writeback);
2443 int set_extent_buffer_dirty(struct extent_map_tree *tree,
2444 struct extent_buffer *eb)
2447 unsigned long num_pages;
2449 num_pages = num_extent_pages(eb->start, eb->len);
2450 for (i = 0; i < num_pages; i++) {
2451 struct page *page = extent_buffer_page(eb, i);
2452 /* writepage may need to do something special for the
2453 * first page, we have to make sure page->private is
2454 * properly set. releasepage may drop page->private
2455 * on us if the page isn't already dirty.
2459 set_page_private(page,
2460 EXTENT_PAGE_PRIVATE_FIRST_PAGE |
2463 __set_page_dirty_nobuffers(extent_buffer_page(eb, i));
2467 return set_extent_dirty(tree, eb->start,
2468 eb->start + eb->len - 1, GFP_NOFS);
2470 EXPORT_SYMBOL(set_extent_buffer_dirty);
2472 int set_extent_buffer_uptodate(struct extent_map_tree *tree,
2473 struct extent_buffer *eb)
2477 unsigned long num_pages;
2479 num_pages = num_extent_pages(eb->start, eb->len);
2481 set_extent_uptodate(tree, eb->start, eb->start + eb->len - 1,
2483 for (i = 0; i < num_pages; i++) {
2484 page = extent_buffer_page(eb, i);
2485 if ((i == 0 && (eb->start & (PAGE_CACHE_SIZE - 1))) ||
2486 ((i == num_pages - 1) &&
2487 ((eb->start + eb->len) & (PAGE_CACHE_SIZE - 1)))) {
2488 check_page_uptodate(tree, page);
2491 SetPageUptodate(page);
2495 EXPORT_SYMBOL(set_extent_buffer_uptodate);
2497 int extent_buffer_uptodate(struct extent_map_tree *tree,
2498 struct extent_buffer *eb)
2500 if (eb->flags & EXTENT_UPTODATE)
2502 return test_range_bit(tree, eb->start, eb->start + eb->len - 1,
2503 EXTENT_UPTODATE, 1);
2505 EXPORT_SYMBOL(extent_buffer_uptodate);
2507 int read_extent_buffer_pages(struct extent_map_tree *tree,
2508 struct extent_buffer *eb,
2513 unsigned long start_i;
2517 unsigned long num_pages;
2519 if (eb->flags & EXTENT_UPTODATE)
2522 if (0 && test_range_bit(tree, eb->start, eb->start + eb->len - 1,
2523 EXTENT_UPTODATE, 1)) {
2528 WARN_ON(start < eb->start);
2529 start_i = (start >> PAGE_CACHE_SHIFT) -
2530 (eb->start >> PAGE_CACHE_SHIFT);
2535 num_pages = num_extent_pages(eb->start, eb->len);
2536 for (i = start_i; i < num_pages; i++) {
2537 page = extent_buffer_page(eb, i);
2538 if (PageUptodate(page)) {
2542 if (TestSetPageLocked(page)) {
2548 if (!PageUptodate(page)) {
2549 err = page->mapping->a_ops->readpage(NULL, page);
2562 for (i = start_i; i < num_pages; i++) {
2563 page = extent_buffer_page(eb, i);
2564 wait_on_page_locked(page);
2565 if (!PageUptodate(page)) {
2570 eb->flags |= EXTENT_UPTODATE;
2573 EXPORT_SYMBOL(read_extent_buffer_pages);
2575 void read_extent_buffer(struct extent_buffer *eb, void *dstv,
2576 unsigned long start,
2583 char *dst = (char *)dstv;
2584 size_t start_offset = eb->start & ((u64)PAGE_CACHE_SIZE - 1);
2585 unsigned long i = (start_offset + start) >> PAGE_CACHE_SHIFT;
2586 unsigned long num_pages = num_extent_pages(eb->start, eb->len);
2588 WARN_ON(start > eb->len);
2589 WARN_ON(start + len > eb->start + eb->len);
2591 offset = (start_offset + start) & ((unsigned long)PAGE_CACHE_SIZE - 1);
2594 page = extent_buffer_page(eb, i);
2595 if (!PageUptodate(page)) {
2596 printk("page %lu not up to date i %lu, total %lu, len %lu\n", page->index, i, num_pages, eb->len);
2599 WARN_ON(!PageUptodate(page));
2601 cur = min(len, (PAGE_CACHE_SIZE - offset));
2602 kaddr = kmap_atomic(page, KM_USER1);
2603 memcpy(dst, kaddr + offset, cur);
2604 kunmap_atomic(kaddr, KM_USER1);
2612 EXPORT_SYMBOL(read_extent_buffer);
2614 int map_private_extent_buffer(struct extent_buffer *eb, unsigned long start,
2615 unsigned long min_len, char **token, char **map,
2616 unsigned long *map_start,
2617 unsigned long *map_len, int km)
2619 size_t offset = start & (PAGE_CACHE_SIZE - 1);
2622 size_t start_offset = eb->start & ((u64)PAGE_CACHE_SIZE - 1);
2623 unsigned long i = (start_offset + start) >> PAGE_CACHE_SHIFT;
2624 unsigned long end_i = (start_offset + start + min_len - 1) >>
2631 offset = start_offset;
2635 *map_start = ((u64)i << PAGE_CACHE_SHIFT) - start_offset;
2637 if (start + min_len > eb->len) {
2638 printk("bad mapping eb start %Lu len %lu, wanted %lu %lu\n", eb->start, eb->len, start, min_len);
2642 p = extent_buffer_page(eb, i);
2643 WARN_ON(!PageUptodate(p));
2644 kaddr = kmap_atomic(p, km);
2646 *map = kaddr + offset;
2647 *map_len = PAGE_CACHE_SIZE - offset;
2650 EXPORT_SYMBOL(map_private_extent_buffer);
2652 int map_extent_buffer(struct extent_buffer *eb, unsigned long start,
2653 unsigned long min_len,
2654 char **token, char **map,
2655 unsigned long *map_start,
2656 unsigned long *map_len, int km)
2660 if (eb->map_token) {
2661 unmap_extent_buffer(eb, eb->map_token, km);
2662 eb->map_token = NULL;
2665 err = map_private_extent_buffer(eb, start, min_len, token, map,
2666 map_start, map_len, km);
2668 eb->map_token = *token;
2670 eb->map_start = *map_start;
2671 eb->map_len = *map_len;
2675 EXPORT_SYMBOL(map_extent_buffer);
2677 void unmap_extent_buffer(struct extent_buffer *eb, char *token, int km)
2679 kunmap_atomic(token, km);
2681 EXPORT_SYMBOL(unmap_extent_buffer);
2683 int memcmp_extent_buffer(struct extent_buffer *eb, const void *ptrv,
2684 unsigned long start,
2691 char *ptr = (char *)ptrv;
2692 size_t start_offset = eb->start & ((u64)PAGE_CACHE_SIZE - 1);
2693 unsigned long i = (start_offset + start) >> PAGE_CACHE_SHIFT;
2696 WARN_ON(start > eb->len);
2697 WARN_ON(start + len > eb->start + eb->len);
2699 offset = (start_offset + start) & ((unsigned long)PAGE_CACHE_SIZE - 1);
2702 page = extent_buffer_page(eb, i);
2703 WARN_ON(!PageUptodate(page));
2705 cur = min(len, (PAGE_CACHE_SIZE - offset));
2707 kaddr = kmap_atomic(page, KM_USER0);
2708 ret = memcmp(ptr, kaddr + offset, cur);
2709 kunmap_atomic(kaddr, KM_USER0);
2720 EXPORT_SYMBOL(memcmp_extent_buffer);
2722 void write_extent_buffer(struct extent_buffer *eb, const void *srcv,
2723 unsigned long start, unsigned long len)
2729 char *src = (char *)srcv;
2730 size_t start_offset = eb->start & ((u64)PAGE_CACHE_SIZE - 1);
2731 unsigned long i = (start_offset + start) >> PAGE_CACHE_SHIFT;
2733 WARN_ON(start > eb->len);
2734 WARN_ON(start + len > eb->start + eb->len);
2736 offset = (start_offset + start) & ((unsigned long)PAGE_CACHE_SIZE - 1);
2739 page = extent_buffer_page(eb, i);
2740 WARN_ON(!PageUptodate(page));
2742 cur = min(len, PAGE_CACHE_SIZE - offset);
2743 kaddr = kmap_atomic(page, KM_USER1);
2744 memcpy(kaddr + offset, src, cur);
2745 kunmap_atomic(kaddr, KM_USER1);
2753 EXPORT_SYMBOL(write_extent_buffer);
2755 void memset_extent_buffer(struct extent_buffer *eb, char c,
2756 unsigned long start, unsigned long len)
2762 size_t start_offset = eb->start & ((u64)PAGE_CACHE_SIZE - 1);
2763 unsigned long i = (start_offset + start) >> PAGE_CACHE_SHIFT;
2765 WARN_ON(start > eb->len);
2766 WARN_ON(start + len > eb->start + eb->len);
2768 offset = (start_offset + start) & ((unsigned long)PAGE_CACHE_SIZE - 1);
2771 page = extent_buffer_page(eb, i);
2772 WARN_ON(!PageUptodate(page));
2774 cur = min(len, PAGE_CACHE_SIZE - offset);
2775 kaddr = kmap_atomic(page, KM_USER0);
2776 memset(kaddr + offset, c, cur);
2777 kunmap_atomic(kaddr, KM_USER0);
2784 EXPORT_SYMBOL(memset_extent_buffer);
2786 void copy_extent_buffer(struct extent_buffer *dst, struct extent_buffer *src,
2787 unsigned long dst_offset, unsigned long src_offset,
2790 u64 dst_len = dst->len;
2795 size_t start_offset = dst->start & ((u64)PAGE_CACHE_SIZE - 1);
2796 unsigned long i = (start_offset + dst_offset) >> PAGE_CACHE_SHIFT;
2798 WARN_ON(src->len != dst_len);
2800 offset = (start_offset + dst_offset) &
2801 ((unsigned long)PAGE_CACHE_SIZE - 1);
2804 page = extent_buffer_page(dst, i);
2805 WARN_ON(!PageUptodate(page));
2807 cur = min(len, (unsigned long)(PAGE_CACHE_SIZE - offset));
2809 kaddr = kmap_atomic(page, KM_USER0);
2810 read_extent_buffer(src, kaddr + offset, src_offset, cur);
2811 kunmap_atomic(kaddr, KM_USER0);
2819 EXPORT_SYMBOL(copy_extent_buffer);
2821 static void move_pages(struct page *dst_page, struct page *src_page,
2822 unsigned long dst_off, unsigned long src_off,
2825 char *dst_kaddr = kmap_atomic(dst_page, KM_USER0);
2826 if (dst_page == src_page) {
2827 memmove(dst_kaddr + dst_off, dst_kaddr + src_off, len);
2829 char *src_kaddr = kmap_atomic(src_page, KM_USER1);
2830 char *p = dst_kaddr + dst_off + len;
2831 char *s = src_kaddr + src_off + len;
2836 kunmap_atomic(src_kaddr, KM_USER1);
2838 kunmap_atomic(dst_kaddr, KM_USER0);
2841 static void copy_pages(struct page *dst_page, struct page *src_page,
2842 unsigned long dst_off, unsigned long src_off,
2845 char *dst_kaddr = kmap_atomic(dst_page, KM_USER0);
2848 if (dst_page != src_page)
2849 src_kaddr = kmap_atomic(src_page, KM_USER1);
2851 src_kaddr = dst_kaddr;
2853 memcpy(dst_kaddr + dst_off, src_kaddr + src_off, len);
2854 kunmap_atomic(dst_kaddr, KM_USER0);
2855 if (dst_page != src_page)
2856 kunmap_atomic(src_kaddr, KM_USER1);
2859 void memcpy_extent_buffer(struct extent_buffer *dst, unsigned long dst_offset,
2860 unsigned long src_offset, unsigned long len)
2863 size_t dst_off_in_page;
2864 size_t src_off_in_page;
2865 size_t start_offset = dst->start & ((u64)PAGE_CACHE_SIZE - 1);
2866 unsigned long dst_i;
2867 unsigned long src_i;
2869 if (src_offset + len > dst->len) {
2870 printk("memmove bogus src_offset %lu move len %lu len %lu\n",
2871 src_offset, len, dst->len);
2874 if (dst_offset + len > dst->len) {
2875 printk("memmove bogus dst_offset %lu move len %lu len %lu\n",
2876 dst_offset, len, dst->len);
2881 dst_off_in_page = (start_offset + dst_offset) &
2882 ((unsigned long)PAGE_CACHE_SIZE - 1);
2883 src_off_in_page = (start_offset + src_offset) &
2884 ((unsigned long)PAGE_CACHE_SIZE - 1);
2886 dst_i = (start_offset + dst_offset) >> PAGE_CACHE_SHIFT;
2887 src_i = (start_offset + src_offset) >> PAGE_CACHE_SHIFT;
2889 cur = min(len, (unsigned long)(PAGE_CACHE_SIZE -
2891 cur = min_t(unsigned long, cur,
2892 (unsigned long)(PAGE_CACHE_SIZE - dst_off_in_page));
2894 copy_pages(extent_buffer_page(dst, dst_i),
2895 extent_buffer_page(dst, src_i),
2896 dst_off_in_page, src_off_in_page, cur);
2903 EXPORT_SYMBOL(memcpy_extent_buffer);
2905 void memmove_extent_buffer(struct extent_buffer *dst, unsigned long dst_offset,
2906 unsigned long src_offset, unsigned long len)
2909 size_t dst_off_in_page;
2910 size_t src_off_in_page;
2911 unsigned long dst_end = dst_offset + len - 1;
2912 unsigned long src_end = src_offset + len - 1;
2913 size_t start_offset = dst->start & ((u64)PAGE_CACHE_SIZE - 1);
2914 unsigned long dst_i;
2915 unsigned long src_i;
2917 if (src_offset + len > dst->len) {
2918 printk("memmove bogus src_offset %lu move len %lu len %lu\n",
2919 src_offset, len, dst->len);
2922 if (dst_offset + len > dst->len) {
2923 printk("memmove bogus dst_offset %lu move len %lu len %lu\n",
2924 dst_offset, len, dst->len);
2927 if (dst_offset < src_offset) {
2928 memcpy_extent_buffer(dst, dst_offset, src_offset, len);
2932 dst_i = (start_offset + dst_end) >> PAGE_CACHE_SHIFT;
2933 src_i = (start_offset + src_end) >> PAGE_CACHE_SHIFT;
2935 dst_off_in_page = (start_offset + dst_end) &
2936 ((unsigned long)PAGE_CACHE_SIZE - 1);
2937 src_off_in_page = (start_offset + src_end) &
2938 ((unsigned long)PAGE_CACHE_SIZE - 1);
2940 cur = min_t(unsigned long, len, src_off_in_page + 1);
2941 cur = min(cur, dst_off_in_page + 1);
2942 move_pages(extent_buffer_page(dst, dst_i),
2943 extent_buffer_page(dst, src_i),
2944 dst_off_in_page - cur + 1,
2945 src_off_in_page - cur + 1, cur);
2952 EXPORT_SYMBOL(memmove_extent_buffer);