1 files changed, 0 insertions, 44 deletions
diff --git a/gcc-4.8.1/gcc/testsuite/gcc.dg/graphite/pr35356-2.c b/gcc-4.8.1/gcc/testsuite/gcc.dg/graphite/pr35356-2.c
deleted file mode 100644
index b406d1096..000000000
--- a/gcc-4.8.1/gcc/testsuite/gcc.dg/graphite/pr35356-2.c
+++ /dev/null
@@ -1,44 +0,0 @@
-/* { dg-options "-O2 -fgraphite-identity -fdump-tree-graphite-all" } */
-
-int a[100];
-
-int
-foo (int bar, int n, int k)
-{
-  int i;
-
-  for (i = 0; i < n; i++)
-    if (i == k)
-      a[i] = 1;
-    else 
-      a[i] = i;
-
-  return a[bar];
-}
-
-/* We should generate the following:
-
-   | for (i = 0; i < min (n, k); i++)
-   |   a[i] = i;
-   | if (k >= 0 && k < n)
-   |   a[k] = 1;
-   | for (i = max(k+1,0); i < n; i++)
-   |   a[i] = i;
-
-   XXX: At the moment we generate to protect loops that are executed zero times.
-
-   | if (0 < min (n, k) + 1)
-   |   for (i = 0; i < min (n, k); i++)
-   |     a[i] = i;
-   | if (k >= 0 && k < n)
-   |   a[k] = 1;
-   | if (0 < max(n, k) + 1)
-   |   for (i = max(k+1,0); i < n; i++)
-   |     a[i] = i;
-
-*/
-
-
-/* { dg-final { scan-tree-dump-times "MIN_EXPR\[^\\n\\r]*;" 4 "graphite" } } */
-/* { dg-final { scan-tree-dump-times "MAX_EXPR\[^\\n\\r]*;" 4 "graphite" } } */
-/* { dg-final { cleanup-tree-dump "graphite" } } */