blob: 19f9f20c3bc0be9f120a37b7236db56ce1905c4b (
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
|
/* { dg-require-effective-target size32plus } */
#define DEBUG 0
#if DEBUG
#include <stdio.h>
#endif
#define MAX 100
extern void abort ();
int
main (void)
{
int i, j;
int sum = 0;
int A[MAX * MAX];
int B[MAX * MAX];
/* These loops should be loop blocked. */
for (i = 0; i < MAX; i++)
for (j = 0; j < MAX; j++)
{
A[i*MAX + j] = j;
B[i*MAX + j] = j;
}
/* These loops should be loop blocked. */
for (i = 0; i < MAX; i++)
for (j = 0; j < MAX; j++)
A[i*MAX + j] += B[j*MAX + i];
/* These loops should be loop blocked. */
for(i = 0; i < MAX; i++)
for(j = 0; j < MAX; j++)
sum += A[i*MAX + j];
#if DEBUG
fprintf (stderr, "sum = %d \n", sum);
#endif
if (sum != 990000)
abort ();
return 0;
}
/* { dg-final { scan-tree-dump-times "tiled by" 5 "graphite" } } */
|
