Re: problems with gdb

[Tom Tromey <tromey at cygnus dot com>]

>>>>> ">" == Srikanth  <srikanth@cup.hp.com> writes:

>> 	The difficulty here is that a name lookup could be
>> based on either a  demangled name or a mangled name. So unless we
>> sort the table by both we will have to do linear search. Sorting
>> the table by both involves heavy penalty at startup, as that
>> entail three sorts with different keys (PC, demangled name and
>> mangled name). We eliminated one of the keys : the demangled name
>> and do a double sort. 

By eliminating this key don't you eliminate a valuable gdb feature?

Anyway, you can avoid the sort penalty by using a hash table instead.
You construct the hash table as you read the symbols.  (That's what my
patch does, as I recall.)

Tom