blob: 8a2692ecc047f237d24e294e27f39c8a45dd8c73 (
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
64
65
66
67
68
69
70
71
72
|
/* { dg-do run } */
/* { dg-options "-O2 -floop-interchange -fdump-tree-linterchange-details" } */
/* { dg-require-effective-target size20plus } */
/* { dg-skip-if "too big data segment" { visium-*-* } } */
#define M 256
int a[M][M], b[M][M], c[M][M], d[M][M];
void __attribute__((noinline))
matrix_mul_1 (int n)
{
for (int j = 0; j < n; j++)
for (int k = 0; k < n; k++)
for (int i = 0; i < n; i++)
c[i][j] = c[i][j] + a[i][k]*b[k][j];
}
void __attribute__((noinline))
matrix_mul_2 (int n)
{
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
for (int k = 0; k < n; k++)
d[i][j] = d[i][j] + a[i][k]*b[k][j];
asm volatile ("" ::: "memory");
}
asm volatile ("" ::: "memory");
}
}
extern void abort ();
static void __attribute__((noinline))
init (int i)
{
for (int j = 0; j < M; j++)
{
a[i][j] = i;
b[i][j] = j;
c[i][j] = 0;
d[i][j] = 0;
}
}
static int __attribute__((noinline))
check (int i)
{
for (int j = 0; j < M; j++)
if (c[i][j] != d[i][j])
return 0;
return 1;
}
int main (void)
{
for (int i = 0; i < M; ++i)
init (i);
matrix_mul_1 (M);
matrix_mul_2 (M);
for (int i = 0; i < M; ++i)
if (!check (i))
abort ();
return 0;
}
/* { dg-final { scan-tree-dump-times "Loop_pair<outer:., inner:.> is interchanged" 2 "linterchange" } } */
|
