1 files changed, 44 insertions, 0 deletions
diff --git a/gcc/testsuite/gcc.dg/graphite/pr35356-2.c b/gcc/testsuite/gcc.dg/graphite/pr35356-2.c
new file mode 100644
index 000000000..66cfdea5a
--- /dev/null
+++ b/gcc/testsuite/gcc.dg/graphite/pr35356-2.c
@@ -0,0 +1,44 @@
+/* { 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" 4 "graphite" } } */
+/* { dg-final { scan-tree-dump-times "MAX_EXPR" 4 "graphite" } } */
+/* { dg-final { cleanup-tree-dump "graphite" } } */