File: map_back_race.cpp

package info (click to toggle)
llvm-toolchain-21 1%3A21.1.8-2
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 2,236,724 kB
  • sloc: cpp: 7,619,776; ansic: 1,433,958; asm: 1,058,748; python: 252,197; f90: 94,671; objc: 70,753; lisp: 42,813; pascal: 18,401; sh: 8,601; ml: 5,111; perl: 4,720; makefile: 3,719; awk: 3,523; javascript: 2,272; xml: 892; fortran: 770
file content (32 lines) | stat: -rw-r--r-- 914 bytes parent folder | download | duplicates (15)
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
// RUN: %libomptarget-compilexx-and-run-generic

// Taken from https://github.com/llvm/llvm-project/issues/54216

#include <algorithm>
#include <cstdlib>
#include <iostream>

bool almost_equal(float x, float gold, float rel_tol = 1e-09,
                  float abs_tol = 0.0) {
  return std::abs(x - gold) <=
         std::max(rel_tol * std::max(std::abs(x), std::abs(gold)), abs_tol);
}
void test_parallel_for__target() {
  const int N0{32768};
  const float expected_value{N0};
  float counter_N0{};
#pragma omp parallel for
  for (int i0 = 0; i0 < N0; i0++) {
#pragma omp target map(tofrom : counter_N0)
    {
#pragma omp atomic update
      counter_N0 = counter_N0 + 1.;
    }
  }
  if (!almost_equal(counter_N0, expected_value, 0.01)) {
    std::cerr << "Expected: " << expected_value << " Got: " << counter_N0
              << std::endl;
    std::exit(112);
  }
}
int main() { test_parallel_for__target(); }