| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | ScalarEvolutionAliasAnalysis.cpp | 72 if (!isa<SCEVCouldNotCompute>(AInt) && !isa<SCEVCouldNotCompute>(BInt)) { in alias()
83 if (!isa<SCEVCouldNotCompute>(BA) && in alias()
98 if (!isa<SCEVCouldNotCompute>(AB) && in alias()
|
| H A D | ScalarEvolution.cpp | 472 SCEVCouldNotCompute::SCEVCouldNotCompute() : in SCEVCouldNotCompute() function in SCEVCouldNotCompute
475 bool SCEVCouldNotCompute::classof(const SCEV *S) { in classof()
989 if (isa<SCEVCouldNotCompute>(Coeff)) in evaluateAtIteration()
1129 if (isa<SCEVCouldNotCompute>(IntOp)) in getPtrToIntExpr()
1368 !isa<SCEVCouldNotCompute>(BECount) && SE->isKnownPositive(BECount)) in getPreStartForExtend()
1643 if (!isa<SCEVCouldNotCompute>(MaxBECount)) { in getZeroExtendExprImpl()
1707 if (!isa<SCEVCouldNotCompute>(MaxBECount) || HasGuards || in getZeroExtendExprImpl()
2017 if (!isa<SCEVCouldNotCompute>(MaxBECount)) { in getSignExtendExprImpl()
4094 RetVal visitCouldNotCompute(const SCEVCouldNotCompute *Expr) { return Expr; } in visitCouldNotCompute()
5162 if (isa<SCEVCouldNotCompute>(MaxBECount) && !HasGuards && in proveNoSignedWrapViaInduction()
[all …]
|
| H A D | LoopAccessAnalysis.cpp | 268 assert(!isa<SCEVCouldNotCompute>(ScStart) && in insert()
269 !isa<SCEVCouldNotCompute>(ScEnd) && in insert()
343 if (isa<SCEVCouldNotCompute>(SinkStartInt) || in tryToCreateDiffCheck()
344 isa<SCEVCouldNotCompute>(SrcStartInt)) in tryToCreateDiffCheck()
1954 if (!isa<SCEVCouldNotCompute>(SrcStart) && in getDependenceDistanceStrideAndSize()
1955 !isa<SCEVCouldNotCompute>(SrcEnd) && in getDependenceDistanceStrideAndSize()
1956 !isa<SCEVCouldNotCompute>(SinkStart) && in getDependenceDistanceStrideAndSize()
1957 !isa<SCEVCouldNotCompute>(SinkEnd)) { in getDependenceDistanceStrideAndSize()
2023 if (isa<SCEVCouldNotCompute>(Dist)) { in isDependent()
2379 if (isa<SCEVCouldNotCompute>(ExitCount)) { in canAnalyzeLoop()
|
| H A D | StackSafetyAnalysis.cpp | 303 if (isa<SCEVCouldNotCompute>(Diff)) in offsetFrom()
384 if (isa<SCEVCouldNotCompute>(AccessSize)) in isSafeAccess()
395 if (isa<SCEVCouldNotCompute>(Diff)) in isSafeAccess()
|
| H A D | LoopCacheAnalysis.cpp | 112 const SCEV *TripCount = (!isa<SCEVCouldNotCompute>(BackedgeTakenCount) && in computeTripCount()
|
| H A D | TargetTransformInfo.cpp | 140 if (isa<SCEVCouldNotCompute>(EC)) in isHardwareLoopCandidate()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | ScalarEvolutionDivision.h | 24 struct SCEVCouldNotCompute;
47 void visitCouldNotCompute(const SCEVCouldNotCompute *Numerator) {} in visitCouldNotCompute()
|
| H A D | ScalarEvolution.h | 209 struct SCEVCouldNotCompute : public SCEV {
210 SCEVCouldNotCompute();
1140 return !isa<SCEVCouldNotCompute>(ExactNotTaken) ||
1141 !isa<SCEVCouldNotCompute>(ConstantMaxNotTaken);
1146 return !isa<SCEVCouldNotCompute>(ExactNotTaken);
1413 std::unique_ptr<SCEVCouldNotCompute> CouldNotCompute;
1536 !isa<SCEVCouldNotCompute>(getConstantMax());
|
| H A D | ScalarEvolutionExpressions.h | 409 /// instance of SCEVCouldNotCompute is returned.
644 return ((SC *)this)->visitCouldNotCompute((const SCEVCouldNotCompute *)S); in visit()
649 RetVal visitCouldNotCompute(const SCEVCouldNotCompute *S) {
650 llvm_unreachable("Invalid use of SCEVCouldNotCompute!"); in visitCouldNotCompute()
704 llvm_unreachable("Attempt to use a SCEVCouldNotCompute object!"); in visitAll()
892 const SCEV *visitCouldNotCompute(const SCEVCouldNotCompute *Expr) {
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LoopPredication.cpp | 355 if (isa<SCEVCouldNotCompute>(LHSS)) in runOnLoop()
358 if (isa<SCEVCouldNotCompute>(RHSS))
1003 /// returns SCEVCouldNotCompute. in isLoopProfitableToPredicate()
1013 if (isa<SCEVCouldNotCompute>(ExitCount)) in isLoopProfitableToPredicate()
1065 if (isa<SCEVCouldNotCompute>(LatchEC)) in FindWidenableTerminatorAboveLoop()
1107 if (isa<SCEVCouldNotCompute>(MinEC) || MinEC->getType()->isPointerTy() ||
1134 if (isa<SCEVCouldNotCompute>(ExitCount) || in predicateLoopExits()
|
| H A D | IndVarSimplify.cpp | 1380 if (isa<SCEVCouldNotCompute>(ExitMax)) in optimizeLoopExitWithUnknownExitCount()
1599 if (isa<SCEVCouldNotCompute>(MaxBECount)) in optimizeLoopExits()
1627 if (SkipLastIter || isa<SCEVCouldNotCompute>(MaxExitCount)) in optimizeLoopExits()
1629 if (isa<SCEVCouldNotCompute>(CurrMaxExit)) in optimizeLoopExits()
1643 if (isa<SCEVCouldNotCompute>(ExactExitCount)) { in optimizeLoopExits()
1750 if (isa<SCEVCouldNotCompute>(ExactBTC) || !Rewriter.isSafeToExpand(ExactBTC)) in predicateLoopExits()
1781 if (isa<SCEVCouldNotCompute>(ExitCount) || in predicateLoopExits()
1993 if (isa<SCEVCouldNotCompute>(ExitCount)) in run()
|
| H A D | LoopDeletion.cpp | 133 if (isa<SCEVCouldNotCompute>(S)) { in isLoopDead()
411 if (!isa<SCEVCouldNotCompute>(BTC) && SE.isKnownNonZero(BTC)) in breakBackedgeIfNotTaken()
|
| H A D | PlaceSafepoints.cpp | 453 if (!isa<SCEVCouldNotCompute>(MaxTrips) && in mustBeFiniteCountedLoop()
465 if (!isa<SCEVCouldNotCompute>(MaxExec) && in mustBeFiniteCountedLoop()
|
| H A D | AlignmentFromAssumptions.cpp | 88 if (isa<SCEVCouldNotCompute>(DiffSCEV)) in getNewAlignment()
|
| H A D | LoopVersioningLICM.cpp | 218 if (isa<SCEVCouldNotCompute>(ExitCount)) { in legalLoopStructure()
|
| H A D | LoopBoundSplit.cpp | 84 if (isa<SCEVCouldNotCompute>(ExitCount)) in calculateUpperBound()
|
| H A D | InductiveRangeCheckElimination.cpp | |
| H A D | LoopFuse.cpp | 731 if (isa<SCEVCouldNotCompute>(TripCount0)) { in haveIdenticalTripCounts()
738 if (isa<SCEVCouldNotCompute>(TripCount1)) { in haveIdenticalTripCounts()
|
| H A D | LoopFlatten.cpp | 326 if (isa<SCEVCouldNotCompute>(BackedgeTakenCount)) { in verifyTripCount()
|
| H A D | LoopInterchange.cpp | 396 if (isa<SCEVCouldNotCompute>(ExitCountOuter)) { in isComputableLoopNest()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | LoopUtils.cpp | 908 if (isa<SCEVCouldNotCompute>(InnerLoopBECountSC) || in hasIterationCountInvariantInParent()
1587 if (isa<SCEVCouldNotCompute>(ExitValue) || in rewriteLoopExitValues()
1595 if (isa<SCEVCouldNotCompute>(ExitCount)) in rewriteLoopExitValues()
1600 if (isa<SCEVCouldNotCompute>(ExitValue) || in rewriteLoopExitValues()
1837 if (!isa<SCEVCouldNotCompute>(OuterExitCount) && in expandBounds()
1841 if (!isa<SCEVCouldNotCompute>(NewHigh)) { in expandBounds()
|
| H A D | LoopUnrollRuntime.cpp | 655 if (isa<SCEVCouldNotCompute>(BECountSC)) { in UnrollRuntimeLoopRemainder()
666 if (isa<SCEVCouldNotCompute>(TripCountSC)) { in UnrollRuntimeLoopRemainder()
|
| H A D | LoopConstrainer.cpp | 119 if (isa<SCEVCouldNotCompute>(FromBlock)) in getNarrowestLatchMaxTakenCountEstimate()
168 if (isa<SCEVCouldNotCompute>(MaxBETakenCount)) { in parseLoopStructure()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | LoopVectorizationLegality.cpp | 539 const SCEV *visitCouldNotCompute(const SCEVCouldNotCompute *S) { in visitCouldNotCompute()
588 if (isa<SCEVCouldNotCompute>(FirstLaneExpr)) in isUniform()
1509 if (isa<SCEVCouldNotCompute>(PSE.getBackedgeTakenCount())) { in canVectorize()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonLoopIdiomRecognition.cpp | 1792 if (isa<SCEVCouldNotCompute>(CT)) in recognize()
2387 assert(!isa<SCEVCouldNotCompute>(BECount) && in runOnCountableLoop()
|