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