Date: Thu, 30 Oct 1997 16:42:19 +0200 (IST)
From: Eli Zaretskii <eliz AT is DOT elta DOT co DOT il>
To: John Machin <sjmachin AT lexicon DOT net DOT au>
cc: "Salvador Eduardo Tropea (SET)" <salvador AT inti DOT edu DOT ar>, djgpp AT delorie DOT com
Subject: Re: malloc()
In-Reply-To: <199710301211.XAA08637@mona.lexicon.net.au>
Message-ID: <Pine.SUN.3.91.971030163921.5063A-100000@is>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Precedence: bulk


On Thu, 30 Oct 1997, John Machin wrote:

> Allocators which don't split/coalesce free blocks can break 
> down if the program allocates a large number of blocks of size x, 
> frees them, allocates/frees ditto sizes y,z, etc (where x,y,z etc 
> belong in different power-of-two buckets) --- unrealistic? No, e.g. 
> program == text editor, x == average len of source file line, y == 
> average len of record in data file1,...

Could you please write a test program along these lines, or find such
a program written by somebody else?  It would be interesting to compare 
the two malloc's with such a program.  Thanks.