/* PR c++/26943 */
|
/* PR c++/26943 */
|
/* { dg-do run } */
|
/* { dg-do run } */
|
|
|
extern int omp_set_dynamic (int);
|
extern int omp_set_dynamic (int);
|
extern int omp_get_thread_num (void);
|
extern int omp_get_thread_num (void);
|
extern void abort (void);
|
extern void abort (void);
|
|
|
int a = 8, b = 12, c = 16, d = 20, j = 0, l = 0;
|
int a = 8, b = 12, c = 16, d = 20, j = 0, l = 0;
|
char e[10] = "a", f[10] = "b", g[10] = "c", h[10] = "d";
|
char e[10] = "a", f[10] = "b", g[10] = "c", h[10] = "d";
|
volatile int k;
|
volatile int k;
|
|
|
int
|
int
|
main (void)
|
main (void)
|
{
|
{
|
int i;
|
int i;
|
omp_set_dynamic (0);
|
omp_set_dynamic (0);
|
omp_set_nested (1);
|
omp_set_nested (1);
|
#pragma omp parallel num_threads (2) reduction (+:l) \
|
#pragma omp parallel num_threads (2) reduction (+:l) \
|
firstprivate (a, b, c, d, e, f, g, h, j)
|
firstprivate (a, b, c, d, e, f, g, h, j)
|
if (k == omp_get_thread_num ())
|
if (k == omp_get_thread_num ())
|
{
|
{
|
#pragma omp parallel for shared (a, e) firstprivate (b, f) \
|
#pragma omp parallel for shared (a, e) firstprivate (b, f) \
|
lastprivate (c, g) private (d, h) \
|
lastprivate (c, g) private (d, h) \
|
schedule (static, 1) num_threads (4) \
|
schedule (static, 1) num_threads (4) \
|
reduction (+:j)
|
reduction (+:j)
|
for (i = 0; i < 4; i++)
|
for (i = 0; i < 4; i++)
|
{
|
{
|
if (a != 8 || b != 12 || e[0] != 'a' || f[0] != 'b')
|
if (a != 8 || b != 12 || e[0] != 'a' || f[0] != 'b')
|
j++;
|
j++;
|
#pragma omp barrier /* { dg-warning "may not be closely nested" } */
|
#pragma omp barrier /* { dg-warning "may not be closely nested" } */
|
#pragma omp atomic
|
#pragma omp atomic
|
a += i;
|
a += i;
|
b += i;
|
b += i;
|
c = i;
|
c = i;
|
d = i;
|
d = i;
|
#pragma omp atomic
|
#pragma omp atomic
|
e[0] += i;
|
e[0] += i;
|
f[0] += i;
|
f[0] += i;
|
g[0] = 'g' + i;
|
g[0] = 'g' + i;
|
h[0] = 'h' + i;
|
h[0] = 'h' + i;
|
#pragma omp barrier /* { dg-warning "may not be closely nested" } */
|
#pragma omp barrier /* { dg-warning "may not be closely nested" } */
|
if (a != 8 + 6 || b != 12 + i || c != i || d != i)
|
if (a != 8 + 6 || b != 12 + i || c != i || d != i)
|
j += 8;
|
j += 8;
|
if (e[0] != 'a' + 6 || f[0] != 'b' + i || g[0] != 'g' + i)
|
if (e[0] != 'a' + 6 || f[0] != 'b' + i || g[0] != 'g' + i)
|
j += 64;
|
j += 64;
|
if (h[0] != 'h' + i)
|
if (h[0] != 'h' + i)
|
j += 512;
|
j += 512;
|
}
|
}
|
if (j || a != 8 + 6 || b != 12 || c != 3 || d != 20)
|
if (j || a != 8 + 6 || b != 12 || c != 3 || d != 20)
|
++l;
|
++l;
|
if (e[0] != 'a' + 6 || f[0] != 'b' || g[0] != 'g' + 3 || h[0] != 'd')
|
if (e[0] != 'a' + 6 || f[0] != 'b' || g[0] != 'g' + 3 || h[0] != 'd')
|
l += 8;
|
l += 8;
|
}
|
}
|
if (l)
|
if (l)
|
abort ();
|
abort ();
|
if (a != 8 || b != 12 || c != 16 || d != 20)
|
if (a != 8 || b != 12 || c != 16 || d != 20)
|
abort ();
|
abort ();
|
if (e[0] != 'a' || f[0] != 'b' || g[0] != 'c' || h[0] != 'd')
|
if (e[0] != 'a' || f[0] != 'b' || g[0] != 'c' || h[0] != 'd')
|
abort ();
|
abort ();
|
return 0;
|
return 0;
|
}
|
}
|
|
|
