Home
last modified time | relevance | path

Searched refs:limiter_node (Results 1 – 19 of 19) sorted by relevance

/oneTBB/test/conformance/
H A Dconformance_limiter_node.cpp34 oneapi::tbb::flow::limiter_node<input_msg> node1(g, limit);
49 conformance::test_forwarding<oneapi::tbb::flow::limiter_node<int>, int>(1, 5);
56 conformance::test_buffering<oneapi::tbb::flow::limiter_node<int>, int>(5);
57 conformance::test_buffering<oneapi::tbb::flow::limiter_node<int, int>, int>(5);
67 limiter_node<int> node0(g, 1);
68 limiter_node<int> node1(g, 1);
75 limiter_node<int> node_copy(node1);
108 oneapi::tbb::flow::limiter_node<int, int> limit(g, threshold);
130 oneapi::tbb::flow::limiter_node<int, long long> limit2(g, threshold2);
148 oneapi::tbb::flow::limiter_node<int, long long> limit3(g, threshold3);
[all …]
H A Dconformance_split_node.cpp37 oneapi::tbb::flow::limiter_node<int> rejecter1(g,0);
38 oneapi::tbb::flow::limiter_node<float> rejecter2(g,0);
39 oneapi::tbb::flow::limiter_node<input_msg> rejecter3(g,0);
H A Dconformance_graph.cpp55 oneapi::tbb::flow::limiter_node<int> rejecter(g, 0); in test_input_node_rf_reset_protocol()
127 oneapi::tbb::flow::limiter_node<int> testing_node(g, limit); in test_limiter_node_rf_reset_protocol()
200 oneapi::tbb::flow::limiter_node<int> lim(g, 2);
H A Dconformance_indexer_node.cpp77 oneapi::tbb::flow::limiter_node<my_output_type> rejecter(g,0);
H A Dconformance_composite_node.cpp100 oneapi::tbb::flow::limiter_node<int> lim(g, 2);
H A Dconformance_flowgraph.h451 oneapi::tbb::flow::limiter_node<int> rejecter(g, 0); in test_buffering()
/oneTBB/test/tbb/
H A Dtest_limiter_node.cpp91 tbb::flow::limiter_node<T> &my_lim;
109 tbb::flow::limiter_node<T> &my_lim;
158 tbb::flow::limiter_node< T > lim(g, i); in test_parallel()
173 tbb::flow::limiter_node< T > lim(g, i); in test_parallel()
194 tbb::flow::limiter_node< T > lim(g, i); in test_serial()
207 tbb::flow::limiter_node< T > lim(g, i); in test_serial()
315 tbb::flow::limiter_node<int> ln(g,2); in test_continue_msg_reception()
494 limiter_node<int> l0(g, 100); in test_deduction_guides()
497 limiter_node l1(follows(br), 100); in test_deduction_guides()
500 limiter_node l2(precedes(br), 100); in test_deduction_guides()
[all …]
H A Dtest_profiling.cpp177 tbb::flow::limiter_node<int> node(g, 1);
H A Dtest_tbb_header.cpp220 TestTypeDefinitionPresence( flow::limiter_node<int> ); in DefinitionPresence()
H A Dtest_flow_graph.cpp257 tbb::flow::limiter_node< int > l_n(my_graph, 1); in operator ()()
H A Dtest_flow_graph_whitebox.cpp439 using type = tbb::flow::limiter_node<int, DecrementerType>;
445 using type = tbb::flow::limiter_node<int>;
H A Dtest_eh_flow_graph.cpp1636 typedef tbb::flow::limiter_node<BufferItemType> LmtType; in run_limiter_node_test()
H A Dtest_join_node.h1353 tbb::flow::limiter_node<q3_input_type> limiter(g, Count / 2);
/oneTBB/doc/main/tbb_userguide/
H A Duse_limiter_node.rst3 Using limiter_node
7 One way to limit resource consumption is to use a limiter_node to set a
15 limiter_node( graph &g, size_t threshold )
23 A limiter_node maintains an internal count of the messages that it has
25 a message can be sent to the decrement port on the ``limiter_node`` to
56 limiter_node< big_object * > l( g, max_objects );
76 objects at once. The ``limiter_node`` has a threshold of 3, and will
81 decrement port of the ``limiter_node``. So, after it completes executing,
82 the ``limiter_node`` internal count is decremented. When the internal count
85 three that have passed through the ``limiter_node`` and the one that is
H A DPredefined_Node_Types.rst44 * - limiter_node
/oneTBB/doc/main/reference/
H A Dconstructors_for_nodes.rst82 // limiter_node
83 limiter_node(follows(...), std::size_t threshold);
84 limiter_node(precedes(...), std::size_t threshold);
/oneTBB/include/oneapi/tbb/
H A Dflow_graph.h360 template<typename U, typename V> friend class limiter_node; variable
1877 class limiter_node : public graph_node, public receiver< T >, public sender< T > {
1895 threshold_regulator< limiter_node<T, DecrementType>, DecrementType > decrement;
1924 friend class forward_task_bypass< limiter_node<T,DecrementType> >;
2009 limiter_node(graph &g, size_t threshold) in limiter_node() function
2018 limiter_node(const node_set<Args...>& nodes, size_t threshold) in limiter_node() function
2019 : limiter_node(nodes.graph_reference(), threshold) { in limiter_node()
2025 limiter_node( const limiter_node& src ) : limiter_node(src.my_graph, src.my_threshold) {} in limiter_node() function
2063 typedef forward_task_bypass<limiter_node<T, DecrementType>> task_type; in register_predecessor()
3252 inline void set_name(const limiter_node<T, DecrementType>& node, const char *name) { in set_name()
[all …]
/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_nodes_deduction.h196 limiter_node(const NodeSet&, size_t)
197 ->limiter_node<decide_on_set_t<NodeSet>>;
H A D_flow_graph_body_impl.h350 template<typename U, typename V> friend class limiter_node;