File: recursive_alloc_comp_4.f08

package info (click to toggle)
gcc-arm-none-eabi 15%3A12.2.rel1-1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 959,712 kB
  • sloc: cpp: 3,275,382; ansic: 2,061,766; ada: 840,956; f90: 208,513; makefile: 76,132; asm: 73,433; xml: 50,448; exp: 34,146; sh: 32,436; objc: 15,637; fortran: 14,012; python: 11,991; pascal: 6,787; awk: 4,779; perl: 3,054; yacc: 338; ml: 285; lex: 201; haskell: 122
file content (46 lines) | stat: -rw-r--r-- 974 bytes parent folder | download | duplicates (3) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
 
! { dg-do run }
!
! Tests functionality of recursive allocatable derived types.
! Here the recursive components are arrays, unlike the first three testcases.
! Notice that array components are fiendishly difficult to use :-(
!
module m
  type :: recurses
    type(recurses), allocatable :: c(:)
    integer, allocatable :: ia
  end type
end module

  use m
  type(recurses), allocatable, target :: a, d(:)
  type(recurses), pointer :: b1

  integer :: total = 0

! Check chained allocation.
  allocate(a)
  a%ia = 1
  allocate (a%c(2))
  b1 => a%c(1)
  b1%ia = 2

! Check move_alloc.
  allocate (d(2))
  d(1)%ia = 3
  d(2)%ia = 4
  b1 => d(2)
  allocate (b1%c(1))
  b1  => b1%c(1)
  b1%ia = 5
  call move_alloc (d, a%c(2)%c)

  if (a%ia .ne. 1) STOP 1
  if (a%c(1)%ia .ne. 2) STOP 2
  if (a%c(2)%c(1)%ia .ne. 3) STOP 3
  if (a%c(2)%c(2)%ia .ne. 4) STOP 4
  if (a%c(2)%c(2)%c(1)%ia .ne. 5) STOP 5

  if (allocated (a)) deallocate (a)
  if (allocated (d)) deallocate (d)

end