This is the mail archive of the binutils@sources.redhat.com mailing list for the binutils 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]

Re: Slow algorithm used for string merging

From: Stephan Tobies <Stephan dot Tobies at nokia dot com>
To: ext Alan Modra <amodra at bigpond dot net dot au>
Cc: binutils at sources dot redhat dot com, bug-binutils at gnu dot org
Date: Tue, 30 Mar 2004 09:03:10 +0200
Subject: Re: Slow algorithm used for string merging
References: <40690B97.1010303@nokia.com> <1080626489.21612.9.camel@dzur.sfbay.redhat.com> <40690F5C.8070507@nokia.com> <1080627357.21612.11.camel@dzur.sfbay.redhat.com> <20040330063742.GD24725@bubble.modra.org>

ext Alan Modra wrote:

On Mon, Mar 29, 2004 at 10:15:57PM -0800, Eric Christopher wrote:

GNU ld version 2.14 20030612

Might want to try the 2.15 branch.
Definitely, or mainline CVS, or one of HJ Lu's recent releases.
You will find much improved link times.

Yes, _much_ better. Linking time down from ~3000s to ~40s. Still, of course an increase from ~7s when the object files were generated by gcc 2.95.x, but that is now probably more a problem for the gcc folks, who should have an option to declare debug info as non-mergable.

Thanks for pointing me to that version!

BR

Stephan Tobies

References:
- Slow algorithm used for string merging
  - From: Stephan Tobies
- Re: Slow algorithm used for string merging
  - From: Eric Christopher
- Re: Slow algorithm used for string merging
  - From: Stephan Tobies
- Re: Slow algorithm used for string merging
  - From: Eric Christopher
- Re: Slow algorithm used for string merging
  - From: Alan Modra

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