Home
last modified time | relevance | path

Searched refs:task_type (Results 1 – 6 of 6) sorted by relevance

/oneTBB/examples/migration/recursive_fibonacci/
H A Dtask_emulation_layer.h56 task_type type_snapshot = m_type; in operator()
66 if (m_type == task_type::allocated) { in operator()
88 continuation->m_type = task_type::allocated; in allocate_continuation()
118 m_type = task_type::recycled; in recycle_as_child_of()
123 m_type = task_type::recycled; in recycle_as_continuation()
135 enum class task_type { enum
141 mutable task_type m_type;
153 obj.m_type = task_type::stack_based; in create_child_impl()
161 obj->m_type = task_type::allocated; in allocate_child_impl()
180 m_type = base_task::task_type::allocated;
[all …]
/oneTBB/test/tbb/
H A Dtest_task.cpp180 …std::vector<task_type, tbb::cache_aligned_allocator<task_type>> vector_test_task(threads_num, task…
194 task_type::reset();
222 …std::vector<task_type, tbb::cache_aligned_allocator<task_type>> vector_test_task(task_threads_num,…
252 task_type::reset();
267 …std::vector<task_type, tbb::cache_aligned_allocator<task_type>> vector_test_task(threads_num, task…
294 task_type::reset();
499 task_type suspend_task(suspend_func, wait);
533 using task_type = CountingTask<decltype(task_body)>; typedef
534 std::vector<task_type, tbb::cache_aligned_allocator<task_type>> test_tasks;
599 std::vector<task_type, tbb::cache_aligned_allocator<task_type>> test_tasks;
[all …]
H A Dtest_flow_graph_priorities.cpp244 task_type_t task_type; member
/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_node_impl.h304 typedef apply_body_task_bypass<class_type, input_type> task_type; in create_body_task() typedef
305 …graph_task* t = allocator.new_object<task_type>( my_graph_ref, allocator, *this, input, my_priorit… in create_body_task()
331 typedef forward_task_bypass<class_type> task_type; in create_forward_task() typedef
332 …graph_task* t = allocator.new_object<task_type>( graph_reference(), allocator, *this, my_priority … in create_forward_task()
684 typedef apply_body_task_bypass<class_type, continue_msg> task_type;
685 …graph_task* t = allocator.new_object<task_type>( graph_reference(), allocator, *this, continue_msg…
H A D_flow_graph_join_impl.h699 typedef forward_task_bypass<base_node_type> task_type;
700 graph_task* t = allocator.new_object<task_type>(graph_ref, allocator, *my_node);
772 typedef forward_task_bypass<base_node_type> task_type;
773 graph_task* t = allocator.new_object<task_type>(graph_ref, allocator, *my_node);
888 typedef forward_task_bypass<base_node_type> task_type;
889 rtask = allocator.new_object<task_type>(this->graph_ref, allocator, *my_node);
1077 … typedef forward_task_bypass< join_node_base<JP, InputTuple, OutputTuple> > task_type;
1078 … graph_task* t = allocator.new_object<task_type>(my_graph, allocator, *this);
/oneTBB/include/oneapi/tbb/
H A Dflow_graph.h726 typedef input_node_task_bypass< input_node<output_type> > task_type; in __TBB_requires() typedef
727 graph_task* t = allocator.new_object<task_type>(my_graph, allocator, *this); in __TBB_requires()
1220 typedef forward_task_bypass<class_type> task_type; in handle_operations_impl() typedef
1988 typedef forward_task_bypass<limiter_node<T, DecrementType>> task_type; in forward_task() typedef
2039 typedef forward_task_bypass<limiter_node<T, DecrementType>> task_type; in register_successor() typedef
2040 graph_task* t = allocator.new_object<task_type>(my_graph, allocator, *this); in register_successor()
2063 typedef forward_task_bypass<limiter_node<T, DecrementType>> task_type; in register_predecessor() typedef
2064 graph_task* t = allocator.new_object<task_type>(my_graph, allocator, *this); in register_predecessor()
2098 typedef forward_task_bypass<limiter_node<T, DecrementType>> task_type; in try_put_task() typedef
2099 rtask = allocator.new_object<task_type>(my_graph, allocator, *this); in try_put_task()
[all …]