This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug target/53639] x86_64: redundant 64-bit operations on 32-bit integers
- From: "jakub at gcc dot gnu.org" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: Tue, 12 Jun 2012 10:41:18 +0000
- Subject: [Bug target/53639] x86_64: redundant 64-bit operations on 32-bit integers
- Auto-submitted: auto-generated
- References: <bug-53639-4@http.gcc.gnu.org/bugzilla/>
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=53639
Jakub Jelinek <jakub at gcc dot gnu.org> changed:
What |Removed |Added
----------------------------------------------------------------------------
Attachment #27606|0 |1
is obsolete| |
--- Comment #2 from Jakub Jelinek <jakub at gcc dot gnu.org> 2012-06-12 10:41:18 UTC ---
Created attachment 27608
--> http://gcc.gnu.org/bugzilla/attachment.cgi?id=27608
gcc48-pr53639.patch
Unfortunately that patch regressed pr49095.c testcase. So, either we limit the
splitter to the paradoxical subreg that is created by the combiner when seeing
SImode and followed by zero_extend to DImode of the result (done in this
patch), or we'd need to add new peepholes for the a = mem; a &= const; mem = a;
if (a)
cases where a &= const has been transformed into andsi_1_zext. Uros, any
preference?