Home
last modified time | relevance | path

Searched refs:node_idx (Results 1 – 4 of 4) sorted by relevance

/oneTBB/test/tbb/
H A Dtest_write_once_node.cpp133 for (size_t node_idx=0; node_idx<wo_vec.size(); ++node_idx) { in parallel_read_write_tests() local
142 tbb::flow::make_edge( wo_vec[node_idx], *r[i] ); in parallel_read_write_tests()
145 CHECK_MESSAGE( wo_vec[node_idx].is_valid() == false, "" ); in parallel_read_write_tests()
146 CHECK_MESSAGE( wo_vec[node_idx].try_get( v0 ) == false, "" ); in parallel_read_write_tests()
148 CHECK_MESSAGE( wo_vec[node_idx].try_put( R(-1) ), "" ); in parallel_read_write_tests()
154 utils::NativeParallelFor( nthreads, native_body<R>( wo_vec[node_idx] ) ); in parallel_read_write_tests()
161 tbb::flow::remove_edge( wo_vec[node_idx], *r[i] ); in parallel_read_write_tests()
163 CHECK_MESSAGE( wo_vec[node_idx].try_put( R(0) ) == false, "" ); in parallel_read_write_tests()
168 wo_vec[node_idx].clear(); in parallel_read_write_tests()
169 CHECK_MESSAGE( wo_vec[node_idx].is_valid() == false, "" ); in parallel_read_write_tests()
[all …]
H A Dtest_overwrite_node.cpp111 for (size_t node_idx=0; node_idx<ow_vec.size(); ++node_idx) { in parallel_read_write_tests() local
119 tbb::flow::make_edge( ow_vec[node_idx], *r[i] ); in parallel_read_write_tests()
122 CHECK_MESSAGE( ow_vec[node_idx].is_valid() == false, "" ); in parallel_read_write_tests()
123 CHECK_MESSAGE( ow_vec[node_idx].try_get( v0 ) == false, "" ); in parallel_read_write_tests()
130 utils::NativeParallelFor( nthreads, native_body<R>( ow_vec[node_idx] ) ); in parallel_read_write_tests()
137 tbb::flow::remove_edge( ow_vec[node_idx], *r[i] ); in parallel_read_write_tests()
139 CHECK_MESSAGE( ow_vec[node_idx].try_put( R(0) ), "" ); in parallel_read_write_tests()
144 ow_vec[node_idx].clear(); in parallel_read_write_tests()
145 CHECK_MESSAGE( ow_vec[node_idx].is_valid() == false, "" ); in parallel_read_write_tests()
146 CHECK_MESSAGE( ow_vec[node_idx].try_get( v0 ) == false, "" ); in parallel_read_write_tests()
H A Dtest_function_node.cpp76 for (size_t node_idx=0; node_idx<exe_vec.size(); ++node_idx) { in buffered_levels() local
77 tbb::flow::make_edge(pass_thru_vec[node_idx], exe_vec[node_idx]); in buffered_levels()
81 for (size_t node_idx=0; node_idx<exe_vec.size(); ++node_idx) { in buffered_levels() local
91 tbb::flow::make_edge( exe_vec[node_idx], *receivers[r] ); in buffered_levels()
103 senders.back()->register_successor(pass_thru_vec[node_idx] ); in buffered_levels()
119 … CHECK( senders[s]->my_receiver.load(std::memory_order_relaxed) == &pass_thru_vec[node_idx] ); in buffered_levels()
127 tbb::flow::remove_edge( exe_vec[node_idx], *receivers[r] ); in buffered_levels()
129 CHECK( exe_vec[node_idx].try_put( InputType() ) == true ); in buffered_levels()
H A Dtest_multifunction_node.cpp74 for (size_t node_idx=0; node_idx<exe_vec.size(); ++node_idx) { in buffered_levels() local
83 … tbb::flow::make_edge( tbb::flow::output_port<0>(exe_vec[node_idx]), *receivers[r] ); in buffered_levels()
95 tbb::flow::make_edge( *senders.back(), exe_vec[node_idx] ); in buffered_levels()
111 …CHECK_MESSAGE( senders[s]->my_receiver.load(std::memory_order_relaxed) == &exe_vec[node_idx], "" ); in buffered_levels()
119 … tbb::flow::remove_edge( tbb::flow::output_port<0>(exe_vec[node_idx]), *receivers[r] ); in buffered_levels()
121 CHECK_MESSAGE( exe_vec[node_idx].try_put( InputType() ) == true, "" ); in buffered_levels()