File: recip-4.c

package info (click to toggle)
gcc-arm-none-eabi 15%3A14.2.rel1-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 1,099,328 kB
  • sloc: cpp: 3,627,108; ansic: 2,571,498; ada: 834,230; f90: 235,082; makefile: 79,231; asm: 74,984; xml: 51,692; exp: 39,736; sh: 33,298; objc: 15,629; python: 15,069; fortran: 14,429; pascal: 7,003; awk: 5,070; perl: 3,106; ml: 285; lisp: 253; lex: 204; haskell: 135
file content (44 lines) | stat: -rw-r--r-- 728 bytes parent folder | download | duplicates (6) 
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
 
/* { 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" } } */