3069 		upper = edge->node[UPPER];  in btrfs_backref_cleanup_node()
3071 		list_del(&edge->list[UPPER]);  in btrfs_backref_cleanup_node()
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()
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()
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()
3521 		list_add_tail(&edge->list[UPPER], &pending_edge);  in btrfs_backref_finish_upper_links()
3528 				struct btrfs_backref_edge, list[UPPER]);  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()
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()
3591 			list_add_tail(&edge->list[UPPER], &pending_edge);  in btrfs_backref_finish_upper_links()
3610 				struct btrfs_backref_edge, list[UPPER]);  in btrfs_backref_error_cleanup()
3611 		list_del(&edge->list[UPPER]);  in btrfs_backref_error_cleanup()
3614 		upper = edge->node[UPPER];  in btrfs_backref_error_cleanup()
3630 			list_add_tail(&edge->list[UPPER],  in btrfs_backref_error_cleanup()