PR libgomp/51132

	* testsuite/libgomp.graphite/force-parallel-1.c: Move large arrays
	to file scope.
	* testsuite/libgomp.graphite/force-parallel-3.c: Likewise.
	* testsuite/libgomp.graphite/force-parallel-6.c: Likewise.
	* testsuite/libgomp.graphite/force-parallel-7.c: Likewise.
	* testsuite/libgomp.graphite/force-parallel-8.c: Likewise.
	* testsuite/libgomp.graphite/force-parallel-9.c: Likewise.

git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@182050 138bc75d-0d04-0410-961f-82ee72b054a4

diff --git a/libgomp/ChangeLog b/libgomp/ChangeLog
index 11c96dd..cf3f004 100644 (file)
--- a/libgomp/ChangeLog
+++ b/libgomp/ChangeLog
@@ -1,3 +1,14 @@
+2011-12-06  Jakub Jelinek  <jakub@redhat.com>
+
+       PR libgomp/51132
+       * testsuite/libgomp.graphite/force-parallel-1.c: Move large arrays
+       to file scope.
+       * testsuite/libgomp.graphite/force-parallel-3.c: Likewise.
+       * testsuite/libgomp.graphite/force-parallel-6.c: Likewise.
+       * testsuite/libgomp.graphite/force-parallel-7.c: Likewise.
+       * testsuite/libgomp.graphite/force-parallel-8.c: Likewise.
+       * testsuite/libgomp.graphite/force-parallel-9.c: Likewise.
+
 2011-12-02  Alan Modra  <amodra@gmail.com>
 
        * config/linux/affinity.c: Use atomic rather than sync builtin.

diff --git a/libgomp/testsuite/libgomp.graphite/force-parallel-1.c b/libgomp/testsuite/libgomp.graphite/force-parallel-1.c
index 7f043d8..d168b43 100644 (file)
--- a/libgomp/testsuite/libgomp.graphite/force-parallel-1.c
+++ b/libgomp/testsuite/libgomp.graphite/force-parallel-1.c
@@ -1,9 +1,10 @@
 void abort (void);
 
+int x[10000000];
+
 void parloop (int N)
 {
   int i;
-  int x[10000000];
 
   for (i = 0; i < N; i++)
     x[i] = i + 3;

diff --git a/libgomp/testsuite/libgomp.graphite/force-parallel-3.c b/libgomp/testsuite/libgomp.graphite/force-parallel-3.c
index 81b356d..ff8680b 100644 (file)
--- a/libgomp/testsuite/libgomp.graphite/force-parallel-3.c
+++ b/libgomp/testsuite/libgomp.graphite/force-parallel-3.c
@@ -2,12 +2,12 @@ void abort (void);
 
 #define N 500
 
+int Z[2*N+2][2*N+2], B[2*N+2][2*N+2];
+
 void foo(void)
 {
   int i,j;
 
-  int Z[2*N+2][2*N+2], B[2*N+2][2*N+2];
-
   for (i = 0; i < 2*N+2; i++)
     for (j = 0; j < 2*N+2; j++)
       B[i][j] = Z[i][j] = i + j;

diff --git a/libgomp/testsuite/libgomp.graphite/force-parallel-6.c b/libgomp/testsuite/libgomp.graphite/force-parallel-6.c
index dcaaf48..995baa9 100644 (file)
--- a/libgomp/testsuite/libgomp.graphite/force-parallel-6.c
+++ b/libgomp/testsuite/libgomp.graphite/force-parallel-6.c
@@ -1,10 +1,11 @@
 #define N 500
 
+int X[2*N], Y[2*N], B[2*N];
+int A[2*N][2*N], C[2*N][2*N];
+
 int foo(void)
 {
   int i, j, k;
-  int X[2*N], Y[2*N], B[2*N];
-  int A[2*N][2*N], C[2*N][2*N];
 
   for (i = 1; i <= N; i++)
     {

diff --git a/libgomp/testsuite/libgomp.graphite/force-parallel-7.c b/libgomp/testsuite/libgomp.graphite/force-parallel-7.c
index 9ba9007..0191af0 100644 (file)
--- a/libgomp/testsuite/libgomp.graphite/force-parallel-7.c
+++ b/libgomp/testsuite/libgomp.graphite/force-parallel-7.c
@@ -1,9 +1,10 @@
 #define N 500
 
+int A[N+5][N+5][N+5];
+
 int foo(void)
 {
   int i, j, k;
-  int A[N+5][N+5][N+5];
 
   /* Loop i: carried no dependency.  */
   for (i = 0; i < N; i++)

diff --git a/libgomp/testsuite/libgomp.graphite/force-parallel-8.c b/libgomp/testsuite/libgomp.graphite/force-parallel-8.c
index 28b9a2a..dc553f5 100644 (file)
--- a/libgomp/testsuite/libgomp.graphite/force-parallel-8.c
+++ b/libgomp/testsuite/libgomp.graphite/force-parallel-8.c
@@ -1,9 +1,10 @@
 #define N 1500
 
+int x[N][N], y[N];
+
 int foo(void)
 {
   int i, j;
-  int x[N][N], y[N];
 
   for (i = 0; i < N; i++)
     {

diff --git a/libgomp/testsuite/libgomp.graphite/force-parallel-9.c b/libgomp/testsuite/libgomp.graphite/force-parallel-9.c
index 3655190..1de43c3 100644 (file)
--- a/libgomp/testsuite/libgomp.graphite/force-parallel-9.c
+++ b/libgomp/testsuite/libgomp.graphite/force-parallel-9.c
@@ -2,12 +2,12 @@ void abort (void);
 
 #define N 500
 
+int Z[2*N+2][2*N+2], B[2*N+2][2*N+2];
+
 void foo(void)
 {
   int i,j;
 
-  int Z[2*N+2][2*N+2], B[2*N+2][2*N+2];
-
   for (i = 0; i < 2*N+2; i++)
     for (j = 0; j < 2*N+2; j++)
       B[i][j] = Z[i][j] = i + j;