Lines Matching refs:getCouldNotCompute
913 return SE.getCouldNotCompute(); in BinomialCoefficient()
1023 return getCouldNotCompute(); in getLosslessPtrToIntExpr()
1033 return getCouldNotCompute(); in getLosslessPtrToIntExpr()
4504 const SCEV *ScalarEvolution::getCouldNotCompute() { in getCouldNotCompute() function in ScalarEvolution
4685 return getCouldNotCompute(); in getMinusSCEV()
4889 return SE.getCouldNotCompute(); in rewrite()
4891 ? SE.getCouldNotCompute() in rewrite()
4932 ? SE.getCouldNotCompute() in rewrite()
5049 return Rewriter.isValid() ? Result : SE.getCouldNotCompute(); in rewrite()
5934 if (Shifted != getCouldNotCompute() && in createAddRecFromPHI()
5935 Start != getCouldNotCompute()) { in createAddRecFromPHI()
8129 return getCouldNotCompute(); in getTripCountFromExitCount()
8142 return getCouldNotCompute(); in getTripCountFromExitCount()
8220 if (ExitCount == getCouldNotCompute()) in getSmallConstantTripMultiple()
8560 return SE->getCouldNotCompute(); in getExact()
8565 return SE->getCouldNotCompute(); in getExact()
8572 assert(BECount != SE->getCouldNotCompute() && "Bad exit SCEV!"); in getExact()
8601 return SE->getCouldNotCompute(); in getExact()
8610 return SE->getCouldNotCompute(); in getConstantMax()
8619 return SE->getCouldNotCompute(); in getSymbolicMax()
8630 return SE->getCouldNotCompute(); in getConstantMax()
8762 if (EL.ExactNotTaken != getCouldNotCompute()) in computeBackedgeTakenCount()
8770 if (EL.SymbolicMaxNotTaken != getCouldNotCompute()) in computeBackedgeTakenCount()
8773 assert(EL.ExactNotTaken == getCouldNotCompute() && in computeBackedgeTakenCount()
8789 if (EL.ConstantMaxNotTaken != getCouldNotCompute() && Latch && in computeBackedgeTakenCount()
8798 } else if (MayExitMaxBECount != getCouldNotCompute()) { in computeBackedgeTakenCount()
8799 if (!MayExitMaxBECount || EL.ConstantMaxNotTaken == getCouldNotCompute()) in computeBackedgeTakenCount()
8808 (MayExitMaxBECount ? MayExitMaxBECount : getCouldNotCompute()); in computeBackedgeTakenCount()
8836 return getCouldNotCompute(); in computeExitLimit()
8857 return getCouldNotCompute(); in computeExitLimit()
8866 return getCouldNotCompute(); in computeExitLimit()
8952 return getCouldNotCompute(); in computeExitLimitFromCondImpl()
9017 const SCEV *BECount = getCouldNotCompute(); in computeExitLimitFromCondFromBinOp()
9018 const SCEV *ConstantMaxBECount = getCouldNotCompute(); in computeExitLimitFromCondFromBinOp()
9019 const SCEV *SymbolicMaxBECount = getCouldNotCompute(); in computeExitLimitFromCondFromBinOp()
9024 if (EL0.ExactNotTaken != getCouldNotCompute() && in computeExitLimitFromCondFromBinOp()
9025 EL1.ExactNotTaken != getCouldNotCompute()) { in computeExitLimitFromCondFromBinOp()
9029 if (EL0.ConstantMaxNotTaken == getCouldNotCompute()) in computeExitLimitFromCondFromBinOp()
9031 else if (EL1.ConstantMaxNotTaken == getCouldNotCompute()) in computeExitLimitFromCondFromBinOp()
9036 if (EL0.SymbolicMaxNotTaken == getCouldNotCompute()) in computeExitLimitFromCondFromBinOp()
9038 else if (EL1.SymbolicMaxNotTaken == getCouldNotCompute()) in computeExitLimitFromCondFromBinOp()
9227 return getCouldNotCompute(); in computeExitLimitFromICmp()
9239 return getCouldNotCompute(); in computeExitLimitFromSingleExitSwitch()
9251 return getCouldNotCompute(); in computeExitLimitFromSingleExitSwitch()
9268 return getCouldNotCompute(); in computeShiftCompareExitLimit()
9272 return getCouldNotCompute(); in computeShiftCompareExitLimit()
9276 return getCouldNotCompute(); in computeShiftCompareExitLimit()
9352 return getCouldNotCompute(); in computeShiftCompareExitLimit()
9380 return getCouldNotCompute(); in computeShiftCompareExitLimit()
9401 return ExitLimit(getCouldNotCompute(), UpperBound, UpperBound, false); in computeShiftCompareExitLimit()
9404 return getCouldNotCompute(); in computeShiftCompareExitLimit()
9652 if (!PN) return getCouldNotCompute(); in computeExitCountExhaustively()
9656 if (PN->getNumIncomingValues() != 2) return getCouldNotCompute(); in computeExitCountExhaustively()
9670 return getCouldNotCompute(); in computeExitCountExhaustively()
9682 if (!CondVal) return getCouldNotCompute(); in computeExitCountExhaustively()
9712 return getCouldNotCompute(); in computeExitCountExhaustively()
9881 if (BackedgeTakenCount == getCouldNotCompute()) in computeSCEVAtScope()
10074 return SE.getCouldNotCompute(); in SolveLinEquationWithOverflow()
10383 return getCouldNotCompute(); // Otherwise it will loop infinitely. in howFarToZero()
10396 return getCouldNotCompute(); in howFarToZero()
10408 return getCouldNotCompute(); in howFarToZero()
10413 return getCouldNotCompute(); in howFarToZero()
10438 return getCouldNotCompute(); in howFarToZero()
10484 const SCEV *ConstantMax = getCouldNotCompute(); in howFarToZero()
10485 if (Exact != getCouldNotCompute()) { in howFarToZero()
10500 if (E != getCouldNotCompute()) { in howFarToZero()
10519 return getCouldNotCompute(); // Otherwise it will loop infinitely. in howFarToNonZero()
10524 return getCouldNotCompute(); in howFarToNonZero()
10797 if (Start == getCouldNotCompute()) in SplitIntoInitAndPostInc()
10801 assert(PostInc != getCouldNotCompute() && "Unexpected could not compute"); in SplitIntoInitAndPostInc()
10833 if (SplitLHS.first == getCouldNotCompute()) in isKnownViaInduction()
10835 assert (SplitLHS.second != getCouldNotCompute() && "Unexpected CNC"); in isKnownViaInduction()
10839 if (SplitRHS.first == getCouldNotCompute()) in isKnownViaInduction()
10841 assert (SplitRHS.second != getCouldNotCompute() && "Unexpected CNC"); in isKnownViaInduction()
11363 if (LatchBECount != getCouldNotCompute()) { in isLoopBackedgeGuardedByCond()
12660 return getCouldNotCompute(); in computeMaxBECountForLT()
12793 return getCouldNotCompute(); in howManyLessThans()
12849 return getCouldNotCompute(); in howManyLessThans()
12856 return getCouldNotCompute(); in howManyLessThans()
12897 return getCouldNotCompute(); in howManyLessThans()
12936 return ExitLimit(getCouldNotCompute() /* ExactNotTaken */, MaxBECount, in howManyLessThans()
13136 return getCouldNotCompute(); in howManyGreaterThans()
13147 return getCouldNotCompute(); in howManyGreaterThans()
13157 return getCouldNotCompute(); in howManyGreaterThans()
13165 return getCouldNotCompute(); in howManyGreaterThans()
13232 return SE.getCouldNotCompute(); in getNumIterationsInRange()
13245 return SE.getCouldNotCompute(); in getNumIterationsInRange()
13251 return SE.getCouldNotCompute(); in getNumIterationsInRange()
13282 return SE.getCouldNotCompute(); // Something strange happened in getNumIterationsInRange()
13297 return SE.getCouldNotCompute(); in getNumIterationsInRange()
14033 return SE.getCouldNotCompute(); in verify()
14078 if (CurBECount == SE2.getCouldNotCompute() || in verify()
14079 NewBECount == SE2.getCouldNotCompute()) { in verify()
14934 return getCouldNotCompute(); in computeSymbolicMaxBackedgeTakenCount()