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

5 years ago
5 years ago
5 years ago
5 years ago
5 years ago
4 years ago
4 years ago
5 years ago
5 years ago
4 years ago
4 years ago
5 years ago
4 years ago
5 years ago
5 years ago
4 years ago
5 years ago
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294
  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 "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 "graph/common/omg_util.h"
  27. #include "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. GE_CHK_STATUS_RET(SetCycleEvent(memcpy_async_node), "Set cycle event fail, node:%s",
  54. memcpy_async_node->GetName().c_str());
  55. GE_CHK_STATUS_RET(SetStreamLabel(memcpy_async_node, memcpy_async_node->GetName()),
  56. "Set stream label fail, node:%s", node->GetName().c_str());
  57. GE_CHK_STATUS_RET(SetStreamLabel(node, node->GetName()), "Set stream label fail, node:%s",
  58. node->GetName().c_str());
  59. GELOGI("Set independent loop for iterator node success");
  60. int64_t loop_per_iter = 0;
  61. ge::GeTensorDesc ge_tensor_desc;
  62. Status status = VarManager::Instance(graph->GetSessionID())->GetCurVarDesc(NODE_NAME_FLOWCTRL_LOOP_PER_ITER,
  63. ge_tensor_desc);
  64. GE_IF_BOOL_EXEC(status != SUCCESS, GELOGW("Fail to Get var_desc of NODE_NAME_FLOWCTRL_LOOP_PER_ITER failed.");
  65. continue);
  66. Status ret;
  67. ret = SetRtContext(graph->GetSessionID(), graph->GetGraphID(), rtContext_t(), RT_CTX_NORMAL_MODE);
  68. // EOS will not be considered if ret is not SUCCESS.
  69. GE_IF_BOOL_EXEC(ret != SUCCESS, GELOGW("Set rt context RT_CTX_NORMAL_MODE failed."); continue);
  70. status = GetVariableValue(graph->GetSessionID(), ge_tensor_desc, NODE_NAME_FLOWCTRL_LOOP_PER_ITER,
  71. &loop_per_iter);
  72. ret = SetRtContext(graph->GetSessionID(), graph->GetGraphID(), rtContext_t(), RT_CTX_GEN_MODE);
  73. // The following process will be affected if ret is not SUCCESS.
  74. GE_IF_BOOL_EXEC(ret != SUCCESS, GELOGE(ret, "Set rt context RT_CTX_GEN_MODE failed."); return ret);
  75. GE_IF_BOOL_EXEC(status != SUCCESS, GELOGW("Get variable value of NODE_NAME_FLOWCTRL_LOOP_PER_ITER failed.");
  76. continue);
  77. GELOGI("The value of NODE_NAME_FLOWCTRL_LOOP_PER_ITER is %ld", loop_per_iter);
  78. if (loop_per_iter == kMaxIterationsPerLoop) {
  79. ge::NodePtr end_of_sequence_node = InsertEndOfSequenceNode(node, memcpy_async_node, graph);
  80. GE_CHECK_NOTNULL(end_of_sequence_node);
  81. GE_CHK_STATUS_RET(SetStreamLabel(end_of_sequence_node, end_of_sequence_node->GetName()),
  82. "Set stream label fail, node:%s", node->GetName().c_str());
  83. GELOGI("Insert EndOfSequence node success.");
  84. }
  85. }
  86. GELOGI("GetNextOpPass end");
  87. }
  88. GELOGD("GetNextOpPass end");
  89. return SUCCESS;
  90. }
  91. Status IteratorOpPass::GetVariableValue(uint64_t session_id, const ge::GeTensorDesc &tensor_desc,
  92. const std::string &var_name, void *dest) {
  93. // base_addr
  94. uint8_t *var_mem_base = VarManager::Instance(session_id)->GetVarMemoryBase(RT_MEMORY_HBM);
  95. GE_CHECK_NOTNULL(var_mem_base);
  96. // offset + logic_base
  97. uint8_t *dev_ptr = nullptr;
  98. GE_CHK_STATUS_RET(VarManager::Instance(session_id)->GetVarAddr(var_name, tensor_desc, &dev_ptr),
  99. "Get variable %s address failed.", var_name.c_str());
  100. int64_t offset = static_cast<int64_t>(reinterpret_cast<intptr_t>(dev_ptr));
  101. // logic_base_addr
  102. auto logic_var_base = VarManager::Instance(session_id)->GetVarMemLogicBase();
  103. // devcice_addr
  104. uint8_t *variable_addr = static_cast<uint8_t *>(var_mem_base + offset - logic_var_base);
  105. GE_CHK_RT_RET(rtMemcpy(dest, sizeof(int64_t), variable_addr, sizeof(int64_t), RT_MEMCPY_DEVICE_TO_HOST));
  106. return SUCCESS;
  107. }
  108. ///
  109. /// @brief insert EndOfSequence after GetNext
  110. ///
  111. /// @param pre_node
  112. /// @param graph
  113. /// @return ge::NodePtr
  114. ///
  115. ge::NodePtr IteratorOpPass::InsertEndOfSequenceNode(const ge::NodePtr &pre_node, const ge::NodePtr &memcpy_node,
  116. const ge::ComputeGraphPtr &graph) {
  117. GELOGI("Start to insert EndOfSequence node.");
  118. GE_CHK_BOOL_EXEC(pre_node != nullptr, GELOGW("Pre node is null."); return nullptr);
  119. GE_CHK_BOOL_EXEC(graph != nullptr, GELOGW("graph is null."); return nullptr);
  120. ge::OpDescPtr end_of_seq_op_desc = CreateEndOfSequenceOp(pre_node);
  121. GE_CHK_BOOL_EXEC(end_of_seq_op_desc != nullptr, GELOGW("Create EndOfSequence op fail."); return nullptr);
  122. ge::NodePtr end_of_seq_node = graph->AddNode(end_of_seq_op_desc);
  123. GE_CHK_BOOL_EXEC(end_of_seq_node != nullptr, return nullptr, "Insert EndOfSequence node fail.");
  124. // getnext(data) --> EOS
  125. GE_CHK_BOOL_EXEC(pre_node->GetAllOutDataAnchorsSize() != 0, GELOGW("Pre node has no output."); return nullptr);
  126. auto out_anchor = pre_node->GetOutDataAnchor(0);
  127. ge::graphStatus status;
  128. status = GraphUtils::AddEdge(out_anchor, end_of_seq_node->GetInDataAnchor(0));
  129. GE_CHK_BOOL_EXEC(status == GRAPH_SUCCESS, return nullptr,
  130. "Graph add EndOfSequence op input edge fail, dst node: %s.",
  131. end_of_seq_node->GetName().c_str());
  132. // EOS(control) --> subsequent of memcpy
  133. OutControlAnchorPtr out_ctrl_anchor = end_of_seq_node->GetOutControlAnchor();
  134. GE_CHK_BOOL_EXEC(out_ctrl_anchor != nullptr, GELOGW("out_ctrl_anchor is null."); return nullptr);
  135. // add ctrl edge
  136. for (const auto &out_node : memcpy_node->GetOutNodes()) {
  137. auto in_ctrl_anchor = out_node->GetInControlAnchor();
  138. if (in_ctrl_anchor == nullptr) {
  139. continue;
  140. }
  141. status = GraphUtils::AddEdge(out_ctrl_anchor, in_ctrl_anchor);
  142. GE_CHK_BOOL_EXEC(status == GRAPH_SUCCESS, return nullptr,
  143. "Graph add EndOfSequence op out ctrl edge fail, dst node: %s.",
  144. out_node->GetName().c_str());
  145. GELOGI("Graph add EndOfSequence op out ctrl edge, dst node: %s.",
  146. out_node->GetName().c_str());
  147. }
  148. return end_of_seq_node;
  149. }
  150. ///
  151. /// @brief create EndOfSequence
  152. ///
  153. /// @param pre_node
  154. /// @return ge::OpDescPtr
  155. ///
  156. ge::OpDescPtr IteratorOpPass::CreateEndOfSequenceOp(const ge::NodePtr &pre_node) {
  157. GELOGI("Start to create endOfSequence op.");
  158. GE_CHK_BOOL_EXEC(pre_node != nullptr, return nullptr, "Input param invalid.");
  159. string node_name = pre_node->GetName() + "_EndOfSequence";
  160. ge::OpDescPtr op_desc = MakeShared<OpDesc>(node_name, ENDOFSEQUENCE);
  161. if (op_desc == nullptr) {
  162. GELOGE(FAILED, "MakeShared fail.");
  163. return op_desc;
  164. }
  165. ge::OpDescPtr pre_node_op_desc = pre_node->GetOpDesc();
  166. GE_CHK_BOOL_EXEC(pre_node_op_desc != nullptr, return nullptr, "OpDesc of pre_node is invalid.");
  167. GELOGI("Create EndOfSequence op:%s.", op_desc->GetName().c_str());
  168. GE_CHK_BOOL_EXEC(op_desc->AddInputDesc(pre_node_op_desc->GetOutputDesc(0)) == GRAPH_SUCCESS, return nullptr,
  169. "Create EndOfSequence op:add input desc fail.");
  170. return op_desc;
  171. }
  172. ///
  173. /// @brief insert memcpy after GetNext
  174. ///
  175. /// @param pre_node
  176. /// @param graph
  177. /// @return ge::NodePtr
  178. ///
  179. ge::NodePtr IteratorOpPass::InsertMemcpyAsyncNode(const ge::NodePtr &pre_node, const ge::ComputeGraphPtr &graph) {
  180. GE_CHK_BOOL_EXEC(pre_node != nullptr, GELOGW("Pre node is null."); return nullptr);
  181. GE_CHK_BOOL_EXEC(graph != nullptr, GELOGW("graph is null."); return nullptr);
  182. ge::OpDescPtr memcpy_async_op_desc = CreateMemcpyAsyncOp(pre_node);
  183. GE_CHK_BOOL_EXEC(memcpy_async_op_desc != nullptr, GELOGW("Create memcpyAsync op fail."); return nullptr);
  184. ge::NodePtr memcpy_async_node = graph->AddNode(memcpy_async_op_desc);
  185. GE_CHK_BOOL_EXEC(memcpy_async_node != nullptr, return nullptr, "Insert mencpy node fail.");
  186. // Data out
  187. for (auto &out_anchor : pre_node->GetAllOutDataAnchors()) {
  188. if (out_anchor == nullptr) {
  189. continue;
  190. }
  191. ge::graphStatus status;
  192. GELOGI("Graph add memcpyAsync op in edge, index:%d.", out_anchor->GetIdx());
  193. for (auto &peer_in_anchor : out_anchor->GetPeerInDataAnchors()) {
  194. GE_IF_BOOL_EXEC(peer_in_anchor == nullptr, GELOGW("peer_in_anchor is nullptr"); return nullptr);
  195. status = GraphUtils::RemoveEdge(out_anchor, peer_in_anchor);
  196. GE_CHK_BOOL_EXEC(status == GRAPH_SUCCESS, return nullptr, "Remove edge failed, index:%d.", out_anchor->GetIdx());
  197. status = GraphUtils::AddEdge(memcpy_async_node->GetOutDataAnchor(out_anchor->GetIdx()), peer_in_anchor);
  198. GE_CHK_BOOL_EXEC(status == GRAPH_SUCCESS, return nullptr,
  199. "Graph add memcpyAsync op out edge fail, src index:%d, dst index:%d, dst node: %s.",
  200. out_anchor->GetIdx(), peer_in_anchor->GetIdx(),
  201. peer_in_anchor->GetOwnerNode()->GetName().c_str());
  202. GELOGI("Graph add memcpyAsync op out edge, src index:%d, dst index:%d, dst node: %s.", out_anchor->GetIdx(),
  203. peer_in_anchor->GetIdx(), peer_in_anchor->GetOwnerNode()->GetName().c_str());
  204. }
  205. status = GraphUtils::AddEdge(out_anchor, memcpy_async_node->GetInDataAnchor(out_anchor->GetIdx()));
  206. GE_CHK_BOOL_EXEC(status == GRAPH_SUCCESS, return nullptr, "Graph add memcpyAsync op in edge fail, index:%d.",
  207. out_anchor->GetIdx());
  208. }
  209. // Control out
  210. OutControlAnchorPtr out_ctrl_anchor = pre_node->GetOutControlAnchor();
  211. GE_IF_BOOL_EXEC(out_ctrl_anchor != nullptr,
  212. for (auto &peer_in_ctrl_anchor : out_ctrl_anchor->GetPeerInControlAnchors()) {
  213. ge::graphStatus status = GraphUtils::RemoveEdge(out_ctrl_anchor, peer_in_ctrl_anchor);
  214. GE_CHK_BOOL_EXEC(status == GRAPH_SUCCESS, return nullptr, "Remove edge failed, dst node: %s.",
  215. peer_in_ctrl_anchor->GetOwnerNode()->GetName().c_str());
  216. status = GraphUtils::AddEdge(memcpy_async_node->GetOutControlAnchor(), peer_in_ctrl_anchor);
  217. GE_CHK_BOOL_EXEC(status == GRAPH_SUCCESS, return nullptr,
  218. "Graph add memcpyAsync op out ctrl edge fail, dst node: %s.",
  219. peer_in_ctrl_anchor->GetOwnerNode()->GetName().c_str());
  220. GELOGI("Graph add memcpyAsync op out ctrl edge, dst node: %s.",
  221. peer_in_ctrl_anchor->GetOwnerNode()->GetName().c_str());
  222. });
  223. GELOGI("Insert memcpyAsync op success.");
  224. return memcpy_async_node;
  225. }
  226. ///
  227. /// @brief create memcpy
  228. ///
  229. /// @param pre_node
  230. /// @return ge::OpDescPtr
  231. ///
  232. ge::OpDescPtr IteratorOpPass::CreateMemcpyAsyncOp(const ge::NodePtr &pre_node) {
  233. GE_CHK_BOOL_EXEC(pre_node != nullptr, return nullptr, "Input param invalid.");
  234. string node_name = pre_node->GetName() + "_MemcpyAsync";
  235. ge::OpDescPtr op_desc = MakeShared<OpDesc>(node_name.c_str(), MEMCPYASYNC);
  236. if (op_desc == nullptr) {
  237. GELOGE(FAILED, "MakeShared fail.");
  238. return op_desc;
  239. }
  240. GELOGI("Create memcpyAsync op:%s.", op_desc->GetName().c_str());
  241. ge::OpDescPtr pre_node_op_desc = pre_node->GetOpDesc();
  242. GE_CHK_BOOL_EXEC(pre_node_op_desc != nullptr, return nullptr, "OpDesc of pre_node is invalid.");
  243. size_t out_size = pre_node_op_desc->GetOutputsSize();
  244. GELOGI("Create memcpyAsync op, pre_node out_size: %zu.", out_size);
  245. for (size_t i = 0; i < out_size; i++) {
  246. GE_CHK_BOOL_EXEC(op_desc->AddInputDesc(pre_node_op_desc->GetOutputDesc(i)) == GRAPH_SUCCESS, return nullptr,
  247. "Create memcpyAsync op:add input desc fail.");
  248. GE_CHK_BOOL_EXEC(op_desc->AddOutputDesc(pre_node_op_desc->GetOutputDesc(i)) == GRAPH_SUCCESS, return nullptr,
  249. "Create memcpyAsync op:add output desc fail.");
  250. }
  251. return op_desc;
  252. }
  253. Status IteratorOpPass::SetRtContext(uint64_t session_id, uint32_t graph_id, rtContext_t rt_context, rtCtxMode_t mode) {
  254. GELOGI("set rt_context, session id: %lu, graph id: %u, mode %d, device id:%u.", session_id,
  255. graph_id, static_cast<int>(mode), ge::GetContext().DeviceId());
  256. GE_CHK_RT_RET(rtCtxCreate(&rt_context, mode, ge::GetContext().DeviceId()));
  257. GE_CHK_RT_RET(rtCtxSetCurrent(rt_context));
  258. RtContextUtil::GetInstance().AddRtContext(session_id, graph_id, rt_context);
  259. return SUCCESS;
  260. }
  261. } // namespace ge

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