Home
last modified time | relevance | path

Searched refs:my_head (Results 1 – 9 of 9) sorted by relevance

/oneTBB/src/tbb/
H A Dintrusive_list.h33 intrusive_list_node my_head; variable
102 __TBB_ASSERT( (my_head.my_prev_node == &my_head && !my_size) || in assert_ok()
103 … (my_head.my_next_node != &my_head && my_size >0), "intrusive_list_base corrupted" ); in assert_ok()
106 for ( intrusive_list_node *n = my_head.my_next_node; n != &my_head; n = n->my_next_node ) in assert_ok()
117 my_head.my_prev_node = &my_head; in intrusive_list_base()
118 my_head.my_next_node = &my_head; in intrusive_list_base()
121 bool empty () const { return my_head.my_next_node == &my_head; } in empty()
127 iterator end () { return iterator(&my_head); } in end()
137 node(val).my_prev_node = &my_head; in push_front()
138 node(val).my_next_node = my_head.my_next_node; in push_front()
[all …]
H A Darena.h57 unsigned my_head; variable
64 return ( my_head == my_max_index ) ? 0 : my_head + 1; in next_index()
68 return ( my_head == 0 ) ? my_max_index : my_head - 1; in prev_index()
85 my_head = 0; in init()
103 if (my_co_scheduler_cache[my_head] != nullptr) { in push()
104 to_cleanup = my_co_scheduler_cache[my_head]; in push()
107 my_co_scheduler_cache[my_head] = s; in push()
109 my_head = next_index(); in push()
125 my_head = prev_index(); in pop()
127 task_dispatcher* to_return = my_co_scheduler_cache[my_head]; in pop()
[all …]
H A Dobserver_proxy.cpp56 observer_proxy *next = my_head.load(std::memory_order_relaxed); in clear()
82 if (my_head.load(std::memory_order_relaxed) == nullptr) { in clear()
92 if (my_head.load(std::memory_order_relaxed)) { in insert()
96 my_head.store(p, std::memory_order_relaxed); in insert()
102 …__TBB_ASSERT(my_head.load(std::memory_order_relaxed), "Attempt to remove an item from an empty lis… in remove()
111 if (p == my_head.load(std::memory_order_relaxed)) { in remove()
113 my_head.store(p->my_next, 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()
181 p = my_head.load(std::memory_order_relaxed); in do_notify_entry_observers()
[all …]
H A Dobserver_proxy.h38 std::atomic<observer_proxy*> my_head{nullptr};
/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_item_buffer_impl.h47 size_type my_head; variable
130 return get_my_item(my_head); in front()
144 void destroy_front() { destroy_item(my_head); ++my_head; } in destroy_front()
168 for( size_type i=my_head; i<my_tail; ++i) { in grow_my_array()
202 if(!my_item_valid(my_head)) { in pop_front()
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()
229 my_head(0), my_tail(0) { in item_buffer()
248 using item_buffer<T, A>::my_head;
260 this->reserve_item(this->my_head); in reserve_front()
[all …]
H A D_concurrent_unordered_base.h248 my_head(sokey_type(0)),
286 my_head(other.my_head.order_key()), in concurrent_unordered_base()
301 my_head(other.my_head.order_key()), in concurrent_unordered_base()
316 my_head(other.my_head.order_key()), in concurrent_unordered_base()
327 my_head(other.my_head.order_key()), in concurrent_unordered_base()
900 node_ptr next = my_head.next(); in internal_clear()
903 my_head.set_next(nullptr); in internal_clear()
1320 node_ptr last_node = &my_head; in internal_copy()
1340 node_ptr last_node = &my_head; in internal_move()
1362 my_head.set_next(other.my_head.next()); in move_content()
[all …]
H A D_flow_graph_join_impl.h434 __TBB_ASSERT(this->my_item_valid(this->my_head), "No item to reset");
436 if(this->my_item_valid(this->my_head)) {
/oneTBB/include/oneapi/tbb/
H A Dpartitioner.h192 depth_t my_head; variable
213 depth_t prev = my_head; in split_to_fill()
214 my_head = (my_head + 1) % MaxCapacity; in split_to_fill()
224 my_pool.begin()[my_head].~T(); in pop_back()
226 my_head = (my_head + MaxCapacity - 1) % MaxCapacity; in pop_back()
236 return my_pool.begin()[my_head]; in back()
249 return my_depth[my_head]; in back_depth()
363 std::size_t my_head; member
369 …, my_head((src.my_head + src.my_divisor) % src.my_max_affinity), my_max_affinity(src.my_max_affini… in linear_affinity_mode()
549 my_array[my_head] = id; in note_affinity()
[all …]
H A Dflow_graph.h1510 return this->my_item_valid(this->my_head); in is_item_valid()
1529 if ( this->my_reserved || !this->my_item_valid(this->my_head)){ in internal_pop()
1538 if (this->my_reserved || !this->my_item_valid(this->my_head)) { in internal_reserve()
1636 if (tag < this->my_head) { in __TBB_requires()