Searched refs:OptimumKind (Results 1 – 3 of 3) sorted by relevance
| /llvm-project-15.0.7/mlir/include/mlir/Analysis/Presburger/ |
| H A D | Utils.h | 33 enum class OptimumKind { Empty, Unbounded, Bounded }; enum
38 OptimumKind kind = OptimumKind::Empty;
43 MaybeOptimum(OptimumKind kind) : kind(kind) { in MaybeOptimum()
44 assert(kind != OptimumKind::Bounded && in MaybeOptimum()
48 : kind(OptimumKind::Bounded), optimum(optimum) {} in MaybeOptimum()
50 OptimumKind getKind() const { return kind; } in getKind()
53 bool isEmpty() const { return kind == OptimumKind::Empty; } in isEmpty()
57 assert(kind == OptimumKind::Bounded && in getBoundedOptimum()
62 assert(kind == OptimumKind::Bounded && in getBoundedOptimum()
73 if (kind != OptimumKind::Bounded)
[all …]
|
| /llvm-project-15.0.7/mlir/unittests/Analysis/Presburger/ |
| H A D | IntegerPolyhedronTest.cpp | 1072 void expectNoRationalLexMin(OptimumKind kind, const IntegerPolyhedron &poly) { in expectNoRationalLexMin()
1073 ASSERT_NE(kind, OptimumKind::Bounded) in expectNoRationalLexMin()
1122 OptimumKind::Unbounded, in TEST()
1129 OptimumKind::Unbounded, in TEST()
1134 expectNoRationalLexMin(OptimumKind::Empty, in TEST()
1144 void expectNoIntegerLexMin(OptimumKind kind, const IntegerPolyhedron &poly) { in expectNoIntegerLexMin()
1145 ASSERT_NE(kind, OptimumKind::Bounded) in expectNoIntegerLexMin()
1155 expectNoIntegerLexMin(OptimumKind::Unbounded, in TEST()
|
| /llvm-project-15.0.7/mlir/lib/Analysis/Presburger/ |
| H A D | Simplex.cpp | 219 return OptimumKind::Empty; in findRationalLexMin()
290 return OptimumKind::Empty; in findIntegerLexMin()
305 return OptimumKind::Empty; in findIntegerLexMin()
307 return OptimumKind::Empty; in findIntegerLexMin()
313 return OptimumKind::Unbounded; in findIntegerLexMin()
1318 return OptimumKind::Unbounded; in computeRowOptimum()
1333 return OptimumKind::Empty; in computeOptimum()
1344 return OptimumKind::Empty; in computeOptimum()
1351 return OptimumKind::Unbounded; in computeOptimum()
1563 return OptimumKind::Empty; in getRationalSample()
[all …]
|