f7468577f8
* tree.h (OMP_CLAUSE_LINEAR_GIMPLE_SEQ): Define. * gimplify.c (omp_is_private): Change last argument's type to int. Only diagnose lastprivate if the simd argument is 1, only diagnose linear if the simd argument is 2. (gimplify_omp_for): Adjust omp_is_private callers. When adding lastprivate or private, add the clause to OMP_FOR_CLAUSES. Pass GOVD_EXPLICIT to omp_add_variable. For simd with collapse == 1 create OMP_CLAUSE_LINEAR rather than OMP_CLAUSE_PRIVATE for var. If var != decl and decl is in OMP_CLAUSE_LINEAR, gimplify decl increment to OMP_CLAUSE_LINEAR_GIMPLE_SEQ. * omp-low.c (scan_sharing_clauses, lower_lastprivate_clauses): Handle OMP_CLAUSE_LINEAR_GIMPLE_SEQ. * tree-nested.c (convert_nonlocal_omp_clauses, convert_local_omp_clauses): Handle OMP_CLAUSE_LINEAR. * testsuite/libgomp.c/simd-7.c: New test. * testsuite/libgomp.c/simd-8.c: New test. * testsuite/libgomp.c/simd-9.c: New test. * testsuite/libgomp.c/loop-16.c: New test. From-SVN: r209760
97 lines
1.9 KiB
C
97 lines
1.9 KiB
C
/* { dg-do run } */
|
|
/* { dg-options "-O2" } */
|
|
/* { dg-additional-options "-msse2" { target sse2_runtime } } */
|
|
/* { dg-additional-options "-mavx" { target avx_runtime } } */
|
|
|
|
extern void abort ();
|
|
int a[1024] __attribute__((aligned (32))) = { 1 };
|
|
int b[1024] __attribute__((aligned (32))) = { 1 };
|
|
int k, m;
|
|
struct U { int u; };
|
|
struct V { int v; };
|
|
|
|
__attribute__((noinline, noclone)) int
|
|
foo (int *p)
|
|
{
|
|
int i, s = 0;
|
|
struct U u;
|
|
struct V v;
|
|
#pragma omp simd aligned(a, p : 32) linear(k: m + 1) \
|
|
linear(i) reduction(+:s) lastprivate(u, v)
|
|
for (i = 0; i < 1024; i++)
|
|
{
|
|
int *q = &i;
|
|
a[i] *= p[i];
|
|
u.u = p[i] + k;
|
|
k += m + 1;
|
|
v.v = p[i] + k;
|
|
s += p[i] + k;
|
|
}
|
|
if (u.u != 36 + 4 + 3 * 1023 || v.v != 36 + 4 + 3 * 1024 || i != 1024)
|
|
abort ();
|
|
return s;
|
|
}
|
|
|
|
__attribute__((noinline, noclone)) int
|
|
bar (int *p)
|
|
{
|
|
int i, s = 0;
|
|
struct U u;
|
|
struct V v;
|
|
#pragma omp simd aligned(a, p : 32) linear(k: m + 1) \
|
|
reduction(+:s) lastprivate(u, v)
|
|
for (i = 0; i < 1024; i++)
|
|
{
|
|
int *q = &i;
|
|
a[i] *= p[i];
|
|
u.u = p[i] + k;
|
|
k += m + 1;
|
|
v.v = p[i] + k;
|
|
s += p[i] + k;
|
|
}
|
|
if (u.u != 36 + 4 + 3 * 1023 || v.v != 36 + 4 + 3 * 1024 || i != 1024)
|
|
abort ();
|
|
return s;
|
|
}
|
|
|
|
int
|
|
main ()
|
|
{
|
|
#if __SIZEOF_INT__ >= 4
|
|
int i;
|
|
k = 4;
|
|
m = 2;
|
|
for (i = 0; i < 1024; i++)
|
|
{
|
|
a[i] = i - 512;
|
|
b[i] = (i - 51) % 39;
|
|
}
|
|
int s = foo (b);
|
|
for (i = 0; i < 1024; i++)
|
|
{
|
|
if (b[i] != (i - 51) % 39
|
|
|| a[i] != (i - 512) * b[i])
|
|
abort ();
|
|
}
|
|
if (k != 4 + 3 * 1024 || s != 1596127)
|
|
abort ();
|
|
k = 4;
|
|
m = 2;
|
|
for (i = 0; i < 1024; i++)
|
|
{
|
|
a[i] = i - 512;
|
|
b[i] = (i - 51) % 39;
|
|
}
|
|
s = bar (b);
|
|
for (i = 0; i < 1024; i++)
|
|
{
|
|
if (b[i] != (i - 51) % 39
|
|
|| a[i] != (i - 512) * b[i])
|
|
abort ();
|
|
}
|
|
if (k != 4 + 3 * 1024 || s != 1596127)
|
|
abort ();
|
|
#endif
|
|
return 0;
|
|
}
|