This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug tree-optimization/45685] [4.6 Regression] missed conditional move opportunity in loop
- From: "law at redhat dot com" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: Mon, 24 Jan 2011 16:56:28 +0000
- Subject: [Bug tree-optimization/45685] [4.6 Regression] missed conditional move opportunity in loop
- Auto-submitted: auto-generated
- References: <bug-45685-4@http.gcc.gnu.org/bugzilla/>
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=45685
Jeffrey A. Law <law at redhat dot com> changed:
What |Removed |Added
----------------------------------------------------------------------------
CC| |law at redhat dot com
--- Comment #15 from Jeffrey A. Law <law at redhat dot com> 2011-01-24 16:56:02 UTC ---
Alternately, we could have phi-opts clean this up. ISTM it's not that complex
to determine if two PHI nodes have closely related values such as negation,
trivial conversions, etc.
While this kind of optimization doesn't directly result in a performance
improvement, it may make it easier for later opts to improve the code. This
would help codesize as we'd be replacing a pair of constant loads with a
negation, trivial type conversion, etc.