Home
last modified time | relevance | path

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

12345

/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DUnrollLoop.h33 class ScalarEvolution; variable
77 ScalarEvolution *SE, DominatorTree *DT,
86 LoopInfo *LI, ScalarEvolution *SE, DominatorTree *DT, AssumptionCache *AC,
92 LoopInfo *LI, ScalarEvolution *SE,
98 bool isSafeToUnrollAndJam(Loop *L, ScalarEvolution &SE, DominatorTree &DT,
102 DominatorTree &DT, LoopInfo *LI, ScalarEvolution &SE,
112 ScalarEvolution *SE, DominatorTree *DT,
119 Loop *L, ScalarEvolution &SE, const TargetTransformInfo &TTI,
H A DLoopUtils.h39 class ScalarEvolution; variable
85 const LoopInfo &LI, ScalarEvolution *SE, IRBuilderBase &Builder,
101 ScalarEvolution *SE);
113 ScalarEvolution *SE);
166 AliasSetTracker *, MemorySSAUpdater *, ScalarEvolution *,
181 void deleteDeadLoop(Loop *L, DominatorTree *DT, ScalarEvolution *SE,
187 void breakLoopBackedge(Loop *L, DominatorTree &DT, ScalarEvolution &SE,
317 bool hasIterationCountInvariantInParent(Loop *L, ScalarEvolution &SE);
395 ScalarEvolution &SE);
398 bool cannotBeMaxInLoop(const SCEV *S, const Loop *L, ScalarEvolution &SE,
[all …]
H A DSimplifyIndVar.h29 class ScalarEvolution; variable
51 bool simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, DominatorTree *DT,
58 bool simplifyLoopIVs(Loop *L, ScalarEvolution *SE, DominatorTree *DT,
78 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,
35 unsigned &TripCount, ScalarEvolution &SE,
H A DScalarEvolutionExpander.h36 bool isSafeToExpand(const SCEV *S, ScalarEvolution &SE);
42 ScalarEvolution &SE);
64 ScalarEvolution &SE;
174 explicit SCEVExpander(ScalarEvolution &se, const DataLayout &DL,
208 ScalarEvolution *getSE() { return &SE; }
384 Optional<ScalarEvolution::ValueOffsetPair>
443 ScalarEvolution::ValueOffsetPair
H A DLoopRotationUtils.h23 class ScalarEvolution; variable
34 AssumptionCache *AC, DominatorTree *DT, ScalarEvolution *SE,
H A DLoopSimplify.h50 class ScalarEvolution; variable
64 bool simplifyLoop(Loop *L, DominatorTree *DT, LoopInfo *LI, ScalarEvolution *SE,
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DScalarEvolutionExpressions.h48 friend class ScalarEvolution; variable
109 friend class ScalarEvolution; variable
138 friend class ScalarEvolution; variable
153 friend class ScalarEvolution; variable
168 friend class ScalarEvolution; variable
261 friend class ScalarEvolution; variable
287 friend class ScalarEvolution; variable
304 friend class ScalarEvolution; variable
353 friend class ScalarEvolution; variable
536 ScalarEvolution *SE;
[all …]
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,
57 SCEVDivision(ScalarEvolution &S, const SCEV *Numerator,
64 ScalarEvolution &SE;
H A DLoopNestAnalysis.h30 LoopNest(Loop &Root, ScalarEvolution &SE);
35 static std::unique_ptr<LoopNest> getLoopNest(Loop &Root, ScalarEvolution &SE);
49 ScalarEvolution &SE);
60 static unsigned getMaxPerfectDepth(const Loop &Root, ScalarEvolution &SE);
112 SmallVector<LoopVectorTy, 4> getPerfectLoops(ScalarEvolution &SE) const;
H A DLoopAccessAnalysis.h357 unsigned AS, ScalarEvolution &SE);
409 RuntimePointerChecking(ScalarEvolution *SE) : Need(false), SE(SE) {} in RuntimePointerChecking()
483 ScalarEvolution *getSE() const { return SE; } in getSE()
497 ScalarEvolution *SE;
527 LoopAccessInfo(Loop *L, ScalarEvolution *SE, const TargetLibraryInfo *TLI,
695 ScalarEvolution &SE, bool StrictCheck = false,
709 ScalarEvolution &SE,
715 ScalarEvolution &SE, bool CheckType = true);
752 ScalarEvolution *SE = nullptr;
H A DLoopCacheAnalysis.h27 class ScalarEvolution; variable
51 ScalarEvolution &SE);
140 ScalarEvolution &SE;
186 CacheCost(const LoopVectorTy &Loops, const LoopInfo &LI, ScalarEvolution &SE,
260 ScalarEvolution &SE;
H A DScalarEvolution.h66 class ScalarEvolution; variable
443 class ScalarEvolution {
478 ScalarEvolution(ScalarEvolution &&Arg);
479 ~ScalarEvolution();
1241 ScalarEvolution *SE;
1741 Optional<ScalarEvolution::ExitLimit>
2121 using Result = ScalarEvolution;
2145 std::unique_ptr<ScalarEvolution> SE;
2152 ScalarEvolution &getSE() { return *SE; }
2207 ScalarEvolution *getSE() const { return &SE; }
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/
H A DScalarEvolution.cpp7838 ScalarEvolution::ExitLimit ScalarEvolution::computeExitLimitFromCond( in computeExitLimitFromCond()
7878 ScalarEvolution::ExitLimit ScalarEvolution::computeExitLimitFromCondCached( in computeExitLimitFromCondCached()
7892 ScalarEvolution::ExitLimit ScalarEvolution::computeExitLimitFromCondImpl( in computeExitLimitFromCondImpl()
8251 ScalarEvolution::ExitLimit ScalarEvolution::computeShiftCompareExitLimit( in computeShiftCompareExitLimit()
12156 ScalarEvolution &SE;
12231 ScalarEvolution &SE;
12687 ScalarEvolution::ScalarEvolution(Function &F, TargetLibraryInfo &TLI, in ScalarEvolution() function in ScalarEvolution
12708 ScalarEvolution::ScalarEvolution(ScalarEvolution &&Arg) in ScalarEvolution() function in ScalarEvolution
12736 ScalarEvolution::~ScalarEvolution() { in ~ScalarEvolution()
12844 ScalarEvolution &SE = *const_cast<ScalarEvolution *>(this); in print()
[all …]
H A DScalarEvolutionNormalization.cpp39 ScalarEvolution &SE) in NormalizeDenormalizeRewriter()
98 ScalarEvolution &SE) { in normalizeForPostIncUse()
106 ScalarEvolution &SE) { in normalizeForPostIncUseIf()
112 ScalarEvolution &SE) { in denormalizeForPostIncUse()
H A DLoopNestAnalysis.cpp37 ScalarEvolution &SE);
43 LoopNest::LoopNest(Loop &Root, ScalarEvolution &SE) in LoopNest()
49 ScalarEvolution &SE) { in getLoopNest()
54 ScalarEvolution &SE) { in arePerfectlyNested()
161 LoopNest::getPerfectLoops(ScalarEvolution &SE) const { in getPerfectLoops()
181 unsigned LoopNest::getMaxPerfectDepth(const Loop &Root, ScalarEvolution &SE) { in getMaxPerfectDepth()
236 ScalarEvolution &SE) { in checkLoopsStructure()
/freebsd-13.1/contrib/llvm-project/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;
H A DNaryReassociate.h95 class ScalarEvolution; variable
108 ScalarEvolution *SE_, TargetLibraryInfo *TLI_,
183 ScalarEvolution *SE;
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUTargetTransformInfo.h33 class ScalarEvolution; variable
55 void getUnrollingPreferences(Loop *L, ScalarEvolution &SE,
58 void getPeelingPreferences(Loop *L, ScalarEvolution &SE,
110 void getUnrollingPreferences(Loop *L, ScalarEvolution &SE,
113 void getPeelingPreferences(Loop *L, ScalarEvolution &SE,
241 void getUnrollingPreferences(Loop *L, ScalarEvolution &SE,
243 void getPeelingPreferences(Loop *L, ScalarEvolution &SE,
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonTargetTransformInfo.h29 class ScalarEvolution; variable
63 void getUnrollingPreferences(Loop *L, ScalarEvolution &SE,
66 void getPeelingPreferences(Loop *L, ScalarEvolution &SE,
71 getPreferredAddressingMode(const Loop *L, ScalarEvolution *SE) const;
117 InstructionCost getAddressComputationCost(Type *Tp, ScalarEvolution *SE,
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMTargetTransformInfo.h37 class ScalarEvolution; variable
112 getPreferredAddressingMode(const Loop *L, ScalarEvolution *SE) const;
225 InstructionCost getAddressComputationCost(Type *Val, ScalarEvolution *SE,
271 bool isHardwareLoopProfitable(Loop *L, ScalarEvolution &SE,
276 ScalarEvolution &SE,
281 void getUnrollingPreferences(Loop *L, ScalarEvolution &SE,
286 void getPeelingPreferences(Loop *L, ScalarEvolution &SE,
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopBoundSplit.cpp56 static void analyzeICmp(ScalarEvolution &SE, ICmpInst *ICmp, in analyzeICmp()
73 static bool calculateUpperBound(const Loop &L, ScalarEvolution &SE, in calculateUpperBound()
118 static bool hasProcessableCondition(const Loop &L, ScalarEvolution &SE, in hasProcessableCondition()
153 static bool isProcessableCondBI(const ScalarEvolution &SE, in isProcessableCondBI()
174 ScalarEvolution &SE, ConditionInfo &Cond) { in canSplitLoopBound()
237 static BranchInst *findSplitCandidate(const Loop &L, ScalarEvolution &SE, in findSplitCandidate()
275 ScalarEvolution &SE, LPMUpdater &U) { in splitLoopBound()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanTransforms.h22 class ScalarEvolution; variable
30 SmallPtrSetImpl<Instruction *> &DeadInstructions, ScalarEvolution &SE);
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/
H A DLoopVectorize.h76 class ScalarEvolution; variable
142 ScalarEvolution *SE;
159 runImpl(Function &F, ScalarEvolution &SE_, LoopInfo &LI_,

12345