Home
last modified time | relevance | path

Searched refs:new_object (Results 1 – 14 of 14) sorted by relevance

/oneTBB/include/oneapi/tbb/detail/
H A D_small_object_pool.h52 Type* new_object(execution_data& ed, Args&&... args) { in new_object() function
60 Type* new_object(Args&&... args) { in new_object() function
H A D_flow_graph_node_impl.h305 …graph_task* t = allocator.new_object<task_type>( my_graph_ref, allocator, *this, input, my_priorit… in create_body_task()
332 …graph_task* t = allocator.new_object<task_type>( graph_reference(), allocator, *this, my_priority … in create_forward_task()
685 …graph_task* t = allocator.new_object<task_type>( graph_reference(), allocator, *this, continue_msg…
H A D_flow_graph_impl.h435 …task* critical_task = gt.my_allocator.new_object<priority_task_selector>(g.my_priority_queue, gt.m… in prioritize_task()
H A D_flow_graph_join_impl.h700 graph_task* t = allocator.new_object<task_type>(graph_ref, allocator, *my_node);
773 graph_task* t = allocator.new_object<task_type>(graph_ref, allocator, *my_node);
889 rtask = allocator.new_object<task_type>(this->graph_ref, allocator, *my_node);
1078 … graph_task* t = allocator.new_object<task_type>(my_graph, allocator, *this);
/oneTBB/include/oneapi/tbb/
H A Dparallel_scan.h434 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()
463 final_sum_type* right_zombie = alloc.new_object<final_sum_type>(m_body, alloc); in execute()
481 …auto result = alloc.new_object<sum_node_type>(m_range,/*m_left_is_final=*/m_is_final, m_parent? &m… in execute()
483 …auto new_parent = alloc.new_object<finish_pass1_type>(m_return_slot, m_sum_slot, *result, m_parent… in execute()
487 …auto& right_child = *alloc.new_object<start_scan>(/*m_return_slot=*/result->m_right, *this, alloc); in execute()
H A Dparallel_reduce.h141 auto reduce_task = alloc.new_object<start_reduce>(range, body, partitioner, alloc); in run()
171 auto right_child = alloc.new_object<start_reduce>(ed, std::forward<Args>(args)..., alloc); in offer_work_impl()
174 …right_child->my_parent = my_parent = alloc.new_object<tree_node_type>(ed, my_parent, 2, *my_body, … in offer_work_impl()
286 alloc.new_object<start_deterministic_reduce>(range, partitioner, body, alloc); in run()
311 auto new_tree_node = alloc.new_object<tree_node_type>(ed, my_parent, 2, my_body, alloc); in offer_work_impl()
314 …auto right_child = alloc.new_object<start_deterministic_reduce>(ed, std::forward<Args>(args)..., n… in offer_work_impl()
H A Dparallel_for_each.h173 auto task = alloc.new_object<feeder_task>(item, *this, alloc); in internal_add_copy_impl()
190 auto task = alloc.new_object<feeder_task>(std::move(item), *this, alloc); in internal_add_move()
518 …auto block_handling_task = alloc.new_object<block_handling_type>(ed, this->my_wait_context, this->…
561 …auto block_handling_task = alloc.new_object<block_handling_type>(ed, first_block_element, block_si…
H A Dparallel_for.h107 start_for& for_task = *alloc.new_object<start_for>(range, body, partitioner, alloc); in run()
135 …start_for& right_child = *alloc.new_object<start_for>(ed, std::forward<Args>(constructor_args)...,… in offer_work_impl()
138 right_child.my_parent = my_parent = alloc.new_object<tree_node>(ed, my_parent, 2, alloc); in offer_work_impl()
H A Dparallel_invoke.h174 …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 Dtask_group.h534 …return alloc.new_object<function_task<typename std::decay<F>::type>>(std::forward<F>(f), m_wait_ct… in prepare_task()
546 …d2::task_handle_task* function_task_p = alloc.new_object<function_task_t>(std::forward<F>(f), m_w… in prepare_task_handle()
H A Dflow_graph.h727 graph_task* t = allocator.new_object<task_type>(my_graph, allocator, *this); in __TBB_requires()
1222 … graph_task* new_task = allocator.new_object<task_type>(graph_reference(), allocator, *this); in handle_operations_impl()
1969 … graph_task* rtask = allocator.new_object<task_type>( my_graph, allocator, *this ); in forward_task()
1989 graph_task* t = allocator.new_object<task_type>(my_graph, allocator, *this); in forward_task()
2040 graph_task* t = allocator.new_object<task_type>(my_graph, allocator, *this); in register_successor()
2064 graph_task* t = allocator.new_object<task_type>(my_graph, allocator, *this); in register_predecessor()
2099 rtask = allocator.new_object<task_type>(my_graph, allocator, *this); in try_put_task()
3059 … graph_task* t = allocator.new_object<task_type>(graph_reference(), allocator, *this, s); in register_successor()
H A Dtask_arena.h233 …r1::enqueue(*alloc.new_object<enqueue_task<typename std::decay<F>::type>>(std::forward<F>(f), allo… in enqueue_impl()
/oneTBB/src/tbb/
H A Dparallel_pipeline.cpp285 … r1::spawn( *alloc.new_object<stage_task>(ed, my_pipeline, alloc ), my_pipeline.my_context ); in try_spawn_stage_task()
344 stage_task* clone = alloc.new_object<stage_task>(ed, my_pipeline, my_filter, info, alloc); in spawn_stage_task()
452 stage_task& st = *alloc.new_object<stage_task>(pipe, alloc); in parallel_pipeline()
H A Dtask_dispatcher.cpp57 auto proxy = alloc.new_object<task_proxy>(static_cast<d1::execution_data&>(ed)); in spawn()