https://gcc.gnu.org/bugzilla/show_bug.cgi?id=68008
--- Comment #4 from Andrew Pinski ---
*** Bug 90567 has been marked as a duplicate of this bug. ***
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=68008
Andrew Pinski changed:
What|Removed |Added
CC||msmaldi at hotmail dot com
--- Comment #
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=68008
Andrew Pinski changed:
What|Removed |Added
Keywords||missed-optimization
Severity|n
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=68008
--- Comment #2 from Andrew Pinski ---
Basically recursive inlining is faster than sibling calls optimization.
Interesting.
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=68008
--- Comment #1 from Marc Glisse ---
Probably not related, but at -O2, I notice that sccp produces the
"interesting":
_3 = n_4(D) + -2;
_12 = (unsigned int) n_4(D);
_10 = _12 + 4294967294;
_2 = _10 / 2;
_11 = (int) _2;
_9 = _11 * -2;
