Searched refs:getNumInequalities (Results 1 – 12 of 12) sorted by relevance
| /llvm-project-15.0.7/mlir/lib/Analysis/Presburger/ |
| H A D | IntegerRelation.cpp | 58 other.getNumInequalities()); in append()
139 for (unsigned i = poly.getNumInequalities(); i > 0; i--) in removeConstraintsInvolvingVarRange()
145 return {getSpace(), getNumInequalities(), getNumEqualities()}; in getCounts()
411 for (unsigned r = 0, e = getNumInequalities(); r < e; r++) { in getLowerAndUpperBoundIndices()
487 for (unsigned i = 0, e = getNumInequalities(); i < e; ++i) in normalizeConstraintsByGCD()
1021 SmallVector<bool, 32> redun(getNumInequalities(), false); in removeRedundantInequalities()
1061 unsigned numIneqs = getNumInequalities(); in removeRedundantConstraints()
1440 for (r = 0, e = getNumInequalities(); r < e; r++) { in getConstantBoundOnDimSize()
1534 for (r = 0, e = getNumInequalities(); r < e; r++) { in computeConstantLowerOrUpperBound()
1682 for (unsigned r = 0, e = getNumInequalities(); r < e; r++) in removeTrivialRedundancy()
[all …]
|
| H A D | PresburgerRelation.cpp | 126 assert(idx < rel.getNumInequalities() + 2 * rel.getNumEqualities() && in getIneqCoeffsFromIdx()
128 if (idx < rel.getNumInequalities()) in getIneqCoeffsFromIdx()
131 idx -= rel.getNumInequalities(); in getIneqCoeffsFromIdx()
261 llvm::SmallBitVector canIgnoreIneq(sI.getNumInequalities() + in getSetDifference()
338 2 * sI.getNumEqualities() + sI.getNumInequalities(); in getSetDifference()
763 for (int k = 0, e = a.getNumInequalities(); k < e; ++k) in coalescePair()
774 for (int k = 0, e = b.getNumInequalities(); k < e; ++k) in coalescePair()
|
| H A D | Utils.cpp | 96 assert(ubIneq <= cst.getNumInequalities() && in getDivRepr()
98 assert(lbIneq <= cst.getNumInequalities() && in getDivRepr()
|
| H A D | LinearTransform.cpp | 128 for (unsigned i = 0, e = rel.getNumInequalities(); i < e; ++i) { in applyTo()
|
| H A D | Simplex.cpp | 1305 for (unsigned i = 0, e = rel.getNumInequalities(); i < e; ++i) in intersectIntegerRelation()
2119 for (unsigned i = 0, e = rel.getNumInequalities(); i < e; ++i) in isRationalSubsetOf()
|
| /llvm-project-15.0.7/mlir/unittests/Analysis/Presburger/ |
| H A D | IntegerPolyhedronTest.cpp | 135 EXPECT_EQ(set.getNumInequalities(), 5u); in TEST()
138 EXPECT_EQ(set.getNumInequalities(), 3u); in TEST()
144 EXPECT_EQ(set.getNumInequalities(), 2u); in TEST()
487 EXPECT_EQ(poly.getNumInequalities(), 0u); in TEST()
496 EXPECT_EQ(poly2.getNumInequalities(), 1u); in TEST()
505 EXPECT_EQ(poly3.getNumInequalities(), 0u); in TEST()
550 unsigned nIneq = poly4.getNumInequalities(); in TEST()
553 ASSERT_EQ(poly4.getNumInequalities(), nIneq); in TEST()
558 EXPECT_EQ(poly4.getNumInequalities(), nIneq); in TEST()
568 EXPECT_EQ(poly5.getNumInequalities(), 3u); in TEST()
|
| /llvm-project-15.0.7/mlir/lib/IR/ |
| H A D | IntegerSet.cpp | 33 unsigned IntegerSet::getNumInequalities() const { in getNumInequalities() function in IntegerSet
|
| /llvm-project-15.0.7/mlir/include/mlir/IR/ |
| H A D | IntegerSet.h | 85 unsigned getNumInequalities() const;
|
| /llvm-project-15.0.7/mlir/include/mlir/Analysis/Presburger/ |
| H A D | IntegerRelation.h | 146 return getNumInequalities() + getNumEqualities(); in getNumConstraints()
165 inline unsigned getNumInequalities() const { in getNumInequalities() function
|
| /llvm-project-15.0.7/mlir/lib/CAPI/IR/ |
| H A D | IntegerSet.cpp | 94 return static_cast<intptr_t>(unwrap(set).getNumInequalities()); in mlirIntegerSetGetNumInequalities()
|
| /llvm-project-15.0.7/mlir/lib/Dialect/Affine/Analysis/ |
| H A D | AffineStructures.cpp | 153 : IntegerPolyhedron(set.getNumInequalities(), set.getNumEqualities(), in FlatAffineValueConstraints()
1481 assert(ineqPos < getNumInequalities() && "invalid inequality position"); in getIneqAsAffineValueMap()
1567 for (unsigned i = 0, e = getNumInequalities(); i < e; ++i) in getAsIntegerSet()
|
| /llvm-project-15.0.7/mlir/lib/Dialect/Affine/IR/ |
| H A D | AffineOps.cpp | 2313 return (iSet.getNumEqualities() == 1 && iSet.getNumInequalities() == 0 && in matchAndRewrite()
|