Home
last modified time | relevance | path

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

123456

/freebsd-14.2/contrib/llvm-project/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
81 friend class ScalarEvolution; variable
131 friend class ScalarEvolution; variable
157 friend class ScalarEvolution; variable
169 friend class ScalarEvolution; variable
183 friend class ScalarEvolution; variable
267 friend class ScalarEvolution; variable
291 friend class ScalarEvolution; variable
305 friend class ScalarEvolution; variable
582 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
56 ScalarEvolution &SE,
62 ScalarEvolution &SE);
67 ScalarEvolution &SE);
H A DScalarEvolutionDivision.h22 class ScalarEvolution; variable
30 static void divide(ScalarEvolution &SE, const SCEV *Numerator,
60 SCEVDivision(ScalarEvolution &S, const SCEV *Numerator,
67 ScalarEvolution &SE;
H A DLoopInfo.h36 class ScalarEvolution; variable
85 ScalarEvolution *SE = nullptr) const;
100 ScalarEvolution *SE = nullptr) const;
166 getBounds(const Loop &L, PHINode &IndVar, ScalarEvolution &SE);
227 ScalarEvolution &SE) in LoopBounds()
246 ScalarEvolution &SE;
251 std::optional<LoopBounds> getBounds(ScalarEvolution &SE) const;
260 PHINode *getInductionVariable(ScalarEvolution &SE) const;
264 bool getInductionDescriptor(ScalarEvolution &SE,
275 ScalarEvolution &SE) const;
[all …]
H A DScalarEvolution.h61 class ScalarEvolution; variable
452 class ScalarEvolution {
491 ScalarEvolution(ScalarEvolution &&Arg);
492 ~ScalarEvolution();
1352 ScalarEvolution *SE;
1469 friend class ScalarEvolution;
2246 using Result = ScalarEvolution;
2273 std::unique_ptr<ScalarEvolution> SE;
2369 ScalarEvolution &SE;
2390 ScalarEvolution::FoldID ID(0);
[all …]
H A DLoopAccessAnalysis.h363 unsigned AS, bool NeedsFreeze, ScalarEvolution &SE);
432 RuntimePointerChecking(MemoryDepChecker &DC, ScalarEvolution *SE) in RuntimePointerChecking()
519 ScalarEvolution *getSE() const { return SE; } in getSE()
541 ScalarEvolution *SE;
578 LoopAccessInfo(Loop *L, ScalarEvolution *SE, const TargetLibraryInfo *TLI,
756 ScalarEvolution &SE,
771 ScalarEvolution &SE,
777 ScalarEvolution &SE, bool CheckType = true);
784 ScalarEvolution &SE;
791 LoopAccessInfoManager(ScalarEvolution &SE, AAResults &AA, DominatorTree &DT, in LoopAccessInfoManager()
H A DLoopCacheAnalysis.h30 class ScalarEvolution; variable
54 ScalarEvolution &SE);
155 ScalarEvolution &SE;
201 CacheCost(const LoopVectorTy &Loops, const LoopInfo &LI, ScalarEvolution &SE,
276 ScalarEvolution &SE;
H A DScalarEvolutionAliasAnalysis.h22 class ScalarEvolution; variable
28 ScalarEvolution &SE;
31 explicit SCEVAAResult(ScalarEvolution &SE) : SE(SE) {} in SCEVAAResult()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DLoopUtils.h39 class ScalarEvolution; variable
84 const LoopInfo &LI, ScalarEvolution *SE,
101 ScalarEvolution *SE);
113 ScalarEvolution *SE);
197 void deleteDeadLoop(Loop *L, DominatorTree *DT, ScalarEvolution *SE,
203 void breakLoopBackedge(Loop *L, DominatorTree &DT, ScalarEvolution &SE,
336 bool hasIterationCountInvariantInParent(Loop *L, ScalarEvolution &SE);
434 ScalarEvolution &SE);
442 ScalarEvolution &SE);
445 bool cannotBeMaxInLoop(const SCEV *S, const Loop *L, ScalarEvolution &SE,
[all …]
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 ScalarEvolution *SE, DominatorTree *DT,
110 Loop *L, ScalarEvolution &SE, const TargetTransformInfo &TTI,
148 ScalarEvolution &SE,
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.h26 bool peelLoop(Loop *L, unsigned PeelCount, LoopInfo *LI, ScalarEvolution *SE,
31 gatherPeelingPreferences(Loop *L, ScalarEvolution &SE,
40 ScalarEvolution &SE, AssumptionCache *AC = nullptr,
H A DLowerMemIntrinsics.h28 class ScalarEvolution; variable
51 ScalarEvolution *SE = nullptr);
63 ScalarEvolution *SE);
H A DLoopVersioning.h26 class ScalarEvolution; variable
49 DominatorTree *DT, ScalarEvolution *SE);
144 ScalarEvolution *SE;
H A DLoopConstrainer.h25 class ScalarEvolution; variable
84 parseLoopStructure(ScalarEvolution &, Loop &, bool, const char *&);
192 ScalarEvolution &SE;
218 const LoopStructure &LS, ScalarEvolution &SE,
/freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/
H A DScalarEvolution.cpp3980 ScalarEvolution &SE;
8869 ScalarEvolution::ExitLimit ScalarEvolution::computeExitLimitFromCond( in computeExitLimitFromCond()
9066 ScalarEvolution::ExitLimit ScalarEvolution::computeExitLimitFromICmp( in computeExitLimitFromICmp()
9094 ScalarEvolution::ExitLimit ScalarEvolution::computeExitLimitFromICmp( in computeExitLimitFromICmp()
10368 ScalarEvolution::ExitLimit ScalarEvolution::howFarToZero(const SCEV *V, in howFarToZero()
13130 ScalarEvolution::ExitLimit ScalarEvolution::howManyGreaterThans( in howManyGreaterThans()
13386 ScalarEvolution::ScalarEvolution(Function &F, TargetLibraryInfo &TLI, in ScalarEvolution() function in ScalarEvolution
13407 ScalarEvolution::ScalarEvolution(ScalarEvolution &&Arg) in ScalarEvolution() function in ScalarEvolution
13438 ScalarEvolution::~ScalarEvolution() { in ~ScalarEvolution()
13588 ScalarEvolution &SE = *const_cast<ScalarEvolution *>(this); in print()
[all …]
H A DDelinearization.cpp49 ScalarEvolution &SE;
52 SCEVCollectStrides(ScalarEvolution &SE, SmallVectorImpl<const SCEV *> &S) in SCEVCollectStrides()
124 ScalarEvolution &SE;
127 ScalarEvolution &SE) in SCEVCollectAddRecMultiplies()
171 void llvm::collectParametricTerms(ScalarEvolution &SE, const SCEV *Expr, in collectParametricTerms()
198 static bool findArrayDimensionsRec(ScalarEvolution &SE, in findArrayDimensionsRec()
277 void llvm::findArrayDimensions(ScalarEvolution &SE, in findArrayDimensions()
448 void llvm::delinearize(ScalarEvolution &SE, const SCEV *Expr, in delinearize()
484 bool llvm::getIndexExpressionsFromGEP(ScalarEvolution &SE, in getIndexExpressionsFromGEP()
523 ScalarEvolution *SE, Instruction *Inst, const SCEV *AccessFn, in tryDelinearizeFixedSizeImpl()
[all …]
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()
H A DScalarEvolutionNormalization.cpp40 ScalarEvolution &SE) in NormalizeDenormalizeRewriter()
99 ScalarEvolution &SE, in normalizeForPostIncUse()
116 ScalarEvolution &SE) { in normalizeForPostIncUseIf()
122 ScalarEvolution &SE) { in denormalizeForPostIncUse()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanTransforms.h24 class ScalarEvolution; variable
36 ScalarEvolution &SE, const TargetLibraryInfo &TLI);
60 static void optimize(VPlan &Plan, ScalarEvolution &SE);
110 static void optimizeInductions(VPlan &Plan, ScalarEvolution &SE);
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DInductiveRangeCheckElimination.cpp210 bool isEmpty(ScalarEvolution &SE, bool IsSigned) const { in isEmpty()
242 ScalarEvolution &SE;
256 InductiveRangeCheckElimination(ScalarEvolution &SE, in InductiveRangeCheckElimination()
271 ScalarEvolution &SE, in parseRangeCheckICmp()
306 ScalarEvolution &SE, in parseIvAgaisntLimit()
439 Operation = &ScalarEvolution::getAddExpr; in reassociateSubLHS()
442 Operation = &ScalarEvolution::getMinusSCEV; in reassociateSubLHS()
486 Loop *L, ScalarEvolution &SE, Use &ConditionUse, in extractRangeChecksFromCond()
566 calculateSubRanges(ScalarEvolution &SE, const Loop &L, in calculateSubRanges()
828 IntersectSignedRange(ScalarEvolution &SE, in IntersectSignedRange()
[all …]
/freebsd-14.2/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;
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonTargetTransformInfo.h29 class ScalarEvolution; variable
64 void getUnrollingPreferences(Loop *L, ScalarEvolution &SE,
68 void getPeelingPreferences(Loop *L, ScalarEvolution &SE,
73 getPreferredAddressingMode(const Loop *L, ScalarEvolution *SE) const;
119 InstructionCost getAddressComputationCost(Type *Tp, ScalarEvolution *SE,

123456