https://gcc.gnu.org/bugzilla/show_bug.cgi?id=112398
Jeffrey A. Law changed:
What|Removed |Added
Status|NEW |RESOLVED
Resolution|---
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=112398
--- Comment #10 from GCC Commits ---
The master branch has been updated by Jeff Law :
https://gcc.gnu.org/g:e4c1b3d45a33cfb9d76be11c362f81aa77e29882
commit r15-5836-ge4c1b3d45a33cfb9d76be11c362f81aa77e29882
Author: Alexey Merzlyakov
Date: S
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=112398
Rainer Orth changed:
What|Removed |Added
CC||ro at gcc dot gnu.org
--- Comment #9 from
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=112398
--- Comment #8 from Jeffrey A. Law ---
So Alexey's patch helps the first case, generating the more efficient lbu+xori
sequence.
I suspect it's not helping the 2nd case because the constant is going to be out
of range. Given the 2nd case also s
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=112398
--- Comment #7 from GCC Commits ---
The master branch has been updated by Jeff Law :
https://gcc.gnu.org/g:69bd93c167fefbdff0cb88614275358b7a2b2941
commit r15-4991-g69bd93c167fefbdff0cb88614275358b7a2b2941
Author: Alexey Merzlyakov
Date: We
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=112398
Alexey Merzlyakov changed:
What|Removed |Added
CC||alexey.merzlyakov at samsung
dot c
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=112398
--- Comment #5 from Jeffrey A. Law ---
I don't think we need to do any significant bit tracking to optimize the
original neg8 test. I think we can be handled entirely within the simplify-rtx
framework.I've got a junior engineer that's going
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=112398
Jeffrey A. Law changed:
What|Removed |Added
Last reconfirmed|2023-11-05 00:00:00 |2024-01-13
Status|UNCONFIR
