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

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