Revert "Add c-c++-common/goacc/kernels-loop-nest-independent.c"
2015-10-2 Tom de Vries <tom@codesourcery.com>
Revert:
2015-07-15 Tom de Vries <tom@codesourcery.com>
* c-c++-common/goacc/kernels-loop-nest-independent.c: New test.
---
.../goacc/kernels-loop-nest-independent.c | 40 ----------------------
1 file changed, 40 deletions(-)
delete mode 100644 gcc/testsuite/c-c++-common/goacc/kernels-loop-nest-independent.c
deleted file mode 100644
@@ -1,40 +0,0 @@
-/* { dg-additional-options "-O2" } */
-/* { dg-additional-options "-ftree-parallelize-loops=32" } */
-/* { dg-additional-options "-fdump-tree-parloops_oacc_kernels-all" } */
-/* { dg-additional-options "-fdump-tree-optimized" } */
-
-/* Based on autopar/outer-1.c. */
-
-#include <stdlib.h>
-
-#define N 1000
-
-int
-main (void)
-{
- int x[N][N];
-
-#pragma acc kernels copyout (x)
- {
-#pragma acc loop independent
- for (int ii = 0; ii < N; ii++)
- for (int jj = 0; jj < N; jj++)
- x[ii][jj] = ii + jj + 3;
- }
-
- for (int i = 0; i < N; i++)
- for (int j = 0; j < N; j++)
- if (x[i][j] != i + j + 3)
- abort ();
-
- return 0;
-}
-
-/* Check that only one loop is analyzed, and that it can be parallelized. */
-/* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized, marked independent" 1 "parloops_oacc_kernels" } } */
-/* { dg-final { scan-tree-dump-not "FAILED:" "parloops_oacc_kernels" } } */
-
-/* Check that the loop has been split off into a function. */
-/* { dg-final { scan-tree-dump-times "(?n);; Function .*main._omp_fn.0" 1 "optimized" } } */
-
-/* { dg-final { scan-tree-dump-times "(?n)oacc function \\(32," 1 "parloops_oacc_kernels" } } */
--
1.9.1