File: omp_parallel_sections_lastprivate.c

package info (click to toggle)
llvm-toolchain-7 1%3A7.0.1-8~deb9u3
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 733,456 kB
  • sloc: cpp: 3,776,651; ansic: 633,271; asm: 350,301; python: 142,716; objc: 107,612; sh: 22,626; lisp: 11,056; perl: 7,999; pascal: 6,742; ml: 5,537; awk: 3,536; makefile: 2,557; cs: 2,027; xml: 841; ruby: 156
file content (71 lines) | stat: -rw-r--r-- 1,113 bytes parent folder | download | duplicates (29)
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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
// RUN: %libomp-compile-and-run
#include <stdio.h>
#include "omp_testsuite.h"

int test_omp_parallel_sections_lastprivate()
{
  int sum;
  int sum0;
  int i;
  int i0;
  int known_sum;
  sum =0;
  sum0 = 0;
  i0 = -1;

  #pragma omp parallel sections private(i,sum0) lastprivate(i0)
  {
    #pragma omp section
    {
      sum0=0;
      for (i=1;i<400;i++) {
        sum0=sum0+i;
        i0=i;
      }
      #pragma omp critical
      {
        sum= sum+sum0;
      }
    }
    #pragma omp section
    {
      sum0=0;
      for(i=400;i<700;i++) {
        sum0=sum0+i;
        i0=i;
      }
      #pragma omp critical
      {
        sum= sum+sum0;
      }
    }
    #pragma omp section
    {
      sum0=0;
      for(i=700;i<1000;i++) {
        sum0=sum0+i;
        i0=i;
      }
      #pragma omp critical
      {
        sum= sum+sum0;
      }
    }
  }

  known_sum=(999*1000)/2;
  return ((known_sum==sum) && (i0==999) );
}

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

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