File: omp_nonmonotonic_nowait.c

package info (click to toggle)
llvm-toolchain-19 1%3A19.1.7-3
  • links: PTS, VCS
  • area: main
  • in suites: trixie
  • size: 1,998,520 kB
  • sloc: cpp: 6,951,680; ansic: 1,486,157; asm: 913,598; python: 232,024; f90: 80,126; objc: 75,281; lisp: 37,276; pascal: 16,990; sh: 10,009; ml: 5,058; perl: 4,724; awk: 3,523; makefile: 3,167; javascript: 2,504; xml: 892; fortran: 664; cs: 573
file content (34 lines) | stat: -rw-r--r-- 750 bytes parent folder | download | duplicates (24) 
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;
  }
}