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

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