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.

iterator_op_pass.cc 22 kB

5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
4 years ago
4 years ago
5 years ago
4 years ago
4 years ago
5 years ago
4 years ago
4 years ago
5 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
5 years ago
5 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
5 years ago
4 years ago
5 years ago
4 years ago
5 years ago
4 years ago
4 years ago
5 years ago
4 years ago
5 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
4 years ago
5 years ago
4 years ago
5 years ago
4 years ago
5 years ago
4 years ago
4 years ago
5 years ago
4 years ago
5 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411
  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/iterator_op_pass.h"
  17. #include <memory>
  18. #include <sstream>
  19. #include <string>
  20. #include <vector>
  21. #include "framework/common/debug/log.h"
  22. #include "framework/common/debug/ge_log.h"
  23. #include "common/ge/ge_util.h"
  24. #include "framework/common/debug/ge_log.h"
  25. #include "graph/anchor.h"
  26. #include "common/omg_util.h"
  27. #include "external/graph/graph.h"
  28. #include "graph/node.h"
  29. #include "graph/passes/pass_utils.h"
  30. #include "graph/utils/graph_utils.h"
  31. #include "runtime/mem.h"
  32. #include "graph/manager/graph_var_manager.h"
  33. #include "graph/ge_context.h"
  34. #include "graph/manager/util/rt_context_util.h"
  35. namespace ge {
  36. const char *const kGetNext = "GetNext";
  37. const int kMaxIterationsPerLoop = INT32_MAX - 1;
  38. Status IteratorOpPass::Run(ge::ComputeGraphPtr graph) {
  39. GELOGD("GetNextOpPass begin");
  40. GE_CHECK_NOTNULL(graph);
  41. if (!PassUtils::IsNeedTrainIteFlowCtrl(graph)) {
  42. return SUCCESS;
  43. }
  44. std::string type;
  45. for (ge::NodePtr &node : graph->GetDirectNode()) {
  46. GE_CHK_STATUS_RET(GetOriginalType(node, type));
  47. auto op_desc = node->GetOpDesc();
  48. GE_CHECK_NOTNULL(op_desc);
  49. const string op_type = op_desc->GetType();
  50. if (type == "IteratorV2" || type == "Iterator" || op_type == kGetNext) {
  51. ge::NodePtr memcpy_async_node = InsertMemcpyAsyncNode(node, graph);
  52. GE_CHECK_NOTNULL(memcpy_async_node);
  53. auto status = SetCycleEvent(memcpy_async_node);
  54. if (status != ge::SUCCESS) {
  55. REPORT_CALL_ERROR("E19999", "Set cycle event to op:%s(%s) failed",
  56. memcpy_async_node->GetName().c_str(), memcpy_async_node->GetType().c_str());
  57. GELOGE(status, "[Set][CycleEvent] to op:%s(%s) failed",
  58. memcpy_async_node->GetName().c_str(), memcpy_async_node->GetType().c_str());
  59. return status;
  60. }
  61. status = SetStreamLabel(memcpy_async_node, memcpy_async_node->GetName());
  62. if (status != ge::SUCCESS) {
  63. REPORT_CALL_ERROR("E19999", "Set stream label:%s to op:%s(%s) failed",
  64. memcpy_async_node->GetName().c_str(), memcpy_async_node->GetName().c_str(),
  65. memcpy_async_node->GetType().c_str());
  66. GELOGE(status, "[Set][StreamLabel] %s to op:%s(%s) failed",
  67. memcpy_async_node->GetName().c_str(), memcpy_async_node->GetName().c_str(),
  68. memcpy_async_node->GetType().c_str());
  69. return status;
  70. }
  71. status = SetStreamLabel(node, node->GetName());
  72. if (status != ge::SUCCESS) {
  73. REPORT_CALL_ERROR("E19999", "Set stream label:%s to op:%s(%s) failed",
  74. node->GetName().c_str(), node->GetName().c_str(), node->GetType().c_str());
  75. GELOGE(status, "[Set][StreamLabel] %s to op:%s(%s) failed",
  76. node->GetName().c_str(), node->GetName().c_str(), node->GetType().c_str());
  77. return status;
  78. }
  79. GELOGI("Set independent loop for iterator node success");
  80. int64_t loop_per_iter = 0;
  81. ge::GeTensorDesc ge_tensor_desc;
  82. status = VarManager::Instance(graph->GetSessionID())->GetCurVarDesc(NODE_NAME_FLOWCTRL_LOOP_PER_ITER,
  83. ge_tensor_desc);
  84. GE_IF_BOOL_EXEC(status != SUCCESS, GELOGW("Fail to Get var_desc of NODE_NAME_FLOWCTRL_LOOP_PER_ITER failed.");
  85. continue);
  86. Status ret;
  87. ret = SetRtContext(graph->GetSessionID(), graph->GetGraphID(), rtContext_t(), RT_CTX_NORMAL_MODE);
  88. // EOS will not be considered if ret is not SUCCESS.
  89. GE_IF_BOOL_EXEC(ret != SUCCESS, GELOGW("Set rt context RT_CTX_NORMAL_MODE failed."); continue);
  90. status = GetVariableValue(graph->GetSessionID(), ge_tensor_desc, NODE_NAME_FLOWCTRL_LOOP_PER_ITER,
  91. &loop_per_iter);
  92. ret = SetRtContext(graph->GetSessionID(), graph->GetGraphID(), rtContext_t(), RT_CTX_GEN_MODE);
  93. // The following process will be affected if ret is not SUCCESS.
  94. GE_IF_BOOL_EXEC(ret != SUCCESS,
  95. GELOGE(ret, "[Set][RtContext] RT_CTX_GEN_MODE failed, session_id:%lu, graph_id:%u.",
  96. graph->GetSessionID(), graph->GetGraphID());
  97. return ret);
  98. GE_IF_BOOL_EXEC(status != SUCCESS, GELOGW("Get variable value of NODE_NAME_FLOWCTRL_LOOP_PER_ITER failed.");
  99. continue);
  100. GELOGI("The value of NODE_NAME_FLOWCTRL_LOOP_PER_ITER is %ld", loop_per_iter);
  101. if (loop_per_iter == kMaxIterationsPerLoop) {
  102. ge::NodePtr end_of_sequence_node = InsertEndOfSequenceNode(node, memcpy_async_node, graph);
  103. GE_CHECK_NOTNULL(end_of_sequence_node);
  104. status = SetStreamLabel(end_of_sequence_node, end_of_sequence_node->GetName());
  105. if (status != ge::SUCCESS) {
  106. REPORT_CALL_ERROR("E19999", "Set stream label:%s to op:%s(%s) failed",
  107. end_of_sequence_node->GetName().c_str(), end_of_sequence_node->GetName().c_str(),
  108. end_of_sequence_node->GetType().c_str());
  109. GELOGE(status, "[Set][StreamLabel] %s to op:%s(%s) failed",
  110. end_of_sequence_node->GetName().c_str(), end_of_sequence_node->GetName().c_str(),
  111. end_of_sequence_node->GetType().c_str());
  112. return status;
  113. }
  114. GELOGI("Insert EndOfSequence node success.");
  115. }
  116. }
  117. GELOGI("GetNextOpPass end");
  118. }
  119. GELOGD("GetNextOpPass end");
  120. return SUCCESS;
  121. }
  122. Status IteratorOpPass::GetVariableValue(uint64_t session_id, const ge::GeTensorDesc &tensor_desc,
  123. const std::string &var_name, void *dest) {
  124. // base_addr
  125. uint8_t *var_mem_base = VarManager::Instance(session_id)->GetVarMemoryBase(RT_MEMORY_HBM);
  126. GE_CHECK_NOTNULL(var_mem_base);
  127. // offset + logic_base
  128. uint8_t *dev_ptr = nullptr;
  129. auto status = VarManager::Instance(session_id)->GetVarAddr(var_name, tensor_desc, &dev_ptr);
  130. if (status != ge::SUCCESS) {
  131. REPORT_CALL_ERROR("E19999", "Get Var add by name:%s failed, session_id:%lu", var_name.c_str(), session_id);
  132. GELOGE(status, "[Get][VarAddr] by name:%s failed, session_id:%lu", var_name.c_str(), session_id);
  133. return status;
  134. }
  135. int64_t offset = static_cast<int64_t>(reinterpret_cast<intptr_t>(dev_ptr));
  136. // logic_base_addr
  137. auto logic_var_base = VarManager::Instance(session_id)->GetVarMemLogicBase();
  138. // devcice_addr
  139. uint8_t *variable_addr = static_cast<uint8_t *>(var_mem_base + offset - logic_var_base);
  140. GE_CHK_RT_RET(rtMemcpy(dest, sizeof(int64_t), variable_addr, sizeof(int64_t), RT_MEMCPY_DEVICE_TO_HOST));
  141. return SUCCESS;
  142. }
  143. ///
  144. /// @brief insert EndOfSequence after GetNext
  145. ///
  146. /// @param pre_node
  147. /// @param graph
  148. /// @return ge::NodePtr
  149. ///
  150. ge::NodePtr IteratorOpPass::InsertEndOfSequenceNode(const ge::NodePtr &pre_node, const ge::NodePtr &memcpy_node,
  151. const ge::ComputeGraphPtr &graph) {
  152. GELOGI("Start to insert EndOfSequence node.");
  153. GE_CHK_BOOL_EXEC(pre_node != nullptr, GELOGW("Pre node is null."); return nullptr);
  154. GE_CHK_BOOL_EXEC(graph != nullptr, GELOGW("graph is null."); return nullptr);
  155. ge::OpDescPtr end_of_seq_op_desc = CreateEndOfSequenceOp(pre_node);
  156. GE_CHK_BOOL_EXEC(end_of_seq_op_desc != nullptr, GELOGW("Create EndOfSequence op fail."); return nullptr);
  157. ge::NodePtr end_of_seq_node = graph->AddNode(end_of_seq_op_desc);
  158. GE_CHK_BOOL_EXEC(end_of_seq_node != nullptr, return nullptr,
  159. "[Add][Node] %s to graph:%s failed.", end_of_seq_op_desc->GetName().c_str(),
  160. graph->GetName().c_str());
  161. // getnext(data) --> EOS
  162. GE_CHK_BOOL_EXEC(pre_node->GetAllOutDataAnchorsSize() != 0, GELOGW("Pre node has no output."); return nullptr);
  163. auto out_anchor = pre_node->GetOutDataAnchor(0);
  164. ge::graphStatus status;
  165. status = GraphUtils::AddEdge(out_anchor, end_of_seq_node->GetInDataAnchor(0));
  166. GE_CHK_BOOL_EXEC(status == GRAPH_SUCCESS,
  167. REPORT_CALL_ERROR("E19999", "Add edge between op:%s(%s)(index:0) and op:%s(%s)(index:0) failed",
  168. pre_node->GetName().c_str(), pre_node->GetType().c_str(),
  169. end_of_seq_node->GetName().c_str(), end_of_seq_node->GetType().c_str());
  170. return nullptr,
  171. "[Add][Edge] between op:%s(%s)(index:0) and op:%s(%s)(index:0) failed",
  172. pre_node->GetName().c_str(), pre_node->GetType().c_str(),
  173. end_of_seq_node->GetName().c_str(), end_of_seq_node->GetType().c_str());
  174. // EOS(control) --> subsequent of memcpy
  175. OutControlAnchorPtr out_ctrl_anchor = end_of_seq_node->GetOutControlAnchor();
  176. GE_CHK_BOOL_EXEC(out_ctrl_anchor != nullptr, GELOGW("out_ctrl_anchor is null."); return nullptr);
  177. // add ctrl edge
  178. for (const auto &out_node : memcpy_node->GetOutNodes()) {
  179. auto in_ctrl_anchor = out_node->GetInControlAnchor();
  180. if (in_ctrl_anchor == nullptr) {
  181. continue;
  182. }
  183. status = GraphUtils::AddEdge(out_ctrl_anchor, in_ctrl_anchor);
  184. GE_CHK_BOOL_EXEC(status == GRAPH_SUCCESS,
  185. REPORT_CALL_ERROR("E19999", "Add control edge between op:%s(%s) and op:%s(%s) failed",
  186. end_of_seq_node->GetName().c_str(), end_of_seq_node->GetType().c_str(),
  187. out_node->GetName().c_str(), out_node->GetType().c_str());
  188. return nullptr,
  189. "[Add][ControlEdge] between op:%s(%s) and op:%s(%s) failed",
  190. end_of_seq_node->GetName().c_str(), end_of_seq_node->GetType().c_str(),
  191. out_node->GetName().c_str(), out_node->GetType().c_str());
  192. GELOGI("Graph add EndOfSequence op out ctrl edge, dst node: %s.",
  193. out_node->GetName().c_str());
  194. }
  195. return end_of_seq_node;
  196. }
  197. ///
  198. /// @brief create EndOfSequence
  199. ///
  200. /// @param pre_node
  201. /// @return ge::OpDescPtr
  202. ///
  203. ge::OpDescPtr IteratorOpPass::CreateEndOfSequenceOp(const ge::NodePtr &pre_node) {
  204. GELOGI("Start to create endOfSequence op.");
  205. GE_CHK_BOOL_EXEC(pre_node != nullptr,
  206. REPORT_INNER_ERROR("E19999", "Param pre_node is nullptr, check invalid");
  207. return nullptr, "[Check][Param] Input param pre_node invalid.");
  208. string node_name = pre_node->GetName() + "_EndOfSequence";
  209. ge::OpDescPtr op_desc = MakeShared<OpDesc>(node_name, ENDOFSEQUENCE);
  210. if (op_desc == nullptr) {
  211. REPORT_CALL_ERROR("E19999", "New OpDesc failed");
  212. GELOGE(FAILED, "[New][OpDesc] failed.");
  213. return op_desc;
  214. }
  215. ge::OpDescPtr pre_node_op_desc = pre_node->GetOpDesc();
  216. GE_CHK_BOOL_EXEC(pre_node_op_desc != nullptr,
  217. REPORT_INNER_ERROR("E19999", "OpDesc in node is nullptr, check invalid");
  218. return nullptr, "[Get][OpDesc] failed, OpDesc of pre_node is invalid.");
  219. GELOGI("Create EndOfSequence op:%s.", op_desc->GetName().c_str());
  220. GE_CHK_BOOL_EXEC(op_desc->AddInputDesc(pre_node_op_desc->GetOutputDesc(0)) == GRAPH_SUCCESS,
  221. REPORT_CALL_ERROR("E19999", "Add input desc to op:%s(%s) failed",
  222. op_desc->GetName().c_str(), op_desc->GetType().c_str());
  223. return nullptr,
  224. "[Add][InputDesc] to op:%s(%s) failed", op_desc->GetName().c_str(), op_desc->GetType().c_str());
  225. return op_desc;
  226. }
  227. ///
  228. /// @brief insert memcpy after GetNext
  229. ///
  230. /// @param pre_node
  231. /// @param graph
  232. /// @return ge::NodePtr
  233. ///
  234. ge::NodePtr IteratorOpPass::InsertMemcpyAsyncNode(const ge::NodePtr &pre_node, const ge::ComputeGraphPtr &graph) {
  235. GE_CHK_BOOL_EXEC(pre_node != nullptr, GELOGW("Pre node is null."); return nullptr);
  236. GE_CHK_BOOL_EXEC(graph != nullptr, GELOGW("graph is null."); return nullptr);
  237. ge::OpDescPtr memcpy_async_op_desc = CreateMemcpyAsyncOp(pre_node);
  238. GE_CHK_BOOL_EXEC(memcpy_async_op_desc != nullptr, GELOGW("Create memcpyAsync op fail."); return nullptr);
  239. ge::NodePtr memcpy_async_node = graph->AddNode(memcpy_async_op_desc);
  240. GE_CHK_BOOL_EXEC(memcpy_async_node != nullptr,
  241. REPORT_CALL_ERROR("E19999", "Add node:%s(%s) to graph:%s failed",
  242. memcpy_async_op_desc->GetName().c_str(), memcpy_async_op_desc->GetType().c_str(),
  243. graph->GetName().c_str());
  244. return nullptr,
  245. "[Add][Node] %s(%s) to graph:%s failed", memcpy_async_op_desc->GetName().c_str(),
  246. memcpy_async_op_desc->GetType().c_str(), graph->GetName().c_str());
  247. // Data out
  248. for (auto &out_anchor : pre_node->GetAllOutDataAnchors()) {
  249. if (out_anchor == nullptr) {
  250. continue;
  251. }
  252. ge::graphStatus status;
  253. GELOGI("Graph add memcpyAsync op in edge, index:%d.", out_anchor->GetIdx());
  254. for (auto &peer_in_anchor : out_anchor->GetPeerInDataAnchors()) {
  255. GE_IF_BOOL_EXEC(peer_in_anchor == nullptr, GELOGW("peer_in_anchor is nullptr"); return nullptr);
  256. status = GraphUtils::RemoveEdge(out_anchor, peer_in_anchor);
  257. GE_CHK_BOOL_EXEC(status == GRAPH_SUCCESS,
  258. REPORT_CALL_ERROR("E19999",
  259. "Remove edge between op:%s(%s)(index:%d) and op:%s(%s)(index:%d) failed",
  260. pre_node->GetName().c_str(),
  261. pre_node->GetType().c_str(), out_anchor->GetIdx(),
  262. peer_in_anchor->GetOwnerNode()->GetName().c_str(),
  263. peer_in_anchor->GetOwnerNode()->GetType().c_str(),
  264. peer_in_anchor->GetIdx());
  265. return nullptr,
  266. "[Remove][Edge] between op:%s(%s)(index:%d) and op:%s(%s)(index:%d) failed",
  267. pre_node->GetName().c_str(), pre_node->GetType().c_str(), out_anchor->GetIdx(),
  268. peer_in_anchor->GetOwnerNode()->GetName().c_str(),
  269. peer_in_anchor->GetOwnerNode()->GetType().c_str(),
  270. peer_in_anchor->GetIdx());
  271. status = GraphUtils::AddEdge(memcpy_async_node->GetOutDataAnchor(out_anchor->GetIdx()), peer_in_anchor);
  272. GE_CHK_BOOL_EXEC(status == GRAPH_SUCCESS,
  273. REPORT_CALL_ERROR("E19999",
  274. "Add edge between op:%s(%s)(index:%d) and op:%s(%s)(index:%d) failed",
  275. memcpy_async_node->GetName().c_str(), memcpy_async_node->GetType().c_str(),
  276. out_anchor->GetIdx(), peer_in_anchor->GetOwnerNode()->GetName().c_str(),
  277. peer_in_anchor->GetOwnerNode()->GetType().c_str(), peer_in_anchor->GetIdx());
  278. return nullptr,
  279. "Add edge between op:%s(%s)(index:%d) and op:%s(%s)(index:%d) failed",
  280. memcpy_async_node->GetName().c_str(), memcpy_async_node->GetType().c_str(),
  281. out_anchor->GetIdx(), peer_in_anchor->GetOwnerNode()->GetName().c_str(),
  282. peer_in_anchor->GetOwnerNode()->GetType().c_str(), peer_in_anchor->GetIdx());
  283. GELOGI("Graph add memcpyAsync op out edge, src index:%d, dst index:%d, dst node: %s.", out_anchor->GetIdx(),
  284. peer_in_anchor->GetIdx(), peer_in_anchor->GetOwnerNode()->GetName().c_str());
  285. }
  286. status = GraphUtils::AddEdge(out_anchor, memcpy_async_node->GetInDataAnchor(out_anchor->GetIdx()));
  287. GE_CHK_BOOL_EXEC(status == GRAPH_SUCCESS,
  288. REPORT_CALL_ERROR("E19999",
  289. "Add edge between op:%s(%s)(index:%d) and op:%s(%s)(index:%d) failed",
  290. pre_node->GetName().c_str(), pre_node->GetType().c_str(), out_anchor->GetIdx(),
  291. memcpy_async_node->GetName().c_str(), memcpy_async_node->GetType().c_str(),
  292. out_anchor->GetIdx());
  293. return nullptr,
  294. "[Add][Edge] between op:%s(%s)(index:%d) and op:%s(%s)(index:%d) failed",
  295. pre_node->GetName().c_str(), pre_node->GetType().c_str(), out_anchor->GetIdx(),
  296. memcpy_async_node->GetName().c_str(), memcpy_async_node->GetType().c_str(),
  297. out_anchor->GetIdx());
  298. }
  299. // Control out
  300. OutControlAnchorPtr out_ctrl_anchor = pre_node->GetOutControlAnchor();
  301. GE_IF_BOOL_EXEC(out_ctrl_anchor != nullptr,
  302. for (auto &peer_in_ctrl_anchor : out_ctrl_anchor->GetPeerInControlAnchors()) {
  303. ge::graphStatus status = GraphUtils::RemoveEdge(out_ctrl_anchor, peer_in_ctrl_anchor);
  304. GE_CHK_BOOL_EXEC(status == GRAPH_SUCCESS,
  305. REPORT_CALL_ERROR("E19999",
  306. "Remove control edge between op:%s(%s) and op:%s(%s) failed",
  307. pre_node->GetName().c_str(), pre_node->GetType().c_str(),
  308. peer_in_ctrl_anchor->GetOwnerNode()->GetName().c_str(),
  309. peer_in_ctrl_anchor->GetOwnerNode()->GetType().c_str());
  310. return nullptr,
  311. "[Remove][ControlEdge] between op:%s(%s) and op:%s(%s) failed",
  312. pre_node->GetName().c_str(), pre_node->GetType().c_str(),
  313. peer_in_ctrl_anchor->GetOwnerNode()->GetName().c_str(),
  314. peer_in_ctrl_anchor->GetOwnerNode()->GetType().c_str());
  315. status = GraphUtils::AddEdge(memcpy_async_node->GetOutControlAnchor(), peer_in_ctrl_anchor);
  316. GE_CHK_BOOL_EXEC(status == GRAPH_SUCCESS,
  317. REPORT_CALL_ERROR("E19999", "Add control edge between op:%s(%s) and op:%s(%s) failed",
  318. memcpy_async_node->GetName().c_str(), memcpy_async_node->GetType().c_str(),
  319. peer_in_ctrl_anchor->GetOwnerNode()->GetName().c_str(),
  320. peer_in_ctrl_anchor->GetOwnerNode()->GetType().c_str());
  321. return nullptr,
  322. "[Add][ControlEdge] between op:%s(%s) and op:%s(%s) failed",
  323. memcpy_async_node->GetName().c_str(), memcpy_async_node->GetType().c_str(),
  324. peer_in_ctrl_anchor->GetOwnerNode()->GetName().c_str(),
  325. peer_in_ctrl_anchor->GetOwnerNode()->GetType().c_str());
  326. GELOGI("Graph add memcpyAsync op out ctrl edge, dst node: %s.",
  327. peer_in_ctrl_anchor->GetOwnerNode()->GetName().c_str());
  328. });
  329. GELOGI("Insert memcpyAsync op success.");
  330. return memcpy_async_node;
  331. }
  332. ///
  333. /// @brief create memcpy
  334. ///
  335. /// @param pre_node
  336. /// @return ge::OpDescPtr
  337. ///
  338. ge::OpDescPtr IteratorOpPass::CreateMemcpyAsyncOp(const ge::NodePtr &pre_node) {
  339. GE_CHK_BOOL_EXEC(pre_node != nullptr, return nullptr, "Input param invalid.");
  340. string node_name = pre_node->GetName() + "_MemcpyAsync";
  341. ge::OpDescPtr op_desc = MakeShared<OpDesc>(node_name.c_str(), MEMCPYASYNC);
  342. if (op_desc == nullptr) {
  343. REPORT_CALL_ERROR("E19999", "New OpDesc failed");
  344. GELOGE(FAILED, "[New][OpDesc] failed");
  345. return op_desc;
  346. }
  347. GELOGI("Create memcpyAsync op:%s.", op_desc->GetName().c_str());
  348. ge::OpDescPtr pre_node_op_desc = pre_node->GetOpDesc();
  349. GE_CHK_BOOL_EXEC(pre_node_op_desc != nullptr,
  350. REPORT_INNER_ERROR("E19999", "OpDesc in node is nullptr, check invalid");
  351. return nullptr, "[Get][OpDesc] failed, OpDesc of pre_node is invalid.");
  352. size_t out_size = pre_node_op_desc->GetOutputsSize();
  353. GELOGI("Create memcpyAsync op, pre_node out_size: %zu.", out_size);
  354. for (size_t i = 0; i < out_size; i++) {
  355. GE_CHK_BOOL_EXEC(op_desc->AddInputDesc(pre_node_op_desc->GetOutputDesc(i)) == GRAPH_SUCCESS,
  356. REPORT_CALL_ERROR("E19999", "Add input desc to op:%s(%s) failed",
  357. pre_node_op_desc->GetName().c_str(), pre_node_op_desc->GetType().c_str());
  358. return nullptr,
  359. "[Add][InputDesc] to op:%s(%s) failed",
  360. pre_node_op_desc->GetName().c_str(), pre_node_op_desc->GetType().c_str());
  361. GE_CHK_BOOL_EXEC(op_desc->AddOutputDesc(pre_node_op_desc->GetOutputDesc(i)) == GRAPH_SUCCESS,
  362. REPORT_CALL_ERROR("E19999", "Add output desc to op:%s(%s) failed",
  363. pre_node_op_desc->GetName().c_str(), pre_node_op_desc->GetType().c_str());
  364. return nullptr,
  365. "[Add][OutputDesc] to op:%s(%s) failed",
  366. pre_node_op_desc->GetName().c_str(), pre_node_op_desc->GetType().c_str());
  367. }
  368. return op_desc;
  369. }
  370. Status IteratorOpPass::SetRtContext(uint64_t session_id, uint32_t graph_id, rtContext_t rt_context, rtCtxMode_t mode) {
  371. GELOGI("set rt_context, session id: %lu, graph id: %u, mode %d, device id:%u.", session_id,
  372. graph_id, static_cast<int>(mode), ge::GetContext().DeviceId());
  373. GE_CHK_RT_RET(rtCtxCreate(&rt_context, mode, ge::GetContext().DeviceId()));
  374. GE_CHK_RT_RET(rtCtxSetCurrent(rt_context));
  375. RtContextUtil::GetInstance().AddRtContext(session_id, graph_id, rt_context);
  376. return SUCCESS;
  377. }
  378. } // namespace ge

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