Date:	Mon, 19 Feb 1996 10:56:31 -0800 (GMT)
From:	Orlando Andico <oandico AT eee DOT upd DOT edu DOT ph>
To:	Charles Sandmann <sandmann AT clio DOT rice DOT edu>
cc:	djgpp AT delorie DOT com
Subject:	Re: Segmentation problem in DJGPP v2
In-Reply-To:	<3126084e.sandmann@clio.rice.edu>
Message-ID:	<Pine.SOL.3.91.960219105153.1406A-100000@gollum>
MIME-Version:	1.0

On Sat, 17 Feb 1996, Charles Sandmann wrote:

> This is because the exception handler code has been destroyed.  Did you
> try to run the 1.12m4 version under Windows?  I'll bet it dies there too.
> I expect you need to use stubedit on your susan.exe and create a large stack.
> While 10000 bytes in the previous message isn't enough to cause a stack
> overflow, if you have several of these type of automatic arrays nested, it
> can cause problems.

Yep; increasing the stack size to 4MB seemed to fix these problems. And 
yes, the 1.12m4 version was crashing under Windoze too. But didn't I hear 
that DJGPP v1 had an infinite stack? so what gives?

Also: if I give it a 4MB stack, will that all be used? will it be paged? 
ie can this program still run on a low-memory machine?

> 
> If you run the program under the debugger, the exception handler is imbedded
> in the debugger instead of the image itself, which may help you to verify
> the stack overrun or find the problem.
> 

The debugger claimed that getc() was the place where the errors 
occurred... although apparently it _was_ a stack problem.

Thanks for the help. How common are these stack problems anyway? I 
suppose this really should be in the new FAQ.

/--------------------------------------------------------------------------\
|  Orlando A. Andico               "I have no concept of time, other than  |
|  oandico AT eee DOT upd DOT edu DOT ph             it is flying." -- Alanis Morissette  |
\--------------------------------------------------------------------------/

- Raw text -