Lines Matching refs:getCouldNotCompute
983 return SE.getCouldNotCompute(); in BinomialCoefficient()
1093 return getCouldNotCompute(); in getLosslessPtrToIntExpr()
1103 return getCouldNotCompute(); in getLosslessPtrToIntExpr()
4338 const SCEV *ScalarEvolution::getCouldNotCompute() { in getCouldNotCompute() function in ScalarEvolution
4526 return getCouldNotCompute(); in getMinusSCEV()
4730 return SE.getCouldNotCompute(); in rewrite()
4732 ? SE.getCouldNotCompute() in rewrite()
4773 ? SE.getCouldNotCompute() in rewrite()
4890 return Rewriter.isValid() ? Result : SE.getCouldNotCompute(); in rewrite()
5735 if (Shifted != getCouldNotCompute() && in createAddRecFromPHI()
5736 Start != getCouldNotCompute()) { in createAddRecFromPHI()
7886 return getCouldNotCompute(); in getTripCountFromExitCount()
7940 return getCouldNotCompute(); in getConstantMaxTripCountFromArray()
7949 return getCouldNotCompute(); in getConstantMaxTripCountFromArray()
8051 return getCouldNotCompute(); in getConstantMaxTripCountFromArray()
8072 if (ExitCount == getCouldNotCompute()) in getSmallConstantTripMultiple()
8207 if (BEExact != getCouldNotCompute()) { in getBackedgeTakenInfo()
8212 } else if (Result.getConstantMax(this) == getCouldNotCompute() && in getBackedgeTakenInfo()
8371 return SE->getCouldNotCompute(); in getExact()
8376 return SE->getCouldNotCompute(); in getExact()
8383 assert(BECount != SE->getCouldNotCompute() && "Bad exit SCEV!"); in getExact()
8412 return SE->getCouldNotCompute(); in getExact()
8421 return SE->getCouldNotCompute(); in getConstantMax()
8432 return SE->getCouldNotCompute(); in getConstantMax()
8557 if (EL.ExactNotTaken == getCouldNotCompute()) in computeBackedgeTakenCount()
8574 if (EL.MaxNotTaken != getCouldNotCompute() && Latch && in computeBackedgeTakenCount()
8583 } else if (MayExitMaxBECount != getCouldNotCompute()) { in computeBackedgeTakenCount()
8584 if (!MayExitMaxBECount || EL.MaxNotTaken == getCouldNotCompute()) in computeBackedgeTakenCount()
8593 (MayExitMaxBECount ? MayExitMaxBECount : getCouldNotCompute()); in computeBackedgeTakenCount()
8616 return getCouldNotCompute(); in computeExitLimit()
8637 return getCouldNotCompute(); in computeExitLimit()
8645 return getCouldNotCompute(); in computeExitLimit()
8730 return getCouldNotCompute(); in computeExitLimitFromCondImpl()
8795 const SCEV *BECount = getCouldNotCompute(); in computeExitLimitFromCondFromBinOp()
8796 const SCEV *MaxBECount = getCouldNotCompute(); in computeExitLimitFromCondFromBinOp()
8800 if (EL0.ExactNotTaken != getCouldNotCompute() && in computeExitLimitFromCondFromBinOp()
8801 EL1.ExactNotTaken != getCouldNotCompute()) { in computeExitLimitFromCondFromBinOp()
8806 if (EL0.MaxNotTaken == getCouldNotCompute()) in computeExitLimitFromCondFromBinOp()
8808 else if (EL1.MaxNotTaken == getCouldNotCompute()) in computeExitLimitFromCondFromBinOp()
8980 return getCouldNotCompute(); in computeExitLimitFromICmp()
8992 return getCouldNotCompute(); in computeExitLimitFromSingleExitSwitch()
9004 return getCouldNotCompute(); in computeExitLimitFromSingleExitSwitch()
9021 return getCouldNotCompute(); in computeShiftCompareExitLimit()
9025 return getCouldNotCompute(); in computeShiftCompareExitLimit()
9029 return getCouldNotCompute(); in computeShiftCompareExitLimit()
9105 return getCouldNotCompute(); in computeShiftCompareExitLimit()
9133 return getCouldNotCompute(); in computeShiftCompareExitLimit()
9154 return ExitLimit(getCouldNotCompute(), UpperBound, false); in computeShiftCompareExitLimit()
9157 return getCouldNotCompute(); in computeShiftCompareExitLimit()
9405 if (!PN) return getCouldNotCompute(); in computeExitCountExhaustively()
9409 if (PN->getNumIncomingValues() != 2) return getCouldNotCompute(); in computeExitCountExhaustively()
9423 return getCouldNotCompute(); in computeExitCountExhaustively()
9435 if (!CondVal) return getCouldNotCompute(); in computeExitCountExhaustively()
9465 return getCouldNotCompute(); in computeExitCountExhaustively()
9771 if (BackedgeTakenCount == getCouldNotCompute()) return AddRec; in computeSCEVAtScope()
9828 return SE.getCouldNotCompute(); in SolveLinEquationWithOverflow()
10132 return getCouldNotCompute(); // Otherwise it will loop infinitely. in howFarToZero()
10145 return getCouldNotCompute(); in howFarToZero()
10157 return getCouldNotCompute(); in howFarToZero()
10162 return getCouldNotCompute(); in howFarToZero()
10187 return getCouldNotCompute(); in howFarToZero()
10232 const SCEV *Max = getCouldNotCompute(); in howFarToZero()
10233 if (Exact != getCouldNotCompute()) { in howFarToZero()
10245 if (E != getCouldNotCompute()) { in howFarToZero()
10263 return getCouldNotCompute(); // Otherwise it will loop infinitely. in howFarToNonZero()
10268 return getCouldNotCompute(); in howFarToNonZero()
10545 if (Start == getCouldNotCompute()) in SplitIntoInitAndPostInc()
10549 assert(PostInc != getCouldNotCompute() && "Unexpected could not compute"); in SplitIntoInitAndPostInc()
10581 if (SplitLHS.first == getCouldNotCompute()) in isKnownViaInduction()
10583 assert (SplitLHS.second != getCouldNotCompute() && "Unexpected CNC"); in isKnownViaInduction()
10587 if (SplitRHS.first == getCouldNotCompute()) in isKnownViaInduction()
10589 assert (SplitRHS.second != getCouldNotCompute() && "Unexpected CNC"); in isKnownViaInduction()
11055 if (LatchBECount != getCouldNotCompute()) { in isLoopBackedgeGuardedByCond()
12476 return getCouldNotCompute(); in howManyLessThans()
12532 return getCouldNotCompute(); in howManyLessThans()
12539 return getCouldNotCompute(); in howManyLessThans()
12546 return getCouldNotCompute(); in howManyLessThans()
12587 return getCouldNotCompute(); in howManyLessThans()
12626 return ExitLimit(getCouldNotCompute() /* ExactNotTaken */, MaxBECount, in howManyLessThans()
12820 return getCouldNotCompute(); in howManyGreaterThans()
12831 return getCouldNotCompute(); in howManyGreaterThans()
12841 return getCouldNotCompute(); in howManyGreaterThans()
12849 return getCouldNotCompute(); in howManyGreaterThans()
12912 return SE.getCouldNotCompute(); in getNumIterationsInRange()
12925 return SE.getCouldNotCompute(); in getNumIterationsInRange()
12931 return SE.getCouldNotCompute(); in getNumIterationsInRange()
12962 return SE.getCouldNotCompute(); // Something strange happened in getNumIterationsInRange()
12977 return SE.getCouldNotCompute(); in getNumIterationsInRange()
13700 return SE.getCouldNotCompute(); in verify()
13745 if (CurBECount == SE2.getCouldNotCompute() || in verify()
13746 NewBECount == SE2.getCouldNotCompute()) { in verify()
14530 return getCouldNotCompute(); in computeSymbolicMaxBackedgeTakenCount()