This is the mail archive of the binutils@sourceware.org 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] |
On Sat, Mar 6, 2010 at 1:53 PM, Sriraman Tallam<tmsriram@google.com> wrote:That sounds like a pretty severe hack. You can just use an stl map<filename, position in order file> instead of the vector to achieve a similar effect.
Hi Taras,I do not know what I was drinking when I wrote this as this does not
On Fri, Mar 5, 2010 at 3:11 PM, Taras Glek<tglek@mozilla.com> wrote:
On 03/02/2010 06:43 PM, Sriraman Tallam wrote:
Hi Ian,
I finally got around to making the changes you specified. Please
take a look when you get a chance.
Hi Sriraman, Ian pointed me at your patch when he realized I was trying to do the same thing with linker scripts. This is a big improvement over hacking linker scripts in terms of usability.
I had two issues with the patch: a) It would be nice to specify the sections by symbol names alone. So instead of bss.globalvar one could say "globalvar". Ian pointed out that I solve this with a *.globalvar regexp since you use fnmatch(). Which lead me to my next problem. b) This patch appears to have N^2 behavior since you are doing fnmatch() through the entire input_section_order list.
My link time for a large mozilla binary went from under 3s to over 10minutes
when I specified the order(24K entries).
This was the thing that bothered me a lot when I was writing this patch. I just did not think somebody would face it this soon. I was thinking about how I could incorporate some kind of binary search.
I think adding a second argument to -section-ordering-file could help. TheMaybe for symbol and section, I could provide a binary search option
second argument could be -section-ordering-match=<symbol|section|regexp>
where symbol/section could use a more efficient search.
if you could pass the symbol and section names in sorted order. That
would bring it down to NlogN. Did you have anything else in mind ?
make much sense. You obviously cannot sort the section names in the
input file as the order is fixed. However, I thought about this a
little bit more. If you can provide the integer index of the position
next to the symbol name in the input file then you can sort the names
in the input file. A binary search is then possible. Thoughts ?
Index Nav: | [Date Index] [Subject Index] [Author Index] [Thread Index] | |
---|---|---|
Message Nav: | [Date Prev] [Date Next] | [Thread Prev] [Thread Next] |