blob: 7f043d83d8b11fce586eb6f65b2f6cda0438eceb (
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
|
void abort (void);
void parloop (int N)
{
int i;
int x[10000000];
for (i = 0; i < N; i++)
x[i] = i + 3;
for (i = 0; i < N; i++)
{
if (x[i] != i + 3)
abort ();
}
}
int main(void)
{
parloop(10000000);
return 0;
}
/* Check that parallel code generation part make the right answer. */
/* { dg-final { scan-tree-dump-times "1 loops carried no dependency" 2 "graphite" } } */
/* { dg-final { cleanup-tree-dump "graphite" } } */
/* { dg-final { scan-tree-dump-times "loopfn" 5 "optimized" } } */
/* { dg-final { cleanup-tree-dump "parloops" } } */
/* { dg-final { cleanup-tree-dump "optimized" } } */
|
