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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
|
! { dg-do run }
! Testcase for PR 31203
! We used to create strings with negative length
subroutine foo(i)
integer :: i
character(len=i) :: s(2)
if (len(s) < 0) call abort
if (len(s) /= max(i,0)) call abort
end
function gee(i)
integer, intent(in) :: i
character(len=i) :: gee
gee = ""
end function gee
subroutine s1(i,j)
character(len=i-j) :: a
if (len(a) < 0) call abort()
end subroutine
program test
interface
function gee(i)
integer, intent(in) :: i
character(len=i) :: gee
end function gee
end interface
call foo(2)
call foo(-1)
call s1(1,2)
call s1(-1,-8)
call s1(-8,-1)
if (len(gee(2)) /= 2) call abort
if (len(gee(-5)) /= 0) call abort
if (len(gee(intfunc(3))) /= max(intfunc(3),0)) call abort
if (len(gee(intfunc(2))) /= max(intfunc(2),0)) call abort
if (len(bar(2)) /= 2) call abort
if (len(bar(-5)) /= 0) call abort
if (len(bar(intfunc(3))) /= max(intfunc(3),0)) call abort
if (len(bar(intfunc(2))) /= max(intfunc(2),0)) call abort
if (cow(bar(2)) /= 2) call abort
if (cow(bar(-5)) /= 0) call abort
if (cow(bar(intfunc(3))) /= max(intfunc(3),0)) call abort
if (cow(bar(intfunc(2))) /= max(intfunc(2),0)) call abort
contains
function bar(i)
integer, intent(in) :: i
character(len=i) :: bar
bar = ""
end function bar
function cow(c)
character(len=*), intent(in) :: c
integer :: cow
cow = len(c)
end function cow
pure function intfunc(i)
integer, intent(in) :: i
integer :: intfunc
intfunc = 2*i-5
end function intfunc
end program test
|
