Home
last modified time | relevance | path

Searched refs:MaybeOptimum (Results 1 – 7 of 7) sorted by relevance

/llvm-project-15.0.7/mlir/include/mlir/Analysis/Presburger/
H A DUtils.h35 class MaybeOptimum {
42 MaybeOptimum() = default;
43 MaybeOptimum(OptimumKind kind) : kind(kind) { in MaybeOptimum() function
47 MaybeOptimum(const T &optimum) in MaybeOptimum() function
70 bool operator==(const MaybeOptimum<T> &other) const {
82 auto map(const Function &f) const & -> MaybeOptimum<decltype(f(optimum))> {
H A DSimplex.h490 MaybeOptimum<SmallVector<Fraction, 8>> findRationalLexMin();
496 MaybeOptimum<SmallVector<int64_t, 8>> findIntegerLexMin();
513 MaybeOptimum<SmallVector<Fraction, 8>> getRationalSample() const;
719 MaybeOptimum<Fraction> computeRowOptimum(Direction direction, unsigned row);
726 MaybeOptimum<Fraction> computeOptimum(Direction direction,
769 std::pair<MaybeOptimum<int64_t>, MaybeOptimum<int64_t>>
853 MaybeOptimum<Fraction> computeOptimum(Direction direction, Unknown &u);
H A DIntegerRelation.h278 MaybeOptimum<SmallVector<Fraction, 8>> findRationalLexMin() const;
285 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()
310 MaybeOptimum<SmallVector<Fraction, 8>> sample = getRationalSample(); in findIntegerLexMin()
1330 MaybeOptimum<Fraction> Simplex::computeOptimum(Direction direction, in computeOptimum()
1341 MaybeOptimum<Fraction> Simplex::computeOptimum(Direction direction, in computeOptimum()
1356 MaybeOptimum<Fraction> optimum = computeRowOptimum(direction, row); in computeOptimum()
1638 MaybeOptimum<Fraction> maybeWidth = in computeWidth()
1658 MaybeOptimum<Fraction> maybeWidth = in computeWidthAndDuals()
1994 MaybeOptimum<int64_t> minRoundedUp, maxRoundedDown; in findIntegerSample()
2069 std::pair<MaybeOptimum<int64_t>, MaybeOptimum<int64_t>>
2071 MaybeOptimum<int64_t> minRoundedUp( in computeIntegerBounds()
[all …]
H A DIntegerRelation.cpp86 MaybeOptimum<SmallVector<Fraction, 8>>
89 MaybeOptimum<SmallVector<Fraction, 8>> maybeLexMin = in findRationalLexMin()
106 MaybeOptimum<SmallVector<int64_t, 8>>
109 MaybeOptimum<SmallVector<int64_t, 8>> maybeLexMin = in findIntegerLexMin()
1111 MaybeOptimum<int64_t> min, max; in computeVolume()
/llvm-project-15.0.7/mlir/unittests/Analysis/Presburger/
H A DSimplexTest.cpp410 MaybeOptimum<Fraction> maxX = in TEST()
446 std::make_pair(MaybeOptimum<int64_t>(yMin), MaybeOptimum<int64_t>(yMax))); in TEST()
H A DIntegerPolyhedronTest.cpp62 MaybeOptimum<SmallVector<int64_t, 8>> maybeLexMin; in checkSample()