mirror of
https://github.com/autc04/Retro68.git
synced 2024-12-11 19:49:32 +00:00
43 lines
891 B
C
43 lines
891 B
C
|
#include <assert.h>
|
||
|
|
||
|
/* Test of reduction on both parallel and loop directives (workers and vectors
|
||
|
together in gang-partitioned mode, float type). */
|
||
|
|
||
|
int
|
||
|
main (int argc, char *argv[])
|
||
|
{
|
||
|
int i, j;
|
||
|
float arr[32768];
|
||
|
float res = 0, hres = 0;
|
||
|
|
||
|
for (i = 0; i < 32768; i++)
|
||
|
arr[i] = i;
|
||
|
|
||
|
#pragma acc parallel num_gangs(32) num_workers(32) vector_length(32) \
|
||
|
reduction(+:res) copy(res)
|
||
|
{
|
||
|
#pragma acc loop gang
|
||
|
for (j = 0; j < 32; j++)
|
||
|
{
|
||
|
#pragma acc loop worker vector reduction(+:res)
|
||
|
for (i = 0; i < 1024; i++)
|
||
|
res += arr[j * 1024 + i];
|
||
|
|
||
|
#pragma acc loop worker vector reduction(+:res)
|
||
|
for (i = 0; i < 1024; i++)
|
||
|
res += arr[j * 1024 + (1023 - i)];
|
||
|
}
|
||
|
}
|
||
|
|
||
|
for (j = 0; j < 32; j++)
|
||
|
for (i = 0; i < 1024; i++)
|
||
|
{
|
||
|
hres += arr[j * 1024 + i];
|
||
|
hres += arr[j * 1024 + (1023 - i)];
|
||
|
}
|
||
|
|
||
|
assert (res == hres);
|
||
|
|
||
|
return 0;
|
||
|
}
|