blob: 3334bd571f674dabe7e14a601654f2d8098db3c1 (
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
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
105
106
107
108
109
110
111
112
113
|
/* PR middle-end/93566 */
/* { dg-additional-options "-std=c99" } */
extern void abort (void);
void
foo (int *x)
{
void nest (void) {
#pragma omp parallel for reduction(+:x[:10])
for (int i = 0; i < 1024; i++)
for (int j = 0; j < 10; j++)
x[j] += j * i;
}
nest ();
for (int i = 0; i < 10; i++)
if (x[i] != 1023 * 1024 / 2 * i)
abort ();
}
void
bar (void)
{
int x[10] = {};
void nest (void) {
#pragma omp parallel for reduction(+:x[:10])
for (int i = 0; i < 1024; i++)
for (int j = 0; j < 10; j++)
x[j] += j * i;
}
nest ();
for (int i = 0; i < 10; i++)
if (x[i] != 1023 * 1024 / 2 * i)
abort ();
}
void
baz (void)
{
int x[10] = {};
void nest (void) {
#pragma omp parallel for reduction(+:x[2:5])
for (int i = 0; i < 1024; i++)
for (int j = 2; j < 7; j++)
x[j] += j * i;
}
nest ();
for (int i = 2; i < 7; i++)
if (x[i] != 1023 * 1024 / 2 * i)
abort ();
}
void
qux (int *x)
{
void nest (void) { x++; }
nest ();
#pragma omp parallel for reduction(+:x[:9])
for (int i = 0; i < 1024; i++)
for (int j = 0; j < 9; j++)
x[j] += j * i;
nest ();
for (int i = 0; i < 9; i++)
if (x[i - 1] != 1023 * 1024 / 2 * i)
abort ();
}
void
quux (void)
{
int x[10];
void nest (void) { for (int i = 0; i < 10; i++) x[i] = 0; }
int nest2 (int i) { return x[i]; }
nest ();
#pragma omp parallel for reduction(+:x[:7])
for (int i = 0; i < 1024; i++)
for (int j = 0; j < 7; j++)
x[j] += j * i;
for (int i = 0; i < 7; i++)
if (nest2 (i) != 1023 * 1024 / 2 * i)
abort ();
}
void
corge (void)
{
int x[10];
void nest (void) { for (int i = 0; i < 10; i++) x[i] = 0; }
int nest2 (int i) { return x[i]; }
nest ();
#pragma omp parallel for reduction(+:x[2:4])
for (int i = 0; i < 1024; i++)
for (int j = 2; j < 6; j++)
x[j] += j * i;
for (int i = 2; i < 6; i++)
if (nest2 (i) != 1023 * 1024 / 2 * i)
abort ();
}
int
main ()
{
int a[10] = {};
foo (a);
bar ();
baz ();
for (int i = 0; i < 10; i++)
a[i] = 0;
qux (a);
quux ();
corge ();
return 0;
}
|
