| /oneTBB/src/tbb/ |
| H A D | intrusive_list.h | 38 static intrusive_list_node& node ( T& item ) { return List::node(item); } in node() function
40 static T& item ( intrusive_list_node* node ) { return List::item(node); } in item()
42 static const T& item( const intrusive_list_node* node ) { return List::item(node); } in item()
196 static intrusive_list_node& node ( T& val ) { return val.*NodePtr; } in node() function
198 static T& item ( intrusive_list_node* node ) { in item()
206 static const T& item( const intrusive_list_node* node ) { in item()
222 static intrusive_list_node& node ( T& val ) { return val; } in node() function
224 static T& item ( intrusive_list_node* node ) { return *static_cast<T*>(node); } in item()
226 static const T& item( const intrusive_list_node* node ) { return *static_cast<const T*>(node); } in item()
|
| H A D | concurrent_monitor.h | 203 void prepare_wait( wait_node<Context>& node) { in prepare_wait()
228 inline bool commit_wait( wait_node<Context>& node ) { in commit_wait()
240 void cancel_wait( wait_node<Context>& node ) { in cancel_wait()
259 bool wait(Pred&& pred, NodeType&& node) { in wait()
370 auto* node = static_cast<wait_node<Context>*>(n); in notify_relaxed() local
405 auto* node = static_cast<wait_node<Context>*>(n); in notify_one_relaxed() local
463 bool guarded_call(Pred&& predicate, NodeType& node) { in guarded_call()
478 …wait_node<Context>* to_wait_node( base_node* node ) { return static_cast<wait_node<Context>*>(node… in to_wait_node()
|
| /oneTBB/include/oneapi/tbb/detail/ |
| H A D | _flow_graph_trace_impl.h | 45 static inline void fgt_alias_port(void *node, void *p, bool visible) { in fgt_alias_port()
52 static inline void fgt_composite ( void* codeptr, void *node, void *graph ) { in fgt_composite()
62 static inline void fgt_internal_alias_input_port( void *node, void *p, string_resource_index name_i… in fgt_internal_alias_input_port()
67 static inline void fgt_internal_alias_output_port( void *node, void *p, string_resource_index name_… in fgt_internal_alias_output_port()
73 void alias_input_port(void *node, receiver<InputType>* port, string_resource_index name_index) { in alias_input_port()
|
| H A D | _concurrent_skip_list.h | 94 auto* node = reinterpret_cast<skip_list_node*>(allocator_traits::allocate(alloc, sz)); in create() local
107 static void destroy( container_allocator_type& alloc, skip_list_node* node ) { in destroy()
138 node_ptr node = res.load(std::memory_order_acquire); in atomic_next() local
723 node_ptr node = const_range_type::begin().my_node_ptr; in begin() local
728 node_ptr node = const_range_type::end().my_node_ptr; in end() local
775 bool found( node_ptr node, const K& key ) const { in found()
873 node_ptr internal_find_position( size_type level, node_ptr& prev, node_ptr node, in internal_find_position()
909 void fill_prev_array_for_existing_node( array_type& prev_nodes, node_ptr node ) { in fill_prev_array_for_existing_node()
1103 node_ptr node = create_node(my_rng()); in create_value_node() local
1129 void delete_node( node_ptr node ) { in delete_node()
[all …]
|
| H A D | _concurrent_unordered_base.h | 915 void destroy_node( node_ptr node ) { in destroy_node()
1184 … for (node_ptr node = prev_node->next(); node != nullptr; prev_node = node, node = node->next()) { in internal_extract() local
1323 for (node_ptr node = other.my_head.next(); node != nullptr; node = node->next()) { in internal_copy() local
1343 for (node_ptr node = other.my_head.next(); node != nullptr; node = node->next()) { in internal_move() local
|
| /oneTBB/test/tbb/ |
| H A D | test_profiling.cpp | 83 tbb::flow::async_node<int, int> node(g, 1, async_body{}); variable
115 tbb::flow::continue_node<tbb::flow::continue_msg> node(g, variable
127 tbb::flow::function_node<int, int> node(g, 1, [](const int& val) -> int {return val; }); in __anon8094d7940202() variable
161 tbb::flow::input_node<int> node(g, [](tbb::flow_control& ) -> int { return 0;}); in __anon8094d7940302() variable
177 tbb::flow::limiter_node<int> node(g, 1); variable
191 tbb::flow::multifunction_node<int, std::tuple<int>> node(g, 1, mf_body{}); variable
|
| H A D | test_partitioner.h | 308 void push_node(TreeNode* node) { in push_node()
334 void push_subnode(TreeNode *&root_node, TreeNode *node) { in push_subnode()
372 bool has_children(TreeNode *node) { return node->m_left || node->m_right; } in has_children()
374 bool is_look_like_left_sibling(TreeNode *root_node, TreeNode *node) { in is_look_like_left_sibling()
381 bool has_left_child(TreeNode *node) { return node->m_left != nullptr; } in has_left_child()
383 bool is_subnode(TreeNode *root_node, TreeNode *node) { in is_subnode()
393 void remove_node_recursively(TreeNode *node) { in remove_node_recursively()
398 delete node; in remove_node_recursively() local
424 void fill_leafs_impl(TreeNode* node, std::vector<TreeNode*>& leafs) const { in fill_leafs_impl()
|
| H A D | test_continue_node.cpp | 338 continue_node<continue_msg> node(g, passing_body<continue_msg>()); in test_successor_cache_specialization() local
|
| H A D | test_async_node.cpp | 732 …node_t node(follows(preds[0], preds[1], preds[2]), unlimited, [&](int input, node_t::gateway_type&… in test_follows() local
766 node_t node(precedes(successors[0]), unlimited, [&](int input, node_t::gateway_type& gtw) { in test_precedes() local
|
| H A D | test_multifunction_node.cpp | 497 …multinode node(precedes(b1, b2), unlimited, [](const int& i, multinode::output_ports_type& op) -> … in test_precedes() local
|
| H A D | test_indexer_node.cpp | 618 indexer_node<int, float, double> node(precedes(buf1, buf2, buf3)); in test_precedes() local
|
| /oneTBB/test/common/ |
| H A D | node_handling_support.h | 32 bool compare_handle_getters( const Handle& node, const std::pair<typename Handle::key_type, typenam… in compare_handle_getters()
37 bool compare_handle_getters( const Handle& node, const typename Handle::value_type& value ) { in compare_handle_getters()
42 void set_node_handle_value( Handle& node, const std::pair<typename Handle::key_type, typename Handl… in set_node_handle_value()
48 void set_node_handle_value( Handle& node, const typename Handle::value_type& value ) { in set_node_handle_value()
|
| /oneTBB/include/oneapi/tbb/ |
| H A D | flow_graph.h | 3212 inline void set_name(const input_node<Output>& node, const char *name) { in set_name()
3222 inline void set_name(const continue_node<Output,Policy>& node, const char *name) { in set_name()
3227 inline void set_name(const broadcast_node<T>& node, const char *name) { in set_name()
3232 inline void set_name(const buffer_node<T>& node, const char *name) { in set_name()
3237 inline void set_name(const queue_node<T>& node, const char *name) { in set_name()
3242 inline void set_name(const sequencer_node<T>& node, const char *name) { in set_name()
3257 inline void set_name(const join_node<OutputTuple, JP>& node, const char *name) { in set_name()
3262 inline void set_name(const indexer_node<Types...>& node, const char *name) { in set_name()
3267 inline void set_name(const overwrite_node<T>& node, const char *name) { in set_name()
3272 inline void set_name(const write_once_node<T>& node, const char *name) { in set_name()
[all …]
|
| H A D | partitioner.h | 116 struct node { struct
121 node(node* parent, int ref_count) : in node() function
|
| H A D | concurrent_hash_map.h | 374 using node = typename Container::node; variable
631 class node; in __TBB_requires() local
|
| /oneTBB/test/conformance/ |
| H A D | conformance_graph.cpp | 54 oneapi::tbb::flow::input_node<int> node(g, fun); in test_input_node_rf_reset_protocol() local
|