public inbox for gcc-bugs@sourceware.org
help / color / mirror / Atom feed
* [Bug middle-end/49189] New: [4.7 regression] infinite recursion in constant folder
@ 2011-05-27 10:57 ebotcazou at gcc dot gnu.org
  2011-05-27 10:59 ` [Bug middle-end/49189] " ebotcazou at gcc dot gnu.org
                   ` (6 more replies)
  0 siblings, 7 replies; 8+ messages in thread
From: ebotcazou at gcc dot gnu.org @ 2011-05-27 10:57 UTC (permalink / raw)
  To: gcc-bugs

http://gcc.gnu.org/bugzilla/show_bug.cgi?id=49189

           Summary: [4.7 regression] infinite recursion in constant folder
           Product: gcc
           Version: 4.7.0
            Status: UNCONFIRMED
          Severity: normal
          Priority: P3
         Component: middle-end
        AssignedTo: unassigned@gcc.gnu.org
        ReportedBy: ebotcazou@gcc.gnu.org
                CC: rguenther@suse.de


The patch

2011-05-26  Richard Guenther  <rguenther@suse.de>

    * fold-const.c (fold_unary_loc): Remove bogus code.

has introduced an infinite recursion in the constant folder for the Ada
testcase about to be attached.  No change after the fix for PR
middle-end/49177.


^ permalink raw reply	[flat|nested] 8+ messages in thread

end of thread, other threads:[~2011-05-27 13:32 UTC | newest]

Thread overview: 8+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2011-05-27 10:57 [Bug middle-end/49189] New: [4.7 regression] infinite recursion in constant folder ebotcazou at gcc dot gnu.org
2011-05-27 10:59 ` [Bug middle-end/49189] " ebotcazou at gcc dot gnu.org
2011-05-27 11:13 ` rguenth at gcc dot gnu.org
2011-05-27 11:22 ` rguenth at gcc dot gnu.org
2011-05-27 11:59 ` rguenth at gcc dot gnu.org
2011-05-27 13:15 ` rguenth at gcc dot gnu.org
2011-05-27 13:16 ` rguenth at gcc dot gnu.org
2011-05-27 13:39 ` wschmidt at gcc dot gnu.org

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for read-only IMAP folder(s) and NNTP newsgroup(s).