[all-commits] [llvm/llvm-project] 0df59f: [sparse][mlir] simplify lattice optimization logic

Aart Bik via All-commits all-commits at lists.llvm.org
Mon Feb 22 16:52:33 PST 2021


  Branch: refs/heads/main
  Home:   https://github.com/llvm/llvm-project
  Commit: 0df59f234bf09dac203b98427f366be97288f636
      https://github.com/llvm/llvm-project/commit/0df59f234bf09dac203b98427f366be97288f636
  Author: Aart Bik <ajcbik at google.com>
  Date:   2021-02-22 (Mon, 22 Feb 2021)

  Changed paths:
    M mlir/include/mlir/Dialect/Linalg/IR/LinalgSparseOps.td
    M mlir/integration_test/Sparse/CPU/sparse_sampled_matmul.mlir
    M mlir/integration_test/Sparse/CPU/sparse_sum.mlir
    M mlir/lib/Dialect/Linalg/Transforms/Sparsification.cpp
    M mlir/test/Dialect/Linalg/sparse_1d.mlir

  Log Message:
  -----------
  [sparse][mlir] simplify lattice optimization logic

Simplifies the way lattices are optimized with less, but more
powerful rules. This also fixes an inaccuracy where too many
lattices resulted (expecting a non-existing universal index).
Also puts no-side-effects on all proper getters and unifies
bufferization flags order in integration tests (for future,
more complex use cases).

Reviewed By: bixia

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




More information about the All-commits mailing list