Scale down libgomp.graphite/force-parallel-6.c

2015-03-27  Tom de Vries  <tom@codesourcery.com>

	PR testsuite/65594
	* testsuite/libgomp.graphite/force-parallel-6.c (M): Define.
	(foo): Use M for non-inner loops to scale down test-case.

From-SVN: r221727

diff --git a/libgomp/ChangeLog b/libgomp/ChangeLog
index 6536fd3c77571c05f3deb8871d473e7fcb514b74..f9ea0544c5fadea68ac50194234a82f5b85a6f2f 100644 (file)
--- a/libgomp/ChangeLog
+++ b/libgomp/ChangeLog
@@ -1,3 +1,9 @@
+2015-03-27  Tom de Vries  <tom@codesourcery.com>
+
+       PR testsuite/65594
+       * testsuite/libgomp.graphite/force-parallel-6.c (M): Define.
+       (foo): Use M for non-inner loops to scale down test-case.
+
 2015-03-25  Kai Tietz  <ktietz@redhat.com>
 
        PR libgomp/64972

diff --git a/libgomp/testsuite/libgomp.graphite/force-parallel-6.c b/libgomp/testsuite/libgomp.graphite/force-parallel-6.c
index 50716303eaf6b17de33ee116c7083206608789c6..e9e4b562488f39f94f9115df12f29ede49ebe740 100644 (file)
--- a/libgomp/testsuite/libgomp.graphite/force-parallel-6.c
+++ b/libgomp/testsuite/libgomp.graphite/force-parallel-6.c
@@ -1,4 +1,5 @@
 #define N 500
+#define M 50
 
 int X[2*N], Y[2*N], B[2*N];
 int A[2*N][2*N], C[2*N][2*N];
@@ -7,10 +8,10 @@ int foo(void)
 {
   int i, j, k;
 
-  for (i = 0; i < N; i++)
+  for (i = 0; i < M; i++)
     {
       X[i] = Y[i] + 10;
-      for (j = 0; j < N; j++)
+      for (j = 0; j < M; j++)
        {
          B[j] = A[j][N];
          for (k = 0; k < N; k++)