Loading...
1/*
2 * Copyright (C) 2007 Oracle. All rights reserved.
3 *
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
7 *
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
12 *
13 * You should have received a copy of the GNU General Public
14 * License along with this program; if not, write to the
15 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
16 * Boston, MA 021110-1307, USA.
17 */
18
19#include <linux/slab.h>
20#include <linux/blkdev.h>
21#include <linux/writeback.h>
22#include <linux/pagevec.h>
23#include "ctree.h"
24#include "transaction.h"
25#include "btrfs_inode.h"
26#include "extent_io.h"
27
28static u64 entry_end(struct btrfs_ordered_extent *entry)
29{
30 if (entry->file_offset + entry->len < entry->file_offset)
31 return (u64)-1;
32 return entry->file_offset + entry->len;
33}
34
35/* returns NULL if the insertion worked, or it returns the node it did find
36 * in the tree
37 */
38static struct rb_node *tree_insert(struct rb_root *root, u64 file_offset,
39 struct rb_node *node)
40{
41 struct rb_node **p = &root->rb_node;
42 struct rb_node *parent = NULL;
43 struct btrfs_ordered_extent *entry;
44
45 while (*p) {
46 parent = *p;
47 entry = rb_entry(parent, struct btrfs_ordered_extent, rb_node);
48
49 if (file_offset < entry->file_offset)
50 p = &(*p)->rb_left;
51 else if (file_offset >= entry_end(entry))
52 p = &(*p)->rb_right;
53 else
54 return parent;
55 }
56
57 rb_link_node(node, parent, p);
58 rb_insert_color(node, root);
59 return NULL;
60}
61
62static void ordered_data_tree_panic(struct inode *inode, int errno,
63 u64 offset)
64{
65 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
66 btrfs_panic(fs_info, errno, "Inconsistency in ordered tree at offset "
67 "%llu\n", (unsigned long long)offset);
68}
69
70/*
71 * look for a given offset in the tree, and if it can't be found return the
72 * first lesser offset
73 */
74static struct rb_node *__tree_search(struct rb_root *root, u64 file_offset,
75 struct rb_node **prev_ret)
76{
77 struct rb_node *n = root->rb_node;
78 struct rb_node *prev = NULL;
79 struct rb_node *test;
80 struct btrfs_ordered_extent *entry;
81 struct btrfs_ordered_extent *prev_entry = NULL;
82
83 while (n) {
84 entry = rb_entry(n, struct btrfs_ordered_extent, rb_node);
85 prev = n;
86 prev_entry = entry;
87
88 if (file_offset < entry->file_offset)
89 n = n->rb_left;
90 else if (file_offset >= entry_end(entry))
91 n = n->rb_right;
92 else
93 return n;
94 }
95 if (!prev_ret)
96 return NULL;
97
98 while (prev && file_offset >= entry_end(prev_entry)) {
99 test = rb_next(prev);
100 if (!test)
101 break;
102 prev_entry = rb_entry(test, struct btrfs_ordered_extent,
103 rb_node);
104 if (file_offset < entry_end(prev_entry))
105 break;
106
107 prev = test;
108 }
109 if (prev)
110 prev_entry = rb_entry(prev, struct btrfs_ordered_extent,
111 rb_node);
112 while (prev && file_offset < entry_end(prev_entry)) {
113 test = rb_prev(prev);
114 if (!test)
115 break;
116 prev_entry = rb_entry(test, struct btrfs_ordered_extent,
117 rb_node);
118 prev = test;
119 }
120 *prev_ret = prev;
121 return NULL;
122}
123
124/*
125 * helper to check if a given offset is inside a given entry
126 */
127static int offset_in_entry(struct btrfs_ordered_extent *entry, u64 file_offset)
128{
129 if (file_offset < entry->file_offset ||
130 entry->file_offset + entry->len <= file_offset)
131 return 0;
132 return 1;
133}
134
135static int range_overlaps(struct btrfs_ordered_extent *entry, u64 file_offset,
136 u64 len)
137{
138 if (file_offset + len <= entry->file_offset ||
139 entry->file_offset + entry->len <= file_offset)
140 return 0;
141 return 1;
142}
143
144/*
145 * look find the first ordered struct that has this offset, otherwise
146 * the first one less than this offset
147 */
148static inline struct rb_node *tree_search(struct btrfs_ordered_inode_tree *tree,
149 u64 file_offset)
150{
151 struct rb_root *root = &tree->tree;
152 struct rb_node *prev = NULL;
153 struct rb_node *ret;
154 struct btrfs_ordered_extent *entry;
155
156 if (tree->last) {
157 entry = rb_entry(tree->last, struct btrfs_ordered_extent,
158 rb_node);
159 if (offset_in_entry(entry, file_offset))
160 return tree->last;
161 }
162 ret = __tree_search(root, file_offset, &prev);
163 if (!ret)
164 ret = prev;
165 if (ret)
166 tree->last = ret;
167 return ret;
168}
169
170/* allocate and add a new ordered_extent into the per-inode tree.
171 * file_offset is the logical offset in the file
172 *
173 * start is the disk block number of an extent already reserved in the
174 * extent allocation tree
175 *
176 * len is the length of the extent
177 *
178 * The tree is given a single reference on the ordered extent that was
179 * inserted.
180 */
181static int __btrfs_add_ordered_extent(struct inode *inode, u64 file_offset,
182 u64 start, u64 len, u64 disk_len,
183 int type, int dio, int compress_type)
184{
185 struct btrfs_ordered_inode_tree *tree;
186 struct rb_node *node;
187 struct btrfs_ordered_extent *entry;
188
189 tree = &BTRFS_I(inode)->ordered_tree;
190 entry = kzalloc(sizeof(*entry), GFP_NOFS);
191 if (!entry)
192 return -ENOMEM;
193
194 entry->file_offset = file_offset;
195 entry->start = start;
196 entry->len = len;
197 entry->disk_len = disk_len;
198 entry->bytes_left = len;
199 entry->inode = igrab(inode);
200 entry->compress_type = compress_type;
201 if (type != BTRFS_ORDERED_IO_DONE && type != BTRFS_ORDERED_COMPLETE)
202 set_bit(type, &entry->flags);
203
204 if (dio)
205 set_bit(BTRFS_ORDERED_DIRECT, &entry->flags);
206
207 /* one ref for the tree */
208 atomic_set(&entry->refs, 1);
209 init_waitqueue_head(&entry->wait);
210 INIT_LIST_HEAD(&entry->list);
211 INIT_LIST_HEAD(&entry->root_extent_list);
212
213 trace_btrfs_ordered_extent_add(inode, entry);
214
215 spin_lock_irq(&tree->lock);
216 node = tree_insert(&tree->tree, file_offset,
217 &entry->rb_node);
218 if (node)
219 ordered_data_tree_panic(inode, -EEXIST, file_offset);
220 spin_unlock_irq(&tree->lock);
221
222 spin_lock(&BTRFS_I(inode)->root->fs_info->ordered_extent_lock);
223 list_add_tail(&entry->root_extent_list,
224 &BTRFS_I(inode)->root->fs_info->ordered_extents);
225 spin_unlock(&BTRFS_I(inode)->root->fs_info->ordered_extent_lock);
226
227 return 0;
228}
229
230int btrfs_add_ordered_extent(struct inode *inode, u64 file_offset,
231 u64 start, u64 len, u64 disk_len, int type)
232{
233 return __btrfs_add_ordered_extent(inode, file_offset, start, len,
234 disk_len, type, 0,
235 BTRFS_COMPRESS_NONE);
236}
237
238int btrfs_add_ordered_extent_dio(struct inode *inode, u64 file_offset,
239 u64 start, u64 len, u64 disk_len, int type)
240{
241 return __btrfs_add_ordered_extent(inode, file_offset, start, len,
242 disk_len, type, 1,
243 BTRFS_COMPRESS_NONE);
244}
245
246int btrfs_add_ordered_extent_compress(struct inode *inode, u64 file_offset,
247 u64 start, u64 len, u64 disk_len,
248 int type, int compress_type)
249{
250 return __btrfs_add_ordered_extent(inode, file_offset, start, len,
251 disk_len, type, 0,
252 compress_type);
253}
254
255/*
256 * Add a struct btrfs_ordered_sum into the list of checksums to be inserted
257 * when an ordered extent is finished. If the list covers more than one
258 * ordered extent, it is split across multiples.
259 */
260void btrfs_add_ordered_sum(struct inode *inode,
261 struct btrfs_ordered_extent *entry,
262 struct btrfs_ordered_sum *sum)
263{
264 struct btrfs_ordered_inode_tree *tree;
265
266 tree = &BTRFS_I(inode)->ordered_tree;
267 spin_lock_irq(&tree->lock);
268 list_add_tail(&sum->list, &entry->list);
269 spin_unlock_irq(&tree->lock);
270}
271
272/*
273 * this is used to account for finished IO across a given range
274 * of the file. The IO may span ordered extents. If
275 * a given ordered_extent is completely done, 1 is returned, otherwise
276 * 0.
277 *
278 * test_and_set_bit on a flag in the struct btrfs_ordered_extent is used
279 * to make sure this function only returns 1 once for a given ordered extent.
280 *
281 * file_offset is updated to one byte past the range that is recorded as
282 * complete. This allows you to walk forward in the file.
283 */
284int btrfs_dec_test_first_ordered_pending(struct inode *inode,
285 struct btrfs_ordered_extent **cached,
286 u64 *file_offset, u64 io_size, int uptodate)
287{
288 struct btrfs_ordered_inode_tree *tree;
289 struct rb_node *node;
290 struct btrfs_ordered_extent *entry = NULL;
291 int ret;
292 unsigned long flags;
293 u64 dec_end;
294 u64 dec_start;
295 u64 to_dec;
296
297 tree = &BTRFS_I(inode)->ordered_tree;
298 spin_lock_irqsave(&tree->lock, flags);
299 node = tree_search(tree, *file_offset);
300 if (!node) {
301 ret = 1;
302 goto out;
303 }
304
305 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
306 if (!offset_in_entry(entry, *file_offset)) {
307 ret = 1;
308 goto out;
309 }
310
311 dec_start = max(*file_offset, entry->file_offset);
312 dec_end = min(*file_offset + io_size, entry->file_offset +
313 entry->len);
314 *file_offset = dec_end;
315 if (dec_start > dec_end) {
316 printk(KERN_CRIT "bad ordering dec_start %llu end %llu\n",
317 (unsigned long long)dec_start,
318 (unsigned long long)dec_end);
319 }
320 to_dec = dec_end - dec_start;
321 if (to_dec > entry->bytes_left) {
322 printk(KERN_CRIT "bad ordered accounting left %llu size %llu\n",
323 (unsigned long long)entry->bytes_left,
324 (unsigned long long)to_dec);
325 }
326 entry->bytes_left -= to_dec;
327 if (!uptodate)
328 set_bit(BTRFS_ORDERED_IOERR, &entry->flags);
329
330 if (entry->bytes_left == 0)
331 ret = test_and_set_bit(BTRFS_ORDERED_IO_DONE, &entry->flags);
332 else
333 ret = 1;
334out:
335 if (!ret && cached && entry) {
336 *cached = entry;
337 atomic_inc(&entry->refs);
338 }
339 spin_unlock_irqrestore(&tree->lock, flags);
340 return ret == 0;
341}
342
343/*
344 * this is used to account for finished IO across a given range
345 * of the file. The IO should not span ordered extents. If
346 * a given ordered_extent is completely done, 1 is returned, otherwise
347 * 0.
348 *
349 * test_and_set_bit on a flag in the struct btrfs_ordered_extent is used
350 * to make sure this function only returns 1 once for a given ordered extent.
351 */
352int btrfs_dec_test_ordered_pending(struct inode *inode,
353 struct btrfs_ordered_extent **cached,
354 u64 file_offset, u64 io_size, int uptodate)
355{
356 struct btrfs_ordered_inode_tree *tree;
357 struct rb_node *node;
358 struct btrfs_ordered_extent *entry = NULL;
359 unsigned long flags;
360 int ret;
361
362 tree = &BTRFS_I(inode)->ordered_tree;
363 spin_lock_irqsave(&tree->lock, flags);
364 if (cached && *cached) {
365 entry = *cached;
366 goto have_entry;
367 }
368
369 node = tree_search(tree, file_offset);
370 if (!node) {
371 ret = 1;
372 goto out;
373 }
374
375 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
376have_entry:
377 if (!offset_in_entry(entry, file_offset)) {
378 ret = 1;
379 goto out;
380 }
381
382 if (io_size > entry->bytes_left) {
383 printk(KERN_CRIT "bad ordered accounting left %llu size %llu\n",
384 (unsigned long long)entry->bytes_left,
385 (unsigned long long)io_size);
386 }
387 entry->bytes_left -= io_size;
388 if (!uptodate)
389 set_bit(BTRFS_ORDERED_IOERR, &entry->flags);
390
391 if (entry->bytes_left == 0)
392 ret = test_and_set_bit(BTRFS_ORDERED_IO_DONE, &entry->flags);
393 else
394 ret = 1;
395out:
396 if (!ret && cached && entry) {
397 *cached = entry;
398 atomic_inc(&entry->refs);
399 }
400 spin_unlock_irqrestore(&tree->lock, flags);
401 return ret == 0;
402}
403
404/*
405 * used to drop a reference on an ordered extent. This will free
406 * the extent if the last reference is dropped
407 */
408void btrfs_put_ordered_extent(struct btrfs_ordered_extent *entry)
409{
410 struct list_head *cur;
411 struct btrfs_ordered_sum *sum;
412
413 trace_btrfs_ordered_extent_put(entry->inode, entry);
414
415 if (atomic_dec_and_test(&entry->refs)) {
416 if (entry->inode)
417 btrfs_add_delayed_iput(entry->inode);
418 while (!list_empty(&entry->list)) {
419 cur = entry->list.next;
420 sum = list_entry(cur, struct btrfs_ordered_sum, list);
421 list_del(&sum->list);
422 kfree(sum);
423 }
424 kfree(entry);
425 }
426}
427
428/*
429 * remove an ordered extent from the tree. No references are dropped
430 * and waiters are woken up.
431 */
432void btrfs_remove_ordered_extent(struct inode *inode,
433 struct btrfs_ordered_extent *entry)
434{
435 struct btrfs_ordered_inode_tree *tree;
436 struct btrfs_root *root = BTRFS_I(inode)->root;
437 struct rb_node *node;
438
439 tree = &BTRFS_I(inode)->ordered_tree;
440 spin_lock_irq(&tree->lock);
441 node = &entry->rb_node;
442 rb_erase(node, &tree->tree);
443 tree->last = NULL;
444 set_bit(BTRFS_ORDERED_COMPLETE, &entry->flags);
445 spin_unlock_irq(&tree->lock);
446
447 spin_lock(&root->fs_info->ordered_extent_lock);
448 list_del_init(&entry->root_extent_list);
449
450 trace_btrfs_ordered_extent_remove(inode, entry);
451
452 /*
453 * we have no more ordered extents for this inode and
454 * no dirty pages. We can safely remove it from the
455 * list of ordered extents
456 */
457 if (RB_EMPTY_ROOT(&tree->tree) &&
458 !mapping_tagged(inode->i_mapping, PAGECACHE_TAG_DIRTY)) {
459 list_del_init(&BTRFS_I(inode)->ordered_operations);
460 }
461 spin_unlock(&root->fs_info->ordered_extent_lock);
462 wake_up(&entry->wait);
463}
464
465/*
466 * wait for all the ordered extents in a root. This is done when balancing
467 * space between drives.
468 */
469void btrfs_wait_ordered_extents(struct btrfs_root *root,
470 int nocow_only, int delay_iput)
471{
472 struct list_head splice;
473 struct list_head *cur;
474 struct btrfs_ordered_extent *ordered;
475 struct inode *inode;
476
477 INIT_LIST_HEAD(&splice);
478
479 spin_lock(&root->fs_info->ordered_extent_lock);
480 list_splice_init(&root->fs_info->ordered_extents, &splice);
481 while (!list_empty(&splice)) {
482 cur = splice.next;
483 ordered = list_entry(cur, struct btrfs_ordered_extent,
484 root_extent_list);
485 if (nocow_only &&
486 !test_bit(BTRFS_ORDERED_NOCOW, &ordered->flags) &&
487 !test_bit(BTRFS_ORDERED_PREALLOC, &ordered->flags)) {
488 list_move(&ordered->root_extent_list,
489 &root->fs_info->ordered_extents);
490 cond_resched_lock(&root->fs_info->ordered_extent_lock);
491 continue;
492 }
493
494 list_del_init(&ordered->root_extent_list);
495 atomic_inc(&ordered->refs);
496
497 /*
498 * the inode may be getting freed (in sys_unlink path).
499 */
500 inode = igrab(ordered->inode);
501
502 spin_unlock(&root->fs_info->ordered_extent_lock);
503
504 if (inode) {
505 btrfs_start_ordered_extent(inode, ordered, 1);
506 btrfs_put_ordered_extent(ordered);
507 if (delay_iput)
508 btrfs_add_delayed_iput(inode);
509 else
510 iput(inode);
511 } else {
512 btrfs_put_ordered_extent(ordered);
513 }
514
515 spin_lock(&root->fs_info->ordered_extent_lock);
516 }
517 spin_unlock(&root->fs_info->ordered_extent_lock);
518}
519
520/*
521 * this is used during transaction commit to write all the inodes
522 * added to the ordered operation list. These files must be fully on
523 * disk before the transaction commits.
524 *
525 * we have two modes here, one is to just start the IO via filemap_flush
526 * and the other is to wait for all the io. When we wait, we have an
527 * extra check to make sure the ordered operation list really is empty
528 * before we return
529 */
530void btrfs_run_ordered_operations(struct btrfs_root *root, int wait)
531{
532 struct btrfs_inode *btrfs_inode;
533 struct inode *inode;
534 struct list_head splice;
535
536 INIT_LIST_HEAD(&splice);
537
538 mutex_lock(&root->fs_info->ordered_operations_mutex);
539 spin_lock(&root->fs_info->ordered_extent_lock);
540again:
541 list_splice_init(&root->fs_info->ordered_operations, &splice);
542
543 while (!list_empty(&splice)) {
544 btrfs_inode = list_entry(splice.next, struct btrfs_inode,
545 ordered_operations);
546
547 inode = &btrfs_inode->vfs_inode;
548
549 list_del_init(&btrfs_inode->ordered_operations);
550
551 /*
552 * the inode may be getting freed (in sys_unlink path).
553 */
554 inode = igrab(inode);
555
556 if (!wait && inode) {
557 list_add_tail(&BTRFS_I(inode)->ordered_operations,
558 &root->fs_info->ordered_operations);
559 }
560 spin_unlock(&root->fs_info->ordered_extent_lock);
561
562 if (inode) {
563 if (wait)
564 btrfs_wait_ordered_range(inode, 0, (u64)-1);
565 else
566 filemap_flush(inode->i_mapping);
567 btrfs_add_delayed_iput(inode);
568 }
569
570 cond_resched();
571 spin_lock(&root->fs_info->ordered_extent_lock);
572 }
573 if (wait && !list_empty(&root->fs_info->ordered_operations))
574 goto again;
575
576 spin_unlock(&root->fs_info->ordered_extent_lock);
577 mutex_unlock(&root->fs_info->ordered_operations_mutex);
578}
579
580/*
581 * Used to start IO or wait for a given ordered extent to finish.
582 *
583 * If wait is one, this effectively waits on page writeback for all the pages
584 * in the extent, and it waits on the io completion code to insert
585 * metadata into the btree corresponding to the extent
586 */
587void btrfs_start_ordered_extent(struct inode *inode,
588 struct btrfs_ordered_extent *entry,
589 int wait)
590{
591 u64 start = entry->file_offset;
592 u64 end = start + entry->len - 1;
593
594 trace_btrfs_ordered_extent_start(inode, entry);
595
596 /*
597 * pages in the range can be dirty, clean or writeback. We
598 * start IO on any dirty ones so the wait doesn't stall waiting
599 * for pdflush to find them
600 */
601 if (!test_bit(BTRFS_ORDERED_DIRECT, &entry->flags))
602 filemap_fdatawrite_range(inode->i_mapping, start, end);
603 if (wait) {
604 wait_event(entry->wait, test_bit(BTRFS_ORDERED_COMPLETE,
605 &entry->flags));
606 }
607}
608
609/*
610 * Used to wait on ordered extents across a large range of bytes.
611 */
612void btrfs_wait_ordered_range(struct inode *inode, u64 start, u64 len)
613{
614 u64 end;
615 u64 orig_end;
616 struct btrfs_ordered_extent *ordered;
617 int found;
618
619 if (start + len < start) {
620 orig_end = INT_LIMIT(loff_t);
621 } else {
622 orig_end = start + len - 1;
623 if (orig_end > INT_LIMIT(loff_t))
624 orig_end = INT_LIMIT(loff_t);
625 }
626
627 /* start IO across the range first to instantiate any delalloc
628 * extents
629 */
630 filemap_fdatawrite_range(inode->i_mapping, start, orig_end);
631
632 /*
633 * So with compression we will find and lock a dirty page and clear the
634 * first one as dirty, setup an async extent, and immediately return
635 * with the entire range locked but with nobody actually marked with
636 * writeback. So we can't just filemap_write_and_wait_range() and
637 * expect it to work since it will just kick off a thread to do the
638 * actual work. So we need to call filemap_fdatawrite_range _again_
639 * since it will wait on the page lock, which won't be unlocked until
640 * after the pages have been marked as writeback and so we're good to go
641 * from there. We have to do this otherwise we'll miss the ordered
642 * extents and that results in badness. Please Josef, do not think you
643 * know better and pull this out at some point in the future, it is
644 * right and you are wrong.
645 */
646 if (test_bit(BTRFS_INODE_HAS_ASYNC_EXTENT,
647 &BTRFS_I(inode)->runtime_flags))
648 filemap_fdatawrite_range(inode->i_mapping, start, orig_end);
649
650 filemap_fdatawait_range(inode->i_mapping, start, orig_end);
651
652 end = orig_end;
653 found = 0;
654 while (1) {
655 ordered = btrfs_lookup_first_ordered_extent(inode, end);
656 if (!ordered)
657 break;
658 if (ordered->file_offset > orig_end) {
659 btrfs_put_ordered_extent(ordered);
660 break;
661 }
662 if (ordered->file_offset + ordered->len < start) {
663 btrfs_put_ordered_extent(ordered);
664 break;
665 }
666 found++;
667 btrfs_start_ordered_extent(inode, ordered, 1);
668 end = ordered->file_offset;
669 btrfs_put_ordered_extent(ordered);
670 if (end == 0 || end == start)
671 break;
672 end--;
673 }
674}
675
676/*
677 * find an ordered extent corresponding to file_offset. return NULL if
678 * nothing is found, otherwise take a reference on the extent and return it
679 */
680struct btrfs_ordered_extent *btrfs_lookup_ordered_extent(struct inode *inode,
681 u64 file_offset)
682{
683 struct btrfs_ordered_inode_tree *tree;
684 struct rb_node *node;
685 struct btrfs_ordered_extent *entry = NULL;
686
687 tree = &BTRFS_I(inode)->ordered_tree;
688 spin_lock_irq(&tree->lock);
689 node = tree_search(tree, file_offset);
690 if (!node)
691 goto out;
692
693 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
694 if (!offset_in_entry(entry, file_offset))
695 entry = NULL;
696 if (entry)
697 atomic_inc(&entry->refs);
698out:
699 spin_unlock_irq(&tree->lock);
700 return entry;
701}
702
703/* Since the DIO code tries to lock a wide area we need to look for any ordered
704 * extents that exist in the range, rather than just the start of the range.
705 */
706struct btrfs_ordered_extent *btrfs_lookup_ordered_range(struct inode *inode,
707 u64 file_offset,
708 u64 len)
709{
710 struct btrfs_ordered_inode_tree *tree;
711 struct rb_node *node;
712 struct btrfs_ordered_extent *entry = NULL;
713
714 tree = &BTRFS_I(inode)->ordered_tree;
715 spin_lock_irq(&tree->lock);
716 node = tree_search(tree, file_offset);
717 if (!node) {
718 node = tree_search(tree, file_offset + len);
719 if (!node)
720 goto out;
721 }
722
723 while (1) {
724 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
725 if (range_overlaps(entry, file_offset, len))
726 break;
727
728 if (entry->file_offset >= file_offset + len) {
729 entry = NULL;
730 break;
731 }
732 entry = NULL;
733 node = rb_next(node);
734 if (!node)
735 break;
736 }
737out:
738 if (entry)
739 atomic_inc(&entry->refs);
740 spin_unlock_irq(&tree->lock);
741 return entry;
742}
743
744/*
745 * lookup and return any extent before 'file_offset'. NULL is returned
746 * if none is found
747 */
748struct btrfs_ordered_extent *
749btrfs_lookup_first_ordered_extent(struct inode *inode, u64 file_offset)
750{
751 struct btrfs_ordered_inode_tree *tree;
752 struct rb_node *node;
753 struct btrfs_ordered_extent *entry = NULL;
754
755 tree = &BTRFS_I(inode)->ordered_tree;
756 spin_lock_irq(&tree->lock);
757 node = tree_search(tree, file_offset);
758 if (!node)
759 goto out;
760
761 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
762 atomic_inc(&entry->refs);
763out:
764 spin_unlock_irq(&tree->lock);
765 return entry;
766}
767
768/*
769 * After an extent is done, call this to conditionally update the on disk
770 * i_size. i_size is updated to cover any fully written part of the file.
771 */
772int btrfs_ordered_update_i_size(struct inode *inode, u64 offset,
773 struct btrfs_ordered_extent *ordered)
774{
775 struct btrfs_ordered_inode_tree *tree = &BTRFS_I(inode)->ordered_tree;
776 u64 disk_i_size;
777 u64 new_i_size;
778 u64 i_size_test;
779 u64 i_size = i_size_read(inode);
780 struct rb_node *node;
781 struct rb_node *prev = NULL;
782 struct btrfs_ordered_extent *test;
783 int ret = 1;
784
785 if (ordered)
786 offset = entry_end(ordered);
787 else
788 offset = ALIGN(offset, BTRFS_I(inode)->root->sectorsize);
789
790 spin_lock_irq(&tree->lock);
791 disk_i_size = BTRFS_I(inode)->disk_i_size;
792
793 /* truncate file */
794 if (disk_i_size > i_size) {
795 BTRFS_I(inode)->disk_i_size = i_size;
796 ret = 0;
797 goto out;
798 }
799
800 /*
801 * if the disk i_size is already at the inode->i_size, or
802 * this ordered extent is inside the disk i_size, we're done
803 */
804 if (disk_i_size == i_size || offset <= disk_i_size) {
805 goto out;
806 }
807
808 /*
809 * walk backward from this ordered extent to disk_i_size.
810 * if we find an ordered extent then we can't update disk i_size
811 * yet
812 */
813 if (ordered) {
814 node = rb_prev(&ordered->rb_node);
815 } else {
816 prev = tree_search(tree, offset);
817 /*
818 * we insert file extents without involving ordered struct,
819 * so there should be no ordered struct cover this offset
820 */
821 if (prev) {
822 test = rb_entry(prev, struct btrfs_ordered_extent,
823 rb_node);
824 BUG_ON(offset_in_entry(test, offset));
825 }
826 node = prev;
827 }
828 for (; node; node = rb_prev(node)) {
829 test = rb_entry(node, struct btrfs_ordered_extent, rb_node);
830
831 /* We treat this entry as if it doesnt exist */
832 if (test_bit(BTRFS_ORDERED_UPDATED_ISIZE, &test->flags))
833 continue;
834 if (test->file_offset + test->len <= disk_i_size)
835 break;
836 if (test->file_offset >= i_size)
837 break;
838 if (test->file_offset >= disk_i_size)
839 goto out;
840 }
841 new_i_size = min_t(u64, offset, i_size);
842
843 /*
844 * at this point, we know we can safely update i_size to at least
845 * the offset from this ordered extent. But, we need to
846 * walk forward and see if ios from higher up in the file have
847 * finished.
848 */
849 if (ordered) {
850 node = rb_next(&ordered->rb_node);
851 } else {
852 if (prev)
853 node = rb_next(prev);
854 else
855 node = rb_first(&tree->tree);
856 }
857
858 /*
859 * We are looking for an area between our current extent and the next
860 * ordered extent to update the i_size to. There are 3 cases here
861 *
862 * 1) We don't actually have anything and we can update to i_size.
863 * 2) We have stuff but they already did their i_size update so again we
864 * can just update to i_size.
865 * 3) We have an outstanding ordered extent so the most we can update
866 * our disk_i_size to is the start of the next offset.
867 */
868 i_size_test = i_size;
869 for (; node; node = rb_next(node)) {
870 test = rb_entry(node, struct btrfs_ordered_extent, rb_node);
871
872 if (test_bit(BTRFS_ORDERED_UPDATED_ISIZE, &test->flags))
873 continue;
874 if (test->file_offset > offset) {
875 i_size_test = test->file_offset;
876 break;
877 }
878 }
879
880 /*
881 * i_size_test is the end of a region after this ordered
882 * extent where there are no ordered extents, we can safely set
883 * disk_i_size to this.
884 */
885 if (i_size_test > offset)
886 new_i_size = min_t(u64, i_size_test, i_size);
887 BTRFS_I(inode)->disk_i_size = new_i_size;
888 ret = 0;
889out:
890 /*
891 * We need to do this because we can't remove ordered extents until
892 * after the i_disk_size has been updated and then the inode has been
893 * updated to reflect the change, so we need to tell anybody who finds
894 * this ordered extent that we've already done all the real work, we
895 * just haven't completed all the other work.
896 */
897 if (ordered)
898 set_bit(BTRFS_ORDERED_UPDATED_ISIZE, &ordered->flags);
899 spin_unlock_irq(&tree->lock);
900 return ret;
901}
902
903/*
904 * search the ordered extents for one corresponding to 'offset' and
905 * try to find a checksum. This is used because we allow pages to
906 * be reclaimed before their checksum is actually put into the btree
907 */
908int btrfs_find_ordered_sum(struct inode *inode, u64 offset, u64 disk_bytenr,
909 u32 *sum)
910{
911 struct btrfs_ordered_sum *ordered_sum;
912 struct btrfs_sector_sum *sector_sums;
913 struct btrfs_ordered_extent *ordered;
914 struct btrfs_ordered_inode_tree *tree = &BTRFS_I(inode)->ordered_tree;
915 unsigned long num_sectors;
916 unsigned long i;
917 u32 sectorsize = BTRFS_I(inode)->root->sectorsize;
918 int ret = 1;
919
920 ordered = btrfs_lookup_ordered_extent(inode, offset);
921 if (!ordered)
922 return 1;
923
924 spin_lock_irq(&tree->lock);
925 list_for_each_entry_reverse(ordered_sum, &ordered->list, list) {
926 if (disk_bytenr >= ordered_sum->bytenr) {
927 num_sectors = ordered_sum->len / sectorsize;
928 sector_sums = ordered_sum->sums;
929 for (i = 0; i < num_sectors; i++) {
930 if (sector_sums[i].bytenr == disk_bytenr) {
931 *sum = sector_sums[i].sum;
932 ret = 0;
933 goto out;
934 }
935 }
936 }
937 }
938out:
939 spin_unlock_irq(&tree->lock);
940 btrfs_put_ordered_extent(ordered);
941 return ret;
942}
943
944
945/*
946 * add a given inode to the list of inodes that must be fully on
947 * disk before a transaction commit finishes.
948 *
949 * This basically gives us the ext3 style data=ordered mode, and it is mostly
950 * used to make sure renamed files are fully on disk.
951 *
952 * It is a noop if the inode is already fully on disk.
953 *
954 * If trans is not null, we'll do a friendly check for a transaction that
955 * is already flushing things and force the IO down ourselves.
956 */
957void btrfs_add_ordered_operation(struct btrfs_trans_handle *trans,
958 struct btrfs_root *root, struct inode *inode)
959{
960 u64 last_mod;
961
962 last_mod = max(BTRFS_I(inode)->generation, BTRFS_I(inode)->last_trans);
963
964 /*
965 * if this file hasn't been changed since the last transaction
966 * commit, we can safely return without doing anything
967 */
968 if (last_mod < root->fs_info->last_trans_committed)
969 return;
970
971 /*
972 * the transaction is already committing. Just start the IO and
973 * don't bother with all of this list nonsense
974 */
975 if (trans && root->fs_info->running_transaction->blocked) {
976 btrfs_wait_ordered_range(inode, 0, (u64)-1);
977 return;
978 }
979
980 spin_lock(&root->fs_info->ordered_extent_lock);
981 if (list_empty(&BTRFS_I(inode)->ordered_operations)) {
982 list_add_tail(&BTRFS_I(inode)->ordered_operations,
983 &root->fs_info->ordered_operations);
984 }
985 spin_unlock(&root->fs_info->ordered_extent_lock);
986}
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Copyright (C) 2007 Oracle. All rights reserved.
4 */
5
6#include <linux/slab.h>
7#include <linux/blkdev.h>
8#include <linux/writeback.h>
9#include <linux/sched/mm.h>
10#include "misc.h"
11#include "ctree.h"
12#include "transaction.h"
13#include "btrfs_inode.h"
14#include "extent_io.h"
15#include "disk-io.h"
16#include "compression.h"
17#include "delalloc-space.h"
18#include "qgroup.h"
19#include "subpage.h"
20
21static struct kmem_cache *btrfs_ordered_extent_cache;
22
23static u64 entry_end(struct btrfs_ordered_extent *entry)
24{
25 if (entry->file_offset + entry->num_bytes < entry->file_offset)
26 return (u64)-1;
27 return entry->file_offset + entry->num_bytes;
28}
29
30/* returns NULL if the insertion worked, or it returns the node it did find
31 * in the tree
32 */
33static struct rb_node *tree_insert(struct rb_root *root, u64 file_offset,
34 struct rb_node *node)
35{
36 struct rb_node **p = &root->rb_node;
37 struct rb_node *parent = NULL;
38 struct btrfs_ordered_extent *entry;
39
40 while (*p) {
41 parent = *p;
42 entry = rb_entry(parent, struct btrfs_ordered_extent, rb_node);
43
44 if (file_offset < entry->file_offset)
45 p = &(*p)->rb_left;
46 else if (file_offset >= entry_end(entry))
47 p = &(*p)->rb_right;
48 else
49 return parent;
50 }
51
52 rb_link_node(node, parent, p);
53 rb_insert_color(node, root);
54 return NULL;
55}
56
57/*
58 * look for a given offset in the tree, and if it can't be found return the
59 * first lesser offset
60 */
61static struct rb_node *__tree_search(struct rb_root *root, u64 file_offset,
62 struct rb_node **prev_ret)
63{
64 struct rb_node *n = root->rb_node;
65 struct rb_node *prev = NULL;
66 struct rb_node *test;
67 struct btrfs_ordered_extent *entry;
68 struct btrfs_ordered_extent *prev_entry = NULL;
69
70 while (n) {
71 entry = rb_entry(n, struct btrfs_ordered_extent, rb_node);
72 prev = n;
73 prev_entry = entry;
74
75 if (file_offset < entry->file_offset)
76 n = n->rb_left;
77 else if (file_offset >= entry_end(entry))
78 n = n->rb_right;
79 else
80 return n;
81 }
82 if (!prev_ret)
83 return NULL;
84
85 while (prev && file_offset >= entry_end(prev_entry)) {
86 test = rb_next(prev);
87 if (!test)
88 break;
89 prev_entry = rb_entry(test, struct btrfs_ordered_extent,
90 rb_node);
91 if (file_offset < entry_end(prev_entry))
92 break;
93
94 prev = test;
95 }
96 if (prev)
97 prev_entry = rb_entry(prev, struct btrfs_ordered_extent,
98 rb_node);
99 while (prev && file_offset < entry_end(prev_entry)) {
100 test = rb_prev(prev);
101 if (!test)
102 break;
103 prev_entry = rb_entry(test, struct btrfs_ordered_extent,
104 rb_node);
105 prev = test;
106 }
107 *prev_ret = prev;
108 return NULL;
109}
110
111static int range_overlaps(struct btrfs_ordered_extent *entry, u64 file_offset,
112 u64 len)
113{
114 if (file_offset + len <= entry->file_offset ||
115 entry->file_offset + entry->num_bytes <= file_offset)
116 return 0;
117 return 1;
118}
119
120/*
121 * look find the first ordered struct that has this offset, otherwise
122 * the first one less than this offset
123 */
124static inline struct rb_node *tree_search(struct btrfs_ordered_inode_tree *tree,
125 u64 file_offset)
126{
127 struct rb_root *root = &tree->tree;
128 struct rb_node *prev = NULL;
129 struct rb_node *ret;
130 struct btrfs_ordered_extent *entry;
131
132 if (tree->last) {
133 entry = rb_entry(tree->last, struct btrfs_ordered_extent,
134 rb_node);
135 if (in_range(file_offset, entry->file_offset, entry->num_bytes))
136 return tree->last;
137 }
138 ret = __tree_search(root, file_offset, &prev);
139 if (!ret)
140 ret = prev;
141 if (ret)
142 tree->last = ret;
143 return ret;
144}
145
146/*
147 * Allocate and add a new ordered_extent into the per-inode tree.
148 *
149 * The tree is given a single reference on the ordered extent that was
150 * inserted.
151 */
152static int __btrfs_add_ordered_extent(struct btrfs_inode *inode, u64 file_offset,
153 u64 disk_bytenr, u64 num_bytes,
154 u64 disk_num_bytes, int type, int dio,
155 int compress_type)
156{
157 struct btrfs_root *root = inode->root;
158 struct btrfs_fs_info *fs_info = root->fs_info;
159 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree;
160 struct rb_node *node;
161 struct btrfs_ordered_extent *entry;
162 int ret;
163
164 if (type == BTRFS_ORDERED_NOCOW || type == BTRFS_ORDERED_PREALLOC) {
165 /* For nocow write, we can release the qgroup rsv right now */
166 ret = btrfs_qgroup_free_data(inode, NULL, file_offset, num_bytes);
167 if (ret < 0)
168 return ret;
169 ret = 0;
170 } else {
171 /*
172 * The ordered extent has reserved qgroup space, release now
173 * and pass the reserved number for qgroup_record to free.
174 */
175 ret = btrfs_qgroup_release_data(inode, file_offset, num_bytes);
176 if (ret < 0)
177 return ret;
178 }
179 entry = kmem_cache_zalloc(btrfs_ordered_extent_cache, GFP_NOFS);
180 if (!entry)
181 return -ENOMEM;
182
183 entry->file_offset = file_offset;
184 entry->disk_bytenr = disk_bytenr;
185 entry->num_bytes = num_bytes;
186 entry->disk_num_bytes = disk_num_bytes;
187 entry->bytes_left = num_bytes;
188 entry->inode = igrab(&inode->vfs_inode);
189 entry->compress_type = compress_type;
190 entry->truncated_len = (u64)-1;
191 entry->qgroup_rsv = ret;
192 entry->physical = (u64)-1;
193
194 ASSERT(type == BTRFS_ORDERED_REGULAR ||
195 type == BTRFS_ORDERED_NOCOW ||
196 type == BTRFS_ORDERED_PREALLOC ||
197 type == BTRFS_ORDERED_COMPRESSED);
198 set_bit(type, &entry->flags);
199
200 percpu_counter_add_batch(&fs_info->ordered_bytes, num_bytes,
201 fs_info->delalloc_batch);
202
203 if (dio)
204 set_bit(BTRFS_ORDERED_DIRECT, &entry->flags);
205
206 /* one ref for the tree */
207 refcount_set(&entry->refs, 1);
208 init_waitqueue_head(&entry->wait);
209 INIT_LIST_HEAD(&entry->list);
210 INIT_LIST_HEAD(&entry->log_list);
211 INIT_LIST_HEAD(&entry->root_extent_list);
212 INIT_LIST_HEAD(&entry->work_list);
213 init_completion(&entry->completion);
214
215 trace_btrfs_ordered_extent_add(inode, entry);
216
217 spin_lock_irq(&tree->lock);
218 node = tree_insert(&tree->tree, file_offset,
219 &entry->rb_node);
220 if (node)
221 btrfs_panic(fs_info, -EEXIST,
222 "inconsistency in ordered tree at offset %llu",
223 file_offset);
224 spin_unlock_irq(&tree->lock);
225
226 spin_lock(&root->ordered_extent_lock);
227 list_add_tail(&entry->root_extent_list,
228 &root->ordered_extents);
229 root->nr_ordered_extents++;
230 if (root->nr_ordered_extents == 1) {
231 spin_lock(&fs_info->ordered_root_lock);
232 BUG_ON(!list_empty(&root->ordered_root));
233 list_add_tail(&root->ordered_root, &fs_info->ordered_roots);
234 spin_unlock(&fs_info->ordered_root_lock);
235 }
236 spin_unlock(&root->ordered_extent_lock);
237
238 /*
239 * We don't need the count_max_extents here, we can assume that all of
240 * that work has been done at higher layers, so this is truly the
241 * smallest the extent is going to get.
242 */
243 spin_lock(&inode->lock);
244 btrfs_mod_outstanding_extents(inode, 1);
245 spin_unlock(&inode->lock);
246
247 return 0;
248}
249
250int btrfs_add_ordered_extent(struct btrfs_inode *inode, u64 file_offset,
251 u64 disk_bytenr, u64 num_bytes, u64 disk_num_bytes,
252 int type)
253{
254 ASSERT(type == BTRFS_ORDERED_REGULAR ||
255 type == BTRFS_ORDERED_NOCOW ||
256 type == BTRFS_ORDERED_PREALLOC);
257 return __btrfs_add_ordered_extent(inode, file_offset, disk_bytenr,
258 num_bytes, disk_num_bytes, type, 0,
259 BTRFS_COMPRESS_NONE);
260}
261
262int btrfs_add_ordered_extent_dio(struct btrfs_inode *inode, u64 file_offset,
263 u64 disk_bytenr, u64 num_bytes,
264 u64 disk_num_bytes, int type)
265{
266 ASSERT(type == BTRFS_ORDERED_REGULAR ||
267 type == BTRFS_ORDERED_NOCOW ||
268 type == BTRFS_ORDERED_PREALLOC);
269 return __btrfs_add_ordered_extent(inode, file_offset, disk_bytenr,
270 num_bytes, disk_num_bytes, type, 1,
271 BTRFS_COMPRESS_NONE);
272}
273
274int btrfs_add_ordered_extent_compress(struct btrfs_inode *inode, u64 file_offset,
275 u64 disk_bytenr, u64 num_bytes,
276 u64 disk_num_bytes, int compress_type)
277{
278 ASSERT(compress_type != BTRFS_COMPRESS_NONE);
279 return __btrfs_add_ordered_extent(inode, file_offset, disk_bytenr,
280 num_bytes, disk_num_bytes,
281 BTRFS_ORDERED_COMPRESSED, 0,
282 compress_type);
283}
284
285/*
286 * Add a struct btrfs_ordered_sum into the list of checksums to be inserted
287 * when an ordered extent is finished. If the list covers more than one
288 * ordered extent, it is split across multiples.
289 */
290void btrfs_add_ordered_sum(struct btrfs_ordered_extent *entry,
291 struct btrfs_ordered_sum *sum)
292{
293 struct btrfs_ordered_inode_tree *tree;
294
295 tree = &BTRFS_I(entry->inode)->ordered_tree;
296 spin_lock_irq(&tree->lock);
297 list_add_tail(&sum->list, &entry->list);
298 spin_unlock_irq(&tree->lock);
299}
300
301/*
302 * Mark all ordered extents io inside the specified range finished.
303 *
304 * @page: The invovled page for the opeartion.
305 * For uncompressed buffered IO, the page status also needs to be
306 * updated to indicate whether the pending ordered io is finished.
307 * Can be NULL for direct IO and compressed write.
308 * For these cases, callers are ensured they won't execute the
309 * endio function twice.
310 * @finish_func: The function to be executed when all the IO of an ordered
311 * extent are finished.
312 *
313 * This function is called for endio, thus the range must have ordered
314 * extent(s) coveri it.
315 */
316void btrfs_mark_ordered_io_finished(struct btrfs_inode *inode,
317 struct page *page, u64 file_offset,
318 u64 num_bytes, btrfs_func_t finish_func,
319 bool uptodate)
320{
321 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree;
322 struct btrfs_fs_info *fs_info = inode->root->fs_info;
323 struct btrfs_workqueue *wq;
324 struct rb_node *node;
325 struct btrfs_ordered_extent *entry = NULL;
326 unsigned long flags;
327 u64 cur = file_offset;
328
329 if (btrfs_is_free_space_inode(inode))
330 wq = fs_info->endio_freespace_worker;
331 else
332 wq = fs_info->endio_write_workers;
333
334 if (page)
335 ASSERT(page->mapping && page_offset(page) <= file_offset &&
336 file_offset + num_bytes <= page_offset(page) + PAGE_SIZE);
337
338 spin_lock_irqsave(&tree->lock, flags);
339 while (cur < file_offset + num_bytes) {
340 u64 entry_end;
341 u64 end;
342 u32 len;
343
344 node = tree_search(tree, cur);
345 /* No ordered extents at all */
346 if (!node)
347 break;
348
349 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
350 entry_end = entry->file_offset + entry->num_bytes;
351 /*
352 * |<-- OE --->| |
353 * cur
354 * Go to next OE.
355 */
356 if (cur >= entry_end) {
357 node = rb_next(node);
358 /* No more ordered extents, exit */
359 if (!node)
360 break;
361 entry = rb_entry(node, struct btrfs_ordered_extent,
362 rb_node);
363
364 /* Go to next ordered extent and continue */
365 cur = entry->file_offset;
366 continue;
367 }
368 /*
369 * | |<--- OE --->|
370 * cur
371 * Go to the start of OE.
372 */
373 if (cur < entry->file_offset) {
374 cur = entry->file_offset;
375 continue;
376 }
377
378 /*
379 * Now we are definitely inside one ordered extent.
380 *
381 * |<--- OE --->|
382 * |
383 * cur
384 */
385 end = min(entry->file_offset + entry->num_bytes,
386 file_offset + num_bytes) - 1;
387 ASSERT(end + 1 - cur < U32_MAX);
388 len = end + 1 - cur;
389
390 if (page) {
391 /*
392 * Ordered (Private2) bit indicates whether we still
393 * have pending io unfinished for the ordered extent.
394 *
395 * If there's no such bit, we need to skip to next range.
396 */
397 if (!btrfs_page_test_ordered(fs_info, page, cur, len)) {
398 cur += len;
399 continue;
400 }
401 btrfs_page_clear_ordered(fs_info, page, cur, len);
402 }
403
404 /* Now we're fine to update the accounting */
405 if (unlikely(len > entry->bytes_left)) {
406 WARN_ON(1);
407 btrfs_crit(fs_info,
408"bad ordered extent accounting, root=%llu ino=%llu OE offset=%llu OE len=%llu to_dec=%u left=%llu",
409 inode->root->root_key.objectid,
410 btrfs_ino(inode),
411 entry->file_offset,
412 entry->num_bytes,
413 len, entry->bytes_left);
414 entry->bytes_left = 0;
415 } else {
416 entry->bytes_left -= len;
417 }
418
419 if (!uptodate)
420 set_bit(BTRFS_ORDERED_IOERR, &entry->flags);
421
422 /*
423 * All the IO of the ordered extent is finished, we need to queue
424 * the finish_func to be executed.
425 */
426 if (entry->bytes_left == 0) {
427 set_bit(BTRFS_ORDERED_IO_DONE, &entry->flags);
428 cond_wake_up(&entry->wait);
429 refcount_inc(&entry->refs);
430 spin_unlock_irqrestore(&tree->lock, flags);
431 btrfs_init_work(&entry->work, finish_func, NULL, NULL);
432 btrfs_queue_work(wq, &entry->work);
433 spin_lock_irqsave(&tree->lock, flags);
434 }
435 cur += len;
436 }
437 spin_unlock_irqrestore(&tree->lock, flags);
438}
439
440/*
441 * Finish IO for one ordered extent across a given range. The range can only
442 * contain one ordered extent.
443 *
444 * @cached: The cached ordered extent. If not NULL, we can skip the tree
445 * search and use the ordered extent directly.
446 * Will be also used to store the finished ordered extent.
447 * @file_offset: File offset for the finished IO
448 * @io_size: Length of the finish IO range
449 * @uptodate: If the IO finishes without problem
450 *
451 * Return true if the ordered extent is finished in the range, and update
452 * @cached.
453 * Return false otherwise.
454 *
455 * NOTE: The range can NOT cross multiple ordered extents.
456 * Thus caller should ensure the range doesn't cross ordered extents.
457 */
458bool btrfs_dec_test_ordered_pending(struct btrfs_inode *inode,
459 struct btrfs_ordered_extent **cached,
460 u64 file_offset, u64 io_size, int uptodate)
461{
462 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree;
463 struct rb_node *node;
464 struct btrfs_ordered_extent *entry = NULL;
465 unsigned long flags;
466 bool finished = false;
467
468 spin_lock_irqsave(&tree->lock, flags);
469 if (cached && *cached) {
470 entry = *cached;
471 goto have_entry;
472 }
473
474 node = tree_search(tree, file_offset);
475 if (!node)
476 goto out;
477
478 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
479have_entry:
480 if (!in_range(file_offset, entry->file_offset, entry->num_bytes))
481 goto out;
482
483 if (io_size > entry->bytes_left)
484 btrfs_crit(inode->root->fs_info,
485 "bad ordered accounting left %llu size %llu",
486 entry->bytes_left, io_size);
487
488 entry->bytes_left -= io_size;
489 if (!uptodate)
490 set_bit(BTRFS_ORDERED_IOERR, &entry->flags);
491
492 if (entry->bytes_left == 0) {
493 /*
494 * Ensure only one caller can set the flag and finished_ret
495 * accordingly
496 */
497 finished = !test_and_set_bit(BTRFS_ORDERED_IO_DONE, &entry->flags);
498 /* test_and_set_bit implies a barrier */
499 cond_wake_up_nomb(&entry->wait);
500 }
501out:
502 if (finished && cached && entry) {
503 *cached = entry;
504 refcount_inc(&entry->refs);
505 }
506 spin_unlock_irqrestore(&tree->lock, flags);
507 return finished;
508}
509
510/*
511 * used to drop a reference on an ordered extent. This will free
512 * the extent if the last reference is dropped
513 */
514void btrfs_put_ordered_extent(struct btrfs_ordered_extent *entry)
515{
516 struct list_head *cur;
517 struct btrfs_ordered_sum *sum;
518
519 trace_btrfs_ordered_extent_put(BTRFS_I(entry->inode), entry);
520
521 if (refcount_dec_and_test(&entry->refs)) {
522 ASSERT(list_empty(&entry->root_extent_list));
523 ASSERT(list_empty(&entry->log_list));
524 ASSERT(RB_EMPTY_NODE(&entry->rb_node));
525 if (entry->inode)
526 btrfs_add_delayed_iput(entry->inode);
527 while (!list_empty(&entry->list)) {
528 cur = entry->list.next;
529 sum = list_entry(cur, struct btrfs_ordered_sum, list);
530 list_del(&sum->list);
531 kvfree(sum);
532 }
533 kmem_cache_free(btrfs_ordered_extent_cache, entry);
534 }
535}
536
537/*
538 * remove an ordered extent from the tree. No references are dropped
539 * and waiters are woken up.
540 */
541void btrfs_remove_ordered_extent(struct btrfs_inode *btrfs_inode,
542 struct btrfs_ordered_extent *entry)
543{
544 struct btrfs_ordered_inode_tree *tree;
545 struct btrfs_root *root = btrfs_inode->root;
546 struct btrfs_fs_info *fs_info = root->fs_info;
547 struct rb_node *node;
548 bool pending;
549
550 /* This is paired with btrfs_add_ordered_extent. */
551 spin_lock(&btrfs_inode->lock);
552 btrfs_mod_outstanding_extents(btrfs_inode, -1);
553 spin_unlock(&btrfs_inode->lock);
554 if (root != fs_info->tree_root)
555 btrfs_delalloc_release_metadata(btrfs_inode, entry->num_bytes,
556 false);
557
558 percpu_counter_add_batch(&fs_info->ordered_bytes, -entry->num_bytes,
559 fs_info->delalloc_batch);
560
561 tree = &btrfs_inode->ordered_tree;
562 spin_lock_irq(&tree->lock);
563 node = &entry->rb_node;
564 rb_erase(node, &tree->tree);
565 RB_CLEAR_NODE(node);
566 if (tree->last == node)
567 tree->last = NULL;
568 set_bit(BTRFS_ORDERED_COMPLETE, &entry->flags);
569 pending = test_and_clear_bit(BTRFS_ORDERED_PENDING, &entry->flags);
570 spin_unlock_irq(&tree->lock);
571
572 /*
573 * The current running transaction is waiting on us, we need to let it
574 * know that we're complete and wake it up.
575 */
576 if (pending) {
577 struct btrfs_transaction *trans;
578
579 /*
580 * The checks for trans are just a formality, it should be set,
581 * but if it isn't we don't want to deref/assert under the spin
582 * lock, so be nice and check if trans is set, but ASSERT() so
583 * if it isn't set a developer will notice.
584 */
585 spin_lock(&fs_info->trans_lock);
586 trans = fs_info->running_transaction;
587 if (trans)
588 refcount_inc(&trans->use_count);
589 spin_unlock(&fs_info->trans_lock);
590
591 ASSERT(trans);
592 if (trans) {
593 if (atomic_dec_and_test(&trans->pending_ordered))
594 wake_up(&trans->pending_wait);
595 btrfs_put_transaction(trans);
596 }
597 }
598
599 spin_lock(&root->ordered_extent_lock);
600 list_del_init(&entry->root_extent_list);
601 root->nr_ordered_extents--;
602
603 trace_btrfs_ordered_extent_remove(btrfs_inode, entry);
604
605 if (!root->nr_ordered_extents) {
606 spin_lock(&fs_info->ordered_root_lock);
607 BUG_ON(list_empty(&root->ordered_root));
608 list_del_init(&root->ordered_root);
609 spin_unlock(&fs_info->ordered_root_lock);
610 }
611 spin_unlock(&root->ordered_extent_lock);
612 wake_up(&entry->wait);
613}
614
615static void btrfs_run_ordered_extent_work(struct btrfs_work *work)
616{
617 struct btrfs_ordered_extent *ordered;
618
619 ordered = container_of(work, struct btrfs_ordered_extent, flush_work);
620 btrfs_start_ordered_extent(ordered, 1);
621 complete(&ordered->completion);
622}
623
624/*
625 * wait for all the ordered extents in a root. This is done when balancing
626 * space between drives.
627 */
628u64 btrfs_wait_ordered_extents(struct btrfs_root *root, u64 nr,
629 const u64 range_start, const u64 range_len)
630{
631 struct btrfs_fs_info *fs_info = root->fs_info;
632 LIST_HEAD(splice);
633 LIST_HEAD(skipped);
634 LIST_HEAD(works);
635 struct btrfs_ordered_extent *ordered, *next;
636 u64 count = 0;
637 const u64 range_end = range_start + range_len;
638
639 mutex_lock(&root->ordered_extent_mutex);
640 spin_lock(&root->ordered_extent_lock);
641 list_splice_init(&root->ordered_extents, &splice);
642 while (!list_empty(&splice) && nr) {
643 ordered = list_first_entry(&splice, struct btrfs_ordered_extent,
644 root_extent_list);
645
646 if (range_end <= ordered->disk_bytenr ||
647 ordered->disk_bytenr + ordered->disk_num_bytes <= range_start) {
648 list_move_tail(&ordered->root_extent_list, &skipped);
649 cond_resched_lock(&root->ordered_extent_lock);
650 continue;
651 }
652
653 list_move_tail(&ordered->root_extent_list,
654 &root->ordered_extents);
655 refcount_inc(&ordered->refs);
656 spin_unlock(&root->ordered_extent_lock);
657
658 btrfs_init_work(&ordered->flush_work,
659 btrfs_run_ordered_extent_work, NULL, NULL);
660 list_add_tail(&ordered->work_list, &works);
661 btrfs_queue_work(fs_info->flush_workers, &ordered->flush_work);
662
663 cond_resched();
664 spin_lock(&root->ordered_extent_lock);
665 if (nr != U64_MAX)
666 nr--;
667 count++;
668 }
669 list_splice_tail(&skipped, &root->ordered_extents);
670 list_splice_tail(&splice, &root->ordered_extents);
671 spin_unlock(&root->ordered_extent_lock);
672
673 list_for_each_entry_safe(ordered, next, &works, work_list) {
674 list_del_init(&ordered->work_list);
675 wait_for_completion(&ordered->completion);
676 btrfs_put_ordered_extent(ordered);
677 cond_resched();
678 }
679 mutex_unlock(&root->ordered_extent_mutex);
680
681 return count;
682}
683
684void btrfs_wait_ordered_roots(struct btrfs_fs_info *fs_info, u64 nr,
685 const u64 range_start, const u64 range_len)
686{
687 struct btrfs_root *root;
688 struct list_head splice;
689 u64 done;
690
691 INIT_LIST_HEAD(&splice);
692
693 mutex_lock(&fs_info->ordered_operations_mutex);
694 spin_lock(&fs_info->ordered_root_lock);
695 list_splice_init(&fs_info->ordered_roots, &splice);
696 while (!list_empty(&splice) && nr) {
697 root = list_first_entry(&splice, struct btrfs_root,
698 ordered_root);
699 root = btrfs_grab_root(root);
700 BUG_ON(!root);
701 list_move_tail(&root->ordered_root,
702 &fs_info->ordered_roots);
703 spin_unlock(&fs_info->ordered_root_lock);
704
705 done = btrfs_wait_ordered_extents(root, nr,
706 range_start, range_len);
707 btrfs_put_root(root);
708
709 spin_lock(&fs_info->ordered_root_lock);
710 if (nr != U64_MAX) {
711 nr -= done;
712 }
713 }
714 list_splice_tail(&splice, &fs_info->ordered_roots);
715 spin_unlock(&fs_info->ordered_root_lock);
716 mutex_unlock(&fs_info->ordered_operations_mutex);
717}
718
719/*
720 * Used to start IO or wait for a given ordered extent to finish.
721 *
722 * If wait is one, this effectively waits on page writeback for all the pages
723 * in the extent, and it waits on the io completion code to insert
724 * metadata into the btree corresponding to the extent
725 */
726void btrfs_start_ordered_extent(struct btrfs_ordered_extent *entry, int wait)
727{
728 u64 start = entry->file_offset;
729 u64 end = start + entry->num_bytes - 1;
730 struct btrfs_inode *inode = BTRFS_I(entry->inode);
731
732 trace_btrfs_ordered_extent_start(inode, entry);
733
734 /*
735 * pages in the range can be dirty, clean or writeback. We
736 * start IO on any dirty ones so the wait doesn't stall waiting
737 * for the flusher thread to find them
738 */
739 if (!test_bit(BTRFS_ORDERED_DIRECT, &entry->flags))
740 filemap_fdatawrite_range(inode->vfs_inode.i_mapping, start, end);
741 if (wait) {
742 wait_event(entry->wait, test_bit(BTRFS_ORDERED_COMPLETE,
743 &entry->flags));
744 }
745}
746
747/*
748 * Used to wait on ordered extents across a large range of bytes.
749 */
750int btrfs_wait_ordered_range(struct inode *inode, u64 start, u64 len)
751{
752 int ret = 0;
753 int ret_wb = 0;
754 u64 end;
755 u64 orig_end;
756 struct btrfs_ordered_extent *ordered;
757
758 if (start + len < start) {
759 orig_end = INT_LIMIT(loff_t);
760 } else {
761 orig_end = start + len - 1;
762 if (orig_end > INT_LIMIT(loff_t))
763 orig_end = INT_LIMIT(loff_t);
764 }
765
766 /* start IO across the range first to instantiate any delalloc
767 * extents
768 */
769 ret = btrfs_fdatawrite_range(inode, start, orig_end);
770 if (ret)
771 return ret;
772
773 /*
774 * If we have a writeback error don't return immediately. Wait first
775 * for any ordered extents that haven't completed yet. This is to make
776 * sure no one can dirty the same page ranges and call writepages()
777 * before the ordered extents complete - to avoid failures (-EEXIST)
778 * when adding the new ordered extents to the ordered tree.
779 */
780 ret_wb = filemap_fdatawait_range(inode->i_mapping, start, orig_end);
781
782 end = orig_end;
783 while (1) {
784 ordered = btrfs_lookup_first_ordered_extent(BTRFS_I(inode), end);
785 if (!ordered)
786 break;
787 if (ordered->file_offset > orig_end) {
788 btrfs_put_ordered_extent(ordered);
789 break;
790 }
791 if (ordered->file_offset + ordered->num_bytes <= start) {
792 btrfs_put_ordered_extent(ordered);
793 break;
794 }
795 btrfs_start_ordered_extent(ordered, 1);
796 end = ordered->file_offset;
797 /*
798 * If the ordered extent had an error save the error but don't
799 * exit without waiting first for all other ordered extents in
800 * the range to complete.
801 */
802 if (test_bit(BTRFS_ORDERED_IOERR, &ordered->flags))
803 ret = -EIO;
804 btrfs_put_ordered_extent(ordered);
805 if (end == 0 || end == start)
806 break;
807 end--;
808 }
809 return ret_wb ? ret_wb : ret;
810}
811
812/*
813 * find an ordered extent corresponding to file_offset. return NULL if
814 * nothing is found, otherwise take a reference on the extent and return it
815 */
816struct btrfs_ordered_extent *btrfs_lookup_ordered_extent(struct btrfs_inode *inode,
817 u64 file_offset)
818{
819 struct btrfs_ordered_inode_tree *tree;
820 struct rb_node *node;
821 struct btrfs_ordered_extent *entry = NULL;
822 unsigned long flags;
823
824 tree = &inode->ordered_tree;
825 spin_lock_irqsave(&tree->lock, flags);
826 node = tree_search(tree, file_offset);
827 if (!node)
828 goto out;
829
830 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
831 if (!in_range(file_offset, entry->file_offset, entry->num_bytes))
832 entry = NULL;
833 if (entry)
834 refcount_inc(&entry->refs);
835out:
836 spin_unlock_irqrestore(&tree->lock, flags);
837 return entry;
838}
839
840/* Since the DIO code tries to lock a wide area we need to look for any ordered
841 * extents that exist in the range, rather than just the start of the range.
842 */
843struct btrfs_ordered_extent *btrfs_lookup_ordered_range(
844 struct btrfs_inode *inode, u64 file_offset, u64 len)
845{
846 struct btrfs_ordered_inode_tree *tree;
847 struct rb_node *node;
848 struct btrfs_ordered_extent *entry = NULL;
849
850 tree = &inode->ordered_tree;
851 spin_lock_irq(&tree->lock);
852 node = tree_search(tree, file_offset);
853 if (!node) {
854 node = tree_search(tree, file_offset + len);
855 if (!node)
856 goto out;
857 }
858
859 while (1) {
860 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
861 if (range_overlaps(entry, file_offset, len))
862 break;
863
864 if (entry->file_offset >= file_offset + len) {
865 entry = NULL;
866 break;
867 }
868 entry = NULL;
869 node = rb_next(node);
870 if (!node)
871 break;
872 }
873out:
874 if (entry)
875 refcount_inc(&entry->refs);
876 spin_unlock_irq(&tree->lock);
877 return entry;
878}
879
880/*
881 * Adds all ordered extents to the given list. The list ends up sorted by the
882 * file_offset of the ordered extents.
883 */
884void btrfs_get_ordered_extents_for_logging(struct btrfs_inode *inode,
885 struct list_head *list)
886{
887 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree;
888 struct rb_node *n;
889
890 ASSERT(inode_is_locked(&inode->vfs_inode));
891
892 spin_lock_irq(&tree->lock);
893 for (n = rb_first(&tree->tree); n; n = rb_next(n)) {
894 struct btrfs_ordered_extent *ordered;
895
896 ordered = rb_entry(n, struct btrfs_ordered_extent, rb_node);
897
898 if (test_bit(BTRFS_ORDERED_LOGGED, &ordered->flags))
899 continue;
900
901 ASSERT(list_empty(&ordered->log_list));
902 list_add_tail(&ordered->log_list, list);
903 refcount_inc(&ordered->refs);
904 }
905 spin_unlock_irq(&tree->lock);
906}
907
908/*
909 * lookup and return any extent before 'file_offset'. NULL is returned
910 * if none is found
911 */
912struct btrfs_ordered_extent *
913btrfs_lookup_first_ordered_extent(struct btrfs_inode *inode, u64 file_offset)
914{
915 struct btrfs_ordered_inode_tree *tree;
916 struct rb_node *node;
917 struct btrfs_ordered_extent *entry = NULL;
918
919 tree = &inode->ordered_tree;
920 spin_lock_irq(&tree->lock);
921 node = tree_search(tree, file_offset);
922 if (!node)
923 goto out;
924
925 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
926 refcount_inc(&entry->refs);
927out:
928 spin_unlock_irq(&tree->lock);
929 return entry;
930}
931
932/*
933 * Lookup the first ordered extent that overlaps the range
934 * [@file_offset, @file_offset + @len).
935 *
936 * The difference between this and btrfs_lookup_first_ordered_extent() is
937 * that this one won't return any ordered extent that does not overlap the range.
938 * And the difference against btrfs_lookup_ordered_extent() is, this function
939 * ensures the first ordered extent gets returned.
940 */
941struct btrfs_ordered_extent *btrfs_lookup_first_ordered_range(
942 struct btrfs_inode *inode, u64 file_offset, u64 len)
943{
944 struct btrfs_ordered_inode_tree *tree = &inode->ordered_tree;
945 struct rb_node *node;
946 struct rb_node *cur;
947 struct rb_node *prev;
948 struct rb_node *next;
949 struct btrfs_ordered_extent *entry = NULL;
950
951 spin_lock_irq(&tree->lock);
952 node = tree->tree.rb_node;
953 /*
954 * Here we don't want to use tree_search() which will use tree->last
955 * and screw up the search order.
956 * And __tree_search() can't return the adjacent ordered extents
957 * either, thus here we do our own search.
958 */
959 while (node) {
960 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);
961
962 if (file_offset < entry->file_offset) {
963 node = node->rb_left;
964 } else if (file_offset >= entry_end(entry)) {
965 node = node->rb_right;
966 } else {
967 /*
968 * Direct hit, got an ordered extent that starts at
969 * @file_offset
970 */
971 goto out;
972 }
973 }
974 if (!entry) {
975 /* Empty tree */
976 goto out;
977 }
978
979 cur = &entry->rb_node;
980 /* We got an entry around @file_offset, check adjacent entries */
981 if (entry->file_offset < file_offset) {
982 prev = cur;
983 next = rb_next(cur);
984 } else {
985 prev = rb_prev(cur);
986 next = cur;
987 }
988 if (prev) {
989 entry = rb_entry(prev, struct btrfs_ordered_extent, rb_node);
990 if (range_overlaps(entry, file_offset, len))
991 goto out;
992 }
993 if (next) {
994 entry = rb_entry(next, struct btrfs_ordered_extent, rb_node);
995 if (range_overlaps(entry, file_offset, len))
996 goto out;
997 }
998 /* No ordered extent in the range */
999 entry = NULL;
1000out:
1001 if (entry)
1002 refcount_inc(&entry->refs);
1003 spin_unlock_irq(&tree->lock);
1004 return entry;
1005}
1006
1007/*
1008 * btrfs_flush_ordered_range - Lock the passed range and ensures all pending
1009 * ordered extents in it are run to completion.
1010 *
1011 * @inode: Inode whose ordered tree is to be searched
1012 * @start: Beginning of range to flush
1013 * @end: Last byte of range to lock
1014 * @cached_state: If passed, will return the extent state responsible for the
1015 * locked range. It's the caller's responsibility to free the cached state.
1016 *
1017 * This function always returns with the given range locked, ensuring after it's
1018 * called no order extent can be pending.
1019 */
1020void btrfs_lock_and_flush_ordered_range(struct btrfs_inode *inode, u64 start,
1021 u64 end,
1022 struct extent_state **cached_state)
1023{
1024 struct btrfs_ordered_extent *ordered;
1025 struct extent_state *cache = NULL;
1026 struct extent_state **cachedp = &cache;
1027
1028 if (cached_state)
1029 cachedp = cached_state;
1030
1031 while (1) {
1032 lock_extent_bits(&inode->io_tree, start, end, cachedp);
1033 ordered = btrfs_lookup_ordered_range(inode, start,
1034 end - start + 1);
1035 if (!ordered) {
1036 /*
1037 * If no external cached_state has been passed then
1038 * decrement the extra ref taken for cachedp since we
1039 * aren't exposing it outside of this function
1040 */
1041 if (!cached_state)
1042 refcount_dec(&cache->refs);
1043 break;
1044 }
1045 unlock_extent_cached(&inode->io_tree, start, end, cachedp);
1046 btrfs_start_ordered_extent(ordered, 1);
1047 btrfs_put_ordered_extent(ordered);
1048 }
1049}
1050
1051static int clone_ordered_extent(struct btrfs_ordered_extent *ordered, u64 pos,
1052 u64 len)
1053{
1054 struct inode *inode = ordered->inode;
1055 struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info;
1056 u64 file_offset = ordered->file_offset + pos;
1057 u64 disk_bytenr = ordered->disk_bytenr + pos;
1058 u64 num_bytes = len;
1059 u64 disk_num_bytes = len;
1060 int type;
1061 unsigned long flags_masked = ordered->flags & ~(1 << BTRFS_ORDERED_DIRECT);
1062 int compress_type = ordered->compress_type;
1063 unsigned long weight;
1064 int ret;
1065
1066 weight = hweight_long(flags_masked);
1067 WARN_ON_ONCE(weight > 1);
1068 if (!weight)
1069 type = 0;
1070 else
1071 type = __ffs(flags_masked);
1072
1073 /*
1074 * The splitting extent is already counted and will be added again
1075 * in btrfs_add_ordered_extent_*(). Subtract num_bytes to avoid
1076 * double counting.
1077 */
1078 percpu_counter_add_batch(&fs_info->ordered_bytes, -num_bytes,
1079 fs_info->delalloc_batch);
1080 if (test_bit(BTRFS_ORDERED_COMPRESSED, &ordered->flags)) {
1081 WARN_ON_ONCE(1);
1082 ret = btrfs_add_ordered_extent_compress(BTRFS_I(inode),
1083 file_offset, disk_bytenr, num_bytes,
1084 disk_num_bytes, compress_type);
1085 } else if (test_bit(BTRFS_ORDERED_DIRECT, &ordered->flags)) {
1086 ret = btrfs_add_ordered_extent_dio(BTRFS_I(inode), file_offset,
1087 disk_bytenr, num_bytes, disk_num_bytes, type);
1088 } else {
1089 ret = btrfs_add_ordered_extent(BTRFS_I(inode), file_offset,
1090 disk_bytenr, num_bytes, disk_num_bytes, type);
1091 }
1092
1093 return ret;
1094}
1095
1096int btrfs_split_ordered_extent(struct btrfs_ordered_extent *ordered, u64 pre,
1097 u64 post)
1098{
1099 struct inode *inode = ordered->inode;
1100 struct btrfs_ordered_inode_tree *tree = &BTRFS_I(inode)->ordered_tree;
1101 struct rb_node *node;
1102 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
1103 int ret = 0;
1104
1105 spin_lock_irq(&tree->lock);
1106 /* Remove from tree once */
1107 node = &ordered->rb_node;
1108 rb_erase(node, &tree->tree);
1109 RB_CLEAR_NODE(node);
1110 if (tree->last == node)
1111 tree->last = NULL;
1112
1113 ordered->file_offset += pre;
1114 ordered->disk_bytenr += pre;
1115 ordered->num_bytes -= (pre + post);
1116 ordered->disk_num_bytes -= (pre + post);
1117 ordered->bytes_left -= (pre + post);
1118
1119 /* Re-insert the node */
1120 node = tree_insert(&tree->tree, ordered->file_offset, &ordered->rb_node);
1121 if (node)
1122 btrfs_panic(fs_info, -EEXIST,
1123 "zoned: inconsistency in ordered tree at offset %llu",
1124 ordered->file_offset);
1125
1126 spin_unlock_irq(&tree->lock);
1127
1128 if (pre)
1129 ret = clone_ordered_extent(ordered, 0, pre);
1130 if (ret == 0 && post)
1131 ret = clone_ordered_extent(ordered, pre + ordered->disk_num_bytes,
1132 post);
1133
1134 return ret;
1135}
1136
1137int __init ordered_data_init(void)
1138{
1139 btrfs_ordered_extent_cache = kmem_cache_create("btrfs_ordered_extent",
1140 sizeof(struct btrfs_ordered_extent), 0,
1141 SLAB_MEM_SPREAD,
1142 NULL);
1143 if (!btrfs_ordered_extent_cache)
1144 return -ENOMEM;
1145
1146 return 0;
1147}
1148
1149void __cold ordered_data_exit(void)
1150{
1151 kmem_cache_destroy(btrfs_ordered_extent_cache);
1152}