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.

dimension_adjust_pass.cc 6.9 kB

5 years ago
5 years ago
5 years ago
4 years ago
5 years ago
4 years ago
5 years ago
4 years ago
5 years ago
5 years ago
5 years ago
5 years ago
4 years ago
5 years ago
5 years ago
5 years ago
4 years ago
5 years ago
5 years ago
4 years ago
4 years ago
5 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
5 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176
  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/dimension_adjust_pass.h"
  17. #include <memory>
  18. #include <string>
  19. #include <vector>
  20. #include "graph/utils/node_utils.h"
  21. namespace ge {
  22. namespace {
  23. const int kDataInputIndex = 0;
  24. const int kRemoveInputIndex = 1;
  25. } // namespace
  26. Status DimensionAdjustPass::Run(ge::NodePtr &node) {
  27. if (node == nullptr) {
  28. REPORT_INNER_ERROR("E19999", "Param node is nullptr, check invalid");
  29. GELOGE(PARAM_INVALID, "[Check][Param] node is nullptr.");
  30. return PARAM_INVALID;
  31. }
  32. OpDescPtr op_desc_ptr = node->GetOpDesc();
  33. if (op_desc_ptr == nullptr) {
  34. REPORT_INNER_ERROR("E19999", "Param op_desc of node is nullptr, check invalid");
  35. GELOGE(PARAM_INVALID, "[Get][OpDesc] return nullptr.");
  36. return PARAM_INVALID;
  37. }
  38. string type;
  39. Status ret = GetOriginalType(node, type);
  40. if (ret != SUCCESS) {
  41. REPORT_CALL_ERROR("E19999", "Get OriginalType of op:%s(%s) failed",
  42. node->GetName().c_str(), node->GetType().c_str());
  43. GELOGE(ret, "[Get][OriginalType] of op:%s(%s) failed", node->GetName().c_str(), node->GetType().c_str());
  44. return ret;
  45. }
  46. KernelFactory &factory = KernelFactory::Instance();
  47. shared_ptr<Kernel> op_kernel = factory.Create(type);
  48. if (op_kernel == nullptr) {
  49. return SUCCESS;
  50. }
  51. bool is_unknown = false;
  52. auto ret_status = NodeUtils::GetNodeUnknownShapeStatus(*node, is_unknown);
  53. if (ret_status != GRAPH_SUCCESS) {
  54. GELOGW("Get node unknown status failed, node name:%s, type:%s.", node->GetName().c_str(), node->GetType().c_str());
  55. return INTERNAL_ERROR;
  56. }
  57. if (is_unknown) {
  58. GELOGI("Current node %s, type %s is unknown shape which should be skip.",
  59. node->GetName().c_str(), node->GetType().c_str());
  60. return SUCCESS;
  61. }
  62. // call compute function
  63. ret = op_kernel->Compute(node);
  64. if (ret != SUCCESS) {
  65. if (ret == NOT_CHANGED) {
  66. return SUCCESS;
  67. }
  68. REPORT_CALL_ERROR("E19999", "kernel compute for op:%s(%s) failed",
  69. node->GetName().c_str(), node->GetType().c_str());
  70. GELOGE(ret, "[Call][Compute] for op:%s(%s) failed", node->GetName().c_str(), node->GetType().c_str());
  71. return ret;
  72. }
  73. // Need to handle axis_input of node like ExpandDims
  74. if (node->GetAllInDataAnchors().size() > static_cast<size_t>(kRemoveInputIndex)) {
  75. auto axis_node_out_anchor = node->GetInDataAnchor(kRemoveInputIndex)->GetPeerOutAnchor();
  76. GE_CHECK_NOTNULL(axis_node_out_anchor);
  77. auto axis_node = axis_node_out_anchor->GetOwnerNode();
  78. // 1.Copy control dependency of axis node
  79. ret = PassUtils::UnlinkNodeWithControlCopy(node, kRemoveInputIndex);
  80. if (ret != SUCCESS) {
  81. REPORT_CALL_ERROR("E19999", "Unlink op:%s(%s) data input:%u with control edge copy failed",
  82. node->GetName().c_str(), node->GetType().c_str(), kRemoveInputIndex);
  83. GELOGE(ret, "[Unlink][Op] %s(%s) data input:%u with control edge copy failed",
  84. node->GetName().c_str(), node->GetType().c_str(), kRemoveInputIndex);
  85. return ret;
  86. }
  87. // 2.Remove const axis node without any output
  88. if ((axis_node->GetType() == CONSTANT || axis_node->GetType() == CONSTANTOP) &&
  89. axis_node->GetOutDataNodesSize() == 0) {
  90. ret = IsolateAndDeleteNode(axis_node, {});
  91. GE_CHK_GRAPH_STATUS_RET(ret, "[Remove][Node] %s failed.", axis_node->GetName().c_str());
  92. GELOGI("Remove useless axis input const %s", axis_node->GetName().c_str());
  93. }
  94. }
  95. ret = DealWithInNodes(node);
  96. if (ret != SUCCESS) {
  97. GELOGE(ret, "[DealWith][InNodes] of node:%s failed.", node->GetName().c_str());
  98. return ret;
  99. }
  100. std::vector<int> data_relink_io_map = {kDataInputIndex};
  101. return IsolateAndDeleteNode(node, data_relink_io_map);
  102. }
  103. Status DimensionAdjustPass::DealWithInNodes(NodePtr &node) {
  104. GE_CHECK_NOTNULL(node);
  105. GE_CHECK_NOTNULL(node->GetOpDesc());
  106. auto graph = node->GetOwnerComputeGraph();
  107. auto in_data_anchors = node->GetAllInDataAnchors();
  108. for (auto &in_data_anchor : in_data_anchors) {
  109. if (in_data_anchor == nullptr) {
  110. continue;
  111. }
  112. auto in_node_anchor = in_data_anchor->GetPeerOutAnchor();
  113. if (in_node_anchor == nullptr) {
  114. continue;
  115. }
  116. auto in_node = in_node_anchor->GetOwnerNode();
  117. if (in_node->GetType() == SWITCHN) {
  118. auto identity_name = node->GetName() + "_ctrl_identity_" + std::to_string(in_data_anchor->GetIdx());
  119. auto identity =
  120. AddIdentityNodeToGraph(identity_name, node->GetOpDesc()->GetInputDesc(in_data_anchor->GetIdx()), graph);
  121. GE_CHECK_NOTNULL(identity);
  122. GELOGI("Create new identity node[%s] after node %s[type: %s] success.", identity->GetName().c_str(),
  123. in_node->GetName().c_str(), in_node->GetType().c_str());
  124. GE_CHK_GRAPH_STATUS_RET(GraphUtils::AddEdge(in_node_anchor, identity->GetInDataAnchor(0)))
  125. GE_CHECK_NOTNULL(identity->GetOutControlAnchor());
  126. if (identity->GetOutControlAnchor()->IsLinkedWith(node->GetInControlAnchor())) {
  127. continue;
  128. }
  129. GE_CHK_GRAPH_STATUS_RET(GraphUtils::AddEdge(identity->GetOutControlAnchor(), node->GetInControlAnchor()))
  130. }
  131. }
  132. return SUCCESS;
  133. }
  134. NodePtr DimensionAdjustPass::AddIdentityNodeToGraph(const string &name, const GeTensorDesc &tensor,
  135. ComputeGraphPtr &graph) {
  136. if (graph == nullptr) {
  137. REPORT_INNER_ERROR("E19999", "Param graph is nullptr, check invalid");
  138. GELOGE(INTERNAL_ERROR, "[Check][Param] Comput graph ptr is nullptr in creating identity node.");
  139. return nullptr;
  140. }
  141. OpDescPtr desc = MakeShared<OpDesc>("", "");
  142. if (desc == nullptr) {
  143. REPORT_CALL_ERROR("E19999", "New OpDesc failed");
  144. GELOGE(MEMALLOC_FAILED, "[New][OpDesc] failed.");
  145. return nullptr;
  146. }
  147. desc->SetName(name);
  148. desc->SetType(IDENTITY);
  149. auto ret = desc->AddInputDesc(tensor);
  150. auto ret2 = desc->AddOutputDesc(tensor);
  151. if ((ret != GRAPH_SUCCESS) || (ret2 != GRAPH_SUCCESS)) {
  152. REPORT_CALL_ERROR("E19999", "Add input or ouput desc to op:%s(%s) failed",
  153. desc->GetName().c_str(), desc->GetType().c_str());
  154. GELOGE(INTERNAL_ERROR, "[Add][GeTensorDesc] to op:%s(%s) failed",
  155. desc->GetName().c_str(), desc->GetType().c_str());
  156. return nullptr;
  157. }
  158. return graph->AddNodeFront(desc);
  159. }
  160. } // namespace ge

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