From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,c70f02b79bc3d231 X-Google-Attributes: gid103376,public From: dewar@merv.cs.nyu.edu (Robert Dewar) Subject: Re: dynamic memory allocation Date: 1997/06/17 Message-ID: #1/1 X-Deja-AN: 249156902 References: <33A55F1B.63FE@gsfc.nasa.gov> <33A6AE5C.74CD@no.such.com> Organization: New York University Newsgroups: comp.lang.ada Date: 1997-06-17T00:00:00+00:00 List-Id: Wes said <> Much too strong a statement. Whether a given pattern of allocations causes fragmentation with a given storage allocatoin algorithm is highly dependent on the pattern. For any particular algorithm, there surely will be a pattern of allocatoins that does NOT cause fragmentation. On most allocators, the use of all fixed size blocks will guarantee no fragmentation, but you cannot count on this without knowing the algorithm used.