Home
last modified time | relevance | path

Searched refs:my_node (Results 1 – 13 of 13) sorted by relevance

/oneTBB/include/oneapi/tbb/detail/
H A D_node_handle.h57 node_handle_base(node_handle_base&& nh) : my_node(nh.my_node), in node_handle_base()
59 nh.my_node = nullptr; in node_handle_base()
69 my_node = nh.my_node;
77 swap(my_node, nh.my_node); in swap()
86 node_handle_base( node* n ) : my_node(n) {} in node_handle_base()
89 if(my_node != nullptr) { in internal_destroy()
92 node_allocator.deallocate(my_node, 1); in internal_destroy()
96 node* get_node_ptr() { return my_node; } in get_node_ptr()
98 void deactivate() { my_node = nullptr; } in deactivate()
100 node* my_node; variable
[all …]
H A D_pipeline_filters.h312 filter_node * my_node;
375 if (my_node) {
381 if (my_node) {
387 if (my_node) {
393 rhs.my_node = nullptr;
400 my_node = rhs;
401 if (my_node) {
410 *this = rhs.my_node;
415 my_node = rhs.my_node;
416 rhs.my_node = nullptr;
[all …]
H A D_flow_graph_body_impl.h250 NodeType &my_node;
255 my_node(n) {}
277 NodeType &my_node;
284 my_node(n), my_input(i) {}
305 NodeType &my_node;
308 : graph_task(g, allocator), my_node(n) {}
336 T* my_node;
347 return my_node->my_graph;
362 T *my_node;
365 return my_node->decrement_counter( 1 );
[all …]
H A D_flow_graph_join_impl.h678 join_node_FE(graph &g) : reserving_forwarding_base(g), my_node(nullptr) {
688 void set_my_node(base_node_type *new_my_node) { my_node = new_my_node; }
700 graph_task* t = allocator.new_object<task_type>(graph_ref, allocator, *my_node);
737 base_node_type *my_node;
749 join_node_FE(graph &g) : queueing_forwarding_base(g), my_node(nullptr) {
760 void set_my_node(base_node_type *new_my_node) { my_node = new_my_node; }
812 base_node_type *my_node;
889 rtask = allocator.new_object<task_type>(this->graph_ref, allocator, *my_node);
960 my_node = nullptr;
969 void set_my_node(base_node_type *new_my_node) { my_node = new_my_node; }
[all …]
/oneTBB/src/tbb/
H A Dtask_group_context.cpp60 ctx.my_context_list->remove(ctx.my_node); in destroy()
76 poison_pointer(ctx.my_node.my_next_node); in destroy()
77 poison_pointer(ctx.my_node.my_prev_node); in destroy()
87 ctx.my_node.my_next_node = &ctx.my_node; in initialize()
88 ctx.my_node.my_prev_node = &ctx.my_node; in initialize()
110 ctx.my_context_list->push_front(ctx.my_node); in register_with()
H A Dintrusive_list.h171 struct dummy_intrusive_list_item { intrusive_list_node my_node; }; member
173 …= dummy_intrusive_list_item, intrusive_list_node U::*NodePtr = &dummy_intrusive_list_item::my_node>
177 class intrusive_list<T, dummy_intrusive_list_item, &dummy_intrusive_list_item::my_node>
H A Dthread_data.h245 d1::task_group_context& ctx = __TBB_get_object_ref(d1::task_group_context, my_node, &(*it)); in propagate_task_group_state()
/oneTBB/test/tbb/
H A Dtest_write_once_node.cpp111 tbb::flow::write_once_node<R> &my_node; member in native_body
115 native_body( tbb::flow::write_once_node<R> &n ) : my_node(n) {} in native_body()
119 CHECK_MESSAGE( my_node.try_put( v1 ) == false, "" ); in operator ()()
120 CHECK_MESSAGE( my_node.is_valid() == true, "" ); in operator ()()
121 CHECK_MESSAGE( my_node.try_get( v1 ) == true, "" ); in operator ()()
H A Dtest_overwrite_node.cpp91 tbb::flow::overwrite_node<R> &my_node; member in native_body
95 native_body( tbb::flow::overwrite_node<R> &n ) : my_node(n) {} in native_body()
99 CHECK_MESSAGE( my_node.try_put( v1 ), "" ); in operator ()()
100 CHECK_MESSAGE( my_node.is_valid() == true, "" ); in operator ()()
/oneTBB/include/oneapi/tbb/
H A Dconcurrent_hash_map.h392 my_node(other.my_node) in hash_map_iterator()
399 my_node = other.my_node;
405 return my_node->value();
411 my_node = static_cast<node*>( my_node->next );
483 node* my_node; variable
488 return i.my_node == j.my_node && i.my_map == j.my_map;
493 return i.my_node != j.my_node || i.my_map != j.my_map;
787 if( my_node ) { in __TBB_requires()
789 my_node = nullptr; in __TBB_requires()
813 node *my_node; in __TBB_requires() local
[all …]
H A Dflow_graph.h2891 receiver_gateway_impl(async_node* node): my_node(node) {} in __TBB_requires()
2893 … fgt_async_reserve(static_cast<typename async_node::receiver_type *>(my_node), &my_node->my_graph); in __TBB_requires()
2894 my_node->my_graph.reserve_wait(); in __TBB_requires()
2898 async_node* n = my_node; in __TBB_requires()
2906 return my_node->try_put_impl(i); in __TBB_requires()
2910 async_node* my_node; in __TBB_requires()
H A Dtask_group.h235 intrusive_list_node my_node; variable
/oneTBB/test/common/
H A Dgraph_utils.h688 NodeType& my_node;
690 native_loop_body(NodeType& node) : my_node(node) {}
694 my_node.try_put(this_id);
739 NodeType& my_node;
743 my_node(node), my_barrier(barrier) {}
746 my_node.try_put(this_id);