Searched refs:erase_node (Results 1 – 2 of 2) sorted by relevance
1425 node_base *erase_node; in __TBB_requires() local1434 erase_node = b()->node_list.load(std::memory_order_relaxed); in __TBB_requires()1435 …while (this->is_valid(erase_node) && !my_hash_compare.equal(key, static_cast<node*>(erase_node)->v… in __TBB_requires()1436 prev = erase_node; in __TBB_requires()1437 erase_node = erase_node->next; in __TBB_requires()1440 if (erase_node == nullptr) { // not found, but mask could be changed in __TBB_requires()1452 b()->node_list.store(erase_node->next, std::memory_order_relaxed); in __TBB_requires()1454 prev->next = erase_node->next; in __TBB_requires()1459 typename node::scoped_type item_locker( erase_node->mutex, /*write=*/true ); in __TBB_requires()1462 delete_node(erase_node); // Only one thread can delete it due to write lock on the bucket in __TBB_requires()
1041 node_ptr erase_node = it.my_node_ptr; in internal_extract() local1042 node_ptr next_node = erase_node->next(0); in internal_extract()1043 fill_prev_array_for_existing_node(prev_nodes, erase_node); in internal_extract()1045 for (size_type level = 0; level < erase_node->height(); ++level) { in internal_extract()1046 prev_nodes[level]->set_next(level, erase_node->next(level)); in internal_extract()1047 erase_node->set_next(level, nullptr); in internal_extract()1051 result.first = erase_node; in internal_extract()