| 1 |
! Tests mapping of a `do concurrent` loop with multiple iteration ranges. |
| 2 |
|
| 3 |
! RUN: split-file %s %t |
| 4 |
|
| 5 |
! RUN: %flang_fc1 -emit-hlfir -fopenmp -fdo-concurrent-to-openmp=host %t/multi_range.f90 -o - \ |
| 6 |
! RUN: | FileCheck %s |
| 7 |
|
| 8 |
!--- multi_range.f90 |
| 9 |
program main |
| 10 |
integer, parameter :: n = 20 |
| 11 |
integer, parameter :: m = 40 |
| 12 |
integer, parameter :: l = 60 |
| 13 |
integer :: a(n, m, l) |
| 14 |
|
| 15 |
do concurrent(i=3:n, j=5:m, k=7:l) |
| 16 |
a(i,j,k) = i * j + k |
| 17 |
end do |
| 18 |
end |
| 19 |
|
| 20 |
! CHECK: func.func @_QQmain |
| 21 |
|
| 22 |
! CHECK: %[[C3:.*]] = arith.constant 3 : i32 |
| 23 |
! CHECK: %[[LB_I:.*]] = fir.convert %[[C3]] : (i32) -> index |
| 24 |
! CHECK: %[[C20:.*]] = arith.constant 20 : i32 |
| 25 |
! CHECK: %[[UB_I:.*]] = fir.convert %[[C20]] : (i32) -> index |
| 26 |
! CHECK: %[[STEP_I:.*]] = arith.constant 1 : index |
| 27 |
|
| 28 |
! CHECK: %[[C5:.*]] = arith.constant 5 : i32 |
| 29 |
! CHECK: %[[LB_J:.*]] = fir.convert %[[C5]] : (i32) -> index |
| 30 |
! CHECK: %[[C40:.*]] = arith.constant 40 : i32 |
| 31 |
! CHECK: %[[UB_J:.*]] = fir.convert %[[C40]] : (i32) -> index |
| 32 |
! CHECK: %[[STEP_J:.*]] = arith.constant 1 : index |
| 33 |
|
| 34 |
! CHECK: %[[C7:.*]] = arith.constant 7 : i32 |
| 35 |
! CHECK: %[[LB_K:.*]] = fir.convert %[[C7]] : (i32) -> index |
| 36 |
! CHECK: %[[C60:.*]] = arith.constant 60 : i32 |
| 37 |
! CHECK: %[[UB_K:.*]] = fir.convert %[[C60]] : (i32) -> index |
| 38 |
! CHECK: %[[STEP_K:.*]] = arith.constant 1 : index |
| 39 |
|
| 40 |
! CHECK: omp.parallel { |
| 41 |
|
| 42 |
! CHECK-NEXT: %[[ITER_VAR_I:.*]] = fir.alloca i32 {bindc_name = "i"} |
| 43 |
! CHECK-NEXT: %[[BINDING_I:.*]]:2 = hlfir.declare %[[ITER_VAR_I]] {uniq_name = "_QFEi"} |
| 44 |
|
| 45 |
! CHECK-NEXT: %[[ITER_VAR_J:.*]] = fir.alloca i32 {bindc_name = "j"} |
| 46 |
! CHECK-NEXT: %[[BINDING_J:.*]]:2 = hlfir.declare %[[ITER_VAR_J]] {uniq_name = "_QFEj"} |
| 47 |
|
| 48 |
! CHECK-NEXT: %[[ITER_VAR_K:.*]] = fir.alloca i32 {bindc_name = "k"} |
| 49 |
! CHECK-NEXT: %[[BINDING_K:.*]]:2 = hlfir.declare %[[ITER_VAR_K]] {uniq_name = "_QFEk"} |
| 50 |
|
| 51 |
! CHECK: omp.wsloop { |
| 52 |
! CHECK-NEXT: omp.loop_nest |
| 53 |
! CHECK-SAME: (%[[ARG0:[^[:space:]]+]], %[[ARG1:[^[:space:]]+]], %[[ARG2:[^[:space:]]+]]) |
| 54 |
! CHECK-SAME: : index = (%[[LB_I]], %[[LB_J]], %[[LB_K]]) |
| 55 |
! CHECK-SAME: to (%[[UB_I]], %[[UB_J]], %[[UB_K]]) inclusive |
| 56 |
! CHECK-SAME: step (%[[STEP_I]], %[[STEP_J]], %[[STEP_K]]) { |
| 57 |
|
| 58 |
! CHECK-NEXT: %[[IV_IDX_I:.*]] = fir.convert %[[ARG0]] |
| 59 |
! CHECK-NEXT: fir.store %[[IV_IDX_I]] to %[[BINDING_I]]#0 |
| 60 |
|
| 61 |
! CHECK-NEXT: %[[IV_IDX_J:.*]] = fir.convert %[[ARG1]] |
| 62 |
! CHECK-NEXT: fir.store %[[IV_IDX_J]] to %[[BINDING_J]]#0 |
| 63 |
|
| 64 |
! CHECK-NEXT: %[[IV_IDX_K:.*]] = fir.convert %[[ARG2]] |
| 65 |
! CHECK-NEXT: fir.store %[[IV_IDX_K]] to %[[BINDING_K]]#0 |
| 66 |
|
| 67 |
! CHECK: omp.yield |
| 68 |
! CHECK-NEXT: } |
| 69 |
! CHECK-NEXT: } |
| 70 |
|
| 71 |
! CHECK-NEXT: omp.terminator |
| 72 |
! CHECK-NEXT: } |