www.delorie.com/archives/browse.cgi   search  
Mail Archives: djgpp/2002/02/09/14:00:24

X-Authentication-Warning: delorie.com: mailnull set sender to djgpp-bounces using -f
Date: Sat, 9 Feb 2002 13:59:36 -0500
Message-Id: <200202091859.g19Ixam19704@envy.delorie.com>
From: DJ Delorie <dj AT delorie DOT com>
To: djgpp AT delorie DOT com
In-reply-to: <3C655E12.6F8D351E@yahoo.com> (message from CBFalconer on Sat, 09
Feb 2002 18:14:21 GMT)
Subject: Re: Alignment problem
References: <3c63f21f DOT sandmann AT clio DOT rice DOT edu> <3C645F1D DOT C26E8F64 AT yahoo DOT com> <3c64b7cf DOT sandmann AT clio DOT rice DOT edu> <3C650C18 DOT B45F67D4 AT yahoo DOT com> <4331-Sat09Feb2002145741+0200-eliz AT is DOT elta DOT co DOT il> <3C655E12 DOT 6F8D351E AT yahoo DOT com>
Reply-To: djgpp AT delorie DOT com
Errors-To: nobody AT delorie DOT com
X-Mailing-List: djgpp AT delorie DOT com
X-Unsubscribes-To: listserv AT delorie DOT com

> Those sources ARE in djlsr203.zip, I assume.  No problem getting
> the time up there - see paste below.  I assume this can be done
> without recompiling the run-time?

Yes.  Just add malloc.c (malloc.o) to your local project.

> I can well imaging that the cure could be to simply mark areas free
> and join them only to immediately adjacent free areas, leaving any
> further compaction to malloc only when and if needed.

Malloc does not do any fancy compaction.

> I assume that malloc/free work on some master pool until more is
> needed.

Yes.

> So there is some intimate knowledge of the malloc algorithm built
> into the compiler,

No, this cannot be.  Perhaps gcc knows about malloc in general, but it
cannot know about the malloc algorithm.

- Raw text -


  webmaster     delorie software   privacy  
  Copyright © 2019   by DJ Delorie     Updated Jul 2019