File: split-path-10.c

package info (click to toggle)
gcc-arm-none-eabi 15%3A7-2018-q2-5
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 539,188 kB
  • sloc: ansic: 2,739,935; cpp: 848,238; ada: 602,637; makefile: 62,919; asm: 55,635; xml: 46,238; exp: 23,020; sh: 19,616; python: 6,371; pascal: 3,889; awk: 3,278; perl: 2,691; yacc: 316; ml: 285; f90: 234; lex: 198; objc: 194; haskell: 119
file content (49 lines) | stat: -rw-r--r-- 920 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
45
46
47
48
49
 
/* PR tree-optimization/79389  */
/* { dg-do compile } */
/* { dg-options "-O3 -fdump-tree-split-paths-details" } */

typedef struct
{
  int m[17];                        
  int seed;                             
  int i;
  int j;
  int haveRange;
  double left;
  double right;
  double width;
}
Random_struct, *Random;

Random new_Random_seed(int seed);
double Random_nextDouble(Random R);
void Random_delete(Random R);

static const int SEED = 113;

double MonteCarlo_integrate(int Num_samples)
{


  Random R = new_Random_seed(SEED);


  int under_curve = 0;
  int count;

  for (count=0; count<Num_samples; count++)
    {
      double x= Random_nextDouble(R);
      double y= Random_nextDouble(R);

      if ( x*x + y*y <= 1.0)
	under_curve ++;

    }

  Random_delete(R);

  return ((double) under_curve / Num_samples) * 4.0;
}

/* { dg-final { scan-tree-dump-times "Duplicating join block" 0 "split-paths" } } */