| /oneTBB/include/oneapi/tbb/ |
| H A D | parallel_invoke.h | 79 …invoke_subroot_task(const F1& f1, const F2& f2, const F3& f3, wait_context& wait_ctx, task_group_c… in invoke_subroot_task()
84 f3_invoker(f3, *this), in invoke_subroot_task()
157 …it_context& root_wait_ctx, task_group_context& context, const F1& f1, const F2& f2, const F3& f3) { in invoke_recursive_separation() argument
162 function_invoker<F3, invoke_root_task> invoker3(f3, root); in invoke_recursive_separation()
172 const F1& f1, const F2& f2, const F3& f3, const Fs&... fs) { in invoke_recursive_separation() argument
174 …auto sub_root = alloc.new_object<invoke_subroot_task<F1, F2, F3>>(f1, f2, f3, root_wait_ctx, conte… in invoke_recursive_separation()
|
| /oneTBB/doc/main/tbb_userguide/ |
| H A D | cancel_a_graph.rst | 32 function_node< int, int > f3( g, 1, []( int i ) { return i; } );
36 make_edge( f2, f3 );
74 function_node< int, int > f3( g, 1, []( int i ) { return i; } );
78 make_edge( f2, f3 );
|
| H A D | catching_exceptions.rst | 30 function_node< int, int > f3( g, 1, []( int i ) { return i; } );
34 make_edge( f2, f3 );
78 this means that the input 1 never reaches f3 and that input 2 never
79 reaches either f2 or f3.
|
| H A D | Flow_Graph_Single_Vs_Broadcast.rst | 50 function_node<continue_msg> f3(g,serial,fn_body1(b3));
58 make_edge(buf1,f3);
66 remove_edge(buf1,f3);
74 make_edge(bn,f3);
|
| H A D | Working_on_the_Assembly_Line_pipeline.rst | 179 oneapi::tbb::filter<TextSlice*,void> f3(oneapi::tbb::filter_mode::serial_in_order,
181 oneapi::tbb::filter<void,void> f = f1 & f2 & f3;
|
| /oneTBB/test/tbb/ |
| H A D | test_composite_node.cpp | 131 tbb::flow::function_node< int, int > f3( g, tbb::flow::unlimited, passthru_body() ); in test_tiny() local
135 tbb::flow::make_edge( t2 , f3 ); in test_tiny()
137 tbb::flow::make_edge(f3, q); in test_tiny()
148 tbb::flow::remove_edge(f3, q); in test_tiny()
149 tbb::flow::remove_edge(t2, f3); in test_tiny()
152 tbb::flow::make_edge( t1 , f3 ); in test_tiny()
153 tbb::flow::make_edge(f3, q); in test_tiny()
|
| H A D | test_split_node.cpp | 305 auto f3(f1); in test_follows_and_precedes_api() local
314 split_node<msg_t> following_node(follows(f1, f2, f3)); in test_follows_and_precedes_api()
322 make_edge(f3, preceding_node); in test_follows_and_precedes_api()
327 f3.try_put(msg); in test_follows_and_precedes_api()
|
| /oneTBB/test/conformance/ |
| H A D | conformance_join_node.cpp | 136 f3( g, oneapi::tbb::flow::unlimited, variable
148 make_edge(testing_node, f3);
149 make_edge(f3, q_node);
180 oneapi::tbb::flow::remove_edge(testing_node, f3);
|
| H A D | conformance_indexer_node.cpp | 103 f3( g, oneapi::tbb::flow::unlimited, variable
121 oneapi::tbb::flow::make_edge(testing_node, f3);
|
| H A D | conformance_function_node.cpp | 48 function_node f3(g, unlimited, body, node_priority_t(5)); in test_deduction_guides_common() local
49 static_assert(std::is_same_v<decltype(f3), function_node<int, int>>); in test_deduction_guides_common()
|