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
|
/* PR tree-optimization/59643 */
#define N 32
__attribute__((noinline, noclone)) void
foo (double *a, double *b, double *c, double d, double e, int n)
{
int i;
for (i = 1; i < n - 1; i++)
a[i] = d * (b[i] + c[i] + a[i - 1] + a[i + 1]) + e * a[i];
}
double expected[] = {
0.0, 10.0, 44.0, 110.0, 232.0, 490.0, 1020.0, 2078.0, 4152.0, 8314.0,
16652.0, 33326.0, 66664.0, 133354.0, 266748.0, 533534.0, 1067064.0,
2134138.0, 4268300.0, 8536622.0, 17073256.0, 34146538.0, 68293116.0,
136586270.0, 273172536.0, 546345082.0, 1092690188.0, 2185380398.0,
4370760808.0, 8741521642.0, 17483043324.0, 6.0
};
int
main ()
{
int i;
double a[N], b[N], c[N];
if (__DBL_MANT_DIG__ <= 35)
return 0;
for (i = 0; i < N; i++)
{
a[i] = (i & 3) * 2.0;
b[i] = (i & 7) - 4;
c[i] = i & 7;
}
foo (a, b, c, 2.0, 3.0, N);
for (i = 0; i < N; i++)
if (a[i] != expected[i])
__builtin_abort ();
return 0;
}
|
