2 * Copyright (C) 2009 Oracle. All rights reserved.
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.
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.
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.
19 #include <linux/sched.h>
20 #include <linux/slab.h>
21 #include <linux/sort.h>
23 #include "delayed-ref.h"
24 #include "transaction.h"
26 struct kmem_cache
*btrfs_delayed_ref_head_cachep
;
27 struct kmem_cache
*btrfs_delayed_tree_ref_cachep
;
28 struct kmem_cache
*btrfs_delayed_data_ref_cachep
;
29 struct kmem_cache
*btrfs_delayed_extent_op_cachep
;
31 * delayed back reference update tracking. For subvolume trees
32 * we queue up extent allocations and backref maintenance for
33 * delayed processing. This avoids deep call chains where we
34 * add extents in the middle of btrfs_search_slot, and it allows
35 * us to buffer up frequently modified backrefs in an rb tree instead
36 * of hammering updates on the extent allocation tree.
40 * compare two delayed tree backrefs with same bytenr and type
42 static int comp_tree_refs(struct btrfs_delayed_tree_ref
*ref2
,
43 struct btrfs_delayed_tree_ref
*ref1
, int type
)
45 if (type
== BTRFS_TREE_BLOCK_REF_KEY
) {
46 if (ref1
->root
< ref2
->root
)
48 if (ref1
->root
> ref2
->root
)
51 if (ref1
->parent
< ref2
->parent
)
53 if (ref1
->parent
> ref2
->parent
)
60 * compare two delayed data backrefs with same bytenr and type
62 static int comp_data_refs(struct btrfs_delayed_data_ref
*ref2
,
63 struct btrfs_delayed_data_ref
*ref1
)
65 if (ref1
->node
.type
== BTRFS_EXTENT_DATA_REF_KEY
) {
66 if (ref1
->root
< ref2
->root
)
68 if (ref1
->root
> ref2
->root
)
70 if (ref1
->objectid
< ref2
->objectid
)
72 if (ref1
->objectid
> ref2
->objectid
)
74 if (ref1
->offset
< ref2
->offset
)
76 if (ref1
->offset
> ref2
->offset
)
79 if (ref1
->parent
< ref2
->parent
)
81 if (ref1
->parent
> ref2
->parent
)
88 * entries in the rb tree are ordered by the byte number of the extent,
89 * type of the delayed backrefs and content of delayed backrefs.
91 static int comp_entry(struct btrfs_delayed_ref_node
*ref2
,
92 struct btrfs_delayed_ref_node
*ref1
,
95 if (ref1
->bytenr
< ref2
->bytenr
)
97 if (ref1
->bytenr
> ref2
->bytenr
)
99 if (ref1
->is_head
&& ref2
->is_head
)
105 if (ref1
->type
< ref2
->type
)
107 if (ref1
->type
> ref2
->type
)
109 /* merging of sequenced refs is not allowed */
111 if (ref1
->seq
< ref2
->seq
)
113 if (ref1
->seq
> ref2
->seq
)
116 if (ref1
->type
== BTRFS_TREE_BLOCK_REF_KEY
||
117 ref1
->type
== BTRFS_SHARED_BLOCK_REF_KEY
) {
118 return comp_tree_refs(btrfs_delayed_node_to_tree_ref(ref2
),
119 btrfs_delayed_node_to_tree_ref(ref1
),
121 } else if (ref1
->type
== BTRFS_EXTENT_DATA_REF_KEY
||
122 ref1
->type
== BTRFS_SHARED_DATA_REF_KEY
) {
123 return comp_data_refs(btrfs_delayed_node_to_data_ref(ref2
),
124 btrfs_delayed_node_to_data_ref(ref1
));
131 * insert a new ref into the rbtree. This returns any existing refs
132 * for the same (bytenr,parent) tuple, or NULL if the new node was properly
135 static struct btrfs_delayed_ref_node
*tree_insert(struct rb_root
*root
,
136 struct rb_node
*node
)
138 struct rb_node
**p
= &root
->rb_node
;
139 struct rb_node
*parent_node
= NULL
;
140 struct btrfs_delayed_ref_node
*entry
;
141 struct btrfs_delayed_ref_node
*ins
;
144 ins
= rb_entry(node
, struct btrfs_delayed_ref_node
, rb_node
);
147 entry
= rb_entry(parent_node
, struct btrfs_delayed_ref_node
,
150 cmp
= comp_entry(entry
, ins
, 1);
159 rb_link_node(node
, parent_node
, p
);
160 rb_insert_color(node
, root
);
165 * find an head entry based on bytenr. This returns the delayed ref
166 * head if it was able to find one, or NULL if nothing was in that spot.
167 * If return_bigger is given, the next bigger entry is returned if no exact
170 static struct btrfs_delayed_ref_node
*find_ref_head(struct rb_root
*root
,
172 struct btrfs_delayed_ref_node
**last
,
176 struct btrfs_delayed_ref_node
*entry
;
183 entry
= rb_entry(n
, struct btrfs_delayed_ref_node
, rb_node
);
184 WARN_ON(!entry
->in_tree
);
188 if (bytenr
< entry
->bytenr
)
190 else if (bytenr
> entry
->bytenr
)
192 else if (!btrfs_delayed_ref_is_head(entry
))
204 if (entry
&& return_bigger
) {
206 n
= rb_next(&entry
->rb_node
);
209 entry
= rb_entry(n
, struct btrfs_delayed_ref_node
,
211 bytenr
= entry
->bytenr
;
220 int btrfs_delayed_ref_lock(struct btrfs_trans_handle
*trans
,
221 struct btrfs_delayed_ref_head
*head
)
223 struct btrfs_delayed_ref_root
*delayed_refs
;
225 delayed_refs
= &trans
->transaction
->delayed_refs
;
226 assert_spin_locked(&delayed_refs
->lock
);
227 if (mutex_trylock(&head
->mutex
))
230 atomic_inc(&head
->node
.refs
);
231 spin_unlock(&delayed_refs
->lock
);
233 mutex_lock(&head
->mutex
);
234 spin_lock(&delayed_refs
->lock
);
235 if (!head
->node
.in_tree
) {
236 mutex_unlock(&head
->mutex
);
237 btrfs_put_delayed_ref(&head
->node
);
240 btrfs_put_delayed_ref(&head
->node
);
244 static void inline drop_delayed_ref(struct btrfs_trans_handle
*trans
,
245 struct btrfs_delayed_ref_root
*delayed_refs
,
246 struct btrfs_delayed_ref_node
*ref
)
248 rb_erase(&ref
->rb_node
, &delayed_refs
->root
);
250 btrfs_put_delayed_ref(ref
);
251 delayed_refs
->num_entries
--;
252 if (trans
->delayed_ref_updates
)
253 trans
->delayed_ref_updates
--;
256 static int merge_ref(struct btrfs_trans_handle
*trans
,
257 struct btrfs_delayed_ref_root
*delayed_refs
,
258 struct btrfs_delayed_ref_node
*ref
, u64 seq
)
260 struct rb_node
*node
;
265 node
= rb_prev(&ref
->rb_node
);
267 struct btrfs_delayed_ref_node
*next
;
269 next
= rb_entry(node
, struct btrfs_delayed_ref_node
, rb_node
);
270 node
= rb_prev(node
);
271 if (next
->bytenr
!= ref
->bytenr
)
273 if (seq
&& next
->seq
>= seq
)
275 if (comp_entry(ref
, next
, 0))
278 if (ref
->action
== next
->action
) {
281 if (ref
->ref_mod
< next
->ref_mod
) {
282 struct btrfs_delayed_ref_node
*tmp
;
289 mod
= -next
->ref_mod
;
293 drop_delayed_ref(trans
, delayed_refs
, next
);
295 if (ref
->ref_mod
== 0) {
296 drop_delayed_ref(trans
, delayed_refs
, ref
);
300 * You can't have multiples of the same ref on a tree
303 WARN_ON(ref
->type
== BTRFS_TREE_BLOCK_REF_KEY
||
304 ref
->type
== BTRFS_SHARED_BLOCK_REF_KEY
);
309 node
= rb_prev(&ref
->rb_node
);
315 void btrfs_merge_delayed_refs(struct btrfs_trans_handle
*trans
,
316 struct btrfs_fs_info
*fs_info
,
317 struct btrfs_delayed_ref_root
*delayed_refs
,
318 struct btrfs_delayed_ref_head
*head
)
320 struct rb_node
*node
;
323 spin_lock(&fs_info
->tree_mod_seq_lock
);
324 if (!list_empty(&fs_info
->tree_mod_seq_list
)) {
325 struct seq_list
*elem
;
327 elem
= list_first_entry(&fs_info
->tree_mod_seq_list
,
328 struct seq_list
, list
);
331 spin_unlock(&fs_info
->tree_mod_seq_lock
);
333 node
= rb_prev(&head
->node
.rb_node
);
335 struct btrfs_delayed_ref_node
*ref
;
337 ref
= rb_entry(node
, struct btrfs_delayed_ref_node
,
339 if (ref
->bytenr
!= head
->node
.bytenr
)
342 /* We can't merge refs that are outside of our seq count */
343 if (seq
&& ref
->seq
>= seq
)
345 if (merge_ref(trans
, delayed_refs
, ref
, seq
))
346 node
= rb_prev(&head
->node
.rb_node
);
348 node
= rb_prev(node
);
352 int btrfs_check_delayed_seq(struct btrfs_fs_info
*fs_info
,
353 struct btrfs_delayed_ref_root
*delayed_refs
,
356 struct seq_list
*elem
;
359 spin_lock(&fs_info
->tree_mod_seq_lock
);
360 if (!list_empty(&fs_info
->tree_mod_seq_list
)) {
361 elem
= list_first_entry(&fs_info
->tree_mod_seq_list
,
362 struct seq_list
, list
);
363 if (seq
>= elem
->seq
) {
364 pr_debug("holding back delayed_ref %llu, lowest is "
365 "%llu (%p)\n", seq
, elem
->seq
, delayed_refs
);
370 spin_unlock(&fs_info
->tree_mod_seq_lock
);
374 int btrfs_find_ref_cluster(struct btrfs_trans_handle
*trans
,
375 struct list_head
*cluster
, u64 start
)
378 struct btrfs_delayed_ref_root
*delayed_refs
;
379 struct rb_node
*node
;
380 struct btrfs_delayed_ref_node
*ref
;
381 struct btrfs_delayed_ref_head
*head
;
383 delayed_refs
= &trans
->transaction
->delayed_refs
;
385 node
= rb_first(&delayed_refs
->root
);
388 find_ref_head(&delayed_refs
->root
, start
+ 1, &ref
, 1);
390 node
= &ref
->rb_node
;
392 node
= rb_first(&delayed_refs
->root
);
395 while (node
&& count
< 32) {
396 ref
= rb_entry(node
, struct btrfs_delayed_ref_node
, rb_node
);
397 if (btrfs_delayed_ref_is_head(ref
)) {
398 head
= btrfs_delayed_node_to_head(ref
);
399 if (list_empty(&head
->cluster
)) {
400 list_add_tail(&head
->cluster
, cluster
);
401 delayed_refs
->run_delayed_start
=
405 WARN_ON(delayed_refs
->num_heads_ready
== 0);
406 delayed_refs
->num_heads_ready
--;
408 /* the goal of the clustering is to find extents
409 * that are likely to end up in the same extent
410 * leaf on disk. So, we don't want them spread
411 * all over the tree. Stop now if we've hit
412 * a head that was already in use
417 node
= rb_next(node
);
423 * we've gone to the end of the rbtree without finding any
424 * clusters. start from the beginning and try again
427 node
= rb_first(&delayed_refs
->root
);
433 void btrfs_release_ref_cluster(struct list_head
*cluster
)
435 struct list_head
*pos
, *q
;
437 list_for_each_safe(pos
, q
, cluster
)
442 * helper function to update an extent delayed ref in the
443 * rbtree. existing and update must both have the same
446 * This may free existing if the update cancels out whatever
447 * operation it was doing.
450 update_existing_ref(struct btrfs_trans_handle
*trans
,
451 struct btrfs_delayed_ref_root
*delayed_refs
,
452 struct btrfs_delayed_ref_node
*existing
,
453 struct btrfs_delayed_ref_node
*update
)
455 if (update
->action
!= existing
->action
) {
457 * this is effectively undoing either an add or a
458 * drop. We decrement the ref_mod, and if it goes
459 * down to zero we just delete the entry without
460 * every changing the extent allocation tree.
463 if (existing
->ref_mod
== 0)
464 drop_delayed_ref(trans
, delayed_refs
, existing
);
466 WARN_ON(existing
->type
== BTRFS_TREE_BLOCK_REF_KEY
||
467 existing
->type
== BTRFS_SHARED_BLOCK_REF_KEY
);
469 WARN_ON(existing
->type
== BTRFS_TREE_BLOCK_REF_KEY
||
470 existing
->type
== BTRFS_SHARED_BLOCK_REF_KEY
);
472 * the action on the existing ref matches
473 * the action on the ref we're trying to add.
474 * Bump the ref_mod by one so the backref that
475 * is eventually added/removed has the correct
478 existing
->ref_mod
+= update
->ref_mod
;
483 * helper function to update the accounting in the head ref
484 * existing and update must have the same bytenr
487 update_existing_head_ref(struct btrfs_delayed_ref_node
*existing
,
488 struct btrfs_delayed_ref_node
*update
)
490 struct btrfs_delayed_ref_head
*existing_ref
;
491 struct btrfs_delayed_ref_head
*ref
;
493 existing_ref
= btrfs_delayed_node_to_head(existing
);
494 ref
= btrfs_delayed_node_to_head(update
);
495 BUG_ON(existing_ref
->is_data
!= ref
->is_data
);
497 if (ref
->must_insert_reserved
) {
498 /* if the extent was freed and then
499 * reallocated before the delayed ref
500 * entries were processed, we can end up
501 * with an existing head ref without
502 * the must_insert_reserved flag set.
505 existing_ref
->must_insert_reserved
= ref
->must_insert_reserved
;
508 * update the num_bytes so we make sure the accounting
511 existing
->num_bytes
= update
->num_bytes
;
515 if (ref
->extent_op
) {
516 if (!existing_ref
->extent_op
) {
517 existing_ref
->extent_op
= ref
->extent_op
;
519 if (ref
->extent_op
->update_key
) {
520 memcpy(&existing_ref
->extent_op
->key
,
521 &ref
->extent_op
->key
,
522 sizeof(ref
->extent_op
->key
));
523 existing_ref
->extent_op
->update_key
= 1;
525 if (ref
->extent_op
->update_flags
) {
526 existing_ref
->extent_op
->flags_to_set
|=
527 ref
->extent_op
->flags_to_set
;
528 existing_ref
->extent_op
->update_flags
= 1;
530 btrfs_free_delayed_extent_op(ref
->extent_op
);
534 * update the reference mod on the head to reflect this new operation
536 existing
->ref_mod
+= update
->ref_mod
;
540 * helper function to actually insert a head node into the rbtree.
541 * this does all the dirty work in terms of maintaining the correct
542 * overall modification count.
544 static noinline
void add_delayed_ref_head(struct btrfs_fs_info
*fs_info
,
545 struct btrfs_trans_handle
*trans
,
546 struct btrfs_delayed_ref_node
*ref
,
547 u64 bytenr
, u64 num_bytes
,
548 int action
, int is_data
)
550 struct btrfs_delayed_ref_node
*existing
;
551 struct btrfs_delayed_ref_head
*head_ref
= NULL
;
552 struct btrfs_delayed_ref_root
*delayed_refs
;
554 int must_insert_reserved
= 0;
557 * the head node stores the sum of all the mods, so dropping a ref
558 * should drop the sum in the head node by one.
560 if (action
== BTRFS_UPDATE_DELAYED_HEAD
)
562 else if (action
== BTRFS_DROP_DELAYED_REF
)
566 * BTRFS_ADD_DELAYED_EXTENT means that we need to update
567 * the reserved accounting when the extent is finally added, or
568 * if a later modification deletes the delayed ref without ever
569 * inserting the extent into the extent allocation tree.
570 * ref->must_insert_reserved is the flag used to record
571 * that accounting mods are required.
573 * Once we record must_insert_reserved, switch the action to
574 * BTRFS_ADD_DELAYED_REF because other special casing is not required.
576 if (action
== BTRFS_ADD_DELAYED_EXTENT
)
577 must_insert_reserved
= 1;
579 must_insert_reserved
= 0;
581 delayed_refs
= &trans
->transaction
->delayed_refs
;
583 /* first set the basic ref node struct up */
584 atomic_set(&ref
->refs
, 1);
585 ref
->bytenr
= bytenr
;
586 ref
->num_bytes
= num_bytes
;
587 ref
->ref_mod
= count_mod
;
594 head_ref
= btrfs_delayed_node_to_head(ref
);
595 head_ref
->must_insert_reserved
= must_insert_reserved
;
596 head_ref
->is_data
= is_data
;
598 INIT_LIST_HEAD(&head_ref
->cluster
);
599 mutex_init(&head_ref
->mutex
);
601 trace_btrfs_delayed_ref_head(ref
, head_ref
, action
);
603 existing
= tree_insert(&delayed_refs
->root
, &ref
->rb_node
);
606 update_existing_head_ref(existing
, ref
);
608 * we've updated the existing ref, free the newly
611 kmem_cache_free(btrfs_delayed_ref_head_cachep
, head_ref
);
613 delayed_refs
->num_heads
++;
614 delayed_refs
->num_heads_ready
++;
615 delayed_refs
->num_entries
++;
616 trans
->delayed_ref_updates
++;
621 * helper to insert a delayed tree ref into the rbtree.
623 static noinline
void add_delayed_tree_ref(struct btrfs_fs_info
*fs_info
,
624 struct btrfs_trans_handle
*trans
,
625 struct btrfs_delayed_ref_node
*ref
,
626 u64 bytenr
, u64 num_bytes
, u64 parent
,
627 u64 ref_root
, int level
, int action
,
630 struct btrfs_delayed_ref_node
*existing
;
631 struct btrfs_delayed_tree_ref
*full_ref
;
632 struct btrfs_delayed_ref_root
*delayed_refs
;
635 if (action
== BTRFS_ADD_DELAYED_EXTENT
)
636 action
= BTRFS_ADD_DELAYED_REF
;
638 delayed_refs
= &trans
->transaction
->delayed_refs
;
640 /* first set the basic ref node struct up */
641 atomic_set(&ref
->refs
, 1);
642 ref
->bytenr
= bytenr
;
643 ref
->num_bytes
= num_bytes
;
645 ref
->action
= action
;
649 if (need_ref_seq(for_cow
, ref_root
))
650 seq
= btrfs_get_tree_mod_seq(fs_info
, &trans
->delayed_ref_elem
);
653 full_ref
= btrfs_delayed_node_to_tree_ref(ref
);
654 full_ref
->parent
= parent
;
655 full_ref
->root
= ref_root
;
657 ref
->type
= BTRFS_SHARED_BLOCK_REF_KEY
;
659 ref
->type
= BTRFS_TREE_BLOCK_REF_KEY
;
660 full_ref
->level
= level
;
662 trace_btrfs_delayed_tree_ref(ref
, full_ref
, action
);
664 existing
= tree_insert(&delayed_refs
->root
, &ref
->rb_node
);
667 update_existing_ref(trans
, delayed_refs
, existing
, ref
);
669 * we've updated the existing ref, free the newly
672 kmem_cache_free(btrfs_delayed_tree_ref_cachep
, full_ref
);
674 delayed_refs
->num_entries
++;
675 trans
->delayed_ref_updates
++;
680 * helper to insert a delayed data ref into the rbtree.
682 static noinline
void add_delayed_data_ref(struct btrfs_fs_info
*fs_info
,
683 struct btrfs_trans_handle
*trans
,
684 struct btrfs_delayed_ref_node
*ref
,
685 u64 bytenr
, u64 num_bytes
, u64 parent
,
686 u64 ref_root
, u64 owner
, u64 offset
,
687 int action
, int for_cow
)
689 struct btrfs_delayed_ref_node
*existing
;
690 struct btrfs_delayed_data_ref
*full_ref
;
691 struct btrfs_delayed_ref_root
*delayed_refs
;
694 if (action
== BTRFS_ADD_DELAYED_EXTENT
)
695 action
= BTRFS_ADD_DELAYED_REF
;
697 delayed_refs
= &trans
->transaction
->delayed_refs
;
699 /* first set the basic ref node struct up */
700 atomic_set(&ref
->refs
, 1);
701 ref
->bytenr
= bytenr
;
702 ref
->num_bytes
= num_bytes
;
704 ref
->action
= action
;
708 if (need_ref_seq(for_cow
, ref_root
))
709 seq
= btrfs_get_tree_mod_seq(fs_info
, &trans
->delayed_ref_elem
);
712 full_ref
= btrfs_delayed_node_to_data_ref(ref
);
713 full_ref
->parent
= parent
;
714 full_ref
->root
= ref_root
;
716 ref
->type
= BTRFS_SHARED_DATA_REF_KEY
;
718 ref
->type
= BTRFS_EXTENT_DATA_REF_KEY
;
720 full_ref
->objectid
= owner
;
721 full_ref
->offset
= offset
;
723 trace_btrfs_delayed_data_ref(ref
, full_ref
, action
);
725 existing
= tree_insert(&delayed_refs
->root
, &ref
->rb_node
);
728 update_existing_ref(trans
, delayed_refs
, existing
, ref
);
730 * we've updated the existing ref, free the newly
733 kmem_cache_free(btrfs_delayed_data_ref_cachep
, full_ref
);
735 delayed_refs
->num_entries
++;
736 trans
->delayed_ref_updates
++;
741 * add a delayed tree ref. This does all of the accounting required
742 * to make sure the delayed ref is eventually processed before this
743 * transaction commits.
745 int btrfs_add_delayed_tree_ref(struct btrfs_fs_info
*fs_info
,
746 struct btrfs_trans_handle
*trans
,
747 u64 bytenr
, u64 num_bytes
, u64 parent
,
748 u64 ref_root
, int level
, int action
,
749 struct btrfs_delayed_extent_op
*extent_op
,
752 struct btrfs_delayed_tree_ref
*ref
;
753 struct btrfs_delayed_ref_head
*head_ref
;
754 struct btrfs_delayed_ref_root
*delayed_refs
;
756 BUG_ON(extent_op
&& extent_op
->is_data
);
757 ref
= kmem_cache_alloc(btrfs_delayed_tree_ref_cachep
, GFP_NOFS
);
761 head_ref
= kmem_cache_alloc(btrfs_delayed_ref_head_cachep
, GFP_NOFS
);
763 kmem_cache_free(btrfs_delayed_tree_ref_cachep
, ref
);
767 head_ref
->extent_op
= extent_op
;
769 delayed_refs
= &trans
->transaction
->delayed_refs
;
770 spin_lock(&delayed_refs
->lock
);
773 * insert both the head node and the new ref without dropping
776 add_delayed_ref_head(fs_info
, trans
, &head_ref
->node
, bytenr
,
777 num_bytes
, action
, 0);
779 add_delayed_tree_ref(fs_info
, trans
, &ref
->node
, bytenr
,
780 num_bytes
, parent
, ref_root
, level
, action
,
782 spin_unlock(&delayed_refs
->lock
);
783 if (need_ref_seq(for_cow
, ref_root
))
784 btrfs_qgroup_record_ref(trans
, &ref
->node
, extent_op
);
790 * add a delayed data ref. it's similar to btrfs_add_delayed_tree_ref.
792 int btrfs_add_delayed_data_ref(struct btrfs_fs_info
*fs_info
,
793 struct btrfs_trans_handle
*trans
,
794 u64 bytenr
, u64 num_bytes
,
795 u64 parent
, u64 ref_root
,
796 u64 owner
, u64 offset
, int action
,
797 struct btrfs_delayed_extent_op
*extent_op
,
800 struct btrfs_delayed_data_ref
*ref
;
801 struct btrfs_delayed_ref_head
*head_ref
;
802 struct btrfs_delayed_ref_root
*delayed_refs
;
804 BUG_ON(extent_op
&& !extent_op
->is_data
);
805 ref
= kmem_cache_alloc(btrfs_delayed_data_ref_cachep
, GFP_NOFS
);
809 head_ref
= kmem_cache_alloc(btrfs_delayed_ref_head_cachep
, GFP_NOFS
);
811 kmem_cache_free(btrfs_delayed_data_ref_cachep
, ref
);
815 head_ref
->extent_op
= extent_op
;
817 delayed_refs
= &trans
->transaction
->delayed_refs
;
818 spin_lock(&delayed_refs
->lock
);
821 * insert both the head node and the new ref without dropping
824 add_delayed_ref_head(fs_info
, trans
, &head_ref
->node
, bytenr
,
825 num_bytes
, action
, 1);
827 add_delayed_data_ref(fs_info
, trans
, &ref
->node
, bytenr
,
828 num_bytes
, parent
, ref_root
, owner
, offset
,
830 spin_unlock(&delayed_refs
->lock
);
831 if (need_ref_seq(for_cow
, ref_root
))
832 btrfs_qgroup_record_ref(trans
, &ref
->node
, extent_op
);
837 int btrfs_add_delayed_extent_op(struct btrfs_fs_info
*fs_info
,
838 struct btrfs_trans_handle
*trans
,
839 u64 bytenr
, u64 num_bytes
,
840 struct btrfs_delayed_extent_op
*extent_op
)
842 struct btrfs_delayed_ref_head
*head_ref
;
843 struct btrfs_delayed_ref_root
*delayed_refs
;
845 head_ref
= kmem_cache_alloc(btrfs_delayed_ref_head_cachep
, GFP_NOFS
);
849 head_ref
->extent_op
= extent_op
;
851 delayed_refs
= &trans
->transaction
->delayed_refs
;
852 spin_lock(&delayed_refs
->lock
);
854 add_delayed_ref_head(fs_info
, trans
, &head_ref
->node
, bytenr
,
855 num_bytes
, BTRFS_UPDATE_DELAYED_HEAD
,
858 spin_unlock(&delayed_refs
->lock
);
863 * this does a simple search for the head node for a given extent.
864 * It must be called with the delayed ref spinlock held, and it returns
865 * the head node if any where found, or NULL if not.
867 struct btrfs_delayed_ref_head
*
868 btrfs_find_delayed_ref_head(struct btrfs_trans_handle
*trans
, u64 bytenr
)
870 struct btrfs_delayed_ref_node
*ref
;
871 struct btrfs_delayed_ref_root
*delayed_refs
;
873 delayed_refs
= &trans
->transaction
->delayed_refs
;
874 ref
= find_ref_head(&delayed_refs
->root
, bytenr
, NULL
, 0);
876 return btrfs_delayed_node_to_head(ref
);
880 void btrfs_delayed_ref_exit(void)
882 if (btrfs_delayed_ref_head_cachep
)
883 kmem_cache_destroy(btrfs_delayed_ref_head_cachep
);
884 if (btrfs_delayed_tree_ref_cachep
)
885 kmem_cache_destroy(btrfs_delayed_tree_ref_cachep
);
886 if (btrfs_delayed_data_ref_cachep
)
887 kmem_cache_destroy(btrfs_delayed_data_ref_cachep
);
888 if (btrfs_delayed_extent_op_cachep
)
889 kmem_cache_destroy(btrfs_delayed_extent_op_cachep
);
892 int btrfs_delayed_ref_init(void)
894 btrfs_delayed_ref_head_cachep
= kmem_cache_create(
895 "btrfs_delayed_ref_head",
896 sizeof(struct btrfs_delayed_ref_head
), 0,
897 SLAB_RECLAIM_ACCOUNT
| SLAB_MEM_SPREAD
, NULL
);
898 if (!btrfs_delayed_ref_head_cachep
)
901 btrfs_delayed_tree_ref_cachep
= kmem_cache_create(
902 "btrfs_delayed_tree_ref",
903 sizeof(struct btrfs_delayed_tree_ref
), 0,
904 SLAB_RECLAIM_ACCOUNT
| SLAB_MEM_SPREAD
, NULL
);
905 if (!btrfs_delayed_tree_ref_cachep
)
908 btrfs_delayed_data_ref_cachep
= kmem_cache_create(
909 "btrfs_delayed_data_ref",
910 sizeof(struct btrfs_delayed_data_ref
), 0,
911 SLAB_RECLAIM_ACCOUNT
| SLAB_MEM_SPREAD
, NULL
);
912 if (!btrfs_delayed_data_ref_cachep
)
915 btrfs_delayed_extent_op_cachep
= kmem_cache_create(
916 "btrfs_delayed_extent_op",
917 sizeof(struct btrfs_delayed_extent_op
), 0,
918 SLAB_RECLAIM_ACCOUNT
| SLAB_MEM_SPREAD
, NULL
);
919 if (!btrfs_delayed_extent_op_cachep
)
924 btrfs_delayed_ref_exit();