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.

switch_to_stream_switch_pass.cc 40 kB

4 years ago
5 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
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
5 years ago
4 years ago
4 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
5 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856
  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/switch_to_stream_switch_pass.h"
  17. #include <stack>
  18. #include "common/ge/ge_util.h"
  19. #include "ge/ge_api_types.h"
  20. #include "graph/common/omg_util.h"
  21. #include "graph/ge_context.h"
  22. #include "graph/utils/type_utils.h"
  23. namespace ge {
  24. Status SwitchToStreamSwitchPass::Run(ComputeGraphPtr graph) {
  25. GELOGD("SwitchToStreamSwitchPass Enter");
  26. GE_CHK_STATUS_RET(CheckCycleDependence(graph), "Check cyclic dependence failed.");
  27. for (const auto &switch_node : switch_nodes_) {
  28. GE_CHK_STATUS_RET(ReplaceSwitchNode(graph, switch_node), "Replace Switch by StreamSwitch failed.");
  29. }
  30. GE_CHK_STATUS_RET(CombineSwitchNode(graph), "Combine StreamSwitch nodes failed.");
  31. for (const auto &node : bypass_nodes_) {
  32. GE_CHK_BOOL_EXEC(graph->IsolateNode(node) == GRAPH_SUCCESS,
  33. REPORT_CALL_ERROR("E19999", "Isolate node:%s(%s) in graph:%s failed",
  34. node->GetName().c_str(), node->GetType().c_str(), graph->GetName().c_str());
  35. return FAILED, "Isolate node failed.");
  36. GE_CHK_BOOL_EXEC(GraphUtils::RemoveNodeWithoutRelink(graph, node) == GRAPH_SUCCESS,
  37. REPORT_CALL_ERROR("E19999", "Remove node:%s(%s) without relink in graph:%s failed",
  38. node->GetName().c_str(), node->GetType().c_str(), graph->GetName().c_str());
  39. return FAILED,
  40. "Remove switch node failed.");
  41. }
  42. GELOGD("SwitchToStreamSwitchPass Leave");
  43. return SUCCESS;
  44. }
  45. ///
  46. /// @brief Clear Status
  47. /// @return
  48. ///
  49. Status SwitchToStreamSwitchPass::ClearStatus() {
  50. switch_nodes_.clear();
  51. switch_cyclic_map_.clear();
  52. bypass_nodes_.clear();
  53. stream_switch_nodes_.clear();
  54. cond_node_map_.clear();
  55. switch_node_map_.clear();
  56. node_num_map_.clear();
  57. return SUCCESS;
  58. }
  59. ///
  60. /// @brief Check cyclic dependence
  61. /// @param [in] graph
  62. /// @return Status
  63. ///
  64. Status SwitchToStreamSwitchPass::CheckCycleDependence(const ComputeGraphPtr &graph) {
  65. std::string type;
  66. std::unordered_map<NodePtr, std::vector<NodePtr>> cond_switch_map;
  67. for (const NodePtr &node : graph->GetDirectNode()) {
  68. GE_CHK_STATUS_RET(GetOriginalType(node, type), "Get node type failed.");
  69. if ((type != SWITCH) && (type != REFSWITCH)) {
  70. continue;
  71. }
  72. InDataAnchorPtr in_cond_anchor = node->GetInDataAnchor(SWITCH_PRED_INPUT);
  73. GE_CHECK_NOTNULL(in_cond_anchor);
  74. OutDataAnchorPtr peer_out_anchor = in_cond_anchor->GetPeerOutAnchor();
  75. GE_CHECK_NOTNULL(peer_out_anchor);
  76. if (FindSwitchCondInput(peer_out_anchor) != SUCCESS) {
  77. GELOGE(FAILED, "Find pred_input for switch_node %s failed.", node->GetName().c_str());
  78. return FAILED;
  79. }
  80. NodePtr cond_node = peer_out_anchor->GetOwnerNode();
  81. auto iter = cond_switch_map.find(cond_node);
  82. if (iter == cond_switch_map.end()) {
  83. cond_switch_map[cond_node] = { node };
  84. } else {
  85. iter->second.emplace_back(node);
  86. }
  87. switch_nodes_.emplace_back(node);
  88. }
  89. MarkCycleDependence(cond_switch_map);
  90. return SUCCESS;
  91. }
  92. ///
  93. /// @brief Mark cyclic dependence
  94. /// @param [in] graph
  95. /// @param [in] cond_switch_map
  96. /// @return void
  97. ///
  98. void SwitchToStreamSwitchPass::MarkCycleDependence(
  99. const std::unordered_map<NodePtr, std::vector<NodePtr>> &cond_switch_map) {
  100. std::stack<NodePtr> out_nodes;
  101. NodePtr tmp_node = nullptr;
  102. std::unordered_set<NodePtr> visited;
  103. for (const auto &iter : cond_switch_map) {
  104. std::set<NodePtr> switch_nodes(iter.second.begin(), iter.second.end());
  105. for (const auto &switch_node : switch_nodes) {
  106. GELOGD("MarkCycleDependence: cond_node=%s, switch=%s.", iter.first->GetName().c_str(),
  107. switch_node->GetName().c_str());
  108. for (const auto &node : switch_node->GetOutAllNodes()) {
  109. out_nodes.push(node);
  110. }
  111. }
  112. visited.clear();
  113. while (!out_nodes.empty()) {
  114. tmp_node = out_nodes.top();
  115. out_nodes.pop();
  116. if (visited.count(tmp_node) > 0) {
  117. continue;
  118. }
  119. for (const NodePtr &out_node : tmp_node->GetOutAllNodes()) {
  120. if (switch_nodes.find(out_node) == switch_nodes.end()) {
  121. out_nodes.push(out_node);
  122. continue;
  123. }
  124. GELOGD("MarkCycleDependence: tmp_node=%s, switch_node=%s.",
  125. tmp_node->GetName().c_str(), out_node->GetName().c_str());
  126. GE_IF_BOOL_EXEC(SetCyclicDependenceFlag(out_node) != SUCCESS,
  127. GELOGW("set cyclic dependence attr failed."); return );
  128. auto map_iter = switch_cyclic_map_.find(out_node);
  129. if (map_iter == switch_cyclic_map_.end()) {
  130. switch_cyclic_map_[out_node] = {tmp_node->GetName()};
  131. } else {
  132. map_iter->second.insert(tmp_node->GetName());
  133. }
  134. }
  135. visited.insert(tmp_node);
  136. }
  137. }
  138. return;
  139. }
  140. ///
  141. /// @brief Replace Switch Op
  142. /// @param [in] graph
  143. /// @param [in] switch_node
  144. /// @return Status
  145. ///
  146. Status SwitchToStreamSwitchPass::ReplaceSwitchNode(const ComputeGraphPtr &graph, const NodePtr &switch_node) {
  147. OutDataAnchorPtr peer_data_anchor = nullptr;
  148. OutDataAnchorPtr peer_cond_anchor = nullptr;
  149. GE_CHK_BOOL_EXEC(BypassSwitchNode(switch_node, peer_data_anchor, peer_cond_anchor) == SUCCESS, return FAILED,
  150. "Bypass switch node %s failed.", switch_node->GetName().c_str());
  151. GE_CHECK_NOTNULL(peer_data_anchor);
  152. GE_CHECK_NOTNULL(peer_cond_anchor);
  153. OpDescPtr cond_desc = peer_cond_anchor->GetOwnerNode()->GetOpDesc();
  154. GE_CHECK_NOTNULL(cond_desc);
  155. DataType cond_data_type = cond_desc->GetOutputDesc(peer_cond_anchor->GetIdx()).GetDataType();
  156. GE_CHK_BOOL_EXEC(cond_data_type == DT_BOOL,
  157. REPORT_INNER_ERROR("E19999", "Pred_input of Switch node:%s(%s) only support DT_BOOL data_type, "
  158. "but %s exactly", switch_node->GetName().c_str(), switch_node->GetType().c_str(),
  159. TypeUtils::DataTypeToSerialString(cond_data_type).c_str());
  160. return FAILED,
  161. "pred_input of Switch only support DT_BOOL data_type, but %s exactly.",
  162. TypeUtils::DataTypeToSerialString(cond_data_type).c_str());
  163. OpDescPtr switch_desc = switch_node->GetOpDesc();
  164. GE_CHECK_NOTNULL(switch_desc);
  165. bool cyclic_flag = switch_desc->HasAttr(ATTR_NAME_CYCLIC_DEPENDENCE_FLAG);
  166. std::set<std::string> out_node_list;
  167. for (const auto &out_data_anchor : switch_node->GetAllOutDataAnchors()) {
  168. bool true_branch_flag = (static_cast<uint32_t>(out_data_anchor->GetIdx()) == SWITCH_TRUE_OUTPUT);
  169. NodePtr stream_switch = nullptr;
  170. out_node_list.clear();
  171. for (const auto &peer_in_anchor : out_data_anchor->GetPeerAnchors()) {
  172. GE_IF_BOOL_EXEC(stream_switch == nullptr, {
  173. stream_switch = CreateStreamSwitchNode(graph, switch_node, true_branch_flag ? "_t" : "_f", peer_cond_anchor);
  174. GE_CHK_BOOL_EXEC(stream_switch != nullptr, return FAILED, "Create stream_switch node failed.");
  175. if (SetSwitchTrueBranchFlag(stream_switch, true_branch_flag) != SUCCESS) {
  176. REPORT_CALL_ERROR("E19999", "Set switch true branch flag from node:%s(%s) failed",
  177. stream_switch->GetName().c_str(), stream_switch->GetType().c_str());
  178. GELOGE(FAILED, "SetSwitchTrueBranchFlag for node %s failed.", stream_switch->GetName().c_str());
  179. return FAILED;
  180. }
  181. if (MarkBranches(peer_cond_anchor, stream_switch, true_branch_flag) != SUCCESS) {
  182. GELOGE(FAILED, "Mark branches for stream_switch %s failed.", stream_switch->GetName().c_str());
  183. return FAILED;
  184. }
  185. if (!cyclic_flag) {
  186. GE_CHK_STATUS(GraphUtils::AddEdge(peer_data_anchor->GetOwnerNode()->GetOutControlAnchor(),
  187. stream_switch->GetInControlAnchor()),
  188. "StreamSwitch node add ctl edge failed.");
  189. }
  190. });
  191. GE_CHK_STATUS(GraphUtils::RemoveEdge(out_data_anchor, peer_in_anchor), "Remove Switch data output failed.");
  192. NodePtr out_node = peer_in_anchor->GetOwnerNode();
  193. GE_CHK_STATUS(GraphUtils::AddEdge(peer_data_anchor, peer_in_anchor), "StreamSwitch node add edge failed.");
  194. GE_CHK_STATUS(GraphUtils::AddEdge(stream_switch->GetOutControlAnchor(), out_node->GetInControlAnchor()),
  195. "StreamSwitch node add ctl edge failed.");
  196. out_node_list.insert(out_node->GetName());
  197. }
  198. GE_IF_BOOL_EXEC(stream_switch != nullptr, {
  199. MoveCtrlEdges(switch_node, stream_switch);
  200. switch_node_map_[stream_switch] = out_node_list;
  201. if (SetOriginalNodeName(stream_switch, switch_node->GetName()) != SUCCESS) {
  202. REPORT_CALL_ERROR("E19999", "Set original node name:%s to node:%s(%s) failed", switch_node->GetName().c_str(),
  203. stream_switch->GetName().c_str(), stream_switch->GetType().c_str());
  204. GELOGE(FAILED, "SetOriginalNodeName for node %s failed.", stream_switch->GetName().c_str());
  205. return FAILED;
  206. }
  207. });
  208. }
  209. (void)bypass_nodes_.insert(switch_node);
  210. return SUCCESS;
  211. }
  212. ///
  213. /// @brief Bypass Switch Node
  214. /// @param [in] switch_node
  215. /// @param [out] peer_data_anchor
  216. /// @param [out] peer_cond_anchor
  217. /// @return Status
  218. ///
  219. Status SwitchToStreamSwitchPass::BypassSwitchNode(const NodePtr &switch_node, OutDataAnchorPtr &peer_data_anchor,
  220. OutDataAnchorPtr &peer_cond_anchor) {
  221. for (uint32_t idx = 0; idx < SWITCH_INPUT_NUM; ++idx) {
  222. InDataAnchorPtr in_data_anchor = switch_node->GetInDataAnchor(idx);
  223. GE_CHECK_NOTNULL(in_data_anchor);
  224. OutDataAnchorPtr peer_out_anchor = in_data_anchor->GetPeerOutAnchor();
  225. GE_CHECK_NOTNULL(peer_out_anchor);
  226. // Remove Switch data input.
  227. if (GraphUtils::RemoveEdge(peer_out_anchor, in_data_anchor) != GRAPH_SUCCESS) {
  228. REPORT_CALL_ERROR("E19999", "Remove edge between op:%s(%s)(index:%d) and op:%s(%s)(index:%u) failed",
  229. peer_out_anchor->GetOwnerNode()->GetName().c_str(),
  230. peer_out_anchor->GetOwnerNode()->GetType().c_str(), peer_out_anchor->GetIdx(),
  231. switch_node->GetName().c_str(), switch_node->GetType().c_str(), idx);
  232. GELOGE(FAILED, "Remove data edge %s->%s failed.", peer_out_anchor->GetOwnerNode()->GetName().c_str(),
  233. switch_node->GetName().c_str());
  234. return FAILED;
  235. }
  236. if (idx == SWITCH_DATA_INPUT) {
  237. peer_data_anchor = peer_out_anchor;
  238. } else {
  239. peer_cond_anchor = peer_out_anchor;
  240. }
  241. }
  242. return SUCCESS;
  243. }
  244. ///
  245. /// @brief Find Switch cond input
  246. /// @param [out] peer_cond_anchor
  247. /// @return Status
  248. ///
  249. Status SwitchToStreamSwitchPass::FindSwitchCondInput(OutDataAnchorPtr &peer_cond_anchor) {
  250. NodePtr tmp_node = nullptr;
  251. std::string type;
  252. bool pass_flag = true;
  253. while (pass_flag) {
  254. if (tmp_node == nullptr) {
  255. tmp_node = peer_cond_anchor->GetOwnerNode();
  256. } else {
  257. InDataAnchorPtr in_data_anchor = tmp_node->GetInDataAnchor(SWITCH_DATA_INPUT);
  258. GE_CHECK_NOTNULL(in_data_anchor);
  259. peer_cond_anchor = in_data_anchor->GetPeerOutAnchor();
  260. GE_CHECK_NOTNULL(peer_cond_anchor);
  261. tmp_node = peer_cond_anchor->GetOwnerNode();
  262. }
  263. GE_CHK_STATUS_RET(GetOriginalType(tmp_node, type), "Get node type failed.");
  264. pass_flag = ((type == SWITCH) || (type == REFSWITCH));
  265. }
  266. return SUCCESS;
  267. }
  268. ///
  269. /// @brief Create StreamSwitch Node
  270. /// @param [in] graph
  271. /// @param [in] switch_node
  272. /// @param [in] suffix
  273. /// @param [in] peer_cond_anchor
  274. /// @return ge::NodePtr
  275. ///
  276. NodePtr SwitchToStreamSwitchPass::CreateStreamSwitchNode(const ComputeGraphPtr &graph, const NodePtr &switch_node,
  277. const std::string &suffix,
  278. const OutDataAnchorPtr &peer_cond_anchor) {
  279. OpDescPtr switch_op_desc = switch_node->GetOpDesc();
  280. GE_CHK_BOOL_EXEC(switch_op_desc != nullptr,
  281. REPORT_INNER_ERROR("E19999", "OpDesc in node is nullptr, check invalid");
  282. return nullptr, "OpDesc of Switch node is invalid.");
  283. GE_IF_BOOL_EXEC(switch_op_desc->GetInputsSize() != SWITCH_INPUT_NUM, {
  284. REPORT_INNER_ERROR("E19999", "Input desc size:%zu of node:%s(%s) not equal to %u, check invalid",
  285. switch_op_desc->GetInputsSize(),
  286. switch_op_desc->GetName().c_str(), switch_op_desc->GetType().c_str(), SWITCH_INPUT_NUM);
  287. GELOGE(FAILED, "Switch input param invalid, input_size=%lu, should be %u.", switch_op_desc->GetInputsSize(),
  288. SWITCH_INPUT_NUM);
  289. return nullptr;
  290. });
  291. const std::string &node_name = switch_node->GetName() + "_" + STREAMSWITCH + suffix;
  292. GELOGI("Create StreamSwitch, name=%s.", node_name.c_str());
  293. OpDescPtr op_desc = MakeShared<OpDesc>(node_name, STREAMSWITCH);
  294. if (op_desc == nullptr) {
  295. REPORT_CALL_ERROR("E19999", "New OpDesc failed");
  296. GELOGE(FAILED, "Create op_desc failed, StreamSwitch:%s.", node_name.c_str());
  297. return nullptr;
  298. }
  299. // mark hccl group id
  300. std::string hccl_group_id;
  301. if (AttrUtils::GetStr(switch_node->GetOpDesc(), ATTR_NAME_HCCL_FUSED_GROUP, hccl_group_id)) {
  302. (void)AttrUtils::SetStr(op_desc, ATTR_NAME_HCCL_FUSED_GROUP, hccl_group_id);
  303. GELOGD("Set attr ATTR_NAME_HCCL_FUSED_GROUP for Stream_Switch %s, value is %s.", node_name.c_str(),
  304. hccl_group_id.c_str());
  305. }
  306. int64_t switch_type;
  307. if (AttrUtils::GetInt(switch_node->GetOpDesc(), ATTR_NAME_STREAM_SWITCH_TYPE, switch_type)) {
  308. (void)AttrUtils::SetInt(op_desc, ATTR_NAME_STREAM_SWITCH_TYPE, switch_type);
  309. GELOGD("Set attr ATTR_NAME_STREAM_SWITCH_TYPE for Stream_Switch %s, value is %ld.", node_name.c_str(),
  310. switch_type);
  311. }
  312. if (!AttrUtils::SetInt(op_desc, ATTR_NAME_SWITCH_DATA_TYPE, RT_SWITCH_INT32) ||
  313. !AttrUtils::SetInt(op_desc, ATTR_NAME_STREAM_SWITCH_COND, (int64_t)RT_EQUAL)) {
  314. REPORT_CALL_ERROR("E19999", "Set Attr:%s or Attr:%s to op:%s(%s) failed",
  315. ATTR_NAME_SWITCH_DATA_TYPE.c_str(), ATTR_NAME_STREAM_SWITCH_COND.c_str(),
  316. op_desc->GetName().c_str(), op_desc->GetType().c_str());
  317. GELOGE(INTERNAL_ERROR, "set int failed");
  318. return nullptr;
  319. }
  320. // Already checked, first input is Variable will passed, second is condition will checked.
  321. GeTensorDesc cond_input_desc = switch_op_desc->GetInputDesc(SWITCH_PRED_INPUT);
  322. GeTensorDesc input_desc(GeShape(cond_input_desc.GetShape().GetDims()), cond_input_desc.GetFormat(), DT_INT32);
  323. GE_CHK_BOOL_EXEC(op_desc->AddInputDesc(input_desc) == GRAPH_SUCCESS,
  324. REPORT_CALL_ERROR("E19999", "Add input desc to op:%s(%s) failed",
  325. op_desc->GetName().c_str(), op_desc->GetType().c_str());
  326. return nullptr,
  327. "Create StreamSwitch node: add input desc failed.");
  328. GE_CHK_BOOL_EXEC(op_desc->AddInputDesc(input_desc) == GRAPH_SUCCESS,
  329. REPORT_CALL_ERROR("E19999", "Add ouput desc to op:%s(%s) failed",
  330. op_desc->GetName().c_str(), op_desc->GetType().c_str());
  331. return nullptr,
  332. "Create StreamSwitch node: add input desc failed.");
  333. NodePtr stream_switch = graph->AddNode(op_desc);
  334. GE_CHK_BOOL_EXEC(stream_switch != nullptr,
  335. REPORT_CALL_ERROR("E19999", "Add node:%s(%s) to graph:%s failed",
  336. op_desc->GetName().c_str(), op_desc->GetType().c_str(), graph->GetName().c_str());
  337. return nullptr, "Insert StreamSwitch node failed.");
  338. GE_CHK_STATUS(GraphUtils::AddEdge(peer_cond_anchor, stream_switch->GetInDataAnchor(0)),
  339. "StreamSwitch node add cond edge failed.");
  340. return stream_switch;
  341. }
  342. ///
  343. /// @brief Mark Switch Branch
  344. /// @param [in] peer_cond_anchor
  345. /// @param [in] stream_switch
  346. /// @param [in] true_branch_flag
  347. /// @return Status
  348. ///
  349. Status SwitchToStreamSwitchPass::MarkBranches(const OutDataAnchorPtr &peer_cond_anchor, const NodePtr &stream_switch,
  350. bool true_branch_flag) {
  351. uint32_t index = true_branch_flag ? SWITCH_TRUE_OUTPUT : SWITCH_FALSE_OUTPUT;
  352. auto it = cond_node_map_.find(peer_cond_anchor);
  353. if (it != cond_node_map_.end()) {
  354. int64_t switch_group_id = GetGroupId(stream_switch);
  355. auto switch_group_it = it->second.find(switch_group_id);
  356. if (switch_group_it == it->second.end()) {
  357. std::list<NodePtr> false_node_list;
  358. std::list<NodePtr> true_node_list;
  359. std::list<NodePtr> &node_list = true_branch_flag ? true_node_list : false_node_list;
  360. node_list.emplace_back(stream_switch);
  361. std::vector<std::list<NodePtr>> switch_list;
  362. switch_list.emplace_back(false_node_list);
  363. switch_list.emplace_back(true_node_list);
  364. it->second[switch_group_id] = switch_list;
  365. } else {
  366. GE_IF_BOOL_EXEC(switch_group_it->second.size() != SWITCH_OUTPUT_NUM, {
  367. REPORT_INNER_ERROR("E19999", "switch group size:%zu not equal to %u, group_id:%ld, check invalid",
  368. switch_group_it->second.size(), SWITCH_OUTPUT_NUM, switch_group_id);
  369. GELOGE(INTERNAL_ERROR, "Check size failed, node: %s", stream_switch->GetName().c_str());
  370. return FAILED;
  371. });
  372. switch_group_it->second[index].emplace_back(stream_switch);
  373. }
  374. } else {
  375. int64_t switch_group_id = GetGroupId(stream_switch);
  376. std::map<int64_t, std::vector<std::list<NodePtr>>> switch_group_map;
  377. std::list<NodePtr> false_node_list;
  378. std::list<NodePtr> true_node_list;
  379. std::list<NodePtr> &node_list = true_branch_flag ? true_node_list : false_node_list;
  380. node_list.emplace_back(stream_switch);
  381. std::vector<std::list<NodePtr>> switch_list;
  382. switch_list.emplace_back(false_node_list);
  383. switch_list.emplace_back(true_node_list);
  384. switch_group_map[switch_group_id] = switch_list;
  385. cond_node_map_[peer_cond_anchor] = switch_group_map;
  386. }
  387. return SUCCESS;
  388. }
  389. ///
  390. /// @brief Get group_id for switch_node
  391. /// @param [in] node
  392. /// @return group_id
  393. ///
  394. int64_t SwitchToStreamSwitchPass::GetGroupId(const NodePtr &node) {
  395. std::string tailing_optimization_option;
  396. bool is_tailing_optimization = false;
  397. if (GetContext().GetOption(OPTION_EXEC_ENABLE_TAILING_OPTIMIZATION, tailing_optimization_option) == GRAPH_SUCCESS) {
  398. // "1" means it's True from frontend option
  399. is_tailing_optimization = (tailing_optimization_option == "1");
  400. GELOGI("Option ge.exec.isTailingOptimization is %s", tailing_optimization_option.c_str());
  401. }
  402. if (!is_tailing_optimization) {
  403. return 0;
  404. }
  405. std::string hccl_group_id;
  406. if (!AttrUtils::GetStr(node->GetOpDesc(), ATTR_NAME_HCCL_FUSED_GROUP, hccl_group_id)) {
  407. GELOGI("Node %s can not find hccl group id.", node->GetName().c_str());
  408. return 0;
  409. }
  410. auto key_index = hccl_group_id.find_last_of('_');
  411. auto key_num = hccl_group_id.substr(key_index + 1, hccl_group_id.length() - key_index);
  412. GELOGI("Node:%s, hccl_group_id=%s, key_num=%s", node->GetName().c_str(), hccl_group_id.c_str(), key_num.c_str());
  413. int64_t num = atoi(key_num.c_str());
  414. if (num == 0) {
  415. return 0;
  416. }
  417. GELOGI("Hccl_group_id is %s, group_id is %ld", hccl_group_id.c_str(), num);
  418. return num;
  419. }
  420. ///
  421. /// @brief Combine switch nodes link to same cond
  422. /// @param [in] graph
  423. /// @return Status
  424. ///
  425. Status SwitchToStreamSwitchPass::CombineSwitchNode(const ComputeGraphPtr &graph) {
  426. for (auto iter = cond_node_map_.begin(); iter != cond_node_map_.end(); ++iter) {
  427. for (auto group_iter = iter->second.begin(); group_iter != iter->second.end(); ++group_iter) {
  428. std::list<NodePtr> false_switch_list = group_iter->second[SWITCH_FALSE_OUTPUT];
  429. std::list<NodePtr> true_switch_list = group_iter->second[SWITCH_TRUE_OUTPUT];
  430. std::set<NodePtr> same_cond_switch;
  431. same_cond_switch.insert(false_switch_list.begin(), false_switch_list.end());
  432. same_cond_switch.insert(true_switch_list.begin(), true_switch_list.end());
  433. OutDataAnchorPtr peer_cond_anchor = iter->first;
  434. GE_CHECK_NOTNULL(peer_cond_anchor);
  435. NodePtr cond_node = peer_cond_anchor->GetOwnerNode();
  436. GELOGI("CombineSwitchNode: cond_node=%s.", cond_node->GetName().c_str());
  437. NodePtr cast_node = CreateCastOp(graph, peer_cond_anchor);
  438. GE_CHK_BOOL_EXEC(cast_node != nullptr, return FAILED, "Create cast_node failed.");
  439. NodePtr active_node = CreateActiveNode(graph, cond_node);
  440. GE_CHK_BOOL_EXEC(active_node != nullptr, return FAILED, "Create StreamActive node failed.");
  441. GE_CHK_STATUS(GraphUtils::AddEdge(cast_node->GetOutControlAnchor(), active_node->GetInControlAnchor()),
  442. "StreamActive add ctl edge failed.");
  443. if (SetActiveLabelList(active_node, { cast_node->GetName() }) != SUCCESS) {
  444. REPORT_CALL_ERROR("E19999", "Set active label list:%s to op:%s(%s) failed",
  445. cast_node->GetName().c_str(), active_node->GetName().c_str(), active_node->GetType().c_str());
  446. GELOGE(FAILED, "Set active_label_list attr for node %s failed.", active_node->GetName().c_str());
  447. return FAILED;
  448. }
  449. const std::string &cond_group = cond_node->GetName();
  450. for (uint32_t i = 0; i < SWITCH_OUTPUT_NUM; ++i) {
  451. bool true_branch_flag = (i == SWITCH_TRUE_OUTPUT);
  452. std::list<NodePtr> &switch_list = (true_branch_flag ? true_switch_list : false_switch_list);
  453. GE_IF_BOOL_EXEC(switch_list.empty(), continue);
  454. // select first stream_switch
  455. NodePtr stream_switch = switch_list.front();
  456. // set stream_label
  457. if (SetStreamLabel(stream_switch, cast_node->GetName()) != SUCCESS) {
  458. REPORT_CALL_ERROR("E19999", "Set stream_label:%s to op:%s(%s) failed",
  459. cast_node->GetName().c_str(), stream_switch->GetName().c_str(),
  460. stream_switch->GetType().c_str());
  461. GELOGE(FAILED, "Set stream label failed.");
  462. return FAILED;
  463. }
  464. OpDescPtr switch_desc = stream_switch->GetOpDesc();
  465. GE_CHECK_NOTNULL(switch_desc);
  466. switch_desc->SetName(CheckDuplicateName(cond_group + "/" + STREAMSWITCH + (true_branch_flag ? "_t" : "_f")));
  467. stream_switch_nodes_.emplace_back(stream_switch);
  468. // 0_input: original pred input, 1_input: constant node
  469. GE_CHK_STATUS_RET(AddConstNode(graph, stream_switch), "Add const node failed.");
  470. GE_CHK_STATUS(GraphUtils::RemoveEdge(peer_cond_anchor, stream_switch->GetInDataAnchor(0)),
  471. "StreamSwitch remove data edge failed.");
  472. GE_CHK_STATUS(GraphUtils::AddEdge(cast_node->GetOutDataAnchor(0), stream_switch->GetInDataAnchor(0)),
  473. "Cast add data edge failed.");
  474. for (const NodePtr &node : switch_list) {
  475. GE_IF_BOOL_EXEC(node != stream_switch, {
  476. GE_CHK_STATUS(GraphUtils::RemoveEdge(peer_cond_anchor, node->GetInDataAnchor(0)),
  477. "StreamSwitch remove data edge failed.");
  478. });
  479. GE_CHK_STATUS(ModifySwitchInCtlEdges(node, cast_node, same_cond_switch), "ModifySwitchInCtlEdges failed.");
  480. GE_CHK_STATUS(ModifySwitchOutCtlEdges(node, stream_switch, active_node), "ModifySwitchOutCtlEdges failed.");
  481. }
  482. GE_CHK_STATUS(GraphUtils::AddEdge(active_node->GetOutControlAnchor(), stream_switch->GetInControlAnchor()),
  483. "StreamActive add ctl edge failed.");
  484. }
  485. }
  486. }
  487. return SUCCESS;
  488. }
  489. ///
  490. /// @brief Create Active Op
  491. /// @param [in] graph
  492. /// @param [in] cond_node
  493. /// @return ge::NodePtr
  494. ///
  495. NodePtr SwitchToStreamSwitchPass::CreateActiveNode(const ComputeGraphPtr &graph, const NodePtr &node) {
  496. const std::string &node_name = CheckDuplicateName(node->GetName() + "_" + STREAMACTIVE);
  497. GELOGI("Create StreamActive op:%s.", node_name.c_str());
  498. OpDescPtr op_desc = MakeShared<OpDesc>(node_name, STREAMACTIVE);
  499. if (op_desc == nullptr) {
  500. REPORT_CALL_ERROR("E19999", "New OpDesc failed");
  501. GELOGE(FAILED, "Create op_desc failed, StreamActive:%s.", node_name.c_str());
  502. return nullptr;
  503. }
  504. NodePtr active_node = graph->AddNode(op_desc);
  505. GE_CHK_BOOL_EXEC(active_node != nullptr,
  506. REPORT_CALL_ERROR("E19999", "Add node:%s(%s) to graph:%s failed",
  507. op_desc->GetName().c_str(), op_desc->GetType().c_str(), graph->GetName().c_str());
  508. return nullptr, "Create StreamActive node failed.");
  509. GE_IF_BOOL_EXEC(GraphUtils::AddEdge(node->GetOutControlAnchor(), active_node->GetInControlAnchor()) != SUCCESS,
  510. REPORT_CALL_ERROR("E19999", "Add control edge between op:%s(%s) and op:%s(%s) failed",
  511. node->GetName().c_str(), node->GetType().c_str(),
  512. active_node->GetName().c_str(), active_node->GetType().c_str());
  513. GELOGE(INTERNAL_ERROR, "add edge failed");
  514. return nullptr);
  515. GE_IF_BOOL_EXEC(SetSwitchBranchNodeLabel(active_node, node_name) != SUCCESS,
  516. REPORT_CALL_ERROR("E19999", "Set switch branch node label:%s to node:%s(%s) failed",
  517. node_name.c_str(), active_node->GetName().c_str(), active_node->GetType().c_str());
  518. GELOGE(INTERNAL_ERROR, "set switch branch node label failed");
  519. return nullptr);
  520. return active_node;
  521. }
  522. ///
  523. /// @brief Create cast node
  524. /// @param [in] graph
  525. /// @param [in] peer_cond_anchor
  526. /// @return NodePtr
  527. ///
  528. NodePtr SwitchToStreamSwitchPass::CreateCastOp(const ComputeGraphPtr &graph, const OutDataAnchorPtr &peer_cond_anchor) {
  529. OpDescPtr cond_desc = peer_cond_anchor->GetOwnerNode()->GetOpDesc();
  530. GE_CHK_BOOL_EXEC(cond_desc != nullptr, return nullptr, "Get cond_desc failed.");
  531. const std::string &cast_name = CheckDuplicateName(cond_desc->GetName() + "_" + CAST);
  532. GELOGI("Create cast_node: %s, input datatype:DT_BOOL, out datatype:DT_INT32", cast_name.c_str());
  533. OpDescPtr cast_desc = MakeShared<OpDesc>(cast_name, CAST);
  534. if (cast_desc == nullptr) {
  535. REPORT_CALL_ERROR("E19999", "New OpDesc failed");
  536. GELOGE(FAILED, "Create op_desc failed, Cast:%s.", cast_name.c_str());
  537. return nullptr;
  538. }
  539. if (!(AttrUtils::SetInt(cast_desc, CAST_ATTR_SRCT, (int64_t)DT_BOOL) &&
  540. AttrUtils::SetInt(cast_desc, CAST_ATTR_DSTT, (int64_t)DT_INT32) &&
  541. AttrUtils::SetInt(cast_desc, CAST_ATTR_DST_TYPE, (int64_t)DT_INT32) &&
  542. AttrUtils::SetBool(cast_desc, CAST_ATTR_TRUNCATE, false))) {
  543. REPORT_CALL_ERROR("E19999", "Set Attr:%s or %s or %s or %s to op:%s(%s) failed",
  544. CAST_ATTR_SRCT.c_str(), CAST_ATTR_DSTT.c_str(),
  545. CAST_ATTR_DST_TYPE.c_str(), CAST_ATTR_TRUNCATE.c_str(),
  546. cast_desc->GetName().c_str(), cast_desc->GetType().c_str());
  547. GELOGE(FAILED, "Set CAST_ATTR_SRCT or CAST_ATTR_DSTT or CAST_ATTR_DST_TYPE or CAST_ATTR_TRUNCATE failed, node: %s.",
  548. cast_name.c_str());
  549. return nullptr;
  550. }
  551. GeTensorDesc tensor_desc = cond_desc->GetOutputDesc(peer_cond_anchor->GetIdx());
  552. tensor_desc.SetDataType(DT_BOOL);
  553. GE_CHK_BOOL_EXEC(cast_desc->AddInputDesc(tensor_desc) == SUCCESS,
  554. REPORT_CALL_ERROR("E19999", "Add input desc to op:%s(%s) failed",
  555. cast_desc->GetName().c_str(), cast_desc->GetType().c_str());
  556. return nullptr,
  557. "Cast_node add input desc failed.");
  558. tensor_desc.SetDataType(DT_INT32);
  559. GE_CHK_BOOL_EXEC(cast_desc->AddOutputDesc(tensor_desc) == SUCCESS,
  560. REPORT_CALL_ERROR("E19999", "Add output desc to op:%s(%s) failed",
  561. cast_desc->GetName().c_str(), cast_desc->GetType().c_str());
  562. return nullptr,
  563. "Cast_node add output desc failed.");
  564. NodePtr cast_node = graph->AddNode(cast_desc);
  565. GE_CHK_BOOL_EXEC(cast_node != nullptr,
  566. REPORT_CALL_ERROR("E19999", "Add node:%s(%s) to graph:%s failed",
  567. cast_desc->GetName().c_str(), cast_desc->GetType().c_str(),
  568. graph->GetName().c_str());
  569. return nullptr, "Create cast_node failed.");
  570. // Cast node has and only has one input
  571. GE_CHK_STATUS(GraphUtils::AddEdge(peer_cond_anchor, cast_node->GetInDataAnchor(0)), "Cast add data edge failed.");
  572. return cast_node;
  573. }
  574. ///
  575. /// @brief Add const node as switch input1
  576. /// @param [in] graph
  577. /// @param [in] stream_switch
  578. /// @return Status
  579. ///
  580. Status SwitchToStreamSwitchPass::AddConstNode(const ComputeGraphPtr &graph, const NodePtr &stream_switch) {
  581. OpDescPtr op_desc = stream_switch->GetOpDesc();
  582. GE_CHECK_NOTNULL(op_desc);
  583. bool value = false;
  584. GE_CHK_BOOL_EXEC(AttrUtils::GetBool(op_desc, ATTR_NAME_SWITCH_TRUE_BRANCH_FLAG, value),
  585. REPORT_CALL_ERROR("E19999", "Get Attr:%s from op:%s(%s) failed",
  586. ATTR_NAME_SWITCH_TRUE_BRANCH_FLAG.c_str(),
  587. op_desc->GetName().c_str(), op_desc->GetType().c_str());
  588. return FAILED,
  589. "StreamSwitch get attr TRUE_BRANCH_STREAM failed.");
  590. const std::string &const_node_name = op_desc->GetName() + "_Constant_" + (value ? "t" : "f");
  591. GELOGI("Create const op: %s", const_node_name.c_str());
  592. OpDescPtr const_op_desc = MakeShared<OpDesc>(const_node_name, CONSTANT);
  593. if (const_op_desc == nullptr) {
  594. REPORT_CALL_ERROR("E19999", "New OpDesc failed");
  595. GELOGE(FAILED, "Create op_desc failed, Constant:%s.", const_node_name.c_str());
  596. return FAILED;
  597. }
  598. auto resize_value = (int32_t)value;
  599. GeTensorDesc data_desc = op_desc->GetInputDesc(1);
  600. GeTensorPtr const_value =
  601. MakeShared<GeTensor>(data_desc, reinterpret_cast<uint8_t *>(&resize_value), sizeof(int32_t));
  602. if (const_value == nullptr) {
  603. REPORT_CALL_ERROR("E19999", "New GeTensor failed");
  604. GELOGE(FAILED, "Create tensor failed.");
  605. return FAILED;
  606. }
  607. GE_CHK_BOOL_EXEC(AttrUtils::SetTensor(const_op_desc, ATTR_NAME_WEIGHTS, const_value),
  608. REPORT_CALL_ERROR("E19999", "Get Attr:%s from op:%s(%s) failed", ATTR_NAME_WEIGHTS.c_str(),
  609. const_op_desc->GetName().c_str(), const_op_desc->GetType().c_str());
  610. return FAILED);
  611. GE_CHK_BOOL_EXEC(const_op_desc->AddOutputDesc(data_desc) == GRAPH_SUCCESS,
  612. REPORT_CALL_ERROR("E19999", "Add output desc to op:%s(%s) failed",
  613. const_op_desc->GetName().c_str(), const_op_desc->GetType().c_str());
  614. return FAILED,
  615. "Create Const op: add output desc failed.");
  616. NodePtr const_node = graph->AddNode(const_op_desc);
  617. GE_CHK_BOOL_EXEC(const_node != nullptr,
  618. REPORT_CALL_ERROR("E19999", "Add node:%s(%s) to graph:%s failed",
  619. const_op_desc->GetName().c_str(), const_op_desc->GetType().c_str(),
  620. graph->GetName().c_str());
  621. return FAILED, "Insert Const node failed.");
  622. GE_CHK_STATUS(GraphUtils::AddEdge(const_node->GetOutDataAnchor(0), stream_switch->GetInDataAnchor(1)),
  623. "StreamSwitch node add ctl edge failed.");
  624. return SUCCESS;
  625. }
  626. ///
  627. /// @brief Modify in ctl edge for switch_node
  628. /// @param [in] switch_node
  629. /// @param [in] cast_node
  630. /// @param [in] same_cond_switch
  631. /// @return Status
  632. ///
  633. Status SwitchToStreamSwitchPass::ModifySwitchInCtlEdges(const NodePtr &switch_node, const NodePtr &cast_node,
  634. const std::set<NodePtr> &same_cond_switch) {
  635. GELOGD("ModifySwitchInCtlEdges: switch_node=%s, cast_node=%s", switch_node->GetName().c_str(),
  636. cast_node->GetName().c_str());
  637. std::string orig_switch_name = switch_node->GetName();
  638. OpDescPtr switch_desc = switch_node->GetOpDesc();
  639. GE_CHECK_NOTNULL(switch_desc);
  640. if (!AttrUtils::GetStr(switch_desc, ATTR_NAME_ORIG_NODE_NAME, orig_switch_name) || orig_switch_name.empty()) {
  641. REPORT_CALL_ERROR("E19999", "Get Attr:%s from op:%s(%s) failed", ATTR_NAME_ORIG_NODE_NAME.c_str(),
  642. switch_desc->GetName().c_str(), switch_desc->GetType().c_str());
  643. GELOGE(INTERNAL_ERROR, "Get attr ATTR_NAME_ORIG_NODE_NAME failed, node: %s", switch_desc->GetName().c_str());
  644. return INTERNAL_ERROR;
  645. }
  646. for (const NodePtr &in_ctrl_node : switch_node->GetInControlNodes()) {
  647. GE_CHK_STATUS(GraphUtils::RemoveEdge(in_ctrl_node->GetOutControlAnchor(), switch_node->GetInControlAnchor()),
  648. "Remove ctl edge failed.");
  649. GE_IF_BOOL_EXEC(!in_ctrl_node->GetOutControlAnchor()->IsLinkedWith(cast_node->GetInControlAnchor()), {
  650. GE_CHK_STATUS(GraphUtils::AddEdge(in_ctrl_node->GetOutControlAnchor(), cast_node->GetInControlAnchor()),
  651. "Add ctl edge failed.");
  652. });
  653. GE_IF_BOOL_EXEC(in_ctrl_node->GetType() != STREAMSWITCH, continue);
  654. if (same_cond_switch.count(in_ctrl_node) > 0) {
  655. GE_CHK_STATUS(GraphUtils::RemoveEdge(in_ctrl_node->GetOutControlAnchor(), cast_node->GetInControlAnchor()),
  656. "Remove ctl edge failed.");
  657. continue;
  658. }
  659. auto find_res1 = switch_node_map_.find(in_ctrl_node);
  660. GE_IF_BOOL_EXEC(find_res1 == switch_node_map_.end(), {
  661. REPORT_INNER_ERROR("E19999", "Node:%s(%s) can't find in switch_node_map_, check invalid",
  662. in_ctrl_node->GetName().c_str(), in_ctrl_node->GetType().c_str());
  663. GELOGE(INTERNAL_ERROR, "StreamSwitch node %s not found in switch_node_map_.", in_ctrl_node->GetName().c_str());
  664. return INTERNAL_ERROR;
  665. });
  666. auto find_res2 = find_res1->second.find(orig_switch_name);
  667. auto find_res3 = find_res1->second.find(cast_node->GetName());
  668. GE_IF_BOOL_EXEC((find_res2 != find_res1->second.end()) && (find_res3 == find_res1->second.end()), {
  669. find_res1->second.erase(find_res2);
  670. find_res1->second.insert(cast_node->GetName());
  671. continue;
  672. });
  673. }
  674. return SUCCESS;
  675. }
  676. ///
  677. /// @brief Modify out ctl edge for switch_node
  678. /// @param [in] switch_node
  679. /// @param [in] stream_switch
  680. /// @param [in] active_node
  681. /// @return Status
  682. ///
  683. Status SwitchToStreamSwitchPass::ModifySwitchOutCtlEdges(const NodePtr &switch_node, const NodePtr &stream_switch,
  684. const NodePtr &active_node) {
  685. GELOGD("ModifySwitchOutCtlEdges: switch_node=%s, stream_switch=%s, active_node=%s", switch_node->GetName().c_str(),
  686. stream_switch->GetName().c_str(), active_node->GetName().c_str());
  687. auto find_res = switch_node_map_.find(switch_node);
  688. GE_IF_BOOL_EXEC(find_res == switch_node_map_.end(), {
  689. REPORT_INNER_ERROR("E19999", "Node:%s(%s) can't find in switch_node_map_, check invalid",
  690. switch_node->GetName().c_str(), switch_node->GetType().c_str());
  691. GELOGE(INTERNAL_ERROR, "StreamSwitch node %s not found in switch_node_map_.", switch_node->GetName().c_str());
  692. return INTERNAL_ERROR;
  693. });
  694. GE_IF_BOOL_EXEC(find_res->second.empty(), {
  695. REPORT_INNER_ERROR("E19999", "True_nodes of StreamSwitch node:%s(%s) is empty, check invalid",
  696. switch_node->GetName().c_str(), switch_node->GetType().c_str());
  697. GELOGE(INTERNAL_ERROR, "true_nodes of StreamSwitch node %s is empty.", switch_node->GetName().c_str());
  698. return INTERNAL_ERROR;
  699. });
  700. for (const NodePtr &node : switch_node->GetOutControlNodes()) {
  701. GE_CHK_STATUS(GraphUtils::RemoveEdge(switch_node->GetOutControlAnchor(), node->GetInControlAnchor()),
  702. "Remove ctl edge failed.");
  703. OpDescPtr op_desc = node->GetOpDesc();
  704. GE_CHECK_NOTNULL(op_desc);
  705. std::string orig_name = op_desc->GetName();
  706. GE_IF_BOOL_EXEC(op_desc->HasAttr(ATTR_NAME_ORIG_NODE_NAME), {
  707. if (!AttrUtils::GetStr(op_desc, ATTR_NAME_ORIG_NODE_NAME, orig_name) || orig_name.empty()) {
  708. REPORT_CALL_ERROR("E19999", "Get Attr:%s from op:%s(%s) failed", ATTR_NAME_ORIG_NODE_NAME.c_str(),
  709. op_desc->GetName().c_str(), op_desc->GetType().c_str());
  710. GELOGE(INTERNAL_ERROR, "Get attr ATTR_NAME_ORIG_NODE_NAME failed, node: %s.", op_desc->GetName().c_str());
  711. return INTERNAL_ERROR;
  712. }
  713. });
  714. if (find_res->second.find(orig_name) == find_res->second.end()) {
  715. auto active_out_ctrl_anchor = active_node->GetOutControlAnchor();
  716. GE_CHECK_NOTNULL(active_out_ctrl_anchor);
  717. GE_IF_BOOL_EXEC(!active_out_ctrl_anchor->IsLinkedWith(node->GetInControlAnchor()), {
  718. GE_CHK_STATUS(GraphUtils::AddEdge(active_out_ctrl_anchor, node->GetInControlAnchor()), "Add ctl edge failed.");
  719. });
  720. } else {
  721. auto switch_out_ctrl_anchor = stream_switch->GetOutControlAnchor();
  722. GE_CHECK_NOTNULL(switch_out_ctrl_anchor);
  723. GE_IF_BOOL_EXEC(!switch_out_ctrl_anchor->IsLinkedWith(node->GetInControlAnchor()), {
  724. GE_CHK_STATUS(GraphUtils::AddEdge(switch_out_ctrl_anchor, node->GetInControlAnchor()), "Add ctl edge failed.");
  725. });
  726. }
  727. }
  728. GE_IF_BOOL_EXEC(switch_node != stream_switch, (void)bypass_nodes_.insert(switch_node));
  729. return SUCCESS;
  730. }
  731. ///
  732. /// @brief Check duplicate node_name
  733. /// @param [in] node_name
  734. /// @return std::string
  735. ///
  736. std::string SwitchToStreamSwitchPass::CheckDuplicateName(const std::string &node_name) {
  737. std::string tmp_name = node_name;
  738. auto iter = node_num_map_.find(tmp_name);
  739. if (iter != node_num_map_.end()) {
  740. tmp_name = tmp_name + "_" + std::to_string(iter->second);
  741. (iter->second)++;
  742. } else {
  743. node_num_map_[tmp_name] = 1;
  744. }
  745. return tmp_name;
  746. }
  747. ///
  748. /// @brief Move Control Edges
  749. /// @param [in] old_node
  750. /// @param [in] new_node
  751. /// @return void
  752. ///
  753. void SwitchToStreamSwitchPass::MoveCtrlEdges(const NodePtr &old_node, const NodePtr &new_node) {
  754. GE_IF_BOOL_EXEC(old_node == new_node, return );
  755. auto iter = switch_cyclic_map_.find(old_node);
  756. bool check_flag = (iter != switch_cyclic_map_.end());
  757. for (const NodePtr &in_node : old_node->GetInControlNodes()) {
  758. auto out_ctrl_anchor = in_node->GetOutControlAnchor();
  759. GE_CHECK_NOTNULL_JUST_RETURN(out_ctrl_anchor);
  760. if (check_flag && (iter->second.count(in_node->GetName()) > 0)) {
  761. for (const auto &out_node : old_node->GetOutAllNodes()) {
  762. GE_IF_BOOL_EXEC(!out_ctrl_anchor->IsLinkedWith(out_node->GetInControlAnchor()), {
  763. GE_CHK_STATUS(GraphUtils::AddEdge(out_ctrl_anchor, out_node->GetInControlAnchor()),
  764. "Add in ctrl edge failed.");
  765. });
  766. }
  767. } else {
  768. GE_IF_BOOL_EXEC(!out_ctrl_anchor->IsLinkedWith(new_node->GetInControlAnchor()), {
  769. GE_CHK_STATUS(GraphUtils::AddEdge(out_ctrl_anchor, new_node->GetInControlAnchor()),
  770. "Add in ctrl edge failed.");
  771. });
  772. }
  773. GE_CHK_STATUS(GraphUtils::RemoveEdge(out_ctrl_anchor, old_node->GetInControlAnchor()),
  774. "Remove in ctrl edge failed.");
  775. }
  776. for (const NodePtr &out_node : old_node->GetOutControlNodes()) {
  777. GE_IF_BOOL_EXEC(!new_node->GetOutControlAnchor()->IsLinkedWith(out_node->GetInControlAnchor()), {
  778. GE_CHK_STATUS(GraphUtils::AddEdge(new_node->GetOutControlAnchor(), out_node->GetInControlAnchor()),
  779. "Add out ctrl edge failed.");
  780. });
  781. GE_CHK_STATUS(GraphUtils::RemoveEdge(old_node->GetOutControlAnchor(), out_node->GetInControlAnchor()),
  782. "Remove out ctrl edge failed.");
  783. }
  784. }
  785. } // namespace ge

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