This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug ipa/60243] IPA is slow on large cgraph tree
- From: "hubicka at ucw dot cz" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: Thu, 20 Feb 2014 01:33:36 +0000
- Subject: [Bug ipa/60243] IPA is slow on large cgraph tree
- Auto-submitted: auto-generated
- References: <bug-60243-4 at http dot gcc dot gnu dot org/bugzilla/>
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=60243
--- Comment #10 from Jan Hubicka <hubicka at ucw dot cz> ---
> --- Comment #3 from Richard Biener <rguenth at gcc dot gnu.org> ---
> estimate_calls_size_and_time is quite high on the profile - called via
> do_estimate_edge_size it walks callgraph edges O(n^2). It seems that
> the idea of having a cache is worse than devising an algorithm to
> compute sizes and times for the whole cgraph at once?
Yep, the problem is that they are changing as the inlining progresses, since
we propagate predicates on them on each inline. I will check the testcase.