2518 	struct btrfs_backref_edge *edge;  local
2520 	edge = kzalloc(sizeof(*edge), GFP_NOFS);
2521 	if (edge)
2523 	return edge;
2537 	struct btrfs_backref_edge *edge;  local
2544 		edge = list_entry(node->upper.next, struct btrfs_backref_edge,
2546 		upper = edge->node[UPPER];
2547 		list_del(&edge->list[LOWER]);
2548 		list_del(&edge->list[UPPER]);
2549 		btrfs_backref_free_edge(cache, edge);
2620 	struct btrfs_backref_edge *edge;  local
2647 	edge = btrfs_backref_alloc_edge(cache);
2648 	if (!edge)
2657 			btrfs_backref_free_edge(cache, edge);
2665 		list_add_tail(&edge->list[UPPER], &cache->pending_edge);
2670 		INIT_LIST_HEAD(&edge->list[UPPER]);
2672 	btrfs_backref_link_edge(edge, cur, upper, LINK_LOWER);
2697 	struct btrfs_backref_edge *edge;  local
2776 		edge = btrfs_backref_alloc_edge(cache);
2777 		if (!edge) {
2790 				btrfs_backref_free_edge(cache, edge);
2814 				list_add_tail(&edge->list[UPPER],
2819 				INIT_LIST_HEAD(&edge->list[UPPER]);
2825 			INIT_LIST_HEAD(&edge->list[UPPER]);
2829 		btrfs_backref_link_edge(edge, lower, upper, LINK_LOWER);
2861 	struct btrfs_backref_edge *edge;  local
2889 		edge = list_entry(cur->upper.next, struct btrfs_backref_edge,
2891 		ASSERT(list_empty(&edge->list[UPPER]));
2892 		exist = edge->node[UPPER];
2898 			list_add_tail(&edge->list[UPPER], &cache->pending_edge);
2984 	struct btrfs_backref_edge *edge;  local
3005 	list_for_each_entry(edge, &start->upper, list[LOWER])
3006 		list_add_tail(&edge->list[UPPER], &pending_edge);
3012 		edge = list_first_entry(&pending_edge,
3014 		list_del_init(&edge->list[UPPER]);
3015 		upper = edge->node[UPPER];
3016 		lower = edge->node[LOWER];
3020 			list_del(&edge->list[LOWER]);
3021 			btrfs_backref_free_edge(cache, edge);
3042 			list_add_tail(&edge->list[UPPER], &upper->lower);
3069 		list_add_tail(&edge->list[UPPER], &upper->lower);
3075 		list_for_each_entry(edge, &upper->upper, list[LOWER])
3076 			list_add_tail(&edge->list[UPPER], &pending_edge);
3086 	struct btrfs_backref_edge *edge;  local
3094 		edge = list_first_entry(&cache->pending_edge,
3096 		list_del(&edge->list[UPPER]);
3097 		list_del(&edge->list[LOWER]);
3098 		lower = edge->node[LOWER];
3099 		upper = edge->node[UPPER];
3100 		btrfs_backref_free_edge(cache, edge);
3114 		list_for_each_entry(edge, &upper->upper, list[LOWER])
3115 			list_add_tail(&edge->list[UPPER],