blob: 009a3057c1608a6e69dc0a2ea93658aafefb74fd (
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
|
/* { dg-do run } */
/* { dg-options "-O2 -floop-interchange -fdump-tree-linterchange-details" } */
/* { dg-require-stack-size "8*111*1111" } */
/* { dg-skip-if "too big stack" { avr-*-* visium-*-* } } */
/* Copied from graphite/interchange-7.c */
#define DEBUG 0
#if DEBUG
#include <stdio.h>
#endif
#define N 111
#define M 1111
static int __attribute__((noinline))
foo (double *a)
{
int i,j;
int r = 0;
for (i = 0; i < N; ++i)
for (j = 0; j < M; ++j)
r += a[j * N + i];
return r;
}
extern void abort ();
int
main (void)
{
double A[N*M];
int i, res;
for (i = 0; i < N*M; i++)
A[i] = 2;
res = foo (A);
#if DEBUG
fprintf (stderr, "res = %d \n", res);
#endif
if (res != 246642)
abort ();
return 0;
}
/* { dg-final { scan-tree-dump-times "Loop_pair<outer:., inner:.> is interchanged" 1 "linterchange" { xfail *-*-* } } } */
|
