File: power_8.f90

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 (64 lines) | stat: -rw-r--r-- 1,261 bytes parent folder | download | duplicates (2)
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
! { dg-do run }
! { dg-additional-options "-fdump-tree-original" }
!
! PR88579 - Test optimizations for bases that are powers of 2 or -2.
program p
  implicit none
  integer(4) :: i, u
  integer(1) :: j, v
  integer(2) :: k, w
  integer(8) :: z
  ! Test selected positive bases
  u = 1
  do i=1,5
     u = u * 64_4
     if (u /= 64_4 ** i) stop 1
  end do
  z = 1
  do i=1,7
     z = z * 256_8
     if (z /= 256_8 ** i) stop 2
  end do
  z = 1
  do i=1,3
     z = z * 65536_8
     if (z /= 65536_8 ** i) stop 3
  end do
  ! Test selected negative bases and integer kind combinations
  u = 1
  do i=1,7
     u = u * (-2_1)
     if (u /= (-2_1) ** i) stop 4
  end do
  v = 1
  do j=1,7
     v = v * (-2_1)
     if (v /= (-2_1) ** j) stop 5
  end do
  v = 1
  do k=1,7
     v = v * (-2_1)
     if (v /= (-2_1) ** k) stop 6
  end do
  w = 1
  do k=1,7
     w = w * (-4_2)
     if (w /= (-4_2) ** k) stop 7
  end do
  w = 1
  do i=1,5
     w = w * (-8_2)
     if (w /= (-8_2) ** i) stop 8
  end do
  u = 1
  do i=1,1
     u = u * (-HUGE(1_4)/2-1)
     if (u /= (-HUGE(1_4)/2-1) ** i) stop 9
  end do
  z = 1
  do i=1,7
     z = z * (-512_8)
     if (z /= (-512_8) ** i) stop 10
  end do
end program p
! { dg-final { scan-tree-dump-not "_gfortran_pow" "original" } }