cca32174fe
For index type of induction variable, the indexing math is better represented using affine ops such as `affine.delinearize_index`. This also further demonstrates that some of these `affine` ops might need to move to a different dialect. For one these ops only support `IndexType` when they should be able to work with any integer type. This change also includes some canonicalization patterns for `affine.delinearize_index` operation to 1) Drop unit `basis` values 2) Remove the `delinearize_index` op when the `linear_index` is a loop induction variable of a normalized loop and the `basis` is of size 1 and is also the upper bound of the normalized loop. --------- Signed-off-by: MaheshRavishankar <mahesh.ravishankar@gmail.com>
30 lines
1.4 KiB
MLIR
30 lines
1.4 KiB
MLIR
// RUN: mlir-opt -allow-unregistered-dialect -pass-pipeline='builtin.module(func.func(test-scf-parallel-loop-collapsing{collapsed-indices-0=0,1}, canonicalize))' --mlir-print-local-scope %s | FileCheck %s
|
|
|
|
func.func @collapse_to_single() {
|
|
%c0 = arith.constant 3 : index
|
|
%c1 = arith.constant 7 : index
|
|
%c2 = arith.constant 11 : index
|
|
%c3 = arith.constant 29 : index
|
|
%c4 = arith.constant 3 : index
|
|
%c5 = arith.constant 4 : index
|
|
scf.parallel (%i0, %i1) = (%c0, %c1) to (%c2, %c3) step (%c4, %c5) {
|
|
%result = "magic.op"(%i0, %i1): (index, index) -> index
|
|
}
|
|
return
|
|
}
|
|
|
|
// CHECK: func @collapse_to_single() {
|
|
// CHECK-DAG: %[[C6:.*]] = arith.constant 6 : index
|
|
// CHECK-DAG: %[[C0:.*]] = arith.constant 0 : index
|
|
// CHECK-DAG: %[[C1:.*]] = arith.constant 1 : index
|
|
// CHECK-DAG: %[[C18:.*]] = arith.constant 18 : index
|
|
// CHECK: scf.parallel (%[[NEW_I:.*]]) = (%[[C0]]) to (%[[C18]]) step (%[[C1]]) {
|
|
// CHECK: %[[I0_COUNT:.*]] = arith.remsi %[[NEW_I]], %[[C6]] : index
|
|
// CHECK: %[[I1_COUNT:.*]] = arith.divsi %[[NEW_I]], %[[C6]] : index
|
|
// CHECK: %[[I1:.*]] = affine.apply affine_map<(d0) -> (d0 * 4 + 7)>(%[[I0_COUNT]])
|
|
// CHECK: %[[I0:.*]] = affine.apply affine_map<(d0) -> (d0 * 3 + 3)>(%[[I1_COUNT]])
|
|
// CHECK: "magic.op"(%[[I0]], %[[I1]]) : (index, index) -> index
|
|
// CHECK: scf.reduce
|
|
// CHECK-NEXT: }
|
|
// CHECK-NEXT: return
|