3131 		list_del(&edge->list[UPPER]);  in btrfs_backref_cleanup_node()
3161 	edge->node[UPPER] = upper;  in btrfs_backref_link_edge()
3225 		list_add_tail(&edge->list[UPPER], &cache->pending_edge);  in handle_direct_tree_backref()
3230 		INIT_LIST_HEAD(&edge->list[UPPER]);  in handle_direct_tree_backref()
3387 				list_add_tail(&edge->list[UPPER],  in handle_indirect_tree_backref()
3392 				INIT_LIST_HEAD(&edge->list[UPPER]);  in handle_indirect_tree_backref()
3398 			INIT_LIST_HEAD(&edge->list[UPPER]);  in handle_indirect_tree_backref()
3465 		ASSERT(list_empty(&edge->list[UPPER]));  in btrfs_backref_add_tree_node()
3466 		exist = edge->node[UPPER];  in btrfs_backref_add_tree_node()
3472 			list_add_tail(&edge->list[UPPER], &cache->pending_edge);  in btrfs_backref_add_tree_node()
3570 		list_add_tail(&edge->list[UPPER], &pending_edge);  in btrfs_backref_finish_upper_links()
3577 				struct btrfs_backref_edge, list[UPPER]);  in btrfs_backref_finish_upper_links()
3578 		list_del_init(&edge->list[UPPER]);  in btrfs_backref_finish_upper_links()
3579 		upper = edge->node[UPPER];  in btrfs_backref_finish_upper_links()
3601 			list_add_tail(&edge->list[UPPER], &upper->lower);  in btrfs_backref_finish_upper_links()
3615 		list_add_tail(&edge->list[UPPER], &upper->lower);  in btrfs_backref_finish_upper_links()
3622 			list_add_tail(&edge->list[UPPER], &pending_edge);  in btrfs_backref_finish_upper_links()
3641 				struct btrfs_backref_edge, list[UPPER]);  in btrfs_backref_error_cleanup()
3642 		list_del(&edge->list[UPPER]);  in btrfs_backref_error_cleanup()
3645 		upper = edge->node[UPPER];  in btrfs_backref_error_cleanup()
3661 			list_add_tail(&edge->list[UPPER],  in btrfs_backref_error_cleanup()