[all-commits] [llvm/llvm-project] 6db019: [MLIR] Introduce LexSimplex to support lexicograph...

[Arjun P via All-commits]

  Branch: refs/heads/main
  Home:   https://github.com/llvm/llvm-project
  Commit: 6db019582a52129935f0e4c9471401954ee1cecf
      https://github.com/llvm/llvm-project/commit/6db019582a52129935f0e4c9471401954ee1cecf
  Author: Arjun P <arjunpitchanathan at gmail.com>
  Date:   2022-01-28 (Fri, 28 Jan 2022)

  Changed paths:
    M mlir/include/mlir/Analysis/Presburger/IntegerPolyhedron.h
    M mlir/include/mlir/Analysis/Presburger/Matrix.h
    M mlir/include/mlir/Analysis/Presburger/Simplex.h
    M mlir/lib/Analysis/Presburger/IntegerPolyhedron.cpp
    M mlir/lib/Analysis/Presburger/Matrix.cpp
    M mlir/lib/Analysis/Presburger/Simplex.cpp
    M mlir/unittests/Analysis/Presburger/IntegerPolyhedronTest.cpp

  Log Message:
  -----------
  [MLIR] Introduce LexSimplex to support lexicographic optimization

This patch introduces a class LexSimplex that can currently be used to find the
lexicographically minimal rational point in an IntegerPolyhedron. This is a
series of patches leading to computing the lexicographically minimal integer
lattice point as well parametric lexicographic minimization.

Reviewed By: Groverkss

Differential Revision: https://reviews.llvm.org/D117437