[all-commits] [llvm/llvm-project] e59997: [mlir][sparse] first proof-of-concept non-permuta...

[Aart Bik via All-commits]

  Branch: refs/heads/main
  Home:   https://github.com/llvm/llvm-project
  Commit: e599978760e88231b834772eca080c42b71716c3
      https://github.com/llvm/llvm-project/commit/e599978760e88231b834772eca080c42b71716c3
  Author: Aart Bik <39774503+aartbik at users.noreply.github.com>
  Date:   2023-10-31 (Tue, 31 Oct 2023)

  Changed paths:
    M mlir/lib/Dialect/SparseTensor/Transforms/SparseReinterpretMap.cpp
    M mlir/test/Dialect/SparseTensor/sparse_reinterpret_map.mlir

  Log Message:
  -----------
   [mlir][sparse] first proof-of-concept non-permutation rewriter (#70863)

Rather than extending sparsifier codegen with higher order
non-permutations, we follow the path of rewriting linalg generic ops
into higher order operations. That way, code generation will simply work
out of the box. This is a very first proof-of-concept rewriting of that
idea.