File: omp_nonmonotonic_dynamic1.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 (40 lines) | stat: -rw-r--r-- 998 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
35
36
37
38
39
40
 
// RUN: %libomp-compile
// RUN: env OMP_SCHEDULE=nonmonotonic:dynamic,10 %libomp-run

// The test checks iterations distribution for OMP 5.0 nonmonotonic OMP_SCHEDULE
// case #threads > #chunks (fallback to monotonic dynamic)

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

#define ITERS 100
#define CHUNK 10
int err = 0;

int main(int argc, char **argv) {
  int i, ch, it[ITERS];
  omp_set_num_threads(16); // #threads is bigger than #chunks
#pragma omp parallel for schedule(runtime)
  for (i = 0; i < ITERS; ++i) {
    it[i] = omp_get_thread_num();
  }
  // check that each chunk executed by single thread
  for (ch = 0; ch < ITERS/CHUNK; ++ch) {
    int iter = ch * CHUNK;
    int nt = it[iter]; // thread number
    for (i = 1; i < CHUNK; ++i) {
#if _DEBUG
      printf("iter %d: (%d %d)\n", iter + i, nt, it[iter + i]);
#endif
      if (nt != it[iter + i]) {
        err++;
      }
    }
  }
  if (err > 0) {
    printf("Failed, err = %d\n", err);
    return 1;
  }
  printf("Passed\n");
  return 0;
}