44 	struct __prelim_ref *ref;  in __add_prelim_ref()  local
47 	ref = kmalloc(sizeof(*ref), GFP_ATOMIC);  in __add_prelim_ref()
48 	if (!ref)  in __add_prelim_ref()
51 	ref->root_id = root_id;  in __add_prelim_ref()
53 		ref->key = *key;  in __add_prelim_ref()
55 		memset(&ref->key, 0, sizeof(ref->key));  in __add_prelim_ref()
57 	ref->level = level;  in __add_prelim_ref()
58 	ref->count = count;  in __add_prelim_ref()
59 	ref->parent = parent;  in __add_prelim_ref()
60 	ref->wanted_disk_byte = wanted_disk_byte;  in __add_prelim_ref()
61 	list_add_tail(&ref->list, head);  in __add_prelim_ref()
121 					struct __prelim_ref *ref,  in __resolve_indirect_ref()  argument
131 	int level = ref->level;  in __resolve_indirect_ref()
138 	root_key.objectid = ref->root_id;  in __resolve_indirect_ref()
155 	ret = btrfs_search_slot(NULL, root, &ref->key, path, 0, 0);  in __resolve_indirect_ref()
158 		 (unsigned long long)ref->root_id, level, ref->count, ret,  in __resolve_indirect_ref()
159 		 (unsigned long long)ref->key.objectid, ref->key.type,  in __resolve_indirect_ref()
160 		 (unsigned long long)ref->key.offset);  in __resolve_indirect_ref()
184 				ref->wanted_disk_byte);  in __resolve_indirect_ref()
199 	struct __prelim_ref *ref;  in __resolve_indirect_refs()  local
214 	list_for_each_entry_safe(ref, ref_safe, head, list) {  in __resolve_indirect_refs()
215 		if (ref->parent)	/* already direct */  in __resolve_indirect_refs()
217 		if (ref->count == 0)  in __resolve_indirect_refs()
220 					     ref, parents);  in __resolve_indirect_refs()
229 		ref->parent = node ? node->val : 0;  in __resolve_indirect_refs()
238 			memcpy(new_ref, ref, sizeof(*ref));  in __resolve_indirect_refs()
240 			list_add(&new_ref->list, &ref->list);  in __resolve_indirect_refs()
337 			struct btrfs_delayed_tree_ref *ref;  in __add_delayed_refs()  local
339 			ref = btrfs_delayed_node_to_tree_ref(node);  in __add_delayed_refs()
340 			ret = __add_prelim_ref(prefs, ref->root, info_key,  in __add_delayed_refs()
341 					       ref->level + 1, 0, node->bytenr,  in __add_delayed_refs()
346 			struct btrfs_delayed_tree_ref *ref;  in __add_delayed_refs()  local
348 			ref = btrfs_delayed_node_to_tree_ref(node);  in __add_delayed_refs()
349 			ret = __add_prelim_ref(prefs, ref->root, info_key,  in __add_delayed_refs()
350 					       ref->level + 1, ref->parent,  in __add_delayed_refs()
356 			struct btrfs_delayed_data_ref *ref;  in __add_delayed_refs()  local
359 			ref = btrfs_delayed_node_to_data_ref(node);  in __add_delayed_refs()
361 			key.objectid = ref->objectid;  in __add_delayed_refs()
363 			key.offset = ref->offset;  in __add_delayed_refs()
364 			ret = __add_prelim_ref(prefs, ref->root, &key, 0, 0,  in __add_delayed_refs()
370 			struct btrfs_delayed_data_ref *ref;  in __add_delayed_refs()  local
373 			ref = btrfs_delayed_node_to_data_ref(node);  in __add_delayed_refs()
375 			key.objectid = ref->objectid;  in __add_delayed_refs()
377 			key.offset = ref->offset;  in __add_delayed_refs()
378 			ret = __add_prelim_ref(prefs, ref->root, &key, 0,  in __add_delayed_refs()
379 					       ref->parent, node->bytenr,  in __add_delayed_refs()
597 	struct __prelim_ref *ref;  in find_parent_nodes()  local
683 	list_for_each_entry(ref, &prefs_delayed, list) {  in find_parent_nodes()
684 		if ((ref->key.offset | ref->key.type | ref->key.objectid) == 0)  in find_parent_nodes()
685 			memcpy(&ref->key, &info_key, sizeof(ref->key));  in find_parent_nodes()
702 		ref = list_first_entry(&prefs, struct __prelim_ref, list);  in find_parent_nodes()
703 		list_del(&ref->list);  in find_parent_nodes()
704 		if (ref->count < 0)  in find_parent_nodes()
706 		if (ref->count && ref->root_id && ref->parent == 0) {  in find_parent_nodes()
708 			ret = ulist_add(roots, ref->root_id, 0, GFP_NOFS);  in find_parent_nodes()
711 		if (ref->count && ref->parent) {  in find_parent_nodes()
712 			ret = ulist_add(refs, ref->parent, 0, GFP_NOFS);  in find_parent_nodes()
715 		kfree(ref);  in find_parent_nodes()
723 		ref = list_first_entry(&prefs, struct __prelim_ref, list);  in find_parent_nodes()
724 		list_del(&ref->list);  in find_parent_nodes()
725 		kfree(ref);  in find_parent_nodes()
728 		ref = list_first_entry(&prefs_delayed, struct __prelim_ref,  in find_parent_nodes()
730 		list_del(&ref->list);  in find_parent_nodes()
731 		kfree(ref);  in find_parent_nodes()