Lines Matching refs:getCouldNotCompute
966 return SE.getCouldNotCompute(); in BinomialCoefficient()
1076 return getCouldNotCompute(); in getLosslessPtrToIntExpr()
1086 return getCouldNotCompute(); in getLosslessPtrToIntExpr()
3946 const SCEV *ScalarEvolution::getCouldNotCompute() { in getCouldNotCompute() function in ScalarEvolution
4197 return getCouldNotCompute(); in getMinusSCEV()
4438 return SE.getCouldNotCompute(); in rewrite()
4440 ? SE.getCouldNotCompute() in rewrite()
4481 ? SE.getCouldNotCompute() in rewrite()
4598 return Rewriter.isValid() ? Result : SE.getCouldNotCompute(); in rewrite()
5438 if (Shifted != getCouldNotCompute() && in createAddRecFromPHI()
5439 Start != getCouldNotCompute()) { in createAddRecFromPHI()
7205 if (ExitCount == getCouldNotCompute()) in getSmallConstantTripMultiple()
7338 if (BEExact != getCouldNotCompute()) { in getBackedgeTakenInfo()
7343 } else if (Result.getConstantMax(this) == getCouldNotCompute() && in getBackedgeTakenInfo()
7545 return SE->getCouldNotCompute(); in getExact()
7550 return SE->getCouldNotCompute(); in getExact()
7557 assert(BECount != SE->getCouldNotCompute() && "Bad exit SCEV!"); in getExact()
7582 return SE->getCouldNotCompute(); in getExact()
7591 return SE->getCouldNotCompute(); in getConstantMax()
7602 return SE->getCouldNotCompute(); in getConstantMax()
7754 if (EL.ExactNotTaken == getCouldNotCompute()) in computeBackedgeTakenCount()
7771 if (EL.MaxNotTaken != getCouldNotCompute() && Latch && in computeBackedgeTakenCount()
7780 } else if (MayExitMaxBECount != getCouldNotCompute()) { in computeBackedgeTakenCount()
7781 if (!MayExitMaxBECount || EL.MaxNotTaken == getCouldNotCompute()) in computeBackedgeTakenCount()
7790 (MayExitMaxBECount ? MayExitMaxBECount : getCouldNotCompute()); in computeBackedgeTakenCount()
7806 return getCouldNotCompute(); in computeExitLimit()
7827 return getCouldNotCompute(); in computeExitLimit()
7835 return getCouldNotCompute(); in computeExitLimit()
7920 return getCouldNotCompute(); in computeExitLimitFromCondImpl()
7962 const SCEV *BECount = getCouldNotCompute(); in computeExitLimitFromCondFromBinOp()
7963 const SCEV *MaxBECount = getCouldNotCompute(); in computeExitLimitFromCondFromBinOp()
7983 if (EL0.ExactNotTaken != getCouldNotCompute() && in computeExitLimitFromCondFromBinOp()
7984 EL1.ExactNotTaken != getCouldNotCompute() && PoisonSafe) { in computeExitLimitFromCondFromBinOp()
7993 if (EL0.MaxNotTaken == getCouldNotCompute()) in computeExitLimitFromCondFromBinOp()
7995 else if (EL1.MaxNotTaken == getCouldNotCompute()) in computeExitLimitFromCondFromBinOp()
8147 return getCouldNotCompute(); in computeExitLimitFromSingleExitSwitch()
8159 return getCouldNotCompute(); in computeExitLimitFromSingleExitSwitch()
8180 if (LI->isVolatile()) return getCouldNotCompute(); in computeLoadConstantCompareExitLimit()
8185 if (!GEP) return getCouldNotCompute(); in computeLoadConstantCompareExitLimit()
8193 return getCouldNotCompute(); in computeLoadConstantCompareExitLimit()
8203 if (VarIdx) return getCouldNotCompute(); // Multiple non-constant idx's. in computeLoadConstantCompareExitLimit()
8211 return getCouldNotCompute(); in computeLoadConstantCompareExitLimit()
8225 return getCouldNotCompute(); in computeLoadConstantCompareExitLimit()
8248 return getCouldNotCompute(); in computeLoadConstantCompareExitLimit()
8255 return getCouldNotCompute(); in computeShiftCompareExitLimit()
8259 return getCouldNotCompute(); in computeShiftCompareExitLimit()
8263 return getCouldNotCompute(); in computeShiftCompareExitLimit()
8339 return getCouldNotCompute(); in computeShiftCompareExitLimit()
8367 return getCouldNotCompute(); in computeShiftCompareExitLimit()
8388 return ExitLimit(getCouldNotCompute(), UpperBound, false); in computeShiftCompareExitLimit()
8391 return getCouldNotCompute(); in computeShiftCompareExitLimit()
8646 if (!PN) return getCouldNotCompute(); in computeExitCountExhaustively()
8650 if (PN->getNumIncomingValues() != 2) return getCouldNotCompute(); in computeExitCountExhaustively()
8664 return getCouldNotCompute(); in computeExitCountExhaustively()
8676 if (!CondVal) return getCouldNotCompute(); in computeExitCountExhaustively()
8706 return getCouldNotCompute(); in computeExitCountExhaustively()
9037 if (BackedgeTakenCount == getCouldNotCompute()) return AddRec; in computeSCEVAtScope()
9115 return SE.getCouldNotCompute(); in SolveLinEquationWithOverflow()
9419 return getCouldNotCompute(); // Otherwise it will loop infinitely. in howFarToZero()
9432 return getCouldNotCompute(); in howFarToZero()
9444 return getCouldNotCompute(); in howFarToZero()
9449 return getCouldNotCompute(); in howFarToZero()
9474 return getCouldNotCompute(); in howFarToZero()
9521 const SCEV *Max = getCouldNotCompute(); in howFarToZero()
9522 if (Exact != getCouldNotCompute()) { in howFarToZero()
9536 const SCEV *M = E == getCouldNotCompute() in howFarToZero()
9553 return getCouldNotCompute(); // Otherwise it will loop infinitely. in howFarToNonZero()
9558 return getCouldNotCompute(); in howFarToNonZero()
9828 if (Start == getCouldNotCompute()) in SplitIntoInitAndPostInc()
9832 assert(PostInc != getCouldNotCompute() && "Unexpected could not compute"); in SplitIntoInitAndPostInc()
9864 if (SplitLHS.first == getCouldNotCompute()) in isKnownViaInduction()
9866 assert (SplitLHS.second != getCouldNotCompute() && "Unexpected CNC"); in isKnownViaInduction()
9870 if (SplitRHS.first == getCouldNotCompute()) in isKnownViaInduction()
9872 assert (SplitRHS.second != getCouldNotCompute() && "Unexpected CNC"); in isKnownViaInduction()
10326 if (LatchBECount != getCouldNotCompute()) { in isLoopBackedgeGuardedByCond()
11589 return getCouldNotCompute(); in howManyLessThans()
11655 return getCouldNotCompute(); in howManyLessThans()
11662 return getCouldNotCompute(); in howManyLessThans()
11728 return getCouldNotCompute(); in howManyLessThans()
11765 return ExitLimit(getCouldNotCompute() /* ExactNotTaken */, MaxBECount, in howManyLessThans()
11958 return getCouldNotCompute(); in howManyGreaterThans()
11969 return getCouldNotCompute(); in howManyGreaterThans()
11979 return getCouldNotCompute(); in howManyGreaterThans()
11987 return getCouldNotCompute(); in howManyGreaterThans()
12050 return SE.getCouldNotCompute(); in getNumIterationsInRange()
12063 return SE.getCouldNotCompute(); in getNumIterationsInRange()
12069 return SE.getCouldNotCompute(); in getNumIterationsInRange()
12100 return SE.getCouldNotCompute(); // Something strange happened in getNumIterationsInRange()
12115 return SE.getCouldNotCompute(); in getNumIterationsInRange()
13214 return SE.getCouldNotCompute(); in verify()
13228 if (CurBECount == SE2.getCouldNotCompute() || in verify()
13229 NewBECount == SE2.getCouldNotCompute()) { in verify()
13896 return getCouldNotCompute(); in computeSymbolicMaxBackedgeTakenCount()