blob: d154b743f891e5b38d6cc5b1b7343fdad3733e83 (
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-require-effective-target size32plus } */
#define DEBUG 0
#if DEBUG
#include <stdio.h>
#endif
#define NMAX 2000
static int x[NMAX], a[NMAX][NMAX];
static int __attribute__((noinline))
mvt (long N)
{
int i,j;
/* These two loops should be interchanged. */
for (i = 0; i < N; i++)
for (j = 0; j < N; j++)
x[i] += a[j][i];
return x[1];
}
extern void abort ();
int
main (void)
{
int i, j, res;
for (i = 0; i < NMAX; i++)
for (j = 0; j < NMAX; j++)
a[i][j] = j;
for (i = 0; i < NMAX; i++)
x[i] = i;
res = mvt (NMAX);
#if DEBUG
fprintf (stderr, "res = %d \n", res);
#endif
if (res != 2001)
abort ();
return 0;
}
/* PRE destroys the perfect nest and we can't cope with that yet. */
/* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" } } */
/* { dg-final { cleanup-tree-dump "graphite" } } */
|
