Searched refs:getCouldNotCompute (Results 1 – 18 of 18) sorted by relevance
712 return SE.getCouldNotCompute(); in BinomialCoefficient()2698 const SCEV *ScalarEvolution::getCouldNotCompute() { in getCouldNotCompute() function in ScalarEvolution3950 if (ExitCount == getCouldNotCompute()) in getSmallConstantTripMultiple()4032 if (Result.getExact(this) != getCouldNotCompute()) { in getBackedgeTakenInfo()4038 else if (Result.getMax(this) == getCouldNotCompute() && in getBackedgeTakenInfo()4160 if (!ExitNotTaken.isCompleteList()) return SE->getCouldNotCompute(); in getExact()4163 if (!ExitNotTaken.ExitingBlock) return SE->getCouldNotCompute(); in getExact()4170 assert(ENT->ExactNotTaken != SE->getCouldNotCompute() && "bad exit SCEV"); in getExact()4191 return SE->getCouldNotCompute(); in getExact()4197 return Max ? Max : SE->getCouldNotCompute(); in getMax()[all …]
987 return SE.getCouldNotCompute(); in BinomialCoefficient()3310 const SCEV *ScalarEvolution::getCouldNotCompute() { in getCouldNotCompute() function in ScalarEvolution3694 return Rewriter.isValid() ? Result : SE.getCouldNotCompute(); in rewrite()3727 return Rewriter.isValid() ? Result : SE.getCouldNotCompute(); in rewrite()4040 if (Shifted != getCouldNotCompute() && in createAddRecFromPHI()4041 Start != getCouldNotCompute()) { in createAddRecFromPHI()5301 if (ExitCount == getCouldNotCompute()) in getSmallConstantTripMultiple()5395 if (Result.getExact(this) != getCouldNotCompute()) { in getBackedgeTakenInfo()5401 else if (Result.getMax(this) == getCouldNotCompute() && in getBackedgeTakenInfo()5536 if (!ExitNotTaken.isCompleteList()) return SE->getCouldNotCompute(); in getExact()[all …]
1498 if (ExitCount == PSE->getSE()->getCouldNotCompute()) { in canAnalyzeLoop()
2041 assert(ExitCount != SE.getCouldNotCompute() && "Invalid loop count"); in generateOverflowCheck()
1145 return SE.getCouldNotCompute(); in BinomialCoefficient()3808 const SCEV *ScalarEvolution::getCouldNotCompute() { in getCouldNotCompute() function in ScalarEvolution4222 return SE.getCouldNotCompute(); in rewrite()4224 ? SE.getCouldNotCompute() in rewrite()4265 ? SE.getCouldNotCompute() in rewrite()4382 return Rewriter.isValid() ? Result : SE.getCouldNotCompute(); in rewrite()5146 if (Shifted != getCouldNotCompute() && in createAddRecFromPHI()5147 Start != getCouldNotCompute()) { in createAddRecFromPHI()6559 if (ExitCount == getCouldNotCompute()) in getSmallConstantTripMultiple()6661 if (BEExact != getCouldNotCompute()) { in getBackedgeTakenInfo()[all …]
1753 if (ExitCount == PSE->getSE()->getCouldNotCompute()) { in canAnalyzeLoop()
2157 assert(ExitCount != SE.getCouldNotCompute() && "Invalid loop count"); in generateOverflowCheck()
240 if (MaxTrips != SE->getCouldNotCompute() && in mustBeFiniteCountedLoop()252 if (MaxExec != SE->getCouldNotCompute() && in mustBeFiniteCountedLoop()
255 if (ExitCount == SE->getCouldNotCompute()) { in legalLoopStructure()
476 if (ExitCountOuter == SE->getCouldNotCompute()) { in isComputableLoopNest()
247 if (MaxTrips != SE->getCouldNotCompute() && in mustBeFiniteCountedLoop()259 if (MaxExec != SE->getCouldNotCompute() && in mustBeFiniteCountedLoop()
288 if (ExitCount == SE->getCouldNotCompute()) { in legalLoopStructure()
493 if (ExitCountOuter == SE->getCouldNotCompute()) { in isComputableLoopNest()
616 const SCEV *getCouldNotCompute();
1251 const SCEV *getCouldNotCompute();
594 const SCEV *getCouldNotCompute();
2763 assert(BackedgeTakenCount != SE->getCouldNotCompute() && in getOrCreateTripCount()4440 if (ExitCount == PSE.getSE()->getCouldNotCompute()) { in canVectorize()
2601 assert(BackedgeTakenCount != SE->getCouldNotCompute() && in getOrCreateTripCount()