This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Recursion Optimization
- To: gcc at gcc dot gnu dot org
- Subject: Recursion Optimization
- From: Kevin Atkinson <kevinatk at home dot com>
- Date: Mon, 16 Aug 1999 03:39:13 -0400
Does gcc optimize in any way to minimize the cost of recursive functions
calls. In particular:
ONE:
Does gcc optimize tail recursive functions into simple loops?
TWO:
In a function call like this:
int sum(int i, int stop) {
if (i == stop) return i;
else return sum(i+1, stop) + i;
}
Will gcc recognize that the value of the second parameter never changes
so that it can avoid allocating multiple copies of it on the stack.
--
Kevin Atkinson
kevinatk@home.com
http://metalab.unc.edu/kevina/