|dynamic optimisation firstname.lastname@example.org (Liam Quin) (1989-11-09)|
|Re: dynamic optimisation email@example.com (1989-11-13)|
|From:||Liam Quin <firstname.lastname@example.org>|
|Date:||Thu, 9 Nov 89 18:02:04 EST|
Do you know of any compilers that will optimise a program (when compiling it)
taking into account data produced by profiling in some way actual runs?
Clearly such data is a best a set of hints -- one could not simply eliminate
all those sections of code which were not called, for example.
On the other hand, the choice of which variables to put in a register,
or which half of an expression to try first, can make a big difference.
Similarly, expanding a function inline that is called very often might be
an unexpectedly big win, even if it's quite large.
So, which compilers (particularly under the Unix operating system) which
exhibit this behaviour? Would it be worth adding to Gnu cc?
Liam R. Quin, Unixsys (UK) Ltd.
email@example.com (whilst visiting Toronto for a few weeks)
firstname.lastname@example.org (after Christmas, when I return to England)
Return to the
Search the comp.compilers archives again.