ABA in Michael's linked list?

[khizmax]

ABA in Michael's linked list?

[khizmax]

Hi,
You created ABA-problem for yourself :-) Lock-free intrusive containers are tricky.
HP is a schema for deferred reclamation. After erase() call the item is put into internal HP retired buffer. When this buffer becomes full, a disposer you provided in Traits will be invoked. And only after disposer has been called you may reuse the item. Otherwise, if you insert() the item immediately after erase() it as you write your item will be in HP retired buffer as "death" and in the list as "alive".
For details, see retire_node and clean_disposer

[kiith-sa]

Thanks,

So basically, I need to define a disposer to free an element (e.g. recycling it to a free list) -
and then only reuse those elements I recycled? Is there an example/spec for the disposer ? (only did a quick search as I'm leaving for train right now, didn't find it).

I'm closing the issue as there is no bug.

[khizmax]

Yes, you should define a disposer. When your disposer will be invoked you may do anything with the item - you may delete it, or you may reuse it and so on.
The disposer call is just a signal from within HP: "that pointer is free, you can reuse it".