This is the mail archive of the
binutils@sourceware.org
mailing list for the binutils project.
Re: Indexed string tables?
Bernd Jendrissek <bernd.jendrissek@gmail.com> writes:
> On Wed, Dec 8, 2010 at 2:05 AM, Ian Lance Taylor <iant@google.com> wrote:
>> I would say that the string tables in bfd/hash.c are sequentially
>> indexed. ÂThe hash table is there so that duplicate strings are only
>> entered once. ÂWhat do you want to do for duplicate strings? ÂEnter them
>> into the string table more than once?
>
> Yes, OMF string tables are more like lists than like sets. I don't
> think OMF has anything in principle against duplicate strings - it's
> the ID that counts.
Thanks for the explanation.
I'm not sure it's worth building a general data structure for this
because I think it's quite unlikely that anything else would work that
way. But I don't really care very much.
Ian