File: multiple_reductions_simple.c

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 (17 lines) | stat: -rw-r--r-- 393 bytes parent folder | download | duplicates (12) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
 
// RUN: %libomptarget-compile-run-and-check-generic
// RUN: %libomptarget-compileopt-run-and-check-generic

#include <stdio.h>

int main(int argc, char **argv) {

  unsigned s1 = 0, s2 = 1;
#pragma omp target teams distribute parallel for reduction(+ : s1, s2)
  for (int i = 0; i < 10000; ++i) {
    s1 += i;
    s2 += i;
  }

  // CHECK: 49995000 : 49995001
  printf("%i : %i\n", s1, s2);
}