/external/llvm/include/llvm/Transforms/Utils/ |
SimplifyIndVar.h | 12 // simplify a loop's induction variables based on ScalarEvolution. 31 class ScalarEvolution; 43 /// by using ScalarEvolution to analyze the IV's recurrence. 44 bool simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, LPPassManager *LPM, 49 bool simplifyLoopIVs(Loop *L, ScalarEvolution *SE, LPPassManager *LPM,
|
/external/llvm/include/llvm/Analysis/ |
ScalarEvolutionNormalization.h | 10 // This file defines utilities for working with "normalized" ScalarEvolution 46 class ScalarEvolution; 73 ScalarEvolution &SE,
|
ScalarEvolutionExpressions.h | 17 #include "llvm/Analysis/ScalarEvolution.h" 37 friend class ScalarEvolution; 83 friend class ScalarEvolution; 101 friend class ScalarEvolution; 119 friend class ScalarEvolution; 139 // Since SCEVs are immutable, ScalarEvolution allocates operand 209 friend class ScalarEvolution; 235 friend class ScalarEvolution; 255 friend class ScalarEvolution; 268 // crazy cases one or the other may be a pointer. ScalarEvolution doesn' [all...] |
LoopDependenceAnalysis.h | 33 class ScalarEvolution; 40 ScalarEvolution *SE;
|
IVUsers.h | 28 class ScalarEvolution; 125 ScalarEvolution *SE;
|
ScalarEvolution.h | 1 //===- llvm/Analysis/ScalarEvolution.h - Scalar Evolution -------*- C++ -*-===// 10 // The ScalarEvolution class is an LLVM pass which can be used to analyze and 42 class ScalarEvolution; 61 /// The ScalarEvolution's BumpPtrAllocator holds the data. 169 /// ScalarEvolution - This class is the main scalar evolution driver. Because 173 class ScalarEvolution : public FunctionPass { 192 /// visible in the ScalarEvolution name space. 206 /// SCEVCallbackVH - A CallbackVH to arrange for ScalarEvolution to be 209 ScalarEvolution *SE; 213 SCEVCallbackVH(Value *V, ScalarEvolution *SE = 0) [all...] |
ScalarEvolutionExpander.h | 34 ScalarEvolution &SE; 88 explicit SCEVExpander(ScalarEvolution &se, const char *name)
|
/external/llvm/lib/Transforms/Scalar/ |
LoopUnrollPass.cpp | 20 #include "llvm/Analysis/ScalarEvolution.h" 91 AU.addRequired<ScalarEvolution>(); 92 AU.addPreserved<ScalarEvolution>(); 107 INITIALIZE_PASS_DEPENDENCY(ScalarEvolution) 135 ScalarEvolution *SE = &getAnalysis<ScalarEvolution>();
|
LoopDeletion.cpp | 21 #include "llvm/Analysis/ScalarEvolution.h" 46 AU.addRequired<ScalarEvolution>(); 50 AU.addPreserved<ScalarEvolution>(); 64 INITIALIZE_PASS_DEPENDENCY(ScalarEvolution) 166 ScalarEvolution& SE = getAnalysis<ScalarEvolution>(); 179 // Tell ScalarEvolution that the loop is deleted. Do this before 180 // deleting the loop so that ScalarEvolution can look at the loop
|
LoopIdiomRecognize.cpp | 70 ScalarEvolution *SE; 107 AU.addRequired<ScalarEvolution>(); 108 AU.addPreserved<ScalarEvolution>(); 123 INITIALIZE_PASS_DEPENDENCY(ScalarEvolution) 135 static void deleteDeadInstruction(Instruction *I, ScalarEvolution &SE) { 167 static void deleteIfDeadInstruction(Value *V, ScalarEvolution &SE) { 182 SE = &getAnalysis<ScalarEvolution>();
|
LoopRotation.cpp | 21 #include "llvm/Analysis/ScalarEvolution.h" 52 AU.addPreserved<ScalarEvolution>(); 296 // Anything ScalarEvolution may know about this loop or the PHI nodes 298 if (ScalarEvolution *SE = getAnalysisIfAvailable<ScalarEvolution>())
|
IndVarSimplify.cpp | 63 cl::desc("Verify the ScalarEvolution result after running indvars")); 68 ScalarEvolution *SE; 87 AU.addRequired<ScalarEvolution>(); 90 AU.addPreserved<ScalarEvolution>(); 122 INITIALIZE_PASS_DEPENDENCY(ScalarEvolution) 455 // If the loop previously had floating-point IV, ScalarEvolution 507 // It's necessary to tell ScalarEvolution about this explicitly so that 597 ScalarEvolution *SE; 603 WideIVVisitor(PHINode *NarrowIV, ScalarEvolution *SCEV, 669 ScalarEvolution *SE [all...] |
LoopStrengthReduce.cpp | 243 void InitialMatch(const SCEV *S, Loop *L, ScalarEvolution &SE); 264 ScalarEvolution &SE) { 319 void Formula::InitialMatch(const SCEV *S, Loop *L, ScalarEvolution &SE) { 423 static bool isAddRecSExtable(const SCEVAddRecExpr *AR, ScalarEvolution &SE) { 431 static bool isAddSExtable(const SCEVAddExpr *A, ScalarEvolution &SE) { 439 static bool isMulSExtable(const SCEVMulExpr *M, ScalarEvolution &SE) { 453 ScalarEvolution &SE, 463 // Handle x /s -1 as x * -1, to give ScalarEvolution a chance to do 544 static int64_t ExtractImmediate(const SCEV *&S, ScalarEvolution &SE) { 571 static GlobalValue *ExtractSymbol(const SCEV *&S, ScalarEvolution &SE) [all...] |
/external/llvm/lib/Analysis/ |
ScalarEvolutionAliasAnalysis.cpp | 11 // simple alias analysis implemented in terms of ScalarEvolution queries. 17 // ScalarEvolution has a more complete understanding of pointer arithmetic 30 /// implementation that uses ScalarEvolution to answer queries. 33 ScalarEvolution *SE; 64 "ScalarEvolution-based Alias Analysis", false, true, false) 65 INITIALIZE_PASS_DEPENDENCY(ScalarEvolution) 67 "ScalarEvolution-based Alias Analysis", false, true, false) 75 AU.addRequiredTransitive<ScalarEvolution>(); 83 SE = &getAnalysis<ScalarEvolution>(); 157 // If ScalarEvolution can find an underlying object, form a new query [all...] |
ScalarEvolution.cpp | 1 //===- ScalarEvolution.cpp - Scalar Evolution Analysis ----------*- C++ -*-===// 108 INITIALIZE_PASS_BEGIN(ScalarEvolution, "scalar-evolution", 113 INITIALIZE_PASS_END(ScalarEvolution, "scalar-evolution", 115 char ScalarEvolution::ID = 0; 306 const SCEV *ScalarEvolution::getConstant(ConstantInt *V) { 317 const SCEV *ScalarEvolution::getConstant(const APInt& Val) { 322 ScalarEvolution::getConstant(Type *Ty, uint64_t V, bool isSigned) { 673 ScalarEvolution &SE, 792 ScalarEvolution &SE) const { 811 const SCEV *ScalarEvolution::getTruncateExpr(const SCEV *Op [all...] |
Android.mk | 54 ScalarEvolution.cpp \
|
IVUsers.cpp | 37 INITIALIZE_PASS_DEPENDENCY(ScalarEvolution) 49 ScalarEvolution *SE, LoopInfo *LI) { 221 AU.addRequired<ScalarEvolution>(); 230 SE = &getAnalysis<ScalarEvolution>();
|
LoopDependenceAnalysis.cpp | 28 #include "llvm/Analysis/ScalarEvolution.h" 53 INITIALIZE_PASS_DEPENDENCY(ScalarEvolution) 105 static inline const SCEV *GetZeroSCEV(ScalarEvolution *SE) { 317 SE = &getAnalysis<ScalarEvolution>(); 329 AU.addRequiredTransitive<ScalarEvolution>();
|
ScalarEvolutionNormalization.cpp | 70 ScalarEvolution &SE; 77 ScalarEvolution &se, DominatorTree &dt): 130 // This assert is conceptually correct, but ScalarEvolution currently 219 ScalarEvolution &SE,
|
/external/llvm/lib/Transforms/Utils/ |
SimplifyIndVar.cpp | 12 // simplify a loop's induction variables based on ScalarEvolution. 41 /// based on ScalarEvolution. It is the primary instrument of the 48 ScalarEvolution *SE; 56 SimplifyIndvar(Loop *Loop, ScalarEvolution *SE, LPPassManager *LPM, 294 static bool isSimpleIVUser(Instruction *I, const Loop *L, ScalarEvolution *SE) { 374 /// by using ScalarEvolution to analyze the IV's recurrence. 375 bool simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, LPPassManager *LPM, 386 bool simplifyLoopIVs(Loop *L, ScalarEvolution *SE, LPPassManager *LPM,
|
LoopUnroll.cpp | 26 #include "llvm/Analysis/ScalarEvolution.h" 97 // ScalarEvolution holds references to loop exit blocks. 98 if (ScalarEvolution *SE = LPM->getAnalysisIfAvailable<ScalarEvolution>()) { 135 /// This utility preserves LoopInfo. If DominatorTree or ScalarEvolution are 205 // Notify ScalarEvolution that the loop will be substantially changed, 207 ScalarEvolution *SE = LPM->getAnalysisIfAvailable<ScalarEvolution>();
|
LoopUnrollRuntime.cpp | 30 #include "llvm/Analysis/ScalarEvolution.h" 240 ScalarEvolution *SE = LPM->getAnalysisIfAvailable<ScalarEvolution>();
|
LoopSimplify.cpp | 52 #include "llvm/Analysis/ScalarEvolution.h" 78 ScalarEvolution *SE; 91 AU.addPreserved<ScalarEvolution>(); 132 SE = getAnalysisIfAvailable<ScalarEvolution>(); 330 // ScalarEvolution. Currently assume the parent loop doesn't change 567 // If ScalarEvolution is around and knows anything about values in
|
LCSSA.cpp | 38 #include "llvm/Analysis/ScalarEvolution.h" 72 AU.addPreserved<ScalarEvolution>();
|
/external/llvm/include/llvm/ |
LinkAllPasses.h | 26 #include "llvm/Analysis/ScalarEvolution.h" 159 (void)new llvm::ScalarEvolution();
|