From:	"John M. Aldrich" <fighteer AT cs DOT com>
Newsgroups:	comp.os.msdos.djgpp
Subject:	Re: Will djgpp optimize recursive function calls?
Date:	Sun, 17 Nov 1996 04:54:07 -0800
Organization:	Three pounds of chaos and a pinch of salt
Lines:	21
Message-ID:	<328F0AEF.1314@cs.com>
References:	<Pine DOT A32 DOT 3 DOT 93 DOT 961115194737 DOT 37954A-100000 AT srv1 DOT freenet DOT calgary DOT ab DOT ca> <328E1F11 DOT 5F69 AT cs DOT com> <328F7903 DOT 5B8E AT spy DOT isp DOT nsc DOT ru>
Reply-To:	fighteer AT cs DOT com
NNTP-Posting-Host:	ppp109.cs.com
Mime-Version:	1.0
To:	djgpp AT delorie DOT com
DJ-Gateway:	from newsgroup comp.os.msdos.djgpp

Ilya P. Ryzhenkov wrote:
> 
> Hmmmm.... It's not true perfectly ... Consider :
[snip]
> You'll see, that GCC DO optimizes (inline), but only for the FIRST call.

Seems like a pretty logical solution to me.  I have never bothered to
explore this facet of gcc's optimizations because I don't like to use
-O3 much, but it's nice to know that gcc is so smart.  :)

-- 
John M. Aldrich <fighteer AT cs DOT com>                      

* Anything that happens, happens.
* Anything that, in happening, causes something else to happen,
  causes something else to happen.
* Anything that, in happening, causes itself to happen again, happens
  again.
* It doesn't necessarily do it in chronological order, though.
 
                                       --- Douglas Adams

- Raw text -