2775 		upper = edge->node[UPPER];  in btrfs_backref_cleanup_node()
2777 		list_del(&edge->list[UPPER]);  in btrfs_backref_cleanup_node()
2887 		list_add_tail(&edge->list[UPPER], &cache->pending_edge);  in handle_direct_tree_backref()
2892 		INIT_LIST_HEAD(&edge->list[UPPER]);  in handle_direct_tree_backref()
3036 				list_add_tail(&edge->list[UPPER],  in handle_indirect_tree_backref()
3041 				INIT_LIST_HEAD(&edge->list[UPPER]);  in handle_indirect_tree_backref()
3047 			INIT_LIST_HEAD(&edge->list[UPPER]);  in handle_indirect_tree_backref()
3113 		ASSERT(list_empty(&edge->list[UPPER]));  in btrfs_backref_add_tree_node()
3114 		exist = edge->node[UPPER];  in btrfs_backref_add_tree_node()
3120 			list_add_tail(&edge->list[UPPER], &cache->pending_edge);  in btrfs_backref_add_tree_node()
3228 		list_add_tail(&edge->list[UPPER], &pending_edge);  in btrfs_backref_finish_upper_links()
3235 				struct btrfs_backref_edge, list[UPPER]);  in btrfs_backref_finish_upper_links()
3236 		list_del_init(&edge->list[UPPER]);  in btrfs_backref_finish_upper_links()
3237 		upper = edge->node[UPPER];  in btrfs_backref_finish_upper_links()
3264 			list_add_tail(&edge->list[UPPER], &upper->lower);  in btrfs_backref_finish_upper_links()
3291 		list_add_tail(&edge->list[UPPER], &upper->lower);  in btrfs_backref_finish_upper_links()
3298 			list_add_tail(&edge->list[UPPER], &pending_edge);  in btrfs_backref_finish_upper_links()
3317 				struct btrfs_backref_edge, list[UPPER]);  in btrfs_backref_error_cleanup()
3318 		list_del(&edge->list[UPPER]);  in btrfs_backref_error_cleanup()
3321 		upper = edge->node[UPPER];  in btrfs_backref_error_cleanup()
3337 			list_add_tail(&edge->list[UPPER],  in btrfs_backref_error_cleanup()