Lines Matching refs:getCouldNotCompute
957 return SE.getCouldNotCompute(); in BinomialCoefficient()
3765 const SCEV *ScalarEvolution::getCouldNotCompute() { in getCouldNotCompute() function in ScalarEvolution
4211 return SE.getCouldNotCompute(); in rewrite()
4213 ? SE.getCouldNotCompute() in rewrite()
4254 ? SE.getCouldNotCompute() in rewrite()
4371 return Rewriter.isValid() ? Result : SE.getCouldNotCompute(); in rewrite()
5215 if (Shifted != getCouldNotCompute() && in createAddRecFromPHI()
5216 Start != getCouldNotCompute()) { in createAddRecFromPHI()
6863 if (ExitCount == getCouldNotCompute()) in getSmallConstantTripMultiple()
6973 if (BEExact != getCouldNotCompute()) { in getBackedgeTakenInfo()
6978 } else if (Result.getConstantMax(this) == getCouldNotCompute() && in getBackedgeTakenInfo()
7189 return SE->getCouldNotCompute(); in getExact()
7194 return SE->getCouldNotCompute(); in getExact()
7201 assert(BECount != SE->getCouldNotCompute() && "Bad exit SCEV!"); in getExact()
7226 return SE->getCouldNotCompute(); in getExact()
7235 return SE->getCouldNotCompute(); in getConstantMax()
7246 return SE->getCouldNotCompute(); in getConstantMax()
7272 if (getConstantMax() && getConstantMax() != SE->getCouldNotCompute() && in hasOperand()
7277 if (ENT.ExactNotTaken != SE->getCouldNotCompute() && in hasOperand()
7397 if (EL.ExactNotTaken == getCouldNotCompute()) in computeBackedgeTakenCount()
7414 if (EL.MaxNotTaken != getCouldNotCompute() && Latch && in computeBackedgeTakenCount()
7423 } else if (MayExitMaxBECount != getCouldNotCompute()) { in computeBackedgeTakenCount()
7424 if (!MayExitMaxBECount || EL.MaxNotTaken == getCouldNotCompute()) in computeBackedgeTakenCount()
7433 (MayExitMaxBECount ? MayExitMaxBECount : getCouldNotCompute()); in computeBackedgeTakenCount()
7449 return getCouldNotCompute(); in computeExitLimit()
7470 return getCouldNotCompute(); in computeExitLimit()
7478 return getCouldNotCompute(); in computeExitLimit()
7563 return getCouldNotCompute(); in computeExitLimitFromCondImpl()
7608 const SCEV *BECount = getCouldNotCompute(); in computeExitLimitFromCondFromBinOpHelper()
7609 const SCEV *MaxBECount = getCouldNotCompute(); in computeExitLimitFromCondFromBinOpHelper()
7613 if (EL0.ExactNotTaken == getCouldNotCompute() || in computeExitLimitFromCondFromBinOpHelper()
7614 EL1.ExactNotTaken == getCouldNotCompute()) in computeExitLimitFromCondFromBinOpHelper()
7615 BECount = getCouldNotCompute(); in computeExitLimitFromCondFromBinOpHelper()
7619 if (EL0.MaxNotTaken == getCouldNotCompute()) in computeExitLimitFromCondFromBinOpHelper()
7621 else if (EL1.MaxNotTaken == getCouldNotCompute()) in computeExitLimitFromCondFromBinOpHelper()
7753 return getCouldNotCompute(); in computeExitLimitFromSingleExitSwitch()
7765 return getCouldNotCompute(); in computeExitLimitFromSingleExitSwitch()
7786 if (LI->isVolatile()) return getCouldNotCompute(); in computeLoadConstantCompareExitLimit()
7791 if (!GEP) return getCouldNotCompute(); in computeLoadConstantCompareExitLimit()
7799 return getCouldNotCompute(); in computeLoadConstantCompareExitLimit()
7809 if (VarIdx) return getCouldNotCompute(); // Multiple non-constant idx's. in computeLoadConstantCompareExitLimit()
7817 return getCouldNotCompute(); in computeLoadConstantCompareExitLimit()
7830 return getCouldNotCompute(); in computeLoadConstantCompareExitLimit()
7853 return getCouldNotCompute(); in computeLoadConstantCompareExitLimit()
7860 return getCouldNotCompute(); in computeShiftCompareExitLimit()
7864 return getCouldNotCompute(); in computeShiftCompareExitLimit()
7868 return getCouldNotCompute(); in computeShiftCompareExitLimit()
7944 return getCouldNotCompute(); in computeShiftCompareExitLimit()
7972 return getCouldNotCompute(); in computeShiftCompareExitLimit()
7993 return ExitLimit(getCouldNotCompute(), UpperBound, false); in computeShiftCompareExitLimit()
7996 return getCouldNotCompute(); in computeShiftCompareExitLimit()
8251 if (!PN) return getCouldNotCompute(); in computeExitCountExhaustively()
8255 if (PN->getNumIncomingValues() != 2) return getCouldNotCompute(); in computeExitCountExhaustively()
8269 return getCouldNotCompute(); in computeExitCountExhaustively()
8281 if (!CondVal) return getCouldNotCompute(); in computeExitCountExhaustively()
8311 return getCouldNotCompute(); in computeExitCountExhaustively()
8643 if (BackedgeTakenCount == getCouldNotCompute()) return AddRec; in computeSCEVAtScope()
8721 return SE.getCouldNotCompute(); in SolveLinEquationWithOverflow()
9025 return getCouldNotCompute(); // Otherwise it will loop infinitely. in howFarToZero()
9038 return getCouldNotCompute(); in howFarToZero()
9050 return getCouldNotCompute(); in howFarToZero()
9055 return getCouldNotCompute(); in howFarToZero()
9080 return getCouldNotCompute(); in howFarToZero()
9128 Exact == getCouldNotCompute() in howFarToZero()
9137 const SCEV *M = E == getCouldNotCompute() in howFarToZero()
9154 return getCouldNotCompute(); // Otherwise it will loop infinitely. in howFarToNonZero()
9159 return getCouldNotCompute(); in howFarToNonZero()
9429 if (Start == getCouldNotCompute()) in SplitIntoInitAndPostInc()
9433 assert(PostInc != getCouldNotCompute() && "Unexpected could not compute"); in SplitIntoInitAndPostInc()
9465 if (SplitLHS.first == getCouldNotCompute()) in isKnownViaInduction()
9467 assert (SplitLHS.second != getCouldNotCompute() && "Unexpected CNC"); in isKnownViaInduction()
9471 if (SplitRHS.first == getCouldNotCompute()) in isKnownViaInduction()
9473 assert (SplitRHS.second != getCouldNotCompute() && "Unexpected CNC"); in isKnownViaInduction()
9880 if (LatchBECount != getCouldNotCompute()) { in isLoopBackedgeGuardedByCond()
11120 return getCouldNotCompute(); in howManyLessThans()
11175 return getCouldNotCompute(); in howManyLessThans()
11182 return getCouldNotCompute(); in howManyLessThans()
11196 return ExitLimit(getCouldNotCompute() /* ExactNotTaken */, MaxBECount, in howManyLessThans()
11255 return getCouldNotCompute(); in howManyGreaterThans()
11266 return getCouldNotCompute(); in howManyGreaterThans()
11275 return getCouldNotCompute(); in howManyGreaterThans()
11282 return getCouldNotCompute(); in howManyGreaterThans()
11332 return SE.getCouldNotCompute(); in getNumIterationsInRange()
11345 return SE.getCouldNotCompute(); in getNumIterationsInRange()
11351 return SE.getCouldNotCompute(); in getNumIterationsInRange()
11382 return SE.getCouldNotCompute(); // Something strange happened in getNumIterationsInRange()
11397 return SE.getCouldNotCompute(); in getNumIterationsInRange()
12520 return SE.getCouldNotCompute(); in verify()
12534 if (CurBECount == SE2.getCouldNotCompute() || in verify()
12535 NewBECount == SE2.getCouldNotCompute()) { in verify()
13197 return getCouldNotCompute(); in computeSymbolicMaxBackedgeTakenCount()