aboutsummaryrefslogtreecommitdiffstats
path: root/gcc-4.4.3/libgomp/testsuite/libgomp.c/omp-loop01.c
diff options
context:
space:
mode:
authorDan Albert <danalbert@google.com>2015-06-17 11:09:54 -0700
committerDan Albert <danalbert@google.com>2015-06-17 14:15:22 -0700
commitf378ebf14df0952eae870c9865bab8326aa8f137 (patch)
tree31794503eb2a8c64ea5f313b93100f1163afcffb /gcc-4.4.3/libgomp/testsuite/libgomp.c/omp-loop01.c
parent2c58169824949d3a597d9fa81931e001ef9b1bd0 (diff)
downloadtoolchain_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.c/omp-loop01.c')
-rw-r--r--gcc-4.4.3/libgomp/testsuite/libgomp.c/omp-loop01.c96
1 files changed, 0 insertions, 96 deletions
diff --git a/gcc-4.4.3/libgomp/testsuite/libgomp.c/omp-loop01.c b/gcc-4.4.3/libgomp/testsuite/libgomp.c/omp-loop01.c
deleted file mode 100644
index 0e83c9583..000000000
--- a/gcc-4.4.3/libgomp/testsuite/libgomp.c/omp-loop01.c
+++ /dev/null
@@ -1,96 +0,0 @@
-#include <stdlib.h>
-#include <stdio.h>
-#include <string.h>
-#include <omp.h>
-
-#define MAX 1000
-
-void main1()
-{
- int i, N1, N2, step;
- int a[MAX], b[MAX];
-
- N1 = rand () % 13;
- N2 = rand () % (MAX - 51) + 50;
- step = rand () % 7 + 1;
-
- printf ("N1 = %d\nN2 = %d\nstep = %d\n", N1, N2, step);
-
- for (i = N1; i <= N2; i += step)
- a[i] = 42+ i;
-
- /* COUNTING UP (<). Fill in array 'b' in parallel. */
- memset (b, 0, sizeof b);
-#pragma omp parallel shared(a,b,N1,N2,step) private(i)
- {
-#pragma omp for
- for (i = N1; i < N2; i += step)
- b[i] = a[i];
- }
-
- /* COUNTING UP (<). Check that all the cells were filled in properly. */
- for (i = N1; i < N2; i += step)
- if (a[i] != b[i])
- abort ();
-
- printf ("for (i = %d; i < %d; i += %d) [OK]\n", N1, N2, step);
-
- /* COUNTING UP (<=). Fill in array 'b' in parallel. */
- memset (b, 0, sizeof b);
-#pragma omp parallel shared(a,b,N1,N2,step) private(i)
- {
-#pragma omp for
- for (i = N1; i <= N2; i += step)
- b[i] = a[i];
- }
-
- /* COUNTING UP (<=). Check that all the cells were filled in properly. */
- for (i = N1; i <= N2; i += step)
- if (a[i] != b[i])
- abort ();
-
- printf ("for (i = %d; i <= %d; i += %d) [OK]\n", N1, N2, step);
-
- /* COUNTING DOWN (>). Fill in array 'b' in parallel. */
- memset (b, 0, sizeof b);
-#pragma omp parallel shared(a,b,N1,N2,step) private(i)
- {
-#pragma omp for
- for (i = N2; i > N1; i -= step)
- b[i] = a[i];
- }
-
- /* COUNTING DOWN (>). Check that all the cells were filled in properly. */
- for (i = N2; i > N1; i -= step)
- if (a[i] != b[i])
- abort ();
-
- printf ("for (i = %d; i > %d; i -= %d) [OK]\n", N2, N1, step);
-
- /* COUNTING DOWN (>=). Fill in array 'b' in parallel. */
- memset (b, 0, sizeof b);
-#pragma omp parallel shared(a,b,N1,N2,step) private(i)
- {
-#pragma omp for
- for (i = N2; i >= N1; i -= step)
- b[i] = a[i];
- }
-
- /* COUNTING DOWN (>=). Check that all the cells were filled in properly. */
- for (i = N2; i >= N1; i -= step)
- if (a[i] != b[i])
- abort ();
-
- printf ("for (i = %d; i >= %d; i -= %d) [OK]\n", N2, N1, step);
-}
-
-int
-main ()
-{
- int i;
-
- srand (0);
- for (i = 0; i < 10; ++i)
- main1();
- return 0;
-}