File: omp_threadprivate_for.c

package info (click to toggle)
llvm-toolchain-16 1%3A16.0.6-15~deb12u1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,634,792 kB
  • sloc: cpp: 6,179,261; ansic: 1,216,205; asm: 741,319; python: 196,614; objc: 75,325; f90: 49,640; lisp: 32,396; pascal: 12,286; sh: 9,394; perl: 7,442; ml: 5,494; awk: 3,523; makefile: 2,723; javascript: 1,206; xml: 886; fortran: 581; cs: 573
file content (48 lines) | stat: -rw-r--r-- 846 bytes parent folder | download | duplicates (27) 
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
 
// RUN: %libomp-compile-and-run
#include "omp_testsuite.h"
#include <stdlib.h>
#include <stdio.h>

static int i;
#pragma omp threadprivate(i)

int test_omp_threadprivate_for()
{
  int known_sum;
  int sum;

  known_sum = (LOOPCOUNT * (LOOPCOUNT + 1)) / 2;
  sum = 0;

  #pragma omp parallel
  {
    int sum0 = 0, i0;
    #pragma omp for
    for (i0 = 1; i0 <= LOOPCOUNT; i0++) {
      i = i0;
      sum0 = sum0 + i;
    }
    #pragma omp critical
    {
      sum = sum + sum0;
    }
  } /* end of parallel */

  if (known_sum != sum ) {
    fprintf(stderr, " known_sum = %d, sum = %d\n", known_sum, sum);
  }
  return (known_sum == sum);
} /* end of check_threadprivate*/

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

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