https://gcc.gnu.org/bugzilla/show_bug.cgi?id=85143
Andrew Pinski changed:
What|Removed |Added
CC||josh.m.conner at gmail dot com
--- Comme
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=85143
--- Comment #7 from Marc Glisse ---
Note that the patch still doesn't handle
_1 = n_15(D) <= i_46;
_2 = i_46 > 1336;
_3 = _1 | _2;
because of the mix between strict and large inequalities.
(if I write int m = 1337; and replace i < 1337 w
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=85143
--- Comment #6 from Marc Glisse ---
Author: glisse
Date: Tue May 1 21:41:05 2018
New Revision: 259812
URL: https://gcc.gnu.org/viewcvs?rev=259812&root=gcc&view=rev
Log:
Generalize a a
PR tree-optimization/85143
gcc/
* match.pd
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=85143
--- Comment #5 from Marc Glisse ---
The test becomes
_1 = n_15(D) <= i_46;
_2 = i_46 > 1336;
_3 = _1 | _2;
However, in match.pd, we only handle the AND case. The corresponding IOR
transformation should be handled similarly.
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=85143
Andrew Pinski changed:
What|Removed |Added
Status|UNCONFIRMED |NEW
Last reconfirmed|
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=85143
--- Comment #3 from Andrew Pinski ---
(In reply to robertw89 from comment #2)
> This change would be trivial.
I did not mean for you to change your code. I meant gcc could do this
transformation.
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=85143
--- Comment #2 from robertw89 at googlemail dot com ---
This change would be trivial.
To defend my case and rant a bit ;) ...
Indeed, but programmers can manually unroll a loop too ;) . What if the code is
autogenerated? What if the constant com
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=85143
Andrew Pinski changed:
What|Removed |Added
Keywords||missed-optimization
--- Comment #1 from
