#include <concurrentqueue.h>

Collaboration diagram for moodycamel::ConcurrentQueue< T, Traits >:

[legend]

Classes
struct	Block

struct	ExplicitProducer

struct	FreeList

struct	FreeListNode

struct	ImplicitProducer

struct	ImplicitProducerHash

struct	ImplicitProducerKVP

struct	ProducerBase

Public Types
typedef ::moodycamel::ProducerToken	producer_token_t

typedef ::moodycamel::ConsumerToken	consumer_token_t

typedef Traits::index_t	index_t

typedef Traits::size_t	size_t

Public Member Functions
	ConcurrentQueue (size_t capacity=6 *BLOCK_SIZE)

	ConcurrentQueue (size_t minCapacity, size_t maxExplicitProducers, size_t maxImplicitProducers)

	~ConcurrentQueue ()

	ConcurrentQueue (ConcurrentQueue const &)=delete

ConcurrentQueue &	operator= (ConcurrentQueue const &)=delete

	ConcurrentQueue (ConcurrentQueue &&other) noexcept

ConcurrentQueue &	operator= (ConcurrentQueue &&other) noexcept

void	swap (ConcurrentQueue &other) noexcept

bool	enqueue (T const &item)

bool	enqueue (T &&item)

bool	enqueue (producer_token_t const &token, T const &item)

bool	enqueue (producer_token_t const &token, T &&item)

template<typename It >
bool	enqueue_bulk (It itemFirst, size_t count)

template<typename It >
bool	enqueue_bulk (producer_token_t const &token, It itemFirst, size_t count)

bool	try_enqueue (T const &item)

bool	try_enqueue (T &&item)

bool	try_enqueue (producer_token_t const &token, T const &item)

bool	try_enqueue (producer_token_t const &token, T &&item)

template<typename It >
bool	try_enqueue_bulk (It itemFirst, size_t count)

template<typename It >
bool	try_enqueue_bulk (producer_token_t const &token, It itemFirst, size_t count)

template<typename U >
bool	try_dequeue (U &item)

template<typename U >
bool	try_dequeue_non_interleaved (U &item)

template<typename U >
bool	try_dequeue (consumer_token_t &token, U &item)

template<typename It >
size_t	try_dequeue_bulk (It itemFirst, size_t max)

template<typename It >
size_t	try_dequeue_bulk (consumer_token_t &token, It itemFirst, size_t max)

template<typename U >
bool	try_dequeue_from_producer (producer_token_t const &producer, U &item)

template<typename It >
size_t	try_dequeue_bulk_from_producer (producer_token_t const &producer, It itemFirst, size_t max)

size_t	size_approx () const

Static Public Member Functions
static bool	is_lock_free ()

Static Public Attributes
static const size_t	BLOCK_SIZE = static_cast<size_t>(Traits::BLOCK_SIZE)

static const size_t	EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD = static_cast<size_t>(Traits::EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD)

static const size_t	EXPLICIT_INITIAL_INDEX_SIZE = static_cast<size_t>(Traits::EXPLICIT_INITIAL_INDEX_SIZE)

static const size_t	IMPLICIT_INITIAL_INDEX_SIZE = static_cast<size_t>(Traits::IMPLICIT_INITIAL_INDEX_SIZE)

static const size_t	INITIAL_IMPLICIT_PRODUCER_HASH_SIZE = static_cast<size_t>(Traits::INITIAL_IMPLICIT_PRODUCER_HASH_SIZE)

static const std::uint32_t	EXPLICIT_CONSUMER_CONSUMPTION_QUOTA_BEFORE_ROTATE = static_cast<std::uint32_t>(Traits::EXPLICIT_CONSUMER_CONSUMPTION_QUOTA_BEFORE_ROTATE)

static const size_t	MAX_SUBQUEUE_SIZE = (details::const_numeric_max<size_t>::value - static_cast<size_t>(Traits::MAX_SUBQUEUE_SIZE) < BLOCK_SIZE) ? details::const_numeric_max<size_t>::value : ((static_cast<size_t>(Traits::MAX_SUBQUEUE_SIZE) + (BLOCK_SIZE - 1)) / BLOCK_SIZE * BLOCK_SIZE)

Private Types
enum	AllocationMode { CanAlloc, CannotAlloc }

enum	InnerQueueContext { implicit_context = 0, explicit_context = 1 }

Private Member Functions
ConcurrentQueue &	swap_internal (ConcurrentQueue &other)

template<AllocationMode canAlloc, typename U >
bool	inner_enqueue (producer_token_t const &token, U &&element)

template<AllocationMode canAlloc, typename U >
bool	inner_enqueue (U &&element)

template<AllocationMode canAlloc, typename It >
bool	inner_enqueue_bulk (producer_token_t const &token, It itemFirst, size_t count)

template<AllocationMode canAlloc, typename It >
bool	inner_enqueue_bulk (It itemFirst, size_t count)

bool	update_current_producer_after_rotation (consumer_token_t &token)

void	populate_initial_block_list (size_t blockCount)

Block *	try_get_block_from_initial_pool ()

void	add_block_to_free_list (Block *block)

void	add_blocks_to_free_list (Block *block)

Block *	try_get_block_from_free_list ()

template<AllocationMode canAlloc>
Block *	requisition_block ()

ProducerBase *	recycle_or_create_producer (bool isExplicit)

ProducerBase *	recycle_or_create_producer (bool isExplicit, bool &recycled)

ProducerBase *	add_producer (ProducerBase *producer)

void	reown_producers ()

void	populate_initial_implicit_producer_hash ()

void	swap_implicit_producer_hashes (ConcurrentQueue &other)

ImplicitProducer *	get_or_add_implicit_producer ()

Static Private Member Functions
template<typename TAlign >
static void *	aligned_malloc (size_t size)

template<typename TAlign >
static void	aligned_free (void *ptr)

template<typename U >
static U *	create_array (size_t count)

template<typename U >
static void	destroy_array (U *p, size_t count)

template<typename U >
static U *	create ()

template<typename U , typename A1 >
static U *	create (A1 &&a1)

template<typename U >
static void	destroy (U *p)

Private Attributes
std::atomic< ProducerBase * >	producerListTail

std::atomic< std::uint32_t >	producerCount

std::atomic< size_t >	initialBlockPoolIndex

Block *	initialBlockPool

size_t	initialBlockPoolSize

FreeList< Block >	freeList

std::atomic< ImplicitProducerHash * >	implicitProducerHash

std::atomic< size_t >	implicitProducerHashCount

ImplicitProducerHash	initialImplicitProducerHash

std::array< ImplicitProducerKVP, INITIAL_IMPLICIT_PRODUCER_HASH_SIZE >	initialImplicitProducerHashEntries

std::atomic_flag	implicitProducerHashResizeInProgress

std::atomic< std::uint32_t >	nextExplicitConsumerId

std::atomic< std::uint32_t >	globalExplicitConsumerOffset

Friends
struct	ProducerToken

struct	ConsumerToken

struct	ExplicitProducer

struct	ImplicitProducer

class	ConcurrentQueueTests

template<typename XT , typename XTraits >
void	moodycamel::swap (typename ConcurrentQueue< XT, XTraits >::ImplicitProducerKVP &, typename ConcurrentQueue< XT, XTraits >::ImplicitProducerKVP &) noexcept

Member Typedef Documentation

◆ consumer_token_t

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

typedef ::moodycamel::ConsumerToken moodycamel::ConcurrentQueue< T, Traits >::consumer_token_t

◆ index_t

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

typedef Traits::index_t moodycamel::ConcurrentQueue< T, Traits >::index_t

◆ producer_token_t

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

typedef ::moodycamel::ProducerToken moodycamel::ConcurrentQueue< T, Traits >::producer_token_t

◆ size_t

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

typedef Traits::size_t moodycamel::ConcurrentQueue< T, Traits >::size_t

Member Enumeration Documentation

◆ AllocationMode

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

enum moodycamel::ConcurrentQueue::AllocationMode

private

Enumerator
CanAlloc
CannotAlloc

◆ InnerQueueContext

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

enum moodycamel::ConcurrentQueue::InnerQueueContext

private

Enumerator
implicit_context
explicit_context

Constructor & Destructor Documentation

◆ ConcurrentQueue() [1/4]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

moodycamel::ConcurrentQueue< T, Traits >::ConcurrentQueue ( size_t capacity = 6 * BLOCK_SIZE )

inlineexplicit

◆ ConcurrentQueue() [2/4]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

moodycamel::ConcurrentQueue< T, Traits >::ConcurrentQueue	(	size_t	minCapacity,
		size_t	maxExplicitProducers,
		size_t	maxImplicitProducers
	)

inline

◆ ~ConcurrentQueue()

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

moodycamel::ConcurrentQueue< T, Traits >::~ConcurrentQueue ( )

inline

◆ ConcurrentQueue() [3/4]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

moodycamel::ConcurrentQueue< T, Traits >::ConcurrentQueue ( ConcurrentQueue< T, Traits > const & )

delete

◆ ConcurrentQueue() [4/4]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

moodycamel::ConcurrentQueue< T, Traits >::ConcurrentQueue ( ConcurrentQueue< T, Traits > && other )

inlinenoexcept

Member Function Documentation

◆ add_block_to_free_list()

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

void moodycamel::ConcurrentQueue< T, Traits >::add_block_to_free_list ( Block * block )

inlineprivate

Here is the caller graph for this function:

◆ add_blocks_to_free_list()

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

void moodycamel::ConcurrentQueue< T, Traits >::add_blocks_to_free_list ( Block * block )

inlineprivate

Here is the caller graph for this function:

◆ add_producer()

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

ProducerBase* moodycamel::ConcurrentQueue< T, Traits >::add_producer ( ProducerBase * producer )

inlineprivate

Here is the caller graph for this function:

◆ aligned_free()

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

template<typename TAlign >

static void moodycamel::ConcurrentQueue< T, Traits >::aligned_free ( void * ptr )

inlinestaticprivate

◆ aligned_malloc()

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

template<typename TAlign >

static void* moodycamel::ConcurrentQueue< T, Traits >::aligned_malloc ( size_t size )

inlinestaticprivate

◆ create() [1/2]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

template<typename U >

static U* moodycamel::ConcurrentQueue< T, Traits >::create ( )

inlinestaticprivate

◆ create() [2/2]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

template<typename U , typename A1 >

static U* moodycamel::ConcurrentQueue< T, Traits >::create ( A1 && a1 )

inlinestaticprivate

◆ create_array()

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

template<typename U >

static U* moodycamel::ConcurrentQueue< T, Traits >::create_array ( size_t count )

inlinestaticprivate

◆ destroy()

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

template<typename U >

static void moodycamel::ConcurrentQueue< T, Traits >::destroy ( U * p )

inlinestaticprivate

Here is the caller graph for this function:

◆ destroy_array()

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

template<typename U >

static void moodycamel::ConcurrentQueue< T, Traits >::destroy_array	(	U *	p,
		size_t	count
	)

inlinestaticprivate

Here is the caller graph for this function:

◆ enqueue() [1/4]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

bool moodycamel::ConcurrentQueue< T, Traits >::enqueue	(	producer_token_t const &	token,
		T &&	item
	)

inline

◆ enqueue() [2/4]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

bool moodycamel::ConcurrentQueue< T, Traits >::enqueue	(	producer_token_t const &	token,
		T const &	item
	)

inline

◆ enqueue() [3/4]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

bool moodycamel::ConcurrentQueue< T, Traits >::enqueue ( T && item )

inline

◆ enqueue() [4/4]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

bool moodycamel::ConcurrentQueue< T, Traits >::enqueue ( T const & item )

inline

Here is the caller graph for this function:

◆ enqueue_bulk() [1/2]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

template<typename It >

bool moodycamel::ConcurrentQueue< T, Traits >::enqueue_bulk	(	It	itemFirst,
		size_t	count
	)

inline

Here is the caller graph for this function:

◆ enqueue_bulk() [2/2]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

template<typename It >

bool moodycamel::ConcurrentQueue< T, Traits >::enqueue_bulk	(	producer_token_t const &	token,
		It	itemFirst,
		size_t	count
	)

inline

◆ get_or_add_implicit_producer()

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

ImplicitProducer* moodycamel::ConcurrentQueue< T, Traits >::get_or_add_implicit_producer ( )

inlineprivate

Here is the caller graph for this function:

◆ inner_enqueue() [1/2]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

template<AllocationMode canAlloc, typename U >

bool moodycamel::ConcurrentQueue< T, Traits >::inner_enqueue	(	producer_token_t const &	token,
		U &&	element
	)

inlineprivate

◆ inner_enqueue() [2/2]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

template<AllocationMode canAlloc, typename U >

bool moodycamel::ConcurrentQueue< T, Traits >::inner_enqueue ( U && element )

inlineprivate

◆ inner_enqueue_bulk() [1/2]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

template<AllocationMode canAlloc, typename It >

bool moodycamel::ConcurrentQueue< T, Traits >::inner_enqueue_bulk	(	It	itemFirst,
		size_t	count
	)

inlineprivate

◆ inner_enqueue_bulk() [2/2]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

template<AllocationMode canAlloc, typename It >

bool moodycamel::ConcurrentQueue< T, Traits >::inner_enqueue_bulk	(	producer_token_t const &	token,
		It	itemFirst,
		size_t	count
	)

inlineprivate

◆ is_lock_free()

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

static bool moodycamel::ConcurrentQueue< T, Traits >::is_lock_free ( )

inlinestatic

◆ operator=() [1/2]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

ConcurrentQueue& moodycamel::ConcurrentQueue< T, Traits >::operator= ( ConcurrentQueue< T, Traits > && other )

inlinenoexcept

◆ operator=() [2/2]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

ConcurrentQueue& moodycamel::ConcurrentQueue< T, Traits >::operator= ( ConcurrentQueue< T, Traits > const & )

delete

◆ populate_initial_block_list()

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

void moodycamel::ConcurrentQueue< T, Traits >::populate_initial_block_list ( size_t blockCount )

inlineprivate

Here is the caller graph for this function:

◆ populate_initial_implicit_producer_hash()

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

void moodycamel::ConcurrentQueue< T, Traits >::populate_initial_implicit_producer_hash ( )

inlineprivate

Here is the caller graph for this function:

◆ recycle_or_create_producer() [1/2]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

ProducerBase* moodycamel::ConcurrentQueue< T, Traits >::recycle_or_create_producer ( bool isExplicit )

inlineprivate

Here is the caller graph for this function:

◆ recycle_or_create_producer() [2/2]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

ProducerBase* moodycamel::ConcurrentQueue< T, Traits >::recycle_or_create_producer	(	bool	isExplicit,
		bool &	recycled
	)

inlineprivate

◆ reown_producers()

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

void moodycamel::ConcurrentQueue< T, Traits >::reown_producers ( )

inlineprivate

Here is the caller graph for this function:

◆ requisition_block()

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

template<AllocationMode canAlloc>

Block* moodycamel::ConcurrentQueue< T, Traits >::requisition_block ( )

inlineprivate

◆ size_approx()

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

size_t moodycamel::ConcurrentQueue< T, Traits >::size_approx ( ) const

inline

Here is the caller graph for this function:

◆ swap()

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

void moodycamel::ConcurrentQueue< T, Traits >::swap ( ConcurrentQueue< T, Traits > & other )

inlinenoexcept

◆ swap_implicit_producer_hashes()

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

void moodycamel::ConcurrentQueue< T, Traits >::swap_implicit_producer_hashes ( ConcurrentQueue< T, Traits > & other )

inlineprivate

Here is the caller graph for this function:

◆ swap_internal()

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

ConcurrentQueue& moodycamel::ConcurrentQueue< T, Traits >::swap_internal ( ConcurrentQueue< T, Traits > & other )

inlineprivate

Here is the caller graph for this function:

◆ try_dequeue() [1/2]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

template<typename U >

bool moodycamel::ConcurrentQueue< T, Traits >::try_dequeue	(	consumer_token_t &	token,
		U &	item
	)

inline

◆ try_dequeue() [2/2]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

template<typename U >

bool moodycamel::ConcurrentQueue< T, Traits >::try_dequeue ( U & item )

inline

Here is the caller graph for this function:

◆ try_dequeue_bulk() [1/2]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

template<typename It >

size_t moodycamel::ConcurrentQueue< T, Traits >::try_dequeue_bulk	(	consumer_token_t &	token,
		It	itemFirst,
		size_t	max
	)

inline

◆ try_dequeue_bulk() [2/2]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

template<typename It >

size_t moodycamel::ConcurrentQueue< T, Traits >::try_dequeue_bulk	(	It	itemFirst,
		size_t	max
	)

inline

Here is the caller graph for this function:

◆ try_dequeue_bulk_from_producer()

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

template<typename It >

size_t moodycamel::ConcurrentQueue< T, Traits >::try_dequeue_bulk_from_producer	(	producer_token_t const &	producer,
		It	itemFirst,
		size_t	max
	)

inline

Here is the caller graph for this function:

◆ try_dequeue_from_producer()

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

template<typename U >

bool moodycamel::ConcurrentQueue< T, Traits >::try_dequeue_from_producer	(	producer_token_t const &	producer,
		U &	item
	)

inline

Here is the caller graph for this function:

◆ try_dequeue_non_interleaved()

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

template<typename U >

bool moodycamel::ConcurrentQueue< T, Traits >::try_dequeue_non_interleaved ( U & item )

inline

◆ try_enqueue() [1/4]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

bool moodycamel::ConcurrentQueue< T, Traits >::try_enqueue	(	producer_token_t const &	token,
		T &&	item
	)

inline

◆ try_enqueue() [2/4]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

bool moodycamel::ConcurrentQueue< T, Traits >::try_enqueue	(	producer_token_t const &	token,
		T const &	item
	)

inline

◆ try_enqueue() [3/4]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

bool moodycamel::ConcurrentQueue< T, Traits >::try_enqueue ( T && item )

inline

◆ try_enqueue() [4/4]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

bool moodycamel::ConcurrentQueue< T, Traits >::try_enqueue ( T const & item )

inline

Here is the caller graph for this function:

◆ try_enqueue_bulk() [1/2]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

template<typename It >

bool moodycamel::ConcurrentQueue< T, Traits >::try_enqueue_bulk	(	It	itemFirst,
		size_t	count
	)

inline

Here is the caller graph for this function:

◆ try_enqueue_bulk() [2/2]

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

template<typename It >

bool moodycamel::ConcurrentQueue< T, Traits >::try_enqueue_bulk	(	producer_token_t const &	token,
		It	itemFirst,
		size_t	count
	)

inline

◆ try_get_block_from_free_list()

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

Block* moodycamel::ConcurrentQueue< T, Traits >::try_get_block_from_free_list ( )

inlineprivate

Here is the caller graph for this function:

◆ try_get_block_from_initial_pool()

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

Block* moodycamel::ConcurrentQueue< T, Traits >::try_get_block_from_initial_pool ( )

inlineprivate

Here is the caller graph for this function:

◆ update_current_producer_after_rotation()

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

bool moodycamel::ConcurrentQueue< T, Traits >::update_current_producer_after_rotation ( consumer_token_t & token )

inlineprivate

Here is the caller graph for this function:

Friends And Related Function Documentation

◆ ConcurrentQueueTests

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

friend class ConcurrentQueueTests

friend

◆ ConsumerToken

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

friend struct ConsumerToken

friend

◆ ExplicitProducer

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

friend struct ExplicitProducer

friend

◆ ImplicitProducer

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

friend struct ImplicitProducer

friend

◆ moodycamel::swap

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

template<typename XT , typename XTraits >

void moodycamel::swap	(	typename ConcurrentQueue< XT, XTraits >::ImplicitProducerKVP &	,
		typename ConcurrentQueue< XT, XTraits >::ImplicitProducerKVP &
	)

friend

◆ ProducerToken

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

friend struct ProducerToken

friend

Member Data Documentation

◆ BLOCK_SIZE

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

const size_t moodycamel::ConcurrentQueue< T, Traits >::BLOCK_SIZE = static_cast<size_t>(Traits::BLOCK_SIZE)

static

◆ EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

const size_t moodycamel::ConcurrentQueue< T, Traits >::EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD = static_cast<size_t>(Traits::EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD)

static

◆ EXPLICIT_CONSUMER_CONSUMPTION_QUOTA_BEFORE_ROTATE

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

const std::uint32_t moodycamel::ConcurrentQueue< T, Traits >::EXPLICIT_CONSUMER_CONSUMPTION_QUOTA_BEFORE_ROTATE = static_cast<std::uint32_t>(Traits::EXPLICIT_CONSUMER_CONSUMPTION_QUOTA_BEFORE_ROTATE)

static

◆ EXPLICIT_INITIAL_INDEX_SIZE

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

const size_t moodycamel::ConcurrentQueue< T, Traits >::EXPLICIT_INITIAL_INDEX_SIZE = static_cast<size_t>(Traits::EXPLICIT_INITIAL_INDEX_SIZE)

static

◆ freeList

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

FreeList<Block> moodycamel::ConcurrentQueue< T, Traits >::freeList

private

◆ globalExplicitConsumerOffset

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

std::atomic<std::uint32_t> moodycamel::ConcurrentQueue< T, Traits >::globalExplicitConsumerOffset

private

◆ IMPLICIT_INITIAL_INDEX_SIZE

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

const size_t moodycamel::ConcurrentQueue< T, Traits >::IMPLICIT_INITIAL_INDEX_SIZE = static_cast<size_t>(Traits::IMPLICIT_INITIAL_INDEX_SIZE)

static

◆ implicitProducerHash

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

std::atomic<ImplicitProducerHash*> moodycamel::ConcurrentQueue< T, Traits >::implicitProducerHash

private

◆ implicitProducerHashCount

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

std::atomic<size_t> moodycamel::ConcurrentQueue< T, Traits >::implicitProducerHashCount

private

◆ implicitProducerHashResizeInProgress

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

std::atomic_flag moodycamel::ConcurrentQueue< T, Traits >::implicitProducerHashResizeInProgress

private

◆ INITIAL_IMPLICIT_PRODUCER_HASH_SIZE

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

const size_t moodycamel::ConcurrentQueue< T, Traits >::INITIAL_IMPLICIT_PRODUCER_HASH_SIZE = static_cast<size_t>(Traits::INITIAL_IMPLICIT_PRODUCER_HASH_SIZE)

static

◆ initialBlockPool

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

Block* moodycamel::ConcurrentQueue< T, Traits >::initialBlockPool

private

◆ initialBlockPoolIndex

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

std::atomic<size_t> moodycamel::ConcurrentQueue< T, Traits >::initialBlockPoolIndex

private

◆ initialBlockPoolSize

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

size_t moodycamel::ConcurrentQueue< T, Traits >::initialBlockPoolSize

private

◆ initialImplicitProducerHash

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

ImplicitProducerHash moodycamel::ConcurrentQueue< T, Traits >::initialImplicitProducerHash

private

◆ initialImplicitProducerHashEntries

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

std::array<ImplicitProducerKVP, INITIAL_IMPLICIT_PRODUCER_HASH_SIZE> moodycamel::ConcurrentQueue< T, Traits >::initialImplicitProducerHashEntries

private

◆ MAX_SUBQUEUE_SIZE

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

const size_t moodycamel::ConcurrentQueue< T, Traits >::MAX_SUBQUEUE_SIZE = (details::const_numeric_max<size_t>::value - static_cast<size_t>(Traits::MAX_SUBQUEUE_SIZE) < BLOCK_SIZE) ? details::const_numeric_max<size_t>::value : ((static_cast<size_t>(Traits::MAX_SUBQUEUE_SIZE) + (BLOCK_SIZE - 1)) / BLOCK_SIZE * BLOCK_SIZE)

static

◆ nextExplicitConsumerId

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

std::atomic<std::uint32_t> moodycamel::ConcurrentQueue< T, Traits >::nextExplicitConsumerId

private

◆ producerCount

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

std::atomic<std::uint32_t> moodycamel::ConcurrentQueue< T, Traits >::producerCount

private

◆ producerListTail

template<typename T , typename Traits = ConcurrentQueueDefaultTraits>

std::atomic<ProducerBase*> moodycamel::ConcurrentQueue< T, Traits >::producerListTail

private

The documentation for this class was generated from the following file:

third_party/concurrentqueue.h

Classes

Public Types

Public Member Functions

Static Public Member Functions

Static Public Attributes

Private Types

Private Member Functions

Static Private Member Functions

Private Attributes

Friends

Member Typedef Documentation

◆ consumer_token_t

◆ index_t

◆ producer_token_t

◆ size_t

Member Enumeration Documentation

◆ AllocationMode

◆ InnerQueueContext

Constructor & Destructor Documentation

◆ ConcurrentQueue() [1/4]

◆ ConcurrentQueue() [2/4]

◆ ~ConcurrentQueue()

◆ ConcurrentQueue() [3/4]

◆ ConcurrentQueue() [4/4]

Member Function Documentation

◆ add_block_to_free_list()

◆ add_blocks_to_free_list()

◆ add_producer()

◆ aligned_free()

◆ aligned_malloc()

◆ create() [1/2]

◆ create() [2/2]

◆ create_array()

◆ destroy()

◆ destroy_array()

◆ enqueue() [1/4]

◆ enqueue() [2/4]

◆ enqueue() [3/4]

◆ enqueue() [4/4]

◆ enqueue_bulk() [1/2]

◆ enqueue_bulk() [2/2]

◆ get_or_add_implicit_producer()

◆ inner_enqueue() [1/2]

◆ inner_enqueue() [2/2]

◆ inner_enqueue_bulk() [1/2]

◆ inner_enqueue_bulk() [2/2]

◆ is_lock_free()

◆ operator=() [1/2]

◆ operator=() [2/2]

◆ populate_initial_block_list()

◆ populate_initial_implicit_producer_hash()

◆ recycle_or_create_producer() [1/2]

◆ recycle_or_create_producer() [2/2]

◆ reown_producers()

◆ requisition_block()

◆ size_approx()

◆ swap()

◆ swap_implicit_producer_hashes()

◆ swap_internal()

◆ try_dequeue() [1/2]

◆ try_dequeue() [2/2]

◆ try_dequeue_bulk() [1/2]

◆ try_dequeue_bulk() [2/2]

◆ try_dequeue_bulk_from_producer()

◆ try_dequeue_from_producer()

◆ try_dequeue_non_interleaved()

◆ try_enqueue() [1/4]

◆ try_enqueue() [2/4]

◆ try_enqueue() [3/4]

◆ try_enqueue() [4/4]

◆ try_enqueue_bulk() [1/2]

◆ try_enqueue_bulk() [2/2]

◆ try_get_block_from_free_list()

◆ try_get_block_from_initial_pool()

◆ update_current_producer_after_rotation()

Friends And Related Function Documentation

◆ ConcurrentQueueTests

◆ ConsumerToken

◆ ExplicitProducer

◆ ImplicitProducer