diff options
author | Arjun P <arjunpitchanathan@gmail.com> | 2020-08-20 13:37:44 +0530 |
---|---|---|
committer | Uday Bondhugula <uday@polymagelabs.com> | 2020-08-20 13:38:51 +0530 |
commit | 33f574672f40fb94c818901208824303350df55e (patch) | |
tree | 562a0d187dd1139f30f702797c95f93309957885 /llvm/lib/Support/APFixedPoint.cpp | |
parent | 33e2f69a24b4ea271a83899b1a5c1af31c6a9c06 (diff) | |
download | llvm-33f574672f40fb94c818901208824303350df55e.zip llvm-33f574672f40fb94c818901208824303350df55e.tar.gz llvm-33f574672f40fb94c818901208824303350df55e.tar.bz2 |
[MLIR] Redundancy detection for FlatAffineConstraints using Simplex
This patch adds the capability to perform constraint redundancy checks for `FlatAffineConstraints` using `Simplex`, via a new member function `FlatAffineConstraints::removeRedundantConstraints`. The pre-existing redundancy detection algorithm runs a full rational emptiness check for each inequality separately for checking redundancy. Leveraging the existing `Simplex` infrastructure, in this patch we have an algorithm for redundancy checks that can check each constraint by performing pivots on the tableau, which provides an alternative to running Fourier-Motzkin elimination for each constraint separately.
Differential Revision: https://reviews.llvm.org/D84935
Diffstat (limited to 'llvm/lib/Support/APFixedPoint.cpp')
0 files changed, 0 insertions, 0 deletions