[Bug tree-optimization/98236] x plus/minus y cmp 0 produces unoptimal code

2020-12-11 Thread rguenth at gcc dot gnu.org via Gcc-bugs
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=98236 --- Comment #2 from Richard Biener --- This is likely because we expand from int bar (int x, int y) { int _6; [local count: 1073741824]: if (x_2(D) != y_3(D)) goto ; [48.88%] else goto ; [51.12%] [local count: 524845000]:

[Bug tree-optimization/98236] x plus/minus y cmp 0 produces unoptimal code

2020-12-11 Thread denis.campredon at gmail dot com via Gcc-bugs
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=98236 --- Comment #1 from denis.campredon at gmail dot com --- Created attachment 49734 --> https://gcc.gnu.org/bugzilla/attachment.cgi?id=49734&action=edit assemble generated