File: omp_task_firstprivate.c

package info (click to toggle)
llvm-toolchain-17 1%3A17.0.6-22
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 1,799,624 kB
  • sloc: cpp: 6,428,607; ansic: 1,383,196; asm: 793,408; python: 223,504; objc: 75,364; f90: 60,502; lisp: 33,869; pascal: 15,282; sh: 9,684; perl: 7,453; ml: 4,937; awk: 3,523; makefile: 2,889; javascript: 2,149; xml: 888; fortran: 619; cs: 573
file content (51 lines) | stat: -rw-r--r-- 1,016 bytes parent folder | download | duplicates (28) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
 
// RUN: %libomp-compile-and-run
#include <stdio.h>
#include <math.h>
#include "omp_testsuite.h"

int test_omp_task_firstprivate()
{
  int i;
  int sum = 1234;
  int known_sum;
  int result = 0; /* counts the wrong sums from tasks */

  known_sum = 1234 + (LOOPCOUNT * (LOOPCOUNT + 1)) / 2;

  #pragma omp parallel
  {
    #pragma omp single
    {
      for (i = 0; i < NUM_TASKS; i++) {
        #pragma omp task firstprivate(sum)
        {
          int j;
          for (j = 0; j <= LOOPCOUNT; j++) {
            #pragma omp flush
            sum += j;
          }

          /* check if calculated sum was right */
          if (sum != known_sum) {
            #pragma omp critical
            { result++; }
          }
        } /* omp task */
      } /* for loop */
    } /* omp single */
  } /* omp parallel */
  return (result == 0);
}

int main()
{
  int i;
  int num_failed=0;

  for(i = 0; i < REPETITIONS; i++) {
    if(!test_omp_task_firstprivate()) {
      num_failed++;
    }
  }
  return num_failed;
}