From:	"John M. Aldrich" <fighteer AT cs DOT com>
Newsgroups:	comp.os.msdos.djgpp
Subject:	Re: Will djgpp optimize recursive function calls?
Date:	Sat, 16 Nov 1996 12:07:45 -0800
Organization:	Three pounds of chaos and a pinch of salt
Lines:	25
Message-ID:	<328E1F11.5F69@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>
Reply-To:	fighteer AT cs DOT com
NNTP-Posting-Host:	ppp107.cs.com
Mime-Version:	1.0
To:	Calvin French <french AT freenet DOT calgary DOT ab DOT ca>
To:	djgpp AT delorie DOT com
DJ-Gateway:	from newsgroup comp.os.msdos.djgpp

Calvin French wrote:
> 
> ??? <g> If so, what optimization flags should I use? I hate to sound
> lazy, stupid, or just plain whiny, but data recursion isn't the most fun
> I've had. Actually I am close to getting the hand-optimized version
> working, but I wonder if the compiler would do a better job anyways, for
> instance by using the real stack. Hrmm... Thanks,

I have read in some detail the gcc docs on optimization flags.  As I
understand it, if gcc detects a recursive call, it will NOT inline the
function that uses it.  It will still optimize the function itself, but
will never convert it into inline code.

For more information, look in the gcc docs under Invoking GCC |
Optimize.

-- 
John M. Aldrich, aka Fighteer I <fighteer AT cs DOT com>

-----BEGIN GEEK CODE BLOCK-----
Version: 3.1
GCS d- s+:- a-->? c++>$ U@>++$ p>+ L>++ E>+ W++ N++ o+ K? w(---) O-
M-- V? PS+ PE Y+ PGP- t+(-) 5- X- R+ tv+() b+++ DI++ D++ G e(*)>++++
h!() !r !y+()
------END GEEK CODE BLOCK------

- Raw text -