Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
[flang][NFC] Add global lowering tests
This patch adds some lowering tests for globals. This patch is part of the upstreaming effort from fir-dev branch. Reviewed By: PeteSteinfeld Differential Revision: https://reviews.llvm.org/D122322 Co-authored-by: Jean Perier <jperier@nvidia.com> Co-authored-by: Eric Schweitz <eschweitz@nvidia.com>
- Loading branch information
1 parent
72acd04
commit e539fac
Showing
3 changed files
with
292 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,235 @@ | ||
! Test default initialization of global variables (static init) | ||
! RUN: bbc %s -o - | FileCheck %s | ||
|
||
module tinit | ||
real, target :: ziel(100) | ||
|
||
type tno_init | ||
integer :: k | ||
end type | ||
|
||
type t0 | ||
integer :: k = 66 | ||
end type | ||
|
||
! Test type that combines all kinds of components with and without | ||
! default initialization. | ||
type t1 | ||
! Simple type component with default init | ||
integer :: i = 42 | ||
! Simple type component without default init | ||
integer :: j | ||
|
||
! Pointer component with a default initial target | ||
real, pointer :: x(:) => ziel | ||
! Pointer component with no init | ||
real, pointer :: y(:) | ||
! Pointer component with null init | ||
real, pointer :: z(:) => NULL() | ||
|
||
! Character component with init | ||
character(10) c1 = "hello" | ||
! Character component without init | ||
character(10) c2 | ||
|
||
! Component with a derived type that has default init | ||
type(t0) :: somet0 | ||
! Component with a derived type that has no default init. | ||
type(tno_init) :: sometno_init | ||
! Component whose type default init is overridden by | ||
! default init for the component. | ||
type(t0) :: somet0_2 = t0(33) | ||
! Array component with a derived type that has default init | ||
type(t0) :: somet0_array | ||
end type | ||
|
||
! Test type that extends type with default init. | ||
type, extends(t0) :: textendst0 | ||
integer :: l | ||
end type | ||
|
||
! Test type with default init in equivalences | ||
type tseq | ||
sequence | ||
integer :: i = 2 | ||
integer :: j = 3 | ||
end type | ||
|
||
! Test scalar with default init | ||
type(t0) :: at0 | ||
! CHECK-LABEL: fir.global @_QMtinitEat0 : !fir.type<_QMtinitTt0{k:i32}> { | ||
! CHECK: %[[VAL_0:.*]] = arith.constant 66 : i32 | ||
! CHECK: %[[VAL_1:.*]] = fir.undefined !fir.type<_QMtinitTt0{k:i32}> | ||
! CHECK: %[[VAL_2:.*]] = fir.insert_value %[[VAL_1]], %[[VAL_0]], ["k", !fir.type<_QMtinitTt0{k:i32}>] : (!fir.type<_QMtinitTt0{k:i32}>, i32) -> !fir.type<_QMtinitTt0{k:i32}> | ||
! CHECK: fir.has_value %[[VAL_2]] : !fir.type<_QMtinitTt0{k:i32}> | ||
|
||
! Test array with default init | ||
type(t0) :: bt0(100) | ||
! CHECK-LABEL: @_QMtinitEbt0 : !fir.array<100x!fir.type<_QMtinitTt0{k:i32}>> { | ||
! CHECK: %[[VAL_3:.*]] = arith.constant 66 : i32 | ||
! CHECK: %[[VAL_4:.*]] = fir.undefined !fir.type<_QMtinitTt0{k:i32}> | ||
! CHECK: %[[VAL_5:.*]] = fir.insert_value %[[VAL_4]], %[[VAL_3]], ["k", !fir.type<_QMtinitTt0{k:i32}>] : (!fir.type<_QMtinitTt0{k:i32}>, i32) -> !fir.type<_QMtinitTt0{k:i32}> | ||
! CHECK: %[[VAL_6:.*]] = fir.undefined !fir.array<100x!fir.type<_QMtinitTt0{k:i32}>> | ||
! CHECK: %[[VAL_7:.*]] = fir.insert_on_range %[[VAL_6]], %[[VAL_5]] from (0) to (99) : (!fir.array<100x!fir.type<_QMtinitTt0{k:i32}>>, !fir.type<_QMtinitTt0{k:i32}>) -> !fir.array<100x!fir.type<_QMtinitTt0{k:i32}>> | ||
! CHECK: fir.has_value %[[VAL_7]] : !fir.array<100x!fir.type<_QMtinitTt0{k:i32}>> | ||
|
||
! Test default init overridden by explicit init | ||
type(t0) :: ct0 = t0(42) | ||
! CHECK-LABEL: fir.global @_QMtinitEct0 : !fir.type<_QMtinitTt0{k:i32}> { | ||
! CHECK: %[[VAL_8:.*]] = arith.constant 42 : i32 | ||
! CHECK: %[[VAL_9:.*]] = fir.undefined !fir.type<_QMtinitTt0{k:i32}> | ||
! CHECK: %[[VAL_10:.*]] = fir.insert_value %[[VAL_9]], %[[VAL_8]], ["k", !fir.type<_QMtinitTt0{k:i32}>] : (!fir.type<_QMtinitTt0{k:i32}>, i32) -> !fir.type<_QMtinitTt0{k:i32}> | ||
! CHECK: fir.has_value %[[VAL_10]] : !fir.type<_QMtinitTt0{k:i32}> | ||
|
||
! Test a non trivial derived type mixing all sorts of default initialization | ||
type(t1) :: dt1 | ||
! CHECK-LABEL: @_QMtinitEdt1 : !fir.type<_QMtinitTt1{{.*}}> { | ||
! CHECK-DAG: %[[VAL_11:.*]] = arith.constant 42 : i32 | ||
! CHECK-DAG: %[[VAL_12:.*]] = arith.constant 100 : index | ||
! CHECK-DAG: %[[VAL_13:.*]] = arith.constant 0 : index | ||
! CHECK-DAG: %[[VAL_14:.*]] = arith.constant 33 : i32 | ||
! CHECK-DAG: %[[VAL_15:.*]] = arith.constant 66 : i32 | ||
! CHECK: %[[VAL_16:.*]] = fir.undefined !fir.type<_QMtinitTt1{{.*}}> | ||
! CHECK: %[[VAL_17:.*]] = fir.insert_value %[[VAL_16]], %[[VAL_11]], ["i", !fir.type<_QMtinitTt1{{.*}}>] : (!fir.type<_QMtinitTt1{{.*}}>, i32) -> !fir.type<_QMtinitTt1{{.*}}> | ||
! CHECK: %[[VAL_18:.*]] = fir.undefined i32 | ||
! CHECK: %[[VAL_19:.*]] = fir.insert_value %[[VAL_17]], %[[VAL_18]], ["j", !fir.type<_QMtinitTt1{{.*}}>] : (!fir.type<_QMtinitTt1{{.*}}>, i32) -> !fir.type<_QMtinitTt1{{.*}}> | ||
! CHECK: %[[VAL_20:.*]] = fir.address_of(@_QMtinitEziel) : !fir.ref<!fir.array<100xf32>> | ||
! CHECK: %[[VAL_21:.*]] = fir.shape %[[VAL_12]] : (index) -> !fir.shape<1> | ||
! CHECK: %[[VAL_22:.*]] = fir.embox %[[VAL_20]](%[[VAL_21]]) : (!fir.ref<!fir.array<100xf32>>, !fir.shape<1>) -> !fir.box<!fir.ptr<!fir.array<?xf32>>> | ||
! CHECK: %[[VAL_23:.*]] = fir.insert_value %[[VAL_19]], %[[VAL_22]], ["x", !fir.type<_QMtinitTt1{{.*}}>] : (!fir.type<_QMtinitTt1{{.*}}>, !fir.box<!fir.ptr<!fir.array<?xf32>>>) -> !fir.type<_QMtinitTt1{{.*}}> | ||
! CHECK: %[[VAL_24:.*]] = fir.zero_bits !fir.ptr<!fir.array<?xf32>> | ||
! CHECK: %[[VAL_25:.*]] = fir.shape %[[VAL_13]] : (index) -> !fir.shape<1> | ||
! CHECK: %[[VAL_26:.*]] = fir.embox %[[VAL_24]](%[[VAL_25]]) : (!fir.ptr<!fir.array<?xf32>>, !fir.shape<1>) -> !fir.box<!fir.ptr<!fir.array<?xf32>>> | ||
! CHECK: %[[VAL_27:.*]] = fir.insert_value %[[VAL_23]], %[[VAL_26]], ["y", !fir.type<_QMtinitTt1{{.*}}>] : (!fir.type<_QMtinitTt1{{.*}}>, !fir.box<!fir.ptr<!fir.array<?xf32>>>) -> !fir.type<_QMtinitTt1{{.*}}> | ||
! CHECK: %[[VAL_28:.*]] = fir.insert_value %[[VAL_27]], %[[VAL_26]], ["z", !fir.type<_QMtinitTt1{{.*}}>] : (!fir.type<_QMtinitTt1{{.*}}>, !fir.box<!fir.ptr<!fir.array<?xf32>>>) -> !fir.type<_QMtinitTt1{{.*}}> | ||
! CHECK: %[[VAL_29:.*]] = fir.string_lit "hello "(10) : !fir.char<1,10> | ||
! CHECK: %[[VAL_30:.*]] = fir.insert_value %[[VAL_28]], %[[VAL_29]], ["c1", !fir.type<_QMtinitTt1{{.*}}>] : (!fir.type<_QMtinitTt1{{.*}}>, !fir.char<1,10>) -> !fir.type<_QMtinitTt1{{.*}}> | ||
! CHECK: %[[VAL_31:.*]] = fir.undefined !fir.char<1,10> | ||
! CHECK: %[[VAL_32:.*]] = fir.insert_value %[[VAL_30]], %[[VAL_31]], ["c2", !fir.type<_QMtinitTt1{{.*}}>] : (!fir.type<_QMtinitTt1{{.*}}>, !fir.char<1,10>) -> !fir.type<_QMtinitTt1{{.*}}> | ||
! CHECK: %[[VAL_33:.*]] = fir.undefined !fir.type<_QMtinitTt0{k:i32}> | ||
! CHECK: %[[VAL_34:.*]] = fir.insert_value %[[VAL_33]], %[[VAL_15]], ["k", !fir.type<_QMtinitTt0{k:i32}>] : (!fir.type<_QMtinitTt0{k:i32}>, i32) -> !fir.type<_QMtinitTt0{k:i32}> | ||
! CHECK: %[[VAL_35:.*]] = fir.insert_value %[[VAL_32]], %[[VAL_34]], ["somet0", !fir.type<_QMtinitTt1{{.*}}>] : (!fir.type<_QMtinitTt1{{.*}}>, !fir.type<_QMtinitTt0{k:i32}>) -> !fir.type<_QMtinitTt1{{.*}}> | ||
! CHECK: %[[VAL_36:.*]] = fir.undefined !fir.type<_QMtinitTtno_init{k:i32}> | ||
! CHECK: %[[VAL_37:.*]] = fir.insert_value %[[VAL_35]], %[[VAL_36]], ["sometno_init", !fir.type<_QMtinitTt1{{.*}}>] : (!fir.type<_QMtinitTt1{{.*}}>, !fir.type<_QMtinitTtno_init{k:i32}>) -> !fir.type<_QMtinitTt1{{.*}}> | ||
! CHECK: %[[VAL_38:.*]] = fir.insert_value %[[VAL_33]], %[[VAL_14]], ["k", !fir.type<_QMtinitTt0{k:i32}>] : (!fir.type<_QMtinitTt0{k:i32}>, i32) -> !fir.type<_QMtinitTt0{k:i32}> | ||
! CHECK: %[[VAL_39:.*]] = fir.insert_value %[[VAL_37]], %[[VAL_38]], ["somet0_2", !fir.type<_QMtinitTt1{{.*}}>] : (!fir.type<_QMtinitTt1{{.*}}>, !fir.type<_QMtinitTt0{k:i32}>) -> !fir.type<_QMtinitTt1{{.*}}> | ||
! CHECK: %[[VAL_40:.*]] = fir.insert_value %[[VAL_39]], %[[VAL_34]], ["somet0_array", !fir.type<_QMtinitTt1{{.*}}>] : (!fir.type<_QMtinitTt1{{.*}}>, !fir.type<_QMtinitTt0{k:i32}>) -> !fir.type<_QMtinitTt1{{.*}}> | ||
! CHECK: fir.has_value %[[VAL_40]] : !fir.type<_QMtinitTt1{{.*}}> | ||
|
||
! Test a type extending other type with a default init | ||
type(textendst0) :: etextendst0 | ||
! CHECK-LABEL: @_QMtinitEetextendst0 : !fir.type<_QMtinitTtextendst0{k:i32,l:i32}> { | ||
! CHECK: %[[VAL_42:.*]] = arith.constant 66 : i32 | ||
! CHECK: %[[VAL_43:.*]] = fir.undefined !fir.type<_QMtinitTtextendst0{k:i32,l:i32}> | ||
! CHECK: %[[VAL_44:.*]] = fir.insert_value %[[VAL_43]], %[[VAL_42]], ["k", !fir.type<_QMtinitTtextendst0{k:i32,l:i32}>] : (!fir.type<_QMtinitTtextendst0{k:i32,l:i32}>, i32) -> !fir.type<_QMtinitTtextendst0{k:i32,l:i32}> | ||
! CHECK: %[[VAL_45:.*]] = fir.undefined i32 | ||
! CHECK: %[[VAL_46:.*]] = fir.insert_value %[[VAL_44]], %[[VAL_45]], ["l", !fir.type<_QMtinitTtextendst0{k:i32,l:i32}>] : (!fir.type<_QMtinitTtextendst0{k:i32,l:i32}>, i32) -> !fir.type<_QMtinitTtextendst0{k:i32,l:i32}> | ||
! CHECK: fir.has_value %[[VAL_46]] : !fir.type<_QMtinitTtextendst0{k:i32,l:i32}> | ||
end module | ||
|
||
|
||
! Test that default initialization is also applied to saved variables | ||
subroutine saved() | ||
use tinit | ||
type(t0), save :: savedt0 | ||
! CHECK-LABEL: fir.global internal @_QFsavedEsavedt0 : !fir.type<_QMtinitTt0{k:i32}> { | ||
! CHECK: %[[VAL_47:.*]] = arith.constant 66 : i32 | ||
! CHECK: %[[VAL_48:.*]] = fir.undefined !fir.type<_QMtinitTt0{k:i32}> | ||
! CHECK: %[[VAL_49:.*]] = fir.insert_value %[[VAL_48]], %[[VAL_47]], ["k", !fir.type<_QMtinitTt0{k:i32}>] : (!fir.type<_QMtinitTt0{k:i32}>, i32) -> !fir.type<_QMtinitTt0{k:i32}> | ||
! CHECK: fir.has_value %[[VAL_49]] : !fir.type<_QMtinitTt0{k:i32}> | ||
end subroutine | ||
|
||
! Test default initialization in equivalences | ||
subroutine eqv() | ||
use tinit | ||
type(tseq), save :: somet | ||
integer :: i(2) | ||
equivalence (somet, i) | ||
! CHECK-LABEL: fir.global internal @_QFeqvEi : !fir.array<2xi32> { | ||
! CHECK-DAG: %[[VAL_50:.*]] = arith.constant 2 : i32 | ||
! CHECK-DAG: %[[VAL_51:.*]] = arith.constant 3 : i32 | ||
! CHECK: %[[VAL_52:.*]] = fir.undefined !fir.array<2xi32> | ||
! CHECK: %[[VAL_53:.*]] = fir.insert_value %[[VAL_52]], %[[VAL_50]], [0 : index] : (!fir.array<2xi32>, i32) -> !fir.array<2xi32> | ||
! CHECK: %[[VAL_54:.*]] = fir.insert_value %[[VAL_53]], %[[VAL_51]], [1 : index] : (!fir.array<2xi32>, i32) -> !fir.array<2xi32> | ||
! CHECK: fir.has_value %[[VAL_54]] : !fir.array<2xi32> | ||
end subroutine | ||
|
||
subroutine eqv_explicit_init() | ||
use tinit | ||
type(tseq), save :: somet | ||
integer :: i(2) = [4, 5] | ||
equivalence (somet, i) | ||
! CHECK-LABEL: fir.global internal @_QFeqv_explicit_initEi : !fir.array<2xi32> { | ||
! CHECK-DAG: %[[VAL_57:.*]] = arith.constant 4 : i32 | ||
! CHECK-DAG: %[[VAL_58:.*]] = arith.constant 5 : i32 | ||
! CHECK: %[[VAL_59:.*]] = fir.undefined !fir.array<2xi32> | ||
! CHECK: %[[VAL_60:.*]] = fir.insert_value %[[VAL_59]], %[[VAL_57]], [0 : index] : (!fir.array<2xi32>, i32) -> !fir.array<2xi32> | ||
! CHECK: %[[VAL_61:.*]] = fir.insert_value %[[VAL_60]], %[[VAL_58]], [1 : index] : (!fir.array<2xi32>, i32) -> !fir.array<2xi32> | ||
! CHECK: fir.has_value %[[VAL_61]] : !fir.array<2xi32> | ||
end subroutine | ||
|
||
subroutine eqv_same_default_init() | ||
use tinit | ||
type(tseq), save :: somet1(2), somet2 | ||
equivalence (somet1(1), somet2) | ||
! CHECK-LABEL: fir.global internal @_QFeqv_same_default_initEsomet1 : !fir.array<2xi64> { | ||
! CHECK: %[[VAL_62:.*]] = arith.constant 12884901890 : i64 | ||
! CHECK: %[[VAL_63:.*]] = fir.undefined !fir.array<2xi64> | ||
! CHECK: %[[VAL_64:.*]] = fir.insert_on_range %[[VAL_63]], %[[VAL_62]] from (0) to (1) : (!fir.array<2xi64>, i64) -> !fir.array<2xi64> | ||
! CHECK: fir.has_value %[[VAL_64]] : !fir.array<2xi64> | ||
end subroutine | ||
|
||
subroutine eqv_full_overlaps_with_explicit_init() | ||
use tinit | ||
type(tseq), save :: somet | ||
integer, save :: link(4) | ||
integer :: i(2) = [5, 6] | ||
integer :: j(2) = [7, 8] | ||
! Equivalence: somet fully covered by explicit init. | ||
! i(1)=5 | i(2)=6 | - | - | ||
! - | somet%i | somet%j | | ||
! - | - | j(1)=7 | j(2)=8 | ||
equivalence (i, link(1)) | ||
equivalence (somet, link(2)) | ||
equivalence (j, link(3)) | ||
! CHECK-LABEL: fir.global internal @_QFeqv_full_overlaps_with_explicit_initEi : !fir.array<4xi32> { | ||
! CHECK-DAG: %[[VAL_73:.*]] = arith.constant 5 : i32 | ||
! CHECK-DAG: %[[VAL_74:.*]] = arith.constant 6 : i32 | ||
! CHECK-DAG: %[[VAL_75:.*]] = arith.constant 7 : i32 | ||
! CHECK-DAG: %[[VAL_76:.*]] = arith.constant 8 : i32 | ||
! CHECK-DAG: %[[VAL_77:.*]] = fir.undefined !fir.array<4xi32> | ||
! CHECK-DAG: %[[VAL_78:.*]] = fir.insert_value %[[VAL_77]], %[[VAL_73]], [0 : index] : (!fir.array<4xi32>, i32) -> !fir.array<4xi32> | ||
! CHECK-DAG: %[[VAL_79:.*]] = fir.insert_value %[[VAL_78]], %[[VAL_74]], [1 : index] : (!fir.array<4xi32>, i32) -> !fir.array<4xi32> | ||
! CHECK-DAG: %[[VAL_80:.*]] = fir.insert_value %[[VAL_79]], %[[VAL_75]], [2 : index] : (!fir.array<4xi32>, i32) -> !fir.array<4xi32> | ||
! CHECK-DAG: %[[VAL_81:.*]] = fir.insert_value %[[VAL_80]], %[[VAL_76]], [3 : index] : (!fir.array<4xi32>, i32) -> !fir.array<4xi32> | ||
! CHECK-DAG: fir.has_value %[[VAL_81]] : !fir.array<4xi32> | ||
end subroutine | ||
|
||
subroutine eqv_partial_overlaps_with_explicit_init() | ||
use tinit | ||
type(tseq), save :: somet | ||
integer, save :: link(4) | ||
integer :: i(2) = [5, 6] | ||
integer :: j = 7 | ||
! `somet` is only partially covered by explicit init, somet%j default | ||
! init value should be used in the equiv storage init to match nvfortran, | ||
! ifort, and nagfor behavior (gfortran refuses this code). 19.5.3.4 point | ||
! 10 specifies that explicit initialization overrides default initialization. | ||
! i(1)=5 | i(2)=6 | - | - | ||
! - | somet%i | somet%j | | ||
! - | - | - | j=7 | ||
equivalence (i, link(1)) | ||
equivalence (somet, link(2)) | ||
equivalence (j, link(4)) | ||
! CHECK-LABEL: fir.global internal @_QFeqv_partial_overlaps_with_explicit_initEi : !fir.array<4xi32> | ||
! CHECK-DAG: %[[VAL_82:.*]] = arith.constant 5 : i32 | ||
! CHECK-DAG: %[[VAL_83:.*]] = arith.constant 6 : i32 | ||
! CHECK-DAG: %[[VAL_84:.*]] = arith.constant 3 : i32 | ||
! CHECK-DAG: %[[VAL_85:.*]] = arith.constant 7 : i32 | ||
! CHECK: %[[VAL_86:.*]] = fir.undefined !fir.array<4xi32> | ||
! CHECK: %[[VAL_87:.*]] = fir.insert_value %[[VAL_86]], %[[VAL_82]], [0 : index] : (!fir.array<4xi32>, i32) -> !fir.array<4xi32> | ||
! CHECK: %[[VAL_88:.*]] = fir.insert_value %[[VAL_87]], %[[VAL_83]], [1 : index] : (!fir.array<4xi32>, i32) -> !fir.array<4xi32> | ||
! CHECK: %[[VAL_89:.*]] = fir.insert_value %[[VAL_88]], %[[VAL_84]], [2 : index] : (!fir.array<4xi32>, i32) -> !fir.array<4xi32> | ||
! CHECK: %[[VAL_90:.*]] = fir.insert_value %[[VAL_89]], %[[VAL_85]], [3 : index] : (!fir.array<4xi32>, i32) -> !fir.array<4xi32> | ||
! CHECK: fir.has_value %[[VAL_90]] : !fir.array<4xi32> | ||
end subroutine |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,14 @@ | ||
! RUN: bbc -emit-fir -o - %s | FileCheck %s | ||
|
||
! Test checks whether the text of the format statement is hashconed into a | ||
! global similar to a CHARACTER literal and then referenced. | ||
|
||
program other | ||
write(10, 1008) | ||
! CHECK: fir.address_of(@{{.*}}) : | ||
1008 format('ok') | ||
end | ||
! CHECK-LABEL: fir.global linkonce @_QQcl.28276F6B2729 constant | ||
! CHECK: %[[lit:.*]] = fir.string_lit "('ok')"(6) : !fir.char<1,6> | ||
! CHECK: fir.has_value %[[lit]] : !fir.char<1,6> | ||
! CHECK: } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,43 @@ | ||
! RUN: bbc %s -o - | FileCheck %s | ||
|
||
program bar | ||
! CHECK: fir.address_of(@[[name1:.*]]my_data) | ||
integer, save :: my_data = 1 | ||
print *, my_data | ||
contains | ||
|
||
! CHECK-LABEL: func @_QFPfoo | ||
subroutine foo() | ||
! CHECK: fir.address_of(@[[name2:.*foo.*my_data]]) | ||
integer, save :: my_data = 2 | ||
print *, my_data + 1 | ||
end subroutine | ||
|
||
! CHECK-LABEL: func @_QFPfoo2 | ||
subroutine foo2() | ||
! CHECK: fir.address_of(@[[name3:.*foo2.*my_data]]) | ||
integer, save :: my_data | ||
my_data = 4 | ||
print *, my_data | ||
end subroutine | ||
|
||
! CHECK-LABEL: func @_QFPfoo3 | ||
subroutine foo3() | ||
! CHECK-DAG: fir.address_of(@[[name4:.*foo3.*idata]]){{.*}}fir.array<5xi32> | ||
! CHECK-DAG: fir.address_of(@[[name5:.*foo3.*rdata]]){{.*}}fir.array<3xf16> | ||
! CHECK-DAG: fir.address_of(@[[name6:.*foo3.*my_data]]){{.*}}fir.array<2x4xi64> | ||
integer*4, dimension(5), save :: idata = (/ (i*i, i=1,5) /) | ||
integer*8, dimension(2, 10:13), save :: my_data = reshape((/1,2,3,4,5,6,7,8/), shape(my_data)) | ||
real*2, dimension(7:9), save :: rdata = (/100., 99., 98./) | ||
print *, rdata(9) | ||
print *, idata(3) | ||
print *, my_data(1,11) | ||
end subroutine | ||
end program | ||
|
||
! CHECK: fir.global internal @[[name1]] | ||
! CHECK: fir.global internal @[[name2]] | ||
! CHECK: fir.global internal @[[name3]] | ||
! CHECK-DAG: fir.global internal @[[name4]]{{.*}}fir.array<5xi32> | ||
! CHECK-DAG: fir.global internal @[[name5]]{{.*}}fir.array<3xf16> | ||
! CHECK-DAG: fir.global internal @[[name6]]{{.*}}fir.array<2x4xi64> |