X-Git-Url: https://oss.titaniummirror.com/gitweb?a=blobdiff_plain;f=libgomp%2Ftestsuite%2Flibgomp.c%2Fomp_reduction.c;fp=libgomp%2Ftestsuite%2Flibgomp.c%2Fomp_reduction.c;h=5c9c41ec7491cad9cd9adf6219e54883e0282e4b;hb=6fed43773c9b0ce596dca5686f37ac3fc0fa11c0;hp=0000000000000000000000000000000000000000;hpb=27b11d56b743098deb193d510b337ba22dc52e5c;p=msp430-gcc.git

diff --git a/libgomp/testsuite/libgomp.c/omp_reduction.c b/libgomp/testsuite/libgomp.c/omp_reduction.c
new file mode 100644
index 00000000..5c9c41ec
--- /dev/null
+++ b/libgomp/testsuite/libgomp.c/omp_reduction.c
@@ -0,0 +1,35 @@
+/******************************************************************************
+* FILE: omp_reduction.c
+* DESCRIPTION:
+*   OpenMP Example - Combined Parallel Loop Reduction - C/C++ Version
+*   This example demonstrates a sum reduction within a combined parallel loop
+*   construct.  Notice that default data element scoping is assumed - there
+*   are no clauses specifying shared or private variables.  OpenMP will 
+*   automatically make loop index variables private within team threads, and
+*   global variables shared.
+* AUTHOR: Blaise Barney  5/99
+* LAST REVISED: 04/06/05
+******************************************************************************/
+#include <omp.h>
+#include <stdio.h>
+#include <stdlib.h>
+
+int main (int argc, char *argv[]) {
+
+int   i, n;
+float a[100], b[100], sum; 
+
+/* Some initializations */
+n = 100;
+for (i=0; i < n; i++)
+  a[i] = b[i] = i * 1.0;
+sum = 0.0;
+
+#pragma omp parallel for reduction(+:sum)
+  for (i=0; i < n; i++)
+    sum = sum + (a[i] * b[i]);
+
+printf("   Sum = %f\n",sum);
+
+  return 0;
+}