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);
2613 	struct btrfs_backref_edge *edge;  local
2640 	edge = btrfs_backref_alloc_edge(cache);
2641 	if (!edge)
2650 			btrfs_backref_free_edge(cache, edge);
2658 		list_add_tail(&edge->list[UPPER], &cache->pending_edge);
2663 		INIT_LIST_HEAD(&edge->list[UPPER]);
2665 	btrfs_backref_link_edge(edge, cur, upper, LINK_LOWER);
2690 	struct btrfs_backref_edge *edge;  local
2769 		edge = btrfs_backref_alloc_edge(cache);
2770 		if (!edge) {
2783 				btrfs_backref_free_edge(cache, edge);
2807 				list_add_tail(&edge->list[UPPER],
2812 				INIT_LIST_HEAD(&edge->list[UPPER]);
2818 			INIT_LIST_HEAD(&edge->list[UPPER]);
2822 		btrfs_backref_link_edge(edge, lower, upper, LINK_LOWER);
2854 	struct btrfs_backref_edge *edge;  local
2882 		edge = list_entry(cur->upper.next, struct btrfs_backref_edge,
2884 		ASSERT(list_empty(&edge->list[UPPER]));
2885 		exist = edge->node[UPPER];
2891 			list_add_tail(&edge->list[UPPER], &cache->pending_edge);
2977 	struct btrfs_backref_edge *edge;  local
2998 	list_for_each_entry(edge, &start->upper, list[LOWER])
2999 		list_add_tail(&edge->list[UPPER], &pending_edge);
3005 		edge = list_first_entry(&pending_edge,
3007 		list_del_init(&edge->list[UPPER]);
3008 		upper = edge->node[UPPER];
3009 		lower = edge->node[LOWER];
3013 			list_del(&edge->list[LOWER]);
3014 			btrfs_backref_free_edge(cache, edge);
3035 			list_add_tail(&edge->list[UPPER], &upper->lower);
3062 		list_add_tail(&edge->list[UPPER], &upper->lower);
3068 		list_for_each_entry(edge, &upper->upper, list[LOWER])
3069 			list_add_tail(&edge->list[UPPER], &pending_edge);
3079 	struct btrfs_backref_edge *edge;  local
3087 		edge = list_first_entry(&cache->pending_edge,
3089 		list_del(&edge->list[UPPER]);
3090 		list_del(&edge->list[LOWER]);
3091 		lower = edge->node[LOWER];
3092 		upper = edge->node[UPPER];
3093 		btrfs_backref_free_edge(cache, edge);
3107 		list_for_each_entry(edge, &upper->upper, list[LOWER])
3108 			list_add_tail(&edge->list[UPPER],