Home
last modified time | relevance | path

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

/llvm-project-15.0.7/mlir/unittests/Analysis/Presburger/
H A DSimplexTest.cpp26 Simplex simplex(2); in TEST() local
51 Simplex simplex(1); in TEST() local
68 Simplex simplex(3); in TEST() local
106 return simplex; in simplexFromConstraints()
237 Simplex simplex(0); in TEST() local
246 Simplex simplex(0); in TEST() local
254 Simplex simplex(1); in TEST() local
263 Simplex simplex(1); in TEST() local
271 Simplex simplex(1); in TEST() local
279 Simplex simplex(1); in TEST() local
[all …]
/llvm-project-15.0.7/mlir/lib/Analysis/Presburger/
H A DPresburgerRelation.cpp197 Simplex simplex(b); in getSetDifference() local
310 unsigned offset = simplex.getNumConstraints(); in getSetDifference()
313 simplex.appendVariable(numLocalsAdded); in getSetDifference()
316 simplex.intersectIntegerRelation(sI); in getSetDifference()
318 if (simplex.isEmpty()) { in getSetDifference()
323 simplex.rollback(initialSnapshot); in getSetDifference()
355 simplex.rollback(snapshotBeforeIntersect); in getSetDifference()
390 simplex.rollback(frame.simplexSnapshot); in getSetDifference()
395 simplex.addInequality(ineq); in getSetDifference()
407 frame.simplexSnapshot = simplex.getSnapshot(); in getSetDifference()
[all …]
H A DSimplex.cpp1633 snapshotStack.push_back(simplex.getSnapshot()); in addEqualityForDirection()
1634 simplex.addEquality(getCoeffsForDirection(dir)); in addEqualityForDirection()
1655 SimplexRollbackScopeExit scopeExit(simplex); in computeWidthAndDuals()
1657 unsigned row = simplex.con[conIndex].pos; in computeWidthAndDuals()
1661 dualDenom = simplex.tableau(row, 0); in computeWidthAndDuals()
1691 if (simplex.con[i].orientation == Orientation::Column) in computeWidthAndDuals()
1692 dual.push_back(-simplex.tableau(row, simplex.con[i].pos)); in computeWidthAndDuals()
1694 dual.push_back(simplex.tableau(row, simplex.con[i + 1].pos)); in computeWidthAndDuals()
1707 simplex.rollback(snapshotStack.back()); in removeLastEquality()
1717 assert(2 * dir.size() == simplex.getNumVariables() && in getCoeffsForDirection()
[all …]
H A DIntegerRelation.cpp683 Simplex simplex(*this); in getBoundedDirections() local
692 if (simplex.isBoundedAlongConstraint(i)) in getBoundedDirections()
771 Simplex simplex(*this); in findIntegerSample() local
772 if (simplex.isEmpty()) in findIntegerSample()
776 if (!simplex.isUnbounded()) in findIntegerSample()
777 return simplex.findIntegerSample(); in findIntegerSample()
1057 Simplex simplex(*this); in removeRedundantConstraints() local
1058 simplex.detectRedundant(); in removeRedundantConstraints()
1065 if (!simplex.isMarkedRedundant(r)) in removeRedundantConstraints()
1086 Simplex simplex(*this); in computeVolume() local
[all …]
/llvm-project-15.0.7/mlir/include/mlir/Analysis/Presburger/
H A DSimplex.h872 SimplexRollbackScopeExit(SimplexBase &simplex) : simplex(simplex) { in SimplexRollbackScopeExit() argument
873 snapshot = simplex.getSnapshot(); in SimplexRollbackScopeExit()
875 ~SimplexRollbackScopeExit() { simplex.rollback(snapshot); } in ~SimplexRollbackScopeExit()
878 SimplexBase &simplex;
/llvm-project-15.0.7/polly/lib/External/isl/
H A Disl_vertices.c1454 struct isl_cell *simplex; in call_on_simplex() local
1459 if (!simplex) in call_on_simplex()
1462 if (!simplex->vertices) in call_on_simplex()
1465 if (!simplex->dom) in call_on_simplex()
1467 simplex->n_vertices = n_simplex + n_other; in call_on_simplex()
1468 simplex->ids = isl_alloc_array(ctx, int, simplex->n_vertices); in call_on_simplex()
1469 if (!simplex->ids) in call_on_simplex()
1473 simplex->ids[i] = simplex_ids[i]; in call_on_simplex()
1475 simplex->ids[n_simplex + i] = other_ids[i]; in call_on_simplex()
1477 return fn(simplex, user); in call_on_simplex()
[all …]
H A Disl_vertices_private.h62 isl_stat (*fn)(__isl_take isl_cell *simplex, void *user), void *user);
/llvm-project-15.0.7/polly/lib/External/isl/doc/
H A Dimplementation.tex175 In the following sections, we briefly recall the dual simplex
186 In {\tt isl}, the dual simplex method uses the same representation
188 simplex method. The implementation of this LP solver is based
213 The dual simplex method starts from an initial sample value that
270 The solution found by the dual simplex method may have
369 of the actual dual simplex method with Gomory cuts.
474 the dual simplex method.
562 implementation uses a recursive call to the dual simplex with Gomory
621 of the dual simplex method applied to this new context will be the same
624 the dual simplex method incrementally on the context and backtrack