Lines Matching refs:SCC
13 // call-graph in SCC order: that is, they process function bottom-up, except for
33 MaxIterations("max-cg-scc-iterations", cl::ReallyHidden, cl::init(4));
35 STATISTIC(MaxSCCIterations, "Maximum CGSCCPassMgr iterations on one SCC");
62 // CGPassManager walks SCC and it needs CallGraph.
76 errs().indent(Offset*2) << "Call Graph SCC Pass Manager\n";
142 // Run pass P on all functions in the current SCC.
155 DEBUG(dbgs() << "CGSCCPASSMGR: Pass Dirtied SCC: "
177 DEBUG(dbgs() << "CGSCCPASSMGR: Refreshing SCC with " << CurSCC.size()
187 // Scan all functions in the SCC.
341 // large scc's.
347 dbgs() << "CGSCCPASSMGR: Refreshed SCC is now:\n";
355 dbgs() << "CGSCCPASSMGR: SCC Refresh didn't change call graph.\n";
364 /// specified SCC. This keeps track of whether a function pass devirtualizes
379 // Run all passes on current SCC.
384 // If we're in -debug-pass=Executions mode, construct the SCC node list,
403 // Actually run this pass on the current SCC.
418 // functionpass), refresh it before we move on to the next SCC.
430 // Walk the callgraph in bottom-up SCC order.
435 // Copy the current SCC and increment past it so that the pass can hack
436 // on the SCC if it wants to without invalidating our iterator.
442 // functions in this SCC. However, we support iterative compilation in the
457 dbgs() << " SCCPASSMGR: Re-visiting SCC, iteration #"
465 << " times, due to -max-cg-scc-iterations\n");
510 /// ReplaceNode - This informs the SCC and the pass manager that the specified
515 assert(i != Nodes.size() && "Node not in SCC");
546 // Create new Call Graph SCC Pass Manager if it does not exist.
598 bool runOnSCC(CallGraphSCC &SCC) {
600 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I)
