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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
|
extern "C" void abort ();
int w;
struct S {
int s, &t;
int *p;
S (int *x) : s (0), t (w), p(x) {};
void foo (short &);
void bar (short &);
void baz (short &);
void qux (short &);
};
void
S::foo (short &x)
{
#pragma omp simd lastprivate (conditional: x, s, t)
for (int i = 0; i < 1025; ++i)
{
if (p[i])
x = i;
if (p[i + 1025])
s = i + 3;
if (p[i + 2 * 1025])
t = i + 6;
}
}
void
S::bar (short &x)
{
#pragma omp simd lastprivate (conditional: x, s, t) collapse (3) if (0)
for (int i = 0; i < 15; ++i)
for (int j = -4; j < 9; j++)
for (int k = 12; k > 7; --k)
{
int l = (k - 8) + (j + 4) * 5 + i * 13 * 5;
if (p[l])
x = l;
if (p[l + 1025])
s = l + 3;
if (p[l + 1025 * 2])
t = l + 6;
}
}
void
S::baz (short &x)
{
#pragma omp parallel for simd lastprivate (conditional: x, s, t) if (simd: 0)
for (int i = 0; i < 1025; ++i)
{
if (p[i])
x = i;
if (p[i + 1025])
s = i + 3;
if (p[i + 2 * 1025])
t = i + 6;
}
}
void
S::qux (short &x)
{
#pragma omp for simd lastprivate (conditional: x, s, t) collapse (3) schedule (simd: guided, 8)
for (int i = 0; i < 15; ++i)
for (int j = -4; j < 9; j++)
for (int k = 12; k > 7; --k)
{
int l = (k - 8) + (j + 4) * 5 + i * 13 * 5;
if (p[l])
x = l;
if (p[l + 1025])
s = l + 3;
if (p[l + 1025 * 2])
t = l + 6;
}
}
int
main ()
{
short x;
int a[3 * 1025];
for (int i = 0; i < 1025; ++i)
{
a[i] = ((i % 17) == 7);
a[1025 + i] = ((i % 19) == 2);
a[2 * 1025 + i] = ((i % 23) == 5);
}
S s = a;
s.foo (x);
if (x != 1010 || s.s != 1012 || s.t != 1023)
abort ();
s.bar (x);
if (x != 959 || s.s != 974 || s.t != 977)
abort ();
#pragma omp parallel
s.baz (x);
if (x != 1010 || s.s != 1012 || s.t != 1023)
abort ();
s.qux (x);
if (x != 959 || s.s != 974 || s.t != 977)
abort ();
}
|
