rossbencina / queueworld Goto Github PK

void push(Node *node)
{
    Node *top =  atomicLifoTop_.load(std::memory_order_relaxed); // (*)
    node->next = top;
    atomicLifoTop_.store(node, std::memory_order_release);
}

node_ptr_type result = atomicLifoTop_.exchange(0, std::memory_order_acquire);

void push(Node *node)
{
    Node *top =  atomicLifoTop_.load(std::memory_order_relaxed);
    node->next = top;

    if (atomicLifoTop_.compare_exchange_strong(top, node,
                /*success:*/ std::memory_order_release,
                /*failure:*/ std::memory_order_release) == false) { 
        assert(top == 0);
        node->next = 0;
        atomicLifoTop_.store(node, std::memory_order_relaxed);
    }
}