Lines Matching full:ref
10 #include "delayed-ref.h"
103 /* insert a new ref to head ref rbtree */
162 * find an head entry based on bytenr. This returns the delayed ref
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()
242 struct btrfs_delayed_ref_node *ref, in merge_ref() argument
246 struct rb_node *node = rb_next(&ref->ref_node); in merge_ref()
256 if (comp_refs(ref, next, false)) in merge_ref()
259 if (ref->action == next->action) { in merge_ref()
262 if (ref->ref_mod < next->ref_mod) { in merge_ref()
263 swap(ref, next); in merge_ref()
270 ref->ref_mod += mod; in merge_ref()
271 if (ref->ref_mod == 0) { in merge_ref()
272 drop_delayed_ref(trans, delayed_refs, head, ref); in merge_ref()
276 * Can't have multiples of the same ref on a tree block. in merge_ref()
278 WARN_ON(ref->type == BTRFS_TREE_BLOCK_REF_KEY || in merge_ref()
279 ref->type == BTRFS_SHARED_BLOCK_REF_KEY); in merge_ref()
291 struct btrfs_delayed_ref_node *ref; in btrfs_merge_delayed_refs() local
316 ref = rb_entry(node, struct btrfs_delayed_ref_node, ref_node); in btrfs_merge_delayed_refs()
317 if (seq && ref->seq >= seq) in btrfs_merge_delayed_refs()
319 if (merge_ref(trans, delayed_refs, head, ref, seq)) in btrfs_merge_delayed_refs()
403 struct btrfs_delayed_ref_node *ref) in insert_delayed_ref() argument
410 exist = tree_insert(&href->ref_tree, ref); in insert_delayed_ref()
416 if (exist->action == ref->action) { in insert_delayed_ref()
417 mod = ref->ref_mod; in insert_delayed_ref()
420 if (exist->ref_mod < ref->ref_mod) { in insert_delayed_ref()
421 exist->action = ref->action; in insert_delayed_ref()
423 exist->ref_mod = ref->ref_mod; in insert_delayed_ref()
424 if (ref->action == BTRFS_ADD_DELAYED_REF) in insert_delayed_ref()
427 else if (ref->action == BTRFS_DROP_DELAYED_REF) { in insert_delayed_ref()
434 mod = -ref->ref_mod; in insert_delayed_ref()
444 if (ref->action == BTRFS_ADD_DELAYED_REF) in insert_delayed_ref()
445 list_add_tail(&ref->add_list, &href->ref_add_list); in insert_delayed_ref()
452 * helper function to update the accounting in the head ref
468 * reallocated before the delayed ref in update_existing_head_ref()
470 * with an existing head ref without in update_existing_head_ref()
514 * If we are going to from a positive ref mod to a negative or vice in update_existing_head_ref()
539 * The head node stores the sum of all the mods, so dropping a ref in init_delayed_ref_head()
550 * modification deletes the delayed ref without ever inserting the in init_delayed_ref_head()
551 * extent into the extent allocation tree. ref->must_insert_reserved in init_delayed_ref_head()
630 * we've updated the existing ref, free the newly in add_delayed_ref_head()
631 * allocated ref in add_delayed_ref_head()
659 * @ref: The structure which is going to be initialized.
679 struct btrfs_delayed_ref_node *ref, in init_delayed_ref_common() argument
691 refcount_set(&ref->refs, 1); in init_delayed_ref_common()
692 ref->bytenr = bytenr; in init_delayed_ref_common()
693 ref->num_bytes = num_bytes; in init_delayed_ref_common()
694 ref->ref_mod = 1; in init_delayed_ref_common()
695 ref->action = action; in init_delayed_ref_common()
696 ref->is_head = 0; in init_delayed_ref_common()
697 ref->in_tree = 1; in init_delayed_ref_common()
698 ref->seq = seq; in init_delayed_ref_common()
699 ref->type = ref_type; in init_delayed_ref_common()
700 RB_CLEAR_NODE(&ref->ref_node); in init_delayed_ref_common()
701 INIT_LIST_HEAD(&ref->add_list); in init_delayed_ref_common()
705 * add a delayed tree ref. This does all of the accounting required
706 * to make sure the delayed ref is eventually processed before this
716 struct btrfs_delayed_tree_ref *ref; in btrfs_add_delayed_tree_ref() local
726 ref = kmem_cache_alloc(btrfs_delayed_tree_ref_cachep, GFP_NOFS); in btrfs_add_delayed_tree_ref()
727 if (!ref) in btrfs_add_delayed_tree_ref()
732 kmem_cache_free(btrfs_delayed_tree_ref_cachep, ref); in btrfs_add_delayed_tree_ref()
740 kmem_cache_free(btrfs_delayed_tree_ref_cachep, ref); in btrfs_add_delayed_tree_ref()
751 init_delayed_ref_common(fs_info, &ref->node, bytenr, num_bytes, in btrfs_add_delayed_tree_ref()
753 ref->root = ref_root; in btrfs_add_delayed_tree_ref()
754 ref->parent = parent; in btrfs_add_delayed_tree_ref()
755 ref->level = level; in btrfs_add_delayed_tree_ref()
765 * insert both the head node and the new ref without dropping in btrfs_add_delayed_tree_ref()
772 ret = insert_delayed_ref(trans, delayed_refs, head_ref, &ref->node); in btrfs_add_delayed_tree_ref()
775 trace_add_delayed_tree_ref(fs_info, &ref->node, ref, in btrfs_add_delayed_tree_ref()
779 kmem_cache_free(btrfs_delayed_tree_ref_cachep, ref); in btrfs_add_delayed_tree_ref()
788 * add a delayed data ref. it's similar to btrfs_add_delayed_tree_ref.
797 struct btrfs_delayed_data_ref *ref; in btrfs_add_delayed_data_ref() local
805 ref = kmem_cache_alloc(btrfs_delayed_data_ref_cachep, GFP_NOFS); in btrfs_add_delayed_data_ref()
806 if (!ref) in btrfs_add_delayed_data_ref()
813 init_delayed_ref_common(fs_info, &ref->node, bytenr, num_bytes, in btrfs_add_delayed_data_ref()
815 ref->root = ref_root; in btrfs_add_delayed_data_ref()
816 ref->parent = parent; in btrfs_add_delayed_data_ref()
817 ref->objectid = owner; in btrfs_add_delayed_data_ref()
818 ref->offset = offset; in btrfs_add_delayed_data_ref()
823 kmem_cache_free(btrfs_delayed_data_ref_cachep, ref); in btrfs_add_delayed_data_ref()
831 kmem_cache_free(btrfs_delayed_data_ref_cachep, ref); in btrfs_add_delayed_data_ref()
846 * insert both the head node and the new ref without dropping in btrfs_add_delayed_data_ref()
853 ret = insert_delayed_ref(trans, delayed_refs, head_ref, &ref->node); in btrfs_add_delayed_data_ref()
856 trace_add_delayed_data_ref(trans->fs_info, &ref->node, ref, in btrfs_add_delayed_data_ref()
860 kmem_cache_free(btrfs_delayed_data_ref_cachep, ref); in btrfs_add_delayed_data_ref()
897 * It must be called with the delayed ref spinlock held, and it returns