2584 	struct btrfs_backref_edge *edge;  local
2586 	edge = kzalloc(sizeof(*edge), GFP_NOFS);
2587 	if (edge)
2589 	return edge;
2603 	struct btrfs_backref_edge *edge;  local
2610 		edge = list_entry(node->upper.next, struct btrfs_backref_edge,
2612 		upper = edge->node[UPPER];
2613 		list_del(&edge->list[LOWER]);
2614 		list_del(&edge->list[UPPER]);
2615 		btrfs_backref_free_edge(cache, edge);
2679 	struct btrfs_backref_edge *edge;  local
2706 	edge = btrfs_backref_alloc_edge(cache);
2707 	if (!edge)
2716 			btrfs_backref_free_edge(cache, edge);
2724 		list_add_tail(&edge->list[UPPER], &cache->pending_edge);
2729 		INIT_LIST_HEAD(&edge->list[UPPER]);
2731 	btrfs_backref_link_edge(edge, cur, upper, LINK_LOWER);
2756 	struct btrfs_backref_edge *edge;  local
2835 		edge = btrfs_backref_alloc_edge(cache);
2836 		if (!edge) {
2849 				btrfs_backref_free_edge(cache, edge);
2873 				list_add_tail(&edge->list[UPPER],
2878 				INIT_LIST_HEAD(&edge->list[UPPER]);
2884 			INIT_LIST_HEAD(&edge->list[UPPER]);
2888 		btrfs_backref_link_edge(edge, lower, upper, LINK_LOWER);
2920 	struct btrfs_backref_edge *edge;  local
2948 		edge = list_entry(cur->upper.next, struct btrfs_backref_edge,
2950 		ASSERT(list_empty(&edge->list[UPPER]));
2951 		exist = edge->node[UPPER];
2957 			list_add_tail(&edge->list[UPPER], &cache->pending_edge);
3043 	struct btrfs_backref_edge *edge;  local
3064 	list_for_each_entry(edge, &start->upper, list[LOWER])
3065 		list_add_tail(&edge->list[UPPER], &pending_edge);
3071 		edge = list_first_entry(&pending_edge,
3073 		list_del_init(&edge->list[UPPER]);
3074 		upper = edge->node[UPPER];
3075 		lower = edge->node[LOWER];
3079 			list_del(&edge->list[LOWER]);
3080 			btrfs_backref_free_edge(cache, edge);
3101 			list_add_tail(&edge->list[UPPER], &upper->lower);
3128 		list_add_tail(&edge->list[UPPER], &upper->lower);
3134 		list_for_each_entry(edge, &upper->upper, list[LOWER])
3135 			list_add_tail(&edge->list[UPPER], &pending_edge);
3145 	struct btrfs_backref_edge *edge;  local
3153 		edge = list_first_entry(&cache->pending_edge,
3155 		list_del(&edge->list[UPPER]);
3156 		list_del(&edge->list[LOWER]);
3157 		lower = edge->node[LOWER];
3158 		upper = edge->node[UPPER];
3159 		btrfs_backref_free_edge(cache, edge);
3173 		list_for_each_entry(edge, &upper->upper, list[LOWER])
3174 			list_add_tail(&edge->list[UPPER],