56     hash_map_node_base* next;  member
168         n->next = b->node_list.load(std::memory_order_relaxed);  in add_to_bucket()
411         my_node = static_cast<node*>( my_node->next );
700             n = static_cast<node*>( n->next );  in __TBB_requires()
748                 node_base* next = curr->next;  in __TBB_requires()  local
751                     b_old()->node_list.store(curr->next, std::memory_order_relaxed);  in __TBB_requires()
753                     prev->next = curr->next;  in __TBB_requires()
756                 curr = next;  in __TBB_requires()
759                 curr = curr->next;  in __TBB_requires()
987                         node_base* next = curr->next;  in __TBB_requires()  local
990                             b_old->node_list.store(curr->next, std::memory_order_relaxed);  in __TBB_requires()
992                             prev->next = curr->next;  in __TBB_requires()
997                         curr = next;  in __TBB_requires()
1000                         curr = curr->next;  in __TBB_requires()
1022                     buckets_ptr[i].node_list.store(n->next, std::memory_order_relaxed);  in __TBB_requires()
1394                 curr = curr->next;  in __TBB_requires()
1406                 b()->node_list.store(curr->next, std::memory_order_relaxed);  in __TBB_requires()
1408                 prev->next = curr->next;  in __TBB_requires()
1437                 erase_node = erase_node->next;  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()
1500                 } else for(; n; n = static_cast<node*>( n->next ) ) {  in __TBB_requires()