Home
last modified time | relevance | path

Searched refs:last_task (Results 1 – 4 of 4) sorted by relevance

/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_cache_impl.h347 graph_task * last_task = nullptr; in try_put_task() local
354 last_task = combine_tasks(graph_ref, last_task, new_task); // enqueue if necessary in try_put_task()
366 return last_task; in try_put_task()
H A D_flow_graph_node_impl.h577 graph_task* last_task = std::get<N-1>(p).try_put_task(std::get<N-1>(t));
578 check_task_and_spawn(g, last_task);
587 graph_task* last_task = std::get<0>(p).try_put_task(std::get<0>(t));
588 check_task_and_spawn(g, last_task);
H A D_flow_graph_join_impl.h1102 graph_task *last_task = nullptr;
1116 last_task = combine_tasks(my_graph, last_task, new_task);
1127 current->bypass_t = last_task;
/oneTBB/include/oneapi/tbb/
H A Dflow_graph.h747 if ( last_task ) in __TBB_requires()
751 return last_task; in __TBB_requires()
1253 graph_task *last_task = nullptr; in forward_task() local
1262 last_task = combine_tasks(g, last_task, xtask); in forward_task()
1264 return last_task; in forward_task()
1293 last_task = combine_tasks(g, last_task, new_task); in try_put_and_add_task()
1314 graph_task* last_task = nullptr; in internal_forward_task_impl() local
1319 op->ltask = last_task; // return task in internal_forward_task_impl()
1320 if (last_task && !counter) { in internal_forward_task_impl()
1518 last_task = combine_tasks(graph_ref, last_task, new_task); in try_put_and_add_task()
[all …]