Date: prev next · Thread: first prev next last
2011 Archives by date, by thread · List index


Hi Matus,

On Sat, 2011-08-20 at 23:04 +0200, Matúš Kukan wrote:
I created patch, which allows link-time optimization (--enable-lto)
for shared libraries, you need at least gcc-4.5 (I'm not checking for
version in configure).

        Patch looks great to me :-)

I don't know what should I try to test
if it is really faster and how much.

        Heh ;-) so a 'callgrind' run on startup would be one approach:

export OOO_EXIT_POST_STARTUP=1
export OOO_DISABLE_RECOVERY=1
valgrind --tool=callgrind --simulate-cache=yes --dump-instr=yes ./soffice.bin -writer 
--splash-pipe=0

        And then look at the total number of simulated cycles I guess. On the
other hand it would be perhaps easier, and more interesting to see if
the code is actually smaller ;-) what is the size before and after of
the writer library eg. ? 

Most of the time is running lto1 executable and it eat cca
2GB RAM when optimizing sw library. (cca 4,5 minutes for me)

        :-) Of course, if we can get some real wins with it (particularly
putting more code into one big library), then a bit more link time is a
price well worth paying I think.

        I suspect most of the bigger wins come from getting as much as possible
of the code integrated together into one big, mozilla-style library
but ... :-) lets see.

        Thanks,

                Michael.


-- 
 michael.meeks@novell.com  <><, Pseudo Engineer, itinerant idiot



Context


Privacy Policy | Impressum (Legal Info) | Copyright information: Unless otherwise specified, all text and images on this website are licensed under the Creative Commons Attribution-Share Alike 3.0 License. This does not include the source code of LibreOffice, which is licensed under the Mozilla Public License (MPLv2). "LibreOffice" and "The Document Foundation" are registered trademarks of their corresponding registered owners or are in actual use as trademarks in one or more countries. Their respective logos and icons are also subject to international copyright laws. Use thereof is explained in our trademark policy.