diff options
author | Dan Albert <danalbert@google.com> | 2015-06-17 11:09:54 -0700 |
---|---|---|
committer | Dan Albert <danalbert@google.com> | 2015-06-17 14:15:22 -0700 |
commit | f378ebf14df0952eae870c9865bab8326aa8f137 (patch) | |
tree | 31794503eb2a8c64ea5f313b93100f1163afcffb /gcc-4.4.3/libgomp/testsuite/libgomp.fortran/omp_reduction.f | |
parent | 2c58169824949d3a597d9fa81931e001ef9b1bd0 (diff) | |
download | toolchain_gcc-f378ebf14df0952eae870c9865bab8326aa8f137.tar.gz toolchain_gcc-f378ebf14df0952eae870c9865bab8326aa8f137.tar.bz2 toolchain_gcc-f378ebf14df0952eae870c9865bab8326aa8f137.zip |
Delete old versions of GCC.
Change-Id: I710f125d905290e1024cbd67f48299861790c66c
Diffstat (limited to 'gcc-4.4.3/libgomp/testsuite/libgomp.fortran/omp_reduction.f')
-rw-r--r-- | gcc-4.4.3/libgomp/testsuite/libgomp.fortran/omp_reduction.f | 33 |
1 files changed, 0 insertions, 33 deletions
diff --git a/gcc-4.4.3/libgomp/testsuite/libgomp.fortran/omp_reduction.f b/gcc-4.4.3/libgomp/testsuite/libgomp.fortran/omp_reduction.f deleted file mode 100644 index 0560bd896..000000000 --- a/gcc-4.4.3/libgomp/testsuite/libgomp.fortran/omp_reduction.f +++ /dev/null @@ -1,33 +0,0 @@ -C****************************************************************************** -C FILE: omp_reduction.f -C DESCRIPTION: -C OpenMP Example - Combined Parallel Loop Reduction - Fortran Version -C This example demonstrates a sum reduction within a combined parallel loop -C construct. Notice that default data element scoping is assumed - there -C are no clauses specifying shared or private variables. OpenMP will -C automatically make loop index variables private within team threads, and -C global variables shared. -C AUTHOR: Blaise Barney 5/99 -C LAST REVISED: -C****************************************************************************** - - PROGRAM REDUCTION - - INTEGER I, N - REAL A(100), B(100), SUM - -! Some initializations - N = 100 - DO I = 1, N - A(I) = I *1.0 - B(I) = A(I) - ENDDO - SUM = 0.0 - -!$OMP PARALLEL DO REDUCTION(+:SUM) - DO I = 1, N - SUM = SUM + (A(I) * B(I)) - ENDDO - - PRINT *, ' Sum = ', SUM - END |