Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!uakari.primate.wisc.edu!aplcen!jhunix!barrett
From: barrett@jhunix.HCF.JHU.EDU (Dan Barrett)
Newsgroups: comp.sys.amiga.programmer
Subject: Re: How fast/slow is memory DEallocation?
Message-ID: <8524@jhunix.HCF.JHU.EDU>
Date: 1 Jun 91 13:17:10 GMT
References: <8504@jhunix.HCF.JHU.EDU> <dillon.8233@overload.Berkeley.CA.US>
Organization: The Johns Hopkins University - HCF
Lines: 19

In article <dillon.8233@overload.Berkeley.CA.US> dillon@overload.Berkeley.CA.US (Matthew Dillon) writes:
>    If the system must allocate & deallocate similar-sized objects then
>    I generally cache deallocated objects in a list instead of calling
>    free() or FreeMem().

	Won't work for my application, unfortunately.  I do all the
allocations first, traverse the data structure, and then deallocate the
whole thing.  There are no intermediate dealloc/allocs.

	See my previous post for the solution to what was wrong:  with
no prototypes for AllocMem/FreeMem, they behaved incorrectly.

                                                        Dan

 //////////////////////////////////////\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\
| Dan Barrett, Department of Computer Science      Johns Hopkins University |
| INTERNET:   barrett@cs.jhu.edu           |                                |
| COMPUSERVE: >internet:barrett@cs.jhu.edu | UUCP:   barrett@jhunix.UUCP    |
 \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\/////////////////////////////////////