Lines Matching refs:node

915     void destroy_node( node_ptr node ) {  in destroy_node()  argument
916 if (node->is_dummy()) { in destroy_node()
919 node_allocator_traits::destroy(dummy_node_allocator, node); in destroy_node()
921 node_allocator_traits::deallocate(dummy_node_allocator, node, 1); in destroy_node()
927 value_node_ptr val_node = static_cast<value_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
1185 if (node == node_to_extract) { in internal_extract()
1186 unlink_node(prev_node, node, node_to_extract->next()); in internal_extract()
1190 __TBB_ASSERT(node->order_key() <= node_to_extract->order_key(), in internal_extract()
1323 for (node_ptr node = other.my_head.next(); node != nullptr; node = node->next()) { in internal_copy() local
1325 if (!node->is_dummy()) { in internal_copy()
1327 … new_node = create_node(node->order_key(), static_cast<value_node_ptr>(node)->value()); in internal_copy()
1330 new_node = create_dummy_node(node->order_key()); in internal_copy()
1331 … my_segments[reverse_bits(node->order_key())].store(new_node, std::memory_order_relaxed); in internal_copy()
1343 for (node_ptr node = other.my_head.next(); node != nullptr; node = node->next()) { in internal_move() local
1345 if (!node->is_dummy()) { in internal_move()
1347 … new_node = create_node(node->order_key(), std::move(static_cast<value_node_ptr>(node)->value())); in internal_move()
1351 new_node = create_dummy_node(node->order_key()); in internal_move()
1352 … my_segments[reverse_bits(node->order_key())].store(new_node, std::memory_order_relaxed); in internal_move()