--- Comment #3 from rguenth at gcc dot gnu dot org 2010-07-05 14:54 ---
It's quite different as tail-recursion optimization doesn't apply if the
functions are named differently. And the callgraph has an exponential
number of edges which we usually do not flatten down to the point where
--- Comment #1 from rguenth at gcc dot gnu dot org 2010-07-05 13:46 ---
recursive inlining is limited to a depth of 8.
While the testcase may be "interesting", does it have any practical
relevance? Certainly nobody looked to optimize for these funny
callgraphs.
But yes, confirmed.
-
