This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug target/88402] inefficient code generation for mask from CC
- From: "amonakov at gcc dot gnu.org" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: Fri, 07 Dec 2018 15:33:10 +0000
- Subject: [Bug target/88402] inefficient code generation for mask from CC
- Auto-submitted: auto-generated
- References: <bug-88402-4@http.gcc.gnu.org/bugzilla/>
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=88402
Alexander Monakov <amonakov at gcc dot gnu.org> changed:
What |Removed |Added
----------------------------------------------------------------------------
CC| |amonakov at gcc dot gnu.org
--- Comment #2 from Alexander Monakov <amonakov at gcc dot gnu.org> ---
It's possible to change signed comparison to unsigned by rotating integer
domain by half, i.e.
foo(a, b) == bar(a^0x80000000, b^0x80000000)
but this increases register pressure if a and b are not dead after the
comparison.