NetNews Usenet Archive 1992 #30/NN_1992_30.iso/spool/comp/os/mswindo/programm/tools/1740

Internet Message Format | 1992-12-17 | 2.0 KB

Path: sparky!uunet!lax.pe-nelson.com!lax!twbrown
From: [e-mail] (Tom W. Brown)
Newsgroups: comp.os.ms-windows.programmer.tools
Subject: Re: How to implement a Linked List
Message-ID: <[e-mail]>
Date: 17 Dec 92 17:18:44 GMT
References: <[e-mail]> <[e-mail]> <[e-mail]>
Sender: [e-mail]
Organization: PE-Nelson
Lines: 30

In article <[e-mail]>, [e-mail] (Shahrin Abdullah) writes:
|> In article <[e-mail]>, [e-mail] (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"
[e-mail]   |                    Monty Python and the Holy Grail
----------------------------------------------------------------------------