blob: ee262e9f7651f508a2bf5f70627a1e0b3f912c7a (
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
55
56
57
58
59
60
61
62
63
|
/* { dg-require-effective-target size32plus } */
#define DEBUG 0
#if DEBUG
#include <stdio.h>
#endif
#define NMAX 2000
static int x1[NMAX], x2[NMAX], a[NMAX][NMAX], y1[NMAX], y2[NMAX];
static int __attribute__((noinline))
mvt (long N)
{
int i,j;
for (i = 0; i < N; i++)
for (j = 0; j < N; j++)
x1[i] = x1[i] + a[i][j] * y1[j];
/* These two loops should be interchanged. */
for (i = 0; i < N; i++)
for (j = 0; j < N; j++)
x2[i] = x2[i] + a[j][i] * y2[j];
return x1[0] + x2[0];
}
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] = i + j;
for (i = 0; i < NMAX; i++)
{
x1[i] = 0;
x2[i] = 2*i;
y1[i] = 100 - i;
y2[i] = i;
}
res = mvt (NMAX);
#if DEBUG
fprintf (stderr, "res = %d \n", res);
#endif
if (res != 199900000)
abort ();
return 0;
}
/* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" } } */
/* { dg-final { cleanup-tree-dump "graphite" } } */
|
