[Bug target/88402] inefficient code generation for mask from CC

2021-12-21 Thread pinskia at gcc dot gnu.org via Gcc-bugs
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=88402 Andrew Pinski changed: What|Removed |Added Ever confirmed|0 |1 Last reconfirmed|

[Bug target/88402] inefficient code generation for mask from CC

2018-12-09 Thread amonakov at gcc dot gnu.org
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=88402 --- Comment #4 from Alexander Monakov --- (In reply to Alexander Monakov from comment #3) > But unfortunately today we don't manage to use the cmp-sbb trick for > unsigned comparison against an immediate, i.e. for > > unsigned long baz

[Bug target/88402] inefficient code generation for mask from CC

2018-12-07 Thread amonakov at gcc dot gnu.org
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=88402 --- Comment #3 from Alexander Monakov --- However, this may be worthwhile when one of operands is an immediate, as in that case there's no register pressure increase, and the xor just mutates the immediate. Essentially, we'd change e.g.

[Bug target/88402] inefficient code generation for mask from CC

2018-12-07 Thread amonakov at gcc dot gnu.org
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=88402 Alexander Monakov changed: What|Removed |Added CC||amonakov at gcc dot gnu.org ---

[Bug target/88402] inefficient code generation for mask from CC

2018-12-07 Thread jakub at gcc dot gnu.org
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=88402 Jakub Jelinek changed: What|Removed |Added CC||jakub at gcc dot gnu.org --- Comment #1