Lines Matching refs:size_t

55 void buffered_levels( size_t concurrency, Body body ) {  in buffered_levels()
58 for ( size_t lc = 1; lc <= concurrency; ++lc ) { in buffered_levels()
76 for (size_t node_idx=0; node_idx<exe_vec.size(); ++node_idx) { in buffered_levels()
81 for (size_t node_idx=0; node_idx<exe_vec.size(); ++node_idx) { in buffered_levels()
83 for (size_t num_receivers = 1; num_receivers <= MAX_NODES; ++num_receivers ) { in buffered_levels()
86 for (size_t i = 0; i < num_receivers; i++) { in buffered_levels()
90 for (size_t r = 0; r < num_receivers; ++r ) { in buffered_levels()
96 for (size_t num_senders = 1; num_senders <= MAX_NODES; ++num_senders ) { in buffered_levels()
100 for (size_t s = 0; s < num_senders; ++s ) { in buffered_levels()
107 for (size_t r = 0; r < num_receivers; ++r ) { in buffered_levels()
116 for (size_t s = 0; s < num_senders; ++s ) { in buffered_levels()
117 size_t n = senders[s]->my_received; in buffered_levels()
122 for (size_t r = 0; r < num_receivers; ++r ) { in buffered_levels()
126 for (size_t r = 0; r < num_receivers; ++r ) { in buffered_levels()
131 for (size_t r = 0; r < num_receivers; ++r ) { in buffered_levels()
141 const size_t Offset = 123;
142 std::atomic<size_t> global_execute_count;
146 std::atomic<size_t> local_execute_count;
148 inc_functor( const inc_functor &f ) { local_execute_count = size_t(f.local_execute_count); } in inc_functor()
149 void operator=( const inc_functor &f ) { local_execute_count = size_t(f.local_execute_count); } in operator =()
160 void buffered_levels_with_copy( size_t concurrency ) { in buffered_levels_with_copy()
163 for ( size_t lc = 1; lc <= concurrency; ++lc ) { in buffered_levels_with_copy()
172 for (size_t num_receivers = 1; num_receivers <= MAX_NODES; ++num_receivers ) { in buffered_levels_with_copy()
175 for (size_t i = 0; i < num_receivers; i++) { in buffered_levels_with_copy()
179 for (size_t r = 0; r < num_receivers; ++r ) { in buffered_levels_with_copy()
184 for (size_t num_senders = 1; num_senders <= MAX_NODES; ++num_senders ) { in buffered_levels_with_copy()
186 for (size_t s = 0; s < num_senders; ++s ) { in buffered_levels_with_copy()
192 for (size_t r = 0; r < num_receivers; ++r ) { in buffered_levels_with_copy()
199 for (size_t s = 0; s < num_senders; ++s ) { in buffered_levels_with_copy()
200 size_t n = senders[s]->my_received; in buffered_levels_with_copy()
204 for (size_t r = 0; r < num_receivers; ++r ) { in buffered_levels_with_copy()
208 for (size_t r = 0; r < num_receivers; ++r ) { in buffered_levels_with_copy()
213 for (size_t r = 0; r < num_receivers; ++r ) { in buffered_levels_with_copy()
220 …const size_t expected_count = N/2 * MAX_NODES * MAX_NODES * ( MAX_NODES + 1 ) + MAX_NODES + Offset; in buffered_levels_with_copy()
221 size_t global_count = global_execute_count; in buffered_levels_with_copy()
222 size_t inc_count = body_copy.local_execute_count; in buffered_levels_with_copy()
251 void concurrency_levels( size_t concurrency, Body body ) { in concurrency_levels()
253 for ( size_t lc = 1; lc <= concurrency; ++lc ) { in concurrency_levels()
266 for (size_t num_receivers = 1; num_receivers <= MAX_NODES; ++num_receivers ) { in concurrency_levels()
269 for (size_t i = 0; i < num_receivers; ++i) { in concurrency_levels()
273 for (size_t r = 0; r < num_receivers; ++r ) { in concurrency_levels()
279 for (size_t num_senders = 1; num_senders <= MAX_NODES; ++num_senders ) { in concurrency_levels()
288 for ( size_t c = 0 ; c < lc ; ++c ) { in concurrency_levels()
294 for (size_t s = 0; s < num_senders; ++s ) { in concurrency_levels()
306 for (size_t s = 0; s < num_senders; ++s ) { in concurrency_levels()
307 size_t n = senders[s]->my_received; in concurrency_levels()
312 for (size_t r = 0; r < num_receivers; ++r ) { in concurrency_levels()
313 size_t n = receivers[r]->my_count; in concurrency_levels()
318 for (size_t r = 0; r < num_receivers; ++r ) { in concurrency_levels()
323 for (size_t r = 0; r < num_receivers; ++r ) { in concurrency_levels()
376 for (size_t num_receivers = 1; num_receivers <= MAX_NODES; ++num_receivers ) { in unlimited_concurrency()
379 for (size_t i = 0; i < num_receivers; ++i) { in unlimited_concurrency()
385 for (size_t r = 0; r < num_receivers; ++r ) { in unlimited_concurrency()
393 size_t ec = harness_graph_executor<InputType, OutputType>::execute_count; in unlimited_concurrency()
395 for (size_t r = 0; r < num_receivers; ++r ) { in unlimited_concurrency()
396 size_t c = receivers[r]->my_count; in unlimited_concurrency()
400 for (size_t r = 0; r < num_receivers; ++r ) { in unlimited_concurrency()
523 concept can_call_function_node_ctor = requires( tbb::flow::graph& graph, std::size_t concurrency, B…