File: reduction_implicit_map.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 (22 lines) | stat: -rw-r--r-- 552 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
 
// RUN: %libomptarget-compilexx-run-and-check-generic

#include <stdio.h>

void sum(int *input, int size, int *output) {
#pragma omp target teams distribute parallel for reduction(+ : output[0])      \
    map(to : input[0 : size])
  for (int i = 0; i < size; i++)
    output[0] += input[i];
}
int main() {
  const int size = 100;
  int *array = new int[size];
  int result = 0;
  for (int i = 0; i < size; i++)
    array[i] = i + 1;
  sum(array, size, &result);
  // CHECK: Result=5050
  printf("Result=%d\n", result);
  delete[] array;
  return 0;
}