From: Richard Biener <rguenther@suse.de>
Date: Mon, 26 Jun 2017 10:33:12 +0000 (+0000)
Subject: re PR tree-optimization/81203 (tail recursion: internal compiler error: verify_ssa... 
X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=75f0112f1bb9b671ff4679ec6802bf1cee6696c0;p=gcc.git

re PR tree-optimization/81203 (tail recursion: internal compiler error: verify_ssa failed)

2017-06-26  Richard Biener  <rguenther@suse.de>

	PR tree-optimization/81203
	* tree-tailcall.c (find_tail_calls): Do not move stmts into
	non-dominating BBs.

	* gcc.dg/torture/pr81203.c: New testcase.

From-SVN: r249644
---

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 41d5f57a78b..27ed3f9f04e 100644
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,9 @@
+2017-06-26  Richard Biener  <rguenther@suse.de>
+
+	PR tree-optimization/81203
+	* tree-tailcall.c (find_tail_calls): Do not move stmts into
+	non-dominating BBs.
+
 2017-06-26  Marek Polacek  <polacek@redhat.com>
 
 	PR c/80116
diff --git a/gcc/testsuite/ChangeLog b/gcc/testsuite/ChangeLog
index 0a5b8a823a7..9f9c123fdcc 100644
--- a/gcc/testsuite/ChangeLog
+++ b/gcc/testsuite/ChangeLog
@@ -1,3 +1,8 @@
+2017-06-26  Richard Biener  <rguenther@suse.de>
+
+	PR tree-optimization/81203
+	* gcc.dg/torture/pr81203.c: New testcase.
+
 2017-06-26  Marek Polacek  <polacek@redhat.com>
 
 	PR c/80116
diff --git a/gcc/testsuite/gcc.dg/torture/pr81203.c b/gcc/testsuite/gcc.dg/torture/pr81203.c
new file mode 100644
index 00000000000..5c9eaf569e7
--- /dev/null
+++ b/gcc/testsuite/gcc.dg/torture/pr81203.c
@@ -0,0 +1,10 @@
+/* { dg-do compile } */
+
+int a;
+int b()
+{
+  int c, d;
+  if (a)
+    d = b();
+  return 1 + c + d;
+}
diff --git a/gcc/tree-tailcall.c b/gcc/tree-tailcall.c
index 6aa9a56462e..e0497e596bb 100644
--- a/gcc/tree-tailcall.c
+++ b/gcc/tree-tailcall.c
@@ -573,6 +573,11 @@ find_tail_calls (basic_block bb, struct tailcall **ret)
 	{
 	  if (! tail_recursion)
 	    return;
+	  /* Do not deal with checking dominance, the real fix is to
+	     do path isolation for the transform phase anyway, removing
+	     the need to compute the accumulators with new stmts.  */
+	  if (abb != bb)
+	    return;
 	  for (unsigned opno = 1; opno < gimple_num_ops (stmt); ++opno)
 	    {
 	      tree op = gimple_op (stmt, opno);