------- 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 tail-recursion will apply.
What is indeed odd is that we optimize better with an expanded callgraph which we shouldn't. -- http://gcc.gnu.org/bugzilla/show_bug.cgi?id=44822
