| /oneTBB/include/oneapi/tbb/ |
| H A D | parallel_scan.h | 197 m_allocator(alloc) in sum_node()
319 m_allocator(alloc), in finish_scan()
403 m_allocator(alloc), in start_scan()
419 m_allocator(alloc), in start_scan()
432 small_object_allocator alloc{}; in run()
434 auto& temp_body = *alloc.new_object<final_sum_type>(body, w_ctx, alloc); in run()
437 …auto& pass1 = *alloc.new_object<start_pass1_type>(/*m_return_slot=*/root, range, temp_body, partit… in run()
462 small_object_allocator alloc{}; in execute()
463 final_sum_type* right_zombie = alloc.new_object<final_sum_type>(m_body, alloc); in execute()
480 small_object_allocator alloc{}; in execute()
[all …]
|
| H A D | concurrent_priority_queue.h | 54 explicit concurrent_priority_queue( const allocator_type& alloc ) in concurrent_priority_queue() argument
55 : mark(0), my_size(0), my_compare(), data(alloc) in concurrent_priority_queue()
61 : mark(0), my_size(0), my_compare(compare), data(alloc)
67 : mark(0), my_size(0), my_compare(), data(alloc)
74 : mark(0), my_size(0), my_compare(compare), data(alloc)
82 : mark(0), my_compare(compare), data(begin, end, alloc)
91 : concurrent_priority_queue(begin, end, Compare(), alloc) {} in concurrent_priority_queue() argument
94 : concurrent_priority_queue(init.begin(), init.end(), compare, alloc) {}
97 : concurrent_priority_queue(init, Compare(), alloc) {} in concurrent_priority_queue() argument
108 data(other.data, alloc) in concurrent_priority_queue()
[all …]
|
| H A D | parallel_reduce.h | 110 my_allocator(alloc), in start_reduce()
119 my_allocator(alloc), in start_reduce()
131 my_allocator(alloc), in start_reduce()
141 auto reduce_task = alloc.new_object<start_reduce>(range, body, partitioner, alloc); in run()
169 small_object_allocator alloc{}; in offer_work_impl()
171 auto right_child = alloc.new_object<start_reduce>(ed, std::forward<Args>(args)..., alloc); in offer_work_impl()
271 my_allocator(alloc) {} in start_deterministic_reduce()
280 my_allocator(alloc) {} in start_deterministic_reduce()
286 alloc.new_object<start_deterministic_reduce>(range, partitioner, body, alloc); in run()
309 small_object_allocator alloc{}; in offer_work_impl()
[all …]
|
| H A D | parallel_for_each.h | 124 my_allocator(alloc) in feeder_item_task()
172 small_object_allocator alloc; in internal_add_copy_impl() local
173 auto task = alloc.new_object<feeder_task>(item, *this, alloc); in internal_add_copy_impl()
189 small_object_allocator alloc{}; in internal_add_move()
190 auto task = alloc.new_object<feeder_task>(std::move(item), *this, alloc); in internal_add_move()
269 my_execution_context(e_context), my_allocator(alloc)
331 small_object_allocator& alloc)
333 my_execution_context(e_context), my_allocator(alloc)
517 small_object_allocator alloc{};
520 alloc);
[all …]
|
| H A D | task_group.h | 100 …_task(FF&& f, d1::wait_context& wo, d1::task_group_context& ctx, d1::small_object_allocator& alloc) in function_task() argument
101 : task_handle_task{wo, ctx, alloc}, in function_task()
461 function_task(const F& f, wait_context& wo, small_object_allocator& alloc) in function_task() argument
464 , m_allocator(alloc) {} in function_task()
466 function_task(F&& f, wait_context& wo, small_object_allocator& alloc) in function_task() argument
469 , m_allocator(alloc) {} in function_task()
533 small_object_allocator alloc{}; in prepare_task()
534 …return alloc.new_object<function_task<typename std::decay<F>::type>>(std::forward<F>(f), m_wait_ct… in prepare_task()
544 small_object_allocator alloc{}; in prepare_task_handle()
546 …sk_handle_task* function_task_p = alloc.new_object<function_task_t>(std::forward<F>(f), m_wait_ct… in prepare_task_handle()
|
| H A D | parallel_for.h | 74 …( const Range& range, const Body& body, Partitioner& partitioner, small_object_allocator& alloc ) : in start_for()
79 my_allocator(alloc) {} in start_for()
82 … start_for& parent_, typename Partitioner::split_type& split_obj, small_object_allocator& alloc ) : in start_for()
87 my_allocator(alloc) {} in start_for()
90 start_for( start_for& parent_, const Range& r, depth_t d, small_object_allocator& alloc ) : in start_for()
95 my_allocator(alloc) in start_for()
106 small_object_allocator alloc{}; in run()
107 start_for& for_task = *alloc.new_object<start_for>(range, body, partitioner, alloc); in run()
134 small_object_allocator alloc{}; in offer_work_impl()
135 …start_for& right_child = *alloc.new_object<start_for>(ed, std::forward<Args>(constructor_args)...,… in offer_work_impl()
[all …]
|
| H A D | concurrent_set.h | 82 …urrent_set( const concurrent_set& other, const allocator_type& alloc ) : base_type(other, alloc) {} in concurrent_set() argument
84 …ent_set( concurrent_set&& other, const allocator_type& alloc ) : base_type(std::move(other), alloc… in concurrent_set() argument
183 …tiset( const concurrent_multiset& other, const allocator_type& alloc ) : base_type(other, alloc) {} in concurrent_multiset() argument
185 …et( concurrent_multiset&& other, const allocator_type& alloc ) : base_type(std::move(other), alloc… in concurrent_multiset() argument
|
| H A D | parallel_invoke.h | 80 small_object_allocator& alloc) : in invoke_subroot_task()
86 my_allocator(alloc) in invoke_subroot_task()
173 small_object_allocator alloc{}; in invoke_recursive_separation()
174 …auto sub_root = alloc.new_object<invoke_subroot_task<F1, F2, F3>>(f1, f2, f3, root_wait_ctx, conte… in invoke_recursive_separation()
|
| H A D | task_arena.h | 226 enqueue_task(const F& f, small_object_allocator& alloc) : m_allocator(alloc), m_func(f) {} in enqueue_task() argument
227 enqueue_task(F&& f, small_object_allocator& alloc) : m_allocator(alloc), m_func(std::move(f)) {} in enqueue_task() argument
232 small_object_allocator alloc{}; in enqueue_impl()
233 …r1::enqueue(*alloc.new_object<enqueue_task<typename std::decay<F>::type>>(std::forward<F>(f), allo… in enqueue_impl()
|
| H A D | concurrent_map.h | 99 …urrent_map( const concurrent_map& other, const allocator_type& alloc ) : base_type(other, alloc) {} in concurrent_map() argument
101 …ent_map( concurrent_map&& other, const allocator_type& alloc ) : base_type(std::move(other), alloc… in concurrent_map() argument
250 …timap( const concurrent_multimap& other, const allocator_type& alloc ) : base_type(other, alloc) {} in concurrent_multimap() argument
252 …ap( concurrent_multimap&& other, const allocator_type& alloc ) : base_type(std::move(other), alloc… in concurrent_multimap() argument
|
| H A D | concurrent_unordered_set.h | 75 …( const concurrent_unordered_set& other, const allocator_type& alloc ) : base_type(other, alloc) {} in concurrent_unordered_set() argument
77 …oncurrent_unordered_set&& other, const allocator_type& alloc ) : base_type(std::move(other), alloc… in concurrent_unordered_set() argument
214 …st concurrent_unordered_multiset& other, const allocator_type& alloc ) : base_type(other, alloc) {} in concurrent_unordered_multiset() argument
216 …rent_unordered_multiset&& other, const allocator_type& alloc ) : base_type(std::move(other), alloc… in concurrent_unordered_multiset() argument
|
| H A D | concurrent_vector.h | 283 explicit concurrent_vector( const allocator_type& alloc ) noexcept in concurrent_vector() argument
284 : base_type(alloc) in concurrent_vector()
289 : concurrent_vector(alloc) in concurrent_vector() argument
299 : concurrent_vector(alloc) in concurrent_vector() argument
310 : concurrent_vector(alloc) in concurrent_vector() argument
330 : base_type(other, alloc) {} in concurrent_vector()
336 concurrent_vector( concurrent_vector&& other, const allocator_type& alloc ) in concurrent_vector() argument
337 : base_type(std::move(other), alloc) in concurrent_vector()
341 const allocator_type& alloc = allocator_type() )
342 : concurrent_vector(init.begin(), init.end(), alloc)
[all …]
|
| H A D | concurrent_unordered_map.h | 77 …( const concurrent_unordered_map& other, const allocator_type& alloc ) : base_type(other, alloc) {} in concurrent_unordered_map() argument
79 …oncurrent_unordered_map&& other, const allocator_type& alloc ) : base_type(std::move(other), alloc… in concurrent_unordered_map() argument
277 …st concurrent_unordered_multimap& other, const allocator_type& alloc ) : base_type(other, alloc) {} in concurrent_unordered_multimap() argument
279 …rent_unordered_multimap&& other, const allocator_type& alloc ) : base_type(std::move(other), alloc… in concurrent_unordered_multimap() argument
|
| H A D | concurrent_queue.h | 32 std::pair<bool, ticket_type> internal_try_pop_impl(void* dst, QueueRep& queue, Allocator& alloc ) { in internal_try_pop_impl() argument
45 } while (!queue.choose(ticket).pop(dst, ticket, queue, alloc)); in internal_try_pop_impl()
94 …concurrent_queue( std::initializer_list<value_type> init, const allocator_type& alloc = allocator_…
95 concurrent_queue(init.begin(), init.end(), alloc)
372 …concurrent_bounded_queue( std::initializer_list<value_type> init, const allocator_type& alloc = al…
373 concurrent_bounded_queue(init.begin(), init.end(), alloc)
|
| /oneTBB/src/tbb/ |
| H A D | parallel_pipeline.cpp | 284 d1::small_object_allocator alloc{}; in try_spawn_stage_task() local
285 … r1::spawn( *alloc.new_object<stage_task>(ed, my_pipeline, alloc ), my_pipeline.my_context ); in try_spawn_stage_task()
293 stage_task(pipeline& pipeline, d1::small_object_allocator& alloc ) : in stage_task() argument
296 m_allocator(alloc), in stage_task()
303 …ine& pipeline, d1::base_filter* filter, const task_info& info, d1::small_object_allocator& alloc) : in stage_task() argument
307 m_allocator(alloc), in stage_task()
343 d1::small_object_allocator alloc{}; in spawn_stage_task() local
344 stage_task* clone = alloc.new_object<stage_task>(ed, my_pipeline, my_filter, info, alloc); in spawn_stage_task()
451 d1::small_object_allocator alloc{}; in parallel_pipeline() local
452 stage_task& st = *alloc.new_object<stage_task>(pipe, alloc); in parallel_pipeline()
|
| H A D | task_dispatcher.cpp | 56 d1::small_object_allocator alloc{}; in spawn() local
57 auto proxy = alloc.new_object<task_proxy>(static_cast<d1::execution_data&>(ed)); in spawn()
63 proxy->allocator = alloc; in spawn()
|
| /oneTBB/test/common/ |
| H A D | containers_common.h | 36 …allocator_type alloc(propagated_on_copy, propagated_on_move, propagated_on_swap, selected_on_copy); in test_allocator_traits()
38 ContainerType c1(alloc), c2(c1); in test_allocator_traits()
80 allocator_type alloc;
81 ContainerType container1(alloc), container2(alloc);
88 allocator_type alloc;
90 ContainerType container1(alloc), container2(std::move(container1), alloc);
|
| H A D | concurrent_priority_queue_common.h | 129 auto alloc = q1.get_allocator(); in type_tester() local
130 queue_type q4_alloc(q1, alloc); in type_tester()
138 queue_type q6(alloc); in type_tester()
147 queue_type q8(comp, alloc); in type_tester()
160 queue_type q11(100, alloc); in type_tester()
168 queue_type q13(vec.begin(), vec.end(), alloc); in type_tester()
177 queue_type q15({vec[0], vec[1], vec[2]}, alloc); in type_tester()
|
| H A D | custom_allocators.h | 131 void set_counters( const Allocator& alloc ) { in set_counters() argument
132 set_counters(alloc.items_allocated, alloc.items_freed, alloc.items_constructed, in set_counters()
133 alloc.items_destroyed, alloc.allocations, alloc.frees); in set_counters()
|
| /oneTBB/include/oneapi/tbb/detail/ |
| H A D | _concurrent_unordered_base.h | 249 my_segments(alloc) {}
259 explicit concurrent_unordered_base( const allocator_type& alloc ) in concurrent_unordered_base() argument
266 : concurrent_unordered_base(bucket_count, hash, equal, alloc) in concurrent_unordered_base() argument
302 my_segments(other.my_segments, alloc) in concurrent_unordered_base()
328 my_segments(std::move(other.my_segments), alloc) in concurrent_unordered_base()
812 : base_type(alloc) {} in base_type() argument
817 : base_type(other, alloc) {} in unordered_segment_table()
822 : base_type(std::move(other), alloc) {} in unordered_segment_table()
829 segment_allocator_type alloc(this->get_allocator()); in create_segment()
851 segment_allocator_type alloc(this->get_allocator()); in destroy_segment()
[all …]
|
| H A D | _small_object_pool.h | 71 small_object_allocator alloc = *this; in delete_object() local
73 alloc.deallocate(object, ed); in delete_object()
80 small_object_allocator alloc = *this; in delete_object() local
82 alloc.deallocate(object); in delete_object()
|
| H A D | _concurrent_skip_list.h | 97 allocator_traits::construct(alloc, node, height); in create()
110 allocator_traits::destroy(alloc, &node->atomic_next(l)); in destroy()
114 allocator_traits::destroy(alloc, node); in destroy()
293 explicit concurrent_skip_list( const allocator_type& alloc ) in concurrent_skip_list() argument
294 : concurrent_skip_list(key_compare(), alloc) {} in concurrent_skip_list()
298 const allocator_type& alloc = allocator_type() )
299 : concurrent_skip_list(comp, alloc) in concurrent_skip_list() argument
306 : concurrent_skip_list(first, last, key_compare(), alloc) {} in concurrent_skip_list()
310 : concurrent_skip_list(init.begin(), init.end(), comp, alloc) {}
313 : concurrent_skip_list(init, key_compare(), alloc) {} in concurrent_skip_list()
[all …]
|
| H A D | _segment_table.h | 62 segment_table( const allocator_type& alloc = allocator_type() )
63 : my_segment_table_allocator(alloc), my_segment_table(nullptr) in my_segment_table_allocator() argument
84 segment_table( const segment_table& other, const allocator_type& alloc ) in segment_table() argument
85 : my_segment_table_allocator(alloc), my_segment_table(nullptr) in segment_table()
106 segment_table( segment_table&& other, const allocator_type& alloc ) in segment_table() argument
107 : my_segment_table_allocator(alloc), my_segment_table(nullptr), my_first_block{} in segment_table()
113 internal_move_construct_with_allocator(std::move(other), alloc, is_equal_type());
405 void internal_move_construct_with_allocator( segment_table&& other, const allocator_type& alloc, in internal_move_construct_with_allocator() argument
407 if (other.my_segment_table_allocator == alloc) { in internal_move_construct_with_allocator()
|
| H A D | _task_handle.h | 49 …k_handle_task(d1::wait_context& wo, d1::task_group_context& ctx, d1::small_object_allocator& alloc) in task_handle_task() argument
52 , m_allocator(alloc) { in task_handle_task()
|
| H A D | _concurrent_queue_base.h | 371 micro_queue_pop_finalizer( Container& queue, Allocator& alloc, ticket_type k, padded_page* p ) : in micro_queue_pop_finalizer() argument
372 my_ticket_type(k), my_queue(queue), my_page(p), allocator(alloc) in micro_queue_pop_finalizer()
434 void clear( queue_allocator_type& alloc ) { in clear()
436 array[index].clear(alloc); in clear()
443 …void assign( const concurrent_queue_rep& src, queue_allocator_type& alloc, item_constructor_type c… in assign()
452 array[queue_idx].assign(src.array[queue_idx], alloc, construct_item); in assign()
456 array[i].clear_and_invalidate(alloc); in assign()
|