This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: forcing tail/sibling call optimization
- To: Fergus Henderson <fjh at cs dot mu dot oz dot au>
- Subject: Re: forcing tail/sibling call optimization
- From: Bernd Schmidt <bernds at redhat dot com>
- Date: Sun, 26 Nov 2000 16:18:37 +0000 (GMT)
- cc: Robert Dewar <dewar at gnat dot com>, gcc at gcc dot gnu dot org
On Mon, 27 Nov 2000, Fergus Henderson wrote:
> Implementation Advice:
> Implementations should implement tail call statements in such
> a way that all storage for the invocation of the calling
> function is reclaimed by the time execution transfers to the
> callee function.
>
> Implementation Requirements:
> Implementations shall issue a warning if there are any tail call
> statements for which the implementation is unable to follow
> the implementation advice.
Whether all storage can be reclaimed is potentially machine dependent.
This means that the warning will not be very useful; relying on it will
lead to nonportable code.
Bernd