Home
last modified time | relevance | path

Searched refs:ScalarEvolution (Results 1 – 25 of 214) sorted by relevance

123456789

/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DDelinearization.h25 class ScalarEvolution; variable
31 void findArrayDimensions(ScalarEvolution &SE,
38 void collectParametricTerms(ScalarEvolution &SE, const SCEV *Expr,
43 void computeAccessFunctions(ScalarEvolution &SE, const SCEV *Expr,
110 void delinearize(ScalarEvolution &SE, const SCEV *Expr,
123 bool getIndexExpressionsFromGEP(ScalarEvolution &SE,
134 bool tryDelinearizeFixedSizeImpl(ScalarEvolution *SE, Instruction *Inst,
H A DScalarEvolutionExpressions.h61 friend class ScalarEvolution; variable
119 friend class ScalarEvolution; variable
145 friend class ScalarEvolution; variable
157 friend class ScalarEvolution; variable
171 friend class ScalarEvolution; variable
258 friend class ScalarEvolution; variable
282 friend class ScalarEvolution; variable
296 friend class ScalarEvolution; variable
343 friend class ScalarEvolution; variable
577 ScalarEvolution *SE;
[all …]
H A DLoopNestAnalysis.h33 LoopNest(Loop &Root, ScalarEvolution &SE);
38 static std::unique_ptr<LoopNest> getLoopNest(Loop &Root, ScalarEvolution &SE);
52 ScalarEvolution &SE);
58 ScalarEvolution &SE);
69 static unsigned getMaxPerfectDepth(const Loop &Root, ScalarEvolution &SE);
144 SmallVector<LoopVectorTy, 4> getPerfectLoops(ScalarEvolution &SE) const;
195 ScalarEvolution &SE);
H A DScalarEvolutionNormalization.h44 class ScalarEvolution; variable
55 ScalarEvolution &SE);
60 ScalarEvolution &SE);
65 ScalarEvolution &SE);
H A DScalarEvolutionDivision.h22 class ScalarEvolution; variable
30 static void divide(ScalarEvolution &SE, const SCEV *Numerator,
58 SCEVDivision(ScalarEvolution &S, const SCEV *Numerator,
65 ScalarEvolution &SE;
H A DLoopAccessAnalysis.h348 unsigned AS, bool NeedsFreeze, ScalarEvolution &SE);
417 RuntimePointerChecking(MemoryDepChecker &DC, ScalarEvolution *SE) in RuntimePointerChecking()
504 ScalarEvolution *getSE() const { return SE; } in getSE()
526 ScalarEvolution *SE;
563 LoopAccessInfo(Loop *L, ScalarEvolution *SE, const TargetLibraryInfo *TLI,
744 ScalarEvolution &SE, bool StrictCheck = false,
758 ScalarEvolution &SE,
764 ScalarEvolution &SE, bool CheckType = true);
801 ScalarEvolution *SE = nullptr;
H A DLoopCacheAnalysis.h29 class ScalarEvolution; variable
53 ScalarEvolution &SE);
154 ScalarEvolution &SE;
200 CacheCost(const LoopVectorTy &Loops, const LoopInfo &LI, ScalarEvolution &SE,
275 ScalarEvolution &SE;
H A DScalarEvolutionAliasAnalysis.h22 class ScalarEvolution; variable
28 ScalarEvolution &SE;
31 explicit SCEVAAResult(ScalarEvolution &SE) : SE(SE) {} in SCEVAAResult()
/llvm-project-15.0.7/llvm/include/llvm/Transforms/Utils/
H A DUnrollLoop.h34 class ScalarEvolution; variable
78 ScalarEvolution *SE, DominatorTree *DT,
87 LoopInfo *LI, ScalarEvolution *SE, DominatorTree *DT, AssumptionCache *AC,
93 LoopInfo *LI, ScalarEvolution *SE,
99 bool isSafeToUnrollAndJam(Loop *L, ScalarEvolution &SE, DominatorTree &DT,
103 DominatorTree &DT, LoopInfo *LI, ScalarEvolution &SE,
113 ScalarEvolution *SE, DominatorTree *DT,
120 Loop *L, ScalarEvolution &SE, const TargetTransformInfo &TTI,
H A DLoopUtils.h39 class ScalarEvolution; variable
82 const LoopInfo &LI, ScalarEvolution *SE, IRBuilderBase &Builder,
98 ScalarEvolution *SE);
110 ScalarEvolution *SE);
176 MemorySSAUpdater &, ScalarEvolution *, ICFLoopSafetyInfo *,
191 void deleteDeadLoop(Loop *L, DominatorTree *DT, ScalarEvolution *SE,
197 void breakLoopBackedge(Loop *L, DominatorTree &DT, ScalarEvolution &SE,
329 bool hasIterationCountInvariantInParent(Loop *L, ScalarEvolution &SE);
428 ScalarEvolution &SE);
431 bool cannotBeMaxInLoop(const SCEV *S, const Loop *L, ScalarEvolution &SE,
[all …]
H A DSimplifyIndVar.h28 class ScalarEvolution; variable
50 bool simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, DominatorTree *DT,
57 bool simplifyLoopIVs(Loop *L, ScalarEvolution *SE, DominatorTree *DT,
77 LoopInfo *LI, ScalarEvolution *SE, SCEVExpander &Rewriter,
H A DLoopPeel.h23 bool peelLoop(Loop *L, unsigned PeelCount, LoopInfo *LI, ScalarEvolution *SE,
27 gatherPeelingPreferences(Loop *L, ScalarEvolution &SE,
36 ScalarEvolution &SE, unsigned Threshold = UINT_MAX);
H A DLowerMemIntrinsics.h27 class ScalarEvolution; variable
52 ScalarEvolution *SE = nullptr);
63 ScalarEvolution *SE);
/llvm-project-15.0.7/polly/include/polly/Support/
H A DSCEVValidator.h36 void findValues(const llvm::SCEV *Expr, llvm::ScalarEvolution &SE,
51 const llvm::SCEV *Expression, llvm::ScalarEvolution &SE,
56 llvm::Loop *Scope, llvm::ScalarEvolution &SE,
61 llvm::ScalarEvolution &SE);
70 extractConstantFactor(const llvm::SCEV *M, llvm::ScalarEvolution &SE);
79 llvm::ScalarEvolution &SE,
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DScalarEvolution.cpp3905 ScalarEvolution &SE;
8648 ScalarEvolution::ExitLimit ScalarEvolution::computeExitLimitFromCond( in computeExitLimitFromCond()
8688 ScalarEvolution::ExitLimit ScalarEvolution::computeExitLimitFromCondCached( in computeExitLimitFromCondCached()
8702 ScalarEvolution::ExitLimit ScalarEvolution::computeExitLimitFromCondImpl( in computeExitLimitFromCondImpl()
9017 ScalarEvolution::ExitLimit ScalarEvolution::computeShiftCompareExitLimit( in computeShiftCompareExitLimit()
13078 ScalarEvolution::SCEVCallbackVH::SCEVCallbackVH(Value *V, ScalarEvolution *se) in SCEVCallbackVH()
13085 ScalarEvolution::ScalarEvolution(Function &F, TargetLibraryInfo &TLI, in ScalarEvolution() function in ScalarEvolution
13106 ScalarEvolution::ScalarEvolution(ScalarEvolution &&Arg) in ScalarEvolution() function in ScalarEvolution
13137 ScalarEvolution::~ScalarEvolution() { in ~ScalarEvolution()
13246 ScalarEvolution &SE = *const_cast<ScalarEvolution *>(this); in print()
[all …]
H A DDelinearization.cpp51 ScalarEvolution &SE;
126 ScalarEvolution &SE;
129 ScalarEvolution &SE) in SCEVCollectAddRecMultiplies()
173 void llvm::collectParametricTerms(ScalarEvolution &SE, const SCEV *Expr, in collectParametricTerms()
200 static bool findArrayDimensionsRec(ScalarEvolution &SE, in findArrayDimensionsRec()
279 void llvm::findArrayDimensions(ScalarEvolution &SE, in findArrayDimensions()
450 void llvm::delinearize(ScalarEvolution &SE, const SCEV *Expr, in delinearize()
486 bool llvm::getIndexExpressionsFromGEP(ScalarEvolution &SE, in getIndexExpressionsFromGEP()
525 ScalarEvolution *SE, Instruction *Inst, const SCEV *AccessFn, in tryDelinearizeFixedSizeImpl()
569 ScalarEvolution *SE;
[all …]
H A DScalarEvolutionNormalization.cpp40 ScalarEvolution &SE) in NormalizeDenormalizeRewriter()
99 ScalarEvolution &SE) { in normalizeForPostIncUse()
107 ScalarEvolution &SE) { in normalizeForPostIncUseIf()
113 ScalarEvolution &SE) { in denormalizeForPostIncUse()
H A DLoopNestAnalysis.cpp36 ScalarEvolution &SE);
42 LoopNest::LoopNest(Loop &Root, ScalarEvolution &SE) in LoopNest()
48 ScalarEvolution &SE) { in getLoopNest()
104 ScalarEvolution &SE) { in arePerfectlyNested()
110 const Loop &OuterLoop, const Loop &InnerLoop, ScalarEvolution &SE) { in analyzeLoopNestForPerfectNest()
182 const Loop &OuterLoop, const Loop &InnerLoop, ScalarEvolution &SE) { in getInterveningInstructions()
241 LoopNest::getPerfectLoops(ScalarEvolution &SE) const { in getPerfectLoops()
261 unsigned LoopNest::getMaxPerfectDepth(const Loop &Root, ScalarEvolution &SE) { in getMaxPerfectDepth()
316 ScalarEvolution &SE) { in checkLoopsStructure()
/llvm-project-15.0.7/llvm/unittests/Transforms/Scalar/
H A DLICMTest.cpp61 ScalarEvolution &SE = FAM.getResult<ScalarEvolutionAnalysis>(*F); in TEST()
71 ScalarEvolution::BlockDisposition::DominatesBlock); in TEST()
80 ScalarEvolution::BlockDisposition DispositionBeforeInvalidation = in TEST()
83 ScalarEvolution::BlockDisposition DispositionAfterInvalidation = in TEST()
90 ScalarEvolution::BlockDisposition::ProperlyDominatesBlock); in TEST()
/llvm-project-15.0.7/llvm/unittests/Transforms/Utils/
H A DScalarEvolutionExpanderTest.cpp47 ScalarEvolution buildSE(Function &F) { in buildSE()
51 return ScalarEvolution(F, TLI, *AC, *DT, *LI); in buildSE()
59 ScalarEvolution SE = buildSE(*F); in runWithSE()
119 ScalarEvolution SE = buildSE(*F); in TEST_F()
187 ScalarEvolution SE = buildSE(*F); in TEST_F()
261 ScalarEvolution SE = buildSE(*F); in TEST_F()
321 ScalarEvolution SE = buildSE(*F); in TEST_F()
373 ScalarEvolution SE = buildSE(*F); in TEST_F()
418 ScalarEvolution SE = buildSE(*F); in TEST_F()
469 ScalarEvolution SE = buildSE(*F); in TEST_F()
[all …]
/llvm-project-15.0.7/llvm/unittests/Analysis/
H A DScalarEvolutionTest.cpp45 ScalarEvolution buildSE(Function &F) { in buildSE()
57 ScalarEvolution SE = buildSE(*F); in runWithSE()
93 ScalarEvolution SE = buildSE(*F); in TEST_F()
144 ScalarEvolution SE = buildSE(*F); in TEST_F()
349 ScalarEvolution SE = buildSE(*F); in TEST_F()
386 ScalarEvolution SE = buildSE(*F); in TEST_F()
420 ScalarEvolution SE = buildSE(*F); in TEST_F()
708 ScalarEvolution SE = buildSE(*F); in TEST_F()
775 ScalarEvolution SE = buildSE(*F); in TEST_F()
875 ScalarEvolution SE = buildSE(*F); in TEST_F()
[all …]
H A DIVDescriptorsTest.cpp24 function_ref<void(Function &F, LoopInfo &LI, ScalarEvolution &SE)> Test) { in runWithLoopInfoAndSE()
33 ScalarEvolution SE(*F, TLI, AC, DT, LI); in runWithLoopInfoAndSE()
74 *M, "foo", [&](Function &F, LoopInfo &LI, ScalarEvolution &SE) { in TEST()
125 *M, "foo", [&](Function &F, LoopInfo &LI, ScalarEvolution &SE) { in TEST()
191 *M, "barney", [&](Function &F, LoopInfo &LI, ScalarEvolution &SE) { in TEST()
/llvm-project-15.0.7/llvm/include/llvm/Transforms/Scalar/
H A DAlignmentFromAssumptions.h26 class ScalarEvolution; variable
34 bool runImpl(Function &F, AssumptionCache &AC, ScalarEvolution *SE_,
37 ScalarEvolution *SE = nullptr;
/llvm-project-15.0.7/llvm/lib/Transforms/Vectorize/
H A DVPlanTransforms.h24 class ScalarEvolution; variable
35 ScalarEvolution &SE);
59 static void optimizeInductions(VPlan &Plan, ScalarEvolution &SE);
/llvm-project-15.0.7/llvm/lib/Target/Hexagon/
H A DHexagonTargetTransformInfo.h29 class ScalarEvolution; variable
63 void getUnrollingPreferences(Loop *L, ScalarEvolution &SE,
67 void getPeelingPreferences(Loop *L, ScalarEvolution &SE,
72 getPreferredAddressingMode(const Loop *L, ScalarEvolution *SE) const;
117 InstructionCost getAddressComputationCost(Type *Tp, ScalarEvolution *SE,

123456789