Searched refs:isAtEnd (Results 1 – 19 of 19) sorted by relevance
76 for (scc_iterator<Function*> SCCI = scc_begin(&F); !SCCI.isAtEnd(); ++SCCI) { in runOnFunction()97 for (scc_iterator<CallGraph*> SCCI = scc_begin(&CG); !SCCI.isAtEnd(); in runOnModule()
594 if (isAtEnd() || Other.isAtEnd())595 return isAtEnd() && Other.isAtEnd();619 bool isAtEnd() const { return !Doc || !*Doc; } in isAtEnd() function
625 if (isAtEnd()) { in Lex()653 if (!isAtEnd() && Macro && in Lex()930 if (isAtEnd()) in isNextTokenLParen()938 return Tokens[NumTokens-1].is(tok::eod) && !isAtEnd(); in isParsingPreprocessorDirective()
92 for (auto I = scc_begin(CG); !I.isAtEnd(); ++I) in propagate()
80 for (auto I = scc_begin(CG.get()); !I.isAtEnd(); ++I) { in MLInlineAdvisor()
476 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) { in CollectSCCMembership()494 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) { in AnalyzeCallGraph()
517 while (!CGI.isAtEnd()) { in runOnModule()
797 for (auto I = scc_begin(G); !I.isAtEnd(); ++I) { in analyzeIrreducible()
149 for (scc_iterator<const Function *> It = scc_begin(&F); !It.isAtEnd(); in SccInfo()
159 bool isAtEnd() const { in isAtEnd() function
108 bool isAtEnd() const { in isAtEnd() function
50 while (!I.isAtEnd()) { in buildTopDownOrder()
263 for (auto Scc = scc_begin(G); !Scc.isAtEnd(); ++Scc) { in makeReducible()
776 for (scc_iterator<ArgumentGraph *> I = scc_begin(&AG); !I.isAtEnd(); ++I) { in addArgumentAttrs()1778 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) { in deduceFunctionAttributeInRPO()
1725 while (!CGI.isAtEnd()) { in buildFunctionOrder()1735 while (!CGI.isAtEnd()) { in buildFunctionOrder()
2256 for (scc_iterator<Function *> SCCI = scc_begin(&F); !SCCI.isAtEnd(); ++SCCI) in mayContainUnboundedCycle()
352 !I.isAtEnd(); ++I) { in dumpSCCs()
389 !SCCI.isAtEnd(); ++SCCI) { in INITIALIZE_PASS_DEPENDENCY()
855 for (scc_iterator<MachineFunction *> It = scc_begin(MF); !It.isAtEnd(); in orderBlocks()