This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug middle-end/52640] [4.8 Regression] performance bottleneck: gcc/tree.c;value_member
- From: "jan dot smets at alcatel-lucent dot com" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: Tue, 11 Dec 2012 16:55:30 +0000
- Subject: [Bug middle-end/52640] [4.8 Regression] performance bottleneck: gcc/tree.c;value_member
- Auto-submitted: auto-generated
- References: <bug-52640-4@http.gcc.gnu.org/bugzilla/>
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=52640
--- Comment #19 from Jan Smets <jan.smets@alcatel-lucent.com> 2012-12-11 16:55:30 UTC ---
Steven's example only contains 10 000 entries. I need to recompile a symbol
table of 270.000 entries a dozen times each day. (and so do a lot of other
people)
With the 'fix' it still takes 12+ seconds to compile it on a state of the art
machine and then another 4+ seconds to assemble. CLANG2.8 spends 15.5 sec and
CLANG3.1 16.5 sec.
I'm already happy with the work around but I'd really like to see a more
structural solution, whichever that may be. Thanks