Searched refs:isAtEnd (Results 1 – 19 of 19) sorted by relevance
599 if (isAtEnd() || Other.isAtEnd())600 return isAtEnd() && Other.isAtEnd();624 bool isAtEnd() const { return !Doc || !*Doc; } in isAtEnd() function
19 for (scc_iterator<Function *> SCCI = scc_begin(&F); !SCCI.isAtEnd(); ++SCCI) { in run()
89 for (auto I = scc_begin(CG); !I.isAtEnd(); ++I) in propagate()
317 for (scc_iterator<CallGraph *> SCCI = scc_begin(&CG); !SCCI.isAtEnd(); in run()
480 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) { in CollectSCCMembership()498 for (scc_iterator<CallGraph *> I = scc_begin(&CG); !I.isAtEnd(); ++I) { in AnalyzeCallGraph()
509 while (!CGI.isAtEnd()) { in runOnModule()
158 for (auto I = scc_begin(&CGraph); !I.isAtEnd(); ++I) { in MLInlineAdvisor()
787 for (auto I = scc_begin(G); !I.isAtEnd(); ++I) { in analyzeIrreducible()
222 for (scc_iterator<const Function *> It = scc_begin(&F); !It.isAtEnd(); in SccInfo()
159 bool isAtEnd() const { in isAtEnd() function
624 if (isAtEnd()) { in Lex()652 if (!isAtEnd() && Macro && in Lex()929 if (isAtEnd()) in isNextTokenLParen()937 return Tokens[NumTokens-1].is(tok::eod) && !isAtEnd(); in isParsingPreprocessorDirective()
269 for (auto Scc = scc_begin(G); !Scc.isAtEnd(); ++Scc) { in makeReducible()
113 bool isAtEnd() const { in isAtEnd() function
370 !I.isAtEnd(); ++I) { in dumpSCCs()
479 for (scc_iterator<ModuleSummaryIndex *> I = scc_begin(&Index); !I.isAtEnd(); in thinLTOPropagateFunctionAttrs()949 for (scc_iterator<ArgumentGraph *> I = scc_begin(&AG); !I.isAtEnd(); ++I) { in addArgumentAttrs()
1926 while (!CGI.isAtEnd()) { in buildFunctionOrder()
3255 for (scc_iterator<Function *> SCCI = scc_begin(&F); !SCCI.isAtEnd(); ++SCCI) in mayContainUnboundedCycle()
396 !SCCI.isAtEnd(); ++SCCI) { in INITIALIZE_PASS_DEPENDENCY()
850 for (scc_iterator<MachineFunction *> It = scc_begin(MF); !It.isAtEnd(); in orderBlocks()