This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Question about PR tree-optimization/32941, bootstrap failure, qsort
- From: Steve Ellcey <sje at cup dot hp dot com>
- To: gcc at gcc dot gnu dot org
- Date: Mon, 6 Aug 2007 15:47:01 -0700 (PDT)
- Subject: Question about PR tree-optimization/32941, bootstrap failure, qsort
- Reply-to: sje at cup dot hp dot com
I was looking at PR tree-optimization/32941 after seeing a bootstrap
failure on my IA64 Linux box. I was wondering if anyone knows why it
has started failing now? It looks like this sorting of the goto queue
has been around for quite a while (since 4.1 at least). Do we have more
goto's than we used to in our GCC code?
Does anyone have any ideas on how to fix it? The obvious thing to do is
to sort based on the contents of the goto and return expr's instead of
the address of them but it is not clear to me that there is anything
unique to sort on. Two different goto's or return's could have
completely identical data in them but still be different nodes.
Types and insn's seem to have unique ID's but it doesn't look like
general tree types's do.
What if we didn't sort it at all and did a linear search on the goto
queue? Is the goto queue actually ever long enough that this would
affect the compilation time?
Steve Ellcey
sje@cup.hp.com