Mercurial > hg > CbC > CbC_gcc
view libgomp/testsuite/libgomp.oacc-c-c++-common/par-loop-comb-reduction-1.c @ 122:fb3d53c41846
do not expand code segment
author | mir3636 |
---|---|
date | Thu, 22 Mar 2018 17:37:58 +0900 |
parents | 04ced10e8804 |
children | 1830386684a0 |
line wrap: on
line source
#include <assert.h> /* Test of reduction on both parallel and loop directives (worker and vector-partitioned loops individually in gang-partitioned mode, int type). */ int main (int argc, char *argv[]) { int i, j, arr[32768], 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 reduction(+:res) for (i = 0; i < 1024; i++) res += arr[j * 1024 + i]; #pragma acc loop vector reduction(+:res) for (i = 1023; i >= 0; i--) res += arr[j * 1024 + i]; } } for (j = 0; j < 32; j++) for (i = 0; i < 1024; i++) hres += arr[j * 1024 + i] * 2; assert (res == hres); return 0; }