Tail call optimization?

[bearophile]

Stewart Gordon:

> What are "normal cases"?

It means "very simple cases". Things like fibonacci / factorial functions that call themselves at the tail.

Generally it's a fragile optimization, it's easy for it to not work/stop working. LLVM used to perform this optimization, then it stopped working for months an no one noticed. I have written a bug report and they have made it work again. And then they have put it in their demo :-)
http://llvm.org/demo/

Bye,
bearophile