167         __TBB_ASSERT(!rehash_required(b->node_list.load(std::memory_order_relaxed)), nullptr);  in add_to_bucket()
168         n->next = b->node_list.load(std::memory_order_relaxed);  in add_to_bucket()
184 …__TBB_ASSERT( !is_valid(my_table[k].load(std::memory_order_relaxed)), "Wrong concurrent assignment…
218         segment_ptr_type buckets_ptr = my_table[s].load(std::memory_order_relaxed);  in delete_segment()
243         segment_ptr_type seg = my_table[s].load(std::memory_order_acquire);  in get_bucket()
251         while (segment_ptr_type seg = my_table[++s].load(std::memory_order_relaxed))  in mark_rehashed_levels()
252             if (rehash_required(seg[h].node_list.load(std::memory_order_relaxed))) {  in mark_rehashed_levels()
262         m_now = my_mask.load(std::memory_order_acquire);  in check_mask_race()
280 …          if (!rehash_required(get_bucket(h & m_old)->node_list.load(std::memory_order_acquire))) {  in check_rehashing_collision()
294 …__TBB_ASSERT( is_valid(my_table[new_seg-1].load(std::memory_order_relaxed)), "new allocations must…  in insert_new_node()
297             if (!(my_table[new_seg].load(std::memory_order_acquire))  in insert_new_node()
307         bool is_initial = !my_size.load(std::memory_order_relaxed);  in reserve()
308         for (size_type m = my_mask.load(std::memory_order_relaxed); buckets > m;  in reserve()
309             m = my_mask.load(std::memory_order_relaxed))  in reserve()
322             auto temp = my_embedded_segment[i].node_list.load(std::memory_order_relaxed);  in internal_swap_content()
323 …my_embedded_segment[i].node_list.store(table.my_embedded_segment[i].node_list.load(std::memory_ord…  in internal_swap_content()
328             auto temp = my_table[i].load(std::memory_order_relaxed);  in internal_swap_content()
329             my_table[i].store(table.my_table[i].load(std::memory_order_relaxed),  in internal_swap_content()
336         my_mask.store(other.my_mask.load(std::memory_order_relaxed), std::memory_order_relaxed);  in internal_move()
339         my_size.store(other.my_size.load(std::memory_order_relaxed), std::memory_order_relaxed);  in internal_move()
348             my_table[i].store(other.my_table[i].load(std::memory_order_relaxed),  in internal_move()
441         while (k <= my_map->my_mask.load(std::memory_order_relaxed)) {  in advance_to_next_bucket()
446             node_base *n = my_bucket->node_list.load(std::memory_order_relaxed);  in advance_to_next_bucket()
530 …ator( map, 0, map.my_embedded_segment, map.my_embedded_segment->node_list.load(std::memory_order_r…
531 …      my_end( Iterator( map, map.my_mask.load(std::memory_order_relaxed) + 1, nullptr, nullptr ) ),
560         my_midpoint = Iterator(*my_begin.my_map,m,b,b->node_list.load(std::memory_order_relaxed));  in set_midpoint()
698         node *n = static_cast<node*>( b->node_list.load(std::memory_order_relaxed) );  in __TBB_requires()
714             if (rehash_required(my_b->node_list.load(std::memory_order_acquire))  in __TBB_requires()
717 …if (rehash_required(my_b->node_list.load(std::memory_order_relaxed))) base->rehash_bucket(my_b, h)…  in __TBB_requires()
720 …          __TBB_ASSERT(!rehash_required(my_b->node_list.load(std::memory_order_relaxed)), nullptr);  in __TBB_requires()
738         node_base* curr = b_old()->node_list.load(std::memory_order_acquire);  in __TBB_requires()
964         hashcode_type mask = this->my_mask.load(std::memory_order_relaxed);  in __TBB_requires()
969             node_base *n = bp->node_list.load(std::memory_order_relaxed);  in __TBB_requires()
978                 } while( rehash_required(b_old->node_list.load(std::memory_order_relaxed)) );  in __TBB_requires()
982                 node_base* curr = b_old->node_list.load(std::memory_order_relaxed);  in __TBB_requires()
995 …__TBB_ASSERT(!rehash_required(b_new->node_list.load(std::memory_order_relaxed)), "hash() function …  in __TBB_requires()
1009         hashcode_type m = this->my_mask.load(std::memory_order_relaxed);  in __TBB_requires()
1013 …__TBB_ASSERT( s+1 == this->pointers_per_table || !this->my_table[s+1].load(std::memory_order_relax…  in __TBB_requires()
1015 …__TBB_ASSERT(this->is_valid(this->my_table[s].load(std::memory_order_relaxed)), "wrong mask or con…  in __TBB_requires()
1016             segment_ptr_type buckets_ptr = this->my_table[s].load(std::memory_order_relaxed);  in __TBB_requires()
1019                 for( node_base *n = buckets_ptr[i].node_list.load(std::memory_order_relaxed);  in __TBB_requires()
1020 …                  this->is_valid(n); n = buckets_ptr[i].node_list.load(std::memory_order_relaxed) )  in __TBB_requires()
1046 …*this, 0, this->my_embedded_segment, this->my_embedded_segment->node_list.load(std::memory_order_r…  in __TBB_requires()
1047 …*this, 0, this->my_embedded_segment, this->my_embedded_segment->node_list.load(std::memory_order_r…  in __TBB_requires()
1048 …*this, 0, this->my_embedded_segment, this->my_embedded_segment->node_list.load(std::memory_order_r…  in __TBB_requires()
1068     size_type size() const { return this->my_size.load(std::memory_order_acquire); }  in __TBB_requires()
1079     size_type bucket_count() const { return this->my_mask.load(std::memory_order_relaxed) + 1; }  in __TBB_requires()
1279         hashcode_type m = this->my_mask.load(std::memory_order_acquire);  in __TBB_requires()
1341                         m = this->my_mask.load(std::memory_order_acquire);  in __TBB_requires()
1385         hashcode_type mask = this->my_mask.load(std::memory_order_acquire);  in __TBB_requires()
1390             node_base* curr = b()->node_list.load(std::memory_order_relaxed);  in __TBB_requires()
1427         hashcode_type mask = this->my_mask.load(std::memory_order_acquire);  in __TBB_requires()
1434             erase_node = b()->node_list.load(std::memory_order_relaxed);  in __TBB_requires()
1470         hashcode_type m = this->my_mask.load(std::memory_order_relaxed);  in __TBB_requires()
1474         while (rehash_required(b->node_list.load(std::memory_order_relaxed))) {  in __TBB_requires()
1487         hashcode_type mask = source.my_mask.load(std::memory_order_relaxed);  in __TBB_requires()
1488         if( this->my_mask.load(std::memory_order_relaxed) == mask ) { // optimized version  in __TBB_requires()
1489             this->reserve(source.my_size.load(std::memory_order_relaxed)); // TODO: load_factor?  in __TBB_requires()
1495 …__TBB_ASSERT(!rehash_required(dst->node_list.load(std::memory_order_relaxed)), "Invalid bucket in …  in __TBB_requires()
1496                 node *n = static_cast<node*>( src->node_list.load(std::memory_order_relaxed) );  in __TBB_requires()
1507 …} else internal_copy(source.begin(), source.end(), source.my_size.load(std::memory_order_relaxed));  in __TBB_requires()
1513         hashcode_type m = this->my_mask.load(std::memory_order_relaxed);  in __TBB_requires()
1517 …__TBB_ASSERT(!rehash_required(b->node_list.load(std::memory_order_relaxed)), "Invalid bucket in de…  in __TBB_requires()
1575         hashcode_type m = this->my_mask.load(std::memory_order_acquire);  in __TBB_requires()
1581         if (rehash_required(b->node_list.load(std::memory_order_acquire)))  in __TBB_requires()
1585                 if (rehash_required(b->node_list.load(std::memory_order_relaxed)))  in __TBB_requires()
1589             __TBB_ASSERT(!rehash_required(b->node_list.load(std::memory_order_relaxed)), nullptr);  in __TBB_requires()