[all-commits] [llvm/llvm-project] 33f574: [MLIR] Redundancy detection for FlatAffineConstrai...

[Arjun P via All-commits]

  Branch: refs/heads/master
  Home:   https://github.com/llvm/llvm-project
  Commit: 33f574672f40fb94c818901208824303350df55e
      https://github.com/llvm/llvm-project/commit/33f574672f40fb94c818901208824303350df55e
  Author: Arjun P <arjunpitchanathan at gmail.com>
  Date:   2020-08-20 (Thu, 20 Aug 2020)

  Changed paths:
    M mlir/include/mlir/Analysis/AffineStructures.h
    M mlir/include/mlir/Analysis/Presburger/Simplex.h
    M mlir/lib/Analysis/AffineStructures.cpp
    M mlir/lib/Analysis/Presburger/Simplex.cpp
    M mlir/unittests/Analysis/AffineStructuresTest.cpp
    M mlir/unittests/Analysis/Presburger/SimplexTest.cpp

  Log Message:
  -----------
  [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