File: omp_nonmonotonic_nowait.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 (34 lines) | stat: -rw-r--r-- 750 bytes parent folder | download | duplicates (22) 
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
 
// RUN: %libomp-compile-and-run

// The test checks nonmonotonic scheduling works correctly when threads
// may execute different loops concurrently.

#include <stdio.h>
#include <omp.h>

#define N 200
#define C 20
int main()
{
  int i, l0 = 0, l1 = 0;
  #pragma omp parallel num_threads(8)
  {
    #pragma omp for schedule(nonmonotonic:dynamic,C) nowait
    for (i = 0; i < N; ++i) {
      #pragma omp atomic
        l0++;
    }
    #pragma omp for schedule(nonmonotonic:dynamic,C) nowait
    for (i = 0; i < N * N; ++i) {
      #pragma omp atomic
        l1++;
    }
  }
  if (l0 != N || l1 != N * N) {
    printf("failed l0 = %d, l1 = %d, should be %d %d\n", l0, l1, N, N * N);
    return 1;
  } else {
    printf("passed\n");
    return 0;
  }
}