0e9b7b054c
Now that we have changes introduced by #145837, mapping reductions from `do concurrent` to OpenMP is almost trivial. This PR adds such mapping. PR stack: - https://github.com/llvm/llvm-project/pull/145837 - https://github.com/llvm/llvm-project/pull/146025 - https://github.com/llvm/llvm-project/pull/146028 - https://github.com/llvm/llvm-project/pull/146033 (this one)
74 lines
3.7 KiB
MLIR
74 lines
3.7 KiB
MLIR
// Tests mapping reductions from fir to OpenMP.
|
|
|
|
// RUN: fir-opt --omp-do-concurrent-conversion="map-to=host" %s | FileCheck %s
|
|
|
|
fir.declare_reduction @add_reduction_i32 : i32 init {
|
|
^bb0(%arg0: i32):
|
|
%c0_i32 = arith.constant 0 : i32
|
|
fir.yield(%c0_i32 : i32)
|
|
} combiner {
|
|
^bb0(%arg0: i32, %arg1: i32):
|
|
%0 = arith.addi %arg0, %arg1 : i32
|
|
fir.yield(%0 : i32)
|
|
}
|
|
|
|
func.func @_QPdo_concurrent_reduce() {
|
|
%3 = fir.alloca i32 {bindc_name = "s", uniq_name = "_QFdo_concurrent_reduceEs"}
|
|
%4:2 = hlfir.declare %3 {uniq_name = "_QFdo_concurrent_reduceEs"} : (!fir.ref<i32>) -> (!fir.ref<i32>, !fir.ref<i32>)
|
|
%c1 = arith.constant 1 : index
|
|
fir.do_concurrent {
|
|
%7 = fir.alloca i32 {bindc_name = "i"}
|
|
%8:2 = hlfir.declare %7 {uniq_name = "_QFdo_concurrent_reduceEi"} : (!fir.ref<i32>) -> (!fir.ref<i32>, !fir.ref<i32>)
|
|
fir.do_concurrent.loop (%arg0) = (%c1) to (%c1) step (%c1) reduce(@add_reduction_i32 #fir.reduce_attr<add> %4#0 -> %arg1 : !fir.ref<i32>) {
|
|
%9 = fir.convert %arg0 : (index) -> i32
|
|
fir.store %9 to %8#0 : !fir.ref<i32>
|
|
%10:2 = hlfir.declare %arg1 {uniq_name = "_QFdo_concurrent_reduceEs"} : (!fir.ref<i32>) -> (!fir.ref<i32>, !fir.ref<i32>)
|
|
%11 = fir.load %10#0 : !fir.ref<i32>
|
|
%c1_i32_0 = arith.constant 1 : i32
|
|
%12 = arith.addi %11, %c1_i32_0 : i32
|
|
hlfir.assign %12 to %10#0 : i32, !fir.ref<i32>
|
|
}
|
|
}
|
|
return
|
|
}
|
|
|
|
// CHECK-LABEL: omp.declare_reduction @add_reduction_i32.omp : i32 init {
|
|
// CHECK: ^bb0(%[[VAL_0:.*]]: i32):
|
|
// CHECK: %[[VAL_1:.*]] = arith.constant 0 : i32
|
|
// CHECK: omp.yield(%[[VAL_1]] : i32)
|
|
|
|
// CHECK-LABEL: } combiner {
|
|
// CHECK: ^bb0(%[[VAL_0:.*]]: i32, %[[VAL_1:.*]]: i32):
|
|
// CHECK: %[[VAL_2:.*]] = arith.addi %[[VAL_0]], %[[VAL_1]] : i32
|
|
// CHECK: omp.yield(%[[VAL_2]] : i32)
|
|
// CHECK: }
|
|
|
|
// CHECK-LABEL: func.func @_QPdo_concurrent_reduce() {
|
|
// CHECK: %[[VAL_0:.*]] = fir.alloca i32 {bindc_name = "i"}
|
|
// CHECK: %[[VAL_1:.*]]:2 = hlfir.declare %[[VAL_0]] {uniq_name = "_QFdo_concurrent_reduceEi"} : (!fir.ref<i32>) -> (!fir.ref<i32>, !fir.ref<i32>)
|
|
// CHECK: %[[VAL_2:.*]] = fir.alloca i32 {bindc_name = "s", uniq_name = "_QFdo_concurrent_reduceEs"}
|
|
// CHECK: %[[VAL_3:.*]]:2 = hlfir.declare %[[VAL_2]] {uniq_name = "_QFdo_concurrent_reduceEs"} : (!fir.ref<i32>) -> (!fir.ref<i32>, !fir.ref<i32>)
|
|
// CHECK: %[[VAL_4:.*]] = arith.constant 1 : index
|
|
// CHECK: omp.parallel {
|
|
// CHECK: %[[VAL_5:.*]] = fir.alloca i32 {bindc_name = "i"}
|
|
// CHECK: %[[VAL_6:.*]]:2 = hlfir.declare %[[VAL_5]] {uniq_name = "_QFdo_concurrent_reduceEi"} : (!fir.ref<i32>) -> (!fir.ref<i32>, !fir.ref<i32>)
|
|
|
|
// CHECK: omp.wsloop reduction(@add_reduction_i32.omp %[[VAL_3]]#0 -> %[[VAL_7:.*]] : !fir.ref<i32>) {
|
|
// CHECK: omp.loop_nest (%[[VAL_8:.*]]) : index = (%[[VAL_4]]) to (%[[VAL_4]]) inclusive step (%[[VAL_4]]) {
|
|
// CHECK: %[[VAL_9:.*]] = fir.convert %[[VAL_8]] : (index) -> i32
|
|
// CHECK: fir.store %[[VAL_9]] to %[[VAL_6]]#0 : !fir.ref<i32>
|
|
// CHECK: %[[VAL_10:.*]]:2 = hlfir.declare %[[VAL_7]] {uniq_name = "_QFdo_concurrent_reduceEs"} : (!fir.ref<i32>) -> (!fir.ref<i32>, !fir.ref<i32>)
|
|
// CHECK: %[[VAL_11:.*]] = fir.load %[[VAL_10]]#0 : !fir.ref<i32>
|
|
// CHECK: %[[VAL_12:.*]] = arith.constant 1 : i32
|
|
// CHECK: %[[VAL_13:.*]] = arith.addi %[[VAL_11]], %[[VAL_12]] : i32
|
|
// CHECK: hlfir.assign %[[VAL_13]] to %[[VAL_10]]#0 : i32, !fir.ref<i32>
|
|
// CHECK: omp.yield
|
|
// CHECK: }
|
|
// CHECK: }
|
|
// CHECK: omp.terminator
|
|
// CHECK: }
|
|
|
|
// CHECK: return
|
|
// CHECK: }
|
|
|