Home
last modified time | relevance | path

Searched refs:new_node (Results 1 – 5 of 5) sorted by relevance

/oneTBB/include/oneapi/tbb/detail/
H A D_concurrent_unordered_base.h1001 value_node_ptr new_node = create_insert_node(order_key); in internal_insert() local
1004 while (!try_insert(prev, new_node, curr)) { in internal_insert()
1075 new_node->set_next(current_next_node); in try_insert()
1144 return new_node; in create_node()
1324 node_ptr new_node; in internal_copy() local
1330 new_node = create_dummy_node(node->order_key()); in internal_copy()
1334 last_node->set_next(new_node); in internal_copy()
1335 last_node = new_node; in internal_copy()
1344 node_ptr new_node; in internal_move() local
1355 last_node->set_next(new_node); in internal_move()
[all …]
H A D_concurrent_skip_list.h943 node_ptr new_node = create_value_node(std::forward<Args>(args)...); in internal_insert() local
946 delete_value_node(new_node); in internal_insert()
951 std::pair<iterator, bool> internal_insert_node( node_ptr new_node ) { in internal_insert_node() argument
954 size_type new_height = new_node->height(); in internal_insert_node()
960 … fill_prev_curr_arrays(prev_nodes, curr_nodes, new_node, get_key(new_node), compare, head_node); in internal_insert_node()
966 new_node->set_index_number(prev->index_number() + 1); in internal_insert_node()
968 if (found(next, get_key(new_node))) { in internal_insert_node()
973 new_node->set_next(0, next); in internal_insert_node()
974 if (!prev->atomic_next(0).compare_exchange_strong(next, new_node)) { in internal_insert_node()
997 new_node->set_next(level, next); in internal_insert_node()
[all …]
/oneTBB/test/tbb/
H A Dtest_split_node.cpp154 my_sink_node_type *new_node = new my_sink_node_type(g); in add_sink_nodes() local
155 tbb::flow::make_edge( tbb::flow::output_port<ELEM-1>(my_split) , *new_node); in add_sink_nodes()
156 all_sink_nodes[ELEM-1] = (void *)new_node; in add_sink_nodes()
194 my_sink_node_type *new_node = new my_sink_node_type(g); in add_sink_nodes() local
195 tbb::flow::make_edge( tbb::flow::output_port<0>(my_split) , *new_node); in add_sink_nodes()
196 all_sink_nodes[0] = (void *)new_node; in add_sink_nodes()
H A Dtest_indexer_node.cpp175 …my_input_node_type *new_node = new my_input_node_type(g, my_input_body<IT>((IT)(ELEM+1), i, nInput… in add_input_nodes() local
176 tbb::flow::make_edge(*new_node, tbb::flow::input_port<ELEM-1>(my_indexer)); in add_input_nodes()
178 all_input_nodes[ELEM-1][i] = (void *)new_node; in add_input_nodes()
179 new_node->activate(); in add_input_nodes()
221 … my_input_node_type *new_node = new my_input_node_type(g, my_input_body<IT>((IT)2, i, nInputs)); in add_input_nodes() local
222 tbb::flow::make_edge(*new_node, tbb::flow::input_port<0>(my_indexer)); in add_input_nodes()
223 all_input_nodes[0][i] = (void *)new_node; in add_input_nodes()
224 new_node->activate(); in add_input_nodes()
H A Dtest_join_node.h1040 all_input_nodes[ELEM-1][i] = (void *)new_node;
1041 new_node->activate();
1050 tbb::flow::make_edge(my_input, *new_node);
1051 all_input_nodes[ELEM-1][0] = (void *)new_node;
1107 all_input_nodes[0][i] = (void *)new_node;
1108 new_node->activate();
1115 tbb::flow::make_edge(my_input, *new_node);
1116 all_input_nodes[0][0] = (void *)new_node;
1231 my_queue_node_type *new_node = new my_queue_node_type(g);
1233 all_input_nodes[ELEM-1][0] = (void *)new_node;
[all …]