This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug tree-optimization/32941] [4.3 regression] Bootstrap comparison failure
- From: "sje at cup dot hp dot com" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 9 Aug 2007 17:02:35 -0000
- Subject: [Bug tree-optimization/32941] [4.3 regression] Bootstrap comparison failure
- References: <bug-32941-7087@http.gcc.gnu.org/bugzilla/>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
------- Comment #7 from sje at cup dot hp dot com 2007-08-09 17:02 -------
Created an attachment (id=14047)
--> (http://gcc.gnu.org/bugzilla/attachment.cgi?id=14047&action=view)
untested patch
I can't reliably reproduce the problem but the attached patch may fix it. It
removes the sort and replaces bsearch with a simple linear search. While
bootstrapping the largest size I saw for the queue was 7. While compiling
larger C++ tests (SPEC2006) I saw it reach 30, but that is the largest I saw.
For 30 elements or less (99% of the time it is a single element) I think a
linear search is reasonable. Can someone who can reliably reproduce the
problem test this patch?
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=32941