Commit | Line | Data |
---|---|---|
c1d7c514 | 1 | // SPDX-License-Identifier: GPL-2.0 |
dc17ff8f CM |
2 | /* |
3 | * Copyright (C) 2007 Oracle. All rights reserved. | |
dc17ff8f CM |
4 | */ |
5 | ||
dc17ff8f | 6 | #include <linux/slab.h> |
d6bfde87 | 7 | #include <linux/blkdev.h> |
f421950f | 8 | #include <linux/writeback.h> |
a3d46aea | 9 | #include <linux/sched/mm.h> |
9b569ea0 | 10 | #include "messages.h" |
602cbe91 | 11 | #include "misc.h" |
dc17ff8f CM |
12 | #include "ctree.h" |
13 | #include "transaction.h" | |
14 | #include "btrfs_inode.h" | |
e6dcd2dc | 15 | #include "extent_io.h" |
199c2a9c | 16 | #include "disk-io.h" |
ebb8765b | 17 | #include "compression.h" |
86736342 | 18 | #include "delalloc-space.h" |
7dbeaad0 | 19 | #include "qgroup.h" |
b945a463 | 20 | #include "subpage.h" |
af142b6f | 21 | #include "file.h" |
7f0add25 | 22 | #include "super.h" |
dc17ff8f | 23 | |
6352b91d MX |
24 | static struct kmem_cache *btrfs_ordered_extent_cache; |
25 | ||
e6dcd2dc | 26 | static u64 entry_end(struct btrfs_ordered_extent *entry) |
dc17ff8f | 27 | { |
bffe633e | 28 | if (entry->file_offset + entry->num_bytes < entry->file_offset) |
e6dcd2dc | 29 | return (u64)-1; |
bffe633e | 30 | return entry->file_offset + entry->num_bytes; |
dc17ff8f CM |
31 | } |
32 | ||
d352ac68 CM |
33 | /* returns NULL if the insertion worked, or it returns the node it did find |
34 | * in the tree | |
35 | */ | |
e6dcd2dc CM |
36 | static struct rb_node *tree_insert(struct rb_root *root, u64 file_offset, |
37 | struct rb_node *node) | |
dc17ff8f | 38 | { |
d397712b CM |
39 | struct rb_node **p = &root->rb_node; |
40 | struct rb_node *parent = NULL; | |
e6dcd2dc | 41 | struct btrfs_ordered_extent *entry; |
dc17ff8f | 42 | |
d397712b | 43 | while (*p) { |
dc17ff8f | 44 | parent = *p; |
e6dcd2dc | 45 | entry = rb_entry(parent, struct btrfs_ordered_extent, rb_node); |
dc17ff8f | 46 | |
e6dcd2dc | 47 | if (file_offset < entry->file_offset) |
dc17ff8f | 48 | p = &(*p)->rb_left; |
e6dcd2dc | 49 | else if (file_offset >= entry_end(entry)) |
dc17ff8f CM |
50 | p = &(*p)->rb_right; |
51 | else | |
52 | return parent; | |
53 | } | |
54 | ||
55 | rb_link_node(node, parent, p); | |
56 | rb_insert_color(node, root); | |
57 | return NULL; | |
58 | } | |
59 | ||
d352ac68 CM |
60 | /* |
61 | * look for a given offset in the tree, and if it can't be found return the | |
62 | * first lesser offset | |
63 | */ | |
e6dcd2dc CM |
64 | static struct rb_node *__tree_search(struct rb_root *root, u64 file_offset, |
65 | struct rb_node **prev_ret) | |
dc17ff8f | 66 | { |
d397712b | 67 | struct rb_node *n = root->rb_node; |
dc17ff8f | 68 | struct rb_node *prev = NULL; |
e6dcd2dc CM |
69 | struct rb_node *test; |
70 | struct btrfs_ordered_extent *entry; | |
71 | struct btrfs_ordered_extent *prev_entry = NULL; | |
dc17ff8f | 72 | |
d397712b | 73 | while (n) { |
e6dcd2dc | 74 | entry = rb_entry(n, struct btrfs_ordered_extent, rb_node); |
dc17ff8f CM |
75 | prev = n; |
76 | prev_entry = entry; | |
dc17ff8f | 77 | |
e6dcd2dc | 78 | if (file_offset < entry->file_offset) |
dc17ff8f | 79 | n = n->rb_left; |
e6dcd2dc | 80 | else if (file_offset >= entry_end(entry)) |
dc17ff8f CM |
81 | n = n->rb_right; |
82 | else | |
83 | return n; | |
84 | } | |
85 | if (!prev_ret) | |
86 | return NULL; | |
87 | ||
d397712b | 88 | while (prev && file_offset >= entry_end(prev_entry)) { |
e6dcd2dc CM |
89 | test = rb_next(prev); |
90 | if (!test) | |
91 | break; | |
92 | prev_entry = rb_entry(test, struct btrfs_ordered_extent, | |
93 | rb_node); | |
94 | if (file_offset < entry_end(prev_entry)) | |
95 | break; | |
96 | ||
97 | prev = test; | |
98 | } | |
99 | if (prev) | |
100 | prev_entry = rb_entry(prev, struct btrfs_ordered_extent, | |
101 | rb_node); | |
d397712b | 102 | while (prev && file_offset < entry_end(prev_entry)) { |
e6dcd2dc CM |
103 | test = rb_prev(prev); |
104 | if (!test) | |
105 | break; | |
106 | prev_entry = rb_entry(test, struct btrfs_ordered_extent, | |
107 | rb_node); | |
108 | prev = test; | |
dc17ff8f CM |
109 | } |
110 | *prev_ret = prev; | |
111 | return NULL; | |
112 | } | |
113 | ||
4b46fce2 JB |
114 | static int range_overlaps(struct btrfs_ordered_extent *entry, u64 file_offset, |
115 | u64 len) | |
116 | { | |
117 | if (file_offset + len <= entry->file_offset || | |
bffe633e | 118 | entry->file_offset + entry->num_bytes <= file_offset) |
4b46fce2 JB |
119 | return 0; |
120 | return 1; | |
121 | } | |
122 | ||
d352ac68 CM |
123 | /* |
124 | * look find the first ordered struct that has this offset, otherwise | |
125 | * the first one less than this offset | |
126 | */ | |
e6dcd2dc CM |
127 | static inline struct rb_node *tree_search(struct btrfs_ordered_inode_tree *tree, |
128 | u64 file_offset) | |
dc17ff8f | 129 | { |
e6dcd2dc | 130 | struct rb_root *root = &tree->tree; |
c87fb6fd | 131 | struct rb_node *prev = NULL; |
dc17ff8f | 132 | struct rb_node *ret; |
e6dcd2dc CM |
133 | struct btrfs_ordered_extent *entry; |
134 | ||
135 | if (tree->last) { | |
136 | entry = rb_entry(tree->last, struct btrfs_ordered_extent, | |
137 | rb_node); | |
20bbf20e | 138 | if (in_range(file_offset, entry->file_offset, entry->num_bytes)) |
e6dcd2dc CM |
139 | return tree->last; |
140 | } | |
141 | ret = __tree_search(root, file_offset, &prev); | |
dc17ff8f | 142 | if (!ret) |
e6dcd2dc CM |
143 | ret = prev; |
144 | if (ret) | |
145 | tree->last = ret; | |
dc17ff8f CM |
146 | return ret; |
147 | } | |
148 | ||
53d9981c CH |
149 | static struct btrfs_ordered_extent *alloc_ordered_extent( |
150 | struct btrfs_inode *inode, u64 file_offset, u64 num_bytes, | |
151 | u64 ram_bytes, u64 disk_bytenr, u64 disk_num_bytes, | |
152 | u64 offset, unsigned long flags, int compress_type) | |
dc17ff8f | 153 | { |
e6dcd2dc | 154 | struct btrfs_ordered_extent *entry; |
7dbeaad0 QW |
155 | int ret; |
156 | ||
cb36a9bb OS |
157 | if (flags & |
158 | ((1 << BTRFS_ORDERED_NOCOW) | (1 << BTRFS_ORDERED_PREALLOC))) { | |
7dbeaad0 | 159 | /* For nocow write, we can release the qgroup rsv right now */ |
8b8a979f | 160 | ret = btrfs_qgroup_free_data(inode, NULL, file_offset, num_bytes); |
7dbeaad0 | 161 | if (ret < 0) |
cf6d1aa4 | 162 | return ERR_PTR(ret); |
7dbeaad0 QW |
163 | } else { |
164 | /* | |
165 | * The ordered extent has reserved qgroup space, release now | |
166 | * and pass the reserved number for qgroup_record to free. | |
167 | */ | |
72b7d15b | 168 | ret = btrfs_qgroup_release_data(inode, file_offset, num_bytes); |
7dbeaad0 | 169 | if (ret < 0) |
cf6d1aa4 | 170 | return ERR_PTR(ret); |
7dbeaad0 | 171 | } |
6352b91d | 172 | entry = kmem_cache_zalloc(btrfs_ordered_extent_cache, GFP_NOFS); |
dc17ff8f | 173 | if (!entry) |
cf6d1aa4 | 174 | return ERR_PTR(-ENOMEM); |
dc17ff8f | 175 | |
e6dcd2dc | 176 | entry->file_offset = file_offset; |
bffe633e | 177 | entry->num_bytes = num_bytes; |
cb36a9bb OS |
178 | entry->ram_bytes = ram_bytes; |
179 | entry->disk_bytenr = disk_bytenr; | |
bffe633e | 180 | entry->disk_num_bytes = disk_num_bytes; |
cb36a9bb | 181 | entry->offset = offset; |
bffe633e | 182 | entry->bytes_left = num_bytes; |
da69fea9 | 183 | entry->inode = igrab(&inode->vfs_inode); |
261507a0 | 184 | entry->compress_type = compress_type; |
77cef2ec | 185 | entry->truncated_len = (u64)-1; |
7dbeaad0 | 186 | entry->qgroup_rsv = ret; |
cb36a9bb | 187 | entry->flags = flags; |
e76edab7 | 188 | refcount_set(&entry->refs, 1); |
e6dcd2dc CM |
189 | init_waitqueue_head(&entry->wait); |
190 | INIT_LIST_HEAD(&entry->list); | |
48778179 | 191 | INIT_LIST_HEAD(&entry->log_list); |
3eaa2885 | 192 | INIT_LIST_HEAD(&entry->root_extent_list); |
9afab882 MX |
193 | INIT_LIST_HEAD(&entry->work_list); |
194 | init_completion(&entry->completion); | |
dc17ff8f | 195 | |
53d9981c CH |
196 | /* |
197 | * We don't need the count_max_extents here, we can assume that all of | |
198 | * that work has been done at higher layers, so this is truly the | |
199 | * smallest the extent is going to get. | |
200 | */ | |
201 | spin_lock(&inode->lock); | |
202 | btrfs_mod_outstanding_extents(inode, 1); | |
203 | spin_unlock(&inode->lock); | |
204 | ||
205 | return entry; | |
206 | } | |
207 | ||
208 | static void insert_ordered_extent(struct btrfs_ordered_extent *entry) | |
209 | { | |
210 | struct btrfs_inode *inode = BTRFS_I(entry->inode); | |
211 | struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; | |
212 | struct btrfs_root *root = inode->root; | |
213 | struct btrfs_fs_info *fs_info = root->fs_info; | |
214 | struct rb_node *node; | |
215 | ||
acbf1dd0 | 216 | trace_btrfs_ordered_extent_add(inode, entry); |
1abe9b8a | 217 | |
53d9981c CH |
218 | percpu_counter_add_batch(&fs_info->ordered_bytes, entry->num_bytes, |
219 | fs_info->delalloc_batch); | |
220 | ||
221 | /* One ref for the tree. */ | |
222 | refcount_inc(&entry->refs); | |
223 | ||
5fd02043 | 224 | spin_lock_irq(&tree->lock); |
53d9981c | 225 | node = tree_insert(&tree->tree, entry->file_offset, &entry->rb_node); |
43c04fb1 | 226 | if (node) |
511a32b5 NB |
227 | btrfs_panic(fs_info, -EEXIST, |
228 | "inconsistency in ordered tree at offset %llu", | |
53d9981c | 229 | entry->file_offset); |
5fd02043 | 230 | spin_unlock_irq(&tree->lock); |
d397712b | 231 | |
199c2a9c | 232 | spin_lock(&root->ordered_extent_lock); |
3eaa2885 | 233 | list_add_tail(&entry->root_extent_list, |
199c2a9c MX |
234 | &root->ordered_extents); |
235 | root->nr_ordered_extents++; | |
236 | if (root->nr_ordered_extents == 1) { | |
0b246afa | 237 | spin_lock(&fs_info->ordered_root_lock); |
199c2a9c | 238 | BUG_ON(!list_empty(&root->ordered_root)); |
0b246afa JM |
239 | list_add_tail(&root->ordered_root, &fs_info->ordered_roots); |
240 | spin_unlock(&fs_info->ordered_root_lock); | |
199c2a9c MX |
241 | } |
242 | spin_unlock(&root->ordered_extent_lock); | |
53d9981c | 243 | } |
3eaa2885 | 244 | |
53d9981c CH |
245 | /* |
246 | * Add an ordered extent to the per-inode tree. | |
247 | * | |
248 | * @inode: Inode that this extent is for. | |
249 | * @file_offset: Logical offset in file where the extent starts. | |
250 | * @num_bytes: Logical length of extent in file. | |
251 | * @ram_bytes: Full length of unencoded data. | |
252 | * @disk_bytenr: Offset of extent on disk. | |
253 | * @disk_num_bytes: Size of extent on disk. | |
254 | * @offset: Offset into unencoded data where file data starts. | |
255 | * @flags: Flags specifying type of extent (1 << BTRFS_ORDERED_*). | |
256 | * @compress_type: Compression algorithm used for data. | |
257 | * | |
258 | * Most of these parameters correspond to &struct btrfs_file_extent_item. The | |
259 | * tree is given a single reference on the ordered extent that was inserted, and | |
260 | * the returned pointer is given a second reference. | |
261 | * | |
262 | * Return: the new ordered extent or error pointer. | |
263 | */ | |
264 | struct btrfs_ordered_extent *btrfs_alloc_ordered_extent( | |
265 | struct btrfs_inode *inode, u64 file_offset, | |
266 | u64 num_bytes, u64 ram_bytes, u64 disk_bytenr, | |
267 | u64 disk_num_bytes, u64 offset, unsigned long flags, | |
268 | int compress_type) | |
269 | { | |
270 | struct btrfs_ordered_extent *entry; | |
8b62f87b | 271 | |
53d9981c | 272 | ASSERT((flags & ~BTRFS_ORDERED_TYPE_FLAGS) == 0); |
cf6d1aa4 | 273 | |
53d9981c CH |
274 | entry = alloc_ordered_extent(inode, file_offset, num_bytes, ram_bytes, |
275 | disk_bytenr, disk_num_bytes, offset, flags, | |
276 | compress_type); | |
277 | if (!IS_ERR(entry)) | |
278 | insert_ordered_extent(entry); | |
cf6d1aa4 BB |
279 | return entry; |
280 | } | |
281 | ||
eb84ae03 CM |
282 | /* |
283 | * Add a struct btrfs_ordered_sum into the list of checksums to be inserted | |
3edf7d33 CM |
284 | * when an ordered extent is finished. If the list covers more than one |
285 | * ordered extent, it is split across multiples. | |
eb84ae03 | 286 | */ |
f9756261 | 287 | void btrfs_add_ordered_sum(struct btrfs_ordered_extent *entry, |
143bede5 | 288 | struct btrfs_ordered_sum *sum) |
dc17ff8f | 289 | { |
e6dcd2dc | 290 | struct btrfs_ordered_inode_tree *tree; |
dc17ff8f | 291 | |
f9756261 | 292 | tree = &BTRFS_I(entry->inode)->ordered_tree; |
5fd02043 | 293 | spin_lock_irq(&tree->lock); |
e6dcd2dc | 294 | list_add_tail(&sum->list, &entry->list); |
5fd02043 | 295 | spin_unlock_irq(&tree->lock); |
dc17ff8f CM |
296 | } |
297 | ||
711f447b CH |
298 | static void finish_ordered_fn(struct btrfs_work *work) |
299 | { | |
300 | struct btrfs_ordered_extent *ordered_extent; | |
301 | ||
302 | ordered_extent = container_of(work, struct btrfs_ordered_extent, work); | |
303 | btrfs_finish_ordered_io(ordered_extent); | |
304 | } | |
305 | ||
53df2586 CH |
306 | static bool can_finish_ordered_extent(struct btrfs_ordered_extent *ordered, |
307 | struct page *page, u64 file_offset, | |
308 | u64 len, bool uptodate) | |
309 | { | |
310 | struct btrfs_inode *inode = BTRFS_I(ordered->inode); | |
311 | struct btrfs_fs_info *fs_info = inode->root->fs_info; | |
312 | ||
313 | lockdep_assert_held(&inode->ordered_tree.lock); | |
314 | ||
315 | if (page) { | |
316 | ASSERT(page->mapping); | |
317 | ASSERT(page_offset(page) <= file_offset); | |
318 | ASSERT(file_offset + len <= page_offset(page) + PAGE_SIZE); | |
319 | ||
320 | /* | |
321 | * Ordered (Private2) bit indicates whether we still have | |
322 | * pending io unfinished for the ordered extent. | |
323 | * | |
324 | * If there's no such bit, we need to skip to next range. | |
325 | */ | |
326 | if (!btrfs_page_test_ordered(fs_info, page, file_offset, len)) | |
327 | return false; | |
328 | btrfs_page_clear_ordered(fs_info, page, file_offset, len); | |
329 | } | |
330 | ||
331 | /* Now we're fine to update the accounting. */ | |
332 | if (WARN_ON_ONCE(len > ordered->bytes_left)) { | |
333 | btrfs_crit(fs_info, | |
334 | "bad ordered extent accounting, root=%llu ino=%llu OE offset=%llu OE len=%llu to_dec=%llu left=%llu", | |
335 | inode->root->root_key.objectid, btrfs_ino(inode), | |
336 | ordered->file_offset, ordered->num_bytes, | |
337 | len, ordered->bytes_left); | |
338 | ordered->bytes_left = 0; | |
339 | } else { | |
340 | ordered->bytes_left -= len; | |
341 | } | |
342 | ||
343 | if (!uptodate) | |
344 | set_bit(BTRFS_ORDERED_IOERR, &ordered->flags); | |
345 | ||
346 | if (ordered->bytes_left) | |
347 | return false; | |
348 | ||
349 | /* | |
350 | * All the IO of the ordered extent is finished, we need to queue | |
351 | * the finish_func to be executed. | |
352 | */ | |
353 | set_bit(BTRFS_ORDERED_IO_DONE, &ordered->flags); | |
354 | cond_wake_up(&ordered->wait); | |
355 | refcount_inc(&ordered->refs); | |
356 | trace_btrfs_ordered_extent_mark_finished(inode, ordered); | |
357 | return true; | |
358 | } | |
359 | ||
2d6f107e CH |
360 | static void btrfs_queue_ordered_fn(struct btrfs_ordered_extent *ordered) |
361 | { | |
362 | struct btrfs_inode *inode = BTRFS_I(ordered->inode); | |
363 | struct btrfs_fs_info *fs_info = inode->root->fs_info; | |
364 | struct btrfs_workqueue *wq = btrfs_is_free_space_inode(inode) ? | |
365 | fs_info->endio_freespace_worker : fs_info->endio_write_workers; | |
366 | ||
367 | btrfs_init_work(&ordered->work, finish_ordered_fn, NULL, NULL); | |
368 | btrfs_queue_work(wq, &ordered->work); | |
369 | } | |
370 | ||
163cf09c | 371 | /* |
e65f152e | 372 | * Mark all ordered extents io inside the specified range finished. |
163cf09c | 373 | * |
143823cf | 374 | * @page: The involved page for the operation. |
e65f152e QW |
375 | * For uncompressed buffered IO, the page status also needs to be |
376 | * updated to indicate whether the pending ordered io is finished. | |
377 | * Can be NULL for direct IO and compressed write. | |
378 | * For these cases, callers are ensured they won't execute the | |
379 | * endio function twice. | |
163cf09c | 380 | * |
e65f152e | 381 | * This function is called for endio, thus the range must have ordered |
143823cf | 382 | * extent(s) covering it. |
163cf09c | 383 | */ |
e65f152e | 384 | void btrfs_mark_ordered_io_finished(struct btrfs_inode *inode, |
711f447b CH |
385 | struct page *page, u64 file_offset, |
386 | u64 num_bytes, bool uptodate) | |
163cf09c | 387 | { |
7095821e | 388 | struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; |
163cf09c CM |
389 | struct rb_node *node; |
390 | struct btrfs_ordered_extent *entry = NULL; | |
5fd02043 | 391 | unsigned long flags; |
e65f152e QW |
392 | u64 cur = file_offset; |
393 | ||
5fd02043 | 394 | spin_lock_irqsave(&tree->lock, flags); |
e65f152e QW |
395 | while (cur < file_offset + num_bytes) { |
396 | u64 entry_end; | |
397 | u64 end; | |
398 | u32 len; | |
399 | ||
400 | node = tree_search(tree, cur); | |
401 | /* No ordered extents at all */ | |
402 | if (!node) | |
403 | break; | |
5fd02043 | 404 | |
e65f152e QW |
405 | entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); |
406 | entry_end = entry->file_offset + entry->num_bytes; | |
58f74b22 | 407 | /* |
e65f152e QW |
408 | * |<-- OE --->| | |
409 | * cur | |
410 | * Go to next OE. | |
58f74b22 | 411 | */ |
e65f152e QW |
412 | if (cur >= entry_end) { |
413 | node = rb_next(node); | |
414 | /* No more ordered extents, exit */ | |
415 | if (!node) | |
416 | break; | |
417 | entry = rb_entry(node, struct btrfs_ordered_extent, | |
418 | rb_node); | |
419 | ||
420 | /* Go to next ordered extent and continue */ | |
421 | cur = entry->file_offset; | |
422 | continue; | |
423 | } | |
424 | /* | |
425 | * | |<--- OE --->| | |
426 | * cur | |
427 | * Go to the start of OE. | |
428 | */ | |
429 | if (cur < entry->file_offset) { | |
430 | cur = entry->file_offset; | |
431 | continue; | |
432 | } | |
433 | ||
434 | /* | |
435 | * Now we are definitely inside one ordered extent. | |
436 | * | |
437 | * |<--- OE --->| | |
438 | * | | |
439 | * cur | |
440 | */ | |
441 | end = min(entry->file_offset + entry->num_bytes, | |
442 | file_offset + num_bytes) - 1; | |
443 | ASSERT(end + 1 - cur < U32_MAX); | |
444 | len = end + 1 - cur; | |
445 | ||
53df2586 | 446 | if (can_finish_ordered_extent(entry, page, cur, len, uptodate)) { |
e65f152e | 447 | spin_unlock_irqrestore(&tree->lock, flags); |
2d6f107e | 448 | btrfs_queue_ordered_fn(entry); |
e65f152e QW |
449 | spin_lock_irqsave(&tree->lock, flags); |
450 | } | |
451 | cur += len; | |
163cf09c | 452 | } |
5fd02043 | 453 | spin_unlock_irqrestore(&tree->lock, flags); |
163cf09c CM |
454 | } |
455 | ||
eb84ae03 | 456 | /* |
58f74b22 QW |
457 | * Finish IO for one ordered extent across a given range. The range can only |
458 | * contain one ordered extent. | |
459 | * | |
460 | * @cached: The cached ordered extent. If not NULL, we can skip the tree | |
461 | * search and use the ordered extent directly. | |
462 | * Will be also used to store the finished ordered extent. | |
463 | * @file_offset: File offset for the finished IO | |
464 | * @io_size: Length of the finish IO range | |
eb84ae03 | 465 | * |
58f74b22 QW |
466 | * Return true if the ordered extent is finished in the range, and update |
467 | * @cached. | |
468 | * Return false otherwise. | |
469 | * | |
470 | * NOTE: The range can NOT cross multiple ordered extents. | |
471 | * Thus caller should ensure the range doesn't cross ordered extents. | |
eb84ae03 | 472 | */ |
58f74b22 QW |
473 | bool btrfs_dec_test_ordered_pending(struct btrfs_inode *inode, |
474 | struct btrfs_ordered_extent **cached, | |
f41b6ba9 | 475 | u64 file_offset, u64 io_size) |
dc17ff8f | 476 | { |
90c0304c | 477 | struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; |
dc17ff8f | 478 | struct rb_node *node; |
5a1a3df1 | 479 | struct btrfs_ordered_extent *entry = NULL; |
5fd02043 | 480 | unsigned long flags; |
58f74b22 | 481 | bool finished = false; |
e6dcd2dc | 482 | |
5fd02043 JB |
483 | spin_lock_irqsave(&tree->lock, flags); |
484 | if (cached && *cached) { | |
485 | entry = *cached; | |
486 | goto have_entry; | |
487 | } | |
488 | ||
e6dcd2dc | 489 | node = tree_search(tree, file_offset); |
58f74b22 | 490 | if (!node) |
e6dcd2dc | 491 | goto out; |
dc17ff8f | 492 | |
e6dcd2dc | 493 | entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); |
5fd02043 | 494 | have_entry: |
20bbf20e | 495 | if (!in_range(file_offset, entry->file_offset, entry->num_bytes)) |
e6dcd2dc | 496 | goto out; |
e6dcd2dc | 497 | |
58f74b22 | 498 | if (io_size > entry->bytes_left) |
90c0304c | 499 | btrfs_crit(inode->root->fs_info, |
efe120a0 | 500 | "bad ordered accounting left %llu size %llu", |
c1c9ff7c | 501 | entry->bytes_left, io_size); |
58f74b22 | 502 | |
8b62b72b | 503 | entry->bytes_left -= io_size; |
5fd02043 | 504 | |
af7a6509 | 505 | if (entry->bytes_left == 0) { |
58f74b22 QW |
506 | /* |
507 | * Ensure only one caller can set the flag and finished_ret | |
508 | * accordingly | |
509 | */ | |
510 | finished = !test_and_set_bit(BTRFS_ORDERED_IO_DONE, &entry->flags); | |
093258e6 DS |
511 | /* test_and_set_bit implies a barrier */ |
512 | cond_wake_up_nomb(&entry->wait); | |
af7a6509 | 513 | } |
e6dcd2dc | 514 | out: |
58f74b22 | 515 | if (finished && cached && entry) { |
5a1a3df1 | 516 | *cached = entry; |
e76edab7 | 517 | refcount_inc(&entry->refs); |
5bea2508 | 518 | trace_btrfs_ordered_extent_dec_test_pending(inode, entry); |
5a1a3df1 | 519 | } |
5fd02043 | 520 | spin_unlock_irqrestore(&tree->lock, flags); |
58f74b22 | 521 | return finished; |
e6dcd2dc | 522 | } |
dc17ff8f | 523 | |
eb84ae03 CM |
524 | /* |
525 | * used to drop a reference on an ordered extent. This will free | |
526 | * the extent if the last reference is dropped | |
527 | */ | |
143bede5 | 528 | void btrfs_put_ordered_extent(struct btrfs_ordered_extent *entry) |
e6dcd2dc | 529 | { |
ba1da2f4 CM |
530 | struct list_head *cur; |
531 | struct btrfs_ordered_sum *sum; | |
532 | ||
acbf1dd0 | 533 | trace_btrfs_ordered_extent_put(BTRFS_I(entry->inode), entry); |
1abe9b8a | 534 | |
e76edab7 | 535 | if (refcount_dec_and_test(&entry->refs)) { |
61de718f | 536 | ASSERT(list_empty(&entry->root_extent_list)); |
48778179 | 537 | ASSERT(list_empty(&entry->log_list)); |
61de718f | 538 | ASSERT(RB_EMPTY_NODE(&entry->rb_node)); |
5fd02043 | 539 | if (entry->inode) |
e55cf7ca | 540 | btrfs_add_delayed_iput(BTRFS_I(entry->inode)); |
d397712b | 541 | while (!list_empty(&entry->list)) { |
ba1da2f4 CM |
542 | cur = entry->list.next; |
543 | sum = list_entry(cur, struct btrfs_ordered_sum, list); | |
544 | list_del(&sum->list); | |
a3d46aea | 545 | kvfree(sum); |
ba1da2f4 | 546 | } |
6352b91d | 547 | kmem_cache_free(btrfs_ordered_extent_cache, entry); |
ba1da2f4 | 548 | } |
dc17ff8f | 549 | } |
cee36a03 | 550 | |
eb84ae03 CM |
551 | /* |
552 | * remove an ordered extent from the tree. No references are dropped | |
5fd02043 | 553 | * and waiters are woken up. |
eb84ae03 | 554 | */ |
71fe0a55 | 555 | void btrfs_remove_ordered_extent(struct btrfs_inode *btrfs_inode, |
5fd02043 | 556 | struct btrfs_ordered_extent *entry) |
cee36a03 | 557 | { |
e6dcd2dc | 558 | struct btrfs_ordered_inode_tree *tree; |
8b62f87b | 559 | struct btrfs_root *root = btrfs_inode->root; |
71fe0a55 | 560 | struct btrfs_fs_info *fs_info = root->fs_info; |
cee36a03 | 561 | struct rb_node *node; |
48778179 | 562 | bool pending; |
5f4403e1 IA |
563 | bool freespace_inode; |
564 | ||
565 | /* | |
566 | * If this is a free space inode the thread has not acquired the ordered | |
567 | * extents lockdep map. | |
568 | */ | |
569 | freespace_inode = btrfs_is_free_space_inode(btrfs_inode); | |
cee36a03 | 570 | |
8b53779e | 571 | btrfs_lockdep_acquire(fs_info, btrfs_trans_pending_ordered); |
ebfe4d4e | 572 | /* This is paired with btrfs_alloc_ordered_extent. */ |
8b62f87b JB |
573 | spin_lock(&btrfs_inode->lock); |
574 | btrfs_mod_outstanding_extents(btrfs_inode, -1); | |
575 | spin_unlock(&btrfs_inode->lock); | |
7c0c7269 OS |
576 | if (root != fs_info->tree_root) { |
577 | u64 release; | |
578 | ||
579 | if (test_bit(BTRFS_ORDERED_ENCODED, &entry->flags)) | |
580 | release = entry->disk_num_bytes; | |
581 | else | |
582 | release = entry->num_bytes; | |
583 | btrfs_delalloc_release_metadata(btrfs_inode, release, false); | |
584 | } | |
8b62f87b | 585 | |
5deb17e1 JB |
586 | percpu_counter_add_batch(&fs_info->ordered_bytes, -entry->num_bytes, |
587 | fs_info->delalloc_batch); | |
4297ff84 | 588 | |
8b62f87b | 589 | tree = &btrfs_inode->ordered_tree; |
5fd02043 | 590 | spin_lock_irq(&tree->lock); |
e6dcd2dc | 591 | node = &entry->rb_node; |
cee36a03 | 592 | rb_erase(node, &tree->tree); |
61de718f | 593 | RB_CLEAR_NODE(node); |
1b8e7e45 FDBM |
594 | if (tree->last == node) |
595 | tree->last = NULL; | |
e6dcd2dc | 596 | set_bit(BTRFS_ORDERED_COMPLETE, &entry->flags); |
48778179 | 597 | pending = test_and_clear_bit(BTRFS_ORDERED_PENDING, &entry->flags); |
5fd02043 | 598 | spin_unlock_irq(&tree->lock); |
3eaa2885 | 599 | |
48778179 FM |
600 | /* |
601 | * The current running transaction is waiting on us, we need to let it | |
602 | * know that we're complete and wake it up. | |
603 | */ | |
604 | if (pending) { | |
605 | struct btrfs_transaction *trans; | |
606 | ||
607 | /* | |
608 | * The checks for trans are just a formality, it should be set, | |
609 | * but if it isn't we don't want to deref/assert under the spin | |
610 | * lock, so be nice and check if trans is set, but ASSERT() so | |
611 | * if it isn't set a developer will notice. | |
612 | */ | |
613 | spin_lock(&fs_info->trans_lock); | |
614 | trans = fs_info->running_transaction; | |
615 | if (trans) | |
616 | refcount_inc(&trans->use_count); | |
617 | spin_unlock(&fs_info->trans_lock); | |
618 | ||
619 | ASSERT(trans); | |
620 | if (trans) { | |
621 | if (atomic_dec_and_test(&trans->pending_ordered)) | |
622 | wake_up(&trans->pending_wait); | |
623 | btrfs_put_transaction(trans); | |
624 | } | |
625 | } | |
626 | ||
8b53779e IA |
627 | btrfs_lockdep_release(fs_info, btrfs_trans_pending_ordered); |
628 | ||
199c2a9c | 629 | spin_lock(&root->ordered_extent_lock); |
3eaa2885 | 630 | list_del_init(&entry->root_extent_list); |
199c2a9c | 631 | root->nr_ordered_extents--; |
5a3f23d5 | 632 | |
71fe0a55 | 633 | trace_btrfs_ordered_extent_remove(btrfs_inode, entry); |
1abe9b8a | 634 | |
199c2a9c | 635 | if (!root->nr_ordered_extents) { |
0b246afa | 636 | spin_lock(&fs_info->ordered_root_lock); |
199c2a9c MX |
637 | BUG_ON(list_empty(&root->ordered_root)); |
638 | list_del_init(&root->ordered_root); | |
0b246afa | 639 | spin_unlock(&fs_info->ordered_root_lock); |
199c2a9c MX |
640 | } |
641 | spin_unlock(&root->ordered_extent_lock); | |
e6dcd2dc | 642 | wake_up(&entry->wait); |
5f4403e1 IA |
643 | if (!freespace_inode) |
644 | btrfs_lockdep_release(fs_info, btrfs_ordered_extent); | |
cee36a03 CM |
645 | } |
646 | ||
d458b054 | 647 | static void btrfs_run_ordered_extent_work(struct btrfs_work *work) |
9afab882 MX |
648 | { |
649 | struct btrfs_ordered_extent *ordered; | |
650 | ||
651 | ordered = container_of(work, struct btrfs_ordered_extent, flush_work); | |
36d45567 | 652 | btrfs_start_ordered_extent(ordered); |
9afab882 MX |
653 | complete(&ordered->completion); |
654 | } | |
655 | ||
d352ac68 CM |
656 | /* |
657 | * wait for all the ordered extents in a root. This is done when balancing | |
658 | * space between drives. | |
659 | */ | |
6374e57a | 660 | u64 btrfs_wait_ordered_extents(struct btrfs_root *root, u64 nr, |
578def7c | 661 | const u64 range_start, const u64 range_len) |
3eaa2885 | 662 | { |
0b246afa | 663 | struct btrfs_fs_info *fs_info = root->fs_info; |
578def7c FM |
664 | LIST_HEAD(splice); |
665 | LIST_HEAD(skipped); | |
666 | LIST_HEAD(works); | |
9afab882 | 667 | struct btrfs_ordered_extent *ordered, *next; |
6374e57a | 668 | u64 count = 0; |
578def7c | 669 | const u64 range_end = range_start + range_len; |
3eaa2885 | 670 | |
31f3d255 | 671 | mutex_lock(&root->ordered_extent_mutex); |
199c2a9c MX |
672 | spin_lock(&root->ordered_extent_lock); |
673 | list_splice_init(&root->ordered_extents, &splice); | |
b0244199 | 674 | while (!list_empty(&splice) && nr) { |
199c2a9c MX |
675 | ordered = list_first_entry(&splice, struct btrfs_ordered_extent, |
676 | root_extent_list); | |
578def7c | 677 | |
bffe633e OS |
678 | if (range_end <= ordered->disk_bytenr || |
679 | ordered->disk_bytenr + ordered->disk_num_bytes <= range_start) { | |
578def7c FM |
680 | list_move_tail(&ordered->root_extent_list, &skipped); |
681 | cond_resched_lock(&root->ordered_extent_lock); | |
682 | continue; | |
683 | } | |
684 | ||
199c2a9c MX |
685 | list_move_tail(&ordered->root_extent_list, |
686 | &root->ordered_extents); | |
e76edab7 | 687 | refcount_inc(&ordered->refs); |
199c2a9c | 688 | spin_unlock(&root->ordered_extent_lock); |
3eaa2885 | 689 | |
a44903ab QW |
690 | btrfs_init_work(&ordered->flush_work, |
691 | btrfs_run_ordered_extent_work, NULL, NULL); | |
199c2a9c | 692 | list_add_tail(&ordered->work_list, &works); |
0b246afa | 693 | btrfs_queue_work(fs_info->flush_workers, &ordered->flush_work); |
3eaa2885 | 694 | |
9afab882 | 695 | cond_resched(); |
199c2a9c | 696 | spin_lock(&root->ordered_extent_lock); |
6374e57a | 697 | if (nr != U64_MAX) |
b0244199 MX |
698 | nr--; |
699 | count++; | |
3eaa2885 | 700 | } |
578def7c | 701 | list_splice_tail(&skipped, &root->ordered_extents); |
b0244199 | 702 | list_splice_tail(&splice, &root->ordered_extents); |
199c2a9c | 703 | spin_unlock(&root->ordered_extent_lock); |
9afab882 MX |
704 | |
705 | list_for_each_entry_safe(ordered, next, &works, work_list) { | |
706 | list_del_init(&ordered->work_list); | |
707 | wait_for_completion(&ordered->completion); | |
9afab882 | 708 | btrfs_put_ordered_extent(ordered); |
9afab882 MX |
709 | cond_resched(); |
710 | } | |
31f3d255 | 711 | mutex_unlock(&root->ordered_extent_mutex); |
b0244199 MX |
712 | |
713 | return count; | |
3eaa2885 CM |
714 | } |
715 | ||
042528f8 | 716 | void btrfs_wait_ordered_roots(struct btrfs_fs_info *fs_info, u64 nr, |
6374e57a | 717 | const u64 range_start, const u64 range_len) |
199c2a9c MX |
718 | { |
719 | struct btrfs_root *root; | |
720 | struct list_head splice; | |
6374e57a | 721 | u64 done; |
199c2a9c MX |
722 | |
723 | INIT_LIST_HEAD(&splice); | |
724 | ||
8b9d83cd | 725 | mutex_lock(&fs_info->ordered_operations_mutex); |
199c2a9c MX |
726 | spin_lock(&fs_info->ordered_root_lock); |
727 | list_splice_init(&fs_info->ordered_roots, &splice); | |
b0244199 | 728 | while (!list_empty(&splice) && nr) { |
199c2a9c MX |
729 | root = list_first_entry(&splice, struct btrfs_root, |
730 | ordered_root); | |
00246528 | 731 | root = btrfs_grab_root(root); |
199c2a9c MX |
732 | BUG_ON(!root); |
733 | list_move_tail(&root->ordered_root, | |
734 | &fs_info->ordered_roots); | |
735 | spin_unlock(&fs_info->ordered_root_lock); | |
736 | ||
578def7c FM |
737 | done = btrfs_wait_ordered_extents(root, nr, |
738 | range_start, range_len); | |
00246528 | 739 | btrfs_put_root(root); |
199c2a9c MX |
740 | |
741 | spin_lock(&fs_info->ordered_root_lock); | |
6374e57a | 742 | if (nr != U64_MAX) { |
b0244199 | 743 | nr -= done; |
b0244199 | 744 | } |
199c2a9c | 745 | } |
931aa877 | 746 | list_splice_tail(&splice, &fs_info->ordered_roots); |
199c2a9c | 747 | spin_unlock(&fs_info->ordered_root_lock); |
8b9d83cd | 748 | mutex_unlock(&fs_info->ordered_operations_mutex); |
199c2a9c MX |
749 | } |
750 | ||
eb84ae03 | 751 | /* |
36d45567 | 752 | * Start IO and wait for a given ordered extent to finish. |
eb84ae03 | 753 | * |
36d45567 CH |
754 | * Wait on page writeback for all the pages in the extent and the IO completion |
755 | * code to insert metadata into the btree corresponding to the extent. | |
eb84ae03 | 756 | */ |
36d45567 | 757 | void btrfs_start_ordered_extent(struct btrfs_ordered_extent *entry) |
e6dcd2dc CM |
758 | { |
759 | u64 start = entry->file_offset; | |
bffe633e | 760 | u64 end = start + entry->num_bytes - 1; |
c0a43603 | 761 | struct btrfs_inode *inode = BTRFS_I(entry->inode); |
5f4403e1 | 762 | bool freespace_inode; |
e1b81e67 | 763 | |
c0a43603 | 764 | trace_btrfs_ordered_extent_start(inode, entry); |
1abe9b8a | 765 | |
5f4403e1 IA |
766 | /* |
767 | * If this is a free space inode do not take the ordered extents lockdep | |
768 | * map. | |
769 | */ | |
770 | freespace_inode = btrfs_is_free_space_inode(inode); | |
771 | ||
eb84ae03 CM |
772 | /* |
773 | * pages in the range can be dirty, clean or writeback. We | |
774 | * start IO on any dirty ones so the wait doesn't stall waiting | |
b2570314 | 775 | * for the flusher thread to find them |
eb84ae03 | 776 | */ |
4b46fce2 | 777 | if (!test_bit(BTRFS_ORDERED_DIRECT, &entry->flags)) |
c0a43603 | 778 | filemap_fdatawrite_range(inode->vfs_inode.i_mapping, start, end); |
36d45567 CH |
779 | |
780 | if (!freespace_inode) | |
781 | btrfs_might_wait_for_event(inode->root->fs_info, btrfs_ordered_extent); | |
782 | wait_event(entry->wait, test_bit(BTRFS_ORDERED_COMPLETE, &entry->flags)); | |
e6dcd2dc | 783 | } |
cee36a03 | 784 | |
eb84ae03 CM |
785 | /* |
786 | * Used to wait on ordered extents across a large range of bytes. | |
787 | */ | |
0ef8b726 | 788 | int btrfs_wait_ordered_range(struct inode *inode, u64 start, u64 len) |
e6dcd2dc | 789 | { |
0ef8b726 | 790 | int ret = 0; |
28aeeac1 | 791 | int ret_wb = 0; |
e6dcd2dc | 792 | u64 end; |
e5a2217e | 793 | u64 orig_end; |
e6dcd2dc | 794 | struct btrfs_ordered_extent *ordered; |
e5a2217e CM |
795 | |
796 | if (start + len < start) { | |
cf260db4 | 797 | orig_end = OFFSET_MAX; |
e5a2217e CM |
798 | } else { |
799 | orig_end = start + len - 1; | |
cf260db4 ZL |
800 | if (orig_end > OFFSET_MAX) |
801 | orig_end = OFFSET_MAX; | |
e5a2217e | 802 | } |
551ebb2d | 803 | |
e5a2217e CM |
804 | /* start IO across the range first to instantiate any delalloc |
805 | * extents | |
806 | */ | |
728404da | 807 | ret = btrfs_fdatawrite_range(inode, start, orig_end); |
0ef8b726 JB |
808 | if (ret) |
809 | return ret; | |
728404da | 810 | |
28aeeac1 FM |
811 | /* |
812 | * If we have a writeback error don't return immediately. Wait first | |
813 | * for any ordered extents that haven't completed yet. This is to make | |
814 | * sure no one can dirty the same page ranges and call writepages() | |
815 | * before the ordered extents complete - to avoid failures (-EEXIST) | |
816 | * when adding the new ordered extents to the ordered tree. | |
817 | */ | |
818 | ret_wb = filemap_fdatawait_range(inode->i_mapping, start, orig_end); | |
e5a2217e | 819 | |
f421950f | 820 | end = orig_end; |
d397712b | 821 | while (1) { |
6d072c8e | 822 | ordered = btrfs_lookup_first_ordered_extent(BTRFS_I(inode), end); |
d397712b | 823 | if (!ordered) |
e6dcd2dc | 824 | break; |
e5a2217e | 825 | if (ordered->file_offset > orig_end) { |
e6dcd2dc CM |
826 | btrfs_put_ordered_extent(ordered); |
827 | break; | |
828 | } | |
bffe633e | 829 | if (ordered->file_offset + ordered->num_bytes <= start) { |
e6dcd2dc CM |
830 | btrfs_put_ordered_extent(ordered); |
831 | break; | |
832 | } | |
36d45567 | 833 | btrfs_start_ordered_extent(ordered); |
e6dcd2dc | 834 | end = ordered->file_offset; |
e75fd33b FM |
835 | /* |
836 | * If the ordered extent had an error save the error but don't | |
837 | * exit without waiting first for all other ordered extents in | |
838 | * the range to complete. | |
839 | */ | |
0ef8b726 JB |
840 | if (test_bit(BTRFS_ORDERED_IOERR, &ordered->flags)) |
841 | ret = -EIO; | |
e6dcd2dc | 842 | btrfs_put_ordered_extent(ordered); |
e75fd33b | 843 | if (end == 0 || end == start) |
e6dcd2dc CM |
844 | break; |
845 | end--; | |
846 | } | |
28aeeac1 | 847 | return ret_wb ? ret_wb : ret; |
cee36a03 CM |
848 | } |
849 | ||
eb84ae03 CM |
850 | /* |
851 | * find an ordered extent corresponding to file_offset. return NULL if | |
852 | * nothing is found, otherwise take a reference on the extent and return it | |
853 | */ | |
c3504372 | 854 | struct btrfs_ordered_extent *btrfs_lookup_ordered_extent(struct btrfs_inode *inode, |
e6dcd2dc CM |
855 | u64 file_offset) |
856 | { | |
857 | struct btrfs_ordered_inode_tree *tree; | |
858 | struct rb_node *node; | |
859 | struct btrfs_ordered_extent *entry = NULL; | |
24533f6a | 860 | unsigned long flags; |
e6dcd2dc | 861 | |
c3504372 | 862 | tree = &inode->ordered_tree; |
24533f6a | 863 | spin_lock_irqsave(&tree->lock, flags); |
e6dcd2dc CM |
864 | node = tree_search(tree, file_offset); |
865 | if (!node) | |
866 | goto out; | |
867 | ||
868 | entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); | |
20bbf20e | 869 | if (!in_range(file_offset, entry->file_offset, entry->num_bytes)) |
e6dcd2dc | 870 | entry = NULL; |
5bea2508 | 871 | if (entry) { |
e76edab7 | 872 | refcount_inc(&entry->refs); |
5bea2508 JT |
873 | trace_btrfs_ordered_extent_lookup(inode, entry); |
874 | } | |
e6dcd2dc | 875 | out: |
24533f6a | 876 | spin_unlock_irqrestore(&tree->lock, flags); |
e6dcd2dc CM |
877 | return entry; |
878 | } | |
879 | ||
4b46fce2 JB |
880 | /* Since the DIO code tries to lock a wide area we need to look for any ordered |
881 | * extents that exist in the range, rather than just the start of the range. | |
882 | */ | |
a776c6fa NB |
883 | struct btrfs_ordered_extent *btrfs_lookup_ordered_range( |
884 | struct btrfs_inode *inode, u64 file_offset, u64 len) | |
4b46fce2 JB |
885 | { |
886 | struct btrfs_ordered_inode_tree *tree; | |
887 | struct rb_node *node; | |
888 | struct btrfs_ordered_extent *entry = NULL; | |
889 | ||
a776c6fa | 890 | tree = &inode->ordered_tree; |
5fd02043 | 891 | spin_lock_irq(&tree->lock); |
4b46fce2 JB |
892 | node = tree_search(tree, file_offset); |
893 | if (!node) { | |
894 | node = tree_search(tree, file_offset + len); | |
895 | if (!node) | |
896 | goto out; | |
897 | } | |
898 | ||
899 | while (1) { | |
900 | entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); | |
901 | if (range_overlaps(entry, file_offset, len)) | |
902 | break; | |
903 | ||
904 | if (entry->file_offset >= file_offset + len) { | |
905 | entry = NULL; | |
906 | break; | |
907 | } | |
908 | entry = NULL; | |
909 | node = rb_next(node); | |
910 | if (!node) | |
911 | break; | |
912 | } | |
913 | out: | |
5bea2508 | 914 | if (entry) { |
e76edab7 | 915 | refcount_inc(&entry->refs); |
5bea2508 JT |
916 | trace_btrfs_ordered_extent_lookup_range(inode, entry); |
917 | } | |
5fd02043 | 918 | spin_unlock_irq(&tree->lock); |
4b46fce2 JB |
919 | return entry; |
920 | } | |
921 | ||
48778179 FM |
922 | /* |
923 | * Adds all ordered extents to the given list. The list ends up sorted by the | |
924 | * file_offset of the ordered extents. | |
925 | */ | |
926 | void btrfs_get_ordered_extents_for_logging(struct btrfs_inode *inode, | |
927 | struct list_head *list) | |
928 | { | |
929 | struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; | |
930 | struct rb_node *n; | |
931 | ||
932 | ASSERT(inode_is_locked(&inode->vfs_inode)); | |
933 | ||
934 | spin_lock_irq(&tree->lock); | |
935 | for (n = rb_first(&tree->tree); n; n = rb_next(n)) { | |
936 | struct btrfs_ordered_extent *ordered; | |
937 | ||
938 | ordered = rb_entry(n, struct btrfs_ordered_extent, rb_node); | |
939 | ||
940 | if (test_bit(BTRFS_ORDERED_LOGGED, &ordered->flags)) | |
941 | continue; | |
942 | ||
943 | ASSERT(list_empty(&ordered->log_list)); | |
944 | list_add_tail(&ordered->log_list, list); | |
945 | refcount_inc(&ordered->refs); | |
5bea2508 | 946 | trace_btrfs_ordered_extent_lookup_for_logging(inode, ordered); |
48778179 FM |
947 | } |
948 | spin_unlock_irq(&tree->lock); | |
949 | } | |
950 | ||
eb84ae03 CM |
951 | /* |
952 | * lookup and return any extent before 'file_offset'. NULL is returned | |
953 | * if none is found | |
954 | */ | |
e6dcd2dc | 955 | struct btrfs_ordered_extent * |
6d072c8e | 956 | btrfs_lookup_first_ordered_extent(struct btrfs_inode *inode, u64 file_offset) |
e6dcd2dc CM |
957 | { |
958 | struct btrfs_ordered_inode_tree *tree; | |
959 | struct rb_node *node; | |
960 | struct btrfs_ordered_extent *entry = NULL; | |
961 | ||
6d072c8e | 962 | tree = &inode->ordered_tree; |
5fd02043 | 963 | spin_lock_irq(&tree->lock); |
e6dcd2dc CM |
964 | node = tree_search(tree, file_offset); |
965 | if (!node) | |
966 | goto out; | |
967 | ||
968 | entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); | |
e76edab7 | 969 | refcount_inc(&entry->refs); |
5bea2508 | 970 | trace_btrfs_ordered_extent_lookup_first(inode, entry); |
e6dcd2dc | 971 | out: |
5fd02043 | 972 | spin_unlock_irq(&tree->lock); |
e6dcd2dc | 973 | return entry; |
81d7ed29 | 974 | } |
dbe674a9 | 975 | |
c095f333 QW |
976 | /* |
977 | * Lookup the first ordered extent that overlaps the range | |
978 | * [@file_offset, @file_offset + @len). | |
979 | * | |
980 | * The difference between this and btrfs_lookup_first_ordered_extent() is | |
981 | * that this one won't return any ordered extent that does not overlap the range. | |
982 | * And the difference against btrfs_lookup_ordered_extent() is, this function | |
983 | * ensures the first ordered extent gets returned. | |
984 | */ | |
985 | struct btrfs_ordered_extent *btrfs_lookup_first_ordered_range( | |
986 | struct btrfs_inode *inode, u64 file_offset, u64 len) | |
987 | { | |
988 | struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; | |
989 | struct rb_node *node; | |
990 | struct rb_node *cur; | |
991 | struct rb_node *prev; | |
992 | struct rb_node *next; | |
993 | struct btrfs_ordered_extent *entry = NULL; | |
994 | ||
995 | spin_lock_irq(&tree->lock); | |
996 | node = tree->tree.rb_node; | |
997 | /* | |
998 | * Here we don't want to use tree_search() which will use tree->last | |
999 | * and screw up the search order. | |
1000 | * And __tree_search() can't return the adjacent ordered extents | |
1001 | * either, thus here we do our own search. | |
1002 | */ | |
1003 | while (node) { | |
1004 | entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); | |
1005 | ||
1006 | if (file_offset < entry->file_offset) { | |
1007 | node = node->rb_left; | |
1008 | } else if (file_offset >= entry_end(entry)) { | |
1009 | node = node->rb_right; | |
1010 | } else { | |
1011 | /* | |
1012 | * Direct hit, got an ordered extent that starts at | |
1013 | * @file_offset | |
1014 | */ | |
1015 | goto out; | |
1016 | } | |
1017 | } | |
1018 | if (!entry) { | |
1019 | /* Empty tree */ | |
1020 | goto out; | |
1021 | } | |
1022 | ||
1023 | cur = &entry->rb_node; | |
1024 | /* We got an entry around @file_offset, check adjacent entries */ | |
1025 | if (entry->file_offset < file_offset) { | |
1026 | prev = cur; | |
1027 | next = rb_next(cur); | |
1028 | } else { | |
1029 | prev = rb_prev(cur); | |
1030 | next = cur; | |
1031 | } | |
1032 | if (prev) { | |
1033 | entry = rb_entry(prev, struct btrfs_ordered_extent, rb_node); | |
1034 | if (range_overlaps(entry, file_offset, len)) | |
1035 | goto out; | |
1036 | } | |
1037 | if (next) { | |
1038 | entry = rb_entry(next, struct btrfs_ordered_extent, rb_node); | |
1039 | if (range_overlaps(entry, file_offset, len)) | |
1040 | goto out; | |
1041 | } | |
1042 | /* No ordered extent in the range */ | |
1043 | entry = NULL; | |
1044 | out: | |
5bea2508 | 1045 | if (entry) { |
c095f333 | 1046 | refcount_inc(&entry->refs); |
5bea2508 JT |
1047 | trace_btrfs_ordered_extent_lookup_first_range(inode, entry); |
1048 | } | |
1049 | ||
c095f333 QW |
1050 | spin_unlock_irq(&tree->lock); |
1051 | return entry; | |
1052 | } | |
1053 | ||
ffa87214 | 1054 | /* |
43dd529a DS |
1055 | * Lock the passed range and ensures all pending ordered extents in it are run |
1056 | * to completion. | |
ffa87214 | 1057 | * |
ffa87214 NB |
1058 | * @inode: Inode whose ordered tree is to be searched |
1059 | * @start: Beginning of range to flush | |
1060 | * @end: Last byte of range to lock | |
1061 | * @cached_state: If passed, will return the extent state responsible for the | |
43dd529a DS |
1062 | * locked range. It's the caller's responsibility to free the |
1063 | * cached state. | |
ffa87214 | 1064 | * |
43dd529a DS |
1065 | * Always return with the given range locked, ensuring after it's called no |
1066 | * order extent can be pending. | |
ffa87214 | 1067 | */ |
b272ae22 | 1068 | void btrfs_lock_and_flush_ordered_range(struct btrfs_inode *inode, u64 start, |
ffa87214 NB |
1069 | u64 end, |
1070 | struct extent_state **cached_state) | |
1071 | { | |
1072 | struct btrfs_ordered_extent *ordered; | |
a3b46b86 NA |
1073 | struct extent_state *cache = NULL; |
1074 | struct extent_state **cachedp = &cache; | |
bd80d94e NB |
1075 | |
1076 | if (cached_state) | |
a3b46b86 | 1077 | cachedp = cached_state; |
ffa87214 NB |
1078 | |
1079 | while (1) { | |
570eb97b | 1080 | lock_extent(&inode->io_tree, start, end, cachedp); |
ffa87214 NB |
1081 | ordered = btrfs_lookup_ordered_range(inode, start, |
1082 | end - start + 1); | |
bd80d94e NB |
1083 | if (!ordered) { |
1084 | /* | |
1085 | * If no external cached_state has been passed then | |
1086 | * decrement the extra ref taken for cachedp since we | |
1087 | * aren't exposing it outside of this function | |
1088 | */ | |
1089 | if (!cached_state) | |
a3b46b86 | 1090 | refcount_dec(&cache->refs); |
ffa87214 | 1091 | break; |
bd80d94e | 1092 | } |
570eb97b | 1093 | unlock_extent(&inode->io_tree, start, end, cachedp); |
36d45567 | 1094 | btrfs_start_ordered_extent(ordered); |
ffa87214 NB |
1095 | btrfs_put_ordered_extent(ordered); |
1096 | } | |
1097 | } | |
1098 | ||
d2c7a19f JB |
1099 | /* |
1100 | * Lock the passed range and ensure all pending ordered extents in it are run | |
1101 | * to completion in nowait mode. | |
1102 | * | |
1103 | * Return true if btrfs_lock_ordered_range does not return any extents, | |
1104 | * otherwise false. | |
1105 | */ | |
632ddfa2 JB |
1106 | bool btrfs_try_lock_ordered_range(struct btrfs_inode *inode, u64 start, u64 end, |
1107 | struct extent_state **cached_state) | |
d2c7a19f JB |
1108 | { |
1109 | struct btrfs_ordered_extent *ordered; | |
1110 | ||
632ddfa2 | 1111 | if (!try_lock_extent(&inode->io_tree, start, end, cached_state)) |
d2c7a19f JB |
1112 | return false; |
1113 | ||
1114 | ordered = btrfs_lookup_ordered_range(inode, start, end - start + 1); | |
1115 | if (!ordered) | |
1116 | return true; | |
1117 | ||
1118 | btrfs_put_ordered_extent(ordered); | |
632ddfa2 | 1119 | unlock_extent(&inode->io_tree, start, end, cached_state); |
d2c7a19f JB |
1120 | |
1121 | return false; | |
1122 | } | |
1123 | ||
8f4af4b8 | 1124 | /* Split out a new ordered extent for this first @len bytes of @ordered. */ |
b0307e28 CH |
1125 | struct btrfs_ordered_extent *btrfs_split_ordered_extent( |
1126 | struct btrfs_ordered_extent *ordered, u64 len) | |
d22002fd | 1127 | { |
816f589b CH |
1128 | struct btrfs_inode *inode = BTRFS_I(ordered->inode); |
1129 | struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree; | |
1130 | struct btrfs_root *root = inode->root; | |
1131 | struct btrfs_fs_info *fs_info = root->fs_info; | |
f0792b79 CH |
1132 | u64 file_offset = ordered->file_offset; |
1133 | u64 disk_bytenr = ordered->disk_bytenr; | |
52b1fdca CH |
1134 | unsigned long flags = ordered->flags; |
1135 | struct btrfs_ordered_sum *sum, *tmpsum; | |
816f589b | 1136 | struct btrfs_ordered_extent *new; |
8f4af4b8 | 1137 | struct rb_node *node; |
52b1fdca | 1138 | u64 offset = 0; |
d22002fd | 1139 | |
816f589b | 1140 | trace_btrfs_ordered_extent_split(inode, ordered); |
5bea2508 | 1141 | |
f0792b79 CH |
1142 | ASSERT(!(flags & (1U << BTRFS_ORDERED_COMPRESSED))); |
1143 | ||
8f4af4b8 CH |
1144 | /* |
1145 | * The entire bio must be covered by the ordered extent, but we can't | |
1146 | * reduce the original extent to a zero length either. | |
1147 | */ | |
1148 | if (WARN_ON_ONCE(len >= ordered->num_bytes)) | |
b0307e28 | 1149 | return ERR_PTR(-EINVAL); |
52b1fdca CH |
1150 | /* We cannot split partially completed ordered extents. */ |
1151 | if (ordered->bytes_left) { | |
1152 | ASSERT(!(flags & ~BTRFS_ORDERED_TYPE_FLAGS)); | |
1153 | if (WARN_ON_ONCE(ordered->bytes_left != ordered->disk_num_bytes)) | |
1154 | return ERR_PTR(-EINVAL); | |
1155 | } | |
e44ca71c CH |
1156 | /* We cannot split a compressed ordered extent. */ |
1157 | if (WARN_ON_ONCE(ordered->disk_num_bytes != ordered->num_bytes)) | |
b0307e28 | 1158 | return ERR_PTR(-EINVAL); |
e44ca71c | 1159 | |
816f589b CH |
1160 | new = alloc_ordered_extent(inode, file_offset, len, len, disk_bytenr, |
1161 | len, 0, flags, ordered->compress_type); | |
1162 | if (IS_ERR(new)) | |
1163 | return new; | |
1164 | ||
1165 | /* One ref for the tree. */ | |
1166 | refcount_inc(&new->refs); | |
1167 | ||
1168 | spin_lock_irq(&root->ordered_extent_lock); | |
1169 | spin_lock(&tree->lock); | |
d22002fd NA |
1170 | /* Remove from tree once */ |
1171 | node = &ordered->rb_node; | |
1172 | rb_erase(node, &tree->tree); | |
1173 | RB_CLEAR_NODE(node); | |
1174 | if (tree->last == node) | |
1175 | tree->last = NULL; | |
1176 | ||
8f4af4b8 CH |
1177 | ordered->file_offset += len; |
1178 | ordered->disk_bytenr += len; | |
1179 | ordered->num_bytes -= len; | |
1180 | ordered->disk_num_bytes -= len; | |
52b1fdca CH |
1181 | |
1182 | if (test_bit(BTRFS_ORDERED_IO_DONE, &ordered->flags)) { | |
1183 | ASSERT(ordered->bytes_left == 0); | |
1184 | new->bytes_left = 0; | |
1185 | } else { | |
1186 | ordered->bytes_left -= len; | |
1187 | } | |
1188 | ||
1189 | if (test_bit(BTRFS_ORDERED_TRUNCATED, &ordered->flags)) { | |
1190 | if (ordered->truncated_len > len) { | |
1191 | ordered->truncated_len -= len; | |
1192 | } else { | |
1193 | new->truncated_len = ordered->truncated_len; | |
1194 | ordered->truncated_len = 0; | |
1195 | } | |
1196 | } | |
1197 | ||
1198 | list_for_each_entry_safe(sum, tmpsum, &ordered->list, list) { | |
1199 | if (offset == len) | |
1200 | break; | |
1201 | list_move_tail(&sum->list, &new->list); | |
1202 | offset += sum->len; | |
1203 | } | |
d22002fd NA |
1204 | |
1205 | /* Re-insert the node */ | |
1206 | node = tree_insert(&tree->tree, ordered->file_offset, &ordered->rb_node); | |
1207 | if (node) | |
1208 | btrfs_panic(fs_info, -EEXIST, | |
1209 | "zoned: inconsistency in ordered tree at offset %llu", | |
816f589b | 1210 | ordered->file_offset); |
d22002fd | 1211 | |
816f589b CH |
1212 | node = tree_insert(&tree->tree, new->file_offset, &new->rb_node); |
1213 | if (node) | |
1214 | btrfs_panic(fs_info, -EEXIST, | |
1215 | "zoned: inconsistency in ordered tree at offset %llu", | |
1216 | new->file_offset); | |
1217 | spin_unlock(&tree->lock); | |
f0792b79 | 1218 | |
816f589b CH |
1219 | list_add_tail(&new->root_extent_list, &root->ordered_extents); |
1220 | root->nr_ordered_extents++; | |
1221 | spin_unlock_irq(&root->ordered_extent_lock); | |
1222 | return new; | |
d22002fd NA |
1223 | } |
1224 | ||
6352b91d MX |
1225 | int __init ordered_data_init(void) |
1226 | { | |
1227 | btrfs_ordered_extent_cache = kmem_cache_create("btrfs_ordered_extent", | |
1228 | sizeof(struct btrfs_ordered_extent), 0, | |
fba4b697 | 1229 | SLAB_MEM_SPREAD, |
6352b91d MX |
1230 | NULL); |
1231 | if (!btrfs_ordered_extent_cache) | |
1232 | return -ENOMEM; | |
25287e0a | 1233 | |
6352b91d MX |
1234 | return 0; |
1235 | } | |
1236 | ||
e67c718b | 1237 | void __cold ordered_data_exit(void) |
6352b91d | 1238 | { |
5598e900 | 1239 | kmem_cache_destroy(btrfs_ordered_extent_cache); |
6352b91d | 1240 | } |