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 33 kB

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

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