blob: cadea6a2468ccc3bb1bc6b4c061e5ae1f4006ac1 [file] [log] [blame]
Jim Cownie18d84732014-05-10 17:02:09 +00001<ompts:test>
2<ompts:testdescription>Test which checks the omp parallel sections reduction directive with all its option.</ompts:testdescription>
3<ompts:ompversion>2.0</ompts:ompversion>
4<ompts:directive>omp parallel sections reduction</ompts:directive>
5<ompts:testcode>
6#include <stdio.h>
7#include <math.h>
8#include "omp_testsuite.h"
9
10
11int <ompts:testcode:functionname>omp_parallel_sections_reduction</ompts:testcode:functionname>(FILE * logFile){
12 <ompts:orphan:vars>
13 int sum;
14 int known_sum;
15 double dpt;
16 double dsum;
17 double dknown_sum;
18 double dt=0.5; /* base of geometric row for + and - test*/
19 double rounding_error= 1.E-5;
20 int diff;
21 double ddiff;
22 int product;
23 int known_product;
24 int logic_and;
25 int bit_and;
26 int logic_or;
27 int bit_or;
28 int exclusiv_bit_or;
29 int logics[1000];
30 int i;
31 int result;
32 </ompts:orphan:vars>
33
34 sum = 7;
35 dsum=0;
36 product =1;
37 dpt = 1;
38 logic_and=1;
39 bit_and=1;
40 logic_or=0;
41 bit_or=0;
42 exclusiv_bit_or=0;
43 result =0;
44 /* int my_islarger;*/
45 /*int is_larger=1;*/
46 known_sum = (999*1000)/2+7;
47
48 <ompts:orphan>
49#pragma omp parallel sections private(i) <ompts:check>reduction(+:sum)</ompts:check><ompts:crosscheck></ompts:crosscheck>
50 {
51#pragma omp section
52 {
53 for (i=1;i<300;i++)
54 {
55 sum=sum+i;
56 }
57 }
58#pragma omp section
59 {
60 for (i=300;i<700;i++)
61 {
62 sum=sum+i;
63 }
64 }
65#pragma omp section
66 {
67 for (i=700;i<1000;i++)
68 {
69 sum=sum+i;
70 }
71 }
72 }
73
74 if(known_sum!=sum)
75 {
76 result++;
77 fprintf(logFile,"Error in sum with integers: Result was %d instead of %d.\n",sum, known_sum);
78 }
79
80 diff = (999*1000)/2;
81#pragma omp parallel sections private(i) <ompts:check>reduction(-:diff)</ompts:check><ompts:crosscheck></ompts:crosscheck>
82 {
83#pragma omp section
84 {
85 for (i=1;i<300;i++)
86 {
87 diff=diff-i;
88 }
89 }
90#pragma omp section
91 {
92 for (i=300;i<700;i++)
93 {
94 diff=diff-i;
95 }
96 }
97#pragma omp section
98 {
99 for (i=700;i<1000;i++)
100 {
101 diff=diff-i;
102 }
103 }
104 }
105
106
107 if(diff != 0)
108 {
109 result++;
110 fprintf(logFile,"Error in Difference with integers: Result was %d instead of 0.\n",diff);
111 }
112 for (i=0;i<20;++i)
113 {
114 dpt*=dt;
115 }
116 dknown_sum = (1-dpt)/(1-dt);
117#pragma omp parallel sections private(i) <ompts:check>reduction(+:dsum)</ompts:check><ompts:crosscheck></ompts:crosscheck>
118 {
119#pragma omp section
120 {
121 for (i=0;i<6;++i)
122 {
123 dsum += pow(dt,i);
124 }
125 }
126#pragma omp section
127 {
128 for (i=6;i<12;++i)
129 {
130 dsum += pow(dt,i);
131 }
132 }
133#pragma omp section
134 {
135 for (i=12;i<20;++i)
136 {
137 dsum += pow(dt,i);
138 }
139 }
140 }
141
142
143 if( fabs(dsum-dknown_sum) > rounding_error )
144 {
145 result++;
146 fprintf(logFile,"Error in sum with doubles: Result was %f instead of %f (Difference: %E)\n",dsum,dknown_sum, dsum-dknown_sum);
147 }
148
149 dpt=1;
150
151 for (i=0;i<20;++i)
152 {
153 dpt*=dt;
154 }
155 fprintf(logFile,"\n");
156 ddiff = (1-dpt)/(1-dt);
157#pragma omp parallel sections private(i) <ompts:check>reduction(-:ddiff)</ompts:check><ompts:crosscheck></ompts:crosscheck>
158 {
159#pragma omp section
160 {
161 for (i=0;i<6;++i)
162 {
163 ddiff -= pow(dt,i);
164 }
165 }
166#pragma omp section
167 {
168 for (i=6;i<12;++i)
169 {
170 ddiff -= pow(dt,i);
171 }
172 }
173#pragma omp section
174 {
175 for (i=12;i<20;++i)
176 {
177 ddiff -= pow(dt,i);
178 }
179 }
180 }
181
182 if( fabs(ddiff) > rounding_error)
183 {
184 result++;
185 fprintf(logFile,"Error in Difference with doubles: Result was %E instead of 0.0\n",ddiff);
186 }
187
188 known_product = 3628800;
189#pragma omp parallel sections private(i) <ompts:check>reduction(*:product)</ompts:check><ompts:crosscheck></ompts:crosscheck>
190 {
191#pragma omp section
192 {
193 for(i=1;i<3;i++)
194 {
195 product *= i;
196 }
197 }
198#pragma omp section
199 {
200 for(i=3;i<7;i++)
201 {
202 product *= i;
203 }
204 }
205#pragma omp section
206 {
207 for(i=7;i<11;i++)
208 {
209 product *= i;
210 }
211 }
212 }
213
214
215 if(known_product != product)
216 {
217 result++;
218 fprintf(logFile,"Error in Product with integers: Result was %d instead of %d\n",product,known_product);
219 }
220
221 for(i=0;i<1000;i++)
222 {
223 logics[i]=1;
224 }
225
226#pragma omp parallel sections private(i) <ompts:check>reduction(&&:logic_and)</ompts:check><ompts:crosscheck></ompts:crosscheck>
227 {
228#pragma omp section
229 {
230 for (i=1;i<300;i++)
231 {
232 logic_and = (logic_and && logics[i]);
233 }
234 }
235#pragma omp section
236 {
237 for (i=300;i<700;i++)
238 {
239 logic_and = (logic_and && logics[i]);
240 }
241 }
242#pragma omp section
243 {
244 for (i=700;i<1000;i++)
245 {
246 logic_and = (logic_and && logics[i]);
247 }
248 }
249 }
250
251 if(!logic_and)
252 {
253 result++;
254 fprintf(logFile,"Error in logic AND part 1\n");
255 }
256
257 logic_and = 1;
258 logics[501] = 0;
259
260#pragma omp parallel sections private(i) <ompts:check>reduction(&&:logic_and)</ompts:check><ompts:crosscheck></ompts:crosscheck>
261 {
262#pragma omp section
263 {
264 for (i=1;i<300;i++)
265 {
266 logic_and = (logic_and && logics[i]);
267 }
268 }
269#pragma omp section
270 {
271 for (i=300;i<700;i++)
272 {
273 logic_and = (logic_and && logics[i]);
274 }
275 }
276#pragma omp section
277 {
278 for (i=700;i<1000;i++)
279 {
280 logic_and = (logic_and && logics[i]);
281 }
282 }
283 }
284
285 if(logic_and)
286 {
287 result++;
288 fprintf(logFile,"Error in logic AND part 2");
289 }
290
291 for(i=0;i<1000;i++)
292 {
293 logics[i]=0;
294 }
295
296#pragma omp parallel sections private(i) <ompts:check>reduction(||:logic_or)</ompts:check><ompts:crosscheck></ompts:crosscheck>
297 {
298#pragma omp section
299 {
300 for (i=1;i<300;i++)
301 {
302 logic_or = (logic_or || logics[i]);
303 }
304 }
305#pragma omp section
306 {
307 for (i=300;i<700;i++)
308 {
309 logic_or = (logic_or || logics[i]);
310 }
311 }
312#pragma omp section
313 {
314 for (i=700;i<1000;i++)
315 {
316 logic_or = (logic_or || logics[i]);
317 }
318 }
319 }
320
321 if(logic_or)
322 {
323 result++;
324 fprintf(logFile,"Error in logic OR part 1\n");
325 }
326
327 logic_or = 0;
328 logics[501]=1;
329
330#pragma omp parallel sections private(i) <ompts:check>reduction(||:logic_or)</ompts:check><ompts:crosscheck></ompts:crosscheck>
331 {
332#pragma omp section
333 {
334 for (i=1;i<300;i++)
335 {
336 logic_or = (logic_or || logics[i]);
337 }
338 }
339#pragma omp section
340 {
341 for (i=300;i<700;i++)
342 {
343 logic_or = (logic_or || logics[i]);
344 }
345 }
346#pragma omp section
347 {
348 for (i=700;i<1000;i++)
349 {
350 logic_or = (logic_or || logics[i]);
351 }
352 }
353 }
354
355 if(!logic_or)
356 {
357 result++;
358 fprintf(logFile,"Error in logic OR part 2\n");
359 }
360
361 for(i=0;i<1000;++i)
362 {
363 logics[i]=1;
364 }
365
366#pragma omp parallel sections private(i) <ompts:check>reduction(&:bit_and)</ompts:check><ompts:crosscheck></ompts:crosscheck>
367 {
368#pragma omp section
369 {
370 for(i=0;i<300;++i)
371 {
372 bit_and = (bit_and & logics[i]);
373 }
374 }
375#pragma omp section
376 {
377 for(i=300;i<700;++i)
378 {
379 bit_and = (bit_and & logics[i]);
380 }
381 }
382#pragma omp section
383 {
384 for(i=700;i<1000;++i)
385 {
386 bit_and = (bit_and & logics[i]);
387 }
388 }
389 }
390 if(!bit_and)
391 {
392 result++;
393 fprintf(logFile,"Error in BIT AND part 1\n");
394 }
395
396 bit_and = 1;
397 logics[501]=0;
398
399#pragma omp parallel sections private(i) <ompts:check>reduction(&:bit_and)</ompts:check><ompts:crosscheck></ompts:crosscheck>
400 {
401#pragma omp section
402 {
403 for(i=0;i<300;++i)
404 {
405 bit_and = bit_and & logics[i];
406 }
407 }
408#pragma omp section
409 {
410 for(i=300;i<700;++i)
411 {
412 bit_and = bit_and & logics[i];
413 }
414 }
415#pragma omp section
416 {
417 for(i=700;i<1000;++i)
418 {
419 bit_and = bit_and & logics[i];
420 }
421 }
422 }
423 if(bit_and)
424 {
425 result++;
426 fprintf(logFile,"Error in BIT AND part 2");
427 }
428
429 for(i=0;i<1000;i++)
430 {
431 logics[i]=0;
432 }
433
434#pragma omp parallel sections private(i) <ompts:check>reduction(|:bit_or)</ompts:check><ompts:crosscheck></ompts:crosscheck>
435 {
436#pragma omp section
437 {
438 for(i=0;i<300;++i)
439 {
440 bit_or = bit_or | logics[i];
441 }
442 }
443#pragma omp section
444 {
445 for(i=300;i<700;++i)
446 {
447 bit_or = bit_or | logics[i];
448 }
449 }
450#pragma omp section
451 {
452 for(i=700;i<1000;++i)
453 {
454 bit_or = bit_or | logics[i];
455 }
456 }
457 }
458 if(bit_or)
459 {
460 result++;
461 fprintf(logFile,"Error in BIT OR part 1\n");
462 }
463 bit_or = 0;
464 logics[501]=1;
465
466#pragma omp parallel sections private(i) <ompts:check>reduction(|:bit_or)</ompts:check><ompts:crosscheck></ompts:crosscheck>
467 {
468#pragma omp section
469 {
470 for(i=0;i<300;++i)
471 {
472 bit_or = bit_or | logics[i];
473 }
474 }
475#pragma omp section
476 {
477 for(i=300;i<700;++i)
478 {
479 bit_or = bit_or | logics[i];
480 }
481 }
482#pragma omp section
483 {
484 for(i=700;i<1000;++i)
485 {
486 bit_or = bit_or | logics[i];
487 }
488 }
489 }
490 if(!bit_or)
491 {
492 result++;
493 fprintf(logFile,"Error in BIT OR part 2\n");
494 }
495
496 for(i=0;i<1000;i++)
497 {
498 logics[i]=0;
499 }
500
501#pragma omp parallel sections private(i) <ompts:check>reduction(^:exclusiv_bit_or)</ompts:check><ompts:crosscheck></ompts:crosscheck>
502 {
503#pragma omp section
504 {
505 for(i=0;i<300;++i)
506 {
507 exclusiv_bit_or = exclusiv_bit_or ^ logics[i];
508 }
509 }
510#pragma omp section
511 {
512 for(i=300;i<700;++i)
513 {
514 exclusiv_bit_or = exclusiv_bit_or ^ logics[i];
515 }
516 }
517#pragma omp section
518 {
519 for(i=700;i<1000;++i)
520 {
521 exclusiv_bit_or = exclusiv_bit_or ^ logics[i];
522 }
523 }
524 }
525 if(exclusiv_bit_or)
526 {
527 result++;
528 fprintf(logFile,"Error in EXCLUSIV BIT OR part 1\n");
529 }
530
531 exclusiv_bit_or = 0;
532 logics[501]=1;
533
534#pragma omp parallel sections private(i) <ompts:check>reduction(^:exclusiv_bit_or)</ompts:check><ompts:crosscheck></ompts:crosscheck>
535 {
536#pragma omp section
537 {
538 for(i=0;i<300;++i)
539 {
540 exclusiv_bit_or = exclusiv_bit_or ^ logics[i];
541 }
542 }
543#pragma omp section
544 {
545 for(i=300;i<700;++i)
546 {
547 exclusiv_bit_or = exclusiv_bit_or ^ logics[i];
548 }
549 }
550#pragma omp section
551 {
552 for(i=700;i<1000;++i)
553 {
554 exclusiv_bit_or = exclusiv_bit_or ^ logics[i];
555 }
556 }
557 }
558 if(!exclusiv_bit_or)
559 {
560 result++;
561 fprintf(logFile,"Error in EXCLUSIV BIT OR part 2\n");
562 }
563</ompts:orphan>
564 /*printf("\nResult:%d\n",result);*/
565 return (result==0);
566}
567</ompts:testcode>
568</ompts:test>