Re: Problems with dynamic allocation in tasks

[ldb <ldb_nospam@hotmail.com>]

On Jul 25, 12:45 pm, Robert A Duff <bobd...@shell01.TheWorld.com>
wrote:
> ldb <ldb_nos...@hotmail.com> writes:
> >...Ideally, i'd be able to
> > create a task-local memory pool that doesn't require a mutex for these
> > allocations.. not sure how feasible this is in Ada, though.
>
> It's quite feasible.  Look up storage pools (section 13.11 in the RM).
>
> - Bob

I'm at a loss for how this possible using storage pools.

I've worked a good deal with storage pools but perhaps my vision of
their functionality is too narrow. It was my belief that a storage
pool can only be used globally for a particular type. These dynamic
allocations are done with global types, ie, Access_Vector. Certainly a
storage pool can be attached to Access_Vector and intercept, figure
out which thread its in.. but then what? In a "simple" implementation,
I'm still depending on System.Memory (which is malloc()) and it's
still gonna hit these mutexes.

I -could- make the storage-pool implement a full allocator so it's not
dependant on malloc() for each allocation. This is alot of work and
there are alot of types. If I go this route, I'd prefer to do a global
replace (which goes back to my original question of how to do it like
gmem does it).