circt/test/Dialect/Calyx/affine-ploop-unparallelize....

176 lines
7.2 KiB
MLIR

// RUN: circt-opt --affine-ploop-unparallelize --canonicalize --split-input-file --verify-diagnostics %s | FileCheck %s
// CHECK-LABEL: func.func @main(
// CHECK-SAME: %[[VAL_0:[0-9]+|[a-zA-Z$._-][a-zA-Z0-9$._-]*]]: memref<16x4xf32>) {
// CHECK: %[[VAL_1:.*]] = arith.constant 0.000000e+00 : f32
// CHECK: affine.for %[[VAL_2:.*]] = 0 to 4 step 2 {
// CHECK: affine.parallel (%[[VAL_3:.*]]) = (0) to (2) {
// CHECK: affine.for %[[VAL_4:.*]] = 0 to 16 {
// CHECK: affine.store %[[VAL_1]], %[[VAL_0]]{{\[}}%[[VAL_2]] + %[[VAL_3]], %[[VAL_4]]] : memref<16x4xf32>
// CHECK: }
// CHECK: }
// CHECK: }
// CHECK: return
// CHECK: }
module {
func.func @main(%arg0: memref<16x4xf32>) {
%c0 = arith.constant 0.0 : f32
affine.parallel (%arg2) = (0) to (4) {
affine.for %arg3 = 0 to 16 {
affine.store %c0, %arg0[%arg2, %arg3] : memref<16x4xf32>
}
} {unparallelize.factor=2}
return
}
}
// -----
// Test nested `affine.parallel`s
// CHECK-LABEL: func.func @main(
// CHECK-SAME: %[[VAL_0:[0-9]+|[a-zA-Z$._-][a-zA-Z0-9$._-]*]]: memref<16x4xf32>) {
// CHECK: %[[VAL_1:.*]] = arith.constant 0.000000e+00 : f32
// CHECK: affine.for %[[VAL_2:.*]] = 0 to 4 step 2 {
// CHECK: affine.parallel (%[[VAL_3:.*]]) = (0) to (2) {
// CHECK: affine.for %[[VAL_4:.*]] = 0 to 16 {
// CHECK: affine.parallel (%[[VAL_5:.*]]) = (0) to (1) {
// CHECK: affine.store %[[VAL_1]], %[[VAL_0]]{{\[}}%[[VAL_2]] + %[[VAL_3]], %[[VAL_4]] + %[[VAL_5]]] : memref<16x4xf32>
// CHECK: }
// CHECK: }
// CHECK: }
// CHECK: }
// CHECK: return
// CHECK: }
module {
func.func @main(%arg0: memref<16x4xf32>) {
%c0 = arith.constant 0.0 : f32
affine.parallel (%arg2) = (0) to (4) {
affine.parallel (%arg3) = (0) to (16) {
affine.store %c0, %arg0[%arg2, %arg3] : memref<16x4xf32>
} {unparallelize.factor=1}
} {unparallelize.factor=2}
return
}
}
// -----
// Test simplify `scf.index_switch` with nested `affine.parallel`s
// CHECK-LABEL: func.func @main(
// CHECK-SAME: %[[VAL_0:[0-9]+|[a-zA-Z$._-][a-zA-Z0-9$._-]*]]: memref<4x6xf32>,
// CHECK-SAME: %[[VAL_1:[0-9]+|[a-zA-Z$._-][a-zA-Z0-9$._-]*]]: memref<4x6xf32>,
// CHECK-SAME: %[[VAL_2:[0-9]+|[a-zA-Z$._-][a-zA-Z0-9$._-]*]]: memref<4x6xf32>,
// CHECK-SAME: %[[VAL_3:[0-9]+|[a-zA-Z$._-][a-zA-Z0-9$._-]*]]: memref<4x6xf32>,
// CHECK-SAME: %[[VAL_4:[0-9]+|[a-zA-Z$._-][a-zA-Z0-9$._-]*]]: memref<4x6xf32>,
// CHECK-SAME: %[[VAL_5:[0-9]+|[a-zA-Z$._-][a-zA-Z0-9$._-]*]]: memref<4x6xf32>) {
// CHECK: %[[VAL_6:.*]] = arith.constant 0.000000e+00 : f32
// CHECK: affine.for %[[VAL_7:.*]] = 0 to 8 step 2 {
// CHECK: affine.parallel (%[[VAL_8:.*]]) = (0) to (2) {
// CHECK: affine.for %[[VAL_9:.*]] = 0 to 18 step 3 {
// CHECK: affine.parallel (%[[VAL_10:.*]]) = (0) to (3) {
// CHECK: scf.index_switch %[[VAL_8]]
// CHECK: case 0 {
// CHECK: scf.index_switch %[[VAL_10]]
// CHECK: case 0 {
// CHECK: affine.store %[[VAL_6]], %[[VAL_0]][(%[[VAL_7]] + %[[VAL_8]]) floordiv 2, (%[[VAL_9]] + %[[VAL_10]]) floordiv 3] : memref<4x6xf32>
// CHECK: scf.yield
// CHECK: }
// CHECK: case 1 {
// CHECK: affine.store %[[VAL_6]], %[[VAL_1]][(%[[VAL_7]] + %[[VAL_8]]) floordiv 2, (%[[VAL_9]] + %[[VAL_10]]) floordiv 3] : memref<4x6xf32>
// CHECK: scf.yield
// CHECK: }
// CHECK: case 2 {
// CHECK: affine.store %[[VAL_6]], %[[VAL_2]][(%[[VAL_7]] + %[[VAL_8]]) floordiv 2, (%[[VAL_9]] + %[[VAL_10]]) floordiv 3] : memref<4x6xf32>
// CHECK: scf.yield
// CHECK: }
// CHECK: default {
// CHECK: }
// CHECK: scf.yield
// CHECK: }
// CHECK: case 1 {
// CHECK: scf.index_switch %[[VAL_10]]
// CHECK: case 0 {
// CHECK: affine.store %[[VAL_6]], %[[VAL_3]][(%[[VAL_7]] + %[[VAL_8]]) floordiv 2, (%[[VAL_9]] + %[[VAL_10]]) floordiv 3] : memref<4x6xf32>
// CHECK: scf.yield
// CHECK: }
// CHECK: case 1 {
// CHECK: affine.store %[[VAL_6]], %[[VAL_4]][(%[[VAL_7]] + %[[VAL_8]]) floordiv 2, (%[[VAL_9]] + %[[VAL_10]]) floordiv 3] : memref<4x6xf32>
// CHECK: scf.yield
// CHECK: }
// CHECK: case 2 {
// CHECK: affine.store %[[VAL_6]], %[[VAL_5]][(%[[VAL_7]] + %[[VAL_8]]) floordiv 2, (%[[VAL_9]] + %[[VAL_10]]) floordiv 3] : memref<4x6xf32>
// CHECK: scf.yield
// CHECK: }
// CHECK: default {
// CHECK: }
// CHECK: scf.yield
// CHECK: }
// CHECK: default {
// CHECK: }
// CHECK: }
// CHECK: }
// CHECK: }
// CHECK: }
// CHECK: return
// CHECK: }
#map = affine_map<(d0) -> (d0 mod 2)>
#map1 = affine_map<(d0) -> (d0 mod 3)>
module {
func.func @main(%arg0: memref<4x6xf32>, %arg1: memref<4x6xf32>, %arg2: memref<4x6xf32>, %arg3: memref<4x6xf32>, %arg4: memref<4x6xf32>, %arg5: memref<4x6xf32>) {
%cst = arith.constant 0.000000e+00 : f32
affine.parallel (%arg6) = (0) to (8) {
affine.parallel (%arg7) = (0) to (18) {
%0 = affine.apply #map(%arg6)
scf.index_switch %0
case 0 {
%1 = affine.apply #map1(%arg7)
scf.index_switch %1
case 0 {
affine.store %cst, %arg0[%arg6 floordiv 2, %arg7 floordiv 3] : memref<4x6xf32>
scf.yield
}
case 1 {
affine.store %cst, %arg1[%arg6 floordiv 2, %arg7 floordiv 3] : memref<4x6xf32>
scf.yield
}
case 2 {
affine.store %cst, %arg2[%arg6 floordiv 2, %arg7 floordiv 3] : memref<4x6xf32>
scf.yield
}
default {
}
scf.yield
}
case 1 {
%1 = affine.apply #map1(%arg7)
scf.index_switch %1
case 0 {
affine.store %cst, %arg3[%arg6 floordiv 2, %arg7 floordiv 3] : memref<4x6xf32>
scf.yield
}
case 1 {
affine.store %cst, %arg4[%arg6 floordiv 2, %arg7 floordiv 3] : memref<4x6xf32>
scf.yield
}
case 2 {
affine.store %cst, %arg5[%arg6 floordiv 2, %arg7 floordiv 3] : memref<4x6xf32>
scf.yield
}
default {
}
scf.yield
}
default {
}
} {unparallelize.factor=3}
} {unparallelize.factor=2}
return
}
}