This is the mail archive of the
gdb-patches@sources.redhat.com
mailing list for the GDB project.
Re: [RFA] delete BLOCK_SHOULD_SORT
- From: David Carlton <carlton at math dot stanford dot edu>
- To: Hilfinger at otisco dot mckusick dot com
- Cc: gdb-patches at sources dot redhat dot com, aidan at velvet dot net, jimb at redhat dot com, ezannoni at redhat dot com
- Date: 19 Sep 2002 09:28:22 -0700
- Subject: Re: [RFA] delete BLOCK_SHOULD_SORT
- References: <ro1u1knrlkj.fsf@jackfruit.Stanford.EDU><200209190804.BAA27599@otisco.McKusick.COM>
On Thu, 19 Sep 2002 01:04:10 -0700, "Paul N. Hilfinger" <hilfingr@otisco.mckusick.com> said:
> OK; let me explain what Ada is up to in the various places it does
> symbol lookup, and you can decide if we (ahem) need a conversation
> on this (vis-a-vis this thread or the other "dictionary" threads),
> or if our needs introduce no new requirements.
...
> The second pattern, however, can benefit for sorted blocks in an
> obvious way--- hence the ada-lang.c code you mentioned in an earlier
> message---but doesn't need them. That is, we take advantage of
> BLOCK_SHOULD_SORT when possible. I don't have measurements of the
> impact of not having it.
I see; thanks for the explanation. Then I agree with Daniel: it
should probably be converted to search_symbols, and removing
BLOCK_SHOULD_SORT won't hurt you: the performance gains that you had
been getting were already lost in the earlier conversion from sorted
lists to hashtables, unless the debugging info happens to be in ECOFF
format. So the only question is whether or not I slipped up when
converting those loops to ALL_BLOCK_SYMBOLS.
David Carlton
carlton@math.stanford.edu