56ad0e3820
* gimplify.c (gimplify_omp_for): For #pragma omp for simd iterator not mentioned in clauses use private clause if the iterator is declared in #pragma omp for simd, and when adding lastprivate instead, add it to the outer #pragma omp for too. Diagnose if the variable is private in outer context. For simd collapse > 1 loops, replace all iterators with temporaries. * omp-low.c (lower_rec_input_clauses): Handle LINEAR clause the same even in collapse > 1 loops. gcc/c/ * c-parser.c (c_parser_omp_for_loop): For #pragma omp parallel for simd move lastprivate clause from parallel to for rather than simd. gcc/cp/ * parser.c (cp_parser_omp_for_loop): For #pragma omp parallel for simd move lastprivate clause from parallel to for rather than simd. libgomp/ * testsuite/libgomp.c/for-2.c: Define SC to static for #pragma omp for simd testing. * testsuite/libgomp.c/for-2.h (SC): Define if not defined. (N(f5), N(f6), N(f7), N(f8), N(f10), N(f12), N(f14)): Use SC macro. * testsuite/libgomp.c/simd-14.c: New test. * testsuite/libgomp.c/simd-15.c: New test. * testsuite/libgomp.c/simd-16.c: New test. * testsuite/libgomp.c/simd-17.c: New test. * testsuite/libgomp.c++/for-10.C: Define SC to static for #pragma omp for simd testing. * testsuite/libgomp.c++/simd10.C: New test. * testsuite/libgomp.c++/simd11.C: New test. * testsuite/libgomp.c++/simd12.C: New test. * testsuite/libgomp.c++/simd13.C: New test. From-SVN: r211930
130 lines
3.5 KiB
C
130 lines
3.5 KiB
C
/* { dg-do run } */
|
|
/* { dg-options "-O2" } */
|
|
/* { dg-additional-options "-msse2" { target sse2_runtime } } */
|
|
/* { dg-additional-options "-mavx" { target avx_runtime } } */
|
|
|
|
static inline void
|
|
foo (int *b, int *i, int *j, int x)
|
|
{
|
|
*b = *b + x + (*i - *i) + (*j - *j);
|
|
}
|
|
|
|
int
|
|
main ()
|
|
{
|
|
int i, j, b, c = 0;
|
|
i = 4; j = 4; b = 7;
|
|
#pragma omp simd linear(b:2) reduction(+:c)
|
|
for (i = 0; i < 64; i++)
|
|
{
|
|
c = c + (b != 7 + 2 * i);
|
|
foo (&b, &i, &j, 2);
|
|
}
|
|
if (c || i != 64 || b != 7 + 64 * 2)
|
|
__builtin_abort ();
|
|
i = 4; j = 4; b = 7;
|
|
#pragma omp simd linear(b:3) reduction(+:c)
|
|
for (i = 0; i < 64; i += 4)
|
|
{
|
|
c = c + (b != 7 + i / 4 * 3);
|
|
foo (&b, &i, &j, 3);
|
|
}
|
|
if (c || i != 64 || b != 7 + 16 * 3)
|
|
__builtin_abort ();
|
|
i = 4; j = 4; b = 7;
|
|
#pragma omp simd linear(i) linear(b:2) reduction(+:c)
|
|
for (i = 0; i < 64; i++)
|
|
{
|
|
c = c + (b != 7 + 2 * i);
|
|
foo (&b, &i, &j, 2);
|
|
}
|
|
if (c || i != 64 || b != 7 + 64 * 2)
|
|
__builtin_abort ();
|
|
i = 4; j = 4; b = 7;
|
|
#pragma omp simd linear(i:4) linear(b:3) reduction(+:c)
|
|
for (i = 0; i < 64; i += 4)
|
|
{
|
|
c = c + (b != 7 + i / 4 * 3);
|
|
foo (&b, &i, &j, 3);
|
|
}
|
|
if (c || i != 64 || b != 7 + 16 * 3)
|
|
__builtin_abort ();
|
|
i = 4; j = 4; b = 7;
|
|
#pragma omp simd collapse (2) linear(b:2) reduction(+:c)
|
|
for (i = 0; i < 8; i++)
|
|
for (j = 0; j < 8; j++)
|
|
{
|
|
c = c + (b != 7 + 2 * j + 2 * 8 * i);
|
|
foo (&b, &i, &j, 2);
|
|
}
|
|
if (c || i != 8 || j != 8 || b != 7 + 64 * 2)
|
|
__builtin_abort ();
|
|
i = 4; j = 4; b = 7;
|
|
#pragma omp simd collapse (2) lastprivate (i, j) linear(b:2) reduction(+:c)
|
|
for (i = 0; i < 8; i++)
|
|
for (j = 0; j < 8; j++)
|
|
{
|
|
c = c + (b != 7 + 2 * j + 2 * 8 * i);
|
|
foo (&b, &i, &j, 2);
|
|
}
|
|
if (c || i != 8 || j != 8 || b != 7 + 64 * 2)
|
|
__builtin_abort ();
|
|
i = 4; j = 4; b = 7;
|
|
#pragma omp parallel for simd schedule (static, 4) linear(b:2) reduction(+:c)
|
|
for (i = 0; i < 64; i++)
|
|
{
|
|
c = c + (b != 7 + 2 * i);
|
|
foo (&b, &i, &j, 2);
|
|
}
|
|
if (c || i != 64 || b != 7 + 64 * 2)
|
|
__builtin_abort ();
|
|
i = 4; j = 4; b = 7;
|
|
#pragma omp parallel for simd schedule (static, 4) linear(b:3) reduction(+:c)
|
|
for (i = 0; i < 64; i += 4)
|
|
{
|
|
c = c + (b != 7 + i / 4 * 3);
|
|
foo (&b, &i, &j, 3);
|
|
}
|
|
if (c || i != 64 || b != 7 + 16 * 3)
|
|
__builtin_abort ();
|
|
i = 4; j = 4; b = 7;
|
|
#pragma omp parallel for simd schedule (static, 4) linear(i) linear(b:2) reduction(+:c)
|
|
for (i = 0; i < 64; i++)
|
|
{
|
|
c = c + (b != 7 + 2 * i);
|
|
foo (&b, &i, &j, 2);
|
|
}
|
|
if (c || i != 64 || b != 7 + 64 * 2)
|
|
__builtin_abort ();
|
|
i = 4; j = 4; b = 7;
|
|
#pragma omp parallel for simd schedule (static, 4) linear(i:4) linear(b:3) reduction(+:c)
|
|
for (i = 0; i < 64; i += 4)
|
|
{
|
|
c = c + (b != 7 + i / 4 * 3);
|
|
foo (&b, &i, &j, 3);
|
|
}
|
|
if (c || i != 64 || b != 7 + 16 * 3)
|
|
__builtin_abort ();
|
|
i = 4; j = 4; b = 7;
|
|
#pragma omp parallel for simd lastprivate (i, j) collapse (2) schedule (static, 4) linear(b:2) reduction(+:c)
|
|
for (i = 0; i < 8; i++)
|
|
for (j = 0; j < 8; j++)
|
|
{
|
|
c = c + (b != 7 + 2 * j + 2 * 8 * i);
|
|
foo (&b, &i, &j, 2);
|
|
}
|
|
if (c || i != 8 || j != 8 || b != 7 + 64 * 2)
|
|
__builtin_abort ();
|
|
i = 4; j = 4; b = 7;
|
|
#pragma omp parallel for simd collapse (2) schedule (static, 4) linear(b:2) reduction(+:c)
|
|
for (i = 0; i < 8; i++)
|
|
for (j = 0; j < 8; j++)
|
|
{
|
|
c = c + (b != 7 + 2 * j + 2 * 8 * i);
|
|
foo (&b, &i, &j, 2);
|
|
}
|
|
if (c || i != 8 || j != 8 || b != 7 + 64 * 2)
|
|
__builtin_abort ();
|
|
return 0;
|
|
}
|