Home
last modified time | relevance | path

Searched refs:buffer_node (Results 1 – 25 of 41) sorted by relevance

12

/oneTBB/test/common/
H A Dtest_join_node_multiple_predecessors.h31 buffer_node<continue_msg>& bn1, buffer_node<continue_msg>& bn2, buffer_node<continue_msg>& bn3, in twist_join_connections()
47 graph& g, buffer_node<continue_msg>& bn1, buffer_node<continue_msg>& bn2, in connect_join_via_make_edge()
48 buffer_node<continue_msg>& bn3, queue_node_t& qn) in connect_join_via_make_edge()
58 graph&, buffer_node<continue_msg>& bn1, buffer_node<continue_msg>& bn2, in connect_join_via_follows()
59 buffer_node<continue_msg>& bn3, queue_node_t& qn) in connect_join_via_follows()
68 graph&, buffer_node<continue_msg>& bn1, buffer_node<continue_msg>& bn2, in connect_join_via_precedes()
69 buffer_node<continue_msg>& bn3, queue_node_t& qn) in connect_join_via_precedes()
80 graph& g, buffer_node<continue_msg>& bn1, buffer_node<continue_msg>& bn2, in run_and_check()
99 buffer_node<continue_msg> bn1(g); in test()
100 buffer_node<continue_msg> bn2(g); in test()
[all …]
H A Dtest_follows_and_precedes_api.h63 tbb::flow::buffer_node<typename NodeType::output_type> buffer(g);
80 tbb::flow::buffer_node<typename NodeType::output_type> buffer(g);
129 struct testing_method_precedes<tbb::flow::buffer_node<Args...>> : std::integral_constant<int, 1> {};
143 using SuccessorOutputType = typename tbb::flow::buffer_node<NodeOutputType>::output_type;
147 std::array<tbb::flow::buffer_node<NodeOutputType>, 3>& successors,
156 std::array<tbb::flow::buffer_node<NodeOutputType>, 3>& successors,
201 std::array<tbb::flow::buffer_node<MessageType>, 3> preds = {
203 tbb::flow::buffer_node<MessageType>(g),
204 tbb::flow::buffer_node<MessageType>(g),
205 tbb::flow::buffer_node<MessageType>(g)
[all …]
/oneTBB/test/tbb/
H A Dtest_buffer_node.cpp48 tbb::flow::buffer_node<T> &my_b;
101 tbb::flow::buffer_node<T> &my_b;
119 tbb::flow::buffer_node<T> &my_b;
154 tbb::flow::buffer_node<T> b(g); in test_reservation()
201 tbb::flow::buffer_node<T> b(g); in test_parallel()
202 tbb::flow::buffer_node<T> b2(g); in test_parallel()
319 tbb::flow::buffer_node<T> b(g); in test_serial()
442 buffer_node<int> b0(g); in test_deduction_guides()
445 buffer_node b1(follows(br)); in test_deduction_guides()
448 buffer_node b2(precedes(br)); in test_deduction_guides()
[all …]
H A Dtest_join_node_preview.cpp39 …<msg_t, tbb::flow::join_node<JoinOutputType>, tbb::flow::buffer_node<msg_t>>(messages_for_follows); in jn_follows_and_precedes()
43 …<msg_t, tbb::flow::join_node<JoinOutputType, tbb::flow::reserving>, tbb::flow::buffer_node<msg_t>>… in jn_follows_and_precedes()
51 …_node<JoinOutputType, tbb::flow::key_matching<msg_t, hash_compare>>, tbb::flow::buffer_node<msg_t>> in jn_follows_and_precedes()
73 …ow::join_node<JoinOutputType, tbb::flow::key_matching<std::size_t>>, tbb::flow::buffer_node<msg_t>> in jn_msg_key_matching_follows_and_precedes()
H A Dtest_input_node.cpp264 std::array<buffer_node<bool>, 3> successors {{ in test_follows_and_precedes_api()
265 buffer_node<bool>(g), in test_follows_and_precedes_api()
266 buffer_node<bool>(g), in test_follows_and_precedes_api()
267 buffer_node<bool>(g) in test_follows_and_precedes_api()
342 …l_input_node_ctor = requires( tbb::flow::graph& graph, Body body, tbb::flow::buffer_node<int> f ) {
H A Dtest_flow_graph.cpp73 tbb::flow::buffer_node<int> *b;
76 …my_int_buffer(tbb::flow::graph &g) : my_graph(g) { b = new tbb::flow::buffer_node<int>(my_graph); } in my_int_buffer()
78 b = new tbb::flow::buffer_node<int>(my_graph); in my_int_buffer()
252 tbb::flow::buffer_node< int > buf_n(my_graph); in operator ()()
H A Dtest_indexer_node.cpp561 tbb::flow::buffer_node<tagged_msg_t>& buf, in check_edge()
578 void check_edge(tbb::flow::graph& g, BN& bn, tbb::flow::buffer_node<indexer_output_t>& buf, Type, t… in check_edge()
592 buffer_node<indexer_output_t> buf(g); in test_follows_impl()
614 buffer_node<indexer_output_t> buf1(g); in test_precedes()
615 buffer_node<indexer_output_t> buf2(g); in test_precedes()
616 buffer_node<indexer_output_t> buf3(g); in test_precedes()
H A Dtest_multifunction_node.cpp494 buffer_node<int> b1(g); in test_precedes()
495 buffer_node<int> b2(g); in test_precedes()
565 buffer_node<int> b1(g);
566 buffer_node<int> b2(g);
603 … tbb::flow::node_priority_t priority, tbb::flow::buffer_node<int>& f ) {
H A Dtest_continue_node.cpp336 buffer_node<continue_msg> node_with_non_default_mutex_type(g); in test_successor_cache_specialization()
343 buffer_node<continue_msg> buf(g); in test_successor_cache_specialization()
394 tbb::flow::buffer_node<int>& f, std::size_t num,
H A Dtest_async_node.cpp736 buffer_node<output_t> buf(g); in test_follows()
762 std::array<buffer_node<input_t>, 1> successors = { {buffer_node<input_t>(g)} }; in test_precedes()
857 … Body body, tbb::flow::node_priority_t priority, tbb::flow::buffer_node<int>& f ) {
/oneTBB/test/conformance/
H A Dconformance_buffer_node.cpp31 conformance::test_forwarding_single_push<oneapi::tbb::flow::buffer_node<int>>();
37 conformance::test_buffering<oneapi::tbb::flow::buffer_node<int>, int>();
44 conformance::test_copy_ctor_for_buffering_nodes<oneapi::tbb::flow::buffer_node<int>>();
50 conformance::test_inheritance<oneapi::tbb::flow::buffer_node<int>, int, int>();
51 conformance::test_inheritance<oneapi::tbb::flow::buffer_node<void*>, void*, void*>();
58 oneapi::tbb::flow::buffer_node<int> testing_node(g);
H A Dconformance_graph.cpp171 test_buffering_nodes_rf_reset_protocol<buffer_node<int>>();
203 oneapi::tbb::flow::buffer_node<int> bf(g);
H A Dconformance_async_node.cpp155 buffer_node<std::size_t> buf(g);
H A Dconformance_multifunction_node.cpp167 buffer_node<std::size_t> buf(g);
H A Dconformance_function_node.cpp91 buffer_node<OutputType2> buf(g); in test_fn_invoke_basic()
/oneTBB/doc/main/tbb_userguide/
H A Dcreate_token_based_system.rst48 objects and a ``buffer_node`` that is pre-filled with three tokens. The
50 The ``input_node`` and ``buffer_node`` are connected to a reserving ``join_node``.
54 pull from the ``buffer_node``.
83 buffer_node< token_t > b(g);
110 back to the ``buffer_node``. This cycle in the flow graph allows the token
124 free list of big objects using a cycle back to the ``buffer_node``.
127 Also, in our example above, the ``buffer_node`` was prefilled by a fixed
130 ``buffer_node``, and it could generate the tokens. In addition, our
H A DFlow_Graph_Single_Vs_Broadcast.rst51 buffer_node<continue_msg> buf1(g);
93 The single-push test uses a ``buffer_node``, which has a "single-push"
95 ``buffer_node`` results in three messages being pushed. Notice also only
H A DFlow_Graph_Reservation.rst64 buffer_node<int> buf1(g);
65 buffer_node<int> buf2(g);
68 buffer_node<join_type::output_type> buf_out(g);
94 two predecessors: a ``buffer_node`` ``buf1`` and a ``broadcast_node``
95 ``bn``. Port 1 of the ``join_node`` has one predecessor, ``buffer_node``
/oneTBB/doc/main/reference/
H A Dconstructors_for_nodes.rst66 // buffer_node
67 explicit buffer_node(follows(...));
68 explicit buffer_node(precedes(...));
H A Dmake_edges_function.rst71 buffer_node<int> buffer(g);
/oneTBB/examples/graph/
H A DREADME.md6 | binpack | A solution to the binpacking problem using a `queue_node`, a `buffer_node` and `functio…
/oneTBB/include/oneapi/tbb/
H A Dflow_graph.h1147 class buffer_node
1159 typedef buffer_node<T> class_type;
1379 buffer_node(const node_set<Args...>& nodes) : buffer_node(nodes.graph_reference()) { in buffer_node() function
1385 __TBB_NOINLINE_SYM buffer_node( const buffer_node& src ) : buffer_node(src.my_graph) {} in buffer_node() function
1499 class queue_node : public buffer_node<T> {
1501 typedef buffer_node<T> base_type;
1507 template<typename> friend class buffer_node;
1662 typedef buffer_node<T> base_type;
1685 : buffer_node<T>(src), mark(0) in priority_queue_node()
1758 template<typename> friend class buffer_node;
[all …]
/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_nodes_deduction.h127 buffer_node(const NodeSet&)
128 ->buffer_node<decide_on_set_t<NodeSet>>;
/oneTBB/examples/graph/binpack/
H A DREADME.md4 …e queue. When a bin is packed as well as it can be, it is passed to a `buffer_node` where it waits…
/oneTBB/examples/
H A DREADME.md9 | graph/binpack | A solution to the binpacking problem using a `queue_node`, a `buffer_node`, and `…

12