Lines Matching full:coefficients

224   SmallVector<int64_t, 8> Coefficients;  member
233 ConstraintTy(SmallVector<int64_t, 8> Coefficients, bool IsSigned, bool IsEq, in ConstraintTy()
235 : Coefficients(std::move(Coefficients)), IsSigned(IsSigned), IsEq(IsEq), in ConstraintTy()
238 unsigned size() const { return Coefficients.size(); } in size()
240 unsigned empty() const { return Coefficients.empty(); } in empty()
283 VarPos.Coefficients[Value2Index[Arg]] = -1; in ConstraintInfo()
284 UnsignedCS.addVariableRow(VarPos.Coefficients); in ConstraintInfo()
446 // as the coefficients used to encode constraints are 64 bit integers. in decomposeGEP()
497 // Don't handle integers > 64 bit. Our coefficients are 64-bit large, so in decompose()
692 // Build result constraint, by first adding all coefficients from A and then in getConstraint()
693 // subtracting all coefficients from B. in getConstraint()
700 auto &R = Res.Coefficients; in getConstraint()
779 return Coefficients.size() > 0 && in isValid()
787 bool IsConditionImplied = CS.isConditionImplied(Coefficients); in isImpliedBy()
790 auto NegatedOrEqual = ConstraintSystem::negateOrEqual(Coefficients); in isImpliedBy()
800 auto Negated = ConstraintSystem::negate(Coefficients); in isImpliedBy()
803 auto StrictLessThan = ConstraintSystem::toStrictLessThan(Coefficients); in isImpliedBy()
820 auto Negated = ConstraintSystem::negate(Coefficients); in isImpliedBy()
833 getCS(R.IsSigned).isConditionImplied(R.Coefficients); in doesHold()
1570 if (R.Coefficients.empty()) in addFact()
1573 Added |= CSToUse.addVariableRowFill(R.Coefficients); in addFact()
1587 dumpConstraint(R.Coefficients, getValue2Index(R.IsSigned)); in addFact()
1598 VarPos.Coefficients[Value2Index[V]] = -1; in addFact()
1599 CSToUse.addVariableRow(VarPos.Coefficients); in addFact()
1607 for (auto &Coeff : R.Coefficients) in addFact()
1609 CSToUse.addVariableRowFill(R.Coefficients); in addFact()
1659 return CSToUse.isConditionImplied(R.Coefficients); in tryToSimplifyOverflowMath()