forked from OSchip/llvm-project
129 lines
5.7 KiB
MLIR
129 lines
5.7 KiB
MLIR
// RUN: mlir-opt %s -pass-pipeline='builtin.func(for-loop-range-folding)' -split-input-file | FileCheck %s
|
|
|
|
func @fold_one_loop(%arg0: memref<?xi32>, %arg1: index, %arg2: index) {
|
|
%c0 = arith.constant 0 : index
|
|
%c1 = arith.constant 1 : index
|
|
%c4 = arith.constant 4 : index
|
|
scf.for %i = %c0 to %arg1 step %c1 {
|
|
%0 = arith.addi %arg2, %i : index
|
|
%1 = arith.muli %0, %c4 : index
|
|
%2 = memref.load %arg0[%1] : memref<?xi32>
|
|
%3 = arith.muli %2, %2 : i32
|
|
memref.store %3, %arg0[%1] : memref<?xi32>
|
|
}
|
|
return
|
|
}
|
|
|
|
// CHECK-LABEL: func @fold_one_loop
|
|
// CHECK-SAME: (%[[ARG0:.*]]: {{.*}}, %[[ARG1:.*]]: {{.*}}, %[[ARG2:.*]]: {{.*}}
|
|
// CHECK: %[[C0:.*]] = arith.constant 0 : index
|
|
// CHECK: %[[C1:.*]] = arith.constant 1 : index
|
|
// CHECK: %[[C4:.*]] = arith.constant 4 : index
|
|
// CHECK: %[[I0:.*]] = arith.addi %[[ARG2]], %[[C0]] : index
|
|
// CHECK: %[[I1:.*]] = arith.addi %[[ARG2]], %[[ARG1]] : index
|
|
// CHECK: %[[I2:.*]] = arith.muli %[[I1]], %[[C4]] : index
|
|
// CHECK: %[[I3:.*]] = arith.muli %[[C1]], %[[C4]] : index
|
|
// CHECK: scf.for %[[I:.*]] = %[[I0]] to %[[I2]] step %[[I3]] {
|
|
// CHECK: %[[I4:.*]] = memref.load %[[ARG0]]{{\[}}%[[I]]
|
|
// CHECK: %[[I5:.*]] = arith.muli %[[I4]], %[[I4]] : i32
|
|
// CHECK: memref.store %[[I5]], %[[ARG0]]{{\[}}%[[I]]
|
|
|
|
func @fold_one_loop2(%arg0: memref<?xi32>, %arg1: index, %arg2: index) {
|
|
%c0 = arith.constant 0 : index
|
|
%c1 = arith.constant 1 : index
|
|
%c4 = arith.constant 4 : index
|
|
%c10 = arith.constant 10 : index
|
|
scf.for %j = %c0 to %c10 step %c1 {
|
|
scf.for %i = %c0 to %arg1 step %c1 {
|
|
%0 = arith.addi %arg2, %i : index
|
|
%1 = arith.muli %0, %c4 : index
|
|
%2 = memref.load %arg0[%1] : memref<?xi32>
|
|
%3 = arith.muli %2, %2 : i32
|
|
memref.store %3, %arg0[%1] : memref<?xi32>
|
|
}
|
|
}
|
|
return
|
|
}
|
|
|
|
// CHECK-LABEL: func @fold_one_loop2
|
|
// CHECK-SAME: (%[[ARG0:.*]]: {{.*}}, %[[ARG1:.*]]: {{.*}}, %[[ARG2:.*]]: {{.*}}
|
|
// CHECK: %[[C0:.*]] = arith.constant 0 : index
|
|
// CHECK: %[[C1:.*]] = arith.constant 1 : index
|
|
// CHECK: %[[C4:.*]] = arith.constant 4 : index
|
|
// CHECK: %[[C10:.*]] = arith.constant 10 : index
|
|
// CHECK: scf.for %[[J:.*]] = %[[C0]] to %[[C10]] step %[[C1]] {
|
|
// CHECK: %[[I0:.*]] = arith.addi %[[ARG2]], %[[C0]] : index
|
|
// CHECK: %[[I1:.*]] = arith.addi %[[ARG2]], %[[ARG1]] : index
|
|
// CHECK: %[[I2:.*]] = arith.muli %[[I1]], %[[C4]] : index
|
|
// CHECK: %[[I3:.*]] = arith.muli %[[C1]], %[[C4]] : index
|
|
// CHECK: scf.for %[[I:.*]] = %[[I0]] to %[[I2]] step %[[I3]] {
|
|
// CHECK: %[[I4:.*]] = memref.load %[[ARG0]]{{\[}}%[[I]]
|
|
// CHECK: %[[I5:.*]] = arith.muli %[[I4]], %[[I4]] : i32
|
|
// CHECK: memref.store %[[I5]], %[[ARG0]]{{\[}}%[[I]]
|
|
|
|
func @fold_two_loops(%arg0: memref<?xi32>, %arg1: index, %arg2: index) {
|
|
%c0 = arith.constant 0 : index
|
|
%c1 = arith.constant 1 : index
|
|
%c4 = arith.constant 4 : index
|
|
%c10 = arith.constant 10 : index
|
|
scf.for %j = %c0 to %c10 step %c1 {
|
|
scf.for %i = %j to %arg1 step %c1 {
|
|
%0 = arith.addi %arg2, %i : index
|
|
%1 = arith.muli %0, %c4 : index
|
|
%2 = memref.load %arg0[%1] : memref<?xi32>
|
|
%3 = arith.muli %2, %2 : i32
|
|
memref.store %3, %arg0[%1] : memref<?xi32>
|
|
}
|
|
}
|
|
return
|
|
}
|
|
|
|
// CHECK-LABEL: func @fold_two_loops
|
|
// CHECK-SAME: (%[[ARG0:.*]]: {{.*}}, %[[ARG1:.*]]: {{.*}}, %[[ARG2:.*]]: {{.*}}
|
|
// CHECK: %[[C0:.*]] = arith.constant 0 : index
|
|
// CHECK: %[[C1:.*]] = arith.constant 1 : index
|
|
// CHECK: %[[C4:.*]] = arith.constant 4 : index
|
|
// CHECK: %[[C10:.*]] = arith.constant 10 : index
|
|
// CHECK: %[[I0:.*]] = arith.addi %[[ARG2]], %[[C0]] : index
|
|
// CHECK: %[[I1:.*]] = arith.addi %[[ARG2]], %[[C10]] : index
|
|
// CHECK: scf.for %[[J:.*]] = %[[I0]] to %[[I1]] step %[[C1]] {
|
|
// CHECK: %[[I1:.*]] = arith.addi %[[ARG2]], %[[ARG1]] : index
|
|
// CHECK: %[[I2:.*]] = arith.muli %[[I1]], %[[C4]] : index
|
|
// CHECK: %[[I3:.*]] = arith.muli %[[C1]], %[[C4]] : index
|
|
// CHECK: scf.for %[[I:.*]] = %[[J]] to %[[I2]] step %[[I3]] {
|
|
// CHECK: %[[I4:.*]] = memref.load %[[ARG0]]{{\[}}%[[I]]
|
|
// CHECK: %[[I5:.*]] = arith.muli %[[I4]], %[[I4]] : i32
|
|
// CHECK: memref.store %[[I5]], %[[ARG0]]{{\[}}%[[I]]
|
|
|
|
// If an instruction's operands are not defined outside the loop, we cannot
|
|
// perform the optimization, as is the case with the arith.muli below. (If
|
|
// paired with loop invariant code motion we can continue.)
|
|
func @fold_only_first_add(%arg0: memref<?xi32>, %arg1: index, %arg2: index) {
|
|
%c0 = arith.constant 0 : index
|
|
%c1 = arith.constant 1 : index
|
|
%c4 = arith.constant 4 : index
|
|
scf.for %i = %c0 to %arg1 step %c1 {
|
|
%0 = arith.addi %arg2, %i : index
|
|
%1 = arith.addi %arg2, %c4 : index
|
|
%2 = arith.muli %0, %1 : index
|
|
%3 = memref.load %arg0[%2] : memref<?xi32>
|
|
%4 = arith.muli %3, %3 : i32
|
|
memref.store %4, %arg0[%2] : memref<?xi32>
|
|
}
|
|
return
|
|
}
|
|
|
|
// CHECK-LABEL: func @fold_only_first_add
|
|
// CHECK-SAME: (%[[ARG0:.*]]: {{.*}}, %[[ARG1:.*]]: {{.*}}, %[[ARG2:.*]]: {{.*}}
|
|
// CHECK: %[[C0:.*]] = arith.constant 0 : index
|
|
// CHECK: %[[C1:.*]] = arith.constant 1 : index
|
|
// CHECK: %[[C4:.*]] = arith.constant 4 : index
|
|
// CHECK: %[[I0:.*]] = arith.addi %[[ARG2]], %[[C0]] : index
|
|
// CHECK: %[[I1:.*]] = arith.addi %[[ARG2]], %[[ARG1]] : index
|
|
// CHECK: scf.for %[[I:.*]] = %[[I0]] to %[[I1]] step %[[C1]] {
|
|
// CHECK: %[[I2:.*]] = arith.addi %[[ARG2]], %[[C4]] : index
|
|
// CHECK: %[[I3:.*]] = arith.muli %[[I]], %[[I2]] : index
|
|
// CHECK: %[[I4:.*]] = memref.load %[[ARG0]]{{\[}}%[[I3]]
|
|
// CHECK: %[[I5:.*]] = arith.muli %[[I4]], %[[I4]] : i32
|
|
// CHECK: memref.store %[[I5]], %[[ARG0]]{{\[}}%[[I3]]
|