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.
214 lines
6.4 KiB
214 lines
6.4 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_NODE_H_
|
|
#define INC_GRAPH_NODE_H_
|
|
|
|
#include <map>
|
|
#include <memory>
|
|
#include <string>
|
|
#include <utility>
|
|
#include <vector>
|
|
#include <unordered_set>
|
|
#include "graph/ge_attr_value.h"
|
|
#include "utils/attr_utils.h"
|
|
|
|
#include "graph/op_desc.h"
|
|
#include "graph/range_vistor.h"
|
|
|
|
namespace ge {
|
|
class ComputeGraph;
|
|
|
|
using ComputeGraphPtr = std::shared_ptr<ComputeGraph>;
|
|
|
|
class Node;
|
|
|
|
using NodePtr = std::shared_ptr<Node>;
|
|
using ConstNodePtr = std::shared_ptr<const Node>;
|
|
using NodeRef = std::weak_ptr<Node>;
|
|
|
|
class Anchor;
|
|
|
|
using AnchorPtr = std::shared_ptr<Anchor>;
|
|
|
|
class InDataAnchor;
|
|
|
|
using InDataAnchorPtr = std::shared_ptr<InDataAnchor>;
|
|
|
|
class OutDataAnchor;
|
|
|
|
using OutDataAnchorPtr = std::shared_ptr<OutDataAnchor>;
|
|
|
|
class ControlAnchor;
|
|
|
|
using ControlAnchorPtr = std::shared_ptr<ControlAnchor>;
|
|
|
|
class InControlAnchor;
|
|
|
|
using InControlAnchorPtr = std::shared_ptr<InControlAnchor>;
|
|
|
|
class OutControlAnchor;
|
|
|
|
using OutControlAnchorPtr = std::shared_ptr<OutControlAnchor>;
|
|
|
|
using OpDescPtr = std::shared_ptr<OpDesc>;
|
|
|
|
using ConstNode = const Node;
|
|
|
|
typedef std::vector<std::multimap<std::string, ge::AnchorPtr>> kFusionDataFlowVec_t;
|
|
|
|
// Node is a component of ComputeGraph
|
|
class Node : public std::enable_shared_from_this<Node> {
|
|
friend class ComputeGraph;
|
|
friend class ModelSerializeImp;
|
|
|
|
public:
|
|
template <class T>
|
|
using Vistor = RangeVistor<T, std::shared_ptr<ConstNode>>;
|
|
~Node();
|
|
Node(const Node &) = delete;
|
|
Node &operator=(const Node &) = delete;
|
|
bool operator==(const Node &r_node) const;
|
|
|
|
protected:
|
|
Node() = default;
|
|
Node(const OpDescPtr &op, const ComputeGraphPtr &ownerGraph);
|
|
|
|
public:
|
|
graphStatus Init();
|
|
|
|
std::string GetName() const;
|
|
std::string GetType() const;
|
|
|
|
ComputeGraphPtr GetOwnerComputeGraph() const;
|
|
graphStatus SetOwnerComputeGraph(const ComputeGraphPtr &graph);
|
|
|
|
Vistor<InDataAnchorPtr> GetAllInDataAnchors() const;
|
|
Vistor<OutDataAnchorPtr> GetAllOutDataAnchors() const;
|
|
uint32_t GetAllInDataAnchorsSize() const;
|
|
uint32_t GetAllOutDataAnchorsSize() const;
|
|
Vistor<AnchorPtr> GetAllOutAnchors() const;
|
|
Vistor<AnchorPtr> GetAllInAnchors() const;
|
|
InDataAnchorPtr GetInDataAnchor(int idx) const;
|
|
OutDataAnchorPtr GetOutDataAnchor(int idx) const;
|
|
InControlAnchorPtr GetInControlAnchor() const;
|
|
OutControlAnchorPtr GetOutControlAnchor() const;
|
|
Vistor<NodePtr> GetInNodes() const;
|
|
Vistor<NodePtr> GetOutNodes() const;
|
|
AnchorPtr GetInAnchor(int idx) const;
|
|
AnchorPtr GetOutAnchor(int idx) const;
|
|
|
|
bool IsAllInNodesSeen(std::unordered_set<Node *> &nodes_seen) const;
|
|
|
|
// All in Data nodes
|
|
Vistor<NodePtr> GetInDataNodes() const;
|
|
// All in Control nodes
|
|
Vistor<NodePtr> GetInControlNodes() const;
|
|
// GetInAllNodes = InDataNodes + InControlNodes
|
|
Vistor<NodePtr> GetInAllNodes() const;
|
|
|
|
// All out Data nodes
|
|
Vistor<NodePtr> GetOutDataNodes() const;
|
|
uint32_t GetOutDataNodesSize() const;
|
|
// All out Control nodes
|
|
Vistor<NodePtr> GetOutControlNodes() const;
|
|
// GetOutAllNodes = OutDataNodes + InControlNodes
|
|
Vistor<NodePtr> GetOutAllNodes() const;
|
|
|
|
// Get all in data nodes and its out-anchor
|
|
Vistor<std::pair<NodePtr, OutDataAnchorPtr>> GetInDataNodesAndAnchors() const;
|
|
|
|
// Get all out data nodes and its in-anchor
|
|
Vistor<std::pair<NodePtr, InDataAnchorPtr>> GetOutDataNodesAndAnchors() const;
|
|
|
|
graphStatus InferShapeAndType() const;
|
|
graphStatus Verify() const;
|
|
|
|
graphStatus InferOriginFormat() const;
|
|
|
|
OpDescPtr GetOpDesc() const;
|
|
|
|
graphStatus UpdateOpDesc(const OpDescPtr &op);
|
|
|
|
graphStatus AddLinkFrom(const NodePtr &input_node);
|
|
|
|
graphStatus AddLinkFrom(const uint32_t &index, NodePtr input_node);
|
|
|
|
graphStatus AddLinkFrom(const string &name, NodePtr input_node);
|
|
|
|
graphStatus AddLinkFromForParse(const NodePtr &input_node);
|
|
|
|
void AddSendEventId(uint32_t event_id) { send_event_id_list_.push_back(event_id); }
|
|
|
|
void AddRecvEventId(uint32_t event_id) { recv_event_id_list_.push_back(event_id); }
|
|
|
|
const std::vector<uint32_t> &GetSendEventIdList() const { return send_event_id_list_; }
|
|
|
|
const std::vector<uint32_t> &GetRecvEventIdList() const { return recv_event_id_list_; }
|
|
void GetFusionInputFlowList(kFusionDataFlowVec_t &fusion_input_list) {
|
|
fusion_input_list = fusion_input_dataflow_list_;
|
|
}
|
|
|
|
void GetFusionOutputFlowList(kFusionDataFlowVec_t &fusion_output_list) {
|
|
fusion_output_list = fusion_output_dataflow_list_;
|
|
}
|
|
|
|
void SetFusionInputFlowList(kFusionDataFlowVec_t &fusion_input_list) {
|
|
fusion_input_dataflow_list_ = fusion_input_list;
|
|
}
|
|
|
|
void SetFusionOutputFlowList(kFusionDataFlowVec_t &fusion_output_list) {
|
|
fusion_output_dataflow_list_ = fusion_output_list;
|
|
}
|
|
|
|
bool GetHostNode() const { return host_node_; }
|
|
void SetHostNode(bool is_host) { host_node_ = is_host; }
|
|
|
|
void SetOrigNode(const NodePtr &orignode) { orig_node_ = orignode; }
|
|
|
|
NodePtr GetOrigNode() { return orig_node_; }
|
|
|
|
private:
|
|
bool NodeMembersAreEqual(const Node &r_node) const;
|
|
bool NodeAttrsAreEqual(const Node &r_node) const;
|
|
bool NodeInConnectsAreEqual(const Node &r_node) const;
|
|
bool NodeOutConnectsAreEqual(const Node &r_node) const;
|
|
bool NodeAnchorIsEqual(const AnchorPtr &l_anchor, const AnchorPtr &r_anchor, size_t i) const;
|
|
OpDescPtr op_;
|
|
std::weak_ptr<ComputeGraph> owner_graph_;
|
|
vector<InDataAnchorPtr> in_data_anchors_;
|
|
vector<OutDataAnchorPtr> out_data_anchors_;
|
|
InControlAnchorPtr in_control_anchor_;
|
|
OutControlAnchorPtr out_control_anchor_;
|
|
map<string, GeAttrValue> attrs_;
|
|
bool has_init_{false};
|
|
bool host_node_{false};
|
|
bool anchor_status_updated_{false};
|
|
std::vector<uint32_t> send_event_id_list_;
|
|
std::vector<uint32_t> recv_event_id_list_;
|
|
|
|
kFusionDataFlowVec_t fusion_input_dataflow_list_;
|
|
kFusionDataFlowVec_t fusion_output_dataflow_list_;
|
|
|
|
NodePtr orig_node_;
|
|
friend class NodeUtils;
|
|
friend class OnnxUtils;
|
|
friend class TuningUtils;
|
|
};
|
|
} // namespace ge
|
|
|
|
#endif // INC_GRAPH_NODE_H_
|