lib/Analysis/CallGraphSCCPass.cpp

13 // call-graph in SCC order: that is, they process function bottom-up, except for
37 STATISTIC(MaxSCCIterations, "Maximum CGSCCPassMgr iterations on one SCC");
64     // CGPassManager walks SCC and it needs CallGraph.
78     errs().indent(Offset*2) << "Call Graph SCC Pass Manager\n";
144   // Run pass P on all functions in the current SCC.
159     DEBUG(dbgs() << "CGSCCPASSMGR: Pass Dirtied SCC: "
181   DEBUG(dbgs() << "CGSCCPASSMGR: Refreshing SCC with " << CurSCC.size()
190   // Scan all functions in the SCC.
362           dbgs() << "CGSCCPASSMGR: Refreshed SCC is now:\n";
369            dbgs() << "CGSCCPASSMGR: SCC Refresh didn't change call graph.\n";
377 /// Execute the body of the entire pass manager on the specified SCC.
393   // Run all passes on current SCC.
398     // If we're in -debug-pass=Executions mode, construct the SCC node list,
417     // Actually run this pass on the current SCC.
432   // functionpass), refresh it before we move on to the next SCC.
444   // Walk the callgraph in bottom-up SCC order.
449     // Copy the current SCC and increment past it so that the pass can hack
450     // on the SCC if it wants to without invalidating our iterator.
456     // functions in this SCC.  However, we support iterative compilation in the
471               dbgs() << "  SCCPASSMGR: Re-visiting SCC, iteration #"
524 /// This informs the SCC and the pass manager that the specified
529     assert(i != Nodes.size() && "Node not in SCC");
560     // Create new Call Graph SCC Pass Manager if it does not exist.
612     bool runOnSCC(CallGraphSCC &SCC) override {
614       for (CallGraphNode *CGN : SCC) {