blob: b72b0215f3f8a52e8f7d50fbfcc03b26e20dc1ef (
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
|
/* Triangle loops. */
void abort (void);
#define N 500
void foo(void)
{
int i,j;
int A[3*N], B[3*N];
for (i = 0; i < 3*N; i++)
B[i] = A[i] = i;
for (i = 1; i < N; i++)
for (j = 1; j < i; j++)
/* This loop carried no dependency, it fails
at code generation part.*/
A[j+N] = A[j] + j;
for (i = 1; i < N; i++)
for (j = 1; j < i; j++)
if (A[j+N] != B[j] + j)
abort();
}
int main(void)
{
foo();
return 0;
}
/* Check that parallel code generation part make the right answer. */
/* { dg-final { scan-tree-dump-times "2 loops carried no dependency" 1 "graphite" } } */
/* { dg-final { cleanup-tree-dump "graphite" } } */
/* { dg-final { scan-tree-dump-times "loopfn.0" 5 "optimized" } } */
/* { dg-final { scan-tree-dump-times "loopfn.1" 5 "optimized" } } */
/* { dg-final { cleanup-tree-dump "parloops" } } */
/* { dg-final { cleanup-tree-dump "optimized" } } */
|
