Home
last modified time | relevance | path

Searched refs:f1 (Results 1 – 18 of 18) sorted by relevance

/oneTBB/include/oneapi/tbb/
H A Dparallel_invoke.h79 …invoke_subroot_task(const F1& f1, const F2& f2, const F3& f3, wait_context& wait_ctx, task_group_c… in invoke_subroot_task()
82 self_invoked_functor(f1), in invoke_subroot_task()
137 …voke_recursive_separation(wait_context& root_wait_ctx, task_group_context& context, const F1& f1) { in invoke_recursive_separation() argument
140 function_invoker<F1, invoke_root_task> invoker1(f1, root); in invoke_recursive_separation()
146 …_separation(wait_context& root_wait_ctx, task_group_context& context, const F1& f1, const F2& f2) { in invoke_recursive_separation() argument
149 function_invoker<F1, invoke_root_task> invoker1(f1, root); in invoke_recursive_separation()
160 function_invoker<F1, invoke_root_task> invoker1(f1, 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()
189 void parallel_invoke_impl(const F1& f1, const Fs&... fs) { in parallel_invoke_impl() argument
[all …]
/oneTBB/examples/task_arena/fractal/
H A Dfractal.cpp163 fractal &f = num ? f1 : f0; in calc_fractal()
228 f1.draw_border(active == 1); in draw_borders()
236 f1(_dm), in fractal_group()
239 f0.size_x = f1.size_x = _dm.sizex / 2 - 4; in fractal_group()
240 f0.size_y = f1.size_y = _dm.sizey - 4; in fractal_group()
241 f0.off_x = f0.off_y = f1.off_y = 2; in fractal_group()
242 f1.off_x = f0.size_x + 4 + 2; in fractal_group()
248 f1.cx = -0.6f; in fractal_group()
249 f1.cy = 0.0f; in fractal_group()
250 f1.magn = 200.0f; in fractal_group()
[all …]
H A Dfractal.hpp103 fractal f0, f1; member in fractal_group
147 return active ? f1 : f0; in get_active_fractal()
/oneTBB/doc/main/tbb_userguide/
H A Dcancel_a_graph.rst20 function_node< int, int > f1( g, 1, []( int i ) { return i; } );
35 make_edge( f1, f2 );
37 f1.try_put(1);
38 f1.try_put(2);
61 function_node< int, int > f1( g, 1, []( int i ) { return i; } );
77 make_edge( f1, f2 );
79 f1.try_put(1);
80 f1.try_put(2);
H A Dbroadcast_or_send.rst33 function_node< int, int, rejecting > f1( g, 1, []( int i ) -> int {
35 cout << "f1 consuming " << i << "\n";
50 make_edge( q, f1 );
62 buffer policy set to rejecting. So, f1 and f2 do not internally buffer
68 is sent to either f1 or f2, but not both.
78 priority_queue_node only contains "9" when a successor node, f1, accepts
87 order, by either f1 or f2.
90 But what if you really do want both f1 and f2 to receive all of the
102 function_node< int, int, rejecting > f1( g, 1, []( int i ) -> int {
104 cout << "f1 consuming " << i << "\n";
[all …]
H A Dcatching_exceptions.rst20 function_node< int, int > f1( g, 1, []( int i ) { return i; } );
33 make_edge( f1, f2 );
35 f1.try_put(1);
36 f1.try_put(2);
H A DFlow_Graph_Single_Vs_Broadcast.rst48 function_node<continue_msg> f1(g,serial,fn_body1(b1));
56 make_edge(buf1,f1);
64 remove_edge(buf1,f1);
72 make_edge(bn,f1);
H A Duse_graph_reset.rst26 f1.try_put(1);
27 f1.try_put(2);
H A Duse_nested_algorithms.rst23 ``read_next_matrix``, ``f1``, ``f2``, ``consume_f1`` and ``consume_f2`` are not provided
43 b[i] = f1(a[i]);
H A DWorking_on_the_Assembly_Line_pipeline.rst175 oneapi::tbb::filter<void,TextSlice*> f1( oneapi::tbb::filter_mode::serial_in_order,
181 oneapi::tbb::filter<void,void> f = f1 & f2 & f3;
/oneTBB/test/conformance/
H A Dconformance_function_node.cpp42 function_node f1(g, unlimited, body); in test_deduction_guides_common() local
43 static_assert(std::is_same_v<decltype(f1), function_node<int, int>>); in test_deduction_guides_common()
68 function_node f9(f1); in test_deduction_guides_common()
89 function_node<InputType, OutputType1> f1(g, unlimited, body1); in test_fn_invoke_basic() local
93 make_edge(f1, f2); in test_fn_invoke_basic()
96 f1.try_put(InputType{OutputType1{1}}); in test_fn_invoke_basic()
H A Dconformance_join_node.cpp124 f1( g, oneapi::tbb::flow::unlimited, [](const int &i) { return i; } ); in __anon798ebb9d0202() variable
145 oneapi::tbb::flow::make_edge(f1, oneapi::tbb::flow::input_port<0>(testing_node));
151 f1.try_put(1);
155 f1.try_put(2);
160 f1.try_put(3);
182 f1.try_put(1);
278 function_node<std::size_t, test_invoke::SmartID<std::size_t>> f1(g, unlimited, generator); in test_invoke_basic() local
289 make_edge(f1, input_port<0>(j)); in test_invoke_basic()
295 f1.try_put(i); in test_invoke_basic()
H A Dconformance_indexer_node.cpp93 oneapi::tbb::flow::function_node<int, int> f1( g, oneapi::tbb::flow::unlimited, variable
118 oneapi::tbb::flow::make_edge(f1, oneapi::tbb::flow::input_port<0>(testing_node));
123 f1.try_put(3);
/oneTBB/test/tbb/
H A Dtest_split_node.cpp303 function_node<msg_t, msg_t> f1(g, unlimited, [](msg_t msg) { return msg; } ); in test_follows_and_precedes_api() local
304 auto f2(f1); in test_follows_and_precedes_api()
305 auto f3(f1); in test_follows_and_precedes_api()
314 split_node<msg_t> following_node(follows(f1, f2, f3)); in test_follows_and_precedes_api()
320 make_edge(f1, preceding_node); in test_follows_and_precedes_api()
325 f1.try_put(msg); in test_follows_and_precedes_api()
H A Dtest_composite_node.cpp93 tbb::flow::function_node< int, int > f1; member
98 …tiny_node(tbb::flow::graph &g, bool hidden = false) : base_type(g), f1(g, tbb::flow::unlimited, pa… in tiny_node()
99 tbb::flow::make_edge(f1, f2); in tiny_node()
101 std::tuple<tbb::flow::function_node< int, int >& > input_tuple(f1); in tiny_node()
106 base_type::add_nodes(f1, f2); in tiny_node()
108 base_type::add_visible_nodes(f1, f2); in tiny_node()
117 …CHECK_MESSAGE( (&tbb::flow::input_port<0>(t) == &t.f1), "f1 not bound to input port 0 in composite… in test_tiny()
121 …CHECK_MESSAGE( (&std::get<0>(t1.input_ports()) == &t1.f1), "f1 not bound to input port 0 in compos… in test_tiny()
128 …CHECK_MESSAGE( (&tbb::flow::input_port<0>(t2) == &t2.f1), "f1 not bound to input port 0 in composi… in test_tiny()
H A Dtest_flow_graph_whitebox.cpp955 function_node<int, int, lightweight> f1(g, unlimited, body);
962 make_edge(f1, f2);
965 f1.try_put(1);
H A Dtest_task_arena.cpp1315 Functor<ReturnType> f1; in Test() local
1316 TestExecute(f1); in Test()
1324 TestIsolate(f1); in Test()
/oneTBB/examples/test_all/fibonacci/
H A Dfibonacci.cpp231 NumbersTable::const_accessor f1, f2; // same as iterators in operator ()() local
232 if (!Fib.find(f1, i - 1) || !Fib.find(f2, i - 2)) { in operator ()()
237 value sum = f1->second + f2->second; in operator ()()