Date: Wed, 14 Jun 2000 13:44:28 +0300 (IDT)
From: Eli Zaretskii <eliz AT is DOT elta DOT co DOT il>
X-Sender: eliz AT is
To: Johan Henriksson <jhe AT realsoftware DOT cjb DOT net>
cc: DJGPP mailinglist <djgpp AT delorie DOT com>
Subject: Re: Stack vs recursive functions
In-Reply-To: <006e01bfd5d8$69952ee0$0500007b@brk>
Message-ID: <Pine.SUN.3.91.1000614134123.29611O-100000@is>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Reply-To: djgpp AT delorie DOT com
Errors-To: nobody AT delorie DOT com
X-Mailing-List: djgpp AT delorie DOT com
X-Unsubscribes-To: listserv AT delorie DOT com
Precedence: bulk


On Wed, 14 Jun 2000, Johan Henriksson wrote:

> I wonder how many recursive levels I can have with a function
> that takes about 6 ints as parameters
> and have 2 ints as local variables?
> The size of the function shouldn't matter, right? Oh, and if you
> could give me the size of the stack so I might calculate it myself in the
> future, that would me nice as well.

You can use the library function `stackavail' to know how much stack 
space is free at any given time.