[jh@suse.cz: Re: 6 GCC regressions, 2 new, with your patch on 2003-06-24T13:15:02Z.]

[Jan Hubicka]

> On Wed, Jun 25, 2003 at 10:38:08PM +0200, Jan Hubicka wrote:
> > To avoid it we would have to hash the strings themselves that is slow.
> 
> How slow?  Can you quantify the slowdown?  

Not sure, for C++ the identifiers are pretty large and computing hash
value from the identifier can get pretty costy (in the case we won't go
for something simple like size*first+last gperf use.

I now use cgraph_node/cgraph_varpool_node quite often during analysis so
slowing them down does not look like good idea.  I can try to make some
measurements in case you preffer.

One alternative seems to be to simply give identifiers unique integers
in addition to the unique pointers I use right now that won't change by
PCHizing.  There should be plenty of space in the identifier tree node,
right?

Honza
> 
> 
> r~