131             padded_page* q = tail_page.load(std::memory_order_relaxed);  in prepare_page()
139             p = tail_page.load(std::memory_order_relaxed);  in prepare_page()
162 …p->mask.store(p->mask.load(std::memory_order_relaxed) | uintptr_t(1) << index, std::memory_order_r…  in push()
182         padded_page *p = head_page.load(std::memory_order_relaxed);  in pop()
190             if (p->mask.load(std::memory_order_relaxed) & (std::uintptr_t(1) << index)) {  in pop()
203 …   head_counter.store(src.head_counter.load(std::memory_order_relaxed), std::memory_order_relaxed);  in assign()
204 …   tail_counter.store(src.tail_counter.load(std::memory_order_relaxed), std::memory_order_relaxed);  in assign()
206         const padded_page* srcp = src.head_page.load(std::memory_order_relaxed);  in assign()
208             ticket_type g_index = head_counter.load(std::memory_order_relaxed);  in assign()
209 …size_type n_items  = (tail_counter.load(std::memory_order_relaxed) - head_counter.load(std::memory…  in assign()
211 …size_type index = modulo_power_of_two(head_counter.load(std::memory_order_relaxed) / queue_rep_typ…  in assign()
220             padded_page* cur_page = head_page.load(std::memory_order_relaxed);  in assign()
223                 if (srcp != src.tail_page.load(std::memory_order_relaxed)) {  in assign()
224 … for (srcp = srcp->next; srcp != src.tail_page.load(std::memory_order_relaxed); srcp=srcp->next ) {  in assign()
229                     __TBB_ASSERT(srcp == src.tail_page.load(std::memory_order_relaxed), nullptr );  in assign()
230 …size_type last_index = modulo_power_of_two(tail_counter.load(std::memory_order_relaxed) / queue_re…  in assign()
254 …   new_page->mask.store(src_page->mask.load(std::memory_order_relaxed), std::memory_order_relaxed);  in make_copy()
256             if (new_page->mask.load(std::memory_order_relaxed) & uintptr_t(1) << begin_in_page) {  in make_copy()
269             padded_page* q = tail_page.load(std::memory_order_relaxed);  in invalidate_page()
280         return head_page.load(std::memory_order_relaxed);  in get_head_page()
285 …size_type index = (head_counter.load(std::memory_order_relaxed) / queue_rep_type::n_queue) % items…
290 …              if (curr_page->mask.load(std::memory_order_relaxed) & (std::uintptr_t(1) << index)) {
342             ticket_type c = counter.load(std::memory_order_acquire);  in spin_wait_until_my_turn()
444 …   head_counter.store(src.head_counter.load(std::memory_order_relaxed), std::memory_order_relaxed);  in assign()
445 …   tail_counter.store(src.tail_counter.load(std::memory_order_relaxed), std::memory_order_relaxed);  in assign()
446 …n_invalid_entries.store(src.n_invalid_entries.load(std::memory_order_relaxed), std::memory_order_r…  in assign()
463 …__TBB_ASSERT(head_counter.load(std::memory_order_relaxed) == src.head_counter.load(std::memory_ord…  in assign()
464 …  tail_counter.load(std::memory_order_relaxed) == src.tail_counter.load(std::memory_order_relaxed),  in assign()
469         ticket_type tc = tail_counter.load(std::memory_order_acquire);  in empty()
470         ticket_type hc = head_counter.load(std::memory_order_relaxed);  in empty()
472         return tc == tail_counter.load(std::memory_order_relaxed) &&  in empty()
473                std::ptrdiff_t(tc - hc - n_invalid_entries.load(std::memory_order_relaxed)) <= 0;  in empty()
478         std::ptrdiff_t hc = head_counter.load(std::memory_order_acquire);  in size()
479         std::ptrdiff_t tc = tail_counter.load(std::memory_order_relaxed);  in size()
480         std::ptrdiff_t nie = n_invalid_entries.load(std::memory_order_relaxed);  in size()
521           my_head_counter(my_queue_rep->head_counter.load(std::memory_order_relaxed))  in concurrent_queue_iterator_base()
567         if (k == my_queue_rep->tail_counter.load(std::memory_order_relaxed)) {  in get_item()