Searched refs:isAffine (Results 1 – 17 of 17) sorted by relevance
177 if (m_matrix.isAffine()) in toString()
722 if (transform.isAffine()) { in valueForMatrixTransform()
116 if (matrix.isAffine()) { in PrintTo()
132 if (AR->isAffine() && in TransformImpl()
56 return AR->isAffine() || in isInteresting()
1346 assert(S->isAffine() && "Can't linearly scale non-affine recurrences."); in expandAddRecExprLiterally()1465 if (S->isAffine() && S->getOperand(1)->isOne()) { in visitAddRecExpr()1475 if (S->isAffine()) // {0,+,F} --> i*F in visitAddRecExpr()1839 if (!AR->isAffine() && !SE.dominates(Step, AR->getLoop()->getHeader())) { in follow()
944 if (AR->isAffine()) { in getZeroExtendExpr()1226 if (AR->isAffine()) { in getSignExtendExpr()3237 if (AddRec->getLoop() == L && AddRec->isAffine()) { in createNodeForPHI()3492 if (AddRec->isAffine()) { in getUnsignedRange()3643 if (AddRec->isAffine()) { in getSignedRange()4885 if (!IdxExpr || !IdxExpr->isAffine() || isLoopInvariant(IdxExpr, L) || in ComputeLoadConstantCompareExitLimit()5734 if (!AddRec->isAffine()) in HowFarToZero()6631 if (!IV || IV->getLoop() != L || !IV->isAffine()) in HowManyLessThans()6701 if (!IV || IV->getLoop() != L || !IV->isAffine()) in HowManyGreaterThans()6803 if (isAffine()) { in getNumIterationsInRange()[all …]
3200 if (!SrcAR || !DstAR || !SrcAR->isAffine() || !DstAR->isAffine()) in tryDelinearize()
381 if (!PHISCEV->isAffine()) in collectPossibleIVs()566 if (!User1SCEV || !User1SCEV->isAffine() || in findScaleFromMul()567 !User2SCEV || !User2SCEV->isAffine()) in findScaleFromMul()
788 if (!StoreEv || StoreEv->getLoop() != CurLoop || !StoreEv->isAffine()) in processLoopStore()819 if (LoadEv && LoadEv->getLoop() == CurLoop && LoadEv->isAffine() && in processLoopStore()845 if (!Ev || Ev->getLoop() != CurLoop || !Ev->isAffine()) in processLoopMemSet()
1466 if (!AR || AR->getLoop() != L || !AR->isAffine()) in FindLoopCounter()1528 assert(AR && AR->getLoop() == L && AR->isAffine() && "bad loop counter"); in genLoopLimit()
943 if (!AR->isAffine() || !isa<SCEVConstant>(AR->getOperand(1))) { in RateRegister()2048 if (!AR || !AR->isAffine() || in OptimizeMax()
306 if (isAffine()) return getOperand(1); in getStepRecurrence()314 bool isAffine() const { in isAffine() function
262 bool isAffine() const in isAffine() function
279 bool has3DTransform() const { return m_transform && !m_transform->isAffine(); } in has3DTransform()
2464 if (transformState.m_accumulatedTransform.isAffine()) in computeZOffset()
3949 return AR->isAffine(); in hasComputableBounds()