Searched refs:isAffine (Results 1 – 21 of 21) sorted by relevance
78 if (!AR || !AR->isAffine()) in isOneDimensionalArray()425 if (!AR->isAffine()) in isSimpleAddRecurrence()
67 return AR->isAffine() || in isInteresting()
1458 assert(S->isAffine() && "Can't linearly scale non-affine recurrences."); in expandAddRecExprLiterally()1596 if (S->isAffine() && S->getOperand(1)->isOne()) { in visitAddRecExpr()1606 if (S->isAffine()) // {0,+,F} --> i*F in visitAddRecExpr()2240 assert(AR->isAffine() && "Cannot generate RT check for " in generateOverflowCheck()2412 if (!AR->isAffine() && !SE.dominates(Step, AR->getLoop()->getHeader())) { in follow()
219 if (!AddRec || AddRec->getLoop() != L || !AddRec->isAffine()) in isDereferenceableAndAlignedInLoop()
981 if (!Numerator->isAffine()) in visitAddRecExpr()1695 if (AR->isAffine()) { in getZeroExtendExpr()2039 if (AR->isAffine()) { in getSignExtendExpr()4422 if (Expr->getLoop() == L && Expr->isAffine()) in visitAddRecExpr()4442 if (!AR->isAffine()) in proveNoWrapViaConstantRanges()5705 if (AddRec->isAffine()) { in getRangeRef()7599 if (!IdxExpr || !IdxExpr->isAffine() || isLoopInvariant(IdxExpr, L) || in computeLoadConstantCompareExitLimit()8806 if (!AddRec->isAffine()) in howFarToZero()9948 if (!LAR->isAffine() || !MAR->isAffine()) in computeConstantDifference()10223 if (!LAR->isAffine() || !RAR->isAffine()) in IsKnownPredicateViaAddRecStart()[all …]
1025 if (AddRec->isAffine()) { in isKnownLessThan()1047 if (AddRec->isAffine()) { in isKnownNonNegative()3294 if (!SrcAR || !DstAR || !SrcAR->isAffine() || !DstAR->isAffine()) in tryDelinearize()
637 return AR->isAffine(); in hasComputableBounds()
314 if (isAffine()) return getOperand(1); in getStepRecurrence()322 bool isAffine() const { in isAffine() function
442 if (!StoreEv || StoreEv->getLoop() != CurLoop || !StoreEv->isAffine()) in isLegalStore()501 if (!LoadEv || LoadEv->getLoop() != CurLoop || !LoadEv->isAffine()) in isLegalStore()763 if (!Ev || Ev->getLoop() != CurLoop || !Ev->isAffine()) in processLoopMemSet()
696 if (!RangeCheckIV->isAffine()) { in widenICmpRangeCheck()879 if (!Result->IV->isAffine()) { in parseLoopLatchICmp()
364 IndexAddRec && (IndexAddRec->getLoop() == L) && IndexAddRec->isAffine(); in extractRangeChecksFromCond()845 if (!IndVarBase->isAffine()) { in parseLoopStructure()1596 if (!IndVar->isAffine()) in computeSafeIterationSpace()
409 if (!AR->getStart()->isZero() && AR->isAffine()) { in DoInitialMatch()692 if ((IgnoreSignificantBits || isAddRecSExtable(AR, SE)) && AR->isAffine()) { in getExactSDiv()1286 if (!AR->isAffine() || !isa<SCEVConstant>(AR->getOperand(1))) { in RateRegister()2303 if (!AR || !AR->isAffine() || in OptimizeMax()3505 if (AR->getStart()->isZero() || !AR->isAffine()) in CollectSubexprs()
850 if (!UseMax || !Pos || !Expr->isAffine()) { in visitAddRecExpr()
587 if (!PHISCEV->isAffine()) in collectPossibleIVs()
310 if (!AddRec || !AddRec->isAffine()) in getInductionVariable()
2229 if (!AR || AR->getLoop() != L || !AR->isAffine()) in isLoopCounter()
216 if (!LeftAR->isAffine() || LeftAR->getLoop() != &L) in countToEliminateCompares()
166 if (!LSCEVAddRec || !LSCEVAddRec->isAffine()) in runOnLoop()
748 if (!LSCEVAddRec || !LSCEVAddRec->isAffine()) in getFalkorUnrollingPreferences()
493 if (!BasePtrSCEV->isAffine()) in rewriteLoadStores()
1932 if (!StoreEv || StoreEv->getLoop() != CurLoop || !StoreEv->isAffine()) in isLegalStore()1954 if (!LoadEv || LoadEv->getLoop() != CurLoop || !LoadEv->isAffine()) in isLegalStore()