Re: Workqueues in Ada

[Matthew Heaney <mheaney@on2.com>]

On Jul 28, 1:00 pm, Wiktor Moskwa <wiktorDOTmos...@gmail.com> wrote:
>
> The problem is that my poor implementation of workqueue is a
> bottleneck. A task takes a unit of work from a queue, processes it
> and puts it back at the and of the queue. Because the queue is
> Ada.Containers.Doubly_Linked_Lists there are lots of memory
> allocations and deallocations - that's a performance problem.

You can work around that using the Splice operations, which move nodes
from one list container to another.  You could use one list as a kind
of free-store, from where you get new nodes.  Instead of Deleting a
node from a list, splice it onto the free-store list; this eliminates
deallocation.