Searched refs:my_first (Results 1 – 3 of 3) sorted by relevance
101 atomic_proxy_ptr my_first; variable116 task_proxy* curr = my_first.load(std::memory_order_acquire); in internal_pop()119 atomic_proxy_ptr* prev_ptr = &my_first; in internal_pop()172 return my_first.load(std::memory_order_relaxed) == nullptr; in empty()181 __TBB_ASSERT( !my_first.load(std::memory_order_relaxed), nullptr ); in construct()184 my_last = &my_first; in construct()191 for( ; task_proxy* t = my_first; ) { in drain()192 my_first.store(t->next_in_mailbox, std::memory_order_relaxed); in drain()
207 graph_task* my_first;211 graph_task_list() : my_first(nullptr), my_next_ptr(&my_first) {} in graph_task_list()214 bool empty() const { return !my_first; } in empty()226 graph_task* result = my_first; in pop_front()227 my_first = result->my_next; in pop_front()228 if (!my_first) { in pop_front()229 my_next_ptr = &my_first; in pop_front()
386 Iterator my_first;391 : my_first(first), my_body(body), my_feeder_ptr(feeder_ptr) {}398 parallel_for_each_operator_selector<Body>::call(my_body, *(my_first + count),490 Iterator my_first;511 if (this->my_first == this->my_last) {523 …for (; !(this->my_first == this->my_last) && block_handling_task->my_size < block_handling_type::m…525 new (block_iterator++) Item(*this->my_first);548 if (this->my_first == this->my_last) {554 Iterator first_block_element = this->my_first;555 …for (; !(this->my_first == this->my_last) && block_size < block_handling_type::max_block_size; ++t…[all …]