File: omp_for_firstprivate.c

package info (click to toggle)
llvm-toolchain-11 1%3A11.0.1-2
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 995,808 kB
  • sloc: cpp: 4,767,656; ansic: 760,916; asm: 477,436; python: 170,940; objc: 69,804; lisp: 29,914; sh: 23,855; f90: 18,173; pascal: 7,551; perl: 7,471; ml: 5,603; awk: 3,489; makefile: 2,573; xml: 915; cs: 573; fortran: 503; javascript: 452
file content (55 lines) | stat: -rw-r--r-- 935 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
52
53
54
55
 
// RUN: %libomp-compile-and-run
#include <stdio.h>
#include <math.h>
#include "omp_testsuite.h"

int sum1;
#pragma omp threadprivate(sum1)

int test_omp_for_firstprivate()
{
  int sum;
  int sum0;
  int known_sum;
  int threadsnum;

  sum = 0;
  sum0 = 12345;
  sum1 = 0;

  #pragma omp parallel
  {
    #pragma omp single
    {
      threadsnum=omp_get_num_threads();
    }
    /* sum0 = 0; */

    int i;
    #pragma omp for firstprivate(sum0)
    for (i = 1; i <= LOOPCOUNT; i++) {
      sum0 = sum0 + i;
      sum1 = sum0;
    }  /* end of for */

    #pragma omp critical
    {
      sum = sum + sum1;
    }  /* end of critical */
  }  /* end of parallel */
  known_sum = 12345* threadsnum+ (LOOPCOUNT * (LOOPCOUNT + 1)) / 2;
  return (known_sum == sum);
}

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

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