File: map_back_race.cpp

package info (click to toggle)
llvm-toolchain-16 1%3A16.0.6-15~deb12u1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,634,792 kB
  • sloc: cpp: 6,179,261; ansic: 1,216,205; asm: 741,319; python: 196,614; objc: 75,325; f90: 49,640; lisp: 32,396; pascal: 12,286; sh: 9,394; perl: 7,442; ml: 5,494; awk: 3,523; makefile: 2,723; javascript: 1,206; xml: 886; fortran: 581; cs: 573
file content (32 lines) | stat: -rw-r--r-- 914 bytes parent folder | download | duplicates (12) 
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(); }