mirror of
https://github.com/autc04/Retro68.git
synced 2024-12-02 03:50:17 +00:00
151 lines
2.3 KiB
C
151 lines
2.3 KiB
C
// { dg-require-effective-target size32plus }
|
|
|
|
extern "C" void abort ();
|
|
|
|
struct S {
|
|
inline S ();
|
|
inline ~S ();
|
|
inline S (const S &);
|
|
inline S & operator= (const S &);
|
|
int s;
|
|
};
|
|
|
|
S::S () : s (0)
|
|
{
|
|
}
|
|
|
|
S::~S ()
|
|
{
|
|
}
|
|
|
|
S::S (const S &x)
|
|
{
|
|
s = x.s;
|
|
}
|
|
|
|
S &
|
|
S::operator= (const S &x)
|
|
{
|
|
s = x.s;
|
|
return *this;
|
|
}
|
|
|
|
static inline void
|
|
ini (S &x)
|
|
{
|
|
x.s = 0;
|
|
}
|
|
|
|
S r, a[1024], b[1024];
|
|
|
|
#pragma omp declare reduction (+: S: omp_out.s += omp_in.s)
|
|
#pragma omp declare reduction (plus: S: omp_out.s += omp_in.s) initializer (ini (omp_priv))
|
|
|
|
__attribute__((noipa)) void
|
|
foo (S *a, S *b, S &r)
|
|
{
|
|
#pragma omp for reduction (inscan, +:r)
|
|
for (int i = 0; i < 1024; i++)
|
|
{
|
|
b[i] = r;
|
|
#pragma omp scan exclusive(r)
|
|
r.s += a[i].s;
|
|
}
|
|
}
|
|
|
|
__attribute__((noipa)) S
|
|
bar (void)
|
|
{
|
|
S s;
|
|
#pragma omp parallel
|
|
#pragma omp for reduction (inscan, plus:s)
|
|
for (int i = 0; i < 1024; i++)
|
|
{
|
|
b[i] = s;
|
|
#pragma omp scan exclusive(s)
|
|
s.s += 2 * a[i].s;
|
|
}
|
|
return s;
|
|
}
|
|
|
|
__attribute__((noipa)) void
|
|
baz (S *a, S *b, S &r)
|
|
{
|
|
#pragma omp parallel for reduction (inscan, +:r)
|
|
for (int i = 0; i < 1024; i++)
|
|
{
|
|
b[i] = r;
|
|
#pragma omp scan exclusive(r)
|
|
r.s += a[i].s;
|
|
}
|
|
}
|
|
|
|
__attribute__((noipa)) S
|
|
qux (void)
|
|
{
|
|
S s;
|
|
#pragma omp parallel for reduction (inscan, plus:s)
|
|
for (int i = 0; i < 1024; i++)
|
|
{
|
|
b[i] = s;
|
|
#pragma omp scan exclusive(s)
|
|
s.s += 2 * a[i].s;
|
|
}
|
|
return s;
|
|
}
|
|
|
|
int
|
|
main ()
|
|
{
|
|
S s;
|
|
for (int i = 0; i < 1024; ++i)
|
|
{
|
|
a[i].s = i;
|
|
b[i].s = -1;
|
|
asm ("" : "+g" (i));
|
|
}
|
|
#pragma omp parallel
|
|
foo (a, b, r);
|
|
if (r.s != 1024 * 1023 / 2)
|
|
abort ();
|
|
for (int i = 0; i < 1024; ++i)
|
|
{
|
|
if (b[i].s != s.s)
|
|
abort ();
|
|
else
|
|
b[i].s = 25;
|
|
s.s += i;
|
|
}
|
|
if (bar ().s != 1024 * 1023)
|
|
abort ();
|
|
s.s = 0;
|
|
for (int i = 0; i < 1024; ++i)
|
|
{
|
|
if (b[i].s != s.s)
|
|
abort ();
|
|
s.s += 2 * i;
|
|
}
|
|
r.s = 0;
|
|
baz (a, b, r);
|
|
if (r.s != 1024 * 1023 / 2)
|
|
abort ();
|
|
s.s = 0;
|
|
for (int i = 0; i < 1024; ++i)
|
|
{
|
|
if (b[i].s != s.s)
|
|
abort ();
|
|
else
|
|
b[i].s = 25;
|
|
s.s += i;
|
|
}
|
|
if (qux ().s != 1024 * 1023)
|
|
abort ();
|
|
s.s = 0;
|
|
for (int i = 0; i < 1024; ++i)
|
|
{
|
|
if (b[i].s != s.s)
|
|
abort ();
|
|
s.s += 2 * i;
|
|
}
|
|
}
|