From 554fd8c5195424bdbcabf5de30fdc183aba391bd Mon Sep 17 00:00:00 2001
From: upstream source tree <ports@midipix.org>
Date: Sun, 15 Mar 2015 20:14:05 -0400
Subject: obtained gcc-4.6.4.tar.bz2 from upstream website; verified
 gcc-4.6.4.tar.bz2.sig; imported gcc-4.6.4 source tree from verified upstream
 tarball.

downloading a git-generated archive based on the 'upstream' tag
should provide you with a source tree that is binary identical
to the one extracted from the above tarball.

if you have obtained the source via the command 'git clone',
however, do note that line-endings of files in your working
directory might differ from line-endings of the respective
files in the upstream repository.
---
 gcc/testsuite/gcc.dg/tree-ssa/loop-25.c | 129 ++++++++++++++++++++++++++++++++
 1 file changed, 129 insertions(+)
 create mode 100644 gcc/testsuite/gcc.dg/tree-ssa/loop-25.c

(limited to 'gcc/testsuite/gcc.dg/tree-ssa/loop-25.c')

diff --git a/gcc/testsuite/gcc.dg/tree-ssa/loop-25.c b/gcc/testsuite/gcc.dg/tree-ssa/loop-25.c
new file mode 100644
index 000000000..479ed81d9
--- /dev/null
+++ b/gcc/testsuite/gcc.dg/tree-ssa/loop-25.c
@@ -0,0 +1,129 @@
+/* { dg-do compile } */
+/* { dg-options "-O1 -fdump-tree-profile" } */
+
+int foo(void);
+void bla(void);
+void bar(void);
+
+void test1 (void)
+{
+  unsigned i;
+
+  /* Only one loop should be found here.  */
+  i = 0;
+  while (1)
+    {
+      i++;
+      if (i == 100)
+	break;
+
+      if (foo ())
+	bla ();
+      else
+	bar ();
+    }
+}
+
+void test2 (void)
+{
+  unsigned i, j;
+
+  /* Two loops should be found, in this case.  */
+  i = j = 0;
+  while (1)
+    {
+      j++;
+      foo ();
+      if (j < 100)
+	continue;
+
+      i++;
+      j = 0;
+      if (i == 100)
+	break;
+    }
+}
+
+void test3 (void)
+{
+  unsigned i, j, k;
+
+  /* Three loops.  */
+  i = j = k = 0;
+  while (1)
+    {
+      j++;
+      foo ();
+      if (j < 100)
+	continue;
+
+      j = 0;
+      k++;
+      if (k < 100)
+	continue;
+
+      k = 0;
+      i++;
+      if (i == 100)
+	break;
+    }
+}
+
+void test4 (void)
+{
+  unsigned i, j, k;
+
+  /* Two loops with a nested subloop.  */
+  i = j = 0;
+  while (1)
+    {
+      j++;
+      foo ();
+      for (k = 0; k < 100; k++)
+	foo ();
+
+      if (j < 100)
+	continue;
+
+      i++;
+      j = 0;
+      if (i == 100)
+	break;
+    }
+}
+
+
+void test5 (void)
+{
+  unsigned i, j;
+
+  /* Both subloop and non-subloop back edges.  */
+  i = j = 0;
+  while (1)
+    {
+      j++;
+      foo ();
+      if (j < 100)
+	continue;
+      j = 0;
+
+      i++;
+      if (i == 100)
+	break;
+
+      if (foo ())
+	bla ();
+      else
+	bar ();
+    }
+}
+
+/* { dg-final { scan-tree-dump-times "Disambiguating loop" 5 "profile" } } */
+/* For the following xfail marks, see PR35629.  */
+/* { dg-final { scan-tree-dump-times "Found latch edge" 5 "profile" { xfail *-*-* } } } */
+/* { dg-final { scan-tree-dump-times "Merged latch edges" 2 "profile" { xfail *-*-* } } } */
+/* { dg-final { scan-tree-dump-times "4 loops found" 2 "profile" { xfail *-*-* } } } */
+/* { dg-final { scan-tree-dump-times "3 loops found" 2 "profile" { xfail *-*-* } } } */
+/* { dg-final { scan-tree-dump-times "2 loops found" 1 "profile" { xfail *-*-* } } } */
+
+/* { dg-final { cleanup-tree-dump "profile" } } */
-- 
cgit v1.2.3