| /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 | Loads.cpp | 333 if (isa<SCEVCouldNotCompute>(MaxBECount)) in isDereferenceableAndAlignedInLoop()
336 if (isa<SCEVCouldNotCompute>(BECount)) { in isDereferenceableAndAlignedInLoop()
346 if (isa<SCEVCouldNotCompute>(AccessStart) || in isDereferenceableAndAlignedInLoop()
347 isa<SCEVCouldNotCompute>(AccessEnd)) in isDereferenceableAndAlignedInLoop()
352 if (isa<SCEVCouldNotCompute>(PtrDiff)) in isDereferenceableAndAlignedInLoop()
|
| H A D | ScalarEvolution.cpp | 464 SCEVCouldNotCompute::SCEVCouldNotCompute() : in SCEVCouldNotCompute() function in SCEVCouldNotCompute
467 bool SCEVCouldNotCompute::classof(const SCEV *S) { in classof()
995 if (isa<SCEVCouldNotCompute>(Coeff)) in evaluateAtIteration()
1135 if (isa<SCEVCouldNotCompute>(IntOp)) in getPtrToIntExpr()
1374 !isa<SCEVCouldNotCompute>(BECount) && SE->isKnownPositive(BECount)) in getPreStartForExtend()
1647 if (!isa<SCEVCouldNotCompute>(MaxBECount)) { in getZeroExtendExprImpl()
1711 if (!isa<SCEVCouldNotCompute>(MaxBECount) || HasGuards || in getZeroExtendExprImpl()
2020 if (!isa<SCEVCouldNotCompute>(MaxBECount)) { in getSignExtendExprImpl()
4061 RetVal visitCouldNotCompute(const SCEVCouldNotCompute *Expr) { return Expr; } in visitCouldNotCompute()
5128 if (isa<SCEVCouldNotCompute>(MaxBECount) && !HasGuards && in proveNoSignedWrapViaInduction()
[all …]
|
| H A D | LoopAccessAnalysis.cpp | 297 if (!isa<SCEVCouldNotCompute>(BTC)) in getStartAndEndForAccess()
362 assert(!isa<SCEVCouldNotCompute>(ScStart) && in insert()
363 !isa<SCEVCouldNotCompute>(ScEnd) && in insert()
440 if (isa<SCEVCouldNotCompute>(SinkStartInt) || in tryToCreateDiffCheck()
441 isa<SCEVCouldNotCompute>(SrcStartInt)) in tryToCreateDiffCheck()
1966 if (isa<SCEVCouldNotCompute>(SrcStart_) || isa<SCEVCouldNotCompute>(SrcEnd_)) in areAccessesCompletelyBeforeOrAfter()
1971 if (isa<SCEVCouldNotCompute>(SinkStart_) || in areAccessesCompletelyBeforeOrAfter()
1972 isa<SCEVCouldNotCompute>(SinkEnd_)) in areAccessesCompletelyBeforeOrAfter()
2125 if (isa<SCEVCouldNotCompute>(Dist)) { in isDependent()
2441 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()
|
| /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 | ScalarEvolutionPatternMatch.h | 29 assert((isa<SCEVCouldNotCompute>(S) || !S->getType()->isVectorTy()) && in match()
121 assert((isa<SCEVCouldNotCompute>(S) || !S->getType()->isVectorTy()) && in match()
|
| H A D | ScalarEvolution.h | 206 struct SCEVCouldNotCompute : public SCEV {
207 LLVM_ABI SCEVCouldNotCompute();
1176 return !isa<SCEVCouldNotCompute>(ExactNotTaken) ||
1177 !isa<SCEVCouldNotCompute>(ConstantMaxNotTaken);
1182 return !isa<SCEVCouldNotCompute>(ExactNotTaken);
1472 std::unique_ptr<SCEVCouldNotCompute> CouldNotCompute;
1601 !isa<SCEVCouldNotCompute>(getConstantMax());
|
| H A D | ScalarEvolutionExpressions.h | 648 return ((SC *)this)->visitCouldNotCompute((const SCEVCouldNotCompute *)S); in visit()
653 RetVal visitCouldNotCompute(const SCEVCouldNotCompute *S) { in visitCouldNotCompute()
896 const SCEV *visitCouldNotCompute(const SCEVCouldNotCompute *Expr) { in visitCouldNotCompute()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LoopPredication.cpp | 354 if (isa<SCEVCouldNotCompute>(LHSS)) in parseLoopICmp()
357 if (isa<SCEVCouldNotCompute>(RHSS)) in parseLoopICmp()
1012 if (isa<SCEVCouldNotCompute>(ExitCount)) in getMinAnalyzeableBackedgeTakenCount()
1064 if (isa<SCEVCouldNotCompute>(LatchEC)) in predicateLoopExits()
1106 if (isa<SCEVCouldNotCompute>(MinEC) || MinEC->getType()->isPointerTy() || in predicateLoopExits()
1133 if (isa<SCEVCouldNotCompute>(ExitCount) || in predicateLoopExits()
|
| H A D | IndVarSimplify.cpp | 1356 if (isa<SCEVCouldNotCompute>(ExitMax)) in optimizeLoopExitWithUnknownExitCount()
1577 if (isa<SCEVCouldNotCompute>(MaxBECount)) in optimizeLoopExits()
1605 if (SkipLastIter || isa<SCEVCouldNotCompute>(MaxExitCount)) in optimizeLoopExits()
1607 if (isa<SCEVCouldNotCompute>(CurrMaxExit)) in optimizeLoopExits()
1621 if (isa<SCEVCouldNotCompute>(ExactExitCount)) { in optimizeLoopExits()
1728 if (isa<SCEVCouldNotCompute>(ExactBTC) || !Rewriter.isSafeToExpand(ExactBTC)) in predicateLoopExits()
1759 if (isa<SCEVCouldNotCompute>(ExitCount) || in predicateLoopExits()
1972 if (isa<SCEVCouldNotCompute>(ExitCount)) in run()
|
| H A D | PlaceSafepoints.cpp | 449 if (!isa<SCEVCouldNotCompute>(MaxTrips) && in mustBeFiniteCountedLoop()
461 if (!isa<SCEVCouldNotCompute>(MaxExec) && in mustBeFiniteCountedLoop()
|
| 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 | LoopVersioningLICM.cpp | 215 if (isa<SCEVCouldNotCompute>(ExitCount)) { in legalLoopStructure()
|
| H A D | AlignmentFromAssumptions.cpp | 88 if (isa<SCEVCouldNotCompute>(DiffSCEV)) in getNewAlignment()
|
| H A D | LoopBoundSplit.cpp | 84 if (isa<SCEVCouldNotCompute>(ExitCount)) in calculateUpperBound()
|
| H A D | LoopFuse.cpp | 730 if (isa<SCEVCouldNotCompute>(TripCount0)) { in haveIdenticalTripCounts()
737 if (isa<SCEVCouldNotCompute>(TripCount1)) { in haveIdenticalTripCounts()
|
| H A D | LoopFlatten.cpp | 326 if (isa<SCEVCouldNotCompute>(BackedgeTakenCount)) { in verifyTripCount()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | LoopVectorizationLegality.cpp | 537 const SCEV *visitCouldNotCompute(const SCEVCouldNotCompute *S) { in visitCouldNotCompute()
586 if (isa<SCEVCouldNotCompute>(FirstLaneExpr)) in isUniform()
1672 if (isa<SCEVCouldNotCompute>(EC)) { in isVectorizableEarlyExitLoop()
1724 if (isa<SCEVCouldNotCompute>( in isVectorizableEarlyExitLoop()
1787 assert(!isa<SCEVCouldNotCompute>(SymbolicMaxBTC) && in isVectorizableEarlyExitLoop()
1854 if (isa<SCEVCouldNotCompute>(PSE.getBackedgeTakenCount())) { in canVectorize()
|
| H A D | VPlanConstruction.cpp | 521 assert(!isa<SCEVCouldNotCompute>(BackedgeTakenCountSCEV) && in prepareForVectorization()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | LoopUtils.cpp | 900 if (isa<SCEVCouldNotCompute>(InnerLoopBECountSC) || in hasIterationCountInvariantInParent()
1653 if (isa<SCEVCouldNotCompute>(ExitValue) || in rewriteLoopExitValues()
1661 if (isa<SCEVCouldNotCompute>(ExitCount)) in rewriteLoopExitValues()
1666 if (isa<SCEVCouldNotCompute>(ExitValue) || in rewriteLoopExitValues()
1904 if (!isa<SCEVCouldNotCompute>(OuterExitCount) && in expandBounds()
1908 if (!isa<SCEVCouldNotCompute>(NewHigh)) { in expandBounds()
|
| H A D | LoopUnrollRuntime.cpp | 659 if (isa<SCEVCouldNotCompute>(BECountSC)) { in UnrollRuntimeLoopRemainder()
670 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()
|
| H A D | LoopPeel.cpp | 334 if (isa<SCEVCouldNotCompute>(BTC)) in canPeelLastIteration()
|