#include "MPSCQueue.h"

Classes
struct	Node

Public Member Functions
	MPSCQueueNonIntrusive ()

	~MPSCQueueNonIntrusive ()

void	Enqueue (T *input)

bool	Dequeue (T *&result)

Private Member Functions
	MPSCQueueNonIntrusive (MPSCQueueNonIntrusive const &)=delete

MPSCQueueNonIntrusive &	operator= (MPSCQueueNonIntrusive const &)=delete

Private Attributes
std::atomic< Node * >	_head

std::atomic< Node * >	_tail

Detailed Description

template<typename T>
class Acore::Impl::MPSCQueueNonIntrusive< T >

Constructor & Destructor Documentation

◆ MPSCQueueNonIntrusive() [1/2]

template<typename T >

Acore::Impl::MPSCQueueNonIntrusive< T >::MPSCQueueNonIntrusive ( )

inline

                                : _head(new Node()), _tail(_head.load(std::memory_order_relaxed))
        {
            Node* front = _head.load(std::memory_order_relaxed);
            front->Next.store(nullptr, std::memory_order_relaxed);
        }

References Acore::Impl::MPSCQueueNonIntrusive< T >::_head, and Acore::Impl::MPSCQueueNonIntrusive< T >::Node::Next.

◆ ~MPSCQueueNonIntrusive()

template<typename T >

Acore::Impl::MPSCQueueNonIntrusive< T >::~MPSCQueueNonIntrusive ( )

inline

        {
            T* output;
            while (Dequeue(output))
                delete output;
 
            Node* front = _head.load(std::memory_order_relaxed);
            delete front;
        }

References Acore::Impl::MPSCQueueNonIntrusive< T >::_head, and Acore::Impl::MPSCQueueNonIntrusive< T >::Dequeue().

◆ MPSCQueueNonIntrusive() [2/2]

template<typename T >

Acore::Impl::MPSCQueueNonIntrusive< T >::MPSCQueueNonIntrusive ( MPSCQueueNonIntrusive< T > const & )

privatedelete

Member Function Documentation

◆ Dequeue()

template<typename T >

bool Acore::Impl::MPSCQueueNonIntrusive< T >::Dequeue ( T *& result )

inline

        {
            Node* tail = _tail.load(std::memory_order_relaxed);
            Node* next = tail->Next.load(std::memory_order_acquire);
            if (!next)
                return false;
 
            result = next->Data;
            _tail.store(next, std::memory_order_release);
            delete tail;
            return true;
        }

References Acore::Impl::MPSCQueueNonIntrusive< T >::_tail, Acore::Impl::MPSCQueueNonIntrusive< T >::Node::Data, and Acore::Impl::MPSCQueueNonIntrusive< T >::Node::Next.

Referenced by Acore::Impl::MPSCQueueNonIntrusive< T >::~MPSCQueueNonIntrusive().

◆ Enqueue()

template<typename T >

void Acore::Impl::MPSCQueueNonIntrusive< T >::Enqueue ( T * input )

inline

        {
            Node* node = new Node(input);
            Node* prevHead = _head.exchange(node, std::memory_order_acq_rel);
            prevHead->Next.store(node, std::memory_order_release);
        }

References Acore::Impl::MPSCQueueNonIntrusive< T >::_head, and Acore::Impl::MPSCQueueNonIntrusive< T >::Node::Next.