File: omp_parallel_firstprivate.c

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

//static int sum1 = 789;

int test_omp_parallel_firstprivate()
{
  int sum, num_threads,sum1;
  int known_sum;

  sum = 0;
  sum1=7;
  num_threads = 0;

  #pragma omp parallel firstprivate(sum1)
  {
    /*printf("sum1=%d\n",sum1);*/
    int i;
    #pragma omp for
    for (i = 1; i < 1000; i++) {
      sum1 = sum1 + i;
    } /*end of for*/
    #pragma omp critical
    {
      sum = sum + sum1;
      num_threads++;
    } /*end of critical*/
  } /* end of parallel*/
  known_sum = (999 * 1000) / 2 + 7 * num_threads;
  return (known_sum == sum);
}

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

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