Mercurial > hg > CbC > CbC_gcc
view libgomp/testsuite/libgomp.oacc-c-c++-common/par-loop-comb-reduction-3.c @ 144:8f4e72ab4e11
fix segmentation fault caused by nothing next cur_op to end
author | Takahiro SHIMIZU <anatofuz@cr.ie.u-ryukyu.ac.jp> |
---|---|
date | Sun, 23 Dec 2018 21:23:56 +0900 |
parents | 04ced10e8804 |
children | 1830386684a0 |
line wrap: on
line source
#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 % (32768 / 64); #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 (hres <= 16777216); assert (res == hres); return 0; }