Home
last modified time | relevance | path

Searched refs:LexSimplex (Results 1 – 4 of 4) sorted by relevance

/llvm-project-15.0.7/mlir/include/mlir/Analysis/Presburger/
H A DSimplex.h480 class LexSimplex : public LexSimplexBase {
482 explicit LexSimplex(unsigned nVar) : LexSimplexBase(nVar) {} in LexSimplex() function
486 explicit LexSimplex(const IntegerRelation &constraints) in LexSimplex() function
676 LexSimplex domainSimplex;
/llvm-project-15.0.7/mlir/lib/Analysis/Presburger/
H A DSimplex.cpp216 MaybeOptimum<SmallVector<Fraction, 8>> LexSimplex::findRationalLexMin() { in findRationalLexMin()
273 Optional<unsigned> LexSimplex::maybeGetNonIntegralVarRow() const { in maybeGetNonIntegralVarRow()
287 MaybeOptimum<SmallVector<int64_t, 8>> LexSimplex::findIntegerLexMin() { in findIntegerLexMin()
318 bool LexSimplex::isSeparateInequality(ArrayRef<int64_t> coeffs) { in isSeparateInequality()
324 bool LexSimplex::isRedundantInequality(ArrayRef<int64_t> coeffs) { in isRedundantInequality()
657 bool LexSimplex::rowIsViolated(unsigned row) const { in rowIsViolated()
665 Optional<unsigned> LexSimplex::maybeGetViolatedRow() const { in maybeGetViolatedRow()
675 LogicalResult LexSimplex::restoreRationalConsistency() { in restoreRationalConsistency()
1561 MaybeOptimum<SmallVector<Fraction, 8>> LexSimplex::getRationalSample() const { in getRationalSample()
H A DIntegerRelation.cpp90 LexSimplex(*this).findRationalLexMin(); in findRationalLexMin()
110 LexSimplex(*this).findIntegerLexMin(); in findIntegerLexMin()
/llvm-project-15.0.7/mlir/unittests/Analysis/Presburger/
H A DSimplexTest.cpp553 LexSimplex simplex(/*nVar=*/1); in TEST()