Home
last modified time | relevance | path

Searched refs:try_put (Results 1 – 25 of 72) sorted by relevance

123

/oneTBB/test/conformance/
H A Dconformance_limiter_node.cpp40 node1.try_put(input_msg(1));
79 node_copy.try_put(1);
84 node_copy.try_put(1);
89 node0.try_put(1);
120 CHECK_MESSAGE(( !limit.try_put( m )), "Limiter node's gate is not closed." );
134 CHECK_MESSAGE(limit2.decrementer().try_put( -decrement_value ),
137 CHECK_MESSAGE(limit2.decrementer().try_put( -decrement_value ),
151 CHECK_MESSAGE(limit3.decrementer().try_put( -decrement_value3 ),
155 while( limit3.try_put( m ) ){ m++; };
170 limit4.try_put(-1);
[all …]
H A Dconformance_graph.cpp77 f.try_put(0); in test_functional_nodes_rf_reset_protocol()
78 f.try_put(0); in test_functional_nodes_rf_reset_protocol()
230 fxn.try_put(1);
231 m_fxn.try_put(1);
232 bc.try_put(1);
233 lim.try_put(1);
236 bf.try_put(1);
237 pq.try_put(1);
238 wo.try_put(1);
239 ovw.try_put(1);
[all …]
H A Dconformance_join_node.cpp151 f1.try_put(1);
155 f1.try_put(2);
156 f2.try_put(1.5f);
160 f1.try_put(3);
161 f2.try_put(2.5f);
162 c1.try_put(oneapi::tbb::flow::continue_msg());
166 f2.try_put(3.5f);
182 f1.try_put(1);
183 f2.try_put(1);
295 f1.try_put(i); in test_invoke_basic()
[all …]
H A Dconformance_indexer_node.cpp43 oneapi::tbb::flow::input_port<0>(testing_node).try_put(6);
44 oneapi::tbb::flow::input_port<1>(testing_node).try_put(1.5);
45 oneapi::tbb::flow::input_port<2>(testing_node).try_put(input_msg(1));
80 oneapi::tbb::flow::input_port<0>(testing_node).try_put(6);
81 oneapi::tbb::flow::input_port<1>(testing_node).try_put(1.5);
82 oneapi::tbb::flow::input_port<2>(testing_node).try_put(input_msg(1));
123 f1.try_put(3);
124 f2.try_put(3);
125 c1.try_put(oneapi::tbb::flow::continue_msg());
148 oneapi::tbb::flow::input_port<0>(node_copy).try_put(1);
[all …]
H A Dconformance_flowgraph.h282 g.try_put(argument); in operator()
331 g.try_put(argument); in operator()
409 g.try_put(argument); in operator()
511 testing_node.try_put(0); in test_forwarding_single_push()
519 testing_node.try_put(1); in test_forwarding_single_push()
572 node_copy.try_put(1); in test_copy_ctor()
577 node0.try_put(1); in test_copy_ctor()
598 testing_node.try_put(1); in test_copy_ctor_for_buffering_nodes()
611 node_copy.try_put(0); in test_copy_ctor_for_buffering_nodes()
704 fnode.try_put(0); in test_rejecting()
[all …]
H A Dconformance_sequencer_node.cpp103 node.try_put(1);
105 …CHECK_MESSAGE((node.try_put(1) == false), "sequencer_node must rejects duplicate sequencer numbers…
117 node.try_put(1);
118 node.try_put(0);
119 node.try_put(1);
160 process.try_put(msg);
192 starter.try_put(objects_count - i - 1);
206 starter.try_put(objects_count - i - 1);
H A Dconformance_priority_queue_node.cpp62 testing_node.try_put(2);
63 testing_node.try_put(3);
64 testing_node.try_put(1);
H A Dconformance_continue_node.cpp201 node_copy.try_put(oneapi::tbb::flow::continue_msg());
206 node_copy.try_put(oneapi::tbb::flow::continue_msg());
211 node1.try_put(oneapi::tbb::flow::continue_msg());
212 node1.try_put(oneapi::tbb::flow::continue_msg());
213 node0.try_put(oneapi::tbb::flow::continue_msg());
237 node3.try_put(oneapi::tbb::flow::continue_msg());
238 node2.try_put(oneapi::tbb::flow::continue_msg());
239 node1.try_put(oneapi::tbb::flow::continue_msg());
264 node1.try_put(oneapi::tbb::flow::continue_msg());
H A Dconformance_overwrite_node.cpp37 testing_node.try_put(1);
43 testing_node.try_put(2);
95 testing_node.try_put(1);
/oneTBB/test/tbb/
H A Dtest_limiter_node.cpp99 bool msg = my_lim.try_put( T(i) ); in operator ()()
198 bool msg = lim.try_put( T(j) ); in test_serial()
213 bool msg = lim.try_put( T(j) ); in test_serial()
217 msg = lim.try_put( T(j) ); in test_serial()
293 mf_node.try_put(1); in test_multifunction_to_limiter()
305 mf_node.try_put(1); in test_multifunction_to_limiter()
319 ln.try_put(42); in test_continue_msg_reception()
361 broad.try_put(1); //drop the count in test_reserve_release_messages()
425 while( limit3.try_put( m ) ){ m++; }; in test_decrementer()
447 bn.try_put(i); in test_try_put_without_successors()
[all …]
H A Dtest_flow_graph_whitebox.cpp246 qnode0.try_put(1); in TestFunctionNode()
257 qnode0.try_put(1); in TestFunctionNode()
409 q0.try_put(1); in TestJoinNode()
416 q1.try_put(2); in TestJoinNode()
492 inq.try_put(1); in TestLimiterNode()
496 inq.try_put(2); in TestLimiterNode()
507 inq.try_put(3); in TestLimiterNode()
523 inq.try_put(4); in TestLimiterNode()
524 inq.try_put(5); in TestLimiterNode()
884 on.try_put(1);
[all …]
H A Dtest_multifunction_node.cpp145 (void)std::get<0>(p).try_put(i); in operator ()()
436 mo_node.try_put(i); in run_multiport_test()
499 std::get<0>(op).try_put(i); in test_precedes()
501 std::get<1>(op).try_put(i); in test_precedes()
505 node.try_put(0); in test_precedes()
506 node.try_put(1); in test_precedes()
522 std::get<0>(op).try_put(i); in test_follows_and_precedes_api()
570 std::get<0>(op).try_put(i); in __anon0fcb77200802()
572 std::get<1>(op).try_put(i); in __anon0fcb77200802()
576 node.try_put(0);
[all …]
H A Dtest_flow_graph.cpp261 c_n.try_put( tbb::flow::continue_msg() ); in operator ()()
262 f_n.try_put(1); in operator ()()
263 m_n.try_put(1); in operator ()()
266 tbb::flow::input_port<0>(j_n).try_put(1); in operator ()()
267 tbb::flow::input_port<1>(j_n).try_put(1); in operator ()()
270 sp_n.try_put(sp_tuple); in operator ()()
272 ow_n.try_put(1); in operator ()()
273 w_n.try_put(1); in operator ()()
274 buf_n.try_put(1); in operator ()()
275 l_n.try_put(1); in operator ()()
H A Dtest_broadcast_node.cpp97 CHECK_MESSAGE( b.try_put( (T)n ), "" ); in test_serial_broadcasts()
106 CHECK_MESSAGE( b.try_put( (T)0 ), "" ); in test_serial_broadcasts()
124 CHECK_MESSAGE( my_b.try_put( (T)n ), "" ); in operator ()()
149 CHECK_MESSAGE( b.try_put( (T)0 ), "" ); in run_parallel_broadcasts()
182 b0.try_put(i); in test_resets()
196 b0.try_put(i); in test_resets()
201 b1.try_put(i); in test_resets()
H A Dtest_priority_queue_node.cpp60 bool msg = my_q.try_put( T(N*i + j) ); in operator ()()
90 CHECK_MESSAGE( my_q.try_put( T (N*tid + j ) ) == true, "" ); in operator ()()
117 q.try_put(T(1)); in test_reservation()
118 q.try_put(T(2)); in test_reservation()
119 q.try_put(T(3)); in test_reservation()
267 CHECK_MESSAGE( q.try_put( T(i) ), "" ); in test_serial()
281 CHECK_MESSAGE( q.try_put( T(i) ), "" ); in test_serial()
296 CHECK_MESSAGE( q.try_put( 1 ) == true, "" ); in test_serial()
309 CHECK_MESSAGE( q.try_put( T(i) ), "" ); in test_serial()
326 CHECK_MESSAGE( q.try_put( 1 ) == true, "" ); in test_serial()
H A Dtest_async_node.cpp163 a.try_put(-1); in test_reset()
165 a.try_put(i); in test_reset()
184 a.try_put(i); in test_reset()
205 a.try_put(i); in test_reset()
224 a.try_put(i); in test_reset()
243 a.try_put(i); in test_reset()
263 a.try_put(i); in test_reset()
483 a.try_put(i); in test_copy_ctor()
494 b.try_put(i); in test_copy_ctor()
740 pred.try_put(1); in test_follows()
[all …]
H A Dtest_continue_node.cpp56 CHECK_MESSAGE( my_exe_node->try_put( InputType() ) == true, "" ); in operator ()()
104 exe_node.try_put(tbb::flow::continue_msg()); in continue_nodes()
234 start_g.try_put(continue_msg()); in test_two_graphs()
235 start_h.try_put(continue_msg()); in test_two_graphs()
241 start_h.try_put(continue_msg()); in test_two_graphs()
242 start_h.try_put(continue_msg()); in test_two_graphs()
248 start_g.try_put(continue_msg()); in test_two_graphs()
285 node1.try_put(tbb::flow::continue_msg()); in test_lightweight_policy()
347 node_with_default_mutex_type.try_put(continue_msg()); in test_successor_cache_specialization()
348 node_with_non_default_mutex_type.try_put(continue_msg()); in test_successor_cache_specialization()
H A Dtest_overwrite_node.cpp51 CHECK_MESSAGE( n.try_put( static_cast<R>(N) ), "" ); in simple_read_write_tests()
63 CHECK_MESSAGE( n.try_put( v1 ), "" ); in simple_read_write_tests()
78 CHECK_MESSAGE( n.try_put( R(0) ), "" ); in simple_read_write_tests()
99 CHECK_MESSAGE( my_node.try_put( v1 ), "" ); in operator ()()
139 CHECK_MESSAGE( ow_vec[node_idx].try_put( R(0) ), "" ); in parallel_read_write_tests()
249 node.try_put(1);
H A Dtest_write_once_node.cpp54 CHECK_MESSAGE( n.try_put( static_cast<R>(N+1) ), "" ); in simple_read_write_tests()
74 bool result = n.try_put( v1 ); in simple_read_write_tests()
98 CHECK_MESSAGE( n.try_put( R(0) ) == false, "" ); in simple_read_write_tests()
119 CHECK_MESSAGE( my_node.try_put( v1 ) == false, "" ); in operator ()()
148 CHECK_MESSAGE( wo_vec[node_idx].try_put( R(-1) ), "" ); in parallel_read_write_tests()
163 CHECK_MESSAGE( wo_vec[node_idx].try_put( R(0) ) == false, "" ); in parallel_read_write_tests()
H A Dtest_queue_node.cpp74 bool msg = my_q.try_put( T(N*i + j) ); in operator ()()
182 CHECK_MESSAGE( my_q.try_put( T (N*tid + j ) ) == true, "" ); in operator ()()
208 q.try_put(T(1)); in test_reservation()
209 q.try_put(T(2)); in test_reservation()
210 q.try_put(T(3)); in test_reservation()
381 bool msg = q.try_put( T(i) ); in test_serial()
399 bool msg = q.try_put( T(i) ); in test_serial()
417 CHECK_MESSAGE( q.try_put( 1 ) == true, "" ); in test_serial()
430 bool msg = q.try_put( T(i) ); in test_serial()
449 CHECK_MESSAGE( q.try_put( 1 ) == true, "" ); in test_serial()
[all …]
/oneTBB/examples/graph/binpack/
H A Dbinpack.cpp104 std::get<0>(p).try_put(item); in operator ()()
113 std::get<1>(p).try_put(my_bin); in operator ()()
120 std::get<0>(p).try_put(desired_bin_capacity + 1); // send out signal in operator ()()
129 std::get<0>(p).try_put(my_bin[i]); in operator ()()
132 std::get<0>(p).try_put(desired_bin_capacity + 1); // send out signal in operator ()()
139 std::get<1>(p).try_put(my_bin); in operator ()()
153 std::get<0>(p).try_put(desired_bin_capacity + 1); // send out signal in operator ()()
156 std::get<1>(p).try_put(my_bin); in operator ()()
182 std::get<0>(p).try_put(my_bin[i]); in operator ()()
190 std::get<1>(p).try_put(my_bin); in operator ()()
[all …]
/oneTBB/doc/main/tbb_userguide/
H A DNodes.rst73 invoking its function try_put. Using edges is described in the next
80 n.try_put( 1 );
81 n.try_put( 2 );
82 n.try_put( 3 );
101 try_put do not block until a task is spawned; if a node cannot
134 call try_put on the node:
140 n.try_put( 1 );
141 n.try_put( 2 );
142 n.try_put( 3 );
H A DFlow_Graph_Single_Vs_Broadcast.rst59 buf1.try_put(continue_msg());
60 buf1.try_put(continue_msg());
61 buf1.try_put(continue_msg());
75 bn.try_put(continue_msg());
76 bn.try_put(continue_msg());
77 bn.try_put(continue_msg());
H A Duse_nested_flow_graphs.rst28 n1.try_put(continue_msg());
54 m1.try_put(i);
60 a.try_put(i);
109 n1.try_put(continue_msg());
114 m1.try_put(i);
120 a.try_put(i);
130 would be valid in the body of ``b`` above to call ``m1.try_put(i)`` and then
/oneTBB/test/common/
H A Dgraph_utils.h410 if ( s->try_put( T(i) ) ) {
422 while ( s->try_put( T(i) ) ) {
432 CHECK( s->try_put( T(i) ) );
501 b0.try_put(i);
514 b0.try_put(i);
600 b0.try_put((T)23);
633 my_reserving_node.try_put(i);
644 my_buffer_node.try_put(i);
645 my_reserving_node.try_put(i);
694 my_node.try_put(this_id);
[all …]

123