https://gcc.gnu.org/bugzilla/show_bug.cgi?id=115201
--- Comment #4 from Andrew Pinski ---
Created attachment 58273
--> https://gcc.gnu.org/bugzilla/attachment.cgi?id=58273&action=edit
Better (reduced testcase)
The tail call happens in the foo2 case while not in foo1. This is due to struct
retu
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=115201
--- Comment #3 from Andrew Pinski ---
Oh the issue is the iterator is a struct which confuses things ...
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=115201
--- Comment #2 from Jeremy R. ---
Does recursive inlining here interfere with TCO, or is GCC just not able to TCO
in this case?
I can understand why some bounded recursive inlining may be desirable, however
in this case it seems very not ideal.
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=115201
Andrew Pinski changed:
What|Removed |Added
Component|tree-optimization |ipa
--- Comment #1 from Andrew Pinski
