260     inline bool check_mask_race( const hashcode_type h, hashcode_type &m ) const {  in check_mask_race()  argument
261         hashcode_type m_now, m_old = m;  in check_mask_race()
264             return check_rehashing_collision(h, m_old, m = m_now);  in check_mask_race()
270 …bool check_rehashing_collision( const hashcode_type h, hashcode_type m_old, hashcode_type m ) cons…  in check_rehashing_collision()  argument
271         __TBB_ASSERT(m_old != m, nullptr); // TODO?: m arg could be optimized out by passing h = h&m  in check_rehashing_collision()
272         if( (h & m_old) != (h & m) ) { // mask changed for this hashcode, rare event  in check_rehashing_collision()
278             __TBB_ASSERT((m_old&(m_old+1))==0 && m_old <= m, nullptr);  in check_rehashing_collision()
308         for (size_type m = my_mask.load(std::memory_order_relaxed); buckets > m;  in reserve()  local
309             m = my_mask.load(std::memory_order_relaxed))  in reserve()
311             enable_segment( segment_index_of( m+1 ), is_initial );  in reserve()
556     size_t m = my_end.my_index-my_begin.my_index;  in set_midpoint()  local
557     if( m > my_grainsize ) {  in set_midpoint()
558         m = my_begin.my_index + m/2u;  in set_midpoint()
559         auto b = my_begin.my_map->get_bucket(m);  in set_midpoint()
560         my_midpoint = Iterator(*my_begin.my_map,m,b,b->node_list.load(std::memory_order_relaxed));  in set_midpoint()
976 …hashcode_type m = ( hashcode_type(1) << tbb::detail::log2( h ) ) - 1; // get parent mask from the …  in __TBB_requires()  local
977                     b_old = this->get_bucket( h &= m );  in __TBB_requires()
1009         hashcode_type m = this->my_mask.load(std::memory_order_relaxed);  in __TBB_requires()  local
1010         __TBB_ASSERT((m&(m+1))==0, "data structure is invalid");  in __TBB_requires()
1012         segment_index_type s = this->segment_index_of( m );  in __TBB_requires()
1279         hashcode_type m = this->my_mask.load(std::memory_order_acquire);  in __TBB_requires()  local
1284             __TBB_ASSERT((m&(m+1))==0, "data structure is invalid");  in __TBB_requires()
1287             bucket_accessor b( this, h & m );  in __TBB_requires()
1314                     if( this->check_mask_race(h, m) )  in __TBB_requires()
1317                     grow_segment = this->insert_new_node( b(), n = tmp_n, m );  in __TBB_requires()
1323                     if( this->check_mask_race( h, m ) )  in __TBB_requires()
1341                         m = this->my_mask.load(std::memory_order_acquire);  in __TBB_requires()
1470         hashcode_type m = this->my_mask.load(std::memory_order_relaxed);  in __TBB_requires()  local
1471         __TBB_ASSERT((m&(m+1))==0, "data structure is invalid");  in __TBB_requires()
1472         h &= m;  in __TBB_requires()
1475 …    m = ( hashcode_type(1) << tbb::detail::log2( h ) ) - 1; // get parent mask from the topmost bit  in __TBB_requires()
1476             b = this->get_bucket( h &= m );  in __TBB_requires()
1513         hashcode_type m = this->my_mask.load(std::memory_order_relaxed);  in __TBB_requires()  local
1516             bucket *b = this->get_bucket( h & m );  in __TBB_requires()
1575         hashcode_type m = this->my_mask.load(std::memory_order_acquire);  in __TBB_requires()  local
1578         __TBB_ASSERT((m&(m+1))==0, "data structure is invalid");  in __TBB_requires()
1579         bucket *b = this->get_bucket( h & m );  in __TBB_requires()
1586 …           const_cast<concurrent_hash_map*>(this)->rehash_bucket( b, h & m ); //recursive rehashing  in __TBB_requires()
1594         else if( this->check_mask_race( h, m ) )  in __TBB_requires()