Re: Finding out minimal allocation unit

[Stefan Bellon <sbellon@sbellon.de>]

Randy Brukardt wrote:
> "Stefan Bellon" <sbellon@sbellon.de> wrote in message

> > a) we can resize an already existing storage pool to increase the
> > memory inside it, and

> It's whatever you want it to be! A storage pool is just a container
> that is automatically called when you allocate or deallocate memory.
> There of course are the predefined ones, but you can provide your own
> about which you define *all* of the details.

Ok, that sounds gook.

> In your case, I'd probably implement the pool as a linked list of
> arrays that hold enough elements for some large size (at least 4K for
> Windows, can't say for Linux). And then I'd manage them with a free
> chain and a pass through for unusual sizes (see below). You could
> even set the item size as a discriminant of the pool type, possibly
> using the attribute designed for this purpose
> ('Max_Size_in_Storage_Elements).

Well, our idea was to build a generic storage pool which can handle
only memory chunks of one size. And the generic storage pool is
instantiated with that size as generic parameter. So that each data
structure instance (be it a list, a tree, hash table, ...) has its own
storage pool with the exact Item_Type'Size instantiated.

> Indeed, I have a pool whose job was to find the source of dangling
> pointers, and all it did was save the pointers and clobber memory on
> deallocation; the actual allocation was a pure pass-through to the
> standard pool (using New and Unchecked_Deallocation).

Cool idea!

> I suggest reading up on storage pools in whatever you can find.

Ok, thanks for all the help and ideas so far!

-- 
Stefan Bellon