blob: bf9c60f415c22d60f63bb3bbfa5a83168e6ded1c (
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
|
/* { dg-require-effective-target size32plus } */
/* { dg-require-effective-target run_expensive_tests } PR testsuite/48283 */
#define DEBUG 0
#if DEBUG
#include <stdio.h>
#endif
#define N 200
int A[N][N], B[N][N], C[N][N];
static void __attribute__((noinline))
matmult (void)
{
int i, j, k;
/* This should be blocked. */
for (i = 0; i < N; i++)
for (j = 0; j < N; j++)
{
A[i][j] = 0;
for (k = 0; k < N; k++)
A[i][j] += B[i][k] * C[k][j];
}
}
extern void abort ();
int
main (void)
{
int i, j, res = 0;
for (i = 0; i < N; i++)
for (j = 0; j < N; j++)
{
B[i][j] = j;
C[i][j] = i;
}
matmult ();
for (i = 0; i < N; i++)
res += A[i][i];
#if DEBUG
fprintf (stderr, "res = %d \n", res);
#endif
if (res != 529340000)
abort ();
return 0;
}
/* { dg-final { scan-tree-dump-times "will be loop blocked" 1 "graphite" } } */
/* { dg-final { cleanup-tree-dump "graphite" } } */
|
