Intel(R) Threading Building Blocks Doxygen Documentation  version 4.2.3
tbb::flow::interface11::internal::hash_buffer< Key, ValueType, ValueToKey, HashCompare, Allocator > Class Template Reference

#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_typepointer_type
 
typedef element_typelist_array_type
 
typedef list_array_typepointer_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_typefree_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.

179  :
180  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.

179  :
180  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.

232  {
233  return static_cast<void*>(&t);
234  }
235 
236  static const T& from_void_ptr(const void* p) {
237  return *static_cast<const T*>(p);
238  }
239 
240  static T& from_void_ptr(void* p) {
241  return *static_cast<T*>(p);
242  }
243 
244  static task* try_put_task_wrapper_impl(receiver<T>* const this_recv, const void *p, bool is_async) {
245  if (is_async) {
246  // This (T) is NOT async and incoming 'A<X> t' IS async
247  // Get data from async_msg
248  const async_msg<filtered_type>& msg = async_helpers< async_msg<filtered_type> >::from_void_ptr(p);
void const char const char int ITT_FORMAT __itt_group_sync p
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

◆ 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.

217  {
218 
219 template < typename T > class async_storage;

◆ 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.

222  {
223  typedef async_msg<T> async_type;
224  typedef T filtered_type;
225 
226  static const bool is_async_type = false;
227 
228  static const void* to_void_ptr(const T& t) {
229  return static_cast<const void*>(&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.

193 {

◆ 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.

101  {
102 namespace flow {
103 
105 enum concurrency { unlimited = 0, serial = 1 };
106 
107 namespace interface11 {
108 
110 struct null_type {};
111 
113 class continue_msg {};
114 
116 template< typename T > class sender;
117 template< typename T > class receiver;
118 class continue_receiver;
119 
120 template< typename T, typename U > class limiter_node; // needed for resetting decrementer
121 
122 template< typename R, typename B > class run_and_put_task;
123 
124 namespace internal {
125 
126 template<typename T, typename M> class successor_cache;
concurrency
An enumeration the provides the two most common concurrency levels: unlimited and serial...
Definition: flow_graph.h:105

◆ 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.

193  {
194 namespace flow {
195 namespace interface11 {
196 
197 // enqueue left task if necessary. Returns the non-enqueued task if there is one.
198 static inline tbb::task *combine_tasks(graph& g, tbb::task * left, tbb::task * right) {
199  // if no RHS task, don't change left.
200  if (right == NULL) return left;
201  // right != NULL
202  if (left == NULL) return right;
203  if (left == SUCCESSFULLY_ENQUEUED) return right;
204  // left contains a task
205  if (right != SUCCESSFULLY_ENQUEUED) {
Base class for user-defined tasks.
Definition: task.h:615
static tbb::task *const SUCCESSFULLY_ENQUEUED
static tbb::task * combine_tasks(graph &g, tbb::task *left, tbb::task *right)
Definition: flow_graph.h:198

◆ 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.

153  {
154  for (typename edge_list_type::iterator i = built_edges.begin(); i != built_edges.end(); ++i) {
155  if (*i == &s) {
156  (void)built_edges.erase(i);
157  return; // only remove one predecessor per request
158  }
159  }
160  }
161 
162  void copy_edges(edge_list_type &v) {
163  v = built_edges;
164  }
165 
166  size_t edge_count() {
167  return (size_t)(built_edges.size());
168  }
169 
170  void clear() {
void const char const char int ITT_FORMAT __itt_group_sync s

◆ 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.

144  {
145 
146 public:
147  typedef std::list<C *, tbb::tbb_allocator<C *> > edge_list_type;

◆ 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.

133  {
134 struct following;
135 struct preceding;
136 }
137 template<typename Order, typename... Args> struct node_set;
138 #endif
139 
140 #if TBB_DEPRECATED_FLOW_NODE_EXTRACTION

◆ 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.

76 {

◆ 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.

193  {

◆ 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.

193 {

◆ 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.

76  {
77  namespace flow {

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:

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.