Home
last modified time | relevance | path

Searched refs:findIntegerLexMin (Results 1 – 5 of 5) sorted by relevance

/llvm-project-15.0.7/mlir/unittests/Analysis/Presburger/
H A DIntegerPolyhedronTest.cpp66 maybeLexMin = poly.findIntegerLexMin(); in checkSample()
1139 auto lexMin = poly.findIntegerLexMin(); in expectIntegerLexMin()
1150 TEST(IntegerPolyhedronTest, findIntegerLexMin) { in TEST() argument
/llvm-project-15.0.7/mlir/include/mlir/Analysis/Presburger/
H A DSimplex.h496 MaybeOptimum<SmallVector<int64_t, 8>> findIntegerLexMin();
H A DIntegerRelation.h285 MaybeOptimum<SmallVector<int64_t, 8>> findIntegerLexMin() const;
/llvm-project-15.0.7/mlir/lib/Analysis/Presburger/
H A DSimplex.cpp287 MaybeOptimum<SmallVector<int64_t, 8>> LexSimplex::findIntegerLexMin() { in findIntegerLexMin() function in LexSimplex
321 return findIntegerLexMin().isEmpty(); in isSeparateInequality()
537 if (empty || domainSimplex.findIntegerLexMin().isEmpty()) { in computeSymbolicIntegerLexMin()
H A DIntegerRelation.cpp107 IntegerRelation::findIntegerLexMin() const { in findIntegerLexMin() function in IntegerRelation
110 LexSimplex(*this).findIntegerLexMin(); in findIntegerLexMin()