Home
last modified time | relevance | path

Searched refs:my_tail (Results 1 – 5 of 5) sorted by relevance

/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_item_buffer_impl.h48 size_type my_tail; variable
50 bool buffer_empty() const { return my_head == my_tail; } in buffer_empty()
137 return get_my_item(my_tail - 1); in back()
145 void destroy_back() { destroy_item(my_tail-1); --my_tail; } in destroy_back()
168 for( size_type i=my_head; i<my_tail; ++i) { in grow_my_array()
187 set_my_item(my_tail, v); in push_back()
188 ++my_tail; in push_back()
193 if (!my_item_valid(my_tail-1)) { in pop_back()
214 for( size_type i=my_head; i<my_tail; ++i ) { in clean_up_buffer()
222 my_head = my_tail = my_array_size = 0; in clean_up_buffer()
[all …]
/oneTBB/src/tbb/
H A Dobserver_proxy.cpp87 …__TBB_ASSERT(my_head.load(std::memory_order_relaxed) == nullptr && my_tail.load(std::memory_order_… in clear()
93 p->my_prev = my_tail.load(std::memory_order_relaxed); in insert()
94 my_tail.load(std::memory_order_relaxed)->my_next = p; in insert()
98 my_tail.store(p, std::memory_order_relaxed); in insert()
103 …__TBB_ASSERT(!my_tail.load(std::memory_order_relaxed)->my_next, "Last item's my_next must be nullp… in remove()
104 if (p == my_tail.load(std::memory_order_relaxed)) { in remove()
106 my_tail.store(p->my_prev, std::memory_order_relaxed); in remove()
118 …__TBB_ASSERT((my_head.load(std::memory_order_relaxed) && my_tail.load(std::memory_order_relaxed)) … in remove()
119 … (!my_head.load(std::memory_order_relaxed) && !my_tail.load(std::memory_order_relaxed)), nullptr); in remove()
H A Dobserver_proxy.h41 std::atomic<observer_proxy*> my_tail{nullptr};
133 if (last == my_tail.load(std::memory_order_relaxed)) in notify_entry_observers()
/oneTBB/include/oneapi/tbb/
H A Dpartitioner.h193 depth_t my_tail; variable
200 range_vector(const T& elem) : my_head(0), my_tail(0), my_size(1) { in range_vector()
230 my_pool.begin()[my_tail].~T(); in pop_front()
232 my_tail = (my_tail + 1) % MaxCapacity; in pop_front()
240 return my_pool.begin()[my_tail]; in front()
245 return my_depth[my_tail]; in front_depth()
H A Dflow_graph.h1643 size_t new_tail = (tag+1 > this->my_tail) ? tag+1 : this->my_tail; in __TBB_requires()
1648 this->my_tail = new_tail; in __TBB_requires()
1761 if (mark < this->my_tail) heapify(); in order()
1766 return this->my_tail > 0; in is_item_valid()
1788 …return mark < this->my_tail && compare(this->get_my_item(0), this->get_my_item(this->my_tail - 1)); in prio_use_tail()
1796 ++(this->my_tail); in prio_push()
1808 --(this->my_tail); in prio_pop()
1813 if(this->my_tail > 1) { in prio_pop()
1818 --(this->my_tail); in prio_pop()
1819 if(mark > this->my_tail) --mark; in prio_pop()
[all …]