#include <flow_graph.h>

Inheritance diagram for tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >:

Collaboration diagram for tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >:

Classes
struct	DoCleanup

Public Types
typedef ValueType	value_type

typedef buffer_element_type< value_type >::type	element_type

typedef value_type *	pointer_type

typedef element_type *	list_array_type

typedef list_array_type *	pointer_array_type

typedef Allocator::template rebind< list_array_type >::other	pointer_array_allocator_type

typedef Allocator::template rebind< element_type >::other	elements_array_allocator

typedef tbb::internal::strip< Key >::type	Knoref

Public Member Functions
	hash_buffer ()

	~hash_buffer ()

void	reset ()

void	set_key_func (ValueToKey *vtk)

ValueToKey *	get_key_func ()

bool	insert_with_key (const value_type &v)

bool	find_ref_with_key (const Knoref &k, pointer_type &v)

bool	find_with_key (const Knoref &k, value_type &v)

void	delete_with_key (const Knoref &k)

Static Public Attributes
static const size_t	INITIAL_SIZE = 8

Private Member Functions
size_t	mask ()

void	set_up_free_list (element_type **p_free_list, list_array_type la, size_t sz)

void	grow_array ()

void	internal_insert_with_key (element_type **p_pointer_array, size_t p_sz, list_array_type &p_free_list, const value_type &v)

void	internal_initialize_buffer ()

Static Private Member Functions
static void	internal_free_buffer (pointer_array_type &pa, list_array_type &el, size_t &sz, size_t &ne)

Private Attributes
ValueToKey *	my_key

size_t	my_size

size_t	nelements

pointer_array_type	pointer_array

list_array_type	elements_array

element_type *	free_list

Detailed Description

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>
class tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >

Definition at line 49 of file flow_graph.h.

Member Typedef Documentation

◆ element_type

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

typedef buffer_element_type< value_type >::type tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::element_type

Definition at line 53 of file flow_graph.h.

◆ elements_array_allocator

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

typedef Allocator::template rebind<element_type>::other tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::elements_array_allocator

Definition at line 58 of file flow_graph.h.

◆ Knoref

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

typedef tbb::internal::strip<Key>::type tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::Knoref

Definition at line 59 of file flow_graph.h.

◆ list_array_type

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

typedef element_type* tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::list_array_type

Definition at line 55 of file flow_graph.h.

◆ pointer_array_allocator_type

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

typedef Allocator::template rebind<list_array_type>::other tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::pointer_array_allocator_type

Definition at line 57 of file flow_graph.h.

◆ pointer_array_type

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

typedef list_array_type* tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::pointer_array_type

Definition at line 56 of file flow_graph.h.

◆ pointer_type

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

typedef value_type* tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::pointer_type

Definition at line 54 of file flow_graph.h.

◆ value_type

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

typedef ValueType tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::value_type

Definition at line 52 of file flow_graph.h.

Constructor & Destructor Documentation

◆ hash_buffer()

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::hash_buffer ( )

inline

Definition at line 173 of file flow_graph.h.

180 :

181 edge_list_type built_edges;

◆ ~hash_buffer()

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::~hash_buffer ( )

inline

Definition at line 177 of file flow_graph.h.

180 :

181 edge_list_type built_edges;

Member Function Documentation

◆ delete_with_key()

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

void tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::delete_with_key ( const Knoref & k )

inline

Definition at line 231 of file flow_graph.h.

                                    {
         return static_cast<void*>(&t);
     }
 
     static const T& from_void_ptr(const void* p) {
         return *static_cast<const T*>(p);
     }
 
     static T& from_void_ptr(void* p) {
         return *static_cast<T*>(p);
     }
 
     static task* try_put_task_wrapper_impl(receiver<T>* const this_recv, const void *p, bool is_async) {
         if (is_async) {
             // This (T) is NOT async and incoming 'A<X> t' IS async
             // Get data from async_msg

◆ find_ref_with_key()

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

bool tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::find_ref_with_key	(	const Knoref &	k,
		pointer_type &	v
	)

inline

Definition at line 208 of file flow_graph.h.

218 {

219

◆ find_with_key()

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

bool tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::find_with_key	(	const Knoref &	k,
		value_type &	v
	)

inline

Definition at line 221 of file flow_graph.h.

                      {
     typedef async_msg<T> async_type;
     typedef T filtered_type;
 
     static const bool is_async_type = false;
 
     static const void* to_void_ptr(const T& t) {

◆ get_key_func()

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

ValueToKey* tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::get_key_func ( )

inline

Definition at line 191 of file flow_graph.h.

194 {

◆ grow_array()

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

void tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::grow_array ( )

inlineprivate

Definition at line 96 of file flow_graph.h.

               {
 namespace flow {
 
 enum concurrency { unlimited = 0, serial = 1 };
 
 namespace interface11 {
 
 struct null_type {};
 
 class continue_msg {};
 
 template< typename T > class sender;
 template< typename T > class receiver;
 class continue_receiver;
 
 template< typename T, typename U > class limiter_node;  // needed for resetting decrementer
 
 template< typename R, typename B > class run_and_put_task;
 
 namespace internal {

◆ insert_with_key()

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

bool tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::insert_with_key ( const value_type & v )

inline

Definition at line 193 of file flow_graph.h.

               {
 namespace flow {
 namespace interface11 {
 
 // enqueue left task if necessary. Returns the non-enqueued task if there is one.
 static inline tbb::task *combine_tasks(graph& g, tbb::task * left, tbb::task * right) {
     // if no RHS task, don't change left.
     if (right == NULL) return left;
     // right != NULL
     if (left == NULL) return right;
     if (left == SUCCESSFULLY_ENQUEUED) return right;
     // left contains a task

◆ internal_free_buffer()

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

static void tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::internal_free_buffer	(	pointer_array_type &	pa,
		list_array_type &	el,
		size_t &	sz,
		size_t &	ne
	)

inlinestaticprivate

Definition at line 150 of file flow_graph.h.

                         {
         built_edges.push_back(&s);
     }
 
     void delete_edge(C &s) {
         for (typename edge_list_type::iterator i = built_edges.begin(); i != built_edges.end(); ++i) {
             if (*i == &s) {
                 (void)built_edges.erase(i);
                 return;  // only remove one predecessor per request
             }
         }
     }
 
     void copy_edges(edge_list_type &v) {
         v = built_edges;
     }
 
     size_t edge_count() {
         return (size_t)(built_edges.size());
     }
 

◆ internal_initialize_buffer()

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

void tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::internal_initialize_buffer ( )

inlineprivate

Definition at line 142 of file flow_graph.h.

                      {
 
 public:

◆ internal_insert_with_key()

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

void tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::internal_insert_with_key	(	element_type **	p_pointer_array,
		size_t	p_sz,
		list_array_type &	p_free_list,
		const value_type &	v
	)

inlineprivate

Definition at line 130 of file flow_graph.h.

                 {
 struct following;
 struct preceding;
 }
 template<typename Order, typename... Args> struct node_set;
 #endif
 

◆ mask()

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

size_t tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::mask ( )

inlineprivate

Definition at line 69 of file flow_graph.h.

77 {

◆ reset()

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

void tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::reset ( )

inline

Definition at line 182 of file flow_graph.h.

194 {

◆ set_key_func()

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

void tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::set_key_func ( ValueToKey * vtk )

inline

Definition at line 189 of file flow_graph.h.

194 {

◆ set_up_free_list()

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

void tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::set_up_free_list	(	element_type **	p_free_list,
		list_array_type	la,
		size_t	sz
	)

inlineprivate

Definition at line 71 of file flow_graph.h.

77 {

Member Data Documentation

◆ elements_array

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

list_array_type tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::elements_array

private

Definition at line 66 of file flow_graph.h.

◆ free_list

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

element_type* tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::free_list

private

Definition at line 67 of file flow_graph.h.

◆ INITIAL_SIZE

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

const size_t tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::INITIAL_SIZE = 8

static

Definition at line 51 of file flow_graph.h.

◆ my_key

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

ValueToKey* tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::my_key

private

Definition at line 62 of file flow_graph.h.

◆ my_size

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

size_t tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::my_size

private

Definition at line 63 of file flow_graph.h.

◆ nelements

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

size_t tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::nelements

private

Definition at line 64 of file flow_graph.h.

◆ pointer_array

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>

pointer_array_type tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >::pointer_array

private

Definition at line 65 of file flow_graph.h.

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

flow_graph.h

Classes

Public Types

Public Member Functions

Static Public Attributes

Private Member Functions

Static Private Member Functions

Private Attributes

Detailed Description

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >> class tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >

Member Typedef Documentation

◆ element_type

◆ elements_array_allocator

◆ Knoref

◆ list_array_type

◆ pointer_array_allocator_type

◆ pointer_array_type

◆ pointer_type

◆ value_type

Constructor & Destructor Documentation

◆ hash_buffer()

◆ ~hash_buffer()

Member Function Documentation

◆ delete_with_key()

◆ find_ref_with_key()

◆ find_with_key()

◆ get_key_func()

◆ grow_array()

◆ insert_with_key()

◆ internal_free_buffer()

◆ internal_initialize_buffer()

◆ internal_insert_with_key()

◆ mask()

◆ reset()

◆ set_key_func()

◆ set_up_free_list()

Member Data Documentation

◆ elements_array

◆ free_list

◆ INITIAL_SIZE

◆ my_key

◆ my_size

◆ nelements

◆ pointer_array

template<typename Key, typename ValueType, typename ValueToKey, typename HashCompare, typename Allocator = tbb::cache_aligned_allocator< typename aligned_pair<ValueType, void *>::type >>
class tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator >