File: omp_for_lastprivate.c

package info (click to toggle)
llvm-toolchain-15 1%3A15.0.6-4
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,554,644 kB
  • sloc: cpp: 5,922,452; ansic: 1,012,136; asm: 674,362; python: 191,568; objc: 73,855; f90: 42,327; lisp: 31,913; pascal: 11,973; javascript: 10,144; sh: 9,421; perl: 7,447; ml: 5,527; awk: 3,523; makefile: 2,520; xml: 885; cs: 573; fortran: 567
file content (52 lines) | stat: -rw-r--r-- 1,034 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
49
50
51
52
 
// RUN: %libomp-compile-and-run
#include <stdio.h>
#include <math.h>
#include "omp_testsuite.h"

int sum0;
#pragma omp threadprivate(sum0)

int test_omp_for_lastprivate()
{
  int sum = 0;
  int known_sum;
  int i0;

  i0 = -1;

  #pragma omp parallel
  {
    sum0 = 0;
    {  /* Begin of orphaned block */
      int i;
      #pragma omp for schedule(static,7) lastprivate(i0)
      for (i = 1; i <= LOOPCOUNT; i++) {
        sum0 = sum0 + i;
        i0 = i;
      }  /* end of for */
    }  /* end of orphaned block */

    #pragma omp critical
    {
      sum = sum + sum0;
    }  /* end of critical */
  }  /* end of parallel */

  known_sum = (LOOPCOUNT * (LOOPCOUNT + 1)) / 2;
  fprintf(stderr, "known_sum = %d , sum = %d\n",known_sum,sum);
  fprintf(stderr, "LOOPCOUNT = %d , i0 = %d\n",LOOPCOUNT,i0);
  return ((known_sum == sum) && (i0 == LOOPCOUNT));
}

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

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