www.delorie.com/archives/browse.cgi   search  
Mail Archives: djgpp/1996/11/17/20:59:16

To: djgpp AT delorie DOT com
Subject: Re: Boehm GC & DJGPP 2.01?? HELP!
Message-ID: <19961118.173500.8471.0.chambersb@juno.com>
References: <56ltdq$3ed AT enyo DOT uwa DOT edu DOT au>
From: chambersb AT juno DOT com (Benjamin D Chambers)
Date: Sun, 17 Nov 1996 20:34:12 EST

On 17 Nov 1996 02:31:22 GMT lmason AT tartarus DOT uwa DOT edu DOT au (Llew Mason)
writes:
>Hi all,
>
>I'm trying to get the Boehm garbage collector to work with DJGPP 2.01. 
> As
>far as I know it used to work fine with DJGPP 1.??.  From looking at 
>the
>Boehm code it looks like DJGPP used to have a fixed address for the 
>bottom
>of the stack, but from the output that I get from the Boehm GC test 
>code
>it appears that the stack address for version 2.01 now varies. (Is 
>this
>something to do with the fact that it now uses DPMI??)
>
>Anyway, I need to know how I can find the bottom of the stack. (that
>should be the high address since it grows downward?)
>
>(btw. I'm using v4.11 alpha 4, because it has a few changes for DJGPP 
>2.01
>incorporated)
>
>Any help appreciated.  (anybody already got it working under DJGPP 
>2.01?)
>
>cya
>
>Llew Mason
>
>
>
>From what I understand, you're looking for the INITIAL value of the
stack, right?
The only way I can think of to do that would be to save the value of the
stack pointer at the start of the program, before anything is pushed.

PS Why do you need this?  Just wondering, seems kind of esoteric.

- Raw text -


  webmaster     delorie software   privacy  
  Copyright © 2019   by DJ Delorie     Updated Jul 2019