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.

assign_remove_pass.cc 10 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250
  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/assign_remove_pass.h"
  17. #include "framework/common/debug/log.h"
  18. #include "graph/utils/graph_utils.h"
  19. #include "graph/debug/ge_attr_define.h"
  20. namespace {
  21. constexpr uint32_t kValidInputNodeOutputNum = 1;
  22. constexpr int32_t kAssignRefInputIndex = 0;
  23. constexpr int32_t kAssignValueInputIndex = 1;
  24. static const std::set<std::string> kNoTaskNodeTypes = { ge::DATA, ge::ANN_DATA, ge::AIPPDATA,
  25. ge::CONSTANT, ge::CONSTANTOP,
  26. ge::VARIABLE, ge::VARIABLEV2 };
  27. }
  28. namespace ge {
  29. #ifndef ONLY_COMPILE_OPEN_SRC
  30. Status AssignRemovePass::Run(NodePtr &node) {
  31. GELOGD("AssignRemovePass running");
  32. if (TransformAttr(node) != SUCCESS) {
  33. GELOGE(FAILED, "Transform assign_var_name attr failed, node=%s", node->GetName().c_str());
  34. return FAILED;
  35. }
  36. if (node->GetType() == ASSIGN) {
  37. if (OptimizedAssignNode(node) != SUCCESS) {
  38. GELOGE(FAILED, "Optimize for assign_node %s failed", node->GetName().c_str());
  39. return FAILED;
  40. }
  41. }
  42. GELOGD("AssignRemovePass success");
  43. return SUCCESS;
  44. }
  45. ///
  46. /// @brief Optimize for assign_node
  47. /// @param [in] assign_node
  48. /// @return Status
  49. ///
  50. Status AssignRemovePass::OptimizedAssignNode(NodePtr &assign_node) {
  51. const auto &ref_in_anchor = assign_node->GetInDataAnchor(kAssignRefInputIndex);
  52. const auto &value_in_anchor = assign_node->GetInDataAnchor(kAssignValueInputIndex);
  53. if ((ref_in_anchor == nullptr) || (value_in_anchor == nullptr)) {
  54. GELOGE(FAILED, "In data anchor is null, node:%s", assign_node->GetName().c_str());
  55. return FAILED;
  56. }
  57. const auto &ref_peer_anchor = ref_in_anchor->GetPeerOutAnchor();
  58. const auto &value_peer_anchor = value_in_anchor->GetPeerOutAnchor();
  59. if ((ref_peer_anchor == nullptr) || (value_peer_anchor == nullptr)) {
  60. GELOGE(FAILED, "Peer data anchor is null, node:%s", assign_node->GetName().c_str());
  61. return FAILED;
  62. }
  63. if (IsCondMatch(assign_node, ref_peer_anchor, value_peer_anchor)) {
  64. ///
  65. /// variable not-const not-const
  66. /// \ / |
  67. /// \ / |
  68. /// Assign ----> variable
  69. /// | |
  70. /// | |
  71. /// node node
  72. ///
  73. GELOGD("Optimization for assign_node %s start", assign_node->GetName().c_str());
  74. if (IsolateAndDeleteNode(assign_node, {kAssignRefInputIndex}) != SUCCESS) {
  75. GELOGE(FAILED, "Isolate and delete assign_node %s failed.", assign_node->GetName().c_str());
  76. return FAILED;
  77. }
  78. const auto &ref_input = ref_peer_anchor->GetOwnerNode()->GetOpDesc();
  79. const auto &value_input = value_peer_anchor->GetOwnerNode()->GetOpDesc();
  80. if ((ref_input == nullptr) || (value_input == nullptr)) {
  81. GELOGE(FAILED, "value input is null");
  82. return FAILED;
  83. }
  84. // variable has and only has one input
  85. if (ref_input->UpdateInputDesc(0, value_input->GetOutputDesc(value_peer_anchor->GetIdx())) != GRAPH_SUCCESS) {
  86. GELOGE(FAILED, "Update input_desc for variable %s failed.", ref_input->GetName().c_str());
  87. return FAILED;
  88. }
  89. if (GraphUtils::AddEdge(value_peer_anchor, ref_peer_anchor->GetOwnerNode()->GetInDataAnchor(0)) != GRAPH_SUCCESS) {
  90. GELOGE(FAILED, "Add data edge %s->%s failed", value_input->GetName().c_str(), ref_input->GetName().c_str());
  91. return FAILED;
  92. }
  93. GELOGD("add attr ASSIGN_VAR_NAME on node %s, var_name=%s",
  94. value_input->GetName().c_str(), ref_input->GetName().c_str());
  95. if (!AttrUtils::SetStr(value_input->MutableOutputDesc(value_peer_anchor->GetIdx()), ASSIGN_VAR_NAME,
  96. ref_input->GetName())) {
  97. GELOGE(FAILED, "Set attr ASSIGN_VAR_NAME failed.");
  98. return FAILED;
  99. }
  100. auto value_node = value_peer_anchor->GetOwnerNode();
  101. AddRePassNode(value_node);
  102. }
  103. return SUCCESS;
  104. }
  105. ///
  106. /// @brief Transform assign_var_name attr
  107. /// @param [in] node
  108. /// @return Status
  109. ///
  110. Status AssignRemovePass::TransformAttr(NodePtr &node) {
  111. GE_CHECK_NOTNULL(node->GetOpDesc());
  112. for (const auto &output_desc : node->GetOpDesc()->GetAllOutputsDesc()) {
  113. int32_t inplace_input_idx = -1;
  114. std::string assign_var_name;
  115. if (AttrUtils::GetInt(output_desc, INPLACE_SUPPORT_INPUT_INDEX, inplace_input_idx) &&
  116. AttrUtils::GetStr(output_desc, ASSIGN_VAR_NAME, assign_var_name)) {
  117. GELOGD("Transform attr ASSIGN_VAR_NAME on node %s, assign_var_name=%s, inplace_input_idx=%d, ",
  118. node->GetName().c_str(), assign_var_name.c_str(), inplace_input_idx);
  119. const auto &in_data_anchor = node->GetInDataAnchor(inplace_input_idx);
  120. GE_CHECK_NOTNULL(in_data_anchor);
  121. const auto &peer_data_anchor = in_data_anchor->GetPeerOutAnchor();
  122. GE_CHECK_NOTNULL(peer_data_anchor);
  123. auto in_node = peer_data_anchor->GetOwnerNode();
  124. GE_CHECK_NOTNULL(in_node->GetOpDesc());
  125. GELOGD("add attr ASSIGN_VAR_NAME on node %s, var_name=%s", in_node->GetName().c_str(), assign_var_name.c_str());
  126. if (!AttrUtils::SetStr(in_node->GetOpDesc()->MutableOutputDesc(peer_data_anchor->GetIdx()),
  127. ASSIGN_VAR_NAME, assign_var_name)) {
  128. GELOGE(FAILED, "Set attr ASSIGN_VAR_NAME failed.");
  129. return FAILED;
  130. }
  131. AddRePassNode(in_node);
  132. }
  133. }
  134. return SUCCESS;
  135. }
  136. #else
  137. Status AssignRemovePass::Run(NodePtr &node) {
  138. GELOGD("AssignRemovePass running");
  139. if (node->GetType() != ASSIGN) {
  140. GELOGD("No need run AssignRemovePass on [%s, %s].", node->GetName().c_str(), node->GetType().c_str());
  141. return SUCCESS;
  142. }
  143. const auto &ref_in_anchor = node->GetInDataAnchor(kAssignRefInputIndex);
  144. const auto &value_in_anchor = node->GetInDataAnchor(kAssignValueInputIndex);
  145. if ((ref_in_anchor == nullptr) || (value_in_anchor == nullptr)) {
  146. GELOGE(FAILED, "In data anchor is null, node:%s", node->GetName().c_str());
  147. return FAILED;
  148. }
  149. const auto &ref_peer_anchor = ref_in_anchor->GetPeerOutAnchor();
  150. const auto &value_peer_anchor = value_in_anchor->GetPeerOutAnchor();
  151. if ((ref_peer_anchor == nullptr) || (value_peer_anchor == nullptr)) {
  152. GELOGE(FAILED, "Peer data anchor is null, node:%s", node->GetName().c_str());
  153. return FAILED;
  154. }
  155. if (IsCondMatch(node, ref_peer_anchor, value_peer_anchor)) {
  156. ///
  157. /// variable not-const not-const
  158. /// \ / |
  159. /// \ / |
  160. /// Assign ----> variable
  161. /// | |
  162. /// | |
  163. /// node node
  164. ///
  165. GELOGI("Optimization for assign_node %s start", node->GetName().c_str());
  166. if (IsolateAndDeleteNode(node, {kAssignRefInputIndex}) != SUCCESS) {
  167. GELOGE(FAILED, "Isolate and delete assign_node %s failed.", node->GetName().c_str());
  168. return FAILED;
  169. }
  170. AddNodeDeleted(node);
  171. const auto &ref_input = ref_peer_anchor->GetOwnerNode()->GetOpDesc();
  172. const auto &value_input = value_peer_anchor->GetOwnerNode()->GetOpDesc();
  173. if ((ref_input == nullptr) || (value_input == nullptr)) {
  174. GELOGE(FAILED, "value input is null");
  175. return FAILED;
  176. }
  177. if (!AttrUtils::SetStr(value_input->MutableOutputDesc(value_peer_anchor->GetIdx()), ASSIGN_VAR_NAME,
  178. ref_input->GetName())) {
  179. GELOGE(FAILED, "Set attr ASSIGN_VAR_NAME failed.");
  180. return FAILED;
  181. }
  182. // variable has and only has one input
  183. if (ref_input->UpdateInputDesc(0, value_input->GetOutputDesc(value_peer_anchor->GetIdx())) != GRAPH_SUCCESS) {
  184. GELOGE(FAILED, "Update input_desc for variable %s failed.", ref_input->GetName().c_str());
  185. return FAILED;
  186. }
  187. if (GraphUtils::AddEdge(value_peer_anchor, ref_peer_anchor->GetOwnerNode()->GetInDataAnchor(0)) != GRAPH_SUCCESS) {
  188. GELOGE(FAILED, "Add data edge %s->%s failed", value_input->GetName().c_str(), ref_input->GetName().c_str());
  189. return FAILED;
  190. }
  191. }
  192. GELOGD("AssignRemovePass success");
  193. return SUCCESS;
  194. }
  195. #endif
  196. ///
  197. /// @brief Check if need optimize for assign_node
  198. /// @param [in] assign_node
  199. /// @param [in] peer_data_anchor for ref_input of assign_node
  200. /// @param [in] peer_data_anchor for value_input of assign_node
  201. /// @return Status
  202. ///
  203. bool AssignRemovePass::IsCondMatch(const NodePtr &node, const OutDataAnchorPtr &ref_peer_anchor,
  204. const OutDataAnchorPtr &value_peer_anchor) {
  205. GELOGD("Check if assign_node %s match optimization condition, ref_input: %s, value_input: %s",
  206. node->GetName().c_str(), ref_peer_anchor->GetOwnerNode()->GetName().c_str(),
  207. value_peer_anchor->GetOwnerNode()->GetName().c_str());
  208. if (kNoTaskNodeTypes.count(value_peer_anchor->GetOwnerNode()->GetType()) > 0) {
  209. GELOGD("value input is not calculate node");
  210. return false;
  211. }
  212. const std::string &ref_type = ref_peer_anchor->GetOwnerNode()->GetType();
  213. if ((ref_type != VARIABLE) && (ref_type != VARIABLEV2)) {
  214. GELOGD("ref input is not var");
  215. return false;
  216. }
  217. if (!ref_peer_anchor->GetOwnerNode()->GetInDataNodes().empty()) {
  218. GELOGD("ref input has data input");
  219. return false;
  220. }
  221. if ((ref_peer_anchor->GetPeerInDataNodesSize() != kValidInputNodeOutputNum) ||
  222. (value_peer_anchor->GetPeerInDataNodesSize() != kValidInputNodeOutputNum)) {
  223. GELOGD("ref / value input has other output(s)");
  224. return false;
  225. }
  226. GELOGD("Optimization condition matches, assign_node: %s", node->GetName().c_str());
  227. return true;
  228. }
  229. } // namespace ge

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