Lines Matching refs:SCC
43 // runOnSCC - Analyze the SCC, performing the transformation if possible.
44 bool runOnSCC(CallGraphSCC &SCC);
61 bool PruneEH::runOnSCC(CallGraphSCC &SCC) {
66 // Fill SCCNodes with the elements of the SCC. Used for quickly
67 // looking up whether a given CallGraphNode is in this SCC.
68 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I)
71 // First pass, scan all of the functions in the SCC, simplifying them
73 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I)
78 // functions in this SCC: if so, we cannot prune any functions in this SCC.
81 // If this SCC includes the unwind instruction, we KNOW it throws, so
82 // obviously the SCC might throw.
85 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end();
120 // If the callee is outside our current SCC then we may
137 // If the SCC doesn't unwind or doesn't throw, note this fact.
139 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) {
158 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) {
