Searched refs:right_child (Results 1 – 3 of 3) sorted by relevance
| /oneTBB/include/oneapi/tbb/ |
| H A D | parallel_scan.h | 251 …task* right_child = this->create_child(Range(m_range,split()), *m_left_sum, m_right, m_left_sum, m… in execute() local 253 ref_count = (left_child != nullptr) + (right_child != nullptr); in execute() 256 spawn(*right_child, *ed.context); in execute() 259 return right_child; in execute() 487 …auto& right_child = *alloc.new_object<start_scan>(/*m_return_slot=*/result->m_right, *this, alloc); in execute() local 489 spawn(right_child, *ed.context); in execute()
|
| H A D | parallel_reduce.h | 171 auto right_child = alloc.new_object<start_reduce>(ed, std::forward<Args>(args)..., alloc); in offer_work_impl() local 174 …right_child->my_parent = my_parent = alloc.new_object<tree_node_type>(ed, my_parent, 2, *my_body, … in offer_work_impl() 177 right_child->spawn_self(ed); in offer_work_impl() 314 …auto right_child = alloc.new_object<start_deterministic_reduce>(ed, std::forward<Args>(args)..., n… in offer_work_impl() local 316 right_child->my_parent = my_parent = new_tree_node; in offer_work_impl() 319 right_child->spawn_self(ed); in offer_work_impl()
|
| H A D | parallel_for.h | 135 …start_for& right_child = *alloc.new_object<start_for>(ed, std::forward<Args>(constructor_args)...,… in offer_work_impl() local 138 right_child.my_parent = my_parent = alloc.new_object<tree_node>(ed, my_parent, 2, alloc); in offer_work_impl() 140 right_child.spawn_self(ed); in offer_work_impl()
|