Lines Matching full:ref
12 #include "delayed-ref.h"
13 #include "ref-verify.h"
46 * back to the delayed ref action. We hold the ref we are changing in the
54 struct ref_entry ref; member
62 * to it as well as all of the ref actions that have occurred to it. We never
165 struct ref_entry *ref) in insert_ref_entry() argument
175 cmp = comp_refs(entry, ref); in insert_ref_entry()
184 rb_link_node(&ref->node, parent_node, p); in insert_ref_entry()
185 rb_insert_color(&ref->node, root); in insert_ref_entry()
218 btrfs_err(fs_info, " ref-verify: no stacktrace"); in __print_stack_trace()
231 btrfs_err(fs_info, " ref-verify: no stacktrace support"); in __print_stack_trace()
238 struct ref_entry *ref; in free_block_entry() local
249 ref = rb_entry(n, struct ref_entry, node); in free_block_entry()
250 rb_erase(&ref->node, &be->refs); in free_block_entry()
251 kfree(ref); in free_block_entry()
317 struct ref_entry *ref = NULL, *exist; in add_tree_block() local
319 ref = kmalloc(sizeof(struct ref_entry), GFP_NOFS); in add_tree_block()
320 if (!ref) in add_tree_block()
324 ref->root_objectid = 0; in add_tree_block()
326 ref->root_objectid = ref_root; in add_tree_block()
327 ref->parent = parent; in add_tree_block()
328 ref->owner = level; in add_tree_block()
329 ref->offset = 0; in add_tree_block()
330 ref->num_refs = 1; in add_tree_block()
334 kfree(ref); in add_tree_block()
347 exist = insert_ref_entry(&be->refs, ref); in add_tree_block()
350 kfree(ref); in add_tree_block()
362 struct ref_entry *ref; in add_shared_data_ref() local
364 ref = kzalloc(sizeof(struct ref_entry), GFP_NOFS); in add_shared_data_ref()
365 if (!ref) in add_shared_data_ref()
369 kfree(ref); in add_shared_data_ref()
374 ref->parent = parent; in add_shared_data_ref()
375 ref->num_refs = num_refs; in add_shared_data_ref()
376 if (insert_ref_entry(&be->refs, ref)) { in add_shared_data_ref()
378 btrfs_err(fs_info, "existing shared ref when reading from disk?"); in add_shared_data_ref()
379 kfree(ref); in add_shared_data_ref()
392 struct ref_entry *ref; in add_extent_data_ref() local
399 ref = kzalloc(sizeof(struct ref_entry), GFP_NOFS); in add_extent_data_ref()
400 if (!ref) in add_extent_data_ref()
404 kfree(ref); in add_extent_data_ref()
409 ref->parent = 0; in add_extent_data_ref()
410 ref->owner = owner; in add_extent_data_ref()
411 ref->root_objectid = ref_root; in add_extent_data_ref()
412 ref->offset = offset; in add_extent_data_ref()
413 ref->num_refs = num_refs; in add_extent_data_ref()
414 if (insert_ref_entry(&be->refs, ref)) { in add_extent_data_ref()
416 btrfs_err(fs_info, "existing ref when reading from disk?"); in add_extent_data_ref()
417 kfree(ref); in add_extent_data_ref()
616 " Ref action %d, root %llu, ref_root %llu, parent %llu, owner %llu, offset %llu, num_refs %llu", in dump_ref_action()
617 ra->action, ra->root, ra->ref.root_objectid, ra->ref.parent, in dump_ref_action()
618 ra->ref.owner, ra->ref.offset, ra->ref.num_refs); in dump_ref_action()
629 struct ref_entry *ref; in dump_block_entry() local
640 ref = rb_entry(n, struct ref_entry, node); in dump_block_entry()
642 " ref root %llu, parent %llu, owner %llu, offset %llu, num_refs %llu", in dump_block_entry()
643 ref->root_objectid, ref->parent, ref->owner, in dump_block_entry()
644 ref->offset, ref->num_refs); in dump_block_entry()
658 * Called when we modify a ref for a bytenr.
668 struct ref_entry *ref = NULL, *exist; in btrfs_ref_tree_mod() local
696 ref = kzalloc(sizeof(struct ref_entry), GFP_NOFS); in btrfs_ref_tree_mod()
698 if (!ra || !ref) { in btrfs_ref_tree_mod()
699 kfree(ref); in btrfs_ref_tree_mod()
705 ref->parent = parent; in btrfs_ref_tree_mod()
706 ref->owner = owner; in btrfs_ref_tree_mod()
707 ref->root_objectid = ref_root; in btrfs_ref_tree_mod()
708 ref->offset = offset; in btrfs_ref_tree_mod()
709 ref->num_refs = (action == BTRFS_DROP_DELAYED_REF) ? -1 : 1; in btrfs_ref_tree_mod()
711 memcpy(&ra->ref, ref, sizeof(struct ref_entry)); in btrfs_ref_tree_mod()
713 * Save the extra info from the delayed ref in the ref action to make it in btrfs_ref_tree_mod()
714 * easier to figure out what is happening. The real ref's we add to the in btrfs_ref_tree_mod()
715 * ref tree need to reflect what we save on disk so it matches any in btrfs_ref_tree_mod()
718 ra->ref.owner = owner; in btrfs_ref_tree_mod()
719 ra->ref.offset = offset; in btrfs_ref_tree_mod()
720 ra->ref.root_objectid = ref_root; in btrfs_ref_tree_mod()
736 * in root as if it really has a ref for this bytenr. in btrfs_ref_tree_mod()
740 kfree(ref); in btrfs_ref_tree_mod()
754 kfree(ref); in btrfs_ref_tree_mod()
773 kfree(ref); in btrfs_ref_tree_mod()
795 kfree(ref); in btrfs_ref_tree_mod()
805 kfree(ref); in btrfs_ref_tree_mod()
820 exist = insert_ref_entry(&be->refs, ref); in btrfs_ref_tree_mod()
825 "dropping a ref for a existing root that doesn't have a ref on the block"); in btrfs_ref_tree_mod()
828 kfree(ref); in btrfs_ref_tree_mod()
841 "attempting to add another ref for an existing ref on a tree block"); in btrfs_ref_tree_mod()
844 kfree(ref); in btrfs_ref_tree_mod()
848 kfree(ref); in btrfs_ref_tree_mod()
852 "dropping a ref for a root that doesn't have a ref on the block"); in btrfs_ref_tree_mod()
855 kfree(ref); in btrfs_ref_tree_mod()
899 /* Free up the ref cache */
982 /* Walk down all roots and build the ref tree, meant to be called at mount */
1009 * because we could have run out of space for an inline ref, and in btrfs_build_ref_tree()
1010 * would have had to added a ref key item which may appear on a in btrfs_build_ref_tree()