Home
last modified time | relevance | path

Searched refs:expr_end (Results 1 – 8 of 8) sorted by relevance

/llvm-project/bolt/lib/Passes/
H A DStackReachingUses.cpp23 for (auto I = Candidates; I != expr_end(); ++I) { in isLoadedInDifferentReg()
39 for (auto I = Candidates; I != expr_end(); ++I) { in isStoreUsed()
107 for (auto I = expr_begin(Next), E = expr_end(); I != E; ++I) { in computeNext()
H A DValidateInternalCalls.cpp152 for (auto I = RI.expr_begin(Return), E = RI.expr_end(); I != E; ++I) { in fixCFGForIC()
263 E = RU.expr_end(); in analyzeFunction()
H A DStackAvailableExpressions.cpp114 for (auto I = expr_begin(Next), E = expr_end(); I != E; ++I) { in computeNext()
H A DFrameOptimizer.cpp65 const auto ExprEnd = SAE.expr_end(); in removeUnnecessaryLoads()
178 I != SRU.expr_end(); ++I) { in removeUnusedStores()
H A DStackAllocationAnalysis.cpp64 for (auto I = this->expr_begin(Next), E = this->expr_end(); I != E; ++I) { in doKill()
/llvm-project/bolt/include/bolt/Passes/
H A DReachingDefOrUse.h42 for (auto I = Candidates; I != this->expr_end(); ++I) { in isReachedBy()
118 for (auto I = this->expr_begin(Next), E = this->expr_end(); I != E; ++I) { in computeNext()
H A DDominatorAnalysis.h97 for (auto I = this->expr_begin(Inst), E = this->expr_end(); I != E; ++I) in doForAllDominators()
H A DDataflowAnalysis.h493 return expr_end(); in expr_begin()
498 ExprIterator expr_end() const { in expr_end() function