blob: 04b40f32a732b2f086af2254f6453d03178560b9 (
plain)
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
|
/* { dg-do compile } */
/* { dg-options "-O1 -fno-trapping-math -funsafe-math-optimizations -fdump-tree-recip" } */
double F[2] = { 0.0, 0.0 }, e;
/* In this case the optimization is interesting. */
float h ()
{
int i;
double E, W, P, d;
W = 1.1;
d = 2.*e;
E = 1. - d;
for( i=0; i < 2; i++ )
if( d > 0.01 )
{
P = ( W < E ) ? (W - E)/d : (E - W)/d;
F[i] += P;
}
F[0] += E / d;
}
/* { dg-final { scan-tree-dump-times " / " 1 "recip" } } */
/* { dg-final { cleanup-tree-dump "recip" } } */
|
