Searched refs:computeOptimum (Results 1 – 3 of 3) sorted by relevance
| /llvm-project-15.0.7/mlir/lib/Analysis/Presburger/ |
| H A D | Simplex.cpp | 1330 MaybeOptimum<Fraction> Simplex::computeOptimum(Direction direction, in computeOptimum() function in Simplex
1341 MaybeOptimum<Fraction> Simplex::computeOptimum(Direction direction, in computeOptimum() function in Simplex
1370 return computeOptimum(Direction::Up, con[constraintIndex]).isBounded(); in isBoundedAlongConstraint()
1444 if (computeOptimum(Direction::Up, dir).isUnbounded()) in isUnbounded()
1447 if (computeOptimum(Direction::Down, dir).isUnbounded()) in isUnbounded()
1639 simplex.computeOptimum(Direction::Up, getCoeffsForDirection(dir)); in computeWidth()
2072 computeOptimum(Simplex::Direction::Down, coeffs).map(ceil)); in computeIntegerBounds()
2074 computeOptimum(Simplex::Direction::Up, coeffs).map(floor)); in computeIntegerBounds()
2145 MaybeOptimum<Fraction> minimum = computeOptimum(Direction::Down, coeffs); in findIneqType()
2149 MaybeOptimum<Fraction> maximum = computeOptimum(Direction::Up, coeffs); in findIneqType()
[all …]
|
| /llvm-project-15.0.7/mlir/include/mlir/Analysis/Presburger/ |
| H A D | Simplex.h | 726 MaybeOptimum<Fraction> computeOptimum(Direction direction,
853 MaybeOptimum<Fraction> computeOptimum(Direction direction, Unknown &u);
|
| /llvm-project-15.0.7/mlir/unittests/Analysis/Presburger/ |
| H A D | SimplexTest.cpp | 411 simplex.computeOptimum(Simplex::Direction::Up, {1, 0, 0}); in TEST()
|