227 				    struct btrfs_delayed_ref_node *ref)  in drop_delayed_ref()  argument
230 	rb_erase(&ref->ref_node, &head->ref_tree);  in drop_delayed_ref()
231 	RB_CLEAR_NODE(&ref->ref_node);  in drop_delayed_ref()
232 	if (!list_empty(&ref->add_list))  in drop_delayed_ref()
233 		list_del(&ref->add_list);  in drop_delayed_ref()
234 	ref->in_tree = 0;  in drop_delayed_ref()
235 	btrfs_put_delayed_ref(ref);  in drop_delayed_ref()
244 		      struct btrfs_delayed_ref_node *ref,  in merge_ref()  argument
248 	struct rb_node *node = rb_next(&ref->ref_node);  in merge_ref()
258 		if (comp_refs(ref, next, false))  in merge_ref()
261 		if (ref->action == next->action) {  in merge_ref()
264 			if (ref->ref_mod < next->ref_mod) {  in merge_ref()
265 				swap(ref, next);  in merge_ref()
272 		ref->ref_mod += mod;  in merge_ref()
273 		if (ref->ref_mod == 0) {  in merge_ref()
274 			drop_delayed_ref(trans, delayed_refs, head, ref);  in merge_ref()
280 			WARN_ON(ref->type == BTRFS_TREE_BLOCK_REF_KEY ||  in merge_ref()
281 				ref->type == BTRFS_SHARED_BLOCK_REF_KEY);  in merge_ref()
293 	struct btrfs_delayed_ref_node *ref;  in btrfs_merge_delayed_refs()  local
318 		ref = rb_entry(node, struct btrfs_delayed_ref_node, ref_node);  in btrfs_merge_delayed_refs()
319 		if (seq && ref->seq >= seq)  in btrfs_merge_delayed_refs()
321 		if (merge_ref(trans, delayed_refs, head, ref, seq))  in btrfs_merge_delayed_refs()
405 			      struct btrfs_delayed_ref_node *ref)  in insert_delayed_ref()  argument
412 	exist = tree_insert(&href->ref_tree, ref);  in insert_delayed_ref()
418 	if (exist->action == ref->action) {  in insert_delayed_ref()
419 		mod = ref->ref_mod;  in insert_delayed_ref()
422 		if (exist->ref_mod < ref->ref_mod) {  in insert_delayed_ref()
423 			exist->action = ref->action;  in insert_delayed_ref()
425 			exist->ref_mod = ref->ref_mod;  in insert_delayed_ref()
426 			if (ref->action == BTRFS_ADD_DELAYED_REF)  in insert_delayed_ref()
429 			else if (ref->action == BTRFS_DROP_DELAYED_REF) {  in insert_delayed_ref()
436 			mod = -ref->ref_mod;  in insert_delayed_ref()
446 	if (ref->action == BTRFS_ADD_DELAYED_REF)  in insert_delayed_ref()
447 		list_add_tail(&ref->add_list, &href->ref_add_list);  in insert_delayed_ref()
682 				    struct btrfs_delayed_ref_node *ref,  in init_delayed_ref_common()  argument
694 	refcount_set(&ref->refs, 1);  in init_delayed_ref_common()
695 	ref->bytenr = bytenr;  in init_delayed_ref_common()
696 	ref->num_bytes = num_bytes;  in init_delayed_ref_common()
697 	ref->ref_mod = 1;  in init_delayed_ref_common()
698 	ref->action = action;  in init_delayed_ref_common()
699 	ref->is_head = 0;  in init_delayed_ref_common()
700 	ref->in_tree = 1;  in init_delayed_ref_common()
701 	ref->seq = seq;  in init_delayed_ref_common()
702 	ref->type = ref_type;  in init_delayed_ref_common()
703 	RB_CLEAR_NODE(&ref->ref_node);  in init_delayed_ref_common()
704 	INIT_LIST_HEAD(&ref->add_list);  in init_delayed_ref_common()
719 	struct btrfs_delayed_tree_ref *ref;  in btrfs_add_delayed_tree_ref()  local
729 	ref = kmem_cache_alloc(btrfs_delayed_tree_ref_cachep, GFP_NOFS);  in btrfs_add_delayed_tree_ref()
730 	if (!ref)  in btrfs_add_delayed_tree_ref()
735 		kmem_cache_free(btrfs_delayed_tree_ref_cachep, ref);  in btrfs_add_delayed_tree_ref()
743 			kmem_cache_free(btrfs_delayed_tree_ref_cachep, ref);  in btrfs_add_delayed_tree_ref()
754 	init_delayed_ref_common(fs_info, &ref->node, bytenr, num_bytes,  in btrfs_add_delayed_tree_ref()
756 	ref->root = ref_root;  in btrfs_add_delayed_tree_ref()
757 	ref->parent = parent;  in btrfs_add_delayed_tree_ref()
758 	ref->level = level;  in btrfs_add_delayed_tree_ref()
775 	ret = insert_delayed_ref(trans, delayed_refs, head_ref, &ref->node);  in btrfs_add_delayed_tree_ref()
778 	trace_add_delayed_tree_ref(fs_info, &ref->node, ref,  in btrfs_add_delayed_tree_ref()
782 		kmem_cache_free(btrfs_delayed_tree_ref_cachep, ref);  in btrfs_add_delayed_tree_ref()
800 	struct btrfs_delayed_data_ref *ref;  in btrfs_add_delayed_data_ref()  local
808 	ref = kmem_cache_alloc(btrfs_delayed_data_ref_cachep, GFP_NOFS);  in btrfs_add_delayed_data_ref()
809 	if (!ref)  in btrfs_add_delayed_data_ref()
816 	init_delayed_ref_common(fs_info, &ref->node, bytenr, num_bytes,  in btrfs_add_delayed_data_ref()
818 	ref->root = ref_root;  in btrfs_add_delayed_data_ref()
819 	ref->parent = parent;  in btrfs_add_delayed_data_ref()
820 	ref->objectid = owner;  in btrfs_add_delayed_data_ref()
821 	ref->offset = offset;  in btrfs_add_delayed_data_ref()
826 		kmem_cache_free(btrfs_delayed_data_ref_cachep, ref);  in btrfs_add_delayed_data_ref()
834 			kmem_cache_free(btrfs_delayed_data_ref_cachep, ref);  in btrfs_add_delayed_data_ref()
856 	ret = insert_delayed_ref(trans, delayed_refs, head_ref, &ref->node);  in btrfs_add_delayed_data_ref()
859 	trace_add_delayed_data_ref(trans->fs_info, &ref->node, ref,  in btrfs_add_delayed_data_ref()
863 		kmem_cache_free(btrfs_delayed_data_ref_cachep, ref);  in btrfs_add_delayed_data_ref()