You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
graphengine/inc/external/graph/graph.h

101 lines
2.9 KiB

/**
* Copyright 2019-2020 Huawei Technologies Co., Ltd
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#ifndef INC_EXTERNAL_GRAPH_GRAPH_H_
#define INC_EXTERNAL_GRAPH_GRAPH_H_
#include <memory>
#include <string>
#include <utility>
#include <vector>
#include "./operator.h"
#include "./gnode.h"
namespace ge {
class Graph;
class GraphImpl;
using GraphImplPtr = std::shared_ptr<GraphImpl>;
using GraphPtr = std::shared_ptr<Graph>;
class GE_FUNC_DEV_VISIBILITY GE_FUNC_HOST_VISIBILITY Graph {
friend class GraphUtils;
public:
explicit Graph(const std::string &name);
Graph() = default;
~Graph() = default;
Graph &SetInputs(const std::vector<Operator> &inputs);
Graph &SetOutputs(const std::vector<Operator> &outputs);
Graph &SetOutputs(const std::vector<std::pair<Operator, std::vector<size_t>>> &output_indexs);
Graph &SetOutputs(const std::vector<std::pair<ge::Operator, std::string>> &outputs);
Graph &SetTargets(const std::vector<Operator> &targets);
bool IsValid() const;
graphStatus AddOp(const ge::Operator &op);
graphStatus FindOpByName(const std::string &name, ge::Operator &op) const;
graphStatus FindOpByType(const std::string &type, std::vector<ge::Operator> &ops) const;
graphStatus GetAllOpName(std::vector<std::string> &op_name) const;
graphStatus SaveToFile(const std::string &file_name) const;
graphStatus LoadFromFile(const std::string &file_name);
const std::string &GetName() const;
///
/// Set is need train iteration.
/// If set true, it means this graph need to be run iteration some
/// times(according variant "npu_runconfig/iterations_per_loop").
/// @param need_iteration need_iteration:whether to set iteration or not
///
void SetNeedIteration(bool need_iteration);
std::vector<GNode> GetAllNodes() const;
std::vector<GNode> GetDirectNode() const;
graphStatus RemoveNode(GNode &node);
graphStatus RemoveEdge(GNode &src_node, const int32_t src_port_index, GNode &dst_node, const int32_t dst_port_index);
GNode AddNodeByOp(const Operator &op);
graphStatus AddDataEdge(GNode &src_node, const int32_t src_port_index, GNode &dst_node, const int32_t dst_port_index);
graphStatus AddControlEdge(GNode &src_node, GNode &dst_node);
static GraphPtr ConstructFromInputs(const std::vector<Operator> &inputs, const ge::AscendString &name);
private:
GraphImplPtr impl_{nullptr};
};
} // namespace ge
#endif // INC_EXTERNAL_GRAPH_GRAPH_H_