Lines Matching refs:getCouldNotCompute
920 return SE.getCouldNotCompute(); in BinomialCoefficient()
1025 return getCouldNotCompute(); in getLosslessPtrToIntExpr()
1035 return getCouldNotCompute(); in getLosslessPtrToIntExpr()
4509 const SCEV *ScalarEvolution::getCouldNotCompute() { in getCouldNotCompute() function in ScalarEvolution
4690 return getCouldNotCompute(); in getMinusSCEV()
4894 return SE.getCouldNotCompute(); in rewrite()
4896 ? SE.getCouldNotCompute() in rewrite()
4937 ? SE.getCouldNotCompute() in rewrite()
5054 return Rewriter.isValid() ? Result : SE.getCouldNotCompute(); in rewrite()
5941 if (Shifted != getCouldNotCompute() && in createAddRecFromPHI()
5942 Start != getCouldNotCompute()) { in createAddRecFromPHI()
8145 return getCouldNotCompute(); in getTripCountFromExitCount()
8158 return getCouldNotCompute(); in getTripCountFromExitCount()
8236 if (ExitCount == getCouldNotCompute()) in getSmallConstantTripMultiple()
8581 return SE->getCouldNotCompute(); in getExact()
8586 return SE->getCouldNotCompute(); in getExact()
8593 assert(BECount != SE->getCouldNotCompute() && "Bad exit SCEV!"); in getExact()
8622 return SE->getCouldNotCompute(); in getExact()
8631 return SE->getCouldNotCompute(); in getConstantMax()
8640 return SE->getCouldNotCompute(); in getSymbolicMax()
8651 return SE->getCouldNotCompute(); in getConstantMax()
8685 SymbolicMax = SE->getCouldNotCompute(); in getSymbolicMax()
8808 if (EL.ExactNotTaken != getCouldNotCompute()) in computeBackedgeTakenCount()
8816 if (EL.SymbolicMaxNotTaken != getCouldNotCompute()) in computeBackedgeTakenCount()
8819 assert(EL.ExactNotTaken == getCouldNotCompute() && in computeBackedgeTakenCount()
8835 if (EL.ConstantMaxNotTaken != getCouldNotCompute() && Latch && in computeBackedgeTakenCount()
8844 } else if (MayExitMaxBECount != getCouldNotCompute()) { in computeBackedgeTakenCount()
8845 if (!MayExitMaxBECount || EL.ConstantMaxNotTaken == getCouldNotCompute()) in computeBackedgeTakenCount()
8854 (MayExitMaxBECount ? MayExitMaxBECount : getCouldNotCompute()); in computeBackedgeTakenCount()
8882 return getCouldNotCompute(); in computeExitLimit()
8902 return getCouldNotCompute(); in computeExitLimit()
8910 return getCouldNotCompute(); in computeExitLimit()
8996 return getCouldNotCompute(); in computeExitLimitFromCondImpl()
9061 const SCEV *BECount = getCouldNotCompute(); in computeExitLimitFromCondFromBinOp()
9062 const SCEV *ConstantMaxBECount = getCouldNotCompute(); in computeExitLimitFromCondFromBinOp()
9063 const SCEV *SymbolicMaxBECount = getCouldNotCompute(); in computeExitLimitFromCondFromBinOp()
9068 if (EL0.ExactNotTaken != getCouldNotCompute() && in computeExitLimitFromCondFromBinOp()
9069 EL1.ExactNotTaken != getCouldNotCompute()) { in computeExitLimitFromCondFromBinOp()
9073 if (EL0.ConstantMaxNotTaken == getCouldNotCompute()) in computeExitLimitFromCondFromBinOp()
9075 else if (EL1.ConstantMaxNotTaken == getCouldNotCompute()) in computeExitLimitFromCondFromBinOp()
9080 if (EL0.SymbolicMaxNotTaken == getCouldNotCompute()) in computeExitLimitFromCondFromBinOp()
9082 else if (EL1.SymbolicMaxNotTaken == getCouldNotCompute()) in computeExitLimitFromCondFromBinOp()
9288 return getCouldNotCompute(); in computeExitLimitFromICmp()
9300 return getCouldNotCompute(); in computeExitLimitFromSingleExitSwitch()
9312 return getCouldNotCompute(); in computeExitLimitFromSingleExitSwitch()
9329 return getCouldNotCompute(); in computeShiftCompareExitLimit()
9333 return getCouldNotCompute(); in computeShiftCompareExitLimit()
9337 return getCouldNotCompute(); in computeShiftCompareExitLimit()
9413 return getCouldNotCompute(); in computeShiftCompareExitLimit()
9441 return getCouldNotCompute(); in computeShiftCompareExitLimit()
9462 return ExitLimit(getCouldNotCompute(), UpperBound, UpperBound, false); in computeShiftCompareExitLimit()
9465 return getCouldNotCompute(); in computeShiftCompareExitLimit()
9714 if (!PN) return getCouldNotCompute(); in computeExitCountExhaustively()
9718 if (PN->getNumIncomingValues() != 2) return getCouldNotCompute(); in computeExitCountExhaustively()
9732 return getCouldNotCompute(); in computeExitCountExhaustively()
9744 if (!CondVal) return getCouldNotCompute(); in computeExitCountExhaustively()
9774 return getCouldNotCompute(); in computeExitCountExhaustively()
9943 if (BackedgeTakenCount == getCouldNotCompute()) in computeSCEVAtScope()
10137 return SE.getCouldNotCompute(); in SolveLinEquationWithOverflow()
10444 return getCouldNotCompute(); // Otherwise it will loop infinitely. in howFarToZero()
10457 return getCouldNotCompute(); in howFarToZero()
10469 return getCouldNotCompute(); in howFarToZero()
10474 return getCouldNotCompute(); in howFarToZero()
10493 return getCouldNotCompute(); in howFarToZero()
10506 return getCouldNotCompute(); in howFarToZero()
10549 return getCouldNotCompute(); in howFarToZero()
10553 const SCEV *ConstantMax = getCouldNotCompute(); in howFarToZero()
10554 if (Exact != getCouldNotCompute()) { in howFarToZero()
10566 return getCouldNotCompute(); in howFarToZero()
10571 if (E != getCouldNotCompute()) { in howFarToZero()
10590 return getCouldNotCompute(); // Otherwise it will loop infinitely. in howFarToNonZero()
10595 return getCouldNotCompute(); in howFarToNonZero()
10876 if (Start == getCouldNotCompute()) in SplitIntoInitAndPostInc()
10880 assert(PostInc != getCouldNotCompute() && "Unexpected could not compute"); in SplitIntoInitAndPostInc()
10911 if (SplitLHS.first == getCouldNotCompute()) in isKnownViaInduction()
10913 assert (SplitLHS.second != getCouldNotCompute() && "Unexpected CNC"); in isKnownViaInduction()
10917 if (SplitRHS.first == getCouldNotCompute()) in isKnownViaInduction()
10919 assert (SplitRHS.second != getCouldNotCompute() && "Unexpected CNC"); in isKnownViaInduction()
11441 if (LatchBECount != getCouldNotCompute()) { in isLoopBackedgeGuardedByCond()
12738 return getCouldNotCompute(); in computeMaxBECountForLT()
12871 return getCouldNotCompute(); in howManyLessThans()
12927 return getCouldNotCompute(); in howManyLessThans()
12934 return getCouldNotCompute(); in howManyLessThans()
12975 return getCouldNotCompute(); in howManyLessThans()
13058 return ExitLimit(getCouldNotCompute() /* ExactNotTaken */, MaxBECount, in howManyLessThans()
13262 return getCouldNotCompute(); in howManyGreaterThans()
13273 return getCouldNotCompute(); in howManyGreaterThans()
13283 return getCouldNotCompute(); in howManyGreaterThans()
13291 return getCouldNotCompute(); in howManyGreaterThans()
13358 return SE.getCouldNotCompute(); in getNumIterationsInRange()
13371 return SE.getCouldNotCompute(); in getNumIterationsInRange()
13377 return SE.getCouldNotCompute(); in getNumIterationsInRange()
13408 return SE.getCouldNotCompute(); // Something strange happened in getNumIterationsInRange()
13423 return SE.getCouldNotCompute(); in getNumIterationsInRange()
14195 return SE.getCouldNotCompute(); in verify()
14240 if (CurBECount == SE2.getCouldNotCompute() || in verify()
14241 NewBECount == SE2.getCouldNotCompute()) { in verify()