blob: c0c6b1c6e5568ffdd90e4e04550ff88c1b180212 (
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
|
/* Autopar with IF conditions. */
void abort();
#define N 10000
#define T 1000
void foo(void)
{
int i;
int A[2*N], B[2*N];
/* Initialize array: carried no dependency. */
for (i = 0; i < 2*N; i++)
B[i] = A[i] = i;
for (i = 0; i < N; i++)
{
if (i < T)
/* loop i1: carried no dependency. */
A[i] = A[i+T];
else
/* loop i2: carried dependency. */
A[i] = A[i+T+1];
}
/* If it runs a wrong answer, abort. */
for (i = 0; i < N; i++)
{
if (i < T)
{
if (A[i] != B[i+T])
abort();
}
else
{
if (A[i] != B[i+T+1])
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" } } */
|
