| /dports/devel/onetbb/oneTBB-2021.4.0/test/conformance/ |
| H A D | conformance_limiter_node.cpp | 48 …CHECK_MESSAGE( (std::is_base_of<graph_node, limiter_node<T>>::value), "sequencer_node should be de… in test_inheritance()
49 …CHECK_MESSAGE( (std::is_base_of<receiver<T>, limiter_node<T>>::value), "sequencer_node should be d… in test_inheritance()
50 …CHECK_MESSAGE( (std::is_base_of<sender<T>, limiter_node<T>>::value), "sequencer_node should be der… in test_inheritance()
57 limiter_node<int> n(g, 5); in test_copies()
58 limiter_node<int> n2(n); in test_copies()
65 oneapi::tbb::flow::limiter_node<int> node(g, 5); in test_buffering()
66 oneapi::tbb::flow::limiter_node<int> rejecter(g, 0); in test_buffering()
80 oneapi::tbb::flow::limiter_node<int> node1(g, 5); in test_forwarding()
97 oneapi::tbb::flow::limiter_node<int> node1(g, 5); in test_limiting()
|
| H A D | conformance_split_node.cpp | 123 limiter_node< int > rejecter1( g,0);
124 limiter_node< int > rejecter2( g,0);
|
| H A D | conformance_async_node.cpp | 131 oneapi::tbb::flow::limiter_node< int > rejecter1( g,0); in test_discarding()
132 oneapi::tbb::flow::limiter_node< int > rejecter2( g,0); in test_discarding()
|
| H A D | conformance_broadcast_node.cpp | 62 oneapi::tbb::flow::limiter_node<int> rejecter(g, 0); in test_buffering()
|
| H A D | conformance_buffer_node.cpp | 67 oneapi::tbb::flow::limiter_node<int> rejecter(g, 0); in test_buffering()
|
| H A D | conformance_overwrite_node.cpp | 70 oneapi::tbb::flow::limiter_node<int> rejecter(g, 0); in test_buffering()
|
| H A D | conformance_write_once_node.cpp | 68 oneapi::tbb::flow::limiter_node<int> rejecter(g, 0); in test_buffering()
|
| H A D | conformance_indexer_node.cpp | 111 limiter_node< my_indexer_type::output_type > rejecter( g,0);
|
| H A D | conformance_priority_queue_node.cpp | 67 oneapi::tbb::flow::limiter_node<int> rejecter(g, 0); in test_buffering()
|
| H A D | conformance_sequencer_node.cpp | 80 oneapi::tbb::flow::limiter_node<int> rejecter(g, 0); in test_buffering()
|
| H A D | conformance_queue_node.cpp | 68 oneapi::tbb::flow::limiter_node<int> rejecter(g, 0); in test_buffering()
|
| H A D | conformance_input_node.cpp | 119 oneapi::tbb::flow::limiter_node<int> rejecter(g, 0); in test_buffering()
|
| /dports/devel/onetbb/oneTBB-2021.4.0/test/tbb/ |
| H A D | test_limiter_node.cpp | 90 tbb::flow::limiter_node<T> &my_lim;
108 tbb::flow::limiter_node<T> &my_lim;
157 tbb::flow::limiter_node< T > lim(g, i); in test_parallel()
172 tbb::flow::limiter_node< T > lim(g, i); in test_parallel()
193 tbb::flow::limiter_node< T > lim(g, i); in test_serial()
206 tbb::flow::limiter_node< T > lim(g, i); in test_serial()
314 tbb::flow::limiter_node<int> ln(g,2); in test_continue_msg_reception()
496 limiter_node<int> l0(g, 100); in test_deduction_guides()
499 limiter_node l1(follows(br), 100); in test_deduction_guides()
502 limiter_node l2(precedes(br), 100); in test_deduction_guides()
[all …]
|
| /dports/math/stanmath/math-4.2.0/lib/tbb_2020.3/src/test/ |
| H A D | test_limiter_node.cpp | 118 tbb::flow::limiter_node<T> &my_lim;
136 tbb::flow::limiter_node<T> &my_lim;
193 tbb::flow::limiter_node< T > lim(g, i); in test_parallel()
208 tbb::flow::limiter_node< T > lim(g, i); in test_parallel()
229 tbb::flow::limiter_node< T > lim(g, i); in test_serial()
242 tbb::flow::limiter_node< T > lim(g, i); in test_serial()
359 tbb::flow::limiter_node<int> ln(g,2); in test_continue_msg_reception()
633 limiter_node<int> l0(g, 100); in test_deduction_guides()
636 limiter_node l1(follows(br), 100); in test_deduction_guides()
639 limiter_node l2(precedes(br), 100); in test_deduction_guides()
[all …]
|
| /dports/devel/tbb/oneTBB-2020.3/src/test/ |
| H A D | test_limiter_node.cpp | 118 tbb::flow::limiter_node<T> &my_lim;
136 tbb::flow::limiter_node<T> &my_lim;
193 tbb::flow::limiter_node< T > lim(g, i); in test_parallel()
208 tbb::flow::limiter_node< T > lim(g, i); in test_parallel()
229 tbb::flow::limiter_node< T > lim(g, i); in test_serial()
242 tbb::flow::limiter_node< T > lim(g, i); in test_serial()
359 tbb::flow::limiter_node<int> ln(g,2); in test_continue_msg_reception()
633 limiter_node<int> l0(g, 100); in test_deduction_guides()
636 limiter_node l1(follows(br), 100); in test_deduction_guides()
639 limiter_node l2(precedes(br), 100); in test_deduction_guides()
[all …]
|
| /dports/devel/taskflow/taskflow-3.2.0/3rd-party/tbb/src/test/ |
| H A D | test_limiter_node.cpp | 118 tbb::flow::limiter_node<T> &my_lim;
136 tbb::flow::limiter_node<T> &my_lim;
193 tbb::flow::limiter_node< T > lim(g, i); in test_parallel()
208 tbb::flow::limiter_node< T > lim(g, i); in test_parallel()
229 tbb::flow::limiter_node< T > lim(g, i); in test_serial()
242 tbb::flow::limiter_node< T > lim(g, i); in test_serial()
359 tbb::flow::limiter_node<int> ln(g,2); in test_continue_msg_reception()
633 limiter_node<int> l0(g, 100); in test_deduction_guides()
636 limiter_node l1(follows(br), 100); in test_deduction_guides()
639 limiter_node l2(precedes(br), 100); in test_deduction_guides()
[all …]
|
| /dports/devel/onetbb/oneTBB-2021.4.0/doc/main/tbb_userguide/ |
| H A D | use_limiter_node.rst | 3 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
|
| /dports/devel/onetbb/oneTBB-2021.4.0/doc/main/reference/ |
| H A D | constructors_for_nodes.rst | 82 // limiter_node
83 limiter_node(follows(...), std::size_t threshold);
84 limiter_node(precedes(...), std::size_t threshold);
|
| /dports/devel/onetbb/oneTBB-2021.4.0/include/oneapi/tbb/ |
| H A D | flow_graph.h | 366 template<typename U, typename V> friend class limiter_node; variable
1877 class limiter_node : public graph_node, public receiver< T >, public sender< T > {
1894 threshold_regulator< limiter_node<T, DecrementType>, DecrementType > decrement;
1916 friend class forward_task_bypass< limiter_node<T,DecrementType> >;
1990 limiter_node(graph &g, size_t threshold) in limiter_node() function
1999 limiter_node(const node_set<Args...>& nodes, size_t threshold) in limiter_node() function
2000 : limiter_node(nodes.graph_reference(), threshold) { in limiter_node()
2006 limiter_node( const limiter_node& src ) : limiter_node(src.my_graph, src.my_threshold) {} in limiter_node() function
2044 typedef forward_task_bypass<limiter_node<T, DecrementType>> task_type; in register_predecessor()
3220 inline void set_name(const limiter_node<T, DecrementType>& node, const char *name) { in set_name()
[all …]
|
| /dports/devel/onetbb/oneTBB-2021.4.0/include/oneapi/tbb/detail/ |
| H A D | _flow_graph_nodes_deduction.h | 196 limiter_node(const NodeSet&, size_t)
197 ->limiter_node<decide_on_set_t<NodeSet>>;
|
| /dports/devel/concurrentqueue/concurrentqueue-1.0.3-15-g0753496/benchmarks/tbb/ |
| H A D | flow_graph.h | 130 template< typename T > class limiter_node; // needed for resetting decrementer variable
210 template<typename U> friend class limiter_node;
354 template<typename U> friend class limiter_node; variable
2457 class limiter_node : public graph_node, public receiver< T >, public sender< T > {
2479 friend class internal::forward_task_bypass< limiter_node<T> >;
2482 friend class internal::decrementer< limiter_node<T> >;
2559 internal::decrementer< limiter_node<T> > decrement;
2562 limiter_node(graph &g, size_t threshold, int num_decrement_predecessors=0) :
2576 limiter_node( const limiter_node& src ) : in limiter_node() function
2691 internal::forward_task_bypass< limiter_node<T> >( *this ); in try_put_task()
[all …]
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/tbb-2018_U2/include/tbb/ |
| H A D | flow_graph.h | 102 template< typename T > class limiter_node; // needed for resetting decrementer variable
332 template< typename > friend class limiter_node;
558 template<typename U> friend class limiter_node;
666 template<typename U> friend class limiter_node;
2679 friend class internal::forward_task_bypass< limiter_node<T> >;
2682 friend class internal::decrementer< limiter_node<T> >;
2757 internal::decrementer< limiter_node<T> > decrement;
2760 limiter_node(graph &g, size_t threshold, int num_decrement_predecessors=0) :
2774 limiter_node( const limiter_node& src ) :
2898 internal::forward_task_bypass< limiter_node<T> >( *this );
[all …]
|
| /dports/math/stanmath/math-4.2.0/lib/tbb_2020.3/include/tbb/internal/ |
| H A D | _flow_graph_nodes_deduction.h | 217 limiter_node(const NodeSet&, size_t)
218 ->limiter_node<decide_on_set_t<NodeSet>>;
|
| /dports/devel/tbb/oneTBB-2020.3/include/tbb/internal/ |
| H A D | _flow_graph_nodes_deduction.h | 217 limiter_node(const NodeSet&, size_t)
218 ->limiter_node<decide_on_set_t<NodeSet>>;
|
| /dports/devel/taskflow/taskflow-3.2.0/3rd-party/tbb/include/tbb/internal/ |
| H A D | _flow_graph_nodes_deduction.h | 217 limiter_node(const NodeSet&, size_t)
218 ->limiter_node<decide_on_set_t<NodeSet>>;
|