Lines Matching full:edges
149 // (1) Find the back edges in the graph doing a DFS traversal.
253 // Once all the forward edges have been visited, we know the immediate
263 // Check if the graph has back edges not dominated by their respective headers.
407 // (1): Split critical edges.
415 // Only split normal-flow edges. We cannot split exceptional edges as they
456 // TODO: Dealing with exceptional back edges could be tricky because
611 // then we visit the back edges.
1686 // phis because of missing exceptional edges in the graph. It removes the
1776 // We should not see any back edges as they would have been removed by step (3).
