mirror of
https://review.haiku-os.org/buildtools
synced 2025-02-19 04:07:46 +01:00
git-svn-id: file:///srv/svn/repos/haiku/buildtools/trunk@37371 a95241bf-73f2-0310-859d-f6bbb57e9c96
106 lines
1.8 KiB
C
106 lines
1.8 KiB
C
/* PR middle-end/39154 */
|
|
/* { dg-do compile } */
|
|
/* { dg-options "-O2 -std=gnu99" } */
|
|
|
|
extern void abort (void);
|
|
|
|
int n = 20;
|
|
|
|
int
|
|
main (void)
|
|
{
|
|
int a[n], b[n][n];
|
|
|
|
#pragma omp parallel for
|
|
for (int i = 0; i < n; i++)
|
|
{
|
|
a[i] = i + 1;
|
|
#pragma omp parallel for
|
|
for (int j = 0; j < n; j++)
|
|
b[i][j] = a[i];
|
|
}
|
|
|
|
for (int i = 0; i < n; i++)
|
|
{
|
|
for (int j = 0; j < n; j++)
|
|
if (b[i][j] != i + 1)
|
|
abort ();
|
|
if (a[i] != i + 1)
|
|
abort ();
|
|
}
|
|
|
|
#pragma omp parallel for shared (n, a, b)
|
|
for (int i = 0; i < n; i++)
|
|
{
|
|
a[i] = i + 3;
|
|
#pragma omp parallel for
|
|
for (int j = 0; j < n; j++)
|
|
b[i][j] = a[i];
|
|
}
|
|
|
|
for (int i = 0; i < n; i++)
|
|
{
|
|
for (int j = 0; j < n; j++)
|
|
if (b[i][j] != i + 3)
|
|
abort ();
|
|
if (a[i] != i + 3)
|
|
abort ();
|
|
}
|
|
|
|
#pragma omp parallel for
|
|
for (int i = 0; i < n; i++)
|
|
{
|
|
a[i] = i + 5;
|
|
#pragma omp parallel for shared (n, a, b)
|
|
for (int j = 0; j < n; j++)
|
|
b[i][j] = a[i];
|
|
}
|
|
|
|
for (int i = 0; i < n; i++)
|
|
{
|
|
for (int j = 0; j < n; j++)
|
|
if (b[i][j] != i + 5)
|
|
abort ();
|
|
if (a[i] != i + 5)
|
|
abort ();
|
|
}
|
|
|
|
#pragma omp parallel for shared (n, a, b)
|
|
for (int i = 0; i < n; i++)
|
|
{
|
|
a[i] = i + 7;
|
|
#pragma omp parallel for shared (n, a, b)
|
|
for (int j = 0; j < n; j++)
|
|
b[i][j] = a[i];
|
|
}
|
|
|
|
for (int i = 0; i < n; i++)
|
|
{
|
|
for (int j = 0; j < n; j++)
|
|
if (b[i][j] != i + 7)
|
|
abort ();
|
|
if (a[i] != i + 7)
|
|
abort ();
|
|
}
|
|
|
|
#pragma omp parallel for private (a, b)
|
|
for (int i = 0; i < n; i++)
|
|
{
|
|
a[i] = i + 1;
|
|
#pragma omp parallel for
|
|
for (int j = 0; j < n; j++)
|
|
b[i][j] = a[i];
|
|
}
|
|
|
|
#pragma omp parallel for private (a, b)
|
|
for (int i = 0; i < n; i++)
|
|
{
|
|
a[i] = i + 1;
|
|
#pragma omp parallel for private (b)
|
|
for (int j = 0; j < n; j++)
|
|
b[i][j] = a[i];
|
|
}
|
|
|
|
return 0;
|
|
}
|