Method MergeSubgraph

executor/lib/graph_task.cpp:116–179

}

Graph* GraphTask::MergeSubgraph(Graph* origin_graph, const std::vector<Subgraph*>& sub_list)
{
    std::string graph_name = origin_graph->GetName() + ".optimized";

    Graph* graph = new Graph(graph_name);
    int subgraph_number = sub_list.size();

    /* first: search the graph input nodes and graph output nodes
       and collect all nodes and tensors */

    graph->input_nodes = origin_graph->input_nodes;

    for(int i = 0; i < subgraph_number; i++)
    {
        Subgraph* sub = sub_list[i];

        graph->seq_nodes.insert(graph->seq_nodes.end(), sub->seq_nodes.begin(), sub->seq_nodes.end());

        for(unsigned int k = 0; k < sub->output_nodes.size(); k++)
        {
            Node* node = sub->output_nodes[k];

            unsigned int l;

            for(l = 0; l < node->GetOutputNum(); l++)
            {
                Tensor* tensor = node->GetOutputTensor(l);

                if(tensor->consumer.size() == 0)
                    break;
            }

            if(l < node->GetOutputNum())
                graph->output_nodes.push_back(node);
        }
    }

    /*second: setup the tensor map */

    for(unsigned int i = 0; i < graph->seq_nodes.size(); i++)
    {
        Node* node = graph->seq_nodes[i];
        node->SetNodeIndex(i);

        for(unsigned int l = 0; l < node->GetOutputNum(); l++)
        {
            Tensor* tensor = node->GetOutputTensor(l);
            graph->AddTensorMap(tensor->GetName(), tensor);
        }
    }

    /*third: get the output nodes order*/

    if(graph->output_nodes.size() > 1)
    {
        graph->output_nodes = origin_graph->output_nodes;
    }