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.

merge_to_stream_merge_pass.cc 8.3 kB

4 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193
  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. #include "graph/passes/merge_to_stream_merge_pass.h"
  17. #include "common/ge/ge_util.h"
  18. #include "ge/ge_api_types.h"
  19. #include "graph/common/omg_util.h"
  20. namespace ge {
  21. Status MergeToStreamMergePass::Run(ComputeGraphPtr graph) {
  22. GELOGD("MergeToStreamMergePass Enter");
  23. bypass_nodes_.clear();
  24. for (const auto &node : graph->GetDirectNode()) {
  25. std::string type;
  26. GE_CHK_STATUS_RET(GetOriginalType(node, type), "Get node type failed.");
  27. if ((type != MERGE) && (type != REFMERGE)) {
  28. continue;
  29. }
  30. OpDescPtr merge_op_desc = node->GetOpDesc();
  31. GE_CHECK_NOTNULL(merge_op_desc);
  32. if (merge_op_desc->HasAttr(ATTR_INSERT_BY_MBATCH)) {
  33. GE_CHK_STATUS_RET(AddActiveNodes(graph, node), "Merge add active node failed.");
  34. GE_CHK_STATUS_RET(SetStreamLabel(node, node->GetName()), "Set stream label failed");
  35. } else {
  36. GE_CHK_STATUS_RET(ReplaceMergeNode(graph, node), "Add StreamMerge node failed.");
  37. }
  38. }
  39. for (const auto &node : bypass_nodes_) {
  40. GE_CHK_BOOL_EXEC(GraphUtils::RemoveNodeWithoutRelink(graph, node) == GRAPH_SUCCESS, return FAILED,
  41. "Remove merge node failed.");
  42. }
  43. GELOGD("MergeToStreamMergePass Leave");
  44. return SUCCESS;
  45. }
  46. ///
  47. /// @brief Replace Merge Op
  48. /// @param [in] graph
  49. /// @param [in] merge_node
  50. /// @return Status
  51. ///
  52. Status MergeToStreamMergePass::ReplaceMergeNode(const ComputeGraphPtr &graph, const NodePtr &merge_node) {
  53. OpDescPtr merge_op_desc = merge_node->GetOpDesc();
  54. GE_CHECK_NOTNULL(merge_op_desc);
  55. const std::string &node_name = merge_node->GetName();
  56. GELOGI("Create StreamMerge Op, name=%s.", node_name.c_str());
  57. OpDescPtr op_desc = MakeShared<OpDesc>(node_name, STREAMMERGE);
  58. if (op_desc == nullptr) {
  59. GELOGE(FAILED, "Create op_desc failed, StreamMerge:%s.", node_name.c_str());
  60. return FAILED;
  61. }
  62. for (const InDataAnchorPtr &in_anchor : merge_node->GetAllInDataAnchors()) {
  63. GE_CHK_BOOL_EXEC(op_desc->AddInputDesc(merge_op_desc->GetInputDesc(in_anchor->GetIdx())) == GRAPH_SUCCESS,
  64. return FAILED, "Create StreamMerge op: add input desc failed.");
  65. }
  66. for (const OutDataAnchorPtr &out_anchor : merge_node->GetAllOutDataAnchors()) {
  67. GE_CHK_BOOL_EXEC(op_desc->AddOutputDesc(merge_op_desc->GetOutputDesc(out_anchor->GetIdx())) == GRAPH_SUCCESS,
  68. return FAILED, "Create StreamMerge op: add output desc failed.");
  69. }
  70. NodePtr stream_merge = graph->AddNode(op_desc);
  71. GE_CHK_BOOL_EXEC(stream_merge != nullptr, return FAILED, "Insert StreamMerge node failed.");
  72. GE_CHK_STATUS_RET(MoveEdges(merge_node, stream_merge), "Move edges failed.");
  73. bypass_nodes_.insert(merge_node);
  74. if (merge_op_desc->HasAttr(ATTR_NAME_NEXT_ITERATION)) {
  75. std::string next_iteration_name;
  76. GE_IF_BOOL_EXEC(!AttrUtils::GetStr(merge_op_desc, ATTR_NAME_NEXT_ITERATION, next_iteration_name),
  77. GELOGE(INTERNAL_ERROR, "Get ATTR_NAME_NEXT_ITERATION failed");
  78. return INTERNAL_ERROR);
  79. GE_CHK_STATUS_RET(SetNextIteration(stream_merge, next_iteration_name), "Set next iteration failed");
  80. }
  81. return AddActiveNodes(graph, stream_merge);
  82. }
  83. ///
  84. /// @brief Add StreamActive Op before StreamMerge/Merge
  85. /// @param [in] graph
  86. /// @param [in] node
  87. /// @return Status
  88. ///
  89. Status MergeToStreamMergePass::AddActiveNodes(const ComputeGraphPtr &graph, const NodePtr &node) {
  90. GE_CHK_BOOL_EXEC(node != nullptr, return FAILED, "Param of pre node is null.");
  91. for (const InDataAnchorPtr &in_data_anchor : node->GetAllInDataAnchors()) {
  92. OutDataAnchorPtr peer_out_anchor = in_data_anchor->GetPeerOutAnchor();
  93. GE_IF_BOOL_EXEC(peer_out_anchor == nullptr, continue);
  94. NodePtr in_node = peer_out_anchor->GetOwnerNode();
  95. const std::string &type = in_node->GetType();
  96. // For WhileLoop, no need to add active nodes here, since which have been added in NextIterationPass.
  97. GE_IF_BOOL_EXEC((type == ENTER) || (type == REFENTER) || (type == NEXTITERATION) || (type == REFNEXTITERATION),
  98. continue);
  99. NodePtr active_node = CreateActiveNode(graph, in_node);
  100. GE_CHK_BOOL_EXEC(active_node != nullptr, return FAILED, "Create StreamActive node failed.");
  101. GE_CHK_STATUS(GraphUtils::AddEdge(active_node->GetOutControlAnchor(), node->GetInControlAnchor()),
  102. "StreamActive add ctrl edge failed.");
  103. if (SetActiveLabelList(active_node, { node->GetName() }) != SUCCESS) {
  104. GELOGE(FAILED, "SetActiveLabelList for node %s failed.", active_node->GetName().c_str());
  105. return FAILED;
  106. }
  107. }
  108. return SUCCESS;
  109. }
  110. ///
  111. /// @brief Create Active Op
  112. /// @param [in] graph
  113. /// @param [in] node
  114. /// @return ge::NodePtr
  115. ///
  116. NodePtr MergeToStreamMergePass::CreateActiveNode(const ComputeGraphPtr &graph, const NodePtr &node) {
  117. const std::string &node_name = node->GetName() + "_" + STREAMACTIVE;
  118. GELOGI("Create StreamActive op:%s.", node_name.c_str());
  119. OpDescPtr op_desc = MakeShared<OpDesc>(node_name, STREAMACTIVE);
  120. if (op_desc == nullptr) {
  121. GELOGE(FAILED, "Create op_desc failed, StreamActive:%s.", node_name.c_str());
  122. return nullptr;
  123. }
  124. NodePtr active_node = graph->AddNode(op_desc);
  125. GE_CHK_BOOL_EXEC(active_node != nullptr, return nullptr, "Create StreamActive node failed.");
  126. GE_IF_BOOL_EXEC(GraphUtils::AddEdge(node->GetOutControlAnchor(), active_node->GetInControlAnchor()) != SUCCESS,
  127. GELOGE(INTERNAL_ERROR, "add edge failed");
  128. return nullptr);
  129. GE_IF_BOOL_EXEC(SetSwitchBranchNodeLabel(active_node, node_name) != SUCCESS,
  130. GELOGE(INTERNAL_ERROR, "set switch branch node label failed");
  131. return nullptr);
  132. return active_node;
  133. }
  134. ///
  135. /// @brief move edges from old_node to new_node
  136. /// @param [in] old_node
  137. /// @param [in] new_node
  138. /// @return Status
  139. ///
  140. Status MergeToStreamMergePass::MoveEdges(const NodePtr &old_node, const NodePtr &new_node) {
  141. for (const InDataAnchorPtr &in_data_anchor : old_node->GetAllInDataAnchors()) {
  142. OutDataAnchorPtr peer_out_anchor = in_data_anchor->GetPeerOutAnchor();
  143. GE_IF_BOOL_EXEC(peer_out_anchor == nullptr, continue);
  144. GE_CHK_STATUS(GraphUtils::RemoveEdge(peer_out_anchor, in_data_anchor), "Merge remove in data edge failed.");
  145. GE_CHK_STATUS(GraphUtils::AddEdge(peer_out_anchor, new_node->GetInDataAnchor(in_data_anchor->GetIdx())),
  146. "StreamMerge add in data edge failed.");
  147. }
  148. for (const OutDataAnchorPtr &out_data_anchor : old_node->GetAllOutDataAnchors()) {
  149. for (const InDataAnchorPtr &peer_in_anchor : out_data_anchor->GetPeerInDataAnchors()) {
  150. GE_CHK_STATUS(GraphUtils::RemoveEdge(out_data_anchor, peer_in_anchor), "Merge remove out data edge failed.");
  151. GE_CHK_STATUS(GraphUtils::AddEdge(new_node->GetOutDataAnchor(out_data_anchor->GetIdx()), peer_in_anchor),
  152. "StreamMerge add out data edge failed.");
  153. }
  154. }
  155. for (const NodePtr &in_ctrl_node : old_node->GetInControlNodes()) {
  156. GE_CHK_STATUS(GraphUtils::RemoveEdge(in_ctrl_node->GetOutControlAnchor(), old_node->GetInControlAnchor()),
  157. "Merge remove in ctrl edge failed.");
  158. GE_CHK_STATUS(GraphUtils::AddEdge(in_ctrl_node->GetOutControlAnchor(), new_node->GetInControlAnchor()),
  159. "StreamMerge add in ctrl edge failed.");
  160. }
  161. for (const NodePtr &out_ctrl_node : old_node->GetOutControlNodes()) {
  162. GE_CHK_STATUS(GraphUtils::RemoveEdge(old_node->GetOutControlAnchor(), out_ctrl_node->GetInControlAnchor()),
  163. "Merge remove out ctrl edge failed.");
  164. GE_CHK_STATUS(GraphUtils::AddEdge(new_node->GetOutControlAnchor(), out_ctrl_node->GetInControlAnchor()),
  165. "StreamMerge add out ctrl edge failed.");
  166. }
  167. return SUCCESS;
  168. }
  169. } // namespace ge

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