You can not select more than 25 topics Topics must start with a chinese character,a letter or number, can include dashes ('-') and can be up to 35 characters long.

same_transdata_breadth_fusion_pass.h 5.5 kB

5 years ago
5 years ago
4 years ago
5 years ago
5 years ago
4 years ago
5 years ago
4 years ago
4 years ago
5 years ago
4 years ago
5 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122
  1. /**
  2. * Copyright 2020 Huawei Technologies Co., Ltd
  3. *
  4. * Licensed under the Apache License, Version 2.0 (the "License");
  5. * you may not use this file except in compliance with the License.
  6. * You may obtain a copy of the License at
  7. *
  8. * http://www.apache.org/licenses/LICENSE-2.0
  9. *
  10. * Unless required by applicable law or agreed to in writing, software
  11. * distributed under the License is distributed on an "AS IS" BASIS,
  12. * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  13. * See the License for the specific language governing permissions and
  14. * limitations under the License.
  15. */
  16. #ifndef GE_GRAPH_PASSES_SAME_TRANSDATA_BREADTH_FUSION_PASS_H_
  17. #define GE_GRAPH_PASSES_SAME_TRANSDATA_BREADTH_FUSION_PASS_H_
  18. #include <utility>
  19. #include <vector>
  20. #include "inc/graph_pass.h"
  21. namespace ge {
  22. ///
  23. /// Transform operators depth fusion
  24. ///
  25. class SameTransdataBreadthFusionPass : public GraphPass {
  26. public:
  27. SameTransdataBreadthFusionPass() {}
  28. virtual ~SameTransdataBreadthFusionPass() {}
  29. graphStatus Run(ComputeGraphPtr graph) override;
  30. private:
  31. graphStatus ExtractTransNode(const ComputeGraphPtr &graph);
  32. graphStatus GetSubGraphsBetweenNormalAndTransdataNode(OutDataAnchorPtr &out_anchor,
  33. std::vector<std::vector<std::pair<OutDataAnchorPtr, InDataAnchorPtr>>> &sub_graphs_out,
  34. std::vector<std::pair<OutDataAnchorPtr, InDataAnchorPtr>> &nodes_list);
  35. void GetSubGraphNodesInfo();
  36. void EraseInvalidAnchorsPair();
  37. std::set<std::string> GetInControlIdentityNodes(const NodePtr &node, int subgraph_index);
  38. OpDescPtr GetCastOp(const GeTensorDesc &in_desc, const GeTensorDesc &out_desc);
  39. graphStatus AddCastNode(const ComputeGraphPtr &graph,
  40. int anchors_index,
  41. OutDataAnchorPtr &pre_out_anchor,
  42. NodePtr &first_link_node);
  43. void GetSameTransdataNode(vector<int> &same_transdata_nodes);
  44. graphStatus ReLinkTransdataOutput2PreNode(const NodePtr &transdata_node, const OutDataAnchorPtr &pre_out_anchor,
  45. const NodePtr &relink_node);
  46. graphStatus RelinkTransdataControlEdge(ComputeGraphPtr graph,
  47. NodePtr transdata_node_remove,
  48. NodePtr transdata_node_keep);
  49. graphStatus LinkNewCastNode2RemainTransdata(const ComputeGraphPtr &graph,
  50. const vector<int> &same_transdata_nodes,
  51. const OutDataAnchorPtr &transdata_out_anchor,
  52. const NodePtr &transdata_node_keep);
  53. void UpdateTransdataDesc(const InDataAnchorPtr &transdata_in_anchor, const OpDescPtr &transdata_op_desc,
  54. const ConstGeTensorDescPtr &head_output_desc);
  55. graphStatus RelinkRemainTransdata(const ComputeGraphPtr &graph, const vector<int> &same_transdata_nodes);
  56. graphStatus ReLinkTransdataControlOutput2PreNode(const NodePtr &transdata_node_keep,
  57. const OutDataAnchorPtr &pre_out_anchor,
  58. const OutControlAnchorPtr &transdata_peer_out_control_anchor);
  59. graphStatus ReuseNodesBeforeTransdata(int anchors_index, const OutDataAnchorPtr &transdata_out_anchor,
  60. NodePtr &relink_node);
  61. bool AllNodeBeforeTransdataHasOneDataOut(int anchors_index);
  62. graphStatus RelinkInControlEdge(const NodePtr &node_src, const NodePtr &node_dst);
  63. graphStatus ReLinkDataOutput2PreNode(const NodePtr &transdata_node,
  64. const OutDataAnchorPtr &pre_out_anchor,
  65. const NodePtr &relink_node);
  66. graphStatus ReLinkOutDataPeerInControlNodes2PreNode(const NodePtr &transdata_node,
  67. const OutDataAnchorPtr &pre_out_anchor);
  68. void InsertSameTransdataNodeIndex(int anchors_index, vector<int> &same_transdata_nodes);
  69. graphStatus ReLinkOutControlPeerInControlAnchors(const NodePtr &transdata_node_keep,
  70. const OutDataAnchorPtr &pre_out_anchor,
  71. const OutControlAnchorPtr &transdata_peer_out_control_anchor);
  72. graphStatus ReLinkOutControlPeerInDataAnchors(const NodePtr &transdata_node_keep,
  73. const OutDataAnchorPtr &pre_out_anchor,
  74. const OutControlAnchorPtr &transdata_peer_out_control_anchor);
  75. void CopyTensorDesc(const ConstGeTensorDescPtr &src_desc, GeTensorDesc &dst_desc);
  76. ///
  77. /// judge whether an operator is a transform op or not
  78. /// @param node
  79. /// @return True or False
  80. ///
  81. static bool IsTransOp(const NodePtr &node);
  82. static bool IsHandleOp(const NodePtr &node);
  83. vector<vector<pair<OutDataAnchorPtr, InDataAnchorPtr>>> sub_graph_anchors_;
  84. vector<vector<NodePtr>> before_transdata_nodes_;
  85. vector<pair<int, InDataAnchorPtr>> all_transdata_nodes_;
  86. vector<vector<NodePtr>> sub_graph_nodes_;
  87. vector<int> transop_num_count_;
  88. vector<bool> sub_graph_has_reshape_node_;
  89. vector<vector<OutControlAnchorPtr>> peer_out_control_anchors_;
  90. vector<vector<InControlAnchorPtr>> peer_in_control_anchors_;
  91. vector<bool> sub_graph_has_control_edge_;
  92. };
  93. } // namespace ge
  94. #endif // GE_GRAPH_PASSES_SAME_TRANSDATA_BREADTH_FUSION_PASS_H_

图引擎模块(GE)是MindSpore的一个子模块,其代码由C++实现,位于前端模块ME和底层硬件之间,起到承接作用。图引擎模块以ME下发的图作为输入,然后进行一系列的深度图优化操作,最后输出一张可以在底层硬件上高效运行的图。GE针对昇腾AI处理器的硬件结构特点,做了特定的优化工作,以此来充分发挥出昇腾AI处理器的强大算力。在进行模型训练/推理时,GE会被自动调用而用户并不感知。GE主要由GE API和GE Core两部分组成,详细的架构图如下所示