[all-commits] [llvm/llvm-project] 55a1d5: [mlir][sparse] Make sparse compiler more admissible.

[PeimingLiu via All-commits]

  Branch: refs/heads/main
  Home:   https://github.com/llvm/llvm-project
  Commit: 55a1d50fb9abb79c540ae32f1bf16a1fbd29f1a6
      https://github.com/llvm/llvm-project/commit/55a1d50fb9abb79c540ae32f1bf16a1fbd29f1a6
  Author: Peiming Liu <peiming at google.com>
  Date:   2022-09-14 (Wed, 14 Sep 2022)

  Changed paths:
    M mlir/lib/Dialect/SparseTensor/Transforms/Sparsification.cpp
    M mlir/test/Dialect/SparseTensor/sparse_sddmm.mlir
    M mlir/test/Integration/Dialect/SparseTensor/CPU/sparse_filter_conv2d.mlir

  Log Message:
  -----------
  [mlir][sparse] Make sparse compiler more admissible.

Previously, the iteration graph is computed without priority. This patch add a heuristic when computing the iteration graph by starting with Reduction iterator when doing topo sort, which makes Reduction iterators (likely) appear as late in the sorted array as possible.

The current sparse compiler also failed to compile the newly added case.

Reviewed By: aartbik

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