Lines Matching refs:Coeff
1066 bool DependenceInfo::strongSIVtest(const SCEV *Coeff, const SCEV *SrcConst, in strongSIVtest() argument
1071 DEBUG(dbgs() << "\t Coeff = " << *Coeff); in strongSIVtest()
1072 DEBUG(dbgs() << ", " << *Coeff->getType() << "\n"); in strongSIVtest()
1092 SE->isKnownNonNegative(Coeff) ? Coeff : SE->getNegativeSCEV(Coeff); in strongSIVtest()
1103 if (isa<SCEVConstant>(Delta) && isa<SCEVConstant>(Coeff)) { in strongSIVtest()
1105 APInt ConstCoeff = cast<SCEVConstant>(Coeff)->getAPInt(); in strongSIVtest()
1136 if (Coeff->isOne()) { in strongSIVtest()
1143 NewConstraint.setLine(Coeff, in strongSIVtest()
1144 SE->getNegativeSCEV(Coeff), in strongSIVtest()
1152 bool CoeffMaybePositive = !SE->isKnownNonPositive(Coeff); in strongSIVtest()
1153 bool CoeffMaybeNegative = !SE->isKnownNonNegative(Coeff); in strongSIVtest()
1203 const SCEV *Coeff, const SCEV *SrcConst, const SCEV *DstConst, in weakCrossingSIVtest() argument
1207 DEBUG(dbgs() << "\t Coeff = " << *Coeff << "\n"); in weakCrossingSIVtest()
1216 NewConstraint.setLine(Coeff, Coeff, Delta, CurLoop); in weakCrossingSIVtest()
1228 const SCEVConstant *ConstCoeff = dyn_cast<SCEVConstant>(Coeff); in weakCrossingSIVtest()
2263 const SCEV *Coeff = AddRec->getStepRecurrence(*SE); in gcdMIVtest() local
2266 const auto *Constant = getConstantPart(Coeff); in gcdMIVtest()
2282 const SCEV *Coeff = AddRec->getStepRecurrence(*SE); in gcdMIVtest() local
2285 const auto *Constant = getConstantPart(Coeff); in gcdMIVtest()
2360 const SCEV *Coeff = AddRec->getStepRecurrence(*SE); in gcdMIVtest() local
2366 Constant = getConstantPart(Coeff); in gcdMIVtest()
2377 const SCEV *Coeff = AddRec->getStepRecurrence(*SE); in gcdMIVtest() local
2379 DstCoeff = Coeff; in gcdMIVtest()
2383 Constant = getConstantPart(Coeff); in gcdMIVtest()
2675 SE->getZero(A[K].Coeff->getType()); in findBoundsALL()
2678 SE->getZero(A[K].Coeff->getType()); in findBoundsALL()
2703 const SCEV *Delta = SE->getMinusSCEV(A[K].Coeff, B[K].Coeff); in findBoundsEQ()
2714 const SCEV *Delta = SE->getMinusSCEV(A[K].Coeff, B[K].Coeff); in findBoundsEQ()
2746 getNegativePart(SE->getMinusSCEV(A[K].NegPart, B[K].Coeff)); in findBoundsLT()
2748 SE->getMinusSCEV(SE->getMulExpr(NegPart, Iter_1), B[K].Coeff); in findBoundsLT()
2750 getPositivePart(SE->getMinusSCEV(A[K].PosPart, B[K].Coeff)); in findBoundsLT()
2752 SE->getMinusSCEV(SE->getMulExpr(PosPart, Iter_1), B[K].Coeff); in findBoundsLT()
2758 getNegativePart(SE->getMinusSCEV(A[K].NegPart, B[K].Coeff)); in findBoundsLT()
2760 Bound[K].Lower[Dependence::DVEntry::LT] = SE->getNegativeSCEV(B[K].Coeff); in findBoundsLT()
2762 getPositivePart(SE->getMinusSCEV(A[K].PosPart, B[K].Coeff)); in findBoundsLT()
2764 Bound[K].Upper[Dependence::DVEntry::LT] = SE->getNegativeSCEV(B[K].Coeff); in findBoundsLT()
2790 getNegativePart(SE->getMinusSCEV(A[K].Coeff, B[K].PosPart)); in findBoundsGT()
2792 SE->getAddExpr(SE->getMulExpr(NegPart, Iter_1), A[K].Coeff); in findBoundsGT()
2794 getPositivePart(SE->getMinusSCEV(A[K].Coeff, B[K].NegPart)); in findBoundsGT()
2796 SE->getAddExpr(SE->getMulExpr(PosPart, Iter_1), A[K].Coeff); in findBoundsGT()
2801 const SCEV *NegPart = getNegativePart(SE->getMinusSCEV(A[K].Coeff, B[K].PosPart)); in findBoundsGT()
2803 Bound[K].Lower[Dependence::DVEntry::GT] = A[K].Coeff; in findBoundsGT()
2804 const SCEV *PosPart = getPositivePart(SE->getMinusSCEV(A[K].Coeff, B[K].NegPart)); in findBoundsGT()
2806 Bound[K].Upper[Dependence::DVEntry::GT] = A[K].Coeff; in findBoundsGT()
2832 CI[K].Coeff = Zero; in collectCoeffInfo()
2840 CI[K].Coeff = AddRec->getStepRecurrence(*SE); in collectCoeffInfo()
2841 CI[K].PosPart = getPositivePart(CI[K].Coeff); in collectCoeffInfo()
2842 CI[K].NegPart = getNegativePart(CI[K].Coeff); in collectCoeffInfo()
2850 DEBUG(dbgs() << "\t " << K << "\t" << *CI[K].Coeff); in collectCoeffInfo()