Lines Matching refs:Graph
81 for (auto *N : Graph) { in createAndConnectRootNode()
112 for (auto &SCC : make_range(scc_begin(&Graph), scc_end(&Graph))) { in createPiBlocks()
137 for (NodeType *N : Graph) { in createPiBlocks()
228 for (NodeType *N : Graph) { in createDefUseEdges()
282 for (DGIterator SrcIt = Graph.begin(), E = Graph.end(); SrcIt != E; ++SrcIt) { in createMemoryDependencyEdges()
393 for (NodeType *N : Graph) { in simplify()
414 for (NodeType *N : Graph) { in simplify()
489 for (NodeType *N : post_order(&Graph)) { in sortNodesTopologically()
499 size_t OldSize = Graph.Nodes.size(); in sortNodesTopologically()
500 Graph.Nodes.clear(); in sortNodesTopologically()
501 append_range(Graph.Nodes, reverse(NodesInPO)); in sortNodesTopologically()
502 if (Graph.Nodes.size() != OldSize) in sortNodesTopologically()