🚀 go-pugleaf

In <412fhq$j98@nz12.rz.uni-karlsruhe.de> ua0y@rzstud1.rz.uni-karlsruhe.de
 (Frank Muzzulini) writes:

: P. Mantecon (pmanteco@haifa.cern.ch) wrote:
: > I can  understand  the size of the basic chunk to be a power of 2, but
: > what  puzzles me is that -4 bytes, so my  question  is the  following:
: > why the chunk size is precisely 2^13-4 instead of being just 2^13?
: 
: malloc() always needs some additional bytes to store some information
: about the allocated block. If you 'malloc' exactly 8k, it has to
: allocate one block more, than needed to store 8k.
: Seems to me, that's why they spare out the 4 bytes.

If I remember right, this space is for some sort of next pointer from LEDA,
not malloc(), and we had to hack around to increase this from 4 to 8, because
OSF/1 on DEC Alpha uses 64bit pointers.
BTW, <8Kb for data structures is a severe limit nowadays; that's not a PDP11.
(Now I prefer Tcl/Tk, where I can easily have a single string of several
Megabytes... (If someone doesn't now what Tcl/Tk is, see the comp.lang.tcl FAQ))


Bye, Heribert (dahms@ifk20.mach.uni-karlsruhe.de)