File: omp_task_imp_firstprivate.c

package info (click to toggle)
llvm-toolchain-13 1%3A13.0.1-11
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,418,840 kB
  • sloc: cpp: 5,290,826; ansic: 996,570; asm: 544,593; python: 188,212; objc: 72,027; lisp: 30,291; f90: 25,395; sh: 24,898; javascript: 9,780; pascal: 9,398; perl: 7,484; ml: 5,432; awk: 3,523; makefile: 2,913; xml: 953; cs: 573; fortran: 539
file content (47 lines) | stat: -rw-r--r-- 929 bytes parent folder | download | duplicates (30) 
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
 
// RUN: %libomp-compile-and-run
#include <stdio.h>
#include <math.h>
#include "omp_testsuite.h"

/* Utility function do spend some time in a loop */
int test_omp_task_imp_firstprivate()
{
  int i=5;
  int k = 0;
  int result = 0;
  int task_result = 1;
  #pragma omp parallel firstprivate(i)
  {
    #pragma omp single
    {
      for (k = 0; k < NUM_TASKS; k++) {
        #pragma omp task shared(result , task_result)
        {
          int j;
          //check if i is private
          if(i != 5)
            task_result = 0;
          for(j = 0; j < NUM_TASKS; j++)
            i++;
          //this should be firstprivate implicitly
        }
      }
      #pragma omp taskwait
      result = (task_result && i==5);
    }
  }
  return result;
}

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

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