🚀 go-pugleaf

In article <1992Dec17.084558.9832@nuscc.nus.sg>, shah@cherry.NoSubdomain.NoDomain (Shahrin Abdullah) writes:
|> In article <724532588snz@chrism.demon.co.uk>, chris@chrism.demon.co.uk (Chris Marriott) writes:
|> |> 
|> |> If you're using Microsoft C7, you can implement a linked list in Windows
|> |> in exactly the same way you would for DOS - just use the standard run time
|> |> library "malloc" function.  If you use the large memory model (and there's
|> |> no reason not to, any more), "malloc" gets mapped onto calls to a pretty
|> |> good "sub-allocator".
|> |> 
|>  
|> The problem here is that malloc will map the memory allocation to the local
|> heap. Thus if the node dynamically grow too large the local heap won't be
|> able to handle that. So the question remain - how do U implement a linear 
|> linked list using the Global Heap? Thanks Chris.
|> 

I can't adequately speak for Microsoft C7, but I know Borland 3.1 uses a
sub-segment allocator with globally allocated memory if you compile in
large model.  I'd be very suprised if C7 did any different.  Note that
Chris specified large model in his reply -- this is definitely the key.

However, if I'm wrong and C7 still uses the local heap for large model
memory allocation then perhaps you should switch compilers :-)


----------------------------------------------------------------------------
Tom Brown               |  "She turned me into a newt...
PE Nelson Systems       |                                  ... I got better"
twbrown@pe-nelson.com   |                    Monty Python and the Holy Grail
----------------------------------------------------------------------------