File: omp_for_collapse.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 (51 lines) | stat: -rw-r--r-- 983 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
 
// RUN: %libomp-compile-and-run
#include <stdio.h>
#include <math.h>
#include "omp_testsuite.h"

/* Utility function to check that i is increasing monotonically
   with each call */
static int check_i_islarger (int i)
{
  static int last_i;
  int islarger;
  if (i==1)
    last_i=0;
  islarger = ((i >= last_i)&&(i - last_i<=1));
  last_i = i;
  return (islarger);
}

int test_omp_for_collapse()
{
  int is_larger = 1;

  #pragma omp parallel
  {
    int i,j;
    int my_islarger = 1;
    #pragma omp for private(i,j) schedule(static,1) collapse(2) ordered
    for (i = 1; i < 100; i++) {
      for (j =1; j <100; j++) {
        #pragma omp ordered
        my_islarger = check_i_islarger(i)&&my_islarger;
      }
    }
    #pragma omp critical
    is_larger = is_larger && my_islarger;
  }
  return (is_larger);
}

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

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