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
|
/* PR c/81887 */
/* { dg-do compile } */
/* { dg-options "-fno-openmp -fopenmp-simd -fdump-tree-gimple" } */
/* { dg-final { scan-tree-dump-times "#pragma omp simd" 2 "gimple" } } */
/* { dg-final { scan-tree-dump-times "#pragma omp ordered simd\[ \t]*\[\n\r]" 2 "gimple" } } */
/* { dg-final { scan-tree-dump-times "#pragma omp" 4 "gimple" } } */
void
f1 (int *x)
{
int i;
#pragma omp simd
for (i = 0; i < 100; i++)
#pragma omp ordered simd
x[i / 2] = i;
}
void
f2 (int *x)
{
int i;
#pragma omp parallel for simd ordered
for (i = 0; i < 100; i++)
#pragma omp ordered threads simd
x[i / 2] = i;
}
void
f3 (int *x)
{
int i;
#pragma omp parallel for ordered
for (i = 0; i < 100; i++)
#pragma omp ordered
x[i / 2] = i;
}
void
f4 (int *x)
{
int i;
#pragma omp parallel for ordered
for (i = 0; i < 100; i++)
#pragma omp ordered threads
x[i / 2] = i;
}
void
f5 (int n, int ***x)
{
int i, j, k;
#pragma omp parallel for ordered(3)
for (i=0; i < n; i++)
for (j=0; j < n; ++j)
for (k=0; k < n; ++k)
{
#pragma omp ordered depend(sink:i-8,j-2,k+2) depend(sink:i, j-1,k) depend(sink:i-4,j-3,k+6) depend(sink:i-6,j-4,k-6)
x[i][j][k] = i + j + k;
#pragma omp ordered depend(source)
}
}
|
