OpenE2K
/
gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

re PR libgomp/51132 (FAIL: libgomp.graphite/force-parallel-[678].c) 

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.

From-SVN: r182050
This commit is contained in:
Jakub Jelinek 2011-12-06 15:32:54 +01:00 committed by Jakub Jelinek
parent f748cd6bb4
commit 5de62d003b
7 changed files with 24 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
libgomp/ChangeLog
View File

@ -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.

3
libgomp/testsuite/libgomp.graphite/force-parallel-1.c
View File

@ -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;

4
libgomp/testsuite/libgomp.graphite/force-parallel-3.c
View File

@ -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;

5
libgomp/testsuite/libgomp.graphite/force-parallel-6.c
View File

@ -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++)
{

3
libgomp/testsuite/libgomp.graphite/force-parallel-7.c
View File

@ -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++)

3
libgomp/testsuite/libgomp.graphite/force-parallel-8.c
View File

@ -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++)
{

4
libgomp/testsuite/libgomp.graphite/force-parallel-9.c
View File

@ -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;