Commit | Line | Data |
---|---|---|
d1310b2e CM |
1 | #include <linux/bitops.h> |
2 | #include <linux/slab.h> | |
3 | #include <linux/bio.h> | |
4 | #include <linux/mm.h> | |
d1310b2e CM |
5 | #include <linux/pagemap.h> |
6 | #include <linux/page-flags.h> | |
d1310b2e CM |
7 | #include <linux/spinlock.h> |
8 | #include <linux/blkdev.h> | |
9 | #include <linux/swap.h> | |
d1310b2e CM |
10 | #include <linux/writeback.h> |
11 | #include <linux/pagevec.h> | |
268bb0ce | 12 | #include <linux/prefetch.h> |
90a887c9 | 13 | #include <linux/cleancache.h> |
d1310b2e CM |
14 | #include "extent_io.h" |
15 | #include "extent_map.h" | |
902b22f3 DW |
16 | #include "ctree.h" |
17 | #include "btrfs_inode.h" | |
4a54c8c1 | 18 | #include "volumes.h" |
21adbd5c | 19 | #include "check-integrity.h" |
0b32f4bb | 20 | #include "locking.h" |
606686ee | 21 | #include "rcu-string.h" |
fe09e16c | 22 | #include "backref.h" |
d1310b2e | 23 | |
d1310b2e CM |
24 | static struct kmem_cache *extent_state_cache; |
25 | static struct kmem_cache *extent_buffer_cache; | |
9be3395b | 26 | static struct bio_set *btrfs_bioset; |
d1310b2e | 27 | |
27a3507d FM |
28 | static inline bool extent_state_in_tree(const struct extent_state *state) |
29 | { | |
30 | return !RB_EMPTY_NODE(&state->rb_node); | |
31 | } | |
32 | ||
6d49ba1b | 33 | #ifdef CONFIG_BTRFS_DEBUG |
d1310b2e CM |
34 | static LIST_HEAD(buffers); |
35 | static LIST_HEAD(states); | |
4bef0848 | 36 | |
d397712b | 37 | static DEFINE_SPINLOCK(leak_lock); |
6d49ba1b ES |
38 | |
39 | static inline | |
40 | void btrfs_leak_debug_add(struct list_head *new, struct list_head *head) | |
41 | { | |
42 | unsigned long flags; | |
43 | ||
44 | spin_lock_irqsave(&leak_lock, flags); | |
45 | list_add(new, head); | |
46 | spin_unlock_irqrestore(&leak_lock, flags); | |
47 | } | |
48 | ||
49 | static inline | |
50 | void btrfs_leak_debug_del(struct list_head *entry) | |
51 | { | |
52 | unsigned long flags; | |
53 | ||
54 | spin_lock_irqsave(&leak_lock, flags); | |
55 | list_del(entry); | |
56 | spin_unlock_irqrestore(&leak_lock, flags); | |
57 | } | |
58 | ||
59 | static inline | |
60 | void btrfs_leak_debug_check(void) | |
61 | { | |
62 | struct extent_state *state; | |
63 | struct extent_buffer *eb; | |
64 | ||
65 | while (!list_empty(&states)) { | |
66 | state = list_entry(states.next, struct extent_state, leak_list); | |
27a3507d FM |
67 | pr_err("BTRFS: state leak: start %llu end %llu state %lu in tree %d refs %d\n", |
68 | state->start, state->end, state->state, | |
69 | extent_state_in_tree(state), | |
c1c9ff7c | 70 | atomic_read(&state->refs)); |
6d49ba1b ES |
71 | list_del(&state->leak_list); |
72 | kmem_cache_free(extent_state_cache, state); | |
73 | } | |
74 | ||
75 | while (!list_empty(&buffers)) { | |
76 | eb = list_entry(buffers.next, struct extent_buffer, leak_list); | |
efe120a0 | 77 | printk(KERN_ERR "BTRFS: buffer leak start %llu len %lu " |
c1c9ff7c GU |
78 | "refs %d\n", |
79 | eb->start, eb->len, atomic_read(&eb->refs)); | |
6d49ba1b ES |
80 | list_del(&eb->leak_list); |
81 | kmem_cache_free(extent_buffer_cache, eb); | |
82 | } | |
83 | } | |
8d599ae1 | 84 | |
a5dee37d JB |
85 | #define btrfs_debug_check_extent_io_range(tree, start, end) \ |
86 | __btrfs_debug_check_extent_io_range(__func__, (tree), (start), (end)) | |
8d599ae1 | 87 | static inline void __btrfs_debug_check_extent_io_range(const char *caller, |
a5dee37d | 88 | struct extent_io_tree *tree, u64 start, u64 end) |
8d599ae1 | 89 | { |
a5dee37d JB |
90 | struct inode *inode; |
91 | u64 isize; | |
8d599ae1 | 92 | |
a5dee37d JB |
93 | if (!tree->mapping) |
94 | return; | |
8d599ae1 | 95 | |
a5dee37d JB |
96 | inode = tree->mapping->host; |
97 | isize = i_size_read(inode); | |
8d599ae1 DS |
98 | if (end >= PAGE_SIZE && (end % 2) == 0 && end != isize - 1) { |
99 | printk_ratelimited(KERN_DEBUG | |
efe120a0 | 100 | "BTRFS: %s: ino %llu isize %llu odd range [%llu,%llu]\n", |
c1c9ff7c | 101 | caller, btrfs_ino(inode), isize, start, end); |
8d599ae1 DS |
102 | } |
103 | } | |
6d49ba1b ES |
104 | #else |
105 | #define btrfs_leak_debug_add(new, head) do {} while (0) | |
106 | #define btrfs_leak_debug_del(entry) do {} while (0) | |
107 | #define btrfs_leak_debug_check() do {} while (0) | |
8d599ae1 | 108 | #define btrfs_debug_check_extent_io_range(c, s, e) do {} while (0) |
4bef0848 | 109 | #endif |
d1310b2e | 110 | |
d1310b2e CM |
111 | #define BUFFER_LRU_MAX 64 |
112 | ||
113 | struct tree_entry { | |
114 | u64 start; | |
115 | u64 end; | |
d1310b2e CM |
116 | struct rb_node rb_node; |
117 | }; | |
118 | ||
119 | struct extent_page_data { | |
120 | struct bio *bio; | |
121 | struct extent_io_tree *tree; | |
122 | get_extent_t *get_extent; | |
de0022b9 | 123 | unsigned long bio_flags; |
771ed689 CM |
124 | |
125 | /* tells writepage not to lock the state bits for this range | |
126 | * it still does the unlocking | |
127 | */ | |
ffbd517d CM |
128 | unsigned int extent_locked:1; |
129 | ||
130 | /* tells the submit_bio code to use a WRITE_SYNC */ | |
131 | unsigned int sync_io:1; | |
d1310b2e CM |
132 | }; |
133 | ||
0b32f4bb | 134 | static noinline void flush_write_bio(void *data); |
c2d904e0 JM |
135 | static inline struct btrfs_fs_info * |
136 | tree_fs_info(struct extent_io_tree *tree) | |
137 | { | |
a5dee37d JB |
138 | if (!tree->mapping) |
139 | return NULL; | |
c2d904e0 JM |
140 | return btrfs_sb(tree->mapping->host->i_sb); |
141 | } | |
0b32f4bb | 142 | |
d1310b2e CM |
143 | int __init extent_io_init(void) |
144 | { | |
837e1972 | 145 | extent_state_cache = kmem_cache_create("btrfs_extent_state", |
9601e3f6 CH |
146 | sizeof(struct extent_state), 0, |
147 | SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL); | |
d1310b2e CM |
148 | if (!extent_state_cache) |
149 | return -ENOMEM; | |
150 | ||
837e1972 | 151 | extent_buffer_cache = kmem_cache_create("btrfs_extent_buffer", |
9601e3f6 CH |
152 | sizeof(struct extent_buffer), 0, |
153 | SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL); | |
d1310b2e CM |
154 | if (!extent_buffer_cache) |
155 | goto free_state_cache; | |
9be3395b CM |
156 | |
157 | btrfs_bioset = bioset_create(BIO_POOL_SIZE, | |
158 | offsetof(struct btrfs_io_bio, bio)); | |
159 | if (!btrfs_bioset) | |
160 | goto free_buffer_cache; | |
b208c2f7 DW |
161 | |
162 | if (bioset_integrity_create(btrfs_bioset, BIO_POOL_SIZE)) | |
163 | goto free_bioset; | |
164 | ||
d1310b2e CM |
165 | return 0; |
166 | ||
b208c2f7 DW |
167 | free_bioset: |
168 | bioset_free(btrfs_bioset); | |
169 | btrfs_bioset = NULL; | |
170 | ||
9be3395b CM |
171 | free_buffer_cache: |
172 | kmem_cache_destroy(extent_buffer_cache); | |
173 | extent_buffer_cache = NULL; | |
174 | ||
d1310b2e CM |
175 | free_state_cache: |
176 | kmem_cache_destroy(extent_state_cache); | |
9be3395b | 177 | extent_state_cache = NULL; |
d1310b2e CM |
178 | return -ENOMEM; |
179 | } | |
180 | ||
181 | void extent_io_exit(void) | |
182 | { | |
6d49ba1b | 183 | btrfs_leak_debug_check(); |
8c0a8537 KS |
184 | |
185 | /* | |
186 | * Make sure all delayed rcu free are flushed before we | |
187 | * destroy caches. | |
188 | */ | |
189 | rcu_barrier(); | |
d1310b2e CM |
190 | if (extent_state_cache) |
191 | kmem_cache_destroy(extent_state_cache); | |
192 | if (extent_buffer_cache) | |
193 | kmem_cache_destroy(extent_buffer_cache); | |
9be3395b CM |
194 | if (btrfs_bioset) |
195 | bioset_free(btrfs_bioset); | |
d1310b2e CM |
196 | } |
197 | ||
198 | void extent_io_tree_init(struct extent_io_tree *tree, | |
f993c883 | 199 | struct address_space *mapping) |
d1310b2e | 200 | { |
6bef4d31 | 201 | tree->state = RB_ROOT; |
d1310b2e CM |
202 | tree->ops = NULL; |
203 | tree->dirty_bytes = 0; | |
70dec807 | 204 | spin_lock_init(&tree->lock); |
d1310b2e | 205 | tree->mapping = mapping; |
d1310b2e | 206 | } |
d1310b2e | 207 | |
b2950863 | 208 | static struct extent_state *alloc_extent_state(gfp_t mask) |
d1310b2e CM |
209 | { |
210 | struct extent_state *state; | |
d1310b2e CM |
211 | |
212 | state = kmem_cache_alloc(extent_state_cache, mask); | |
2b114d1d | 213 | if (!state) |
d1310b2e CM |
214 | return state; |
215 | state->state = 0; | |
d1310b2e | 216 | state->private = 0; |
27a3507d | 217 | RB_CLEAR_NODE(&state->rb_node); |
6d49ba1b | 218 | btrfs_leak_debug_add(&state->leak_list, &states); |
d1310b2e CM |
219 | atomic_set(&state->refs, 1); |
220 | init_waitqueue_head(&state->wq); | |
143bede5 | 221 | trace_alloc_extent_state(state, mask, _RET_IP_); |
d1310b2e CM |
222 | return state; |
223 | } | |
d1310b2e | 224 | |
4845e44f | 225 | void free_extent_state(struct extent_state *state) |
d1310b2e | 226 | { |
d1310b2e CM |
227 | if (!state) |
228 | return; | |
229 | if (atomic_dec_and_test(&state->refs)) { | |
27a3507d | 230 | WARN_ON(extent_state_in_tree(state)); |
6d49ba1b | 231 | btrfs_leak_debug_del(&state->leak_list); |
143bede5 | 232 | trace_free_extent_state(state, _RET_IP_); |
d1310b2e CM |
233 | kmem_cache_free(extent_state_cache, state); |
234 | } | |
235 | } | |
d1310b2e | 236 | |
f2071b21 FM |
237 | static struct rb_node *tree_insert(struct rb_root *root, |
238 | struct rb_node *search_start, | |
239 | u64 offset, | |
12cfbad9 FDBM |
240 | struct rb_node *node, |
241 | struct rb_node ***p_in, | |
242 | struct rb_node **parent_in) | |
d1310b2e | 243 | { |
f2071b21 | 244 | struct rb_node **p; |
d397712b | 245 | struct rb_node *parent = NULL; |
d1310b2e CM |
246 | struct tree_entry *entry; |
247 | ||
12cfbad9 FDBM |
248 | if (p_in && parent_in) { |
249 | p = *p_in; | |
250 | parent = *parent_in; | |
251 | goto do_insert; | |
252 | } | |
253 | ||
f2071b21 | 254 | p = search_start ? &search_start : &root->rb_node; |
d397712b | 255 | while (*p) { |
d1310b2e CM |
256 | parent = *p; |
257 | entry = rb_entry(parent, struct tree_entry, rb_node); | |
258 | ||
259 | if (offset < entry->start) | |
260 | p = &(*p)->rb_left; | |
261 | else if (offset > entry->end) | |
262 | p = &(*p)->rb_right; | |
263 | else | |
264 | return parent; | |
265 | } | |
266 | ||
12cfbad9 | 267 | do_insert: |
d1310b2e CM |
268 | rb_link_node(node, parent, p); |
269 | rb_insert_color(node, root); | |
270 | return NULL; | |
271 | } | |
272 | ||
80ea96b1 | 273 | static struct rb_node *__etree_search(struct extent_io_tree *tree, u64 offset, |
12cfbad9 FDBM |
274 | struct rb_node **prev_ret, |
275 | struct rb_node **next_ret, | |
276 | struct rb_node ***p_ret, | |
277 | struct rb_node **parent_ret) | |
d1310b2e | 278 | { |
80ea96b1 | 279 | struct rb_root *root = &tree->state; |
12cfbad9 | 280 | struct rb_node **n = &root->rb_node; |
d1310b2e CM |
281 | struct rb_node *prev = NULL; |
282 | struct rb_node *orig_prev = NULL; | |
283 | struct tree_entry *entry; | |
284 | struct tree_entry *prev_entry = NULL; | |
285 | ||
12cfbad9 FDBM |
286 | while (*n) { |
287 | prev = *n; | |
288 | entry = rb_entry(prev, struct tree_entry, rb_node); | |
d1310b2e CM |
289 | prev_entry = entry; |
290 | ||
291 | if (offset < entry->start) | |
12cfbad9 | 292 | n = &(*n)->rb_left; |
d1310b2e | 293 | else if (offset > entry->end) |
12cfbad9 | 294 | n = &(*n)->rb_right; |
d397712b | 295 | else |
12cfbad9 | 296 | return *n; |
d1310b2e CM |
297 | } |
298 | ||
12cfbad9 FDBM |
299 | if (p_ret) |
300 | *p_ret = n; | |
301 | if (parent_ret) | |
302 | *parent_ret = prev; | |
303 | ||
d1310b2e CM |
304 | if (prev_ret) { |
305 | orig_prev = prev; | |
d397712b | 306 | while (prev && offset > prev_entry->end) { |
d1310b2e CM |
307 | prev = rb_next(prev); |
308 | prev_entry = rb_entry(prev, struct tree_entry, rb_node); | |
309 | } | |
310 | *prev_ret = prev; | |
311 | prev = orig_prev; | |
312 | } | |
313 | ||
314 | if (next_ret) { | |
315 | prev_entry = rb_entry(prev, struct tree_entry, rb_node); | |
d397712b | 316 | while (prev && offset < prev_entry->start) { |
d1310b2e CM |
317 | prev = rb_prev(prev); |
318 | prev_entry = rb_entry(prev, struct tree_entry, rb_node); | |
319 | } | |
320 | *next_ret = prev; | |
321 | } | |
322 | return NULL; | |
323 | } | |
324 | ||
12cfbad9 FDBM |
325 | static inline struct rb_node * |
326 | tree_search_for_insert(struct extent_io_tree *tree, | |
327 | u64 offset, | |
328 | struct rb_node ***p_ret, | |
329 | struct rb_node **parent_ret) | |
d1310b2e | 330 | { |
70dec807 | 331 | struct rb_node *prev = NULL; |
d1310b2e | 332 | struct rb_node *ret; |
70dec807 | 333 | |
12cfbad9 | 334 | ret = __etree_search(tree, offset, &prev, NULL, p_ret, parent_ret); |
d397712b | 335 | if (!ret) |
d1310b2e CM |
336 | return prev; |
337 | return ret; | |
338 | } | |
339 | ||
12cfbad9 FDBM |
340 | static inline struct rb_node *tree_search(struct extent_io_tree *tree, |
341 | u64 offset) | |
342 | { | |
343 | return tree_search_for_insert(tree, offset, NULL, NULL); | |
344 | } | |
345 | ||
9ed74f2d JB |
346 | static void merge_cb(struct extent_io_tree *tree, struct extent_state *new, |
347 | struct extent_state *other) | |
348 | { | |
349 | if (tree->ops && tree->ops->merge_extent_hook) | |
350 | tree->ops->merge_extent_hook(tree->mapping->host, new, | |
351 | other); | |
352 | } | |
353 | ||
d1310b2e CM |
354 | /* |
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). | |
360 | * | |
361 | * This should be called with the tree lock held. | |
362 | */ | |
1bf85046 JM |
363 | static void merge_state(struct extent_io_tree *tree, |
364 | struct extent_state *state) | |
d1310b2e CM |
365 | { |
366 | struct extent_state *other; | |
367 | struct rb_node *other_node; | |
368 | ||
5b21f2ed | 369 | if (state->state & (EXTENT_IOBITS | EXTENT_BOUNDARY)) |
1bf85046 | 370 | return; |
d1310b2e CM |
371 | |
372 | other_node = rb_prev(&state->rb_node); | |
373 | if (other_node) { | |
374 | other = rb_entry(other_node, struct extent_state, rb_node); | |
375 | if (other->end == state->start - 1 && | |
376 | other->state == state->state) { | |
9ed74f2d | 377 | merge_cb(tree, state, other); |
d1310b2e | 378 | state->start = other->start; |
d1310b2e | 379 | rb_erase(&other->rb_node, &tree->state); |
27a3507d | 380 | RB_CLEAR_NODE(&other->rb_node); |
d1310b2e CM |
381 | free_extent_state(other); |
382 | } | |
383 | } | |
384 | other_node = rb_next(&state->rb_node); | |
385 | if (other_node) { | |
386 | other = rb_entry(other_node, struct extent_state, rb_node); | |
387 | if (other->start == state->end + 1 && | |
388 | other->state == state->state) { | |
9ed74f2d | 389 | merge_cb(tree, state, other); |
df98b6e2 | 390 | state->end = other->end; |
df98b6e2 | 391 | rb_erase(&other->rb_node, &tree->state); |
27a3507d | 392 | RB_CLEAR_NODE(&other->rb_node); |
df98b6e2 | 393 | free_extent_state(other); |
d1310b2e CM |
394 | } |
395 | } | |
d1310b2e CM |
396 | } |
397 | ||
1bf85046 | 398 | static void set_state_cb(struct extent_io_tree *tree, |
41074888 | 399 | struct extent_state *state, unsigned long *bits) |
291d673e | 400 | { |
1bf85046 JM |
401 | if (tree->ops && tree->ops->set_bit_hook) |
402 | tree->ops->set_bit_hook(tree->mapping->host, state, bits); | |
291d673e CM |
403 | } |
404 | ||
405 | static void clear_state_cb(struct extent_io_tree *tree, | |
41074888 | 406 | struct extent_state *state, unsigned long *bits) |
291d673e | 407 | { |
9ed74f2d JB |
408 | if (tree->ops && tree->ops->clear_bit_hook) |
409 | tree->ops->clear_bit_hook(tree->mapping->host, state, bits); | |
291d673e CM |
410 | } |
411 | ||
3150b699 | 412 | static void set_state_bits(struct extent_io_tree *tree, |
41074888 | 413 | struct extent_state *state, unsigned long *bits); |
3150b699 | 414 | |
d1310b2e CM |
415 | /* |
416 | * insert an extent_state struct into the tree. 'bits' are set on the | |
417 | * struct before it is inserted. | |
418 | * | |
419 | * This may return -EEXIST if the extent is already there, in which case the | |
420 | * state struct is freed. | |
421 | * | |
422 | * The tree lock is not taken internally. This is a utility function and | |
423 | * probably isn't what you want to call (see set/clear_extent_bit). | |
424 | */ | |
425 | static int insert_state(struct extent_io_tree *tree, | |
426 | struct extent_state *state, u64 start, u64 end, | |
12cfbad9 FDBM |
427 | struct rb_node ***p, |
428 | struct rb_node **parent, | |
41074888 | 429 | unsigned long *bits) |
d1310b2e CM |
430 | { |
431 | struct rb_node *node; | |
432 | ||
31b1a2bd | 433 | if (end < start) |
efe120a0 | 434 | WARN(1, KERN_ERR "BTRFS: end < start %llu %llu\n", |
c1c9ff7c | 435 | end, start); |
d1310b2e CM |
436 | state->start = start; |
437 | state->end = end; | |
9ed74f2d | 438 | |
3150b699 XG |
439 | set_state_bits(tree, state, bits); |
440 | ||
f2071b21 | 441 | node = tree_insert(&tree->state, NULL, end, &state->rb_node, p, parent); |
d1310b2e CM |
442 | if (node) { |
443 | struct extent_state *found; | |
444 | found = rb_entry(node, struct extent_state, rb_node); | |
efe120a0 | 445 | printk(KERN_ERR "BTRFS: found node %llu %llu on insert of " |
c1c9ff7c GU |
446 | "%llu %llu\n", |
447 | found->start, found->end, start, end); | |
d1310b2e CM |
448 | return -EEXIST; |
449 | } | |
450 | merge_state(tree, state); | |
451 | return 0; | |
452 | } | |
453 | ||
1bf85046 | 454 | static void split_cb(struct extent_io_tree *tree, struct extent_state *orig, |
9ed74f2d JB |
455 | u64 split) |
456 | { | |
457 | if (tree->ops && tree->ops->split_extent_hook) | |
1bf85046 | 458 | tree->ops->split_extent_hook(tree->mapping->host, orig, split); |
9ed74f2d JB |
459 | } |
460 | ||
d1310b2e CM |
461 | /* |
462 | * split a given extent state struct in two, inserting the preallocated | |
463 | * struct 'prealloc' as the newly created second half. 'split' indicates an | |
464 | * offset inside 'orig' where it should be split. | |
465 | * | |
466 | * Before calling, | |
467 | * the tree has 'orig' at [orig->start, orig->end]. After calling, there | |
468 | * are two extent state structs in the tree: | |
469 | * prealloc: [orig->start, split - 1] | |
470 | * orig: [ split, orig->end ] | |
471 | * | |
472 | * The tree locks are not taken by this function. They need to be held | |
473 | * by the caller. | |
474 | */ | |
475 | static int split_state(struct extent_io_tree *tree, struct extent_state *orig, | |
476 | struct extent_state *prealloc, u64 split) | |
477 | { | |
478 | struct rb_node *node; | |
9ed74f2d JB |
479 | |
480 | split_cb(tree, orig, split); | |
481 | ||
d1310b2e CM |
482 | prealloc->start = orig->start; |
483 | prealloc->end = split - 1; | |
484 | prealloc->state = orig->state; | |
485 | orig->start = split; | |
486 | ||
f2071b21 FM |
487 | node = tree_insert(&tree->state, &orig->rb_node, prealloc->end, |
488 | &prealloc->rb_node, NULL, NULL); | |
d1310b2e | 489 | if (node) { |
d1310b2e CM |
490 | free_extent_state(prealloc); |
491 | return -EEXIST; | |
492 | } | |
493 | return 0; | |
494 | } | |
495 | ||
cdc6a395 LZ |
496 | static struct extent_state *next_state(struct extent_state *state) |
497 | { | |
498 | struct rb_node *next = rb_next(&state->rb_node); | |
499 | if (next) | |
500 | return rb_entry(next, struct extent_state, rb_node); | |
501 | else | |
502 | return NULL; | |
503 | } | |
504 | ||
d1310b2e CM |
505 | /* |
506 | * utility function to clear some bits in an extent state struct. | |
1b303fc0 | 507 | * it will optionally wake up any one waiting on this state (wake == 1). |
d1310b2e CM |
508 | * |
509 | * If no bits are set on the state struct after clearing things, the | |
510 | * struct is freed and removed from the tree | |
511 | */ | |
cdc6a395 LZ |
512 | static struct extent_state *clear_state_bit(struct extent_io_tree *tree, |
513 | struct extent_state *state, | |
41074888 | 514 | unsigned long *bits, int wake) |
d1310b2e | 515 | { |
cdc6a395 | 516 | struct extent_state *next; |
41074888 | 517 | unsigned long bits_to_clear = *bits & ~EXTENT_CTLBITS; |
d1310b2e | 518 | |
0ca1f7ce | 519 | if ((bits_to_clear & EXTENT_DIRTY) && (state->state & EXTENT_DIRTY)) { |
d1310b2e CM |
520 | u64 range = state->end - state->start + 1; |
521 | WARN_ON(range > tree->dirty_bytes); | |
522 | tree->dirty_bytes -= range; | |
523 | } | |
291d673e | 524 | clear_state_cb(tree, state, bits); |
32c00aff | 525 | state->state &= ~bits_to_clear; |
d1310b2e CM |
526 | if (wake) |
527 | wake_up(&state->wq); | |
0ca1f7ce | 528 | if (state->state == 0) { |
cdc6a395 | 529 | next = next_state(state); |
27a3507d | 530 | if (extent_state_in_tree(state)) { |
d1310b2e | 531 | rb_erase(&state->rb_node, &tree->state); |
27a3507d | 532 | RB_CLEAR_NODE(&state->rb_node); |
d1310b2e CM |
533 | free_extent_state(state); |
534 | } else { | |
535 | WARN_ON(1); | |
536 | } | |
537 | } else { | |
538 | merge_state(tree, state); | |
cdc6a395 | 539 | next = next_state(state); |
d1310b2e | 540 | } |
cdc6a395 | 541 | return next; |
d1310b2e CM |
542 | } |
543 | ||
8233767a XG |
544 | static struct extent_state * |
545 | alloc_extent_state_atomic(struct extent_state *prealloc) | |
546 | { | |
547 | if (!prealloc) | |
548 | prealloc = alloc_extent_state(GFP_ATOMIC); | |
549 | ||
550 | return prealloc; | |
551 | } | |
552 | ||
48a3b636 | 553 | static void extent_io_tree_panic(struct extent_io_tree *tree, int err) |
c2d904e0 JM |
554 | { |
555 | btrfs_panic(tree_fs_info(tree), err, "Locking error: " | |
556 | "Extent tree was modified by another " | |
557 | "thread while locked."); | |
558 | } | |
559 | ||
d1310b2e CM |
560 | /* |
561 | * clear some bits on a range in the tree. This may require splitting | |
562 | * or inserting elements in the tree, so the gfp mask is used to | |
563 | * indicate which allocations or sleeping are allowed. | |
564 | * | |
565 | * pass 'wake' == 1 to kick any sleepers, and 'delete' == 1 to remove | |
566 | * the given range from the tree regardless of state (ie for truncate). | |
567 | * | |
568 | * the range [start, end] is inclusive. | |
569 | * | |
6763af84 | 570 | * This takes the tree lock, and returns 0 on success and < 0 on error. |
d1310b2e CM |
571 | */ |
572 | int clear_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, | |
41074888 | 573 | unsigned long bits, int wake, int delete, |
2c64c53d CM |
574 | struct extent_state **cached_state, |
575 | gfp_t mask) | |
d1310b2e CM |
576 | { |
577 | struct extent_state *state; | |
2c64c53d | 578 | struct extent_state *cached; |
d1310b2e CM |
579 | struct extent_state *prealloc = NULL; |
580 | struct rb_node *node; | |
5c939df5 | 581 | u64 last_end; |
d1310b2e | 582 | int err; |
2ac55d41 | 583 | int clear = 0; |
d1310b2e | 584 | |
a5dee37d | 585 | btrfs_debug_check_extent_io_range(tree, start, end); |
8d599ae1 | 586 | |
7ee9e440 JB |
587 | if (bits & EXTENT_DELALLOC) |
588 | bits |= EXTENT_NORESERVE; | |
589 | ||
0ca1f7ce YZ |
590 | if (delete) |
591 | bits |= ~EXTENT_CTLBITS; | |
592 | bits |= EXTENT_FIRST_DELALLOC; | |
593 | ||
2ac55d41 JB |
594 | if (bits & (EXTENT_IOBITS | EXTENT_BOUNDARY)) |
595 | clear = 1; | |
d1310b2e CM |
596 | again: |
597 | if (!prealloc && (mask & __GFP_WAIT)) { | |
598 | prealloc = alloc_extent_state(mask); | |
599 | if (!prealloc) | |
600 | return -ENOMEM; | |
601 | } | |
602 | ||
cad321ad | 603 | spin_lock(&tree->lock); |
2c64c53d CM |
604 | if (cached_state) { |
605 | cached = *cached_state; | |
2ac55d41 JB |
606 | |
607 | if (clear) { | |
608 | *cached_state = NULL; | |
609 | cached_state = NULL; | |
610 | } | |
611 | ||
27a3507d FM |
612 | if (cached && extent_state_in_tree(cached) && |
613 | cached->start <= start && cached->end > start) { | |
2ac55d41 JB |
614 | if (clear) |
615 | atomic_dec(&cached->refs); | |
2c64c53d | 616 | state = cached; |
42daec29 | 617 | goto hit_next; |
2c64c53d | 618 | } |
2ac55d41 JB |
619 | if (clear) |
620 | free_extent_state(cached); | |
2c64c53d | 621 | } |
d1310b2e CM |
622 | /* |
623 | * this search will find the extents that end after | |
624 | * our range starts | |
625 | */ | |
80ea96b1 | 626 | node = tree_search(tree, start); |
d1310b2e CM |
627 | if (!node) |
628 | goto out; | |
629 | state = rb_entry(node, struct extent_state, rb_node); | |
2c64c53d | 630 | hit_next: |
d1310b2e CM |
631 | if (state->start > end) |
632 | goto out; | |
633 | WARN_ON(state->end < start); | |
5c939df5 | 634 | last_end = state->end; |
d1310b2e | 635 | |
0449314a | 636 | /* the state doesn't have the wanted bits, go ahead */ |
cdc6a395 LZ |
637 | if (!(state->state & bits)) { |
638 | state = next_state(state); | |
0449314a | 639 | goto next; |
cdc6a395 | 640 | } |
0449314a | 641 | |
d1310b2e CM |
642 | /* |
643 | * | ---- desired range ---- | | |
644 | * | state | or | |
645 | * | ------------- state -------------- | | |
646 | * | |
647 | * We need to split the extent we found, and may flip | |
648 | * bits on second half. | |
649 | * | |
650 | * If the extent we found extends past our range, we | |
651 | * just split and search again. It'll get split again | |
652 | * the next time though. | |
653 | * | |
654 | * If the extent we found is inside our range, we clear | |
655 | * the desired bit on it. | |
656 | */ | |
657 | ||
658 | if (state->start < start) { | |
8233767a XG |
659 | prealloc = alloc_extent_state_atomic(prealloc); |
660 | BUG_ON(!prealloc); | |
d1310b2e | 661 | err = split_state(tree, state, prealloc, start); |
c2d904e0 JM |
662 | if (err) |
663 | extent_io_tree_panic(tree, err); | |
664 | ||
d1310b2e CM |
665 | prealloc = NULL; |
666 | if (err) | |
667 | goto out; | |
668 | if (state->end <= end) { | |
d1ac6e41 LB |
669 | state = clear_state_bit(tree, state, &bits, wake); |
670 | goto next; | |
d1310b2e CM |
671 | } |
672 | goto search_again; | |
673 | } | |
674 | /* | |
675 | * | ---- desired range ---- | | |
676 | * | state | | |
677 | * We need to split the extent, and clear the bit | |
678 | * on the first half | |
679 | */ | |
680 | if (state->start <= end && state->end > end) { | |
8233767a XG |
681 | prealloc = alloc_extent_state_atomic(prealloc); |
682 | BUG_ON(!prealloc); | |
d1310b2e | 683 | err = split_state(tree, state, prealloc, end + 1); |
c2d904e0 JM |
684 | if (err) |
685 | extent_io_tree_panic(tree, err); | |
686 | ||
d1310b2e CM |
687 | if (wake) |
688 | wake_up(&state->wq); | |
42daec29 | 689 | |
6763af84 | 690 | clear_state_bit(tree, prealloc, &bits, wake); |
9ed74f2d | 691 | |
d1310b2e CM |
692 | prealloc = NULL; |
693 | goto out; | |
694 | } | |
42daec29 | 695 | |
cdc6a395 | 696 | state = clear_state_bit(tree, state, &bits, wake); |
0449314a | 697 | next: |
5c939df5 YZ |
698 | if (last_end == (u64)-1) |
699 | goto out; | |
700 | start = last_end + 1; | |
cdc6a395 | 701 | if (start <= end && state && !need_resched()) |
692e5759 | 702 | goto hit_next; |
d1310b2e CM |
703 | goto search_again; |
704 | ||
705 | out: | |
cad321ad | 706 | spin_unlock(&tree->lock); |
d1310b2e CM |
707 | if (prealloc) |
708 | free_extent_state(prealloc); | |
709 | ||
6763af84 | 710 | return 0; |
d1310b2e CM |
711 | |
712 | search_again: | |
713 | if (start > end) | |
714 | goto out; | |
cad321ad | 715 | spin_unlock(&tree->lock); |
d1310b2e CM |
716 | if (mask & __GFP_WAIT) |
717 | cond_resched(); | |
718 | goto again; | |
719 | } | |
d1310b2e | 720 | |
143bede5 JM |
721 | static void wait_on_state(struct extent_io_tree *tree, |
722 | struct extent_state *state) | |
641f5219 CH |
723 | __releases(tree->lock) |
724 | __acquires(tree->lock) | |
d1310b2e CM |
725 | { |
726 | DEFINE_WAIT(wait); | |
727 | prepare_to_wait(&state->wq, &wait, TASK_UNINTERRUPTIBLE); | |
cad321ad | 728 | spin_unlock(&tree->lock); |
d1310b2e | 729 | schedule(); |
cad321ad | 730 | spin_lock(&tree->lock); |
d1310b2e | 731 | finish_wait(&state->wq, &wait); |
d1310b2e CM |
732 | } |
733 | ||
734 | /* | |
735 | * waits for one or more bits to clear on a range in the state tree. | |
736 | * The range [start, end] is inclusive. | |
737 | * The tree lock is taken by this function | |
738 | */ | |
41074888 DS |
739 | static void wait_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, |
740 | unsigned long bits) | |
d1310b2e CM |
741 | { |
742 | struct extent_state *state; | |
743 | struct rb_node *node; | |
744 | ||
a5dee37d | 745 | btrfs_debug_check_extent_io_range(tree, start, end); |
8d599ae1 | 746 | |
cad321ad | 747 | spin_lock(&tree->lock); |
d1310b2e CM |
748 | again: |
749 | while (1) { | |
750 | /* | |
751 | * this search will find all the extents that end after | |
752 | * our range starts | |
753 | */ | |
80ea96b1 | 754 | node = tree_search(tree, start); |
c50d3e71 | 755 | process_node: |
d1310b2e CM |
756 | if (!node) |
757 | break; | |
758 | ||
759 | state = rb_entry(node, struct extent_state, rb_node); | |
760 | ||
761 | if (state->start > end) | |
762 | goto out; | |
763 | ||
764 | if (state->state & bits) { | |
765 | start = state->start; | |
766 | atomic_inc(&state->refs); | |
767 | wait_on_state(tree, state); | |
768 | free_extent_state(state); | |
769 | goto again; | |
770 | } | |
771 | start = state->end + 1; | |
772 | ||
773 | if (start > end) | |
774 | break; | |
775 | ||
c50d3e71 FM |
776 | if (!cond_resched_lock(&tree->lock)) { |
777 | node = rb_next(node); | |
778 | goto process_node; | |
779 | } | |
d1310b2e CM |
780 | } |
781 | out: | |
cad321ad | 782 | spin_unlock(&tree->lock); |
d1310b2e | 783 | } |
d1310b2e | 784 | |
1bf85046 | 785 | static void set_state_bits(struct extent_io_tree *tree, |
d1310b2e | 786 | struct extent_state *state, |
41074888 | 787 | unsigned long *bits) |
d1310b2e | 788 | { |
41074888 | 789 | unsigned long bits_to_set = *bits & ~EXTENT_CTLBITS; |
9ed74f2d | 790 | |
1bf85046 | 791 | set_state_cb(tree, state, bits); |
0ca1f7ce | 792 | if ((bits_to_set & EXTENT_DIRTY) && !(state->state & EXTENT_DIRTY)) { |
d1310b2e CM |
793 | u64 range = state->end - state->start + 1; |
794 | tree->dirty_bytes += range; | |
795 | } | |
0ca1f7ce | 796 | state->state |= bits_to_set; |
d1310b2e CM |
797 | } |
798 | ||
2c64c53d CM |
799 | static void cache_state(struct extent_state *state, |
800 | struct extent_state **cached_ptr) | |
801 | { | |
802 | if (cached_ptr && !(*cached_ptr)) { | |
803 | if (state->state & (EXTENT_IOBITS | EXTENT_BOUNDARY)) { | |
804 | *cached_ptr = state; | |
805 | atomic_inc(&state->refs); | |
806 | } | |
807 | } | |
808 | } | |
809 | ||
d1310b2e | 810 | /* |
1edbb734 CM |
811 | * set some bits on a range in the tree. This may require allocations or |
812 | * sleeping, so the gfp mask is used to indicate what is allowed. | |
d1310b2e | 813 | * |
1edbb734 CM |
814 | * If any of the exclusive bits are set, this will fail with -EEXIST if some |
815 | * part of the range already has the desired bits set. The start of the | |
816 | * existing range is returned in failed_start in this case. | |
d1310b2e | 817 | * |
1edbb734 | 818 | * [start, end] is inclusive This takes the tree lock. |
d1310b2e | 819 | */ |
1edbb734 | 820 | |
3fbe5c02 JM |
821 | static int __must_check |
822 | __set_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, | |
41074888 DS |
823 | unsigned long bits, unsigned long exclusive_bits, |
824 | u64 *failed_start, struct extent_state **cached_state, | |
825 | gfp_t mask) | |
d1310b2e CM |
826 | { |
827 | struct extent_state *state; | |
828 | struct extent_state *prealloc = NULL; | |
829 | struct rb_node *node; | |
12cfbad9 FDBM |
830 | struct rb_node **p; |
831 | struct rb_node *parent; | |
d1310b2e | 832 | int err = 0; |
d1310b2e CM |
833 | u64 last_start; |
834 | u64 last_end; | |
42daec29 | 835 | |
a5dee37d | 836 | btrfs_debug_check_extent_io_range(tree, start, end); |
8d599ae1 | 837 | |
0ca1f7ce | 838 | bits |= EXTENT_FIRST_DELALLOC; |
d1310b2e CM |
839 | again: |
840 | if (!prealloc && (mask & __GFP_WAIT)) { | |
841 | prealloc = alloc_extent_state(mask); | |
8233767a | 842 | BUG_ON(!prealloc); |
d1310b2e CM |
843 | } |
844 | ||
cad321ad | 845 | spin_lock(&tree->lock); |
9655d298 CM |
846 | if (cached_state && *cached_state) { |
847 | state = *cached_state; | |
df98b6e2 | 848 | if (state->start <= start && state->end > start && |
27a3507d | 849 | extent_state_in_tree(state)) { |
9655d298 CM |
850 | node = &state->rb_node; |
851 | goto hit_next; | |
852 | } | |
853 | } | |
d1310b2e CM |
854 | /* |
855 | * this search will find all the extents that end after | |
856 | * our range starts. | |
857 | */ | |
12cfbad9 | 858 | node = tree_search_for_insert(tree, start, &p, &parent); |
d1310b2e | 859 | if (!node) { |
8233767a XG |
860 | prealloc = alloc_extent_state_atomic(prealloc); |
861 | BUG_ON(!prealloc); | |
12cfbad9 FDBM |
862 | err = insert_state(tree, prealloc, start, end, |
863 | &p, &parent, &bits); | |
c2d904e0 JM |
864 | if (err) |
865 | extent_io_tree_panic(tree, err); | |
866 | ||
c42ac0bc | 867 | cache_state(prealloc, cached_state); |
d1310b2e | 868 | prealloc = NULL; |
d1310b2e CM |
869 | goto out; |
870 | } | |
d1310b2e | 871 | state = rb_entry(node, struct extent_state, rb_node); |
40431d6c | 872 | hit_next: |
d1310b2e CM |
873 | last_start = state->start; |
874 | last_end = state->end; | |
875 | ||
876 | /* | |
877 | * | ---- desired range ---- | | |
878 | * | state | | |
879 | * | |
880 | * Just lock what we found and keep going | |
881 | */ | |
882 | if (state->start == start && state->end <= end) { | |
1edbb734 | 883 | if (state->state & exclusive_bits) { |
d1310b2e CM |
884 | *failed_start = state->start; |
885 | err = -EEXIST; | |
886 | goto out; | |
887 | } | |
42daec29 | 888 | |
1bf85046 | 889 | set_state_bits(tree, state, &bits); |
2c64c53d | 890 | cache_state(state, cached_state); |
d1310b2e | 891 | merge_state(tree, state); |
5c939df5 YZ |
892 | if (last_end == (u64)-1) |
893 | goto out; | |
894 | start = last_end + 1; | |
d1ac6e41 LB |
895 | state = next_state(state); |
896 | if (start < end && state && state->start == start && | |
897 | !need_resched()) | |
898 | goto hit_next; | |
d1310b2e CM |
899 | goto search_again; |
900 | } | |
901 | ||
902 | /* | |
903 | * | ---- desired range ---- | | |
904 | * | state | | |
905 | * or | |
906 | * | ------------- state -------------- | | |
907 | * | |
908 | * We need to split the extent we found, and may flip bits on | |
909 | * second half. | |
910 | * | |
911 | * If the extent we found extends past our | |
912 | * range, we just split and search again. It'll get split | |
913 | * again the next time though. | |
914 | * | |
915 | * If the extent we found is inside our range, we set the | |
916 | * desired bit on it. | |
917 | */ | |
918 | if (state->start < start) { | |
1edbb734 | 919 | if (state->state & exclusive_bits) { |
d1310b2e CM |
920 | *failed_start = start; |
921 | err = -EEXIST; | |
922 | goto out; | |
923 | } | |
8233767a XG |
924 | |
925 | prealloc = alloc_extent_state_atomic(prealloc); | |
926 | BUG_ON(!prealloc); | |
d1310b2e | 927 | err = split_state(tree, state, prealloc, start); |
c2d904e0 JM |
928 | if (err) |
929 | extent_io_tree_panic(tree, err); | |
930 | ||
d1310b2e CM |
931 | prealloc = NULL; |
932 | if (err) | |
933 | goto out; | |
934 | if (state->end <= end) { | |
1bf85046 | 935 | set_state_bits(tree, state, &bits); |
2c64c53d | 936 | cache_state(state, cached_state); |
d1310b2e | 937 | merge_state(tree, state); |
5c939df5 YZ |
938 | if (last_end == (u64)-1) |
939 | goto out; | |
940 | start = last_end + 1; | |
d1ac6e41 LB |
941 | state = next_state(state); |
942 | if (start < end && state && state->start == start && | |
943 | !need_resched()) | |
944 | goto hit_next; | |
d1310b2e CM |
945 | } |
946 | goto search_again; | |
947 | } | |
948 | /* | |
949 | * | ---- desired range ---- | | |
950 | * | state | or | state | | |
951 | * | |
952 | * There's a hole, we need to insert something in it and | |
953 | * ignore the extent we found. | |
954 | */ | |
955 | if (state->start > start) { | |
956 | u64 this_end; | |
957 | if (end < last_start) | |
958 | this_end = end; | |
959 | else | |
d397712b | 960 | this_end = last_start - 1; |
8233767a XG |
961 | |
962 | prealloc = alloc_extent_state_atomic(prealloc); | |
963 | BUG_ON(!prealloc); | |
c7f895a2 XG |
964 | |
965 | /* | |
966 | * Avoid to free 'prealloc' if it can be merged with | |
967 | * the later extent. | |
968 | */ | |
d1310b2e | 969 | err = insert_state(tree, prealloc, start, this_end, |
12cfbad9 | 970 | NULL, NULL, &bits); |
c2d904e0 JM |
971 | if (err) |
972 | extent_io_tree_panic(tree, err); | |
973 | ||
9ed74f2d JB |
974 | cache_state(prealloc, cached_state); |
975 | prealloc = NULL; | |
d1310b2e CM |
976 | start = this_end + 1; |
977 | goto search_again; | |
978 | } | |
979 | /* | |
980 | * | ---- desired range ---- | | |
981 | * | state | | |
982 | * We need to split the extent, and set the bit | |
983 | * on the first half | |
984 | */ | |
985 | if (state->start <= end && state->end > end) { | |
1edbb734 | 986 | if (state->state & exclusive_bits) { |
d1310b2e CM |
987 | *failed_start = start; |
988 | err = -EEXIST; | |
989 | goto out; | |
990 | } | |
8233767a XG |
991 | |
992 | prealloc = alloc_extent_state_atomic(prealloc); | |
993 | BUG_ON(!prealloc); | |
d1310b2e | 994 | err = split_state(tree, state, prealloc, end + 1); |
c2d904e0 JM |
995 | if (err) |
996 | extent_io_tree_panic(tree, err); | |
d1310b2e | 997 | |
1bf85046 | 998 | set_state_bits(tree, prealloc, &bits); |
2c64c53d | 999 | cache_state(prealloc, cached_state); |
d1310b2e CM |
1000 | merge_state(tree, prealloc); |
1001 | prealloc = NULL; | |
1002 | goto out; | |
1003 | } | |
1004 | ||
1005 | goto search_again; | |
1006 | ||
1007 | out: | |
cad321ad | 1008 | spin_unlock(&tree->lock); |
d1310b2e CM |
1009 | if (prealloc) |
1010 | free_extent_state(prealloc); | |
1011 | ||
1012 | return err; | |
1013 | ||
1014 | search_again: | |
1015 | if (start > end) | |
1016 | goto out; | |
cad321ad | 1017 | spin_unlock(&tree->lock); |
d1310b2e CM |
1018 | if (mask & __GFP_WAIT) |
1019 | cond_resched(); | |
1020 | goto again; | |
1021 | } | |
d1310b2e | 1022 | |
41074888 DS |
1023 | int set_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, |
1024 | unsigned long bits, u64 * failed_start, | |
1025 | struct extent_state **cached_state, gfp_t mask) | |
3fbe5c02 JM |
1026 | { |
1027 | return __set_extent_bit(tree, start, end, bits, 0, failed_start, | |
1028 | cached_state, mask); | |
1029 | } | |
1030 | ||
1031 | ||
462d6fac | 1032 | /** |
10983f2e LB |
1033 | * convert_extent_bit - convert all bits in a given range from one bit to |
1034 | * another | |
462d6fac JB |
1035 | * @tree: the io tree to search |
1036 | * @start: the start offset in bytes | |
1037 | * @end: the end offset in bytes (inclusive) | |
1038 | * @bits: the bits to set in this range | |
1039 | * @clear_bits: the bits to clear in this range | |
e6138876 | 1040 | * @cached_state: state that we're going to cache |
462d6fac JB |
1041 | * @mask: the allocation mask |
1042 | * | |
1043 | * This will go through and set bits for the given range. If any states exist | |
1044 | * already in this range they are set with the given bit and cleared of the | |
1045 | * clear_bits. This is only meant to be used by things that are mergeable, ie | |
1046 | * converting from say DELALLOC to DIRTY. This is not meant to be used with | |
1047 | * boundary bits like LOCK. | |
1048 | */ | |
1049 | int convert_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, | |
41074888 | 1050 | unsigned long bits, unsigned long clear_bits, |
e6138876 | 1051 | struct extent_state **cached_state, gfp_t mask) |
462d6fac JB |
1052 | { |
1053 | struct extent_state *state; | |
1054 | struct extent_state *prealloc = NULL; | |
1055 | struct rb_node *node; | |
12cfbad9 FDBM |
1056 | struct rb_node **p; |
1057 | struct rb_node *parent; | |
462d6fac JB |
1058 | int err = 0; |
1059 | u64 last_start; | |
1060 | u64 last_end; | |
1061 | ||
a5dee37d | 1062 | btrfs_debug_check_extent_io_range(tree, start, end); |
8d599ae1 | 1063 | |
462d6fac JB |
1064 | again: |
1065 | if (!prealloc && (mask & __GFP_WAIT)) { | |
1066 | prealloc = alloc_extent_state(mask); | |
1067 | if (!prealloc) | |
1068 | return -ENOMEM; | |
1069 | } | |
1070 | ||
1071 | spin_lock(&tree->lock); | |
e6138876 JB |
1072 | if (cached_state && *cached_state) { |
1073 | state = *cached_state; | |
1074 | if (state->start <= start && state->end > start && | |
27a3507d | 1075 | extent_state_in_tree(state)) { |
e6138876 JB |
1076 | node = &state->rb_node; |
1077 | goto hit_next; | |
1078 | } | |
1079 | } | |
1080 | ||
462d6fac JB |
1081 | /* |
1082 | * this search will find all the extents that end after | |
1083 | * our range starts. | |
1084 | */ | |
12cfbad9 | 1085 | node = tree_search_for_insert(tree, start, &p, &parent); |
462d6fac JB |
1086 | if (!node) { |
1087 | prealloc = alloc_extent_state_atomic(prealloc); | |
1cf4ffdb LB |
1088 | if (!prealloc) { |
1089 | err = -ENOMEM; | |
1090 | goto out; | |
1091 | } | |
12cfbad9 FDBM |
1092 | err = insert_state(tree, prealloc, start, end, |
1093 | &p, &parent, &bits); | |
c2d904e0 JM |
1094 | if (err) |
1095 | extent_io_tree_panic(tree, err); | |
c42ac0bc FDBM |
1096 | cache_state(prealloc, cached_state); |
1097 | prealloc = NULL; | |
462d6fac JB |
1098 | goto out; |
1099 | } | |
1100 | state = rb_entry(node, struct extent_state, rb_node); | |
1101 | hit_next: | |
1102 | last_start = state->start; | |
1103 | last_end = state->end; | |
1104 | ||
1105 | /* | |
1106 | * | ---- desired range ---- | | |
1107 | * | state | | |
1108 | * | |
1109 | * Just lock what we found and keep going | |
1110 | */ | |
1111 | if (state->start == start && state->end <= end) { | |
462d6fac | 1112 | set_state_bits(tree, state, &bits); |
e6138876 | 1113 | cache_state(state, cached_state); |
d1ac6e41 | 1114 | state = clear_state_bit(tree, state, &clear_bits, 0); |
462d6fac JB |
1115 | if (last_end == (u64)-1) |
1116 | goto out; | |
462d6fac | 1117 | start = last_end + 1; |
d1ac6e41 LB |
1118 | if (start < end && state && state->start == start && |
1119 | !need_resched()) | |
1120 | goto hit_next; | |
462d6fac JB |
1121 | goto search_again; |
1122 | } | |
1123 | ||
1124 | /* | |
1125 | * | ---- desired range ---- | | |
1126 | * | state | | |
1127 | * or | |
1128 | * | ------------- state -------------- | | |
1129 | * | |
1130 | * We need to split the extent we found, and may flip bits on | |
1131 | * second half. | |
1132 | * | |
1133 | * If the extent we found extends past our | |
1134 | * range, we just split and search again. It'll get split | |
1135 | * again the next time though. | |
1136 | * | |
1137 | * If the extent we found is inside our range, we set the | |
1138 | * desired bit on it. | |
1139 | */ | |
1140 | if (state->start < start) { | |
1141 | prealloc = alloc_extent_state_atomic(prealloc); | |
1cf4ffdb LB |
1142 | if (!prealloc) { |
1143 | err = -ENOMEM; | |
1144 | goto out; | |
1145 | } | |
462d6fac | 1146 | err = split_state(tree, state, prealloc, start); |
c2d904e0 JM |
1147 | if (err) |
1148 | extent_io_tree_panic(tree, err); | |
462d6fac JB |
1149 | prealloc = NULL; |
1150 | if (err) | |
1151 | goto out; | |
1152 | if (state->end <= end) { | |
1153 | set_state_bits(tree, state, &bits); | |
e6138876 | 1154 | cache_state(state, cached_state); |
d1ac6e41 | 1155 | state = clear_state_bit(tree, state, &clear_bits, 0); |
462d6fac JB |
1156 | if (last_end == (u64)-1) |
1157 | goto out; | |
1158 | start = last_end + 1; | |
d1ac6e41 LB |
1159 | if (start < end && state && state->start == start && |
1160 | !need_resched()) | |
1161 | goto hit_next; | |
462d6fac JB |
1162 | } |
1163 | goto search_again; | |
1164 | } | |
1165 | /* | |
1166 | * | ---- desired range ---- | | |
1167 | * | state | or | state | | |
1168 | * | |
1169 | * There's a hole, we need to insert something in it and | |
1170 | * ignore the extent we found. | |
1171 | */ | |
1172 | if (state->start > start) { | |
1173 | u64 this_end; | |
1174 | if (end < last_start) | |
1175 | this_end = end; | |
1176 | else | |
1177 | this_end = last_start - 1; | |
1178 | ||
1179 | prealloc = alloc_extent_state_atomic(prealloc); | |
1cf4ffdb LB |
1180 | if (!prealloc) { |
1181 | err = -ENOMEM; | |
1182 | goto out; | |
1183 | } | |
462d6fac JB |
1184 | |
1185 | /* | |
1186 | * Avoid to free 'prealloc' if it can be merged with | |
1187 | * the later extent. | |
1188 | */ | |
1189 | err = insert_state(tree, prealloc, start, this_end, | |
12cfbad9 | 1190 | NULL, NULL, &bits); |
c2d904e0 JM |
1191 | if (err) |
1192 | extent_io_tree_panic(tree, err); | |
e6138876 | 1193 | cache_state(prealloc, cached_state); |
462d6fac JB |
1194 | prealloc = NULL; |
1195 | start = this_end + 1; | |
1196 | goto search_again; | |
1197 | } | |
1198 | /* | |
1199 | * | ---- desired range ---- | | |
1200 | * | state | | |
1201 | * We need to split the extent, and set the bit | |
1202 | * on the first half | |
1203 | */ | |
1204 | if (state->start <= end && state->end > end) { | |
1205 | prealloc = alloc_extent_state_atomic(prealloc); | |
1cf4ffdb LB |
1206 | if (!prealloc) { |
1207 | err = -ENOMEM; | |
1208 | goto out; | |
1209 | } | |
462d6fac JB |
1210 | |
1211 | err = split_state(tree, state, prealloc, end + 1); | |
c2d904e0 JM |
1212 | if (err) |
1213 | extent_io_tree_panic(tree, err); | |
462d6fac JB |
1214 | |
1215 | set_state_bits(tree, prealloc, &bits); | |
e6138876 | 1216 | cache_state(prealloc, cached_state); |
462d6fac | 1217 | clear_state_bit(tree, prealloc, &clear_bits, 0); |
462d6fac JB |
1218 | prealloc = NULL; |
1219 | goto out; | |
1220 | } | |
1221 | ||
1222 | goto search_again; | |
1223 | ||
1224 | out: | |
1225 | spin_unlock(&tree->lock); | |
1226 | if (prealloc) | |
1227 | free_extent_state(prealloc); | |
1228 | ||
1229 | return err; | |
1230 | ||
1231 | search_again: | |
1232 | if (start > end) | |
1233 | goto out; | |
1234 | spin_unlock(&tree->lock); | |
1235 | if (mask & __GFP_WAIT) | |
1236 | cond_resched(); | |
1237 | goto again; | |
1238 | } | |
1239 | ||
d1310b2e CM |
1240 | /* wrappers around set/clear extent bit */ |
1241 | int set_extent_dirty(struct extent_io_tree *tree, u64 start, u64 end, | |
1242 | gfp_t mask) | |
1243 | { | |
3fbe5c02 | 1244 | return set_extent_bit(tree, start, end, EXTENT_DIRTY, NULL, |
2c64c53d | 1245 | NULL, mask); |
d1310b2e | 1246 | } |
d1310b2e CM |
1247 | |
1248 | int set_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, | |
41074888 | 1249 | unsigned long bits, gfp_t mask) |
d1310b2e | 1250 | { |
3fbe5c02 | 1251 | return set_extent_bit(tree, start, end, bits, NULL, |
2c64c53d | 1252 | NULL, mask); |
d1310b2e | 1253 | } |
d1310b2e CM |
1254 | |
1255 | int clear_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, | |
41074888 | 1256 | unsigned long bits, gfp_t mask) |
d1310b2e | 1257 | { |
2c64c53d | 1258 | return clear_extent_bit(tree, start, end, bits, 0, 0, NULL, mask); |
d1310b2e | 1259 | } |
d1310b2e CM |
1260 | |
1261 | int set_extent_delalloc(struct extent_io_tree *tree, u64 start, u64 end, | |
2ac55d41 | 1262 | struct extent_state **cached_state, gfp_t mask) |
d1310b2e CM |
1263 | { |
1264 | return set_extent_bit(tree, start, end, | |
fee187d9 | 1265 | EXTENT_DELALLOC | EXTENT_UPTODATE, |
3fbe5c02 | 1266 | NULL, cached_state, mask); |
d1310b2e | 1267 | } |
d1310b2e | 1268 | |
9e8a4a8b LB |
1269 | int set_extent_defrag(struct extent_io_tree *tree, u64 start, u64 end, |
1270 | struct extent_state **cached_state, gfp_t mask) | |
1271 | { | |
1272 | return set_extent_bit(tree, start, end, | |
1273 | EXTENT_DELALLOC | EXTENT_UPTODATE | EXTENT_DEFRAG, | |
1274 | NULL, cached_state, mask); | |
1275 | } | |
1276 | ||
d1310b2e CM |
1277 | int clear_extent_dirty(struct extent_io_tree *tree, u64 start, u64 end, |
1278 | gfp_t mask) | |
1279 | { | |
1280 | return clear_extent_bit(tree, start, end, | |
32c00aff | 1281 | EXTENT_DIRTY | EXTENT_DELALLOC | |
0ca1f7ce | 1282 | EXTENT_DO_ACCOUNTING, 0, 0, NULL, mask); |
d1310b2e | 1283 | } |
d1310b2e CM |
1284 | |
1285 | int set_extent_new(struct extent_io_tree *tree, u64 start, u64 end, | |
1286 | gfp_t mask) | |
1287 | { | |
3fbe5c02 | 1288 | return set_extent_bit(tree, start, end, EXTENT_NEW, NULL, |
2c64c53d | 1289 | NULL, mask); |
d1310b2e | 1290 | } |
d1310b2e | 1291 | |
d1310b2e | 1292 | int set_extent_uptodate(struct extent_io_tree *tree, u64 start, u64 end, |
507903b8 | 1293 | struct extent_state **cached_state, gfp_t mask) |
d1310b2e | 1294 | { |
6b67a320 | 1295 | return set_extent_bit(tree, start, end, EXTENT_UPTODATE, NULL, |
3fbe5c02 | 1296 | cached_state, mask); |
d1310b2e | 1297 | } |
d1310b2e | 1298 | |
5fd02043 JB |
1299 | int clear_extent_uptodate(struct extent_io_tree *tree, u64 start, u64 end, |
1300 | struct extent_state **cached_state, gfp_t mask) | |
d1310b2e | 1301 | { |
2c64c53d | 1302 | return clear_extent_bit(tree, start, end, EXTENT_UPTODATE, 0, 0, |
2ac55d41 | 1303 | cached_state, mask); |
d1310b2e | 1304 | } |
d1310b2e | 1305 | |
d352ac68 CM |
1306 | /* |
1307 | * either insert or lock state struct between start and end use mask to tell | |
1308 | * us if waiting is desired. | |
1309 | */ | |
1edbb734 | 1310 | int lock_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, |
41074888 | 1311 | unsigned long bits, struct extent_state **cached_state) |
d1310b2e CM |
1312 | { |
1313 | int err; | |
1314 | u64 failed_start; | |
1315 | while (1) { | |
3fbe5c02 JM |
1316 | err = __set_extent_bit(tree, start, end, EXTENT_LOCKED | bits, |
1317 | EXTENT_LOCKED, &failed_start, | |
1318 | cached_state, GFP_NOFS); | |
d0082371 | 1319 | if (err == -EEXIST) { |
d1310b2e CM |
1320 | wait_extent_bit(tree, failed_start, end, EXTENT_LOCKED); |
1321 | start = failed_start; | |
d0082371 | 1322 | } else |
d1310b2e | 1323 | break; |
d1310b2e CM |
1324 | WARN_ON(start > end); |
1325 | } | |
1326 | return err; | |
1327 | } | |
d1310b2e | 1328 | |
d0082371 | 1329 | int lock_extent(struct extent_io_tree *tree, u64 start, u64 end) |
1edbb734 | 1330 | { |
d0082371 | 1331 | return lock_extent_bits(tree, start, end, 0, NULL); |
1edbb734 CM |
1332 | } |
1333 | ||
d0082371 | 1334 | int try_lock_extent(struct extent_io_tree *tree, u64 start, u64 end) |
25179201 JB |
1335 | { |
1336 | int err; | |
1337 | u64 failed_start; | |
1338 | ||
3fbe5c02 JM |
1339 | err = __set_extent_bit(tree, start, end, EXTENT_LOCKED, EXTENT_LOCKED, |
1340 | &failed_start, NULL, GFP_NOFS); | |
6643558d YZ |
1341 | if (err == -EEXIST) { |
1342 | if (failed_start > start) | |
1343 | clear_extent_bit(tree, start, failed_start - 1, | |
d0082371 | 1344 | EXTENT_LOCKED, 1, 0, NULL, GFP_NOFS); |
25179201 | 1345 | return 0; |
6643558d | 1346 | } |
25179201 JB |
1347 | return 1; |
1348 | } | |
25179201 | 1349 | |
2c64c53d CM |
1350 | int unlock_extent_cached(struct extent_io_tree *tree, u64 start, u64 end, |
1351 | struct extent_state **cached, gfp_t mask) | |
1352 | { | |
1353 | return clear_extent_bit(tree, start, end, EXTENT_LOCKED, 1, 0, cached, | |
1354 | mask); | |
1355 | } | |
1356 | ||
d0082371 | 1357 | int unlock_extent(struct extent_io_tree *tree, u64 start, u64 end) |
d1310b2e | 1358 | { |
2c64c53d | 1359 | return clear_extent_bit(tree, start, end, EXTENT_LOCKED, 1, 0, NULL, |
d0082371 | 1360 | GFP_NOFS); |
d1310b2e | 1361 | } |
d1310b2e | 1362 | |
4adaa611 CM |
1363 | int extent_range_clear_dirty_for_io(struct inode *inode, u64 start, u64 end) |
1364 | { | |
1365 | unsigned long index = start >> PAGE_CACHE_SHIFT; | |
1366 | unsigned long end_index = end >> PAGE_CACHE_SHIFT; | |
1367 | struct page *page; | |
1368 | ||
1369 | while (index <= end_index) { | |
1370 | page = find_get_page(inode->i_mapping, index); | |
1371 | BUG_ON(!page); /* Pages should be in the extent_io_tree */ | |
1372 | clear_page_dirty_for_io(page); | |
1373 | page_cache_release(page); | |
1374 | index++; | |
1375 | } | |
1376 | return 0; | |
1377 | } | |
1378 | ||
1379 | int extent_range_redirty_for_io(struct inode *inode, u64 start, u64 end) | |
1380 | { | |
1381 | unsigned long index = start >> PAGE_CACHE_SHIFT; | |
1382 | unsigned long end_index = end >> PAGE_CACHE_SHIFT; | |
1383 | struct page *page; | |
1384 | ||
1385 | while (index <= end_index) { | |
1386 | page = find_get_page(inode->i_mapping, index); | |
1387 | BUG_ON(!page); /* Pages should be in the extent_io_tree */ | |
1388 | account_page_redirty(page); | |
1389 | __set_page_dirty_nobuffers(page); | |
1390 | page_cache_release(page); | |
1391 | index++; | |
1392 | } | |
1393 | return 0; | |
1394 | } | |
1395 | ||
d1310b2e CM |
1396 | /* |
1397 | * helper function to set both pages and extents in the tree writeback | |
1398 | */ | |
b2950863 | 1399 | static int set_range_writeback(struct extent_io_tree *tree, u64 start, u64 end) |
d1310b2e CM |
1400 | { |
1401 | unsigned long index = start >> PAGE_CACHE_SHIFT; | |
1402 | unsigned long end_index = end >> PAGE_CACHE_SHIFT; | |
1403 | struct page *page; | |
1404 | ||
1405 | while (index <= end_index) { | |
1406 | page = find_get_page(tree->mapping, index); | |
79787eaa | 1407 | BUG_ON(!page); /* Pages should be in the extent_io_tree */ |
d1310b2e CM |
1408 | set_page_writeback(page); |
1409 | page_cache_release(page); | |
1410 | index++; | |
1411 | } | |
d1310b2e CM |
1412 | return 0; |
1413 | } | |
d1310b2e | 1414 | |
d352ac68 CM |
1415 | /* find the first state struct with 'bits' set after 'start', and |
1416 | * return it. tree->lock must be held. NULL will returned if | |
1417 | * nothing was found after 'start' | |
1418 | */ | |
48a3b636 ES |
1419 | static struct extent_state * |
1420 | find_first_extent_bit_state(struct extent_io_tree *tree, | |
41074888 | 1421 | u64 start, unsigned long bits) |
d7fc640e CM |
1422 | { |
1423 | struct rb_node *node; | |
1424 | struct extent_state *state; | |
1425 | ||
1426 | /* | |
1427 | * this search will find all the extents that end after | |
1428 | * our range starts. | |
1429 | */ | |
1430 | node = tree_search(tree, start); | |
d397712b | 1431 | if (!node) |
d7fc640e | 1432 | goto out; |
d7fc640e | 1433 | |
d397712b | 1434 | while (1) { |
d7fc640e | 1435 | state = rb_entry(node, struct extent_state, rb_node); |
d397712b | 1436 | if (state->end >= start && (state->state & bits)) |
d7fc640e | 1437 | return state; |
d397712b | 1438 | |
d7fc640e CM |
1439 | node = rb_next(node); |
1440 | if (!node) | |
1441 | break; | |
1442 | } | |
1443 | out: | |
1444 | return NULL; | |
1445 | } | |
d7fc640e | 1446 | |
69261c4b XG |
1447 | /* |
1448 | * find the first offset in the io tree with 'bits' set. zero is | |
1449 | * returned if we find something, and *start_ret and *end_ret are | |
1450 | * set to reflect the state struct that was found. | |
1451 | * | |
477d7eaf | 1452 | * If nothing was found, 1 is returned. If found something, return 0. |
69261c4b XG |
1453 | */ |
1454 | int find_first_extent_bit(struct extent_io_tree *tree, u64 start, | |
41074888 | 1455 | u64 *start_ret, u64 *end_ret, unsigned long bits, |
e6138876 | 1456 | struct extent_state **cached_state) |
69261c4b XG |
1457 | { |
1458 | struct extent_state *state; | |
e6138876 | 1459 | struct rb_node *n; |
69261c4b XG |
1460 | int ret = 1; |
1461 | ||
1462 | spin_lock(&tree->lock); | |
e6138876 JB |
1463 | if (cached_state && *cached_state) { |
1464 | state = *cached_state; | |
27a3507d | 1465 | if (state->end == start - 1 && extent_state_in_tree(state)) { |
e6138876 JB |
1466 | n = rb_next(&state->rb_node); |
1467 | while (n) { | |
1468 | state = rb_entry(n, struct extent_state, | |
1469 | rb_node); | |
1470 | if (state->state & bits) | |
1471 | goto got_it; | |
1472 | n = rb_next(n); | |
1473 | } | |
1474 | free_extent_state(*cached_state); | |
1475 | *cached_state = NULL; | |
1476 | goto out; | |
1477 | } | |
1478 | free_extent_state(*cached_state); | |
1479 | *cached_state = NULL; | |
1480 | } | |
1481 | ||
69261c4b | 1482 | state = find_first_extent_bit_state(tree, start, bits); |
e6138876 | 1483 | got_it: |
69261c4b | 1484 | if (state) { |
e6138876 | 1485 | cache_state(state, cached_state); |
69261c4b XG |
1486 | *start_ret = state->start; |
1487 | *end_ret = state->end; | |
1488 | ret = 0; | |
1489 | } | |
e6138876 | 1490 | out: |
69261c4b XG |
1491 | spin_unlock(&tree->lock); |
1492 | return ret; | |
1493 | } | |
1494 | ||
d352ac68 CM |
1495 | /* |
1496 | * find a contiguous range of bytes in the file marked as delalloc, not | |
1497 | * more than 'max_bytes'. start and end are used to return the range, | |
1498 | * | |
1499 | * 1 is returned if we find something, 0 if nothing was in the tree | |
1500 | */ | |
c8b97818 | 1501 | static noinline u64 find_delalloc_range(struct extent_io_tree *tree, |
c2a128d2 JB |
1502 | u64 *start, u64 *end, u64 max_bytes, |
1503 | struct extent_state **cached_state) | |
d1310b2e CM |
1504 | { |
1505 | struct rb_node *node; | |
1506 | struct extent_state *state; | |
1507 | u64 cur_start = *start; | |
1508 | u64 found = 0; | |
1509 | u64 total_bytes = 0; | |
1510 | ||
cad321ad | 1511 | spin_lock(&tree->lock); |
c8b97818 | 1512 | |
d1310b2e CM |
1513 | /* |
1514 | * this search will find all the extents that end after | |
1515 | * our range starts. | |
1516 | */ | |
80ea96b1 | 1517 | node = tree_search(tree, cur_start); |
2b114d1d | 1518 | if (!node) { |
3b951516 CM |
1519 | if (!found) |
1520 | *end = (u64)-1; | |
d1310b2e CM |
1521 | goto out; |
1522 | } | |
1523 | ||
d397712b | 1524 | while (1) { |
d1310b2e | 1525 | state = rb_entry(node, struct extent_state, rb_node); |
5b21f2ed ZY |
1526 | if (found && (state->start != cur_start || |
1527 | (state->state & EXTENT_BOUNDARY))) { | |
d1310b2e CM |
1528 | goto out; |
1529 | } | |
1530 | if (!(state->state & EXTENT_DELALLOC)) { | |
1531 | if (!found) | |
1532 | *end = state->end; | |
1533 | goto out; | |
1534 | } | |
c2a128d2 | 1535 | if (!found) { |
d1310b2e | 1536 | *start = state->start; |
c2a128d2 JB |
1537 | *cached_state = state; |
1538 | atomic_inc(&state->refs); | |
1539 | } | |
d1310b2e CM |
1540 | found++; |
1541 | *end = state->end; | |
1542 | cur_start = state->end + 1; | |
1543 | node = rb_next(node); | |
d1310b2e | 1544 | total_bytes += state->end - state->start + 1; |
7bf811a5 | 1545 | if (total_bytes >= max_bytes) |
573aecaf | 1546 | break; |
573aecaf | 1547 | if (!node) |
d1310b2e CM |
1548 | break; |
1549 | } | |
1550 | out: | |
cad321ad | 1551 | spin_unlock(&tree->lock); |
d1310b2e CM |
1552 | return found; |
1553 | } | |
1554 | ||
143bede5 JM |
1555 | static noinline void __unlock_for_delalloc(struct inode *inode, |
1556 | struct page *locked_page, | |
1557 | u64 start, u64 end) | |
c8b97818 CM |
1558 | { |
1559 | int ret; | |
1560 | struct page *pages[16]; | |
1561 | unsigned long index = start >> PAGE_CACHE_SHIFT; | |
1562 | unsigned long end_index = end >> PAGE_CACHE_SHIFT; | |
1563 | unsigned long nr_pages = end_index - index + 1; | |
1564 | int i; | |
1565 | ||
1566 | if (index == locked_page->index && end_index == index) | |
143bede5 | 1567 | return; |
c8b97818 | 1568 | |
d397712b | 1569 | while (nr_pages > 0) { |
c8b97818 | 1570 | ret = find_get_pages_contig(inode->i_mapping, index, |
5b050f04 CM |
1571 | min_t(unsigned long, nr_pages, |
1572 | ARRAY_SIZE(pages)), pages); | |
c8b97818 CM |
1573 | for (i = 0; i < ret; i++) { |
1574 | if (pages[i] != locked_page) | |
1575 | unlock_page(pages[i]); | |
1576 | page_cache_release(pages[i]); | |
1577 | } | |
1578 | nr_pages -= ret; | |
1579 | index += ret; | |
1580 | cond_resched(); | |
1581 | } | |
c8b97818 CM |
1582 | } |
1583 | ||
1584 | static noinline int lock_delalloc_pages(struct inode *inode, | |
1585 | struct page *locked_page, | |
1586 | u64 delalloc_start, | |
1587 | u64 delalloc_end) | |
1588 | { | |
1589 | unsigned long index = delalloc_start >> PAGE_CACHE_SHIFT; | |
1590 | unsigned long start_index = index; | |
1591 | unsigned long end_index = delalloc_end >> PAGE_CACHE_SHIFT; | |
1592 | unsigned long pages_locked = 0; | |
1593 | struct page *pages[16]; | |
1594 | unsigned long nrpages; | |
1595 | int ret; | |
1596 | int i; | |
1597 | ||
1598 | /* the caller is responsible for locking the start index */ | |
1599 | if (index == locked_page->index && index == end_index) | |
1600 | return 0; | |
1601 | ||
1602 | /* skip the page at the start index */ | |
1603 | nrpages = end_index - index + 1; | |
d397712b | 1604 | while (nrpages > 0) { |
c8b97818 | 1605 | ret = find_get_pages_contig(inode->i_mapping, index, |
5b050f04 CM |
1606 | min_t(unsigned long, |
1607 | nrpages, ARRAY_SIZE(pages)), pages); | |
c8b97818 CM |
1608 | if (ret == 0) { |
1609 | ret = -EAGAIN; | |
1610 | goto done; | |
1611 | } | |
1612 | /* now we have an array of pages, lock them all */ | |
1613 | for (i = 0; i < ret; i++) { | |
1614 | /* | |
1615 | * the caller is taking responsibility for | |
1616 | * locked_page | |
1617 | */ | |
771ed689 | 1618 | if (pages[i] != locked_page) { |
c8b97818 | 1619 | lock_page(pages[i]); |
f2b1c41c CM |
1620 | if (!PageDirty(pages[i]) || |
1621 | pages[i]->mapping != inode->i_mapping) { | |
771ed689 CM |
1622 | ret = -EAGAIN; |
1623 | unlock_page(pages[i]); | |
1624 | page_cache_release(pages[i]); | |
1625 | goto done; | |
1626 | } | |
1627 | } | |
c8b97818 | 1628 | page_cache_release(pages[i]); |
771ed689 | 1629 | pages_locked++; |
c8b97818 | 1630 | } |
c8b97818 CM |
1631 | nrpages -= ret; |
1632 | index += ret; | |
1633 | cond_resched(); | |
1634 | } | |
1635 | ret = 0; | |
1636 | done: | |
1637 | if (ret && pages_locked) { | |
1638 | __unlock_for_delalloc(inode, locked_page, | |
1639 | delalloc_start, | |
1640 | ((u64)(start_index + pages_locked - 1)) << | |
1641 | PAGE_CACHE_SHIFT); | |
1642 | } | |
1643 | return ret; | |
1644 | } | |
1645 | ||
1646 | /* | |
1647 | * find a contiguous range of bytes in the file marked as delalloc, not | |
1648 | * more than 'max_bytes'. start and end are used to return the range, | |
1649 | * | |
1650 | * 1 is returned if we find something, 0 if nothing was in the tree | |
1651 | */ | |
294e30fe JB |
1652 | STATIC u64 find_lock_delalloc_range(struct inode *inode, |
1653 | struct extent_io_tree *tree, | |
1654 | struct page *locked_page, u64 *start, | |
1655 | u64 *end, u64 max_bytes) | |
c8b97818 CM |
1656 | { |
1657 | u64 delalloc_start; | |
1658 | u64 delalloc_end; | |
1659 | u64 found; | |
9655d298 | 1660 | struct extent_state *cached_state = NULL; |
c8b97818 CM |
1661 | int ret; |
1662 | int loops = 0; | |
1663 | ||
1664 | again: | |
1665 | /* step one, find a bunch of delalloc bytes starting at start */ | |
1666 | delalloc_start = *start; | |
1667 | delalloc_end = 0; | |
1668 | found = find_delalloc_range(tree, &delalloc_start, &delalloc_end, | |
c2a128d2 | 1669 | max_bytes, &cached_state); |
70b99e69 | 1670 | if (!found || delalloc_end <= *start) { |
c8b97818 CM |
1671 | *start = delalloc_start; |
1672 | *end = delalloc_end; | |
c2a128d2 | 1673 | free_extent_state(cached_state); |
385fe0be | 1674 | return 0; |
c8b97818 CM |
1675 | } |
1676 | ||
70b99e69 CM |
1677 | /* |
1678 | * start comes from the offset of locked_page. We have to lock | |
1679 | * pages in order, so we can't process delalloc bytes before | |
1680 | * locked_page | |
1681 | */ | |
d397712b | 1682 | if (delalloc_start < *start) |
70b99e69 | 1683 | delalloc_start = *start; |
70b99e69 | 1684 | |
c8b97818 CM |
1685 | /* |
1686 | * make sure to limit the number of pages we try to lock down | |
c8b97818 | 1687 | */ |
7bf811a5 JB |
1688 | if (delalloc_end + 1 - delalloc_start > max_bytes) |
1689 | delalloc_end = delalloc_start + max_bytes - 1; | |
d397712b | 1690 | |
c8b97818 CM |
1691 | /* step two, lock all the pages after the page that has start */ |
1692 | ret = lock_delalloc_pages(inode, locked_page, | |
1693 | delalloc_start, delalloc_end); | |
1694 | if (ret == -EAGAIN) { | |
1695 | /* some of the pages are gone, lets avoid looping by | |
1696 | * shortening the size of the delalloc range we're searching | |
1697 | */ | |
9655d298 | 1698 | free_extent_state(cached_state); |
7d788742 | 1699 | cached_state = NULL; |
c8b97818 | 1700 | if (!loops) { |
7bf811a5 | 1701 | max_bytes = PAGE_CACHE_SIZE; |
c8b97818 CM |
1702 | loops = 1; |
1703 | goto again; | |
1704 | } else { | |
1705 | found = 0; | |
1706 | goto out_failed; | |
1707 | } | |
1708 | } | |
79787eaa | 1709 | BUG_ON(ret); /* Only valid values are 0 and -EAGAIN */ |
c8b97818 CM |
1710 | |
1711 | /* step three, lock the state bits for the whole range */ | |
d0082371 | 1712 | lock_extent_bits(tree, delalloc_start, delalloc_end, 0, &cached_state); |
c8b97818 CM |
1713 | |
1714 | /* then test to make sure it is all still delalloc */ | |
1715 | ret = test_range_bit(tree, delalloc_start, delalloc_end, | |
9655d298 | 1716 | EXTENT_DELALLOC, 1, cached_state); |
c8b97818 | 1717 | if (!ret) { |
9655d298 CM |
1718 | unlock_extent_cached(tree, delalloc_start, delalloc_end, |
1719 | &cached_state, GFP_NOFS); | |
c8b97818 CM |
1720 | __unlock_for_delalloc(inode, locked_page, |
1721 | delalloc_start, delalloc_end); | |
1722 | cond_resched(); | |
1723 | goto again; | |
1724 | } | |
9655d298 | 1725 | free_extent_state(cached_state); |
c8b97818 CM |
1726 | *start = delalloc_start; |
1727 | *end = delalloc_end; | |
1728 | out_failed: | |
1729 | return found; | |
1730 | } | |
1731 | ||
c2790a2e JB |
1732 | int extent_clear_unlock_delalloc(struct inode *inode, u64 start, u64 end, |
1733 | struct page *locked_page, | |
1734 | unsigned long clear_bits, | |
1735 | unsigned long page_ops) | |
c8b97818 | 1736 | { |
c2790a2e | 1737 | struct extent_io_tree *tree = &BTRFS_I(inode)->io_tree; |
c8b97818 CM |
1738 | int ret; |
1739 | struct page *pages[16]; | |
1740 | unsigned long index = start >> PAGE_CACHE_SHIFT; | |
1741 | unsigned long end_index = end >> PAGE_CACHE_SHIFT; | |
1742 | unsigned long nr_pages = end_index - index + 1; | |
1743 | int i; | |
771ed689 | 1744 | |
2c64c53d | 1745 | clear_extent_bit(tree, start, end, clear_bits, 1, 0, NULL, GFP_NOFS); |
c2790a2e | 1746 | if (page_ops == 0) |
771ed689 | 1747 | return 0; |
c8b97818 | 1748 | |
d397712b | 1749 | while (nr_pages > 0) { |
c8b97818 | 1750 | ret = find_get_pages_contig(inode->i_mapping, index, |
5b050f04 CM |
1751 | min_t(unsigned long, |
1752 | nr_pages, ARRAY_SIZE(pages)), pages); | |
c8b97818 | 1753 | for (i = 0; i < ret; i++) { |
8b62b72b | 1754 | |
c2790a2e | 1755 | if (page_ops & PAGE_SET_PRIVATE2) |
8b62b72b CM |
1756 | SetPagePrivate2(pages[i]); |
1757 | ||
c8b97818 CM |
1758 | if (pages[i] == locked_page) { |
1759 | page_cache_release(pages[i]); | |
1760 | continue; | |
1761 | } | |
c2790a2e | 1762 | if (page_ops & PAGE_CLEAR_DIRTY) |
c8b97818 | 1763 | clear_page_dirty_for_io(pages[i]); |
c2790a2e | 1764 | if (page_ops & PAGE_SET_WRITEBACK) |
c8b97818 | 1765 | set_page_writeback(pages[i]); |
c2790a2e | 1766 | if (page_ops & PAGE_END_WRITEBACK) |
c8b97818 | 1767 | end_page_writeback(pages[i]); |
c2790a2e | 1768 | if (page_ops & PAGE_UNLOCK) |
771ed689 | 1769 | unlock_page(pages[i]); |
c8b97818 CM |
1770 | page_cache_release(pages[i]); |
1771 | } | |
1772 | nr_pages -= ret; | |
1773 | index += ret; | |
1774 | cond_resched(); | |
1775 | } | |
1776 | return 0; | |
1777 | } | |
c8b97818 | 1778 | |
d352ac68 CM |
1779 | /* |
1780 | * count the number of bytes in the tree that have a given bit(s) | |
1781 | * set. This can be fairly slow, except for EXTENT_DIRTY which is | |
1782 | * cached. The total number found is returned. | |
1783 | */ | |
d1310b2e CM |
1784 | u64 count_range_bits(struct extent_io_tree *tree, |
1785 | u64 *start, u64 search_end, u64 max_bytes, | |
ec29ed5b | 1786 | unsigned long bits, int contig) |
d1310b2e CM |
1787 | { |
1788 | struct rb_node *node; | |
1789 | struct extent_state *state; | |
1790 | u64 cur_start = *start; | |
1791 | u64 total_bytes = 0; | |
ec29ed5b | 1792 | u64 last = 0; |
d1310b2e CM |
1793 | int found = 0; |
1794 | ||
fae7f21c | 1795 | if (WARN_ON(search_end <= cur_start)) |
d1310b2e | 1796 | return 0; |
d1310b2e | 1797 | |
cad321ad | 1798 | spin_lock(&tree->lock); |
d1310b2e CM |
1799 | if (cur_start == 0 && bits == EXTENT_DIRTY) { |
1800 | total_bytes = tree->dirty_bytes; | |
1801 | goto out; | |
1802 | } | |
1803 | /* | |
1804 | * this search will find all the extents that end after | |
1805 | * our range starts. | |
1806 | */ | |
80ea96b1 | 1807 | node = tree_search(tree, cur_start); |
d397712b | 1808 | if (!node) |
d1310b2e | 1809 | goto out; |
d1310b2e | 1810 | |
d397712b | 1811 | while (1) { |
d1310b2e CM |
1812 | state = rb_entry(node, struct extent_state, rb_node); |
1813 | if (state->start > search_end) | |
1814 | break; | |
ec29ed5b CM |
1815 | if (contig && found && state->start > last + 1) |
1816 | break; | |
1817 | if (state->end >= cur_start && (state->state & bits) == bits) { | |
d1310b2e CM |
1818 | total_bytes += min(search_end, state->end) + 1 - |
1819 | max(cur_start, state->start); | |
1820 | if (total_bytes >= max_bytes) | |
1821 | break; | |
1822 | if (!found) { | |
af60bed2 | 1823 | *start = max(cur_start, state->start); |
d1310b2e CM |
1824 | found = 1; |
1825 | } | |
ec29ed5b CM |
1826 | last = state->end; |
1827 | } else if (contig && found) { | |
1828 | break; | |
d1310b2e CM |
1829 | } |
1830 | node = rb_next(node); | |
1831 | if (!node) | |
1832 | break; | |
1833 | } | |
1834 | out: | |
cad321ad | 1835 | spin_unlock(&tree->lock); |
d1310b2e CM |
1836 | return total_bytes; |
1837 | } | |
b2950863 | 1838 | |
d352ac68 CM |
1839 | /* |
1840 | * set the private field for a given byte offset in the tree. If there isn't | |
1841 | * an extent_state there already, this does nothing. | |
1842 | */ | |
171170c1 | 1843 | static int set_state_private(struct extent_io_tree *tree, u64 start, u64 private) |
d1310b2e CM |
1844 | { |
1845 | struct rb_node *node; | |
1846 | struct extent_state *state; | |
1847 | int ret = 0; | |
1848 | ||
cad321ad | 1849 | spin_lock(&tree->lock); |
d1310b2e CM |
1850 | /* |
1851 | * this search will find all the extents that end after | |
1852 | * our range starts. | |
1853 | */ | |
80ea96b1 | 1854 | node = tree_search(tree, start); |
2b114d1d | 1855 | if (!node) { |
d1310b2e CM |
1856 | ret = -ENOENT; |
1857 | goto out; | |
1858 | } | |
1859 | state = rb_entry(node, struct extent_state, rb_node); | |
1860 | if (state->start != start) { | |
1861 | ret = -ENOENT; | |
1862 | goto out; | |
1863 | } | |
1864 | state->private = private; | |
1865 | out: | |
cad321ad | 1866 | spin_unlock(&tree->lock); |
d1310b2e CM |
1867 | return ret; |
1868 | } | |
1869 | ||
1870 | int get_state_private(struct extent_io_tree *tree, u64 start, u64 *private) | |
1871 | { | |
1872 | struct rb_node *node; | |
1873 | struct extent_state *state; | |
1874 | int ret = 0; | |
1875 | ||
cad321ad | 1876 | spin_lock(&tree->lock); |
d1310b2e CM |
1877 | /* |
1878 | * this search will find all the extents that end after | |
1879 | * our range starts. | |
1880 | */ | |
80ea96b1 | 1881 | node = tree_search(tree, start); |
2b114d1d | 1882 | if (!node) { |
d1310b2e CM |
1883 | ret = -ENOENT; |
1884 | goto out; | |
1885 | } | |
1886 | state = rb_entry(node, struct extent_state, rb_node); | |
1887 | if (state->start != start) { | |
1888 | ret = -ENOENT; | |
1889 | goto out; | |
1890 | } | |
1891 | *private = state->private; | |
1892 | out: | |
cad321ad | 1893 | spin_unlock(&tree->lock); |
d1310b2e CM |
1894 | return ret; |
1895 | } | |
1896 | ||
1897 | /* | |
1898 | * searches a range in the state tree for a given mask. | |
70dec807 | 1899 | * If 'filled' == 1, this returns 1 only if every extent in the tree |
d1310b2e CM |
1900 | * has the bits set. Otherwise, 1 is returned if any bit in the |
1901 | * range is found set. | |
1902 | */ | |
1903 | int test_range_bit(struct extent_io_tree *tree, u64 start, u64 end, | |
41074888 | 1904 | unsigned long bits, int filled, struct extent_state *cached) |
d1310b2e CM |
1905 | { |
1906 | struct extent_state *state = NULL; | |
1907 | struct rb_node *node; | |
1908 | int bitset = 0; | |
d1310b2e | 1909 | |
cad321ad | 1910 | spin_lock(&tree->lock); |
27a3507d | 1911 | if (cached && extent_state_in_tree(cached) && cached->start <= start && |
df98b6e2 | 1912 | cached->end > start) |
9655d298 CM |
1913 | node = &cached->rb_node; |
1914 | else | |
1915 | node = tree_search(tree, start); | |
d1310b2e CM |
1916 | while (node && start <= end) { |
1917 | state = rb_entry(node, struct extent_state, rb_node); | |
1918 | ||
1919 | if (filled && state->start > start) { | |
1920 | bitset = 0; | |
1921 | break; | |
1922 | } | |
1923 | ||
1924 | if (state->start > end) | |
1925 | break; | |
1926 | ||
1927 | if (state->state & bits) { | |
1928 | bitset = 1; | |
1929 | if (!filled) | |
1930 | break; | |
1931 | } else if (filled) { | |
1932 | bitset = 0; | |
1933 | break; | |
1934 | } | |
46562cec CM |
1935 | |
1936 | if (state->end == (u64)-1) | |
1937 | break; | |
1938 | ||
d1310b2e CM |
1939 | start = state->end + 1; |
1940 | if (start > end) | |
1941 | break; | |
1942 | node = rb_next(node); | |
1943 | if (!node) { | |
1944 | if (filled) | |
1945 | bitset = 0; | |
1946 | break; | |
1947 | } | |
1948 | } | |
cad321ad | 1949 | spin_unlock(&tree->lock); |
d1310b2e CM |
1950 | return bitset; |
1951 | } | |
d1310b2e CM |
1952 | |
1953 | /* | |
1954 | * helper function to set a given page up to date if all the | |
1955 | * extents in the tree for that page are up to date | |
1956 | */ | |
143bede5 | 1957 | static void check_page_uptodate(struct extent_io_tree *tree, struct page *page) |
d1310b2e | 1958 | { |
4eee4fa4 | 1959 | u64 start = page_offset(page); |
d1310b2e | 1960 | u64 end = start + PAGE_CACHE_SIZE - 1; |
9655d298 | 1961 | if (test_range_bit(tree, start, end, EXTENT_UPTODATE, 1, NULL)) |
d1310b2e | 1962 | SetPageUptodate(page); |
d1310b2e CM |
1963 | } |
1964 | ||
4a54c8c1 JS |
1965 | /* |
1966 | * When IO fails, either with EIO or csum verification fails, we | |
1967 | * try other mirrors that might have a good copy of the data. This | |
1968 | * io_failure_record is used to record state as we go through all the | |
1969 | * mirrors. If another mirror has good data, the page is set up to date | |
1970 | * and things continue. If a good mirror can't be found, the original | |
1971 | * bio end_io callback is called to indicate things have failed. | |
1972 | */ | |
1973 | struct io_failure_record { | |
1974 | struct page *page; | |
1975 | u64 start; | |
1976 | u64 len; | |
1977 | u64 logical; | |
1978 | unsigned long bio_flags; | |
1979 | int this_mirror; | |
1980 | int failed_mirror; | |
1981 | int in_validation; | |
1982 | }; | |
1983 | ||
1984 | static int free_io_failure(struct inode *inode, struct io_failure_record *rec, | |
1985 | int did_repair) | |
1986 | { | |
1987 | int ret; | |
1988 | int err = 0; | |
1989 | struct extent_io_tree *failure_tree = &BTRFS_I(inode)->io_failure_tree; | |
1990 | ||
1991 | set_state_private(failure_tree, rec->start, 0); | |
1992 | ret = clear_extent_bits(failure_tree, rec->start, | |
1993 | rec->start + rec->len - 1, | |
1994 | EXTENT_LOCKED | EXTENT_DIRTY, GFP_NOFS); | |
1995 | if (ret) | |
1996 | err = ret; | |
1997 | ||
53b381b3 DW |
1998 | ret = clear_extent_bits(&BTRFS_I(inode)->io_tree, rec->start, |
1999 | rec->start + rec->len - 1, | |
2000 | EXTENT_DAMAGED, GFP_NOFS); | |
2001 | if (ret && !err) | |
2002 | err = ret; | |
4a54c8c1 JS |
2003 | |
2004 | kfree(rec); | |
2005 | return err; | |
2006 | } | |
2007 | ||
4a54c8c1 JS |
2008 | /* |
2009 | * this bypasses the standard btrfs submit functions deliberately, as | |
2010 | * the standard behavior is to write all copies in a raid setup. here we only | |
2011 | * want to write the one bad copy. so we do the mapping for ourselves and issue | |
2012 | * submit_bio directly. | |
3ec706c8 | 2013 | * to avoid any synchronization issues, wait for the data after writing, which |
4a54c8c1 JS |
2014 | * actually prevents the read that triggered the error from finishing. |
2015 | * currently, there can be no more than two copies of every data bit. thus, | |
2016 | * exactly one rewrite is required. | |
2017 | */ | |
3ec706c8 | 2018 | int repair_io_failure(struct btrfs_fs_info *fs_info, u64 start, |
4a54c8c1 JS |
2019 | u64 length, u64 logical, struct page *page, |
2020 | int mirror_num) | |
2021 | { | |
2022 | struct bio *bio; | |
2023 | struct btrfs_device *dev; | |
4a54c8c1 JS |
2024 | u64 map_length = 0; |
2025 | u64 sector; | |
2026 | struct btrfs_bio *bbio = NULL; | |
53b381b3 | 2027 | struct btrfs_mapping_tree *map_tree = &fs_info->mapping_tree; |
4a54c8c1 JS |
2028 | int ret; |
2029 | ||
908960c6 | 2030 | ASSERT(!(fs_info->sb->s_flags & MS_RDONLY)); |
4a54c8c1 JS |
2031 | BUG_ON(!mirror_num); |
2032 | ||
53b381b3 DW |
2033 | /* we can't repair anything in raid56 yet */ |
2034 | if (btrfs_is_parity_mirror(map_tree, logical, length, mirror_num)) | |
2035 | return 0; | |
2036 | ||
9be3395b | 2037 | bio = btrfs_io_bio_alloc(GFP_NOFS, 1); |
4a54c8c1 JS |
2038 | if (!bio) |
2039 | return -EIO; | |
4f024f37 | 2040 | bio->bi_iter.bi_size = 0; |
4a54c8c1 JS |
2041 | map_length = length; |
2042 | ||
3ec706c8 | 2043 | ret = btrfs_map_block(fs_info, WRITE, logical, |
4a54c8c1 JS |
2044 | &map_length, &bbio, mirror_num); |
2045 | if (ret) { | |
2046 | bio_put(bio); | |
2047 | return -EIO; | |
2048 | } | |
2049 | BUG_ON(mirror_num != bbio->mirror_num); | |
2050 | sector = bbio->stripes[mirror_num-1].physical >> 9; | |
4f024f37 | 2051 | bio->bi_iter.bi_sector = sector; |
4a54c8c1 JS |
2052 | dev = bbio->stripes[mirror_num-1].dev; |
2053 | kfree(bbio); | |
2054 | if (!dev || !dev->bdev || !dev->writeable) { | |
2055 | bio_put(bio); | |
2056 | return -EIO; | |
2057 | } | |
2058 | bio->bi_bdev = dev->bdev; | |
4eee4fa4 | 2059 | bio_add_page(bio, page, length, start - page_offset(page)); |
4a54c8c1 | 2060 | |
33879d45 | 2061 | if (btrfsic_submit_bio_wait(WRITE_SYNC, bio)) { |
4a54c8c1 JS |
2062 | /* try to remap that extent elsewhere? */ |
2063 | bio_put(bio); | |
442a4f63 | 2064 | btrfs_dev_stat_inc_and_print(dev, BTRFS_DEV_STAT_WRITE_ERRS); |
4a54c8c1 JS |
2065 | return -EIO; |
2066 | } | |
2067 | ||
efe120a0 FH |
2068 | printk_ratelimited_in_rcu(KERN_INFO |
2069 | "BTRFS: read error corrected: ino %lu off %llu " | |
2070 | "(dev %s sector %llu)\n", page->mapping->host->i_ino, | |
2071 | start, rcu_str_deref(dev->name), sector); | |
4a54c8c1 JS |
2072 | |
2073 | bio_put(bio); | |
2074 | return 0; | |
2075 | } | |
2076 | ||
ea466794 JB |
2077 | int repair_eb_io_failure(struct btrfs_root *root, struct extent_buffer *eb, |
2078 | int mirror_num) | |
2079 | { | |
ea466794 JB |
2080 | u64 start = eb->start; |
2081 | unsigned long i, num_pages = num_extent_pages(eb->start, eb->len); | |
d95603b2 | 2082 | int ret = 0; |
ea466794 | 2083 | |
908960c6 ID |
2084 | if (root->fs_info->sb->s_flags & MS_RDONLY) |
2085 | return -EROFS; | |
2086 | ||
ea466794 JB |
2087 | for (i = 0; i < num_pages; i++) { |
2088 | struct page *p = extent_buffer_page(eb, i); | |
3ec706c8 | 2089 | ret = repair_io_failure(root->fs_info, start, PAGE_CACHE_SIZE, |
ea466794 JB |
2090 | start, p, mirror_num); |
2091 | if (ret) | |
2092 | break; | |
2093 | start += PAGE_CACHE_SIZE; | |
2094 | } | |
2095 | ||
2096 | return ret; | |
2097 | } | |
2098 | ||
4a54c8c1 JS |
2099 | /* |
2100 | * each time an IO finishes, we do a fast check in the IO failure tree | |
2101 | * to see if we need to process or clean up an io_failure_record | |
2102 | */ | |
2103 | static int clean_io_failure(u64 start, struct page *page) | |
2104 | { | |
2105 | u64 private; | |
2106 | u64 private_failure; | |
2107 | struct io_failure_record *failrec; | |
908960c6 ID |
2108 | struct inode *inode = page->mapping->host; |
2109 | struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info; | |
4a54c8c1 JS |
2110 | struct extent_state *state; |
2111 | int num_copies; | |
2112 | int did_repair = 0; | |
2113 | int ret; | |
4a54c8c1 JS |
2114 | |
2115 | private = 0; | |
2116 | ret = count_range_bits(&BTRFS_I(inode)->io_failure_tree, &private, | |
2117 | (u64)-1, 1, EXTENT_DIRTY, 0); | |
2118 | if (!ret) | |
2119 | return 0; | |
2120 | ||
2121 | ret = get_state_private(&BTRFS_I(inode)->io_failure_tree, start, | |
2122 | &private_failure); | |
2123 | if (ret) | |
2124 | return 0; | |
2125 | ||
2126 | failrec = (struct io_failure_record *)(unsigned long) private_failure; | |
2127 | BUG_ON(!failrec->this_mirror); | |
2128 | ||
2129 | if (failrec->in_validation) { | |
2130 | /* there was no real error, just free the record */ | |
2131 | pr_debug("clean_io_failure: freeing dummy error at %llu\n", | |
2132 | failrec->start); | |
2133 | did_repair = 1; | |
2134 | goto out; | |
2135 | } | |
908960c6 ID |
2136 | if (fs_info->sb->s_flags & MS_RDONLY) |
2137 | goto out; | |
4a54c8c1 JS |
2138 | |
2139 | spin_lock(&BTRFS_I(inode)->io_tree.lock); | |
2140 | state = find_first_extent_bit_state(&BTRFS_I(inode)->io_tree, | |
2141 | failrec->start, | |
2142 | EXTENT_LOCKED); | |
2143 | spin_unlock(&BTRFS_I(inode)->io_tree.lock); | |
2144 | ||
883d0de4 MX |
2145 | if (state && state->start <= failrec->start && |
2146 | state->end >= failrec->start + failrec->len - 1) { | |
3ec706c8 SB |
2147 | num_copies = btrfs_num_copies(fs_info, failrec->logical, |
2148 | failrec->len); | |
4a54c8c1 | 2149 | if (num_copies > 1) { |
3ec706c8 | 2150 | ret = repair_io_failure(fs_info, start, failrec->len, |
4a54c8c1 JS |
2151 | failrec->logical, page, |
2152 | failrec->failed_mirror); | |
2153 | did_repair = !ret; | |
2154 | } | |
53b381b3 | 2155 | ret = 0; |
4a54c8c1 JS |
2156 | } |
2157 | ||
2158 | out: | |
2159 | if (!ret) | |
2160 | ret = free_io_failure(inode, failrec, did_repair); | |
2161 | ||
2162 | return ret; | |
2163 | } | |
2164 | ||
2165 | /* | |
2166 | * this is a generic handler for readpage errors (default | |
2167 | * readpage_io_failed_hook). if other copies exist, read those and write back | |
2168 | * good data to the failed position. does not investigate in remapping the | |
2169 | * failed extent elsewhere, hoping the device will be smart enough to do this as | |
2170 | * needed | |
2171 | */ | |
2172 | ||
facc8a22 MX |
2173 | static int bio_readpage_error(struct bio *failed_bio, u64 phy_offset, |
2174 | struct page *page, u64 start, u64 end, | |
2175 | int failed_mirror) | |
4a54c8c1 JS |
2176 | { |
2177 | struct io_failure_record *failrec = NULL; | |
2178 | u64 private; | |
2179 | struct extent_map *em; | |
2180 | struct inode *inode = page->mapping->host; | |
2181 | struct extent_io_tree *failure_tree = &BTRFS_I(inode)->io_failure_tree; | |
2182 | struct extent_io_tree *tree = &BTRFS_I(inode)->io_tree; | |
2183 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; | |
2184 | struct bio *bio; | |
facc8a22 MX |
2185 | struct btrfs_io_bio *btrfs_failed_bio; |
2186 | struct btrfs_io_bio *btrfs_bio; | |
4a54c8c1 JS |
2187 | int num_copies; |
2188 | int ret; | |
2189 | int read_mode; | |
2190 | u64 logical; | |
2191 | ||
2192 | BUG_ON(failed_bio->bi_rw & REQ_WRITE); | |
2193 | ||
2194 | ret = get_state_private(failure_tree, start, &private); | |
2195 | if (ret) { | |
2196 | failrec = kzalloc(sizeof(*failrec), GFP_NOFS); | |
2197 | if (!failrec) | |
2198 | return -ENOMEM; | |
2199 | failrec->start = start; | |
2200 | failrec->len = end - start + 1; | |
2201 | failrec->this_mirror = 0; | |
2202 | failrec->bio_flags = 0; | |
2203 | failrec->in_validation = 0; | |
2204 | ||
2205 | read_lock(&em_tree->lock); | |
2206 | em = lookup_extent_mapping(em_tree, start, failrec->len); | |
2207 | if (!em) { | |
2208 | read_unlock(&em_tree->lock); | |
2209 | kfree(failrec); | |
2210 | return -EIO; | |
2211 | } | |
2212 | ||
68ba990f | 2213 | if (em->start > start || em->start + em->len <= start) { |
4a54c8c1 JS |
2214 | free_extent_map(em); |
2215 | em = NULL; | |
2216 | } | |
2217 | read_unlock(&em_tree->lock); | |
2218 | ||
7a2d6a64 | 2219 | if (!em) { |
4a54c8c1 JS |
2220 | kfree(failrec); |
2221 | return -EIO; | |
2222 | } | |
2223 | logical = start - em->start; | |
2224 | logical = em->block_start + logical; | |
2225 | if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) { | |
2226 | logical = em->block_start; | |
2227 | failrec->bio_flags = EXTENT_BIO_COMPRESSED; | |
2228 | extent_set_compress_type(&failrec->bio_flags, | |
2229 | em->compress_type); | |
2230 | } | |
2231 | pr_debug("bio_readpage_error: (new) logical=%llu, start=%llu, " | |
2232 | "len=%llu\n", logical, start, failrec->len); | |
2233 | failrec->logical = logical; | |
2234 | free_extent_map(em); | |
2235 | ||
2236 | /* set the bits in the private failure tree */ | |
2237 | ret = set_extent_bits(failure_tree, start, end, | |
2238 | EXTENT_LOCKED | EXTENT_DIRTY, GFP_NOFS); | |
2239 | if (ret >= 0) | |
2240 | ret = set_state_private(failure_tree, start, | |
2241 | (u64)(unsigned long)failrec); | |
2242 | /* set the bits in the inode's tree */ | |
2243 | if (ret >= 0) | |
2244 | ret = set_extent_bits(tree, start, end, EXTENT_DAMAGED, | |
2245 | GFP_NOFS); | |
2246 | if (ret < 0) { | |
2247 | kfree(failrec); | |
2248 | return ret; | |
2249 | } | |
2250 | } else { | |
2251 | failrec = (struct io_failure_record *)(unsigned long)private; | |
2252 | pr_debug("bio_readpage_error: (found) logical=%llu, " | |
2253 | "start=%llu, len=%llu, validation=%d\n", | |
2254 | failrec->logical, failrec->start, failrec->len, | |
2255 | failrec->in_validation); | |
2256 | /* | |
2257 | * when data can be on disk more than twice, add to failrec here | |
2258 | * (e.g. with a list for failed_mirror) to make | |
2259 | * clean_io_failure() clean all those errors at once. | |
2260 | */ | |
2261 | } | |
5d964051 SB |
2262 | num_copies = btrfs_num_copies(BTRFS_I(inode)->root->fs_info, |
2263 | failrec->logical, failrec->len); | |
4a54c8c1 JS |
2264 | if (num_copies == 1) { |
2265 | /* | |
2266 | * we only have a single copy of the data, so don't bother with | |
2267 | * all the retry and error correction code that follows. no | |
2268 | * matter what the error is, it is very likely to persist. | |
2269 | */ | |
09a7f7a2 MX |
2270 | pr_debug("bio_readpage_error: cannot repair, num_copies=%d, next_mirror %d, failed_mirror %d\n", |
2271 | num_copies, failrec->this_mirror, failed_mirror); | |
4a54c8c1 JS |
2272 | free_io_failure(inode, failrec, 0); |
2273 | return -EIO; | |
2274 | } | |
2275 | ||
4a54c8c1 JS |
2276 | /* |
2277 | * there are two premises: | |
2278 | * a) deliver good data to the caller | |
2279 | * b) correct the bad sectors on disk | |
2280 | */ | |
2281 | if (failed_bio->bi_vcnt > 1) { | |
2282 | /* | |
2283 | * to fulfill b), we need to know the exact failing sectors, as | |
2284 | * we don't want to rewrite any more than the failed ones. thus, | |
2285 | * we need separate read requests for the failed bio | |
2286 | * | |
2287 | * if the following BUG_ON triggers, our validation request got | |
2288 | * merged. we need separate requests for our algorithm to work. | |
2289 | */ | |
2290 | BUG_ON(failrec->in_validation); | |
2291 | failrec->in_validation = 1; | |
2292 | failrec->this_mirror = failed_mirror; | |
2293 | read_mode = READ_SYNC | REQ_FAILFAST_DEV; | |
2294 | } else { | |
2295 | /* | |
2296 | * we're ready to fulfill a) and b) alongside. get a good copy | |
2297 | * of the failed sector and if we succeed, we have setup | |
2298 | * everything for repair_io_failure to do the rest for us. | |
2299 | */ | |
2300 | if (failrec->in_validation) { | |
2301 | BUG_ON(failrec->this_mirror != failed_mirror); | |
2302 | failrec->in_validation = 0; | |
2303 | failrec->this_mirror = 0; | |
2304 | } | |
2305 | failrec->failed_mirror = failed_mirror; | |
2306 | failrec->this_mirror++; | |
2307 | if (failrec->this_mirror == failed_mirror) | |
2308 | failrec->this_mirror++; | |
2309 | read_mode = READ_SYNC; | |
2310 | } | |
2311 | ||
facc8a22 MX |
2312 | if (failrec->this_mirror > num_copies) { |
2313 | pr_debug("bio_readpage_error: (fail) num_copies=%d, next_mirror %d, failed_mirror %d\n", | |
4a54c8c1 JS |
2314 | num_copies, failrec->this_mirror, failed_mirror); |
2315 | free_io_failure(inode, failrec, 0); | |
2316 | return -EIO; | |
2317 | } | |
2318 | ||
9be3395b | 2319 | bio = btrfs_io_bio_alloc(GFP_NOFS, 1); |
e627ee7b TI |
2320 | if (!bio) { |
2321 | free_io_failure(inode, failrec, 0); | |
2322 | return -EIO; | |
2323 | } | |
4a54c8c1 | 2324 | bio->bi_end_io = failed_bio->bi_end_io; |
4f024f37 | 2325 | bio->bi_iter.bi_sector = failrec->logical >> 9; |
4a54c8c1 | 2326 | bio->bi_bdev = BTRFS_I(inode)->root->fs_info->fs_devices->latest_bdev; |
4f024f37 | 2327 | bio->bi_iter.bi_size = 0; |
4a54c8c1 | 2328 | |
facc8a22 MX |
2329 | btrfs_failed_bio = btrfs_io_bio(failed_bio); |
2330 | if (btrfs_failed_bio->csum) { | |
2331 | struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info; | |
2332 | u16 csum_size = btrfs_super_csum_size(fs_info->super_copy); | |
2333 | ||
2334 | btrfs_bio = btrfs_io_bio(bio); | |
2335 | btrfs_bio->csum = btrfs_bio->csum_inline; | |
2336 | phy_offset >>= inode->i_sb->s_blocksize_bits; | |
2337 | phy_offset *= csum_size; | |
2338 | memcpy(btrfs_bio->csum, btrfs_failed_bio->csum + phy_offset, | |
2339 | csum_size); | |
2340 | } | |
2341 | ||
4a54c8c1 JS |
2342 | bio_add_page(bio, page, failrec->len, start - page_offset(page)); |
2343 | ||
2344 | pr_debug("bio_readpage_error: submitting new read[%#x] to " | |
2345 | "this_mirror=%d, num_copies=%d, in_validation=%d\n", read_mode, | |
2346 | failrec->this_mirror, num_copies, failrec->in_validation); | |
2347 | ||
013bd4c3 TI |
2348 | ret = tree->ops->submit_bio_hook(inode, read_mode, bio, |
2349 | failrec->this_mirror, | |
2350 | failrec->bio_flags, 0); | |
2351 | return ret; | |
4a54c8c1 JS |
2352 | } |
2353 | ||
d1310b2e CM |
2354 | /* lots and lots of room for performance fixes in the end_bio funcs */ |
2355 | ||
87826df0 JM |
2356 | int end_extent_writepage(struct page *page, int err, u64 start, u64 end) |
2357 | { | |
2358 | int uptodate = (err == 0); | |
2359 | struct extent_io_tree *tree; | |
3e2426bd | 2360 | int ret = 0; |
87826df0 JM |
2361 | |
2362 | tree = &BTRFS_I(page->mapping->host)->io_tree; | |
2363 | ||
2364 | if (tree->ops && tree->ops->writepage_end_io_hook) { | |
2365 | ret = tree->ops->writepage_end_io_hook(page, start, | |
2366 | end, NULL, uptodate); | |
2367 | if (ret) | |
2368 | uptodate = 0; | |
2369 | } | |
2370 | ||
87826df0 | 2371 | if (!uptodate) { |
87826df0 JM |
2372 | ClearPageUptodate(page); |
2373 | SetPageError(page); | |
5dca6eea LB |
2374 | ret = ret < 0 ? ret : -EIO; |
2375 | mapping_set_error(page->mapping, ret); | |
87826df0 JM |
2376 | } |
2377 | return 0; | |
2378 | } | |
2379 | ||
d1310b2e CM |
2380 | /* |
2381 | * after a writepage IO is done, we need to: | |
2382 | * clear the uptodate bits on error | |
2383 | * clear the writeback bits in the extent tree for this IO | |
2384 | * end_page_writeback if the page has no more pending IO | |
2385 | * | |
2386 | * Scheduling is not allowed, so the extent state tree is expected | |
2387 | * to have one and only one object corresponding to this IO. | |
2388 | */ | |
d1310b2e | 2389 | static void end_bio_extent_writepage(struct bio *bio, int err) |
d1310b2e | 2390 | { |
2c30c71b | 2391 | struct bio_vec *bvec; |
d1310b2e CM |
2392 | u64 start; |
2393 | u64 end; | |
2c30c71b | 2394 | int i; |
d1310b2e | 2395 | |
2c30c71b | 2396 | bio_for_each_segment_all(bvec, bio, i) { |
d1310b2e | 2397 | struct page *page = bvec->bv_page; |
902b22f3 | 2398 | |
17a5adcc AO |
2399 | /* We always issue full-page reads, but if some block |
2400 | * in a page fails to read, blk_update_request() will | |
2401 | * advance bv_offset and adjust bv_len to compensate. | |
2402 | * Print a warning for nonzero offsets, and an error | |
2403 | * if they don't add up to a full page. */ | |
efe120a0 FH |
2404 | if (bvec->bv_offset || bvec->bv_len != PAGE_CACHE_SIZE) { |
2405 | if (bvec->bv_offset + bvec->bv_len != PAGE_CACHE_SIZE) | |
2406 | btrfs_err(BTRFS_I(page->mapping->host)->root->fs_info, | |
2407 | "partial page write in btrfs with offset %u and length %u", | |
2408 | bvec->bv_offset, bvec->bv_len); | |
2409 | else | |
2410 | btrfs_info(BTRFS_I(page->mapping->host)->root->fs_info, | |
2411 | "incomplete page write in btrfs with offset %u and " | |
2412 | "length %u", | |
2413 | bvec->bv_offset, bvec->bv_len); | |
2414 | } | |
d1310b2e | 2415 | |
17a5adcc AO |
2416 | start = page_offset(page); |
2417 | end = start + bvec->bv_offset + bvec->bv_len - 1; | |
d1310b2e | 2418 | |
87826df0 JM |
2419 | if (end_extent_writepage(page, err, start, end)) |
2420 | continue; | |
70dec807 | 2421 | |
17a5adcc | 2422 | end_page_writeback(page); |
2c30c71b | 2423 | } |
2b1f55b0 | 2424 | |
d1310b2e | 2425 | bio_put(bio); |
d1310b2e CM |
2426 | } |
2427 | ||
883d0de4 MX |
2428 | static void |
2429 | endio_readpage_release_extent(struct extent_io_tree *tree, u64 start, u64 len, | |
2430 | int uptodate) | |
2431 | { | |
2432 | struct extent_state *cached = NULL; | |
2433 | u64 end = start + len - 1; | |
2434 | ||
2435 | if (uptodate && tree->track_uptodate) | |
2436 | set_extent_uptodate(tree, start, end, &cached, GFP_ATOMIC); | |
2437 | unlock_extent_cached(tree, start, end, &cached, GFP_ATOMIC); | |
2438 | } | |
2439 | ||
d1310b2e CM |
2440 | /* |
2441 | * after a readpage IO is done, we need to: | |
2442 | * clear the uptodate bits on error | |
2443 | * set the uptodate bits if things worked | |
2444 | * set the page up to date if all extents in the tree are uptodate | |
2445 | * clear the lock bit in the extent tree | |
2446 | * unlock the page if there are no other extents locked for it | |
2447 | * | |
2448 | * Scheduling is not allowed, so the extent state tree is expected | |
2449 | * to have one and only one object corresponding to this IO. | |
2450 | */ | |
d1310b2e | 2451 | static void end_bio_extent_readpage(struct bio *bio, int err) |
d1310b2e | 2452 | { |
2c30c71b | 2453 | struct bio_vec *bvec; |
d1310b2e | 2454 | int uptodate = test_bit(BIO_UPTODATE, &bio->bi_flags); |
facc8a22 | 2455 | struct btrfs_io_bio *io_bio = btrfs_io_bio(bio); |
902b22f3 | 2456 | struct extent_io_tree *tree; |
facc8a22 | 2457 | u64 offset = 0; |
d1310b2e CM |
2458 | u64 start; |
2459 | u64 end; | |
facc8a22 | 2460 | u64 len; |
883d0de4 MX |
2461 | u64 extent_start = 0; |
2462 | u64 extent_len = 0; | |
5cf1ab56 | 2463 | int mirror; |
d1310b2e | 2464 | int ret; |
2c30c71b | 2465 | int i; |
d1310b2e | 2466 | |
d20f7043 CM |
2467 | if (err) |
2468 | uptodate = 0; | |
2469 | ||
2c30c71b | 2470 | bio_for_each_segment_all(bvec, bio, i) { |
d1310b2e | 2471 | struct page *page = bvec->bv_page; |
a71754fc | 2472 | struct inode *inode = page->mapping->host; |
507903b8 | 2473 | |
be3940c0 | 2474 | pr_debug("end_bio_extent_readpage: bi_sector=%llu, err=%d, " |
4f024f37 | 2475 | "mirror=%lu\n", (u64)bio->bi_iter.bi_sector, err, |
9be3395b | 2476 | io_bio->mirror_num); |
a71754fc | 2477 | tree = &BTRFS_I(inode)->io_tree; |
902b22f3 | 2478 | |
17a5adcc AO |
2479 | /* We always issue full-page reads, but if some block |
2480 | * in a page fails to read, blk_update_request() will | |
2481 | * advance bv_offset and adjust bv_len to compensate. | |
2482 | * Print a warning for nonzero offsets, and an error | |
2483 | * if they don't add up to a full page. */ | |
efe120a0 FH |
2484 | if (bvec->bv_offset || bvec->bv_len != PAGE_CACHE_SIZE) { |
2485 | if (bvec->bv_offset + bvec->bv_len != PAGE_CACHE_SIZE) | |
2486 | btrfs_err(BTRFS_I(page->mapping->host)->root->fs_info, | |
2487 | "partial page read in btrfs with offset %u and length %u", | |
2488 | bvec->bv_offset, bvec->bv_len); | |
2489 | else | |
2490 | btrfs_info(BTRFS_I(page->mapping->host)->root->fs_info, | |
2491 | "incomplete page read in btrfs with offset %u and " | |
2492 | "length %u", | |
2493 | bvec->bv_offset, bvec->bv_len); | |
2494 | } | |
d1310b2e | 2495 | |
17a5adcc AO |
2496 | start = page_offset(page); |
2497 | end = start + bvec->bv_offset + bvec->bv_len - 1; | |
facc8a22 | 2498 | len = bvec->bv_len; |
d1310b2e | 2499 | |
9be3395b | 2500 | mirror = io_bio->mirror_num; |
f2a09da9 MX |
2501 | if (likely(uptodate && tree->ops && |
2502 | tree->ops->readpage_end_io_hook)) { | |
facc8a22 MX |
2503 | ret = tree->ops->readpage_end_io_hook(io_bio, offset, |
2504 | page, start, end, | |
2505 | mirror); | |
5ee0844d | 2506 | if (ret) |
d1310b2e | 2507 | uptodate = 0; |
5ee0844d | 2508 | else |
4a54c8c1 | 2509 | clean_io_failure(start, page); |
d1310b2e | 2510 | } |
ea466794 | 2511 | |
f2a09da9 MX |
2512 | if (likely(uptodate)) |
2513 | goto readpage_ok; | |
2514 | ||
2515 | if (tree->ops && tree->ops->readpage_io_failed_hook) { | |
5cf1ab56 | 2516 | ret = tree->ops->readpage_io_failed_hook(page, mirror); |
ea466794 JB |
2517 | if (!ret && !err && |
2518 | test_bit(BIO_UPTODATE, &bio->bi_flags)) | |
2519 | uptodate = 1; | |
f2a09da9 | 2520 | } else { |
f4a8e656 JS |
2521 | /* |
2522 | * The generic bio_readpage_error handles errors the | |
2523 | * following way: If possible, new read requests are | |
2524 | * created and submitted and will end up in | |
2525 | * end_bio_extent_readpage as well (if we're lucky, not | |
2526 | * in the !uptodate case). In that case it returns 0 and | |
2527 | * we just go on with the next page in our bio. If it | |
2528 | * can't handle the error it will return -EIO and we | |
2529 | * remain responsible for that page. | |
2530 | */ | |
facc8a22 MX |
2531 | ret = bio_readpage_error(bio, offset, page, start, end, |
2532 | mirror); | |
7e38326f | 2533 | if (ret == 0) { |
3b951516 CM |
2534 | uptodate = |
2535 | test_bit(BIO_UPTODATE, &bio->bi_flags); | |
d20f7043 CM |
2536 | if (err) |
2537 | uptodate = 0; | |
38c1c2e4 | 2538 | offset += len; |
7e38326f CM |
2539 | continue; |
2540 | } | |
2541 | } | |
f2a09da9 | 2542 | readpage_ok: |
883d0de4 | 2543 | if (likely(uptodate)) { |
a71754fc JB |
2544 | loff_t i_size = i_size_read(inode); |
2545 | pgoff_t end_index = i_size >> PAGE_CACHE_SHIFT; | |
a583c026 | 2546 | unsigned off; |
a71754fc JB |
2547 | |
2548 | /* Zero out the end if this page straddles i_size */ | |
a583c026 LB |
2549 | off = i_size & (PAGE_CACHE_SIZE-1); |
2550 | if (page->index == end_index && off) | |
2551 | zero_user_segment(page, off, PAGE_CACHE_SIZE); | |
17a5adcc | 2552 | SetPageUptodate(page); |
70dec807 | 2553 | } else { |
17a5adcc AO |
2554 | ClearPageUptodate(page); |
2555 | SetPageError(page); | |
70dec807 | 2556 | } |
17a5adcc | 2557 | unlock_page(page); |
facc8a22 | 2558 | offset += len; |
883d0de4 MX |
2559 | |
2560 | if (unlikely(!uptodate)) { | |
2561 | if (extent_len) { | |
2562 | endio_readpage_release_extent(tree, | |
2563 | extent_start, | |
2564 | extent_len, 1); | |
2565 | extent_start = 0; | |
2566 | extent_len = 0; | |
2567 | } | |
2568 | endio_readpage_release_extent(tree, start, | |
2569 | end - start + 1, 0); | |
2570 | } else if (!extent_len) { | |
2571 | extent_start = start; | |
2572 | extent_len = end + 1 - start; | |
2573 | } else if (extent_start + extent_len == start) { | |
2574 | extent_len += end + 1 - start; | |
2575 | } else { | |
2576 | endio_readpage_release_extent(tree, extent_start, | |
2577 | extent_len, uptodate); | |
2578 | extent_start = start; | |
2579 | extent_len = end + 1 - start; | |
2580 | } | |
2c30c71b | 2581 | } |
d1310b2e | 2582 | |
883d0de4 MX |
2583 | if (extent_len) |
2584 | endio_readpage_release_extent(tree, extent_start, extent_len, | |
2585 | uptodate); | |
facc8a22 MX |
2586 | if (io_bio->end_io) |
2587 | io_bio->end_io(io_bio, err); | |
d1310b2e | 2588 | bio_put(bio); |
d1310b2e CM |
2589 | } |
2590 | ||
9be3395b CM |
2591 | /* |
2592 | * this allocates from the btrfs_bioset. We're returning a bio right now | |
2593 | * but you can call btrfs_io_bio for the appropriate container_of magic | |
2594 | */ | |
88f794ed MX |
2595 | struct bio * |
2596 | btrfs_bio_alloc(struct block_device *bdev, u64 first_sector, int nr_vecs, | |
2597 | gfp_t gfp_flags) | |
d1310b2e | 2598 | { |
facc8a22 | 2599 | struct btrfs_io_bio *btrfs_bio; |
d1310b2e CM |
2600 | struct bio *bio; |
2601 | ||
9be3395b | 2602 | bio = bio_alloc_bioset(gfp_flags, nr_vecs, btrfs_bioset); |
d1310b2e CM |
2603 | |
2604 | if (bio == NULL && (current->flags & PF_MEMALLOC)) { | |
9be3395b CM |
2605 | while (!bio && (nr_vecs /= 2)) { |
2606 | bio = bio_alloc_bioset(gfp_flags, | |
2607 | nr_vecs, btrfs_bioset); | |
2608 | } | |
d1310b2e CM |
2609 | } |
2610 | ||
2611 | if (bio) { | |
2612 | bio->bi_bdev = bdev; | |
4f024f37 | 2613 | bio->bi_iter.bi_sector = first_sector; |
facc8a22 MX |
2614 | btrfs_bio = btrfs_io_bio(bio); |
2615 | btrfs_bio->csum = NULL; | |
2616 | btrfs_bio->csum_allocated = NULL; | |
2617 | btrfs_bio->end_io = NULL; | |
d1310b2e CM |
2618 | } |
2619 | return bio; | |
2620 | } | |
2621 | ||
9be3395b CM |
2622 | struct bio *btrfs_bio_clone(struct bio *bio, gfp_t gfp_mask) |
2623 | { | |
2624 | return bio_clone_bioset(bio, gfp_mask, btrfs_bioset); | |
2625 | } | |
2626 | ||
2627 | ||
2628 | /* this also allocates from the btrfs_bioset */ | |
2629 | struct bio *btrfs_io_bio_alloc(gfp_t gfp_mask, unsigned int nr_iovecs) | |
2630 | { | |
facc8a22 MX |
2631 | struct btrfs_io_bio *btrfs_bio; |
2632 | struct bio *bio; | |
2633 | ||
2634 | bio = bio_alloc_bioset(gfp_mask, nr_iovecs, btrfs_bioset); | |
2635 | if (bio) { | |
2636 | btrfs_bio = btrfs_io_bio(bio); | |
2637 | btrfs_bio->csum = NULL; | |
2638 | btrfs_bio->csum_allocated = NULL; | |
2639 | btrfs_bio->end_io = NULL; | |
2640 | } | |
2641 | return bio; | |
9be3395b CM |
2642 | } |
2643 | ||
2644 | ||
355808c2 JM |
2645 | static int __must_check submit_one_bio(int rw, struct bio *bio, |
2646 | int mirror_num, unsigned long bio_flags) | |
d1310b2e | 2647 | { |
d1310b2e | 2648 | int ret = 0; |
70dec807 CM |
2649 | struct bio_vec *bvec = bio->bi_io_vec + bio->bi_vcnt - 1; |
2650 | struct page *page = bvec->bv_page; | |
2651 | struct extent_io_tree *tree = bio->bi_private; | |
70dec807 | 2652 | u64 start; |
70dec807 | 2653 | |
4eee4fa4 | 2654 | start = page_offset(page) + bvec->bv_offset; |
70dec807 | 2655 | |
902b22f3 | 2656 | bio->bi_private = NULL; |
d1310b2e CM |
2657 | |
2658 | bio_get(bio); | |
2659 | ||
065631f6 | 2660 | if (tree->ops && tree->ops->submit_bio_hook) |
6b82ce8d | 2661 | ret = tree->ops->submit_bio_hook(page->mapping->host, rw, bio, |
eaf25d93 | 2662 | mirror_num, bio_flags, start); |
0b86a832 | 2663 | else |
21adbd5c | 2664 | btrfsic_submit_bio(rw, bio); |
4a54c8c1 | 2665 | |
d1310b2e CM |
2666 | if (bio_flagged(bio, BIO_EOPNOTSUPP)) |
2667 | ret = -EOPNOTSUPP; | |
2668 | bio_put(bio); | |
2669 | return ret; | |
2670 | } | |
2671 | ||
64a16701 | 2672 | static int merge_bio(int rw, struct extent_io_tree *tree, struct page *page, |
3444a972 JM |
2673 | unsigned long offset, size_t size, struct bio *bio, |
2674 | unsigned long bio_flags) | |
2675 | { | |
2676 | int ret = 0; | |
2677 | if (tree->ops && tree->ops->merge_bio_hook) | |
64a16701 | 2678 | ret = tree->ops->merge_bio_hook(rw, page, offset, size, bio, |
3444a972 JM |
2679 | bio_flags); |
2680 | BUG_ON(ret < 0); | |
2681 | return ret; | |
2682 | ||
2683 | } | |
2684 | ||
d1310b2e CM |
2685 | static int submit_extent_page(int rw, struct extent_io_tree *tree, |
2686 | struct page *page, sector_t sector, | |
2687 | size_t size, unsigned long offset, | |
2688 | struct block_device *bdev, | |
2689 | struct bio **bio_ret, | |
2690 | unsigned long max_pages, | |
f188591e | 2691 | bio_end_io_t end_io_func, |
c8b97818 CM |
2692 | int mirror_num, |
2693 | unsigned long prev_bio_flags, | |
2694 | unsigned long bio_flags) | |
d1310b2e CM |
2695 | { |
2696 | int ret = 0; | |
2697 | struct bio *bio; | |
2698 | int nr; | |
c8b97818 CM |
2699 | int contig = 0; |
2700 | int this_compressed = bio_flags & EXTENT_BIO_COMPRESSED; | |
2701 | int old_compressed = prev_bio_flags & EXTENT_BIO_COMPRESSED; | |
5b050f04 | 2702 | size_t page_size = min_t(size_t, size, PAGE_CACHE_SIZE); |
d1310b2e CM |
2703 | |
2704 | if (bio_ret && *bio_ret) { | |
2705 | bio = *bio_ret; | |
c8b97818 | 2706 | if (old_compressed) |
4f024f37 | 2707 | contig = bio->bi_iter.bi_sector == sector; |
c8b97818 | 2708 | else |
f73a1c7d | 2709 | contig = bio_end_sector(bio) == sector; |
c8b97818 CM |
2710 | |
2711 | if (prev_bio_flags != bio_flags || !contig || | |
64a16701 | 2712 | merge_bio(rw, tree, page, offset, page_size, bio, bio_flags) || |
c8b97818 CM |
2713 | bio_add_page(bio, page, page_size, offset) < page_size) { |
2714 | ret = submit_one_bio(rw, bio, mirror_num, | |
2715 | prev_bio_flags); | |
79787eaa JM |
2716 | if (ret < 0) |
2717 | return ret; | |
d1310b2e CM |
2718 | bio = NULL; |
2719 | } else { | |
2720 | return 0; | |
2721 | } | |
2722 | } | |
c8b97818 CM |
2723 | if (this_compressed) |
2724 | nr = BIO_MAX_PAGES; | |
2725 | else | |
2726 | nr = bio_get_nr_vecs(bdev); | |
2727 | ||
88f794ed | 2728 | bio = btrfs_bio_alloc(bdev, sector, nr, GFP_NOFS | __GFP_HIGH); |
5df67083 TI |
2729 | if (!bio) |
2730 | return -ENOMEM; | |
70dec807 | 2731 | |
c8b97818 | 2732 | bio_add_page(bio, page, page_size, offset); |
d1310b2e CM |
2733 | bio->bi_end_io = end_io_func; |
2734 | bio->bi_private = tree; | |
70dec807 | 2735 | |
d397712b | 2736 | if (bio_ret) |
d1310b2e | 2737 | *bio_ret = bio; |
d397712b | 2738 | else |
c8b97818 | 2739 | ret = submit_one_bio(rw, bio, mirror_num, bio_flags); |
d1310b2e CM |
2740 | |
2741 | return ret; | |
2742 | } | |
2743 | ||
48a3b636 ES |
2744 | static void attach_extent_buffer_page(struct extent_buffer *eb, |
2745 | struct page *page) | |
d1310b2e CM |
2746 | { |
2747 | if (!PagePrivate(page)) { | |
2748 | SetPagePrivate(page); | |
d1310b2e | 2749 | page_cache_get(page); |
4f2de97a JB |
2750 | set_page_private(page, (unsigned long)eb); |
2751 | } else { | |
2752 | WARN_ON(page->private != (unsigned long)eb); | |
d1310b2e CM |
2753 | } |
2754 | } | |
2755 | ||
4f2de97a | 2756 | void set_page_extent_mapped(struct page *page) |
d1310b2e | 2757 | { |
4f2de97a JB |
2758 | if (!PagePrivate(page)) { |
2759 | SetPagePrivate(page); | |
2760 | page_cache_get(page); | |
2761 | set_page_private(page, EXTENT_PAGE_PRIVATE); | |
2762 | } | |
d1310b2e CM |
2763 | } |
2764 | ||
125bac01 MX |
2765 | static struct extent_map * |
2766 | __get_extent_map(struct inode *inode, struct page *page, size_t pg_offset, | |
2767 | u64 start, u64 len, get_extent_t *get_extent, | |
2768 | struct extent_map **em_cached) | |
2769 | { | |
2770 | struct extent_map *em; | |
2771 | ||
2772 | if (em_cached && *em_cached) { | |
2773 | em = *em_cached; | |
cbc0e928 | 2774 | if (extent_map_in_tree(em) && start >= em->start && |
125bac01 MX |
2775 | start < extent_map_end(em)) { |
2776 | atomic_inc(&em->refs); | |
2777 | return em; | |
2778 | } | |
2779 | ||
2780 | free_extent_map(em); | |
2781 | *em_cached = NULL; | |
2782 | } | |
2783 | ||
2784 | em = get_extent(inode, page, pg_offset, start, len, 0); | |
2785 | if (em_cached && !IS_ERR_OR_NULL(em)) { | |
2786 | BUG_ON(*em_cached); | |
2787 | atomic_inc(&em->refs); | |
2788 | *em_cached = em; | |
2789 | } | |
2790 | return em; | |
2791 | } | |
d1310b2e CM |
2792 | /* |
2793 | * basic readpage implementation. Locked extent state structs are inserted | |
2794 | * into the tree that are removed when the IO is done (by the end_io | |
2795 | * handlers) | |
79787eaa | 2796 | * XXX JDM: This needs looking at to ensure proper page locking |
d1310b2e | 2797 | */ |
9974090b MX |
2798 | static int __do_readpage(struct extent_io_tree *tree, |
2799 | struct page *page, | |
2800 | get_extent_t *get_extent, | |
125bac01 | 2801 | struct extent_map **em_cached, |
9974090b MX |
2802 | struct bio **bio, int mirror_num, |
2803 | unsigned long *bio_flags, int rw) | |
d1310b2e CM |
2804 | { |
2805 | struct inode *inode = page->mapping->host; | |
4eee4fa4 | 2806 | u64 start = page_offset(page); |
d1310b2e CM |
2807 | u64 page_end = start + PAGE_CACHE_SIZE - 1; |
2808 | u64 end; | |
2809 | u64 cur = start; | |
2810 | u64 extent_offset; | |
2811 | u64 last_byte = i_size_read(inode); | |
2812 | u64 block_start; | |
2813 | u64 cur_end; | |
2814 | sector_t sector; | |
2815 | struct extent_map *em; | |
2816 | struct block_device *bdev; | |
2817 | int ret; | |
2818 | int nr = 0; | |
4b384318 | 2819 | int parent_locked = *bio_flags & EXTENT_BIO_PARENT_LOCKED; |
306e16ce | 2820 | size_t pg_offset = 0; |
d1310b2e | 2821 | size_t iosize; |
c8b97818 | 2822 | size_t disk_io_size; |
d1310b2e | 2823 | size_t blocksize = inode->i_sb->s_blocksize; |
4b384318 | 2824 | unsigned long this_bio_flag = *bio_flags & EXTENT_BIO_PARENT_LOCKED; |
d1310b2e CM |
2825 | |
2826 | set_page_extent_mapped(page); | |
2827 | ||
9974090b | 2828 | end = page_end; |
90a887c9 DM |
2829 | if (!PageUptodate(page)) { |
2830 | if (cleancache_get_page(page) == 0) { | |
2831 | BUG_ON(blocksize != PAGE_SIZE); | |
9974090b | 2832 | unlock_extent(tree, start, end); |
90a887c9 DM |
2833 | goto out; |
2834 | } | |
2835 | } | |
2836 | ||
c8b97818 CM |
2837 | if (page->index == last_byte >> PAGE_CACHE_SHIFT) { |
2838 | char *userpage; | |
2839 | size_t zero_offset = last_byte & (PAGE_CACHE_SIZE - 1); | |
2840 | ||
2841 | if (zero_offset) { | |
2842 | iosize = PAGE_CACHE_SIZE - zero_offset; | |
7ac687d9 | 2843 | userpage = kmap_atomic(page); |
c8b97818 CM |
2844 | memset(userpage + zero_offset, 0, iosize); |
2845 | flush_dcache_page(page); | |
7ac687d9 | 2846 | kunmap_atomic(userpage); |
c8b97818 CM |
2847 | } |
2848 | } | |
d1310b2e | 2849 | while (cur <= end) { |
c8f2f24b JB |
2850 | unsigned long pnr = (last_byte >> PAGE_CACHE_SHIFT) + 1; |
2851 | ||
d1310b2e CM |
2852 | if (cur >= last_byte) { |
2853 | char *userpage; | |
507903b8 AJ |
2854 | struct extent_state *cached = NULL; |
2855 | ||
306e16ce | 2856 | iosize = PAGE_CACHE_SIZE - pg_offset; |
7ac687d9 | 2857 | userpage = kmap_atomic(page); |
306e16ce | 2858 | memset(userpage + pg_offset, 0, iosize); |
d1310b2e | 2859 | flush_dcache_page(page); |
7ac687d9 | 2860 | kunmap_atomic(userpage); |
d1310b2e | 2861 | set_extent_uptodate(tree, cur, cur + iosize - 1, |
507903b8 | 2862 | &cached, GFP_NOFS); |
4b384318 MF |
2863 | if (!parent_locked) |
2864 | unlock_extent_cached(tree, cur, | |
2865 | cur + iosize - 1, | |
2866 | &cached, GFP_NOFS); | |
d1310b2e CM |
2867 | break; |
2868 | } | |
125bac01 MX |
2869 | em = __get_extent_map(inode, page, pg_offset, cur, |
2870 | end - cur + 1, get_extent, em_cached); | |
c704005d | 2871 | if (IS_ERR_OR_NULL(em)) { |
d1310b2e | 2872 | SetPageError(page); |
4b384318 MF |
2873 | if (!parent_locked) |
2874 | unlock_extent(tree, cur, end); | |
d1310b2e CM |
2875 | break; |
2876 | } | |
d1310b2e CM |
2877 | extent_offset = cur - em->start; |
2878 | BUG_ON(extent_map_end(em) <= cur); | |
2879 | BUG_ON(end < cur); | |
2880 | ||
261507a0 | 2881 | if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) { |
4b384318 | 2882 | this_bio_flag |= EXTENT_BIO_COMPRESSED; |
261507a0 LZ |
2883 | extent_set_compress_type(&this_bio_flag, |
2884 | em->compress_type); | |
2885 | } | |
c8b97818 | 2886 | |
d1310b2e CM |
2887 | iosize = min(extent_map_end(em) - cur, end - cur + 1); |
2888 | cur_end = min(extent_map_end(em) - 1, end); | |
fda2832f | 2889 | iosize = ALIGN(iosize, blocksize); |
c8b97818 CM |
2890 | if (this_bio_flag & EXTENT_BIO_COMPRESSED) { |
2891 | disk_io_size = em->block_len; | |
2892 | sector = em->block_start >> 9; | |
2893 | } else { | |
2894 | sector = (em->block_start + extent_offset) >> 9; | |
2895 | disk_io_size = iosize; | |
2896 | } | |
d1310b2e CM |
2897 | bdev = em->bdev; |
2898 | block_start = em->block_start; | |
d899e052 YZ |
2899 | if (test_bit(EXTENT_FLAG_PREALLOC, &em->flags)) |
2900 | block_start = EXTENT_MAP_HOLE; | |
d1310b2e CM |
2901 | free_extent_map(em); |
2902 | em = NULL; | |
2903 | ||
2904 | /* we've found a hole, just zero and go on */ | |
2905 | if (block_start == EXTENT_MAP_HOLE) { | |
2906 | char *userpage; | |
507903b8 AJ |
2907 | struct extent_state *cached = NULL; |
2908 | ||
7ac687d9 | 2909 | userpage = kmap_atomic(page); |
306e16ce | 2910 | memset(userpage + pg_offset, 0, iosize); |
d1310b2e | 2911 | flush_dcache_page(page); |
7ac687d9 | 2912 | kunmap_atomic(userpage); |
d1310b2e CM |
2913 | |
2914 | set_extent_uptodate(tree, cur, cur + iosize - 1, | |
507903b8 AJ |
2915 | &cached, GFP_NOFS); |
2916 | unlock_extent_cached(tree, cur, cur + iosize - 1, | |
2917 | &cached, GFP_NOFS); | |
d1310b2e | 2918 | cur = cur + iosize; |
306e16ce | 2919 | pg_offset += iosize; |
d1310b2e CM |
2920 | continue; |
2921 | } | |
2922 | /* the get_extent function already copied into the page */ | |
9655d298 CM |
2923 | if (test_range_bit(tree, cur, cur_end, |
2924 | EXTENT_UPTODATE, 1, NULL)) { | |
a1b32a59 | 2925 | check_page_uptodate(tree, page); |
4b384318 MF |
2926 | if (!parent_locked) |
2927 | unlock_extent(tree, cur, cur + iosize - 1); | |
d1310b2e | 2928 | cur = cur + iosize; |
306e16ce | 2929 | pg_offset += iosize; |
d1310b2e CM |
2930 | continue; |
2931 | } | |
70dec807 CM |
2932 | /* we have an inline extent but it didn't get marked up |
2933 | * to date. Error out | |
2934 | */ | |
2935 | if (block_start == EXTENT_MAP_INLINE) { | |
2936 | SetPageError(page); | |
4b384318 MF |
2937 | if (!parent_locked) |
2938 | unlock_extent(tree, cur, cur + iosize - 1); | |
70dec807 | 2939 | cur = cur + iosize; |
306e16ce | 2940 | pg_offset += iosize; |
70dec807 CM |
2941 | continue; |
2942 | } | |
d1310b2e | 2943 | |
c8f2f24b | 2944 | pnr -= page->index; |
d4c7ca86 | 2945 | ret = submit_extent_page(rw, tree, page, |
306e16ce | 2946 | sector, disk_io_size, pg_offset, |
89642229 | 2947 | bdev, bio, pnr, |
c8b97818 CM |
2948 | end_bio_extent_readpage, mirror_num, |
2949 | *bio_flags, | |
2950 | this_bio_flag); | |
c8f2f24b JB |
2951 | if (!ret) { |
2952 | nr++; | |
2953 | *bio_flags = this_bio_flag; | |
2954 | } else { | |
d1310b2e | 2955 | SetPageError(page); |
4b384318 MF |
2956 | if (!parent_locked) |
2957 | unlock_extent(tree, cur, cur + iosize - 1); | |
edd33c99 | 2958 | } |
d1310b2e | 2959 | cur = cur + iosize; |
306e16ce | 2960 | pg_offset += iosize; |
d1310b2e | 2961 | } |
90a887c9 | 2962 | out: |
d1310b2e CM |
2963 | if (!nr) { |
2964 | if (!PageError(page)) | |
2965 | SetPageUptodate(page); | |
2966 | unlock_page(page); | |
2967 | } | |
2968 | return 0; | |
2969 | } | |
2970 | ||
9974090b MX |
2971 | static inline void __do_contiguous_readpages(struct extent_io_tree *tree, |
2972 | struct page *pages[], int nr_pages, | |
2973 | u64 start, u64 end, | |
2974 | get_extent_t *get_extent, | |
125bac01 | 2975 | struct extent_map **em_cached, |
9974090b MX |
2976 | struct bio **bio, int mirror_num, |
2977 | unsigned long *bio_flags, int rw) | |
2978 | { | |
2979 | struct inode *inode; | |
2980 | struct btrfs_ordered_extent *ordered; | |
2981 | int index; | |
2982 | ||
2983 | inode = pages[0]->mapping->host; | |
2984 | while (1) { | |
2985 | lock_extent(tree, start, end); | |
2986 | ordered = btrfs_lookup_ordered_range(inode, start, | |
2987 | end - start + 1); | |
2988 | if (!ordered) | |
2989 | break; | |
2990 | unlock_extent(tree, start, end); | |
2991 | btrfs_start_ordered_extent(inode, ordered, 1); | |
2992 | btrfs_put_ordered_extent(ordered); | |
2993 | } | |
2994 | ||
2995 | for (index = 0; index < nr_pages; index++) { | |
125bac01 MX |
2996 | __do_readpage(tree, pages[index], get_extent, em_cached, bio, |
2997 | mirror_num, bio_flags, rw); | |
9974090b MX |
2998 | page_cache_release(pages[index]); |
2999 | } | |
3000 | } | |
3001 | ||
3002 | static void __extent_readpages(struct extent_io_tree *tree, | |
3003 | struct page *pages[], | |
3004 | int nr_pages, get_extent_t *get_extent, | |
125bac01 | 3005 | struct extent_map **em_cached, |
9974090b MX |
3006 | struct bio **bio, int mirror_num, |
3007 | unsigned long *bio_flags, int rw) | |
3008 | { | |
35a3621b | 3009 | u64 start = 0; |
9974090b MX |
3010 | u64 end = 0; |
3011 | u64 page_start; | |
3012 | int index; | |
35a3621b | 3013 | int first_index = 0; |
9974090b MX |
3014 | |
3015 | for (index = 0; index < nr_pages; index++) { | |
3016 | page_start = page_offset(pages[index]); | |
3017 | if (!end) { | |
3018 | start = page_start; | |
3019 | end = start + PAGE_CACHE_SIZE - 1; | |
3020 | first_index = index; | |
3021 | } else if (end + 1 == page_start) { | |
3022 | end += PAGE_CACHE_SIZE; | |
3023 | } else { | |
3024 | __do_contiguous_readpages(tree, &pages[first_index], | |
3025 | index - first_index, start, | |
125bac01 MX |
3026 | end, get_extent, em_cached, |
3027 | bio, mirror_num, bio_flags, | |
3028 | rw); | |
9974090b MX |
3029 | start = page_start; |
3030 | end = start + PAGE_CACHE_SIZE - 1; | |
3031 | first_index = index; | |
3032 | } | |
3033 | } | |
3034 | ||
3035 | if (end) | |
3036 | __do_contiguous_readpages(tree, &pages[first_index], | |
3037 | index - first_index, start, | |
125bac01 | 3038 | end, get_extent, em_cached, bio, |
9974090b MX |
3039 | mirror_num, bio_flags, rw); |
3040 | } | |
3041 | ||
3042 | static int __extent_read_full_page(struct extent_io_tree *tree, | |
3043 | struct page *page, | |
3044 | get_extent_t *get_extent, | |
3045 | struct bio **bio, int mirror_num, | |
3046 | unsigned long *bio_flags, int rw) | |
3047 | { | |
3048 | struct inode *inode = page->mapping->host; | |
3049 | struct btrfs_ordered_extent *ordered; | |
3050 | u64 start = page_offset(page); | |
3051 | u64 end = start + PAGE_CACHE_SIZE - 1; | |
3052 | int ret; | |
3053 | ||
3054 | while (1) { | |
3055 | lock_extent(tree, start, end); | |
3056 | ordered = btrfs_lookup_ordered_extent(inode, start); | |
3057 | if (!ordered) | |
3058 | break; | |
3059 | unlock_extent(tree, start, end); | |
3060 | btrfs_start_ordered_extent(inode, ordered, 1); | |
3061 | btrfs_put_ordered_extent(ordered); | |
3062 | } | |
3063 | ||
125bac01 MX |
3064 | ret = __do_readpage(tree, page, get_extent, NULL, bio, mirror_num, |
3065 | bio_flags, rw); | |
9974090b MX |
3066 | return ret; |
3067 | } | |
3068 | ||
d1310b2e | 3069 | int extent_read_full_page(struct extent_io_tree *tree, struct page *page, |
8ddc7d9c | 3070 | get_extent_t *get_extent, int mirror_num) |
d1310b2e CM |
3071 | { |
3072 | struct bio *bio = NULL; | |
c8b97818 | 3073 | unsigned long bio_flags = 0; |
d1310b2e CM |
3074 | int ret; |
3075 | ||
8ddc7d9c | 3076 | ret = __extent_read_full_page(tree, page, get_extent, &bio, mirror_num, |
d4c7ca86 | 3077 | &bio_flags, READ); |
d1310b2e | 3078 | if (bio) |
8ddc7d9c | 3079 | ret = submit_one_bio(READ, bio, mirror_num, bio_flags); |
d1310b2e CM |
3080 | return ret; |
3081 | } | |
d1310b2e | 3082 | |
4b384318 MF |
3083 | int extent_read_full_page_nolock(struct extent_io_tree *tree, struct page *page, |
3084 | get_extent_t *get_extent, int mirror_num) | |
3085 | { | |
3086 | struct bio *bio = NULL; | |
3087 | unsigned long bio_flags = EXTENT_BIO_PARENT_LOCKED; | |
3088 | int ret; | |
3089 | ||
3090 | ret = __do_readpage(tree, page, get_extent, NULL, &bio, mirror_num, | |
3091 | &bio_flags, READ); | |
3092 | if (bio) | |
3093 | ret = submit_one_bio(READ, bio, mirror_num, bio_flags); | |
3094 | return ret; | |
3095 | } | |
3096 | ||
11c8349b CM |
3097 | static noinline void update_nr_written(struct page *page, |
3098 | struct writeback_control *wbc, | |
3099 | unsigned long nr_written) | |
3100 | { | |
3101 | wbc->nr_to_write -= nr_written; | |
3102 | if (wbc->range_cyclic || (wbc->nr_to_write > 0 && | |
3103 | wbc->range_start == 0 && wbc->range_end == LLONG_MAX)) | |
3104 | page->mapping->writeback_index = page->index + nr_written; | |
3105 | } | |
3106 | ||
d1310b2e | 3107 | /* |
40f76580 CM |
3108 | * helper for __extent_writepage, doing all of the delayed allocation setup. |
3109 | * | |
3110 | * This returns 1 if our fill_delalloc function did all the work required | |
3111 | * to write the page (copy into inline extent). In this case the IO has | |
3112 | * been started and the page is already unlocked. | |
3113 | * | |
3114 | * This returns 0 if all went well (page still locked) | |
3115 | * This returns < 0 if there were errors (page still locked) | |
d1310b2e | 3116 | */ |
40f76580 CM |
3117 | static noinline_for_stack int writepage_delalloc(struct inode *inode, |
3118 | struct page *page, struct writeback_control *wbc, | |
3119 | struct extent_page_data *epd, | |
3120 | u64 delalloc_start, | |
3121 | unsigned long *nr_written) | |
3122 | { | |
3123 | struct extent_io_tree *tree = epd->tree; | |
3124 | u64 page_end = delalloc_start + PAGE_CACHE_SIZE - 1; | |
3125 | u64 nr_delalloc; | |
3126 | u64 delalloc_to_write = 0; | |
3127 | u64 delalloc_end = 0; | |
3128 | int ret; | |
3129 | int page_started = 0; | |
3130 | ||
3131 | if (epd->extent_locked || !tree->ops || !tree->ops->fill_delalloc) | |
3132 | return 0; | |
3133 | ||
3134 | while (delalloc_end < page_end) { | |
3135 | nr_delalloc = find_lock_delalloc_range(inode, tree, | |
3136 | page, | |
3137 | &delalloc_start, | |
3138 | &delalloc_end, | |
3139 | 128 * 1024 * 1024); | |
3140 | if (nr_delalloc == 0) { | |
3141 | delalloc_start = delalloc_end + 1; | |
3142 | continue; | |
3143 | } | |
3144 | ret = tree->ops->fill_delalloc(inode, page, | |
3145 | delalloc_start, | |
3146 | delalloc_end, | |
3147 | &page_started, | |
3148 | nr_written); | |
3149 | /* File system has been set read-only */ | |
3150 | if (ret) { | |
3151 | SetPageError(page); | |
3152 | /* fill_delalloc should be return < 0 for error | |
3153 | * but just in case, we use > 0 here meaning the | |
3154 | * IO is started, so we don't want to return > 0 | |
3155 | * unless things are going well. | |
3156 | */ | |
3157 | ret = ret < 0 ? ret : -EIO; | |
3158 | goto done; | |
3159 | } | |
3160 | /* | |
3161 | * delalloc_end is already one less than the total | |
3162 | * length, so we don't subtract one from | |
3163 | * PAGE_CACHE_SIZE | |
3164 | */ | |
3165 | delalloc_to_write += (delalloc_end - delalloc_start + | |
3166 | PAGE_CACHE_SIZE) >> | |
3167 | PAGE_CACHE_SHIFT; | |
3168 | delalloc_start = delalloc_end + 1; | |
3169 | } | |
3170 | if (wbc->nr_to_write < delalloc_to_write) { | |
3171 | int thresh = 8192; | |
3172 | ||
3173 | if (delalloc_to_write < thresh * 2) | |
3174 | thresh = delalloc_to_write; | |
3175 | wbc->nr_to_write = min_t(u64, delalloc_to_write, | |
3176 | thresh); | |
3177 | } | |
3178 | ||
3179 | /* did the fill delalloc function already unlock and start | |
3180 | * the IO? | |
3181 | */ | |
3182 | if (page_started) { | |
3183 | /* | |
3184 | * we've unlocked the page, so we can't update | |
3185 | * the mapping's writeback index, just update | |
3186 | * nr_to_write. | |
3187 | */ | |
3188 | wbc->nr_to_write -= *nr_written; | |
3189 | return 1; | |
3190 | } | |
3191 | ||
3192 | ret = 0; | |
3193 | ||
3194 | done: | |
3195 | return ret; | |
3196 | } | |
3197 | ||
3198 | /* | |
3199 | * helper for __extent_writepage. This calls the writepage start hooks, | |
3200 | * and does the loop to map the page into extents and bios. | |
3201 | * | |
3202 | * We return 1 if the IO is started and the page is unlocked, | |
3203 | * 0 if all went well (page still locked) | |
3204 | * < 0 if there were errors (page still locked) | |
3205 | */ | |
3206 | static noinline_for_stack int __extent_writepage_io(struct inode *inode, | |
3207 | struct page *page, | |
3208 | struct writeback_control *wbc, | |
3209 | struct extent_page_data *epd, | |
3210 | loff_t i_size, | |
3211 | unsigned long nr_written, | |
3212 | int write_flags, int *nr_ret) | |
d1310b2e | 3213 | { |
d1310b2e | 3214 | struct extent_io_tree *tree = epd->tree; |
4eee4fa4 | 3215 | u64 start = page_offset(page); |
d1310b2e CM |
3216 | u64 page_end = start + PAGE_CACHE_SIZE - 1; |
3217 | u64 end; | |
3218 | u64 cur = start; | |
3219 | u64 extent_offset; | |
d1310b2e CM |
3220 | u64 block_start; |
3221 | u64 iosize; | |
3222 | sector_t sector; | |
2c64c53d | 3223 | struct extent_state *cached_state = NULL; |
d1310b2e CM |
3224 | struct extent_map *em; |
3225 | struct block_device *bdev; | |
7f3c74fb | 3226 | size_t pg_offset = 0; |
d1310b2e | 3227 | size_t blocksize; |
40f76580 CM |
3228 | int ret = 0; |
3229 | int nr = 0; | |
3230 | bool compressed; | |
c8b97818 | 3231 | |
247e743c | 3232 | if (tree->ops && tree->ops->writepage_start_hook) { |
c8b97818 CM |
3233 | ret = tree->ops->writepage_start_hook(page, start, |
3234 | page_end); | |
87826df0 JM |
3235 | if (ret) { |
3236 | /* Fixup worker will requeue */ | |
3237 | if (ret == -EBUSY) | |
3238 | wbc->pages_skipped++; | |
3239 | else | |
3240 | redirty_page_for_writepage(wbc, page); | |
40f76580 | 3241 | |
11c8349b | 3242 | update_nr_written(page, wbc, nr_written); |
247e743c | 3243 | unlock_page(page); |
40f76580 | 3244 | ret = 1; |
11c8349b | 3245 | goto done_unlocked; |
247e743c CM |
3246 | } |
3247 | } | |
3248 | ||
11c8349b CM |
3249 | /* |
3250 | * we don't want to touch the inode after unlocking the page, | |
3251 | * so we update the mapping writeback index now | |
3252 | */ | |
3253 | update_nr_written(page, wbc, nr_written + 1); | |
771ed689 | 3254 | |
d1310b2e | 3255 | end = page_end; |
40f76580 | 3256 | if (i_size <= start) { |
e6dcd2dc CM |
3257 | if (tree->ops && tree->ops->writepage_end_io_hook) |
3258 | tree->ops->writepage_end_io_hook(page, start, | |
3259 | page_end, NULL, 1); | |
d1310b2e CM |
3260 | goto done; |
3261 | } | |
3262 | ||
d1310b2e CM |
3263 | blocksize = inode->i_sb->s_blocksize; |
3264 | ||
3265 | while (cur <= end) { | |
40f76580 CM |
3266 | u64 em_end; |
3267 | if (cur >= i_size) { | |
e6dcd2dc CM |
3268 | if (tree->ops && tree->ops->writepage_end_io_hook) |
3269 | tree->ops->writepage_end_io_hook(page, cur, | |
3270 | page_end, NULL, 1); | |
d1310b2e CM |
3271 | break; |
3272 | } | |
7f3c74fb | 3273 | em = epd->get_extent(inode, page, pg_offset, cur, |
d1310b2e | 3274 | end - cur + 1, 1); |
c704005d | 3275 | if (IS_ERR_OR_NULL(em)) { |
d1310b2e | 3276 | SetPageError(page); |
61391d56 | 3277 | ret = PTR_ERR_OR_ZERO(em); |
d1310b2e CM |
3278 | break; |
3279 | } | |
3280 | ||
3281 | extent_offset = cur - em->start; | |
40f76580 CM |
3282 | em_end = extent_map_end(em); |
3283 | BUG_ON(em_end <= cur); | |
d1310b2e | 3284 | BUG_ON(end < cur); |
40f76580 | 3285 | iosize = min(em_end - cur, end - cur + 1); |
fda2832f | 3286 | iosize = ALIGN(iosize, blocksize); |
d1310b2e CM |
3287 | sector = (em->block_start + extent_offset) >> 9; |
3288 | bdev = em->bdev; | |
3289 | block_start = em->block_start; | |
c8b97818 | 3290 | compressed = test_bit(EXTENT_FLAG_COMPRESSED, &em->flags); |
d1310b2e CM |
3291 | free_extent_map(em); |
3292 | em = NULL; | |
3293 | ||
c8b97818 CM |
3294 | /* |
3295 | * compressed and inline extents are written through other | |
3296 | * paths in the FS | |
3297 | */ | |
3298 | if (compressed || block_start == EXTENT_MAP_HOLE || | |
d1310b2e | 3299 | block_start == EXTENT_MAP_INLINE) { |
c8b97818 CM |
3300 | /* |
3301 | * end_io notification does not happen here for | |
3302 | * compressed extents | |
3303 | */ | |
3304 | if (!compressed && tree->ops && | |
3305 | tree->ops->writepage_end_io_hook) | |
e6dcd2dc CM |
3306 | tree->ops->writepage_end_io_hook(page, cur, |
3307 | cur + iosize - 1, | |
3308 | NULL, 1); | |
c8b97818 CM |
3309 | else if (compressed) { |
3310 | /* we don't want to end_page_writeback on | |
3311 | * a compressed extent. this happens | |
3312 | * elsewhere | |
3313 | */ | |
3314 | nr++; | |
3315 | } | |
3316 | ||
3317 | cur += iosize; | |
7f3c74fb | 3318 | pg_offset += iosize; |
d1310b2e CM |
3319 | continue; |
3320 | } | |
c8b97818 | 3321 | |
d1310b2e CM |
3322 | if (tree->ops && tree->ops->writepage_io_hook) { |
3323 | ret = tree->ops->writepage_io_hook(page, cur, | |
3324 | cur + iosize - 1); | |
3325 | } else { | |
3326 | ret = 0; | |
3327 | } | |
1259ab75 | 3328 | if (ret) { |
d1310b2e | 3329 | SetPageError(page); |
1259ab75 | 3330 | } else { |
40f76580 | 3331 | unsigned long max_nr = (i_size >> PAGE_CACHE_SHIFT) + 1; |
7f3c74fb | 3332 | |
d1310b2e CM |
3333 | set_range_writeback(tree, cur, cur + iosize - 1); |
3334 | if (!PageWriteback(page)) { | |
efe120a0 FH |
3335 | btrfs_err(BTRFS_I(inode)->root->fs_info, |
3336 | "page %lu not writeback, cur %llu end %llu", | |
c1c9ff7c | 3337 | page->index, cur, end); |
d1310b2e CM |
3338 | } |
3339 | ||
ffbd517d CM |
3340 | ret = submit_extent_page(write_flags, tree, page, |
3341 | sector, iosize, pg_offset, | |
3342 | bdev, &epd->bio, max_nr, | |
c8b97818 CM |
3343 | end_bio_extent_writepage, |
3344 | 0, 0, 0); | |
d1310b2e CM |
3345 | if (ret) |
3346 | SetPageError(page); | |
3347 | } | |
3348 | cur = cur + iosize; | |
7f3c74fb | 3349 | pg_offset += iosize; |
d1310b2e CM |
3350 | nr++; |
3351 | } | |
40f76580 CM |
3352 | done: |
3353 | *nr_ret = nr; | |
3354 | ||
3355 | done_unlocked: | |
3356 | ||
3357 | /* drop our reference on any cached states */ | |
3358 | free_extent_state(cached_state); | |
3359 | return ret; | |
3360 | } | |
3361 | ||
3362 | /* | |
3363 | * the writepage semantics are similar to regular writepage. extent | |
3364 | * records are inserted to lock ranges in the tree, and as dirty areas | |
3365 | * are found, they are marked writeback. Then the lock bits are removed | |
3366 | * and the end_io handler clears the writeback ranges | |
3367 | */ | |
3368 | static int __extent_writepage(struct page *page, struct writeback_control *wbc, | |
3369 | void *data) | |
3370 | { | |
3371 | struct inode *inode = page->mapping->host; | |
3372 | struct extent_page_data *epd = data; | |
3373 | u64 start = page_offset(page); | |
3374 | u64 page_end = start + PAGE_CACHE_SIZE - 1; | |
3375 | int ret; | |
3376 | int nr = 0; | |
3377 | size_t pg_offset = 0; | |
3378 | loff_t i_size = i_size_read(inode); | |
3379 | unsigned long end_index = i_size >> PAGE_CACHE_SHIFT; | |
3380 | int write_flags; | |
3381 | unsigned long nr_written = 0; | |
3382 | ||
3383 | if (wbc->sync_mode == WB_SYNC_ALL) | |
3384 | write_flags = WRITE_SYNC; | |
3385 | else | |
3386 | write_flags = WRITE; | |
3387 | ||
3388 | trace___extent_writepage(page, inode, wbc); | |
3389 | ||
3390 | WARN_ON(!PageLocked(page)); | |
3391 | ||
3392 | ClearPageError(page); | |
3393 | ||
3394 | pg_offset = i_size & (PAGE_CACHE_SIZE - 1); | |
3395 | if (page->index > end_index || | |
3396 | (page->index == end_index && !pg_offset)) { | |
3397 | page->mapping->a_ops->invalidatepage(page, 0, PAGE_CACHE_SIZE); | |
3398 | unlock_page(page); | |
3399 | return 0; | |
3400 | } | |
3401 | ||
3402 | if (page->index == end_index) { | |
3403 | char *userpage; | |
3404 | ||
3405 | userpage = kmap_atomic(page); | |
3406 | memset(userpage + pg_offset, 0, | |
3407 | PAGE_CACHE_SIZE - pg_offset); | |
3408 | kunmap_atomic(userpage); | |
3409 | flush_dcache_page(page); | |
3410 | } | |
3411 | ||
3412 | pg_offset = 0; | |
3413 | ||
3414 | set_page_extent_mapped(page); | |
3415 | ||
3416 | ret = writepage_delalloc(inode, page, wbc, epd, start, &nr_written); | |
3417 | if (ret == 1) | |
3418 | goto done_unlocked; | |
3419 | if (ret) | |
3420 | goto done; | |
3421 | ||
3422 | ret = __extent_writepage_io(inode, page, wbc, epd, | |
3423 | i_size, nr_written, write_flags, &nr); | |
3424 | if (ret == 1) | |
3425 | goto done_unlocked; | |
3426 | ||
d1310b2e CM |
3427 | done: |
3428 | if (nr == 0) { | |
3429 | /* make sure the mapping tag for page dirty gets cleared */ | |
3430 | set_page_writeback(page); | |
3431 | end_page_writeback(page); | |
3432 | } | |
61391d56 FM |
3433 | if (PageError(page)) { |
3434 | ret = ret < 0 ? ret : -EIO; | |
3435 | end_extent_writepage(page, ret, start, page_end); | |
3436 | } | |
d1310b2e | 3437 | unlock_page(page); |
40f76580 | 3438 | return ret; |
771ed689 | 3439 | |
11c8349b | 3440 | done_unlocked: |
d1310b2e CM |
3441 | return 0; |
3442 | } | |
3443 | ||
fd8b2b61 | 3444 | void wait_on_extent_buffer_writeback(struct extent_buffer *eb) |
0b32f4bb | 3445 | { |
74316201 N |
3446 | wait_on_bit_io(&eb->bflags, EXTENT_BUFFER_WRITEBACK, |
3447 | TASK_UNINTERRUPTIBLE); | |
0b32f4bb JB |
3448 | } |
3449 | ||
0e378df1 CM |
3450 | static noinline_for_stack int |
3451 | lock_extent_buffer_for_io(struct extent_buffer *eb, | |
3452 | struct btrfs_fs_info *fs_info, | |
3453 | struct extent_page_data *epd) | |
0b32f4bb JB |
3454 | { |
3455 | unsigned long i, num_pages; | |
3456 | int flush = 0; | |
3457 | int ret = 0; | |
3458 | ||
3459 | if (!btrfs_try_tree_write_lock(eb)) { | |
3460 | flush = 1; | |
3461 | flush_write_bio(epd); | |
3462 | btrfs_tree_lock(eb); | |
3463 | } | |
3464 | ||
3465 | if (test_bit(EXTENT_BUFFER_WRITEBACK, &eb->bflags)) { | |
3466 | btrfs_tree_unlock(eb); | |
3467 | if (!epd->sync_io) | |
3468 | return 0; | |
3469 | if (!flush) { | |
3470 | flush_write_bio(epd); | |
3471 | flush = 1; | |
3472 | } | |
a098d8e8 CM |
3473 | while (1) { |
3474 | wait_on_extent_buffer_writeback(eb); | |
3475 | btrfs_tree_lock(eb); | |
3476 | if (!test_bit(EXTENT_BUFFER_WRITEBACK, &eb->bflags)) | |
3477 | break; | |
0b32f4bb | 3478 | btrfs_tree_unlock(eb); |
0b32f4bb JB |
3479 | } |
3480 | } | |
3481 | ||
51561ffe JB |
3482 | /* |
3483 | * We need to do this to prevent races in people who check if the eb is | |
3484 | * under IO since we can end up having no IO bits set for a short period | |
3485 | * of time. | |
3486 | */ | |
3487 | spin_lock(&eb->refs_lock); | |
0b32f4bb JB |
3488 | if (test_and_clear_bit(EXTENT_BUFFER_DIRTY, &eb->bflags)) { |
3489 | set_bit(EXTENT_BUFFER_WRITEBACK, &eb->bflags); | |
51561ffe | 3490 | spin_unlock(&eb->refs_lock); |
0b32f4bb | 3491 | btrfs_set_header_flag(eb, BTRFS_HEADER_FLAG_WRITTEN); |
e2d84521 MX |
3492 | __percpu_counter_add(&fs_info->dirty_metadata_bytes, |
3493 | -eb->len, | |
3494 | fs_info->dirty_metadata_batch); | |
0b32f4bb | 3495 | ret = 1; |
51561ffe JB |
3496 | } else { |
3497 | spin_unlock(&eb->refs_lock); | |
0b32f4bb JB |
3498 | } |
3499 | ||
3500 | btrfs_tree_unlock(eb); | |
3501 | ||
3502 | if (!ret) | |
3503 | return ret; | |
3504 | ||
3505 | num_pages = num_extent_pages(eb->start, eb->len); | |
3506 | for (i = 0; i < num_pages; i++) { | |
3507 | struct page *p = extent_buffer_page(eb, i); | |
3508 | ||
3509 | if (!trylock_page(p)) { | |
3510 | if (!flush) { | |
3511 | flush_write_bio(epd); | |
3512 | flush = 1; | |
3513 | } | |
3514 | lock_page(p); | |
3515 | } | |
3516 | } | |
3517 | ||
3518 | return ret; | |
3519 | } | |
3520 | ||
3521 | static void end_extent_buffer_writeback(struct extent_buffer *eb) | |
3522 | { | |
3523 | clear_bit(EXTENT_BUFFER_WRITEBACK, &eb->bflags); | |
4e857c58 | 3524 | smp_mb__after_atomic(); |
0b32f4bb JB |
3525 | wake_up_bit(&eb->bflags, EXTENT_BUFFER_WRITEBACK); |
3526 | } | |
3527 | ||
3528 | static void end_bio_extent_buffer_writepage(struct bio *bio, int err) | |
3529 | { | |
2c30c71b | 3530 | struct bio_vec *bvec; |
0b32f4bb | 3531 | struct extent_buffer *eb; |
2c30c71b | 3532 | int i, done; |
0b32f4bb | 3533 | |
2c30c71b | 3534 | bio_for_each_segment_all(bvec, bio, i) { |
0b32f4bb JB |
3535 | struct page *page = bvec->bv_page; |
3536 | ||
0b32f4bb JB |
3537 | eb = (struct extent_buffer *)page->private; |
3538 | BUG_ON(!eb); | |
3539 | done = atomic_dec_and_test(&eb->io_pages); | |
3540 | ||
2c30c71b | 3541 | if (err || test_bit(EXTENT_BUFFER_IOERR, &eb->bflags)) { |
0b32f4bb JB |
3542 | set_bit(EXTENT_BUFFER_IOERR, &eb->bflags); |
3543 | ClearPageUptodate(page); | |
3544 | SetPageError(page); | |
3545 | } | |
3546 | ||
3547 | end_page_writeback(page); | |
3548 | ||
3549 | if (!done) | |
3550 | continue; | |
3551 | ||
3552 | end_extent_buffer_writeback(eb); | |
2c30c71b | 3553 | } |
0b32f4bb JB |
3554 | |
3555 | bio_put(bio); | |
0b32f4bb JB |
3556 | } |
3557 | ||
0e378df1 | 3558 | static noinline_for_stack int write_one_eb(struct extent_buffer *eb, |
0b32f4bb JB |
3559 | struct btrfs_fs_info *fs_info, |
3560 | struct writeback_control *wbc, | |
3561 | struct extent_page_data *epd) | |
3562 | { | |
3563 | struct block_device *bdev = fs_info->fs_devices->latest_bdev; | |
f28491e0 | 3564 | struct extent_io_tree *tree = &BTRFS_I(fs_info->btree_inode)->io_tree; |
0b32f4bb JB |
3565 | u64 offset = eb->start; |
3566 | unsigned long i, num_pages; | |
de0022b9 | 3567 | unsigned long bio_flags = 0; |
d4c7ca86 | 3568 | int rw = (epd->sync_io ? WRITE_SYNC : WRITE) | REQ_META; |
d7dbe9e7 | 3569 | int ret = 0; |
0b32f4bb JB |
3570 | |
3571 | clear_bit(EXTENT_BUFFER_IOERR, &eb->bflags); | |
3572 | num_pages = num_extent_pages(eb->start, eb->len); | |
3573 | atomic_set(&eb->io_pages, num_pages); | |
de0022b9 JB |
3574 | if (btrfs_header_owner(eb) == BTRFS_TREE_LOG_OBJECTID) |
3575 | bio_flags = EXTENT_BIO_TREE_LOG; | |
3576 | ||
0b32f4bb JB |
3577 | for (i = 0; i < num_pages; i++) { |
3578 | struct page *p = extent_buffer_page(eb, i); | |
3579 | ||
3580 | clear_page_dirty_for_io(p); | |
3581 | set_page_writeback(p); | |
f28491e0 | 3582 | ret = submit_extent_page(rw, tree, p, offset >> 9, |
0b32f4bb JB |
3583 | PAGE_CACHE_SIZE, 0, bdev, &epd->bio, |
3584 | -1, end_bio_extent_buffer_writepage, | |
de0022b9 JB |
3585 | 0, epd->bio_flags, bio_flags); |
3586 | epd->bio_flags = bio_flags; | |
0b32f4bb JB |
3587 | if (ret) { |
3588 | set_bit(EXTENT_BUFFER_IOERR, &eb->bflags); | |
3589 | SetPageError(p); | |
3590 | if (atomic_sub_and_test(num_pages - i, &eb->io_pages)) | |
3591 | end_extent_buffer_writeback(eb); | |
3592 | ret = -EIO; | |
3593 | break; | |
3594 | } | |
3595 | offset += PAGE_CACHE_SIZE; | |
3596 | update_nr_written(p, wbc, 1); | |
3597 | unlock_page(p); | |
3598 | } | |
3599 | ||
3600 | if (unlikely(ret)) { | |
3601 | for (; i < num_pages; i++) { | |
3602 | struct page *p = extent_buffer_page(eb, i); | |
3603 | unlock_page(p); | |
3604 | } | |
3605 | } | |
3606 | ||
3607 | return ret; | |
3608 | } | |
3609 | ||
3610 | int btree_write_cache_pages(struct address_space *mapping, | |
3611 | struct writeback_control *wbc) | |
3612 | { | |
3613 | struct extent_io_tree *tree = &BTRFS_I(mapping->host)->io_tree; | |
3614 | struct btrfs_fs_info *fs_info = BTRFS_I(mapping->host)->root->fs_info; | |
3615 | struct extent_buffer *eb, *prev_eb = NULL; | |
3616 | struct extent_page_data epd = { | |
3617 | .bio = NULL, | |
3618 | .tree = tree, | |
3619 | .extent_locked = 0, | |
3620 | .sync_io = wbc->sync_mode == WB_SYNC_ALL, | |
de0022b9 | 3621 | .bio_flags = 0, |
0b32f4bb JB |
3622 | }; |
3623 | int ret = 0; | |
3624 | int done = 0; | |
3625 | int nr_to_write_done = 0; | |
3626 | struct pagevec pvec; | |
3627 | int nr_pages; | |
3628 | pgoff_t index; | |
3629 | pgoff_t end; /* Inclusive */ | |
3630 | int scanned = 0; | |
3631 | int tag; | |
3632 | ||
3633 | pagevec_init(&pvec, 0); | |
3634 | if (wbc->range_cyclic) { | |
3635 | index = mapping->writeback_index; /* Start from prev offset */ | |
3636 | end = -1; | |
3637 | } else { | |
3638 | index = wbc->range_start >> PAGE_CACHE_SHIFT; | |
3639 | end = wbc->range_end >> PAGE_CACHE_SHIFT; | |
3640 | scanned = 1; | |
3641 | } | |
3642 | if (wbc->sync_mode == WB_SYNC_ALL) | |
3643 | tag = PAGECACHE_TAG_TOWRITE; | |
3644 | else | |
3645 | tag = PAGECACHE_TAG_DIRTY; | |
3646 | retry: | |
3647 | if (wbc->sync_mode == WB_SYNC_ALL) | |
3648 | tag_pages_for_writeback(mapping, index, end); | |
3649 | while (!done && !nr_to_write_done && (index <= end) && | |
3650 | (nr_pages = pagevec_lookup_tag(&pvec, mapping, &index, tag, | |
3651 | min(end - index, (pgoff_t)PAGEVEC_SIZE-1) + 1))) { | |
3652 | unsigned i; | |
3653 | ||
3654 | scanned = 1; | |
3655 | for (i = 0; i < nr_pages; i++) { | |
3656 | struct page *page = pvec.pages[i]; | |
3657 | ||
3658 | if (!PagePrivate(page)) | |
3659 | continue; | |
3660 | ||
3661 | if (!wbc->range_cyclic && page->index > end) { | |
3662 | done = 1; | |
3663 | break; | |
3664 | } | |
3665 | ||
b5bae261 JB |
3666 | spin_lock(&mapping->private_lock); |
3667 | if (!PagePrivate(page)) { | |
3668 | spin_unlock(&mapping->private_lock); | |
3669 | continue; | |
3670 | } | |
3671 | ||
0b32f4bb | 3672 | eb = (struct extent_buffer *)page->private; |
b5bae261 JB |
3673 | |
3674 | /* | |
3675 | * Shouldn't happen and normally this would be a BUG_ON | |
3676 | * but no sense in crashing the users box for something | |
3677 | * we can survive anyway. | |
3678 | */ | |
fae7f21c | 3679 | if (WARN_ON(!eb)) { |
b5bae261 | 3680 | spin_unlock(&mapping->private_lock); |
0b32f4bb JB |
3681 | continue; |
3682 | } | |
3683 | ||
b5bae261 JB |
3684 | if (eb == prev_eb) { |
3685 | spin_unlock(&mapping->private_lock); | |
0b32f4bb | 3686 | continue; |
b5bae261 | 3687 | } |
0b32f4bb | 3688 | |
b5bae261 JB |
3689 | ret = atomic_inc_not_zero(&eb->refs); |
3690 | spin_unlock(&mapping->private_lock); | |
3691 | if (!ret) | |
0b32f4bb | 3692 | continue; |
0b32f4bb JB |
3693 | |
3694 | prev_eb = eb; | |
3695 | ret = lock_extent_buffer_for_io(eb, fs_info, &epd); | |
3696 | if (!ret) { | |
3697 | free_extent_buffer(eb); | |
3698 | continue; | |
3699 | } | |
3700 | ||
3701 | ret = write_one_eb(eb, fs_info, wbc, &epd); | |
3702 | if (ret) { | |
3703 | done = 1; | |
3704 | free_extent_buffer(eb); | |
3705 | break; | |
3706 | } | |
3707 | free_extent_buffer(eb); | |
3708 | ||
3709 | /* | |
3710 | * the filesystem may choose to bump up nr_to_write. | |
3711 | * We have to make sure to honor the new nr_to_write | |
3712 | * at any time | |
3713 | */ | |
3714 | nr_to_write_done = wbc->nr_to_write <= 0; | |
3715 | } | |
3716 | pagevec_release(&pvec); | |
3717 | cond_resched(); | |
3718 | } | |
3719 | if (!scanned && !done) { | |
3720 | /* | |
3721 | * We hit the last page and there is more work to be done: wrap | |
3722 | * back to the start of the file | |
3723 | */ | |
3724 | scanned = 1; | |
3725 | index = 0; | |
3726 | goto retry; | |
3727 | } | |
3728 | flush_write_bio(&epd); | |
3729 | return ret; | |
3730 | } | |
3731 | ||
d1310b2e | 3732 | /** |
4bef0848 | 3733 | * write_cache_pages - walk the list of dirty pages of the given address space and write all of them. |
d1310b2e CM |
3734 | * @mapping: address space structure to write |
3735 | * @wbc: subtract the number of written pages from *@wbc->nr_to_write | |
3736 | * @writepage: function called for each page | |
3737 | * @data: data passed to writepage function | |
3738 | * | |
3739 | * If a page is already under I/O, write_cache_pages() skips it, even | |
3740 | * if it's dirty. This is desirable behaviour for memory-cleaning writeback, | |
3741 | * but it is INCORRECT for data-integrity system calls such as fsync(). fsync() | |
3742 | * and msync() need to guarantee that all the data which was dirty at the time | |
3743 | * the call was made get new I/O started against them. If wbc->sync_mode is | |
3744 | * WB_SYNC_ALL then we were called for data integrity and we must wait for | |
3745 | * existing IO to complete. | |
3746 | */ | |
b2950863 | 3747 | static int extent_write_cache_pages(struct extent_io_tree *tree, |
4bef0848 CM |
3748 | struct address_space *mapping, |
3749 | struct writeback_control *wbc, | |
d2c3f4f6 CM |
3750 | writepage_t writepage, void *data, |
3751 | void (*flush_fn)(void *)) | |
d1310b2e | 3752 | { |
7fd1a3f7 | 3753 | struct inode *inode = mapping->host; |
d1310b2e CM |
3754 | int ret = 0; |
3755 | int done = 0; | |
61391d56 | 3756 | int err = 0; |
f85d7d6c | 3757 | int nr_to_write_done = 0; |
d1310b2e CM |
3758 | struct pagevec pvec; |
3759 | int nr_pages; | |
3760 | pgoff_t index; | |
3761 | pgoff_t end; /* Inclusive */ | |
3762 | int scanned = 0; | |
f7aaa06b | 3763 | int tag; |
d1310b2e | 3764 | |
7fd1a3f7 JB |
3765 | /* |
3766 | * We have to hold onto the inode so that ordered extents can do their | |
3767 | * work when the IO finishes. The alternative to this is failing to add | |
3768 | * an ordered extent if the igrab() fails there and that is a huge pain | |
3769 | * to deal with, so instead just hold onto the inode throughout the | |
3770 | * writepages operation. If it fails here we are freeing up the inode | |
3771 | * anyway and we'd rather not waste our time writing out stuff that is | |
3772 | * going to be truncated anyway. | |
3773 | */ | |
3774 | if (!igrab(inode)) | |
3775 | return 0; | |
3776 | ||
d1310b2e CM |
3777 | pagevec_init(&pvec, 0); |
3778 | if (wbc->range_cyclic) { | |
3779 | index = mapping->writeback_index; /* Start from prev offset */ | |
3780 | end = -1; | |
3781 | } else { | |
3782 | index = wbc->range_start >> PAGE_CACHE_SHIFT; | |
3783 | end = wbc->range_end >> PAGE_CACHE_SHIFT; | |
d1310b2e CM |
3784 | scanned = 1; |
3785 | } | |
f7aaa06b JB |
3786 | if (wbc->sync_mode == WB_SYNC_ALL) |
3787 | tag = PAGECACHE_TAG_TOWRITE; | |
3788 | else | |
3789 | tag = PAGECACHE_TAG_DIRTY; | |
d1310b2e | 3790 | retry: |
f7aaa06b JB |
3791 | if (wbc->sync_mode == WB_SYNC_ALL) |
3792 | tag_pages_for_writeback(mapping, index, end); | |
f85d7d6c | 3793 | while (!done && !nr_to_write_done && (index <= end) && |
f7aaa06b JB |
3794 | (nr_pages = pagevec_lookup_tag(&pvec, mapping, &index, tag, |
3795 | min(end - index, (pgoff_t)PAGEVEC_SIZE-1) + 1))) { | |
d1310b2e CM |
3796 | unsigned i; |
3797 | ||
3798 | scanned = 1; | |
3799 | for (i = 0; i < nr_pages; i++) { | |
3800 | struct page *page = pvec.pages[i]; | |
3801 | ||
3802 | /* | |
3803 | * At this point we hold neither mapping->tree_lock nor | |
3804 | * lock on the page itself: the page may be truncated or | |
3805 | * invalidated (changing page->mapping to NULL), or even | |
3806 | * swizzled back from swapper_space to tmpfs file | |
3807 | * mapping | |
3808 | */ | |
c8f2f24b JB |
3809 | if (!trylock_page(page)) { |
3810 | flush_fn(data); | |
3811 | lock_page(page); | |
01d658f2 | 3812 | } |
d1310b2e CM |
3813 | |
3814 | if (unlikely(page->mapping != mapping)) { | |
3815 | unlock_page(page); | |
3816 | continue; | |
3817 | } | |
3818 | ||
3819 | if (!wbc->range_cyclic && page->index > end) { | |
3820 | done = 1; | |
3821 | unlock_page(page); | |
3822 | continue; | |
3823 | } | |
3824 | ||
d2c3f4f6 | 3825 | if (wbc->sync_mode != WB_SYNC_NONE) { |
0e6bd956 CM |
3826 | if (PageWriteback(page)) |
3827 | flush_fn(data); | |
d1310b2e | 3828 | wait_on_page_writeback(page); |
d2c3f4f6 | 3829 | } |
d1310b2e CM |
3830 | |
3831 | if (PageWriteback(page) || | |
3832 | !clear_page_dirty_for_io(page)) { | |
3833 | unlock_page(page); | |
3834 | continue; | |
3835 | } | |
3836 | ||
3837 | ret = (*writepage)(page, wbc, data); | |
3838 | ||
3839 | if (unlikely(ret == AOP_WRITEPAGE_ACTIVATE)) { | |
3840 | unlock_page(page); | |
3841 | ret = 0; | |
3842 | } | |
61391d56 FM |
3843 | if (!err && ret < 0) |
3844 | err = ret; | |
f85d7d6c CM |
3845 | |
3846 | /* | |
3847 | * the filesystem may choose to bump up nr_to_write. | |
3848 | * We have to make sure to honor the new nr_to_write | |
3849 | * at any time | |
3850 | */ | |
3851 | nr_to_write_done = wbc->nr_to_write <= 0; | |
d1310b2e CM |
3852 | } |
3853 | pagevec_release(&pvec); | |
3854 | cond_resched(); | |
3855 | } | |
61391d56 | 3856 | if (!scanned && !done && !err) { |
d1310b2e CM |
3857 | /* |
3858 | * We hit the last page and there is more work to be done: wrap | |
3859 | * back to the start of the file | |
3860 | */ | |
3861 | scanned = 1; | |
3862 | index = 0; | |
3863 | goto retry; | |
3864 | } | |
7fd1a3f7 | 3865 | btrfs_add_delayed_iput(inode); |
61391d56 | 3866 | return err; |
d1310b2e | 3867 | } |
d1310b2e | 3868 | |
ffbd517d | 3869 | static void flush_epd_write_bio(struct extent_page_data *epd) |
d2c3f4f6 | 3870 | { |
d2c3f4f6 | 3871 | if (epd->bio) { |
355808c2 JM |
3872 | int rw = WRITE; |
3873 | int ret; | |
3874 | ||
ffbd517d | 3875 | if (epd->sync_io) |
355808c2 JM |
3876 | rw = WRITE_SYNC; |
3877 | ||
de0022b9 | 3878 | ret = submit_one_bio(rw, epd->bio, 0, epd->bio_flags); |
79787eaa | 3879 | BUG_ON(ret < 0); /* -ENOMEM */ |
d2c3f4f6 CM |
3880 | epd->bio = NULL; |
3881 | } | |
3882 | } | |
3883 | ||
ffbd517d CM |
3884 | static noinline void flush_write_bio(void *data) |
3885 | { | |
3886 | struct extent_page_data *epd = data; | |
3887 | flush_epd_write_bio(epd); | |
3888 | } | |
3889 | ||
d1310b2e CM |
3890 | int extent_write_full_page(struct extent_io_tree *tree, struct page *page, |
3891 | get_extent_t *get_extent, | |
3892 | struct writeback_control *wbc) | |
3893 | { | |
3894 | int ret; | |
d1310b2e CM |
3895 | struct extent_page_data epd = { |
3896 | .bio = NULL, | |
3897 | .tree = tree, | |
3898 | .get_extent = get_extent, | |
771ed689 | 3899 | .extent_locked = 0, |
ffbd517d | 3900 | .sync_io = wbc->sync_mode == WB_SYNC_ALL, |
de0022b9 | 3901 | .bio_flags = 0, |
d1310b2e | 3902 | }; |
d1310b2e | 3903 | |
d1310b2e CM |
3904 | ret = __extent_writepage(page, wbc, &epd); |
3905 | ||
ffbd517d | 3906 | flush_epd_write_bio(&epd); |
d1310b2e CM |
3907 | return ret; |
3908 | } | |
d1310b2e | 3909 | |
771ed689 CM |
3910 | int extent_write_locked_range(struct extent_io_tree *tree, struct inode *inode, |
3911 | u64 start, u64 end, get_extent_t *get_extent, | |
3912 | int mode) | |
3913 | { | |
3914 | int ret = 0; | |
3915 | struct address_space *mapping = inode->i_mapping; | |
3916 | struct page *page; | |
3917 | unsigned long nr_pages = (end - start + PAGE_CACHE_SIZE) >> | |
3918 | PAGE_CACHE_SHIFT; | |
3919 | ||
3920 | struct extent_page_data epd = { | |
3921 | .bio = NULL, | |
3922 | .tree = tree, | |
3923 | .get_extent = get_extent, | |
3924 | .extent_locked = 1, | |
ffbd517d | 3925 | .sync_io = mode == WB_SYNC_ALL, |
de0022b9 | 3926 | .bio_flags = 0, |
771ed689 CM |
3927 | }; |
3928 | struct writeback_control wbc_writepages = { | |
771ed689 | 3929 | .sync_mode = mode, |
771ed689 CM |
3930 | .nr_to_write = nr_pages * 2, |
3931 | .range_start = start, | |
3932 | .range_end = end + 1, | |
3933 | }; | |
3934 | ||
d397712b | 3935 | while (start <= end) { |
771ed689 CM |
3936 | page = find_get_page(mapping, start >> PAGE_CACHE_SHIFT); |
3937 | if (clear_page_dirty_for_io(page)) | |
3938 | ret = __extent_writepage(page, &wbc_writepages, &epd); | |
3939 | else { | |
3940 | if (tree->ops && tree->ops->writepage_end_io_hook) | |
3941 | tree->ops->writepage_end_io_hook(page, start, | |
3942 | start + PAGE_CACHE_SIZE - 1, | |
3943 | NULL, 1); | |
3944 | unlock_page(page); | |
3945 | } | |
3946 | page_cache_release(page); | |
3947 | start += PAGE_CACHE_SIZE; | |
3948 | } | |
3949 | ||
ffbd517d | 3950 | flush_epd_write_bio(&epd); |
771ed689 CM |
3951 | return ret; |
3952 | } | |
d1310b2e CM |
3953 | |
3954 | int extent_writepages(struct extent_io_tree *tree, | |
3955 | struct address_space *mapping, | |
3956 | get_extent_t *get_extent, | |
3957 | struct writeback_control *wbc) | |
3958 | { | |
3959 | int ret = 0; | |
3960 | struct extent_page_data epd = { | |
3961 | .bio = NULL, | |
3962 | .tree = tree, | |
3963 | .get_extent = get_extent, | |
771ed689 | 3964 | .extent_locked = 0, |
ffbd517d | 3965 | .sync_io = wbc->sync_mode == WB_SYNC_ALL, |
de0022b9 | 3966 | .bio_flags = 0, |
d1310b2e CM |
3967 | }; |
3968 | ||
4bef0848 | 3969 | ret = extent_write_cache_pages(tree, mapping, wbc, |
d2c3f4f6 CM |
3970 | __extent_writepage, &epd, |
3971 | flush_write_bio); | |
ffbd517d | 3972 | flush_epd_write_bio(&epd); |
d1310b2e CM |
3973 | return ret; |
3974 | } | |
d1310b2e CM |
3975 | |
3976 | int extent_readpages(struct extent_io_tree *tree, | |
3977 | struct address_space *mapping, | |
3978 | struct list_head *pages, unsigned nr_pages, | |
3979 | get_extent_t get_extent) | |
3980 | { | |
3981 | struct bio *bio = NULL; | |
3982 | unsigned page_idx; | |
c8b97818 | 3983 | unsigned long bio_flags = 0; |
67c9684f LB |
3984 | struct page *pagepool[16]; |
3985 | struct page *page; | |
125bac01 | 3986 | struct extent_map *em_cached = NULL; |
67c9684f | 3987 | int nr = 0; |
d1310b2e | 3988 | |
d1310b2e | 3989 | for (page_idx = 0; page_idx < nr_pages; page_idx++) { |
67c9684f | 3990 | page = list_entry(pages->prev, struct page, lru); |
d1310b2e CM |
3991 | |
3992 | prefetchw(&page->flags); | |
3993 | list_del(&page->lru); | |
67c9684f | 3994 | if (add_to_page_cache_lru(page, mapping, |
43e817a1 | 3995 | page->index, GFP_NOFS)) { |
67c9684f LB |
3996 | page_cache_release(page); |
3997 | continue; | |
d1310b2e | 3998 | } |
67c9684f LB |
3999 | |
4000 | pagepool[nr++] = page; | |
4001 | if (nr < ARRAY_SIZE(pagepool)) | |
4002 | continue; | |
125bac01 | 4003 | __extent_readpages(tree, pagepool, nr, get_extent, &em_cached, |
9974090b | 4004 | &bio, 0, &bio_flags, READ); |
67c9684f | 4005 | nr = 0; |
d1310b2e | 4006 | } |
9974090b | 4007 | if (nr) |
125bac01 | 4008 | __extent_readpages(tree, pagepool, nr, get_extent, &em_cached, |
9974090b | 4009 | &bio, 0, &bio_flags, READ); |
67c9684f | 4010 | |
125bac01 MX |
4011 | if (em_cached) |
4012 | free_extent_map(em_cached); | |
4013 | ||
d1310b2e CM |
4014 | BUG_ON(!list_empty(pages)); |
4015 | if (bio) | |
79787eaa | 4016 | return submit_one_bio(READ, bio, 0, bio_flags); |
d1310b2e CM |
4017 | return 0; |
4018 | } | |
d1310b2e CM |
4019 | |
4020 | /* | |
4021 | * basic invalidatepage code, this waits on any locked or writeback | |
4022 | * ranges corresponding to the page, and then deletes any extent state | |
4023 | * records from the tree | |
4024 | */ | |
4025 | int extent_invalidatepage(struct extent_io_tree *tree, | |
4026 | struct page *page, unsigned long offset) | |
4027 | { | |
2ac55d41 | 4028 | struct extent_state *cached_state = NULL; |
4eee4fa4 | 4029 | u64 start = page_offset(page); |
d1310b2e CM |
4030 | u64 end = start + PAGE_CACHE_SIZE - 1; |
4031 | size_t blocksize = page->mapping->host->i_sb->s_blocksize; | |
4032 | ||
fda2832f | 4033 | start += ALIGN(offset, blocksize); |
d1310b2e CM |
4034 | if (start > end) |
4035 | return 0; | |
4036 | ||
d0082371 | 4037 | lock_extent_bits(tree, start, end, 0, &cached_state); |
1edbb734 | 4038 | wait_on_page_writeback(page); |
d1310b2e | 4039 | clear_extent_bit(tree, start, end, |
32c00aff JB |
4040 | EXTENT_LOCKED | EXTENT_DIRTY | EXTENT_DELALLOC | |
4041 | EXTENT_DO_ACCOUNTING, | |
2ac55d41 | 4042 | 1, 1, &cached_state, GFP_NOFS); |
d1310b2e CM |
4043 | return 0; |
4044 | } | |
d1310b2e | 4045 | |
7b13b7b1 CM |
4046 | /* |
4047 | * a helper for releasepage, this tests for areas of the page that | |
4048 | * are locked or under IO and drops the related state bits if it is safe | |
4049 | * to drop the page. | |
4050 | */ | |
48a3b636 ES |
4051 | static int try_release_extent_state(struct extent_map_tree *map, |
4052 | struct extent_io_tree *tree, | |
4053 | struct page *page, gfp_t mask) | |
7b13b7b1 | 4054 | { |
4eee4fa4 | 4055 | u64 start = page_offset(page); |
7b13b7b1 CM |
4056 | u64 end = start + PAGE_CACHE_SIZE - 1; |
4057 | int ret = 1; | |
4058 | ||
211f90e6 | 4059 | if (test_range_bit(tree, start, end, |
8b62b72b | 4060 | EXTENT_IOBITS, 0, NULL)) |
7b13b7b1 CM |
4061 | ret = 0; |
4062 | else { | |
4063 | if ((mask & GFP_NOFS) == GFP_NOFS) | |
4064 | mask = GFP_NOFS; | |
11ef160f CM |
4065 | /* |
4066 | * at this point we can safely clear everything except the | |
4067 | * locked bit and the nodatasum bit | |
4068 | */ | |
e3f24cc5 | 4069 | ret = clear_extent_bit(tree, start, end, |
11ef160f CM |
4070 | ~(EXTENT_LOCKED | EXTENT_NODATASUM), |
4071 | 0, 0, NULL, mask); | |
e3f24cc5 CM |
4072 | |
4073 | /* if clear_extent_bit failed for enomem reasons, | |
4074 | * we can't allow the release to continue. | |
4075 | */ | |
4076 | if (ret < 0) | |
4077 | ret = 0; | |
4078 | else | |
4079 | ret = 1; | |
7b13b7b1 CM |
4080 | } |
4081 | return ret; | |
4082 | } | |
7b13b7b1 | 4083 | |
d1310b2e CM |
4084 | /* |
4085 | * a helper for releasepage. As long as there are no locked extents | |
4086 | * in the range corresponding to the page, both state records and extent | |
4087 | * map records are removed | |
4088 | */ | |
4089 | int try_release_extent_mapping(struct extent_map_tree *map, | |
70dec807 CM |
4090 | struct extent_io_tree *tree, struct page *page, |
4091 | gfp_t mask) | |
d1310b2e CM |
4092 | { |
4093 | struct extent_map *em; | |
4eee4fa4 | 4094 | u64 start = page_offset(page); |
d1310b2e | 4095 | u64 end = start + PAGE_CACHE_SIZE - 1; |
7b13b7b1 | 4096 | |
70dec807 CM |
4097 | if ((mask & __GFP_WAIT) && |
4098 | page->mapping->host->i_size > 16 * 1024 * 1024) { | |
39b5637f | 4099 | u64 len; |
70dec807 | 4100 | while (start <= end) { |
39b5637f | 4101 | len = end - start + 1; |
890871be | 4102 | write_lock(&map->lock); |
39b5637f | 4103 | em = lookup_extent_mapping(map, start, len); |
285190d9 | 4104 | if (!em) { |
890871be | 4105 | write_unlock(&map->lock); |
70dec807 CM |
4106 | break; |
4107 | } | |
7f3c74fb CM |
4108 | if (test_bit(EXTENT_FLAG_PINNED, &em->flags) || |
4109 | em->start != start) { | |
890871be | 4110 | write_unlock(&map->lock); |
70dec807 CM |
4111 | free_extent_map(em); |
4112 | break; | |
4113 | } | |
4114 | if (!test_range_bit(tree, em->start, | |
4115 | extent_map_end(em) - 1, | |
8b62b72b | 4116 | EXTENT_LOCKED | EXTENT_WRITEBACK, |
9655d298 | 4117 | 0, NULL)) { |
70dec807 CM |
4118 | remove_extent_mapping(map, em); |
4119 | /* once for the rb tree */ | |
4120 | free_extent_map(em); | |
4121 | } | |
4122 | start = extent_map_end(em); | |
890871be | 4123 | write_unlock(&map->lock); |
70dec807 CM |
4124 | |
4125 | /* once for us */ | |
d1310b2e CM |
4126 | free_extent_map(em); |
4127 | } | |
d1310b2e | 4128 | } |
7b13b7b1 | 4129 | return try_release_extent_state(map, tree, page, mask); |
d1310b2e | 4130 | } |
d1310b2e | 4131 | |
ec29ed5b CM |
4132 | /* |
4133 | * helper function for fiemap, which doesn't want to see any holes. | |
4134 | * This maps until we find something past 'last' | |
4135 | */ | |
4136 | static struct extent_map *get_extent_skip_holes(struct inode *inode, | |
4137 | u64 offset, | |
4138 | u64 last, | |
4139 | get_extent_t *get_extent) | |
4140 | { | |
4141 | u64 sectorsize = BTRFS_I(inode)->root->sectorsize; | |
4142 | struct extent_map *em; | |
4143 | u64 len; | |
4144 | ||
4145 | if (offset >= last) | |
4146 | return NULL; | |
4147 | ||
67871254 | 4148 | while (1) { |
ec29ed5b CM |
4149 | len = last - offset; |
4150 | if (len == 0) | |
4151 | break; | |
fda2832f | 4152 | len = ALIGN(len, sectorsize); |
ec29ed5b | 4153 | em = get_extent(inode, NULL, 0, offset, len, 0); |
c704005d | 4154 | if (IS_ERR_OR_NULL(em)) |
ec29ed5b CM |
4155 | return em; |
4156 | ||
4157 | /* if this isn't a hole return it */ | |
4158 | if (!test_bit(EXTENT_FLAG_VACANCY, &em->flags) && | |
4159 | em->block_start != EXTENT_MAP_HOLE) { | |
4160 | return em; | |
4161 | } | |
4162 | ||
4163 | /* this is a hole, advance to the next extent */ | |
4164 | offset = extent_map_end(em); | |
4165 | free_extent_map(em); | |
4166 | if (offset >= last) | |
4167 | break; | |
4168 | } | |
4169 | return NULL; | |
4170 | } | |
4171 | ||
1506fcc8 YS |
4172 | int extent_fiemap(struct inode *inode, struct fiemap_extent_info *fieinfo, |
4173 | __u64 start, __u64 len, get_extent_t *get_extent) | |
4174 | { | |
975f84fe | 4175 | int ret = 0; |
1506fcc8 YS |
4176 | u64 off = start; |
4177 | u64 max = start + len; | |
4178 | u32 flags = 0; | |
975f84fe JB |
4179 | u32 found_type; |
4180 | u64 last; | |
ec29ed5b | 4181 | u64 last_for_get_extent = 0; |
1506fcc8 | 4182 | u64 disko = 0; |
ec29ed5b | 4183 | u64 isize = i_size_read(inode); |
975f84fe | 4184 | struct btrfs_key found_key; |
1506fcc8 | 4185 | struct extent_map *em = NULL; |
2ac55d41 | 4186 | struct extent_state *cached_state = NULL; |
975f84fe | 4187 | struct btrfs_path *path; |
dc046b10 | 4188 | struct btrfs_root *root = BTRFS_I(inode)->root; |
1506fcc8 | 4189 | int end = 0; |
ec29ed5b CM |
4190 | u64 em_start = 0; |
4191 | u64 em_len = 0; | |
4192 | u64 em_end = 0; | |
1506fcc8 YS |
4193 | |
4194 | if (len == 0) | |
4195 | return -EINVAL; | |
4196 | ||
975f84fe JB |
4197 | path = btrfs_alloc_path(); |
4198 | if (!path) | |
4199 | return -ENOMEM; | |
4200 | path->leave_spinning = 1; | |
4201 | ||
2c91943b QW |
4202 | start = round_down(start, BTRFS_I(inode)->root->sectorsize); |
4203 | len = round_up(max, BTRFS_I(inode)->root->sectorsize) - start; | |
4d479cf0 | 4204 | |
ec29ed5b CM |
4205 | /* |
4206 | * lookup the last file extent. We're not using i_size here | |
4207 | * because there might be preallocation past i_size | |
4208 | */ | |
dc046b10 JB |
4209 | ret = btrfs_lookup_file_extent(NULL, root, path, btrfs_ino(inode), -1, |
4210 | 0); | |
975f84fe JB |
4211 | if (ret < 0) { |
4212 | btrfs_free_path(path); | |
4213 | return ret; | |
4214 | } | |
4215 | WARN_ON(!ret); | |
4216 | path->slots[0]--; | |
975f84fe | 4217 | btrfs_item_key_to_cpu(path->nodes[0], &found_key, path->slots[0]); |
962a298f | 4218 | found_type = found_key.type; |
975f84fe | 4219 | |
ec29ed5b | 4220 | /* No extents, but there might be delalloc bits */ |
33345d01 | 4221 | if (found_key.objectid != btrfs_ino(inode) || |
975f84fe | 4222 | found_type != BTRFS_EXTENT_DATA_KEY) { |
ec29ed5b CM |
4223 | /* have to trust i_size as the end */ |
4224 | last = (u64)-1; | |
4225 | last_for_get_extent = isize; | |
4226 | } else { | |
4227 | /* | |
4228 | * remember the start of the last extent. There are a | |
4229 | * bunch of different factors that go into the length of the | |
4230 | * extent, so its much less complex to remember where it started | |
4231 | */ | |
4232 | last = found_key.offset; | |
4233 | last_for_get_extent = last + 1; | |
975f84fe | 4234 | } |
fe09e16c | 4235 | btrfs_release_path(path); |
975f84fe | 4236 | |
ec29ed5b CM |
4237 | /* |
4238 | * we might have some extents allocated but more delalloc past those | |
4239 | * extents. so, we trust isize unless the start of the last extent is | |
4240 | * beyond isize | |
4241 | */ | |
4242 | if (last < isize) { | |
4243 | last = (u64)-1; | |
4244 | last_for_get_extent = isize; | |
4245 | } | |
4246 | ||
a52f4cd2 | 4247 | lock_extent_bits(&BTRFS_I(inode)->io_tree, start, start + len - 1, 0, |
d0082371 | 4248 | &cached_state); |
ec29ed5b | 4249 | |
4d479cf0 | 4250 | em = get_extent_skip_holes(inode, start, last_for_get_extent, |
ec29ed5b | 4251 | get_extent); |
1506fcc8 YS |
4252 | if (!em) |
4253 | goto out; | |
4254 | if (IS_ERR(em)) { | |
4255 | ret = PTR_ERR(em); | |
4256 | goto out; | |
4257 | } | |
975f84fe | 4258 | |
1506fcc8 | 4259 | while (!end) { |
b76bb701 | 4260 | u64 offset_in_extent = 0; |
ea8efc74 CM |
4261 | |
4262 | /* break if the extent we found is outside the range */ | |
4263 | if (em->start >= max || extent_map_end(em) < off) | |
4264 | break; | |
4265 | ||
4266 | /* | |
4267 | * get_extent may return an extent that starts before our | |
4268 | * requested range. We have to make sure the ranges | |
4269 | * we return to fiemap always move forward and don't | |
4270 | * overlap, so adjust the offsets here | |
4271 | */ | |
4272 | em_start = max(em->start, off); | |
1506fcc8 | 4273 | |
ea8efc74 CM |
4274 | /* |
4275 | * record the offset from the start of the extent | |
b76bb701 JB |
4276 | * for adjusting the disk offset below. Only do this if the |
4277 | * extent isn't compressed since our in ram offset may be past | |
4278 | * what we have actually allocated on disk. | |
ea8efc74 | 4279 | */ |
b76bb701 JB |
4280 | if (!test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) |
4281 | offset_in_extent = em_start - em->start; | |
ec29ed5b | 4282 | em_end = extent_map_end(em); |
ea8efc74 | 4283 | em_len = em_end - em_start; |
1506fcc8 YS |
4284 | disko = 0; |
4285 | flags = 0; | |
4286 | ||
ea8efc74 CM |
4287 | /* |
4288 | * bump off for our next call to get_extent | |
4289 | */ | |
4290 | off = extent_map_end(em); | |
4291 | if (off >= max) | |
4292 | end = 1; | |
4293 | ||
93dbfad7 | 4294 | if (em->block_start == EXTENT_MAP_LAST_BYTE) { |
1506fcc8 YS |
4295 | end = 1; |
4296 | flags |= FIEMAP_EXTENT_LAST; | |
93dbfad7 | 4297 | } else if (em->block_start == EXTENT_MAP_INLINE) { |
1506fcc8 YS |
4298 | flags |= (FIEMAP_EXTENT_DATA_INLINE | |
4299 | FIEMAP_EXTENT_NOT_ALIGNED); | |
93dbfad7 | 4300 | } else if (em->block_start == EXTENT_MAP_DELALLOC) { |
1506fcc8 YS |
4301 | flags |= (FIEMAP_EXTENT_DELALLOC | |
4302 | FIEMAP_EXTENT_UNKNOWN); | |
dc046b10 JB |
4303 | } else if (fieinfo->fi_extents_max) { |
4304 | u64 bytenr = em->block_start - | |
4305 | (em->start - em->orig_start); | |
fe09e16c | 4306 | |
ea8efc74 | 4307 | disko = em->block_start + offset_in_extent; |
fe09e16c LB |
4308 | |
4309 | /* | |
4310 | * As btrfs supports shared space, this information | |
4311 | * can be exported to userspace tools via | |
dc046b10 JB |
4312 | * flag FIEMAP_EXTENT_SHARED. If fi_extents_max == 0 |
4313 | * then we're just getting a count and we can skip the | |
4314 | * lookup stuff. | |
fe09e16c | 4315 | */ |
dc046b10 JB |
4316 | ret = btrfs_check_shared(NULL, root->fs_info, |
4317 | root->objectid, | |
4318 | btrfs_ino(inode), bytenr); | |
4319 | if (ret < 0) | |
fe09e16c | 4320 | goto out_free; |
dc046b10 | 4321 | if (ret) |
fe09e16c | 4322 | flags |= FIEMAP_EXTENT_SHARED; |
dc046b10 | 4323 | ret = 0; |
1506fcc8 YS |
4324 | } |
4325 | if (test_bit(EXTENT_FLAG_COMPRESSED, &em->flags)) | |
4326 | flags |= FIEMAP_EXTENT_ENCODED; | |
4327 | ||
1506fcc8 YS |
4328 | free_extent_map(em); |
4329 | em = NULL; | |
ec29ed5b CM |
4330 | if ((em_start >= last) || em_len == (u64)-1 || |
4331 | (last == (u64)-1 && isize <= em_end)) { | |
1506fcc8 YS |
4332 | flags |= FIEMAP_EXTENT_LAST; |
4333 | end = 1; | |
4334 | } | |
4335 | ||
ec29ed5b CM |
4336 | /* now scan forward to see if this is really the last extent. */ |
4337 | em = get_extent_skip_holes(inode, off, last_for_get_extent, | |
4338 | get_extent); | |
4339 | if (IS_ERR(em)) { | |
4340 | ret = PTR_ERR(em); | |
4341 | goto out; | |
4342 | } | |
4343 | if (!em) { | |
975f84fe JB |
4344 | flags |= FIEMAP_EXTENT_LAST; |
4345 | end = 1; | |
4346 | } | |
ec29ed5b CM |
4347 | ret = fiemap_fill_next_extent(fieinfo, em_start, disko, |
4348 | em_len, flags); | |
4349 | if (ret) | |
4350 | goto out_free; | |
1506fcc8 YS |
4351 | } |
4352 | out_free: | |
4353 | free_extent_map(em); | |
4354 | out: | |
fe09e16c | 4355 | btrfs_free_path(path); |
a52f4cd2 | 4356 | unlock_extent_cached(&BTRFS_I(inode)->io_tree, start, start + len - 1, |
2ac55d41 | 4357 | &cached_state, GFP_NOFS); |
1506fcc8 YS |
4358 | return ret; |
4359 | } | |
4360 | ||
727011e0 CM |
4361 | static void __free_extent_buffer(struct extent_buffer *eb) |
4362 | { | |
6d49ba1b | 4363 | btrfs_leak_debug_del(&eb->leak_list); |
727011e0 CM |
4364 | kmem_cache_free(extent_buffer_cache, eb); |
4365 | } | |
4366 | ||
a26e8c9f | 4367 | int extent_buffer_under_io(struct extent_buffer *eb) |
db7f3436 JB |
4368 | { |
4369 | return (atomic_read(&eb->io_pages) || | |
4370 | test_bit(EXTENT_BUFFER_WRITEBACK, &eb->bflags) || | |
4371 | test_bit(EXTENT_BUFFER_DIRTY, &eb->bflags)); | |
4372 | } | |
4373 | ||
4374 | /* | |
4375 | * Helper for releasing extent buffer page. | |
4376 | */ | |
4377 | static void btrfs_release_extent_buffer_page(struct extent_buffer *eb, | |
4378 | unsigned long start_idx) | |
4379 | { | |
4380 | unsigned long index; | |
4381 | unsigned long num_pages; | |
4382 | struct page *page; | |
4383 | int mapped = !test_bit(EXTENT_BUFFER_DUMMY, &eb->bflags); | |
4384 | ||
4385 | BUG_ON(extent_buffer_under_io(eb)); | |
4386 | ||
4387 | num_pages = num_extent_pages(eb->start, eb->len); | |
4388 | index = start_idx + num_pages; | |
4389 | if (start_idx >= index) | |
4390 | return; | |
4391 | ||
4392 | do { | |
4393 | index--; | |
4394 | page = extent_buffer_page(eb, index); | |
4395 | if (page && mapped) { | |
4396 | spin_lock(&page->mapping->private_lock); | |
4397 | /* | |
4398 | * We do this since we'll remove the pages after we've | |
4399 | * removed the eb from the radix tree, so we could race | |
4400 | * and have this page now attached to the new eb. So | |
4401 | * only clear page_private if it's still connected to | |
4402 | * this eb. | |
4403 | */ | |
4404 | if (PagePrivate(page) && | |
4405 | page->private == (unsigned long)eb) { | |
4406 | BUG_ON(test_bit(EXTENT_BUFFER_DIRTY, &eb->bflags)); | |
4407 | BUG_ON(PageDirty(page)); | |
4408 | BUG_ON(PageWriteback(page)); | |
4409 | /* | |
4410 | * We need to make sure we haven't be attached | |
4411 | * to a new eb. | |
4412 | */ | |
4413 | ClearPagePrivate(page); | |
4414 | set_page_private(page, 0); | |
4415 | /* One for the page private */ | |
4416 | page_cache_release(page); | |
4417 | } | |
4418 | spin_unlock(&page->mapping->private_lock); | |
4419 | ||
4420 | } | |
4421 | if (page) { | |
4422 | /* One for when we alloced the page */ | |
4423 | page_cache_release(page); | |
4424 | } | |
4425 | } while (index != start_idx); | |
4426 | } | |
4427 | ||
4428 | /* | |
4429 | * Helper for releasing the extent buffer. | |
4430 | */ | |
4431 | static inline void btrfs_release_extent_buffer(struct extent_buffer *eb) | |
4432 | { | |
4433 | btrfs_release_extent_buffer_page(eb, 0); | |
4434 | __free_extent_buffer(eb); | |
4435 | } | |
4436 | ||
f28491e0 JB |
4437 | static struct extent_buffer * |
4438 | __alloc_extent_buffer(struct btrfs_fs_info *fs_info, u64 start, | |
4439 | unsigned long len, gfp_t mask) | |
d1310b2e CM |
4440 | { |
4441 | struct extent_buffer *eb = NULL; | |
4442 | ||
d1310b2e | 4443 | eb = kmem_cache_zalloc(extent_buffer_cache, mask); |
91ca338d TI |
4444 | if (eb == NULL) |
4445 | return NULL; | |
d1310b2e CM |
4446 | eb->start = start; |
4447 | eb->len = len; | |
f28491e0 | 4448 | eb->fs_info = fs_info; |
815a51c7 | 4449 | eb->bflags = 0; |
bd681513 CM |
4450 | rwlock_init(&eb->lock); |
4451 | atomic_set(&eb->write_locks, 0); | |
4452 | atomic_set(&eb->read_locks, 0); | |
4453 | atomic_set(&eb->blocking_readers, 0); | |
4454 | atomic_set(&eb->blocking_writers, 0); | |
4455 | atomic_set(&eb->spinning_readers, 0); | |
4456 | atomic_set(&eb->spinning_writers, 0); | |
5b25f70f | 4457 | eb->lock_nested = 0; |
bd681513 CM |
4458 | init_waitqueue_head(&eb->write_lock_wq); |
4459 | init_waitqueue_head(&eb->read_lock_wq); | |
b4ce94de | 4460 | |
6d49ba1b ES |
4461 | btrfs_leak_debug_add(&eb->leak_list, &buffers); |
4462 | ||
3083ee2e | 4463 | spin_lock_init(&eb->refs_lock); |
d1310b2e | 4464 | atomic_set(&eb->refs, 1); |
0b32f4bb | 4465 | atomic_set(&eb->io_pages, 0); |
727011e0 | 4466 | |
b8dae313 DS |
4467 | /* |
4468 | * Sanity checks, currently the maximum is 64k covered by 16x 4k pages | |
4469 | */ | |
4470 | BUILD_BUG_ON(BTRFS_MAX_METADATA_BLOCKSIZE | |
4471 | > MAX_INLINE_EXTENT_BUFFER_SIZE); | |
4472 | BUG_ON(len > MAX_INLINE_EXTENT_BUFFER_SIZE); | |
d1310b2e CM |
4473 | |
4474 | return eb; | |
4475 | } | |
4476 | ||
815a51c7 JS |
4477 | struct extent_buffer *btrfs_clone_extent_buffer(struct extent_buffer *src) |
4478 | { | |
4479 | unsigned long i; | |
4480 | struct page *p; | |
4481 | struct extent_buffer *new; | |
4482 | unsigned long num_pages = num_extent_pages(src->start, src->len); | |
4483 | ||
9ec72677 | 4484 | new = __alloc_extent_buffer(NULL, src->start, src->len, GFP_NOFS); |
815a51c7 JS |
4485 | if (new == NULL) |
4486 | return NULL; | |
4487 | ||
4488 | for (i = 0; i < num_pages; i++) { | |
9ec72677 | 4489 | p = alloc_page(GFP_NOFS); |
db7f3436 JB |
4490 | if (!p) { |
4491 | btrfs_release_extent_buffer(new); | |
4492 | return NULL; | |
4493 | } | |
815a51c7 JS |
4494 | attach_extent_buffer_page(new, p); |
4495 | WARN_ON(PageDirty(p)); | |
4496 | SetPageUptodate(p); | |
4497 | new->pages[i] = p; | |
4498 | } | |
4499 | ||
4500 | copy_extent_buffer(new, src, 0, 0, src->len); | |
4501 | set_bit(EXTENT_BUFFER_UPTODATE, &new->bflags); | |
4502 | set_bit(EXTENT_BUFFER_DUMMY, &new->bflags); | |
4503 | ||
4504 | return new; | |
4505 | } | |
4506 | ||
4507 | struct extent_buffer *alloc_dummy_extent_buffer(u64 start, unsigned long len) | |
4508 | { | |
4509 | struct extent_buffer *eb; | |
4510 | unsigned long num_pages = num_extent_pages(0, len); | |
4511 | unsigned long i; | |
4512 | ||
9ec72677 | 4513 | eb = __alloc_extent_buffer(NULL, start, len, GFP_NOFS); |
815a51c7 JS |
4514 | if (!eb) |
4515 | return NULL; | |
4516 | ||
4517 | for (i = 0; i < num_pages; i++) { | |
9ec72677 | 4518 | eb->pages[i] = alloc_page(GFP_NOFS); |
815a51c7 JS |
4519 | if (!eb->pages[i]) |
4520 | goto err; | |
4521 | } | |
4522 | set_extent_buffer_uptodate(eb); | |
4523 | btrfs_set_header_nritems(eb, 0); | |
4524 | set_bit(EXTENT_BUFFER_DUMMY, &eb->bflags); | |
4525 | ||
4526 | return eb; | |
4527 | err: | |
84167d19 SB |
4528 | for (; i > 0; i--) |
4529 | __free_page(eb->pages[i - 1]); | |
815a51c7 JS |
4530 | __free_extent_buffer(eb); |
4531 | return NULL; | |
4532 | } | |
4533 | ||
0b32f4bb JB |
4534 | static void check_buffer_tree_ref(struct extent_buffer *eb) |
4535 | { | |
242e18c7 | 4536 | int refs; |
0b32f4bb JB |
4537 | /* the ref bit is tricky. We have to make sure it is set |
4538 | * if we have the buffer dirty. Otherwise the | |
4539 | * code to free a buffer can end up dropping a dirty | |
4540 | * page | |
4541 | * | |
4542 | * Once the ref bit is set, it won't go away while the | |
4543 | * buffer is dirty or in writeback, and it also won't | |
4544 | * go away while we have the reference count on the | |
4545 | * eb bumped. | |
4546 | * | |
4547 | * We can't just set the ref bit without bumping the | |
4548 | * ref on the eb because free_extent_buffer might | |
4549 | * see the ref bit and try to clear it. If this happens | |
4550 | * free_extent_buffer might end up dropping our original | |
4551 | * ref by mistake and freeing the page before we are able | |
4552 | * to add one more ref. | |
4553 | * | |
4554 | * So bump the ref count first, then set the bit. If someone | |
4555 | * beat us to it, drop the ref we added. | |
4556 | */ | |
242e18c7 CM |
4557 | refs = atomic_read(&eb->refs); |
4558 | if (refs >= 2 && test_bit(EXTENT_BUFFER_TREE_REF, &eb->bflags)) | |
4559 | return; | |
4560 | ||
594831c4 JB |
4561 | spin_lock(&eb->refs_lock); |
4562 | if (!test_and_set_bit(EXTENT_BUFFER_TREE_REF, &eb->bflags)) | |
0b32f4bb | 4563 | atomic_inc(&eb->refs); |
594831c4 | 4564 | spin_unlock(&eb->refs_lock); |
0b32f4bb JB |
4565 | } |
4566 | ||
2457aec6 MG |
4567 | static void mark_extent_buffer_accessed(struct extent_buffer *eb, |
4568 | struct page *accessed) | |
5df4235e JB |
4569 | { |
4570 | unsigned long num_pages, i; | |
4571 | ||
0b32f4bb JB |
4572 | check_buffer_tree_ref(eb); |
4573 | ||
5df4235e JB |
4574 | num_pages = num_extent_pages(eb->start, eb->len); |
4575 | for (i = 0; i < num_pages; i++) { | |
4576 | struct page *p = extent_buffer_page(eb, i); | |
2457aec6 MG |
4577 | if (p != accessed) |
4578 | mark_page_accessed(p); | |
5df4235e JB |
4579 | } |
4580 | } | |
4581 | ||
f28491e0 JB |
4582 | struct extent_buffer *find_extent_buffer(struct btrfs_fs_info *fs_info, |
4583 | u64 start) | |
452c75c3 CS |
4584 | { |
4585 | struct extent_buffer *eb; | |
4586 | ||
4587 | rcu_read_lock(); | |
f28491e0 JB |
4588 | eb = radix_tree_lookup(&fs_info->buffer_radix, |
4589 | start >> PAGE_CACHE_SHIFT); | |
452c75c3 CS |
4590 | if (eb && atomic_inc_not_zero(&eb->refs)) { |
4591 | rcu_read_unlock(); | |
2457aec6 | 4592 | mark_extent_buffer_accessed(eb, NULL); |
452c75c3 CS |
4593 | return eb; |
4594 | } | |
4595 | rcu_read_unlock(); | |
4596 | ||
4597 | return NULL; | |
4598 | } | |
4599 | ||
faa2dbf0 JB |
4600 | #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS |
4601 | struct extent_buffer *alloc_test_extent_buffer(struct btrfs_fs_info *fs_info, | |
4602 | u64 start, unsigned long len) | |
4603 | { | |
4604 | struct extent_buffer *eb, *exists = NULL; | |
4605 | int ret; | |
4606 | ||
4607 | eb = find_extent_buffer(fs_info, start); | |
4608 | if (eb) | |
4609 | return eb; | |
4610 | eb = alloc_dummy_extent_buffer(start, len); | |
4611 | if (!eb) | |
4612 | return NULL; | |
4613 | eb->fs_info = fs_info; | |
4614 | again: | |
4615 | ret = radix_tree_preload(GFP_NOFS & ~__GFP_HIGHMEM); | |
4616 | if (ret) | |
4617 | goto free_eb; | |
4618 | spin_lock(&fs_info->buffer_lock); | |
4619 | ret = radix_tree_insert(&fs_info->buffer_radix, | |
4620 | start >> PAGE_CACHE_SHIFT, eb); | |
4621 | spin_unlock(&fs_info->buffer_lock); | |
4622 | radix_tree_preload_end(); | |
4623 | if (ret == -EEXIST) { | |
4624 | exists = find_extent_buffer(fs_info, start); | |
4625 | if (exists) | |
4626 | goto free_eb; | |
4627 | else | |
4628 | goto again; | |
4629 | } | |
4630 | check_buffer_tree_ref(eb); | |
4631 | set_bit(EXTENT_BUFFER_IN_TREE, &eb->bflags); | |
4632 | ||
4633 | /* | |
4634 | * We will free dummy extent buffer's if they come into | |
4635 | * free_extent_buffer with a ref count of 2, but if we are using this we | |
4636 | * want the buffers to stay in memory until we're done with them, so | |
4637 | * bump the ref count again. | |
4638 | */ | |
4639 | atomic_inc(&eb->refs); | |
4640 | return eb; | |
4641 | free_eb: | |
4642 | btrfs_release_extent_buffer(eb); | |
4643 | return exists; | |
4644 | } | |
4645 | #endif | |
4646 | ||
f28491e0 | 4647 | struct extent_buffer *alloc_extent_buffer(struct btrfs_fs_info *fs_info, |
727011e0 | 4648 | u64 start, unsigned long len) |
d1310b2e CM |
4649 | { |
4650 | unsigned long num_pages = num_extent_pages(start, len); | |
4651 | unsigned long i; | |
4652 | unsigned long index = start >> PAGE_CACHE_SHIFT; | |
4653 | struct extent_buffer *eb; | |
6af118ce | 4654 | struct extent_buffer *exists = NULL; |
d1310b2e | 4655 | struct page *p; |
f28491e0 | 4656 | struct address_space *mapping = fs_info->btree_inode->i_mapping; |
d1310b2e | 4657 | int uptodate = 1; |
19fe0a8b | 4658 | int ret; |
d1310b2e | 4659 | |
f28491e0 | 4660 | eb = find_extent_buffer(fs_info, start); |
452c75c3 | 4661 | if (eb) |
6af118ce | 4662 | return eb; |
6af118ce | 4663 | |
f28491e0 | 4664 | eb = __alloc_extent_buffer(fs_info, start, len, GFP_NOFS); |
2b114d1d | 4665 | if (!eb) |
d1310b2e CM |
4666 | return NULL; |
4667 | ||
727011e0 | 4668 | for (i = 0; i < num_pages; i++, index++) { |
a6591715 | 4669 | p = find_or_create_page(mapping, index, GFP_NOFS); |
4804b382 | 4670 | if (!p) |
6af118ce | 4671 | goto free_eb; |
4f2de97a JB |
4672 | |
4673 | spin_lock(&mapping->private_lock); | |
4674 | if (PagePrivate(p)) { | |
4675 | /* | |
4676 | * We could have already allocated an eb for this page | |
4677 | * and attached one so lets see if we can get a ref on | |
4678 | * the existing eb, and if we can we know it's good and | |
4679 | * we can just return that one, else we know we can just | |
4680 | * overwrite page->private. | |
4681 | */ | |
4682 | exists = (struct extent_buffer *)p->private; | |
4683 | if (atomic_inc_not_zero(&exists->refs)) { | |
4684 | spin_unlock(&mapping->private_lock); | |
4685 | unlock_page(p); | |
17de39ac | 4686 | page_cache_release(p); |
2457aec6 | 4687 | mark_extent_buffer_accessed(exists, p); |
4f2de97a JB |
4688 | goto free_eb; |
4689 | } | |
4690 | ||
0b32f4bb | 4691 | /* |
4f2de97a JB |
4692 | * Do this so attach doesn't complain and we need to |
4693 | * drop the ref the old guy had. | |
4694 | */ | |
4695 | ClearPagePrivate(p); | |
0b32f4bb | 4696 | WARN_ON(PageDirty(p)); |
4f2de97a | 4697 | page_cache_release(p); |
d1310b2e | 4698 | } |
4f2de97a JB |
4699 | attach_extent_buffer_page(eb, p); |
4700 | spin_unlock(&mapping->private_lock); | |
0b32f4bb | 4701 | WARN_ON(PageDirty(p)); |
727011e0 | 4702 | eb->pages[i] = p; |
d1310b2e CM |
4703 | if (!PageUptodate(p)) |
4704 | uptodate = 0; | |
eb14ab8e CM |
4705 | |
4706 | /* | |
4707 | * see below about how we avoid a nasty race with release page | |
4708 | * and why we unlock later | |
4709 | */ | |
d1310b2e CM |
4710 | } |
4711 | if (uptodate) | |
b4ce94de | 4712 | set_bit(EXTENT_BUFFER_UPTODATE, &eb->bflags); |
115391d2 | 4713 | again: |
19fe0a8b MX |
4714 | ret = radix_tree_preload(GFP_NOFS & ~__GFP_HIGHMEM); |
4715 | if (ret) | |
4716 | goto free_eb; | |
4717 | ||
f28491e0 JB |
4718 | spin_lock(&fs_info->buffer_lock); |
4719 | ret = radix_tree_insert(&fs_info->buffer_radix, | |
4720 | start >> PAGE_CACHE_SHIFT, eb); | |
4721 | spin_unlock(&fs_info->buffer_lock); | |
452c75c3 | 4722 | radix_tree_preload_end(); |
19fe0a8b | 4723 | if (ret == -EEXIST) { |
f28491e0 | 4724 | exists = find_extent_buffer(fs_info, start); |
452c75c3 CS |
4725 | if (exists) |
4726 | goto free_eb; | |
4727 | else | |
115391d2 | 4728 | goto again; |
6af118ce | 4729 | } |
6af118ce | 4730 | /* add one reference for the tree */ |
0b32f4bb | 4731 | check_buffer_tree_ref(eb); |
34b41ace | 4732 | set_bit(EXTENT_BUFFER_IN_TREE, &eb->bflags); |
eb14ab8e CM |
4733 | |
4734 | /* | |
4735 | * there is a race where release page may have | |
4736 | * tried to find this extent buffer in the radix | |
4737 | * but failed. It will tell the VM it is safe to | |
4738 | * reclaim the, and it will clear the page private bit. | |
4739 | * We must make sure to set the page private bit properly | |
4740 | * after the extent buffer is in the radix tree so | |
4741 | * it doesn't get lost | |
4742 | */ | |
727011e0 CM |
4743 | SetPageChecked(eb->pages[0]); |
4744 | for (i = 1; i < num_pages; i++) { | |
4745 | p = extent_buffer_page(eb, i); | |
727011e0 CM |
4746 | ClearPageChecked(p); |
4747 | unlock_page(p); | |
4748 | } | |
4749 | unlock_page(eb->pages[0]); | |
d1310b2e CM |
4750 | return eb; |
4751 | ||
6af118ce | 4752 | free_eb: |
727011e0 CM |
4753 | for (i = 0; i < num_pages; i++) { |
4754 | if (eb->pages[i]) | |
4755 | unlock_page(eb->pages[i]); | |
4756 | } | |
eb14ab8e | 4757 | |
17de39ac | 4758 | WARN_ON(!atomic_dec_and_test(&eb->refs)); |
897ca6e9 | 4759 | btrfs_release_extent_buffer(eb); |
6af118ce | 4760 | return exists; |
d1310b2e | 4761 | } |
d1310b2e | 4762 | |
3083ee2e JB |
4763 | static inline void btrfs_release_extent_buffer_rcu(struct rcu_head *head) |
4764 | { | |
4765 | struct extent_buffer *eb = | |
4766 | container_of(head, struct extent_buffer, rcu_head); | |
4767 | ||
4768 | __free_extent_buffer(eb); | |
4769 | } | |
4770 | ||
3083ee2e | 4771 | /* Expects to have eb->eb_lock already held */ |
f7a52a40 | 4772 | static int release_extent_buffer(struct extent_buffer *eb) |
3083ee2e JB |
4773 | { |
4774 | WARN_ON(atomic_read(&eb->refs) == 0); | |
4775 | if (atomic_dec_and_test(&eb->refs)) { | |
34b41ace | 4776 | if (test_and_clear_bit(EXTENT_BUFFER_IN_TREE, &eb->bflags)) { |
f28491e0 | 4777 | struct btrfs_fs_info *fs_info = eb->fs_info; |
3083ee2e | 4778 | |
815a51c7 | 4779 | spin_unlock(&eb->refs_lock); |
3083ee2e | 4780 | |
f28491e0 JB |
4781 | spin_lock(&fs_info->buffer_lock); |
4782 | radix_tree_delete(&fs_info->buffer_radix, | |
815a51c7 | 4783 | eb->start >> PAGE_CACHE_SHIFT); |
f28491e0 | 4784 | spin_unlock(&fs_info->buffer_lock); |
34b41ace JB |
4785 | } else { |
4786 | spin_unlock(&eb->refs_lock); | |
815a51c7 | 4787 | } |
3083ee2e JB |
4788 | |
4789 | /* Should be safe to release our pages at this point */ | |
4790 | btrfs_release_extent_buffer_page(eb, 0); | |
3083ee2e | 4791 | call_rcu(&eb->rcu_head, btrfs_release_extent_buffer_rcu); |
e64860aa | 4792 | return 1; |
3083ee2e JB |
4793 | } |
4794 | spin_unlock(&eb->refs_lock); | |
e64860aa JB |
4795 | |
4796 | return 0; | |
3083ee2e JB |
4797 | } |
4798 | ||
d1310b2e CM |
4799 | void free_extent_buffer(struct extent_buffer *eb) |
4800 | { | |
242e18c7 CM |
4801 | int refs; |
4802 | int old; | |
d1310b2e CM |
4803 | if (!eb) |
4804 | return; | |
4805 | ||
242e18c7 CM |
4806 | while (1) { |
4807 | refs = atomic_read(&eb->refs); | |
4808 | if (refs <= 3) | |
4809 | break; | |
4810 | old = atomic_cmpxchg(&eb->refs, refs, refs - 1); | |
4811 | if (old == refs) | |
4812 | return; | |
4813 | } | |
4814 | ||
3083ee2e | 4815 | spin_lock(&eb->refs_lock); |
815a51c7 JS |
4816 | if (atomic_read(&eb->refs) == 2 && |
4817 | test_bit(EXTENT_BUFFER_DUMMY, &eb->bflags)) | |
4818 | atomic_dec(&eb->refs); | |
4819 | ||
3083ee2e JB |
4820 | if (atomic_read(&eb->refs) == 2 && |
4821 | test_bit(EXTENT_BUFFER_STALE, &eb->bflags) && | |
0b32f4bb | 4822 | !extent_buffer_under_io(eb) && |
3083ee2e JB |
4823 | test_and_clear_bit(EXTENT_BUFFER_TREE_REF, &eb->bflags)) |
4824 | atomic_dec(&eb->refs); | |
4825 | ||
4826 | /* | |
4827 | * I know this is terrible, but it's temporary until we stop tracking | |
4828 | * the uptodate bits and such for the extent buffers. | |
4829 | */ | |
f7a52a40 | 4830 | release_extent_buffer(eb); |
3083ee2e JB |
4831 | } |
4832 | ||
4833 | void free_extent_buffer_stale(struct extent_buffer *eb) | |
4834 | { | |
4835 | if (!eb) | |
d1310b2e CM |
4836 | return; |
4837 | ||
3083ee2e JB |
4838 | spin_lock(&eb->refs_lock); |
4839 | set_bit(EXTENT_BUFFER_STALE, &eb->bflags); | |
4840 | ||
0b32f4bb | 4841 | if (atomic_read(&eb->refs) == 2 && !extent_buffer_under_io(eb) && |
3083ee2e JB |
4842 | test_and_clear_bit(EXTENT_BUFFER_TREE_REF, &eb->bflags)) |
4843 | atomic_dec(&eb->refs); | |
f7a52a40 | 4844 | release_extent_buffer(eb); |
d1310b2e | 4845 | } |
d1310b2e | 4846 | |
1d4284bd | 4847 | void clear_extent_buffer_dirty(struct extent_buffer *eb) |
d1310b2e | 4848 | { |
d1310b2e CM |
4849 | unsigned long i; |
4850 | unsigned long num_pages; | |
4851 | struct page *page; | |
4852 | ||
d1310b2e CM |
4853 | num_pages = num_extent_pages(eb->start, eb->len); |
4854 | ||
4855 | for (i = 0; i < num_pages; i++) { | |
4856 | page = extent_buffer_page(eb, i); | |
b9473439 | 4857 | if (!PageDirty(page)) |
d2c3f4f6 CM |
4858 | continue; |
4859 | ||
a61e6f29 | 4860 | lock_page(page); |
eb14ab8e CM |
4861 | WARN_ON(!PagePrivate(page)); |
4862 | ||
d1310b2e | 4863 | clear_page_dirty_for_io(page); |
0ee0fda0 | 4864 | spin_lock_irq(&page->mapping->tree_lock); |
d1310b2e CM |
4865 | if (!PageDirty(page)) { |
4866 | radix_tree_tag_clear(&page->mapping->page_tree, | |
4867 | page_index(page), | |
4868 | PAGECACHE_TAG_DIRTY); | |
4869 | } | |
0ee0fda0 | 4870 | spin_unlock_irq(&page->mapping->tree_lock); |
bf0da8c1 | 4871 | ClearPageError(page); |
a61e6f29 | 4872 | unlock_page(page); |
d1310b2e | 4873 | } |
0b32f4bb | 4874 | WARN_ON(atomic_read(&eb->refs) == 0); |
d1310b2e | 4875 | } |
d1310b2e | 4876 | |
0b32f4bb | 4877 | int set_extent_buffer_dirty(struct extent_buffer *eb) |
d1310b2e CM |
4878 | { |
4879 | unsigned long i; | |
4880 | unsigned long num_pages; | |
b9473439 | 4881 | int was_dirty = 0; |
d1310b2e | 4882 | |
0b32f4bb JB |
4883 | check_buffer_tree_ref(eb); |
4884 | ||
b9473439 | 4885 | was_dirty = test_and_set_bit(EXTENT_BUFFER_DIRTY, &eb->bflags); |
0b32f4bb | 4886 | |
d1310b2e | 4887 | num_pages = num_extent_pages(eb->start, eb->len); |
3083ee2e | 4888 | WARN_ON(atomic_read(&eb->refs) == 0); |
0b32f4bb JB |
4889 | WARN_ON(!test_bit(EXTENT_BUFFER_TREE_REF, &eb->bflags)); |
4890 | ||
b9473439 | 4891 | for (i = 0; i < num_pages; i++) |
0b32f4bb | 4892 | set_page_dirty(extent_buffer_page(eb, i)); |
b9473439 | 4893 | return was_dirty; |
d1310b2e | 4894 | } |
d1310b2e | 4895 | |
0b32f4bb | 4896 | int clear_extent_buffer_uptodate(struct extent_buffer *eb) |
1259ab75 CM |
4897 | { |
4898 | unsigned long i; | |
4899 | struct page *page; | |
4900 | unsigned long num_pages; | |
4901 | ||
b4ce94de | 4902 | clear_bit(EXTENT_BUFFER_UPTODATE, &eb->bflags); |
0b32f4bb | 4903 | num_pages = num_extent_pages(eb->start, eb->len); |
1259ab75 CM |
4904 | for (i = 0; i < num_pages; i++) { |
4905 | page = extent_buffer_page(eb, i); | |
33958dc6 CM |
4906 | if (page) |
4907 | ClearPageUptodate(page); | |
1259ab75 CM |
4908 | } |
4909 | return 0; | |
4910 | } | |
4911 | ||
0b32f4bb | 4912 | int set_extent_buffer_uptodate(struct extent_buffer *eb) |
d1310b2e CM |
4913 | { |
4914 | unsigned long i; | |
4915 | struct page *page; | |
4916 | unsigned long num_pages; | |
4917 | ||
0b32f4bb | 4918 | set_bit(EXTENT_BUFFER_UPTODATE, &eb->bflags); |
d1310b2e | 4919 | num_pages = num_extent_pages(eb->start, eb->len); |
d1310b2e CM |
4920 | for (i = 0; i < num_pages; i++) { |
4921 | page = extent_buffer_page(eb, i); | |
d1310b2e CM |
4922 | SetPageUptodate(page); |
4923 | } | |
4924 | return 0; | |
4925 | } | |
d1310b2e | 4926 | |
0b32f4bb | 4927 | int extent_buffer_uptodate(struct extent_buffer *eb) |
d1310b2e | 4928 | { |
0b32f4bb | 4929 | return test_bit(EXTENT_BUFFER_UPTODATE, &eb->bflags); |
d1310b2e | 4930 | } |
d1310b2e CM |
4931 | |
4932 | int read_extent_buffer_pages(struct extent_io_tree *tree, | |
bb82ab88 | 4933 | struct extent_buffer *eb, u64 start, int wait, |
f188591e | 4934 | get_extent_t *get_extent, int mirror_num) |
d1310b2e CM |
4935 | { |
4936 | unsigned long i; | |
4937 | unsigned long start_i; | |
4938 | struct page *page; | |
4939 | int err; | |
4940 | int ret = 0; | |
ce9adaa5 CM |
4941 | int locked_pages = 0; |
4942 | int all_uptodate = 1; | |
d1310b2e | 4943 | unsigned long num_pages; |
727011e0 | 4944 | unsigned long num_reads = 0; |
a86c12c7 | 4945 | struct bio *bio = NULL; |
c8b97818 | 4946 | unsigned long bio_flags = 0; |
a86c12c7 | 4947 | |
b4ce94de | 4948 | if (test_bit(EXTENT_BUFFER_UPTODATE, &eb->bflags)) |
d1310b2e CM |
4949 | return 0; |
4950 | ||
d1310b2e CM |
4951 | if (start) { |
4952 | WARN_ON(start < eb->start); | |
4953 | start_i = (start >> PAGE_CACHE_SHIFT) - | |
4954 | (eb->start >> PAGE_CACHE_SHIFT); | |
4955 | } else { | |
4956 | start_i = 0; | |
4957 | } | |
4958 | ||
4959 | num_pages = num_extent_pages(eb->start, eb->len); | |
4960 | for (i = start_i; i < num_pages; i++) { | |
4961 | page = extent_buffer_page(eb, i); | |
bb82ab88 | 4962 | if (wait == WAIT_NONE) { |
2db04966 | 4963 | if (!trylock_page(page)) |
ce9adaa5 | 4964 | goto unlock_exit; |
d1310b2e CM |
4965 | } else { |
4966 | lock_page(page); | |
4967 | } | |
ce9adaa5 | 4968 | locked_pages++; |
727011e0 CM |
4969 | if (!PageUptodate(page)) { |
4970 | num_reads++; | |
ce9adaa5 | 4971 | all_uptodate = 0; |
727011e0 | 4972 | } |
ce9adaa5 CM |
4973 | } |
4974 | if (all_uptodate) { | |
4975 | if (start_i == 0) | |
b4ce94de | 4976 | set_bit(EXTENT_BUFFER_UPTODATE, &eb->bflags); |
ce9adaa5 CM |
4977 | goto unlock_exit; |
4978 | } | |
4979 | ||
ea466794 | 4980 | clear_bit(EXTENT_BUFFER_IOERR, &eb->bflags); |
5cf1ab56 | 4981 | eb->read_mirror = 0; |
0b32f4bb | 4982 | atomic_set(&eb->io_pages, num_reads); |
ce9adaa5 CM |
4983 | for (i = start_i; i < num_pages; i++) { |
4984 | page = extent_buffer_page(eb, i); | |
ce9adaa5 | 4985 | if (!PageUptodate(page)) { |
f188591e | 4986 | ClearPageError(page); |
a86c12c7 | 4987 | err = __extent_read_full_page(tree, page, |
f188591e | 4988 | get_extent, &bio, |
d4c7ca86 JB |
4989 | mirror_num, &bio_flags, |
4990 | READ | REQ_META); | |
d397712b | 4991 | if (err) |
d1310b2e | 4992 | ret = err; |
d1310b2e CM |
4993 | } else { |
4994 | unlock_page(page); | |
4995 | } | |
4996 | } | |
4997 | ||
355808c2 | 4998 | if (bio) { |
d4c7ca86 JB |
4999 | err = submit_one_bio(READ | REQ_META, bio, mirror_num, |
5000 | bio_flags); | |
79787eaa JM |
5001 | if (err) |
5002 | return err; | |
355808c2 | 5003 | } |
a86c12c7 | 5004 | |
bb82ab88 | 5005 | if (ret || wait != WAIT_COMPLETE) |
d1310b2e | 5006 | return ret; |
d397712b | 5007 | |
d1310b2e CM |
5008 | for (i = start_i; i < num_pages; i++) { |
5009 | page = extent_buffer_page(eb, i); | |
5010 | wait_on_page_locked(page); | |
d397712b | 5011 | if (!PageUptodate(page)) |
d1310b2e | 5012 | ret = -EIO; |
d1310b2e | 5013 | } |
d397712b | 5014 | |
d1310b2e | 5015 | return ret; |
ce9adaa5 CM |
5016 | |
5017 | unlock_exit: | |
5018 | i = start_i; | |
d397712b | 5019 | while (locked_pages > 0) { |
ce9adaa5 CM |
5020 | page = extent_buffer_page(eb, i); |
5021 | i++; | |
5022 | unlock_page(page); | |
5023 | locked_pages--; | |
5024 | } | |
5025 | return ret; | |
d1310b2e | 5026 | } |
d1310b2e CM |
5027 | |
5028 | void read_extent_buffer(struct extent_buffer *eb, void *dstv, | |
5029 | unsigned long start, | |
5030 | unsigned long len) | |
5031 | { | |
5032 | size_t cur; | |
5033 | size_t offset; | |
5034 | struct page *page; | |
5035 | char *kaddr; | |
5036 | char *dst = (char *)dstv; | |
5037 | size_t start_offset = eb->start & ((u64)PAGE_CACHE_SIZE - 1); | |
5038 | unsigned long i = (start_offset + start) >> PAGE_CACHE_SHIFT; | |
d1310b2e CM |
5039 | |
5040 | WARN_ON(start > eb->len); | |
5041 | WARN_ON(start + len > eb->start + eb->len); | |
5042 | ||
778746b5 | 5043 | offset = (start_offset + start) & (PAGE_CACHE_SIZE - 1); |
d1310b2e | 5044 | |
d397712b | 5045 | while (len > 0) { |
d1310b2e | 5046 | page = extent_buffer_page(eb, i); |
d1310b2e CM |
5047 | |
5048 | cur = min(len, (PAGE_CACHE_SIZE - offset)); | |
a6591715 | 5049 | kaddr = page_address(page); |
d1310b2e | 5050 | memcpy(dst, kaddr + offset, cur); |
d1310b2e CM |
5051 | |
5052 | dst += cur; | |
5053 | len -= cur; | |
5054 | offset = 0; | |
5055 | i++; | |
5056 | } | |
5057 | } | |
d1310b2e | 5058 | |
550ac1d8 GH |
5059 | int read_extent_buffer_to_user(struct extent_buffer *eb, void __user *dstv, |
5060 | unsigned long start, | |
5061 | unsigned long len) | |
5062 | { | |
5063 | size_t cur; | |
5064 | size_t offset; | |
5065 | struct page *page; | |
5066 | char *kaddr; | |
5067 | char __user *dst = (char __user *)dstv; | |
5068 | size_t start_offset = eb->start & ((u64)PAGE_CACHE_SIZE - 1); | |
5069 | unsigned long i = (start_offset + start) >> PAGE_CACHE_SHIFT; | |
5070 | int ret = 0; | |
5071 | ||
5072 | WARN_ON(start > eb->len); | |
5073 | WARN_ON(start + len > eb->start + eb->len); | |
5074 | ||
5075 | offset = (start_offset + start) & (PAGE_CACHE_SIZE - 1); | |
5076 | ||
5077 | while (len > 0) { | |
5078 | page = extent_buffer_page(eb, i); | |
5079 | ||
5080 | cur = min(len, (PAGE_CACHE_SIZE - offset)); | |
5081 | kaddr = page_address(page); | |
5082 | if (copy_to_user(dst, kaddr + offset, cur)) { | |
5083 | ret = -EFAULT; | |
5084 | break; | |
5085 | } | |
5086 | ||
5087 | dst += cur; | |
5088 | len -= cur; | |
5089 | offset = 0; | |
5090 | i++; | |
5091 | } | |
5092 | ||
5093 | return ret; | |
5094 | } | |
5095 | ||
d1310b2e | 5096 | int map_private_extent_buffer(struct extent_buffer *eb, unsigned long start, |
a6591715 | 5097 | unsigned long min_len, char **map, |
d1310b2e | 5098 | unsigned long *map_start, |
a6591715 | 5099 | unsigned long *map_len) |
d1310b2e CM |
5100 | { |
5101 | size_t offset = start & (PAGE_CACHE_SIZE - 1); | |
5102 | char *kaddr; | |
5103 | struct page *p; | |
5104 | size_t start_offset = eb->start & ((u64)PAGE_CACHE_SIZE - 1); | |
5105 | unsigned long i = (start_offset + start) >> PAGE_CACHE_SHIFT; | |
5106 | unsigned long end_i = (start_offset + start + min_len - 1) >> | |
5107 | PAGE_CACHE_SHIFT; | |
5108 | ||
5109 | if (i != end_i) | |
5110 | return -EINVAL; | |
5111 | ||
5112 | if (i == 0) { | |
5113 | offset = start_offset; | |
5114 | *map_start = 0; | |
5115 | } else { | |
5116 | offset = 0; | |
5117 | *map_start = ((u64)i << PAGE_CACHE_SHIFT) - start_offset; | |
5118 | } | |
d397712b | 5119 | |
d1310b2e | 5120 | if (start + min_len > eb->len) { |
31b1a2bd | 5121 | WARN(1, KERN_ERR "btrfs bad mapping eb start %llu len %lu, " |
c1c9ff7c GU |
5122 | "wanted %lu %lu\n", |
5123 | eb->start, eb->len, start, min_len); | |
85026533 | 5124 | return -EINVAL; |
d1310b2e CM |
5125 | } |
5126 | ||
5127 | p = extent_buffer_page(eb, i); | |
a6591715 | 5128 | kaddr = page_address(p); |
d1310b2e CM |
5129 | *map = kaddr + offset; |
5130 | *map_len = PAGE_CACHE_SIZE - offset; | |
5131 | return 0; | |
5132 | } | |
d1310b2e | 5133 | |
d1310b2e CM |
5134 | int memcmp_extent_buffer(struct extent_buffer *eb, const void *ptrv, |
5135 | unsigned long start, | |
5136 | unsigned long len) | |
5137 | { | |
5138 | size_t cur; | |
5139 | size_t offset; | |
5140 | struct page *page; | |
5141 | char *kaddr; | |
5142 | char *ptr = (char *)ptrv; | |
5143 | size_t start_offset = eb->start & ((u64)PAGE_CACHE_SIZE - 1); | |
5144 | unsigned long i = (start_offset + start) >> PAGE_CACHE_SHIFT; | |
5145 | int ret = 0; | |
5146 | ||
5147 | WARN_ON(start > eb->len); | |
5148 | WARN_ON(start + len > eb->start + eb->len); | |
5149 | ||
778746b5 | 5150 | offset = (start_offset + start) & (PAGE_CACHE_SIZE - 1); |
d1310b2e | 5151 | |
d397712b | 5152 | while (len > 0) { |
d1310b2e | 5153 | page = extent_buffer_page(eb, i); |
d1310b2e CM |
5154 | |
5155 | cur = min(len, (PAGE_CACHE_SIZE - offset)); | |
5156 | ||
a6591715 | 5157 | kaddr = page_address(page); |
d1310b2e | 5158 | ret = memcmp(ptr, kaddr + offset, cur); |
d1310b2e CM |
5159 | if (ret) |
5160 | break; | |
5161 | ||
5162 | ptr += cur; | |
5163 | len -= cur; | |
5164 | offset = 0; | |
5165 | i++; | |
5166 | } | |
5167 | return ret; | |
5168 | } | |
d1310b2e CM |
5169 | |
5170 | void write_extent_buffer(struct extent_buffer *eb, const void *srcv, | |
5171 | unsigned long start, unsigned long len) | |
5172 | { | |
5173 | size_t cur; | |
5174 | size_t offset; | |
5175 | struct page *page; | |
5176 | char *kaddr; | |
5177 | char *src = (char *)srcv; | |
5178 | size_t start_offset = eb->start & ((u64)PAGE_CACHE_SIZE - 1); | |
5179 | unsigned long i = (start_offset + start) >> PAGE_CACHE_SHIFT; | |
5180 | ||
5181 | WARN_ON(start > eb->len); | |
5182 | WARN_ON(start + len > eb->start + eb->len); | |
5183 | ||
778746b5 | 5184 | offset = (start_offset + start) & (PAGE_CACHE_SIZE - 1); |
d1310b2e | 5185 | |
d397712b | 5186 | while (len > 0) { |
d1310b2e CM |
5187 | page = extent_buffer_page(eb, i); |
5188 | WARN_ON(!PageUptodate(page)); | |
5189 | ||
5190 | cur = min(len, PAGE_CACHE_SIZE - offset); | |
a6591715 | 5191 | kaddr = page_address(page); |
d1310b2e | 5192 | memcpy(kaddr + offset, src, cur); |
d1310b2e CM |
5193 | |
5194 | src += cur; | |
5195 | len -= cur; | |
5196 | offset = 0; | |
5197 | i++; | |
5198 | } | |
5199 | } | |
d1310b2e CM |
5200 | |
5201 | void memset_extent_buffer(struct extent_buffer *eb, char c, | |
5202 | unsigned long start, unsigned long len) | |
5203 | { | |
5204 | size_t cur; | |
5205 | size_t offset; | |
5206 | struct page *page; | |
5207 | char *kaddr; | |
5208 | size_t start_offset = eb->start & ((u64)PAGE_CACHE_SIZE - 1); | |
5209 | unsigned long i = (start_offset + start) >> PAGE_CACHE_SHIFT; | |
5210 | ||
5211 | WARN_ON(start > eb->len); | |
5212 | WARN_ON(start + len > eb->start + eb->len); | |
5213 | ||
778746b5 | 5214 | offset = (start_offset + start) & (PAGE_CACHE_SIZE - 1); |
d1310b2e | 5215 | |
d397712b | 5216 | while (len > 0) { |
d1310b2e CM |
5217 | page = extent_buffer_page(eb, i); |
5218 | WARN_ON(!PageUptodate(page)); | |
5219 | ||
5220 | cur = min(len, PAGE_CACHE_SIZE - offset); | |
a6591715 | 5221 | kaddr = page_address(page); |
d1310b2e | 5222 | memset(kaddr + offset, c, cur); |
d1310b2e CM |
5223 | |
5224 | len -= cur; | |
5225 | offset = 0; | |
5226 | i++; | |
5227 | } | |
5228 | } | |
d1310b2e CM |
5229 | |
5230 | void copy_extent_buffer(struct extent_buffer *dst, struct extent_buffer *src, | |
5231 | unsigned long dst_offset, unsigned long src_offset, | |
5232 | unsigned long len) | |
5233 | { | |
5234 | u64 dst_len = dst->len; | |
5235 | size_t cur; | |
5236 | size_t offset; | |
5237 | struct page *page; | |
5238 | char *kaddr; | |
5239 | size_t start_offset = dst->start & ((u64)PAGE_CACHE_SIZE - 1); | |
5240 | unsigned long i = (start_offset + dst_offset) >> PAGE_CACHE_SHIFT; | |
5241 | ||
5242 | WARN_ON(src->len != dst_len); | |
5243 | ||
5244 | offset = (start_offset + dst_offset) & | |
778746b5 | 5245 | (PAGE_CACHE_SIZE - 1); |
d1310b2e | 5246 | |
d397712b | 5247 | while (len > 0) { |
d1310b2e CM |
5248 | page = extent_buffer_page(dst, i); |
5249 | WARN_ON(!PageUptodate(page)); | |
5250 | ||
5251 | cur = min(len, (unsigned long)(PAGE_CACHE_SIZE - offset)); | |
5252 | ||
a6591715 | 5253 | kaddr = page_address(page); |
d1310b2e | 5254 | read_extent_buffer(src, kaddr + offset, src_offset, cur); |
d1310b2e CM |
5255 | |
5256 | src_offset += cur; | |
5257 | len -= cur; | |
5258 | offset = 0; | |
5259 | i++; | |
5260 | } | |
5261 | } | |
d1310b2e | 5262 | |
3387206f ST |
5263 | static inline bool areas_overlap(unsigned long src, unsigned long dst, unsigned long len) |
5264 | { | |
5265 | unsigned long distance = (src > dst) ? src - dst : dst - src; | |
5266 | return distance < len; | |
5267 | } | |
5268 | ||
d1310b2e CM |
5269 | static void copy_pages(struct page *dst_page, struct page *src_page, |
5270 | unsigned long dst_off, unsigned long src_off, | |
5271 | unsigned long len) | |
5272 | { | |
a6591715 | 5273 | char *dst_kaddr = page_address(dst_page); |
d1310b2e | 5274 | char *src_kaddr; |
727011e0 | 5275 | int must_memmove = 0; |
d1310b2e | 5276 | |
3387206f | 5277 | if (dst_page != src_page) { |
a6591715 | 5278 | src_kaddr = page_address(src_page); |
3387206f | 5279 | } else { |
d1310b2e | 5280 | src_kaddr = dst_kaddr; |
727011e0 CM |
5281 | if (areas_overlap(src_off, dst_off, len)) |
5282 | must_memmove = 1; | |
3387206f | 5283 | } |
d1310b2e | 5284 | |
727011e0 CM |
5285 | if (must_memmove) |
5286 | memmove(dst_kaddr + dst_off, src_kaddr + src_off, len); | |
5287 | else | |
5288 | memcpy(dst_kaddr + dst_off, src_kaddr + src_off, len); | |
d1310b2e CM |
5289 | } |
5290 | ||
5291 | void memcpy_extent_buffer(struct extent_buffer *dst, unsigned long dst_offset, | |
5292 | unsigned long src_offset, unsigned long len) | |
5293 | { | |
5294 | size_t cur; | |
5295 | size_t dst_off_in_page; | |
5296 | size_t src_off_in_page; | |
5297 | size_t start_offset = dst->start & ((u64)PAGE_CACHE_SIZE - 1); | |
5298 | unsigned long dst_i; | |
5299 | unsigned long src_i; | |
5300 | ||
5301 | if (src_offset + len > dst->len) { | |
efe120a0 | 5302 | printk(KERN_ERR "BTRFS: memmove bogus src_offset %lu move " |
d397712b | 5303 | "len %lu dst len %lu\n", src_offset, len, dst->len); |
d1310b2e CM |
5304 | BUG_ON(1); |
5305 | } | |
5306 | if (dst_offset + len > dst->len) { | |
efe120a0 | 5307 | printk(KERN_ERR "BTRFS: memmove bogus dst_offset %lu move " |
d397712b | 5308 | "len %lu dst len %lu\n", dst_offset, len, dst->len); |
d1310b2e CM |
5309 | BUG_ON(1); |
5310 | } | |
5311 | ||
d397712b | 5312 | while (len > 0) { |
d1310b2e | 5313 | dst_off_in_page = (start_offset + dst_offset) & |
778746b5 | 5314 | (PAGE_CACHE_SIZE - 1); |
d1310b2e | 5315 | src_off_in_page = (start_offset + src_offset) & |
778746b5 | 5316 | (PAGE_CACHE_SIZE - 1); |
d1310b2e CM |
5317 | |
5318 | dst_i = (start_offset + dst_offset) >> PAGE_CACHE_SHIFT; | |
5319 | src_i = (start_offset + src_offset) >> PAGE_CACHE_SHIFT; | |
5320 | ||
5321 | cur = min(len, (unsigned long)(PAGE_CACHE_SIZE - | |
5322 | src_off_in_page)); | |
5323 | cur = min_t(unsigned long, cur, | |
5324 | (unsigned long)(PAGE_CACHE_SIZE - dst_off_in_page)); | |
5325 | ||
5326 | copy_pages(extent_buffer_page(dst, dst_i), | |
5327 | extent_buffer_page(dst, src_i), | |
5328 | dst_off_in_page, src_off_in_page, cur); | |
5329 | ||
5330 | src_offset += cur; | |
5331 | dst_offset += cur; | |
5332 | len -= cur; | |
5333 | } | |
5334 | } | |
d1310b2e CM |
5335 | |
5336 | void memmove_extent_buffer(struct extent_buffer *dst, unsigned long dst_offset, | |
5337 | unsigned long src_offset, unsigned long len) | |
5338 | { | |
5339 | size_t cur; | |
5340 | size_t dst_off_in_page; | |
5341 | size_t src_off_in_page; | |
5342 | unsigned long dst_end = dst_offset + len - 1; | |
5343 | unsigned long src_end = src_offset + len - 1; | |
5344 | size_t start_offset = dst->start & ((u64)PAGE_CACHE_SIZE - 1); | |
5345 | unsigned long dst_i; | |
5346 | unsigned long src_i; | |
5347 | ||
5348 | if (src_offset + len > dst->len) { | |
efe120a0 | 5349 | printk(KERN_ERR "BTRFS: memmove bogus src_offset %lu move " |
d397712b | 5350 | "len %lu len %lu\n", src_offset, len, dst->len); |
d1310b2e CM |
5351 | BUG_ON(1); |
5352 | } | |
5353 | if (dst_offset + len > dst->len) { | |
efe120a0 | 5354 | printk(KERN_ERR "BTRFS: memmove bogus dst_offset %lu move " |
d397712b | 5355 | "len %lu len %lu\n", dst_offset, len, dst->len); |
d1310b2e CM |
5356 | BUG_ON(1); |
5357 | } | |
727011e0 | 5358 | if (dst_offset < src_offset) { |
d1310b2e CM |
5359 | memcpy_extent_buffer(dst, dst_offset, src_offset, len); |
5360 | return; | |
5361 | } | |
d397712b | 5362 | while (len > 0) { |
d1310b2e CM |
5363 | dst_i = (start_offset + dst_end) >> PAGE_CACHE_SHIFT; |
5364 | src_i = (start_offset + src_end) >> PAGE_CACHE_SHIFT; | |
5365 | ||
5366 | dst_off_in_page = (start_offset + dst_end) & | |
778746b5 | 5367 | (PAGE_CACHE_SIZE - 1); |
d1310b2e | 5368 | src_off_in_page = (start_offset + src_end) & |
778746b5 | 5369 | (PAGE_CACHE_SIZE - 1); |
d1310b2e CM |
5370 | |
5371 | cur = min_t(unsigned long, len, src_off_in_page + 1); | |
5372 | cur = min(cur, dst_off_in_page + 1); | |
1877e1a7 | 5373 | copy_pages(extent_buffer_page(dst, dst_i), |
d1310b2e CM |
5374 | extent_buffer_page(dst, src_i), |
5375 | dst_off_in_page - cur + 1, | |
5376 | src_off_in_page - cur + 1, cur); | |
5377 | ||
5378 | dst_end -= cur; | |
5379 | src_end -= cur; | |
5380 | len -= cur; | |
5381 | } | |
5382 | } | |
6af118ce | 5383 | |
f7a52a40 | 5384 | int try_release_extent_buffer(struct page *page) |
19fe0a8b | 5385 | { |
6af118ce | 5386 | struct extent_buffer *eb; |
6af118ce | 5387 | |
3083ee2e JB |
5388 | /* |
5389 | * We need to make sure noboody is attaching this page to an eb right | |
5390 | * now. | |
5391 | */ | |
5392 | spin_lock(&page->mapping->private_lock); | |
5393 | if (!PagePrivate(page)) { | |
5394 | spin_unlock(&page->mapping->private_lock); | |
4f2de97a | 5395 | return 1; |
45f49bce | 5396 | } |
6af118ce | 5397 | |
3083ee2e JB |
5398 | eb = (struct extent_buffer *)page->private; |
5399 | BUG_ON(!eb); | |
19fe0a8b MX |
5400 | |
5401 | /* | |
3083ee2e JB |
5402 | * This is a little awful but should be ok, we need to make sure that |
5403 | * the eb doesn't disappear out from under us while we're looking at | |
5404 | * this page. | |
19fe0a8b | 5405 | */ |
3083ee2e | 5406 | spin_lock(&eb->refs_lock); |
0b32f4bb | 5407 | if (atomic_read(&eb->refs) != 1 || extent_buffer_under_io(eb)) { |
3083ee2e JB |
5408 | spin_unlock(&eb->refs_lock); |
5409 | spin_unlock(&page->mapping->private_lock); | |
5410 | return 0; | |
b9473439 | 5411 | } |
3083ee2e | 5412 | spin_unlock(&page->mapping->private_lock); |
897ca6e9 | 5413 | |
19fe0a8b | 5414 | /* |
3083ee2e JB |
5415 | * If tree ref isn't set then we know the ref on this eb is a real ref, |
5416 | * so just return, this page will likely be freed soon anyway. | |
19fe0a8b | 5417 | */ |
3083ee2e JB |
5418 | if (!test_and_clear_bit(EXTENT_BUFFER_TREE_REF, &eb->bflags)) { |
5419 | spin_unlock(&eb->refs_lock); | |
5420 | return 0; | |
b9473439 | 5421 | } |
19fe0a8b | 5422 | |
f7a52a40 | 5423 | return release_extent_buffer(eb); |
6af118ce | 5424 | } |