Path: utzoo!utgpu!utstat!jarvis.csri.toronto.edu!mailrus!ulowell!cbmvax!ditto
From: ditto@cbmvax.UUCP (Michael "Ford" Ditto)
Newsgroups: comp.sys.amiga.tech
Subject: malloc (Re: memalign (can it be simulated?))
Message-ID: <5926@cbmvax.UUCP>
Date: 8 Feb 89 21:51:29 GMT
References: <5471@bsu-cs.UUCP> <25616@sgi.SGI.COM> <1989Feb1.001209.27677@ziebmef.uucp> <804@sas.UUCP>
Reply-To: ditto@cbmvax.UUCP (Michael "Ford" Ditto)
Organization: Commodore Technology, West Chester, PA
Lines: 15

In article <804@sas.UUCP> toebes@sas.UUCP (John Toebes) writes:
[  while(p) { free(p); p = p->next; }  ]
> is required to work for any UN*X compatible memory manager.

As an example of the trouble of supporting programs that use this, note
that System V has two complete implementations of malloc():  One is much
faster but does not guarantee to maintain the contents of freed memory.
The slower (but more compatible) version is the default.
-- 
					-=] Ford [=-

"The number of Unix installations	(In Real Life:  Mike Ditto)
has grown to 10, with more expected."	ford@kenobi.cts.com
- The Unix Programmer's Manual,		...!sdcsvax!crash!elgar!ford
  2nd Edition, June, 1972.		ditto@cbmvax.commodore.com