Home
last modified time | relevance | path

Searched refs:node_ptr (Results 1 – 4 of 4) sorted by relevance

/oneTBB/include/oneapi/tbb/detail/
H A D_concurrent_skip_list.h187 using node_ptr = node_type*; variable
224 node_ptr my_node_ptr;
445 std::pair<node_ptr, node_ptr> extract_result = internal_extract(pos); in unsafe_erase()
479 std::pair<node_ptr, node_ptr> extract_result = internal_extract(pos); in unsafe_extract()
857 node_ptr internal_find_position( size_type level, node_ptr& prev, const K& key, in internal_find_position()
873 node_ptr internal_find_position( size_type level, node_ptr& prev, node_ptr node, in internal_find_position()
901 node_ptr prev = head; in fill_prev_curr_arrays()
913 node_ptr prev = head; in fill_prev_array_for_existing_node()
1036 std::pair<node_ptr, node_ptr> internal_extract( const_iterator it ) { in internal_extract()
1037 std::pair<node_ptr, node_ptr> result(nullptr, nullptr); in internal_extract()
[all …]
H A D_concurrent_unordered_base.h112 node_ptr my_node_ptr;
128 using node_ptr = list_node*;
146 node_ptr next() const { in next()
154 bool try_set_next( node_ptr expected_next, node_ptr new_next ) { in try_set_next()
701 node_ptr my_end_node;
901 node_ptr curr = next; in internal_clear()
1047 node_ptr insert_dummy_node( node_ptr parent_dummy_node, sokey_type order_key ) { in insert_dummy_node()
1051 node_ptr next_node; in insert_dummy_node()
1074 static bool try_insert( node_ptr prev_node, node_ptr new_node, node_ptr current_next_node ) { in try_insert()
1248 void unlink_node( node_ptr prev_node, node_ptr node_to_unlink, node_ptr next_node ) { in unlink_node()
[all …]
H A D_node_handle.h37 static NodeHandleType construct( typename NodeHandleType::node* node_ptr ) { in construct()
38 return NodeHandleType{node_ptr}; in construct()
/oneTBB/include/oneapi/tbb/
H A Dconcurrent_hash_map.h66 bool rehash_required( hash_map_node_base<MutexType>* node_ptr ) { in rehash_required() argument
67 return reinterpret_cast<void*>(node_ptr) == rehash_req_flag; in rehash_required()
72 bool empty_rehashed( hash_map_node_base<MutexType>* node_ptr ) { in empty_rehashed() argument
73 return reinterpret_cast<void*>(node_ptr) == empty_rehashed_flag; in empty_rehashed()
666 node_allocator_traits::destroy(node_allocator, node_ptr); in __TBB_requires()
667 node_allocator_traits::deallocate(node_allocator, node_ptr, 1); in __TBB_requires()
670 node_allocator_traits::construct(node_allocator, node_ptr); in __TBB_requires()
673 return node_ptr; in __TBB_requires()
1377 …insert*/true>(node_ptr->value().first, nullptr, accessor_location(result), is_write_access_needed(… in __TBB_requires()
1502 this->add_to_bucket( dst, node_ptr); in __TBB_requires()
[all …]