Home
last modified time | relevance | path

Searched refs:child (Results 1 – 8 of 8) sorted by relevance

/oneTBB/test/tbb/
H A Dtest_tbb_fork.cpp245 bool child = false; in main() local
266 utils::suppress_unused_warning(child); in main()
289 if (child) in main()
295 child = true; in main()
/oneTBB/include/oneapi/tbb/
H A Dconcurrent_priority_queue.h364 size_type cur_pos = 0, child = 1; in reheap() local
366 while(child < mark) { in reheap()
367 size_type target = child; in reheap()
368 if (child + 1 < mark && my_compare(data[child], data[child + 1])) in reheap()
375 child = (cur_pos << 1) + 1; in reheap()
H A Dparallel_scan.h224 …task* create_child( const Range& range, final_sum_type& body, sum_node* child, final_sum_type* inc… in create_child()
225 if( child ) { in create_child()
226 __TBB_ASSERT( is_poisoned(child->m_body) && is_poisoned(child->m_incoming), nullptr ); in create_child()
227 child->prepare_for_execution(body, incoming, stuff_last); in create_child()
228 return child; in create_child()
H A Dflow_graph.h1853 size_type cur_pos=0, child=1; in reheap() local
1854 while (child < mark) { in reheap()
1855 size_type target = child; in reheap()
1856 if (child+1<mark && in reheap()
1857 compare(this->get_my_item(child), in reheap()
1858 this->get_my_item(child+1))) in reheap()
1867 child = (cur_pos<<1)+1; in reheap()
/oneTBB/doc/main/tbb_userguide/Migration_Guide/
H A DTask_API.rst115 tbb::task& child = *new(m_root.allocate_child()) OtherWork;
116 tbb::task::spawn(child);
260 Recycling as child or continuation
299 // Recycling as child
358 Task& child = *new(root.allocate_child()) Task{/*params*/};
362 tbb::task_spawn(child);
407 ChildTask& child = *new(root.allocate_child()) ChildTask{/*params*/};
412 tbb::task::spawn(child);
/oneTBB/doc/main/tbb_userguide/
H A DCancellation_and_Nested_Parallelism.rst17 objects. Cancelling a ``task_group_context`` cancels all of its child
H A Dwork_isolation.rst98 within the region and their child tasks spawned by other threads. The
/oneTBB/doc/main/tbb_userguide/design_patterns/
H A DDivide_and_Conquer.rst174 // Recurse on each child y of x in parallel