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

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

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