blob: a3063bbef45824bbfb95a5711cf6ed5bf8fc2d9e (
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
46
47
48
49
50
51
52
53
54
|
/* { dg-do run } */
/* { dg-options "-O2 -floop-interchange -fdump-tree-linterchange-details" } */
/* { dg-require-effective-target size32plus } */
/* { dg-skip-if "too big data segment" { visium-*-* } } */
/* Copied from graphite/interchange-4.c */
#define DEBUG 0
#if DEBUG
#include <stdio.h>
#endif
double u[1782225];
static void __attribute__((noinline))
foo (int N, double *res)
{
int i, j;
double sum = 0;
for (i = 0; i < N; i++)
for (j = 0; j < N; j++)
sum = sum + u[i + 1335 * j];
*res = sum;
}
extern void abort ();
int
main (void)
{
int i, j;
double res;
for (i = 0; i < 1782225; i++)
u[i] = 0;
u[0] = __DBL_MAX__;
u[1335] = -__DBL_MAX__;
u[1] = __DBL_MAX__;
u[1336] = -__DBL_MAX__;
foo (1335, &res);
#if DEBUG
fprintf (stderr, "res = %d \n", res);
#endif
if (res != 0.0)
abort ();
return 0;
}
/* { dg-final { scan-tree-dump-not "is interchanged" "linterchange"} } */
|
