138     std::vector< std::unique_ptr<NodeType> > nodes;  in test_node()  local
140         nodes.push_back(std::unique_ptr<NodeType>( node_creator(g, i, barrier) ));  in test_node()
141         make_edge( bn, *nodes.back() );  in test_node()
142         make_edge( *nodes.back(), tn );  in test_node()
498 void create_nodes( nodes_container_t& nodes, graph& g, int num, int body_size ) {  in create_nodes()  argument
500         nodes.push_back(  in create_nodes()
521             nodes_container_t nodes;  in test()  local
522             create_nodes( nodes, g, pivot, large_problem_size );  in test()
523             nodes.push_back(  in test()
530             create_nodes( nodes, g, nodes_num - pivot - 1, large_problem_size );  in test()
535                     make_edge( bn, *nodes[i] );  in test()
537                     make_edge( *nodes[i-1], *nodes[i] );  in test()
763             std::vector< std::unique_ptr<continue_node<continue_msg>> > nodes;  in test()  local
766                 nodes.push_back(  in test()
772                 nodes.push_back(  in test()
783                 std::shuffle(nodes.begin(), nodes.end(), gen);  in test()
784                 for (auto& n : nodes)  in test()
788                 for (auto& n : nodes)  in test()