blob: 20d7681d28d57f2a8b18ba5e432714f7467df336 (
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
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
|
/* { dg-do compile } */
/* { dg-options "-O1 -fno-trapping-math -funsafe-math-optimizations -fdump-tree-recip" } */
/* based on the test case in pr23109 */
double F[2] = { 0., 0. }, e = 0.;
/* Nope, we cannot prove the optimization is worthwhile in this case. */
void f ()
{
int i;
double E, W, P, d;
W = 1.;
d = 2.*e;
E = 1. - d;
if( d > 0.01 )
{
P = ( W < E ) ? (W - E)/d : (E - W)/d;
F[i] += P;
}
}
/* We also cannot prove the optimization is worthwhile in this case. */
float g ()
{
int i;
double E, W, P, d;
W = 1.;
d = 2.*e;
E = 1. - d;
if( d > 0.01 )
{
P = ( W < E ) ? (W - E)/d : (E - W)/d;
F[i] += P;
}
return 1.0 / d;
}
/* { dg-final { scan-tree-dump-not "reciptmp" "recip" } } */
/* { dg-final { cleanup-tree-dump "recip" } } */
|
