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.

attach_stream_label_pass.cc 9.1 kB

5 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262
  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/attach_stream_label_pass.h"
  17. #include "ge/ge_api_types.h"
  18. #include "graph/common/omg_util.h"
  19. using std::string;
  20. namespace ge {
  21. Status AttachStreamLabelPass::Run(ComputeGraphPtr graph) {
  22. GELOGD("AttachStreamLabelPass Enter.");
  23. FindNodes(graph);
  24. for (const auto &node : need_label_nodes_) {
  25. OpDescPtr op_desc = node->GetOpDesc();
  26. GE_CHECK_NOTNULL(op_desc);
  27. if (!op_desc->HasAttr(ATTR_NAME_STREAM_LABEL)) {
  28. GE_CHK_STATUS_RET(UpdateCondBranch(node), "Update cond branch failed, start node:%s.", node->GetName().c_str());
  29. }
  30. }
  31. GE_CHK_STATUS_RET(UpdateEnterNode(), "UpdateEnterNode failed.");
  32. GELOGD("AttachStreamLabelPass Leave.");
  33. return SUCCESS;
  34. }
  35. ///
  36. /// @brief Clear Status, used for subgraph pass
  37. /// @return
  38. ///
  39. Status AttachStreamLabelPass::ClearStatus() {
  40. stream_switch_nodes_.clear();
  41. need_label_nodes_.clear();
  42. enter_nodes_.clear();
  43. branch_head_nodes_.clear();
  44. return SUCCESS;
  45. }
  46. ///
  47. /// @brief Find StreamSwitch / StreamMerge / Enter node
  48. /// @param [in] graph
  49. /// @return void
  50. ///
  51. void AttachStreamLabelPass::FindNodes(const ComputeGraphPtr &graph) {
  52. for (const NodePtr &node : graph->GetDirectNode()) {
  53. const std::string &type = node->GetType();
  54. if (type == STREAMSWITCH) {
  55. stream_switch_nodes_.emplace_back(node);
  56. } else if (type == STREAMMERGE) {
  57. if ((node->GetOpDesc() != nullptr) && !node->GetOpDesc()->HasAttr(ATTR_NAME_NEXT_ITERATION)) {
  58. need_label_nodes_.emplace_back(node);
  59. }
  60. } else if ((type == ENTER) || (type == REFENTER)) {
  61. enter_nodes_.emplace_back(node);
  62. }
  63. }
  64. for (const auto &node : stream_switch_nodes_) {
  65. for (const auto &out_ctrl_node : node->GetOutControlNodes()) {
  66. GELOGD("branch_head_node %s of stream_switch %s.", out_ctrl_node->GetName().c_str(), node->GetName().c_str());
  67. branch_head_nodes_[out_ctrl_node] = node;
  68. }
  69. need_label_nodes_.emplace_back(node);
  70. }
  71. }
  72. ///
  73. /// @brief update cond branch
  74. /// @param [in] node
  75. /// @return Status
  76. ///
  77. Status AttachStreamLabelPass::UpdateCondBranch(const NodePtr &node) {
  78. std::string stream_label;
  79. std::unordered_set<NodePtr> branch_nodes;
  80. std::unordered_set<NodePtr> visited;
  81. std::stack<NodePtr> nodes;
  82. nodes.push(node);
  83. static const std::set<std::string> end_type_set = {STREAMSWITCH, STREAMMERGE, MERGE};
  84. while (!nodes.empty()) {
  85. NodePtr cur_node = nodes.top();
  86. nodes.pop();
  87. if (visited.count(cur_node) > 0) {
  88. continue;
  89. }
  90. if (AttachFlag(cur_node, stream_label) != SUCCESS) {
  91. GELOGE(FAILED, "Attach flag for node %s failed.", cur_node->GetName().c_str());
  92. return FAILED;
  93. }
  94. const std::string &type = cur_node->GetType();
  95. for (const auto &out_node : cur_node->GetOutAllNodes()) {
  96. const std::string &out_type = out_node->GetType();
  97. bool stop_flag = (end_type_set.count(out_type) > 0) ||
  98. ((branch_head_nodes_.count(out_node) > 0) && (branch_head_nodes_[out_node] != node)) ||
  99. (((type == ENTER) || (type == REFENTER)) && (out_type != STREAMACTIVE));
  100. if (!stop_flag) {
  101. nodes.push(out_node);
  102. GELOGD("Insert branch node %s.", out_node->GetName().c_str());
  103. branch_nodes.insert(out_node);
  104. }
  105. }
  106. visited.insert(cur_node);
  107. }
  108. if (node->GetType() == STREAMSWITCH) {
  109. GE_CHK_STATUS_RET(SetActiveLabelList(node, {stream_label}), "set active_label_list failed.");
  110. }
  111. for (const NodePtr &tmp_node : branch_nodes) {
  112. GELOGD("Attach label %s to node: %s.", stream_label.c_str(), tmp_node->GetName().c_str());
  113. GE_CHK_STATUS_RET(SetStreamLabel(tmp_node, stream_label), "Set stream label failed.");
  114. }
  115. return SUCCESS;
  116. }
  117. ///
  118. /// @brief attach flag
  119. /// @param [in] node
  120. /// @param [out] stream_label
  121. /// @return Status
  122. ///
  123. Status AttachStreamLabelPass::AttachFlag(const NodePtr &node, std::string &stream_label) {
  124. const std::string &type = node->GetType();
  125. if (type == STREAMSWITCH) {
  126. if (node->GetInDataNodes().empty()) {
  127. GELOGE(INTERNAL_ERROR, "node %s has no input_data_node.", node->GetName().c_str());
  128. return INTERNAL_ERROR;
  129. }
  130. stream_label = node->GetInDataNodes().at(0)->GetName();
  131. GE_CHK_STATUS_RET(SetStreamLabel(node, stream_label), "Set stream label failed.");
  132. bool value = false;
  133. OpDescPtr op_desc = node->GetOpDesc();
  134. GE_CHECK_NOTNULL(op_desc);
  135. GE_CHK_BOOL_EXEC(AttrUtils::GetBool(op_desc, ATTR_NAME_SWITCH_TRUE_BRANCH_FLAG, value), return FAILED,
  136. "StreamSwitch get attr TRUE_BRANCH_STREAM failed.");
  137. stream_label += (value ? "_t" : "_f");
  138. } else if (type == STREAMMERGE) {
  139. stream_label = node->GetName();
  140. GE_CHK_STATUS_RET(SetStreamLabel(node, stream_label), "Set stream label failed.");
  141. } else if ((type == EXIT) || (type == REFEXIT)) {
  142. GE_CHK_STATUS_RET(SetStreamLabel(node, stream_label), "Set stream label failed.");
  143. }
  144. return SUCCESS;
  145. }
  146. ///
  147. /// @brief Update stream_label start with enter nodes
  148. /// @return Status
  149. ///
  150. Status AttachStreamLabelPass::UpdateEnterNode() {
  151. std::unordered_map<NodePtr, std::vector<NodePtr>> enter_active_map;
  152. for (const auto &enter_node : enter_nodes_) {
  153. for (const auto &out_ctrl_node : enter_node->GetOutControlNodes()) {
  154. if (out_ctrl_node->GetType() == STREAMACTIVE) {
  155. if (enter_active_map.find(out_ctrl_node) == enter_active_map.end()) {
  156. enter_active_map[out_ctrl_node] = {enter_node};
  157. } else {
  158. enter_active_map[out_ctrl_node].emplace_back(enter_node);
  159. }
  160. }
  161. }
  162. }
  163. for (const auto &pair : enter_active_map) {
  164. if (SetEnterLabel(pair.second, pair.first) != SUCCESS) {
  165. GELOGE(FAILED, "Set stream_label for enter_nodes failed.");
  166. return FAILED;
  167. }
  168. NodePtr active_node = pair.first;
  169. GE_CHECK_NOTNULL(active_node);
  170. std::vector<std::string> active_label_list;
  171. bool get_attr = AttrUtils::GetListStr(active_node->GetOpDesc(), ATTR_NAME_ACTIVE_LABEL_LIST, active_label_list) &&
  172. (active_label_list.size() == 1) && !active_label_list[0].empty();
  173. if (!get_attr) {
  174. GELOGE(INTERNAL_ERROR, "Get attr ATTR_NAME_ACTIVE_LABEL_LIST failed, node: %s.", active_node->GetName().c_str());
  175. return INTERNAL_ERROR;
  176. }
  177. std::stack<NodePtr> enter_nodes;
  178. for (const auto &enter_node : pair.second) {
  179. enter_nodes.emplace(enter_node);
  180. }
  181. if (UpdateLoopBranch(enter_nodes, active_label_list[0]) != SUCCESS) {
  182. GELOGE(FAILED, "Update stream_label for loop_branch failed.");
  183. return FAILED;
  184. }
  185. }
  186. return SUCCESS;
  187. }
  188. ///
  189. /// @brief Set stream_label for enter_nodes
  190. /// @param [in] enter_nodes
  191. /// @param [in] active_node
  192. /// @return Status
  193. ///
  194. Status AttachStreamLabelPass::SetEnterLabel(const std::vector<NodePtr> &enter_nodes, const NodePtr &active_node) {
  195. std::string stream_label;
  196. GE_CHECK_NOTNULL(active_node);
  197. (void)AttrUtils::GetStr(active_node->GetOpDesc(), ATTR_NAME_STREAM_LABEL, stream_label);
  198. if (stream_label.empty()) {
  199. GELOGW("stream_label of enter_active & enter_nodes is empty.");
  200. return SUCCESS;
  201. }
  202. for (const auto &enter_node : enter_nodes) {
  203. GE_CHK_STATUS_RET(SetStreamLabel(enter_node, stream_label), "Set stream label failed.");
  204. }
  205. return SUCCESS;
  206. }
  207. ///
  208. /// @brief Update stream_label for loop_branch
  209. /// @param [in] enter_nodes
  210. /// @param [in] stream_label
  211. /// @param [in] batch_label
  212. /// @return Status
  213. ///
  214. Status AttachStreamLabelPass::UpdateLoopBranch(const std::stack<NodePtr> &enter_nodes, const string &stream_label) {
  215. std::stack<NodePtr> nodes(enter_nodes);
  216. NodePtr cur_node = nullptr;
  217. while (!nodes.empty()) {
  218. cur_node = nodes.top();
  219. nodes.pop();
  220. for (const NodePtr &out_node : cur_node->GetOutAllNodes()) {
  221. OpDescPtr out_desc = out_node->GetOpDesc();
  222. GE_CHECK_NOTNULL(out_desc);
  223. std::string out_type = out_desc->GetType();
  224. bool need_skip =
  225. out_desc->HasAttr(ATTR_NAME_STREAM_LABEL) || (out_type == ENTER) || (out_type == REFENTER) ||
  226. (((cur_node->GetType() == ENTER) || (cur_node->GetType() == REFENTER)) && (out_type == STREAMACTIVE));
  227. if (need_skip) {
  228. continue;
  229. }
  230. GELOGD("Attach label %s to node: %s.", stream_label.c_str(), out_node->GetName().c_str());
  231. GE_CHK_STATUS_RET(SetStreamLabel(out_node, stream_label), "Set stream label failed.");
  232. nodes.push(out_node);
  233. }
  234. }
  235. return SUCCESS;
  236. }
  237. } // namespace ge

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