Home
last modified time | relevance | path

Searched refs:getNumEqualities (Results 1 – 12 of 12) sorted by relevance

/llvm-project-15.0.7/mlir/lib/Analysis/Presburger/
H A DIntegerRelation.cpp64 for (unsigned r = 0, e = other.getNumEqualities(); r < e; r++) { in append()
136 for (unsigned i = poly.getNumEqualities(); i > 0; i--) in removeConstraintsInvolvingVarRange()
165 removeEqualityRange(counts.getNumEqs(), getNumEqualities()); in truncate()
429 for (unsigned r = 0, e = getNumEqualities(); r < e; r++) { in getLowerAndUpperBoundIndices()
485 for (unsigned i = 0, e = getNumEqualities(); i < e; ++i) in normalizeConstraintsByGCD()
658 for (unsigned i = 0, e = getNumEqualities(); i < e; ++i) { in isEmptyByGCDTest()
710 for (unsigned i = 0, e = getNumEqualities(); i < e; ++i) { in getBoundedDirections()
885 for (unsigned i = 0, e = getNumEqualities(); i < e; ++i) { in containsPoint()
1075 for (unsigned r = 0, e = getNumEqualities(); r < e; r++) { in removeRedundantConstraints()
1218 for (unsigned i = 0, e = getNumEqualities(); i < e; ++i) in removeRedundantLocalVars()
[all …]
H A DPresburgerRelation.cpp126 assert(idx < rel.getNumInequalities() + 2 * rel.getNumEqualities() && in getIneqCoeffsFromIdx()
262 2 * sI.getNumEqualities()); in getSetDifference()
338 2 * sI.getNumEqualities() + sI.getNumInequalities(); in getSetDifference()
767 for (int k = 0, e = a.getNumEqualities(); k < e; ++k) in coalescePair()
778 for (int k = 0, e = b.getNumEqualities(); k < e; ++k) in coalescePair()
H A DLinearTransform.cpp118 for (unsigned i = 0, e = rel.getNumEqualities(); i < e; ++i) { in applyTo()
H A DUtils.cpp159 assert(eqInd <= cst.getNumEqualities() && "Invalid equality position"); in getDivRepr()
H A DSimplex.cpp1307 for (unsigned i = 0, e = rel.getNumEqualities(); i < e; ++i) in intersectIntegerRelation()
2123 for (unsigned i = 0, e = rel.getNumEqualities(); i < e; ++i) in isRationalSubsetOf()
/llvm-project-15.0.7/mlir/lib/IR/
H A DIntegerSet.cpp25 unsigned IntegerSet::getNumEqualities() const { in getNumEqualities() function in IntegerSet
34 return getNumConstraints() - getNumEqualities(); in getNumInequalities()
/llvm-project-15.0.7/mlir/unittests/Analysis/Presburger/
H A DIntegerPolyhedronTest.cpp154 EXPECT_EQ(set.getNumEqualities(), 5u); in TEST()
157 EXPECT_EQ(set.getNumEqualities(), 3u); in TEST()
163 EXPECT_EQ(set.getNumEqualities(), 2u); in TEST()
488 EXPECT_EQ(poly.getNumEqualities(), 1u); in TEST()
498 EXPECT_EQ(poly2.getNumEqualities(), 1u); in TEST()
506 EXPECT_EQ(poly3.getNumEqualities(), 2u); in TEST()
551 unsigned nEq = poly4.getNumEqualities(); in TEST()
554 ASSERT_EQ(poly4.getNumEqualities(), nEq); in TEST()
559 EXPECT_EQ(poly4.getNumEqualities(), nEq); in TEST()
1464 EXPECT_EQ(set.getNumEqualities(), 0u); in TEST()
/llvm-project-15.0.7/mlir/include/mlir/IR/
H A DIntegerSet.h84 unsigned getNumEqualities() const;
/llvm-project-15.0.7/mlir/include/mlir/Analysis/Presburger/
H A DIntegerRelation.h146 return getNumInequalities() + getNumEqualities(); in getNumConstraints()
163 inline unsigned getNumEqualities() const { return equalities.getNumRows(); } in getNumEqualities() function
/llvm-project-15.0.7/mlir/lib/CAPI/IR/
H A DIntegerSet.cpp90 return static_cast<intptr_t>(unwrap(set).getNumEqualities()); in mlirIntegerSetGetNumEqualities()
/llvm-project-15.0.7/mlir/lib/Dialect/Affine/Analysis/
H A DAffineStructures.cpp153 : IntegerPolyhedron(set.getNumInequalities(), set.getNumEqualities(), in FlatAffineValueConstraints()
758 for (unsigned curEquality = 0, numEqualities = cst.getNumEqualities(); in detectAsMod()
1558 std::fill(eqFlags.begin(), eqFlags.begin() + getNumEqualities(), true); in getAsIntegerSet()
1559 std::fill(eqFlags.begin() + getNumEqualities(), eqFlags.end(), false); in getAsIntegerSet()
1564 for (unsigned i = 0, e = getNumEqualities(); i < e; ++i) in getAsIntegerSet()
/llvm-project-15.0.7/mlir/lib/Dialect/Affine/IR/
H A DAffineOps.cpp2313 return (iSet.getNumEqualities() == 1 && iSet.getNumInequalities() == 0 && in matchAndRewrite()