Lines Matching refs:continue_msg

114 struct node_creator_t< continue_node<continue_msg>, BodyType > {
115 … continue_node<continue_msg>* operator()( graph& g, unsigned index, utils::SpinBarrier& barrier ) { in operator ()()
117 … return new continue_node<continue_msg>( g, BodyType(index, barrier), node_priority_t(index) ); in operator ()()
119 return new continue_node<continue_msg>( g, BodyType(no_priority, barrier) ); in operator ()()
126 continue_msg operator()( T ) const { return continue_msg(); } in operator ()()
209 call_within_arena< continue_node<continue_msg>, Body<continue_msg> >( arena ); in test()
433 continue_msg operator()( const continue_msg& msg ) const { in operator ()()
496 typedef std::vector< std::unique_ptr<continue_node<continue_msg>> > nodes_container_t;
501 std::unique_ptr<continue_node<continue_msg>>( in create_nodes()
502 new continue_node<continue_msg>( g, CommonBody<NONPRIORITIZED_WORK>( body_size ) ) in create_nodes()
524 std::unique_ptr<continue_node<continue_msg>>( in test()
525 new continue_node<continue_msg>( in test()
532 broadcast_node<continue_msg> bn(g); in test()
539 bn.try_put( continue_msg() ); in test()
554 continue_msg operator()( const continue_msg& ) const { in operator ()()
555 return continue_msg(); in operator ()()
569 continue_node<continue_msg> start_node(inner_graph, InnerBody()); in operator ()()
570 continue_node<continue_msg> mid_node1(inner_graph, InnerBody(), node_priority_t(5)); in operator ()()
571 continue_node<continue_msg> mid_node2(inner_graph, InnerBody()); in operator ()()
572 continue_node<continue_msg> end_node(inner_graph, InnerBody(), node_priority_t(15)); in operator ()()
578 start_node.try_put( continue_msg() ); in operator ()()
660 continue_msg operator()(const continue_msg&) { in operator ()()
662 return continue_msg(); in operator ()()
668 continue_msg operator()( tbb::flow_control& fc ){ in operator ()()
673 return continue_msg(); in operator ()()
679 return continue_msg(); in operator ()()
685 return continue_node<continue_msg>( g, Body(0) ); in create_starter_node()
689 input_node<continue_msg> create_starter_node<input_node<continue_msg>>(graph& g) { in create_starter_node()
690 return input_node<continue_msg>( g, InputNodeBody() ); in create_starter_node()
695 starter.try_put( continue_msg() ); in start_graph()
699 void start_graph<input_node<continue_msg>>( input_node<continue_msg>& starter ) { in start_graph()
709 continue_node<continue_msg> spawn_successor( g, Body(1), node_priority_t(1) ); in test_use_case()
710 continue_node<continue_msg> bypass_successor( g, Body(2), node_priority_t(2) ); in test_use_case()
731 test_use_case<continue_node<continue_msg>>(); in test()
732 test_use_case<input_node<continue_msg>>(); in test()
740 void operator()(continue_msg) { in operator ()()
749 void operator()(continue_msg) { in operator ()()
762 broadcast_node<continue_msg> bn(g); in test()
763 std::vector< std::unique_ptr<continue_node<continue_msg>> > nodes; in test()
767 std::unique_ptr<continue_node<continue_msg>>( in test()
768 new continue_node<continue_msg>(g, no_priority_node_body{ barrier }) in test()
773 std::unique_ptr<continue_node<continue_msg>>( in test()
774 … new continue_node<continue_msg>(g, priority_node_body{ barrier }, /*priority*/1) in test()
786 bn.try_put(continue_msg()); in test()
806 continue_node<unsigned> c(g, [&msg_count](continue_msg) { in test() argument
822 c.try_put(continue_msg()); in test()