Lines Matching refs:CallGraphSCC
94 bool RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG,
97 bool RunPassOnSCC(Pass *P, CallGraphSCC &CurSCC,
100 bool RefreshCallGraph(CallGraphSCC &CurSCC, CallGraph &CG,
109 bool CGPassManager::RunPassOnSCC(Pass *P, CallGraphSCC &CurSCC,
143 for (CallGraphSCC::iterator I = CurSCC.begin(), E = CurSCC.end();
166 /// CallGraphSCC passes to verify that they correctly updated the callgraph.
173 bool CGPassManager::RefreshCallGraph(CallGraphSCC &CurSCC,
179 for (CallGraphSCC::iterator I = CurSCC.begin(), E = CurSCC.end();
189 for (CallGraphSCC::iterator SCCIdx = CurSCC.begin(), E = CurSCC.end();
348 for (CallGraphSCC::iterator I = CurSCC.begin(), E = CurSCC.end();
366 bool CGPassManager::RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG,
372 // CallGraphSCC Passes and other random function passes. Because other
390 for (CallGraphSCC::iterator I = CurSCC.begin(), E = CurSCC.end();
433 CallGraphSCC CurSCC(&CGI);
507 // CallGraphSCC Implementation
512 void CallGraphSCC::ReplaceNode(CallGraphNode *Old, CallGraphNode *New) {
598 bool runOnSCC(CallGraphSCC &SCC) {
600 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I)