Searched refs:m_old (Results 1 – 1 of 1) sorted by relevance
261 hashcode_type m_now, m_old = m; in check_mask_race() local263 if (m_old != m_now) { 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() argument271 __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()275 …for( ++m_old; !(h & m_old); m_old <<= 1 ) // at maximum few rounds depending on the first block si… in check_rehashing_collision()277 m_old = (m_old<<1) - 1; // get full mask from a bit in check_rehashing_collision()278 __TBB_ASSERT((m_old&(m_old+1))==0 && m_old <= m, nullptr); in check_rehashing_collision()280 … if (!rehash_required(get_bucket(h & m_old)->node_list.load(std::memory_order_acquire))) { in check_rehashing_collision()