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" |
42317ab4 | 22 | #include "block-group.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 | */ | |
54c65371 DS |
127 | static inline struct rb_node *ordered_tree_search(struct btrfs_inode *inode, |
128 | u64 file_offset) | |
dc17ff8f | 129 | { |
c87fb6fd | 130 | struct rb_node *prev = NULL; |
dc17ff8f | 131 | struct rb_node *ret; |
e6dcd2dc CM |
132 | struct btrfs_ordered_extent *entry; |
133 | ||
54c65371 DS |
134 | if (inode->ordered_tree_last) { |
135 | entry = rb_entry(inode->ordered_tree_last, struct btrfs_ordered_extent, | |
e6dcd2dc | 136 | rb_node); |
20bbf20e | 137 | if (in_range(file_offset, entry->file_offset, entry->num_bytes)) |
54c65371 | 138 | return inode->ordered_tree_last; |
e6dcd2dc | 139 | } |
54c65371 | 140 | ret = __tree_search(&inode->ordered_tree, file_offset, &prev); |
dc17ff8f | 141 | if (!ret) |
e6dcd2dc CM |
142 | ret = prev; |
143 | if (ret) | |
54c65371 | 144 | inode->ordered_tree_last = ret; |
dc17ff8f CM |
145 | return ret; |
146 | } | |
147 | ||
53d9981c CH |
148 | static struct btrfs_ordered_extent *alloc_ordered_extent( |
149 | struct btrfs_inode *inode, u64 file_offset, u64 num_bytes, | |
150 | u64 ram_bytes, u64 disk_bytenr, u64 disk_num_bytes, | |
151 | u64 offset, unsigned long flags, int compress_type) | |
dc17ff8f | 152 | { |
e6dcd2dc | 153 | struct btrfs_ordered_extent *entry; |
7dbeaad0 | 154 | int ret; |
9e65bfca | 155 | u64 qgroup_rsv = 0; |
7dbeaad0 | 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 */ |
9e65bfca | 160 | ret = btrfs_qgroup_free_data(inode, NULL, file_offset, num_bytes, &qgroup_rsv); |
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 | */ | |
9e65bfca | 168 | ret = btrfs_qgroup_release_data(inode, file_offset, num_bytes, &qgroup_rsv); |
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; |
a1f4e3d7 | 183 | entry->inode = BTRFS_I(igrab(&inode->vfs_inode)); |
261507a0 | 184 | entry->compress_type = compress_type; |
77cef2ec | 185 | entry->truncated_len = (u64)-1; |
9e65bfca | 186 | entry->qgroup_rsv = qgroup_rsv; |
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 | 193 | INIT_LIST_HEAD(&entry->work_list); |
02c372e1 | 194 | INIT_LIST_HEAD(&entry->bioc_list); |
9afab882 | 195 | init_completion(&entry->completion); |
dc17ff8f | 196 | |
53d9981c CH |
197 | /* |
198 | * We don't need the count_max_extents here, we can assume that all of | |
199 | * that work has been done at higher layers, so this is truly the | |
200 | * smallest the extent is going to get. | |
201 | */ | |
202 | spin_lock(&inode->lock); | |
203 | btrfs_mod_outstanding_extents(inode, 1); | |
204 | spin_unlock(&inode->lock); | |
205 | ||
206 | return entry; | |
207 | } | |
208 | ||
209 | static void insert_ordered_extent(struct btrfs_ordered_extent *entry) | |
210 | { | |
a1f4e3d7 | 211 | struct btrfs_inode *inode = entry->inode; |
53d9981c CH |
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 | ||
54c65371 DS |
224 | spin_lock_irq(&inode->ordered_tree_lock); |
225 | node = tree_insert(&inode->ordered_tree, entry->file_offset, | |
226 | &entry->rb_node); | |
b7ac1acb | 227 | if (unlikely(node)) |
511a32b5 NB |
228 | btrfs_panic(fs_info, -EEXIST, |
229 | "inconsistency in ordered tree at offset %llu", | |
53d9981c | 230 | entry->file_offset); |
54c65371 | 231 | spin_unlock_irq(&inode->ordered_tree_lock); |
d397712b | 232 | |
199c2a9c | 233 | spin_lock(&root->ordered_extent_lock); |
3eaa2885 | 234 | list_add_tail(&entry->root_extent_list, |
199c2a9c MX |
235 | &root->ordered_extents); |
236 | root->nr_ordered_extents++; | |
237 | if (root->nr_ordered_extents == 1) { | |
0b246afa | 238 | spin_lock(&fs_info->ordered_root_lock); |
199c2a9c | 239 | BUG_ON(!list_empty(&root->ordered_root)); |
0b246afa JM |
240 | list_add_tail(&root->ordered_root, &fs_info->ordered_roots); |
241 | spin_unlock(&fs_info->ordered_root_lock); | |
199c2a9c MX |
242 | } |
243 | spin_unlock(&root->ordered_extent_lock); | |
53d9981c | 244 | } |
3eaa2885 | 245 | |
53d9981c CH |
246 | /* |
247 | * Add an ordered extent to the per-inode tree. | |
248 | * | |
249 | * @inode: Inode that this extent is for. | |
250 | * @file_offset: Logical offset in file where the extent starts. | |
251 | * @num_bytes: Logical length of extent in file. | |
252 | * @ram_bytes: Full length of unencoded data. | |
253 | * @disk_bytenr: Offset of extent on disk. | |
254 | * @disk_num_bytes: Size of extent on disk. | |
255 | * @offset: Offset into unencoded data where file data starts. | |
256 | * @flags: Flags specifying type of extent (1 << BTRFS_ORDERED_*). | |
257 | * @compress_type: Compression algorithm used for data. | |
258 | * | |
259 | * Most of these parameters correspond to &struct btrfs_file_extent_item. The | |
260 | * tree is given a single reference on the ordered extent that was inserted, and | |
261 | * the returned pointer is given a second reference. | |
262 | * | |
263 | * Return: the new ordered extent or error pointer. | |
264 | */ | |
265 | struct btrfs_ordered_extent *btrfs_alloc_ordered_extent( | |
266 | struct btrfs_inode *inode, u64 file_offset, | |
9fec848b | 267 | const struct btrfs_file_extent *file_extent, unsigned long flags) |
53d9981c CH |
268 | { |
269 | struct btrfs_ordered_extent *entry; | |
8b62f87b | 270 | |
53d9981c | 271 | ASSERT((flags & ~BTRFS_ORDERED_TYPE_FLAGS) == 0); |
cf6d1aa4 | 272 | |
e9ea31fb QW |
273 | /* |
274 | * For regular writes, we just use the members in @file_extent. | |
275 | * | |
276 | * For NOCOW, we don't really care about the numbers except @start and | |
277 | * file_extent->num_bytes, as we won't insert a file extent item at all. | |
278 | * | |
279 | * For PREALLOC, we do not use ordered extent members, but | |
280 | * btrfs_mark_extent_written() handles everything. | |
281 | * | |
282 | * So here we always pass 0 as offset for NOCOW/PREALLOC ordered extents, | |
283 | * or btrfs_split_ordered_extent() cannot handle it correctly. | |
284 | */ | |
285 | if (flags & ((1U << BTRFS_ORDERED_NOCOW) | (1U << BTRFS_ORDERED_PREALLOC))) | |
286 | entry = alloc_ordered_extent(inode, file_offset, | |
287 | file_extent->num_bytes, | |
288 | file_extent->num_bytes, | |
289 | file_extent->disk_bytenr + file_extent->offset, | |
290 | file_extent->num_bytes, 0, flags, | |
291 | file_extent->compression); | |
292 | else | |
293 | entry = alloc_ordered_extent(inode, file_offset, | |
294 | file_extent->num_bytes, | |
295 | file_extent->ram_bytes, | |
296 | file_extent->disk_bytenr, | |
297 | file_extent->disk_num_bytes, | |
298 | file_extent->offset, flags, | |
299 | file_extent->compression); | |
53d9981c CH |
300 | if (!IS_ERR(entry)) |
301 | insert_ordered_extent(entry); | |
cf6d1aa4 BB |
302 | return entry; |
303 | } | |
304 | ||
eb84ae03 CM |
305 | /* |
306 | * Add a struct btrfs_ordered_sum into the list of checksums to be inserted | |
3edf7d33 CM |
307 | * when an ordered extent is finished. If the list covers more than one |
308 | * ordered extent, it is split across multiples. | |
eb84ae03 | 309 | */ |
f9756261 | 310 | void btrfs_add_ordered_sum(struct btrfs_ordered_extent *entry, |
143bede5 | 311 | struct btrfs_ordered_sum *sum) |
dc17ff8f | 312 | { |
a1f4e3d7 | 313 | struct btrfs_inode *inode = entry->inode; |
dc17ff8f | 314 | |
54c65371 | 315 | spin_lock_irq(&inode->ordered_tree_lock); |
e6dcd2dc | 316 | list_add_tail(&sum->list, &entry->list); |
54c65371 | 317 | spin_unlock_irq(&inode->ordered_tree_lock); |
dc17ff8f CM |
318 | } |
319 | ||
aa5ccf29 JB |
320 | void btrfs_mark_ordered_extent_error(struct btrfs_ordered_extent *ordered) |
321 | { | |
322 | if (!test_and_set_bit(BTRFS_ORDERED_IOERR, &ordered->flags)) | |
a1f4e3d7 | 323 | mapping_set_error(ordered->inode->vfs_inode.i_mapping, -EIO); |
aa5ccf29 JB |
324 | } |
325 | ||
711f447b CH |
326 | static void finish_ordered_fn(struct btrfs_work *work) |
327 | { | |
328 | struct btrfs_ordered_extent *ordered_extent; | |
329 | ||
330 | ordered_extent = container_of(work, struct btrfs_ordered_extent, work); | |
331 | btrfs_finish_ordered_io(ordered_extent); | |
332 | } | |
333 | ||
53df2586 | 334 | static bool can_finish_ordered_extent(struct btrfs_ordered_extent *ordered, |
0a577636 | 335 | struct folio *folio, u64 file_offset, |
53df2586 CH |
336 | u64 len, bool uptodate) |
337 | { | |
a1f4e3d7 | 338 | struct btrfs_inode *inode = ordered->inode; |
53df2586 CH |
339 | struct btrfs_fs_info *fs_info = inode->root->fs_info; |
340 | ||
54c65371 | 341 | lockdep_assert_held(&inode->ordered_tree_lock); |
53df2586 | 342 | |
0a577636 JB |
343 | if (folio) { |
344 | ASSERT(folio->mapping); | |
345 | ASSERT(folio_pos(folio) <= file_offset); | |
346 | ASSERT(file_offset + len <= folio_pos(folio) + folio_size(folio)); | |
53df2586 CH |
347 | |
348 | /* | |
349 | * Ordered (Private2) bit indicates whether we still have | |
350 | * pending io unfinished for the ordered extent. | |
351 | * | |
352 | * If there's no such bit, we need to skip to next range. | |
353 | */ | |
0a577636 | 354 | if (!btrfs_folio_test_ordered(fs_info, folio, file_offset, len)) |
53df2586 | 355 | return false; |
0a577636 | 356 | btrfs_folio_clear_ordered(fs_info, folio, file_offset, len); |
53df2586 CH |
357 | } |
358 | ||
359 | /* Now we're fine to update the accounting. */ | |
360 | if (WARN_ON_ONCE(len > ordered->bytes_left)) { | |
361 | btrfs_crit(fs_info, | |
362 | "bad ordered extent accounting, root=%llu ino=%llu OE offset=%llu OE len=%llu to_dec=%llu left=%llu", | |
e094f480 | 363 | btrfs_root_id(inode->root), btrfs_ino(inode), |
53df2586 CH |
364 | ordered->file_offset, ordered->num_bytes, |
365 | len, ordered->bytes_left); | |
366 | ordered->bytes_left = 0; | |
367 | } else { | |
368 | ordered->bytes_left -= len; | |
369 | } | |
370 | ||
371 | if (!uptodate) | |
372 | set_bit(BTRFS_ORDERED_IOERR, &ordered->flags); | |
373 | ||
374 | if (ordered->bytes_left) | |
375 | return false; | |
376 | ||
377 | /* | |
378 | * All the IO of the ordered extent is finished, we need to queue | |
379 | * the finish_func to be executed. | |
380 | */ | |
381 | set_bit(BTRFS_ORDERED_IO_DONE, &ordered->flags); | |
382 | cond_wake_up(&ordered->wait); | |
383 | refcount_inc(&ordered->refs); | |
384 | trace_btrfs_ordered_extent_mark_finished(inode, ordered); | |
385 | return true; | |
386 | } | |
387 | ||
2d6f107e CH |
388 | static void btrfs_queue_ordered_fn(struct btrfs_ordered_extent *ordered) |
389 | { | |
a1f4e3d7 | 390 | struct btrfs_inode *inode = ordered->inode; |
2d6f107e CH |
391 | struct btrfs_fs_info *fs_info = inode->root->fs_info; |
392 | struct btrfs_workqueue *wq = btrfs_is_free_space_inode(inode) ? | |
393 | fs_info->endio_freespace_worker : fs_info->endio_write_workers; | |
394 | ||
078b8b90 | 395 | btrfs_init_work(&ordered->work, finish_ordered_fn, NULL); |
2d6f107e CH |
396 | btrfs_queue_work(wq, &ordered->work); |
397 | } | |
398 | ||
c41881ae | 399 | void btrfs_finish_ordered_extent(struct btrfs_ordered_extent *ordered, |
aef665d6 | 400 | struct folio *folio, u64 file_offset, u64 len, |
122e9ede CH |
401 | bool uptodate) |
402 | { | |
a1f4e3d7 | 403 | struct btrfs_inode *inode = ordered->inode; |
122e9ede CH |
404 | unsigned long flags; |
405 | bool ret; | |
406 | ||
407 | trace_btrfs_finish_ordered_extent(inode, file_offset, len, uptodate); | |
408 | ||
54c65371 | 409 | spin_lock_irqsave(&inode->ordered_tree_lock, flags); |
aef665d6 JB |
410 | ret = can_finish_ordered_extent(ordered, folio, file_offset, len, |
411 | uptodate); | |
54c65371 | 412 | spin_unlock_irqrestore(&inode->ordered_tree_lock, flags); |
122e9ede | 413 | |
f13e01b8 FM |
414 | /* |
415 | * If this is a COW write it means we created new extent maps for the | |
416 | * range and they point to unwritten locations if we got an error either | |
417 | * before submitting a bio or during IO. | |
418 | * | |
419 | * We have marked the ordered extent with BTRFS_ORDERED_IOERR, and we | |
420 | * are queuing its completion below. During completion, at | |
421 | * btrfs_finish_one_ordered(), we will drop the extent maps for the | |
422 | * unwritten extents. | |
423 | * | |
424 | * However because completion runs in a work queue we can end up having | |
425 | * a fast fsync running before that. In the case of direct IO, once we | |
426 | * unlock the inode the fsync might start, and we queue the completion | |
427 | * before unlocking the inode. In the case of buffered IO when writeback | |
428 | * finishes (end_bbio_data_write()) we queue the completion, so if the | |
429 | * writeback was triggered by a fast fsync, the fsync might start | |
430 | * logging before ordered extent completion runs in the work queue. | |
431 | * | |
432 | * The fast fsync will log file extent items based on the extent maps it | |
433 | * finds, so if by the time it collects extent maps the ordered extent | |
434 | * completion didn't happen yet, it will log file extent items that | |
435 | * point to unwritten extents, resulting in a corruption if a crash | |
436 | * happens and the log tree is replayed. Note that a fast fsync does not | |
437 | * wait for completion of ordered extents in order to reduce latency. | |
438 | * | |
439 | * Set a flag in the inode so that the next fast fsync will wait for | |
440 | * ordered extents to complete before starting to log. | |
441 | */ | |
442 | if (!uptodate && !test_bit(BTRFS_ORDERED_NOCOW, &ordered->flags)) | |
443 | set_bit(BTRFS_INODE_COW_WRITE_ERROR, &inode->runtime_flags); | |
444 | ||
122e9ede CH |
445 | if (ret) |
446 | btrfs_queue_ordered_fn(ordered); | |
122e9ede CH |
447 | } |
448 | ||
163cf09c | 449 | /* |
e65f152e | 450 | * Mark all ordered extents io inside the specified range finished. |
163cf09c | 451 | * |
a7922801 JB |
452 | * @folio: The involved folio for the operation. |
453 | * For uncompressed buffered IO, the folio status also needs to be | |
e65f152e QW |
454 | * updated to indicate whether the pending ordered io is finished. |
455 | * Can be NULL for direct IO and compressed write. | |
456 | * For these cases, callers are ensured they won't execute the | |
457 | * endio function twice. | |
163cf09c | 458 | * |
e65f152e | 459 | * This function is called for endio, thus the range must have ordered |
143823cf | 460 | * extent(s) covering it. |
163cf09c | 461 | */ |
e65f152e | 462 | void btrfs_mark_ordered_io_finished(struct btrfs_inode *inode, |
a7922801 | 463 | struct folio *folio, u64 file_offset, |
711f447b | 464 | u64 num_bytes, bool uptodate) |
163cf09c | 465 | { |
163cf09c CM |
466 | struct rb_node *node; |
467 | struct btrfs_ordered_extent *entry = NULL; | |
5fd02043 | 468 | unsigned long flags; |
e65f152e QW |
469 | u64 cur = file_offset; |
470 | ||
6648cedd CH |
471 | trace_btrfs_writepage_end_io_hook(inode, file_offset, |
472 | file_offset + num_bytes - 1, | |
473 | uptodate); | |
474 | ||
54c65371 | 475 | spin_lock_irqsave(&inode->ordered_tree_lock, flags); |
e65f152e QW |
476 | while (cur < file_offset + num_bytes) { |
477 | u64 entry_end; | |
478 | u64 end; | |
479 | u32 len; | |
480 | ||
54c65371 | 481 | node = ordered_tree_search(inode, cur); |
e65f152e QW |
482 | /* No ordered extents at all */ |
483 | if (!node) | |
484 | break; | |
5fd02043 | 485 | |
e65f152e QW |
486 | entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); |
487 | entry_end = entry->file_offset + entry->num_bytes; | |
58f74b22 | 488 | /* |
e65f152e QW |
489 | * |<-- OE --->| | |
490 | * cur | |
491 | * Go to next OE. | |
58f74b22 | 492 | */ |
e65f152e QW |
493 | if (cur >= entry_end) { |
494 | node = rb_next(node); | |
495 | /* No more ordered extents, exit */ | |
496 | if (!node) | |
497 | break; | |
498 | entry = rb_entry(node, struct btrfs_ordered_extent, | |
499 | rb_node); | |
500 | ||
501 | /* Go to next ordered extent and continue */ | |
502 | cur = entry->file_offset; | |
503 | continue; | |
504 | } | |
505 | /* | |
506 | * | |<--- OE --->| | |
507 | * cur | |
508 | * Go to the start of OE. | |
509 | */ | |
510 | if (cur < entry->file_offset) { | |
511 | cur = entry->file_offset; | |
512 | continue; | |
513 | } | |
514 | ||
515 | /* | |
516 | * Now we are definitely inside one ordered extent. | |
517 | * | |
518 | * |<--- OE --->| | |
519 | * | | |
520 | * cur | |
521 | */ | |
522 | end = min(entry->file_offset + entry->num_bytes, | |
523 | file_offset + num_bytes) - 1; | |
524 | ASSERT(end + 1 - cur < U32_MAX); | |
525 | len = end + 1 - cur; | |
526 | ||
a7922801 | 527 | if (can_finish_ordered_extent(entry, folio, cur, len, uptodate)) { |
54c65371 | 528 | spin_unlock_irqrestore(&inode->ordered_tree_lock, flags); |
2d6f107e | 529 | btrfs_queue_ordered_fn(entry); |
54c65371 | 530 | spin_lock_irqsave(&inode->ordered_tree_lock, flags); |
e65f152e QW |
531 | } |
532 | cur += len; | |
163cf09c | 533 | } |
54c65371 | 534 | spin_unlock_irqrestore(&inode->ordered_tree_lock, flags); |
163cf09c CM |
535 | } |
536 | ||
eb84ae03 | 537 | /* |
58f74b22 QW |
538 | * Finish IO for one ordered extent across a given range. The range can only |
539 | * contain one ordered extent. | |
540 | * | |
541 | * @cached: The cached ordered extent. If not NULL, we can skip the tree | |
542 | * search and use the ordered extent directly. | |
543 | * Will be also used to store the finished ordered extent. | |
544 | * @file_offset: File offset for the finished IO | |
545 | * @io_size: Length of the finish IO range | |
eb84ae03 | 546 | * |
58f74b22 QW |
547 | * Return true if the ordered extent is finished in the range, and update |
548 | * @cached. | |
549 | * Return false otherwise. | |
550 | * | |
551 | * NOTE: The range can NOT cross multiple ordered extents. | |
552 | * Thus caller should ensure the range doesn't cross ordered extents. | |
eb84ae03 | 553 | */ |
58f74b22 QW |
554 | bool btrfs_dec_test_ordered_pending(struct btrfs_inode *inode, |
555 | struct btrfs_ordered_extent **cached, | |
f41b6ba9 | 556 | u64 file_offset, u64 io_size) |
dc17ff8f | 557 | { |
dc17ff8f | 558 | struct rb_node *node; |
5a1a3df1 | 559 | struct btrfs_ordered_extent *entry = NULL; |
5fd02043 | 560 | unsigned long flags; |
58f74b22 | 561 | bool finished = false; |
e6dcd2dc | 562 | |
54c65371 | 563 | spin_lock_irqsave(&inode->ordered_tree_lock, flags); |
5fd02043 JB |
564 | if (cached && *cached) { |
565 | entry = *cached; | |
566 | goto have_entry; | |
567 | } | |
568 | ||
54c65371 | 569 | node = ordered_tree_search(inode, file_offset); |
58f74b22 | 570 | if (!node) |
e6dcd2dc | 571 | goto out; |
dc17ff8f | 572 | |
e6dcd2dc | 573 | entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); |
5fd02043 | 574 | have_entry: |
20bbf20e | 575 | if (!in_range(file_offset, entry->file_offset, entry->num_bytes)) |
e6dcd2dc | 576 | goto out; |
e6dcd2dc | 577 | |
58f74b22 | 578 | if (io_size > entry->bytes_left) |
90c0304c | 579 | btrfs_crit(inode->root->fs_info, |
efe120a0 | 580 | "bad ordered accounting left %llu size %llu", |
c1c9ff7c | 581 | entry->bytes_left, io_size); |
58f74b22 | 582 | |
8b62b72b | 583 | entry->bytes_left -= io_size; |
5fd02043 | 584 | |
af7a6509 | 585 | if (entry->bytes_left == 0) { |
58f74b22 QW |
586 | /* |
587 | * Ensure only one caller can set the flag and finished_ret | |
588 | * accordingly | |
589 | */ | |
590 | finished = !test_and_set_bit(BTRFS_ORDERED_IO_DONE, &entry->flags); | |
093258e6 DS |
591 | /* test_and_set_bit implies a barrier */ |
592 | cond_wake_up_nomb(&entry->wait); | |
af7a6509 | 593 | } |
e6dcd2dc | 594 | out: |
58f74b22 | 595 | if (finished && cached && entry) { |
5a1a3df1 | 596 | *cached = entry; |
e76edab7 | 597 | refcount_inc(&entry->refs); |
5bea2508 | 598 | trace_btrfs_ordered_extent_dec_test_pending(inode, entry); |
5a1a3df1 | 599 | } |
54c65371 | 600 | spin_unlock_irqrestore(&inode->ordered_tree_lock, flags); |
58f74b22 | 601 | return finished; |
e6dcd2dc | 602 | } |
dc17ff8f | 603 | |
eb84ae03 CM |
604 | /* |
605 | * used to drop a reference on an ordered extent. This will free | |
606 | * the extent if the last reference is dropped | |
607 | */ | |
143bede5 | 608 | void btrfs_put_ordered_extent(struct btrfs_ordered_extent *entry) |
e6dcd2dc | 609 | { |
ba1da2f4 CM |
610 | struct list_head *cur; |
611 | struct btrfs_ordered_sum *sum; | |
612 | ||
a1f4e3d7 | 613 | trace_btrfs_ordered_extent_put(entry->inode, entry); |
1abe9b8a | 614 | |
e76edab7 | 615 | if (refcount_dec_and_test(&entry->refs)) { |
61de718f | 616 | ASSERT(list_empty(&entry->root_extent_list)); |
48778179 | 617 | ASSERT(list_empty(&entry->log_list)); |
61de718f | 618 | ASSERT(RB_EMPTY_NODE(&entry->rb_node)); |
5fd02043 | 619 | if (entry->inode) |
a1f4e3d7 | 620 | btrfs_add_delayed_iput(entry->inode); |
d397712b | 621 | while (!list_empty(&entry->list)) { |
ba1da2f4 CM |
622 | cur = entry->list.next; |
623 | sum = list_entry(cur, struct btrfs_ordered_sum, list); | |
624 | list_del(&sum->list); | |
a3d46aea | 625 | kvfree(sum); |
ba1da2f4 | 626 | } |
6352b91d | 627 | kmem_cache_free(btrfs_ordered_extent_cache, entry); |
ba1da2f4 | 628 | } |
dc17ff8f | 629 | } |
cee36a03 | 630 | |
eb84ae03 CM |
631 | /* |
632 | * remove an ordered extent from the tree. No references are dropped | |
5fd02043 | 633 | * and waiters are woken up. |
eb84ae03 | 634 | */ |
71fe0a55 | 635 | void btrfs_remove_ordered_extent(struct btrfs_inode *btrfs_inode, |
5fd02043 | 636 | struct btrfs_ordered_extent *entry) |
cee36a03 | 637 | { |
8b62f87b | 638 | struct btrfs_root *root = btrfs_inode->root; |
71fe0a55 | 639 | struct btrfs_fs_info *fs_info = root->fs_info; |
cee36a03 | 640 | struct rb_node *node; |
48778179 | 641 | bool pending; |
5f4403e1 IA |
642 | bool freespace_inode; |
643 | ||
644 | /* | |
645 | * If this is a free space inode the thread has not acquired the ordered | |
646 | * extents lockdep map. | |
647 | */ | |
648 | freespace_inode = btrfs_is_free_space_inode(btrfs_inode); | |
cee36a03 | 649 | |
8b53779e | 650 | btrfs_lockdep_acquire(fs_info, btrfs_trans_pending_ordered); |
3441b070 | 651 | /* This is paired with alloc_ordered_extent(). */ |
8b62f87b JB |
652 | spin_lock(&btrfs_inode->lock); |
653 | btrfs_mod_outstanding_extents(btrfs_inode, -1); | |
654 | spin_unlock(&btrfs_inode->lock); | |
7c0c7269 OS |
655 | if (root != fs_info->tree_root) { |
656 | u64 release; | |
657 | ||
658 | if (test_bit(BTRFS_ORDERED_ENCODED, &entry->flags)) | |
659 | release = entry->disk_num_bytes; | |
660 | else | |
661 | release = entry->num_bytes; | |
f63e1164 BB |
662 | btrfs_delalloc_release_metadata(btrfs_inode, release, |
663 | test_bit(BTRFS_ORDERED_IOERR, | |
664 | &entry->flags)); | |
7c0c7269 | 665 | } |
8b62f87b | 666 | |
5deb17e1 JB |
667 | percpu_counter_add_batch(&fs_info->ordered_bytes, -entry->num_bytes, |
668 | fs_info->delalloc_batch); | |
4297ff84 | 669 | |
54c65371 | 670 | spin_lock_irq(&btrfs_inode->ordered_tree_lock); |
e6dcd2dc | 671 | node = &entry->rb_node; |
54c65371 | 672 | rb_erase(node, &btrfs_inode->ordered_tree); |
61de718f | 673 | RB_CLEAR_NODE(node); |
54c65371 DS |
674 | if (btrfs_inode->ordered_tree_last == node) |
675 | btrfs_inode->ordered_tree_last = NULL; | |
e6dcd2dc | 676 | set_bit(BTRFS_ORDERED_COMPLETE, &entry->flags); |
48778179 | 677 | pending = test_and_clear_bit(BTRFS_ORDERED_PENDING, &entry->flags); |
54c65371 | 678 | spin_unlock_irq(&btrfs_inode->ordered_tree_lock); |
3eaa2885 | 679 | |
48778179 FM |
680 | /* |
681 | * The current running transaction is waiting on us, we need to let it | |
682 | * know that we're complete and wake it up. | |
683 | */ | |
684 | if (pending) { | |
685 | struct btrfs_transaction *trans; | |
686 | ||
687 | /* | |
688 | * The checks for trans are just a formality, it should be set, | |
689 | * but if it isn't we don't want to deref/assert under the spin | |
690 | * lock, so be nice and check if trans is set, but ASSERT() so | |
691 | * if it isn't set a developer will notice. | |
692 | */ | |
693 | spin_lock(&fs_info->trans_lock); | |
694 | trans = fs_info->running_transaction; | |
695 | if (trans) | |
696 | refcount_inc(&trans->use_count); | |
697 | spin_unlock(&fs_info->trans_lock); | |
698 | ||
4ca8e03c | 699 | ASSERT(trans || BTRFS_FS_ERROR(fs_info)); |
48778179 FM |
700 | if (trans) { |
701 | if (atomic_dec_and_test(&trans->pending_ordered)) | |
702 | wake_up(&trans->pending_wait); | |
703 | btrfs_put_transaction(trans); | |
704 | } | |
705 | } | |
706 | ||
8b53779e IA |
707 | btrfs_lockdep_release(fs_info, btrfs_trans_pending_ordered); |
708 | ||
199c2a9c | 709 | spin_lock(&root->ordered_extent_lock); |
3eaa2885 | 710 | list_del_init(&entry->root_extent_list); |
199c2a9c | 711 | root->nr_ordered_extents--; |
5a3f23d5 | 712 | |
71fe0a55 | 713 | trace_btrfs_ordered_extent_remove(btrfs_inode, entry); |
1abe9b8a | 714 | |
199c2a9c | 715 | if (!root->nr_ordered_extents) { |
0b246afa | 716 | spin_lock(&fs_info->ordered_root_lock); |
199c2a9c MX |
717 | BUG_ON(list_empty(&root->ordered_root)); |
718 | list_del_init(&root->ordered_root); | |
0b246afa | 719 | spin_unlock(&fs_info->ordered_root_lock); |
199c2a9c MX |
720 | } |
721 | spin_unlock(&root->ordered_extent_lock); | |
e6dcd2dc | 722 | wake_up(&entry->wait); |
5f4403e1 IA |
723 | if (!freespace_inode) |
724 | btrfs_lockdep_release(fs_info, btrfs_ordered_extent); | |
cee36a03 CM |
725 | } |
726 | ||
d458b054 | 727 | static void btrfs_run_ordered_extent_work(struct btrfs_work *work) |
9afab882 MX |
728 | { |
729 | struct btrfs_ordered_extent *ordered; | |
730 | ||
731 | ordered = container_of(work, struct btrfs_ordered_extent, flush_work); | |
36d45567 | 732 | btrfs_start_ordered_extent(ordered); |
9afab882 MX |
733 | complete(&ordered->completion); |
734 | } | |
735 | ||
d352ac68 | 736 | /* |
42317ab4 DS |
737 | * Wait for all the ordered extents in a root. Use @bg as range or do whole |
738 | * range if it's NULL. | |
d352ac68 | 739 | */ |
6374e57a | 740 | u64 btrfs_wait_ordered_extents(struct btrfs_root *root, u64 nr, |
42317ab4 | 741 | const struct btrfs_block_group *bg) |
3eaa2885 | 742 | { |
0b246afa | 743 | struct btrfs_fs_info *fs_info = root->fs_info; |
578def7c FM |
744 | LIST_HEAD(splice); |
745 | LIST_HEAD(skipped); | |
746 | LIST_HEAD(works); | |
9afab882 | 747 | struct btrfs_ordered_extent *ordered, *next; |
6374e57a | 748 | u64 count = 0; |
42317ab4 DS |
749 | u64 range_start, range_len; |
750 | u64 range_end; | |
751 | ||
752 | if (bg) { | |
753 | range_start = bg->start; | |
754 | range_len = bg->length; | |
755 | } else { | |
756 | range_start = 0; | |
757 | range_len = U64_MAX; | |
758 | } | |
759 | range_end = range_start + range_len; | |
3eaa2885 | 760 | |
31f3d255 | 761 | mutex_lock(&root->ordered_extent_mutex); |
199c2a9c MX |
762 | spin_lock(&root->ordered_extent_lock); |
763 | list_splice_init(&root->ordered_extents, &splice); | |
b0244199 | 764 | while (!list_empty(&splice) && nr) { |
199c2a9c MX |
765 | ordered = list_first_entry(&splice, struct btrfs_ordered_extent, |
766 | root_extent_list); | |
578def7c | 767 | |
bffe633e OS |
768 | if (range_end <= ordered->disk_bytenr || |
769 | ordered->disk_bytenr + ordered->disk_num_bytes <= range_start) { | |
578def7c FM |
770 | list_move_tail(&ordered->root_extent_list, &skipped); |
771 | cond_resched_lock(&root->ordered_extent_lock); | |
772 | continue; | |
773 | } | |
774 | ||
199c2a9c MX |
775 | list_move_tail(&ordered->root_extent_list, |
776 | &root->ordered_extents); | |
e76edab7 | 777 | refcount_inc(&ordered->refs); |
199c2a9c | 778 | spin_unlock(&root->ordered_extent_lock); |
3eaa2885 | 779 | |
a44903ab | 780 | btrfs_init_work(&ordered->flush_work, |
078b8b90 | 781 | btrfs_run_ordered_extent_work, NULL); |
199c2a9c | 782 | list_add_tail(&ordered->work_list, &works); |
0b246afa | 783 | btrfs_queue_work(fs_info->flush_workers, &ordered->flush_work); |
3eaa2885 | 784 | |
9afab882 | 785 | cond_resched(); |
6374e57a | 786 | if (nr != U64_MAX) |
b0244199 MX |
787 | nr--; |
788 | count++; | |
ac1f580c | 789 | spin_lock(&root->ordered_extent_lock); |
3eaa2885 | 790 | } |
578def7c | 791 | list_splice_tail(&skipped, &root->ordered_extents); |
b0244199 | 792 | list_splice_tail(&splice, &root->ordered_extents); |
199c2a9c | 793 | spin_unlock(&root->ordered_extent_lock); |
9afab882 MX |
794 | |
795 | list_for_each_entry_safe(ordered, next, &works, work_list) { | |
796 | list_del_init(&ordered->work_list); | |
797 | wait_for_completion(&ordered->completion); | |
9afab882 | 798 | btrfs_put_ordered_extent(ordered); |
9afab882 MX |
799 | cond_resched(); |
800 | } | |
31f3d255 | 801 | mutex_unlock(&root->ordered_extent_mutex); |
b0244199 MX |
802 | |
803 | return count; | |
3eaa2885 CM |
804 | } |
805 | ||
42317ab4 DS |
806 | /* |
807 | * Wait for @nr ordered extents that intersect the @bg, or the whole range of | |
808 | * the filesystem if @bg is NULL. | |
809 | */ | |
042528f8 | 810 | void btrfs_wait_ordered_roots(struct btrfs_fs_info *fs_info, u64 nr, |
42317ab4 | 811 | const struct btrfs_block_group *bg) |
199c2a9c MX |
812 | { |
813 | struct btrfs_root *root; | |
84af994b | 814 | LIST_HEAD(splice); |
6374e57a | 815 | u64 done; |
199c2a9c | 816 | |
8b9d83cd | 817 | mutex_lock(&fs_info->ordered_operations_mutex); |
199c2a9c MX |
818 | spin_lock(&fs_info->ordered_root_lock); |
819 | list_splice_init(&fs_info->ordered_roots, &splice); | |
b0244199 | 820 | while (!list_empty(&splice) && nr) { |
199c2a9c MX |
821 | root = list_first_entry(&splice, struct btrfs_root, |
822 | ordered_root); | |
00246528 | 823 | root = btrfs_grab_root(root); |
199c2a9c MX |
824 | BUG_ON(!root); |
825 | list_move_tail(&root->ordered_root, | |
826 | &fs_info->ordered_roots); | |
827 | spin_unlock(&fs_info->ordered_root_lock); | |
828 | ||
42317ab4 | 829 | done = btrfs_wait_ordered_extents(root, nr, bg); |
00246528 | 830 | btrfs_put_root(root); |
199c2a9c | 831 | |
03103ecf | 832 | if (nr != U64_MAX) |
b0244199 | 833 | nr -= done; |
03103ecf FM |
834 | |
835 | spin_lock(&fs_info->ordered_root_lock); | |
199c2a9c | 836 | } |
931aa877 | 837 | list_splice_tail(&splice, &fs_info->ordered_roots); |
199c2a9c | 838 | spin_unlock(&fs_info->ordered_root_lock); |
8b9d83cd | 839 | mutex_unlock(&fs_info->ordered_operations_mutex); |
199c2a9c MX |
840 | } |
841 | ||
eb84ae03 | 842 | /* |
36d45567 | 843 | * Start IO and wait for a given ordered extent to finish. |
eb84ae03 | 844 | * |
36d45567 CH |
845 | * Wait on page writeback for all the pages in the extent and the IO completion |
846 | * code to insert metadata into the btree corresponding to the extent. | |
eb84ae03 | 847 | */ |
36d45567 | 848 | void btrfs_start_ordered_extent(struct btrfs_ordered_extent *entry) |
e6dcd2dc CM |
849 | { |
850 | u64 start = entry->file_offset; | |
bffe633e | 851 | u64 end = start + entry->num_bytes - 1; |
a1f4e3d7 | 852 | struct btrfs_inode *inode = entry->inode; |
5f4403e1 | 853 | bool freespace_inode; |
e1b81e67 | 854 | |
c0a43603 | 855 | trace_btrfs_ordered_extent_start(inode, entry); |
1abe9b8a | 856 | |
5f4403e1 IA |
857 | /* |
858 | * If this is a free space inode do not take the ordered extents lockdep | |
859 | * map. | |
860 | */ | |
861 | freespace_inode = btrfs_is_free_space_inode(inode); | |
862 | ||
eb84ae03 CM |
863 | /* |
864 | * pages in the range can be dirty, clean or writeback. We | |
865 | * start IO on any dirty ones so the wait doesn't stall waiting | |
b2570314 | 866 | * for the flusher thread to find them |
eb84ae03 | 867 | */ |
4b46fce2 | 868 | if (!test_bit(BTRFS_ORDERED_DIRECT, &entry->flags)) |
c0a43603 | 869 | filemap_fdatawrite_range(inode->vfs_inode.i_mapping, start, end); |
36d45567 CH |
870 | |
871 | if (!freespace_inode) | |
872 | btrfs_might_wait_for_event(inode->root->fs_info, btrfs_ordered_extent); | |
873 | wait_event(entry->wait, test_bit(BTRFS_ORDERED_COMPLETE, &entry->flags)); | |
e6dcd2dc | 874 | } |
cee36a03 | 875 | |
eb84ae03 CM |
876 | /* |
877 | * Used to wait on ordered extents across a large range of bytes. | |
878 | */ | |
e641e323 | 879 | int btrfs_wait_ordered_range(struct btrfs_inode *inode, u64 start, u64 len) |
e6dcd2dc | 880 | { |
0ef8b726 | 881 | int ret = 0; |
28aeeac1 | 882 | int ret_wb = 0; |
e6dcd2dc | 883 | u64 end; |
e5a2217e | 884 | u64 orig_end; |
e6dcd2dc | 885 | struct btrfs_ordered_extent *ordered; |
e5a2217e CM |
886 | |
887 | if (start + len < start) { | |
cf260db4 | 888 | orig_end = OFFSET_MAX; |
e5a2217e CM |
889 | } else { |
890 | orig_end = start + len - 1; | |
cf260db4 ZL |
891 | if (orig_end > OFFSET_MAX) |
892 | orig_end = OFFSET_MAX; | |
e5a2217e | 893 | } |
551ebb2d | 894 | |
e5a2217e CM |
895 | /* start IO across the range first to instantiate any delalloc |
896 | * extents | |
897 | */ | |
e641e323 | 898 | ret = btrfs_fdatawrite_range(inode, start, orig_end); |
0ef8b726 JB |
899 | if (ret) |
900 | return ret; | |
728404da | 901 | |
28aeeac1 FM |
902 | /* |
903 | * If we have a writeback error don't return immediately. Wait first | |
904 | * for any ordered extents that haven't completed yet. This is to make | |
905 | * sure no one can dirty the same page ranges and call writepages() | |
906 | * before the ordered extents complete - to avoid failures (-EEXIST) | |
907 | * when adding the new ordered extents to the ordered tree. | |
908 | */ | |
e641e323 | 909 | ret_wb = filemap_fdatawait_range(inode->vfs_inode.i_mapping, start, orig_end); |
e5a2217e | 910 | |
f421950f | 911 | end = orig_end; |
d397712b | 912 | while (1) { |
e641e323 | 913 | ordered = btrfs_lookup_first_ordered_extent(inode, end); |
d397712b | 914 | if (!ordered) |
e6dcd2dc | 915 | break; |
e5a2217e | 916 | if (ordered->file_offset > orig_end) { |
e6dcd2dc CM |
917 | btrfs_put_ordered_extent(ordered); |
918 | break; | |
919 | } | |
bffe633e | 920 | if (ordered->file_offset + ordered->num_bytes <= start) { |
e6dcd2dc CM |
921 | btrfs_put_ordered_extent(ordered); |
922 | break; | |
923 | } | |
36d45567 | 924 | btrfs_start_ordered_extent(ordered); |
e6dcd2dc | 925 | end = ordered->file_offset; |
e75fd33b FM |
926 | /* |
927 | * If the ordered extent had an error save the error but don't | |
928 | * exit without waiting first for all other ordered extents in | |
929 | * the range to complete. | |
930 | */ | |
0ef8b726 JB |
931 | if (test_bit(BTRFS_ORDERED_IOERR, &ordered->flags)) |
932 | ret = -EIO; | |
e6dcd2dc | 933 | btrfs_put_ordered_extent(ordered); |
e75fd33b | 934 | if (end == 0 || end == start) |
e6dcd2dc CM |
935 | break; |
936 | end--; | |
937 | } | |
28aeeac1 | 938 | return ret_wb ? ret_wb : ret; |
cee36a03 CM |
939 | } |
940 | ||
eb84ae03 CM |
941 | /* |
942 | * find an ordered extent corresponding to file_offset. return NULL if | |
943 | * nothing is found, otherwise take a reference on the extent and return it | |
944 | */ | |
c3504372 | 945 | struct btrfs_ordered_extent *btrfs_lookup_ordered_extent(struct btrfs_inode *inode, |
e6dcd2dc CM |
946 | u64 file_offset) |
947 | { | |
e6dcd2dc CM |
948 | struct rb_node *node; |
949 | struct btrfs_ordered_extent *entry = NULL; | |
24533f6a | 950 | unsigned long flags; |
e6dcd2dc | 951 | |
54c65371 DS |
952 | spin_lock_irqsave(&inode->ordered_tree_lock, flags); |
953 | node = ordered_tree_search(inode, file_offset); | |
e6dcd2dc CM |
954 | if (!node) |
955 | goto out; | |
956 | ||
957 | entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); | |
20bbf20e | 958 | if (!in_range(file_offset, entry->file_offset, entry->num_bytes)) |
e6dcd2dc | 959 | entry = NULL; |
5bea2508 | 960 | if (entry) { |
e76edab7 | 961 | refcount_inc(&entry->refs); |
5bea2508 JT |
962 | trace_btrfs_ordered_extent_lookup(inode, entry); |
963 | } | |
e6dcd2dc | 964 | out: |
54c65371 | 965 | spin_unlock_irqrestore(&inode->ordered_tree_lock, flags); |
e6dcd2dc CM |
966 | return entry; |
967 | } | |
968 | ||
4b46fce2 JB |
969 | /* Since the DIO code tries to lock a wide area we need to look for any ordered |
970 | * extents that exist in the range, rather than just the start of the range. | |
971 | */ | |
a776c6fa NB |
972 | struct btrfs_ordered_extent *btrfs_lookup_ordered_range( |
973 | struct btrfs_inode *inode, u64 file_offset, u64 len) | |
4b46fce2 | 974 | { |
4b46fce2 JB |
975 | struct rb_node *node; |
976 | struct btrfs_ordered_extent *entry = NULL; | |
977 | ||
54c65371 DS |
978 | spin_lock_irq(&inode->ordered_tree_lock); |
979 | node = ordered_tree_search(inode, file_offset); | |
4b46fce2 | 980 | if (!node) { |
54c65371 | 981 | node = ordered_tree_search(inode, file_offset + len); |
4b46fce2 JB |
982 | if (!node) |
983 | goto out; | |
984 | } | |
985 | ||
986 | while (1) { | |
987 | entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); | |
988 | if (range_overlaps(entry, file_offset, len)) | |
989 | break; | |
990 | ||
991 | if (entry->file_offset >= file_offset + len) { | |
992 | entry = NULL; | |
993 | break; | |
994 | } | |
995 | entry = NULL; | |
996 | node = rb_next(node); | |
997 | if (!node) | |
998 | break; | |
999 | } | |
1000 | out: | |
5bea2508 | 1001 | if (entry) { |
e76edab7 | 1002 | refcount_inc(&entry->refs); |
5bea2508 JT |
1003 | trace_btrfs_ordered_extent_lookup_range(inode, entry); |
1004 | } | |
54c65371 | 1005 | spin_unlock_irq(&inode->ordered_tree_lock); |
4b46fce2 JB |
1006 | return entry; |
1007 | } | |
1008 | ||
48778179 FM |
1009 | /* |
1010 | * Adds all ordered extents to the given list. The list ends up sorted by the | |
1011 | * file_offset of the ordered extents. | |
1012 | */ | |
1013 | void btrfs_get_ordered_extents_for_logging(struct btrfs_inode *inode, | |
1014 | struct list_head *list) | |
1015 | { | |
48778179 FM |
1016 | struct rb_node *n; |
1017 | ||
1b6e068a | 1018 | btrfs_assert_inode_locked(inode); |
48778179 | 1019 | |
54c65371 DS |
1020 | spin_lock_irq(&inode->ordered_tree_lock); |
1021 | for (n = rb_first(&inode->ordered_tree); n; n = rb_next(n)) { | |
48778179 FM |
1022 | struct btrfs_ordered_extent *ordered; |
1023 | ||
1024 | ordered = rb_entry(n, struct btrfs_ordered_extent, rb_node); | |
1025 | ||
1026 | if (test_bit(BTRFS_ORDERED_LOGGED, &ordered->flags)) | |
1027 | continue; | |
1028 | ||
1029 | ASSERT(list_empty(&ordered->log_list)); | |
1030 | list_add_tail(&ordered->log_list, list); | |
1031 | refcount_inc(&ordered->refs); | |
5bea2508 | 1032 | trace_btrfs_ordered_extent_lookup_for_logging(inode, ordered); |
48778179 | 1033 | } |
54c65371 | 1034 | spin_unlock_irq(&inode->ordered_tree_lock); |
48778179 FM |
1035 | } |
1036 | ||
eb84ae03 CM |
1037 | /* |
1038 | * lookup and return any extent before 'file_offset'. NULL is returned | |
1039 | * if none is found | |
1040 | */ | |
e6dcd2dc | 1041 | struct btrfs_ordered_extent * |
6d072c8e | 1042 | btrfs_lookup_first_ordered_extent(struct btrfs_inode *inode, u64 file_offset) |
e6dcd2dc | 1043 | { |
e6dcd2dc CM |
1044 | struct rb_node *node; |
1045 | struct btrfs_ordered_extent *entry = NULL; | |
1046 | ||
54c65371 DS |
1047 | spin_lock_irq(&inode->ordered_tree_lock); |
1048 | node = ordered_tree_search(inode, file_offset); | |
e6dcd2dc CM |
1049 | if (!node) |
1050 | goto out; | |
1051 | ||
1052 | entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); | |
e76edab7 | 1053 | refcount_inc(&entry->refs); |
5bea2508 | 1054 | trace_btrfs_ordered_extent_lookup_first(inode, entry); |
e6dcd2dc | 1055 | out: |
54c65371 | 1056 | spin_unlock_irq(&inode->ordered_tree_lock); |
e6dcd2dc | 1057 | return entry; |
81d7ed29 | 1058 | } |
dbe674a9 | 1059 | |
c095f333 QW |
1060 | /* |
1061 | * Lookup the first ordered extent that overlaps the range | |
1062 | * [@file_offset, @file_offset + @len). | |
1063 | * | |
1064 | * The difference between this and btrfs_lookup_first_ordered_extent() is | |
1065 | * that this one won't return any ordered extent that does not overlap the range. | |
1066 | * And the difference against btrfs_lookup_ordered_extent() is, this function | |
1067 | * ensures the first ordered extent gets returned. | |
1068 | */ | |
1069 | struct btrfs_ordered_extent *btrfs_lookup_first_ordered_range( | |
1070 | struct btrfs_inode *inode, u64 file_offset, u64 len) | |
1071 | { | |
c095f333 QW |
1072 | struct rb_node *node; |
1073 | struct rb_node *cur; | |
1074 | struct rb_node *prev; | |
1075 | struct rb_node *next; | |
1076 | struct btrfs_ordered_extent *entry = NULL; | |
1077 | ||
54c65371 DS |
1078 | spin_lock_irq(&inode->ordered_tree_lock); |
1079 | node = inode->ordered_tree.rb_node; | |
c095f333 QW |
1080 | /* |
1081 | * Here we don't want to use tree_search() which will use tree->last | |
1082 | * and screw up the search order. | |
1083 | * And __tree_search() can't return the adjacent ordered extents | |
1084 | * either, thus here we do our own search. | |
1085 | */ | |
1086 | while (node) { | |
1087 | entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); | |
1088 | ||
1089 | if (file_offset < entry->file_offset) { | |
1090 | node = node->rb_left; | |
1091 | } else if (file_offset >= entry_end(entry)) { | |
1092 | node = node->rb_right; | |
1093 | } else { | |
1094 | /* | |
1095 | * Direct hit, got an ordered extent that starts at | |
1096 | * @file_offset | |
1097 | */ | |
1098 | goto out; | |
1099 | } | |
1100 | } | |
1101 | if (!entry) { | |
1102 | /* Empty tree */ | |
1103 | goto out; | |
1104 | } | |
1105 | ||
1106 | cur = &entry->rb_node; | |
1107 | /* We got an entry around @file_offset, check adjacent entries */ | |
1108 | if (entry->file_offset < file_offset) { | |
1109 | prev = cur; | |
1110 | next = rb_next(cur); | |
1111 | } else { | |
1112 | prev = rb_prev(cur); | |
1113 | next = cur; | |
1114 | } | |
1115 | if (prev) { | |
1116 | entry = rb_entry(prev, struct btrfs_ordered_extent, rb_node); | |
1117 | if (range_overlaps(entry, file_offset, len)) | |
1118 | goto out; | |
1119 | } | |
1120 | if (next) { | |
1121 | entry = rb_entry(next, struct btrfs_ordered_extent, rb_node); | |
1122 | if (range_overlaps(entry, file_offset, len)) | |
1123 | goto out; | |
1124 | } | |
1125 | /* No ordered extent in the range */ | |
1126 | entry = NULL; | |
1127 | out: | |
5bea2508 | 1128 | if (entry) { |
c095f333 | 1129 | refcount_inc(&entry->refs); |
5bea2508 JT |
1130 | trace_btrfs_ordered_extent_lookup_first_range(inode, entry); |
1131 | } | |
1132 | ||
54c65371 | 1133 | spin_unlock_irq(&inode->ordered_tree_lock); |
c095f333 QW |
1134 | return entry; |
1135 | } | |
1136 | ||
ffa87214 | 1137 | /* |
43dd529a DS |
1138 | * Lock the passed range and ensures all pending ordered extents in it are run |
1139 | * to completion. | |
ffa87214 | 1140 | * |
ffa87214 NB |
1141 | * @inode: Inode whose ordered tree is to be searched |
1142 | * @start: Beginning of range to flush | |
1143 | * @end: Last byte of range to lock | |
1144 | * @cached_state: If passed, will return the extent state responsible for the | |
43dd529a DS |
1145 | * locked range. It's the caller's responsibility to free the |
1146 | * cached state. | |
ffa87214 | 1147 | * |
43dd529a DS |
1148 | * Always return with the given range locked, ensuring after it's called no |
1149 | * order extent can be pending. | |
ffa87214 | 1150 | */ |
b272ae22 | 1151 | void btrfs_lock_and_flush_ordered_range(struct btrfs_inode *inode, u64 start, |
ffa87214 NB |
1152 | u64 end, |
1153 | struct extent_state **cached_state) | |
1154 | { | |
1155 | struct btrfs_ordered_extent *ordered; | |
a3b46b86 NA |
1156 | struct extent_state *cache = NULL; |
1157 | struct extent_state **cachedp = &cache; | |
bd80d94e NB |
1158 | |
1159 | if (cached_state) | |
a3b46b86 | 1160 | cachedp = cached_state; |
ffa87214 NB |
1161 | |
1162 | while (1) { | |
570eb97b | 1163 | lock_extent(&inode->io_tree, start, end, cachedp); |
ffa87214 NB |
1164 | ordered = btrfs_lookup_ordered_range(inode, start, |
1165 | end - start + 1); | |
bd80d94e NB |
1166 | if (!ordered) { |
1167 | /* | |
1168 | * If no external cached_state has been passed then | |
1169 | * decrement the extra ref taken for cachedp since we | |
1170 | * aren't exposing it outside of this function | |
1171 | */ | |
1172 | if (!cached_state) | |
a3b46b86 | 1173 | refcount_dec(&cache->refs); |
ffa87214 | 1174 | break; |
bd80d94e | 1175 | } |
570eb97b | 1176 | unlock_extent(&inode->io_tree, start, end, cachedp); |
36d45567 | 1177 | btrfs_start_ordered_extent(ordered); |
ffa87214 NB |
1178 | btrfs_put_ordered_extent(ordered); |
1179 | } | |
1180 | } | |
1181 | ||
d2c7a19f JB |
1182 | /* |
1183 | * Lock the passed range and ensure all pending ordered extents in it are run | |
1184 | * to completion in nowait mode. | |
1185 | * | |
1186 | * Return true if btrfs_lock_ordered_range does not return any extents, | |
1187 | * otherwise false. | |
1188 | */ | |
632ddfa2 JB |
1189 | bool btrfs_try_lock_ordered_range(struct btrfs_inode *inode, u64 start, u64 end, |
1190 | struct extent_state **cached_state) | |
d2c7a19f JB |
1191 | { |
1192 | struct btrfs_ordered_extent *ordered; | |
1193 | ||
632ddfa2 | 1194 | if (!try_lock_extent(&inode->io_tree, start, end, cached_state)) |
d2c7a19f JB |
1195 | return false; |
1196 | ||
1197 | ordered = btrfs_lookup_ordered_range(inode, start, end - start + 1); | |
1198 | if (!ordered) | |
1199 | return true; | |
1200 | ||
1201 | btrfs_put_ordered_extent(ordered); | |
632ddfa2 | 1202 | unlock_extent(&inode->io_tree, start, end, cached_state); |
d2c7a19f JB |
1203 | |
1204 | return false; | |
1205 | } | |
1206 | ||
8f4af4b8 | 1207 | /* Split out a new ordered extent for this first @len bytes of @ordered. */ |
b0307e28 CH |
1208 | struct btrfs_ordered_extent *btrfs_split_ordered_extent( |
1209 | struct btrfs_ordered_extent *ordered, u64 len) | |
d22002fd | 1210 | { |
a1f4e3d7 | 1211 | struct btrfs_inode *inode = ordered->inode; |
816f589b CH |
1212 | struct btrfs_root *root = inode->root; |
1213 | struct btrfs_fs_info *fs_info = root->fs_info; | |
f0792b79 CH |
1214 | u64 file_offset = ordered->file_offset; |
1215 | u64 disk_bytenr = ordered->disk_bytenr; | |
52b1fdca CH |
1216 | unsigned long flags = ordered->flags; |
1217 | struct btrfs_ordered_sum *sum, *tmpsum; | |
816f589b | 1218 | struct btrfs_ordered_extent *new; |
8f4af4b8 | 1219 | struct rb_node *node; |
52b1fdca | 1220 | u64 offset = 0; |
d22002fd | 1221 | |
816f589b | 1222 | trace_btrfs_ordered_extent_split(inode, ordered); |
5bea2508 | 1223 | |
f0792b79 CH |
1224 | ASSERT(!(flags & (1U << BTRFS_ORDERED_COMPRESSED))); |
1225 | ||
8f4af4b8 CH |
1226 | /* |
1227 | * The entire bio must be covered by the ordered extent, but we can't | |
1228 | * reduce the original extent to a zero length either. | |
1229 | */ | |
1230 | if (WARN_ON_ONCE(len >= ordered->num_bytes)) | |
b0307e28 | 1231 | return ERR_PTR(-EINVAL); |
52b1fdca CH |
1232 | /* We cannot split partially completed ordered extents. */ |
1233 | if (ordered->bytes_left) { | |
1234 | ASSERT(!(flags & ~BTRFS_ORDERED_TYPE_FLAGS)); | |
1235 | if (WARN_ON_ONCE(ordered->bytes_left != ordered->disk_num_bytes)) | |
1236 | return ERR_PTR(-EINVAL); | |
1237 | } | |
e44ca71c CH |
1238 | /* We cannot split a compressed ordered extent. */ |
1239 | if (WARN_ON_ONCE(ordered->disk_num_bytes != ordered->num_bytes)) | |
b0307e28 | 1240 | return ERR_PTR(-EINVAL); |
e44ca71c | 1241 | |
816f589b CH |
1242 | new = alloc_ordered_extent(inode, file_offset, len, len, disk_bytenr, |
1243 | len, 0, flags, ordered->compress_type); | |
1244 | if (IS_ERR(new)) | |
1245 | return new; | |
1246 | ||
1247 | /* One ref for the tree. */ | |
1248 | refcount_inc(&new->refs); | |
1249 | ||
c18ca3c9 FM |
1250 | /* |
1251 | * Take the root's ordered_extent_lock to avoid a race with | |
1252 | * btrfs_wait_ordered_extents() when updating the disk_bytenr and | |
1253 | * disk_num_bytes fields of the ordered extent below. And we disable | |
1254 | * IRQs because the inode's ordered_tree_lock is used in IRQ context | |
1255 | * elsewhere. | |
1256 | * | |
1257 | * There's no concern about a previous caller of | |
1258 | * btrfs_wait_ordered_extents() getting the trimmed ordered extent | |
1259 | * before we insert the new one, because even if it gets the ordered | |
1260 | * extent before it's trimmed and the new one inserted, right before it | |
1261 | * uses it or during its use, the ordered extent might have been | |
1262 | * trimmed in the meanwhile, and it missed the new ordered extent. | |
1263 | * There's no way around this and it's harmless for current use cases, | |
1264 | * so we take the root's ordered_extent_lock to fix that race during | |
1265 | * trimming and silence tools like KCSAN. | |
1266 | */ | |
816f589b | 1267 | spin_lock_irq(&root->ordered_extent_lock); |
54c65371 | 1268 | spin_lock(&inode->ordered_tree_lock); |
d22002fd | 1269 | |
cb3cd624 FM |
1270 | /* |
1271 | * We don't have overlapping ordered extents (that would imply double | |
1272 | * allocation of extents) and we checked above that the split length | |
1273 | * does not cross the ordered extent's num_bytes field, so there's | |
1274 | * no need to remove it and re-insert it in the tree. | |
1275 | */ | |
8f4af4b8 CH |
1276 | ordered->file_offset += len; |
1277 | ordered->disk_bytenr += len; | |
1278 | ordered->num_bytes -= len; | |
1279 | ordered->disk_num_bytes -= len; | |
63a6ce5a | 1280 | ordered->ram_bytes -= len; |
52b1fdca CH |
1281 | |
1282 | if (test_bit(BTRFS_ORDERED_IO_DONE, &ordered->flags)) { | |
1283 | ASSERT(ordered->bytes_left == 0); | |
1284 | new->bytes_left = 0; | |
1285 | } else { | |
1286 | ordered->bytes_left -= len; | |
1287 | } | |
1288 | ||
1289 | if (test_bit(BTRFS_ORDERED_TRUNCATED, &ordered->flags)) { | |
1290 | if (ordered->truncated_len > len) { | |
1291 | ordered->truncated_len -= len; | |
1292 | } else { | |
1293 | new->truncated_len = ordered->truncated_len; | |
1294 | ordered->truncated_len = 0; | |
1295 | } | |
1296 | } | |
1297 | ||
1298 | list_for_each_entry_safe(sum, tmpsum, &ordered->list, list) { | |
1299 | if (offset == len) | |
1300 | break; | |
1301 | list_move_tail(&sum->list, &new->list); | |
1302 | offset += sum->len; | |
1303 | } | |
d22002fd | 1304 | |
54c65371 | 1305 | node = tree_insert(&inode->ordered_tree, new->file_offset, &new->rb_node); |
b7ac1acb | 1306 | if (unlikely(node)) |
816f589b | 1307 | btrfs_panic(fs_info, -EEXIST, |
8b62f14d | 1308 | "inconsistency in ordered tree at offset %llu after split", |
816f589b | 1309 | new->file_offset); |
54c65371 | 1310 | spin_unlock(&inode->ordered_tree_lock); |
f0792b79 | 1311 | |
816f589b CH |
1312 | list_add_tail(&new->root_extent_list, &root->ordered_extents); |
1313 | root->nr_ordered_extents++; | |
1314 | spin_unlock_irq(&root->ordered_extent_lock); | |
1315 | return new; | |
d22002fd NA |
1316 | } |
1317 | ||
6352b91d MX |
1318 | int __init ordered_data_init(void) |
1319 | { | |
ef5a05c5 | 1320 | btrfs_ordered_extent_cache = KMEM_CACHE(btrfs_ordered_extent, 0); |
6352b91d MX |
1321 | if (!btrfs_ordered_extent_cache) |
1322 | return -ENOMEM; | |
25287e0a | 1323 | |
6352b91d MX |
1324 | return 0; |
1325 | } | |
1326 | ||
e67c718b | 1327 | void __cold ordered_data_exit(void) |
6352b91d | 1328 | { |
5598e900 | 1329 | kmem_cache_destroy(btrfs_ordered_extent_cache); |
6352b91d | 1330 | } |