This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: optimizing static inline recursive functions
- From: "Richard Guenther" <richard dot guenther at gmail dot com>
- To: "Reza Roboubi" <reza at parvan dot net>
- Cc: gcc at gcc dot gnu dot org
- Date: Sat, 1 Nov 2008 11:55:15 +0100
- Subject: Re: optimizing static inline recursive functions
- References: <490C04E1.7010202@parvan.net>
On Sat, Nov 1, 2008 at 8:27 AM, Reza Roboubi <reza@parvan.net> wrote:
> I believe gcc treats all function calls as fairly sacred and doesn't really
> optimize across function calls much. For example, the pcre(regex) library
> creates it's own stack frames and "simulates" the entire function recursion
> to overcome this (and I think it has to, otherwise big inefficiencies would
> result.)
>
> Are there plans to add this feature to gcc?
GCC does tail recursion optimization. What more general optimization are
you looking for? Your description isn't very specific.
Richard.
> Thanks a lot.
>
> Reza.
>