Lines Matching refs:SCC
12 // call-graph in SCC order: that is, they process function bottom-up, except for
48 STATISTIC(MaxSCCIterations, "Maximum CGSCCPassMgr iterations on one SCC");
75 // CGPassManager walks SCC and it needs CallGraph.
87 errs().indent(Offset*2) << "Call Graph SCC Pass Manager\n";
171 // Run pass P on all functions in the current SCC.
186 LLVM_DEBUG(dbgs() << "CGSCCPASSMGR: Pass Dirtied SCC: " << P->getPassName()
206 LLVM_DEBUG(dbgs() << "CGSCCPASSMGR: Refreshing SCC with " << CurSCC.size()
214 // Scan all functions in the SCC.
416 dbgs() << "CGSCCPASSMGR: Refreshed SCC is now:\n";
422 dbgs() << "CGSCCPASSMGR: SCC Refresh didn't change call graph.\n";
429 /// Execute the body of the entire pass manager on the specified SCC.
445 // Run all passes on current SCC.
450 // If we're in -debug-pass=Executions mode, construct the SCC node list,
469 // Actually run this pass on the current SCC.
484 // functionpass), refresh it before we move on to the next SCC.
496 // Walk the callgraph in bottom-up SCC order.
501 // Copy the current SCC and increment past it so that the pass can hack
502 // on the SCC if it wants to without invalidating our iterator.
508 // functions in this SCC. However, we support iterative compilation in the
523 << " SCCPASSMGR: Re-visiting SCC, iteration #" << Iteration
574 /// This informs the SCC and the pass manager that the specified
579 assert(i != Nodes.size() && "Node not in SCC");
616 // Create new Call Graph SCC Pass Manager if it does not exist.
669 bool runOnSCC(CallGraphSCC &SCC) override {
682 SCC.getCallGraph().getModule().print(OS, nullptr);
686 for (CallGraphNode *CGN : SCC) {
703 SCC.getCallGraph().getModule().print(OS, nullptr);
720 static std::string getDescription(const CallGraphSCC &SCC) {
721 std::string Desc = "SCC (";
723 for (CallGraphNode *CGN : SCC) {
738 bool CallGraphSCCPass::skipSCC(CallGraphSCC &SCC) const {
740 SCC.getCallGraph().getModule().getContext().getOptPassGate();
741 return Gate.isEnabled() && !Gate.shouldRunPass(this, getDescription(SCC));