From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 403 invoked by alias); 10 Aug 2012 09:52:57 -0000 Received: (qmail 390 invoked by uid 22791); 10 Aug 2012 09:52:55 -0000 X-SWARE-Spam-Status: No, hits=-4.3 required=5.0 tests=ALL_TRUSTED,AWL,BAYES_00,KHOP_THREADED X-Spam-Check-By: sourceware.org Received: from localhost (HELO gcc.gnu.org) (127.0.0.1) by sourceware.org (qpsmtpd/0.43rc1) with ESMTP; Fri, 10 Aug 2012 09:52:38 +0000 From: "rguenth at gcc dot gnu.org" To: gcc-bugs@gcc.gnu.org Subject: [Bug middle-end/51233] [ipa-iterations] running multiple passes of early IPA on zlib produces more optimal code Date: Fri, 10 Aug 2012 09:52:00 -0000 X-Bugzilla-Reason: CC X-Bugzilla-Type: changed X-Bugzilla-Watch-Reason: None X-Bugzilla-Product: gcc X-Bugzilla-Component: middle-end X-Bugzilla-Keywords: lto X-Bugzilla-Severity: normal X-Bugzilla-Who: rguenth at gcc dot gnu.org X-Bugzilla-Status: NEW X-Bugzilla-Priority: P3 X-Bugzilla-Assigned-To: unassigned at gcc dot gnu.org X-Bugzilla-Target-Milestone: --- X-Bugzilla-Changed-Fields: Keywords Status Last reconfirmed Ever Confirmed Message-ID: In-Reply-To: References: X-Bugzilla-URL: http://gcc.gnu.org/bugzilla/ Auto-Submitted: auto-generated Content-Type: text/plain; charset="UTF-8" MIME-Version: 1.0 Mailing-List: contact gcc-bugs-help@gcc.gnu.org; run by ezmlm Precedence: bulk List-Id: List-Archive: List-Post: List-Help: Sender: gcc-bugs-owner@gcc.gnu.org X-SW-Source: 2012-08/txt/msg00568.txt.bz2 http://gcc.gnu.org/bugzilla/show_bug.cgi?id=51233 Richard Guenther changed: What |Removed |Added ---------------------------------------------------------------------------- Keywords| |lto Status|UNCONFIRMED |NEW Last reconfirmed| |2012-08-10 Ever Confirmed|0 |1 --- Comment #1 from Richard Guenther 2012-08-10 09:52:37 UTC --- We've discussed the possibility of iterating the LTO WPA phase by outputting LTO bytecode from the LTRANS phase (at some point before expansion, likely even before loop optimizations). That would be the way to go here I think, apart from the idea that popped up how to do better for early optimization of cycles in the cgraph.