d7ab38f8f4
Lower the `parallel loop` contrsuct and refactor some of the code of parallel and loop lowering to be reused. Also add tests for loop and parallel since they were not upstreamed. This patch is part of the upstreaming effort from fir-dev branch. Reviewed By: PeteSteinfeld Differential Revision: https://reviews.llvm.org/D128510
698 lines
17 KiB
Fortran
698 lines
17 KiB
Fortran
! This test checks lowering of OpenACC parallel loop combined directive.
|
|
|
|
! RUN: bbc -fopenacc -emit-fir %s -o - | FileCheck %s
|
|
|
|
subroutine acc_parallel_loop
|
|
integer :: i, j
|
|
|
|
integer :: async = 1
|
|
integer :: wait1 = 1
|
|
integer :: wait2 = 2
|
|
integer :: numGangs = 1
|
|
integer :: numWorkers = 10
|
|
integer :: vectorLength = 128
|
|
logical :: ifCondition = .TRUE.
|
|
integer, parameter :: n = 10
|
|
real, dimension(n) :: a, b, c
|
|
real, dimension(n, n) :: d, e
|
|
real, pointer :: f, g
|
|
|
|
integer :: gangNum = 8
|
|
integer :: gangStatic = 8
|
|
integer :: vectorNum = 128
|
|
integer, parameter :: tileSize = 2
|
|
|
|
!CHECK: [[A:%.*]] = fir.alloca !fir.array<10xf32> {{{.*}}uniq_name = "{{.*}}Ea"}
|
|
!CHECK: [[B:%.*]] = fir.alloca !fir.array<10xf32> {{{.*}}uniq_name = "{{.*}}Eb"}
|
|
!CHECK: [[C:%.*]] = fir.alloca !fir.array<10xf32> {{{.*}}uniq_name = "{{.*}}Ec"}
|
|
!CHECK: [[F:%.*]] = fir.alloca !fir.box<!fir.ptr<f32>> {bindc_name = "f", uniq_name = "{{.*}}Ef"}
|
|
!CHECK: [[G:%.*]] = fir.alloca !fir.box<!fir.ptr<f32>> {bindc_name = "g", uniq_name = "{{.*}}Eg"}
|
|
!CHECK: [[IFCONDITION:%.*]] = fir.address_of(@{{.*}}ifcondition) : !fir.ref<!fir.logical<4>>
|
|
|
|
!$acc parallel loop
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: acc.parallel {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop async
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
!$acc end parallel loop
|
|
|
|
!CHECK: acc.parallel {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: } attributes {asyncAttr}
|
|
|
|
!$acc parallel loop async(1)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: [[ASYNC1:%.*]] = arith.constant 1 : i32
|
|
!CHECK: acc.parallel async([[ASYNC1]]: i32) {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop async(async)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: [[ASYNC2:%.*]] = fir.load %{{.*}} : !fir.ref<i32>
|
|
!CHECK: acc.parallel async([[ASYNC2]]: i32) {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop wait
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: acc.parallel {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: } attributes {waitAttr}
|
|
|
|
!$acc parallel loop wait(1)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: [[WAIT1:%.*]] = arith.constant 1 : i32
|
|
!CHECK: acc.parallel wait([[WAIT1]]: i32) {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop wait(1, 2)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: [[WAIT2:%.*]] = arith.constant 1 : i32
|
|
!CHECK: [[WAIT3:%.*]] = arith.constant 2 : i32
|
|
!CHECK: acc.parallel wait([[WAIT2]]: i32, [[WAIT3]]: i32) {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop wait(wait1, wait2)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: [[WAIT4:%.*]] = fir.load %{{.*}} : !fir.ref<i32>
|
|
!CHECK: [[WAIT5:%.*]] = fir.load %{{.*}} : !fir.ref<i32>
|
|
!CHECK: acc.parallel wait([[WAIT4]]: i32, [[WAIT5]]: i32) {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop num_gangs(1)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: [[NUMGANGS1:%.*]] = arith.constant 1 : i32
|
|
!CHECK: acc.parallel num_gangs([[NUMGANGS1]]: i32) {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop num_gangs(numGangs)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: [[NUMGANGS2:%.*]] = fir.load %{{.*}} : !fir.ref<i32>
|
|
!CHECK: acc.parallel num_gangs([[NUMGANGS2]]: i32) {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop num_workers(10)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: [[NUMWORKERS1:%.*]] = arith.constant 10 : i32
|
|
!CHECK: acc.parallel num_workers([[NUMWORKERS1]]: i32) {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop num_workers(numWorkers)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: [[NUMWORKERS2:%.*]] = fir.load %{{.*}} : !fir.ref<i32>
|
|
!CHECK: acc.parallel num_workers([[NUMWORKERS2]]: i32) {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop vector_length(128)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: [[VECTORLENGTH1:%.*]] = arith.constant 128 : i32
|
|
!CHECK: acc.parallel vector_length([[VECTORLENGTH1]]: i32) {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop vector_length(vectorLength)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: [[VECTORLENGTH2:%.*]] = fir.load %{{.*}} : !fir.ref<i32>
|
|
!CHECK: acc.parallel vector_length([[VECTORLENGTH2]]: i32) {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop if(.TRUE.)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: [[IF1:%.*]] = arith.constant true
|
|
!CHECK: acc.parallel if([[IF1]]) {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop if(ifCondition)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: [[IFCOND:%.*]] = fir.load %{{.*}} : !fir.ref<!fir.logical<4>>
|
|
!CHECK: [[IF2:%.*]] = fir.convert [[IFCOND]] : (!fir.logical<4>) -> i1
|
|
!CHECK: acc.parallel if([[IF2]]) {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop self(.TRUE.)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: [[SELF1:%.*]] = arith.constant true
|
|
!CHECK: acc.parallel self([[SELF1]]) {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop self
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: acc.parallel {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: } attributes {selfAttr}
|
|
|
|
!$acc parallel loop self(ifCondition)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: [[SELF2:%.*]] = fir.convert [[IFCONDITION]] : (!fir.ref<!fir.logical<4>>) -> i1
|
|
!CHECK: acc.parallel self([[SELF2]]) {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop copy(a, b)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: acc.parallel copy([[A]]: !fir.ref<!fir.array<10xf32>>, [[B]]: !fir.ref<!fir.array<10xf32>>) {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop copy(a) copy(b)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: acc.parallel copy([[A]]: !fir.ref<!fir.array<10xf32>>, [[B]]: !fir.ref<!fir.array<10xf32>>) {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop copyin(a) copyin(readonly: b)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: acc.parallel copyin([[A]]: !fir.ref<!fir.array<10xf32>>) copyin_readonly([[B]]: !fir.ref<!fir.array<10xf32>>) {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop copyout(a) copyout(zero: b)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: acc.parallel copyout([[A]]: !fir.ref<!fir.array<10xf32>>) copyout_zero([[B]]: !fir.ref<!fir.array<10xf32>>) {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop create(b) create(zero: a)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: acc.parallel create([[B]]: !fir.ref<!fir.array<10xf32>>) create_zero([[A]]: !fir.ref<!fir.array<10xf32>>) {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop no_create(a, b)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: acc.parallel no_create([[A]]: !fir.ref<!fir.array<10xf32>>, [[B]]: !fir.ref<!fir.array<10xf32>>) {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop present(a, b)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: acc.parallel present([[A]]: !fir.ref<!fir.array<10xf32>>, [[B]]: !fir.ref<!fir.array<10xf32>>) {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop deviceptr(a) deviceptr(b)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: acc.parallel deviceptr([[A]]: !fir.ref<!fir.array<10xf32>>, [[B]]: !fir.ref<!fir.array<10xf32>>) {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop attach(f, g)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: acc.parallel attach([[F]]: !fir.ref<!fir.box<!fir.ptr<f32>>>, [[G]]: !fir.ref<!fir.box<!fir.ptr<f32>>>) {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop private(a) firstprivate(b)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: acc.parallel private([[A]]: !fir.ref<!fir.array<10xf32>>) firstprivate([[B]]: !fir.ref<!fir.array<10xf32>>) {
|
|
!CHECK: acc.loop private([[A]]: !fir.ref<!fir.array<10xf32>>) {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop seq
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: acc.parallel {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: } attributes {seq}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop auto
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: acc.parallel {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: } attributes {auto}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop independent
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: acc.parallel {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: } attributes {independent}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop gang
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: acc.parallel {
|
|
!CHECK: acc.loop gang {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop gang(num: 8)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: acc.parallel {
|
|
!CHECK: [[GANGNUM1:%.*]] = arith.constant 8 : i32
|
|
!CHECK-NEXT: acc.loop gang(num=[[GANGNUM1]]: i32) {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop gang(num: gangNum)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: acc.parallel {
|
|
!CHECK: [[GANGNUM2:%.*]] = fir.load %{{.*}} : !fir.ref<i32>
|
|
!CHECK-NEXT: acc.loop gang(num=[[GANGNUM2]]: i32) {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop gang(num: gangNum, static: gangStatic)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: acc.parallel {
|
|
!CHECK: acc.loop gang(num=%{{.*}}: i32, static=%{{.*}}: i32) {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop vector
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
!CHECK: acc.parallel {
|
|
!CHECK: acc.loop vector {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop vector(128)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: acc.parallel {
|
|
!CHECK: [[CONSTANT128:%.*]] = arith.constant 128 : i32
|
|
!CHECK: acc.loop vector([[CONSTANT128]]: i32) {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop vector(vectorLength)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: acc.parallel {
|
|
!CHECK: [[VECTORLENGTH:%.*]] = fir.load %{{.*}} : !fir.ref<i32>
|
|
!CHECK: acc.loop vector([[VECTORLENGTH]]: i32) {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop worker
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: acc.parallel {
|
|
!CHECK: acc.loop worker {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop worker(128)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: acc.parallel {
|
|
!CHECK: [[WORKER128:%.*]] = arith.constant 128 : i32
|
|
!CHECK: acc.loop worker([[WORKER128]]: i32) {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop collapse(2)
|
|
DO i = 1, n
|
|
DO j = 1, n
|
|
d(i, j) = e(i, j)
|
|
END DO
|
|
END DO
|
|
|
|
!CHECK: acc.parallel {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: } attributes {collapse = 2 : i64}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop
|
|
DO i = 1, n
|
|
!$acc loop
|
|
DO j = 1, n
|
|
d(i, j) = e(i, j)
|
|
END DO
|
|
END DO
|
|
|
|
!CHECK: acc.parallel {
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.loop {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop tile(2)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: acc.parallel {
|
|
!CHECK: [[TILESIZE:%.*]] = arith.constant 2 : i32
|
|
!CHECK: acc.loop tile([[TILESIZE]]: i32) {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop tile(*)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: acc.parallel {
|
|
!CHECK: [[TILESIZEM1:%.*]] = arith.constant -1 : i32
|
|
!CHECK: acc.loop tile([[TILESIZEM1]]: i32) {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop tile(2, 2)
|
|
DO i = 1, n
|
|
DO j = 1, n
|
|
d(i, j) = e(i, j)
|
|
END DO
|
|
END DO
|
|
|
|
!CHECK: acc.parallel {
|
|
!CHECK: [[TILESIZE1:%.*]] = arith.constant 2 : i32
|
|
!CHECK: [[TILESIZE2:%.*]] = arith.constant 2 : i32
|
|
!CHECK: acc.loop tile([[TILESIZE1]]: i32, [[TILESIZE2]]: i32) {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop tile(tileSize)
|
|
DO i = 1, n
|
|
a(i) = b(i)
|
|
END DO
|
|
|
|
!CHECK: acc.parallel {
|
|
!CHECK: acc.loop tile(%{{.*}}: i32) {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
!$acc parallel loop tile(tileSize, tileSize)
|
|
DO i = 1, n
|
|
DO j = 1, n
|
|
d(i, j) = e(i, j)
|
|
END DO
|
|
END DO
|
|
|
|
!CHECK: acc.parallel {
|
|
!CHECK: acc.loop tile(%{{.*}}: i32, %{{.*}}: i32) {
|
|
!CHECK: fir.do_loop
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
!CHECK: acc.yield
|
|
!CHECK-NEXT: }{{$}}
|
|
|
|
end subroutine acc_parallel_loop
|