Intel(R) Threading Building Blocks Doxygen Documentation version 4.2.3
tbb::flow::interface11::priority_queue_node< T, Compare, Allocator > Class Template Reference

Forwards messages in priority order. More...

#include <flow_graph.h>

Inheritance diagram for tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >:
Collaboration diagram for tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >:

Public Types

typedef T input_type
 
typedef T output_type
 
typedef buffer_node< T, Allocator > base_type
 
typedef priority_queue_node class_type
 
typedef receiver< input_type >::predecessor_type predecessor_type
 
typedef sender< output_type >::successor_type successor_type
 
- Public Types inherited from tbb::flow::interface11::buffer_node< T, __TBB_DEFAULT_NODE_ALLOCATOR(T) >
typedef T input_type
 
typedef T output_type
 
typedef receiver< input_type >::predecessor_type predecessor_type
 
typedef sender< output_type >::successor_type successor_type
 
typedef buffer_node< T, __TBB_DEFAULT_NODE_ALLOCATOR(T) > class_type
 
- Public Types inherited from internal::item_buffer< T, cache_aligned_allocator< T > >
enum  buffer_item_state
 
typedef T item_type
 
- Public Types inherited from tbb::flow::interface11::internal::untyped_receiver
typedef untyped_sender predecessor_type
 The predecessor type for this node. More...
 
- Public Types inherited from tbb::flow::interface11::internal::untyped_sender
typedef untyped_receiver successor_type
 The successor type for this node. More...
 

Public Member Functions

 __TBB_STATIC_ASSERT ((tbb::internal::is_same_type< Allocator, null_type >::value), "Allocator template parameter for flow graph nodes is deprecated and will removed in the future. " "To temporary enable the deprecated interface specify TBB_ENABLE_DEPRECATED_NODE_ALLOCATOR.")
 
__TBB_NOINLINE_SYM priority_queue_node (graph &g, const Compare &comp=Compare())
 Constructor. More...
 
__TBB_NOINLINE_SYM priority_queue_node (const priority_queue_node &src)
 Copy constructor. More...
 
- Public Member Functions inherited from tbb::flow::interface11::buffer_node< T, __TBB_DEFAULT_NODE_ALLOCATOR(T) >
 __TBB_STATIC_ASSERT ((tbb::internal::is_same_type< __TBB_DEFAULT_NODE_ALLOCATOR(T), null_type >::value), "__TBB_DEFAULT_NODE_ALLOCATOR(T) template parameter for flow graph nodes is deprecated and will be removed. " "Specify TBB_DEPRECATED_FLOW_NODE_ALLOCATOR to temporary enable the deprecated interface.")
 
__TBB_NOINLINE_SYM buffer_node (graph &g)
 Constructor. More...
 
__TBB_NOINLINE_SYM buffer_node (const buffer_node &src)
 Copy constructor. More...
 
bool register_successor (successor_type &r) __TBB_override
 Adds a new successor. More...
 
bool remove_successor (successor_type &r) __TBB_override
 Removes a successor. More...
 
bool try_get (T &v) __TBB_override
 Request an item from the buffer_node. More...
 
bool try_reserve (T &v) __TBB_override
 Reserves an item. More...
 
bool try_release () __TBB_override
 Release a reserved item. More...
 
bool try_consume () __TBB_override
 Consumes a reserved item. More...
 
- Public Member Functions inherited from tbb::flow::interface11::graph_node
 graph_node (graph &g)
 
virtual ~graph_node ()
 
- Public Member Functions inherited from internal::reservable_item_buffer< T, cache_aligned_allocator< T > >
 reservable_item_buffer ()
 
void reset ()
 
- Public Member Functions inherited from internal::item_buffer< T, cache_aligned_allocator< T > >
 item_buffer ()
 Constructor. More...
 
 ~item_buffer ()
 
void reset ()
 
- Public Member Functions inherited from tbb::flow::interface11::receiver< T >
bool try_put (const typename internal::async_helpers< T >::filtered_type &t)
 Put an item to the receiver. More...
 
bool try_put (const typename internal::async_helpers< T >::async_type &t)
 
- Public Member Functions inherited from tbb::flow::interface11::internal::untyped_receiver
virtual ~untyped_receiver ()
 Destructor. More...
 
template<typename X >
bool try_put (const X &t)
 Put an item to the receiver. More...
 
virtual bool register_predecessor (predecessor_type &)
 Add a predecessor to the node. More...
 
virtual bool remove_predecessor (predecessor_type &)
 Remove a predecessor from the node. More...
 
virtual bool try_get (T &)
 Request an item from the sender. More...
 
virtual bool try_reserve (T &)
 Reserves an item in the sender. More...
 
- Public Member Functions inherited from tbb::flow::interface11::internal::untyped_sender
virtual ~untyped_sender ()
 
virtual bool register_successor (successor_type &r)=0
 Add a new successor to this node. More...
 
virtual bool remove_successor (successor_type &r)=0
 Removes a successor from this node. More...
 
virtual bool try_release ()
 Releases the reserved item. More...
 
virtual bool try_consume ()
 Consumes the reserved item. More...
 

Protected Types

typedef buffer_node< T, Allocator >::size_type size_type
 
typedef buffer_node< T, Allocator >::item_type item_type
 
typedef buffer_node< T, Allocator >::buffer_operation prio_operation
 
- Protected Types inherited from tbb::flow::interface11::buffer_node< T, __TBB_DEFAULT_NODE_ALLOCATOR(T) >
enum  op_type
 
typedef size_t size_type
 
typedef internal::aggregating_functor< class_type, buffer_operation > handler_type
 
- Protected Types inherited from internal::item_buffer< T, cache_aligned_allocator< T > >
typedef size_t size_type
 
typedef aligned_pair< item_type, buffer_item_state >::type buffer_item_type
 
typedef tbb::internal::allocator_rebind< cache_aligned_allocator< T >, buffer_item_type >::type allocator_type
 

Protected Member Functions

void reset_node (reset_flags f) __TBB_override
 
void internal_forward_task (prio_operation *op) __TBB_override
 Tries to forward valid items to successors. More...
 
void handle_operations (prio_operation *op_list) __TBB_override
 
bool internal_push (prio_operation *op) __TBB_override
 
void internal_pop (prio_operation *op) __TBB_override
 
void internal_reserve (prio_operation *op) __TBB_override
 
void internal_consume (prio_operation *op) __TBB_override
 
void internal_release (prio_operation *op) __TBB_override
 
- Protected Member Functions inherited from tbb::flow::interface11::buffer_node< T, __TBB_DEFAULT_NODE_ALLOCATOR(T) >
virtual void handle_operations (buffer_operation *op_list)
 
void handle_operations_impl (buffer_operation *op_list, derived_type *derived)
 
taskgrab_forwarding_task (buffer_operation &op_data)
 
bool enqueue_forwarding_task (buffer_operation &op_data)
 
virtual taskforward_task ()
 This is executed by an enqueued task, the "forwarder". More...
 
virtual void internal_reg_succ (buffer_operation *op)
 Register successor. More...
 
virtual void internal_rem_succ (buffer_operation *op)
 Remove successor. More...
 
virtual void internal_forward_task (buffer_operation *op)
 Tries to forward valid items to successors. More...
 
void internal_forward_task_impl (buffer_operation *op, derived_type *derived)
 
virtual bool internal_push (buffer_operation *op)
 
virtual void internal_pop (buffer_operation *op)
 
virtual void internal_reserve (buffer_operation *op)
 
virtual void internal_consume (buffer_operation *op)
 
virtual void internal_release (buffer_operation *op)
 
tasktry_put_task (const T &t) __TBB_override
 receive an item, return a task *if possible More...
 
graphgraph_reference () const __TBB_override
 
void reset_receiver (reset_flags) __TBB_override
 put receiver back in initial state More...
 
void reset_node (reset_flags f) __TBB_override
 
virtual void reset_node (reset_flags f=rf_reset_protocol)=0
 
- Protected Member Functions inherited from internal::reservable_item_buffer< T, cache_aligned_allocator< T > >
bool reserve_front (T &v)
 
void consume_front ()
 
void release_front ()
 
- Protected Member Functions inherited from internal::item_buffer< T, cache_aligned_allocator< T > >
bool buffer_empty () const
 
buffer_item_typeitem (size_type i)
 
const buffer_item_typeitem (size_type i) const
 
bool my_item_valid (size_type i) const
 
bool my_item_reserved (size_type i) const
 
const item_typeget_my_item (size_t i) const
 
void set_my_item (size_t i, const item_type &o)
 
void fetch_item (size_t i, item_type &o)
 
void move_item (size_t to, size_t from)
 
bool place_item (size_t here, const item_type &me)
 
void swap_items (size_t i, size_t j)
 
void destroy_item (size_type i)
 
const item_typefront () const
 
const item_typeback () const
 
void reserve_item (size_type i)
 
void release_item (size_type i)
 
void destroy_front ()
 
void destroy_back ()
 
size_type size (size_t new_tail=0)
 
size_type capacity ()
 
bool buffer_full ()
 
void grow_my_array (size_t minimum_size)
 Grows the internal array. More...
 
bool push_back (item_type &v)
 
bool pop_back (item_type &v)
 
bool pop_front (item_type &v)
 
void clean_up_buffer (bool reset_pointers)
 
- Protected Member Functions inherited from tbb::flow::interface11::receiver< T >
virtual tasktry_put_task_wrapper (const void *p, bool is_async) __TBB_override
 
virtual tasktry_put_task (const T &t)=0
 Put item to successor; return task to run the successor if possible. More...
 
- Protected Member Functions inherited from tbb::flow::interface11::internal::untyped_receiver
template<typename X >
tasktry_put_task (const X &t)
 
virtual tasktry_put_task_wrapper (const void *p, bool is_async)=0
 
virtual graphgraph_reference () const =0
 
virtual void reset_receiver (reset_flags f=rf_reset_protocol)=0
 put receiver back in initial state More...
 
virtual bool is_continue_receiver ()
 
- Protected Member Functions inherited from tbb::flow::interface11::sender< T >
virtual bool try_get_wrapper (void *p, bool is_async) __TBB_override
 
virtual bool try_reserve_wrapper (void *p, bool is_async) __TBB_override
 
- Protected Member Functions inherited from tbb::flow::interface11::internal::untyped_sender
template<typename X >
bool try_get (X &t)
 Request an item from the sender. More...
 
template<typename X >
bool try_reserve (X &t)
 Reserves an item in the sender. More...
 
virtual bool try_get_wrapper (void *p, bool is_async)=0
 
virtual bool try_reserve_wrapper (void *p, bool is_async)=0
 

Private Member Functions

void order ()
 
bool is_item_valid ()
 
void try_put_and_add_task (task *&last_task)
 
bool prio_use_tail ()
 
void prio_push (const T &src)
 
void prio_pop ()
 
const T & prio ()
 
void heapify ()
 
void reheap ()
 

Private Attributes

Compare compare
 
size_type mark
 
input_type reserved_item
 

Friends

template<typename , typename >
class buffer_node
 

Additional Inherited Members

- Public Attributes inherited from tbb::flow::interface11::receiver< T >
__TBB_DEPRECATED typedef T input_type
 The input type of this receiver. More...
 
__TBB_DEPRECATED typedef internal::async_helpers< T >::filtered_type filtered_type
 
- Public Attributes inherited from tbb::flow::interface11::sender< T >
__TBB_DEPRECATED typedef T output_type
 The output type of this sender. More...
 
__TBB_DEPRECATED typedef internal::async_helpers< T >::filtered_type filtered_type
 
- Protected Attributes inherited from tbb::flow::interface11::buffer_node< T, __TBB_DEFAULT_NODE_ALLOCATOR(T) >
internal::round_robin_cache< T, null_rw_mutexmy_successors
 
bool forwarder_busy
 
internal::aggregator< handler_type, buffer_operation > my_aggregator
 
- Protected Attributes inherited from tbb::flow::interface11::graph_node
graphmy_graph
 
graph_nodenext
 
graph_nodeprev
 
- Protected Attributes inherited from internal::reservable_item_buffer< T, cache_aligned_allocator< T > >
bool my_reserved
 
- Protected Attributes inherited from internal::item_buffer< T, cache_aligned_allocator< T > >
buffer_item_typemy_array
 
size_type my_array_size
 
size_type my_head
 
size_type my_tail
 
- Static Protected Attributes inherited from internal::item_buffer< T, cache_aligned_allocator< T > >
static const size_type initial_buffer_size
 

Detailed Description

template<typename T, typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
class tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >

Forwards messages in priority order.

Definition at line 2749 of file flow_graph.h.

Member Typedef Documentation

◆ base_type

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
typedef buffer_node<T,Allocator> tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::base_type

Definition at line 2760 of file flow_graph.h.

◆ class_type

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
typedef priority_queue_node tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::class_type

Definition at line 2761 of file flow_graph.h.

◆ input_type

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
typedef T tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::input_type

Definition at line 2758 of file flow_graph.h.

◆ item_type

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
typedef buffer_node<T,Allocator>::item_type tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::item_type
protected

Definition at line 2804 of file flow_graph.h.

◆ output_type

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
typedef T tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::output_type

Definition at line 2759 of file flow_graph.h.

◆ predecessor_type

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
typedef receiver<input_type>::predecessor_type tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::predecessor_type

Definition at line 2762 of file flow_graph.h.

◆ prio_operation

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
typedef buffer_node<T,Allocator>::buffer_operation tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::prio_operation
protected

Definition at line 2805 of file flow_graph.h.

◆ size_type

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
typedef buffer_node<T,Allocator>::size_type tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::size_type
protected

Definition at line 2803 of file flow_graph.h.

◆ successor_type

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
typedef sender<output_type>::successor_type tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::successor_type

Definition at line 2763 of file flow_graph.h.

Constructor & Destructor Documentation

◆ priority_queue_node() [1/2]

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
__TBB_NOINLINE_SYM tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::priority_queue_node ( graph g,
const Compare &  comp = Compare() 
)
inlineexplicit

Constructor.

Definition at line 2766 of file flow_graph.h.

2767 : buffer_node<T, Allocator>(g), compare(comp), mark(0) {
2768 tbb::internal::fgt_node( CODEPTR(), tbb::internal::FLOW_PRIORITY_QUEUE_NODE, &(this->my_graph),
2769 static_cast<receiver<input_type> *>(this),
2770 static_cast<sender<output_type> *>(this) );
2771 }
#define CODEPTR()
static void fgt_node(void *, string_index, void *, void *)

References CODEPTR, tbb::internal::fgt_node(), and tbb::flow::interface11::graph_node::my_graph.

Here is the call graph for this function:

◆ priority_queue_node() [2/2]

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
__TBB_NOINLINE_SYM tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::priority_queue_node ( const priority_queue_node< T, Compare, Allocator > &  src)
inline

Copy constructor.

Definition at line 2782 of file flow_graph.h.

2783 : buffer_node<T, Allocator>(src), mark(0)
2784 {
2785 tbb::internal::fgt_node( CODEPTR(), tbb::internal::FLOW_PRIORITY_QUEUE_NODE, &(this->my_graph),
2786 static_cast<receiver<input_type> *>(this),
2787 static_cast<sender<output_type> *>(this) );
2788 }

References CODEPTR, tbb::internal::fgt_node(), and tbb::flow::interface11::graph_node::my_graph.

Here is the call graph for this function:

Member Function Documentation

◆ __TBB_STATIC_ASSERT()

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::__TBB_STATIC_ASSERT ( (tbb::internal::is_same_type< Allocator, null_type >::value ,
"Allocator template parameter for flow graph nodes is deprecated and will removed in the future. " "To temporary enable the deprecated interface specify TBB_ENABLE_DEPRECATED_NODE_ALLOCATOR."   
)

◆ handle_operations()

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
void tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::handle_operations ( prio_operation op_list)
inlineprotected

Definition at line 2812 of file flow_graph.h.

2812 {
2813 this->handle_operations_impl(op_list, this);
2814 }
void handle_operations_impl(buffer_operation *op_list, derived_type *derived)
Definition: flow_graph.h:2134

References tbb::flow::interface11::buffer_node< T, __TBB_DEFAULT_NODE_ALLOCATOR(T) >::handle_operations_impl().

Here is the call graph for this function:

◆ heapify()

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
void tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::heapify ( )
inlineprivate

Definition at line 2934 of file flow_graph.h.

2934 {
2935 if(this->my_tail == 0) {
2936 mark = 0;
2937 return;
2938 }
2939 if (!mark) mark = 1;
2940 for (; mark<this->my_tail; ++mark) { // for each unheaped element
2941 size_type cur_pos = mark;
2942 input_type to_place;
2943 this->fetch_item(mark,to_place);
2944 do { // push to_place up the heap
2945 size_type parent = (cur_pos-1)>>1;
2946 if (!compare(this->get_my_item(parent), to_place))
2947 break;
2948 this->move_item(cur_pos, parent);
2949 cur_pos = parent;
2950 } while( cur_pos );
2951 (void) this->place_item(cur_pos, to_place);
2952 }
2953 }
void const char const char int ITT_FORMAT __itt_group_sync x void const char ITT_FORMAT __itt_group_sync s void ITT_FORMAT __itt_group_sync p void ITT_FORMAT p void ITT_FORMAT p no args __itt_suppress_mode_t unsigned int void size_t ITT_FORMAT d void ITT_FORMAT p void ITT_FORMAT p __itt_model_site __itt_model_site_instance ITT_FORMAT p __itt_model_task __itt_model_task_instance ITT_FORMAT p void ITT_FORMAT p void ITT_FORMAT p void size_t ITT_FORMAT d void ITT_FORMAT p const wchar_t ITT_FORMAT s const char ITT_FORMAT s const char ITT_FORMAT s const char ITT_FORMAT s no args void ITT_FORMAT p size_t ITT_FORMAT d no args const wchar_t const wchar_t ITT_FORMAT s __itt_heap_function void size_t int ITT_FORMAT d __itt_heap_function void ITT_FORMAT p __itt_heap_function void void size_t int ITT_FORMAT d no args no args unsigned int ITT_FORMAT u const __itt_domain __itt_id ITT_FORMAT lu const __itt_domain __itt_id __itt_id parent
buffer_node< T, Allocator >::size_type size_type
Definition: flow_graph.h:2803

References tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::compare, internal::item_buffer< T, cache_aligned_allocator< T > >::fetch_item(), internal::item_buffer< T, cache_aligned_allocator< T > >::get_my_item(), tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::mark, internal::item_buffer< T, cache_aligned_allocator< T > >::move_item(), internal::item_buffer< T, cache_aligned_allocator< T > >::my_tail, parent, internal::item_buffer< T, cache_aligned_allocator< T > >::place_item(), and void.

Referenced by tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::order().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ internal_consume()

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
void tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::internal_consume ( prio_operation op)
inlineprotected

Definition at line 2848 of file flow_graph.h.

References tbb::internal::__TBB_store_with_release(), internal::reservable_item_buffer< T, cache_aligned_allocator< T > >::my_reserved, tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::reserved_item, and internal::SUCCEEDED.

Here is the call graph for this function:

◆ internal_forward_task()

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
void tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::internal_forward_task ( prio_operation op)
inlineprotected

Tries to forward valid items to successors.

Definition at line 2808 of file flow_graph.h.

2808 {
2809 this->internal_forward_task_impl(op, this);
2810 }
void internal_forward_task_impl(buffer_operation *op, derived_type *derived)
Definition: flow_graph.h:2299

References tbb::flow::interface11::buffer_node< T, __TBB_DEFAULT_NODE_ALLOCATOR(T) >::internal_forward_task_impl().

Here is the call graph for this function:

◆ internal_pop()

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
void tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::internal_pop ( prio_operation op)
inlineprotected

Definition at line 2822 of file flow_graph.h.

2822 {
2823 // if empty or already reserved, don't pop
2824 if ( this->my_reserved == true || this->my_tail == 0 ) {
2826 return;
2827 }
2828
2829 *(op->elem) = prio();
2831 prio_pop();
2832
2833 }

References tbb::internal::__TBB_store_with_release(), internal::FAILED, internal::reservable_item_buffer< T, cache_aligned_allocator< T > >::my_reserved, internal::item_buffer< T, cache_aligned_allocator< T > >::my_tail, tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::prio(), tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::prio_pop(), and internal::SUCCEEDED.

Here is the call graph for this function:

◆ internal_push()

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
bool tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::internal_push ( prio_operation op)
inlineprotected

Definition at line 2816 of file flow_graph.h.

2816 {
2817 prio_push(*(op->elem));
2819 return true;
2820 }

References tbb::internal::__TBB_store_with_release(), tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::prio_push(), and internal::SUCCEEDED.

Here is the call graph for this function:

◆ internal_release()

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
void tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::internal_release ( prio_operation op)
inlineprotected

◆ internal_reserve()

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
void tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::internal_reserve ( prio_operation op)
inlineprotected

◆ is_item_valid()

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
bool tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::is_item_valid ( )
inlineprivate

Definition at line 2869 of file flow_graph.h.

2869 {
2870 return this->my_tail > 0;
2871 }

References internal::item_buffer< T, cache_aligned_allocator< T > >::my_tail.

◆ order()

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
void tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::order ( )
inlineprivate

Definition at line 2864 of file flow_graph.h.

2864 {
2865 if (mark < this->my_tail) heapify();
2866 __TBB_ASSERT(mark == this->my_tail, "mark unequal after heapify");
2867 }
#define __TBB_ASSERT(predicate, comment)
No-op version of __TBB_ASSERT.
Definition: tbb_stddef.h:165

References __TBB_ASSERT, tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::heapify(), tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::mark, and internal::item_buffer< T, cache_aligned_allocator< T > >::my_tail.

Here is the call graph for this function:

◆ prio()

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
const T & tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::prio ( )
inlineprivate

Definition at line 2929 of file flow_graph.h.

2929 {
2930 return this->get_my_item(prio_use_tail() ? this->my_tail-1 : 0);
2931 }

References internal::item_buffer< T, cache_aligned_allocator< T > >::get_my_item(), internal::item_buffer< T, cache_aligned_allocator< T > >::my_tail, and tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::prio_use_tail().

Referenced by tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::internal_pop(), tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::internal_reserve(), and tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::try_put_and_add_task().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ prio_pop()

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
void tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::prio_pop ( )
inlineprivate

Definition at line 2907 of file flow_graph.h.

2907 {
2908 if (prio_use_tail()) {
2909 // there are newly pushed elements; last one higher than top
2910 // copy the data
2911 this->destroy_item(this->my_tail-1);
2912 --(this->my_tail);
2913 __TBB_ASSERT(mark <= this->my_tail, "mark outside bounds after pop");
2914 return;
2915 }
2916 this->destroy_item(0);
2917 if(this->my_tail > 1) {
2918 // push the last element down heap
2919 __TBB_ASSERT(this->my_item_valid(this->my_tail - 1), NULL);
2920 this->move_item(0,this->my_tail - 1);
2921 }
2922 --(this->my_tail);
2923 if(mark > this->my_tail) --mark;
2924 if (this->my_tail > 1) // don't reheap for heap of size 1
2925 reheap();
2926 __TBB_ASSERT(mark <= this->my_tail, "mark outside bounds after pop");
2927 }

References __TBB_ASSERT, internal::item_buffer< T, cache_aligned_allocator< T > >::destroy_item(), tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::mark, internal::item_buffer< T, cache_aligned_allocator< T > >::move_item(), internal::item_buffer< T, cache_aligned_allocator< T > >::my_item_valid(), internal::item_buffer< T, cache_aligned_allocator< T > >::my_tail, tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::prio_use_tail(), and tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::reheap().

Referenced by tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::internal_pop(), tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::internal_reserve(), and tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::try_put_and_add_task().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ prio_push()

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
void tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::prio_push ( const T &  src)
inlineprivate

Definition at line 2896 of file flow_graph.h.

2896 {
2897 if ( this->my_tail >= this->my_array_size )
2898 this->grow_my_array( this->my_tail + 1 );
2899 (void) this->place_item(this->my_tail, src);
2900 ++(this->my_tail);
2901 __TBB_ASSERT(mark < this->my_tail, "mark outside bounds after push");
2902 }
void grow_my_array(size_t minimum_size)
Grows the internal array.

References __TBB_ASSERT, internal::item_buffer< T, cache_aligned_allocator< T > >::grow_my_array(), internal::item_buffer< T, cache_aligned_allocator< T > >::my_array_size, internal::item_buffer< T, cache_aligned_allocator< T > >::my_tail, internal::item_buffer< T, cache_aligned_allocator< T > >::place_item(), and void.

Referenced by tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::internal_push(), and tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::internal_release().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ prio_use_tail()

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
bool tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::prio_use_tail ( )
inlineprivate

Definition at line 2890 of file flow_graph.h.

2890 {
2891 __TBB_ASSERT(mark <= this->my_tail, "mark outside bounds before test");
2892 return mark < this->my_tail && compare(this->get_my_item(0), this->get_my_item(this->my_tail - 1));
2893 }

References __TBB_ASSERT, tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::compare, internal::item_buffer< T, cache_aligned_allocator< T > >::get_my_item(), tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::mark, and internal::item_buffer< T, cache_aligned_allocator< T > >::my_tail.

Referenced by tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::prio(), and tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::prio_pop().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ reheap()

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
void tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::reheap ( )
inlineprivate

Definition at line 2956 of file flow_graph.h.

2956 {
2957 size_type cur_pos=0, child=1;
2958 while (child < mark) {
2959 size_type target = child;
2960 if (child+1<mark &&
2961 compare(this->get_my_item(child),
2962 this->get_my_item(child+1)))
2963 ++target;
2964 // target now has the higher priority child
2965 if (compare(this->get_my_item(target),
2966 this->get_my_item(cur_pos)))
2967 break;
2968 // swap
2969 this->swap_items(cur_pos, target);
2970 cur_pos = target;
2971 child = (cur_pos<<1)+1;
2972 }
2973 }

References tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::compare, internal::item_buffer< T, cache_aligned_allocator< T > >::get_my_item(), tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::mark, and internal::item_buffer< T, cache_aligned_allocator< T > >::swap_items().

Referenced by tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::prio_pop().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ reset_node()

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
void tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::reset_node ( reset_flags  f)
inlineprotectedvirtual

Implements tbb::flow::interface11::graph_node.

Definition at line 2798 of file flow_graph.h.

2798 {
2799 mark = 0;
2801 }
void reset_node(reset_flags f) __TBB_override
Definition: flow_graph.h:2553

References tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::mark, and tbb::flow::interface11::buffer_node< T, Allocator >::reset_node().

Here is the call graph for this function:

◆ try_put_and_add_task()

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
void tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::try_put_and_add_task ( task *&  last_task)
inlineprivate

Definition at line 2873 of file flow_graph.h.

2873 {
2874 task * new_task = this->my_successors.try_put_task(this->prio());
2875 if (new_task) {
2876 // workaround for icc bug
2877 graph& graph_ref = this->graph_reference();
2878 last_task = combine_tasks(graph_ref, last_task, new_task);
2879 prio_pop();
2880 }
2881 }
void const char const char int ITT_FORMAT __itt_group_sync x void const char ITT_FORMAT __itt_group_sync s void ITT_FORMAT __itt_group_sync p void ITT_FORMAT p void ITT_FORMAT p no args __itt_suppress_mode_t unsigned int void size_t ITT_FORMAT d void ITT_FORMAT p void ITT_FORMAT p __itt_model_site __itt_model_site_instance ITT_FORMAT p __itt_model_task * task
static tbb::task * combine_tasks(graph &g, tbb::task *left, tbb::task *right)
Definition: flow_graph.h:199
internal::round_robin_cache< T, null_rw_mutex > my_successors
Definition: flow_graph.h:2077

References tbb::flow::interface11::combine_tasks(), tbb::flow::interface11::buffer_node< T, __TBB_DEFAULT_NODE_ALLOCATOR(T) >::graph_reference(), tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::prio(), and tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::prio_pop().

Here is the call graph for this function:

Friends And Related Function Documentation

◆ buffer_node

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
template<typename , typename >
friend class buffer_node
friend

Definition at line 2862 of file flow_graph.h.

Member Data Documentation

◆ compare

template<typename T , typename Compare = std::less<T>, typename Allocator = __TBB_DEFAULT_NODE_ALLOCATOR(T)>
Compare tbb::flow::interface11::priority_queue_node< T, Compare, Allocator >::compare
private

◆ mark

◆ reserved_item


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

Copyright © 2005-2020 Intel Corporation. All Rights Reserved.

Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are registered trademarks or trademarks of Intel Corporation or its subsidiaries in the United States and other countries.

* Other names and brands may be claimed as the property of others.