Files
clang-p2996/mlir/test/Dialect/SparseTensor/rejected.mlir
Peiming Liu faa75f94f1 [mlir][sparse] reject kernels with non-sparsfiable reduction expression.
To address https://github.com/llvm/llvm-project/issues/59394.

Reduction on negation of the output tensor is a non-sparsifiable kernel, it creates cyclic dependency.

This patch reject those cases instead of crashing.

Reviewed By: aartbik

Differential Revision: https://reviews.llvm.org/D139659
2022-12-08 23:36:30 +00:00

40 lines
1.5 KiB
MLIR

// RUN: mlir-opt %s -sparsification | FileCheck %s
// The file contains examples that will be rejected by sparse compiler
// (we expect the linalg.generic unchanged).
#SparseVector = #sparse_tensor.encoding<{dimLevelType = ["compressed"]}>
#trait = {
indexing_maps = [
affine_map<(i) -> (i)>, // a (in)
affine_map<(i) -> ()> // x (out)
],
iterator_types = ["reduction"]
}
// CHECK-LABEL: func.func @sparse_reduction_subi(
// CHECK-SAME: %[[VAL_0:.*]]: tensor<i32>,
// CHECK-SAME: %[[VAL_1:.*]]: tensor<?xi32, #sparse_tensor.encoding<{ dimLevelType = [ "compressed" ] }>>) -> tensor<i32> {
// CHECK: %[[VAL_2:.*]] = linalg.generic
// CHECK: ^bb0(%[[VAL_3:.*]]: i32, %[[VAL_4:.*]]: i32):
// CHECK: %[[VAL_5:.*]] = arith.subi %[[VAL_3]], %[[VAL_4]] : i32
// CHECK: linalg.yield %[[VAL_5]] : i32
// CHECK: } -> tensor<i32>
// CHECK: return %[[VAL_6:.*]] : tensor<i32>
func.func @sparse_reduction_subi(%argx: tensor<i32>,
%arga: tensor<?xi32, #SparseVector>)
-> tensor<i32> {
%0 = linalg.generic #trait
ins(%arga: tensor<?xi32, #SparseVector>)
outs(%argx: tensor<i32>) {
^bb(%a: i32, %x: i32):
// NOTE: `subi %a, %x` is the reason why the program is rejected by the sparse compiler.
// It is because we do not allow `-outTensor` in reduction loops as it creates cyclic
// dependences.
%t = arith.subi %a, %x: i32
linalg.yield %t : i32
} -> tensor<i32>
return %0 : tensor<i32>
}