3041 	struct btrfs_backref_edge *edge;  in btrfs_backref_alloc_edge()  local
3043 	edge = kzalloc(sizeof(*edge), GFP_NOFS);  in btrfs_backref_alloc_edge()
3044 	if (edge)  in btrfs_backref_alloc_edge()
3046 	return edge;  in btrfs_backref_alloc_edge()
3060 	struct btrfs_backref_edge *edge;  in btrfs_backref_cleanup_node()  local
3067 		edge = list_entry(node->upper.next, struct btrfs_backref_edge,  in btrfs_backref_cleanup_node()
3069 		upper = edge->node[UPPER];  in btrfs_backref_cleanup_node()
3070 		list_del(&edge->list[LOWER]);  in btrfs_backref_cleanup_node()
3071 		list_del(&edge->list[UPPER]);  in btrfs_backref_cleanup_node()
3072 		btrfs_backref_free_edge(cache, edge);  in btrfs_backref_cleanup_node()
3136 	struct btrfs_backref_edge *edge;  in handle_direct_tree_backref()  local
3163 	edge = btrfs_backref_alloc_edge(cache);  in handle_direct_tree_backref()
3164 	if (!edge)  in handle_direct_tree_backref()
3173 			btrfs_backref_free_edge(cache, edge);  in handle_direct_tree_backref()
3181 		list_add_tail(&edge->list[UPPER], &cache->pending_edge);  in handle_direct_tree_backref()
3186 		INIT_LIST_HEAD(&edge->list[UPPER]);  in handle_direct_tree_backref()
3188 	btrfs_backref_link_edge(edge, cur, upper, LINK_LOWER);  in handle_direct_tree_backref()
3215 	struct btrfs_backref_edge *edge;  in handle_indirect_tree_backref()  local
3294 		edge = btrfs_backref_alloc_edge(cache);  in handle_indirect_tree_backref()
3295 		if (!edge) {  in handle_indirect_tree_backref()
3308 				btrfs_backref_free_edge(cache, edge);  in handle_indirect_tree_backref()
3332 				list_add_tail(&edge->list[UPPER],  in handle_indirect_tree_backref()
3337 				INIT_LIST_HEAD(&edge->list[UPPER]);  in handle_indirect_tree_backref()
3343 			INIT_LIST_HEAD(&edge->list[UPPER]);  in handle_indirect_tree_backref()
3347 		btrfs_backref_link_edge(edge, lower, upper, LINK_LOWER);  in handle_indirect_tree_backref()
3380 	struct btrfs_backref_edge *edge;  in btrfs_backref_add_tree_node()  local
3408 		edge = list_entry(cur->upper.next, struct btrfs_backref_edge,  in btrfs_backref_add_tree_node()
3410 		ASSERT(list_empty(&edge->list[UPPER]));  in btrfs_backref_add_tree_node()
3411 		exist = edge->node[UPPER];  in btrfs_backref_add_tree_node()
3417 			list_add_tail(&edge->list[UPPER], &cache->pending_edge);  in btrfs_backref_add_tree_node()
3499 	struct btrfs_backref_edge *edge;  in btrfs_backref_finish_upper_links()  local
3520 	list_for_each_entry(edge, &start->upper, list[LOWER])  in btrfs_backref_finish_upper_links()
3521 		list_add_tail(&edge->list[UPPER], &pending_edge);  in btrfs_backref_finish_upper_links()
3527 		edge = list_first_entry(&pending_edge,  in btrfs_backref_finish_upper_links()
3529 		list_del_init(&edge->list[UPPER]);  in btrfs_backref_finish_upper_links()
3530 		upper = edge->node[UPPER];  in btrfs_backref_finish_upper_links()
3531 		lower = edge->node[LOWER];  in btrfs_backref_finish_upper_links()
3535 			list_del(&edge->list[LOWER]);  in btrfs_backref_finish_upper_links()
3536 			btrfs_backref_free_edge(cache, edge);  in btrfs_backref_finish_upper_links()
3557 			list_add_tail(&edge->list[UPPER], &upper->lower);  in btrfs_backref_finish_upper_links()
3584 		list_add_tail(&edge->list[UPPER], &upper->lower);  in btrfs_backref_finish_upper_links()
3590 		list_for_each_entry(edge, &upper->upper, list[LOWER])  in btrfs_backref_finish_upper_links()
3591 			list_add_tail(&edge->list[UPPER], &pending_edge);  in btrfs_backref_finish_upper_links()
3601 	struct btrfs_backref_edge *edge;  in btrfs_backref_error_cleanup()  local
3609 		edge = list_first_entry(&cache->pending_edge,  in btrfs_backref_error_cleanup()
3611 		list_del(&edge->list[UPPER]);  in btrfs_backref_error_cleanup()
3612 		list_del(&edge->list[LOWER]);  in btrfs_backref_error_cleanup()
3613 		lower = edge->node[LOWER];  in btrfs_backref_error_cleanup()
3614 		upper = edge->node[UPPER];  in btrfs_backref_error_cleanup()
3615 		btrfs_backref_free_edge(cache, edge);  in btrfs_backref_error_cleanup()
3629 		list_for_each_entry(edge, &upper->upper, list[LOWER])  in btrfs_backref_error_cleanup()
3630 			list_add_tail(&edge->list[UPPER],  in btrfs_backref_error_cleanup()