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.
