Home
last modified time | relevance | path

Searched refs:queue_node (Results 1 – 25 of 35) sorted by relevance

12

/oneTBB/test/tbb/
H A Dtest_queue_node.cpp68 tbb::flow::queue_node<T> &my_q;
153 tbb::flow::queue_node<T> &my_q;
171 tbb::flow::queue_node<T> &my_q;
206 tbb::flow::queue_node<T> q(g); in test_reservation()
254 tbb::flow::queue_node<T> q(g); in test_parallel()
255 tbb::flow::queue_node<T> q2(g); in test_parallel()
359 tbb::flow::queue_node<T> q(g); in test_serial()
481 queue_node<int> q0(g); in test_deduction_guides()
484 queue_node q1(follows(br)); in test_deduction_guides()
487 queue_node q2(precedes(br)); in test_deduction_guides()
[all …]
H A Dtest_flow_graph_whitebox.cpp236 tbb::flow::queue_node<int> qnode0(g); in TestFunctionNode()
240 tbb::flow::queue_node<int> qnode1(g); in TestFunctionNode()
405 tbb::flow::queue_node<int> q0(g); in TestJoinNode()
406 tbb::flow::queue_node<int> q1(g); in TestJoinNode()
481 tbb::flow::queue_node<int> inq(g); in TestLimiterNode()
482 tbb::flow::queue_node<int> outq(g); in TestLimiterNode()
575 tbb::flow::queue_node<int> qin(g); in TestMultifunctionNode()
576 tbb::flow::queue_node<int> qodd_out(g); in TestMultifunctionNode()
644 tbb::flow::queue_node<int> qout(g); in TestScalarNode()
724 tbb::flow::queue_node<int> qin(g); in TestInputNode()
[all …]
H A Dtest_limiter_node.cpp316 tbb::flow::queue_node<int> qn(g); in test_continue_msg_reception()
336 queue_node<int> input_queue(g); in test_reserve_release_messages()
337 queue_node<int> output_queue(g); in test_reserve_release_messages()
379 tbb::flow::queue_node<int> queue(g); in test_decrementer()
615 tbb::flow::queue_node<TestLargeStruct> input_node( graph );
H A Dtest_composite_node.cpp136 tbb::flow::queue_node<int> q(g); in test_tiny()
225 tbb::flow::queue_node<int> q(g); in test_adder()
301 tbb::flow::queue_node<int> output(g); in test_nested_adder()
398 std::vector< tbb::flow::queue_node<double> > v( 5, tbb::flow::queue_node<double>(g) ); in test_prefix()
441 typedef tbb::flow::queue_node<int> q_type; in input_only_output_only_composite()
H A Dtest_join_node.h1182 tbb::flow::queue_node<TType> outq1(g);
1183 tbb::flow::queue_node<TType> outq2(g);
1318 tbb::flow::queue_node< q3_input_type > q3(g);
1461 tbb::flow::queue_node<OQType> oq0(g);
1462 tbb::flow::queue_node<OQType> oq1(g);
1464 typedef tbb::flow::queue_node<int> IQType;
1546 tbb::flow::queue_node<OQType> oq0(g);
1547 tbb::flow::queue_node<OQType> oq1(g);
1549 typedef tbb::flow::queue_node<int> IQType;
1636 tbb::flow::queue_node<CheckTupleType> checkTupleQueue0(g);
[all …]
H A Dtest_split_node.cpp144 typedef typename tbb::flow::queue_node<IT> my_sink_node_type;
185 typedef typename tbb::flow::queue_node<IT> my_sink_node_type;
275 tbb::flow::queue_node< q3_input_type > q3(g); in test_one_serial()
H A Dtest_join_node.cpp71 tbb::flow::queue_node<int> tag_queue(g); in test()
H A Dtest_indexer_node.cpp262 tbb::flow::queue_node<TType> outq1(g); in test()
263 tbb::flow::queue_node<TType> outq2(g); in test()
366 tbb::flow::queue_node< q3_input_type > q3(g); in test_one_serial()
H A Dtest_profiling.cpp215 tbb::flow::queue_node<int> node(g);
H A Dtest_broadcast_node.cpp174 tbb::flow::queue_node<T> q0(g); in test_resets()
/oneTBB/test/conformance/
H A Dconformance_queue_node.cpp32 conformance::test_forwarding_single_push<oneapi::tbb::flow::queue_node<int>>();
38 conformance::test_buffering<oneapi::tbb::flow::queue_node<int>, int>();
45 conformance::test_copy_ctor_for_buffering_nodes<oneapi::tbb::flow::queue_node<int>>();
51 conformance::test_inheritance<oneapi::tbb::flow::queue_node<int>, int, int>();
52 conformance::test_inheritance<oneapi::tbb::flow::queue_node<void*>, void*, void*>();
59 oneapi::tbb::flow::queue_node<int> testing_node(g);
H A Dconformance_graph.cpp172 test_buffering_nodes_rf_reset_protocol<queue_node<int>>();
189 oneapi::tbb::flow::queue_node<int> successor(g);
190 oneapi::tbb::flow::queue_node<std::tuple<int>> successor2(g);
191 oneapi::tbb::flow::queue_node<oneapi::tbb::flow::indexer_node<int>::output_type> successor3(g);
261 queue_node<int> q_node(g);
H A Dconformance_composite_node.cpp29 oneapi::tbb::flow::queue_node<int> qn;
103 oneapi::tbb::flow::queue_node<int> q(g);
H A Dconformance_limiter_node.cpp109 oneapi::tbb::flow::queue_node<int> queue(g);
/oneTBB/doc/main/reference/
H A Dconstructors_for_nodes.rst70 // queue_node
71 explicit queue_node(follows(...));
72 explicit queue_node(precedes(...));
/oneTBB/examples/graph/binpack/
H A DREADME.md4 …nteger values of `size <= V` to a `queue_node`. Multiple function nodes set about taking values fr…
/oneTBB/examples/graph/dining_philosophers/
H A Ddining_philosophers.cpp238 typedef oneapi::tbb::flow::queue_node<oneapi::tbb::flow::continue_msg> thinking_done_type;
268 std::vector<oneapi::tbb::flow::queue_node<chopstick>> places( in main()
269 num_philosophers, oneapi::tbb::flow::queue_node<chopstick>(g)); in main()
H A DREADME.md4 …mplemented with `sleep()`. The chopstick positions are represented by a `queue_node` with one item.
/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/detail/
H A D_flow_graph_nodes_deduction.h131 queue_node(const NodeSet&)
132 ->queue_node<decide_on_set_t<NodeSet>>;
/oneTBB/test/common/
H A Dtest_join_node_multiple_predecessors.h28 using queue_node_t = queue_node<std::tuple<continue_msg, continue_msg, continue_msg>>;
/oneTBB/examples/
H A DREADME.md9 | graph/binpack | A solution to the binpacking problem using a `queue_node`, a `buffer_node`, and `…
/oneTBB/include/oneapi/tbb/
H A Dflow_graph.h1499 class queue_node : public buffer_node<T> {
1504 typedef queue_node class_type;
1558 __TBB_NOINLINE_SYM explicit queue_node( graph &g ) : base_type(g) { in queue_node() function
1566 queue_node( const node_set<Args...>& nodes) : queue_node(nodes.graph_reference()) { in queue_node() function
1572 __TBB_NOINLINE_SYM queue_node( const queue_node& src) : base_type(src) { in queue_node() function
1588 class sequencer_node : public queue_node<T> { in __TBB_requires()
1601 __TBB_NOINLINE_SYM sequencer_node( graph &g, const Sequencer& s ) : queue_node<T>(g), in __TBB_requires()
1618 __TBB_NOINLINE_SYM sequencer_node( const sequencer_node& src ) : queue_node<T>(src), in __TBB_requires()
3237 inline void set_name(const queue_node<T>& node, const char *name) { in set_name()
3336 using detail::d1::queue_node;
/oneTBB/doc/GSG/
H A Dsamples.rst17 …* `A solution to the binpacking problem using a queue_node, a buffer_node, and function_node. <htt…
/oneTBB/examples/graph/som/
H A Dsom_graph.cpp117 oneapi::tbb::flow::queue_node<search_result_type>
148 q[scnt] = new oneapi::tbb::flow::queue_node<search_result_type>(*(g[scnt])); // output queue in build_BMU_graph()

12