Home
last modified time | relevance | path

Searched refs:Simplex (Results 1 – 8 of 8) sorted by relevance

/llvm-project/mlir/unittests/Analysis/Presburger/
H A DSimplexTest.cpp29 bool isRedundantInequality(Simplex &simplex, ArrayRef<int64_t> coeffs) { in isRedundantInequality()
35 bool isRedundantEquality(Simplex &simplex, ArrayRef<int64_t> coeffs) { in isRedundantEquality()
42 Simplex::IneqType findIneqType(Simplex &simplex, ArrayRef<int64_t> coeffs) { in findIneqType()
52 Simplex simplex(2); in TEST()
77 Simplex simplex(1); in TEST()
84 void expectInequalityMakesSetEmpty(Simplex &simplex, ArrayRef<int64_t> coeffs, in expectInequalityMakesSetEmpty()
94 Simplex simplex(3); in TEST()
124 Simplex simplexFromConstraints(unsigned nDim, in simplexFromConstraints()
127 Simplex simplex(nDim); in simplexFromConstraints()
263 Simplex simplex(0); in TEST()
[all …]
H A DIntegerPolyhedronTest.cpp88 EXPECT_TRUE(Simplex(poly).isUnbounded()); in checkSample()
/llvm-project/mlir/lib/Analysis/Presburger/
H A DSimplex.cpp1 //===- Simplex.cpp - MLIR Simplex Class -----------------------------------===//
9 #include "mlir/Analysis/Presburger/Simplex.h"
33 using Direction = Simplex::Direction;
77 const Simplex::Unknown &SimplexBase::unknownFromIndex(int index) const { in unknownFromIndex()
82 const Simplex::Unknown &SimplexBase::unknownFromColumn(unsigned col) const { in unknownFromColumn()
87 const Simplex::Unknown &SimplexBase::unknownFromRow(unsigned row) const { in unknownFromRow()
92 Simplex::Unknown &SimplexBase::unknownFromIndex(int index) { in unknownFromIndex()
97 Simplex::Unknown &SimplexBase::unknownFromColumn(unsigned col) { in unknownFromColumn()
102 Simplex in unknownFromRow()
[all...]
H A DPresburgerRelation.cpp13 #include "mlir/Analysis/Presburger/Simplex.h"
360 Simplex simplex(b); in getSetDifference()
726 /// The list of `Simplex`s constructed from the elements of `disjuncts`.
727 SmallVector<Simplex, 2> simplices;
741 /// Given a Simplex `simp` and one of its inequalities `ineq`, check
744 bool isFacetContained(ArrayRef<DynamicAPInt> ineq, Simplex &simp);
768 LogicalResult typeInequality(ArrayRef<DynamicAPInt> ineq, Simplex &simp);
774 LogicalResult typeEquality(ArrayRef<DynamicAPInt> eq, Simplex &simp);
798 Simplex simp(disjuncts[i]); in SetCoalescer()
848 /// Given a Simplex `sim in isFacetContained()
[all...]
H A DCMakeLists.txt10 Simplex.cpp
H A DIntegerRelation.cpp21 #include "mlir/Analysis/Presburger/Simplex.h"
150 // The Simplex returns the lexmin over all the variables including locals. But in findRationalLexMin()
170 // The Simplex returns the lexmin over all the variables including locals. But in findIntegerLexMin()
787 Simplex simplex(*this); in getBoundedDirections()
876 Simplex simplex(*this); in findIntegerSample()
911 Simplex(boundedSet).findIntegerSample(); in findIntegerSample()
915 "Simplex returned an invalid sample!"); in findIntegerSample()
959 Simplex shrunkenConeSimplex(cone); in findIntegerSample()
1209 // Simplex to check if a constraint is redundant. in removeRedundantConstraints()
1215 Simplex simple in removeRedundantConstraints()
[all...]
/llvm-project/mlir/include/mlir/Analysis/Presburger/
H A DSimplex.h691 class Simplex : public SimplexBase {
695 Simplex() = delete;
696 explicit Simplex(unsigned nVar) : SimplexBase(nVar, /*mustUseBigM=*/false) {} in Simplex() function
697 explicit Simplex(const IntegerRelation &constraints) in Simplex() function
698 : Simplex(constraints.getNumVars()) { in Simplex()
701 ~Simplex() override = default;
782 static Simplex makeProduct(const Simplex &a, const Simplex &b);
/llvm-project/polly/lib/External/isl/doc/
H A Dimplementation.tex183 \subsection{The Dual Simplex Method}
618 \subsubsection{Dual Simplex + Gomory Cuts}