X-Authentication-Warning: delorie.com: mailnull set sender to djgpp-workers-bounces using -f
Date: Sun, 24 Feb 2002 12:40:24 -0500
Message-Id: <200202241740.g1OHeOd19302@envy.delorie.com>
From: DJ Delorie <dj AT delorie DOT com>
To: djgpp-workers AT delorie DOT com
In-reply-to: <3C7919F2.96FFA97D@yahoo.com> (message from CBFalconer on Sun, 24
	Feb 2002 11:50:58 -0500)
Subject: Re: Malloc/free DJGPP code
References: <10202201713 DOT AA23034 AT clio DOT rice DOT edu> <3C7919F2 DOT 96FFA97D AT yahoo DOT com>
Reply-To: djgpp-workers AT delorie DOT com
Errors-To: nobody AT delorie DOT com
X-Mailing-List: djgpp-workers AT delorie DOT com
X-Unsubscribes-To: listserv AT delorie DOT com
Precedence: bulk


> This could all be cured by a semi-portable implementation of, say,
> "fakesbrk" which will return a repeatable set of addresses under
> the same circumstances.  It might actually malloc a large block
> which contains those addresses to be faked.  But how can it ensure
> that a certain range is available to any degree of certainty, or
> even of probability?

Put a huge uninitialized static array in your program and use it for
sbrk.  It will always be in the same virtual address.