Home
last modified time | relevance | path

Searched refs:number_of_predecessors (Results 1 – 3 of 3) sorted by relevance

/oneTBB/doc/main/reference/
H A Dconstructors_for_nodes.rst40 continue_node(follows(...), int number_of_predecessors, Body body, Policy = Policy());
41 continue_node(precedes(...), int number_of_predecessors, Body body, Policy = Policy());
/oneTBB/include/oneapi/tbb/
H A Dflow_graph.h301 explicit continue_receiver( int number_of_predecessors, node_priority_t a_priority ) { in continue_receiver() argument
302 my_predecessor_count = my_initial_predecessor_count = number_of_predecessors; in continue_receiver()
1029 graph &g, int number_of_predecessors, in __TBB_requires()
1032 , input_impl_type(g, number_of_predecessors, body, a_priority), in __TBB_requires()
1041 continue_node( graph& g, int number_of_predecessors, Body body, node_priority_t a_priority) in __TBB_requires()
1042 : continue_node(g, number_of_predecessors, body, Policy(), a_priority) {} in __TBB_requires()
1047 continue_node( const node_set<Args...>& nodes, int number_of_predecessors, in __TBB_requires()
1049 : continue_node(nodes.graph_reference(), number_of_predecessors, body, p, a_priority) { in __TBB_requires()
1055 continue_node( const node_set<Args...>& nodes, int number_of_predecessors, in __TBB_requires()
1057 : continue_node(nodes, number_of_predecessors, body, Policy(), a_priority) {} in __TBB_requires()
/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_node_impl.h615 continue_input( graph &g, int number_of_predecessors,
617 : continue_receiver( number_of_predecessors, a_priority )