blob: 322ed8d7f89ec64fefdc798f6292c82321ce3ad5 (
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
|
/* { dg-require-effective-target size32plus } */
/* { dg-timeout-factor 4.0 } */
#define DEBUG 0
#if DEBUG
#include <stdio.h>
#endif
#define N 24
#define M 100
int A[M][M][M], B[M][M], C[M][M];
static int __attribute__((noinline))
foo (void)
{
int i, j, k;
/* These loops contain too few iterations to be blocked by 64. */
for (i = 0; i < 24; i++)
for (j = 0; j < 24; j++)
for (k = 0; k < 24; k++)
A[i][j][k] = B[i][k] * C[k][j];
/* These loops should still be loop blocked. */
for (i = 0; i < M; i++)
for (j = 0; j < M; j++)
for (k = 0; k < M; k++)
A[i][j][k] = B[i][k] * C[k][j];
return A[0][0][0] + A[M-1][M-1][M-1];
}
extern void abort ();
int
main (void)
{
int i, j, res;
for (i = 0; i < M; i++)
for (j = 0; j < M; j++)
{
B[i][j] = i;
C[i][j] = j;
}
res = foo ();
#if DEBUG
fprintf (stderr, "res = %d \n", res);
#endif
if (res != 9801)
abort ();
return 0;
}
/* { dg-final { scan-tree-dump-times "will be loop blocked" 1 "graphite" } } */
/* { dg-final { cleanup-tree-dump "graphite" } } */
|
