This is the mail archive of the gcc-bugs@gcc.gnu.org mailing list for the GCC project.


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]
Other format: [Raw text]

[Bug tree-optimization/81427] Bad optimization for fibonacci function on PowerPC


https://gcc.gnu.org/bugzilla/show_bug.cgi?id=81427

Segher Boessenkool <segher at gcc dot gnu.org> changed:

           What    |Removed                     |Added
----------------------------------------------------------------------------
                 CC|                            |segher at gcc dot gnu.org

--- Comment #1 from Segher Boessenkool <segher at gcc dot gnu.org> ---
The function is longer, yes, but that is because it is inline into itself
eight times (or doubled once again?)

This is quite aggressive, yes.  But is it actually slower?  Inlining
almost always makes code bigger, but also faster.

You can play with the various inlining --param's to see what would be
a better tradeoff here.

Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]