blob: 6c991f7cf61d63e4502db5a94a85c7292d8489d0 [file] [log] [blame]
 Test which checks the omp parallel for reduction directive with all its options. 2.0 omp parallel for reduction #include #include #include "omp_testsuite.h" int omp_parallel_for_reduction(FILE * logFile){ int sum; int known_sum; double dsum; double dknown_sum; double dt=0.5; /* base of geometric row for + and - test*/ double rounding_error= 1.E-9; #define DOUBLE_DIGITS 20 /* dt^DOUBLE_DIGITS */ int diff; double ddiff; int product; int known_product; #define MAX_FACTOR 10 #define KNOWN_PRODUCT 3628800 /* 10! */ int logic_and; int logic_or; int bit_and; int bit_or; int exclusiv_bit_or; int logics[LOOPCOUNT]; int i; double dpt; int result; sum =0; dsum=0; dt = 1./3.; result = 0; product = 1; logic_and=1; logic_or=0; bit_and=1; bit_or=0; exclusiv_bit_or=0; known_sum = (LOOPCOUNT*(LOOPCOUNT+1))/2; #pragma omp parallel for schedule(dynamic,1) private(i) reduction(+:sum) for (i=1;i<=LOOPCOUNT;i++) { sum=sum+i; } if(known_sum!=sum) { result++; fprintf(logFile,"Error in sum with integers: Result was %d instead of %d\n",sum,known_sum); } diff = (LOOPCOUNT*(LOOPCOUNT+1))/2; #pragma omp parallel for schedule(dynamic,1) private(i) reduction(-:diff) for (i=1;i<=LOOPCOUNT;++i) { diff=diff-i; } if(diff != 0) { result++; fprintf(logFile,"Error in difference with integers: Result was %d instead of 0.\n",diff); } /* Tests for doubles */ dsum=0; dpt=1; for (i=0;ireduction(+:dsum) for (i=0;i rounding_error ) { result++; fprintf(logFile,"Error in sum with doubles: Result was %f instead of %f (Difference: %E)\n",dsum,dknown_sum, dsum-dknown_sum); } dpt=1; for (i=0;ireduction(-:ddiff) for (i=0;i rounding_error) { result++; fprintf(logFile,"Error in Difference with doubles: Result was %E instead of 0.0\n",ddiff); } #pragma omp parallel for schedule(dynamic,1) private(i) reduction(*:product) for(i=1;i<=MAX_FACTOR;i++) { product *= i; } known_product = KNOWN_PRODUCT; if(known_product != product) { result++; fprintf(logFile,"Error in Product with integers: Result was %d instead of %d\n\n",product,known_product); } for(i=0;ireduction(&&:logic_and) for(i=0;ireduction(&&:logic_and) for(i=0;ireduction(||:logic_or) for(i=0;ireduction(||:logic_or) for(i=0;ireduction(&:bit_and) for(i=0;ireduction(&:bit_and) for(i=0;ireduction(|:bit_or) for(i=0;ireduction(|:bit_or) for(i=0;ireduction(^:exclusiv_bit_or) for(i=0;ireduction(^:exclusiv_bit_or) for(i=0;i /*printf("\nResult:%d\n",result);*/ return (result==0); }