aboutsummaryrefslogtreecommitdiffstats
path: root/gcc-4.9/gcc/testsuite/gcc.dg/tree-ssa/loop-25.c
diff options
context:
space:
mode:
authorBen Cheng <bccheng@google.com>2014-03-25 22:37:19 -0700
committerBen Cheng <bccheng@google.com>2014-03-25 22:37:19 -0700
commit1bc5aee63eb72b341f506ad058502cd0361f0d10 (patch)
treec607e8252f3405424ff15bc2d00aa38dadbb2518 /gcc-4.9/gcc/testsuite/gcc.dg/tree-ssa/loop-25.c
parent283a0bf58fcf333c58a2a92c3ebbc41fb9eb1fdb (diff)
downloadtoolchain_gcc-1bc5aee63eb72b341f506ad058502cd0361f0d10.tar.gz
toolchain_gcc-1bc5aee63eb72b341f506ad058502cd0361f0d10.tar.bz2
toolchain_gcc-1bc5aee63eb72b341f506ad058502cd0361f0d10.zip
Initial checkin of GCC 4.9.0 from trunk (r208799).
Change-Id: I48a3c08bb98542aa215912a75f03c0890e497dba
Diffstat (limited to 'gcc-4.9/gcc/testsuite/gcc.dg/tree-ssa/loop-25.c')
-rw-r--r--gcc-4.9/gcc/testsuite/gcc.dg/tree-ssa/loop-25.c129
1 files changed, 129 insertions, 0 deletions
diff --git a/gcc-4.9/gcc/testsuite/gcc.dg/tree-ssa/loop-25.c b/gcc-4.9/gcc/testsuite/gcc.dg/tree-ssa/loop-25.c
new file mode 100644
index 000000000..c2fb74e58
--- /dev/null
+++ b/gcc-4.9/gcc/testsuite/gcc.dg/tree-ssa/loop-25.c
@@ -0,0 +1,129 @@
+/* { dg-do compile } */
+/* { dg-options "-O1 -fdump-tree-profile_estimate" } */
+
+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_estimate" } } */
+/* For the following xfail marks, see PR35629. */
+/* { dg-final { scan-tree-dump-times "Found latch edge" 5 "profile_estimate" { xfail *-*-* } } } */
+/* { dg-final { scan-tree-dump-times "Merged latch edges" 2 "profile_estimate" { xfail *-*-* } } } */
+/* { dg-final { scan-tree-dump-times "4 loops found" 2 "profile_estimate" { xfail *-*-* } } } */
+/* { dg-final { scan-tree-dump-times "3 loops found" 2 "profile_estimate" { xfail *-*-* } } } */
+/* { dg-final { scan-tree-dump-times "2 loops found" 1 "profile_estimate" { xfail *-*-* } } } */
+
+/* { dg-final { cleanup-tree-dump "profile_estimate" } } */