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/graph/detail/model_serialize_imp.h

94 lines
3.2 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_GRAPH_DETAIL_MODEL_SERIALIZE_IMP_H_
#define INC_GRAPH_DETAIL_MODEL_SERIALIZE_IMP_H_
#include <map>
#include <memory>
#include <string>
#include <vector>
#include "graph/anchor.h"
#include "graph/detail/attributes_holder.h"
#include "graph/ge_tensor.h"
#include "graph/graph.h"
#include "graph/node.h"
namespace ge {
using ComputeGraphPtr = std::shared_ptr<ComputeGraph>;
struct NodeNameGraphReq {
string node_name;
int32_t index;
ComputeGraphPtr graph;
};
struct NodeNameNodeReq {
string src_node_name;
int32_t src_out_index;
NodePtr dst_node;
int32_t dst_in_index;
string dst_node_name;
};
class ModelSerializeImp {
public:
bool SerializeModel(const Model &model, proto::ModelDef *modeProto, bool is_dump = false);
bool SerializeGraph(const ConstComputeGraphPtr &graph, proto::GraphDef *graphProto, bool is_dump = false);
bool SerializeEdge(const NodePtr &node, proto::OpDef *opDefProto);
bool SerializeOpDesc(const ConstOpDescPtr &node, proto::OpDef *opDefProto, bool is_dump = false);
bool SerializeNode(const NodePtr &node, proto::OpDef *opDefProto, bool is_dump = false);
bool SerializeTensor(const ConstGeTensorPtr &tensor, proto::TensorDef *tensorProto);
bool UnserializeModel(Model &model, proto::ModelDef &modeProto);
bool UnserializeGraphWithoutEdge(ComputeGraphPtr &graph, proto::GraphDef &graphProto);
bool UnserializeGraph(ComputeGraphPtr &graph, proto::GraphDef &graphProto);
bool HandleNodeNameRef();
bool UnserializeOpDesc(OpDescPtr &opDesc, proto::OpDef &opDefProto);
void AttrDefToOpDesc(OpDescPtr &op_desc, std::vector<string> &key_in, std::vector<string> &key_out,
std::vector<uint32_t> &value_in, std::vector<uint32_t> &value_out, std::vector<string> &opt);
void OpDescToAttrDef(const ConstOpDescPtr &op_desc, proto::OpDef *op_def_proto);
bool UnserializeNode(ComputeGraphPtr &graph, proto::OpDef &opDefProto);
bool UnserializeTensor(GeTensorPtr &tensor, proto::TensorDef &tensorProto);
bool ParseNodeIndex(const string &node_index, string &nodeName, int32_t &index);
void SetProtobufOwner(const ProtoMsgOwner &bufferProtobufOnwer) { protobuf_owner_ = bufferProtobufOnwer; }
private:
bool RebuildOwnership(ComputeGraphPtr &compute_graph, std::map<std::string, ComputeGraphPtr> &subgraphs);
std::vector<NodeNameGraphReq> graph_input_node_names_;
std::vector<NodeNameGraphReq> graph_output_node_names_;
std::vector<NodeNameNodeReq> node_input_node_names_;
std::map<string, NodePtr> node_map_;
ProtoMsgOwner protobuf_owner_;
};
} // namespace ge
#endif // INC_GRAPH_DETAIL_MODEL_SERIALIZE_IMP_H_