54 void buffered_levels( size_t concurrency, Body body ) {  in buffered_levels()
57     for ( size_t lc = 1; lc <= concurrency; ++lc ) {  in buffered_levels()
74         for (size_t node_idx=0; node_idx<exe_vec.size(); ++node_idx) {  in buffered_levels()
75             for (size_t num_receivers = 1; num_receivers <= MAX_NODES; ++num_receivers ) {  in buffered_levels()
78                 for (size_t i = 0; i < num_receivers; i++) {  in buffered_levels()
82                 for (size_t r = 0; r < num_receivers; ++r ) {  in buffered_levels()
88                 for (size_t num_senders = 1; num_senders <= MAX_NODES; ++num_senders ) {  in buffered_levels()
92                     for (size_t s = 0; s < num_senders; ++s ) {  in buffered_levels()
99                     for (size_t r = 0; r < num_receivers; ++r ) {  in buffered_levels()
108                     for (size_t s = 0; s < num_senders; ++s ) {  in buffered_levels()
109                         size_t n = senders[s]->my_received;  in buffered_levels()
114                     for (size_t r = 0; r < num_receivers; ++r ) {  in buffered_levels()
118                 for (size_t r = 0; r < num_receivers; ++r ) {  in buffered_levels()
123                 for (size_t r = 0; r < num_receivers; ++r ) {  in buffered_levels()
132 const size_t Offset = 123;
133 std::atomic<size_t> global_execute_count;
137     std::atomic<size_t> local_execute_count;
139     inc_functor( const inc_functor &f ) { local_execute_count = size_t(f.local_execute_count); }  in inc_functor()
151 void buffered_levels_with_copy( size_t concurrency ) {  in buffered_levels_with_copy()
154     for ( size_t lc = 1; lc <= concurrency; ++lc ) {  in buffered_levels_with_copy()
163         for (size_t num_receivers = 1; num_receivers <= MAX_NODES; ++num_receivers ) {  in buffered_levels_with_copy()
166             for (size_t i = 0; i < num_receivers; i++) {  in buffered_levels_with_copy()
170             for (size_t r = 0; r < num_receivers; ++r ) {  in buffered_levels_with_copy()
175             for (size_t num_senders = 1; num_senders <= MAX_NODES; ++num_senders ) {  in buffered_levels_with_copy()
177                 for (size_t s = 0; s < num_senders; ++s ) {  in buffered_levels_with_copy()
183                 for (size_t r = 0; r < num_receivers; ++r ) {  in buffered_levels_with_copy()
190                 for (size_t s = 0; s < num_senders; ++s ) {  in buffered_levels_with_copy()
191                     size_t n = senders[s]->my_received;  in buffered_levels_with_copy()
195                 for (size_t r = 0; r < num_receivers; ++r ) {  in buffered_levels_with_copy()
199             for (size_t r = 0; r < num_receivers; ++r ) {  in buffered_levels_with_copy()
204             for (size_t r = 0; r < num_receivers; ++r ) {  in buffered_levels_with_copy()
211 …const size_t expected_count = N/2 * MAX_NODES * MAX_NODES * ( MAX_NODES + 1 ) + MAX_NODES + Offset;  in buffered_levels_with_copy()
212         size_t global_count = global_execute_count;  in buffered_levels_with_copy()
213         size_t inc_count = body_copy.local_execute_count;  in buffered_levels_with_copy()
238 void concurrency_levels( size_t concurrency, Body body ) {  in concurrency_levels()
240     for ( size_t lc = 1; lc <= concurrency; ++lc ) {  in concurrency_levels()
253         for (size_t num_receivers = 1; num_receivers <= MAX_NODES; ++num_receivers ) {  in concurrency_levels()
256             for (size_t i = 0; i < num_receivers; ++i) {  in concurrency_levels()
260             for (size_t r = 0; r < num_receivers; ++r ) {  in concurrency_levels()
266             for (size_t num_senders = 1; num_senders <= MAX_NODES; ++num_senders ) {  in concurrency_levels()
274                     for ( size_t c = 0 ; c < lc ; ++c ) {  in concurrency_levels()
281                     for (size_t s = 0; s < num_senders; ++s ) {  in concurrency_levels()
292                 for (size_t s = 0; s < num_senders; ++s ) {  in concurrency_levels()
293                     size_t n = senders[s]->my_received;  in concurrency_levels()
298                 for (size_t r = 0; r < num_receivers; ++r ) {  in concurrency_levels()
299                     size_t n = receivers[r]->my_count;  in concurrency_levels()
304             for (size_t r = 0; r < num_receivers; ++r ) {  in concurrency_levels()
309             for (size_t r = 0; r < num_receivers; ++r ) {  in concurrency_levels()
364         for (size_t num_receivers = 1; num_receivers <= MAX_NODES; ++num_receivers ) {  in unlimited_concurrency()
366             for (size_t i = 0; i < num_receivers; ++i) {  in unlimited_concurrency()
372             for (size_t r = 0; r < num_receivers; ++r ) {  in unlimited_concurrency()
380             size_t ec = harness_graph_multifunction_executor<InputType, OutputTuple>::execute_count;  in unlimited_concurrency()
382             for (size_t r = 0; r < num_receivers; ++r ) {  in unlimited_concurrency()
383                 size_t c = receivers[r]->my_count;  in unlimited_concurrency()
387             for (size_t r = 0; r < num_receivers; ++r ) {  in unlimited_concurrency()
602 concept can_call_multifunction_node_ctor = requires( tbb::flow::graph& graph, std::size_t concurren…