Searched refs:SCCI (Results 1 – 5 of 5) sorted by relevance
76 for (scc_iterator<Function*> SCCI = scc_begin(&F); !SCCI.isAtEnd(); ++SCCI) { in runOnFunction() local77 const std::vector<BasicBlock *> &nextSCC = *SCCI; in runOnFunction()83 if (nextSCC.size() == 1 && SCCI.hasCycle()) in runOnFunction()97 for (scc_iterator<CallGraph*> SCCI = scc_begin(&CG); !SCCI.isAtEnd(); in runOnModule() local98 ++SCCI) { in runOnModule()99 const std::vector<CallGraphNode*> &nextSCC = *SCCI; in runOnModule()105 if (nextSCC.size() == 1 && SCCI.hasCycle()) in runOnModule()
77 for (scc_iterator<Function*> SCCI = scc_begin(&F); !SCCI.isAtEnd(); ++SCCI) { in runOnFunction() local78 const std::vector<BasicBlock *> &nextSCC = *SCCI; in runOnFunction()83 if (nextSCC.size() == 1 && SCCI.hasLoop()) in runOnFunction()97 for (scc_iterator<CallGraph*> SCCI = scc_begin(&CG); !SCCI.isAtEnd(); in runOnModule() local98 ++SCCI) { in runOnModule()99 const std::vector<CallGraphNode*> &nextSCC = *SCCI; in runOnModule()105 if (nextSCC.size() == 1 && SCCI.hasLoop()) in runOnModule()
264 for (llvm::scc_iterator<CallGraph *> SCCI = llvm::scc_begin(&CG), in check() local266 SCCI != SCCE; ++SCCI) { in check()267 if (!SCCI.hasCycle()) // We only care about cycles, not standalone nodes. in check()269 handleSCC(*SCCI); in check()
386 for (auto SCCI = in INITIALIZE_PASS_DEPENDENCY() local389 !SCCI.isAtEnd(); ++SCCI) { in INITIALIZE_PASS_DEPENDENCY()390 auto &SCC = *SCCI; in INITIALIZE_PASS_DEPENDENCY()
2258 for (scc_iterator<Function *> SCCI = scc_begin(&F); !SCCI.isAtEnd(); ++SCCI) in mayContainUnboundedCycle() local2259 if (SCCI.hasCycle()) in mayContainUnboundedCycle()