Cross Reference: /external/llvm/lib/Analysis/IPA/CallGraphSCCPass.cpp

Lines Matching defs:SCC
13 // call-graph in SCC order: that is, they process function bottom-up, except for
35 STATISTIC(MaxSCCIterations, "Maximum CGSCCPassMgr iterations on one SCC");
59     // CGPassManager walks SCC and it needs CallGraph.
73     errs().indent(Offset*2) << "Call Graph SCC Pass Manager\n";
139   // Run pass P on all functions in the current SCC.
152     DEBUG(dbgs() << "CGSCCPASSMGR: Pass Dirtied SCC: "
174   DEBUG(dbgs() << "CGSCCPASSMGR: Refreshing SCC with " << CurSCC.size()
184   // Scan all functions in the SCC.
344           dbgs() << "CGSCCPASSMGR: Refreshed SCC is now:\n";
352            dbgs() << "CGSCCPASSMGR: SCC Refresh didn't change call graph.\n";
361 /// specified SCC.  This keeps track of whether a function pass devirtualizes
376   // Run all passes on current SCC.
381     // If we're in -debug-pass=Executions mode, construct the SCC node list,
400     // Actually run this pass on the current SCC.
415   // functionpass), refresh it before we move on to the next SCC.
427   // Walk the callgraph in bottom-up SCC order.
432     // Copy the current SCC and increment past it so that the pass can hack
433     // on the SCC if it wants to without invalidating our iterator.
439     // functions in this SCC.  However, we support iterative compilation in the
454               dbgs() << "  SCCPASSMGR: Re-visiting SCC, iteration #"
507 /// ReplaceNode - This informs the SCC and the pass manager that the specified
512     assert(i != Nodes.size() && "Node not in SCC");
543     // Create new Call Graph SCC Pass Manager if it does not exist. 
595     bool runOnSCC(CallGraphSCC &SCC) {
597       for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I)