This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug tree-optimization/40760] [4.3/4.4/4.5 Regression] unbounded recursion in the gimplifier
- From: "aldyh at gcc dot gnu dot org" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 22 Dec 2009 14:56:53 -0000
- Subject: [Bug tree-optimization/40760] [4.3/4.4/4.5 Regression] unbounded recursion in the gimplifier
- References: <bug-40760-7849@http.gcc.gnu.org/bugzilla/>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- Comment #2 from aldyh at gcc dot gnu dot org 2009-12-22 14:56 -------
The problem here is a recursive call to gimplify_stmt in gimplify_cond_expr
with the true/false statements. This would only happen on thousands of nested
ifs.
Should this really be a P2? Can't we change this to a won't fix?
I can't see this happening in real code.
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=40760