| /oneTBB/include/oneapi/tbb/ |
| H A D | flow_graph.h | 884 this->output_ports(), this->my_body in __TBB_requires()
1510 return this->my_item_valid(this->my_head); in is_item_valid()
1525 this->internal_forward_task_impl(op, this); in internal_forward_task()
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()
1705 this->internal_forward_task_impl(op, this); in internal_forward_task()
1788 …return mark < this->my_tail && compare(this->get_my_item(0), this->get_my_item(this->my_tail - 1)); in prio_use_tail()
1807 this->destroy_item(this->my_tail-1); in prio_pop()
1816 this->move_item(0,this->my_tail - 1); in prio_pop()
2011 my_predecessors(this), my_successors(this), decrement(this) in limiter_node()
[all …]
|
| H A D | concurrent_vector.h | 87 return *this;
97 return *this;
107 return *this;
137 return *this;
142 ++(*this);
158 return *this;
163 --(*this);
350 return *this;
355 return *this; in noexcept()
360 return *this;
[all …]
|
| H A D | rw_mutex.h | 35 create_itt_sync(this, "tbb::rw_mutex", ""); in rw_mutex()
56 call_itt_notify(prepare, this); in lock()
66 call_itt_notify(acquired, this); in lock()
78 call_itt_notify(acquired, this); in try_lock()
87 call_itt_notify(releasing, this); in unlock()
95 r1::notify_by_address_all(this); in unlock()
101 call_itt_notify(prepare, this); in lock_shared()
121 call_itt_notify(acquired, this); in try_lock_shared()
131 call_itt_notify(releasing, this); in unlock_shared()
140 r1::notify_by_address_all(this); in unlock_shared()
[all …]
|
| H A D | concurrent_hash_map.h | 400 return *this;
413 return *this;
850 this->reserve(n); in __TBB_requires()
856 this->reserve(n); in __TBB_requires()
866 this->clear(); in __TBB_requires()
876 this->clear(); in __TBB_requires()
903 this->clear(); in __TBB_requires()
914 this->clear(); in __TBB_requires()
938 return *this; in __TBB_requires()
949 return *this; in __TBB_requires()
[all …]
|
| H A D | parallel_for_each.h | 486 this->my_wait_context.release();
511 if (this->my_first == this->my_last) {
516 this->my_wait_context.reserve();
523 …for (; !(this->my_first == this->my_last) && block_handling_task->my_size < block_handling_type::m…
530 spawn(*this, this->my_execution_context);
548 if (this->my_first == this->my_last) {
555 …for (; !(this->my_first == this->my_last) && block_size < block_handling_type::max_block_size; ++t…
559 this->my_wait_context.reserve();
566 spawn(*this, this->my_execution_context);
584 tbb::blocked_range<std::size_t>(0, std::distance(this->my_first, this->my_last)),
[all …]
|
| H A D | spin_rw_mutex.h | 45 create_itt_sync(this, "tbb::spin_rw_mutex", ""); in spin_rw_mutex()
66 call_itt_notify(prepare, this); in lock()
77 call_itt_notify(acquired, this); in lock()
87 call_itt_notify(acquired, this); in try_lock()
96 call_itt_notify(releasing, this); in unlock()
102 call_itt_notify(prepare, this); in lock_shared()
114 call_itt_notify(acquired, this); in lock_shared()
125 call_itt_notify(acquired, this); in try_lock_shared()
137 call_itt_notify(releasing, this); in unlock_shared()
171 call_itt_notify(releasing, this); in downgrade()
|
| H A D | concurrent_map.h | 108 return *this;
113 iterator it = this->find(key); in at()
115 if (it == this->end()) { in at()
126 iterator it = this->find(key);
128 if (it == this->end()) {
135 iterator it = this->find(key);
137 if (it == this->end()) {
161 this->internal_merge(source); in merge()
171 this->internal_merge(source); in merge()
259 return *this;
[all …]
|
| H A D | queuing_mutex.h | 39 create_itt_sync(this, "tbb::queuing_mutex", ""); in queuing_mutex()
85 scoped_lock* pred = m.q_tail.exchange(this); in acquire()
90 pred->m_next.store(this, std::memory_order_release); in acquire()
110 if (!m.q_tail.compare_exchange_strong(expected, this, std::memory_order_acq_rel)) in try_acquire()
122 __TBB_ASSERT(this->m_mutex, "no lock acquired"); in release()
124 call_itt_notify(releasing, this->m_mutex); in release()
127 scoped_lock* expected = this; in release()
|
| H A D | queuing_rw_mutex.h | 46 create_itt_sync(this, "tbb::queuing_rw_mutex", ""); in queuing_rw_mutex()
173 r1::acquire(m, *this, write); in acquire()
177 return r1::try_acquire(m, *this, write); in try_acquire()
181 r1::release(*this); in release()
185 return r1::upgrade_to_writer(*this); in upgrade_to_writer()
189 return r1::downgrade_to_reader(*this); in downgrade_to_reader()
193 return r1::is_writer(*this); in is_writer()
|
| H A D | spin_mutex.h | 49 create_itt_sync(this, "tbb::spin_mutex", ""); in spin_mutex()
70 call_itt_notify(prepare, this); in lock()
72 call_itt_notify(acquired, this); in lock()
80 call_itt_notify(acquired, this); in try_lock()
87 call_itt_notify(releasing, this); in unlock()
|
| H A D | concurrent_unordered_map.h | 86 return *this;
91 iterator where = this->find(key);
93 if (where == this->end()) {
102 if (where == this->end()) {
111 if (where == this->end()) { in at()
120 if (where == this->end()) { in at()
142 this->internal_merge(source); in merge()
152 this->internal_merge(source); in merge()
286 return *this;
303 this->internal_merge(source); in merge()
[all …]
|
| H A D | mutex.h | 35 create_itt_sync(this, "tbb::mutex", ""); in mutex()
55 call_itt_notify(prepare, this); in lock()
66 call_itt_notify(acquired, this); in try_lock()
73 call_itt_notify(releasing, this); in unlock()
|
| H A D | task_arena.h | 214 m_allocator.delete_object(this, ed); in finalize()
251 r1::execute(*this, func); in execute_impl()
297 if (r1::attach(*this)) { in task_arena()
309 atomic_do_once([this]{ r1::initialize(*this); }, my_initialization_state); in initialize()
321 r1::initialize(*this);
338 r1::initialize(*this);
349 if ( !r1::attach(*this) ) { in initialize()
350 r1::initialize(*this); in initialize()
365 r1::terminate(*this); in terminate()
395 d2::enqueue_impl(std::move(th), this); in enqueue()
[all …]
|
| H A D | enumerable_thread_specific.h | 396 return *this;
406 return *this;
427 return *this;
433 return *this;
544 return *this;
559 return *this;
565 return *this;
991 return *this;
1001 return *this;
1010 return *this;
[all …]
|
| H A D | concurrent_priority_queue.h | 57 my_aggregator.initialize_handler(functor{this}); in concurrent_priority_queue()
63 my_aggregator.initialize_handler(functor{this});
70 my_aggregator.initialize_handler(functor{this});
128 if (this != &other) {
133 return *this;
137 if (this != &other) {
143 return *this;
148 return *this;
214 if (this != &other) { in swap()
254 call_itt_notify(acquired, this); in handle_operations()
[all …]
|
| /oneTBB/include/oneapi/tbb/detail/ |
| H A D | _flow_graph_cache_impl.h | 109 if ( this->internal_empty() ) { in get_item()
112 src = &this->internal_pop(); in get_item()
123 this->add(*src); in get_item()
134 if (this->internal_empty()) break; in reset()
135 src = &this->internal_pop(); in reset()
170 pred = &this->internal_pop(); in try_reserve()
184 this->add( *pred); in try_reserve()
350 while ( i != this->my_successors.end() ) { in try_put_task()
374 while ( i != this->my_successors.end() ) { in gather_successful_try_puts()
411 return this->my_successors.size(); in size()
[all …]
|
| H A D | _rtm_rw_mutex.h | 57 create_itt_sync(this, "tbb::speculative_spin_rw_mutex", ""); in alignas()
148 r1::acquire_writer(m, *this); in acquire()
150 r1::acquire_reader(m, *this); in acquire()
158 return r1::try_acquire_writer(m, *this); in try_acquire()
160 return r1::try_acquire_reader(m, *this); in try_acquire()
168 return r1::release(*this); in release()
178 return r1::upgrade(*this); in upgrade_to_writer()
187 return r1::downgrade(*this); in downgrade_to_reader()
|
| H A D | _node_handle.h | 72 return *this;
116 __TBB_ASSERT(!this->empty(), "Cannot get key from the empty node_type object"); in key()
117 return *const_cast<key_type*>(&(this->my_node->value().first)); in key()
121 __TBB_ASSERT(!this->empty(), "Cannot get mapped value from the empty node_type object"); in mapped()
122 return this->my_node->value().second; in mapped()
142 __TBB_ASSERT(!this->empty(), "Cannot get value from the empty node_type object"); in value()
143 return *const_cast<value_type*>(&(this->my_node->value())); in value()
|
| H A D | _flow_graph_item_buffer_impl.h | 21 #error Do not #include this internal file directly; use public TBB headers instead.
196 v = this->back(); in pop_back()
205 v = this->front(); in pop_front()
256 if(my_reserved || !my_item_valid(this->my_head)) return false; in reserve_front()
259 v = this->front(); in reserve_front()
260 this->reserve_item(this->my_head); in reserve_front()
266 this->destroy_front(); in consume_front()
272 this->release_item(this->my_head); in release_front()
|
| H A D | _flow_graph_impl.h | 62 if (this != &other) {
66 return *this;
88 return *this;
93 graph_iterator result = *this;
168 my_allocator.delete_object(this, ed); in execute()
177 my_allocator.delete_object(this, ed); in cancel()
282 try_call([this] { in wait_for_all()
283 my_task_arena->execute([this] { in wait_for_all()
287 }).on_exception([this] { in wait_for_all()
367 this->~graph_task(); in destruct_and_deallocate()
[all …]
|
| H A D | _flow_graph_join_impl.h | 424 if(!this->buffer_empty()) {
434 __TBB_ASSERT(this->my_item_valid(this->my_head), "No item to reset");
435 this->destroy_front();
436 if(this->my_item_valid(this->my_head)) {
881 bool do_fwd = this->buffer_empty() && is_graph_active(this->graph_ref);
882 this->current_key = t;
883 this->delete_with_key(this->current_key); // remove the key
885 this->push_back(l_out);
910 this->destroy_front();
955 this->set_key_func(cfb);
[all …]
|
| /oneTBB/test/common/ |
| H A D | iterator.h | 60 return *this;
73 return *this;
78 ++*this;
129 ++*this;
155 ++*this;
161 --*this;
176 return *this;
180 return *this;
213 ++*this;
219 --*this;
[all …]
|
| H A D | test_invoke.h | 47 …for (std::size_t index = get_real_index(this->begin()); index != get_real_index(this->end()); ++in… in increase()
54 …for (std::size_t index = get_real_index(this->begin()); index != get_real_index(this->end()); ++in… in reduction()
63 …for (std::size_t index = get_real_index(this->begin()); index != get_real_index(this->end()); ++in… in scan()
132 SmartValue& operator++() { ++real_value; return *this; }
|
| /oneTBB/examples/migration/recursive_fibonacci/ |
| H A D | fibonacci_single_task.h | 71 bypass = this->allocate_child_and_increment<single_fib_task>(n - 2, &x_r); in compute_impl()
72 … task_emulation::run_task(this->allocate_child_and_increment<single_fib_task>(n - 1, &x_l)); in compute_impl()
75 this->s = state::sum; in compute_impl()
76 this->recycle_as_continuation(); in compute_impl()
|
| /oneTBB/ |
| H A D | third-party-programs.txt | 22 notice, this list of conditions and the following disclaimer.
24 notice, this list of conditions and the following disclaimer in the
27 used to endorse or promote products derived from this software
45 Copyright (c) 2008,2016 david decotigny (this file)
73 notice, this list of conditions and the following disclaimer.
75 notice, this list of conditions and the following disclaimer in the
78 used to endorse or promote products derived from this software
105 notice, this list of conditions and the following disclaimer.
107 copyright notice, this list of conditions and the following disclaimer
112 this software without specific prior written permission.
[all …]
|