Inheritance diagram for tbb::internal::concurrent_queue_iterator_rep:

Collaboration diagram for tbb::internal::concurrent_queue_iterator_rep:

Public Member Functions
	concurrent_queue_iterator_rep (const concurrent_queue_base &queue, size_t offset_of_last_)

bool	get_item (void *&item, size_t k)
	Set item to point to kth element. Return true if at end of queue or item is marked valid; false otherwise. More...

Public Attributes
ticket	head_counter

const concurrent_queue_base &	my_queue

const size_t	offset_of_last

concurrent_queue_base::page *	array [concurrent_queue_rep::n_queue]

Additional Inherited Members
Private Member Functions inherited from tbb::internal::no_assign
void	operator= (const no_assign &)=delete

	no_assign (const no_assign &)=default

	no_assign ()=default

Detailed Description

Definition at line 580 of file concurrent_queue.cpp.

Constructor & Destructor Documentation

◆ concurrent_queue_iterator_rep()

tbb::internal::concurrent_queue_iterator_rep::concurrent_queue_iterator_rep	(	const concurrent_queue_base &	queue,
		size_t	offset_of_last_
	)

inline

Definition at line 586 of file concurrent_queue.cpp.

                                                                                                 :
         head_counter(queue.my_rep->head_counter),
         my_queue(queue),
         offset_of_last(offset_of_last_)
     {
         const concurrent_queue_rep& rep = *queue.my_rep;
         for( size_t k=0; k<concurrent_queue_rep::n_queue; ++k )
             array[k] = rep.array[k].head_page;
     }

References tbb::internal::concurrent_queue_rep::array, array, tbb::internal::micro_queue::head_page, tbb::internal::concurrent_queue_base_v3::my_rep, and tbb::internal::concurrent_queue_rep::n_queue.

Member Function Documentation

◆ get_item()

bool tbb::internal::concurrent_queue_iterator_rep::get_item	(	void *&	item,
		size_t	k
	)

inline

Set item to point to kth element. Return true if at end of queue or item is marked valid; false otherwise.

Definition at line 596 of file concurrent_queue.cpp.

                                            {
         if( k==my_queue.my_rep->tail_counter ) {
             item = NULL;
             return true;
         } else {
             concurrent_queue_base::page* p = array[concurrent_queue_rep::index(k)];
             __TBB_ASSERT(p,NULL);
             size_t i = modulo_power_of_two( k/concurrent_queue_rep::n_queue, my_queue.items_per_page );
             item = static_cast<unsigned char*>(static_cast<void*>(p)) + offset_of_last + my_queue.item_size*i;
             return (p->mask & uintptr_t(1)<<i)!=0;
         }
     }