graphite_autopar: Move to libgomp testsuite.

gcc/testsuite/
        * gcc.dg/graphite/graphite_autopar: Move to libgomp testsuite.

libgomp/
        * testsuite/libgomp.graphite: Move from gcc.dg/graphite.
        * testsuite/libgomp.graphite/graphite_autopar.exp: Delete.
        * testsuite/libgomp.graphite/graphite.exp: New.

From-SVN: r150755

11 files changed, 4 insertions, 411 deletions

diff --git a/gcc/testsuite/ChangeLog b/gcc/testsuite/ChangeLog
index e6864f5..ab3876d 100644
--- a/gcc/testsuite/ChangeLog
+++ b/gcc/testsuite/ChangeLog
@@ -1,3 +1,7 @@
+2009-08-14  David Edelsohn  <edelsohn@gnu.org>
+
+	* gcc.dg/graphite/graphite_autopar: Move to libgomp testsuite.
+
 2009-08-14  Paolo Bonzini  <bonzini@gnu.org>
 
 	PR target/40934
diff --git a/gcc/testsuite/gcc.dg/graphite/graphite_autopar/force-parallel-1.c b/gcc/testsuite/gcc.dg/graphite/graphite_autopar/force-parallel-1.c
deleted file mode 100644
index 7f043d8..0000000
--- a/gcc/testsuite/gcc.dg/graphite/graphite_autopar/force-parallel-1.c
+++ /dev/null
@@ -1,30 +0,0 @@
-void abort (void);
-
-void parloop (int N)
-{
-  int i;
-  int x[10000000];
-
-  for (i = 0; i < N; i++)
-    x[i] = i + 3;
-
-  for (i = 0; i < N; i++)
-    {
-      if (x[i] != i + 3)
-	abort ();
-    }
-}
-
-int main(void)
-{
-  parloop(10000000);
-
-  return 0;
-}
-
-/* Check that parallel code generation part make the right answer.  */
-/* { dg-final { scan-tree-dump-times "1 loops carried no dependency" 2 "graphite" } } */
-/* { dg-final { cleanup-tree-dump "graphite" } } */
-/* { dg-final { scan-tree-dump-times "loopfn" 5 "optimized" } } */
-/* { dg-final { cleanup-tree-dump "parloops" } } */
-/* { dg-final { cleanup-tree-dump "optimized" } } */
diff --git a/gcc/testsuite/gcc.dg/graphite/graphite_autopar/force-parallel-2.c b/gcc/testsuite/gcc.dg/graphite/graphite_autopar/force-parallel-2.c
deleted file mode 100644
index a198fed..0000000
--- a/gcc/testsuite/gcc.dg/graphite/graphite_autopar/force-parallel-2.c
+++ /dev/null
@@ -1,30 +0,0 @@
-void abort (void);
-
-void parloop (int N)
-{
-  int i, j;
-  int x[10000][10000];
-
-  for (i = 0; i < N; i++)
-    for (j = 0; j < N; j++)
-      x[i][j] = i + j + 3;
-
-  for (i = 0; i < N; i++)
-    for (j = 0; j < N; j++)
-      if (x[i][j] != i + j + 3)
-	abort ();
-}
-
-int main(void)
-{
-  parloop(10000);
-
-  return 0;
-}
-
-/* Check that parallel code generation part make the right answer.  */
-/* { dg-final { scan-tree-dump-times "2 loops carried no dependency" 1 "graphite" } } */
-/* { dg-final { cleanup-tree-dump "graphite" } } */
-/* { dg-final { scan-tree-dump-times "loopfn" 5 "optimized" } } */
-/* { dg-final { cleanup-tree-dump "parloops" } } */
-/* { dg-final { cleanup-tree-dump "optimized" } } */
diff --git a/gcc/testsuite/gcc.dg/graphite/graphite_autopar/force-parallel-3.c b/gcc/testsuite/gcc.dg/graphite/graphite_autopar/force-parallel-3.c
deleted file mode 100644
index 81b356d..0000000
--- a/gcc/testsuite/gcc.dg/graphite/graphite_autopar/force-parallel-3.c
+++ /dev/null
@@ -1,38 +0,0 @@
-void abort (void);
-
-#define N 500
-
-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;
-
-  for (i = 0; i <= N; i++)
-    for (j = 0; j <= N; j++)
-      Z[i][j] = Z[j+N][i+N+1];
-
-  for (i = 0; i <= N; i++)
-    for (j = 0; j <=N; j++)
-      if (Z[i][j] != B[j+N][i+N+1])
-	abort();
-}
-
-int main(void)
-{
-  foo();
-
-  return 0;
-}
-
-/* Check that parallel code generation part make the right answer.  */
-/* { dg-final { scan-tree-dump-times "4 loops carried no dependency" 1 "graphite" } } */
-/* { dg-final { cleanup-tree-dump "graphite" } } */
-/* { dg-final { scan-tree-dump-times "loopfn.0" 5 "optimized" } } */
-/* { dg-final { scan-tree-dump-times "loopfn.1" 5 "optimized" } } */
-/* { dg-final { cleanup-tree-dump "parloops" } } */
-/* { dg-final { cleanup-tree-dump "optimized" } } */
diff --git a/gcc/testsuite/gcc.dg/graphite/graphite_autopar/force-parallel-4.c b/gcc/testsuite/gcc.dg/graphite/graphite_autopar/force-parallel-4.c
deleted file mode 100644
index c0c6b1c..0000000
--- a/gcc/testsuite/gcc.dg/graphite/graphite_autopar/force-parallel-4.c
+++ /dev/null
@@ -1,55 +0,0 @@
-/* Autopar with IF conditions.  */
-
-void abort();
-
-#define N 10000
-#define T 1000
-
-void foo(void)
-{
-  int i;
-  int A[2*N], B[2*N];
-
-  /* Initialize array: carried no dependency.  */
-  for (i = 0; i < 2*N; i++)
-    B[i] = A[i] = i;
-
-  for (i = 0; i < N; i++)
-    {
-      if (i < T)
-	/* loop i1: carried no dependency.  */
-	A[i] = A[i+T];
-      else
-	/* loop i2: carried dependency.  */
-	A[i] = A[i+T+1];
-    }
-
-  /* If it runs a wrong answer, abort.  */
-  for (i = 0; i < N; i++)
-    {
-      if (i < T)
-	{
-	  if (A[i] != B[i+T])
-	    abort();
-	}
-      else
-	{
-	  if (A[i] != B[i+T+1])
-	    abort();
-	}
-    }
-}
-
-int main(void)
-{
-  foo();
-  return 0;
-}
-
-/* Check that parallel code generation part make the right answer.  */
-/* { dg-final { scan-tree-dump-times "2 loops carried no dependency" 1 "graphite" } } */
-/* { dg-final { cleanup-tree-dump "graphite" } } */
-/* { dg-final { scan-tree-dump-times "loopfn.0" 5 "optimized" } } */
-/* { dg-final { scan-tree-dump-times "loopfn.1" 5 "optimized" } } */
-/* { dg-final { cleanup-tree-dump "parloops" } } */
-/* { dg-final { cleanup-tree-dump "optimized" } } */
diff --git a/gcc/testsuite/gcc.dg/graphite/graphite_autopar/force-parallel-5.c b/gcc/testsuite/gcc.dg/graphite/graphite_autopar/force-parallel-5.c
deleted file mode 100644
index e5392b1..0000000
--- a/gcc/testsuite/gcc.dg/graphite/graphite_autopar/force-parallel-5.c
+++ /dev/null
@@ -1,39 +0,0 @@
-/* Triangle loops.  */
-void abort (void);
-
-#define N 500
-
-void foo(void)
-{
-  int i,j;
-  int A[3*N], B[3*N];
-
-  for (i = 0; i < 3*N; i++)
-    B[i] = A[i] = i;
-
-  for (i = 1; i < N; i++)
-    for (j = 1; j < i; j++)
-      /* This loop carried no dependency, it fails
-	 at code generation part.*/
-      A[j+N] = A[j] + j;
-
-  for (i = 1; i < N; i++)
-    for (j = 1; j < i; j++)
-      if (A[j+N] != B[j] + j)
-	abort();
-}
-
-int main(void)
-{
-  foo();
-
-  return 0;
-}
-
-/* Check that parallel code generation part make the right answer.  */
-/* { dg-final { scan-tree-dump-times "2 loops carried no dependency" 1 "graphite" } } */
-/* { dg-final { cleanup-tree-dump "graphite" } } */
-/* { dg-final { scan-tree-dump-times "loopfn.0" 5 "optimized" } } */
-/* { dg-final { scan-tree-dump-times "loopfn.1" 5 "optimized" { xfail *-*-* } } } */
-/* { dg-final { cleanup-tree-dump "parloops" } } */
-/* { dg-final { cleanup-tree-dump "optimized" } } */
diff --git a/gcc/testsuite/gcc.dg/graphite/graphite_autopar/force-parallel-6.c b/gcc/testsuite/gcc.dg/graphite/graphite_autopar/force-parallel-6.c
deleted file mode 100644
index e961fc0..0000000
--- a/gcc/testsuite/gcc.dg/graphite/graphite_autopar/force-parallel-6.c
+++ /dev/null
@@ -1,38 +0,0 @@
-#define N 500
-
-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++)
-    {
-      X[i] = Y[i] + 10;
-      for (j = 1; j <= N; j++)
-	{
-	  B[j] = A[j][N];
-	  for (k = 1; k <= N; k++)
-	    {
-	      A[j+1][k] = B[j] + C[j][k];
-	    }
-	  Y[i+j] = A[j+1][N];
-	}
-    }
-
-  return A[1][5]*B[6];
-}
-
-int main(void)
-{
-  foo();
-
-  return 0;
-}
-
-/* Check that parallel code generation part make the right answer.  */
-/* { dg-final { scan-tree-dump-times "1 loops carried no dependency" 2 "graphite" } } */
-/* { dg-final { cleanup-tree-dump "graphite" } } */
-/* { dg-final { scan-tree-dump-times "loopfn.0" 5 "optimized" } } */
-/* { dg-final { cleanup-tree-dump "parloops" } } */
-/* { dg-final { cleanup-tree-dump "optimized" } } */
diff --git a/gcc/testsuite/gcc.dg/graphite/graphite_autopar/force-parallel-7.c b/gcc/testsuite/gcc.dg/graphite/graphite_autopar/force-parallel-7.c
deleted file mode 100644
index 9ba9007..0000000
--- a/gcc/testsuite/gcc.dg/graphite/graphite_autopar/force-parallel-7.c
+++ /dev/null
@@ -1,36 +0,0 @@
-#define N 500
-
-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++)
-    for (j = 0; j < N; j++)
-      for (k = 0; k < N; k++)
-	A[k+1][j+2][i+1] = A[k][j][i+1];
-
-  for (i = 0; i < N; i++)
-    /* Loop j: carried no dependency.  */
-    for (j = 0; j < N; j++)
-      /* Loop k: carreid no dependency.  */
-      for (k = 0; k < N; k++)
-	A[i+1][j][k] = A[i][j][k+1];
-
-  return A[1][5][2];
-}
-
-int main(void)
-{
-  foo();
-
-  return 0;
-}
-
-/* Check that parallel code generation part make the right answer.  */
-/* { dg-final { scan-tree-dump-times "3 loops carried no dependency" 1 "graphite" } } */
-/* { dg-final { cleanup-tree-dump "graphite" } } */
-/* { dg-final { scan-tree-dump-times "loopfn.0" 5 "optimized" } } */
-/* { dg-final { cleanup-tree-dump "parloops" } } */
-/* { dg-final { cleanup-tree-dump "optimized" } } */
diff --git a/gcc/testsuite/gcc.dg/graphite/graphite_autopar/force-parallel-8.c b/gcc/testsuite/gcc.dg/graphite/graphite_autopar/force-parallel-8.c
deleted file mode 100644
index 28b9a2a..0000000
--- a/gcc/testsuite/gcc.dg/graphite/graphite_autopar/force-parallel-8.c
+++ /dev/null
@@ -1,40 +0,0 @@
-#define N 1500
-
-int foo(void)
-{
-  int i, j;
-  int x[N][N], y[N];
-
-  for (i = 0; i < N; i++)
-    {
-      y[i] = i;
-
-      for (j = 0; j < N; j++)
-	{
-	  if (j > 500)
-	    {
-	      x[i][j] = i + j + 3;
-	      y[j] = i*j + 10;
-	    }
-	  else
-	    x[i][j] = x[i][j]*3;
-	}
-    }
-
-  return x[2][5]*y[8];
-}
-
-int main(void)
-{
-  foo();
-
-  return 0;
-}
-
-/* Check that parallel code generation part make the right answer.  */
-/* { dg-final { scan-tree-dump-times "2 loops carried no dependency" 1 "graphite" } } */
-/* { dg-final { cleanup-tree-dump "graphite" } } */
-/* { dg-final { scan-tree-dump-times "loopfn.0" 5 "optimized" } } */
-/* { dg-final { scan-tree-dump-times "loopfn.1" 5 "optimized" } } */
-/* { dg-final { cleanup-tree-dump "parloops" } } */
-/* { dg-final { cleanup-tree-dump "optimized" } } */
diff --git a/gcc/testsuite/gcc.dg/graphite/graphite_autopar/force-parallel-9.c b/gcc/testsuite/gcc.dg/graphite/graphite_autopar/force-parallel-9.c
deleted file mode 100644
index 3655190..0000000
--- a/gcc/testsuite/gcc.dg/graphite/graphite_autopar/force-parallel-9.c
+++ /dev/null
@@ -1,37 +0,0 @@
-void abort (void);
-
-#define N 500
-
-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;
-
-  for (i = 0; i <= N; i++)
-    for (j = 0; j <= N; j++)
-      Z[i][j] = Z[j+N][i+N+1];
-
-  for (i = 0; i <= N; i++)
-    for (j = 0; j <=N; j++)
-      if (Z[i][j] != B[j+N][i+N+1])
-	abort();
-}
-
-int main(void)
-{
-  foo();
-  return 0;
-}
-
-/* Check that parallel code generation part make the right answer.  */
-/* { dg-final { scan-tree-dump-times "4 loops carried no dependency" 1 "graphite" } } */
-/* { dg-final { cleanup-tree-dump "graphite" } } */
-/* { dg-final { scan-tree-dump-times "loopfn.0" 5 "optimized" } } */
-/* { dg-final { scan-tree-dump-times "loopfn.1" 5 "optimized" } } */
-/* { dg-final { cleanup-tree-dump "parloops" } } */
-/* { dg-final { cleanup-tree-dump "optimized" } } */
diff --git a/gcc/testsuite/gcc.dg/graphite/graphite_autopar/graphite_autopar.exp b/gcc/testsuite/gcc.dg/graphite/graphite_autopar/graphite_autopar.exp
deleted file mode 100644
index 11d19a8..0000000
--- a/gcc/testsuite/gcc.dg/graphite/graphite_autopar/graphite_autopar.exp
+++ /dev/null
@@ -1,68 +0,0 @@
-#   Copyright (C) 2008 Free Software Foundation, Inc.
-
-# This program is free software; you can redistribute it and/or modify
-# it under the terms of the GNU General Public License as published by
-# the Free Software Foundation; either version 3 of the License, or
-# (at your option) any later version.
-#
-# This program is distributed in the hope that it will be useful,
-# but WITHOUT ANY WARRANTY; without even the implied warranty of
-# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-# GNU General Public License for more details.
-#
-# You should have received a copy of the GNU General Public License
-# along with GCC; see the file COPYING3.  If not see
-# <http://www.gnu.org/licenses/>.
-
-# GCC testsuite that uses the `dg.exp' driver.
-
-# Load support procs.
-load_lib gcc-dg.exp
-
-if ![check_effective_target_pthread] {
-  return
-}
-
-if ![check_effective_target_fgraphite] {
-  return
-}
-
-# Remove VALUE from LIST_VARIABLE.
-proc lremove {list_variable value} {
-    upvar 1 $list_variable var
-    set idx [lsearch -exact $var $value]
-    set var [lreplace $var $idx $idx]
-}
-
-# Set default action for these tests is 'run'.  Save current default.
-global dg-do-what-default
-set save-dg-do-what-default ${dg-do-what-default}
-set dg-do-what-default run
-
-# Initialize `dg'.
-dg-init
-
-# Main loop.
-
-set wait_to_run_files [lsort [glob -nocomplain $srcdir/$subdir/*.c]]
-
-# Flags using for force-parallel-*.c files.
-set DEFAULT_CFLAGS_FORCE_PARALLEL " -ansi -pedantic-errors -O2 \
--ftree-parallelize-loops=4 -floop-parallelize-all \
--fdump-tree-parloops-details -fdump-tree-optimized \
--fno-loop-strip-mine -fdump-tree-graphite-all"
-set force_parallel_files \
-    [lsort [glob -nocomplain $srcdir/$subdir/force-parallel-*.c]]
-dg-runtest $force_parallel_files "" $DEFAULT_CFLAGS_FORCE_PARALLEL
-foreach force_parallel_file $force_parallel_files \
-    {lremove wait_to_run_files $force_parallel_file}
-
-# Flags using for other files.
-set DEFAULT_CFLAGS_GRAPHITE "-ansi -pedantic-errors"
-dg-runtest $wait_to_run_files "" $DEFAULT_CFLAGS_GRAPHITE
-
-# Clean up.
-set dg-do-what-default ${save-dg-do-what-default}
-
-# All done.
-dg-finish